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 328dc9f..0000000 --- a/.github/.keepalive +++ /dev/null @@ -1 +0,0 @@ -2026-08-20T03:11:33.519Z diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md deleted file mode 100644 index 94083bc..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/random/tools/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 1bbeb9f..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/random/tools/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 fb85afa..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: '17 17 * * 5' - - # 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 Random = require( '@stdlib/random-tools-binary' ); +If no recognized module system is present, access bundle contents via the global scope: + +```html + ``` #### Random( prng, idtypes, odtypes, policies\[, options] ) @@ -238,12 +244,17 @@ The method has the following parameters: -```javascript -var uniform = require( '@stdlib/random-base-uniform' ); -var dtypes = require( '@stdlib/ndarray-dtypes' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var ndarray2array = require( '@stdlib/ndarray-to-array' ); -var Random = require( '@stdlib/random-tools-binary' ); +```html + + + + + + + + + + + ```
@@ -364,11 +380,11 @@ Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors]. [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/random-tools-binary/main/LICENSE -[@stdlib/ndarray/policies]: https://github.com/stdlib-js/ndarray-policies +[@stdlib/ndarray/policies]: https://github.com/stdlib-js/ndarray-policies/tree/umd -[@stdlib/ndarray/orders]: https://github.com/stdlib-js/ndarray-orders +[@stdlib/ndarray/orders]: https://github.com/stdlib-js/ndarray-orders/tree/umd -[@stdlib/ndarray/base/broadcast-shapes]: https://github.com/stdlib-js/ndarray-base-broadcast-shapes +[@stdlib/ndarray/base/broadcast-shapes]: https://github.com/stdlib-js/ndarray-base-broadcast-shapes/tree/umd
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.assign.js b/benchmark/benchmark.assign.js deleted file mode 100644 index 4ac2fd4..0000000 --- a/benchmark/benchmark.assign.js +++ /dev/null @@ -1,113 +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 isnan = require( '@stdlib/math-base-assert-is-nan' ); -var pow = require( '@stdlib/math-base-special-pow' ); -var dtypes = require( '@stdlib/ndarray-dtypes' ); -var uniform = require( '@stdlib/random-base-uniform' ); -var zeros = require( '@stdlib/ndarray-zeros' ); -var format = require( '@stdlib/string-format' ); -var pkg = require( './../package.json' ).name; -var Random = require( './../lib' ); - - -// FUNCTIONS // - -/** -* Creates a benchmark function. -* -* @private -* @param {PositiveInteger} len - array length -* @returns {Function} benchmark function -*/ -function createBenchmark( len ) { - var policies; - var random; - var out; - var dt; - - dt = dtypes( 'real_floating_point' ); - policies = { - 'output': 'real_floating_point', - 'casting': 'none' - }; - random = new Random( uniform, [ dt, dt ], dt, policies ); - - out = zeros( [ len ], { - 'dtype': 'float64' - }); - - return benchmark; - - /** - * Benchmark function. - * - * @private - * @param {Benchmark} b - benchmark instance - */ - function benchmark( b ) { - var o; - var i; - - b.tic(); - for ( i = 0; i < b.iterations; i++ ) { - o = random.assign( 0.0, 1.0, out ); - if ( typeof o !== 'object' ) { - b.fail( 'should return an ndarray' ); - } - } - b.toc(); - if ( isnan( o.get( 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 f; - var i; - - min = 1; // 10^min - max = 6; // 10^max - - for ( i = min; i <= max; i++ ) { - len = pow( 10, i ); - f = createBenchmark( len ); - bench( format( '%s:assign:len=%d', pkg, len ), f ); - } -} - -main(); diff --git a/benchmark/benchmark.generate.js b/benchmark/benchmark.generate.js deleted file mode 100644 index 11731e8..0000000 --- a/benchmark/benchmark.generate.js +++ /dev/null @@ -1,107 +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 isnan = require( '@stdlib/math-base-assert-is-nan' ); -var pow = require( '@stdlib/math-base-special-pow' ); -var dtypes = require( '@stdlib/ndarray-dtypes' ); -var uniform = require( '@stdlib/random-base-uniform' ); -var format = require( '@stdlib/string-format' ); -var pkg = require( './../package.json' ).name; -var Random = require( './../lib' ); - - -// FUNCTIONS // - -/** -* Creates a benchmark function. -* -* @private -* @param {PositiveInteger} len - array length -* @returns {Function} benchmark function -*/ -function createBenchmark( len ) { - var policies; - var random; - var dt; - - dt = dtypes( 'real_floating_point' ); - policies = { - 'output': 'real_floating_point', - 'casting': 'none' - }; - random = new Random( uniform, [ dt, dt ], dt, policies ); - - return benchmark; - - /** - * Benchmark function. - * - * @private - * @param {Benchmark} b - benchmark instance - */ - function benchmark( b ) { - var o; - var i; - - b.tic(); - for ( i = 0; i < b.iterations; i++ ) { - o = random.generate( [ len ], 0.0, 1.0 ); - if ( typeof o !== 'object' ) { - b.fail( 'should return an ndarray' ); - } - } - b.toc(); - if ( isnan( o.get( 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 f; - var i; - - min = 1; // 10^min - max = 6; // 10^max - - for ( i = min; i <= max; i++ ) { - len = pow( 10, i ); - f = createBenchmark( len ); - bench( format( '%s:generate:len=%d', pkg, len ), f ); - } -} - -main(); diff --git a/benchmark/benchmark.js b/benchmark/benchmark.js deleted file mode 100644 index 750816d..0000000 --- a/benchmark/benchmark.js +++ /dev/null @@ -1,59 +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 uniform = require( '@stdlib/random-base-uniform' ); -var format = require( '@stdlib/string-format' ); -var pkg = require( './../package.json' ).name; -var Random = require( './../lib' ); - - -// MAIN // - -bench( format( '%s::instantiation', pkg ), function benchmark( b ) { - var policies; - var dtypes; - var v; - var i; - - dtypes = [ - 'float64', - 'float32' - ]; - policies = { - 'output': 'real_floating_point' - }; - - b.tic(); - for ( i = 0; i < b.iterations; i++ ) { - v = new Random( uniform, [ dtypes, dtypes ], dtypes, policies ); - if ( typeof v !== 'object' ) { - b.fail( 'should return an object' ); - } - } - b.toc(); - if ( typeof v !== 'object' ) { - b.fail( 'should return an object' ); - } - b.pass( 'benchmark finished' ); - b.end(); -}); diff --git a/branches.md b/branches.md deleted file mode 100644 index eaee00f..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/random/tools/binary" -%% click B href "https://github.com/stdlib-js/random-tools-binary/tree/main" -%% click C href "https://github.com/stdlib-js/random-tools-binary/tree/production" -%% click D href "https://github.com/stdlib-js/random-tools-binary/tree/esm" -%% click E href "https://github.com/stdlib-js/random-tools-binary/tree/deno" -%% click F href "https://github.com/stdlib-js/random-tools-binary/tree/umd" -``` - -[stdlib-url]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/random/tools/binary -[production-url]: https://github.com/stdlib-js/random-tools-binary/tree/production -[deno-url]: https://github.com/stdlib-js/random-tools-binary/tree/deno -[deno-readme]: https://github.com/stdlib-js/random-tools-binary/blob/deno/README.md -[umd-url]: https://github.com/stdlib-js/random-tools-binary/tree/umd -[umd-readme]: https://github.com/stdlib-js/random-tools-binary/blob/umd/README.md -[esm-url]: https://github.com/stdlib-js/random-tools-binary/tree/esm -[esm-readme]: https://github.com/stdlib-js/random-tools-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..4074e9d --- /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 +!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e():"function"==typeof define&&define.amd?define(e):(t="undefined"!=typeof globalThis?globalThis:t||self).Random=e()}(this,(function(){"use strict";var t="function"==typeof Object.defineProperty?Object.defineProperty:null;var e=Object.defineProperty;function n(t){return"number"==typeof t}function r(t){var e,n="";for(e=0;e0&&(n-=1),r=t.toExponential(n)):r=t.toPrecision(e.precision),e.alternate||(r=c.call(r,v,"$1e"),r=c.call(r,m,"e"),r=c.call(r,y,""));break;default:throw new Error("invalid double notation. Value: "+e.specifier)}return r=c.call(r,h,"e+0$1"),r=c.call(r,p,"e-0$1"),e.alternate&&(r=c.call(r,g,"$1."),r=c.call(r,d,"$1.e")),t>=0&&e.sign&&(r=e.sign+r),r=e.specifier===l.call(e.specifier)?l.call(r):s.call(r)}function w(t){var e,n="";for(e=0;e127)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(e||(o.precision=6),c=parseFloat(o.arg),!isFinite(c)){if(!n(o.arg))throw new Error("invalid floating-point number. Value: "+s);c=o.arg,o.padZeros=!1}o.arg=b(c,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=(g=o.arg,d=o.width,y=o.padRight,m=void 0,(m=d-g.length)<0?g:g=y?g+w(m):w(m)+g)),s+=o.arg||"",l+=1}return s}var O=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function V(t){var e={mapping:t[1]?parseInt(t[1],10):void 0,flags:t[2],width:t[3],precision:t[5],specifier:t[6]};return"."===t[4]&&void 0===t[5]&&(e.precision="1"),e}function S(t){var e,n,r,i;for(n=[],i=0,r=O.exec(t);r;)(e=t.slice(i,O.lastIndex-r[0].length)).length&&n.push(e),"%"===r[6]?n.push("%"):n.push(V(r)),i=O.lastIndex,r=O.exec(t);return(e=t.slice(i)).length&&n.push(e),n}function j(t){var e,n;if("string"!=typeof t)throw new TypeError(j("invalid argument. First argument must be a string. Value: `%s`.",t));for(e=[S(t)],n=1;ntt&&nt(t)}function it(t){return N(t)&&rt(t)}function ot(t){return X(t)&&rt(t.valueOf())}function at(t){return it(t)||ot(t)}function ut(t){return it(t)&&t>=0}function ft(t){return ot(t)&&t.valueOf()>=0}function st(t){return ut(t)||ft(t)}M(at,"isPrimitive",it),M(at,"isObject",ot),M(st,"isPrimitive",ut),M(st,"isObject",ft);var lt=4294967295;function ct(t){if("function"!=typeof t)throw new TypeError(j("invalid argument. Must provide a function. Value: `%s`.",t));return function(e){var n,r;if(!function(t){return null!=t&&"function"!=typeof t&&"number"==typeof t.length&&nt(t.length)&&t.length>=0&&t.length<=lt}(e))return!1;if(0===(n=e.length))return!1;for(r=0;r0}function Ft(t){return ot(t)&&t.valueOf()>0}function Ut(t){return Bt(t)||Ft(t)}function Pt(t){return Object.keys(Object(t))}M(It,"isPrimitive",St),M(It,"isObject",Lt),M(Ut,"isPrimitive",Bt),M(Ut,"isObject",Ft);var kt,Mt=void 0!==Object.keys;function Nt(t){return"[object Arguments]"===G(t)}kt=function(){return Nt(arguments)}();var Ct=kt;function Yt(t){return t!=t}function Dt(t){return N(t)&&Yt(t)}function zt(t){return X(t)&&Yt(t.valueOf())}function Jt(t){return Dt(t)||zt(t)}M(Jt,"isPrimitive",Dt),M(Jt,"isObject",zt);var Wt=Object.prototype.propertyIsEnumerable;var $t=!Wt.call("beep","0");function Gt(t,e){var n;return null!=t&&(!(n=Wt.call(t,e))&&$t&&It(t)?!Dt(e=+e)&&it(e)&&e>=0&&e=0&&t.length<=qt&&J(t,"callee")&&!Gt(t,"callee")},Xt=Array.prototype.slice;function Ht(t){if("function"!=typeof t)throw new TypeError(j("invalid argument. Must provide a function. Value: `%s`.",t));return function(e){var n,r;if(!Zt(e))return!1;if(0===(n=e.length))return!1;for(r=0;r=0&&t.length<=ne}function ie(t,e,n){var r,i;if(!re(t)&&!St(t))throw new TypeError(j("invalid argument. First argument must be an array-like object. Value: `%s`.",t));if(0===(r=t.length))return-1;if(3===arguments.length){if(!it(n))throw new TypeError(j("invalid argument. Third argument must be an integer. Value: `%s`.",n));if(n>=0){if(n>=r)return-1;i=n}else(i=r+n)<0&&(i=0)}else i=0;if(Jt(e)){for(;i0&&!J(t,"0"))for(u=0;u1){if(!Re(e))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",e));if(J(e,"duplicates")&&!dt(s=e.duplicates))throw new TypeError(j("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",s))}if(r=(n=_e(t)).length,a={},s)for(f=0;fi&&(r=!1),!r&&!e)return 0;i=o}return r&&e?3:r?1:2}var Me="function";function Ne(t){return typeof t.get===Me&&typeof t.set===Me}var Ce={float64:function(t,e){return t[e]},float32:function(t,e){return t[e]},int32:function(t,e){return t[e]},int16:function(t,e){return t[e]},int8:function(t,e){return t[e]},uint32:function(t,e){return t[e]},uint16:function(t,e){return t[e]},uint8:function(t,e){return t[e]},uint8c:function(t,e){return t[e]},generic:function(t,e){return t[e]},default:function(t,e){return t[e]}};function Ye(t){var e=Ce[t];return"function"==typeof e?e:Ce.default}var De={float64:function(t,e,n){t[e]=n},float32:function(t,e,n){t[e]=n},int32:function(t,e,n){t[e]=n},int16:function(t,e,n){t[e]=n},int8:function(t,e,n){t[e]=n},uint32:function(t,e,n){t[e]=n},uint16:function(t,e,n){t[e]=n},uint8:function(t,e,n){t[e]=n},uint8c:function(t,e,n){t[e]=n},generic:function(t,e,n){t[e]=n},default:function(t,e,n){t[e]=n}};function ze(t){var e=De[t];return"function"==typeof e?e:De.default}var Je={complex128:function(t,e){return t.get(e)},complex64:function(t,e){return t.get(e)},default:function(t,e){return t.get(e)}};function We(t){var e=Je[t];return"function"==typeof e?e:Je.default}var $e={complex128:function(t,e,n){t.set(n,e)},complex64:function(t,e,n){t.set(n,e)},default:function(t,e,n){t.set(n,e)}};function Ge(t){var e=$e[t];return"function"==typeof e?e:$e.default}var Ze={Float32Array:"float32",Float64Array:"float64",Array:"generic",Int16Array:"int16",Int32Array:"int32",Int8Array:"int8",Uint16Array:"uint16",Uint32Array:"uint32",Uint8Array:"uint8",Uint8ClampedArray:"uint8c",Complex64Array:"complex64",Complex128Array:"complex128",BooleanArray:"bool"},qe="function"==typeof Float64Array;var Ke="function"==typeof Float64Array?Float64Array:null;function Xe(){var t,e,n;if("function"!=typeof Ke)return!1;try{e=new Ke([1,3.14,-3.14,NaN]),n=e,t=(qe&&n instanceof Float64Array||"[object Float64Array]"===G(n))&&1===e[0]&&3.14===e[1]&&-3.14===e[2]&&e[3]!=e[3]}catch(e){t=!1}return t}var He="function"==typeof Float64Array?Float64Array:void 0;var Qe=Xe()?He:function(){throw new Error("not implemented")},tn="function"==typeof Float32Array;var en="function"==typeof Float32Array?Float32Array:null;var nn,rn="function"==typeof Float32Array?Float32Array:void 0;nn=function(){var t,e,n;if("function"!=typeof en)return!1;try{e=new en([1,3.14,-3.14,5e40]),n=e,t=(tn&&n instanceof Float32Array||"[object Float32Array]"===G(n))&&1===e[0]&&3.140000104904175===e[1]&&-3.140000104904175===e[2]&&e[3]===Q}catch(e){t=!1}return t}()?rn:function(){throw new Error("not implemented")};var on=nn,an="function"==typeof Uint32Array;var un="function"==typeof Uint32Array?Uint32Array:null;var fn,sn="function"==typeof Uint32Array?Uint32Array:void 0;fn=function(){var t,e,n;if("function"!=typeof un)return!1;try{e=new un(e=[1,3.14,-3.14,qt+1,qt+2]),n=e,t=(an&&n instanceof Uint32Array||"[object Uint32Array]"===G(n))&&1===e[0]&&3===e[1]&&e[2]===qt-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?sn:function(){throw new Error("not implemented")};var ln=fn,cn="function"==typeof Int32Array;var hn=2147483647,pn=-2147483648,gn="function"==typeof Int32Array?Int32Array:null;var dn,yn="function"==typeof Int32Array?Int32Array:void 0;dn=function(){var t,e,n;if("function"!=typeof gn)return!1;try{e=new gn([1,3.14,-3.14,hn+1]),n=e,t=(cn&&n instanceof Int32Array||"[object Int32Array]"===G(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===pn}catch(e){t=!1}return t}()?yn:function(){throw new Error("not implemented")};var mn=dn,vn="function"==typeof Uint16Array;var bn=65535,wn="function"==typeof Uint16Array?Uint16Array:null;var _n,En="function"==typeof Uint16Array?Uint16Array:void 0;_n=function(){var t,e,n;if("function"!=typeof wn)return!1;try{e=new wn(e=[1,3.14,-3.14,bn+1,bn+2]),n=e,t=(vn&&n instanceof Uint16Array||"[object Uint16Array]"===G(n))&&1===e[0]&&3===e[1]&&e[2]===bn-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?En:function(){throw new Error("not implemented")};var xn=_n,Tn="function"==typeof Int16Array;var An=32767,On=-32768,Vn="function"==typeof Int16Array?Int16Array:null;var Sn,jn="function"==typeof Int16Array?Int16Array:void 0;Sn=function(){var t,e,n;if("function"!=typeof Vn)return!1;try{e=new Vn([1,3.14,-3.14,An+1]),n=e,t=(Tn&&n instanceof Int16Array||"[object Int16Array]"===G(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===On}catch(e){t=!1}return t}()?jn:function(){throw new Error("not implemented")};var Rn=Sn,Ln="function"==typeof Uint8Array;var In=255,Bn="function"==typeof Uint8Array?Uint8Array:null;var Fn,Un="function"==typeof Uint8Array?Uint8Array:void 0;Fn=function(){var t,e,n;if("function"!=typeof Bn)return!1;try{e=new Bn(e=[1,3.14,-3.14,In+1,In+2]),n=e,t=(Ln&&n instanceof Uint8Array||"[object Uint8Array]"===G(n))&&1===e[0]&&3===e[1]&&e[2]===In-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?Un:function(){throw new Error("not implemented")};var Pn=Fn,kn="function"==typeof Uint8ClampedArray;var Mn="function"==typeof Uint8ClampedArray?Uint8ClampedArray:null;var Nn,Cn="function"==typeof Uint8ClampedArray?Uint8ClampedArray:void 0;Nn=function(){var t,e,n;if("function"!=typeof Mn)return!1;try{e=new Mn([-1,0,1,3.14,4.99,255,256]),n=e,t=(kn&&n instanceof Uint8ClampedArray||"[object Uint8ClampedArray]"===G(n))&&0===e[0]&&0===e[1]&&1===e[2]&&3===e[3]&&5===e[4]&&255===e[5]&&255===e[6]}catch(e){t=!1}return t}()?Cn:function(){throw new Error("not implemented")};var Yn=Nn,Dn="function"==typeof Int8Array;var zn=127,Jn=-128,Wn="function"==typeof Int8Array?Int8Array:null;var $n,Gn="function"==typeof Int8Array?Int8Array:void 0;$n=function(){var t,e,n;if("function"!=typeof Wn)return!1;try{e=new Wn([1,3.14,-3.14,zn+1]),n=e,t=(Dn&&n instanceof Int8Array||"[object Int8Array]"===G(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===Jn}catch(e){t=!1}return t}()?Gn:function(){throw new Error("not implemented")};var Zn=$n;function qn(t){return"object"==typeof t&&null!==t&&"number"==typeof t.length&&nt(t.length)&&t.length>=0&&t.length<=lt}var Kn="function"==typeof ArrayBuffer;function Xn(t){return Kn&&t instanceof ArrayBuffer||"[object ArrayBuffer]"===G(t)}var Hn=Ht(It.isPrimitive),Qn=Ht(It.isObject),tr=Ht(It);function er(t,e,n){k(t,e,{configurable:!1,enumerable:!0,writable:!1,value:n})}function nr(t,e){if(!(this instanceof nr))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!N(t))throw new TypeError(j("invalid argument. Real component must be a number. Value: `%s`.",t));if(!N(e))throw new TypeError(j("invalid argument. Imaginary component must be a number. Value: `%s`.",e));return er(this,"re",t),er(this,"im",e),this}M(tr,"primitives",Hn),M(tr,"objects",Qn),M(nr,"name","Complex128"),M(nr,"BYTES_PER_ELEMENT",8),M(nr.prototype,"BYTES_PER_ELEMENT",8),M(nr.prototype,"byteLength",16),M(nr.prototype,"toString",(function(){var t=""+this.re;return this.im<0?t+=" - "+-this.im:t+=" + "+this.im,t+="i"})),M(nr.prototype,"toJSON",(function(){var t={type:"Complex128"};return t.re=this.re,t.im=this.im,t}));var rr="function"==typeof Math.fround?Math.fround:null,ir=new on(1);var or="function"==typeof rr?rr:function(t){return ir[0]=t,ir[0]};function ar(t,e){if(!(this instanceof ar))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!N(t))throw new TypeError(j("invalid argument. Real component must be a number. Value: `%s`.",t));if(!N(e))throw new TypeError(j("invalid argument. Imaginary component must be a number. Value: `%s`.",e));return er(this,"re",or(t)),er(this,"im",or(e)),this}function ur(t){return t instanceof nr||t instanceof ar||"object"==typeof t&&null!==t&&"number"==typeof t.re&&"number"==typeof t.im}function fr(t){return nt(t/2)}M(ar,"name","Complex64"),M(ar,"BYTES_PER_ELEMENT",4),M(ar.prototype,"BYTES_PER_ELEMENT",4),M(ar.prototype,"byteLength",8),M(ar.prototype,"toString",(function(){var t=""+this.re;return this.im<0?t+=" - "+-this.im:t+=" + "+this.im,t+="i"})),M(ar.prototype,"toJSON",(function(){var t={type:"Complex64"};return t.re=this.re,t.im=this.im,t}));var sr=8;function lr(t){return"object"==typeof t&&null!==t&&"Complex64Array"===t.constructor.name&&t.BYTES_PER_ELEMENT===sr}var cr=16;function hr(t){return"object"==typeof t&&null!==t&&"Complex128Array"===t.constructor.name&&t.BYTES_PER_ELEMENT===cr}function pr(){return"function"==typeof W&&"symbol"==typeof W("foo")&&J(W,"iterator")&&"symbol"==typeof W.iterator}var gr=pr()?Symbol.iterator:null;function dr(t){return t.re}function yr(t){return t.im}function mr(t,e){return new on(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,2*(t.length-e))}function vr(t,e){return new Qe(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,2*(t.length-e))}function br(t){var e,n,r;for(e=[];!(n=t.next()).done;)if(qn(r=n.value)&&r.length>=2)e.push(r[0],r[1]);else{if(!ur(r))return new TypeError(j("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",r));e.push(dr(r),yr(r))}return e}var wr=2*on.BYTES_PER_ELEMENT,_r=pr();function Er(t){return t instanceof Ar||"object"==typeof t&&null!==t&&("Complex64Array"===t.constructor.name||"Complex128Array"===t.constructor.name)&&"number"==typeof t._length&&"object"==typeof t._buffer}function xr(t){return t===Ar||"Complex128Array"===t.name}function Tr(t,e){return new ar(t[e*=2],t[e+1])}function Ar(){var t,e,n,r;if(e=arguments.length,!(this instanceof Ar))return 0===e?new Ar:1===e?new Ar(arguments[0]):2===e?new Ar(arguments[0],arguments[1]):new Ar(arguments[0],arguments[1],arguments[2]);if(0===e)n=new on(0);else if(1===e)if(ut(arguments[0]))n=new on(2*arguments[0]);else if(re(arguments[0]))if((r=(n=arguments[0]).length)&&Zt(n)&&ur(n[0])){if(n=function(t,e){var n,r,i,o;for(n=e.length,o=0,i=0;in.byteLength-t)throw new RangeError(j("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*wr));n=new on(n,t,2*r)}}return M(this,"_buffer",n),M(this,"_length",n.length/2),this}function Or(t){return t.re}function Vr(t){return t.im}function Sr(t){var e,n,r;for(e=[];!(n=t.next()).done;)if(qn(r=n.value)&&r.length>=2)e.push(r[0],r[1]);else{if(!ur(r))return new TypeError(j("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",r));e.push(Or(r),Vr(r))}return e}M(Ar,"BYTES_PER_ELEMENT",wr),M(Ar,"name","Complex64Array"),M(Ar,"from",(function(t){var e,n,r,i,o,a,u,f,s,l,c,h;if(!xe(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!xr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!xe(r=arguments[1]))throw new TypeError(j("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(Er(t)){if(f=t.length,r){for(o=(i=new this(f))._buffer,h=0,c=0;c=2))throw new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[h]=l[0],o[h+1]=l[1]}h+=2}return i}return new this(t)}if(re(t)){if(r){for(f=t.length,u=t.get&&t.set?We("default"):Ye("default"),c=0;c=2))throw new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[h]=l[0],o[h+1]=l[1]}h+=2}return i}return new this(t)}if(Ee(t)&&_r&&xe(t[gr])){if(!xe((o=t[gr]()).next))throw new TypeError(j("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",t));if(a=r?function(t,e,n){var r,i,o,a;for(r=[],a=-1;!(i=t.next()).done;)if(a+=1,qn(o=e.call(n,i.value,a))&&o.length>=2)r.push(o[0],o[1]);else{if(!ur(o))return new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));r.push(dr(o),yr(o))}return r}(o,r,e):br(o),a instanceof Error)throw a;for(o=(i=new this(f=a.length/2))._buffer,c=0;c=this._length))return Tr(this._buffer,t)})),Vt(Ar.prototype,"buffer",(function(){return this._buffer.buffer})),Vt(Ar.prototype,"byteLength",(function(){return this._buffer.byteLength})),Vt(Ar.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),M(Ar.prototype,"BYTES_PER_ELEMENT",Ar.BYTES_PER_ELEMENT),M(Ar.prototype,"copyWithin",(function(t,e){if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*t,2*e):this._buffer.copyWithin(2*t,2*e,2*arguments[2]),this})),M(Ar.prototype,"entries",(function(){var t,e,n,r,i,o;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,o=-1,M(e={},"next",(function(){if(o+=1,i||o>=n)return{done:!0};return{value:[o,Tr(r,o)],done:!1}})),M(e,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(e,gr,(function(){return t.entries()})),e})),M(Ar.prototype,"every",(function(t,e){var n,r;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!nt(n))throw new TypeError(j("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(a=dr(t),u=yr(t),f=e;f=0;r--)if(i=Tr(n,r),t.call(e,i,r,this))return i})),M(Ar.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=this._length-1;r>=0;r--)if(i=Tr(n,r),t.call(e,i,r,this))return r;return-1})),M(Ar.prototype,"forEach",(function(t,e){var n,r,i;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return Tr(this._buffer,t)})),M(Ar.prototype,"includes",(function(t,e){var n,r,i,o,a;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ur(t))throw new TypeError(j("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=dr(t),o=yr(t),n=this._buffer,a=e;a1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=dr(t),o=yr(t),n=this._buffer,a=e;a=n)return{done:!0};return{value:i,done:!1}})),M(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(e,gr,(function(){return t.keys()})),e})),M(Ar.prototype,"lastIndexOf",(function(t,e){var n,r,i,o,a;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ur(t))throw new TypeError(j("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(i=dr(t),o=yr(t),n=this._buffer,a=e;a>=0;a--)if(i===n[r=2*a]&&o===n[r+1])return a;return-1})),Vt(Ar.prototype,"length",(function(){return this._length})),M(Ar.prototype,"map",(function(t,e){var n,r,i,o,a;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(r=this._buffer,n=(i=new this.constructor(this._length))._buffer,o=0;o1)r=e,o=0;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Tr(n,0),o=1}for(;o1)r=e,o=i-1;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Tr(n,i-1),o=i-2}for(;o>=0;o--)r=t(r,Tr(n,o),o,this);return r})),M(Ar.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=this._buffer,r=et(n/2),i=0;i1){if(!ut(n=arguments[1]))throw new TypeError(j("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(ur(t)){if(n>=this._length)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return r[n*=2]=dr(t),void(r[n+1]=yr(t))}if(Er(t)){if(n+(a=t._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t._buffer,s=r.byteOffset+n*wr,e.buffer===r.buffer&&e.byteOffsets){for(i=new on(e.length),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t,s=r.byteOffset+n*wr,e.buffer===r.buffer&&e.byteOffsets){for(i=new on(a),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,f=0;fu&&(e=u)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*wr):(i=e-t,n=r.byteOffset+t*wr),new this.constructor(r.buffer,n,i<0?0:i)})),M(Ar.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)r=[];else{if(!St(t)&&!Hn(t))throw new TypeError(j("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Ee(e))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:Tr(i,o),done:!1}})),M(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(t,gr,(function(){return e.values()})),t})),M(Ar.prototype,"with",(function(t,e){var n,r,i;if(!Er(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!nt(t))throw new TypeError(j("invalid argument. First argument must be an integer. Value: `%s`.",t));if(i=this._length,t<0&&(t+=i),t<0||t>=i)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!ur(e))throw new TypeError(j("invalid argument. Second argument must be a complex number. Value: `%s`.",e));return(n=(r=new this.constructor(this._buffer))._buffer)[2*t]=dr(e),n[2*t+1]=yr(e),r}));var jr=2*Qe.BYTES_PER_ELEMENT,Rr=pr();function Lr(t){return t instanceof Fr||"object"==typeof t&&null!==t&&("Complex64Array"===t.constructor.name||"Complex128Array"===t.constructor.name)&&"number"==typeof t._length&&"object"==typeof t._buffer}function Ir(t){return t===Fr||"Complex64Array"===t.name}function Br(t,e){return new nr(t[e*=2],t[e+1])}function Fr(){var t,e,n,r;if(e=arguments.length,!(this instanceof Fr))return 0===e?new Fr:1===e?new Fr(arguments[0]):2===e?new Fr(arguments[0],arguments[1]):new Fr(arguments[0],arguments[1],arguments[2]);if(0===e)n=new Qe(0);else if(1===e)if(ut(arguments[0]))n=new Qe(2*arguments[0]);else if(re(arguments[0]))if((r=(n=arguments[0]).length)&&Zt(n)&&ur(n[0])){if(n=function(t,e){var n,r,i,o;for(n=e.length,o=0,i=0;in.byteLength-t)throw new RangeError(j("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*jr));n=new Qe(n,t,2*r)}}return M(this,"_buffer",n),M(this,"_length",n.length/2),this}function Ur(t){var e,n;for(e=[];!(n=t.next()).done;)e.push(yt(n.value));return e}M(Fr,"BYTES_PER_ELEMENT",jr),M(Fr,"name","Complex128Array"),M(Fr,"from",(function(t){var e,n,r,i,o,a,u,f,s,l,c,h;if(!xe(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ir(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!xe(r=arguments[1]))throw new TypeError(j("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(Lr(t)){if(f=t.length,r){for(o=(i=new this(f))._buffer,h=0,c=0;c=2))throw new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[h]=l[0],o[h+1]=l[1]}h+=2}return i}return new this(t)}if(re(t)){if(r){for(f=t.length,u=t.get&&t.set?We("default"):Ye("default"),c=0;c=2))throw new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[h]=l[0],o[h+1]=l[1]}h+=2}return i}return new this(t)}if(Ee(t)&&Rr&&xe(t[gr])){if(!xe((o=t[gr]()).next))throw new TypeError(j("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",t));if(a=r?function(t,e,n){var r,i,o,a;for(r=[],a=-1;!(i=t.next()).done;)if(a+=1,qn(o=e.call(n,i.value,a))&&o.length>=2)r.push(o[0],o[1]);else{if(!ur(o))return new TypeError(j("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));r.push(Or(o),Vr(o))}return r}(o,r,e):Sr(o),a instanceof Error)throw a;for(o=(i=new this(f=a.length/2))._buffer,c=0;c=this._length))return Br(this._buffer,t)})),Vt(Fr.prototype,"buffer",(function(){return this._buffer.buffer})),Vt(Fr.prototype,"byteLength",(function(){return this._buffer.byteLength})),Vt(Fr.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),M(Fr.prototype,"BYTES_PER_ELEMENT",Fr.BYTES_PER_ELEMENT),M(Fr.prototype,"copyWithin",(function(t,e){if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*t,2*e):this._buffer.copyWithin(2*t,2*e,2*arguments[2]),this})),M(Fr.prototype,"entries",(function(){var t,e,n,r,i,o,a;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return e=this,t=this._buffer,r=this._length,o=-1,a=-2,M(n={},"next",(function(){var e;if(o+=1,i||o>=r)return{done:!0};return e=new nr(t[a+=2],t[a+1]),{value:[o,e],done:!1}})),M(n,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(n,gr,(function(){return e.entries()})),n})),M(Fr.prototype,"every",(function(t,e){var n,r;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!nt(n))throw new TypeError(j("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(a=Or(t),u=Vr(t),f=e;f=0;r--)if(i=Br(n,r),t.call(e,i,r,this))return i})),M(Fr.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=this._length-1;r>=0;r--)if(i=Br(n,r),t.call(e,i,r,this))return r;return-1})),M(Fr.prototype,"forEach",(function(t,e){var n,r,i;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return Br(this._buffer,t)})),Vt(Fr.prototype,"length",(function(){return this._length})),M(Fr.prototype,"includes",(function(t,e){var n,r,i,o,a;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ur(t))throw new TypeError(j("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=Or(t),o=Vr(t),n=this._buffer,a=e;a1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=Or(t),o=Vr(t),n=this._buffer,a=e;a=n)return{done:!0};return{value:i,done:!1}})),M(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(e,gr,(function(){return t.keys()})),e})),M(Fr.prototype,"lastIndexOf",(function(t,e){var n,r,i,o,a;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ur(t))throw new TypeError(j("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!nt(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(i=Or(t),o=Vr(t),n=this._buffer,a=e;a>=0;a--)if(i===n[r=2*a]&&o===n[r+1])return a;return-1})),M(Fr.prototype,"map",(function(t,e){var n,r,i,o,a;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(r=this._buffer,n=(i=new this.constructor(this._length))._buffer,o=0;o1)r=e,o=0;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Br(n,0),o=1}for(;o1)r=e,o=i-1;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Br(n,i-1),o=i-2}for(;o>=0;o--)r=t(r,Br(n,o),o,this);return r})),M(Fr.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=this._buffer,r=et(n/2),i=0;i1){if(!ut(n=arguments[1]))throw new TypeError(j("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(ur(t)){if(n>=this._length)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return r[n*=2]=Or(t),void(r[n+1]=Vr(t))}if(Lr(t)){if(n+(a=t._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t._buffer,s=r.byteOffset+n*jr,e.buffer===r.buffer&&e.byteOffsets){for(i=new Qe(e.length),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t,s=r.byteOffset+n*jr,e.buffer===r.buffer&&e.byteOffsets){for(i=new Qe(a),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,f=0;fu&&(e=u)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*jr):(i=e-t,n=r.byteOffset+t*jr),new this.constructor(r.buffer,n,i<0?0:i)})),M(Fr.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)r=[];else{if(!It(t)&&!Hn(t))throw new TypeError(j("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Ee(e))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:Br(i,o),done:!1}})),M(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(t,gr,(function(){return e.values()})),t})),M(Fr.prototype,"with",(function(t,e){var n,r,i;if(!Lr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!nt(t))throw new TypeError(j("invalid argument. First argument must be an integer. Value: `%s`.",t));if(i=this._length,t<0&&(t+=i),t<0||t>=i)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!ur(e))throw new TypeError(j("invalid argument. Second argument must be a complex number. Value: `%s`.",e));return(n=(r=new this.constructor(this._buffer))._buffer)[2*t]=Or(e),n[2*t+1]=Vr(e),r}));var Pr=Pn.BYTES_PER_ELEMENT,kr=pr();function Mr(t){return"object"==typeof t&&null!==t&&"BooleanArray"===t.constructor.name&&t.BYTES_PER_ELEMENT===Pr}function Nr(t){return t===Cr}function Cr(){var t,e,n,r,i;if(e=arguments.length,!(this instanceof Cr))return 0===e?new Cr:1===e?new Cr(arguments[0]):2===e?new Cr(arguments[0],arguments[1]):new Cr(arguments[0],arguments[1],arguments[2]);if(0===e)n=new Pn(0);else if(1===e)if(ut(i=arguments[0]))n=new Pn(i);else if(re(i))n=function(t,e){var n,r;for(n=e.length,r=0;rn.byteLength-t)throw new RangeError(j("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*Pr));n=new Pn(n,t,r)}}return M(this,"_buffer",n),M(this,"_length",n.length),this}M(Cr,"BYTES_PER_ELEMENT",Pr),M(Cr,"name","BooleanArray"),M(Cr,"from",(function(t){var e,n,r,i,o,a,u,f,s;if(!xe(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Nr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((n=arguments.length)>1){if(!xe(r=arguments[1]))throw new TypeError(j("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(re(t)){if(r){for(f=t.length,u=t.get&&t.set?We("default"):Ye("default"),o=(i=new this(f))._buffer,s=0;s=n))return yt(e[t])})),Vt(Cr.prototype,"buffer",(function(){return this._buffer.buffer})),Vt(Cr.prototype,"byteLength",(function(){return this._buffer.byteLength})),Vt(Cr.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),M(Cr.prototype,"BYTES_PER_ELEMENT",Cr.BYTES_PER_ELEMENT),M(Cr.prototype,"copyWithin",(function(t,e){if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(t,e):this._buffer.copyWithin(t,e,arguments[2]),this})),M(Cr.prototype,"entries",(function(){var t,e,n,r,i,o;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return t=this,r=this._buffer,n=this._length,o=-1,M(e={},"next",(function(){if(o+=1,i||o>=n)return{done:!0};return{value:[o,yt(r[o])],done:!1}})),M(e,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(e,gr,(function(){return t.entries()})),e})),M(Cr.prototype,"every",(function(t,e){var n,r;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!it(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!it(n))throw new TypeError(j("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(o=t?1:0,a=e;a=0;i--)if(r=yt(n[i]),t.call(e,r,i,this))return r})),M(Cr.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,i=this._length-1;i>=0;i--)if(r=yt(n[i]),t.call(e,r,i,this))return i;return-1})),M(Cr.prototype,"forEach",(function(t,e){var n,r;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!xe(t))throw new TypeError(j("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return yt(this._buffer[t])})),M(Cr.prototype,"includes",(function(t,e){var n,r;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!dt(t))throw new TypeError(j("invalid argument. First argument must be a boolean. Value: `%s`.",t));if(arguments.length>1){if(!it(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(n=this._buffer,r=e;r1){if(!it(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(n=this._buffer,r=e;r0){if(!St(t))throw new TypeError(j("invalid argument. First argument must be a string. Value: `%s`.",t))}else t=",";for(e=this._buffer,n=[],r=0;r=n)return{done:!0};return{value:i,done:!1}})),M(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(e,gr,(function(){return t.keys()})),e})),M(Cr.prototype,"lastIndexOf",(function(t,e){var n,r;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!dt(t))throw new TypeError(j("invalid argument. First argument must be a boolean. Value: `%s`.",t));if(arguments.length>1){if(!it(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(n=this._buffer,r=e;r>=0;r--)if(t===yt(n[r]))return r;return-1})),Vt(Cr.prototype,"length",(function(){return this._length})),M(Cr.prototype,"map",(function(t,e){var n,r,i,o;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!xe(t))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",t);for(i=this._buffer,n=(r=new this.constructor(this._length))._buffer,o=0;o1)i=e,o=0;else{if(0===r)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");i=yt(n[0]),o=1}for(;o1)i=e,o=r-1;else{if(0===r)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");i=yt(n[r-1]),o=r-2}for(;o>=0;o--)i=t(i,yt(n[o]),o,this);return i})),M(Cr.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(t=this._buffer,n=this._length,r=et(n/2),i=0;i1){if(!ut(n=arguments[1]))throw new TypeError(j("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(re(t)){if(n+(o=t.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=Mr(t)?t._buffer:t,u=r.byteOffset+n*Pr,e.buffer===r.buffer&&e.byteOffsetu){for(i=new Pn(e.length),a=0;a=this._length)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));r[n]=t?1:0}})),M(Cr.prototype,"slice",(function(t,e){var n,r,i,o,a,u;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(o=this._buffer,a=this._length,0===arguments.length)t=0,e=a;else{if(!it(t))throw new TypeError(j("invalid argument. First argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=a)<0&&(t=0),1===arguments.length)e=a;else{if(!it(e))throw new TypeError(j("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0?(e+=a)<0&&(e=0):e>a&&(e=a)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*Pr):(i=e-t,n=r.byteOffset+t*Pr),new this.constructor(r.buffer,n,i<0?0:i)})),M(Cr.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)r=[];else{if(!St(t)&&!Hn(t))throw new TypeError(j("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Ee(e))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:yt(i[o]),done:!1}})),M(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),gr&&M(t,gr,(function(){return e.values()})),t})),M(Cr.prototype,"with",(function(t,e){var n,r;if(!Mr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!it(t))throw new TypeError(j("invalid argument. First argument must be an integer. Value: `%s`.",t));if(r=this._length,t<0&&(t+=r),t<0||t>=r)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!dt(e))throw new TypeError(j("invalid argument. Second argument must be a boolean. Value: `%s`.",e));return(n=new this.constructor(this._buffer))._buffer[t]=e?1:0,n}));var Yr=[Qe,on,mn,ln,Rn,xn,Zn,Pn,Yn,Ar,Fr,Cr],Dr=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],zr=Dr.length;function Jr(t){var e;if(Zt(t))return"generic";if(ce(t))return null;for(e=0;e0?o+=a*(t[u]-1):a<0&&(i+=a*(t[u]-1))}return[i,o]}function Xr(t){return"column-major"===t}M(Kr,"assign",(function(t,e,n,r){var i,o,a,u,f;for(i=t.length,o=n,a=n,f=0;f0?a+=u*(t[f]-1):u<0&&(o+=u*(t[f]-1))}return r[0]=o,r[1]=a,r}));var Hr=/[-\/\\^$*+?.()|[\]{}]/g;var Qr=RegExp.prototype.exec;var ti=Y();function ei(t){return"object"==typeof t&&(t instanceof RegExp||(ti?function(t){try{return Qr.call(t),!0}catch(t){return!1}}(t):"[object RegExp]"===G(t)))}function ni(t,e,n){return t.replace(e,n)}function ri(t,e,n){if(!St(t))throw new TypeError(j("invalid argument. First argument must be a string. Value: `%s`.",t));if(St(e))e=new RegExp(function(t){var e,n;if(!St(t))throw new TypeError(j("invalid argument. Must provide a regular expression string. Value: `%s`.",t));if("/"===t[0])for(n=t.length-1;n>=0&&"/"!==t[n];n--);return void 0===n||n<=0?t.replace(Hr,"\\$&"):(e=(e=t.substring(1,n)).replace(Hr,"\\$&"),t=t[0]+e+t.substring(n))}(e),"g");else if(!ei(e))throw new TypeError(j("invalid argument. Second argument must be a string or regular expression. Value: `%s`.",e));if(!St(n)&&!xe(n))throw new TypeError(j("invalid argument. Third argument must be a string or replacement function. Value: `%s`.",n));return ni(t,e,n)}var ii={int8:"new Int8Array( [ {{data}} ] )",uint8:"new Uint8Array( [ {{data}} ] )",uint8c:"new Uint8ClampedArray( [ {{data}} ] )",int16:"new Int16Array( [ {{data}} ] )",uint16:"new Uint16Array( [ {{data}} ] )",int32:"new Int32Array( [ {{data}} ] )",uint32:"new Uint32Array( [ {{data}} ] )",float32:"new Float32Array( [ {{data}} ] )",float64:"new Float64Array( [ {{data}} ] )",generic:"[ {{data}} ]",binary:"new Buffer( [ {{data}} ] )",complex64:"new Complex64Array( [ {{data}} ] )",complex128:"new Complex128Array( [ {{data}} ] )",bool:"new BooleanArray( [ {{data}} ] )"};var oi,ai={uint16:xn,uint8:Pn};(oi=new ai.uint16(1))[0]=4660;var ui=52===new ai.uint8(oi.buffer)[0],fi="function"==typeof ArrayBuffer?ArrayBuffer:null;var si,li="function"==typeof ArrayBuffer?ArrayBuffer:void 0;si=function(){var t,e,n;if("function"!=typeof fi)return!1;try{(t=Xn(n=new fi(16))&&"function"==typeof fi.isView)&&((e=new Qe(n))[0]=-3.14,e[1]=NaN,t=t&&fi.isView(e)&&16===n.byteLength&&-3.14===e[0]&&e[1]!=e[1])}catch(e){t=!1}return t}()?li:function(){throw new Error("not implemented")};var ci=si,hi="function"==typeof DataView;function pi(t){return hi&&t instanceof DataView||"[object DataView]"===G(t)}var gi="function"==typeof DataView?DataView:null;var di,yi="function"==typeof DataView?DataView:void 0;di=function(){var t,e,n;if("function"!=typeof gi)return!1;try{n=new ci(24),(t=pi(e=new gi(n,8))&&"function"==typeof e.getFloat64&&"function"==typeof e.setFloat64)&&(e.setFloat64(0,-3.14),e.setFloat64(8,NaN),t=t&&e.buffer===n&&16===e.byteLength&&8===e.byteOffset&&-3.14===e.getFloat64(0)&&e.getFloat64(8)!=e.getFloat64(8))}catch(e){t=!1}return t}()?yi:function(){throw new Error("not implemented")};var mi=di,vi="function"==typeof BigInt?BigInt:void 0,bi=["row-major","column-major"];function wi(){return bi.slice()}var _i=["row-major","column-major"];function Ei(){return{"row-major":101,"column-major":102}}M((function(){return _i.slice()}),"enum",Ei);var xi={"row-major":101,"column-major":102};function Ti(){return{"row-major":xi["row-major"],"column-major":xi["column-major"]}}M(wi,"enum",Ti);var Ai=["throw","normalize","clamp","wrap"];function Oi(){return Ai.slice()}function Vi(){return{throw:1,clamp:2,wrap:3,normalize:4}}M(Oi,"enum",Vi);var Si={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256},ji=Ti(),Ri={throw:1,clamp:2,wrap:3,normalize:4};var Li=4294967295,Ii=4294967296,Bi=new Pn(8),Fi=new mi(Bi.buffer);function Ui(t,e,n,r){var i,o,a;if(0===t){for(a=0;a>>0,i=et(t/Ii),ui?(Fi.setUint32(0,o,ui),Fi.setUint32(4,i,ui)):(Fi.setUint32(0,i,ui),Fi.setUint32(4,o,ui)),a=0;a>>0,r=et(t/4294967296),n=new mi(e.buffer),ui?(n.setUint32(0,i,ui),n.setUint32(4,r,ui)):(n.setUint32(0,r,ui),n.setUint32(4,i,ui))),e}),"assign",Ui);var Pi={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256},ki=Ti(),Mi={throw:1,clamp:2,wrap:3,normalize:4};function Ni(t,e,n,r,i,o){var a,u,f,s,l;if(!(this instanceof Ni))return new Ni(t,e,n,r,i,o);for(s=1,l=0;l=0;a--)t-=o=t%n[a],t/=n[a],i+=o*e[a];return this._accessors?this._buffer.get(i):this._buffer[i]})),M(Ni.prototype,"set",(function(){var t,e;for(t=this._offset,e=0;e=0;u--)t-=a=t%r[u],t/=r[u],o+=a*n[u];return this._accessors?this._buffer.set(e,o):this._buffer[o]=e,this})),M(Ni.prototype,"toString",(function(){var t,e,n,r,i,o;if(e=this._shape.length,n="ndarray( '"+(r=this._dtype)+"', ",t="",this._length<=100)if("complex64"===r||"complex128"===r)for(o=0;o=0;o--)t+=Or(i=this.iget(this._length-1-o))+", "+Vr(i),o>0&&(t+=", ");else for(o=2;o>=0;o--)t+=this.iget(this._length-1-o),o>0&&(t+=", ")}if(n+=ri(ii[this.dtype],"{{data}}",t),n+=", ",n+=0===e?"[]":"[ "+this._shape.join(", ")+" ]",n+=", ",n+="[ ",0===e)n+="0";else for(o=0;o0&&e.push("generic"),e)}var $i=Di(Wi());function Gi(t,e){return null!=t&&("symbol"==typeof e?e in Object(t):String(e)in Object(t))}function Zi(t){return xe(t)&&Bt(t.alignment)&&Bt(t.byteLength)&&xe(t.byteLengthOf)&&xe(t.byteOffsetOf)&&xe(t.bufferOf)&&xe(t.isStruct)&&xe(t.viewOf)&&J(t,"fields")&&J(t,"layout")}var qi,Ki,Xi,Hi={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256};function Qi(t){var e=Hi[t];return N(e)?e:null}function to(t){var e=typeof t;return"string"===e?null===Qi(t)?null:t:"number"===e?Ie(t):"object"===e&&t?String(t):Zi(t)?t.layout:null}function eo(t,e){var n,r,i;if(n=arguments.length,!(this instanceof eo))return n<2?new eo(t):new eo(t,e);if($i(t))r="builtin";else{if(function(t){return t instanceof eo||"object"==typeof t&&null!==t&&"DataType"===t.constructor.name&&St(t.char)&&St(t.description)&&St(t.byteOrder)&&Gi(t,"value")}(t))return new eo(t.value,{description:t.description});if(!Zi(t))throw new TypeError(j("invalid argument. First argument must be either a supported data type string, a struct constructor, or another data type instance. Value: `%s`.",t));r="struct"}if(n>1){if(!Re(i=e))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",i));if(J(i,"description")&&!St(i.description))throw new TypeError(j("invalid option. `%s` option must be a string. Option: `%s`.","description",i.description))}else i={};return M(this,"_value",t),M(this,"_description",i.description||function(t){return 0===arguments.length?{binary:"byte",bool:"boolean",complex32:"half-precision floating-point complex number",complex64:"single-precision floating-point complex number",complex128:"double-precision floating-point complex number",float16:"half-precision floating-point number",bfloat16:"brain floating-point number",float32:"single-precision floating-point number",float64:"double-precision floating-point number",float128:"quadruple-precision floating-point number",generic:"generic array value",int8:"signed 8-bit integer",int16:"signed 16-bit integer",int32:"signed 32-bit integer",int64:"signed 64-bit integer",int128:"signed 128-bit integer",int256:"signed 256-bit integer",uint8:"unsigned 8-bit integer",uint8c:"unsigned 8-bit integer (clamped)",uint16:"unsigned 16-bit integer",uint32:"unsigned 32-bit integer",uint64:"unsigned 64-bit integer",uint128:"unsigned 128-bit integer",uint256:"unsigned 256-bit integer"}:(void 0===qi&&(qi={binary:"byte",bool:"boolean",complex32:"half-precision floating-point complex number",complex64:"single-precision floating-point complex number",complex128:"double-precision floating-point complex number",float16:"half-precision floating-point number",bfloat16:"brain floating-point number",float32:"single-precision floating-point number",float64:"double-precision floating-point number",float128:"quadruple-precision floating-point number",generic:"generic array value",int8:"signed 8-bit integer",int16:"signed 16-bit integer",int32:"signed 32-bit integer",int64:"signed 64-bit integer",int128:"signed 128-bit integer",int256:"signed 256-bit integer",uint8:"unsigned 8-bit integer",uint8c:"unsigned 8-bit integer (clamped)",uint16:"unsigned 16-bit integer",uint32:"unsigned 32-bit integer",uint64:"unsigned 64-bit integer",uint128:"unsigned 128-bit integer",uint256:"unsigned 256-bit integer"}),qi[to(t)]||null)}(t)||""),M(this,"_char",function(t){return 0===arguments.length?{binary:"r",bool:"x",complex32:"j",complex64:"c",complex128:"z",float16:"h",bfloat16:"e",float32:"f",float64:"d",float128:"g",generic:"o",int8:"s",int16:"k",int32:"i",int64:"l",int128:"m",int256:"n",uint8:"b",uint8c:"a",uint16:"t",uint32:"u",uint64:"v",uint128:"w",uint256:"y"}:(void 0===Ki&&(Ki={binary:"r",bool:"x",complex32:"j",complex64:"c",complex128:"z",float16:"h",bfloat16:"e",float32:"f",float64:"d",float128:"g",generic:"o",int8:"s",int16:"k",int32:"i",int64:"l",int128:"m",int256:"n",uint8:"b",uint8c:"a",uint16:"t",uint32:"u",uint64:"v",uint128:"w",uint256:"y"}),Ki[to(t)]||null)}(t)||""),M(this,"_enum",function(t){var e=typeof t;return"number"===e?Ie(t)?t:null:"string"===e?Qi(t):"object"===e&&t&&it(t.enum)?t.enum:Zi(t)?Qi("userdefined_type"):null}(t)||-1),M(this,"_alignment",function(t){var e;return 0===arguments.length?{binary:1,bool:1,complex32:2,complex64:4,complex128:8,float16:2,bfloat16:2,float32:4,float64:8,float128:16,generic:null,int8:1,int16:2,int32:4,int64:8,int128:16,int256:32,uint8:1,uint8c:1,uint16:2,uint32:4,uint64:8,uint128:16,uint256:32}:(void 0===Xi&&(Xi={binary:1,bool:1,complex32:2,complex64:4,complex128:8,float16:2,bfloat16:2,float32:4,float64:8,float128:16,generic:null,int8:1,int16:2,int32:4,int64:8,int128:16,int256:32,uint8:1,uint8c:1,uint16:2,uint32:4,uint64:8,uint128:16,uint256:32}),t?Bt(e=t.alignment)?e:Xi[to(t)]||null:null)}(t)||-1),M(this,"_byteLength",Fe(t)||-1),M(this,"_byteOrder","host"),M(this,"_type",r),this}function no(t){return t instanceof eo||"object"==typeof t&&null!==t&&it(t.alignment)&&it(t.byteLength)&&St(t.byteOrder)&&St(t.char)&&it(t.enum)&&Gi(t,"value")}function ro(t){return xe(t)&&Bt(t.alignment)&&Bt(t.byteLength)&&xe(t.byteLengthOf)&&xe(t.byteOffsetOf)&&xe(t.bufferOf)&&xe(t.viewOf)||function(t){return t instanceof eo||"object"==typeof t&&null!==t&&it(t.alignment)&&it(t.byteLength)&&St(t.byteOrder)&&St(t.char)&&it(t.enum)&&Gi(t,"value")}(t)&&ro(t.value)}function io(t){return $i(t)||no(t)||ro(t)}M(eo,"name","DataType"),Vt(eo.prototype,"alignment",(function(){return this._alignment})),Vt(eo.prototype,"byteLength",(function(){return this._byteLength})),Vt(eo.prototype,"byteOrder",(function(){return this._byteOrder})),Vt(eo.prototype,"char",(function(){return this._char})),Vt(eo.prototype,"description",(function(){return this._description})),Vt(eo.prototype,"enum",(function(){return this._enum})),Vt(eo.prototype,"value",(function(){return this._value})),M(eo.prototype,"toJSON",(function(){return{type:"DataType",value:this.toString(),byteOrder:this._byteOrder,description:this._description}})),M(eo.prototype,"toString",(function(){return"struct"===this._type?this._value.layout:String(this._value)})),M(eo.prototype,"valueOf",(function(){return this.toString()}));var oo=["same","promoted","accumulation","boolean","boolean_and_generic","signed_integer","signed_integer_and_generic","unsigned_integer","unsigned_integer_and_generic","integer","integer_and_generic","floating_point","floating_point_and_generic","real_floating_point","real_floating_point_and_generic","complex_floating_point","complex_floating_point_and_generic","real_and_generic","real","numeric","numeric_and_generic","integer_index","integer_index_and_generic","boolean_index","boolean_index_and_generic","mask_index","mask_index_and_generic","default","default_index"];function ao(){return oo.slice()}function uo(){return{same:0,promoted:1,accumulation:2,boolean:3,boolean_and_generic:4,signed_integer:5,signed_integer_and_generic:6,unsigned_integer:7,unsigned_integer_and_generic:8,integer:9,integer_and_generic:10,floating_point:11,floating_point_and_generic:12,real_floating_point:13,real_floating_point_and_generic:14,complex_floating_point:15,complex_floating_point_and_generic:16,real:17,real_and_generic:18,numeric:19,numeric_and_generic:20,integer_index:21,integer_index_and_generic:22,boolean_index:23,boolean_index_and_generic:24,mask_index:25,mask_index_and_generic:26,default:27,default_index:28}}M(ao,"enum",uo),function(t,e){var n,r,i;for(n=_e(e),i=0;i0?0:(1-t)*e}function Eo(t){return null==t}function xo(t,e,n,r,i){var o,a,u,f,s;if(t<=0)return"";if(1===r&&0===i&&t===n.length&&function(t,e){return"function"==typeof t[e]}(n,"join"))return n.join(e);if((u=Wr(n)).accessorProtocol)return function(t,e,n,r,i){var o,a,u,f,s,l;for(o=n.data,a=n.accessors[0],f=i,u="",l=0;l0&&(u+=e),Eo(s=a(o,f))||(u+=String(s)),f+=r;return u}(t,e,u,r,i);for(a=i,o="",s=0;s0&&(o+=e),Eo(f=n[a])||(o+=String(f)),a+=r;return o}function To(t,e){return xo(t.length,e,t,1,0)}function Ao(t){var e=Jr(t);return Ne(t)?We(e):Ye(e)}function Oo(t,e,n,r,i){var o,a,u,f,s;if(!((f=e[0])<=0))for(a=r[0],o=n[0],u=t[0],s=0;s=0;i--)n[i]=r,r*=t[i];return n}(t)}M((function(t,e,n,r){return xo(t,e,n,r,_o(t,r))}),"ndarray",xo),M(So,"ndarray",(function(t,e,n,r,i){var o,a;return Ne(a=t[0])&&(o=Ge(Jr(a))),o?Vo(t,e,n,r,[o=o||ze(Jr(a))],i):Oo(t,e,n,r,i)})),M(Bo,"assign",(function(t,e,n){return Xr(e)?function(t,e){var n,r;for(n=1,r=0;r=0;r--)e[r]=n,n*=t[r];return e}(t,n)}));var Fo="row-major";function Uo(t,e){var n,r,i;return"object"!=typeof(i=t.strides)||null===i?0===(r=t.shape).length?[0]:(St(n=t.order)||(n=Fo),Bo(r,n)):e?Lo(i):i}function Po(t){var e,n,r;return N(r=t.offset)?r:0===(n=t.shape).length||"object"!=typeof(e=t.strides)||null===e?0:function(t,e){var n,r,i;for(r=t.length,n=0,i=0;i=0&&a=i&&(i=o,c=l);u=r[c][0]}for(n=zo(t.length),function(t,e){var n,r,i,o,a,u,f,s,l;for(r=1,i=1,l=1;l=0&&!(((s=t[o])<0?-s:s)<=n);)t[o+1]=s,e[a+1]=e[a],o-=1,a-=1;t[o+1]=u,e[a+1]=f,r+=1,i+=1}}(Lo(u),n),a=[Wo(t,n)],l=0;l=0&&a=0&&ie&&(e=r)}return(r=Go.BLOCK_SIZE_IN_BYTES/e|0)>0?r:1}([t,e,n])}function qo(t,e,n,r,i,o){var a,u,f,s,l;for(a=t.length,u=1,l=0;l=u&&(i=u-1);else if("wrap"===o)i<0?(i+=u)<0&&0!==(i%=u)&&(i+=u):i>=u&&(i-=u)>=u&&(i%=u);else if("normalize"===o&&i<0&&(i+=u),i<0||i>=u)throw new RangeError(j("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",u,i));if(f=n,Xr(r)){for(l=0;l=0;l--)i-=s=i%t[l],i/=t[l],f+=s*e[l];return f}var Ko="throw";var Xo="throw";var Ho=[function(t,e,n,r){n.data[n.offset]=r(t.data[t.offset],e.data[e.offset])},function(t,e,n,r){var i,o,a,u,f,s,l,c,h,p,g;for(l=t.shape[0],u=t.strides[0],f=e.strides[0],s=n.strides[0],c=t.offset,h=e.offset,p=n.offset,i=t.data,o=e.data,a=n.data,g=0;g0;)for(I0;)for(L0;)for(Y0;)for(C0;)for(N0;)for(K0;)for(q0;)for(Z0;)for(G0;)for(ot0;)for(it0;)for(rt0;)for(nt0;)for(et0;)for(gt0;)for(pt0;)for(ht0;)for(ct0;)for(lt0;)for(st0;)for(xt0;)for(Et0;)for(_t0;)for(wt0;)for(bt0;)for(vt0;)for(mt0;)for(It0;)for(Lt0;)for(Rt0;)for(jt0;)for(St0;)for(Vt0;)for(Ot0;)for(At0;)for(Yt0;)for(Ct0;)for(Nt0;)for(Mt0;)for(kt0;)for(Pt0;)for(Ut0;)for(Ft0;)for(Bt0;)for(Kt0;)for(qt0;)for(Zt0;)for(Gt0;)for($t0;)for(Wt0;)for(Jt0;)for(zt0;)for(Dt0;)for(Yt0;)for(U0;)for(F0;)for(J0;)for(z0;)for(D0;)for(Q0;)for(H0;)for(X0;)for(K0;)for(ft0;)for(ut0;)for(at0;)for(ot0;)for(it0;)for(mt0;)for(yt0;)for(dt0;)for(gt0;)for(pt0;)for(ht0;)for(Ot0;)for(At0;)for(Tt0;)for(xt0;)for(Et0;)for(_t0;)for(wt0;)for(Ut0;)for(Ft0;)for(Bt0;)for(It0;)for(Lt0;)for(Rt0;)for(jt0;)for(St0;)for(Jt0;)for(zt0;)for(Dt0;)for(Yt0;)for(Ct0;)for(Nt0;)for(Mt0;)for(kt0;)for(Pt0;)for(Qt0;)for(Ht0;)for(Xt0;)for(Kt0;)for(qt0;)for(Zt0;)for(Gt0;)for($t0;)for(Wt0;)for(Jt=0;s--)if(!((l=u-a+s)<0)){if(f=i[l],0!==(r=e[s])&&r0)for(l=0;l0)for(h=0;h2){if(r=Aa(Oa[n]))return new r(t,e);throw new TypeError(j("invalid argument. Must provide a recognized data type. Value: `%s`.",n))}return new Va(t,e)}(r,i,Sa[t.type])}}var Ra={float64:Qe,float32:on,int16:Rn,int32:mn,int8:Zn,uint16:xn,uint32:ln,uint8:Pn,uint8c:Yn,complex64:Ar,complex128:Fr,bool:Cr};function La(t){return Ra[t]||null}function Ia(t,e){return new Pn(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,t.length-e)}function Ba(){return{dtypes:{default:"float64",numeric:"float64",real:"float64",floating_point:"float64",real_floating_point:"float64",complex_floating_point:"complex128",integer:"int32",signed_integer:"int32",unsigned_integer:"uint32",boolean:"bool",index:"int32",integer_index:"int32",boolean_index:"bool",mask_index:"uint8"}}}var Fa={dtypes:{default:"float64",numeric:"float64",real:"float64",floating_point:"float64",real_floating_point:"float64",complex_floating_point:"complex128",integer:"int32",signed_integer:"int32",unsigned_integer:"uint32",boolean:"bool",index:"int32",integer_index:"int32",boolean_index:"bool",mask_index:"uint8"}},Ua={"dtypes.default":Fa.dtypes.default,"dtypes.numeric":Fa.dtypes.numeric,"dtypes.real":Fa.dtypes.real,"dtypes.floating_point":Fa.dtypes.floating_point,"dtypes.real_floating_point":Fa.dtypes.real_floating_point,"dtypes.complex_floating_point":Fa.dtypes.complex_floating_point,"dtypes.integer":Fa.dtypes.integer,"dtypes.signed_integer":Fa.dtypes.signed_integer,"dtypes.unsigned_integer":Fa.dtypes.unsigned_integer,"dtypes.boolean":Fa.dtypes.boolean,"dtypes.index":Fa.dtypes.index,"dtypes.integer_index":Fa.dtypes.integer_index,"dtypes.boolean_index":Fa.dtypes.boolean_index,"dtypes.mask_index":Fa.dtypes.mask_index};M(Ba,"get",(function(t){var e=Ua[t];return void 0===e?null:e}));var Pa=Ba.get("dtypes.default"),ka=La("complex64"),Ma=La("complex128"),Na=La("bool");function Ca(){var t,e,n,r;if(null===(n=La(e=(t=arguments.length)&&St(arguments[t-1])?arguments[t-=1]:Pa)))throw new TypeError(j("invalid argument. Must provide a recognized data type. Value: `%s`.",e));return t<=0?new n(0):1===t?((r=arguments[0])instanceof ka?r=mr(r,0):r instanceof Ma?r=vr(r,0):r instanceof Na&&(r=Ia(r,0)),new n(r)):2===t?new n(arguments[0],arguments[1]):new n(arguments[0],arguments[1],arguments[2])}function Ya(t){if(t.length)return t.isStructType?function(t){return function(){var e,n,r,i;for(e=(n=this[va]).byteOffset+t.byteOffset,r=[],i=0;i0&&e.push("generic"),e)}var Wa=Di(Ja("real_floating_point")),$a=Di(Ja("signed_integer"));function Ga(t){return"bigint"==typeof t}function Za(t){return"object"==typeof t&&"[object BigInt]"===G(t)&&function(t){try{return"bigint"==typeof t.valueOf()}catch(t){return!1}}(t)}function qa(t){return Ga(t)||Za(t)}function Ka(t){return function(){return t}}M(qa,"isPrimitive",Ga),M(qa,"isObject",Za);var Xa,Ha=Ka(!1),Qa=Ka(!1),tu=Ka(!1);M(Ha,"isPrimitive",Qa),M(Ha,"isObject",tu),Xa=Ot()?qa:Ha;const{isPrimitive:eu}=Xa;var nu,ru={float64:{float64:1,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},float32:{float64:1,float32:1,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},float16:{float64:1,float32:1,float16:1,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},int64:{float64:0,float32:0,float16:0,int64:1,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},int32:{float64:1,float32:0,float16:0,int64:1,int32:1,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},int16:{float64:1,float32:1,float16:0,int64:1,int32:1,int16:1,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},int8:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:1,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},uint64:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},uint32:{float64:1,float32:0,float16:0,int64:1,int32:0,int16:0,int8:0,uint64:1,uint32:1,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},uint16:{float64:1,float32:1,float16:0,int64:1,int32:1,int16:0,int8:0,uint64:1,uint32:1,uint16:1,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},uint8:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:0,uint64:1,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},uint8c:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:0,uint64:1,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},complex128:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},complex64:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},complex32:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},generic:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},binary:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:1,generic:0,bool:0},bool:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:1}};var iu=function(t){return 0===arguments.length?function(){var t,e,n,r,i,o,a,u,f;for(n={},e=(t=_e(ru)).length,f=0;f0}(t,e):"mostly-safe"===n?function(t,e){var n;return(t=to(t))===(e=to(e))||!!(n=uu[t])&&n[e]>0}(t,e):function(t,e){var n;return(t=to(t))===(e=to(e))||!!(n=lu[t])&&n[e]>0}(t,e)))}var hu=1401298464324817e-60,pu=16777215,gu=-16777215;function du(t){return t!=t||t===Q||t===tt?"float32":nt(t)?t>=gu&&t<=pu?"float32":"float64":t>-hu&&t=Jn?"int8":t>=On?"int16":t>=pn?"int32":"float64":t<=In?"uint8":t<=bn?"uint16":t<=qt?"uint32":"float64":t>-hu&&t=Jn?"int8":t>=On?"int16":t>=pn?"int32":"float64":t<=zn?"int8":t<=An?"int16":t<=hn?"int32":"float64"}(n):yu(n):Au.dtypes.real,i=n):ur(n)?(r=Eu(n)||("float32"===t.type?"complex64":"complex128"),i=n.re):dt(n)?(r="bool",i=xu(n)):eu(n)?(r="int64",i=Tu(n)):(r="generic",i=n);if(!cu(r,t.type,t.castingMode))throw new TypeError(j("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[va][e](t.byteOffset,i,ui)}}function Vu(t){return yt(t)}function Su(t){return yt(t.re||t.im)}function ju(t,e){return function(n){var r,i;dt(n)?(r="bool",i=xu(n)):N(n)?(r=Au.dtypes.real,i=xu(Vu(n))):eu(n)?(r="int64",i=xu(function(t){return yt(t)}(n))):ur(n)?(r=Eu(n)||Au.dtypes.complex,i=xu(Su(n))):(r="generic",i=yt(n));if(!cu(r,t.type,t.castingMode))throw new TypeError(j("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[va][e](t.byteOffset,i,ui)}}function Ru(t,e){return function(n){var r,i;eu(n)?(r="int64",i=n):N(n)?it(n)?(r=yu(n),i=vi(n)):(r=Au.dtypes.real,i=vi(et(n))):dt(n)?(r="bool",i=function(t){return vi(t?1:0)}(n)):ur(n)?(r=Eu(n)||Au.dtypes.complex,i=vi(et(n.re))):(r="generic",i=vi(et(Z(i))));if(!cu(r,t.type,t.castingMode))throw new TypeError(j("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[va][e](t.byteOffset,i,ui)}}function Lu(t){return Ee(t)&&pi(t[va])}var Iu=Di(Ja("complex_floating_point")),Bu=Di(Ja("boolean")),Fu=Di(Ja("real"));function Uu(t,e){if(hr(t))return vr(t,e);if(lr(t))return mr(t,e);throw new TypeError(j("invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.",t))}var Pu=8;function ku(t,e,n,r,i){var o,a,u,f;if(t<=0)return n;if((u=Wr(n)).accessorProtocol)return function(t,e,n,r,i){var o,a,u,f;for(o=n.data,a=n.accessors[1],u=i,f=0;f0)for(f=0;f0?null:new TypeError(j("invalid argument. `%s` field must be a non-empty string. Value: `%s`.",e,t))},type:function(t){return Yi($u,t)||Zi(t)?null:new TypeError(j('invalid argument. `%s` field must be either a struct type or one of the following: "%s". Value: `%s`.',"type",To($u,", "),t))},description:function(t,e){return St(t)?null:new TypeError(j("invalid argument. `%s` field must be a string. Value: `%s`.",e,t))},length:function(t,e){return Bt(t)?null:new TypeError(j("invalid argument. `%s` field must be a positive integer. Value: `%s`.",e,t))},enumerable:Wu,writable:Wu,default:Ka(null),castingMode:(Gu=["none","safe","mostly-safe","same-kind","unsafe"],function(t,e){return Yi(Gu,t)?null:new TypeError(j('invalid argument. `%s` field must be one of the following: "%s". Value: `%s`.',e,To(Gu,", "),t))})};function Xu(t,e){var n,r,i,o,a;for(n={isStructType:!1,description:"",byteLength:0,byteOffset:0,alignment:0,padding:0,enumerable:!0,writable:!0,default:void 0,castingMode:"none"},a=0;ae&&(e=n);return e}function Qu(t){var e,n,r,i,o,a,u;if(0===(e=t.fields).length)return null;for(r=[],u=0;u0&&o.byteOffset===t[a-1].byteOffset||(o.isStructType?e.push(ni(o.type.layout,r,rf(o.byteOffset))):e.push(j("|<%s>[%u,%u]",o.type,o.byteOffset,o.byteLength)));return"|"===(n=j("%s|",e.join("")))[n.length-2]&&(n=n.substring(0,n.length-1)),n}var af=["none","linear","layout"],uf=Di(af);function ff(t,e,n){var r;if(!Re(n))throw new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",n));if(r={format:"none"},J(n,"format")&&(r.format=n.format,!uf(r.format)))throw new TypeError(j('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"format",To(af,", "),n.format));return"linear"===r.format?function(t,e){var n,r,i,o,a,u,f,s,l,c,h,p,g,d,y,m,v,b,w,_,E,x;for(m=e.length,n="%"+(t.byteLength-1).toString().length+"s",d=0,_=0;_d&&(d=y);for(r="%"+d+"s",i="// %s",u="%s: %s %s",c=0,s=[],_=0;_0&&v.byteOffset===e[_-1].byteOffset)){for(l=_1?" (byte %u)":"",l){for(a=" => union: %s",f=[],x=_+1;x":b.type,f.push(j("%s<%s>[%u]",b.name,w,E%b.alignment)),x+=1;a=j(a,f.join(", "))}else a="";f=j(o+a,E%v.alignment),g=v.length?j(i,j("%s[%u]%s",v.type,et(E/v.alignment),f)):j(i,j("%s%s",v.type,f)),s.push(j(u,h,p,g)),c+=1}for(E=0;E"}function sf(){}var lf="foo"===sf.name;var cf=[Qe,on,mn,ln,Rn,xn,Zn,Pn,Yn],hf=["Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array"],pf=Xe()?Se(Qe):gf;function gf(){}pf="TypedArray"===function(t){if(!1===xe(t))throw new TypeError(j("invalid argument. Must provide a function. Value: `%s`.",t));return lf?t.name:le.exec(t.toString())[1]}(pf)?pf:gf;var df=[Fr,Ar],yf=["Complex64Array","Complex128Array"];function mf(){return"function"==typeof W&&"symbol"==typeof W("foo")&&J(W,"hasInstance")&&"symbol"==typeof W.hasInstance}var vf=mf()?Symbol.hasInstance:null,bf=mf();function wf(t,e){if("function"!=typeof e&&(!bf||"object"!=typeof e||"function"!=typeof e[vf]))throw new TypeError(j("invalid argument. Second argument must be callable. Value: `%s`.",e));return t instanceof e}var _f=[[Qe,"Float64Array"],[on,"Float32Array"],[mn,"Int32Array"],[ln,"Uint32Array"],[Rn,"Int16Array"],[xn,"Uint16Array"],[Zn,"Int8Array"],[Pn,"Uint8Array"],[Yn,"Uint8ClampedArray"],[Ar,"Complex64Array"],[Fr,"Complex128Array"],[Cr,"BooleanArray"]];function Ef(t){var e,n;for(n=0;n<_f.length;n++)if(wf(t,_f[n][0]))return _f[n][1];for(;t;){for(e=he(t),n=0;n<_f.length;n++)if(e===_f[n][1])return _f[n][1];t=Se(t)}}function xf(t){var e,n,r,i;if(function(t){var e,n;if("object"!=typeof t||null===t)return!1;if(t instanceof pf)return!0;for(n=0;n0){if(!Ee(t))throw new TypeError(j("invalid argument. First argument must be an object. Value: `%s`.",t));p=t}if(M(this,va,h),void 0!==p){for(f=oa(void 0,a.length),c={},y=0;y0&&((o=t[u-1]).padding=r,Ju(a)&&nf(o.fields,r)),a.byteOffset=i,Ju(a))for(f=0;f0?arguments[0]:{})})),M(s.prototype,"toJSON",(function(){if(!(this instanceof s))throw new Error("invalid invocation. `this` is not a struct instance.");return function(t,e){var n,r,i,o;for(n={},o=0;o=u.byteLength)throw new RangeError(j("invalid argument. Second argument exceeds the bounds of the ArrayBuffer. Value: `%s`.",n));if(2===a){if(!it(f=(u.byteLength-n)/e))throw new RangeError(j("invalid argument. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",e,u.byteLength-n))}else{if(!ut(f=r))throw new TypeError(j("invalid argument. Third argument must be a nonnegative integer. Value: `%s`.",f));if(f*e>u.byteLength-n)throw new RangeError(j("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",f*e))}}return M(this,"_buffer",u),M(this,"_byteOffset",n||0),M(this,"_byteLength",f*e),M(this,"_length",f),this}return e=i.byteLength,n=i.layout,r=i.fields,M(o,"BYTES_PER_ELEMENT",e),M(o,"name",Vf),M(o,"struct",i),Vt(o.prototype,"buffer",(function(){return this._buffer})),Vt(o.prototype,"byteLength",(function(){return this._byteLength})),Vt(o.prototype,"byteOffset",(function(){return this._byteOffset})),M(o.prototype,"BYTES_PER_ELEMENT",o.BYTES_PER_ELEMENT),M(o.prototype,"get",(function(t){if(!a(this))throw new TypeError(j("invalid invocation. `this` is not a %s.",Vf));if(!ut(t))throw new TypeError(j("invalid argument. Must provide a nonnegative integer. Value: `%s`.",t));if(!(t>=this._length))return new i(this._buffer,this._byteOffset+t*e,e)})),Vt(o.prototype,"length",(function(){return this._length})),M(o.prototype,"set",(function(t){var o,u,f,s,l,c,h,p,g,d,y,m;if(!a(this))throw new TypeError(j("invalid invocation. `this` is not a %s.",Vf));if(s=this._buffer,arguments.length>1){if(!ut(f=arguments[1]))throw new TypeError(j("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",f))}else f=0;if(u={format:"layout"},h=i.byteLength,!re(t)||Yi(r,"length")){if(f>=this._length)throw new RangeError(j("invalid argument. Index argument is out-of-bounds. Value: `%u`.",f));if(!Ee(t))throw new TypeError(j("invalid argument. Must provide either a valid object or a struct instance. Value: `%s`.",t));if(t.toString(u)===n)return o=i.viewOf(t),void ya(h,new Pn(o.buffer,o.byteOffset,h),1,0,new Pn(s,this._byteOffset+f*e,h),1,0);for(g=new i(s,this._byteOffset+f*e,h),y=0;ythis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(c=(o=t).get&&o.set?We("default"):Ye("default"),m=this._byteOffset+f*e,o.buffer===s&&o.byteOffsetm){for(l=[],y=0;y>18&63]+Lf[i>>12&63]+Lf[i>>6&63]+Lf[63&i]);return o.join("")}function kf(t){var e;Ff||Uf();for(var n=t.length,r=n%3,i="",o=[],a=16383,u=0,f=n-r;uf?f:u+a));return 1===r?(e=t[n-1],i+=Lf[e>>2],i+=Lf[e<<4&63],i+="=="):2===r&&(e=(t[n-2]<<8)+t[n-1],i+=Lf[e>>10],i+=Lf[e>>4&63],i+=Lf[e<<2&63],i+="="),o.push(i),o.join("")}function Mf(t,e,n,r,i){var o,a,u=8*i-r-1,f=(1<>1,l=-7,c=n?i-1:0,h=n?-1:1,p=t[e+c];for(c+=h,o=p&(1<<-l)-1,p>>=-l,l+=u;l>0;o=256*o+t[e+c],c+=h,l-=8);for(a=o&(1<<-l)-1,o>>=-l,l+=r;l>0;a=256*a+t[e+c],c+=h,l-=8);if(0===o)o=1-s;else{if(o===f)return a?NaN:1/0*(p?-1:1);a+=Math.pow(2,r),o-=s}return(p?-1:1)*a*Math.pow(2,o-r)}function Nf(t,e,n,r,i,o){var a,u,f,s=8*o-i-1,l=(1<>1,h=23===i?Math.pow(2,-24)-Math.pow(2,-77):0,p=r?0:o-1,g=r?1:-1,d=e<0||0===e&&1/e<0?1:0;for(e=Math.abs(e),isNaN(e)||e===1/0?(u=isNaN(e)?1:0,a=l):(a=Math.floor(Math.log(e)/Math.LN2),e*(f=Math.pow(2,-a))<1&&(a--,f*=2),(e+=a+c>=1?h/f:h*Math.pow(2,1-c))*f>=2&&(a++,f/=2),a+c>=l?(u=0,a=l):a+c>=1?(u=(e*f-1)*Math.pow(2,i),a+=c):(u=e*Math.pow(2,c-1)*Math.pow(2,i),a=0));i>=8;t[n+p]=255&u,p+=g,u/=256,i-=8);for(a=a<0;t[n+p]=255&a,p+=g,a/=256,s-=8);t[n+p-g]|=128*d}var Cf={}.toString,Yf=Array.isArray||function(t){return"[object Array]"==Cf.call(t)};Wf.TYPED_ARRAY_SUPPORT=void 0===Rf.TYPED_ARRAY_SUPPORT||Rf.TYPED_ARRAY_SUPPORT;var Df=zf();function zf(){return Wf.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function Jf(t,e){if(zf()=zf())throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+zf().toString(16)+" bytes");return 0|t}function Xf(t){return!(null==t||!t._isBuffer)}function Hf(t,e){if(Xf(t))return t.length;if("undefined"!=typeof ArrayBuffer&&"function"==typeof ArrayBuffer.isView&&(ArrayBuffer.isView(t)||t instanceof ArrayBuffer))return t.byteLength;"string"!=typeof t&&(t=""+t);var n=t.length;if(0===n)return 0;for(var r=!1;;)switch(e){case"ascii":case"latin1":case"binary":return n;case"utf8":case"utf-8":case void 0:return As(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*n;case"hex":return n>>>1;case"base64":return Os(t).length;default:if(r)return As(t).length;e=(""+e).toLowerCase(),r=!0}}function Qf(t,e,n){var r=!1;if((void 0===e||e<0)&&(e=0),e>this.length)return"";if((void 0===n||n>this.length)&&(n=this.length),n<=0)return"";if((n>>>=0)<=(e>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return gs(this,e,n);case"utf8":case"utf-8":return ls(this,e,n);case"ascii":return hs(this,e,n);case"latin1":case"binary":return ps(this,e,n);case"base64":return ss(this,e,n);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return ds(this,e,n);default:if(r)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),r=!0}}function ts(t,e,n){var r=t[e];t[e]=t[n],t[n]=r}function es(t,e,n,r,i){if(0===t.length)return-1;if("string"==typeof n?(r=n,n=0):n>2147483647?n=2147483647:n<-2147483648&&(n=-2147483648),n=+n,isNaN(n)&&(n=i?0:t.length-1),n<0&&(n=t.length+n),n>=t.length){if(i)return-1;n=t.length-1}else if(n<0){if(!i)return-1;n=0}if("string"==typeof e&&(e=Wf.from(e,r)),Xf(e))return 0===e.length?-1:ns(t,e,n,r,i);if("number"==typeof e)return e&=255,Wf.TYPED_ARRAY_SUPPORT&&"function"==typeof Uint8Array.prototype.indexOf?i?Uint8Array.prototype.indexOf.call(t,e,n):Uint8Array.prototype.lastIndexOf.call(t,e,n):ns(t,[e],n,r,i);throw new TypeError("val must be string, number or Buffer")}function ns(t,e,n,r,i){var o,a=1,u=t.length,f=e.length;if(void 0!==r&&("ucs2"===(r=String(r).toLowerCase())||"ucs-2"===r||"utf16le"===r||"utf-16le"===r)){if(t.length<2||e.length<2)return-1;a=2,u/=2,f/=2,n/=2}function s(t,e){return 1===a?t[e]:t.readUInt16BE(e*a)}if(i){var l=-1;for(o=n;ou&&(n=u-f),o=n;o>=0;o--){for(var c=!0,h=0;hi&&(r=i):r=i;var o=e.length;if(o%2!=0)throw new TypeError("Invalid hex string");r>o/2&&(r=o/2);for(var a=0;a>8,i=n%256,o.push(i),o.push(r);return o}(e,t.length-n),t,n,r)}function ss(t,e,n){return 0===e&&n===t.length?kf(t):kf(t.slice(e,n))}function ls(t,e,n){n=Math.min(t.length,n);for(var r=[],i=e;i239?4:s>223?3:s>191?2:1;if(i+c<=n)switch(c){case 1:s<128&&(l=s);break;case 2:128==(192&(o=t[i+1]))&&(f=(31&s)<<6|63&o)>127&&(l=f);break;case 3:o=t[i+1],a=t[i+2],128==(192&o)&&128==(192&a)&&(f=(15&s)<<12|(63&o)<<6|63&a)>2047&&(f<55296||f>57343)&&(l=f);break;case 4:o=t[i+1],a=t[i+2],u=t[i+3],128==(192&o)&&128==(192&a)&&128==(192&u)&&(f=(15&s)<<18|(63&o)<<12|(63&a)<<6|63&u)>65535&&f<1114112&&(l=f)}null===l?(l=65533,c=1):l>65535&&(l-=65536,r.push(l>>>10&1023|55296),l=56320|1023&l),r.push(l),i+=c}return function(t){var e=t.length;if(e<=cs)return String.fromCharCode.apply(String,t);var n="",r=0;for(;r0&&(t=this.toString("hex",0,50).match(/.{2}/g).join(" "),this.length>50&&(t+=" ... ")),""},Wf.prototype.compare=function(t,e,n,r,i){if(!Xf(t))throw new TypeError("Argument must be a Buffer");if(void 0===e&&(e=0),void 0===n&&(n=t?t.length:0),void 0===r&&(r=0),void 0===i&&(i=this.length),e<0||n>t.length||r<0||i>this.length)throw new RangeError("out of range index");if(r>=i&&e>=n)return 0;if(r>=i)return-1;if(e>=n)return 1;if(this===t)return 0;for(var o=(i>>>=0)-(r>>>=0),a=(n>>>=0)-(e>>>=0),u=Math.min(o,a),f=this.slice(r,i),s=t.slice(e,n),l=0;li)&&(n=i),t.length>0&&(n<0||e<0)||e>this.length)throw new RangeError("Attempt to write outside buffer bounds");r||(r="utf8");for(var o=!1;;)switch(r){case"hex":return rs(this,t,e,n);case"utf8":case"utf-8":return is(this,t,e,n);case"ascii":return os(this,t,e,n);case"latin1":case"binary":return as(this,t,e,n);case"base64":return us(this,t,e,n);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return fs(this,t,e,n);default:if(o)throw new TypeError("Unknown encoding: "+r);r=(""+r).toLowerCase(),o=!0}},Wf.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};var cs=4096;function hs(t,e,n){var r="";n=Math.min(t.length,n);for(var i=e;ir)&&(n=r);for(var i="",o=e;on)throw new RangeError("Trying to access beyond buffer length")}function ms(t,e,n,r,i,o){if(!Xf(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(e>i||et.length)throw new RangeError("Index out of range")}function vs(t,e,n,r){e<0&&(e=65535+e+1);for(var i=0,o=Math.min(t.length-n,2);i>>8*(r?i:1-i)}function bs(t,e,n,r){e<0&&(e=4294967295+e+1);for(var i=0,o=Math.min(t.length-n,4);i>>8*(r?i:3-i)&255}function ws(t,e,n,r,i,o){if(n+r>t.length)throw new RangeError("Index out of range");if(n<0)throw new RangeError("Index out of range")}function _s(t,e,n,r,i){return i||ws(t,0,n,4),Nf(t,e,n,r,23,4),n+4}function Es(t,e,n,r,i){return i||ws(t,0,n,8),Nf(t,e,n,r,52,8),n+8}Wf.prototype.slice=function(t,e){var n,r=this.length;if((t=~~t)<0?(t+=r)<0&&(t=0):t>r&&(t=r),(e=void 0===e?r:~~e)<0?(e+=r)<0&&(e=0):e>r&&(e=r),e0&&(i*=256);)r+=this[t+--e]*i;return r},Wf.prototype.readUInt8=function(t,e){return e||ys(t,1,this.length),this[t]},Wf.prototype.readUInt16LE=function(t,e){return e||ys(t,2,this.length),this[t]|this[t+1]<<8},Wf.prototype.readUInt16BE=function(t,e){return e||ys(t,2,this.length),this[t]<<8|this[t+1]},Wf.prototype.readUInt32LE=function(t,e){return e||ys(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},Wf.prototype.readUInt32BE=function(t,e){return e||ys(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},Wf.prototype.readIntLE=function(t,e,n){t|=0,e|=0,n||ys(t,e,this.length);for(var r=this[t],i=1,o=0;++o=(i*=128)&&(r-=Math.pow(2,8*e)),r},Wf.prototype.readIntBE=function(t,e,n){t|=0,e|=0,n||ys(t,e,this.length);for(var r=e,i=1,o=this[t+--r];r>0&&(i*=256);)o+=this[t+--r]*i;return o>=(i*=128)&&(o-=Math.pow(2,8*e)),o},Wf.prototype.readInt8=function(t,e){return e||ys(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},Wf.prototype.readInt16LE=function(t,e){e||ys(t,2,this.length);var n=this[t]|this[t+1]<<8;return 32768&n?4294901760|n:n},Wf.prototype.readInt16BE=function(t,e){e||ys(t,2,this.length);var n=this[t+1]|this[t]<<8;return 32768&n?4294901760|n:n},Wf.prototype.readInt32LE=function(t,e){return e||ys(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},Wf.prototype.readInt32BE=function(t,e){return e||ys(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},Wf.prototype.readFloatLE=function(t,e){return e||ys(t,4,this.length),Mf(this,t,!0,23,4)},Wf.prototype.readFloatBE=function(t,e){return e||ys(t,4,this.length),Mf(this,t,!1,23,4)},Wf.prototype.readDoubleLE=function(t,e){return e||ys(t,8,this.length),Mf(this,t,!0,52,8)},Wf.prototype.readDoubleBE=function(t,e){return e||ys(t,8,this.length),Mf(this,t,!1,52,8)},Wf.prototype.writeUIntLE=function(t,e,n,r){(t=+t,e|=0,n|=0,r)||ms(this,t,e,n,Math.pow(2,8*n)-1,0);var i=1,o=0;for(this[e]=255&t;++o=0&&(o*=256);)this[e+i]=t/o&255;return e+n},Wf.prototype.writeUInt8=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,1,255,0),Wf.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),this[e]=255&t,e+1},Wf.prototype.writeUInt16LE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,2,65535,0),Wf.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8):vs(this,t,e,!0),e+2},Wf.prototype.writeUInt16BE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,2,65535,0),Wf.TYPED_ARRAY_SUPPORT?(this[e]=t>>>8,this[e+1]=255&t):vs(this,t,e,!1),e+2},Wf.prototype.writeUInt32LE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,4,4294967295,0),Wf.TYPED_ARRAY_SUPPORT?(this[e+3]=t>>>24,this[e+2]=t>>>16,this[e+1]=t>>>8,this[e]=255&t):bs(this,t,e,!0),e+4},Wf.prototype.writeUInt32BE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,4,4294967295,0),Wf.TYPED_ARRAY_SUPPORT?(this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t):bs(this,t,e,!1),e+4},Wf.prototype.writeIntLE=function(t,e,n,r){if(t=+t,e|=0,!r){var i=Math.pow(2,8*n-1);ms(this,t,e,n,i-1,-i)}var o=0,a=1,u=0;for(this[e]=255&t;++o>0)-u&255;return e+n},Wf.prototype.writeIntBE=function(t,e,n,r){if(t=+t,e|=0,!r){var i=Math.pow(2,8*n-1);ms(this,t,e,n,i-1,-i)}var o=n-1,a=1,u=0;for(this[e+o]=255&t;--o>=0&&(a*=256);)t<0&&0===u&&0!==this[e+o+1]&&(u=1),this[e+o]=(t/a>>0)-u&255;return e+n},Wf.prototype.writeInt8=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,1,127,-128),Wf.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),t<0&&(t=255+t+1),this[e]=255&t,e+1},Wf.prototype.writeInt16LE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,2,32767,-32768),Wf.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8):vs(this,t,e,!0),e+2},Wf.prototype.writeInt16BE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,2,32767,-32768),Wf.TYPED_ARRAY_SUPPORT?(this[e]=t>>>8,this[e+1]=255&t):vs(this,t,e,!1),e+2},Wf.prototype.writeInt32LE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,4,2147483647,-2147483648),Wf.TYPED_ARRAY_SUPPORT?(this[e]=255&t,this[e+1]=t>>>8,this[e+2]=t>>>16,this[e+3]=t>>>24):bs(this,t,e,!0),e+4},Wf.prototype.writeInt32BE=function(t,e,n){return t=+t,e|=0,n||ms(this,t,e,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),Wf.TYPED_ARRAY_SUPPORT?(this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t):bs(this,t,e,!1),e+4},Wf.prototype.writeFloatLE=function(t,e,n){return _s(this,t,e,!0,n)},Wf.prototype.writeFloatBE=function(t,e,n){return _s(this,t,e,!1,n)},Wf.prototype.writeDoubleLE=function(t,e,n){return Es(this,t,e,!0,n)},Wf.prototype.writeDoubleBE=function(t,e,n){return Es(this,t,e,!1,n)},Wf.prototype.copy=function(t,e,n,r){if(n||(n=0),r||0===r||(r=this.length),e>=t.length&&(e=t.length),e||(e=0),r>0&&r=this.length)throw new RangeError("sourceStart out of bounds");if(r<0)throw new RangeError("sourceEnd out of bounds");r>this.length&&(r=this.length),t.length-e=0;--i)t[i+e]=this[i+n];else if(o<1e3||!Wf.TYPED_ARRAY_SUPPORT)for(i=0;i>>=0,n=void 0===n?this.length:n>>>0,t||(t=0),"number"==typeof t)for(o=e;o55295&&n<57344){if(!i){if(n>56319){(e-=3)>-1&&o.push(239,191,189);continue}if(a+1===r){(e-=3)>-1&&o.push(239,191,189);continue}i=n;continue}if(n<56320){(e-=3)>-1&&o.push(239,191,189),i=n;continue}n=65536+(i-55296<<10|n-56320)}else i&&(e-=3)>-1&&o.push(239,191,189);if(i=null,n<128){if((e-=1)<0)break;o.push(n)}else if(n<2048){if((e-=2)<0)break;o.push(n>>6|192,63&n|128)}else if(n<65536){if((e-=3)<0)break;o.push(n>>12|224,n>>6&63|128,63&n|128)}else{if(!(n<1114112))throw new Error("Invalid code point");if((e-=4)<0)break;o.push(n>>18|240,n>>12&63|128,n>>6&63|128,63&n|128)}}return o}function Os(t){return function(t){var e,n,r,i,o,a;Ff||Uf();var u=t.length;if(u%4>0)throw new Error("Invalid string. Length must be a multiple of 4");o="="===t[u-2]?2:"="===t[u-1]?1:0,a=new Bf(3*u/4-o),r=o>0?u-4:u;var f=0;for(e=0,n=0;e>16&255,a[f++]=i>>8&255,a[f++]=255&i;return 2===o?(i=If[t.charCodeAt(e)]<<2|If[t.charCodeAt(e+1)]>>4,a[f++]=255&i):1===o&&(i=If[t.charCodeAt(e)]<<10|If[t.charCodeAt(e+1)]<<4|If[t.charCodeAt(e+2)]>>2,a[f++]=i>>8&255,a[f++]=255&i),a}(function(t){if((t=function(t){return t.trim?t.trim():t.replace(/^\s+|\s+$/g,"")}(t).replace(xs,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function Vs(t,e,n,r){for(var i=0;i=e.length||i>=t.length);++i)e[i+n]=t[i];return i}function Ss(t){return null!=t&&(!!t._isBuffer||js(t)||function(t){return"function"==typeof t.readFloatLE&&"function"==typeof t.slice&&js(t.slice(0,0))}(t))}function js(t){return!!t.constructor&&"function"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}jf(Object.freeze({__proto__:null,Buffer:Wf,INSPECT_MAX_BYTES:50,SlowBuffer:function(t){return+t!=t&&(t=0),Wf.alloc(+t)},isBuffer:Ss,kMaxLength:Df})).Buffer;var Rs=function(){throw new Error("not implemented")};function Ls(){throw new Error("not implemented")}var Is={binary:Rs,float64:Qe,float32:on,float16:Ls,generic:Array,int16:Rn,int32:mn,int8:Zn,uint16:xn,uint32:ln,uint8:Pn,uint8c:Yn,complex32:Ls,complex64:Ar,complex128:Fr,bool:Cr},Bs={};var Fs=xe(Rs.allocUnsafe)?function(t){if(!st(t))throw new TypeError(j("invalid argument. Must provide a nonnegative integer. Value: `%s`.",t));return Rs.allocUnsafe(t)}:function(t){if(!st(t))throw new TypeError(j("invalid argument. Must provide a nonnegative integer. Value: `%s`.",t));return new Rs(t)};function Us(t){return function(t,e,n,r){var i;return function(t,e){return"function"==typeof t["fill"]}(t)?t.fill(e,n,r):(n<0&&(n+=t.length)<0&&(n=0),r<0?r+=t.length:r>t.length&&(r=t.length),(i=Wr(t)).accessorProtocol?function(t,e,n,r){var i,o,a;for(i=t.data,o=t.accessors[1],a=n;ae?e:t}function zl(t,e){var n=e+1;return t<0?((t+=n)<0&&0!==(t%=n)&&(t+=n),t):t>e?((t-=n)>e&&(t%=n),t):t}function Jl(t,e){return t<0?(t+=e+1)<0?-1:t:t>e?-1:t}var Wl=Di(Oi()),$l={wrap:zl,clamp:Dl,normalize:function(t,e){var n=Jl(t,e);if(n<0||n>e)throw new RangeError(j("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return n},throw:function(t,e){if(t<0||t>e)throw new RangeError(j("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return t}};function Gl(t,e,n){var r;if("clamp"===n)return Dl(t,e);if("wrap"===n)return zl(t,e);if(r=t,"normalize"===n&&(r=Jl(r,e)),r<0||r>e)throw new RangeError(j("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return r}M(Gl,"factory",(function(t){if(!Wl(t))throw new TypeError(j("invalid argument. First argument must be a recognized index mode. Value: `%s`.",t));return $l[t]}));var Zl=Ni.prototype.iget;var ql=Ni.prototype.iset;function Kl(t,e){var n,r;for(n=[],r=0;r0))throw new TypeError(j("invalid argument. Third argument must be an array-like object containing nonnegative integers. Value: `%s`.",n));if((u=n.length)>32767)throw new RangeError(j("invalid argument. Number of dimensions must not exceed %u due to stack limits. Value: `%u`.",32767,u));if(!Ul(r))throw new TypeError(j("invalid argument. Fourth argument must be an array-like object containing integers. Value: `%s`.",r));if(u>0){if(r.length!==u)throw new RangeError(j("invalid argument. Fourth argument length must match the number of dimensions. Expected number of dimensions: `%u`. Strides length: `%u`.",u,r.length))}else{if(1!==r.length)throw new RangeError("invalid argument. Fourth argument length must be equal to 1 when creating a zero-dimensional ndarray.");if(0!==r[0])throw new RangeError(j("invalid argument. Fourth argument must contain a single element equal to 0. Value: `%d`.",r[0]))}if(!ut(i))throw new TypeError(j("invalid argument. Fifth argument must be a nonnegative integer. Value: `%s`.",i));if(!bo(o))throw new TypeError(j("invalid argument. Sixth argument must be a supported order. Value: `%s`.",o));if(u>0&&!function(t,e,n,r){var i=Kr(e,n,r);return i[0]>=0&&i[1]0)throw new Error("invalid arguments. Input buffer is incompatible with the specified meta data. Ensure that the offset is valid with regard to the strides array and that the buffer has enough elements to satisfy the desired array shape.");if((f={}).mode=Xl,f.readonly=false,arguments.length>6&&(s=function(t,e){var n;if(!Re(e))return new TypeError(j("invalid argument. Options argument must be an object. Value: `%s`.",e));if(J(e,"mode")&&(t.mode=e.mode,!Wl(t.mode)))return new TypeError(j("invalid option. `%s` option must be a recognized mode. Option: `%s`.","mode",t.mode));if(J(e,"submode")){if(t.submode=e.submode,!qn(t.submode))return new TypeError(j("invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.","submode",t.submode));if(0===t.submode.length)return new TypeError(j("invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.","submode",t.submode.join(",")));for(n=0;n0){if(!it(t))throw new TypeError(j("invalid argument. Index must be an integer. Value: `%s`.",t));return t=Gl(t,this._length-1,this._mode),Zl.call(this,t)}return Zl.call(this)})),M(Hl.prototype,"set",(function(){var t,e,n,r;if(this._flags.READONLY)throw new Error("invalid invocation. Cannot write to a read-only array.");if(arguments.length!==this._ndims+1)throw new RangeError(j("invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.",this._ndims,arguments.length));for(t=this._offset,n=this._submode.length,r=0;r0){if(!it(t))throw new TypeError(j("invalid argument. Index must be an integer. Value: `%s`.",t));t=Gl(t,this._length-1,this._mode),ql.call(this,t,e)}else ql.call(this,t);return this}));var tc=["First","Second","Third"];function ec(t,e,n,r,i){var o,a,u;if(!(this instanceof ec))return arguments.length<5?new ec(t,e,n,r):new ec(t,e,n,r,i);if(!xe(t))throw new TypeError(Ql("null3c",t));if(!re(e))throw new TypeError(Ql("null2y",e));for(e=function(t){var e,n,r,i;for(r=Ao(t),n=t.length,e=[],i=0;i4){if(!Re(i))throw new TypeError(Ql("null2V",i));if(J(i,"order")&&(o.order=i.order,!bo(o.order)))throw new TypeError(Ql("invalid option. `%s` option must be a valid memory layout. Option: `%s`.","order",o.order))}return this._prng=t,this._idtypes=e,this._odtypes=n,this._policies={output:r.output},this._opts=o,this}return M(ec.prototype,"generate",(function(t,e,n,r){var i,o,a,u,f,s,l,c,h,p,g,d,y,m,v;if(!ht(t)&&("object"!=typeof(v=t)||null===v||0!==v.length))throw new TypeError(Ql("null5o",t));if(a={},arguments.length>3&&(f=function(t,e,n){return Re(n)?J(n,"dtype")&&(t.dtype=to(n.dtype),!Yi(e,t.dtype))?new TypeError(Ql("null4S","dtype",To(e,'", "'),n.dtype)):(J(n,"order")&&(t.order=n.order),J(n,"mode")&&(t.mode=n.mode),J(n,"submode")&&(t.submode=n.submode),J(n,"readonly")&&(t.readonly=n.readonly),null):new TypeError(Ql("null2V",n))}(a,this._odtypes,r),f))throw f;for(i=function(t){var e,n,r,i;for(e=[],i=0;i 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/**\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// 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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/**\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 isArrayLike from '@stdlib/assert-is-array-like';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array-like object passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array-like object 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 = arraylikefcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arraylikefcn( 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-like object 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-like object 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 ( !isArrayLike( 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 arraylikefcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 array-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is array-like\n*\n* @example\n* var bool = isArrayLike( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLike( { 'length': 10 } );\n* // returns true\n*/\nfunction isArrayLike( value ) {\n\treturn (\n\t\tvalue !== void 0 &&\n\t\tvalue !== null &&\n\t\ttypeof value !== 'function' &&\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 isArrayLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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-like object containing only nonnegative integers.\n*\n* @module @stdlib/assert-is-nonnegative-integer-array\n*\n* @example\n* import isNonNegativeIntegerArray from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ 3.0, new Number(3.0) ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 3.0, '3.0' ] );\n* // returns false\n*\n* @example\n* import { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ 1.0, 0.0, 10.0 ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 3.0, new Number(1.0) ] );\n* // returns false\n*\n* @example\n* import { objects as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ new Number(3.0), new Number(1.0) ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 1.0, 0.0, 10.0 ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-like-function';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isNonNegativeInteger.isPrimitive );\nvar isObjectArray = arrayfun( isNonNegativeInteger.isObject );\n\n\n// MAIN //\n\nvar isNonNegativeIntegerArray = arrayfun( isNonNegativeInteger );\nsetReadOnly( isNonNegativeIntegerArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isNonNegativeIntegerArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isNonNegativeIntegerArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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) 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 getGlobal from '@stdlib/utils-global';\n\n\n// VARIABLES //\n\nvar Global = getGlobal();\n\n\n// MAIN //\n\n/**\n* Tests for native `BigInt` support.\n*\n* @returns {boolean} boolean indicating if an environment has `BigInt` support\n*\n* @example\n* var bool = hasBigIntSupport();\n* // returns \n*/\nfunction hasBigIntSupport() {\n\treturn (\n\t\ttypeof Global.BigInt === 'function' &&\n\t\ttypeof BigInt === 'function' && // eslint-disable-line stdlib/require-globals\n\t\ttypeof Global.BigInt( '1' ) === 'bigint' &&\n\t\ttypeof BigInt( '1' ) === 'bigint' // eslint-disable-line stdlib/require-globals, no-undef, stdlib/no-builtin-big-int\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasBigIntSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* 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// 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/**\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/**\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 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/**\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 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/**\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 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\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// 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\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) 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// 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 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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// 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 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// 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) 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 array iteration order.\n*\n* ## Notes\n*\n* - Return value key:\n*\n* - `0`: unordered (i.e., strides of mixed sign; e.g., `[ 9, -3, 1 ]`)\n* - `1`: ordered left-to-right (i.e., all nonnegative strides)\n* - `-1`: ordered right-to-left (i.e., all negative strides)\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} iteration order\n*\n* @example\n* var o = iterationOrder( [ 2, 1 ] );\n* // returns 1\n*\n* o = iterationOrder( [ -2, 1 ] );\n* // returns 0\n*\n* o = iterationOrder( [ -2, -1 ] );\n* // returns -1\n*/\nfunction iterationOrder( strides ) {\n\tvar cnt;\n\tvar i;\n\n\tcnt = 0;\n\tfor ( i = 0; i < strides.length; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\tcnt += 1;\n\t\t}\n\t}\n\tif ( cnt === 0 ) {\n\t\t// All nonnegative strides:\n\t\treturn 1|0; // asm-type annotation\n\t}\n\tif ( cnt === strides.length ) {\n\t\t// All negative strides:\n\t\treturn -1|0; // asm-type annotation\n\t}\n\t// Strides of mixed signs:\n\treturn 0|0; // asm-type annotation\n}\n\n\n// EXPORTS //\n\nexport default iterationOrder;\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) 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'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) 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) 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// 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// 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// 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// 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// 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/**\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// 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// 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/**\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// 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// 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/**\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// 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// 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// 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// 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/**\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\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) 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) 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) 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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// VARIABLES //\n\nvar arraySlice = Array.prototype.slice;\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'slice' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns a shallow copy of a portion of an array using the `Array#slice` built-in.\n*\n* @private\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = builtin( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction builtin( x, start, end ) {\n\treturn arraySlice.call( x, start, end );\n}\n\n/**\n* Returns a shallow copy of a portion of an accessor array.\n*\n* @private\n* @param {Object} x - input array object\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} 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 x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction accessors( x, start, end ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\tout = [];\n\tfor ( i = start; i < end; i++ ) {\n\t\tout.push( get( data, i ) );\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of a portion of an array.\n*\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\nfunction slice( x, start, end ) {\n\tvar obj;\n\tif ( hasMethod( x, 'slice' ) ) {\n\t\treturn x.slice( start, end );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, start, end );\n\t}\n\t// Assume we can use the built-in `Array#slice` method to copy elements to a generic array:\n\treturn builtin( x, start, end );\n}\n\n\n// EXPORTS //\n\nexport default slice;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Determines if an array is column-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is column-major contiguous\n*/\nfunction isColumnMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 2 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Determines if an array is row-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is row-major contiguous\n*/\nfunction isRowMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 1 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isRowMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar RE_CHARS = /[-\\/\\\\^$*+?.()|[\\]{}]/g; // eslint-disable-line no-useless-escape\n\n\n// MAIN //\n\n/**\n* Escapes a regular expression string.\n*\n* @param {string} str - regular expression string\n* @throws {TypeError} first argument must be a string\n* @returns {string} escaped string\n*\n* @example\n* var str = rescape( '[A-Z]*' );\n* // returns '\\[A\\-Z\\]\\*'\n*/\nfunction rescape( str ) {\n\tvar len;\n\tvar s;\n\tvar i;\n\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a regular expression string. Value: `%s`.', str ) );\n\t}\n\t// Check if the string starts with a forward slash...\n\tif ( str[ 0 ] === '/' ) {\n\t\t// Find the last forward slash...\n\t\tlen = str.length;\n\t\tfor ( i = len-1; i >= 0; i-- ) {\n\t\t\tif ( str[ i ] === '/' ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t// If we searched the string to no avail or if the first letter is not `/`, assume that the string is not of the form `/[...]/[guimy]`:\n\tif ( i === void 0 || i <= 0 ) {\n\t\treturn str.replace( RE_CHARS, '\\\\$&' );\n\t}\n\t// We need to de-construct the string...\n\ts = str.substring( 1, i );\n\n\t// Only escape the characters between the `/`:\n\ts = s.replace( RE_CHARS, '\\\\$&' );\n\n\t// Reassemble:\n\tstr = str[ 0 ] + s + str.substring( i );\n\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default rescape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express 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 exec = RegExp.prototype.exec; // non-generic\n\n\n// EXPORTS //\n\nexport default exec;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 './try2exec.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a regular expression.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a regular expression\n*\n* @example\n* var bool = isRegExp( /\\.+/ );\n* // returns true\n*\n* @example\n* var bool = isRegExp( {} );\n* // returns false\n*/\nfunction isRegExp( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof RegExp ) {\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 RegExp]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isRegExp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport exec from './exec.js';\n\n\n// MAIN //\n\n/**\n* Attempts to call a `RegExp` method.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if able to call a `RegExp` method\n*/\nfunction test( value ) {\n\ttry {\n\t\texec.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) 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* Replaces search occurrences with a replacement string.\n*\n* @param {string} str - input string\n* @param {RegExp} search - search expression\n* @param {(string|Function)} newval - replacement value or function\n* @returns {string} new string containing replacement(s)\n*\n* @example\n* var str = 'Hello World';\n* var out = replace( str, /world/i, 'Mr. President' );\n* // returns 'Hello Mr. President'\n*\n* @example\n* import capitalize from '@stdlib/string-base-capitalize';\n*\n* var str = 'Oranges and lemons say the bells of St. Clement\\'s';\n*\n* function replacer( match, p1 ) {\n* return capitalize( p1 );\n* }\n*\n* var out = replace( str, /([^\\s]*)/gi, replacer );\n* // returns 'Oranges And Lemons Say The Bells Of St. Clement\\'s'\n*/\nfunction replace( str, search, newval ) {\n\treturn str.replace( search, newval );\n}\n\n\n// EXPORTS //\n\nexport default replace;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport rescape from '@stdlib/utils-escape-regexp-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isRegExp from '@stdlib/assert-is-regexp';\nimport format from '@stdlib/string-format';\nimport base from '@stdlib/string-base-replace';\n\n\n// MAIN //\n\n/**\n* Replaces search occurrences with a replacement string.\n*\n* @param {string} str - input string\n* @param {(string|RegExp)} search - search expression\n* @param {(string|Function)} newval - replacement value or function\n* @throws {TypeError} first argument must be a string\n* @throws {TypeError} second argument must be a string or regular expression\n* @throws {TypeError} third argument must be a string or function\n* @returns {string} new string containing replacement(s)\n*\n* @example\n* var str = 'beep';\n* var out = replace( str, 'e', 'o' );\n* // returns 'boop'\n*\n* @example\n* var str = 'Hello World';\n* var out = replace( str, /world/i, 'Mr. President' );\n* // returns 'Hello Mr. President'\n*\n* @example\n* import capitalize from '@stdlib/string-capitalize';\n*\n* var str = 'Oranges and lemons say the bells of St. Clement\\'s';\n*\n* function replacer( match, p1 ) {\n* return capitalize( p1 );\n* }\n*\n* var out = replace( str, /([^\\s]*)/gi, replacer );\n* // returns 'Oranges And Lemons Say The Bells Of St. Clement\\'s'\n*/\nfunction replace( str, search, newval ) {\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', str ) );\n\t}\n\tif ( isString( search ) ) {\n\t\tsearch = new RegExp( rescape( search ), 'g' );\n\t} else if ( !isRegExp( search ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a string or regular expression. Value: `%s`.', search ) );\n\t}\n\tif ( !isString( newval ) && !isFunction( newval ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a string or replacement function. Value: `%s`.', newval ) );\n\t}\n\treturn base( str, search, newval );\n}\n\n\n// EXPORTS //\n\nexport default replace;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport replace from '@stdlib/string-replace';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// VARIABLES //\n\nvar CTORS = {\n\t'int8': 'new Int8Array( [ {{data}} ] )',\n\t'uint8': 'new Uint8Array( [ {{data}} ] )',\n\t'uint8c': 'new Uint8ClampedArray( [ {{data}} ] )',\n\t'int16': 'new Int16Array( [ {{data}} ] )',\n\t'uint16': 'new Uint16Array( [ {{data}} ] )',\n\t'int32': 'new Int32Array( [ {{data}} ] )',\n\t'uint32': 'new Uint32Array( [ {{data}} ] )',\n\t'float32': 'new Float32Array( [ {{data}} ] )',\n\t'float64': 'new Float64Array( [ {{data}} ] )',\n\t'generic': '[ {{data}} ]',\n\t'binary': 'new Buffer( [ {{data}} ] )',\n\t'complex64': 'new Complex64Array( [ {{data}} ] )',\n\t'complex128': 'new Complex128Array( [ {{data}} ] )',\n\t'bool': 'new BooleanArray( [ {{data}} ] )'\n};\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {string} string representation\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar buffer;\n\tvar ndims;\n\tvar ctor;\n\tvar str;\n\tvar dt;\n\tvar v;\n\tvar i;\n\n\tndims = this._shape.length;\n\tdt = this._dtype;\n\n\t// Function to invoke to create an ndarray:\n\tstr = 'ndarray( \\''+dt+'\\', ';\n\n\t// Data buffer parameter...\n\tbuffer = '';\n\tif ( this._length <= 100 ) {\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// First three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuffer += ', ..., ';\n\n\t\t// Last three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tv = this.iget( this._length-1-i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tbuffer += this.iget( this._length-1-i );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tctor = CTORS[ this.dtype ];\n\tstr += replace( ctor, '{{data}}', buffer );\n\tstr += ', ';\n\n\t// Array shape...\n\tif ( ndims === 0 ) {\n\t\tstr += '[]';\n\t} else {\n\t\tstr += '[ ' + this._shape.join( ', ' ) + ' ]';\n\t}\n\tstr += ', ';\n\n\t// Stride array...\n\tstr += '[ ';\n\tif ( ndims === 0 ) {\n\t\tstr += '0';\n\t} else {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( this._strides[ i ] < 0 ) {\n\t\t\t\tstr += -this._strides[ i ];\n\t\t\t} else {\n\t\t\t\tstr += this._strides[ i ];\n\t\t\t}\n\t\t\tif ( i < ndims-1 ) {\n\t\t\t\tstr += ', ';\n\t\t\t}\n\t\t}\n\t}\n\tstr += ' ]';\n\tstr += ', ';\n\n\t// Buffer offset:\n\tstr += '0';\n\tstr += ', ';\n\n\t// Order:\n\tstr += '\\'' + this._order + '\\'';\n\n\t// Close the function call:\n\tstr += ' )';\n\treturn str;\n\n\t/* eslint-enable no-invalid-this */\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// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint16Array from '@stdlib/array-uint16';\n\n\n// MAIN //\n\nvar ctors = {\n\t'uint16': Uint16Array,\n\t'uint8': Uint8Array\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctors from './ctors.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if an environment is little endian.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment is little endian\n*\n* @example\n* var bool = isLittleEndian();\n* // returns \n*/\nfunction isLittleEndian() {\n\tvar uint16view;\n\tvar uint8view;\n\n\tuint16view = new ctors[ 'uint16' ]( 1 );\n\n\t/*\n\t* Set the uint16 view to a value having distinguishable lower and higher order words.\n\t*\n\t* 4660 => 0x1234 => 0x12 0x34 => '00010010 00110100' => (0x12,0x34) == (18,52)\n\t*/\n\tuint16view[ 0 ] = 0x1234;\n\n\t// Create a uint8 view on top of the uint16 buffer:\n\tuint8view = new ctors[ 'uint8' ]( uint16view.buffer );\n\n\t// If little endian, the least significant byte will be first...\n\treturn ( uint8view[ 0 ] === 0x34 );\n}\n\n\n// MAIN //\n\nbool = isLittleEndian();\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 main = ( typeof ArrayBuffer === 'function' ) ? ArrayBuffer : 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 ArrayBuffer === 'function' ) ? ArrayBuffer : 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* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\n*\n* @module @stdlib/array-buffer\n*\n* @example\n* import ctor from '@stdlib/array-buffer';\n*\n* var buf = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasArrayBufferSupport from '@stdlib/assert-has-arraybuffer-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasArrayBufferSupport() ) {\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 isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport Float64Array from '@stdlib/array-float64';\nimport GlobalArrayBuffer from './arraybuffer.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `ArrayBuffer` support.\n*\n* @returns {boolean} boolean indicating if an environment has `ArrayBuffer` support\n*\n* @example\n* var bool = hasArrayBufferSupport();\n* // returns \n*/\nfunction hasArrayBufferSupport() {\n\tvar bool;\n\tvar view;\n\tvar buf;\n\n\tif ( typeof GlobalArrayBuffer !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tbuf = new GlobalArrayBuffer( 16 );\n\t\tbool = ( isArrayBuffer( buf ) && typeof GlobalArrayBuffer.isView === 'function' );\n\t\tif ( bool ) {\n\t\t\tview = new Float64Array( buf );\n\t\t\tview[ 0 ] = -3.14;\n\t\t\tview[ 1 ] = NaN;\n\t\t\tbool = (\n\t\t\t\tbool &&\n\t\t\t\tGlobalArrayBuffer.isView( view ) &&\n\t\t\t\tbuf.byteLength === 16 &&\n\t\t\t\tview[ 0 ] === -3.14 &&\n\t\t\t\tview[ 1 ] !== view[ 1 ]\n\t\t\t);\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 hasArrayBufferSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\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) 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 nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasDataView = ( typeof DataView === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `DataView`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a DataView\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n* import DataView from '@stdlib/array-dataview';\n*\n* var bool = isDataView( new DataView( new ArrayBuffer( 10 ) ) );\n* // returns true\n*\n* @example\n* var bool = isDataView( [] );\n* // returns false\n*/\nfunction isDataView( value ) {\n\treturn (\n\t\t( hasDataView && value instanceof DataView ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object DataView]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataView;\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\nvar main = ( typeof DataView === 'function' ) ? DataView : 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) 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\nvar ctor = ( typeof DataView === 'function' ) ? DataView : 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) 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* Constructor which returns a data view representing a provided array buffer.\n*\n* @module @stdlib/array-dataview\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n* import DataView from '@stdlib/array-dataview';\n*\n* var buf = new ArrayBuffer( 10 );\n* // returns \n*\n* var dv = new DataView( buf );\n* // returns \n*/\n\n// MODULES //\n\nimport hasDataViewSupport from '@stdlib/assert-has-dataview-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasDataViewSupport() ) {\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) 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 isDataView from '@stdlib/assert-is-dataview';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport GlobalDataView from './dataview.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `DataView` support.\n*\n* @returns {boolean} boolean indicating if an environment has `DataView` support\n*\n* @example\n* var bool = hasDataViewSupport();\n* // returns \n*/\nfunction hasDataViewSupport() {\n\tvar bool;\n\tvar view;\n\tvar buf;\n\n\tif ( typeof GlobalDataView !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tbuf = new ArrayBuffer( 24 );\n\t\tview = new GlobalDataView( buf, 8 );\n\t\tbool = ( isDataView( view ) && typeof view.getFloat64 === 'function' && typeof view.setFloat64 === 'function' );\n\t\tif ( bool ) {\n\t\t\tview.setFloat64( 0, -3.14 );\n\t\t\tview.setFloat64( 8, NaN );\n\t\t\tbool = (\n\t\t\t\tbool &&\n\t\t\t\tview.buffer === buf &&\n\t\t\t\tview.byteLength === 16 &&\n\t\t\t\tview.byteOffset === 8 &&\n\t\t\t\tview.getFloat64( 0 ) === -3.14 &&\n\t\t\t\tview.getFloat64( 8 ) !== view.getFloat64( 8 )\n\t\t\t);\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 hasDataViewSupport;\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// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Constructor which returns a data view representing a provided array buffer.\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) 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/* global BigInt */\n\n'use strict';\n\n// MAIN //\n\nvar BigInteger = ( typeof BigInt === 'function' ) ? BigInt : void 0; // eslint-disable-line stdlib/require-globals, node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default BigInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ORDERS from './orders.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray orders.\n*\n* @returns {StringArray} list of ndarray orders\n*\n* @example\n* var list = orders();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\nfunction orders() {\n\treturn ORDERS.slice();\n}\n\n\n// EXPORTS //\n\nexport default orders;\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/**\n* Returns an object mapping supported layouts to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `row-major == 101`). Instead, the object should be used in an opaque manner.\n* - The main purpose of this function is JavaScript and C inter-operation of array objects.\n*\n* @returns {Object} object mapping supported layouts to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `layouts.h` enumeration!!!!\n\treturn {\n\t\t// Row-major (C-style):\n\t\t'row-major': 101,\n\n\t\t// Column-major (Fortran-style):\n\t\t'column-major': 102\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\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/**\n* Return a list of BLAS memory layouts.\n*\n* @module @stdlib/blas-base-layouts\n*\n* @example\n* import layouts from '@stdlib/blas-base-layouts';\n*\n* var list = layouts();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\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// MODULES //\n\nimport DATA from './data.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of BLAS memory layouts.\n*\n* @returns {StringArray} list of memory layouts\n*\n* @example\n* var list = layouts();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\nfunction layouts() {\n\treturn DATA.slice();\n}\n\n\n// EXPORTS //\n\nexport default layouts;\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 { enum as layouts } from '@stdlib/blas-base-layouts';\n\n\n// VARIABLES //\n\nvar LAYOUTS = layouts();\n\n\n// MAIN //\n\n/**\n* Returns an object mapping supported orders to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `row-major == 1`). 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 orders to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `orders.h` enumeration!!!!\n\treturn {\n\t\t// Row-major (C-style):\n\t\t'row-major': LAYOUTS[ 'row-major' ],\n\n\t\t// Column-major (Fortran-style):\n\t\t'column-major': LAYOUTS[ 'column-major' ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 list of ndarray orders.\n*\n* @module @stdlib/ndarray-orders\n*\n* @example\n* import orders from '@stdlib/ndarray-orders';\n*\n* var list = orders();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\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 MODES from './modes.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray index modes.\n*\n* @returns {StringArray} list of ndarray index modes\n*\n* @example\n* var list = modes();\n* // returns [ 'throw', 'normalize', 'clamp', 'wrap' ]\n*/\nfunction modes() {\n\treturn MODES.slice();\n}\n\n\n// EXPORTS //\n\nexport default modes;\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 an object mapping supported index modes to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `throw == 1`). 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 index modes to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `index_modes.h` enumeration!!!!\n\treturn {\n\t\t'throw': 1,\n\t\t'clamp': 2,\n\t\t'wrap': 3,\n\t\t'normalize': 4\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 list of ndarray index modes.\n*\n* @module @stdlib/ndarray-index-modes\n*\n* @example\n* import modes from '@stdlib/ndarray-index-modes';\n*\n* var list = modes();\n* // returns [ 'throw', 'normalize', 'clamp', 'wrap' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport modes from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( modes, 'enum', enumeration );\n\n\n// EXPORTS //\n\nexport default modes;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport BigInt from '@stdlib/bigint-ctor';\nimport dtypes from '@stdlib/ndarray-base-dtype-enums';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* [int8],\n* [int16],\n* [int64],\n* [ndims*int64],\n* [ndims*int64],\n* [int64],\n* [int8],\n* [int8],\n* [int64],\n* [nsubmodes*int8],\n* [int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create a view for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tv.setBigInt64( o, BigInt( N ), IS_LITTLE_ENDIAN );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv.setBigInt64( o, BigInt( sh[i] ), IS_LITTLE_ENDIAN );\n\t\tv.setBigInt64( o+s, BigInt( st[i]*nbytes ), IS_LITTLE_ENDIAN );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tv.setBigInt64( o, BigInt( this._offset*nbytes ), IS_LITTLE_ENDIAN );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tv.setBigInt64( o, BigInt( M ), IS_LITTLE_ENDIAN );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Uint8Array from '@stdlib/array-uint8';\nimport DataView from '@stdlib/array-dataview';\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// VARIABLES //\n\n// 0xFFFFFFFF = 2**32 - 1 => 11111111 11111111 11111111 11111111\nvar LOW_MASK = 0xFFFFFFFF >>> 0;\n\n// 2**32\nvar TWO_32 = 4294967296;\n\n// Byte array workspace:\nvar BYTES = new Uint8Array( 8 );\nvar VIEW = new DataView( BYTES.buffer );\n\n\n// MAIN //\n\n/**\n* Converts an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* ## Notes\n*\n* - This function assumes that the input value is less than the maximum safe double-precision floating-point integer plus one (i.e., `2**53`).\n*\n* @param {number} x - input value\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* import Uint8Array from '@stdlib/array-uint8';\n*\n* var out = new Uint8Array( 8 );\n* var bytes = float64ToInt64Bytes( 1.0, out, 1, 0 );\n* // returns \n*/\nfunction float64ToInt64Bytes( x, out, stride, offset ) {\n\tvar hi;\n\tvar lo;\n\tvar i;\n\n\tif ( x === 0 ) {\n\t\tfor ( i = 0; i < BYTES.length; i++ ) {\n\t\t\tout[ offset ] = 0;\n\t\t\toffset += stride;\n\t\t}\n\t\treturn out;\n\t}\n\t// Get the low 32-bit word:\n\tlo = (x&LOW_MASK)>>>0;\n\n\t// Get the high 32-bit word:\n\thi = floor( x/TWO_32 );\n\n\t// Insert the high and low words according to host byte order (endianness):\n\tif ( IS_LITTLE_ENDIAN ) {\n\t\tVIEW.setUint32( 0, lo, IS_LITTLE_ENDIAN );\n\t\tVIEW.setUint32( 4, hi, IS_LITTLE_ENDIAN );\n\t} else {\n\t\tVIEW.setUint32( 0, hi, IS_LITTLE_ENDIAN );\n\t\tVIEW.setUint32( 4, lo, IS_LITTLE_ENDIAN );\n\t}\n\tfor ( i = 0; i < BYTES.length; i++ ) {\n\t\tout[ offset ] = BYTES[ i ];\n\t\toffset += stride;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default float64ToInt64Bytes;\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* Convert an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* @module @stdlib/number-float64-base-to-int64-bytes\n*\n* @example\n* import float64ToInt64Bytes from '@stdlib/number-float64-base-to-int64-bytes';\n*\n* var bytes = float64ToInt64Bytes( 1.0 );\n* // returns \n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n* import float64ToInt64Bytes from '@stdlib/number-float64-base-to-int64-bytes';\n*\n* var out = new Uint8Array( 8 );\n* var bytes = float64ToInt64Bytes( 1.0, out, 1, 0 );\n* // returns \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) 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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Uint8Array from '@stdlib/array-uint8';\nimport DataView from '@stdlib/array-dataview';\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// VARIABLES //\n\n// 0xFFFFFFFF = 2**32 - 1 => 11111111 11111111 11111111 11111111\nvar LOW_MASK = 0xFFFFFFFF >>> 0;\n\n// 2**32\nvar TWO_32 = 4294967296;\n\n\n// MAIN //\n\n/**\n* Converts an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* ## Notes\n*\n* - This function assumes that the input value is less than the maximum safe double-precision floating-point integer plus one (i.e., `2**53`).\n*\n* @param {number} x - input value\n* @returns {Uint8Array} byte array\n*\n* @example\n* var bytes = float64ToInt64Bytes( 1.0 );\n* // returns \n*/\nfunction float64ToInt64Bytes( x ) {\n\tvar bytes;\n\tvar view;\n\tvar hi;\n\tvar lo;\n\n\tbytes = new Uint8Array( 8 );\n\tif ( x === 0 ) {\n\t\treturn bytes;\n\t}\n\t// Get the low 32-bit word:\n\tlo = (x&LOW_MASK)>>>0;\n\n\t// Get the high 32-bit word:\n\thi = floor( x/TWO_32 );\n\n\t// Insert the high and low words according to host byte order (endianness):\n\tview = new DataView( bytes.buffer );\n\tif ( IS_LITTLE_ENDIAN ) {\n\t\tview.setUint32( 0, lo, IS_LITTLE_ENDIAN );\n\t\tview.setUint32( 4, hi, IS_LITTLE_ENDIAN );\n\t} else {\n\t\tview.setUint32( 0, hi, IS_LITTLE_ENDIAN );\n\t\tview.setUint32( 4, lo, IS_LITTLE_ENDIAN );\n\t}\n\treturn bytes;\n}\n\n\n// EXPORTS //\n\nexport default float64ToInt64Bytes;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport Uint8Array from '@stdlib/array-uint8';\nimport dtypes from '@stdlib/ndarray-base-dtype-enums';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\nimport { assign as float64ToInt64Bytes } from '@stdlib/number-float64-base-to-int64-bytes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* [int8],\n* [int16],\n* [int64],\n* [ndims*int64],\n* [ndims*int64],\n* [int64],\n* [int8],\n* [int8],\n* [int64],\n* [nsubmodes*int8],\n* [int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar bytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create views for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\tbytes = new Uint8Array( v.buffer );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tfloat64ToInt64Bytes( N, bytes, 1, o );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tfloat64ToInt64Bytes( sh[i], bytes, 1, o );\n\t\tfloat64ToInt64Bytes( st[i]*nbytes, bytes, 1, o+s );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tfloat64ToInt64Bytes( this._offset*nbytes, bytes, 1, o );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tfloat64ToInt64Bytes( M, bytes, 1, o );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 hasBigIntSupport from '@stdlib/assert-has-bigint-support';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport iterationOrder from '@stdlib/ndarray-base-iteration-order';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport slice from '@stdlib/array-base-slice';\nimport Boolean from '@stdlib/boolean-ctor';\nimport isColumnMajorContiguous from './is_column_major_contiguous.js';\nimport isRowMajorContiguous from './is_row_major_contiguous.js';\nimport isContiguous from './is_contiguous.js';\nimport copyFlags from './copy_flags.js';\nimport igetValue from './iget.js';\nimport isetValue from './iset.js';\nimport setValue from './set.js';\nimport getValue from './get.js';\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\nimport toJSON from './tojson.js';\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\nimport meta2dataview from './meta2dataview.js';\nimport meta2dataviewPolyfill from './meta2dataview.polyfill.js';\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* ## Notes\n*\n* - To create a zero-dimensional array,\n*\n* ```javascript\n* var buffer = [ 1 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n* ```\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {(ArrayLikeObject|TypedArray|Buffer)} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order ) {\n\tvar contiguous;\n\tvar nbytes;\n\tvar ord;\n\tvar len;\n\tvar i;\n\tif ( !(this instanceof ndarray) ) {\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t}\n\t// Compute the number of elements...\n\tlen = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tlen *= shape[ i ]; // TODO: consider supporting accessor arrays here\n\t}\n\t// Compute the number of bytes...\n\tif ( buffer.BYTES_PER_ELEMENT ) {\n\t\tnbytes = buffer.BYTES_PER_ELEMENT * len;\n\t} else {\n\t\tnbytes = null;\n\t}\n\t// Set private properties...\n\tthis._byteLength = nbytes;\n\tthis._bytesPerElement = bytesPerElement( dtype );\n\tthis._buffer = buffer;\n\tthis._dtype = dtype;\n\tthis._length = len;\n\tthis._ndims = shape.length;\n\tthis._offset = offset;\n\tthis._order = order;\n\tthis._shape = shape;\n\tthis._strides = strides;\n\tthis._accessors = Boolean( buffer.get && buffer.set );\n\n\tthis._iterationOrder = iterationOrder( strides );\n\n\t// Determine if the array can be stored contiguously:\n\tcontiguous = isContiguous( len, shape, strides, offset, this._iterationOrder ); // eslint-disable-line max-len\n\n\t// Infer the array \"order\" from the stride array (this is supplementary to the `order` parameter):\n\tord = strides2order( strides );\n\n\tthis._flags = {\n\t\t'ROW_MAJOR_CONTIGUOUS': isRowMajorContiguous( ord, contiguous ),\n\t\t'COLUMN_MAJOR_CONTIGUOUS': isColumnMajorContiguous( ord, contiguous ),\n\t\t'READONLY': false\n\t};\n\n\t// Initialize a property for caching serialized meta data:\n\tthis.__meta_dataview__ = null;\n\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Size (in bytes) of the array (if known).\n*\n* @name byteLength\n* @memberof ndarray.prototype\n* @type {(NonNegativeInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var byteLength = x.byteLength;\n* // returns 48\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Size (in bytes) of each array element (if known).\n*\n* @name BYTES_PER_ELEMENT\n* @memberof ndarray.prototype\n* @type {(PositiveInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var nbytes = x.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'BYTES_PER_ELEMENT', function get() {\n\treturn this._bytesPerElement;\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name data\n* @memberof ndarray.prototype\n* @type {(Array|TypedArray|Buffer)}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var data = x.data;\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'data', function get() {\n\treturn this._buffer;\n});\n\n/**\n* Underlying data type.\n*\n* @name dtype\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dtype = x.dtype;\n* // returns 'generic'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'dtype', function get() {\n\treturn this._dtype;\n});\n\n/**\n* Meta information, such as information concerning the memory layout of the array.\n*\n* @name flags\n* @memberof ndarray.prototype\n* @type {Object}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var flgs = x.flags;\n* // returns \n*/\nsetReadOnlyAccessor( ndarray.prototype, 'flags', function get() {\n\treturn copyFlags( this._flags );\n});\n\n/**\n* Length of the array.\n*\n* @name length\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var len = x.length;\n* // returns 6\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Number of dimensions.\n*\n* @name ndims\n* @memberof ndarray.prototype\n* @type {PositiveInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var ndims = x.ndims;\n* // returns 2\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'ndims', function get() {\n\treturn this._ndims;\n});\n\n/**\n* Index offset which specifies the buffer index at which to start iterating over array elements.\n*\n* @name offset\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.offset;\n* // returns 0\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'offset', function get() {\n\treturn this._offset;\n});\n\n/**\n* Array order.\n*\n* ## Notes\n*\n* - The array order is either row-major (C-style) or column-major (Fortran-style).\n*\n* @name order\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var order = x.order;\n* // returns 'row-major'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'order', function get() {\n\treturn this._order;\n});\n\n/**\n* Shape of the array.\n*\n* @name shape\n* @memberof ndarray.prototype\n* @type {NonNegativeIntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.shape;\n* // returns [ 3, 2 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'shape', function get() {\n\treturn slice( this._shape, 0, this._shape.length );\n});\n\n/**\n* Index strides which specify how to access data along corresponding array dimensions.\n*\n* @name strides\n* @memberof ndarray.prototype\n* @type {IntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.strides;\n* // returns [ 2, 1 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'strides', function get() {\n\treturn slice( this._strides, 0, this._strides.length );\n});\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', getValue );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', igetValue );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', setValue );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', isetValue );\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toString\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {string} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var str = x.toString();\n* // returns \"ndarray( 'generic', [ 3, 4, 5, 6, 7, 8 ], [ 3, 2 ], [ 2, 1 ], 0, 'row-major' )\"\n*/\nsetReadOnly( ndarray.prototype, 'toString', toString );\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying an `ndarray` instance.\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toJSON\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {Object} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.toJSON();\n* // e.g., returns { 'type': 'ndarray', 'dtype': 'generic', 'flags': {...}, 'offset': 0, 'order': 'row-major', 'shape': [ 3, 2 ], 'strides': [ 2, 1 ], 'data': [ 3, 4, 5, 6, 7, 8 ] }\n*/\nsetReadOnly( ndarray.prototype, 'toJSON', toJSON );\n\n/**\n* Converts an ndarray instance to a primitive value.\n*\n* ## Notes\n*\n* - Only zero-dimensional ndarrays are converted to a primitive value. For ndarray instances having one or more dimensions, the method returns the `this` value, as is the default behavior for objects.\n*\n* @name valueOf\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {(*|ndarray)} result\n*\n* @example\n* var buffer = [ 3.14 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.valueOf();\n* // returns 3.14\n*\n* @example\n* var buffer = [ 3.14 ];\n* var shape = [ 1 ];\n* var strides = [ 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.valueOf();\n* // returns \n*/\nsetReadOnly( ndarray.prototype, 'valueOf', valueOf );\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - Meta data format:\n*\n* ```text\n* | (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Consumers of this method should treat the returned `DataView` as **immutable**. Otherwise, mutation can invalidate meta data and potentially affect other consumers.\n*\n* @private\n* @name __array_meta_dataview__\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {DataView} serialized meta data\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dv = x.__array_meta_dataview__();\n* // returns \n*/\nsetReadOnly( ndarray.prototype, '__array_meta_dataview__', ( hasBigIntSupport() ) ? meta2dataview : meta2dataviewPolyfill );\n\n\n// EXPORTS //\n\nexport default ndarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n\n\n// MAIN //\n\n/**\n* Determines if an array is contiguous.\n*\n* @private\n* @param {NonNegativeInteger} len - array length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {integer} iterationOrder - iteration order\n* @returns {boolean} boolean indicating if an array is contiguous\n*/\nfunction isContiguous( len, shape, strides, offset, iterationOrder ) {\n\tvar buf;\n\n\t// If an array does not contain any elements, then no data to store, and, if the array is unordered, adjacent array elements are not guaranteed to be stored next to each other.\n\tif ( len === 0 || iterationOrder === 0 ) {\n\t\treturn false;\n\t}\n\t// Ensure that the array is compatible with a single memory segment:\n\tbuf = minmaxViewBufferIndex( shape, strides, offset );\n\treturn ( len === ( buf[1]-buf[0]+1 ) );\n}\n\n\n// EXPORTS //\n\nexport default isContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ndarray from '@stdlib/ndarray-base-ctor';\n\n\n// MAIN //\n\n/**\n* Tests if a value is ndarray-like.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating if a value is ndarray-like\n*\n* @example\n* import ndarray from '@stdlib/ndarray-ctor';\n*\n* var arr = ndarray( 'generic', [ 0, 0, 0, 0 ], [ 2, 2 ], [ 2, 1 ], 0, 'row-major' );\n*\n* var bool = isndarrayLike( arr );\n* // returns true\n*\n* bool = isndarrayLike( [] );\n* // returns false\n*/\nfunction isndarrayLike( v ) {\n\treturn (\n\t\tv instanceof ndarray ||\n\t\t(\n\t\t\tv !== null &&\n\t\t\ttypeof v === 'object' &&\n\t\t\ttypeof v.data === 'object' &&\n\t\t\ttypeof v.shape === 'object' &&\n\t\t\ttypeof v.strides === 'object' &&\n\t\t\ttypeof v.offset === 'number' &&\n\t\t\ttypeof v.order === 'string' &&\n\t\t\ttypeof v.ndims === 'number' &&\n\t\t\tv.dtype &&\n\t\t\ttypeof v.length === 'number' &&\n\t\t\ttypeof v.flags === 'object' &&\n\t\t\ttypeof v.get === 'function' &&\n\t\t\ttypeof v.set === 'function'\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isndarrayLike;\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* Tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @param {*} value - search value\n* @returns {boolean} boolean indicating if an array contains a search value\n*\n* @example\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\nfunction contains( x, value ) {\n\tvar len;\n\tvar get;\n\tvar dt;\n\tvar i;\n\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tif ( get( x, i ) === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default contains;\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 isCollection from '@stdlib/assert-is-collection';\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport dtype from '@stdlib/array-dtype';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function to tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @throws {TypeError} must provide an array-like object\n* @returns {Function} function to test if an array contains a search value\n*\n* @example\n* var contains = factory( [ 1, 2, 3 ] );\n* // returns \n*\n* var bool = contains( 2 );\n* // returns true\n*/\nfunction factory( x ) {\n\tvar get;\n\tvar len;\n\tvar dt;\n\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an array-like object. Value: `%s`.', x ) );\n\t}\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\treturn ( get === void 0 ) ? contains : accessors;\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*\n\t* @example\n\t* var out = contains( [ 1, 2, 3 ], 2 );\n\t* // returns true\n\t*/\n\tfunction contains( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( x[ i ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*/\n\tfunction accessors( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( get( x, i ) === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 ndarray flags.\n*\n* @private\n* @param {Object} flags - flags\n* @returns {Object} copy of input object\n*/\nfunction copyFlags( flags ) {\n\treturn {\n\t\t'ROW_MAJOR_CONTIGUOUS': flags.ROW_MAJOR_CONTIGUOUS,\n\t\t'COLUMN_MAJOR_CONTIGUOUS': flags.COLUMN_MAJOR_CONTIGUOUS,\n\t\t'READONLY': flags.READONLY\n\t};\n}\n\n\n// EXPORTS //\n\nexport default copyFlags;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} idx - indices\n* @returns {*} array element\n*/\nfunction get() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nexport default get;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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// MAIN //\n\n/**\n* Returns an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( this._offset );\n\t\t}\n\t\treturn this._buffer[ this._offset ];\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this._offset+idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset+idx ];\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this.offset-idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset-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\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( isColumnMajor( this._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\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( ind );\n\t\t}\n\t\treturn this._buffer[ 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\tif ( this._accessors ) {\n\t\treturn this._buffer.get( ind );\n\t}\n\treturn this._buffer[ ind ];\n}\n\n\n// EXPORTS //\n\nexport default iget;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default set;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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// MAIN //\n\n/**\n* Sets an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( idx, this._offset );\n\t\t} else {\n\t\t\tthis._buffer[ this._offset ] = idx;\n\t\t}\n\t\treturn this;\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset+idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset+idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset-idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset-idx ] = v;\n\t\t\t}\n\t\t\treturn this;\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\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( isColumnMajor( this._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\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( v, ind );\n\t\t} else {\n\t\t\tthis._buffer[ ind ] = v;\n\t\t}\n\t\treturn this;\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\tif ( this._accessors ) {\n\t\tthis._buffer.set( v, ind );\n\t} else {\n\t\tthis._buffer[ ind ] = v;\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default iset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tlen = this._length;\n\n\t// Build an object containing all ndarray properties needed to revive a serialized ndarray...\n\tout = {};\n\tout.type = 'ndarray';\n\tout.dtype = this.dtype;\n\tout.flags = {\n\t\t'READONLY': this._flags.READONLY\n\t};\n\tout.order = this._order;\n\tout.shape = this._shape.slice();\n\tout.strides = this._strides.slice();\n\n\t// Flip the signs of negative strides:\n\tfor ( i = 0; i < out.strides.length; i++ ) {\n\t\tif ( out.strides[ i ] < 0 ) {\n\t\t\tout.strides[ i ] *= -1;\n\t\t}\n\t}\n\t// Cast data to generic array...\n\tout.data = [];\n\tif ( out.dtype === 'complex64' || out.dtype === 'complex128' ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tv = this.iget( i );\n\t\t\tout.data.push( real( v ), imag( v ) );\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tout.data.push( this.iget( i ) );\n\t\t}\n\t}\n\treturn out;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\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* Converts an ndarray instance to a primitive value.\n*\n* ## Notes\n*\n* - Only zero-dimensional ndarrays are converted to a primitive value. For ndarray instances having one or more dimensions, the method returns the `this` value, as is the default behavior for objects.\n*\n* @private\n* @returns {(*|ndarray)} result\n*/\nfunction valueOf() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tif ( this._ndims === 0 ) {\n\t\treturn this.iget();\n\t}\n\treturn this;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default valueOf;\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/**\n* Test if an array contains a provided search value.\n*\n* @module @stdlib/array-base-assert-contains\n*\n* @example\n* import contains from '@stdlib/array-base-assert-contains';\n*\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport factory from './factory.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nexport default main;\n\n// exports: { \"factory\": \"main.factory\" }\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 replace from '@stdlib/string-base-replace';\nimport DTYPES from './dtypes.json';\n\n\n// VARIABLES //\n\nvar RE_SUFFIX = /_and_generic$/;\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data type strings.\n*\n* @param {string} [kind] - data type kind\n* @returns {Array} list of ndarray data type strings\n*\n* @example\n* var list = dtypeStrings();\n* // returns [...]\n*\n* @example\n* var list = dtypeStrings( 'floating_point' );\n* // returns [...]\n*/\nfunction dtypeStrings() {\n\tvar kind;\n\tvar out;\n\tvar FLG;\n\tif ( arguments.length === 0 ) {\n\t\treturn DTYPES.all.slice();\n\t}\n\tFLG = false;\n\tkind = arguments[ 0 ];\n\tif ( RE_SUFFIX.test( kind ) ) {\n\t\tkind = replace( kind, RE_SUFFIX, '' );\n\t\tif ( kind !== 'all' && kind !== 'index' ) {\n\t\t\tFLG = true;\n\t\t}\n\t}\n\tout = DTYPES[ kind ];\n\tout = ( out ) ? out.slice() : [];\n\tif ( FLG && out.length > 0 ) {\n\t\tout.push( 'generic' );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypeStrings;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported built-in ndarray data type string.\n*\n* @name isDataTypeString\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported built-in ndarray data type string\n*\n* @example\n* var bool = isDataTypeString( 'binary' );\n* // returns true\n*\n* bool = isDataTypeString( 'float32' );\n* // returns true\n*\n* bool = isDataTypeString( 'float64' );\n* // returns true\n*\n* bool = isDataTypeString( 'generic' );\n* // returns true\n*\n* bool = isDataTypeString( 'int16' );\n* // returns true\n*\n* bool = isDataTypeString( 'int32' );\n* // returns true\n*\n* bool = isDataTypeString( 'int8' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint16' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint32' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint8' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint8c' );\n* // returns true\n*\n* bool = isDataTypeString( 'foo' );\n* // returns false\n*/\nvar isDataTypeString = contains( dtypes() );\n\n\n// EXPORTS //\n\nexport default isDataTypeString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport isFunction from '@stdlib/assert-is-function';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\n\n\n// MAIN //\n\n/**\n* Tests if a value is struct constructor-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is struct constructor-like\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema = [\n* {\n* 'name': 'foo',\n* 'type': 'float64'\n* }\n* ];\n* var Struct = structFactory( schema );\n*\n* var bool = isStructConstructorLike( Struct );\n* // returns true\n*\n* bool = isStructConstructorLike( [] );\n* // returns false\n*/\nfunction isStructConstructorLike( value ) {\n\treturn (\n\t\tisFunction( value ) &&\n\t\tisPositiveInteger( value.alignment ) &&\n\t\tisPositiveInteger( value.byteLength ) &&\n\t\tisFunction( value.byteLengthOf ) &&\n\t\tisFunction( value.byteOffsetOf ) &&\n\t\tisFunction( value.bufferOf ) &&\n\t\tisFunction( value.isStruct ) &&\n\t\tisFunction( value.viewOf ) &&\n\t\thasOwnProp( value, 'fields' ) &&\n\t\thasOwnProp( value, 'layout' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructConstructorLike;\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 isNumber } from '@stdlib/assert-is-number';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar ENUM = dtypeEnums();\n\n\n// MAIN //\n\n/**\n* Returns the enumeration constant associated with an ndarray data type string.\n*\n* ## Notes\n*\n* - Downstream consumers of this function should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the function should be used in an opaque manner.\n*\n* @param {string} dtype - data type string\n* @returns {(integer|null)} integer value or null\n*\n* @example\n* var v = str2enum( 'int8' );\n* // returns \n*/\nfunction str2enum( dtype ) {\n\tvar v = ENUM[ dtype ];\n\treturn ( isNumber( v ) ) ? v : null; // note: we include this guard to prevent walking the prototype chain\n}\n\n\n// EXPORTS //\n\nexport default str2enum;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the description for a provided data type.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|string|null)} description(s)\n*\n* @example\n* var obj = dtypeDesc();\n* // returns {...}\n*\n* @example\n* var desc = dtypeDesc( 'float64' );\n* // returns '...'\n*\n* desc = dtypeDesc( 'generic' );\n* // returns '...'\n*/\nfunction dtypeDesc( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\treturn TABLE[ resolve( dtype ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeDesc;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the single letter character abbreviation for an underlying array data type.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|string|null)} single letter character abbreviation(s)\n*\n* @example\n* var obj = dtypeChar();\n* // returns {...}\n*\n* @example\n* var ch = dtypeChar( 'float64' );\n* // returns 'd'\n*\n* ch = dtypeChar( 'generic' );\n* // returns 'o'\n*/\nfunction dtypeChar( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\treturn TABLE[ resolve( dtype ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeChar;\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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the alignment (in bytes) for an underlying array data type.\n*\n* ## Notes\n*\n* - If provided an unrecognized/unsupported data type, the function returns `null`.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|number|null)} alignment (in bytes)\n*\n* @example\n* var obj = dtypeAlignment();\n* // returns {...}\n*\n* @example\n* var out = dtypeAlignment( 'float64' );\n* // returns 8\n*\n* out = dtypeAlignment( 'generic' );\n* // returns null\n*/\nfunction dtypeAlignment( dtype ) {\n\tvar v;\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.alignment;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t\treturn TABLE[ resolve( dtype ) ] || null;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeAlignment;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with a supported ndarray data type value.\n*\n* @param {*} dtype - data type value\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 = resolve( str2enum( 'float64' ) );\n* // returns 'float64'\n*/\nfunction resolve( dtype ) {\n\tvar t = ( typeof dtype );\n\tif ( t === 'string' ) {\n\t\treturn ( str2enum( dtype ) === null ) ? null : dtype;\n\t}\n\tif ( t === 'number' ) {\n\t\treturn enum2str( dtype );\n\t}\n\tif ( t === 'object' && dtype ) {\n\t\treturn String( dtype );\n\t}\n\tif ( isStructConstructorLike( dtype ) ) {\n\t\treturn dtype.layout;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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 no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport isPlainObject from '@stdlib/assert-is-plain-object';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport hasProp from '@stdlib/assert-has-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport resolveEnum from '@stdlib/ndarray-base-dtype-resolve-enum';\nimport dtype2desc from '@stdlib/ndarray-base-dtype-desc';\nimport dtype2char from '@stdlib/ndarray-base-dtype-char';\nimport dtype2alignment from '@stdlib/ndarray-base-dtype-alignment';\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport format from '@stdlib/string-format';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a `DataType`.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `DataType`\n*/\nfunction isDataType( value ) { // NOTE: we do not use `ndarray/base/assert/is-data-type-object` in order to avoid circular dependencies\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tvalue.constructor.name === 'DataType' &&\n\t\t\tisString( value.char ) &&\n\t\t\tisString( value.description ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// MAIN //\n\n/**\n* Data type constructor.\n*\n* @constructor\n* @param {*} value - data type value\n* @param {Options} [options] - constructor options\n* @param {string} [options.description] - data type description\n* @throws {TypeError} first argument must be a supported data type value\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {DataType} data type instance\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var str = dt.toString();\n* // returns 'float64'\n*/\nfunction DataType( value, options ) {\n\tvar nargs;\n\tvar type;\n\tvar opts;\n\n\tnargs = arguments.length;\n\tif ( !( this instanceof DataType ) ) {\n\t\tif ( nargs < 2 ) {\n\t\t\treturn new DataType( value );\n\t\t}\n\t\treturn new DataType( value, options );\n\t}\n\tif ( isDataTypeString( value ) ) {\n\t\ttype = 'builtin';\n\t} else if ( isDataType( value ) ) {\n\t\t// Clone the input data type:\n\t\treturn new DataType( value.value, {\n\t\t\t'description': value.description\n\t\t});\n\t} else if ( isStructConstructorLike( value ) ) {\n\t\ttype = 'struct';\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a supported data type string, a struct constructor, or another data type instance. Value: `%s`.', value ) );\n\t}\n\tif ( nargs > 1 ) {\n\t\topts = options;\n\t\tif ( !isPlainObject( 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, 'description' ) && !isString( opts.description ) ) {\n\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'description', opts.description ) );\n\t\t}\n\t} else {\n\t\topts = {};\n\t}\n\tsetReadOnly( this, '_value', value );\n\tsetReadOnly( this, '_description', opts.description || ( dtype2desc( value ) || '' ) );\n\tsetReadOnly( this, '_char', dtype2char( value ) || '' );\n\tsetReadOnly( this, '_enum', resolveEnum( value ) || -1 );\n\tsetReadOnly( this, '_alignment', dtype2alignment( value ) || -1 );\n\tsetReadOnly( this, '_byteLength', bytesPerElement( value ) || -1 );\n\tsetReadOnly( this, '_byteOrder', 'host' ); // TODO: consider supporting little-endian and big-endian byte orders\n\tsetReadOnly( this, '_type', type );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof DataType\n* @type {string}\n* @default 'DataType'\n*\n* @example\n* var v = DataType.name;\n* // returns 'DataType'\n*/\nsetReadOnly( DataType, 'name', 'DataType' );\n\n/**\n* Alignment (in bytes) for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a known alignment, the returned value is `-1`.\n*\n* @name alignment\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.alignment;\n* // returns 8\n*/\nsetReadOnlyAccessor( DataType.prototype, 'alignment', function get() {\n\treturn this._alignment;\n});\n\n/**\n* Size (in bytes) of the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a known size, the returned value is `-1`.\n*\n* @name byteLength\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.byteLength;\n* // returns 8\n*/\nsetReadOnlyAccessor( DataType.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Data type byte order.\n*\n* ## Notes\n*\n* - Potential values:\n*\n* - **host**: host platform byte order.\n* - **little-endian**: little-endian byte order.\n* - **big-endian**: big-endian byte order.\n*\n* @name byteOrder\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.byteOrder;\n* // returns 'host'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'byteOrder', function get() {\n\treturn this._byteOrder;\n});\n\n/**\n* Single letter character abbreviation for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a corresponding single letter character abbreviation, the returned value is an empty string.\n*\n* @name char\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.char;\n* // returns 'd'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'char', function get() {\n\treturn this._char;\n});\n\n/**\n* Data type description.\n*\n* ## Notes\n*\n* - If a data type does not have an associated description, the returned value is an empty string.\n*\n* @name description\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.description;\n* // returns \n*/\nsetReadOnlyAccessor( DataType.prototype, 'description', function get() {\n\treturn this._description;\n});\n\n/**\n* Enumeration constant for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a corresponding known enumeration constant, the returned value is `-1`.\n*\n* @name enum\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.enum;\n* // returns \n*/\nsetReadOnlyAccessor( DataType.prototype, 'enum', function get() {\n\treturn this._enum;\n});\n\n/**\n* Raw (original) data type value.\n*\n* @name value\n* @memberof DataType.prototype\n* @readonly\n* @type {*}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.value;\n* // returns 'float64'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'value', function get() {\n\treturn this._value;\n});\n\n/**\n* Serializes a data type instance as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `DataType` instance.\n*\n* @name toJSON\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {Object} serialized instance\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var o = dt.toJSON();\n* // returns {...}\n*/\nsetReadOnly( DataType.prototype, 'toJSON', function toJSON() {\n\treturn {\n\t\t'type': 'DataType',\n\t\t'value': this.toString(),\n\t\t'byteOrder': this._byteOrder,\n\t\t'description': this._description\n\t};\n});\n\n/**\n* Serializes a data type instance to a string.\n*\n* @name toString\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {string} serialized string\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.toString();\n* // returns 'float64'\n*/\nsetReadOnly( DataType.prototype, 'toString', function toString() {\n\treturn ( this._type === 'struct' ) ? this._value.layout : String( this._value );\n});\n\n/**\n* Converts a data type instance to a primitive value.\n*\n* @name valueOf\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {string} primitive value\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.valueOf();\n* // returns 'float64'\n*/\nsetReadOnly( DataType.prototype, 'valueOf', function valueOf() {\n\treturn this.toString();\n});\n\n\n// EXPORTS //\n\nexport default DataType;\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 an object mapping data type strings to descriptions.\n*\n* @private\n* @returns {Object} object mapping data type strings to descriptions\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 'byte',\n\n\t\t'bool': 'boolean',\n\n\t\t'complex32': 'half-precision floating-point complex number',\n\t\t'complex64': 'single-precision floating-point complex number',\n\t\t'complex128': 'double-precision floating-point complex number',\n\n\t\t'float16': 'half-precision floating-point number',\n\t\t'bfloat16': 'brain floating-point number',\n\t\t'float32': 'single-precision floating-point number',\n\t\t'float64': 'double-precision floating-point number',\n\t\t'float128': 'quadruple-precision floating-point number',\n\n\t\t'generic': 'generic array value',\n\n\t\t'int8': 'signed 8-bit integer',\n\t\t'int16': 'signed 16-bit integer',\n\t\t'int32': 'signed 32-bit integer',\n\t\t'int64': 'signed 64-bit integer',\n\t\t'int128': 'signed 128-bit integer',\n\t\t'int256': 'signed 256-bit integer',\n\n\t\t'uint8': 'unsigned 8-bit integer',\n\t\t'uint8c': 'unsigned 8-bit integer (clamped)',\n\t\t'uint16': 'unsigned 16-bit integer',\n\t\t'uint32': 'unsigned 32-bit integer',\n\t\t'uint64': 'unsigned 64-bit integer',\n\t\t'uint128': 'unsigned 128-bit integer',\n\t\t'uint256': 'unsigned 256-bit integer'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 an object mapping data type strings to single letter abbreviations.\n*\n* @private\n* @returns {Object} object mapping data type string to single letter abbreviations\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 'r',\n\n\t\t'bool': 'x',\n\n\t\t'complex32': 'j',\n\t\t'complex64': 'c',\n\t\t'complex128': 'z',\n\n\t\t'float16': 'h',\n\t\t'bfloat16': 'e',\n\t\t'float32': 'f',\n\t\t'float64': 'd',\n\t\t'float128': 'g',\n\n\t\t'generic': 'o',\n\n\t\t'int8': 's',\n\t\t'int16': 'k',\n\t\t'int32': 'i',\n\t\t'int64': 'l',\n\t\t'int128': 'm',\n\t\t'int256': 'n',\n\n\t\t'uint8': 'b',\n\t\t'uint8c': 'a',\n\t\t'uint16': 't',\n\t\t'uint32': 'u',\n\t\t'uint64': 'v',\n\t\t'uint128': 'w',\n\t\t'uint256': 'y'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n\n\n// MAIN //\n\n/**\n* Returns the enumeration constant associated with a supported ndarray data type value.\n*\n* ## Notes\n*\n* - Downstream consumers of this function should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the function should be used in an opaque manner.\n*\n* @param {*} dtype - data type value\n* @returns {(integer|null)} enumeration constant or null\n*\n* @example\n* var v = resolve( 'int8' );\n* // returns \n*/\nfunction resolve( dtype ) {\n\tvar t = ( typeof dtype );\n\tif ( t === 'number' ) {\n\t\treturn ( enum2str( dtype ) ) ? dtype : null;\n\t}\n\tif ( t === 'string' ) {\n\t\treturn str2enum( dtype );\n\t}\n\tif ( t === 'object' && dtype && isInteger( dtype.enum ) ) {\n\t\treturn dtype.enum;\n\t}\n\tif ( isStructConstructorLike( dtype ) ) {\n\t\treturn str2enum( 'userdefined_type' );\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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* Returns an object mapping data type strings to alignments (in bytes).\n*\n* @private\n* @returns {Object} object mapping data type string to alignments (in bytes)\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 1,\n\n\t\t'bool': 1,\n\n\t\t'complex32': 2, // same as float16\n\t\t'complex64': 4, // same as float32\n\t\t'complex128': 8, // same as float64\n\n\t\t'float16': 2,\n\t\t'bfloat16': 2,\n\t\t'float32': 4,\n\t\t'float64': 8,\n\t\t'float128': 16,\n\n\t\t'generic': null,\n\n\t\t'int8': 1,\n\t\t'int16': 2,\n\t\t'int32': 4,\n\t\t'int64': 8,\n\t\t'int128': 16,\n\t\t'int256': 32,\n\n\t\t'uint8': 1,\n\t\t'uint8c': 1,\n\t\t'uint16': 2,\n\t\t'uint32': 4,\n\t\t'uint64': 8,\n\t\t'uint128': 16,\n\t\t'uint256': 32\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\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 isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray struct data type.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray struct data type\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var Struct = structFactory([\n* {\n* 'name': 'foo',\n* 'type': 'float64'\n* }\n* ]);\n*\n* var bool = isStructDataType( Struct );\n* // returns true\n*\n* bool = isStructDataType( 'binary' );\n* // returns false\n*\n* bool = isStructDataType( 'float32' );\n* // returns false\n*\n* bool = isStructDataType( 'float64' );\n* // returns false\n*\n* bool = isStructDataType( 'generic' );\n* // returns false\n*\n* bool = isStructDataType( 'int16' );\n* // returns false\n*\n* bool = isStructDataType( 'int32' );\n* // returns false\n*\n* bool = isStructDataType( 'int8' );\n* // returns false\n*\n* bool = isStructDataType( 'uint16' );\n* // returns false\n*\n* bool = isStructDataType( 'uint32' );\n* // returns false\n*\n* bool = isStructDataType( 'uint8' );\n* // returns false\n*\n* bool = isStructDataType( 'uint8c' );\n* // returns false\n*\n* bool = isStructDataType( 'foo' );\n* // returns false\n*/\nfunction isStructDataType( value ) {\n\treturn (\n\t\tisFunction( value ) &&\n\t\tisPositiveInteger( value.alignment ) &&\n\t\tisPositiveInteger( value.byteLength ) &&\n\t\tisFunction( value.byteLengthOf ) &&\n\t\tisFunction( value.byteOffsetOf ) &&\n\t\tisFunction( value.bufferOf ) &&\n\t\tisFunction( value.viewOf )\n\t) || (\n\t\tisDataTypeObject( value ) &&\n\t\tisStructDataType( value.value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructDataType;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray data type\n*\n* @example\n* var bool = isDataType( 'binary' );\n* // returns true\n*\n* bool = isDataType( 'float32' );\n* // returns true\n*\n* bool = isDataType( 'float64' );\n* // returns true\n*\n* bool = isDataType( 'generic' );\n* // returns true\n*\n* bool = isDataType( 'int16' );\n* // returns true\n*\n* bool = isDataType( 'int32' );\n* // returns true\n*\n* bool = isDataType( 'int8' );\n* // returns true\n*\n* bool = isDataType( 'uint16' );\n* // returns true\n*\n* bool = isDataType( 'uint32' );\n* // returns true\n*\n* bool = isDataType( 'uint8' );\n* // returns true\n*\n* bool = isDataType( 'uint8c' );\n* // returns true\n*\n* bool = isDataType( 'foo' );\n* // returns false\n*/\nfunction isDataType( v ) {\n\treturn (\n\t\tisDataTypeString( v ) ||\n\t\tisDataTypeObject( v ) ||\n\t\tisStructDataType( v )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataType;\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 POLICIES from './policies.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of output ndarray data type policies.\n*\n* @returns {StringArray} list of ndarray data type policies\n*\n* @example\n* var list = policies();\n* // returns [...]\n*/\nfunction policies() {\n\treturn POLICIES.slice();\n}\n\n\n// EXPORTS //\n\nexport default policies;\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 an object mapping supported data type policy strings to enumeration constants.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `SAME == 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* @private\n* @returns {Object} object mapping supported dtype policies to enumeration constants\n*\n* @example\n* var table = enumeration();\n* // returns \n*/\nfunction enumeration() {\n\t// NOTE: the following should match the C `output_dtype_policies.h` enumeration!!!!\n\treturn {\n\t\t'same': 0,\n\t\t'promoted': 1,\n\t\t'accumulation': 2,\n\t\t'boolean': 3,\n\t\t'boolean_and_generic': 4,\n\t\t'signed_integer': 5,\n\t\t'signed_integer_and_generic': 6,\n\t\t'unsigned_integer': 7,\n\t\t'unsigned_integer_and_generic': 8,\n\t\t'integer': 9,\n\t\t'integer_and_generic': 10,\n\t\t'floating_point': 11,\n\t\t'floating_point_and_generic': 12,\n\t\t'real_floating_point': 13,\n\t\t'real_floating_point_and_generic': 14,\n\t\t'complex_floating_point': 15,\n\t\t'complex_floating_point_and_generic': 16,\n\t\t'real': 17,\n\t\t'real_and_generic': 18,\n\t\t'numeric': 19,\n\t\t'numeric_and_generic': 20,\n\t\t'integer_index': 21,\n\t\t'integer_index_and_generic': 22,\n\t\t'boolean_index': 23,\n\t\t'boolean_index_and_generic': 24,\n\t\t'mask_index': 25,\n\t\t'mask_index_and_generic': 26,\n\t\t'default': 27,\n\t\t'default_index': 28\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumeration;\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/**\n* Return a list of output ndarray data type policies.\n*\n* @module @stdlib/ndarray-output-dtype-policies\n*\n* @example\n* import policies from '@stdlib/ndarray-output-dtype-policies';\n*\n* var list = policies();\n* // returns [...]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\nassign( main, enumeration() );\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 setReadOnly from '@stdlib/utils-define-read-only-property';\nimport objectKeys from '@stdlib/utils-keys';\n\n\n// MAIN //\n\n/**\n* Copies all enumerable own properties from a source object to a target object as enumerable read-only properties.\n*\n* @private\n* @param {Object} target - target object\n* @param {Object} source - source object\n* @returns {Object} modified target object\n*\n* @example\n* var source = {\n* 'beep': 'boop'\n* };\n* var target = {};\n*\n* var out = assign( target, source );\n* // returns \n*\n* var bool = ( out === target );\n* // returns true\n*\n* var v = target.beep;\n* // returns 'boop'\n*/\nfunction assign( target, source ) {\n\tvar keys;\n\tvar k;\n\tvar i;\n\n\tkeys = objectKeys( source );\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tk = keys[ i ];\n\t\tsetReadOnly( target, k, source[ k ] );\n\t}\n\treturn target;\n}\n\n\n// EXPORTS //\n\nexport default assign;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport policies from '@stdlib/ndarray-output-dtype-policies';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray output data type policy.\n*\n* @name isOutputDataTypePolicy\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray output data type policy\n*\n* @example\n* var bool = isOutputDataTypePolicy( 'boolean' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'real' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'numeric' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'foo' );\n* // returns false\n*/\nvar isOutputDataTypePolicy = contains( policies() );\n\n\n// EXPORTS //\n\nexport default isOutputDataTypePolicy;\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 isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\nvar bool = isFunction( Object.assign ); // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default bool;\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* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n* - Both string and symbol properties are copied.\n*\n* @name assign\n* @type {Function}\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nvar assign = Object.assign; // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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.getOwnPropertySymbols !== '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 Object from '@stdlib/object-ctor';\n\n\n// VARIABLES //\n\nvar propertySymbols = Object.getOwnPropertySymbols;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, 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 symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n*/\nfunction getOwnPropertySymbols( value ) {\n\treturn propertySymbols( Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 an array of an object's own symbol properties.\n*\n* @module @stdlib/utils-property-symbols\n*\n* @example\n* import getOwnPropertySymbols from '@stdlib/utils-property-symbols';\n*\n* var symbols = getOwnPropertySymbols( {} );\n*/\n\n// MODULES //\n\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( HAS_BUILTIN ) {\n\tmain = builtin;\n} else {\n\tmain = polyfill;\n}\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/**\n* Copy enumerable own properties from one or more source objects to a target object.\n*\n* @module @stdlib/object-assign\n*\n* @example\n* import assign from '@stdlib/object-assign';\n*\n* var out = assign( {}, { 'foo': 'bar' }, { 'baz': 'beep' } );\n* // returns { 'foo': 'bar', 'baz': 'beep' }\n*/\n\n// MODULES //\n\nimport hasObjectAssign from './has_object_assign.js';\nimport main from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar assign;\nif ( hasObjectAssign ) {\n\tassign = main;\n} else {\n\tassign = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, 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 {EmptyArray} a list of own symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n* // returns []\n*/\nfunction getOwnPropertySymbols() {\n\treturn [];\n}\n\n\n// EXPORTS //\n\nexport default getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 '@stdlib/utils-keys';\nimport propertySymbols from '@stdlib/utils-property-symbols';\nimport isEnumerable from '@stdlib/assert-is-enumerable-property';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names and symbols.\n*\n* @param {*} value - input object\n* @returns {Array} a list of own property enumerable names and symbols\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var props = enumerableProperties( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction enumerableProperties( value ) {\n\tvar out;\n\tvar tmp;\n\tvar i;\n\n\tout = keys( value );\n\ttmp = propertySymbols( value );\n\tfor ( i = 0; i < tmp.length; i++ ) {\n\t\tif ( isEnumerable( value, tmp[ i ] ) ) {\n\t\t\tout.push( tmp[ i ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default enumerableProperties;\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 enumerableProperties from '@stdlib/utils-enumerable-properties';\nimport Object from '@stdlib/object-ctor';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n* - Both string and symbol properties are copied.\n*\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nfunction assign( target ) {\n\tvar source;\n\tvar keys;\n\tvar key;\n\tvar len;\n\tvar to;\n\tvar i;\n\tvar j;\n\tif ( target === void 0 || target === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a non-null object. Value: `%s`.', target ) );\n\t}\n\tto = Object( target );\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\tsource = arguments[ i ];\n\t\tif ( source === void 0 || source === null ) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tkeys = enumerableProperties( Object( source ) );\n\t\tlen = keys.length;\n\t\tfor ( j = 0; j < len; j++ ) {\n\t\t\tkey = keys[ j ];\n\t\t\tto[ key ] = source[ key ];\n\t\t}\n\t}\n\treturn to;\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// MODULES //\n\nimport flags from '@stdlib/ndarray-base-flags';\n\n\n// MAIN //\n\n/**\n* Returns a specified flag for a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {(string|symbol)} name - flag name\n* @returns {*} flag value\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = flag( zeros( [ 3, 3, 3 ] ), 'READONLY' );\n* // returns \n*/\nfunction flag( x, name ) {\n\treturn flags( x, false )[ name ];\n}\n\n\n// EXPORTS //\n\nexport default flag;\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 assign from '@stdlib/object-assign';\n\n\n// MAIN //\n\n/**\n* Returns the flags 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 `flags` property\n* @returns {Object} flags\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = flags( zeros( [ 3, 3, 3 ] ), false );\n* // returns {...}\n*/\nfunction flags( x, copy ) {\n\tvar f = x.flags;\n\tif ( typeof f !== 'object' || f === null ) {\n\t\treturn {};\n\t}\n\tif ( copy ) {\n\t\treturn assign( {}, f );\n\t}\n\treturn f;\n}\n\n\n// EXPORTS //\n\nexport default flags;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport orders from '@stdlib/ndarray-orders';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray order.\n*\n* @name isOrder\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray order\n*\n* @example\n* var bool = isOrder( 'row-major' );\n* // returns true\n*\n* bool = isOrder( 'column-major' );\n* // returns true\n*\n* bool = isOrder( 'foo' );\n* // returns false\n*/\nvar isOrder = contains( orders() );\n\n\n// EXPORTS //\n\nexport default isOrder;\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';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'every' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n*\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyBy( x, isPositive );\n* // returns true\n*/\nfunction everyBy( x, predicate, thisArg ) {\n\tvar obj;\n\tif ( hasMethod( x, 'every' ) ) {\n\t\treturn x.every( predicate, thisArg );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default everyBy;\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/**\n* Returns the index offset which specifies the location of the first indexed value in a strided array.\n*\n* @param {NonNegativeInteger} N - number of indexed elements\n* @param {integer} stride - index increment\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var offset = stride2offset( 10, -10 );\n* // returns 90\n*/\nfunction stride2offset( N, stride ) {\n\tif ( stride > 0 ) {\n\t\treturn 0;\n\t}\n\treturn ( 1 - N ) * stride;\n}\n\n\n// EXPORTS //\n\nexport default stride2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 `undefined` or `null`.\n*\n* ## Notes\n*\n* - In older browsers, `undefined` is a global which can be overridden. `void`, however, is an operator which **cannot** be overridden. Consequently, better to use `void` to check for `undefined`. See [Stack Overflow][1].\n*\n* [1]: http://stackoverflow.com/a/19369078/2225624\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is undefined\n*\n* @example\n* var bool = isUndefinedOrNull( undefined );\n* // returns true\n*\n* bool = isUndefinedOrNull( null );\n* // returns true\n*\n* bool = isUndefinedOrNull( false );\n* // returns false\n*/\nfunction isUndefinedOrNull( value ) {\n\treturn ( value === void 0 || value === null );\n}\n\n\n// EXPORTS //\n\nexport default isUndefinedOrNull;\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 isUndefinedOrNull from '@stdlib/assert-is-undefined-or-null';\nimport arraylike2object from '@stdlib/array-base-arraylike2object';\nimport accessors from './accessors.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'join' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator and alternative indexing semantics.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {string} joined string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', x, 1, 0 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX, offsetX ) {\n\tvar out;\n\tvar ix;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn '';\n\t}\n\t// Check for a contiguous strided array with left-to-right iteration...\n\tif ( strideX === 1 && offsetX === 0 && N === x.length && hasMethod( x, 'join' ) ) {\n\t\treturn x.join( separator );\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\treturn accessors( N, separator, o, strideX, offsetX );\n\t}\n\tix = offsetX;\n\tout = '';\n\tfor ( i = 0; i < N; i++ ) {\n\t\tif ( i > 0 ) {\n\t\t\tout += separator;\n\t\t}\n\t\tv = x[ ix ];\n\t\tif ( !isUndefinedOrNull( v ) ) {\n\t\t\tout += String( v );\n\t\t}\n\t\tix += strideX;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\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 isUndefinedOrNull from '@stdlib/assert-is-undefined-or-null';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {string} joined string\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', arraylike2object( toAccessorArray( x ) ), 1, 0 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX, offsetX ) {\n\tvar xbuf;\n\tvar get;\n\tvar out;\n\tvar ix;\n\tvar v;\n\tvar i;\n\n\t// Cache reference to array data:\n\txbuf = x.data;\n\n\t// Cache a reference to the element accessor:\n\tget = x.accessors[ 0 ];\n\n\tix = offsetX;\n\tout = '';\n\tfor ( i = 0; i < N; i++ ) {\n\t\tif ( i > 0 ) {\n\t\t\tout += separator;\n\t\t}\n\t\tv = get( xbuf, ix );\n\t\tif ( !isUndefinedOrNull( v ) ) {\n\t\t\tout += String( v );\n\t\t}\n\t\tix += strideX;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\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 { ndarray as strided } from '@stdlib/blas-ext-base-gjoin';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining array elements using a specified separator.\n*\n* @param {Collection} x - input array\n* @param {string} separator - separator\n* @returns {string} output string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = join( x, ',' );\n* // returns '1,2,3,4'\n*\n* @example\n* var x = [ 1, 2, 3, null, undefined, 4 ];\n*\n* var out = join( x, '-' );\n* // returns '1-2-3---4'\n*/\nfunction join( x, separator ) {\n\treturn strided( x.length, separator, x, 1, 0 );\n}\n\n\n// EXPORTS //\n\nexport default join;\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) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting index (i.e., index offset) for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, fcn ) {\n\tvar sx;\n\tvar ix;\n\tvar x;\n\tvar N;\n\tvar i;\n\n\tN = shape[ 0 ];\n\tif ( N <= 0 ) {\n\t\treturn;\n\t}\n\tix = offsets[ 0 ];\n\tsx = strides[ 0 ];\n\tx = arrays[ 0 ];\n\tfor ( i = 0; i < N; i++ ) {\n\t\tx[ ix ] = fcn();\n\t\tix += sx;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting indices (i.e., index offsets) for the output array\n* @param {Array} accessors - array-like object containing accessors for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* function set( buf, idx, value ) {\n* buf[ idx ] = value * 2.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, [ set ], fill );\n*\n* console.log( x );\n* // => [ 6.0, 6.0, 6.0, 6.0, 6.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, accessors, fcn ) {\n\tvar xset;\n\tvar sx;\n\tvar ix;\n\tvar x;\n\tvar N;\n\tvar i;\n\n\tN = shape[ 0 ];\n\tif ( N <= 0 ) {\n\t\treturn;\n\t}\n\tix = offsets[ 0 ];\n\tsx = strides[ 0 ];\n\tx = arrays[ 0 ];\n\txset = accessors[ 0 ];\n\tfor ( i = 0; i < N; i++ ) {\n\t\txset( x, ix, fcn() );\n\t\tix += sx;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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 accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport dtype from '@stdlib/array-dtype';\nimport strided from './nullary.js';\nimport accessors from './accessors.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, fcn ) {\n\tvar xset;\n\tvar x;\n\n\tx = arrays[ 0 ];\n\tif ( isAccessorArray( x ) ) {\n\t\txset = accessorSetter( dtype( x ) );\n\t}\n\tif ( xset ) {\n\t\txset = xset || setter( dtype( x ) );\n\t\treturn accessors( arrays, shape, strides, [ xset ], fcn );\n\t}\n\treturn strided( arrays, shape, strides, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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 stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './accessors.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Array} accessors - array-like object containing accessors for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* function set( buf, idx, value ) {\n* buf[ idx ] = value * 2.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, [ set ], fill );\n*\n* console.log( x );\n* // => [ 6.0, 6.0, 6.0, 6.0, 6.0 ]\n*/\nfunction nullary( arrays, shape, strides, accessors, fcn ) {\n\tvar offsets = [ stride2offset( shape[ 0 ], strides[ 0 ] ) ];\n\treturn ndarray( arrays, shape, strides, offsets, accessors, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './nullary.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, fcn ) {\n\tvar offsets = [ stride2offset( shape[ 0 ], strides[ 0 ] ) ];\n\treturn ndarray( arrays, shape, strides, offsets, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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) 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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* Return a string created by joining strided array elements using a specified separator.\n*\n* @module @stdlib/blas-ext-base-gjoin\n*\n* @example\n* import gjoin from '@stdlib/blas-ext-base-gjoin';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var str = gjoin( x.length, ',', x, 1 );\n* // returns '1,2,3,4'\n*\n* @example\n* import gjoin from '@stdlib/blas-ext-base-gjoin';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var str = gjoin.ndarray( x.length, ',', x, 1, 0 );\n* // returns '1,2,3,4'\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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 stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @returns {string} joined string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', x, 1 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX ) {\n\treturn ndarray( N, separator, x, strideX, stride2offset( N, strideX ) );\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 nullary callback and assign results to elements in a strided output array.\n*\n* @module @stdlib/strided-base-nullary\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import nullary from '@stdlib/strided-base-nullary';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import nullary from '@stdlib/strided-base-nullary';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary.ndarray( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\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 accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport dtype from '@stdlib/array-dtype';\nimport strided from './nullary.ndarray.js';\nimport accessors from './accessors.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting indices (i.e., index offsets) for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, fcn ) {\n\tvar xset;\n\tvar x;\n\n\tx = arrays[ 0 ];\n\tif ( isAccessorArray( x ) ) {\n\t\txset = accessorSetter( dtype( x ) );\n\t}\n\tif ( xset ) {\n\t\txset = xset || setter( dtype( x ) );\n\t\treturn accessors( arrays, shape, strides, offsets, [ xset ], fcn );\n\t}\n\treturn strided( arrays, shape, strides, offsets, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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) 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) 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) 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) 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) 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) 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) 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/string-format';\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( '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\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","/**\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 filled \"generic\" array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} filled array\n*\n* @example\n* var out = filled( 0.0, 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var out = filled( 'beep', 3 );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filled( value, len ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( value );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default filled;\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 filled from '@stdlib/array-base-filled';\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled \"generic\" array.\n*\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var out = zeros( 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\nfunction zeros( len ) {\n\treturn filled( 0.0, len );\n}\n\n\n// EXPORTS //\n\nexport default zeros;\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 copy from '@stdlib/array-base-copy-indexed';\nimport ndarray from '@stdlib/ndarray-base-ctor';\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 getDType from '@stdlib/ndarray-base-dtype';\nimport getData from '@stdlib/ndarray-base-data-buffer';\nimport zeros from '@stdlib/array-base-zeros';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Broadcasts an ndarray to a specified shape.\n*\n* ## Notes\n*\n* - The returned array is a view on the input array data buffer. The view is typically **not** contiguous. As more than one element of a returned view may refer to the same memory location, writing to the view may affect multiple elements. If you need to write to the returned array, copy the array before performing operations which may mutate elements.\n*\n* @param {ndarray} arr - input array\n* @param {NonNegativeIntegerArray} shape - desired shape\n* @throws {Error} input array cannot have more dimensions than the desired shape\n* @throws {Error} input array dimension sizes must be `1` or equal to the corresponding dimension in the provided shape\n* @throws {Error} input array and desired shape must be broadcast compatible\n* @returns {ndarray} broadcasted array\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var shx = x.shape;\n* // returns [ 2, 2 ]\n*\n* var y = broadcastArray( x, [ 3, 2, 2 ] );\n* // returns \n*\n* var shy = y.shape;\n* // returns [ 3, 2, 2 ]\n*\n* var v = y.get( 0, 0, 0 );\n* // returns 1\n*\n* v = y.get( 0, 0, 1 );\n* // returns 2\n*\n* v = y.get( 1, 0, 0 );\n* // returns 1\n*\n* v = y.get( 1, 1, 0 );\n* // returns 3\n*\n* v = y.get( 2, 0, 0 );\n* // returns 1\n*\n* v = y.get( 2, 1, 1 );\n* // returns 4\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var y = broadcastArray( x, [ 3, 2 ] );\n* // throws \n*/\nfunction broadcastArray( arr, shape ) {\n\tvar strides;\n\tvar dim;\n\tvar sh;\n\tvar st;\n\tvar N;\n\tvar M;\n\tvar d;\n\tvar i;\n\tvar j;\n\n\tN = shape.length;\n\tsh = getShape( arr, false );\n\tM = sh.length;\n\tif ( N < M ) {\n\t\tthrow new Error( 'invalid argument. Cannot broadcast an array to a shape having fewer dimensions. Arrays can only be broadcasted to shapes having the same or more dimensions.' );\n\t}\n\t// Initialize a strides array:\n\tstrides = zeros( N );\n\n\t// Determine the output array strides...\n\tst = getStrides( arr, false );\n\tfor ( i = N-1; i >= 0; i-- ) {\n\t\tj = M - N + i;\n\t\tif ( j < 0 ) {\n\t\t\t// Prepended singleton dimension; stride is zero...\n\t\t\tcontinue;\n\t\t}\n\t\td = sh[ j ];\n\t\tdim = shape[ i ];\n\t\tif ( dim !== 0 && dim < d ) {\n\t\t\tthrow new Error( format( 'invalid argument. Input array cannot be broadcast to the specified shape, as the specified shape has a dimension whose size is less than the size of the corresponding dimension in the input array. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( sh ).join( ', ' ), copy( shape ).join( ', ' ), i ) );\n\t\t}\n\t\tif ( d === dim ) {\n\t\t\tstrides[ i ] = st[ j ];\n\t\t} else if ( d === 1 ) {\n\t\t\t// In order to broadcast dimensions, we set the stride for that dimension to zero...\n\t\t\tstrides[ i ] = 0;\n\t\t} else {\n\t\t\t// At this point, we know that `dim > d` and that `d` does not equal `1` (e.g., `dim=3` and `d=2`); in which case, the shapes are considered incompatible (even for desired shapes which are multiples of array dimensions, as might be desired when \"tiling\" an array; e.g., `dim=4` and `d=2`)...\n\t\t\tthrow new Error( format( 'invalid argument. Input array and the specified shape are broadcast incompatible. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( sh ).join( ', ' ), copy( shape ).join( ', ' ), i ) );\n\t\t}\n\t}\n\treturn ndarray( getDType( arr ), getData( arr ), copy( shape ), strides, getOffset( arr ), getOrder( arr ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default broadcastArray;\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 broadcast from '@stdlib/ndarray-base-broadcast-array';\nimport getShape from '@stdlib/ndarray-base-shape';\n\n\n// MAIN //\n\n/**\n* Broadcasts an ndarray to a specified shape if and only if the specified shape differs from the provided ndarray's shape.\n*\n* ## Notes\n*\n* - If a provided ndarray has the same shape as the specified shape, the function returns the provided ndarray.\n* - If a provided ndarray has a different (broadcast compatible) shape than the specified shape, the function returns a new (base) ndarray view of the provided ndarray's data. The view is typically **not** contiguous. As more than one element of a returned view may refer to the same memory location, writing to the view may affect multiple elements. If you need to write to the returned array, copy the array before performing operations which may mutate elements.\n*\n* @param {ndarray} arr - input array\n* @param {NonNegativeIntegerArray} shape - desired shape\n* @throws {Error} input array cannot have more dimensions than the desired shape\n* @throws {Error} input array dimension sizes must be `1` or equal to the corresponding dimension in the provided shape\n* @throws {Error} input array and desired shape must be broadcast compatible\n* @returns {ndarray} broadcasted array\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var shx = x.shape;\n* // returns [ 2, 2 ]\n*\n* var y = maybeBroadcastArray( x, [ 3, 2, 2 ] );\n* // returns \n*\n* var shy = y.shape;\n* // returns [ 3, 2, 2 ]\n*\n* var v = y.get( 0, 0, 0 );\n* // returns 1\n*\n* v = y.get( 0, 0, 1 );\n* // returns 2\n*\n* v = y.get( 1, 0, 0 );\n* // returns 1\n*\n* v = y.get( 1, 1, 0 );\n* // returns 3\n*\n* v = y.get( 2, 0, 0 );\n* // returns 1\n*\n* v = y.get( 2, 1, 1 );\n* // returns 4\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var y = maybeBroadcastArray( x, [ 3, 2 ] );\n* // throws \n*/\nfunction maybeBroadcastArray( arr, shape ) {\n\tvar sh;\n\tvar N;\n\tvar i;\n\n\tN = shape.length;\n\tsh = getShape( arr, false );\n\n\t// Check whether we need to broadcast the input array...\n\tif ( sh.length === N ) {\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t// Check whether dimensions match...\n\t\t\tif ( sh[ i ] !== shape[ i ] ) {\n\t\t\t\t// We found a mismatched dimension; delegate to `broadcast` to ensure that the input array is broadcast compatible with the desired array shape...\n\t\t\t\treturn broadcast( arr, shape );\n\t\t\t}\n\t\t}\n\t\treturn arr;\n\t}\n\t// If we are provided an array having a different rank (i.e., number of dimensions) than the desired shape, assume we need to broadcast, delegating to `broadcast` to ensure that the input array is broadcast compatible with the desired array shape...\n\treturn broadcast( arr, shape );\n}\n\n\n// EXPORTS //\n\nexport default maybeBroadcastArray;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'complex_floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray complex-valued floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray complex-valued floating-point data type\n*\n* @example\n* var bool = isComplexFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'complex64' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'complex128' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'float32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'float64' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isComplexFloatingPointDataType( v ) { // eslint-disable-line id-length\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isComplexFloatingPointDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 isProtoOf = Object.prototype.isPrototypeOf;\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests if an object's prototype chain contains a provided prototype.\n*\n* @param {*} value - value to test\n* @param {(Object|Function)} proto - prototype\n* @throws {TypeError} second argument must be an object and not null\n* @returns {boolean} boolean indicating if a provided prototype exists in a prototype chain\n*\n* @example\n* import inherit from '@stdlib/utils-inherit';\n*\n* function Foo() {\n* return this;\n* }\n*\n* function Bar() {\n* return this;\n* }\n* inherit( Bar, Foo );\n*\n* var bar = new Bar();\n*\n* var bool = isPrototypeOf( bar, Foo.prototype );\n* // returns true\n*/\nfunction isPrototypeOf( value, proto ) { // eslint-disable-line stdlib/no-redeclare\n\tvar type = typeof proto;\n\tif (\n\t\tproto === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either an object (except null) or a function. Value: `%s`.', proto ) );\n\t}\n\ttype = typeof value;\n\tif (\n\t\tvalue === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\treturn false;\n\t}\n\treturn isProtoOf.call( proto, value );\n}\n\n\n// EXPORTS //\n\nexport default isPrototypeOf;\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 values from `x` into `y`.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Object} y - output array object\n* @param {Collection} y.data - output array data\n* @param {Array} y.accessors - array element accessors\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Object} output array object\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n*\n* function setter( data, idx, value ) {\n* data.set( value, idx );\n* }\n*\n* function getter( data, idx ) {\n* return data.get( idx );\n* }\n*\n* var x = {\n* 'data': new Complex64Array( [ 1.0, 2.0, 3.0, 4.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* var y = {\n* 'data': new Complex64Array( [ 5.0, 6.0, 7.0, 8.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* gcopy( x.data.length, x, 1, 0, y, 1, 0 );\n*\n* var view = reinterpret64( y.data, 0 );\n* // view => [ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar set;\n\tvar get;\n\tvar ix;\n\tvar iy;\n\tvar i;\n\n\t// Cache references to array data:\n\txbuf = x.data;\n\tybuf = y.data;\n\n\t// Cache a reference to the element accessors:\n\tget = x.accessors[ 0 ];\n\tset = y.accessors[ 1 ];\n\n\tix = offsetX;\n\tiy = offsetY;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( ybuf, iy, get( xbuf, ix ) );\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, y, strideY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\tif ( strideX < 0 ) {\n\t\t\tix = (1-N) * strideX;\n\t\t} else {\n\t\t\tix = 0;\n\t\t}\n\t\tif ( strideY < 0 ) {\n\t\t\tiy = (1-N) * strideY;\n\t\t} else {\n\t\t\tiy = 0;\n\t\t}\n\t\taccessors( N, ox, strideX, ix, oy, strideY, iy );\n\t\treturn oy.data;\n\t}\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ i ] = x[ i ];\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ i ] = x[ i ];\n\t\t\ty[ i+1 ] = x[ i+1 ];\n\t\t\ty[ i+2 ] = x[ i+2 ];\n\t\t\ty[ i+3 ] = x[ i+3 ];\n\t\t\ty[ i+4 ] = x[ i+4 ];\n\t\t\ty[ i+5 ] = x[ i+5 ];\n\t\t\ty[ i+6 ] = x[ i+6 ];\n\t\t\ty[ i+7 ] = x[ i+7 ];\n\t\t}\n\t\treturn y;\n\t}\n\tif ( strideX < 0 ) {\n\t\tix = (1-N) * strideX;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( strideY < 0 ) {\n\t\tiy = (1-N) * strideY;\n\t} else {\n\t\tiy = 0;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\taccessors( N, ox, strideX, offsetX, oy, strideY, offsetY );\n\t\treturn oy.data;\n\t}\n\tix = offsetX;\n\tiy = offsetY;\n\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ iy ] = x[ ix ];\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ iy ] = x[ ix ];\n\t\t\ty[ iy+1 ] = x[ ix+1 ];\n\t\t\ty[ iy+2 ] = x[ ix+2 ];\n\t\t\ty[ iy+3 ] = x[ ix+3 ];\n\t\t\ty[ iy+4 ] = x[ ix+4 ];\n\t\t\ty[ iy+5 ] = x[ ix+5 ];\n\t\t\ty[ iy+6 ] = x[ ix+6 ];\n\t\t\ty[ iy+7 ] = x[ ix+7 ];\n\t\t\tix += M;\n\t\t\tiy += M;\n\t\t}\n\t\treturn y;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 minimum value.\n*\n* @param {number} x - first number\n* @param {number} y - second number\n* @returns {number} minimum value\n*\n* @example\n* var v = min( 3.14, 4.2 );\n* // returns 3.14\n*\n* @example\n* var v = min( 3.14, NaN );\n* // returns NaN\n*\n* @example\n* var v = min( NaN, 3.14 );\n* // returns 3.14\n*\n* @example\n* var v = min( -0.0, +0.0 );\n* // returns +0.0\n*\n* @example\n* var v = min( +0.0, -0.0 );\n* // returns -0.0\n*/\nfunction min( x, y ) {\n\tif ( x < y ) {\n\t\treturn x;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default 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/**\n* BLAS level 1 routine to copy values from `x` into `y`.\n*\n* @module @stdlib/blas-base-gcopy\n*\n* @example\n* import gcopy from '@stdlib/blas-base-gcopy';\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*\n* @example\n* import gcopy from '@stdlib/blas-base-gcopy';\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy.ndarray( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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// Define a property name which is unlikely to be used in end user code:\nvar PRIVATE_BUFFER = '__@@##$$@@__struct_buffer__@@$$##@@__';\n\n\n// EXPORTS //\n\nexport default PRIVATE_BUFFER;\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\nvar CTOR_NAME = 'Struct';\n\n\n// EXPORTS //\n\nexport default CTOR_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 defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-write accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - get accessor\n* @param {Function} setter - set accessor\n*\n* @example\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setNonEnumerableReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\nfunction setNonEnumerableReadWriteAccessor( obj, prop, getter, setter ) { // 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\t'set': setter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadWriteAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 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* setReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setReadOnlyAccessor( obj, prop, getter ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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-write accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - get accessor\n* @param {Function} setter - set accessor\n*\n* @example\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\nfunction setReadWriteAccessor( obj, prop, getter, setter ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'get': getter,\n\t\t'set': setter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadWriteAccessor;\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\nvar DATA_VIEW_METHODS = {\n\t'int8': {\n\t\t'get': 'getInt8',\n\t\t'set': 'setInt8'\n\t},\n\t'int16': {\n\t\t'get': 'getInt16',\n\t\t'set': 'setInt16'\n\t},\n\t'int32': {\n\t\t'get': 'getInt32',\n\t\t'set': 'setInt32'\n\t},\n\t'int64': {\n\t\t'get': 'getBigInt64',\n\t\t'set': 'setBigInt64'\n\t},\n\t'uint8': {\n\t\t'get': 'getUint8',\n\t\t'set': 'setUint8'\n\t},\n\t'uint16': {\n\t\t'get': 'getUint16',\n\t\t'set': 'setUint16'\n\t},\n\t'uint32': {\n\t\t'get': 'getUint32',\n\t\t'set': 'setUint32'\n\t},\n\t'uint64': {\n\t\t'get': 'getBigUint64',\n\t\t'set': 'setBigUint64'\n\t},\n\t'float16': {\n\t\t'get': 'getFloat16',\n\t\t'set': 'setFloat16'\n\t},\n\t'float32': {\n\t\t'get': 'getFloat32',\n\t\t'set': 'setFloat32'\n\t},\n\t'float64': {\n\t\t'get': 'getFloat64',\n\t\t'set': 'setFloat64'\n\t},\n\t'complex32': {\n\t\t'get': 'getFloat16',\n\t\t'set': 'setFloat16'\n\t},\n\t'complex64': {\n\t\t'get': 'getFloat32',\n\t\t'set': 'setFloat32'\n\t},\n\t'complex128': {\n\t\t'get': 'getFloat64',\n\t\t'set': 'setFloat64'\n\t},\n\t'bool': {\n\t\t'get': 'getUint8',\n\t\t'set': 'setUint8'\n\t}\n};\n\n\n// EXPORTS //\n\nexport default DATA_VIEW_METHODS;\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 Complex64 from '@stdlib/complex-float32-ctor';\nimport Complex128 from '@stdlib/complex-float64-ctor';\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'complex64': Complex64,\n\t'complex128': Complex128\n};\n\n\n// EXPORTS //\n\nexport default ctors;\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 table from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns a complex number constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'complex128' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'complex' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctors from '@stdlib/complex-ctors';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar TABLE = {\n\t'float64': 'complex128',\n\t'float32': 'complex64'\n};\nvar DEFAULT_CTOR = ctors( TABLE[ 'float64' ] );\n\n\n// MAIN //\n\n/**\n* Creates a complex number.\n*\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {Complex} complex number\n*\n* @example\n* var z = complex( 5.0, 3.0, 'float64' );\n* // returns \n*/\nfunction complex( real, imag, dtype ) {\n\tvar ctor;\n\tif ( arguments.length > 2 ) {\n\t\tctor = ctors( TABLE[ dtype ] );\n\t\tif ( ctor ) {\n\t\t\treturn new ctor( real, imag );\n\t\t}\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\treturn new DEFAULT_CTOR( real, imag );\n}\n\n\n// EXPORTS //\n\nexport default complex;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport complex from '@stdlib/complex-cmplx';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// VARIABLES //\n\nvar CMPLX_TO_REAL = {\n\t'complex128': 'float64',\n\t'complex64': 'float32',\n\t'complex32': 'float16'\n};\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getComplex( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a complex number from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Complex} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\tvar re = view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN );\n\t\tvar im = view[ method ]( obj.byteOffset+(obj.byteLength/2), IS_LITTLE_ENDIAN );\n\t\treturn complex( re, im, CMPLX_TO_REAL[ obj.type ] );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getComplex;\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 Int16Array from '@stdlib/array-int16';\nimport Int32Array from '@stdlib/array-int32';\nimport Int8Array from '@stdlib/array-int8';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array,\n\t'bool': BooleanArray\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport table from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns a typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\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// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `BooleanArray` as a `Uint8Array`.\n*\n* @param {BooleanArray} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Uint8Array} `Uint8Array` view\n*\n* @example\n* import BooleanArray from '@stdlib/array-bool';\n*\n* var x = new BooleanArray( 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 Uint8Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 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) 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/**\n* Returns default array settings.\n*\n* @returns {Object} defaults\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t// Data types:\n\t\t'dtypes': {\n\t\t\t'default': 'float64',\n\t\t\t'numeric': 'float64',\n\t\t\t'real': 'float64',\n\t\t\t'floating_point': 'float64',\n\t\t\t'real_floating_point': 'float64',\n\t\t\t'complex_floating_point': 'complex128',\n\t\t\t'integer': 'int32',\n\t\t\t'signed_integer': 'int32',\n\t\t\t'unsigned_integer': 'uint32',\n\t\t\t'boolean': 'bool',\n\t\t\t'index': 'int32',\n\t\t\t'integer_index': 'int32',\n\t\t\t'boolean_index': 'bool',\n\t\t\t'mask_index': 'uint8'\n\t\t}\n\t};\n}\n\n\n// EXPORTS //\n\nexport default defaults;\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 defaults from './main.js';\n\n\n// VARIABLES //\n\nvar DEFAULTS = defaults();\nvar HASH = {\n\t'dtypes.default': DEFAULTS.dtypes.default,\n\t'dtypes.numeric': DEFAULTS.dtypes.numeric,\n\t'dtypes.real': DEFAULTS.dtypes.real,\n\t'dtypes.floating_point': DEFAULTS.dtypes.floating_point,\n\t'dtypes.real_floating_point': DEFAULTS.dtypes.real_floating_point,\n\t'dtypes.complex_floating_point': DEFAULTS.dtypes.complex_floating_point,\n\t'dtypes.integer': DEFAULTS.dtypes.integer,\n\t'dtypes.signed_integer': DEFAULTS.dtypes.signed_integer,\n\t'dtypes.unsigned_integer': DEFAULTS.dtypes.unsigned_integer,\n\t'dtypes.boolean': DEFAULTS.dtypes.boolean,\n\t'dtypes.index': DEFAULTS.dtypes.index,\n\t'dtypes.integer_index': DEFAULTS.dtypes.integer_index,\n\t'dtypes.boolean_index': DEFAULTS.dtypes.boolean_index,\n\t'dtypes.mask_index': DEFAULTS.dtypes.mask_index\n};\n\n\n// MAIN //\n\n/**\n* Returns a default array setting.\n*\n* @param {string} name - setting name\n* @returns {*} default setting or null\n*\n* @example\n* var v = get( 'dtypes.default' );\n* // returns \n*/\nfunction get( name ) {\n\tvar v = HASH[ name ];\n\treturn ( v === void 0 ) ? null : v;\n}\n\n\n// EXPORTS //\n\nexport default get;\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/**\n* Return default array settings.\n*\n* @module @stdlib/array-defaults\n*\n* @example\n* import defaults from '@stdlib/array-defaults';\n*\n* var o = defaults();\n* // returns {...}\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport get from './get.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'get', get );\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// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport ctors from '@stdlib/array-typed-ctors';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport defaults from '@stdlib/array-defaults';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\nvar Complex64Array = ctors( 'complex64' );\nvar Complex128Array = ctors( 'complex128' );\nvar BooleanArray = ctors( 'bool' );\n\n\n// MAIN //\n\n/**\n* Creates a typed array.\n*\n* @param {(NonNegativeInteger|ComplexArray|TypedArray|ArrayLikeObject|ArrayBuffer)} [arg] - a length, typed array, array-like object, or buffer\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {(ComplexArray|TypedArray)} typed array\n*\n* @example\n* var arr = typedarray();\n* // returns \n*\n* @example\n* var arr = typedarray( 2 );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( 2, 'float32' );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( [ 0.5, 0.5 ] );\n* // returns [ 0.5, 0.5 ]\n*\n* @example\n* var arr = typedarray( [ 5, -3 ], 'int32' );\n* // returns [ 5, -3 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1 );\n* // returns [ 5.0, 3.0 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1, 'uint32' );\n* // returns [ 5, 3 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 'float32' );\n* // returns [ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8 );\n* // returns [ 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8, 'float32' );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2 );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2, 'int32' );\n* // returns [ 0, 0 ]\n*/\nfunction typedarray() {\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\tnargs -= 1;\n\t\tdtype = arguments[ nargs ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) {\n\t\targ = arguments[ 0 ];\n\n\t\t// Note: the following checks are not particularly robust, as `instanceof` will fail for cross-realm instances...\n\t\tif ( arg instanceof Complex64Array ) {\n\t\t\targ = reinterpret64( arg, 0 );\n\t\t} else if ( arg instanceof Complex128Array ) {\n\t\t\targ = reinterpret128( arg, 0 );\n\t\t} else if ( arg instanceof BooleanArray ) {\n\t\t\targ = reinterpretBoolean( arg, 0 );\n\t\t}\n\t\treturn new ctor( arg );\n\t}\n\tif ( nargs === 2 ) {\n\t\treturn new ctor( arguments[0], arguments[1] );\n\t}\n\treturn new ctor( arguments[0], arguments[1], arguments[2] );\n}\n\n\n// EXPORTS //\n\nexport default typedarray;\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 format from '@stdlib/string-format';\nimport DATA_VIEW_METHODS from './data_view_methods.js';\nimport getNumber from './get_number.js';\nimport getBoolean from './get_boolean.js';\nimport getComplex from './get_complex.js';\nimport getBigInt from './get_bigint.js';\nimport getStruct from './get_struct.js';\nimport getTypedArray from './get_typedarray.js';\nimport getStructArray from './get_struct_array.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @throws {Error} unexpected error\n* @returns {Function} function for resolving field data\n*/\nfunction getter( obj ) {\n\tif ( obj.length ) {\n\t\tif ( obj.isStructType ) {\n\t\t\treturn getStructArray( obj );\n\t\t}\n\t\treturn getTypedArray( obj );\n\t}\n\tswitch ( obj.type ) {\n\tcase 'float64':\n\tcase 'float32':\n\tcase 'float16':\n\tcase 'int8':\n\tcase 'int16':\n\tcase 'int32':\n\tcase 'uint8':\n\tcase 'uint16':\n\tcase 'uint32':\n\t\treturn getNumber( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'int64':\n\tcase 'uint64':\n\t\treturn getBigInt( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'bool':\n\t\treturn getBoolean( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'complex128':\n\tcase 'complex64':\n\tcase 'complex32':\n\t\treturn getComplex( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tdefault:\n\t\tif ( obj.isStructType ) {\n\t\t\treturn getStruct( obj );\n\t\t}\n\t\t// Ensure that we fail loudly if we have failed to add support for newly added data types:\n\t\tthrow new Error( format( 'unexpected error. Unrecognized data type. Value: `%s`.', obj.type ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getter;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getStructArray( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a list of `struct` views of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Array} result\n\t*/\n\tfunction getter() {\n\t\tvar offset;\n\t\tvar view;\n\t\tvar out;\n\t\tvar i;\n\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\toffset = view.byteOffset + obj.byteOffset;\n\t\tout = [];\n\t\tfor ( i = 0; i < obj.length; i++ ) {\n\t\t\tout.push( new obj.type( view.buffer, offset, obj.byteLength ) );\n\t\t\toffset += obj.byteOffset;\n\t\t}\n\t\treturn out;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getStructArray;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport typedarray from '@stdlib/array-typed';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getTypedArray( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a typed array view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {TypedArray} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn typedarray( view.buffer, view.byteOffset+obj.byteOffset, obj.length, obj.type ); // eslint-disable-line max-len\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getTypedArray;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getBigInt( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a BigInt value from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {BigInt} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getBigInt;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Boolean from '@stdlib/boolean-ctor';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getBoolean( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a boolean value from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {boolean} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn Boolean( view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getBoolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getStruct( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a `struct` view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Object} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn new obj.type( view.buffer, view.byteOffset+obj.byteOffset, obj.byteLength ); // eslint-disable-line max-len\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getStruct;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport replace from '@stdlib/string-base-replace';\nimport DTYPES from './dtypes.json';\n\n\n// VARIABLES //\n\nvar RE_SUFFIX = /_and_generic$/;\n\n\n// MAIN //\n\n/**\n* Returns a list of array data types.\n*\n* @param {string} [kind] - data type kind\n* @returns {StringArray} list of array data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', ... ]\n*\n* @example\n* var list = dtypes( 'floating_point' );\n* // returns [...]\n*/\nfunction dtypes() {\n\tvar kind;\n\tvar out;\n\tvar FLG;\n\tif ( arguments.length === 0 ) {\n\t\treturn DTYPES.all.slice();\n\t}\n\tFLG = false;\n\tkind = arguments[ 0 ];\n\tif ( RE_SUFFIX.test( kind ) ) {\n\t\tkind = replace( kind, RE_SUFFIX, '' );\n\t\tif ( kind !== 'all' && kind !== 'index' ) {\n\t\t\tFLG = true;\n\t\t}\n\t}\n\tout = DTYPES[ kind ];\n\tout = ( out ) ? out.slice() : [];\n\tif ( FLG && out.length > 0 ) {\n\t\tout.push( 'generic' );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypes;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array real-valued floating-point data type.\n*\n* @name isRealFloatingPointDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array real-valued floating-point data type\n*\n* @example\n* var bool = isRealFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'foo' );\n* // returns false\n*/\nvar isRealFloatingPointDataType = contains( dtypes( 'real_floating_point' ) ); // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nexport default isRealFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array signed integer data type.\n*\n* @name isSignedIntegerDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array signed integer data type\n*\n* @example\n* var bool = isSignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'uint16' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8c' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'foo' );\n* // returns false\n*/\nvar isSignedIntegerDataType = contains( dtypes( 'signed_integer' ) );\n\n\n// EXPORTS //\n\nexport default isSignedIntegerDataType;\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* Tests if a value is a BigInt primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a BigInt primitive\n*/\nfunction isBigInt( value ) {\n\treturn ( typeof value === 'bigint' );\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\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 nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BigInt object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a BigInt object\n*/\nfunction BigInt( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tnativeClass( value ) === '[object BigInt]' &&\n\t\ttest( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default BigInt;\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* Attempts to call a `BigInt` method.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if able to call a `BigInt` method\n*/\nfunction test( value ) {\n\ttry {\n\t\treturn (\n\t\t\t// Objects created via `Object.create( null )` have no `valueOf()` method:\n\t\t\ttypeof value.valueOf() === 'bigint'\n\t\t);\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) 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 from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BigInt.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a BigInt\n*/\nfunction isBigInt( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Creates a function which always returns the same value.\n*\n* @param {*} [value] - value to always return\n* @returns {Function} constant function\n*\n* @example\n* var fcn = wrap( 3.14 );\n*\n* var v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*/\nfunction wrap( value ) {\n\treturn constantFunction;\n\n\t/**\n\t* Constant function.\n\t*\n\t* @private\n\t* @returns {*} constant value\n\t*/\n\tfunction constantFunction() {\n\t\treturn value;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrap;\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 setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport isSymbol from './generic.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( isSymbol, 'isPrimitive', isPrimitive );\nsetReadOnly( isSymbol, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default isSymbol;\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 setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport constantFunction from '@stdlib/utils-constant-function';\n\n\n// MAIN //\n\nvar isBigInt = constantFunction( false );\nvar isPrimitive = constantFunction( false );\nvar isObject = constantFunction( false );\n\nsetReadOnly( isBigInt, 'isPrimitive', isPrimitive );\nsetReadOnly( isBigInt, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default isBigInt;\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* Test if a value is a BigInt.\n*\n* @module @stdlib/assert-is-bigint\n*\n* @example\n* import BigInt from '@stdlib/bigint-ctor';\n* import isBigInt from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigInt( BigInt( '1' ) );\n* // returns true\n*\n* bool = isBigInt( Object( BigInt( '1' ) ) );\n* // returns true\n*\n* bool = isBigInt( {} );\n* // returns false\n*\n* @example\n* import { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigInt( BigInt( '1' ) );\n* // returns true\n*\n* bool = isBigInt( Object( BigInt( '1' ) ) );\n* // returns false\n*\n* bool = isBigInt( {} );\n* // returns false\n*\n* @example\n* import { isObject as isBigIntObject } from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigIntObject( BigInt( '1' ) );\n* // returns false\n*\n* bool = isBigIntObject( Object( BigInt( '1' ) ) );\n* // returns true\n*\n* bool = isBigIntObject( {} );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasBigInts from '@stdlib/assert-has-bigint-support';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isBigInt;\nif ( hasBigInts() ) {\n\tisBigInt = main;\n} else {\n\tisBigInt = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\n\n// exports: { \"isPrimitive\": \"isBigInt.isPrimitive\", \"isObject\": \"isBigInt.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// MODULES //\n\nimport objectKeys from '@stdlib/utils-keys';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport SAFE_CASTS from './safe_casts.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of safe casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of safe casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast.\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = safeCasts( 'float32' );\n* // returns [...]\n*/\nfunction safeCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default safeCasts;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport safeCasts from '@stdlib/ndarray-safe-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = safeCasts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast to another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be safely cast to another data type\n*\n* @example\n* var bool = isSafeCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isSafeCast( 'float64', 'int32' );\n* // returns false\n*/\nfunction isSafeCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isSafeCast;\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 objectKeys from '@stdlib/utils-keys';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport CASTS from './data.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast and, for floating-point data types, can be downcast.\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = mostlySafeCasts( 'float32' );\n* // returns [...]\n*/\nfunction mostlySafeCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default mostlySafeCasts;\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 casts from '@stdlib/ndarray-mostly-safe-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = casts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast or, for floating-point data types, downcast to another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isMostlySafeCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isMostlySafeCast( 'float64', 'int32' );\n* // returns false\n*/\nfunction isMostlySafeCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a \"mostly\" safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isMostlySafeCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport SAME_KIND_CASTS from './same_kind_casts.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of same \"kind\" casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of same \"kind\" casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast or cast within the same \"kind\".\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = sameKindCasts( 'float32' );\n* // returns [...]\n*/\nfunction sameKindCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default sameKindCasts;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport sameKindCasts from '@stdlib/ndarray-same-kind-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = sameKindCasts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast to, or is of the same \"kind\" as, another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isSameKindCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isSameKindCast( 'uint16', 'int16' );\n* // returns false\n*/\nfunction isSameKindCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isSameKindCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isSafeCast from '@stdlib/ndarray-base-assert-is-safe-data-type-cast';\nimport isMostlySafeCast from '@stdlib/ndarray-base-assert-is-mostly-safe-data-type-cast';\nimport isSameKindCast from '@stdlib/ndarray-base-assert-is-same-kind-data-type-cast';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be cast to another ndarray data type according to a specified casting mode.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @param {string} casting - ndarray casting mode\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isAllowedCast( 'float32', 'float64', 'safe' );\n* // returns true\n*\n* bool = isAllowedCast( 'float64', 'int32', 'safe' );\n* // returns false\n*/\nfunction isAllowedCast( from, to, casting ) {\n\tvar dt1;\n\tvar dt2;\n\n\t// Anything goes for \"unsafe\" casting...\n\tif ( casting === 'unsafe' ) {\n\t\treturn true;\n\t}\n\tdt1 = resolveStr( from );\n\tdt2 = resolveStr( to );\n\n\t// \"Casting\" to the same data type is always allowed, regardless of the casting mode...\n\tif ( dt1 === dt2 ) {\n\t\treturn true;\n\t}\n\t// No casts between different data types are allowed in \"none\" or \"equiv\" casting modes...\n\tif ( casting === 'none' || casting === 'equiv' ) {\n\t\treturn false;\n\t}\n\t// In \"safe\" casting mode, only casts which preserve values are allowed...\n\tif ( casting === 'safe' ) {\n\t\treturn isSafeCast( from, to );\n\t}\n\t// In \"mostly-safe\" casting mode, in addition to \"safe\" casts, for floating-point data types, downcasts are allowed...\n\tif ( casting === 'mostly-safe' ) {\n\t\treturn isMostlySafeCast( from, to );\n\t}\n\t// In \"same-kind\" casting mode, in addition to \"safe\" casts, casts within a \"kind\" (e.g., between signed integers or between floating-point numbers) are allowed...\n\treturn isSameKindCast( from, to );\n}\n\n\n// EXPORTS //\n\nexport default isAllowedCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Smallest positive single-precision floating-point subnormal number.\n*\n* @module @stdlib/constants-float32-smallest-subnormal\n* @type {number}\n*\n* @example\n* import FLOAT32_SMALLEST_SUBNORMAL from '@stdlib/constants-float32-smallest-subnormal';\n* // returns 1.401298464324817e-45\n*/\n\n\n// MAIN //\n\n/**\n* Smallest positive single-precision floating-point subnormal number.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* \\frac{1}{2^{127-1} 2^{23}}\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 00000000 00000000000000000000001\n* ```\n*\n* @constant\n* @type {number}\n* @default 1.401298464324817e-45\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_SMALLEST_SUBNORMAL = 1.401298464324817e-45;\n\n\n// EXPORTS //\n\nexport default FLOAT32_SMALLEST_SUBNORMAL;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 safe single-precision floating-point integer.\n*\n* @module @stdlib/constants-float32-max-safe-integer\n* @type {number}\n*\n* @example\n* import FLOAT32_MAX_SAFE_INTEGER from '@stdlib/constants-float32-max-safe-integer';\n* // returns 16777215\n*/\n\n\n// MAIN //\n\n/**\n* Maximum safe single-precision floating-point integer.\n*\n* ## Notes\n*\n* The maximum safe integer is given by\n*\n* ```tex\n* 2^{24} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 16777215\n* @see [Safe Integers]{@link http://www.2ality.com/2013/10/safe-integers.html}\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_MAX_SAFE_INTEGER = 16777215;\n\n\n// EXPORTS //\n\nexport default FLOAT32_MAX_SAFE_INTEGER;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 safe single-precision floating-point integer.\n*\n* @module @stdlib/constants-float32-min-safe-integer\n* @type {number}\n*\n* @example\n* import FLOAT32_MIN_SAFE_INTEGER from '@stdlib/constants-float32-min-safe-integer';\n* // returns -16777215\n*/\n\n\n// MAIN //\n\n/**\n* Minimum safe single-precision floating-point integer.\n*\n* ## Notes\n*\n* The minimum safe integer is given by\n*\n* ```tex\n* -(2^{24} - 1)\n* ```\n*\n* @constant\n* @type {number}\n* @default -16777215\n* @see [Safe Integers]{@link http://www.2ality.com/2013/10/safe-integers.html}\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_MIN_SAFE_INTEGER = -16777215;\n\n\n// EXPORTS //\n\nexport default FLOAT32_MIN_SAFE_INTEGER;\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 isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isNegativeZero from '@stdlib/math-base-assert-is-negative-zero';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport FLOAT32_SMALLEST_SUBNORMAL from '@stdlib/constants-float32-smallest-subnormal'; // eslint-disable-line id-length\nimport FLOAT32_MAX_SAFE_INTEGER from '@stdlib/constants-float32-max-safe-integer';\nimport FLOAT32_MIN_SAFE_INTEGER from '@stdlib/constants-float32-min-safe-integer';\nimport INT8_MIN from '@stdlib/constants-int8-min';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport UINT8_MAX from '@stdlib/constants-uint8-max';\nimport UINT16_MAX from '@stdlib/constants-uint16-max';\nimport UINT32_MAX from '@stdlib/constants-uint32-max';\n\n\n// FUNCTIONS //\n\n/**\n* Returns the minimum floating-point array data type of the closest \"kind\" necessary for storing a provided scalar.\n*\n* @private\n* @param {number} value - real value\n* @returns {string} array data type\n*/\nfunction minFloatDataType( value ) {\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value >= FLOAT32_MIN_SAFE_INTEGER && value <= FLOAT32_MAX_SAFE_INTEGER ) { // eslint-disable-line max-len\n\t\t\treturn 'float32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// MAIN //\n\n/**\n* Returns the minimum array data type of the closest \"kind\" necessary for storing a provided scalar value.\n*\n* @param {*} value - scalar value\n* @returns {string} array data type\n*\n* @example\n* var dt = minDataType( 3.141592653589793 );\n* // returns 'float32'\n*\n* @example\n* var dt = minDataType( 3 );\n* // returns 'uint8'\n*/\nfunction minDataType( value ) {\n\tif ( !isNumber( value ) ) {\n\t\tif ( isBoolean( value ) ) {\n\t\t\treturn 'bool';\n\t\t}\n\t\tif ( isComplexLike( value ) ) {\n\t\t\tif ( minFloatDataType( value.re ) === 'float64' || minFloatDataType( value.im ) === 'float64' ) {\n\t\t\t\treturn 'complex128';\n\t\t\t}\n\t\t\treturn 'complex64';\n\t\t}\n\t\treturn 'generic';\n\t}\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value === 0 && isNegativeZero( value ) ) {\n\t\t\treturn 'float32';\n\t\t}\n\t\tif ( value < 0 ) {\n\t\t\tif ( value >= INT8_MIN ) {\n\t\t\t\treturn 'int8';\n\t\t\t}\n\t\t\tif ( value >= INT16_MIN ) {\n\t\t\t\treturn 'int16';\n\t\t\t}\n\t\t\tif ( value >= INT32_MIN ) {\n\t\t\t\treturn 'int32';\n\t\t\t}\n\t\t\treturn 'float64';\n\t\t}\n\t\tif ( value <= UINT8_MAX ) {\n\t\t\treturn 'uint8';\n\t\t}\n\t\tif ( value <= UINT16_MAX ) {\n\t\t\treturn 'uint16';\n\t\t}\n\t\tif ( value <= UINT32_MAX ) {\n\t\t\treturn 'uint32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// EXPORTS //\n\nexport default minDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport NINF from '@stdlib/constants-float64-ninf';\n\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is negative zero.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is negative zero\n*\n* @example\n* var bool = isNegativeZero( -0.0 );\n* // returns true\n*\n* @example\n* var bool = isNegativeZero( 0.0 );\n* // returns false\n*/\nfunction isNegativeZero( x ) {\n\treturn (x === 0.0 && 1.0/x === NINF);\n}\n\n\n// EXPORTS //\n\nexport default isNegativeZero;\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// Mapping from complex number constructors to data types...\nvar ctor2dtypes = {\n\t'Complex64': 'complex64',\n\t'Complex128': 'complex128'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\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 dtypes from '@stdlib/complex-dtypes';\n\n\n// MAIN //\n\nvar DTYPES = dtypes();\n\n\n// EXPORTS //\n\nexport default DTYPES;\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 ctors from '@stdlib/complex-ctors';\nimport DTYPES from './dtypes.js';\n\n\n// MAIN //\n\nvar CTORS = [];\nvar i;\nfor ( i = 0; i < DTYPES.length; i++ ) {\n\tCTORS.push( ctors( DTYPES[ i ] ) );\n}\n\n\n// EXPORTS //\n\nexport default CTORS;\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 DTYPES from './dtypes.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of complex number data types.\n*\n* @returns {StringArray} list of complex number data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'complex64', 'complex128' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nexport default dtypes;\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 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 a complex number.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var dt = dtype( new Complex128( 1.0, 2.0 ) );\n* // returns 'complex128'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\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) 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* Converts a boolean to a number.\n*\n* @private\n* @param {boolean} value - input value\n* @returns {number} result\n*/\nfunction boolean2number( value ) {\n\treturn ( value ) ? 1 : 0;\n}\n\n\n// EXPORTS //\n\nexport default boolean2number;\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 Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a BigInt to a number.\n*\n* @private\n* @param {BigInt} value - input value\n* @returns {number} result\n*/\nfunction bigint2number( value ) {\n\treturn Number( value );\n}\n\n\n// EXPORTS //\n\nexport default bigint2number;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport isRealFloatingPointDataType from '@stdlib/array-base-assert-is-real-floating-point-data-type'; // eslint-disable-line id-length\nimport isSignedIntegerDataType from '@stdlib/array-base-assert-is-signed-integer-data-type';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport minDataType from '@stdlib/array-min-dtype';\nimport minSignedIntegerDataType from '@stdlib/array-base-min-signed-integer-dtype';\nimport complexDType from '@stdlib/complex-dtype';\nimport format from '@stdlib/string-format';\nimport boolean2number from './boolean2number.js';\nimport bigint2number from './bigint2number.js';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setNumber( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a number value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isNumber( value ) ) {\n\t\t\tif ( isRealFloatingPointDataType( obj.type ) ) {\n\t\t\t\tdt = obj.type;\n\t\t\t} else if ( !isInteger( value ) ) {\n\t\t\t\tdt = defaults.dtypes.real;\n\t\t\t} else if ( isSignedIntegerDataType( obj.type ) ) {\n\t\t\t\tdt = minSignedIntegerDataType( value );\n\t\t\t} else {\n\t\t\t\tdt = minDataType( value );\n\t\t\t}\n\t\t\tv = value;\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || ( ( obj.type === 'float32' ) ? 'complex64' : 'complex128' );\n\t\t\tv = value.re; // discard imaginary component\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2number( value );\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tv = bigint2number( value );\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = value;\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setNumber;\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 INT8_MIN from '@stdlib/constants-int8-min';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport INT8_MAX from '@stdlib/constants-int8-max';\nimport INT16_MAX from '@stdlib/constants-int16-max';\nimport INT32_MAX from '@stdlib/constants-int32-max';\n\n\n// MAIN //\n\n/**\n* Returns the minimum array data type for storing a provided signed integer value.\n*\n* @param {integer} value - scalar value\n* @returns {string} array data type\n*\n* @example\n* var dt = minSignedIntegerDataType( 9999 );\n* // returns 'int16'\n*\n* @example\n* var dt = minSignedIntegerDataType( 3 );\n* // returns 'int8'\n*/\nfunction minSignedIntegerDataType( value ) {\n\tif ( value < 0 ) {\n\t\tif ( value >= INT8_MIN ) {\n\t\t\treturn 'int8';\n\t\t}\n\t\tif ( value >= INT16_MIN ) {\n\t\t\treturn 'int16';\n\t\t}\n\t\tif ( value >= INT32_MIN ) {\n\t\t\treturn 'int32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\tif ( value <= INT8_MAX ) {\n\t\treturn 'int8';\n\t}\n\tif ( value <= INT16_MAX ) {\n\t\treturn 'int16';\n\t}\n\tif ( value <= INT32_MAX ) {\n\t\treturn 'int32';\n\t}\n\treturn 'float64';\n}\n\n\n// EXPORTS //\n\nexport default minSignedIntegerDataType;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a number to a boolean.\n*\n* @private\n* @param {number} value - input value\n* @returns {boolean} result\n*/\nfunction number2boolean( value ) {\n\treturn Boolean( value );\n}\n\n\n// EXPORTS //\n\nexport default number2boolean;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a complex number to a boolean.\n*\n* @private\n* @param {ComplexLike} value - input value\n* @returns {boolean} result\n*/\nfunction complex2boolean( value ) {\n\treturn Boolean( value.re || value.im );\n}\n\n\n// EXPORTS //\n\nexport default complex2boolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport complexDType from '@stdlib/complex-dtype';\nimport Boolean from '@stdlib/boolean-ctor';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport boolean2number from './boolean2number.js';\nimport number2boolean from './number2boolean.js';\nimport complex2boolean from './complex2boolean.js';\nimport bigint2boolean from './bigint2boolean.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setBoolean( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a boolean value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2number( value );\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tdt = defaults.dtypes.real;\n\t\t\tv = boolean2number( number2boolean( value ) );\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tv = boolean2number( bigint2boolean( value ) );\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || defaults.dtypes.complex;\n\t\t\tv = boolean2number( complex2boolean( value ) );\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = Boolean( value );\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setBoolean;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a BigInt to a boolean.\n*\n* @private\n* @param {BigInt} value - input value\n* @returns {boolean} result\n*/\nfunction bigint2boolean( value ) {\n\treturn Boolean( value );\n}\n\n\n// EXPORTS //\n\nexport default bigint2boolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport minDataType from '@stdlib/array-min-dtype';\nimport complexDType from '@stdlib/complex-dtype';\nimport BigInt from '@stdlib/bigint-ctor';\nimport Number from '@stdlib/number-ctor';\nimport floor from '@stdlib/math-base-special-floor';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport boolean2bigint from './boolean2bigint.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setBigInt( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a number value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // FIXME: support both int64 and uint64\n\t\t\tv = value;\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tif ( isInteger( value ) ) {\n\t\t\t\tdt = minDataType( value );\n\t\t\t\tv = BigInt( value );\n\t\t\t} else {\n\t\t\t\tdt = defaults.dtypes.real;\n\t\t\t\tv = BigInt( floor( value ) );\n\t\t\t}\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2bigint( value );\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || defaults.dtypes.complex;\n\t\t\tv = BigInt( floor( value.re ) ); // discard imaginary component\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = BigInt( floor( Number( v ) ) );\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setBigInt;\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 BigInt from '@stdlib/bigint-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a boolean to a BigInt.\n*\n* @private\n* @param {boolean} value - input value\n* @returns {number} result\n*/\nfunction boolean2bigint( value ) {\n\treturn BigInt( ( value ) ? 1 : 0 );\n}\n\n\n// EXPORTS //\n\nexport default boolean2bigint;\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 isDataView from '@stdlib/assert-is-dataview';\nimport isObject from '@stdlib/assert-is-object';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `struct` instance.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `struct` instance\n*/\nfunction isStructInstance( value ) {\n\t// NOTE: the following is a relatively weak test, but we cannot use `instanceof` checks, etc, due to the factory nature of the implementation. Regardless, here, we are just trying to sniff out a `struct` type. If calling as a constructor later fails, we punt the responsibility off to the user to handle what should be an edge case. If, in the future, this check proves insufficient, we can add further \"brand\" checks...\n\treturn (\n\t\tisObject( value ) &&\n\t\tisDataView( value[ PRIVATE_BUFFER ] )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructInstance;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array complex-valued floating-point data type.\n*\n* @name isComplexFloatingPointDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array complex-valued floating-point data type\n*\n* @example\n* var bool = isComplexFloatingPointDataType( 'complex64' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'complex128' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'float32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'float64' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'foo' );\n* // returns false\n*/\nvar isComplexFloatingPointDataType = contains( dtypes( 'complex_floating_point' ) ); // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nexport default isComplexFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array boolean data type.\n*\n* @name isBooleanDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array boolean data type\n*\n* @example\n* var bool = isBooleanDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanDataType( 'complex64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'complex128' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanDataType( 'foo' );\n* // returns false\n*/\nvar isBooleanDataType = contains( dtypes( 'boolean' ) );\n\n\n// EXPORTS //\n\nexport default isBooleanDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array real-valued data type.\n*\n* @name isRealDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array real-valued data type\n*\n* @example\n* var bool = isRealDataType( 'float32' );\n* // returns true\n*\n* bool = isRealDataType( 'float64' );\n* // returns true\n*\n* bool = isRealDataType( 'complex128' );\n* // returns false\n*\n* bool = isRealDataType( 'generic' );\n* // returns false\n*\n* bool = isRealDataType( 'int16' );\n* // returns true\n*\n* bool = isRealDataType( 'int32' );\n* // returns true\n*\n* bool = isRealDataType( 'int8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint16' );\n* // returns true\n*\n* bool = isRealDataType( 'uint32' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8c' );\n* // returns true\n*\n* bool = isRealDataType( 'foo' );\n* // returns false\n*/\nvar isRealDataType = contains( dtypes( 'real' ) );\n\n\n// EXPORTS //\n\nexport default isRealDataType;\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 isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Reinterprets a complex-valued floating-point array as a real-valued floating-point array having the same precision.\n*\n* @param {(Complex128Array|Complex64Array)} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @throws {TypeError} first argument must be a supported complex-valued floating-point array\n* @returns {(Float64Array|Float32Array)} real-valued floating-point array 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*\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\tif ( isComplex128Array( x ) ) {\n\t\treturn reinterpret128( x, offset );\n\t}\n\tif ( isComplex64Array( x ) ) {\n\t\treturn reinterpret64( x, offset );\n\t}\n\t// Note: intentionally throw here to catch the scenario in which we add, e.g., a Complex32Array and need to explicitly add support here...\n\tthrow new TypeError( format( 'invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.', x ) );\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Fills a strided array with a specified scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {Collection} input array\n*\n* @example\n* var x = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gfill( 3, 5.0, x, 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX, offsetX ) {\n\tvar ix;\n\tvar m;\n\tvar o;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn x;\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\taccessors( N, alpha, o, strideX, offsetX );\n\t\treturn o.data;\n\t}\n\tix = offsetX;\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( strideX === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\tx[ ix ] = alpha;\n\t\t\t\tix += strideX;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn x;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\tx[ ix ] = alpha;\n\t\t\tx[ ix+1 ] = alpha;\n\t\t\tx[ ix+2 ] = alpha;\n\t\t\tx[ ix+3 ] = alpha;\n\t\t\tx[ ix+4 ] = alpha;\n\t\t\tx[ ix+5 ] = alpha;\n\t\t\tx[ ix+6 ] = alpha;\n\t\t\tx[ ix+7 ] = alpha;\n\t\t\tix += M;\n\t\t}\n\t\treturn x;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\tx[ ix ] = alpha;\n\t\tix += strideX;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gfill;\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* Fills a strided array with a specified scalar constant.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {Object} input array object\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n*\n* function setter( data, idx, value ) {\n* data.set( value, idx );\n* }\n*\n* var data = new Complex64Array( [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ] );\n*\n* var x = {\n* 'data': data,\n* 'accessors': [ null, setter ]\n* };\n*\n* var alpha = new Complex64( 5.0, 5.0 );\n*\n* gfill( data.length, alpha, x, 1, 0 );\n*\n* var view = reinterpret64( x.data, 0 );\n* // returns [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX, offsetX ) {\n\tvar xbuf;\n\tvar set;\n\tvar ix;\n\tvar i;\n\n\t// Cache reference to array data:\n\txbuf = x.data;\n\n\t// Cache a reference to the element accessor:\n\tset = x.accessors[ 1 ];\n\n\tix = offsetX;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( xbuf, ix, alpha );\n\t\tix += strideX;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\n/**\n* Fills a strided array with a specified scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @returns {Collection} input array\n*\n* @example\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill( x.length, 5.0, x, 1 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX ) {\n\treturn ndarray( N, alpha, x, strideX, stride2offset( N, strideX ) );\n}\n\n\n// EXPORTS //\n\nexport default gfill;\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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// FUNCTIONS //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} thisArg - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n* var out = internal( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction internal( x, y, stride, offset, fcn, thisArg ) {\n\tvar io;\n\tvar i;\n\n\tio = offset;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\ty[ io ] = fcn.call( thisArg, x[ i ], i, x );\n\t\tio += stride;\n\t}\n\treturn y;\n}\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Object} y - output array object\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} thisArg - callback execution context\n* @returns {Object} output array object\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = accessors( arraylike2object( toAccessorArray( x ) ), arraylike2object( toAccessorArray( y ) ), 1, 0, scale );\n* // y => [ 10.0, 10.0, 10.0, 10.0 ]\n*/\nfunction accessors( x, y, stride, offset, fcn, thisArg ) {\n\tvar xdata;\n\tvar ydata;\n\tvar xget;\n\tvar yset;\n\tvar io;\n\tvar i;\n\n\txdata = x.data;\n\tydata = y.data;\n\txget = x.accessors[ 0 ];\n\tyset = y.accessors[ 1 ];\n\n\tio = offset;\n\tfor ( i = 0; i < xdata.length; i++ ) {\n\t\tyset( ydata, io, fcn.call( thisArg, xget( xdata, i ), i, xdata ) );\n\t\tio += stride;\n\t}\n\treturn y;\n}\n\n\n// MAIN //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = assign( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction assign( x, y, stride, offset, fcn, thisArg ) {\n\tvar xobj;\n\tvar yobj;\n\n\txobj = arraylike2object( x );\n\tyobj = arraylike2object( y );\n\tif ( xobj.accessorProtocol || yobj.accessorProtocol ) {\n\t\taccessors( xobj, yobj, stride, offset, fcn, thisArg );\n\t\treturn y;\n\t}\n\treturn internal( x, y, stride, offset, fcn, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default assign;\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 zeros from '@stdlib/array-base-zeros';\nimport assign from './assign.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'map' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n\n// MAIN //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in a new output array.\n*\n* @param {Collection} x - input array\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = map( x, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*/\nfunction map( x, fcn, thisArg ) {\n\tif ( hasMethod( x, 'map' ) ) {\n\t\treturn x.map( fcn, thisArg );\n\t}\n\treturn assign( x, zeros( x.length ), 1, 0, fcn, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default map;\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* Converts a complex number to a number.\n*\n* @private\n* @param {ComplexLike} value - input value\n* @returns {number} result\n*/\nfunction complex2number( value ) {\n\treturn value.re;\n}\n\n\n// EXPORTS //\n\nexport default complex2number;\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 format from '@stdlib/string-format';\nimport DATA_VIEW_METHODS from './data_view_methods.js';\nimport setNumber from './set_number.js';\nimport setComplex from './set_complex.js';\nimport setBoolean from './set_boolean.js';\nimport setBigInt from './set_bigint.js';\nimport setStruct from './set_struct.js';\nimport setTypedArray from './set_typedarray.js';\nimport setStructArray from './set_struct_array.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for setting field data.\n*\n* @private\n* @param {Object} obj - field object\n* @throws {Error} unexpected error\n* @returns {Function} function for setting field data\n*/\nfunction setter( obj ) {\n\tif ( obj.length ) {\n\t\tif ( obj.isStructType ) {\n\t\t\treturn setStructArray( obj );\n\t\t}\n\t\treturn setTypedArray( obj );\n\t}\n\tswitch ( obj.type ) {\n\tcase 'float64':\n\tcase 'float32':\n\tcase 'float16':\n\tcase 'int8':\n\tcase 'int16':\n\tcase 'int32':\n\tcase 'uint8':\n\tcase 'uint16':\n\tcase 'uint32':\n\t\treturn setNumber( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'int64':\n\tcase 'uint64':\n\t\treturn setBigInt( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'bool':\n\t\treturn setBoolean( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'complex128':\n\tcase 'complex64':\n\tcase 'complex32':\n\t\treturn setComplex( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tdefault:\n\t\tif ( obj.isStructType ) {\n\t\t\treturn setStruct( obj );\n\t\t}\n\t\t// Ensure that we fail loudly if we have failed to add support for newly added data types:\n\t\tthrow new Error( format( 'unexpected error. Unrecognized data type. Value: `%s`.', obj.type ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setter;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport isCollection from '@stdlib/assert-is-collection';\nimport Uint8Array from '@stdlib/array-uint8';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setStructArray( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes a list of `struct` instances to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Collection} values - list of `struct` instances\n\t* @throws {TypeError} must provide an array-like object\n\t* @throws {RangeError} must provide an array-like object having an expected length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( values ) {\n\t\tvar offset;\n\t\tvar views;\n\t\tvar view;\n\t\tvar dest;\n\t\tvar src;\n\t\tvar buf;\n\t\tvar nb;\n\t\tvar i;\n\n\t\tif ( !isCollection( values ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be an array-like object. Value: `%s`.', obj.name, values ) );\n\t\t}\n\t\tif ( values.length !== obj.length ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object having length %u.', obj.name, obj.length ) );\n\t\t}\n\t\tif ( obj.casting === 'none' ) {\n\t\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\t\tif ( !( values[ i ] instanceof obj.type ) ) { // note: this check will fail for cross-realm `struct` instances\n\t\t\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Value: `%s`.', obj.name, values[ i ] ) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Compute the expected number of bytes per struct view:\n\t\tnb = obj.byteLength / obj.length; // note: as a field is expected to have a homogeneous data type, the byte length should be evenly divisible by the number of elements\n\n\t\t// Check that all struct instances have the same byte length...\n\t\tviews = [];\n\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\tbuf = this.constructor.viewOf( values[ i ] );\n\t\t\tif ( buf.byteLength !== nb ) {\n\t\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object containing `struct` instances having the same byte length.', obj.name ) );\n\t\t\t}\n\t\t\tsrc = new Uint8Array( buf.buffer, buf.byteOffset, nb );\n\t\t\tviews.push( src );\n\t\t}\n\t\t// Write the data for each `struct` to the underlying byte buffer...\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\toffset = view.byteOffset + obj.byteOffset;\n\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\tdest = new Uint8Array( view.buffer, offset, nb );\n\t\t\tgcopy( obj.length, views[ i ], 1, dest, 1 );\n\t\t\toffset += nb;\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setStructArray;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport isCollection from '@stdlib/assert-is-collection';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport isComplexDataType from '@stdlib/array-base-assert-is-complex-floating-point-data-type';\nimport isBooleanDataType from '@stdlib/array-base-assert-is-boolean-data-type';\nimport isRealDataType from '@stdlib/array-base-assert-is-real-data-type';\nimport typedarray from '@stdlib/array-typed';\nimport dtype from '@stdlib/array-dtype';\nimport reinterpretComplex from '@stdlib/strided-base-reinterpret-complex';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport gfill from '@stdlib/blas-ext-base-gfill';\nimport map from '@stdlib/array-base-map';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport isStructInstance from './is_struct_instance.js';\nimport number2boolean from './number2boolean.js';\nimport complex2boolean from './complex2boolean.js';\nimport complex2number from './complex2number.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setTypedArray( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes a list of values to a typed array view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Collection} value - value to set\n\t* @throws {TypeError} must provide an array-like object\n\t* @throws {RangeError} must provide an array-like object having an expected length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar buf;\n\t\tvar dt;\n\t\tif ( !isCollection( value ) || isStructInstance( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be an array-like object. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tif ( value.length !== obj.length ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object having length %u.', obj.name, obj.length ) );\n\t\t}\n\t\tdt = dtype( value );\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tbuf = this[ PRIVATE_BUFFER ];\n\t\tview = typedarray( buf.buffer, buf.byteOffset+obj.byteOffset, obj.length, obj.type );\n\t\tif ( dt === obj.type ) {\n\t\t\t// Case: complex => complex\n\t\t\tif ( isComplexDataType( dt ) ) {\n\t\t\t\tgcopy( obj.length*2, reinterpretComplex( value, 0 ), 1, reinterpretComplex( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: boolean => boolean\n\t\t\tif ( isBooleanDataType( dt ) ) {\n\t\t\t\tgcopy( obj.length, reinterpretBoolean( value, 0 ), 1, reinterpretBoolean( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => real\n\t\t\tgcopy( obj.length, value, 1, view, 1 );\n\t\t\treturn;\n\t\t}\n\t\t// Case: real => ???\n\t\tif ( isRealDataType( dt ) ) {\n\t\t\t// Case: real => real\n\t\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\t\tgcopy( obj.length, value, 1, view, 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => complex\n\t\t\tif ( isComplexDataType( obj.type ) ) {\n\t\t\t\tview = reinterpretComplex( view, 0 );\n\n\t\t\t\t// TODO: consider refactoring to avoid two-passes; may require creating a separate strided utility explicitly aimed at casting real-valued arrays to complex arrays\n\t\t\t\tgcopy( obj.length, view, 2, value, 1 ); // assign to only real-components\n\t\t\t\tgfill.ndarray( obj.length, 0.0, view, 2, 1 ); // fill imaginary components with zeros\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => boolean\n\t\t\tmap.assign( value, view, 1, 0, number2boolean );\n\t\t\treturn;\n\t\t}\n\t\t// Case: complex => ???\n\t\tif ( isComplexDataType( dt ) ) {\n\t\t\t// Case: complex => real\n\t\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\t\tmap.assign( value, view, 1, 0, complex2number ); // discard imaginary components\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: complex => complex\n\t\t\tif ( isComplexDataType( obj.type ) ) {\n\t\t\t\tgcopy( obj.length*2, reinterpretComplex( value, 0 ), 1, reinterpretComplex( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: complex => boolean\n\t\t\tmap.assign( value, view, 1, 0, complex2boolean );\n\t\t\treturn;\n\t\t}\n\t\t// Case: boolean => ???\n\n\t\t// Case: boolean => real\n\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\tgcopy( obj.length, reinterpretBoolean( value, 0 ), 1, view, 1 );\n\t\t\treturn;\n\t\t}\n\t\t// Case: boolean => complex\n\t\tview = reinterpretComplex( view, 0 );\n\n\t\t// TODO: consider refactoring to avoid two-passes; may require creating a separate strided utility explicitly aimed at casting real-valued arrays to complex arrays\n\t\tgcopy( obj.length, view, 2, reinterpretBoolean( value, 0 ), 1 ); // assign to only real-components\n\t\tgfill.ndarray( obj.length, 0.0, view, 2, 1 ); // fill imaginary components with zeros\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setTypedArray;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport complexDType from '@stdlib/complex-dtype';\nimport format from '@stdlib/string-format';\nimport boolean2number from './boolean2number.js';\nimport bigint2number from './bigint2number.js';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setComplex( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a complex number to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar re;\n\t\tvar im;\n\t\tif ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || obj.type;\n\t\t\tre = value.re;\n\t\t\tim = value.im;\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tdt = ( obj.type === 'complex64' ) ? 'float32' : 'float64';\n\t\t\tre = value;\n\t\t\tim = 0.0;\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tre = bigint2number( value );\n\t\t\tim = 0.0;\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tre = boolean2number( value );\n\t\t\tim = 0.0;\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tre = value;\n\t\t\tim = 0.0;\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, re, IS_LITTLE_ENDIAN );\n\t\tview[ method ]( obj.byteOffset+(obj.byteLength/2), im, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setComplex;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport isStructInstance from './is_struct_instance.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setStruct( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes `struct` data to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Object} value - value to set\n\t* @throws {TypeError} must be a `struct` instance\n\t* @throws {RangeError} must be a `struct` instance having the same byte length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dest;\n\t\tvar src;\n\t\tvar buf;\n\t\tvar nb;\n\t\tif ( !isStructInstance( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be a `struct` instance. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tif ( obj.casting === 'none' && !( value instanceof obj.type ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tnb = obj.byteLength;\n\n\t\tbuf = this.constructor.viewOf( value );\n\t\tif ( buf.byteLength !== nb ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be a `struct` instance having the same byte length.', obj.name ) );\n\t\t}\n\t\tsrc = new Uint8Array( buf.buffer, buf.byteOffset, nb );\n\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tdest = new Uint8Array( view.buffer, view.byteOffset+obj.byteOffset, nb ); // eslint-disable-line max-len\n\n\t\tgcopy( obj.length, src, 1, dest, 1 );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setStruct;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Fill a strided array with a specified scalar constant.\n*\n* @module @stdlib/blas-ext-base-gfill\n*\n* @example\n* import gfill from '@stdlib/blas-ext-base-gfill';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill( x.length, 5.0, x, 1 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*\n* @example\n* import gfill from '@stdlib/blas-ext-base-gfill';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill.ndarray( x.length, 5.0, x, 1, 0 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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 callback function to elements in an input array and assign results to elements in a new output array.\n*\n* @module @stdlib/array-base-map\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import map from '@stdlib/array-base-map';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = map( x, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n* import map from '@stdlib/array-base-map';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = map.assign( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\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// exports: { \"assign\": \"main.assign\" }\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\nvar FIELD_PROPERTIES = [\n\t'name',\n\t'type',\n\t'description',\n\t'length',\n\t'enumerable',\n\t'writable',\n\t'default',\n\t'castingMode'\n];\n\n\n// EXPORTS //\n\nexport default FIELD_PROPERTIES;\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 isCollection from '@stdlib/assert-is-collection';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating whether a field object represents a union type.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {boolean} result\n*/\nfunction isUnionType( obj ) {\n\treturn obj.type === 'union' && isCollection( obj.fields );\n}\n\n\n// EXPORTS //\n\nexport default isUnionType;\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 { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid boolean field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidBoolean( value, name ) {\n\tif ( isBoolean( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a boolean. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidBoolean;\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\nvar DTYPES = [\n\t'int8',\n\t'int16',\n\t'int32',\n\t'int64',\n\n\t'uint8',\n\t'uint16',\n\t'uint32',\n\t'uint64',\n\n\t// 'float16', // TODO: uncomment once supported\n\n\t'float32',\n\t'float64',\n\n\t// 'complex32', // TODO: uncomment once supported\n\n\t'complex64',\n\t'complex128',\n\n\t'bool'\n];\n\n\n// EXPORTS //\n\nexport default DTYPES;\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\nvar CASTING_MODES = [\n\t'none',\n\t'safe',\n\t'mostly-safe',\n\t'same-kind',\n\t'unsafe'\n];\n\n\n// EXPORTS //\n\nexport default CASTING_MODES;\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 contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function for testing whether a provided value is a valid enumerated field.\n*\n* @private\n* @param {Collection} values - list of possible values\n* @returns {Function} output function\n*/\nfunction isValidOneOf( values ) {\n\treturn isValid;\n\n\t/**\n\t* Tests whether a provided value is a valid enumerated field.\n\t*\n\t* @private\n\t* @param {*} value - input value\n\t* @param {string} name - field name\n\t* @returns {(null|TypeError)} error object or null\n\t*/\n\tfunction isValid( value, name ) {\n\t\tif ( contains( values, value ) ) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new TypeError( format( 'invalid argument. `%s` field must be one of the following: \"%s\". Value: `%s`.', name, join( values, ', ' ), value ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default isValidOneOf;\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\nvar ALIGNMENTS = {\n\t'int8': 1,\n\t'int16': 2,\n\t'int32': 4,\n\t'int64': 8,\n\n\t'uint8': 1,\n\t'uint16': 2,\n\t'uint32': 4,\n\t'uint64': 8,\n\n\t'float16': 2,\n\t'float32': 4,\n\t'float64': 8,\n\n\t'complex32': 2, // same as float16\n\t'complex64': 4, // same as float32\n\t'complex128': 8, // same as float64\n\n\t'bool': 1\n};\n\n\n// EXPORTS //\n\nexport default ALIGNMENTS;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport hasProp from '@stdlib/assert-has-property';\nimport join from '@stdlib/array-base-join';\nimport constantFunction from '@stdlib/utils-constant-function';\nimport format from '@stdlib/string-format';\nimport hasProperties from './has_properties.js';\nimport isValidNonEmptyString from './is_valid_nonempty_string.js';\nimport isValidString from './is_valid_string.js';\nimport isValidPositiveInteger from './is_valid_positive_integer.js';\nimport isValidBoolean from './is_valid_boolean.js';\nimport isValidType from './is_valid_type.js';\nimport isValidOneOf from './is_valid_one_of.js';\nimport initFieldObject from './init_field_object.js';\nimport byteLength from './byte_length.js';\nimport CASTING_MODES from './casting_modes.js';\nimport ALIGNMENTS from './alignments.js';\n\n\n// VARIABLES //\n\nvar MANDATORY_FIELD_NAMES = [\n\t'name',\n\t'type'\n];\n\nvar VALIDATORS = {\n\t'name': isValidNonEmptyString,\n\t'type': isValidType,\n\t'description': isValidString,\n\t'length': isValidPositiveInteger,\n\t'enumerable': isValidBoolean,\n\t'writable': isValidBoolean,\n\t'default': constantFunction( null ),\n\t'castingMode': isValidOneOf( CASTING_MODES )\n};\n\n\n// MAIN //\n\n/**\n* Normalizes a provided field object.\n*\n* @private\n* @param {Object} obj - input field object\n* @param {Array} keys - list of keys to standardize\n* @returns {(Object|Error)} output object or an error\n*/\nfunction normalize( obj, keys ) {\n\tvar out;\n\tvar err;\n\tvar v;\n\tvar k;\n\tvar i;\n\n\tout = initFieldObject();\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tk = keys[ i ];\n\t\tif ( hasProp( obj, k ) ) {\n\t\t\tv = obj[ k ];\n\t\t\terr = VALIDATORS[ k ]( v, k );\n\t\t\tif ( err ) {\n\t\t\t\treturn err;\n\t\t\t}\n\t\t\tout[ k ] = v;\n\t\t}\n\t}\n\tif ( !hasProperties( out, MANDATORY_FIELD_NAMES ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Field objects must have the following properties: \"%s\". Value: `%s`.', join( MANDATORY_FIELD_NAMES, ', ' ), JSON.stringify( obj ) ) );\n\t}\n\tout.isStructType = isStructConstructorLike( out.type );\n\tout.byteLength = byteLength( out );\n\tif ( out.isStructType ) {\n\t\tout.alignment = out.type.alignment;\n\t} else {\n\t\tout.alignment = ALIGNMENTS[ out.type ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default normalize;\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 { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid string field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidNonEmptyString( value, name ) {\n\tif ( isString( value ) || value.length > 0 ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a non-empty string. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidNonEmptyString;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\nimport DTYPES from './dtypes.js';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid `type` field.\n*\n* @private\n* @param {*} value - input value\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidType( value ) {\n\tif ( contains( DTYPES, value ) || isStructConstructorLike( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be either a struct type or one of the following: \"%s\". Value: `%s`.', 'type', join( DTYPES, ', ' ), value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidType;\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 { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid string field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidString( value, name ) {\n\tif ( isString( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a string. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidString;\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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid positive integer field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidPositiveInteger( value, name ) {\n\tif ( isPositiveInteger( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a positive integer. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidPositiveInteger;\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* Returns an initialized field object.\n*\n* @private\n* @returns {Object} initialized field object\n*/\nfunction initFieldObject() {\n\treturn {\n\t\t'isStructType': false,\n\t\t'description': '',\n\t\t'byteLength': 0,\n\t\t'byteOffset': 0,\n\t\t'alignment': 0,\n\t\t'padding': 0,\n\t\t'enumerable': true,\n\t\t'writable': true,\n\t\t'default': void 0, // explicitly set to `undefined`\n\t\t'castingMode': 'none'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default initFieldObject;\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 hasProp from '@stdlib/assert-has-property';\n\n\n// MAIN //\n\n/**\n* Tests whether an object has a list of properties.\n*\n* @private\n* @param {Object} obj - input object\n* @param {Array} keys - list of property names\n* @returns {boolean} result\n*/\nfunction hasProperties( obj, keys ) {\n\tvar i;\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tif ( !hasProp( obj, keys[ i ] ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// EXPORTS //\n\nexport default hasProperties;\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 bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\n\n\n// MAIN //\n\n/**\n* Returns the number of bytes required to store a field value.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {PositiveInteger} number of bytes\n*/\nfunction byteLength( obj ) {\n\tvar nb;\n\tif ( obj.isStructType ) {\n\t\tnb = obj.type.byteLength;\n\t} else {\n\t\tnb = bytesPerElement( obj.type );\n\t}\n\tif ( obj.length ) {\n\t\tnb *= obj.length;\n\t}\n\treturn nb;\n}\n\n\n// EXPORTS //\n\nexport default byteLength;\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* Resolves the struct's byte alignment.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @returns {PositiveInteger} alignment\n*/\nfunction alignment( fields ) {\n\tvar max;\n\tvar v;\n\tvar i;\n\n\tmax = 0;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\tv = fields[ i ].alignment;\n\t\tif ( v > max ) {\n\t\t\tmax = v;\n\t\t}\n\t}\n\treturn max;\n}\n\n\n// EXPORTS //\n\nexport default alignment;\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 isObject from '@stdlib/assert-is-object';\nimport hasProp from '@stdlib/assert-has-property';\nimport format from '@stdlib/string-format';\nimport isUnionType from './is_union_type.js';\nimport FIELD_PROPERTIES from './field_properties.js';\nimport normalizeField from './normalize_field.js';\nimport resolveAlignment from './resolve_alignment.js';\n\n\n// MAIN //\n\n/**\n* Normalizes a field object representing a union type.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {(Object|null|Error)} normalized field object or error object\n*/\nfunction normalizeUnion( obj ) {\n\tvar fields;\n\tvar dflg;\n\tvar out;\n\tvar tmp;\n\tvar len;\n\tvar o;\n\tvar i;\n\n\tfields = obj.fields;\n\tif ( fields.length === 0 ) {\n\t\treturn null;\n\t}\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( !isObject( o ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tif ( isUnionType( o ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. Union types cannot contain nested union types. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\tif ( dflg === void 0 && hasProp( o, 'default' ) ) {\n\t\t\tdflg = true;\n\t\t} else if ( dflg === true && hasProp( o, 'default' ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. Union types can only contain one field with a default value. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\ttmp = normalizeField( o, FIELD_PROPERTIES );\n\t\tif ( tmp instanceof Error ) {\n\t\t\treturn tmp;\n\t\t}\n\t\tif ( i === 0 ) {\n\t\t\tlen = tmp.byteLength;\n\t\t} else if ( tmp.byteLength !== len ) {\n\t\t\treturn new RangeError( format( 'invalid argument. Union types must contain fields having the same byte length. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn {\n\t\t'type': 'union',\n\t\t'fields': out,\n\t\t'byteLength': len,\n\t\t'byteOffset': 0,\n\t\t'alignment': resolveAlignment( out ),\n\t\t'padding': 0\n\t};\n}\n\n\n// EXPORTS //\n\nexport default normalizeUnion;\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/assert-is-accessor-array';\nimport resolveGetter from '@stdlib/array-base-resolve-getter';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'indexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 0 );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex ) {\n\tvar i;\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n*\n* var x = toAccessorArray( [ 1, 2, 3, 4 ] );\n*\n* var idx = accessors( x, 2, 0 );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex ) {\n\tvar get;\n\tvar i;\n\n\tget = resolveGetter( x );\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === get( x, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* ## Notes\n*\n* - If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*/\nfunction indexOf( x, searchElement, fromIndex ) {\n\tif ( hasMethod( x, 'indexOf' ) ) {\n\t\treturn x.indexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex = 0;\n\t\t}\n\t}\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessors( x, searchElement, fromIndex );\n\t}\n\treturn internal( x, searchElement, fromIndex );\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\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 isCollection from '@stdlib/assert-is-collection';\nimport isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object supporting the accessor (get/set) protocol.\n*\n* @param {*} 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*\n* @example\n* var bool = isAccessorArray( {} );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn (\n\t\tisCollection( value ) &&\n\t\tisFunction( value.get ) &&\n\t\tisFunction( value.set )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\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 indexOf from '@stdlib/array-base-index-of';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the index of a specified field name in a provided list of field names.\n*\n* @private\n* @param {Array} names - list of field names\n* @param {string} name - field name\n* @throws {Error} struct must have at least one field\n* @throws {TypeError} must provide a recognized field name\n* @returns {(integer|Error)} index or an error object\n*/\nfunction fieldIndex( names, name ) {\n\tvar idx;\n\tif ( names.length === 0 ) {\n\t\treturn new Error( 'invalid operation. struct does not have any fields.' );\n\t}\n\tidx = indexOf( names, name, 0 );\n\tif ( idx < 0 ) {\n\t\treturn new TypeError( format( 'invalid argument. Field name must be one of the following: \"%s\". Value: `%s`.', join( names, ', ' ), name ) );\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default fieldIndex;\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 min from '@stdlib/math-base-special-fast-min';\nimport isUnionType from './is_union_type.js';\n\n\n// FUNCTIONS //\n\n/**\n* Sets alignment padding for one or more field objects.\n*\n* ## Notes\n*\n* - This function mutates each field object.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @param {NonNegativeInteger} padding - alignment padding\n* @returns {Array} input array\n*/\nfunction setPadding( fields, padding ) {\n\tvar i;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\tfields[ i ].padding = padding;\n\t}\n\treturn fields;\n}\n\n\n// MAIN //\n\n/**\n* Computes the byte offset for each field.\n*\n* ## Notes\n*\n* - This function mutates each field object.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @param {PositiveInteger} max - maximum alignment\n* @returns {Array} input array\n*/\nfunction byteOffsets( fields, max ) {\n\tvar alignment;\n\tvar padding;\n\tvar offset;\n\tvar tmp;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\toffset = 0;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Resolve the alignment requirement for this field:\n\t\talignment = min( o.alignment, max );\n\n\t\t// Align the current offset to the required boundary:\n\t\tpadding = ( alignment-(offset%alignment) ) % alignment;\n\t\toffset += padding;\n\n\t\t// Set the padding for the previous member:\n\t\tif ( i > 0 ) {\n\t\t\ttmp = fields[ i-1 ];\n\t\t\ttmp.padding = padding;\n\t\t\tif ( isUnionType( o ) ) {\n\t\t\t\tsetPadding( tmp.fields, padding );\n\t\t\t}\n\t\t}\n\t\t// Set the offset for the current member:\n\t\to.byteOffset = offset;\n\n\t\t// If the current member is a union type, propagate the offset to its child field objects...\n\t\tif ( isUnionType( o ) ) {\n\t\t\tfor ( j = 0; j < o.fields.length; j++ ) {\n\t\t\t\to.fields[ j ].byteOffset = offset;\n\t\t\t}\n\t\t}\n\t\t// Advance the offset by the size, in bytes, of the member:\n\t\toffset += o.byteLength;\n\t}\n\t// Compute the padding for the last member:\n\tpadding = ( alignment - (offset%alignment) ) % alignment;\n\n\t// Set the padding for the last member:\n\to.padding = padding;\n\n\t// If the last member is a union type, propagate the offset to its child field objects...\n\tif ( isUnionType( o ) ) {\n\t\tsetPadding( o.fields, padding );\n\t}\n\n\treturn fields;\n}\n\n\n// EXPORTS //\n\nexport default byteOffsets;\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 replace from '@stdlib/string-base-replace';\nimport format from '@stdlib/string-format';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a new regular expression for matching byte parameters.\n*\n* @private\n* @returns {RegExp} regular expression\n*/\nfunction reByteOffset() {\n\treturn /\\[(\\d{1,}),/g;\n}\n\n/**\n* Returns a function for replacing byte values in a serialized struct.\n*\n* @private\n* @param {NonNegativeInteger} offset - byte offset\n* @returns {Function} replacer function\n*/\nfunction replacer( offset ) {\n\treturn wrapped;\n\n\t/**\n\t* Callback invoked for each match.\n\t*\n\t* @private\n\t* @param {string} match - matched substring\n\t* @param {string} p1 - first matched capture group substring\n\t* @returns {string} replacement string\n\t*/\n\tfunction wrapped( match, p1 ) {\n\t\treturn format( '[%u,', offset+parseInt( p1, 10 ) );\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a layout format.\n*\n* ## Notes\n*\n* - The output format is a multi-column format having the following layout:\n*\n* ```text\n* | ...[byte_offset,byte_length] |\n* ```\n*\n* For example,\n*\n* ```text\n* |[0,8]|[8,1]|[16,16]|[32,8]|\n* ```\n*\n* @private\n* @param {Array} fields - list of normalized fields\n* @returns {string} string representation\n*/\nfunction layoutFormat( fields ) {\n\tvar out;\n\tvar tmp;\n\tvar re;\n\tvar N;\n\tvar o;\n\tvar i;\n\n\tN = fields.length;\n\n\t// Create a new regular expression for matching byte offsets:\n\tre = reByteOffset();\n\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// If we are currently processing fields in a union, move along to the next non-union field...\n\t\tif ( i > 0 && ( o.byteOffset === fields[ i-1 ].byteOffset ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\t// If the current type is a struct, we need to serialize and then post-process...\n\t\tif ( o.isStructType ) {\n\t\t\tout.push( replace( o.type.layout, re, replacer( o.byteOffset ) ) );\n\t\t\tcontinue;\n\t\t}\n\t\t// Format the field data:\n\t\tout.push( format( '|<%s>[%u,%u]', o.type, o.byteOffset, o.byteLength ) );\n\t}\n\ttmp = format( '%s|', out.join( '' ) );\n\n\t// If we having a trailing `||` due to a nested struct, remove the final `|`:\n\tif ( tmp[ tmp.length-2 ] === '|' ) {\n\t\ttmp = tmp.substring( 0, tmp.length-1 );\n\t}\n\treturn tmp;\n}\n\n\n// EXPORTS //\n\nexport default layoutFormat;\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 isPlainObject from '@stdlib/assert-is-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\nimport linearFormat from './format_linear.js';\nimport layoutFormat from './format_layout.js';\n\n\n// VARIABLES //\n\nvar FORMATS = [\n\t'none',\n\t'linear',\n\t'layout'\n];\nvar isFormat = contains( FORMATS );\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a string.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {Array} fields - list of normalized fields\n* @param {Options} options - function options\n* @param {string} [options.format] - serialization format\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {string} string representation\n*/\nfunction toString( Struct, fields, options ) { // eslint-disable-line stdlib/no-redeclare\n\tvar opts;\n\tif ( !isPlainObject( options ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\topts = {\n\t\t'format': 'none'\n\t};\n\tif ( hasOwnProp( options, 'format' ) ) {\n\t\topts.format = options.format;\n\t\tif ( !isFormat( opts.format ) ) {\n\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'format', join( FORMATS, ', ' ), options.format ) );\n\t\t}\n\t}\n\tif ( opts.format === 'linear' ) {\n\t\treturn linearFormat( Struct, fields );\n\t}\n\tif ( opts.format === 'layout' ) {\n\t\treturn layoutFormat( fields );\n\t}\n\t// Case: opts.format === 'none'\n\treturn '';\n}\n\n\n// EXPORTS //\n\nexport default toString;\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 floor from '@stdlib/math-base-special-floor';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a linear string format.\n*\n* ## Notes\n*\n* - The output format is a three-column format having the following layout:\n*\n* ```text\n* | byte_number | [field|padding] | notes |\n* ```\n*\n* - Nested `struct` instances are intentionally treated as opaque types, as we have limited access to struct internals (e.g., packed versus unpacked, field padding, etc), and we would effectively have to recompute all alignments and associated field data for the purposes of rendering. A user can always separately render a nested `struct` instance to a string in order to better understand its layout independently of its surrounding context in a parent `struct` instance.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {Array} fields - list of normalized fields\n* @returns {string} string representation\n*/\nfunction linearFormat( Struct, fields ) {\n\tvar nbytes;\n\tvar fmt0;\n\tvar fmt1;\n\tvar fmt2;\n\tvar bfmt;\n\tvar ufmt;\n\tvar fmt;\n\tvar tmp;\n\tvar out;\n\tvar flg;\n\tvar ib;\n\tvar c0;\n\tvar c1;\n\tvar c2;\n\tvar w0;\n\tvar w1;\n\tvar w;\n\tvar N;\n\tvar o;\n\tvar f;\n\tvar t;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tN = fields.length;\n\n\t// Resolve the size of the struct:\n\tnbytes = Struct.byteLength;\n\n\t// Compute the width of the first column:\n\tw0 = ( nbytes-1 ).toString().length;\n\n\t// Define a format string for the first column:\n\tfmt0 = '%'+w0+'s';\n\n\t// Determine the longest field name...\n\tw1 = 0;\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Format: []\n\t\tw = o.name.length + 1 + ( o.byteLength-1 ).toString().length + 1;\n\t\tif ( w > w1 ) {\n\t\t\tw1 = w;\n\t\t}\n\t}\n\t// Define a format string for the second column:\n\tfmt1 = '%'+w1+'s';\n\n\t// Define a format string for the third column:\n\tfmt2 = '// %s';\n\n\t// Define a format string which combines the columns:\n\tfmt = '%s: %s %s';\n\n\t// Initialize a byte counter:\n\tib = 0;\n\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// If we are currently processing fields in a union, move along to the next non-union field...\n\t\tif ( i > 0 && ( o.byteOffset === fields[ i-1 ].byteOffset ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\t// Check whether this field is the first field of a union...\n\t\tif ( i < N-1 ) {\n\t\t\tflg = ( o.byteOffset === fields[ i+1 ].byteOffset );\n\t\t} else {\n\t\t\tflg = false;\n\t\t}\n\t\tfor ( j = 0; j < o.byteLength; j++ ) {\n\t\t\t// In the first column, render the byte number:\n\t\t\tc0 = format( fmt0, ib.toString() );\n\n\t\t\t// In the second column, render the field name and the byte number relative to the field:\n\t\t\tc1 = format( fmt1, format( '%s[%u]', o.name, j ) );\n\n\t\t\t// If a field type spans multiple bytes, render the byte number:\n\t\t\tif ( o.alignment > 1 ) {\n\t\t\t\tbfmt = ' (byte %u)';\n\t\t\t} else {\n\t\t\t\tbfmt = '';\n\t\t\t}\n\t\t\t// If a field is part of a union, make that explicit:\n\t\t\tif ( flg ) {\n\t\t\t\tufmt = ' => union: %s';\n\t\t\t\ttmp = [];\n\t\t\t\tk = i + 1;\n\t\t\t\twhile ( k < N && o.byteOffset === fields[ k ].byteOffset ) {\n\t\t\t\t\tf = fields[ k ];\n\t\t\t\t\tif ( f.isStructType ) {\n\t\t\t\t\t\tt = '';\n\t\t\t\t\t} else {\n\t\t\t\t\t\tt = f.type;\n\t\t\t\t\t}\n\t\t\t\t\ttmp.push( format( '%s<%s>[%u]', f.name, t, j%f.alignment ) );\n\t\t\t\t\tk += 1;\n\t\t\t\t}\n\t\t\t\tufmt = format( ufmt, tmp.join( ', ' ) );\n\t\t\t} else {\n\t\t\t\tufmt = '';\n\t\t\t}\n\t\t\ttmp = format( bfmt+ufmt, j%o.alignment );\n\n\t\t\t// If a field contains multiple elements (i.e., is an array), render the field type along with the element number:\n\t\t\tif ( o.length ) {\n\t\t\t\tc2 = format( fmt2, format( '%s[%u]%s', o.type, floor( j/o.alignment ), tmp ) );\n\t\t\t}\n\t\t\t// Otherwise, just render the field type:\n\t\t\telse {\n\t\t\t\tc2 = format( fmt2, format( '%s%s', o.type, tmp ) );\n\t\t\t}\n\t\t\t// Render the row string:\n\t\t\tout.push( format( fmt, c0, c1, c2 ) );\n\t\t\tib += 1;\n\t\t}\n\t\tfor ( j = 0; j < o.padding; j++ ) {\n\t\t\tc0 = format( fmt0, ib.toString() );\n\t\t\tc1 = format( fmt1, '--' );\n\t\t\tc2 = format( fmt2, 'padding' );\n\t\t\tout.push( format( fmt, c0, c1, c2 ) );\n\t\t\tib += 1;\n\t\t}\n\t}\n\treturn out.join( '\\n' );\n}\n\n\n// EXPORTS //\n\nexport default linearFormat;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Dummy function.\n*\n* @private\n*/\nfunction foo() {\n\t// No-op...\n}\n\n\n// EXPORTS //\n\nexport default foo;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasFunctionNameSupport from '@stdlib/assert-has-function-name-support';\nimport format from '@stdlib/string-format';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\n\n\n// VARIABLES //\n\nvar isFunctionNameSupported = hasFunctionNameSupport();\n\n\n// MAIN //\n\n/**\n* Returns the name of a function.\n*\n* @param {Function} fcn - input function\n* @throws {TypeError} must provide a function\n* @returns {string} function name\n*\n* @example\n* var v = functionName( Math.sqrt );\n* // returns 'sqrt'\n*\n* @example\n* var v = functionName( function foo(){} );\n* // returns 'foo'\n*\n* @example\n* var v = functionName( function(){} );\n* // returns '' || 'anonymous'\n*\n* @example\n* var v = functionName( String );\n* // returns 'String'\n*/\nfunction functionName( fcn ) {\n\t// TODO: add support for generator functions?\n\tif ( isFunction( fcn ) === false ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', fcn ) );\n\t}\n\tif ( isFunctionNameSupported ) {\n\t\treturn fcn.name;\n\t}\n\treturn RE.exec( fcn.toString() )[ 1 ];\n}\n\n\n// EXPORTS //\n\nexport default functionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport foo from './foo.js';\n\n\n// MAIN //\n\n/**\n* Tests for native function `name` support.\n*\n* @returns {boolean} boolean indicating if an environment has function `name` support\n*\n* @example\n* var bool = hasFunctionNameSupport();\n* // returns \n*/\nfunction hasFunctionNameSupport() {\n\treturn ( foo.name === 'foo' );\n}\n\n\n// EXPORTS //\n\nexport default hasFunctionNameSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Int8Array from '@stdlib/array-int8';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Float32Array from '@stdlib/array-float32';\nimport Float64Array from '@stdlib/array-float64';\n\n\n// MAIN //\n\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport fcnName from '@stdlib/utils-function-name';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasFloat64ArraySupport from '@stdlib/assert-has-float64array-support';\nimport Float64Array from '@stdlib/array-float64';\nimport CTORS from './ctors.js';\nimport NAMES from './names.json';\n\n\n// VARIABLES //\n\n// Abstract `TypedArray` class:\nvar TypedArray = ( hasFloat64ArraySupport() ) ? getPrototypeOf( Float64Array ) : Dummy; // eslint-disable-line max-len\n\n// Ensure abstract typed array class has expected name:\nTypedArray = ( fcnName( TypedArray ) === 'TypedArray' ) ? TypedArray : Dummy;\n\n\n// FUNCTIONS //\n\n/**\n* Dummy constructor.\n*\n* @private\n*/\nfunction Dummy() {} // eslint-disable-line no-empty-function\n\n\n// MAIN //\n\n/**\n* Tests if a value is a typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a typed array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isTypedArray( new Int8Array( 10 ) );\n* // returns true\n*/\nfunction isTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for the abstract class...\n\tif ( value instanceof TypedArray ) {\n\t\treturn true;\n\t}\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isTypedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\n\n\n// MAIN //\n\nvar CTORS = [\n\tComplex128Array,\n\tComplex64Array\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.hasInstance` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.hasInstance` support\n*\n* @example\n* var bool = hasHasInstanceSymbolSupport();\n* // returns \n*/\nfunction hasHasInstanceSymbolSupport() { // eslint-disable-line id-length\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol' &&\n\t\thasOwnProp( Symbol, 'hasInstance' ) &&\n\t\ttypeof Symbol.hasInstance === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasHasInstanceSymbolSupport;\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 hasHasInstanceSymbolSupport from '@stdlib/assert-has-has-instance-symbol-support'; // eslint-disable-line id-length\n\n\n// MAIN //\n\n/**\n* Has instance symbol.\n*\n* @name HasInstanceSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* import isArray from '@stdlib/assert-is-array';\n*\n* function ArrayLike() {\n* return {\n* 'length': 3,\n* '0': 1,\n* '1': 2,\n* '2': 3\n* };\n* };\n*\n* ArrayLike[ HasInstanceSymbol ] = isArray;\n*/\nvar HasInstanceSymbol = ( hasHasInstanceSymbolSupport() ) ? Symbol.hasInstance : null; // eslint-disable-line max-len\n\n\n// EXPORTS //\n\nexport default HasInstanceSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasHasInstanceSymbolSupport from '@stdlib/assert-has-has-instance-symbol-support'; // eslint-disable-line id-length\nimport HasInstanceSymbol from '@stdlib/symbol-has-instance';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar hasSupport = hasHasInstanceSymbolSupport();\n\n\n// MAIN //\n\n/**\n* Tests whether a value has in its prototype chain a specified constructor as a prototype property.\n*\n* @param {*} value - value to test\n* @param {Function} constructor - constructor to test against\n* @throws {TypeError} constructor must be callable\n* @returns {boolean} boolean indicating whether a value is an instance of a provided constructor\n*\n* @example\n* var bool = instanceOf( [], Array );\n* // returns true\n*\n* @example\n* var bool = instanceOf( {}, Object ); // exception\n* // returns true\n*\n* @example\n* var bool = instanceOf( 'beep', String );\n* // returns false\n*\n* @example\n* var bool = instanceOf( null, Object );\n* // returns false\n*\n* @example\n* var bool = instanceOf( 5, Object );\n* // returns false\n*/\nfunction instanceOf( value, constructor ) {\n\t// TODO: replace with `isCallable` check\n\tif (\n\t\ttypeof constructor !== 'function' &&\n\t\t!(\n\t\t\thasSupport &&\n\t\t\ttypeof constructor === 'object' &&\n\t\t\ttypeof constructor[ HasInstanceSymbol ] === 'function'\n\t\t)\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be callable. Value: `%s`.', constructor ) );\n\t}\n\treturn ( value instanceof constructor );\n}\n\n\n// EXPORTS //\n\nexport default instanceOf;\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 Int8Array from '@stdlib/array-int8';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Float32Array from '@stdlib/array-float32';\nimport Float64Array from '@stdlib/array-float64';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\nvar CTORS = [\n\t[ Float64Array, 'Float64Array' ],\n\t[ Float32Array, 'Float32Array' ],\n\t[ Int32Array, 'Int32Array' ],\n\t[ Uint32Array, 'Uint32Array' ],\n\t[ Int16Array, 'Int16Array' ],\n\t[ Uint16Array, 'Uint16Array' ],\n\t[ Int8Array, 'Int8Array' ],\n\t[ Uint8Array, 'Uint8Array' ],\n\t[ Uint8ClampedArray, 'Uint8ClampedArray' ],\n\t[ Complex64Array, 'Complex64Array' ],\n\t[ Complex128Array, 'Complex128Array' ],\n\t[ BooleanArray, 'BooleanArray' ]\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport instanceOf from '@stdlib/assert-instance-of';\nimport ctorName from '@stdlib/utils-constructor-name';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport CTORS from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns the typed array type.\n*\n* @private\n* @param {TypedArray} arr - typed array\n* @returns {(string|void)} typed array type\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 5 );\n* var str = typeName( arr );\n* // returns 'Float64Array'\n*/\nfunction typeName( arr ) {\n\tvar v;\n\tvar i;\n\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( instanceOf( arr, CTORS[ i ][ 0 ] ) ) {\n\t\t\treturn CTORS[ i ][ 1 ];\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired native class...\n\twhile ( arr ) {\n\t\tv = ctorName( arr );\n\t\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\t\tif ( v === CTORS[ i ][ 1 ] ) {\n\t\t\t\treturn CTORS[ i ][ 1 ];\n\t\t\t}\n\t\t}\n\t\tarr = getPrototypeOf( arr );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default typeName;\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 isTypedArray from '@stdlib/assert-is-typed-array';\nimport isComplexTypedArray from '@stdlib/assert-is-complex-typed-array';\nimport isBooleanArray from '@stdlib/assert-is-booleanarray';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport format from '@stdlib/string-format';\nimport typeName from './type.js';\n\n\n// MAIN //\n\n/**\n* Returns a JSON representation of a typed array.\n*\n* ## Notes\n*\n* - We build a JSON object representing a typed array similar to how Node.js `Buffer` objects are represented. See [Buffer][1].\n*\n* [1]: https://nodejs.org/api/buffer.html#buffer_buf_tojson\n*\n* @param {TypedArray} arr - typed array to serialize\n* @throws {TypeError} first argument must be a typed array\n* @returns {Object} JSON representation\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\nfunction typedarray2json( arr ) {\n\tvar data;\n\tvar out;\n\tvar i;\n\n\tif ( isTypedArray( arr ) ) {\n\t\tdata = arr;\n\t} else if ( isComplexTypedArray( arr ) ) {\n\t\tif ( arr.BYTES_PER_ELEMENT === 8 ) {\n\t\t\tdata = reinterpret64( arr, 0 );\n\t\t} else { // arr.BYTES_PER_ELEMENT === 16\n\t\t\tdata = reinterpret128( arr, 0 );\n\t\t}\n\t} else if ( isBooleanArray( arr ) ) {\n\t\tdata = reinterpretBoolean( arr, 0 );\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a typed array. Value: `%s`.', arr ) );\n\t}\n\tout = {\n\t\t'type': typeName( arr ),\n\t\t'data': []\n\t};\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tout.data.push( data[ i ] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default typedarray2json;\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 BooleanArray from '@stdlib/array-bool';\nimport constructorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BooleanArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a BooleanArray\n*\n* @example\n* import BooleanArray from '@stdlib/array-bool';\n*\n* var bool = isBooleanArray( new BooleanArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isBooleanArray( [] );\n* // returns false\n*/\nfunction isBooleanArray( value ) {\n\treturn (\n\t\tvalue instanceof BooleanArray ||\n\t\tconstructorName( value ) === 'BooleanArray'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBooleanArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport CTORS from './ctors.js';\nimport NAMES from './names.json';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isComplexTypedArray( new Complex128Array( 10 ) );\n* // returns true\n*/\nfunction isComplexTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for complex typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isComplexTypedArray;\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 no-restricted-syntax, id-length, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setNonEnumerableReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\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 hasProp from '@stdlib/assert-has-property';\nimport min from '@stdlib/math-base-special-fast-min';\nimport filled from '@stdlib/array-base-filled';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport CTOR_NAME from './ctor_name.js';\nimport createPrototypeAccessors from './create_prototype_accessors.js';\nimport isStructInstance from './is_struct_instance.js';\nimport normalize from './normalize_field_list.js';\nimport fieldNames from './field_names.js';\nimport fieldIndex from './field_index.js';\nimport resolveAlignment from './resolve_alignment.js';\nimport byteOffsets from './byte_offsets.js';\nimport partitions from './partitions.js';\nimport flatten from './flatten_fields.js';\nimport struct2string from './to_string.js';\nimport struct2json from './to_json.js';\nimport layoutFormat from './format_layout.js';\n\n\n// MAIN //\n\n/**\n* Returns a constructor for creating a fixed-width composite data type (a.k.a., a `struct`).\n*\n* @param {ObjectArray} fields - structure fields\n* @throws {TypeError} first argument must be an array-like object containing objects\n* @throws {TypeError} field objects must have required properties\n* @throws {TypeError} field objects must have valid fields\n* @throws {TypeError} union types must be array-like objects containing objects\n* @throws {RangeError} union types must contain fields having the same byte length\n* @throws {TypeError} union types cannot contain nested union types\n* @throws {TypeError} union types can only contain one field with a default value\n* @throws {Error} unexpected error\n* @returns {Function} constructor\n*\n* @example\n* var fields = [\n* {\n* 'type': 'union',\n* 'fields': [\n* {\n* 'name': 'double',\n* 'description': 'double-precision floating-point number',\n* 'type': 'float64',\n* 'enumerable': true,\n* 'writable': true,\n* 'castingMode': 'none'\n* },\n* {\n* 'name': 'words',\n* 'description': 'high and low words',\n* 'type': 'uint32',\n* 'length': 2,\n* 'enumerable': true,\n* 'writable': true,\n* 'castingMode': 'none'\n* }\n* ]\n* }\n* ];\n* var Struct = factory( fields );\n*\n* var data = {\n* 'double': 3.14\n* };\n* var s = new Struct( data );\n* // returns \n*\n* var v = s.double;\n* // returns 3.14\n*\n* var w = s.words;\n* // e.g., [ 1374389535, 1074339512 ]\n*/\nfunction factory( fields ) {\n\tvar FIELD_NAMES;\n\tvar BYTE_LENGTH;\n\tvar PARTITIONS;\n\tvar ALIGNMENT;\n\tvar ACCESSORS;\n\tvar FIELDS;\n\tvar tmp;\n\tvar o;\n\tif ( !isCollection( fields ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', fields ) );\n\t}\n\t// Normalize the list of field objects:\n\ttmp = normalize( fields );\n\tif ( tmp instanceof Error ) {\n\t\tthrow tmp;\n\t}\n\tFIELDS = tmp;\n\n\t// Resolve the list of unique field names:\n\ttmp = fieldNames( FIELDS );\n\tif ( tmp instanceof Error ) {\n\t\tthrow tmp;\n\t}\n\tFIELD_NAMES = tmp;\n\n\t// Resolve the struct's alignment requirements:\n\tALIGNMENT = resolveAlignment( FIELDS );\n\n\t// Compute the byte offset for each field:\n\tFIELDS = byteOffsets( FIELDS, ALIGNMENT );\n\n\t// Now that we've finished processing provided field objects, flatten the list, such that union types are implied by field objects having the same byte offset:\n\tFIELDS = flatten( FIELDS );\n\n\t// Compute field \"partitions\" (i.e., non-overlapping views):\n\tPARTITIONS = partitions( FIELDS );\n\n\t// Compute the struct's byte length:\n\to = FIELDS[ FIELDS.length-1 ];\n\tBYTE_LENGTH = o.byteOffset + o.byteLength + o.padding;\n\n\t/**\n\t* Constructor for a composite data type (a.k.a., a `struct`).\n\t*\n\t* @private\n\t* @param {(Object|ArrayBuffer)} [arg] - array buffer or data object\n\t* @param {NonNegativeInteger} [byteOffset=0] - offset, in bytes, to the first byte in a provided buffer for the returned `struct` to reference\n\t* @param {NonNegativeInteger} [byteLength] - maximum number of elements in the byte array\n\t* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n\t* @throws {TypeError} second argument must be a nonnegative integer\n\t* @throws {TypeError} third argument must be a nonnegative integer\n\t* @throws {Error} union types may only be initialized by a single member\n\t* @returns {Struct} struct instance\n\t*/\n\tfunction Struct( arg, byteOffset, byteLength ) {\n\t\tvar values;\n\t\tvar nargs;\n\t\tvar cache;\n\t\tvar view;\n\t\tvar obj;\n\t\tvar o;\n\t\tvar v;\n\t\tvar i;\n\t\tvar j;\n\t\tvar k;\n\n\t\tnargs = arguments.length;\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tif ( nargs === 0 ) {\n\t\t\t\treturn new Struct();\n\t\t\t}\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\treturn new Struct( arg );\n\t\t\t}\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\treturn new Struct( arg, byteOffset );\n\t\t\t}\n\t\t\treturn new Struct( arg, byteOffset, byteLength );\n\t\t}\n\t\tif ( isArrayBuffer( arg ) ) {\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\tview = new DataView( arg, 0, BYTE_LENGTH );\n\t\t\t} else {\n\t\t\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t\t\t}\n\t\t\t\tif ( nargs === 2 ) {\n\t\t\t\t\tview = new DataView( arg, byteOffset, BYTE_LENGTH );\n\t\t\t\t} else {\n\t\t\t\t\tif ( !isNonNegativeInteger( byteLength ) ) {\n\t\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Byte length must be a nonnegative integer. Value: `%s`.', byteLength ) );\n\t\t\t\t\t}\n\t\t\t\t\tview = new DataView( arg, byteOffset, min( byteLength, BYTE_LENGTH ) ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( view.byteLength < BYTE_LENGTH ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer has insufficient capacity. Minimum capacity: `%u`.', BYTE_LENGTH ) );\n\t\t\t}\n\t\t} else {\n\t\t\tview = new DataView( new ArrayBuffer( BYTE_LENGTH ) );\n\t\t\tif ( nargs > 0 ) {\n\t\t\t\tif ( !isObject( arg ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tobj = arg;\n\t\t\t}\n\t\t}\n\t\t// Bind the byte buffer to the current instance:\n\t\tsetReadOnly( this, PRIVATE_BUFFER, view );\n\n\t\t// If we were provided a data object, set provided fields...\n\t\tif ( obj !== void 0 ) {\n\t\t\t// Initialize an array containing values to set:\n\t\t\tvalues = filled( void 0, FIELDS.length );\n\n\t\t\t// For each field, determine whether a value has been specified...\n\t\t\tcache = {};\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tk = FIELD_NAMES[ i ];\n\t\t\t\tj = PARTITIONS[ i ];\n\t\t\t\tif ( hasProp( obj, k ) ) {\n\t\t\t\t\t// Check whether a value has already been specified for this view (i.e., via another union member)...\n\t\t\t\t\tif ( cache[ j ] ) {\n\t\t\t\t\t\tthrow new Error( 'invalid argument. Union types may only be initialized by a single member.' );\n\t\t\t\t\t}\n\t\t\t\t\tvalues[ i ] = obj[ k ];\n\t\t\t\t\tcache[ j ] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Perform a second pass over the fields to fill in default initial values...\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tj = PARTITIONS[ i ];\n\t\t\t\tif ( cache[ j ] ) {\n\t\t\t\t\t// Skip fields already having initial values...\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\to = FIELDS[ i ];\n\t\t\t\tif ( o.default !== void 0 ) {\n\t\t\t\t\tvalues[ i ] = o.default;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Set all fields with initialization values...\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tv = values[ i ];\n\t\t\t\tif ( v !== void 0 ) {\n\t\t\t\t\tACCESSORS[ FIELD_NAMES[ i ] ][ 1 ].call( this, v );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t* Constructor name.\n\t*\n\t* @private\n\t* @name name\n\t* @memberof Struct\n\t* @readonly\n\t* @type {string}\n\t* @default 'Struct'\n\t*/\n\tsetReadOnly( Struct, 'name', CTOR_NAME );\n\n\t/**\n\t* Alignment.\n\t*\n\t* @private\n\t* @name alignment\n\t* @memberof Struct\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( Struct, 'alignment', ALIGNMENT );\n\n\t/**\n\t* Size (in bytes) of the `struct`.\n\t*\n\t* @private\n\t* @name byteLength\n\t* @memberof Struct\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( Struct, 'byteLength', BYTE_LENGTH );\n\n\t/**\n\t* Returns a list of `struct` fields.\n\t*\n\t* @private\n\t* @name fields\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Array}\n\t*/\n\tsetNonEnumerableReadOnlyAccessor( Struct, 'fields', function get() {\n\t\treturn FIELD_NAMES.slice();\n\t});\n\n\t/**\n\t* Returns a string corresponding to the `struct` layout.\n\t*\n\t* @private\n\t* @name layout\n\t* @memberof Struct\n\t* @readonly\n\t* @type {string}\n\t*/\n\tsetNonEnumerableReadOnlyAccessor( Struct, 'layout', function get() {\n\t\t// As this is not likely to be a commonly used API, intentionally recompute the layout format in order to avoid consuming memory for what could be a long string...\n\t\treturn layoutFormat( FIELDS );\n\t});\n\n\t/**\n\t* Returns the underlying byte buffer of a `struct`.\n\t*\n\t* @private\n\t* @name bufferOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {Object} obj - struct instance\n\t* @throws {TypeError} must provide a `struct` instance\n\t* @returns {ArrayBuffer} underlying byte buffer\n\t*/\n\tsetReadOnly( Struct, 'bufferOf', function bufferOf( obj ) {\n\t\tif ( !isStructInstance( obj ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a `struct` instance. Value: `%s`.', obj ) );\n\t\t}\n\t\treturn obj[ PRIVATE_BUFFER ].buffer;\n\t});\n\n\t/**\n\t* Returns the length, in bytes, of the value specified by the provided field name.\n\t*\n\t* @private\n\t* @name byteLengthOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {NonNegativeInteger} byte length\n\t*/\n\tsetReadOnly( Struct, 'byteLengthOf', function byteLengthOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].byteLength;\n\t});\n\n\t/**\n\t* Returns the offset, in bytes, from the beginning of a `struct` to the value specified by the provided field name.\n\t*\n\t* @private\n\t* @name byteOffsetOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {NonNegativeInteger} byte offset\n\t*/\n\tsetReadOnly( Struct, 'byteOffsetOf', function byteOffsetOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].byteOffset;\n\t});\n\n\t/**\n\t* Returns the description associated with a provided field name.\n\t*\n\t* @private\n\t* @name descriptionOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {string} description\n\t*/\n\tsetReadOnly( Struct, 'descriptionOf', function descriptionOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].description;\n\t});\n\n\t/**\n\t* Returns a boolean indicating whether a provided value is a `struct` instance.\n\t*\n\t* @private\n\t* @name isStruct\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {*} value - input value\n\t* @returns {boolean} boolean indicating whether a value is a `struct` instance\n\t*/\n\tsetReadOnly( Struct, 'isStruct', function isStruct( value ) {\n\t\treturn (\n\t\t\tvalue instanceof Struct ||\n\t\t\t(\n\t\t\t\tisStructInstance( value ) &&\n\t\t\t\tisStructConstructorLike( value.constructor )\n\t\t\t)\n\t\t);\n\t});\n\n\t/**\n\t* Returns the type associated with a provided field name.\n\t*\n\t* @private\n\t* @name typeOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {(string|Object)} type\n\t*/\n\tsetReadOnly( Struct, 'typeOf', function typeOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].type;\n\t});\n\n\t/**\n\t* Returns the underlying byte buffer of a `struct` as a `DataView`.\n\t*\n\t* @private\n\t* @name viewOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {Object} obj - struct instance\n\t* @throws {TypeError} must provide a `struct` instance\n\t* @returns {DataView} view of underlying byte buffer\n\t*/\n\tsetReadOnly( Struct, 'viewOf', function viewOf( obj ) {\n\t\tvar buf;\n\t\tif ( !isStructInstance( obj ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a `struct` instance. Value: `%s`.', obj ) );\n\t\t}\n\t\tbuf = obj[ PRIVATE_BUFFER ];\n\t\treturn new DataView( buf.buffer, buf.byteOffset, buf.byteLength );\n\t});\n\n\t// Create prototype accessors for getting and setting field values:\n\tACCESSORS = createPrototypeAccessors( Struct.prototype, FIELDS );\n\n\t/**\n\t* Serializes a `struct` to a string.\n\t*\n\t* @private\n\t* @name toString\n\t* @memberof Struct.prototype\n\t* @readonly\n\t* @type {Function}\n\t* @param {Options} [options] - function options\n\t* @param {string} [options.format='none'] - serialization format\n\t* @throws {Error} `this` must be a struct instance\n\t* @throws {TypeError} options argument must be an object\n\t* @throws {TypeError} must provide valid options\n\t* @returns {string} serialized `struct` instance\n\t*/\n\tsetReadOnly( Struct.prototype, 'toString', function toString() {\n\t\tvar opts;\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tthrow new Error( 'invalid invocation. `this` is not a struct instance.' );\n\t\t}\n\t\tif ( arguments.length > 0 ) {\n\t\t\topts = arguments[ 0 ];\n\t\t} else {\n\t\t\topts = {};\n\t\t}\n\t\treturn struct2string( Struct, FIELDS, opts );\n\t});\n\n\t/**\n\t* Serializes a `struct` to JSON.\n\t*\n\t* @private\n\t* @name toJSON\n\t* @memberof Struct.prototype\n\t* @readonly\n\t* @type {Function}\n\t* @throws {Error} `this` must be a struct instance\n\t* @returns {JSON} serialized `struct` instance\n\t*/\n\tsetReadOnly( Struct.prototype, 'toJSON', function toJSON() {\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tthrow new Error( 'invalid invocation. `this` is not a struct instance.' );\n\t\t}\n\t\treturn struct2json( this, FIELDS );\n\t});\n\n\treturn Struct;\n}\n\n\n// EXPORTS //\n\nexport default factory;\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 isObject from '@stdlib/assert-is-object';\nimport format from '@stdlib/string-format';\nimport FIELD_PROPERTIES from './field_properties.js';\nimport isUnionType from './is_union_type.js';\nimport normalizeField from './normalize_field.js';\nimport normalizeUnion from './normalize_union.js';\n\n\n// MAIN //\n\n/**\n* Normalizes a list of field objects.\n*\n* @private\n* @param {Array} fields - input fields\n* @returns {(Array|Error)} normalized field objects or an error\n*/\nfunction normalize( fields ) {\n\tvar out;\n\tvar tmp;\n\tvar o;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( !isObject( o ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects. Value: `%s`. Index: `%d`.', o, i ) );\n\t\t}\n\t\t// Check for a union type which is a collection of nested field objects which all have the same byte length...\n\t\tif ( isUnionType( o ) ) {\n\t\t\ttmp = normalizeUnion( o );\n\t\t\tif ( tmp === null ) {\n\t\t\t\treturn new TypeError( format( 'invalid argument. Union types must be an array of objects. Value: `%s`. Index: `%d`.', JSON.stringify( o ), i ) );\n\t\t\t}\n\t\t\tif ( tmp instanceof Error ) {\n\t\t\t\treturn tmp;\n\t\t\t}\n\t\t} else {\n\t\t\ttmp = normalizeField( o, FIELD_PROPERTIES );\n\t\t\tif ( tmp instanceof Error ) {\n\t\t\t\treturn tmp;\n\t\t\t}\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default normalize;\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 format from '@stdlib/string-format';\nimport isUnionType from './is_union_type.js';\n\n\n// MAIN //\n\n/**\n* Resolves a list of field names.\n*\n* @private\n* @param {Array} fields - list of field objects\n* @returns {(Array|Error)} list of field names or an error\n*/\nfunction fieldNames( fields ) {\n\tvar hash;\n\tvar out;\n\tvar o1;\n\tvar o2;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\thash = {};\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to1 = fields[ i ];\n\t\tk = o1.name;\n\t\tif ( isUnionType( o1 ) ) {\n\t\t\tfor ( j = 0; j < o1.fields.length; j++ ) {\n\t\t\t\to2 = o1.fields[ j ];\n\t\t\t\tk = o2.name;\n\t\t\t\tif ( hash[ k ] === true ) {\n\t\t\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects having unique field names. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t\t\t}\n\t\t\t\thash[ k ] = true;\n\t\t\t\tout.push( k );\n\t\t\t}\n\t\t} else if ( hash[ k ] === true ) {\n\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects having unique field names. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t} else {\n\t\t\thash[ k ] = true;\n\t\t\tout.push( k );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fieldNames;\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 isUnionType from './is_union_type.js';\n\n\n// MAIN //\n\n/**\n* Flattens a list of field objects.\n*\n* @private\n* @param {Array} fields - list of field objects\n* @returns {Array} new list\n*/\nfunction flatten( fields ) {\n\tvar out;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( isUnionType( o ) ) {\n\t\t\tfor ( j = 0; j < o.fields.length; j++ ) {\n\t\t\t\tout.push( o.fields[ j ] );\n\t\t\t}\n\t\t} else {\n\t\t\tout.push( o );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default flatten;\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* Returns a list of partition indices.\n*\n* ## Notes\n*\n* - This function partitions field objects according to whether a field object represents a unique \"view\" over an underlying byte buffer. Field objects within a union belong to the same partition.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @returns {NonNegativeIntegerArray} list of indices\n*/\nfunction partitions( fields ) {\n\tvar out;\n\tvar N;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\tN = fields.length;\n\n\tout = [];\n\tj = 0;\n\tfor ( i = 0; i < N-1; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Check for the start of a union...\n\t\tif ( o.byteOffset === fields[ i+1 ].byteOffset ) {\n\t\t\tout.push( j );\n\t\t\tcontinue;\n\t\t}\n\t\tout.push( j );\n\t\tj += 1;\n\t}\n\t// Set the partition for the last field object:\n\tout.push( j );\n\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default partitions;\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 id-length */\n\n'use strict';\n\n// MODULES //\n\nimport setNonEnumerableReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport setNonEnumerableReadWriteAccessor from '@stdlib/utils-define-nonenumerable-read-write-accessor';\nimport setReadOnlyAccessor from '@stdlib/utils-define-read-only-accessor';\nimport setReadWriteAccessor from '@stdlib/utils-define-read-write-accessor';\nimport getter from './getter.js';\nimport setter from './setter.js';\n\n\n// MAIN //\n\n/**\n* Assigns methods for accessing field values to a provided prototype.\n*\n* @private\n* @param {Object} p - prototype\n* @param {Array} fields - field objects\n* @returns {Object} object containing accessors for each field\n*/\nfunction createPrototypeAccessors( p, fields ) {\n\tvar get;\n\tvar set;\n\tvar out;\n\tvar o;\n\tvar i;\n\n\tout = {};\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tget = getter( o );\n\t\tset = setter( o );\n\t\tif ( o.enumerable ) {\n\t\t\tif ( o.writable ) {\n\t\t\t\tsetReadWriteAccessor( p, o.name, get, set );\n\t\t\t} else {\n\t\t\t\tsetReadOnlyAccessor( p, o.name, get );\n\t\t\t}\n\t\t} else if ( o.writable ) {\n\t\t\tsetNonEnumerableReadWriteAccessor( p, o.name, get, set );\n\t\t} else {\n\t\t\tsetNonEnumerableReadOnlyAccessor( p, o.name, get );\n\t\t}\n\t\tout[ o.name ] = [ get, set ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default createPrototypeAccessors;\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 isCollection from '@stdlib/assert-is-collection';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isFunction from '@stdlib/assert-is-function';\nimport typedarray2json from '@stdlib/array-to-json';\nimport isStructInstance from './is_struct_instance.js';\n\n\n// MAIN //\n\n/**\n* Serializes a `struct` instance to JSON.\n*\n* @private\n* @param {Struct} struct - struct instance\n* @param {Array} fields - list of normalized fields\n* @returns {Object} JSON representation\n*/\nfunction toJSON( struct, fields ) {\n\tvar out;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\tout = {};\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tv = struct[ o.name ];\n\t\tif ( isCollection( v ) ) {\n\t\t\tv = typedarray2json( v );\n\t\t} else if ( isStructInstance( v ) ) {\n\t\t\tv = v.toJSON();\n\t\t} else if ( isComplexLike( v ) && isFunction( v.toJSON ) ) {\n\t\t\tv = v.toJSON();\n\t\t}\n\t\tout[ o.name ] = v;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\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 getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport Uint8Array from '@stdlib/array-uint8';\nimport { ndarray as gcopy } from '@stdlib/blas-base-gcopy';\n\n\n// MAIN //\n\n/**\n* Fills an output ArrayBuffer with array values.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {ArrayBuffer} buf - output data buffer\n* @param {Collection} arr - input array\n* @throws {TypeError} an input array must contain struct instances\n* @throws {TypeError} each element of an input array must be a struct instance having the expected layout\n* @returns {ArrayBuffer} output data buffer\n*/\nfunction fromArray( Struct, buf, arr ) {\n\tvar sbytes;\n\tvar bbytes;\n\tvar offset;\n\tvar layout;\n\tvar sview;\n\tvar opts;\n\tvar len;\n\tvar get;\n\tvar flg;\n\tvar nb;\n\tvar v;\n\tvar i;\n\n\topts = {\n\t\t'format': 'layout'\n\t};\n\n\tlen = arr.length;\n\tif ( arr.get && arr.set ) {\n\t\tget = accessorGetter( 'default' );\n\t} else {\n\t\tget = getter( 'default' );\n\t}\n\tlayout = Struct.layout;\n\tnb = Struct.byteLength;\n\n\t// FIXME: add optimization for when `buf` is a StructArray having the same layout, as can just copy bytes\n\n\tbbytes = new Uint8Array( buf );\n\toffset = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( arr, i );\n\t\ttry {\n\t\t\tsview = Struct.viewOf( v ); // note: this should throw if `v` is not a struct\n\t\t\tflg = true;\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\ttry {\n\t\t\t\t// Attempt to convert the input value to a struct instance:\n\t\t\t\tv = new Struct( v ); // note: this should throw if `v` is not an object with valid fields\n\t\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tsview = Struct.viewOf( v );\n\t\t\tflg = false;\n\t\t}\n\t\tif ( flg && v.toString( opts ) !== layout ) {\n\t\t\treturn null;\n\t\t}\n\t\tsbytes = new Uint8Array( sview.buffer, sview.byteOffset, sview.byteLength ); // eslint-disable-line max-len\n\t\tgcopy( nb, sbytes, 1, 0, bbytes, 1, offset );\n\t\toffset += nb;\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\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 no-restricted-syntax, no-invalid-this, max-len, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isFunction from '@stdlib/assert-is-function';\nimport isObject from '@stdlib/assert-is-object';\nimport isPrototypeOf from '@stdlib/assert-is-prototype-of'; // eslint-disable-line stdlib/no-redeclare\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport hasProp from '@stdlib/assert-has-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport Uint8Array from '@stdlib/array-uint8';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport { ndarray as gcopy } from '@stdlib/blas-base-gcopy';\nimport structFactory from '@stdlib/dstructs-struct';\nimport format from '@stdlib/string-format';\nimport fromArray from './from_array.js';\nimport fromIterator from './from_iterator.js';\n\n\n// VARIABLES //\n\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\nvar CTOR_NAME = 'StructArray';\n\n\n// MAIN //\n\n/**\n* Returns a constructor for creating arrays having a fixed-width composite data type.\n*\n* @param {(Function|Array)} arg - struct constructor or struct schema\n* @throws {TypeError} first argument must be either a struct constructor or struct schema\n* @returns {Function} constructor\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema1 = [\n* {\n* 'name': 're',\n* 'type': 'float64'\n* },\n* {\n* 'name': 'im',\n* 'type': 'float64'\n* }\n* ];\n*\n* // Create a struct constructor for storing real and imaginary components:\n* var Components = structFactory( schema1 );\n*\n* var schema2 = [\n* {\n* 'type': 'union',\n* 'fields': [\n* {\n* 'name': 'value',\n* 'type': 'complex128'\n* },\n* {\n* 'name': 'components',\n* 'type': Components\n* }\n* ]\n* }\n* ];\n*\n* // Create a struct constructor for storing a double-precision complex number:\n* var Complex128Struct = structFactory( schema2 );\n*\n* // Create an array constructor for storing complex numbers:\n* var Complex128Array = factory( Complex128Struct );\n*\n* // Create a new array:\n* var x = new Complex128Array( 10 );\n* // returns \n*\n* // Retrieve the first element:\n* var v1 = x.get( 0 );\n*\n* // Resolve the complex number stored within the first element:\n* var z1 = v1.value;\n* // returns [ 0.0, 0.0 ]\n*\n* // Resolve the individual real and imaginary components:\n* var z2 = v1.components;\n*\n* var re = z2.re;\n* // returns 0.0\n*\n* var im = z2.im;\n* // returns 0.0\n*\n* // Create a new complex number struct:\n* var z3 = new Complex128Struct({\n* 'value': new Complex128( 3.0, 5.0 )\n* });\n*\n* // Update the first element of the array:\n* x.set( z3, 0 );\n*\n* // As `v1` is a view on same memory as the first element, resolve the complex number stored within the element:\n* var z4 = v1.value;\n* // returns [ 3.0, 5.0 ]\n*/\nfunction factory( arg ) { // eslint-disable-line stdlib/jsdoc-require-throws-tags\n\tvar BYTES_PER_ELEMENT;\n\tvar LAYOUT;\n\tvar FIELDS;\n\tvar Struct;\n\n\t// FIXME: add option support for strict input object validation (e.g., throw whenever non-struct properties are included on an object passed to `set`)\n\n\tif ( isCollection( arg ) ) {\n\t\tStruct = structFactory( arg ); // NOTE: delegate to `structFactory` to perform input validation\n\t} else if ( isStructConstructorLike( arg ) ) {\n\t\tStruct = arg;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a struct constructor or struct schema. Value: `%s`.', arg ) );\n\t}\n\tBYTES_PER_ELEMENT = Struct.byteLength;\n\tLAYOUT = Struct.layout; // TODO: consider whether to lazily materialize the struct layout, as this could potentially be a long string (hence increased memory consumption) depending on the complexity of the struct\n\tFIELDS = Struct.fields;\n\n\t/**\n\t* Constructor which returns an array having a fixed-width composite data type.\n\t*\n\t* @private\n\t* @constructor\n\t* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n\t* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n\t* @param {NonNegativeInteger} [length] - view length\n\t* @throws {TypeError} must provide a valid first argument\n\t* @throws {TypeError} second argument must be a nonnegative integer\n\t* @throws {TypeError} third argument must be a nonnegative integer\n\t* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n\t* @throws {RangeError} second argument must be a multiple of struct byte length\n\t* @throws {RangeError} second argument must not exceeds the ArrayBuffer bounds\n\t* @throws {TypeError} view length must be a positive multiple of struct byte length\n\t* @throws {TypeError} an input array must contain valid elements\n\t* @returns {StructArray} struct array instance\n\t*/\n\tfunction StructArray( arg, byteOffset, length ) {\n\t\tvar nargs;\n\t\tvar buf;\n\t\tvar len;\n\t\tvar tmp;\n\n\t\tnargs = arguments.length;\n\t\tif ( !( this instanceof StructArray) ) {\n\t\t\tif ( nargs === 0 ) {\n\t\t\t\treturn new StructArray();\n\t\t\t}\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\treturn new StructArray( arg );\n\t\t\t}\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\treturn new StructArray( arg, byteOffset );\n\t\t\t}\n\t\t\treturn new StructArray( arg, byteOffset, length );\n\t\t}\n\n\t\t// Case: new StructArray()\n\t\tif ( nargs === 0 ) {\n\t\t\tbuf = new ArrayBuffer( 0 );\n\t\t\tlen = 0;\n\t\t}\n\t\t// Case: new StructArray( arg )\n\t\telse if ( nargs === 1 ) {\n\t\t\t// Case: new StructArray( length )\n\t\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\t\tbuf = new ArrayBuffer( arg*BYTES_PER_ELEMENT );\n\t\t\t\tlen = arg;\n\t\t\t}\n\t\t\t// Case: new StructArray( collection )\n\t\t\telse if ( isCollection( arg ) ) {\n\t\t\t\tlen = arg.length;\n\t\t\t\tbuf = fromArray( Struct, new ArrayBuffer( len*BYTES_PER_ELEMENT ), arg );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Each element of a provided input array must be a valid object or a struct instance having the same layout as elements in the desired output array.' ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer )\n\t\t\telse if ( isArrayBuffer( arg ) ) {\n\t\t\t\tbuf = arg;\n\t\t\t\tlen = buf.byteLength / BYTES_PER_ELEMENT;\n\t\t\t\tif ( !isInteger( len ) ) {\n\t\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\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( iterable )\n\t\t\telse if ( isObject( arg ) ) {\n\t\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. First argument must be a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tbuf = arg[ ITERATOR_SYMBOL ]();\n\t\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\ttmp = fromIterator( buf );\n\t\t\t\tlen = tmp.length;\n\t\t\t\tbuf = fromArray( Struct, new ArrayBuffer( len*BYTES_PER_ELEMENT ), tmp );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Each element of a provided input iterable must be either a valid object or a struct instance having the same layout as elements in the desired output array.' ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ???? )\n\t\t\telse {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t}\n\t\t// Case: new StructArray( ArrayBuffer, byteOffset[, length] )\n\t\telse {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t\t}\n\t\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Second argument must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t\t}\n\t\t\tif ( byteOffset >= buf.byteLength ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Second argument exceeds the bounds of the ArrayBuffer. Value: `%s`.', byteOffset ) );\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer, byteOffset )\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\tlen = ( buf.byteLength - byteOffset ) / BYTES_PER_ELEMENT;\n\t\t\t\tif ( !isInteger( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength-byteOffset ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer, byteOffset, length )\n\t\t\telse {\n\t\t\t\tlen = length;\n\t\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t\t}\n\t\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\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\t}\n\t\t\t}\n\t\t}\n\t\tsetReadOnly( this, '_buffer', buf );\n\t\tsetReadOnly( this, '_byteOffset', byteOffset || 0 );\n\t\tsetReadOnly( this, '_byteLength', len*BYTES_PER_ELEMENT );\n\t\tsetReadOnly( this, '_length', len );\n\t\treturn this;\n\t}\n\n\t/**\n\t* Size (in bytes) of each array element.\n\t*\n\t* @private\n\t* @name BYTES_PER_ELEMENT\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( StructArray, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n\t/**\n\t* Constructor name.\n\t*\n\t* @private\n\t* @name name\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {string}\n\t*/\n\tsetReadOnly( StructArray, 'name', CTOR_NAME );\n\n\t/**\n\t* Element constructor.\n\t*\n\t* @private\n\t* @name struct\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {Function}\n\t*/\n\tsetReadOnly( StructArray, 'struct', Struct );\n\n\t/**\n\t* Pointer to the underlying data buffer.\n\t*\n\t* @private\n\t* @name buffer\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {ArrayBuffer}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'buffer', function get() {\n\t\treturn this._buffer;\n\t});\n\n\t/**\n\t* Size (in bytes) of the array.\n\t*\n\t* @private\n\t* @name byteLength\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'byteLength', function get() {\n\t\treturn this._byteLength;\n\t});\n\n\t/**\n\t* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n\t*\n\t* @private\n\t* @name byteOffset\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'byteOffset', function get() {\n\t\treturn this._byteOffset;\n\t});\n\n\t/**\n\t* Size (in bytes) of each array element.\n\t*\n\t* @private\n\t* @name BYTES_PER_ELEMENT\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'BYTES_PER_ELEMENT', StructArray.BYTES_PER_ELEMENT );\n\n\t/**\n\t* Returns an array element.\n\t*\n\t* @private\n\t* @name get\n\t* @memberof StructArray.prototype\n\t* @type {Function}\n\t* @param {NonNegativeInteger} idx - element index\n\t* @throws {TypeError} `this` must be a struct array instance\n\t* @throws {TypeError} must provide a nonnegative integer\n\t* @returns {(*|void)} array element\n\t*/\n\tsetReadOnly( StructArray.prototype, 'get', function get( idx ) {\n\t\tif ( !isStructArray( this ) ) {\n\t\t\tthrow new TypeError( format( 'invalid invocation. `this` is not a %s.', CTOR_NAME ) );\n\t\t}\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tif ( idx >= this._length ) {\n\t\t\treturn;\n\t\t}\n\t\treturn new Struct( this._buffer, this._byteOffset+( idx*BYTES_PER_ELEMENT ), BYTES_PER_ELEMENT );\n\t});\n\n\t/**\n\t* Number of array elements.\n\t*\n\t* @private\n\t* @name length\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'length', function get() {\n\t\treturn this._length;\n\t});\n\n\t/**\n\t* Sets an array element.\n\t*\n\t* ## Notes\n\t*\n\t* - When provided a struct 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\t*\n\t* ```text\n\t* buf: ---------------------\n\t* src: ---------------------\n\t* ```\n\t*\n\t* 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\t*\n\t* In the other overlapping scenario,\n\t*\n\t* ```text\n\t* buf: ---------------------\n\t* src: ---------------------\n\t* ```\n\t*\n\t* 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\t*\n\t* @private\n\t* @name set\n\t* @memberof StructArray.prototype\n\t* @type {Function}\n\t* @param {(Collection|StructArray|Struct|Object)} value - value(s)\n\t* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n\t* @throws {TypeError} `this` must be a struct array instance\n\t* @throws {TypeError} index argument must be a nonnegative integer\n\t* @throws {RangeError} index argument is out-of-bounds\n\t* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n\t* @throws {TypeError} must provide a valid object or a struct instance having the same layout as elements in the target array\n\t* @returns {void}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'set', function set( value ) {\n\t\tvar bbytes;\n\t\tvar sbytes;\n\t\tvar sbuf;\n\t\tvar opts;\n\t\tvar idx;\n\t\tvar buf;\n\t\tvar tmp;\n\t\tvar get;\n\t\tvar nb;\n\t\tvar N;\n\t\tvar s;\n\t\tvar f;\n\t\tvar i;\n\t\tvar j;\n\t\tif ( !isStructArray( this ) ) {\n\t\t\tthrow new TypeError( format( 'invalid invocation. `this` is not a %s.', CTOR_NAME ) );\n\t\t}\n\t\tbuf = this._buffer;\n\t\tif ( arguments.length > 1 ) {\n\t\t\tidx = arguments[ 1 ];\n\t\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t\t}\n\t\t} else {\n\t\t\tidx = 0;\n\t\t}\n\t\topts = {\n\t\t\t'format': 'layout'\n\t\t};\n\t\tnb = Struct.byteLength;\n\n\t\tif ( isCollection( value ) && !contains( FIELDS, 'length' ) ) { // note: when one of the fields is 'length', we always assume that a provided value with a 'length' property is a struct and/or data object as there doesn't seem to be a surefire way to distinguish such an object from a regular array-like object (including accessor arrays)\n\t\t\tN = value.length;\n\t\t\tif ( idx+N > 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\t\t\tif ( sbuf.get && sbuf.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// Check for overlapping memory...\n\t\t\tj = this._byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf &&\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// FIXME: add optimization when `value` is a StructArray sharing the same buffer and having the same layout; in which case, we can simply copy `src` bytes to a temporary array and then copy those bytes into the target array, without needing to intermediate struct instance materialization\n\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = [];\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp.push( get( value, i ) );\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\tfor ( i = 0; i < N; idx++, i++ ) {\n\t\t\t\tthis.set( get( sbuf, i ), idx ); // note: this likely isn't the most performant approach, but it avoids having to replicate branching logic for handling struct instances vs data objects\n\t\t\t}\n\t\t\treturn;\n\t\t}\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\tif ( !isObject( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide either a valid object or a struct instance. Value: `%s`.', value ) );\n\t\t}\n\t\t// Check for a struct instance having a matching layout...\n\t\tif ( value.toString( opts ) === LAYOUT ) {\n\t\t\t// Explicitly copy the bytes of the input struct instance to the corresponding array element...\n\t\t\tsbuf = Struct.viewOf( value );\n\t\t\tsbytes = new Uint8Array( sbuf.buffer, sbuf.byteOffset, nb );\n\t\t\tbbytes = new Uint8Array( buf, this._byteOffset+( idx*BYTES_PER_ELEMENT ), nb );\n\t\t\tgcopy( nb, sbytes, 1, 0, bbytes, 1, 0 );\n\t\t\treturn;\n\t\t}\n\t\t// Create a struct instance view for the target element:\n\t\ts = new Struct( buf, this._byteOffset+( idx*BYTES_PER_ELEMENT ), nb );\n\n\t\t// Assign field values from the input object (accounting for both own and inherited properties)...\n\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\tf = FIELDS[ i ];\n\t\t\tif ( hasProp( value, f ) ) {\n\t\t\t\ts[ f ] = value[ f ];\n\t\t\t}\n\t\t}\n\t});\n\n\t/**\n\t* Element constructor.\n\t*\n\t* @private\n\t* @name struct\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {Function}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'struct', Struct );\n\n\treturn StructArray;\n\n\t/**\n\t* Returns a boolean indicating if a value is a struct array.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating if a value is a struct array\n\t*/\n\tfunction isStructArray( value ) {\n\t\treturn (\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === CTOR_NAME ||\n\t\t\t\tisPrototypeOf( value, StructArray.prototype )\n\t\t\t) &&\n\t\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t\t);\n\t}\n}\n\n\n// EXPORTS //\n\nexport default factory;\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* 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( 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// MAIN //\n\nvar ctor = require( 'buffer' ).Buffer;\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* Buffer constructor.\n*\n* @module @stdlib/buffer-ctor\n*\n* @example\n* import ctor from '@stdlib/buffer-ctor';\n*\n* var b = new ctor( [ 1, 2, 3, 4 ] );\n* // returns \n*/\n\n// MODULES //\n\nimport hasNodeBufferSupport from '@stdlib/assert-has-node-buffer-support';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasNodeBufferSupport() ) {\n\tctor = main;\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// TODO: write (browser) polyfill\n\n// MAIN //\n\n/**\n* Buffer constructor.\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) 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 Buffer from '@stdlib/buffer-ctor';\nimport Float64Array from '@stdlib/array-float64';\nimport Float32Array from '@stdlib/array-float32';\nimport Int16Array from '@stdlib/array-int16';\nimport Int32Array from '@stdlib/array-int32';\nimport Int8Array from '@stdlib/array-int8';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// FUNCTIONS //\n\n/**\n* Throws an error.\n*\n* @private\n* @throws {Error} not implemented\n*/\nfunction notImplemented() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// MAIN //\n\n// Mapping from data types to underlying buffer constructors...\nvar ctors = { // eslint-disable-line vars-on-top\n\t'binary': Buffer,\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'float16': notImplemented, // FIXME: replace with Float16Array constructor once implemented\n\t'generic': Array, // TODO: replace with `stdlib` pkg\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex32': notImplemented, // FIXME: replace with Complex32Array constructor once implemented\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array,\n\t'bool': BooleanArray\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport structFactory from '@stdlib/array-struct-factory';\nimport table from './ctors.js';\n\n\n// VARIABLES //\n\n// Initialize a cache to storing memoized struct array constructors:\nvar CACHE = {}; // TODO: consider adding/using `@stdlib/array/memoized-struct-factory`; should we need to memoize struct array constructors elsewhere, we should centralize that logic, rather than have multiple caches.\n\n\n// MAIN //\n\n/**\n* Returns an ndarray data buffer constructor.\n*\n* @param {*} dtype - data type\n* @returns {(Function|null)} data buffer constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\tvar struct;\n\tvar ctor;\n\tvar key;\n\n\t// Case: string || dtype_instance_with_string\n\tif ( !isFunction( dtype ) ) {\n\t\tkey = resolveStr( dtype );\n\t\tctor = table[ key ] || null;\n\t\tif ( ctor ) {\n\t\t\treturn ctor;\n\t\t}\n\t}\n\t// Case: struct_ctor || dtype_instance_with_struct_ctor\n\tif ( isStructDataType( dtype ) ) {\n\t\tif ( key ) {\n\t\t\t// Data type instance (note: we assume that `key === struct.layout`):\n\t\t\tstruct = dtype.value;\n\t\t} else {\n\t\t\t// Struct constructor:\n\t\t\tstruct = dtype;\n\t\t\tkey = struct.layout;\n\t\t}\n\t\tctor = CACHE[ key ];\n\t\tif ( ctor ) {\n\t\t\treturn ctor;\n\t\t}\n\t\tctor = structFactory( struct );\n\t\tCACHE[ key ] = ctor;\n\t\treturn ctor;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Allocate a buffer having a specified number of bytes.\n*\n* @module @stdlib/buffer-alloc-unsafe\n*\n* @example\n* import allocUnsafe from '@stdlib/buffer-alloc-unsafe';\n*\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasAllocUnsafe from './has_alloc_unsafe.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar allocUnsafe;\nif ( hasAllocUnsafe ) {\n\tallocUnsafe = main;\n} else {\n\tallocUnsafe = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\nvar bool = isFunction( Buffer.allocUnsafe );\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 isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport format from '@stdlib/string-format';\nimport Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\n/**\n* Allocates a buffer having a specified number of bytes.\n*\n* ## Notes\n*\n* - The underlying memory of returned `Buffer` instances is not initialized. Memory contents are unknown and may contain sensitive data.\n* - When the size is less than half the pool size (specified on the `Buffer` constructor), memory is allocated from the `Buffer` pool for faster allocation of new `Buffer` instances.\n*\n* @param {NonNegativeInteger} size - number of bytes to allocate\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {Buffer} new `Buffer` instance\n*\n* @example\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\nfunction allocUnsafe( size ) {\n\tif ( !isNonNegativeInteger( size ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', size ) );\n\t}\n\treturn Buffer.allocUnsafe( size );\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport format from '@stdlib/string-format';\nimport Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\n/**\n* Allocates a buffer having a specified number of bytes.\n*\n* ## Notes\n*\n* - The underlying memory of returned `Buffer` instances is not initialized. Memory contents are unknown and may contain sensitive data.\n* - When the size is less than half the pool size (specified on the `Buffer` constructor), memory is allocated from the `Buffer` pool for faster allocation of new `Buffer` instances.\n*\n* @param {NonNegativeInteger} size - number of bytes to allocate\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {Buffer} new `Buffer` instance\n*\n* @example\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\nfunction allocUnsafe( size ) {\n\tif ( !isNonNegativeInteger( size ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', size ) );\n\t}\n\treturn new Buffer( size );\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport bufferCtors from '@stdlib/ndarray-base-buffer-ctors';\nimport allocUnsafe from '@stdlib/buffer-alloc-unsafe';\nimport zeros from '@stdlib/array-base-zeros';\nimport fill from '@stdlib/array-base-fill';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a zero-filled binary buffer.\n*\n* @private\n* @param {NonNegativeInteger} size - buffer size\n* @returns {Buffer} zero-filled binary buffer\n*/\nfunction binary( size ) {\n\treturn fill( allocUnsafe( size ), 0, 0, size );\n}\n\n/**\n* Returns a typed array.\n*\n* @private\n* @param {*} dtype - data type\n* @param {NonNegativeInteger} size - buffer size\n* @returns {(TypedArray|null)} typed array\n*/\nfunction typedarray( dtype, size ) {\n\tvar ctor = bufferCtors( dtype );\n\tif ( ctor ) {\n\t\treturn new ctor( size );\n\t}\n\treturn null;\n}\n\n\n// MAIN //\n\n/**\n* Returns a contiguous linear ndarray data buffer.\n*\n* @param {*} dtype - data type\n* @param {NonNegativeInteger} size - buffer size\n* @returns {(Array|TypedArray|Buffer|null)} data buffer\n*\n* @example\n* var buf = buffer( 'float64', 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\nfunction buffer( dtype, size ) {\n\tvar dt = resolveStr( dtype );\n\tif ( dt === 'generic' ) {\n\t\treturn zeros( size );\n\t}\n\tif ( dt === 'binary' ) {\n\t\treturn binary( size );\n\t}\n\treturn typedarray( dtype, size );\n}\n\n\n// EXPORTS //\n\nexport default buffer;\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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'fill' );\n* // e.g., returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Fills all elements within a portion of an indexed array with a specified value.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = indexed( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*/\nfunction indexed( x, value, start, end ) {\n\tvar i;\n\tfor ( i = start; i < end; i++ ) {\n\t\tx[ i ] = value;\n\t}\n\treturn x;\n}\n\n/**\n* Fills all elements within a portion of an accessor array with a specified value.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {AccessorArray} modified input 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 x = toAccessorArray( [ 1, 2, 3, 4 ] );\n* var obj = arraylike2object( x );\n*\n* var out = accessors( obj, 5, 1, 3 );\n* // returns \n*\n* var v = x.get( 0 );\n* // returns 1\n*\n* v = x.get( 1 );\n* // returns 5\n*\n* v = x.get( 2 );\n* // returns 5\n*\n* v = x.get( 3 );\n* // returns 4\n*/\nfunction accessors( x, value, start, end ) {\n\tvar data;\n\tvar set;\n\tvar i;\n\n\tdata = x.data;\n\tset = x.accessors[ 1 ];\n\tfor ( i = start; i < end; i++ ) {\n\t\tset( data, i, value );\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills all elements within a portion of an array with a specified value.\n*\n* @param {Collection} x - input array\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = fill( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*\n* var bool = ( out === x );\n* // returns true\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = fill( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*\n* var bool = ( out === x );\n* // returns true\n*/\nfunction fill( x, value, start, end ) {\n\tvar obj;\n\tif ( hasMethod( x, 'fill' ) ) {\n\t\treturn x.fill( value, start, end );\n\t}\n\tif ( start < 0 ) {\n\t\tstart += x.length;\n\t\tif ( start < 0 ) {\n\t\t\tstart = 0;\n\t\t}\n\t}\n\tif ( end < 0 ) {\n\t\tend += x.length; // if `end` is still negative, that is fine, as `x` will be returned un-mutated\n\t} else if ( end > x.length ) {\n\t\tend = x.length;\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, value, start, end );\n\t}\n\treturn indexed( x, value, start, end );\n}\n\n\n// EXPORTS //\n\nexport default fill;\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 isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport isComplexDataType from '@stdlib/ndarray-base-assert-is-complex-floating-point-data-type';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport zeros from '@stdlib/array-base-zeros';\nimport buffer from '@stdlib/ndarray-base-buffer';\nimport ndarray from '@stdlib/ndarray-base-ctor';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Broadcasts a scalar value to an ndarray having a specified shape.\n*\n* @param {*} value - scalar value\n* @param {*} dtype - output array data type\n* @param {NonNegativeIntegerArray} shape - output array shape\n* @param {string} order - memory layout (either row-major or column-major)\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {ndarray} ndarray\n*\n* @example\n* import getShape from '@stdlib/ndarray-shape';\n* import getDType from '@stdlib/ndarray-dtype';\n*\n* var x = broadcastScalar( 1.0, 'float64', [ 2, 2 ], 'row-major' );\n* // returns \n*\n* var sh = getShape( x );\n* // returns [ 2, 2 ]\n*\n* var dt = String( getDType( x ) );\n* // returns 'float64'\n*\n* var v = x.get( 0, 1 );\n* // returns 1.0\n*/\nfunction broadcastScalar( value, dtype, shape, order ) {\n\tvar buf;\n\tvar set;\n\tvar N;\n\n\tbuf = buffer( dtype, 1 );\n\tif ( buf === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tdtype = resolveStr( dtype );\n\tif ( isComplexDataType( dtype ) && isNumber( value ) ) {\n\t\tvalue = [ value, 0.0 ]; // note: we're assuming that the ComplexXXArray setter accepts an array of interleaved real and imaginary components\n\t}\n\tif ( isAccessorArray( buf ) ) {\n\t\tset = accessorSetter( dtype );\n\t} else {\n\t\tset = setter( dtype );\n\t}\n\tset( buf, 0, value );\n\tN = shape.length || 1;\n\treturn new ndarray( dtype, buf, shape, zeros( N ), 0, order );\n}\n\n\n// EXPORTS //\n\nexport default broadcastScalar;\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 resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// MAIN //\n\n/**\n* Resolves a list of data type strings.\n*\n* ## Notes\n*\n* - If the function is unable to resolve a data type string for a provided data type, the corresponding element in the returned array will be `null`.\n*\n* @param {Array} dtypes - list of data types\n* @returns {Array} results\n*\n* @example\n* var out = dtypes2strings( [ 'float32', 'float64' ] );\n* // returns [...]\n*\n* @example\n* var out = dtypes2strings( [ 'foo', 'bar' ] );\n* // returns [ null, null ]\n*/\nfunction dtypes2strings( dtypes ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < dtypes.length; i++ ) {\n\t\tout.push( resolveStr( dtypes[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypes2strings;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray floating-point data type\n*\n* @example\n* var bool = isFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isFloatingPointDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'real_floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray real-valued floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray real-valued floating-point data type\n*\n* @example\n* var bool = isRealFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isRealFloatingPointDataType( v ) { // eslint-disable-line id-length\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isRealFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray integer data type\n*\n* @example\n* var bool = isIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint16' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint32' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint8' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint8c' );\n* // returns true\n*\n* bool = isIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'signed_integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray signed integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray signed integer data type\n*\n* @example\n* var bool = isSignedIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'uint16' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8c' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isSignedIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isSignedIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'unsigned_integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray unsigned integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray unsigned integer data type\n*\n* @example\n* var bool = isUnsignedIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int16' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int32' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int8' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'uint16' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint32' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint8' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint8c' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isUnsignedIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isUnsignedIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'real' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray real-valued data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray real-valued data type\n*\n* @example\n* var bool = isRealDataType( 'binary' );\n* // returns false\n*\n* bool = isRealDataType( 'float32' );\n* // returns true\n*\n* bool = isRealDataType( 'float64' );\n* // returns true\n*\n* bool = isRealDataType( 'complex128' );\n* // returns false\n*\n* bool = isRealDataType( 'generic' );\n* // returns false\n*\n* bool = isRealDataType( 'int16' );\n* // returns true\n*\n* bool = isRealDataType( 'int32' );\n* // returns true\n*\n* bool = isRealDataType( 'int8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint16' );\n* // returns true\n*\n* bool = isRealDataType( 'uint32' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8c' );\n* // returns true\n*\n* bool = isRealDataType( 'foo' );\n* // returns false\n*/\nfunction isRealDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isRealDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'numeric' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray numeric data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray numeric data type\n*\n* @example\n* var bool = isNumericDataType( 'binary' );\n* // returns false\n*\n* bool = isNumericDataType( 'float32' );\n* // returns true\n*\n* bool = isNumericDataType( 'float64' );\n* // returns true\n*\n* bool = isNumericDataType( 'generic' );\n* // returns false\n*\n* bool = isNumericDataType( 'int16' );\n* // returns true\n*\n* bool = isNumericDataType( 'int32' );\n* // returns true\n*\n* bool = isNumericDataType( 'int8' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint16' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint32' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint8' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint8c' );\n* // returns true\n*\n* bool = isNumericDataType( 'foo' );\n* // returns false\n*/\nfunction isNumericDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumericDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'boolean' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray boolean data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray boolean data type\n*\n* @example\n* var bool = isBooleanDataType( 'binary' );\n* // returns false\n*\n* bool = isBooleanDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanDataType( 'foo' );\n* // returns false\n*/\nfunction isBooleanDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isBooleanDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'integer_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray integer index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray integer index data type\n*\n* @example\n* var bool = isIntegerIndexDataType( 'binary' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'int32' );\n* // returns true\n*\n* bool = isIntegerIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint8' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isIntegerIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isIntegerIndexDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'boolean_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray boolean index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray boolean index data type\n*\n* @example\n* var bool = isBooleanIndexDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isBooleanIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isBooleanIndexDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'mask_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray mask index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray mask index data type\n*\n* @example\n* var bool = isMaskIndexDataType( 'binary' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint8' );\n* // returns true\n*\n* bool = isMaskIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isMaskIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isMaskIndexDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport PROMOTION_RULES from './promotion_rules.json';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of promotion rules.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( PROMOTION_RULES );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = PROMOTION_RULES[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns the ndarray data type with the smallest size and closest \"kind\" to which ndarray data types can be safely cast.\n*\n* @param {*} [dtype1] - ndarray data type value\n* @param {*} [dtype2] - ndarray data type value\n* @returns {(Object|integer|string|null)} promotion rule(s) or null\n*\n* @example\n* var table = promotionRules();\n* // returns {...}\n*\n* @example\n* var dt = promotionRules( 'float32', 'uint32' );\n* // returns 'float64'\n*\n* @example\n* var dt = promotionRules( 'binary', 'generic' );\n* // returns -1\n*\n* @example\n* var dt = promotionRules( 'float32', 'foo' );\n* // returns null\n*/\nfunction promotionRules( dtype1, dtype2 ) {\n\tvar o;\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tdtype1 = resolve( dtype1 );\n\tif ( hasOwnProp( PROMOTION_RULES, dtype1 ) ) {\n\t\to = PROMOTION_RULES[ dtype1 ];\n\t\tdtype2 = resolve( dtype2 );\n\t\tif ( hasOwnProp( o, dtype2 ) ) {\n\t\t\treturn o[ dtype2 ];\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default promotionRules;\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 promotionRules from '@stdlib/ndarray-promotion-rules';\n\n\n// MAIN //\n\n/**\n* Returns a data type that results from applying promotion rules to a provided list of data types.\n*\n* @param {StringArray} dtypes - list of data types\n* @returns {(string|null)} result\n*\n* @example\n* var dt = promoteDataTypes( [ 'float32', 'float64' ] );\n* // returns 'float64'\n*\n* @example\n* var dt = promoteDataTypes( [ 'binary', 'complex128' ] );\n* // returns null\n*/\nfunction promoteDataTypes( dtypes ) {\n\tvar dt;\n\tvar N;\n\tvar i;\n\n\tN = dtypes.length;\n\tif ( N === 0 ) {\n\t\treturn null;\n\t}\n\tdt = dtypes[ 0 ];\n\tfor ( i = 1; i < dtypes.length; i++ ) {\n\t\tdt = promotionRules( dt, dtypes[ i ] );\n\t\tif ( dt === null || dt === -1 ) {\n\t\t\treturn null;\n\t\t}\n\t}\n\treturn dt;\n}\n\n\n// EXPORTS //\n\nexport default promoteDataTypes;\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/**\n* Returns default ndarray settings.\n*\n* @returns {Object} defaults\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t// Data types:\n\t\t'dtypes': {\n\t\t\t'default': 'float64',\n\t\t\t'numeric': 'float64',\n\t\t\t'real': 'float64',\n\t\t\t'floating_point': 'float64',\n\t\t\t'real_floating_point': 'float64',\n\t\t\t'complex_floating_point': 'complex128',\n\t\t\t'integer': 'int32',\n\t\t\t'signed_integer': 'int32',\n\t\t\t'unsigned_integer': 'uint32',\n\t\t\t'boolean': 'bool',\n\t\t\t'index': 'int32',\n\t\t\t'integer_index': 'int32',\n\t\t\t'boolean_index': 'bool',\n\t\t\t'mask_index': 'uint8'\n\t\t},\n\n\t\t// Memory layout:\n\t\t'order': 'row-major',\n\n\t\t// Casting mode:\n\t\t'casting': 'safe',\n\n\t\t// Index mode:\n\t\t'index_mode': 'throw'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default defaults;\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 defaults from './main.js';\n\n\n// VARIABLES //\n\nvar DEFAULTS = defaults();\nvar HASH = {\n\t'dtypes.default': DEFAULTS.dtypes.default,\n\t'dtypes.numeric': DEFAULTS.dtypes.numeric,\n\t'dtypes.real': DEFAULTS.dtypes.real,\n\t'dtypes.floating_point': DEFAULTS.dtypes.floating_point,\n\t'dtypes.real_floating_point': DEFAULTS.dtypes.real_floating_point,\n\t'dtypes.complex_floating_point': DEFAULTS.dtypes.complex_floating_point,\n\t'dtypes.integer': DEFAULTS.dtypes.integer,\n\t'dtypes.signed_integer': DEFAULTS.dtypes.signed_integer,\n\t'dtypes.unsigned_integer': DEFAULTS.dtypes.unsigned_integer,\n\t'dtypes.boolean': DEFAULTS.dtypes.boolean,\n\t'dtypes.index': DEFAULTS.dtypes.index,\n\t'dtypes.integer_index': DEFAULTS.dtypes.integer_index,\n\t'dtypes.boolean_index': DEFAULTS.dtypes.boolean_index,\n\t'dtypes.mask_index': DEFAULTS.dtypes.mask_index,\n\t'order': DEFAULTS.order,\n\t'casting': DEFAULTS.casting,\n\t'index_mode': DEFAULTS.index_mode\n};\n\n\n// MAIN //\n\n/**\n* Returns a default ndarray setting.\n*\n* @param {string} name - setting name\n* @returns {*} default setting or null\n*\n* @example\n* var v = get( 'dtypes.default' );\n* // returns \n*/\nfunction get( name ) {\n\tvar v = HASH[ name ];\n\treturn ( v === void 0 ) ? null : v;\n}\n\n\n// EXPORTS //\n\nexport default get;\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/**\n* Return default ndarray settings.\n*\n* @module @stdlib/ndarray-defaults\n*\n* @example\n* import defaults from '@stdlib/ndarray-defaults';\n*\n* var o = defaults();\n* // returns {...}\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport get from './get.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'get', get );\n\n\n// EXPORTS //\n\nexport default main;\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 id-length */\n\n'use strict';\n\n// MODULES //\n\nimport isFloatingPointDataType from '@stdlib/ndarray-base-assert-is-floating-point-data-type';\nimport isRealFloatingPointDataType from '@stdlib/ndarray-base-assert-is-real-floating-point-data-type';\nimport isComplexFloatingPointDataType from '@stdlib/ndarray-base-assert-is-complex-floating-point-data-type';\nimport isIntegerDataType from '@stdlib/ndarray-base-assert-is-integer-data-type';\nimport isSignedIntegerDataType from '@stdlib/ndarray-base-assert-is-signed-integer-data-type';\nimport isUnsignedIntegerDataType from '@stdlib/ndarray-base-assert-is-unsigned-integer-data-type';\nimport isRealDataType from '@stdlib/ndarray-base-assert-is-real-data-type';\nimport isNumericDataType from '@stdlib/ndarray-base-assert-is-numeric-data-type';\nimport isBooleanDataType from '@stdlib/ndarray-base-assert-is-boolean-data-type';\nimport isIntegerIndexDataType from '@stdlib/ndarray-base-assert-is-integer-index-data-type';\nimport isBooleanIndexDataType from '@stdlib/ndarray-base-assert-is-boolean-index-data-type';\nimport isMaskIndexDataType from '@stdlib/ndarray-base-assert-is-mask-index-data-type';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport promoteDataTypes from '@stdlib/ndarray-base-promote-dtypes';\nimport defaults from '@stdlib/ndarray-defaults';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\nvar DEFAULT_INDEX_DTYPE = defaults.get( 'dtypes.default_index' );\nvar DEFAULT_SIGNED_INTEGER_DTYPE = defaults.get( 'dtypes.signed_integer' );\nvar DEFAULT_UNSIGNED_INTEGER_DTYPE = defaults.get( 'dtypes.unsigned_integer' );\nvar DEFAULT_REAL_FLOATING_POINT_DTYPE = defaults.get( 'dtypes.real_floating_point' );\nvar DEFAULT_COMPLEX_FLOATING_POINT_DTYPE = defaults.get( 'dtypes.complex_floating_point' );\n\n// Table where, for each respective policy, the value is a function which applies the policy to an input data type...\nvar POLICY_TABLE1 = {\n\t'default': defaultPolicy,\n\t'default_index': defaultIndexPolicy,\n\t'same': samePolicy,\n\t'promoted': promotedPolicy,\n\t'accumulation': accumulationPolicy\n};\n\n// Table where, for each respective policy, the value is an array whose first element is an assertion and whose second element is a fallback data type...\nvar POLICY_TABLE2 = {\n\t// Floating-point policies...\n\t'floating_point': [\n\t\tisFloatingPointDataType,\n\t\tdefaults.get( 'dtypes.floating_point' )\n\t],\n\t'floating_point_and_generic': [\n\t\twrap( isFloatingPointDataType ),\n\t\tdefaults.get( 'dtypes.floating_point' )\n\t],\n\t'real_floating_point': [\n\t\tisRealFloatingPointDataType,\n\t\tresolveDefaultRealFloatingPoint\n\t],\n\t'real_floating_point_and_generic': [\n\t\twrap( isRealFloatingPointDataType ),\n\t\tresolveDefaultRealFloatingPoint\n\t],\n\t'complex_floating_point': [\n\t\tisComplexFloatingPointDataType,\n\t\tresolveDefaultComplexFloatingPoint\n\t],\n\t'complex_floating_point_and_generic': [\n\t\twrap( isComplexFloatingPointDataType ),\n\t\tresolveDefaultComplexFloatingPoint\n\t],\n\n\t// Integer policies...\n\t'integer': [\n\t\tisIntegerDataType,\n\t\tdefaults.get( 'dtypes.integer' )\n\t],\n\t'integer_and_generic': [\n\t\twrap( isIntegerDataType ),\n\t\tdefaults.get( 'dtypes.integer' )\n\t],\n\t'signed_integer': [\n\t\tisSignedIntegerDataType,\n\t\tDEFAULT_SIGNED_INTEGER_DTYPE\n\t],\n\t'signed_integer_and_generic': [\n\t\twrap( isSignedIntegerDataType ),\n\t\tDEFAULT_SIGNED_INTEGER_DTYPE\n\t],\n\t'unsigned_integer': [\n\t\tisUnsignedIntegerDataType,\n\t\tDEFAULT_UNSIGNED_INTEGER_DTYPE\n\t],\n\t'unsigned_integer_and_generic': [\n\t\twrap( isUnsignedIntegerDataType ),\n\t\tDEFAULT_UNSIGNED_INTEGER_DTYPE\n\t],\n\n\t// Real-valued number policies...\n\t'real': [\n\t\tisRealDataType,\n\t\tdefaults.get( 'dtypes.real' )\n\t],\n\t'real_and_generic': [\n\t\twrap( isRealDataType ),\n\t\tdefaults.get( 'dtypes.real' )\n\t],\n\n\t// Real- and complex-valued number policies...\n\t'numeric': [\n\t\tisNumericDataType,\n\t\tdefaults.get( 'dtypes.numeric' )\n\t],\n\t'numeric_and_generic': [\n\t\twrap( isNumericDataType ),\n\t\tdefaults.get( 'dtypes.numeric' )\n\t],\n\n\t// Boolean policies...\n\t'boolean': [\n\t\tisBooleanDataType,\n\t\tdefaults.get( 'dtypes.boolean' )\n\t],\n\t'boolean_and_generic': [\n\t\twrap( isBooleanDataType ),\n\t\tdefaults.get( 'dtypes.boolean' )\n\t],\n\n\t// Index policies...\n\t'integer_index': [\n\t\tisIntegerIndexDataType,\n\t\tdefaults.get( 'dtypes.integer_index' )\n\t],\n\t'integer_index_and_generic': [\n\t\twrap( isIntegerIndexDataType ),\n\t\tdefaults.get( 'dtypes.integer_index' )\n\t],\n\t'boolean_index': [\n\t\tisBooleanIndexDataType,\n\t\tdefaults.get( 'dtypes.boolean_index' )\n\t],\n\t'boolean_index_and_generic': [\n\t\twrap( isBooleanIndexDataType ),\n\t\tdefaults.get( 'dtypes.boolean_index' )\n\t],\n\t'mask_index': [\n\t\tisMaskIndexDataType,\n\t\tdefaults.get( 'dtypes.mask_index' )\n\t],\n\t'mask_index_and_generic': [\n\t\twrap( isMaskIndexDataType ),\n\t\tdefaults.get( 'dtypes.mask_index' )\n\t]\n};\n\n// Table mapping complex-valued floating-point data types to real-valued floating-point data types having the same precision:\nvar COMPLEX2FLOAT = {\n\t'complex128': 'float64',\n\t'complex64': 'float32',\n\t'complex32': 'float16'\n};\n\n// Table mapping real-valued floating-point data types to complex-valued floating-point data types having the same precision:\nvar FLOAT2COMPLEX = {\n\t'float64': 'complex128',\n\t'float32': 'complex64',\n\t'float16': 'complex32'\n};\n\n\n// FUNCTIONS //\n\n/**\n* Wraps a data type validation function to also check for a \"generic\" data type.\n*\n* @private\n* @param {Function} fcn - validation function\n* @returns {Function} wrapped validation function\n*/\nfunction wrap( fcn ) {\n\treturn wrapper;\n\n\t/**\n\t* Tests whether a provided data type is either \"generic\" or satisfies a data type validation function.\n\t*\n\t* @private\n\t* @param {*} value - input value\n\t* @returns {boolean} boolean indicating whether a provided value passes a test\n\t*/\n\tfunction wrapper( value ) {\n\t\treturn ( value === 'generic' ) || fcn( value );\n\t}\n}\n\n/**\n* Returns the default data type.\n*\n* @private\n* @returns {string} output ndarray data type\n*/\nfunction defaultPolicy() {\n\t// When the policy is \"default\", the output data type should always be the default data type without consideration for the input data types:\n\treturn DEFAULT_DTYPE;\n}\n\n/**\n* Returns the default index data type.\n*\n* @private\n* @returns {string} output ndarray data type\n*/\nfunction defaultIndexPolicy() {\n\t// When the policy is \"default_index\", the output data type should always be the default index data type without consideration for the input data types:\n\treturn DEFAULT_INDEX_DTYPE;\n}\n\n/**\n* Applies the \"same\" policy by returning the common input data type.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} invalid data types\n* @returns {string} output ndarray data type\n*/\nfunction samePolicy( dtypes ) {\n\tvar dt;\n\tvar i;\n\n\tdt = dtypes[ 0 ];\n\tfor ( i = 1; i < dtypes.length; i++ ) {\n\t\t// When the policy is \"same\", we require that all data types (both input and output) be the same...\n\t\tif ( dtypes[ i ] !== dt ) {\n\t\t\tthrow new Error( format( 'invalid argument. Unable to resolve an output data type. The output data type policy is \"same\" and yet the input data types are not equal. Data types: [%s].', join( dtypes, ', ' ) ) );\n\t\t}\n\t}\n\treturn dt;\n}\n\n/**\n* Applies the \"promoted\" policy by applying type promotion to the list of provided data types.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} must provide data types which can be safely cast to a common data type\n* @returns {string} output ndarray data type\n*/\nfunction promotedPolicy( dtypes ) {\n\tvar dt = promoteDataTypes( dtypes );\n\tif ( dt === null ) {\n\t\tthrow new Error( format( 'invalid argument. Unable to apply type promotion rules when resolving a data type to which the input data types can be safely cast. Data types: [%s].', join( dtypes, ', ' ) ) );\n\t}\n\treturn dt;\n}\n\n/**\n* Applies the \"accumulation\" policy to the list of input data types.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} must provide data types which can be safely cast to a common data type\n* @returns {string} output ndarray data type\n*/\nfunction accumulationPolicy( dtypes ) {\n\tvar dt = promotedPolicy( dtypes );\n\n\t// If the promoted data type is floating-point, allow accumulation in that data type as overflow/underflow is handled naturally as a built-in feature of that data type...\n\tif ( isFloatingPointDataType( dt ) || dt === 'generic' ) { // NOTE: we may want to revisit this in the future for float16/complex32, where the value range is much more limited\n\t\treturn dt;\n\t}\n\t// Unless the promoted data type value range is larger than the default un/signed integer data type, accumulate in the default un/signed integer data type, as accumulating in small range integer data types (e.g., `int8`) is at high risk for overflow, especially for ndarrays containing many elements...\n\tif ( isUnsignedIntegerDataType( dt ) ) {\n\t\treturn promoteDataTypes( [ dt, DEFAULT_UNSIGNED_INTEGER_DTYPE ] );\n\t}\n\tif ( isSignedIntegerDataType( dt ) ) {\n\t\treturn promoteDataTypes( [ dt, DEFAULT_SIGNED_INTEGER_DTYPE ] );\n\t}\n\t// For all other data types, accumulate in the default real-valued floating-point data type...\n\treturn DEFAULT_REAL_FLOATING_POINT_DTYPE;\n}\n\n/**\n* Resolves a default real-valued floating-point data type which preserves floating-point precision.\n*\n* @private\n* @param {string} dtype - input ndarray data type\n* @returns {string} output ndarray data type\n*/\nfunction resolveDefaultRealFloatingPoint( dtype ) {\n\treturn COMPLEX2FLOAT[ dtype ] || DEFAULT_REAL_FLOATING_POINT_DTYPE;\n}\n\n/**\n* Resolves a default complex-valued floating-point data type which preserves floating-point precision.\n*\n* @private\n* @param {string} dtype - input ndarray data type\n* @returns {string} output ndarray data type\n*/\nfunction resolveDefaultComplexFloatingPoint( dtype ) {\n\treturn FLOAT2COMPLEX[ dtype ] || DEFAULT_COMPLEX_FLOATING_POINT_DTYPE;\n}\n\n\n// MAIN //\n\n/**\n* Resolves the output data type from a list of input ndarray data types.\n*\n* @param {StringArray} dtypes - list of input ndarray data types\n* @param {string} policy - output ndarray data type policy\n* @throws {TypeError} second argument must be a recognized data type policy\n* @throws {Error} unexpected error\n* @returns {string} output ndarray data type\n*\n* @example\n* var dt = resolve( [ 'float64' ], 'complex_floating_point' );\n* // returns \n*/\nfunction resolve( dtypes, policy ) {\n\tvar dt;\n\tvar p;\n\n\t// First, check whether the policy mandates that the output data type always be a specific data type...\n\tif ( isDataType( policy ) ) {\n\t\treturn policy;\n\t}\n\t// Next, check whether the policy is one in which we may be able to avoid type promotion...\n\tp = POLICY_TABLE1[ policy ];\n\tif ( p !== void 0 ) {\n\t\treturn p( dtypes );\n\t}\n\t// For all other policies, we always apply type promotion rules...\n\tdt = promotedPolicy( dtypes );\n\n\t// Check whether the policy requires determining the data type \"kind\"...\n\tp = POLICY_TABLE2[ policy ];\n\tif ( p !== void 0 ) {\n\t\t// Check whether the promoted data type belongs to the data type \"kind\"...\n\t\tif ( p[ 0 ]( dt ) ) {\n\t\t\t// If so, we can just return the promoted data type:\n\t\t\treturn dt;\n\t\t}\n\t\t// Otherwise, we need to fallback to a default data type belonging to that \"kind\"...\n\t\tif ( isString( p[ 1 ] ) ) {\n\t\t\treturn p[ 1 ];\n\t\t}\n\t\treturn p[ 1 ]( dt );\n\t}\n\tthrow new TypeError( format( 'invalid argument. Second argument must be a supported data type policy. Value: `%s`.', policy ) );\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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 outputDataType from '@stdlib/ndarray-base-output-dtype';\n\n\n// MAIN //\n\n/**\n* Resolves the output ndarray data type for a binary function.\n*\n* @param {*} xdtype - first input ndarray data type\n* @param {*} ydtype - second input ndarray data type\n* @param {(string|*)} policy - output ndarray data type policy\n* @throws {TypeError} third argument must be a recognized data type policy\n* @throws {Error} must provide data types amenable to type promotion\n* @returns {DataType} output ndarray data type\n*\n* @example\n* var dt = resolve( 'float64', 'float32', 'complex_floating_point' );\n* // returns \n*/\nfunction resolve( xdtype, ydtype, policy ) {\n\treturn outputDataType( [ xdtype, ydtype ], policy );\n}\n\n\n// EXPORTS //\n\nexport default resolve;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray data type\n*\n* @example\n* var bool = isDataType( 'binary' );\n* // returns true\n*\n* bool = isDataType( 'float32' );\n* // returns true\n*\n* bool = isDataType( 'float64' );\n* // returns true\n*\n* bool = isDataType( 'generic' );\n* // returns true\n*\n* bool = isDataType( 'int16' );\n* // returns true\n*\n* bool = isDataType( 'int32' );\n* // returns true\n*\n* bool = isDataType( 'int8' );\n* // returns true\n*\n* bool = isDataType( 'uint16' );\n* // returns true\n*\n* bool = isDataType( 'uint32' );\n* // returns true\n*\n* bool = isDataType( 'uint8' );\n* // returns true\n*\n* bool = isDataType( 'uint8c' );\n* // returns true\n*\n* bool = isDataType( 'foo' );\n* // returns false\n*/\nfunction isDataType( v ) {\n\treturn (\n\t\tisDataTypeString( v ) ||\n\t\tisDataTypeObject( v ) ||\n\t\tisStructDataType( v )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataType;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\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 isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray having a supported data type\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\tvar dt;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tdt = x.dtype;\n\tif ( isDataType( dt ) ) {\n\t\treturn dt;\n\t}\n\t// A data type is essential for interpreting the memory associated with an ndarray object, so no fallbacks or workarounds for data type resolution...\n\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray having a supported data type. Value: `%s`.', dt ) );\n}\n\n\n// EXPORTS //\n\nexport default dtype;\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 isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the number of ndarray dimensions.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {NonNegativeInteger} number of dimensions\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = ndims( zeros( [ 3, 3, 3 ] ) );\n* // returns 3\n*/\nfunction ndims( x ) {\n\tvar sh;\n\tvar n;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tn = x.ndims;\n\tif ( isNonNegativeInteger( n ) ) {\n\t\treturn n;\n\t}\n\tsh = x.shape;\n\tif ( !isCollection( sh ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\treturn sh.length;\n}\n\n\n// EXPORTS //\n\nexport default ndims;\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 isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport strides from '@stdlib/ndarray-strides';\nimport ndims from '@stdlib/ndarray-ndims';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport format from '@stdlib/string-format';\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* @throws {TypeError} must provide an 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\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\to = x.order;\n\tif ( isOrder( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = strides( x );\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 ( ndims( x ) === 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) 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 isInteger } from '@stdlib/assert-is-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ) );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x ) {\n\tvar out;\n\tvar ord;\n\tvar sh;\n\tvar st;\n\tvar d;\n\tvar i;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tst = x.strides; // TODO: consider whether we want to support ecosystem libraries, such as scijs/ndarray, which name this property `stride`\n\tif ( !isCollection( st ) ) {\n\t\t// WARNING: if no strides array, try to derive the strides from the shape. Note, however, that there is a lot that can go wrong here, as the only thing we are requiring is that the shape is a collection. The main point of going through the effort to compute strides is to support minimal ndarray-esque objects, where the only essential attributes are `shape` and `dtype` and where other attributes can be computed (e.g., `strides`, `offset`, `ndims`, `order`, etc), assuming single-segment contiguous data stored in row-major order...\n\t\tsh = x.shape;\n\t\tif ( !isCollection( sh ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isOrder( ord ) ) {\n\t\t\tord = 'row-major';\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\t// Copy the strides in order to avoid unintended mutation...\n\tout = [];\n\tfor ( i = 0; i < st.length; i++ ) {\n\t\td = st[ i ];\n\t\tif ( !isInteger( d ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tout.push( d );\n\t}\n\treturn out;\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* Test if a value is an array-like object containing only integers.\n*\n* @module @stdlib/assert-is-integer-array\n*\n* @example\n* import isIntegerArray from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ -3.0, new Number(0.0), 2.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -3.0, '3.0' ] );\n* // returns false\n*\n* @example\n* import { primitives as isIntegerArray } from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ -1.0, 10.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -1.0, 0.0, 5.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -3.0, new Number(-1.0) ] );\n* // returns false\n*\n* @example\n* import { objects as isIntegerArray } from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ new Number(1.0), new Number(3.0) ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -1.0, 0.0, 3.0 ] );\n* // returns false\n*\n* bool = isIntegerArray( [ 3.0, new Number(-1.0) ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport isInteger from '@stdlib/assert-is-integer';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-like-function';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isInteger.isPrimitive );\nvar isObjectArray = arrayfun( isInteger.isObject );\n\n\n// MAIN //\n\nvar isIntegerArray = arrayfun( isInteger );\nsetReadOnly( isIntegerArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isIntegerArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isIntegerArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests that a value is a valid constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {(Error|null)} error object or null\n*\n* @example\n* var ctor = function ctor() {};\n*\n* var err = validate( ctor );\n* // returns null\n*\n* err = validate( null );\n* // returns \n*/\nfunction validate( value ) {\n\tvar type = typeof value;\n\tif (\n\t\tvalue === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\treturn new TypeError( format( 'invalid argument. A provided constructor must be either an object (except null) or a function. Value: `%s`.', value ) );\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 Object.create;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Dummy constructor.\n*\n* @private\n*/\nfunction Ctor() {\n\t// Empty...\n}\n\n\n// MAIN //\n\n/**\n* An `Object.create` shim for older JavaScript engines.\n*\n* @private\n* @param {Object} proto - prototype\n* @returns {Object} created object\n*\n* @example\n* var obj = createObject( Object.prototype );\n* // returns {}\n*/\nfunction createObject( proto ) {\n\tCtor.prototype = proto;\n\treturn new Ctor();\n}\n\n\n// EXPORTS //\n\nexport default createObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar createObject;\nif ( typeof builtin === 'function' ) {\n\tcreateObject = builtin;\n} else {\n\tcreateObject = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default createObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Restricts an index to the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {NonNegativeInteger} index\n*\n* @example\n* var idx = clampIndex( -1, 10 );\n* // returns 0\n*\n* idx = clampIndex( 15, 10 );\n* // returns 10\n*\n* idx = clampIndex( 5, 10 );\n* // returns 5\n*/\nfunction clampIndex( idx, max ) {\n\tif ( idx < 0 ) {\n\t\treturn 0;\n\t}\n\tif ( idx > max ) {\n\t\treturn max;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default clampIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Wraps an index on the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {NonNegativeInteger} index\n*\n* @example\n* var idx = wrapIndex( -1, 10 );\n* // returns 10\n*\n* idx = wrapIndex( 13, 10 );\n* // returns 2\n*\n* idx = wrapIndex( 6, 10 );\n* // returns 6\n*/\nfunction wrapIndex( idx, max ) {\n\tvar mp1 = max + 1;\n\tif ( idx < 0 ) {\n\t\tidx += mp1; // slight optimization to avoid modulo arithmetic when |idx| <= max+1\n\t\tif ( idx < 0 ) {\n\t\t\tidx %= mp1;\n\t\t\tif ( idx !== 0 ) {\n\t\t\t\tidx += mp1;\n\t\t\t}\n\t\t}\n\t\treturn idx;\n\t}\n\tif ( idx > max ) {\n\t\tidx -= mp1; // slight optimization to avoid modulo arithmetic when max+1 < idx <= 2*(max+1)\n\t\tif ( idx > max ) {\n\t\t\tidx %= mp1;\n\t\t}\n\t\treturn idx;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default wrapIndex;\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* Normalizes an index to the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {integer} index\n*\n* @example\n* var idx = normalizeIndex( -2, 10 );\n* // returns 9\n*\n* idx = normalizeIndex( 15, 10 );\n* // returns -1\n*\n* idx = normalizeIndex( 5, 10 );\n* // returns 5\n*/\nfunction normalizeIndex( idx, max ) {\n\tif ( idx < 0 ) {\n\t\tidx += max + 1;\n\t\tif ( idx < 0 ) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn idx;\n\t}\n\tif ( idx > max ) {\n\t\treturn -1;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default normalizeIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport modes from '@stdlib/ndarray-index-modes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray index mode.\n*\n* @name isIndexMode\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray index mode\n*\n* @example\n* var bool = isIndexMode( 'wrap' );\n* // returns true\n*\n* bool = isIndexMode( 'clamp' );\n* // returns true\n*\n* bool = isIndexMode( 'throw' );\n* // returns true\n*\n* bool = isIndexMode( 'foo' );\n* // returns false\n*/\nvar isIndexMode = contains( modes() );\n\n\n// EXPORTS //\n\nexport default isIndexMode;\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 clampIndex from '@stdlib/ndarray-base-clamp-index';\nimport wrapIndex from '@stdlib/ndarray-base-wrap-index';\nimport normalize from '@stdlib/ndarray-base-normalize-index';\nimport isIndexMode from '@stdlib/ndarray-base-assert-is-index-mode';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar TABLE = {\n\t'wrap': wrapIndex,\n\t'clamp': clampIndex,\n\t'normalize': normalizeIndex,\n\t'throw': throwIfOutOfBounds\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an index if within bounds and throw an error otherwise.\n*\n* @private\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = throwIfOutOfBounds( 2, 9 );\n* // returns 2\n*\n* idx = throwIfOutOfBounds( 10, 9 );\n* // throws \n*\n* idx = throwIfOutOfBounds( -1, 9 );\n* // throws \n*/\nfunction throwIfOutOfBounds( idx, max ) {\n\tif ( idx < 0 || idx > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn idx;\n}\n\n/**\n* Normalizes an index before performing a strict bounds check.\n*\n* @private\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = normalizeIndex( 1, 10 );\n* // returns 1\n*\n* idx = normalizeIndex( -4, 10 );\n* // returns 7\n*\n* idx = normalizeIndex( -100, 10 );\n* // throws \n*/\nfunction normalizeIndex( idx, max ) {\n\tvar index = normalize( idx, max );\n\tif ( index < 0 || index > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn index;\n}\n\n\n// MAIN //\n\n/**\n* Returns a function for returning an index according to a provided index mode.\n*\n* @param {string} mode - specifies how to handle an out-of-bounds index\n* @throws {TypeError} first argument must be a recognized index mode\n* @returns {Function} function for returning an index\n*\n* @example\n* var ind = factory( 'clamp' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // returns 9\n*\n* idx = ind( -1, 9 );\n* // returns 0\n*\n* @example\n* var ind = factory( 'wrap' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // returns 0\n*\n* idx = ind( -1, 9 );\n* // returns 9\n*\n* @example\n* var ind = factory( 'throw' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // throws \n*\n* idx = ind( -1, 9 );\n* // throws \n*\n* @example\n* var ind = factory( 'normalize' );\n*\n* var idx = ind( 1, 10 );\n* // returns 1\n*\n* idx = ind( -4, 10 );\n* // returns 7\n*\n* idx = ind( -100, 10 );\n* // throws \n*/\nfunction factory( mode ) {\n\tif ( !isIndexMode( mode ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a recognized index mode. Value: `%s`.', mode ) );\n\t}\n\treturn TABLE[ mode ];\n}\n\n\n// EXPORTS //\n\nexport default factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport clampIndex from '@stdlib/ndarray-base-clamp-index';\nimport wrapIndex from '@stdlib/ndarray-base-wrap-index';\nimport normalizeIndex from '@stdlib/ndarray-base-normalize-index';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an index given an index mode.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @param {string} mode - specifies how to handle an index outside the interval `[0,max]`\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = ind( 2, 9, 'clamp' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'clamp' );\n* // returns 9\n*\n* idx = ind( -1, 9, 'clamp' );\n* // returns 0\n*\n* @example\n* var idx = ind( 2, 9, 'wrap' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'wrap' );\n* // returns 0\n*\n* idx = ind( -1, 9, 'wrap' );\n* // returns 9\n*\n* @example\n* var idx = ind( 2, 9, 'throw' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'throw' );\n* // throws \n*\n* idx = ind( -1, 9, 'throw' );\n* // throws \n*\n* @example\n* var idx = ind( 1, 10, 'normalize' );\n* // returns 1\n*\n* idx = ind( -4, 10, 'normalize' );\n* // returns 7\n*\n* idx = ind( -100, 10, 'normalize' );\n* // throws \n*/\nfunction ind( idx, max, mode ) {\n\tvar index;\n\tif ( mode === 'clamp' ) {\n\t\treturn clampIndex( idx, max );\n\t}\n\tif ( mode === 'wrap' ) {\n\t\treturn wrapIndex( idx, max );\n\t}\n\tindex = idx;\n\tif ( mode === 'normalize' ) {\n\t\tindex = normalizeIndex( index, max );\n\t}\n\tif ( index < 0 || index > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn index;\n}\n\n\n// EXPORTS //\n\nexport default ind;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 an index given an index mode.\n*\n* @module @stdlib/ndarray-base-ind\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( -1, 10, 'wrap' );\n* // returns 10\n*\n* idx = ind( 14, 10, 'wrap' );\n* // returns 3\n*\n* idx = ind( 6, 10, 'wrap' );\n* // returns 6\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( -1, 10, 'clamp' );\n* // returns 0\n*\n* idx = ind( 14, 10, 'clamp' );\n* // returns 10\n*\n* idx = ind( 6, 10, 'clamp' );\n* // returns 6\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( 1, 10, 'throw' );\n* // returns 1\n*\n* idx = ind( 14, 10, 'throw' );\n* // throws \n*\n* idx = ind( -1, 10, 'throw' );\n* // throws \n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( 1, 10, 'normalize' );\n* // returns 1\n*\n* idx = ind( -4, 10, 'normalize' );\n* // returns 7\n*\n* idx = ind( -100, 10, 'normalize' );\n* // throws \n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var fcn = ind.factory( 'clamp' );\n*\n* var idx = fcn( -1, 10 );\n* // returns 0\n*\n* idx = fcn( 14, 10 );\n* // returns 10\n*\n* idx = fcn( 6, 10 );\n* // returns 6\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport factory from './factory.js';\nimport main from './main.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\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/* eslint-disable no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar base = parent.prototype.iget;\n\n\n// MAIN //\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @throws {TypeError} index must be an integer\n* @throws {RangeError} index exceeds array dimensions\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\tif ( this._ndims > 0 ) {\n\t\tif ( !isInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index must be an integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tidx = getIndex( idx, this._length-1, this._mode );\n\t\treturn base.call( this, idx );\n\t}\n\treturn base.call( this );\n}\n\n\n// EXPORTS //\n\nexport default iget;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// METHODS //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar base = parent.prototype.iset;\n\n\n// MAIN //\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @throws {Error} cannot write to a read-only array\n* @throws {TypeError} index must be an integer\n* @throws {RangeError} index exceeds array dimensions\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\tif ( this._flags.READONLY ) {\n\t\tthrow new Error( 'invalid invocation. Cannot write to a read-only array.' );\n\t}\n\tif ( this._ndims > 0 ) {\n\t\tif ( !isInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index must be an integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tidx = getIndex( idx, this._length-1, this._mode );\n\t\tbase.call( this, idx, v );\n\t} else {\n\t\tbase.call( this, idx );\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default iset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 contents of array-like value to a new array.\n*\n* @private\n* @param {ArrayLike} arr - input array\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var arr = [ 1.0, 2.0, 3.0 ];\n*\n* var out = copy( arr, arr.length );\n* // returns [ 1.0, 2.0, 3.0 ]\n*\n* var bool = ( arr === out );\n* // returns false\n*/\nfunction copy( arr, len ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( arr[ i ] );\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/* eslint-disable no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport { primitives as isIntegerArray } from '@stdlib/assert-is-integer-array';\nimport isFunction from '@stdlib/assert-is-function';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport isBufferLengthCompatible from '@stdlib/ndarray-base-assert-is-buffer-length-compatible';\nimport numel from '@stdlib/ndarray-base-numel';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport defaults from '@stdlib/ndarray-defaults';\nimport inherit from '@stdlib/utils-inherit';\nimport format from '@stdlib/string-format';\nimport iget from './iget.js';\nimport iset from './iset.js';\nimport get from './get.js';\nimport set from './set.js';\nimport copy from './copy_array.js';\nimport validate from './validate.js';\n\n\n// VARIABLES //\n\n/*\n* See the following references:\n*\n* - https://stackoverflow.com/questions/22747068/is-there-a-max-number-of-arguments-javascript-functions-can-accept\n* - https://bugs.webkit.org/show_bug.cgi?id=80797\n* - https://github.com/numpy/numpy/issues/5744\n*\n* Note that the maximum number of function arguments can vary from engine to engine. Here, we choose something of a lowest common denominator which may **not** be valid everywhere.\n*/\nvar MAX_DIMS = 32767|0;\n\nvar INDEX_MODE = defaults.get( 'index_mode' );\nvar READONLY = false;\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {Collection} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {Options} [options] - function options\n* @param {string} [options.mode=\"throw\"] - specifies how to handle indices which exceed array dimensions\n* @param {StringArray} [options.submode=[\"throw\"]] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis\n* @param {boolean} [options.readonly=false] - boolean indicating whether an array should be read-only\n* @throws {TypeError} `dtype` argument must be a supported ndarray data type\n* @throws {TypeError} `buffer` argument must be an array-like object, typed-array-like, or a Buffer\n* @throws {TypeError} `buffer` argument `get` and `set` properties must be functions\n* @throws {TypeError} `shape` argument must be an array-like object containing nonnegative integers\n* @throws {Error} `shape` argument length must equal the number of dimensions\n* @throws {TypeError} `strides` argument must be an array-like object containing integers\n* @throws {Error} `strides` argument length must equal the number of dimensions (except for zero-dimensional arrays; in which case, the `strides` argument length must be equal to `1`)\n* @throws {Error} for zero-dimensional ndarrays, the `strides` argument must contain a single element equal to `0`\n* @throws {TypeError} `offset` argument must be a nonnegative integer\n* @throws {TypeError} `order` argument must be a supported ndarray order\n* @throws {Error} `buffer` argument must be compatible with specified meta data\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {RangeError} too many dimensions\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order, options ) {\n\tvar ndims;\n\tvar opts;\n\tvar err;\n\tvar sh;\n\tvar st;\n\n\tif ( !(this instanceof ndarray) ) {\n\t\tif ( arguments.length < 7 ) {\n\t\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t\t}\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order, options ); // eslint-disable-line max-len\n\t}\n\tif ( !isDataType( dtype ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a supported ndarray data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( !isCollection( buffer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an array-like object, typed-array-like, or a Buffer. Value: `%s`.', buffer ) );\n\t} else if ( buffer.get && buffer.set && ( !isFunction( buffer.get ) || !isFunction( buffer.set ) ) ) { // eslint-disable-line max-len\n\t\tthrow new TypeError( format( 'invalid argument. Second argument `get` and `set` properties must be functions. Value: `%s`.', buffer ) );\n\t}\n\tif ( !isNonNegativeIntegerArray( shape ) ) {\n\t\tif ( !isCollection( shape) || shape.length > 0 ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array-like object containing nonnegative integers. Value: `%s`.', shape ) );\n\t\t}\n\t}\n\tndims = shape.length;\n\tif ( ndims > MAX_DIMS ) {\n\t\tthrow new RangeError( format( 'invalid argument. Number of dimensions must not exceed %u due to stack limits. Value: `%u`.', MAX_DIMS, ndims ) );\n\t}\n\tif ( !isIntegerArray( strides ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an array-like object containing integers. Value: `%s`.', strides ) );\n\t}\n\tif ( ndims > 0 ) {\n\t\tif ( strides.length !== ndims ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Fourth argument length must match the number of dimensions. Expected number of dimensions: `%u`. Strides length: `%u`.', ndims, strides.length ) );\n\t\t}\n\t} else if ( strides.length !== 1 ) {\n\t\tthrow new RangeError( 'invalid argument. Fourth argument length must be equal to 1 when creating a zero-dimensional ndarray.' );\n\t} else if ( strides[ 0 ] !== 0 ) {\n\t\tthrow new RangeError( format( 'invalid argument. Fourth argument must contain a single element equal to 0. Value: `%d`.', strides[ 0 ] ) );\n\t}\n\tif ( !isNonNegativeInteger( offset ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fifth argument must be a nonnegative integer. Value: `%s`.', offset ) );\n\t}\n\tif ( !isOrder( order ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Sixth argument must be a supported order. Value: `%s`.', order ) );\n\t}\n\tif ( ndims > 0 && !isBufferLengthCompatible( buffer.length, shape, strides, offset ) && numel( shape ) > 0 ) { // eslint-disable-line max-len\n\t\tthrow new Error( 'invalid arguments. Input buffer is incompatible with the specified meta data. Ensure that the offset is valid with regard to the strides array and that the buffer has enough elements to satisfy the desired array shape.' );\n\t}\n\topts = {};\n\topts.mode = INDEX_MODE;\n\topts.readonly = READONLY;\n\tif ( arguments.length > 6 ) {\n\t\terr = validate( opts, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tthis._mode = opts.mode;\n\tif ( opts.submode === void 0 ) {\n\t\topts.submode = [ this._mode ];\n\t}\n\tthis._submode = opts.submode;\n\n\t// Copy `shape` and `strides` to prevent external mutation:\n\tsh = copy( shape, ndims );\n\tst = copy( strides, ndims || 1 );\n\n\t// Call the parent constructor:\n\tparent.call( this, dtype, buffer, sh, st, offset, order );\n\tthis._flags.READONLY = opts.readonly;\n\n\treturn this;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n// Inherit from the parent constructor:\ninherit( ndarray, parent );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', get );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', iget );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', set );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', iset );\n\n\n// EXPORTS //\n\nexport default ndarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport minmax from '@stdlib/ndarray-base-minmax-view-buffer-index';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a buffer length is compatible with provided ndarray meta data.\n*\n* @param {NonNegativeInteger} len - buffer length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {boolean} boolean indicating if a buffer length is compatible\n*\n* @example\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var bool = isBufferLengthCompatible( 4, shape, strides, offset );\n* // returns true\n*\n* @example\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var bool = isBufferLengthCompatible( 4, shape, strides, offset );\n* // returns false\n*/\nfunction isBufferLengthCompatible( len, shape, strides, offset ) {\n\t// Determine the minimum and maximum linear indices which are accessible by the array view:\n\tvar buf = minmax( shape, strides, offset );\n\n\t// If the indices are \"inbounds\", then the buffer length is compatible:\n\treturn ( buf[ 0 ] >= 0 && buf[ 1 ] < len );\n}\n\n\n// EXPORTS //\n\nexport default isBufferLengthCompatible;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isIndexMode from '@stdlib/ndarray-base-assert-is-index-mode';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions\n* @param {StringArray} [options.submode] - specifies how to handle subscripts which exceed array dimensions\n* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var options = {\n* 'mode': 'clamp',\n* 'submode': [ 'throw', 'wrap', 'clamp' ]\n* };\n* var err = validate( opts, options );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tvar i;\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'mode' ) ) {\n\t\topts.mode = options.mode;\n\t\tif ( !isIndexMode( opts.mode ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a recognized mode. Option: `%s`.', 'mode', opts.mode ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'submode' ) ) {\n\t\topts.submode = options.submode;\n\t\tif ( !isArrayLikeObject( opts.submode ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.', 'submode', opts.submode ) );\n\t\t}\n\t\tif ( opts.submode.length === 0 ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.', 'submode', opts.submode.join( ',' ) ) );\n\t\t}\n\t\tfor ( i = 0; i < opts.submode.length; i++ ) {\n\t\t\tif ( !isIndexMode( opts.submode[ i ] ) ) {\n\t\t\t\treturn new TypeError( format( 'invalid option. Each submode must be a recognized mode. Option: `%s`.', opts.submode[ i ] ) );\n\t\t\t}\n\t\t}\n\t\topts.submode = opts.submode.slice();\n\t}\n\tif ( hasOwnProp( options, 'readonly' ) ) {\n\t\topts.readonly = options.readonly;\n\t\tif ( !isBoolean( opts.readonly ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'readonly', opts.readonly ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport format from '@stdlib/string-format';\nimport validate from './validate.js';\nimport createObject from './detect.js';\n\n\n// MAIN //\n\n/**\n* Implements prototypical inheritance by replacing the prototype of one constructor with the prototype of another constructor.\n*\n* ## Notes\n*\n* - This implementation is not designed to work with ES2015/ES6 classes. For ES2015/ES6 classes, use `class` with `extends`.\n* - For reference, see [node#3455](https://github.com/nodejs/node/pull/3455), [node#4179](https://github.com/nodejs/node/issues/4179), [node#3452](https://github.com/nodejs/node/issues/3452), and [node commit](https://github.com/nodejs/node/commit/29da8cf8d7ab8f66b9091ab22664067d4468461e#diff-3deb3f32958bb937ae05c6f3e4abbdf5).\n*\n* @param {(Object|Function)} ctor - constructor which will inherit\n* @param {(Object|Function)} superCtor - super (parent) constructor\n* @throws {TypeError} first argument must be either an object or a function which can inherit\n* @throws {TypeError} second argument must be either an object or a function from which a constructor can inherit\n* @throws {TypeError} second argument must have an inheritable prototype\n* @returns {(Object|Function)} child constructor\n*\n* @example\n* function Foo() {\n* return this;\n* }\n* Foo.prototype.beep = function beep() {\n* return 'boop';\n* };\n*\n* function Bar() {\n* Foo.call( this );\n* return this;\n* }\n* inherit( Bar, Foo );\n*\n* var bar = new Bar();\n* var v = bar.beep();\n* // returns 'boop'\n*/\nfunction inherit( ctor, superCtor ) {\n\tvar err = validate( ctor );\n\tif ( err ) {\n\t\tthrow err;\n\t}\n\terr = validate( superCtor );\n\tif ( err ) {\n\t\tthrow err;\n\t}\n\tif ( typeof superCtor.prototype === 'undefined' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must have a prototype from which another object can inherit. Value: `%s`.', superCtor.prototype ) );\n\t}\n\t// Create a prototype which inherits from the parent prototype:\n\tctor.prototype = createObject( superCtor.prototype );\n\n\t// Set the constructor to refer to the child constructor:\n\tdefineProperty( ctor.prototype, 'constructor', {\n\t\t'configurable': true,\n\t\t'enumerable': false,\n\t\t'writable': true,\n\t\t'value': ctor\n\t});\n\n\treturn ctor;\n}\n\n\n// EXPORTS //\n\nexport default inherit;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @throws {TypeError} provided indices must be integer valued\n* @throws {RangeError} index exceeds array dimensions\n* @throws {RangeError} number of indices must equal the number of dimensions\n* @returns {*} array element\n*/\nfunction get() {\n\tvar idx;\n\tvar ind;\n\tvar M;\n\tvar i;\n\n\tif ( arguments.length !== this._ndims ) {\n\t\tthrow new RangeError( format( 'invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.', this._ndims, arguments.length ) );\n\t}\n\tidx = this._offset;\n\tM = this._submode.length;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tif ( !isInteger( arguments[ i ] ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Indices must be integer valued. Argument: `%u`. Value: `%s`.', i, arguments[ i ] ) );\n\t\t}\n\t\tind = getIndex( arguments[ i ], this._shape[ i ]-1, this._submode[ i%M ] ); // eslint-disable-line max-len\n\t\tidx += this._strides[ i ] * ind;\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nexport default get;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @throws {Error} cannot write to a read-only array\n* @throws {TypeError} provided indices must be integer valued\n* @throws {RangeError} index exceeds array dimensions\n* @throws {RangeError} number of indices must equal the number of dimensions\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\tvar idx;\n\tvar ind;\n\tvar M;\n\tvar i;\n\n\tif ( this._flags.READONLY ) {\n\t\tthrow new Error( 'invalid invocation. Cannot write to a read-only array.' );\n\t}\n\tif ( arguments.length !== this._ndims+1 ) {\n\t\tthrow new RangeError( format( 'invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.', this._ndims, arguments.length ) );\n\t}\n\tidx = this._offset;\n\tM = this._submode.length;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tif ( !isInteger( arguments[ i ] ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Indices must be integer valued. Argument: `%i`. Value: `%s`.', i, arguments[ i ] ) );\n\t\t}\n\t\tind = getIndex( arguments[ i ], this._shape[ i ]-1, this._submode[ i%M ] ); // eslint-disable-line max-len\n\t\tidx += this._strides[ i ] * ind;\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default set;\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 no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\nimport isEmptyCollection from '@stdlib/assert-is-empty-collection';\nimport isndarrayLike from '@stdlib/assert-is-ndarray-like';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isPlainObject from '@stdlib/assert-is-plain-object';\nimport isObject from '@stdlib/assert-is-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport isEqualDataType from '@stdlib/ndarray-base-assert-is-equal-data-type';\nimport isOutputDataTypePolicy from '@stdlib/ndarray-base-assert-is-output-data-type-policy';\nimport isReadOnly from '@stdlib/ndarray-base-assert-is-read-only';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport filledBy from '@stdlib/array-base-filled-by';\nimport everyBy from '@stdlib/array-base-every-by';\nimport join from '@stdlib/array-base-join';\nimport copy from '@stdlib/array-base-copy';\nimport nullaryStrided from '@stdlib/strided-base-nullary';\nimport binary from '@stdlib/ndarray-base-binary';\nimport broadcast from '@stdlib/ndarray-base-maybe-broadcast-array';\nimport broadcastScalar from '@stdlib/ndarray-base-broadcast-scalar';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport dtypes2strings from '@stdlib/ndarray-base-dtypes2strings';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport binaryOutputDataType from '@stdlib/ndarray-base-binary-output-dtype';\nimport numel from '@stdlib/ndarray-base-numel';\nimport buffer from '@stdlib/ndarray-base-buffer';\nimport getShape from '@stdlib/ndarray-shape';\nimport getDType from '@stdlib/ndarray-dtype';\nimport getOrder from '@stdlib/ndarray-order';\nimport ndims from '@stdlib/ndarray-ndims';\nimport ndarray from '@stdlib/ndarray-ctor';\nimport defaults from '@stdlib/ndarray-defaults';\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport format from '@stdlib/error-tools-fmtprodmsg';\nimport validate from './validate.js';\n\n\n// VARIABLES //\n\nvar ORDINALS = [ 'First', 'Second', 'Third' ];\n\n\n// FUNCTIONS //\n\n/**\n* Performs an initial scan of a list of parameters.\n*\n* @private\n* @param {Array} params - list of parameters\n* @returns {Array} scan results\n*/\nfunction initialScan( params ) {\n\tvar out;\n\tvar p;\n\tvar o;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\to = {\n\t\t\t'scalar': true,\n\t\t\t'value': p,\n\t\t\t'dtype': '',\n\t\t\t'ndims': 0,\n\t\t\t'order': ''\n\t\t};\n\t\tif ( isNumber( p ) ) {\n\t\t\to.dtype = 'float64';\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\to.dtype = 'complex64';\n\t\t\t} else {\n\t\t\t\to.dtype = 'complex128';\n\t\t\t}\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\to.scalar = false;\n\t\t\to.dtype = resolveStr( getDType( p ) );\n\t\t\to.ndims = ndims( p );\n\t\t\to.order = getOrder( p );\n\t\t} else {\n\t\t\to.dtype = 'generic';\n\t\t}\n\t\tout.push( o );\n\t}\n\treturn out;\n}\n\n/**\n* Checks whether all parameters are scalar compatible.\n*\n* ## Notes\n*\n* - A parameter is scalar compatible if, and only if, the parameter value is either a zero-dimensional ndarray or already a scalar value.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {boolean} boolean indicating whether all parameters are scalar compatible\n*/\nfunction isScalarCompatible( params ) {\n\tvar count;\n\tvar p;\n\tvar i;\n\n\tcount = 0;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar || p.ndims === 0 ) {\n\t\t\tcount += 1;\n\t\t}\n\t}\n\treturn ( count === params.length );\n}\n\n/**\n* Converts a list of parameters to scalar values.\n*\n* ## Notes\n*\n* - The function **mutates** the input array by updating parameter objects which do not already correspond to scalar parameter values.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction convertToScalars( params ) {\n\tvar p;\n\tvar i;\n\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar === false ) {\n\t\t\tp.scalar = true;\n\t\t\tp.value = p.value.get();\n\t\t\tp.ndims = 0;\n\t\t\tp.order = '';\n\t\t}\n\t}\n\treturn params;\n}\n\n/**\n* Resolves a common memory layout from a list of parameter objects.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {string} memory layout\n*/\nfunction resolveOrder( params ) {\n\tvar p;\n\tvar i;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// For a binary parameter function, we simply return the layout of the first parameter having a layout, as there is no clear rationale for picking the layout of one parameter over another and picking the first one we find is as good a rationale as any other...\n\t\tif ( p.scalar === false ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn p.order;\n}\n\n/**\n* Broadcasts parameter values to an ndarray having a specified shape.\n*\n* ## Notes\n*\n* - The function **mutates** the input array.\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction broadcastParameters( shape, params ) {\n\tvar ord;\n\tvar p;\n\tvar i;\n\n\tord = resolveOrder( params );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar ) {\n\t\t\tp.scalar = false;\n\t\t\tp.value = broadcastScalar( p.value, p.dtype, shape, ord );\n\t\t\tp.order = ord;\n\t\t} else {\n\t\t\tp.value = broadcast( p.value, shape ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t}\n\t\tp.ndims = shape.length;\n\t}\n\treturn params;\n}\n\n\n// MAIN //\n\n/**\n* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG.\n*\n* @constructor\n* @param {Function} prng - binary pseudorandom value generator\n* @param {ArrayLikeObject} idtypes - list containing a list of supported input data types for each PRNG parameter\n* @param {ArrayLikeObject} odtypes - list of supported output data types\n* @param {Object} policies - policies\n* @param {string} policies.output - output data type policy\n* @param {Object} [options] - function options\n* @param {string} [options.order] - default memory layout\n* @throws {TypeError} first argument must be a function\n* @throws {TypeError} second argument must be an array containing arrays of supported data types\n* @throws {TypeError} third argument must be an array of supported data types\n* @throws {TypeError} fourth argument must be an object having supported policies\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Random} instance\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import ndzeros from '@stdlib/ndarray-zeros';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nfunction Random( prng, idtypes, odtypes, policies, options ) {\n\tvar opts;\n\tvar dt;\n\tvar i;\n\tif ( !( this instanceof Random ) ) {\n\t\tif ( arguments.length < 5 ) {\n\t\t\treturn new Random( prng, idtypes, odtypes, policies );\n\t\t}\n\t\treturn new Random( prng, idtypes, odtypes, policies, options );\n\t}\n\tif ( !isFunction( prng ) ) {\n\t\tthrow new TypeError( format( 'null3c', prng ) );\n\t}\n\tif ( !isCollection( idtypes ) ) {\n\t\tthrow new TypeError( format( 'null2y', idtypes ) );\n\t}\n\tidtypes = copy( idtypes );\n\tfor ( i = 0; i < idtypes.length; i++ ) {\n\t\tdt = idtypes[ i ];\n\t\tif (\n\t\t\t!isCollection( dt ) ||\n\t\t\tdt.length < 1 ||\n\t\t\t!everyBy( dt, isDataType )\n\t\t) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must contain arrays of data types. Value: `%s`.', idtypes ) );\n\t\t}\n\t\tidtypes[ i ] = dtypes2strings( dt );\n\t}\n\tif (\n\t\t!isCollection( odtypes ) ||\n\t\todtypes.length < 1 ||\n\t\t!everyBy( odtypes, isDataType )\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array of data types. Value: `%s`.', odtypes ) );\n\t}\n\todtypes = dtypes2strings( odtypes );\n\n\tif ( !isObject( policies ) ) {\n\t\tthrow new TypeError( format( 'null43', policies ) );\n\t}\n\tif ( !isOutputDataTypePolicy( policies.output ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an object having a supported output data type policy. Value: `%s`.', policies.output ) );\n\t}\n\topts = {\n\t\t'order': defaults.get( 'order' )\n\t};\n\tif ( arguments.length > 4 ) {\n\t\tif ( !isPlainObject( options ) ) {\n\t\t\tthrow new TypeError( format( 'null2V', options ) );\n\t\t}\n\t\tif ( hasOwnProp( options, 'order' ) ) {\n\t\t\topts.order = options.order;\n\t\t\tif ( !isOrder( opts.order ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a valid memory layout. Option: `%s`.', 'order', opts.order ) );\n\t\t\t}\n\t\t}\n\t}\n\tthis._prng = prng;\n\tthis._idtypes = idtypes;\n\tthis._odtypes = odtypes;\n\tthis._policies = {\n\t\t'output': policies.output\n\t};\n\tthis._opts = opts;\n\treturn this;\n}\n\n/**\n* Returns an ndarray filled with pseudorandom values drawn from a binary PRNG.\n*\n* @name generate\n* @memberof Random.prototype\n* @type {Function}\n* @param {NonNegativeIntegerArray} shape - output shape\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {Options} [options] - function options\n* @param {*} [options.dtype] - output ndarray data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed ndarray dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed ndarray dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an ndarray should be read-only\n* @throws {TypeError} first argument must be a valid shape\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the desired shape must be broadcast compatible\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {ndarray} output ndarray\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*/\nsetReadOnly( Random.prototype, 'generate', function generate( shape, param1, param2, options ) {\n\tvar params;\n\tvar prng;\n\tvar opts;\n\tvar buf;\n\tvar err;\n\tvar len;\n\tvar ord;\n\tvar FLG;\n\tvar out;\n\tvar set;\n\tvar dt;\n\tvar st;\n\tvar p1;\n\tvar p2;\n\tvar i;\n\n\tif ( !isNonNegativeIntegerArray( shape ) && !isEmptyCollection( shape ) ) {\n\t\tthrow new TypeError( format( 'null5o', shape ) );\n\t}\n\topts = {};\n\tif ( arguments.length > 3 ) {\n\t\terr = validate( opts, this._odtypes, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tparams = initialScan( [ param1, param2 ] );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tdt = params[ i ].dtype;\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( dt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i+1 ], join( this._idtypes[ i ], '\", \"' ), dt ) );\n\t\t}\n\t}\n\tFLG = isScalarCompatible( params );\n\tif ( FLG ) {\n\t\tparams = convertToScalars( params );\n\t} else {\n\t\tparams = broadcastParameters( shape, params );\n\t}\n\tp1 = params[ 0 ];\n\tp2 = params[ 1 ];\n\tprng = this._prng;\n\tdt = opts.dtype || binaryOutputDataType( p1.dtype, p2.dtype, this._policies.output ); // eslint-disable-line max-len\n\tif ( opts.order ) {\n\t\tord = opts.order;\n\t} else if ( FLG ) {\n\t\tord = this._opts.order;\n\t} else {\n\t\t// If we don't have any explicit order info, use the order of the first parameter, as no clear rationale for choosing the order of one parameter over another:\n\t\tord = p1.order;\n\t}\n\t// Handles special cases involving (1) zero-dimensional output ndarrays and (2) shapes having at least one dimension of size zero...\n\tlen = numel( shape );\n\tif ( len === 0 ) {\n\t\t// Check for a zero-dimensional shape...\n\t\tif ( shape.length === 0 ) {\n\t\t\t// If the output array is a zero-dimensional ndarray, we generate a single random variate...\n\t\t\tbuf = buffer( dt, 1 );\n\t\t\tif ( isAccessorArray( buf ) ) {\n\t\t\t\tset = accessorSetter( dt );\n\t\t\t} else {\n\t\t\t\tset = setter( dt );\n\t\t\t}\n\t\t\tset( buf, 0, prng( p1.value, p2.value ) );\n\t\t\tst = [ 0 ];\n\t\t} else {\n\t\t\t// If the output array has one or more dimensions of size zero, we avoid allocating any memory, and instead return an empty ndarray...\n\t\t\tbuf = buffer( dt, len );\n\t\t\tst = shape2strides( shape, ord );\n\t\t}\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// If provided scalar PRNG parameters, we can simply fill a linear buffer with pseudorandom values (as all pseudorandom values are drawn from the same PRNG) and then wrap as an ndarray...\n\tif ( FLG ) {\n\t\tif ( isEqualDataType( dt, 'generic' ) ) {\n\t\t\tbuf = filledBy( len, wrapper );\n\t\t} else {\n\t\t\tbuf = buffer( dt, len );\n\t\t\tnullaryStrided( [ buf ], [ len ], [ 1 ], wrapper );\n\t\t}\n\t\tst = shape2strides( shape, ord );\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// We've been provided ndarrays, so we need to perform element-wise iteration...\n\n\t// Allocate a data buffer:\n\tbuf = buffer( dt, len );\n\n\t// Initialize the output array:\n\tst = shape2strides( shape, ord );\n\tout = new ndarray( dt, buf, shape, st, 0, ord, opts );\n\n\t// Fill the output array with pseudorandom values:\n\tbinary( [ p1.value, p2.value, out ], prng );\n\n\treturn out;\n\n\t/**\n\t* Applies parameters to a pseudorandom number generator function.\n\t*\n\t* @private\n\t* @returns {(number|ComplexLike)} pseudorandom number\n\t*/\n\tfunction wrapper() {\n\t\treturn prng( p1.value, p2.value );\n\t}\n});\n\n/**\n* Fills an ndarray with pseudorandom values drawn from a binary PRNG.\n*\n* @name assign\n* @memberof Random.prototype\n* @type {Function}\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {ndarrayLike} out - output ndarray\n* @throws {TypeError} third argument must be an ndarray\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the output ndarray must be broadcast compatible\n* @throws {Error} cannot write to a read-only ndarray\n* @returns {ndarray} output ndarray\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import ndzeros from '@stdlib/ndarray-zeros';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nsetReadOnly( Random.prototype, 'assign', function assign( param1, param2, out ) {\n\tvar params;\n\tvar pdt;\n\tvar odt;\n\tvar ord;\n\tvar sh;\n\tvar p;\n\tvar i;\n\n\tif ( !isndarrayLike( out ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an ndarray-like object. Value: `%s`.', out ) );\n\t}\n\tif ( isReadOnly( out ) ) {\n\t\tthrow new Error( format('null1g') );\n\t}\n\tsh = getShape( out );\n\tord = getOrder( out );\n\todt = getDType( out );\n\tif ( !contains( this._odtypes, resolveStr( odt ) ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ 2 ], join( this._odtypes, '\", \"' ), odt ) );\n\t}\n\tparams = [ param1, param2 ];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// Check whether we've been provided a scalar PRNG parameter...\n\t\tif ( isNumber( p ) ) {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'float64';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\tpdt = 'complex64';\n\t\t\t} else {\n\t\t\t\tpdt = 'complex128';\n\t\t\t}\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\t// Broadcast the PRNG parameter to the desired shape:\n\t\t\tpdt = getDType( p );\n\t\t\tp = broadcast( p, sh ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t} else {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'generic';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t}\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( pdt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i ], join( this._idtypes[ i ], '\", \"' ), pdt ) );\n\t\t}\n\t\tparams[ i ] = p;\n\t}\n\t// Fill the output array with pseudorandom values:\n\tparams.push( out );\n\tbinary( params, this._prng );\n\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Random;\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 resolveGetter from '@stdlib/array-base-resolve-getter';\n\n\n// MAIN //\n\n/**\n* Copies the elements of an 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 get;\n\tvar i;\n\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( x );\n\n\t// Get the number of elements to copy:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( get( x, i ) ); // 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) 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* Tests if a value is an empty collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an empty collection\n*\n* @example\n* var bool = isEmptyCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isEmptyCollection( { 'length': 0 } );\n* // returns true\n*\n* @example\n* var bool = isEmptyCollection( [ 1, 2, 3 ] );\n* // returns false\n*\n* @example\n* var bool = isEmptyCollection( {} );\n* // returns false\n*/\nfunction isEmptyCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.length === 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isEmptyCollection;\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 isObject from '@stdlib/assert-is-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport format from '@stdlib/error-tools-fmtprodmsg';\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Array} dtypes - list of supported output data types\n* @param {Options} options - function options\n* @param {*} [options.dtype] - array data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var dtypes = [ 'float64', 'float32', 'generic' ];\n*\n* var options = {\n* 'dtype': 'float64'\n* };\n* var err = validate( opts, dtypes, options );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( opts, dtypes, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'null2V', options ) );\n\t}\n\tif ( hasOwnProp( options, 'dtype' ) ) {\n\t\topts.dtype = resolveStr( options.dtype );\n\t\tif ( !contains( dtypes, opts.dtype ) ) {\n\t\t\treturn new TypeError( format( 'null4S', 'dtype', join( dtypes, '\", \"' ), options.dtype ) );\n\t\t}\n\t}\n\t// Pass-through options...\n\tif ( hasOwnProp( options, 'order' ) ) {\n\t\topts.order = options.order;\n\t}\n\tif ( hasOwnProp( options, 'mode' ) ) {\n\t\topts.mode = options.mode;\n\t}\n\tif ( hasOwnProp( options, 'submode' ) ) {\n\t\topts.submode = options.submode;\n\t}\n\tif ( hasOwnProp( options, 'readonly' ) ) {\n\t\topts.readonly = options.readonly;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\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 isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether two values are equal ndarray data types.\n*\n* @param {*} v1 - first input value\n* @param {*} v2 - second input value\n* @returns {boolean} boolean indicating whether two input values are equal ndarray data types\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isEqualDataType( 'binary', 'binary' );\n* // returns true\n*\n* bool = isEqualDataType( 'float32', 'float32' );\n* // returns true\n*\n* bool = isEqualDataType( 'float64', new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isEqualDataType( 'generic', new DataType( 'generic' ) );\n* // returns true\n*\n* bool = isEqualDataType( 'int16', 'int32' );\n* // returns false\n*\n* bool = isEqualDataType( 'int32', new DataType( 'int16' ) );\n* // returns false\n*/\nfunction isEqualDataType( v1, v2 ) {\n\tif ( isDataTypeString( v1 ) ) {\n\t\t// Nothing to do here. Branch is kept to avoid additional assertion logic for what is expected to be a common use case; namely, comparing data type strings...\n\t} else if ( isDataTypeObject( v1 ) ) {\n\t\tv1 = String( v1 );\n\t} else if ( isStructDataType( v1 ) ) {\n\t\tv1 = v1.layout;\n\t} else {\n\t\treturn false;\n\t}\n\tif ( isDataTypeString( v2 ) ) {\n\t\t// Nothing to do here. Branch is kept to avoid additional assertion logic for what is expected to be a common use case; namely, comparing data type strings...\n\t} else if ( isDataTypeObject( v2 ) ) {\n\t\tv2 = String( v2 );\n\t} else if ( isStructDataType( v2 ) ) {\n\t\tv2 = v2.layout;\n\t} else {\n\t\treturn false;\n\t}\n\treturn ( v1 === v2 );\n}\n\n\n// EXPORTS //\n\nexport default isEqualDataType;\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 filled \"generic\" array according to a provided callback function.\n*\n* @param {NonNegativeInteger} len - array length\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* import constantFunction from '@stdlib/utils-constant-function';\n*\n* var out = filledBy( 3, constantFunction( 'beep' ) );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filledBy( len, clbk, thisArg ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( clbk.call( thisArg, i ) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default filledBy;\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 flag from '@stdlib/ndarray-base-flag';\n\n\n// MAIN //\n\n/**\n* Tests whether an ndarray is read-only.\n*\n* @param {ndarray} arr - input ndarray\n* @returns {boolean} boolean indicating whether an ndarray is read-only\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ 1, 2, 3, 4 ], {\n* 'readonly': true\n* });\n* var bool = isReadOnly( x );\n* // returns true\n*\n* x = array( [ 1, 2, 3, 4 ] );\n* bool = isReadOnly( x );\n* // returns false\n*/\nfunction isReadOnly( arr ) {\n\treturn ( flag( arr, 'READONLY' ) === true );\n}\n\n\n// EXPORTS //\n\nexport default isReadOnly;\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 isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ) );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x ) {\n\tvar out;\n\tvar sh;\n\tvar d;\n\tvar i;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tsh = x.shape;\n\tif ( !isCollection( sh ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\t// Copy the shape in order to avoid unintended mutation...\n\tout = [];\n\tfor ( i = 0; i < sh.length; i++ ) {\n\t\td = sh[ i ];\n\t\tif ( !isNonNegativeInteger( d ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tout.push( d );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n"],"names":["main","Object","defineProperty","isNumber","value","zeros","n","i","out","zeroPad","str","width","right","negative","pad","length","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","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","main$f","Number","test","isPrimitive","isObject","setReadOnly","FLOAT64_PINF","POSITIVE_INFINITY","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","x","PINF","NINF","isInt","valueOf","isNonNegativeInteger","MAX_ARRAY_LENGTH","arraylikefcn","predicate","len","MAX_LENGTH","isArrayLike","isPrimitiveArray","arrayfun","isObjectArray","isNonNegativeIntegerArray","isBoolean","Bool","Boolean","self","window","globalThis","getGlobal","codegen","Function","GlobalThis","Self","Win","Global","hasBigIntSupport","BigInt","setNonEnumerableReadOnlyAccessor","getter","isString","isPositiveInteger","keys","bool","isArguments","bool$e","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","main$e","UINT32_MAX","isArguments$1","arrayfcn","isObjectLike","MAX_TYPED_ARRAY_LENGTH","isCollection","arr","searchElement","fromIndex","root","nodeList","document","childNodes","typedarray","Int8Array","reFunctionName","RE_FUNCTION_NAME","isBuffer","_isBuffer","constructor","constructorName","name","ctor","REGEXP","ctorName","type","isConstructorPrototype","w","hasAutomationEqualityBug","k","typeOf","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","main$c","isFunction","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","opts","val","allowDupes","duplicates","objectKeys","objectInverse","int8","uint8","uint8c","int16","uint16","int32","uint32","int64","uint64","float16","float32","float64","complex32","complex64","complex128","binary","generic","notype","userdefined_type","enum2str","dtype","bytesPerElement","BYTES_PER_ELEMENT","byteLength","iterationOrder","strides","cnt","strides2order","column","ndims","row","s1","s2","TYPE","isAccessorArray","GETTERS","idx","default","SETTERS","setter","ctor2dtypes","Float32Array","Float64Array","Int16Array","Int32Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasFloat64Array","hasFloat64ArraySupport","GlobalFloat64Array","NaN","Float64Array$1","hasFloat32Array","GlobalFloat32Array","hasFloat32ArraySupport","Float32Array$1","hasUint32Array","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","INT32_MAX","INT32_MIN","GlobalInt32Array","hasInt32ArraySupport","Int32Array$1","hasUint16Array","UINT16_MAX","GlobalUint16Array","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","INT16_MAX","INT16_MIN","GlobalInt16Array","hasInt16ArraySupport","Int16Array$1","hasUint8Array","UINT8_MAX","GlobalUint8Array","hasUint8ArraySupport","Uint8Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","INT8_MAX","INT8_MIN","GlobalInt8Array","hasInt8ArraySupport","Int8Array$1","isArrayLikeObject","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isStringArray","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","isComplex64Array","isComplex128Array","hasIteratorSymbolSupport","iterator","IteratorSymbol","z","reinterpret","offset","buffer","byteOffset","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","accessorGetter","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","separator","sep","join","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","a","b","CTORS","DTYPES","NTYPES","ctor2dtype","arraylike2object","dt","data","accessorProtocol","accessors","accessorSetter","arraySlice","method","hasMethod","isColumnMajorContiguous","order","contiguous","isRowMajorContiguous","minmaxViewBufferIndex","shape","min","max","s","isColumnMajorString","RE_CHARS","RegExp","isRegExp","search","newval","rescape","uint16view","ctors","IS_LITTLE_ENDIAN","view","GlobalArrayBuffer","isView","hasArrayBufferSupport","ArrayBuffer$1","hasDataView","DataView","isDataView","GlobalDataView","getFloat64","setFloat64","hasDataViewSupport","DataView$1","BigInteger","orders","ORDERS","enumerated","DATA","enumeration","LAYOUTS","modes","MODES","throw","clamp","wrap","normalize","LOW_MASK","TWO_32","BYTES","VIEW","float64ToInt64Bytes","stride","hi","lo","setUint32","bytes","assign","ndarray","nbytes","ord","_byteLength","_bytesPerElement","_dtype","_ndims","_offset","_order","_shape","_strides","_accessors","_iterationOrder","isContiguous","_flags","ROW_MAJOR_CONTIGUOUS","COLUMN_MAJOR_CONTIGUOUS","READONLY","__meta_dataview__","isndarrayLike","contains","factory","copyFlags","ind","isColumnMajor","iget","flgs","sh","st","sm","m","o","M","_mode","_submode","setInt8","setInt16","setBigInt64","setInt32","RE_SUFFIX","dtypeStrings","kind","all","isDataTypeString","dtypes","hasProp","isStructConstructorLike","alignment","byteLengthOf","byteOffsetOf","bufferOf","isStruct","viewOf","TABLE","ENUM","str2enum","resolve","t","layout","DataType","char","description","byteOrder","isDataType","bfloat16","float128","int128","int256","uint128","uint256","dtype2desc","dtype2char","enum","resolveEnum","dtype2alignment","isDataTypeObject","isStructDataType","_alignment","_byteOrder","_char","_description","_enum","_value","_type","policies","POLICIES","same","promoted","accumulation","boolean","boolean_and_generic","signed_integer","signed_integer_and_generic","unsigned_integer","unsigned_integer_and_generic","integer","integer_and_generic","floating_point","floating_point_and_generic","real_floating_point","real_floating_point_and_generic","complex_floating_point","complex_floating_point_and_generic","real_and_generic","numeric","numeric_and_generic","integer_index","integer_index_and_generic","boolean_index","boolean_index_and_generic","mask_index","mask_index_and_generic","default_index","source","isOutputDataTypePolicy","getOwnPropertySymbols","propertySymbols","enumerableProperties","isEnumerable","hasObjectAssign","to","assign$3","copy","isOrder","everyBy","every","internal","stride2offset","isUndefinedOrNull","gjoin","strideX","offsetX","ix","xbuf","strided","resolveGetter","nullary","arrays","offsets","sx","xset","numel","copyIndexed","shape2strides","columnmajor","rowmajor","ROW_MAJOR","strides2offset","COLUMN_MAJOR","ndarraylike2object","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","anyIsEntryIn","indexed","zeroTo","complex","take","indices","binaryLoopOrder","sy","sz","y","avx","iy","jx","jy","vx","vy","ux","sort2ins","loopOrder","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","binaryBlockSize","dtypeX","dtypeY","dtypeZ","nb","blockSize","vind2bind","mode","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","xmmv","ymmv","zmmv","shx","shy","shz","iox","ioy","ioz","ns","d","ndarray2object","ordx","ordy","ordz","accessorbinarynd","binarynd","filled","broadcastArray","dim","maybeBroadcastArray","broadcast","isComplexFloatingPointDataType","isProtoOf","gcopy","strideY","offsetY","PRIVATE_BUFFER","CTOR_NAME","setNonEnumerableReadWriteAccessor","setReadOnlyAccessor","setReadWriteAccessor","DATA_VIEW_METHODS","table","DEFAULT_CTOR","CMPLX_TO_REAL","getComplex","DEFAULTS","HASH","DEFAULT_DTYPE","reinterpretBoolean","isStructType","getStructArray","getTypedArray","getBigInt","getBoolean","getStruct","isRealFloatingPointDataType","isSignedIntegerDataType","isBigInt","isSymbol","constantFunction","hasBigInts","polyfill","ntypes","dt1","dt2","SAFE_CASTS","generateFullTable","generateTable","safeCasts","CASTS","casts","SAME_KIND_CASTS","sameKindCasts","isAllowedCast","from","casting","resolveStr","isSafeCast","isMostlySafeCast","isSameKindCast","FLOAT32_SMALLEST_SUBNORMAL","FLOAT32_MAX_SAFE_INTEGER","FLOAT32_MIN_SAFE_INTEGER","minFloatDataType","minDataType","boolean2number","bigint2number","setNumber","minSignedIntegerDataType","complexDType","castingMode","number2boolean","complex2boolean","setBoolean","bigint2boolean","setBigInt","boolean2bigint","isStructInstance","isBooleanDataType","isRealDataType","gfill","alpha","xobj","yobj","xdata","ydata","yset","io","map","complex2number","views","dest","setStructArray","isComplexDataType","reinterpretComplex","setTypedArray","setComplex","setStruct","FIELD_PROPERTIES","isUnionType","fields","isValidBoolean","ALIGNMENTS","MANDATORY_FIELD_NAMES","VALIDATORS","padding","hasProperties","JSON","stringify","normalizeUnion","dflg","normalizeField","resolveAlignment","fieldIndex","names","setPadding","replacer","p1","layoutFormat","FORMATS","isFormat","Struct","fmt0","fmt1","fmt2","bfmt","ufmt","fmt","ib","c0","c1","c2","w1","linearFormat","foo","isFunctionNameSupported","TypedArray","Dummy","fcnName","hasHasInstanceSymbolSupport","hasInstance","HasInstanceSymbol","hasSupport","instanceOf","typeName","typedarray2json","NAMES","isTypedArray","isComplexTypedArray","FIELD_NAMES","BYTE_LENGTH","PARTITIONS","ALIGNMENT","ACCESSORS","FIELDS","o1","fieldNames","cache","byteOffsets","flatten","partitions","createPrototypeAccessors","struct2string","struct","toJSON","struct2json","bbytes","sview","LAYOUT","structFactory","StructArray","_byteOffset","isStructArray","Buffer","notImplemented","CACHE","allocUnsafe$1","allocUnsafe","size","fill","bufferCtors","broadcastScalar","dtypes2strings","isFloatingPointDataType","isIntegerDataType","isUnsignedIntegerDataType","isNumericDataType","isIntegerIndexDataType","isBooleanIndexDataType","isMaskIndexDataType","promotionRules","dtype1","dtype2","PROMOTION_RULES","promoteDataTypes","index_mode","DEFAULT_INDEX_DTYPE","DEFAULT_SIGNED_INTEGER_DTYPE","DEFAULT_UNSIGNED_INTEGER_DTYPE","DEFAULT_REAL_FLOATING_POINT_DTYPE","DEFAULT_COMPLEX_FLOATING_POINT_DTYPE","POLICY_TABLE1","promotedPolicy","POLICY_TABLE2","resolveDefaultRealFloatingPoint","resolveDefaultComplexFloatingPoint","COMPLEX2FLOAT","FLOAT2COMPLEX","xdtype","ydtype","policy","outputDataType","isIntegerArray","validate","create","Ctor","createObject$1","clampIndex","wrapIndex","mp1","normalizeIndex","isIndexMode","parent","iset","INDEX_MODE","minmax","isBufferLengthCompatible","readonly","submode","fmtprodmsg","u","encodeURIComponent","superCtor","createObject","inherit","getIndex","ORDINALS","Random","prng","idtypes","odtypes","output","_prng","_idtypes","_odtypes","_policies","_opts","param1","param2","params","p2","scalar","initialScan","count","isScalarCompatible","convertToScalars","resolveOrder","broadcastParameters","binaryOutputDataType","v1","v2","isEqualDataType","nullaryStrided","wrapper","filledBy","pdt","odt"],"mappings":";uOAsBA,IAAIA,EAA0C,mBAA1BC,OAAOC,eAAkCD,OAAOC,eAAiB,KCiCrF,IAAIA,EAAiBD,OAAOC,eCjB5B,SAASC,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCAA,SAASC,EAAOC,GACf,IACIC,EADAC,EAAM,GAEV,IAAMD,EAAI,EAAGA,EAAID,EAAGC,IACnBC,GAAO,IAER,OAAOA,CACR,CAcA,SAASC,EAASC,EAAKC,EAAOC,GAC7B,IAAIC,GAAW,EACXC,EAAMH,EAAQD,EAAIK,OACtB,OAAKD,EAAM,IAnCZ,SAA0BJ,GACzB,MAAoB,MAAbA,EAAK,EACb,CAoCMM,CAAiBN,KACrBG,GAAW,EACXH,EAAMA,EAAIO,OAAQ,IAEnBP,EAAM,EACLA,EAAML,EAAOS,GACbT,EAAOS,GAAQJ,EACXG,IACJH,EAAM,IAAMA,IAVLA,CAaT,CCpDA,IAAIQ,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAajC,SAASC,EAAeC,GACvB,IAAIC,EACAlB,EACAD,EAEJ,OAASkB,EAAME,WACf,IAAK,IAEJD,EAAO,EACP,MACD,IAAK,IAEJA,EAAO,EACP,MACD,IAAK,IACL,IAAK,IAEJA,EAAO,GACP,MAID,QAECA,EAAO,GAKR,GAFAlB,EAAMiB,EAAMG,IACZrB,EAAIsB,SAAUrB,EAAK,KACbsB,SAAUvB,GAAM,CACrB,IAAMJ,EAAUK,GACf,MAAM,IAAIuB,MAAO,2BAA6BvB,GAE/CD,EAAI,CACJ,CAkCD,OAjCKA,EAAI,IAA2B,MAApBkB,EAAME,WAA8B,KAATD,KAC1CnB,EAAI,WAAaA,EAAI,GAEjBA,EAAI,GACRC,IAASD,GAAIyB,SAAUN,GAClBD,EAAMQ,YACVzB,EAAMC,EAASD,EAAKiB,EAAMQ,UAAWR,EAAMS,WAE5C1B,EAAM,IAAMA,IAEZA,EAAMD,EAAEyB,SAAUN,GACZnB,GAAMkB,EAAMQ,UAENR,EAAMQ,YACjBzB,EAAMC,EAASD,EAAKiB,EAAMQ,UAAWR,EAAMS,WAF3C1B,EAAM,GAIFiB,EAAMU,OACV3B,EAAMiB,EAAMU,KAAO3B,IAGP,KAATkB,IACCD,EAAMW,YACV5B,EAAM,KAAOA,GAEdA,EAAQiB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM7B,GAChBU,EAAUmB,KAAM7B,IAEJ,IAATkB,GACCD,EAAMW,WAAiC,MAApB5B,EAAI8B,OAAQ,KACnC9B,EAAM,IAAMA,GAGPA,CACR,CCtFA,IAAI+B,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,EACA3C,EAEJ,OAASiB,EAAME,WACf,IAAK,IACL,IAAK,IACJnB,EAAM0C,EAAEE,cAAe3B,EAAMQ,WAC7B,MACD,IAAK,IACL,IAAK,IACJzB,EAAM0C,EAAEG,QAAS5B,EAAMQ,WACvB,MACD,IAAK,IACL,IAAK,IACCM,EAAKW,GAAM,OACfC,EAAS1B,EAAMQ,WACD,IACbkB,GAAU,GAEX3C,EAAM0C,EAAEE,cAAeD,IAEvB3C,EAAM0C,EAAEI,YAAa7B,EAAMQ,WAEtBR,EAAMW,YACX5B,EAAMiC,EAAQJ,KAAM7B,EAAKwC,EAAoB,OAC7CxC,EAAMiC,EAAQJ,KAAM7B,EAAKuC,EAAoB,KAC7CvC,EAAMiC,EAAQJ,KAAM7B,EAAKsC,EAAyB,KAEnD,MACD,QACC,MAAM,IAAIf,MAAO,mCAAqCN,EAAME,WAc7D,OAZAnB,EAAMiC,EAAQJ,KAAM7B,EAAKkC,EAAmB,SAC5ClC,EAAMiC,EAAQJ,KAAM7B,EAAKmC,EAAmB,SACvClB,EAAMW,YACV5B,EAAMiC,EAAQJ,KAAM7B,EAAKoC,EAAgB,OACzCpC,EAAMiC,EAAQJ,KAAM7B,EAAKqC,EAAsB,SAE3CK,GAAK,GAAKzB,EAAMU,OACpB3B,EAAMiB,EAAMU,KAAO3B,GAEpBA,EAAQiB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM7B,GAChBU,EAAUmB,KAAM7B,EAElB,CCpEA,SAAS+C,EAAQjD,GAChB,IACIC,EADAC,EAAM,GAEV,IAAMD,EAAI,EAAGA,EAAID,EAAGC,IACnBC,GAAO,IAER,OAAOA,CACR,CCJA,IAAIgD,EAAerC,OAAOqC,aACtBC,EAAUC,MAAMD,QAoBpB,SAASE,EAAOvD,GACf,OAASA,GAAUA,CACpB,CASA,SAASwD,EAAYnC,GACpB,IAAIjB,EAAM,CAAA,EAMV,OALAA,EAAImB,UAAYF,EAAME,UACtBnB,EAAIyB,eAAkC,IAApBR,EAAMQ,UAAyB,EAAIR,EAAMQ,UAC3DzB,EAAIG,MAAQc,EAAMd,MAClBH,EAAIqD,MAAQpC,EAAMoC,OAAS,GAC3BrD,EAAIsD,QAAUrC,EAAMqC,QACbtD,CACR,CAmBA,SAASuD,EAAmBC,GAC3B,IAAIC,EACAJ,EACApC,EACAyC,EACAC,EACA3D,EACA4D,EACAlB,EACA3C,EACA8D,EDnDc3D,EAAKC,EAAOC,EAC1BE,ECoDJ,IAAM2C,EAASO,GACd,MAAM,IAAIM,UAAW,8DAAgEN,EAAS,MAI/F,IAFAxD,EAAM,GACN4D,EAAM,EACA7D,EAAI,EAAGA,EAAIyD,EAAOjD,OAAQR,IAE/B,GADAkB,EAAQuC,EAAQzD,GC1ES,iBD2EVkB,EACdjB,GAAOiB,MACD,CAGN,GAFAwC,OAAgC,IAApBxC,EAAMQ,YAClBR,EAAQmC,EAAYnC,IACRE,UACX,MAAM,IAAI2C,UAAW,oEAAqE/D,EAAG,cAAgBkB,EAAQ,MAMtH,IAJKA,EAAMqC,UACVM,EAAM3C,EAAMqC,SAEbD,EAAQpC,EAAMoC,MACRQ,EAAI,EAAGA,EAAIR,EAAM9C,OAAQsD,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,EAAMd,MAAgB,CAG1B,GAFAc,EAAMd,MAAQkB,SAAU4C,UAAWL,GAAO,IAC1CA,GAAO,EACFT,EAAOlC,EAAMd,OACjB,MAAM,IAAI2D,UAAW,wCAA0CF,EAAM,6BAA+B3C,EAAMd,MAAQ,MAE9Gc,EAAMd,MAAQ,IAClBc,EAAMS,UAAW,EACjBT,EAAMd,OAASc,EAAMd,MAEtB,CACD,GAAKsD,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,IAAM/C,EAAUsB,EAAMG,KACrB,MAAM,IAAIG,MAAO,yCAA2CvB,GAG7D0C,EAAIzB,EAAMG,IACVH,EAAM8C,UAAW,CACjB,CACD9C,EAAMG,IAAMqB,EAAcC,EAAGzB,GAC7B,MACD,QACC,MAAM,IAAIM,MAAO,sBAAwBN,EAAME,WAG3CF,EAAMiD,UAAY,GAAKjD,EAAMG,IAAIb,OAASU,EAAMiD,WACpDjD,EAAMG,IAAMH,EAAMG,IAAIgD,UAAW,EAAGnD,EAAMiD,WAEtCjD,EAAM8C,SACV9C,EAAMG,IAAMnB,EAASgB,EAAMG,IAAKH,EAAMd,OAASc,EAAMQ,UAAWR,EAAMS,UAC3DT,EAAMd,QACjBc,EAAMG,KDpLSlB,ECoLOe,EAAMG,IDpLRjB,ECoLac,EAAMd,MDpLZC,ECoLmBa,EAAMS,SDnLnDpB,YAAMH,EAAQD,EAAIK,QACX,EACHL,EAERA,EAAM,EACLA,EAAM6C,EAAQzC,GACdyC,EAAQzC,GAAQJ,IC+KfF,GAAOiB,EAAMG,KAAO,GACpBwC,GAAO,CACP,CAEF,OAAO5D,CACR,CEvNA,IAAIqE,EAAK,6EAYT,SAASC,EAAOC,GACf,IAAItD,EAAQ,CACXqC,QAAaiB,EAAO,GAAQlD,SAAUkD,EAAO,GAAK,SAAO,EACzDlB,MAASkB,EAAO,GAChBpE,MAASoE,EAAO,GAChB9C,UAAa8C,EAAO,GACpBpD,UAAaoD,EAAO,IAKrB,MAHoB,MAAfA,EAAO,SAA8B,IAAfA,EAAO,KACjCtD,EAAMQ,UAAY,KAEZR,CACR,CAeA,SAASuD,EAAgBtE,GACxB,IAAIuE,EACAjB,EACAe,EACAG,EAKJ,IAHAlB,EAAS,GACTkB,EAAO,EACPH,EAAQF,EAAGM,KAAMzE,GACTqE,IACPE,EAAUvE,EAAI0E,MAAOF,EAAML,EAAGQ,UAAYN,EAAO,GAAIhE,SACxCA,QACZiD,EAAOsB,KAAML,GAGM,MAAfF,EAAO,GACXf,EAAOsB,KAAM,KAEbtB,EAAOsB,KAAMR,EAAOC,IAErBG,EAAOL,EAAGQ,UACVN,EAAQF,EAAGM,KAAMzE,GAMlB,OAJAuE,EAAUvE,EAAI0E,MAAOF,IACRnE,QACZiD,EAAOsB,KAAML,GAEPjB,CACR,CC3CA,SAASuB,EAAQ7E,GAChB,IAAI8E,EACAjF,EAEJ,GCf0B,iBDeVG,EACf,MAAM,IAAI4D,UAAWiB,EAAQ,kEAAmE7E,IAGjG,IADA8E,EAAO,CAAEC,EAAU/E,IACbH,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAClCiF,EAAKF,KAAMb,UAAWlE,IAEvB,OAAOmF,EAAYC,MAAO,KAAMH,EACjC,CE7BA,ICkBItF,EDlBA0F,EAAiB3F,OAAOmB,UACxByE,EAAQD,EAAe5D,SACvB8D,EAAeF,EAAeG,iBAC9BC,EAAeJ,EAAeK,iBAC9BC,EAAeN,EAAeO,iBAC9BC,EAAeR,EAAeS,iBCiBjCnG,ECdD,WAEC,IAEC,OADAA,EAAgB,CAAE,EAAE,IAAK,CAAA,IAClB,CACP,CAAC,MAAQoG,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,EAAWvG,MAGzBqG,EAAIM,UAAY3F,GAEhBqF,EAAKC,GAASC,EAAWvG,OAG3ByG,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,EAAehH,EEZf,SAASiH,EAA0BV,EAAKC,EAAMtG,GAC7CF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCdA,SAASD,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCbA,IAAImH,ECMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,IACR,OAASF,GAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAI7B,EAAQ5F,OAAOmB,UAAUY,SCA7B,IAAI2F,EAAM1H,OAAOmB,UAAUwG,eA4B3B,SAASC,EAAYzH,EAAO0H,GAC3B,OACC1H,SAKMuH,EAAItF,KAAMjC,EAAO0H,EACzB,CCpCA,IAAIC,EAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,EAA+B,mBAAXR,EAA0BA,EAAOE,YAAc,GCiCvE,IAAAO,EATKC,ICDL,SAAsBC,GACrB,IAAIC,EACAC,EACA7H,EAEJ,GAAK2H,QACJ,OAAOtC,EAAMxD,KAAM8F,GAEpBE,EAAMF,EAAGT,GACTU,EAAQP,EAAYM,EAAGT,GAGvB,IACCS,EAAGT,QAAgB,CACnB,CAAC,MAAQpB,GACT,OAAOT,EAAMxD,KAAM8F,EACnB,CAQD,OAPA3H,EAAMqF,EAAMxD,KAAM8F,GAEbC,EACJD,EAAGT,GAAgBW,SAEZF,EAAGT,GAEJlH,CACR,EC3BA,SAAsB2H,GACrB,OAAOtC,EAAMxD,KAAM8F,EACpB,EC5BAG,EAAeC,OCMXvG,EAAWuG,EAAOnH,UAAUY,SCEhC,IAAIuF,EAAMW,IAmBV,SAAS/H,EAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBmI,IAGjBhB,ECpBP,SAAenH,GACd,IAEC,OADA4B,EAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDcUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEVA,SAASD,EAAUC,GAClB,OAASqI,EAAarI,IAAWsI,EAAUtI,EAC5C,CCoBAuI,EAAA3I,EAAA,cAAAyI,GACAE,EAAA3I,EAAA,WAAA0I,GCvBA,IAAIE,EAAeL,OAAOM,kBCItBC,GAAeP,EAAOQ,kBCVtBC,GAAQxG,KAAKwG,MCHjB,SAASC,GAAWC,GACnB,OAAQF,GAAME,KAAOA,CACtB,CCPA,SAASD,GAAW7I,GACnB,OACCA,EAAQ+I,GACR/I,EAAQgJ,IACRC,GAAOjJ,EAET,CCAA,SAAS6I,GAAW7I,GACnB,OACCD,EAAUC,IACViJ,GAAOjJ,EAET,CCLA,SAAS6I,GAAW7I,GACnB,OACCD,EAAUC,IACViJ,GAAOjJ,EAAMkJ,UAEf,CCGA,SAASL,GAAW7I,GACnB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCXA,SAASmJ,GAAsBnJ,GAC9B,OACC6I,GAAW7I,IACXA,GAAS,CAEX,CCLA,SAASmJ,GAAsBnJ,GAC9B,OACC6I,GAAW7I,IACXA,EAAMkJ,WAAa,CAErB,CCQA,SAASC,GAAsBnJ,GAC9B,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCeAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICAAC,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,IC9BA,IAAIc,GAAmB,WCMvB,SAASC,GAAcC,GACtB,GAA0B,mBAAdA,EACX,MAAM,IAAIpF,UAAWiB,EAAQ,0DAA2DmE,IAEzF,OASA,SAAgBtJ,GACf,IAAIuJ,EACApJ,EACJ,ICvBF,SAAsBH,GACrB,OACCA,SAEiB,mBAAVA,GACiB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CDaQC,CAAazJ,GAClB,OAAO,EAGR,GAAa,KADbuJ,EAAMvJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,IAAiC,IAA5BmJ,EAAWtJ,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CEjBA,IAAAuJ,GAAAC,GAAAR,GAAAd,aACAuB,GAAAD,GAAAR,GAAAb,UAKAuB,GAAAF,GAAAR,IC5BA,SAASW,GAAW9J,GACnB,MAA0B,kBAAVA,CACjB,CD2BAuI,EAAAsB,GAAA,aAAAH,IACAnB,EAAAsB,GAAA,UAAAD,IEzBA,IAAIG,GAAOC,QCxBPpI,GAAWoI,QAAQhJ,UAAUY,SCSjC,IAAIuF,GAAMW,IAqBV,SAASgC,GAAW9J,GACnB,MAAsB,iBAAVA,IACNA,aAAiBgK,KAGjB7C,GCtBP,SAAenH,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDgBUkC,CAAMpI,GAEoB,qBAAzB6H,EAAa7H,IAGxB,CERA,SAAS8J,GAAW9J,GACnB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCUAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,IC7CA,IAAIjC,GAAwB,iBAAT4D,KAAsBA,KAAO,KCA5C5D,GAA0B,iBAAX6D,OAAwBA,OAAS,KCAhD7D,GAA8B,iBAAf8D,WAA4BA,WAAa,KC2B5D,SAASC,GAAWC,GACnB,GAAKhG,UAAU1D,OAAS,CACvB,IAAMmJ,GAAWO,GAChB,MAAM,IAAInG,UAAWiB,EAAQ,yDAA0DkF,IAExF,GAAKA,EACJ,OC1BK,IAAIC,SAAU,eAAd,ED6BN,CAED,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,MAAM,IAAI9I,MAAO,qDAClB,CE9CA,IAAI+I,GAASN,KAcb,SAASO,KACR,MAC0B,mBAAlBD,GAAOE,QACI,mBAAXA,QACyB,iBAAzBF,GAAOE,OAAQ,MACG,iBAAlBA,OAAQ,IAEjB,CCCA,SAASC,GAAkCxE,EAAKC,EAAMwE,GACrDhL,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOkE,GAET,CCrBA,SAASC,GAAU/K,GAClB,MAA0B,iBAAVA,CACjB,CCfA,IAAIkJ,GAAUnI,OAAOC,UAAUkI,QCQ/B,IAAI/B,GAAMW,IAmBV,SAASiD,GAAU/K,GAClB,MAAsB,iBAAVA,IACNA,aAAiBe,SAGjBoG,GCnBP,SAAenH,GACd,IAEC,OADAkJ,GAAQjH,KAAMjC,IACP,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEjBA,SAAS+K,GAAU/K,GAClB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCHA,SAASgL,GAAmBhL,GAC3B,OACC6I,GAAW7I,IACXA,EAAQ,CAEV,CCLA,SAASgL,GAAmBhL,GAC3B,OACC6I,GAAW7I,IACXA,EAAMkJ,UAAY,CAEpB,CCYA,SAAS8B,GAAmBhL,GAC3B,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CClBA,SAASiL,GAAMjL,GACd,OAAOH,OAAOoL,KAAMpL,OAAQG,GAC7B,CCsBAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICKAC,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICnDA,ICKI4C,GDLAA,QAAgC,IAAhBrL,OAAOoL,KEwB3B,SAASE,GAAanL,GACrB,MAAkC,uBAAzB6H,EAAa7H,EACvB,CDCIoL,GAPJ,WACC,OAAOD,GAAa9G,UACrB,CAKOgH,GAKP,IAAAC,GAAeJ,GElBf,SAAS3H,GAAOuF,GACf,OAASA,GAAMA,CAChB,CCQA,SAASvF,GAAOvD,GACf,OACCD,EAAUC,IACVuL,GAAOvL,EAET,CCTA,SAASuD,GAAOvD,GACf,OACCD,EAAUC,IACVuL,GAAOvL,EAAMkJ,UAEf,CCGA,SAAS3F,GAAOvD,GACf,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCoBAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICzBA,IAAIkD,GAAuB3L,OAAOmB,UAAUyK,qBCE5C,IAAAC,IAXSC,GAAO1J,KAAM,OAAQ,KCe9B,SAASuJ,GAAsBxL,EAAO0H,GACrC,IAAIwD,EACJ,OACClL,YAKDkL,EAAOS,GAAO1J,KAAMjC,EAAO0H,KACbgE,IAAoBX,GAAU/K,IAIzCuD,GAFFmE,GAAYA,IAGXmB,GAAWnB,IACXA,GAAY,GACZA,EAAW1H,EAAMW,OAGZuK,EACR,CCZA,IAAAU,GATKtI,MAAMD,QACNC,MAAMD,QARX,SAAkBrD,GACjB,MAAkC,mBAAzB6H,EAAa7H,EACvB,ECOI6L,GAAa,WCGjB,IAAAC,GATKR,GACU1L,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNqD,GAASrD,IACc,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,IAChB/B,EAAYzH,EAAO,YAClBwL,GAAsBxL,EAAO,SAEhC,EClCIgF,GAAQ1B,MAAMtC,UAAUgE,MCqB5B,SAAS+G,GAAUzC,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAIpF,UAAWiB,EAAQ,0DAA2DmE,IAEzF,OASA,SAAgBtJ,GACf,IAAIuJ,EACApJ,EACJ,IAAMkD,GAASrD,GACd,OAAO,EAGR,GAAa,KADbuJ,EAAMvJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,IAAiC,IAA5BmJ,EAAWtJ,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAAS6L,GAAchM,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCkBAuI,EAAA3I,GAAA,oBALA+J,GAAA/J,KC3BA,IAAIsL,GAAOM,ICFX,WAEA,GDAuC,aEMnCN,IAAQM,GARF,CACT5J,SAAY,MAO0B,YCQnCqK,GAAyB,iBCD7B,SAASC,GAAclM,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CCiCA,SAASpF,GAAS+H,EAAKC,EAAeC,GACrC,IAAI9C,EACApJ,EACJ,IAAM+L,GAAcC,KAAUpB,GAAUoB,GACvC,MAAM,IAAIjI,UAAWiB,EAAQ,8EAA+EgH,IAG7G,GAAa,KADb5C,EAAM4C,EAAIxL,QAET,OAAQ,EAET,GAA0B,IAArB0D,UAAU1D,OAAe,CAC7B,IAAMkI,GAAWwD,GAChB,MAAM,IAAInI,UAAWiB,EAAQ,oEAAqEkH,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAa9C,EACjB,OAAQ,EAETpJ,EAAIkM,CACP,MACGlM,EAAIoJ,EAAM8C,GACD,IACRlM,EAAI,EAGR,MACEA,EAAI,EAGL,GAAKoD,GAAO6I,IACX,KAAQjM,EAAIoJ,EAAKpJ,IAChB,GAAKoD,GAAO4I,EAAIhM,IACf,OAAOA,OAIT,KAAQA,EAAIoJ,EAAKpJ,IAChB,GAAKgM,EAAKhM,KAAQiM,EACjB,OAAOjM,EAIV,OAAQ,CACT,CC3GA,IAAIsE,GAAK,ICOL6H,GAAOlC,KACPmC,GAAWD,GAAKE,UAAYF,GAAKE,SAASC,WCR1CC,GAAaC,UC0BjB,SAASC,KACR,MAAO,yBACR,CCMA,IAAIC,GDPI,0BEER,SAASC,GAAU9M,GAClB,OACCgM,GAAchM,KAGbA,EAAM+M,WAEL/M,EAAMgN,aAGgC,mBAA/BhN,EAAMgN,YAAYF,UACzB9M,EAAMgN,YAAYF,SAAU9M,GAIhC,CCTA,SAASiN,GAAiBlF,GACzB,IAAIpD,EACAuI,EACAC,EAEJ,IAAe,YADfD,EAAOrF,EAAaE,GAAI/C,MAAO,GAAI,KACC,UAATkI,IAAqBnF,EAAEiF,YAAc,CAE/D,GAA0B,iBAD1BG,EAAOpF,EAAEiF,aACQE,KAChB,OAAOC,EAAKD,KAGb,GADAvI,EAAQF,GAAGM,KAAMoI,EAAKvL,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKmI,GAAU/E,GACP,SAEDmF,CACR,CCnBA3E,EAAA3I,GAAA,SAAAwN,ICXA,IAAIxN,GCNY,mBAAP6E,IAGe,iBAAfiI,IAGa,mBAAbH,GCXT,SAAiBxE,GAChB,OAAOsF,GAAUtF,GAAI9G,aACtB,ECqBA,SAAiB8G,GAChB,IAAIuF,EAGJ,OAAW,OAANvF,EACG,OAKM,YAHduF,SAAcvF,GAINsF,GAAUtF,GAAI9G,cAEfqM,CACR,ECzCA,SAASC,GAAwBvN,GAChC,OAASA,EAAMgN,aAAehN,EAAMgN,YAAYhM,YAAchB,CAC/D,6PCTIwN,GAAwB,oBAAXtD,YAA2B,EAASA,OCqDrD,IAAAuD,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlBC,GAAQC,IACZ,OAAO,EAER,IAAMF,KAAKE,GACV,KAEmC,IAAjCxJ,GAASyJ,GAAeH,IACxBjG,EAAYmG,GAAKF,IACJ,OAAbE,GAAKF,IACkB,WAAvBC,GAAQC,GAAKF,KAEbH,GAAwBK,GAAKF,GAE9B,CAAC,MAAQxH,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKO4H,GChDH5C,GAA2B,oBAAXhB,WC0BhBe,oHAKFA,GAJG8C,GChBL,WACC,OAA8C,KAArC9C,GAAM5G,YAAe,IAAK1D,MACpC,CAgBQyH,CAAM,EAAG,G3BFjB,SAAepI,GACd,OAAKmL,GAAanL,GACVoG,GAASpB,GAAM/C,KAAMjC,IAEtBoG,GAASpG,EACjB,E0BDSoG,GEJT,SAAepG,GACd,IAAIgO,EACAC,EACAC,EACA9N,EACAsN,EACAS,EACAhO,EAGJ,GADAC,EAAM,GACD+K,GAAanL,GAAU,CAE3B,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,YAGb,OAAOxB,CACP,CACD,GAAsB,iBAAVJ,GAEX,GAAKA,EAAMW,OAAS,IAAM8G,EAAYzH,EAAO,KAC5C,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,gBAGR,CAEN,IAAe,IADfsM,EAA2B,mBAAVlO,KACQgM,GAAchM,GACtC,OAAOI,EAER6N,EAAkBG,IAAsBF,CACxC,CACD,IAAMR,KAAK1N,EACFiO,GAAuB,cAANP,IAAuBjG,EAAYzH,EAAO0N,IAClEtN,EAAI8E,KAAMnE,OAAQ2M,IAGpB,GAAKW,GAEJ,IADAL,ECnDF,SAAkBhO,GACjB,IAAoB,IAAfsO,KAAyBb,GAC7B,OAAOF,GAAwBvN,GAEhC,IACC,OAAOuN,GAAwBvN,EAC/B,CAAC,MAAQuO,GACT,OAAO,CACP,CACF,CD0CoBhB,CAAwBvN,GACpCG,EAAI,EAAGA,EAAIqO,GAAe7N,OAAQR,IACvCgO,EAAIK,GAAgBrO,GACZ6N,GAAyB,gBAANG,IAAyB1G,EAAYzH,EAAOmO,IACtE/N,EAAI8E,KAAMnE,OAAQoN,IAIrB,OAAO/N,CACR,EFlCA,IAAAqO,GAAexD,GIrBf,SAAS3C,GAAUtI,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCqD,GAASrD,EAEZ,CCNA,SAAS0O,GAAY1O,GAEpB,MAA6B,aAApB2N,GAAQ3N,EAClB,CCQA,ICvBI2O,GDuBAC,GAAM/O,OE9BN8O,GAAW9O,OAAOgP,eDSrBF,GADID,GAAY7O,OAAOgP,gBACZzI,GEKZ,SAAyBC,GACxB,IAAIyI,ECVL,SAAmBzI,GAElB,OAAOA,EAAIM,SACZ,CDOagI,CAAUtI,GACtB,OAAKyI,GAAmB,OAAVA,EACNA,EAEgC,sBAAnCjH,EAAaxB,EAAI2G,aAEd3G,EAAI2G,YAAYhM,UAEnBqF,aAAexG,GACZA,GAAOmB,UAGR,IACR,EFXA,IAAA+N,GAAeJ,GIDf,SAASE,GAAgB7O,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAET2O,GAAU3O,GAClB,CClBA,IAAIgP,GAAkBnP,OAAOmB,UAyC7B,SAASiO,GAAejP,GACvB,IAAI8O,EAGJ,QAAMxG,GAAUtI,OAIhB8O,EAAQD,GAAgB7O,MAOtByH,EAAYzH,EAAO,gBAGpByH,EAAYqH,EAAO,gBACnBJ,GAAYI,EAAM9B,cACmB,sBAArCnF,EAAaiH,EAAM9B,cAGnBvF,EAAYqH,EAAO,kBACnBJ,GAAYI,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmB3I,GAClB,IAAI8I,EAGJ,IAAMA,KAAO9I,EACZ,IAAMoB,EAAYpB,EAAK8I,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUpP,IAGb,CC7EA,IAAIqP,GCwCJ,SAAiBhJ,EAAKiJ,GACrB,IACIrE,EACA1B,EACA4F,EACAI,EACAnP,EACA2H,EACA5H,EAPAqP,GAAa,EAQjB,IAAMxD,GAAc3F,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAU1D,OAAS,EAAI,CAC3B,IAAM2H,GAAUgH,GACf,MAAM,IAAIpL,UAAWiB,EAAQ,qEAAsEmK,IAEpG,GAAK7H,EAAY6H,EAAM,gBAEhBxF,GADN0F,EAAaF,EAAKG,YAEjB,MAAM,IAAIvL,UAAWiB,EAAQ,+DAAgE,aAAcqK,GAG7G,CAID,GAFAjG,GADA0B,EAAOyE,GAAYrJ,IACR1F,OACXP,EAAM,CAAA,EACDoP,EACJ,IAAMrP,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAGfsH,EAAYrH,EADlBmP,EAAMlJ,EADN8I,EAAMlE,EAAM9K,MAMZ4H,EAAI3H,EAAKmP,GACJlM,GAAS0E,GACb3H,EAAKmP,GAAMrK,KAAMiK,GAEjB/O,EAAKmP,GAAQ,CAAExH,EAAGoH,IAPlB/O,EAAKmP,GAAQJ,OAWf,IAAMhP,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAErBC,EAAKiG,EADL8I,EAAMlE,EAAM9K,KACQgP,EAGtB,OAAO/O,CACR,CDxFWuP,CEWH,CAENzE,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCrB,YAAc,IAqBf,SAASsB,GAAUC,GAClB,IAAIjJ,EAAIsH,GAAM2B,GACd,OAASjG,GAAUhD,GAAQA,EAAI,IAChC,2OGKA,SAASkJ,GAAiBD,GACzB,IAAIjJ,EACJ,OAAKgD,GAAUiG,GACPE,GAAmBF,IAAW,KAEjCjR,EAAUiR,GACPE,GAAmBH,GAAUC,KAAa,KAE7CA,GAEChG,GADLjD,EAAIiJ,EAAMG,YAEFpJ,EAGF,IACR,CC5BA,SAASqJ,GAAgBC,GACxB,IAAIC,EACAnR,EAGJ,IADAmR,EAAM,EACAnR,EAAI,EAAGA,EAAIkR,EAAQ1Q,OAAQR,IAC3BkR,EAASlR,GAAM,IACnBmR,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQD,EAAQ1Q,QAEb,EAGD,CACR,CClBA,SAASwB,GAAK2G,GACb,OAAO1G,KAAKD,IAAK2G,EAClB,CCJA,SAASyI,GAAeF,GACvB,IAAIG,EACAC,EACAC,EACAC,EACAC,EACAzR,EAGJ,GAAe,KADfsR,EAAQJ,EAAQ1Q,QAEf,OAAO,EAMR,IAJA6Q,GAAS,EACTE,GAAM,EAENC,EAAKxP,GAAKkP,EAAS,IACblR,EAAI,EAAGA,EAAIsR,EAAOtR,IAAM,CAO7B,GANAyR,EAAKzP,GAAKkP,EAASlR,IACdqR,GAAUI,EAAKD,EACnBH,GAAS,EACEE,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOF,EAGX,OAAO,EAFPG,EAAKC,CAIN,CACD,OAAKF,GAAOF,EACJ,EAEHE,EACG,EAED,CACR,CC5DA,IAAIG,GAAO,WAqBX,SAASC,GAAiB9R,GACzB,cAAgBA,EAAM4G,MAAQiL,WAAe7R,EAAM6G,MAAQgL,EAC5D,CCvBA,IAAIE,GAAU,CACbxB,QAgCD,SAAqBpE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EAjCC1B,QAmDD,SAAqBnE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EApDC/B,MAsED,SAAmB9D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EAvECjC,MAyFD,SAAmB5D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EA1FCpC,KA4GD,SAAkBzD,EAAK6F,GACtB,OAAO7F,EAAK6F,EACb,EA7GC9B,OA+HD,SAAoB/D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAhIChC,OAkJD,SAAoB7D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAnJCnC,MAqKD,SAAmB1D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EAtKClC,OAwLD,SAAoB3D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAzLCpB,QAyMD,SAAqBzE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EA1MCC,QA0ND,SAAuB9F,EAAK6F,GAC3B,OAAO7F,EAAK6F,EACb,GAoBA,SAASlH,GAAQkG,GAChB,IAAIlO,EAAIiP,GAASf,GACjB,MAAkB,mBAANlO,EACJA,EAEDiP,GAAQE,OAChB,CCjQA,IAAIC,GAAU,CACb3B,QAkCD,SAAqBpE,EAAK6F,EAAKhS,GAC9BmM,EAAK6F,GAAQhS,CACd,EAnCCsQ,QAuDD,SAAqBnE,EAAK6F,EAAKhS,GAC9BmM,EAAK6F,GAAQhS,CACd,EAxDCiQ,MA4ED,SAAmB9D,EAAK6F,EAAKhS,GAC5BmM,EAAK6F,GAAQhS,CACd,EA7EC+P,MAiGD,SAAmB5D,EAAK6F,EAAKhS,GAC5BmM,EAAK6F,GAAQhS,CACd,EAlGC4P,KAsHD,SAAkBzD,EAAK6F,EAAKhS,GAC3BmM,EAAK6F,GAAQhS,CACd,EAvHCkQ,OA2ID,SAAoB/D,EAAK6F,EAAKhS,GAC7BmM,EAAK6F,GAAQhS,CACd,EA5ICgQ,OAgKD,SAAoB7D,EAAK6F,EAAKhS,GAC7BmM,EAAK6F,GAAQhS,CACd,EAjKC6P,MAqLD,SAAmB1D,EAAK6F,EAAKhS,GAC5BmM,EAAK6F,GAAQhS,CACd,EAtLC8P,OA0MD,SAAoB3D,EAAK6F,EAAKhS,GAC7BmM,EAAK6F,GAAQhS,CACd,EA3MC4Q,QA6ND,SAAqBzE,EAAK6F,EAAKhS,GAC9BmM,EAAK6F,GAAQhS,CACd,EA9NCiS,QAgPD,SAAuB9F,EAAK6F,EAAKhS,GAChCmM,EAAK6F,GAAQhS,CACd,GAsBA,SAASmS,GAAQnB,GAChB,IAAIlO,EAAIoP,GAASlB,GACjB,MAAkB,mBAANlO,EACJA,EAEDoP,GAAQD,OAChB,CCzRA,IAAIF,GAAU,CACbrB,WAwBD,SAAwBvE,EAAK6F,GAC5B,OAAO7F,EAAIvF,IAAKoL,EACjB,EAzBCvB,UA2CD,SAAuBtE,EAAK6F,GAC3B,OAAO7F,EAAIvF,IAAKoL,EACjB,EA5CCC,QAuED,SAAuB9F,EAAK6F,GAC3B,OAAO7F,EAAIvF,IAAKoL,EACjB,GAqBA,SAASlH,GAAQkG,GAChB,IAAIlO,EAAIiP,GAASf,GACjB,MAAkB,mBAANlO,EACJA,EAEDiP,GAAQE,OAChB,CCvGA,IAAIC,GAAU,CACbxB,WA0BD,SAAwBvE,EAAK6F,EAAKhS,GACjCmM,EAAItF,IAAK7G,EAAOgS,EACjB,EA3BCvB,UA+CD,SAAuBtE,EAAK6F,EAAKhS,GAChCmM,EAAItF,IAAK7G,EAAOgS,EACjB,EAhDCC,QA6ED,SAAuB9F,EAAK6F,EAAKhS,GAChCmM,EAAItF,IAAK7G,EAAOgS,EACjB,GAwBA,SAASG,GAAQnB,GAChB,IAAIlO,EAAIoP,GAASlB,GACjB,MAAkB,mBAANlO,EACJA,EAEDoP,GAAQD,OAChB,CC/GA,IAAIG,GAAc,CACjBC,aAAgB,UAChBC,aAAgB,UAChBhP,MAAS,UACTiP,WAAc,QACdC,WAAc,QACd7F,UAAa,OACb8F,YAAe,SACfC,YAAe,SACfC,WAAc,QACdC,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QCTbC,GAA4C,mBAAjBV,aCL/B,IAAI1S,GAAiC,mBAAjB0S,aAAgCA,aAAe,KCenE,SAASW,KACR,IAAI/H,EACAiB,EFSoBnM,EEPxB,GAAmC,mBAAvBkT,GACX,OAAO,EAGR,IACC/G,EAAM,IAAI+G,GAAoB,CAAE,EAAK,MAAO,KAAMC,MFE3BnT,EEANmM,EADjBjB,GFGE8H,IAAmBhT,aAAiBsS,cACb,0BAAzBzK,EAAa7H,KEFC,IAAbmM,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQjG,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CCpCA,IAAIiC,GAAiC,mBAAjBmF,aAAgCA,kBAAe,EC6BnE,IAAAc,GATKH,KACG7M,GCdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ECJI0R,GAA4C,mBAAjBhB,aCL/B,IAAIzS,GAAiC,mBAAjByS,aAAgCA,aAAe,KCAnE,ICmBIlF,GDnBAA,GAAiC,mBAAjBkF,aAAgCA,kBAAe,ECuBlElF,GCPD,WACC,IAAIjC,EACAiB,EJQoBnM,EINxB,GAAmC,mBAAvBsT,GACX,OAAO,EAGR,IACCnH,EAAM,IAAImH,GAAoB,CAAE,EAAK,MAAO,KAAM,OJC3BtT,EICNmM,EADjBjB,GJEEmI,IAAmBrT,aAAiBqS,cACb,0BAAzBxK,EAAa7H,KIDC,IAAbmM,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQpD,CAEd,CAAC,MAAQ7C,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDjBKqI,GACGnN,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA6R,GAAerG,GGxBXsG,GAA0C,mBAAhBf,YCL9B,IAAI9S,GAAgC,mBAAhB8S,YAA+BA,YAAc,KCAjE,ICmBIvF,GDnBAA,GAAgC,mBAAhBuF,YAA+BA,iBAAc,ECuBhEvF,GCPD,WACC,IAAIjC,EACAiB,EJQmBnM,EINvB,GAAkC,mBAAtB0T,GACX,OAAO,EAGR,IAECvH,EAAM,IAAIuH,GADVvH,EAAM,CAAE,EAAG,MAAO,KAAMN,GAAW,EAAGA,GAAW,IJC3B7L,EIENmM,EADhBjB,GJCEuI,IAAkBzT,aAAiB0S,aACZ,yBAAzB7K,EAAa7H,KIAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQN,GAAW,GACX,IAAbM,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQjG,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKyI,GACGvN,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAiS,GAAezG,GGxBX0G,GAAwC,mBAAfrB,WC4B7B,IAAIsB,GAAY,WCAZC,IAAY,WCjCZnU,GAA+B,mBAAf4S,WAA8BA,WAAa,KCA/D,ICmBIrF,GDnBAA,GAA+B,mBAAfqF,WAA8BA,gBAAa,ECuB9DrF,GCND,WACC,IAAIjC,EACAiB,ENOkBnM,EMLtB,GAAiC,mBAArBgU,GACX,OAAO,EAGR,IACC7H,EAAM,IAAI6H,GAAkB,CAAE,EAAG,MAAO,KAAMF,GAAU,INAnC9T,EMENmM,EADfjB,GNCE2I,IAAiB7T,aAAiBwS,YACX,wBAAzB3K,EAAa7H,KMAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQ4H,EAEd,CAAC,MAAQ7N,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDlBK+I,GACG7N,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAuS,GAAe/G,GGxBXgH,GAA0C,mBAAhB1B,YC4B9B,IAAI2B,GAAa,MCjCbxU,GAAgC,mBAAhB6S,YAA+BA,YAAc,KCAjE,ICmBItF,GDnBAA,GAAgC,mBAAhBsF,YAA+BA,iBAAc,ECuBhEtF,GCPD,WACC,IAAIjC,EACAiB,ELQmBnM,EKNvB,GAAkC,mBAAtBqU,GACX,OAAO,EAGR,IAEClI,EAAM,IAAIkI,GADVlI,EAAM,CAAE,EAAG,MAAO,KAAMiI,GAAW,EAAGA,GAAW,ILC3BpU,EKENmM,EADhBjB,GLCEiJ,IAAkBnU,aAAiByS,aACZ,yBAAzB5K,EAAa7H,KKAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQiI,GAAW,GACX,IAAbjI,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQjG,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKoJ,GACGlO,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA4S,GAAepH,GGxBXqH,GAAwC,mBAAfjC,WC4B7B,IAAIkC,GAAY,MCAZC,IAAY,MCjCZ9U,GAA+B,mBAAf2S,WAA8BA,WAAa,KCA/D,ICmBIpF,GDnBAA,GAA+B,mBAAfoF,WAA8BA,gBAAa,ECuB9DpF,GCND,WACC,IAAIjC,EACAiB,ENOkBnM,EMLtB,GAAiC,mBAArB2U,GACX,OAAO,EAGR,IACCxI,EAAM,IAAIwI,GAAkB,CAAE,EAAG,MAAO,KAAMF,GAAU,INAnCzU,EMENmM,EADfjB,GNCEsJ,IAAiBxU,aAAiBuS,YACX,wBAAzB1K,EAAa7H,KMAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQuI,EAEd,CAAC,MAAQxO,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDlBK0J,GACGxO,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAkT,GAAe1H,GGxBX2H,GAAwC,mBAAfnC,WC4B7B,IAAIoC,GAAY,ICjCZnV,GAA+B,mBAAf+S,WAA8BA,WAAa,KCA/D,ICmBIxF,GDnBAA,GAA+B,mBAAfwF,WAA8BA,gBAAa,ECuB9DxF,GCPD,WACC,IAAIjC,EACAiB,ELQkBnM,EKNtB,GAAiC,mBAArBgV,GACX,OAAO,EAGR,IAEC7I,EAAM,IAAI6I,GADV7I,EAAM,CAAE,EAAG,MAAO,KAAM4I,GAAU,EAAGA,GAAU,ILC1B/U,EKENmM,EADfjB,GLCE4J,IAAiB9U,aAAiB2S,YACX,wBAAzB9K,EAAa7H,KKAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQ4I,GAAU,GACV,IAAb5I,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQjG,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDnBK+J,GACG7O,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAuT,GAAe/H,GGxBXgI,GAAsD,mBAAtBvC,kBCLpC,IAAIhT,GAAsC,mBAAtBgT,kBAAqCA,kBAAoB,KCA7E,ICmBIzF,GDnBAA,GAAsC,mBAAtByF,kBAAqCA,uBAAoB,ECuB5EzF,GCRD,WACC,IAAIjC,EACAiB,EJSyBnM,EIP7B,GAAwC,mBAA5BoV,GACX,OAAO,EAGR,IACCjJ,EAAM,IAAIiJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MJEpCpV,EIANmM,EADtBjB,GJGEiK,IAAwBnV,aAAiB4S,mBAClB,+BAAzB/K,EAAa7H,KIFC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQjG,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKmK,GACGjP,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA2T,GAAenI,GGxBXoI,GAAsC,mBAAd5I,UC4B5B,IAAI6I,GAAW,ICAXC,IAAW,ICjCX7V,GAA8B,mBAAd+M,UAA6BA,UAAY,KCA7D,ICmBIQ,GDnBAA,GAA8B,mBAAdR,UAA6BA,eAAY,ECuB5DQ,GCND,WACC,IAAIjC,EACAiB,ENOiBnM,EMLrB,GAAgC,mBAApB0V,GACX,OAAO,EAGR,IACCvJ,EAAM,IAAIuJ,GAAiB,CAAE,EAAG,MAAO,KAAMF,GAAS,INAlCxV,EMENmM,EADdjB,GNCEqK,IAAgBvV,aAAiB2M,WACV,uBAAzB9E,EAAa7H,KMAC,IAAbmM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQsJ,EAEd,CAAC,MAAQvP,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDlBKyK,GACGvP,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAiU,GAAezI,GGLf,SAAS0I,GAAmB7V,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CC5BA,IAAIsM,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAehW,GACvB,OACG8V,IAAkB9V,aAAiB+V,aACZ,yBAAzBlO,EAAa7H,EAEf,CCSA,IAAA0J,GAAAC,GAAAoB,GAAA1C,aACAuB,GAAAD,GAAAoB,GAAAzC,UAKA2N,GAAAtM,GAAAoB,ICvBA,SAASxC,GAAalC,EAAKC,EAAMtG,GAChCF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCLA,SAASkW,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAIhS,UAAW,0EAEtB,IAAMnE,EAAUoW,GACf,MAAM,IAAIjS,UAAWiB,EAAQ,kEAAmEgR,IAEjG,IAAMpW,EAAUqW,GACf,MAAM,IAAIlS,UAAWiB,EAAQ,uEAAwEiR,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CFSA9N,EAAA0N,GAAA,aAAAvM,IACAnB,EAAA0N,GAAA,UAAArM,IEKArB,EAAa2N,GAAY,OAAQ,cAcjC3N,EAAa2N,GAAY,oBAAqB,GAgBnCnP,EAAEmP,GAAWlV,UAAW,oBAAqB,GAgB7C+F,EAAEmP,GAAWlV,UAAW,aAAc,IAgBtC+F,EAAEmP,GAAWlV,UAAW,YC/GnC,WAEC,IAAIV,EAAM,GAAK+V,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdlW,GAAO,OAAU+V,KAAKG,GAEtBlW,GAAO,MAAQ+V,KAAKG,GAErBlW,GAAO,GAER,IDyHWyG,EAAEmP,GAAWlV,UAAW,UEnInC,WAEC,IAAIZ,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAImW,GAAKF,KAAKE,GACdnW,EAAIoW,GAAKH,KAAKG,GACPpW,CACR,ICXA,IAAIqW,GAAkC,mBAAhBrU,KAAKqU,OAA0BrU,KAAKqU,OAAS,KCK/DC,GAAe,IAAIrE,GAAc,GCuBrC,IAAAsE,GATwB,mBAAZvQ,GACQA,GDApB,SAA2B0C,GAE1B,OADA4N,GAAc,GAAM5N,EACb4N,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAI1S,UAAW,0EAEtB,IAAMnE,EAAUoW,GACf,MAAM,IAAIjS,UAAWiB,EAAQ,kEAAmEgR,IAEjG,IAAMpW,EAAUqW,GACf,MAAM,IAAIlS,UAAWiB,EAAQ,uEAAwEiR,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAe9W,GACvB,OAAKA,aAAiBkW,IAAclW,aAAiB4W,IAInC,iBAAV5W,GACG,OAAVA,GACoB,iBAAbA,EAAMuW,IACO,iBAAbvW,EAAMwW,EAEf,CCPA,SAASO,GAAQjO,GAChB,OAAOD,GAAWC,EAAE,EACrB,CFyBAP,EAAaqO,GAAW,OAAQ,aAchCrO,EAAaqO,GAAW,oBAAqB,GAgBlC7P,EAAE6P,GAAU5V,UAAW,oBAAqB,GAgB5C+F,EAAE6P,GAAU5V,UAAW,aAAc,GAgBrC+F,EAAE6P,GAAU5V,UAAW,YGhHlC,WAEC,IAAIV,EAAM,GAAK+V,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdlW,GAAO,OAAU+V,KAAKG,GAEtBlW,GAAO,MAAQ+V,KAAKG,GAErBlW,GAAO,GAER,IH0HWyG,EAAE6P,GAAU5V,UAAW,UIpIlC,WAEC,IAAIZ,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAImW,GAAKF,KAAKE,GACdnW,EAAIoW,GAAKH,KAAKG,GACPpW,CACR,ICXA,IAAI8Q,GAAoB,EAoBxB,SAAS8F,GAAkBhX,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMgN,YAAYE,MAClBlN,EAAMkR,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,GAoBxB,SAAS+F,GAAmBjX,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMgN,YAAYE,MAClBlN,EAAMkR,oBAAsBA,EAE9B,CCbA,SAASgG,KACR,MACmB,mBAAX9P,GACoB,iBAApBA,EAAQ,QACfK,EAAYL,EAAQ,aACO,iBAApBA,EAAO+P,QAEhB,CC6BA,IAAIC,GAAmBF,KAA+B9P,OAAO+P,SAAW,KCvCxE,SAAShB,GAAMkB,GACd,OAAOA,EAAEd,EACV,CCFA,SAASH,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCSA,SAASc,GAAaxO,EAAGyO,GACxB,OAAO,IAAIlF,GAAcvJ,EAAE0O,OAAQ1O,EAAE2O,WAAY3O,EAAEoI,kBAAkBqG,EAAS,GAAGzO,EAAEnI,OAAO4W,GAC3F,CCFA,SAASD,GAAaxO,EAAGyO,GACxB,OAAO,IAAIjF,GAAcxJ,EAAE0O,OAAQ1O,EAAE2O,WAAY3O,EAAEoI,kBAAkBqG,EAAS,GAAGzO,EAAEnI,OAAO4W,GAC3F,CCTA,SAASG,GAAcC,GACtB,IAAIvX,EACA2H,EACAsP,EAGJ,IADAjX,EAAM,KAEL2H,EAAI4P,EAAGC,QACAC,MAIP,GAAKhC,GADLwB,EAAItP,EAAE/H,QACyBqX,EAAE1W,QAAU,EAC1CP,EAAI8E,KAAMmS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAInT,UAAWiB,EAAQ,kJAAmJkS,IAFjLjX,EAAI8E,KAAM4S,GAAOT,GAAKU,GAAOV,GAG7B,CAEF,OAAOjX,CACR,CCAA,IAAA8Q,GAAA,EAAAmB,GAAAnB,kBACA8G,GAAAd,KAYA,SAAAe,GAAAjY,GACA,OACAA,aAAA6S,IAEA,iBAAA7S,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAE,MACA,oBAAAlN,EAAAgN,YAAAE,OAEA,iBAAAlN,EAAAkY,SAGA,iBAAAlY,EAAAmY,OAGA,CASA,SAAAC,GAAApY,GACA,OACAA,IAAA6S,IAGA,oBAAA7S,EAAAkN,IAEA,CAUA,SAAAmL,GAAAC,EAAAtG,GAEA,OAAA,IAAA4E,GAAA0B,EADAtG,GAAA,GACAsG,EAAAtG,EAAA,GACA,CAyEA,SAAAa,KACA,IAAA4E,EACAc,EACAD,EACA/O,EAGA,GADAgP,EAAAlU,UAAA1D,SACA0V,gBAAAxD,IACA,OAAA,IAAA0F,EACA,IAAA1F,GAEA,IAAA0F,EACA,IAAA1F,GAAAxO,UAAA,IAEA,IAAAkU,EACA,IAAA1F,GAAAxO,UAAA,GAAAA,UAAA,IAEA,IAAAwO,GAAAxO,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAkU,EACAD,EAAA,IAAAjG,GAAA,QACA,GAAA,IAAAkG,EACA,GAAApP,GAAA9E,UAAA,IACAiU,EAAA,IAAAjG,GAAA,EAAAhO,UAAA,SACA,GAAA6H,GAAA7H,UAAA,IAKA,IAHAkF,GADA+O,EAAAjU,UAAA,IACA1D,SAGA0C,GAAAiV,IAAAxB,GAAAwB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnM,GACxB,IAAI5C,EACAxB,EACA5H,EACA8D,EAIJ,IAFAsF,EAAM4C,EAAIxL,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,IAAM2W,GADN/O,EAAIoE,EAAKhM,IAER,OAAO,KAERmY,EAAKrU,GAAM6T,GAAO/P,GAClBuQ,EAAKrU,EAAE,GAAM8T,GAAOhQ,GACpB9D,GAAK,CACL,CACD,OAAOqU,CACR,CDsKAE,CAAA,IAAAnG,GAAA,EAAA9I,GAAA+O,GACA,OAAAA,EAAA,CAEA,IAAAvB,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,6GAAAoE,IAGA+O,EAAA,IAAAjG,GAAAhO,UAAA,GACA,MACA,CACA,GAAA2S,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAvB,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,6HAAAoE,IAEA+O,EAAA,IAAAjG,GAAAiG,EACA,MACA,GAAAtC,GAAA3R,UAAA,IAAA,CAEA,IAAAwE,IADAyP,EAAAjU,UAAA,IACA8M,WAAAD,IACA,MAAA,IAAAuH,WAAAtT,EAAA,yFAAA+L,GAAAoH,EAAAnH,aAEAmH,EAAA,IAAAjG,GAAAiG,EACA,KAAA,KAAAhQ,GAAAjE,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAiU,EAAAjU,UAAA,IACA,IAAA2T,GACA,MAAA,IAAA9T,UAAAiB,EAAA,mJAAAmT,IAEA,IAAA5J,GAAA4J,EAAAM,KACA,MAAA,IAAA1U,UAAAiB,EAAA,qHAAAmT,IAGA,IAAA5J,IADA4J,EAAAA,EAAAM,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,qHAAAmT,IAGA,IADAA,EAAAZ,GAAAY,cACA3W,MACA,MAAA2W,EAEAA,EAAA,IAAAjG,GAAAiG,EAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAjU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAmT,IAGA,IAAAnP,GADAsO,EAAApT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAsS,IAEA,IAAA5O,GAAA4O,EAAAvG,IACA,MAAA,IAAAuH,WAAAtT,EAAA,uEAAA+L,GAAAuG,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA1P,IADAU,EAAA+O,EAAAnH,WAAAsG,GACAvG,IACA,MAAA,IAAAuH,WAAAtT,EAAA,oGAAA+L,GAAA3H,IAEA+O,EAAA,IAAAjG,GAAAiG,EAAAb,EACA,KAAA,CAEA,IAAAtO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA2H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAtT,EAAA,iJAAAoE,EAAA2H,KAEAoH,EAAA,IAAAjG,GAAAiG,EAAAb,EAAA,EAAAlO,EACA,CACA,CAIA,OAHAhB,EAAA8N,KAAA,UAAAiC,GACA/P,EAAA8N,KAAA,UAAAiC,EAAA3X,OAAA,GAEA0V,IACA,CEzQA,SAASF,GAAMkB,GACd,OAAOA,EAAEd,EACV,CCFA,SAASH,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCEA,SAASkB,GAAcC,GACtB,IAAIvX,EACA2H,EACAsP,EAGJ,IADAjX,EAAM,KAEL2H,EAAI4P,EAAGC,QACAC,MAIP,GAAKhC,GADLwB,EAAItP,EAAE/H,QACyBqX,EAAE1W,QAAU,EAC1CP,EAAI8E,KAAMmS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAInT,UAAWiB,EAAQ,kJAAmJkS,IAFjLjX,EAAI8E,KAAMiR,GAAMkB,GAAKjB,GAAMiB,GAG3B,CAEF,OAAOjX,CACR,CJ+PAmI,EAAAsK,GAAA,oBAAA3B,IAeA3I,EAAAsK,GAAA,OAAA,kBAmDA9L,EAAA8L,GAAA,QAAA,SAAAgG,GACA,IAAAC,EACAP,EACAQ,EACA3Y,EACAkY,EACAU,EACApS,EACA2C,EACA0P,EACAlR,EACA5H,EACA8D,EACA,IAAAyK,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAkU,GAAA/B,MACA,MAAA,IAAAnS,UAAA,6DAGA,IADAqU,EAAAlU,UAAA1D,QACA,EAAA,CAEA,IAAA+N,GADAqK,EAAA1U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4T,IAEAR,EAAA,IACAO,EAAAzU,UAAA,GAEA,CACA,GAAA4T,GAAAY,GAAA,CAEA,GADAtP,EAAAsP,EAAAlY,OACAoY,EAAA,CAIA,IAFAT,GADAlY,EAAA,IAAAiW,KAAA9M,IACA4O,QACAlU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA2W,GADA/O,EAAAgR,EAAA9W,KAAA6W,EAAAD,EAAAjS,IAAAzG,GAAAA,IAEAmY,EAAArU,GAAA6T,GAAA/P,GACAuQ,EAAArU,EAAA,GAAA8T,GAAAhQ,OACA,MAAA8N,GAAA9N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAuQ,EAAArU,GAAA8D,EAAA,GACAuQ,EAAArU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAiW,KAAAwC,EACA,CACA,GAAA3M,GAAA2M,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAxP,EAAAsP,EAAAlY,OAEAiG,EADAiS,EAAAjS,KAAAiS,EAAAhS,IACAqS,GAAA,WAEApO,GAAA,WAGA3K,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA,IAAA2W,GAAAlQ,EAAAiS,EAAA1Y,IAAA,CACA8Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,+FAAA,EAAAoE,IAIA,IADA+O,GADAlY,EAAA,IAAAiW,KAAA9M,EAAA,IACA4O,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA4Y,EAAA9W,KAAA6W,EAAAlS,EAAAiS,EAAA1Y,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAkY,GADAlY,EAAA,IAAAiW,KAAA9M,IACA4O,QACAlU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA2W,GADA/O,EAAAgR,EAAA9W,KAAA6W,EAAAlS,EAAAiS,EAAA1Y,GAAAA,IAEAmY,EAAArU,GAAA6T,GAAA/P,GACAuQ,EAAArU,EAAA,GAAA8T,GAAAhQ,OACA,MAAA8N,GAAA9N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAuQ,EAAArU,GAAA8D,EAAA,GACAuQ,EAAArU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAiW,KAAAwC,EACA,CACA,GAAAvQ,GAAAuQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,6FAAA0T,IAOA,GAJAG,EADAD,EK/bA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI1Y,EACA2H,EACAsP,EACAlX,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI4P,EAAGC,QACAC,MAKP,GAFA1X,GAAK,EAEA0V,GADLwB,EAAI0B,EAAK9W,KAAM6W,EAAS/Q,EAAE/H,MAAOG,KACFkX,EAAE1W,QAAU,EAC1CP,EAAI8E,KAAMmS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAInT,UAAWiB,EAAQ,+IAAgJkS,IAF9KjX,EAAI8E,KAAM4S,GAAOT,GAAKU,GAAOV,GAG7B,CAEF,OAAOjX,CACR,CLwaA+Y,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAEAU,aAAArX,MACA,MAAAqX,EAKA,IADAV,GADAlY,EAAA,IAAAiW,KADA9M,EAAAyP,EAAArY,OAAA,IAEAwX,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA6Y,EAAA7Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0T,GACA,IAoBAtQ,EAAAsK,GAAA,MAAA,WACA,IAAAzN,EACAjF,EACA,IAAAuO,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAkU,GAAA/B,MACA,MAAA,IAAAnS,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAkW,KAAAjR,EACA,IAuDA2B,EAAA8L,GAAA7R,UAAA,MAAA,SAAAgR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA2E,GAAAmJ,GACA,MAAA,IAAA9N,UAAAiB,EAAA,0DAAA6M,IAKA,GAHAA,EAAA,IACAA,GAAAqE,KAAA6B,WAEAlG,EAAA,GAAAA,GAAAqE,KAAA6B,SAGA,OAAAG,GAAAhC,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAgI,GAAA7R,UAAA,UAAA,WACA,OAAAqV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAgI,GAAA7R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAgI,GAAA7R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAV,UACA,IAiBA1Q,EAAA8L,GAAA7R,UAAA,oBAAA6R,GAAA3B,mBAuCA3I,EAAAsK,GAAA7R,UAAA,cAAA,SAAAoY,EAAAC,GACA,IAAApB,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA0V,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAAhV,UAAA,IAEAgS,IACA,IAqCAtP,EAAA8L,GAAA7R,UAAA,WAAA,WACA,IAAAiJ,EACAsP,EACAhQ,EACA+O,EACAnR,EACAhH,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAiBA,OAfA+F,EAAAoM,KACAiC,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAA,CAAAG,EAAAkY,GAAAC,EAAAnY,IACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAAuP,SACA,IAjDAD,CAkDA,IA+BAhR,EAAAsK,GAAA7R,UAAA,SAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,IAAAmJ,EAAArH,KAAA6W,EAAAT,GAAAC,EAAAnY,GAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA2CA9N,EAAAsK,GAAA7R,UAAA,QAAA,SAAAhB,EAAAqZ,EAAAI,GACA,IAAAnB,EACA/O,EACAyI,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA9W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAsY,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwQ,GACA,MAAA,IAAAnV,UAAAiB,EAAA,qEAAAkU,IAQA,GANAA,EAAA,IACAA,GAAA9P,GACA,IACA8P,EAAA,GAGAhV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,oEAAAsU,IAEAA,EAAA,IACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAGAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,MACAkQ,EAAAlQ,CAEA,MACA8P,EAAA,EACAI,EAAAlQ,EAIA,IAFAgN,EAAAuB,GAAA9X,GACAwW,EAAAuB,GAAA/X,GACAG,EAAAkZ,EAAAlZ,EAAAsZ,EAAAtZ,IAEAmY,EADAtG,EAAA,EAAA7R,GACAoW,EACA+B,EAAAtG,EAAA,GAAAwE,EAEA,OAAAH,IACA,IA2CA9N,EAAAsK,GAAA7R,UAAA,UAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAlY,EACAD,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAgP,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAkX,EAAAgB,GAAAC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,OACAjW,EAAA8E,KAAAmS,GAGA,OAAA,IAAAhB,KAAArJ,YAAA5M,EACA,IAsCAmI,EAAAsK,GAAA7R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADAkX,EAAAgB,GAAAC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAgB,CAGA,IAgCA9O,EAAAsK,GAAA7R,UAAA,aAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADAkX,EAAAgB,GAAAC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IAsCAoI,EAAAsK,GAAA7R,UAAA,YAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADAkX,EAAAgB,GAAAC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAgB,CAGA,IAgCA9O,EAAAsK,GAAA7R,UAAA,iBAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADAkX,EAAAgB,GAAAC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IA4BAoI,EAAAsK,GAAA7R,UAAA,WAAA,SAAA0Y,EAAAZ,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAGA,IADApB,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAkX,EAAAgB,GAAAC,EAAAnY,GACAuZ,EAAAzX,KAAA6W,EAAAzB,EAAAlX,EAAAkW,KAEA,IAyCAtP,EAAA8L,GAAA7R,UAAA,OAAA,SAAAgR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAiF,GAAA6I,GACA,MAAA,IAAA9N,UAAAiB,EAAA,qEAAA6M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAAG,GAAAhC,KAAA8B,QAAAnG,EACA,IAmCAzJ,EAAAsK,GAAA7R,UAAA,YAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAzJ,EAAAsK,GAAA7R,UAAA,WAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA7R,EAGA,OAAA,CACA,IAyBA4G,EAAA8L,GAAA7R,UAAA,QAAA,SAAA2Y,GACA,IAAAvZ,EACAkY,EACAsB,EACAzZ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAiZ,EAAA,QACA,KAAA7O,GAAA4O,GAGA,MAAA,IAAAzV,UAAAiB,EAAA,kEAAAwU,IAFAC,EAAAD,CAGA,CAGA,IAFAvZ,EAAA,GACAkY,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAAmT,GAAAC,EAAAnY,GAAAyB,YAEA,OAAAxB,EAAAyZ,KAAAD,EACA,IA4BA7S,EAAA8L,GAAA7R,UAAA,QAAA,WACA,IAAAiJ,EACAsP,EACAhQ,EACApC,EACAhH,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAgBA,OAdA+F,EAAAoM,KACA9M,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAAG,EACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAAgB,MACA,IAjDAsO,CAkDA,IAsCAhR,EAAAsK,GAAA7R,UAAA,eAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAKA,IAHA3B,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,GAAA,EAAAA,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA7R,EAGA,OAAA,CACA,IAgBA0K,GAAAgI,GAAA7R,UAAA,UAAA,WACA,OAAAqV,KAAA6B,OACA,IAyCA3P,EAAAsK,GAAA7R,UAAA,OAAA,SAAA0Y,EAAAZ,GACA,IAAAgB,EACAxB,EACAlY,EACAD,EACA4H,EACA,IAAAkQ,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAA2W,GADA/O,EAAA2R,EAAAzX,KAAA6W,EAAAT,GAAAC,EAAAnY,GAAAA,EAAAkW,OAEAyD,EAAA,EAAA3Z,GAAA2X,GAAA/P,GACA+R,EAAA,EAAA3Z,EAAA,GAAA4X,GAAAhQ,OACA,KAAA8N,GAAA9N,IAAA,IAAAA,EAAApH,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHA+R,EAAA,EAAA3Z,GAAA4H,EAAA,GACA+R,EAAA,EAAA3Z,EAAA,GAAA4H,EAAA,EAGA,CAEA,OAAA3H,CACA,IAmCAmI,EAAAsK,GAAA7R,UAAA,UAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA2B,EACA1Q,EAEApJ,EAEA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAA5B,GAAAC,EAAA,GACAnY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IAEA8Z,EAAAF,EAAAE,EADA5B,GAAAC,EAAAnY,GACAA,EAAAkW,MAEA,OAAA4D,CACA,IAmCA1R,EAAAsK,GAAA7R,UAAA,eAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA2B,EACA1Q,EAEApJ,EAEA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAA5B,GAAAC,EAAA/O,EAAA,GACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IAEA8Z,EAAAF,EAAAE,EADA5B,GAAAC,EAAAnY,GACAA,EAAAkW,MAEA,OAAA4D,CACA,IAmDAlT,EAAA8L,GAAA7R,UAAA,WAAA,WACA,IAAAsX,EACAU,EACAzP,EACA2Q,EACA/Z,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAKA,IAHAqF,EAAA8M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACA+B,EAAAtR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA8D,EAAAsF,EAAApJ,EAAA,EACA6Y,EAAAV,EAAA,EAAAnY,GACAmY,EAAA,EAAAnY,GAAAmY,EAAA,EAAArU,GACAqU,EAAA,EAAArU,GAAA+U,EACAA,EAAAV,EAAA,EAAAnY,EAAA,GACAmY,EAAA,EAAAnY,EAAA,GAAAmY,EAAA,EAAArU,EAAA,GACAqU,EAAA,EAAArU,EAAA,GAAA+U,EAEA,OAAA3C,IACA,IAgEAtP,EAAA8L,GAAA7R,UAAA,OAAA,SAAAhB,GAEA,IAAAma,EACAnI,EACAsG,EACAU,EACAC,EACAiB,EACAnS,EACA5H,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAGA,GADAoU,EAAAjC,KAAA8B,QACA9T,UAAA1D,OAAA,GAEA,IAAAwI,GADA6I,EAAA3N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6M,SAGAA,EAAA,EAEA,GAAA8E,GAAA9W,GAAA,CACA,GAAAgS,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAtT,EAAA,kEAAA6M,IAKA,OAFAsG,EADAtG,GAAA,GACA8F,GAAA9X,QACAsY,EAAAtG,EAAA,GAAA+F,GAAA/X,GAEA,CACA,GAAAiY,GAAAjY,GAAA,CAEA,GAAAgS,GADAkI,EAAAla,EAAAkY,SACA7B,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAAna,EAAAmY,QAGAlU,EAAAqU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAxT,GACAkW,EAAA1C,WAAA0C,EAAAhJ,WAAAlN,EAEA,CAGA,IADA+U,EAAA,IAAA3G,GAAA8H,EAAAxZ,QACAR,EAAA,EAAAA,EAAAga,EAAAxZ,OAAAR,IACA6Y,EAAA7Y,GAAAga,EAAAha,GAEAga,EAAAnB,CACA,CAGA,IAFAhH,GAAA,EACA/N,EAAA,EACA9D,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACAmY,EAAAtG,GAAAmI,EAAAlW,GACAqU,EAAAtG,EAAA,GAAAmI,EAAAlW,EAAA,GACA+N,GAAA,EACA/N,GAAA,CAGA,KAhCA,CAiCA,IAAAiI,GAAAlM,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAka,EAAAla,EAAAW,OACAR,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA,IAAA2W,GAAA9W,EAAAG,IAAA,CACA8Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAmD,GACA,MAAA,IAAAzB,WAAAtT,EAAA,6GAAA+U,IAEA,GAAAlI,EAAAkI,EAAA,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAAna,EAGAiE,EAAAqU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAxT,GACAkW,EAAA1C,WAAA0C,EAAAhJ,WAAAlN,EAEA,CAGA,IADA+U,EAAA,IAAA3G,GAAA6H,GACA/Z,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA6Y,EAAA7Y,GAAAga,EAAAha,GAEAga,EAAAnB,CACA,CAIA,IAHAhH,GAAA,EACAkI,GAAA,EACAjW,EAAA,EACA9D,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACAmY,EAAAtG,GAAAmI,EAAAlW,GACAqU,EAAAtG,EAAA,GAAAmI,EAAAlW,EAAA,GACA+N,GAAA,EACA/N,GAAA,EAEA,MACA,CAEA,GAAA+N,EAAAkI,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAzG,GAAA,EACA7R,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA4H,EAAA/H,EAAAG,GACAmY,EAAAtG,GAAA8F,GAAA/P,GACAuQ,EAAAtG,EAAA,GAAA+F,GAAAhQ,GACAiK,GAAA,CAxDA,CA+DA,IA2EAzJ,EAAAsK,GAAA7R,UAAA,SAAA,SAAAqY,EAAAI,GACA,IAAAW,EACAN,EACA1Z,EACA4R,EACAsG,EACA/O,EACApJ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA0Y,EAAA,EACAI,EAAAlQ,MACA,CACA,IAAAV,GAAAwQ,GACA,MAAA,IAAAnV,UAAAiB,EAAA,oEAAAkU,IAQA,GANAA,EAAA,IACAA,GAAA9P,GACA,IACA8P,EAAA,GAGA,IAAAhV,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAQA,IANA6Q,EADAf,EAAAI,EACAA,EAAAJ,EAEA,EAGAS,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAoN,IACAjC,QACAhY,EAAA,EAAAA,EAAAia,EAAAja,IACA6R,EAAA,GAAA7R,EAAAkZ,GACAS,EAAA,EAAA3Z,GAAAmY,EAAAtG,GACA8H,EAAA,EAAA3Z,EAAA,GAAAmY,EAAAtG,EAAA,GAEA,OAAA5R,CACA,IA+BAmI,EAAAsK,GAAA7R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,GAAAmJ,EAAArH,KAAA6W,EAAAT,GAAAC,EAAAnY,GAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA6EAtP,EAAA8L,GAAA7R,UAAA,QAAA,SAAAqZ,GACA,IAAArB,EACAV,EACA/O,EACApJ,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACAc,EAAA,GACA7Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA6Y,EAAA9T,KAAAmT,GAAAC,EAAAnY,IAGA,IADA6Y,EAAAsB,KAAAD,GACAla,EAAA,EAAAA,EAAAoJ,EAAApJ,IAEAmY,EADArU,EAAA,EAAA9D,GACA2X,GAAAkB,EAAA7Y,IACAmY,EAAArU,EAAA,GAAA8T,GAAAiB,EAAA7Y,IAEA,OAAAkW,IACA,IA2EA9N,EAAAsK,GAAA7R,UAAA,YAAA,SAAAuZ,EAAAd,GACA,IAAAlC,EACAe,EACA/O,EACA,IAAA0O,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA4Z,EAAA,EACAd,EAAAlQ,MACA,CACA,IAAAV,GAAA0R,GACA,MAAA,IAAArW,UAAAiB,EAAA,oEAAAoV,IAQA,GANAA,EAAA,IACAA,GAAAhR,GACA,IACAgR,EAAA,GAGA,IAAAlW,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAWA,OAVAgR,GAAAhR,GACAA,EAAA,EACAgO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAlQ,EAAA,EACAgO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA3H,EAAAkQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAhO,EAAA,EAAA,EAAAA,EACA,IAwBAhB,EAAAsK,GAAA7R,UAAA,kBAAA,SAAAwZ,EAAAC,GACA,IAAAnL,EACAoL,EACAta,EACAkY,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACA+Z,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAtW,UAAAiB,EAAA,yFAAAqV,IAFAE,EAAAF,CAGA,CACA,GAAAnW,UAAA1D,OAAA,EACA2O,EAAA,CAAA,MACA,KAAAhH,GAAAmS,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,qEAAAsV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAAmT,GAAAC,EAAAnY,GAAAwa,eAAAD,EAAApL,IAEA,OAAAlP,EAAAyZ,KAAA,IACA,IAmDA9S,EAAA8L,GAAA7R,UAAA,cAAA,WACA,IAAA8Y,EACA1Z,EACAmJ,EACA+O,EACAnY,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAMA,IAJAqF,EAAA8M,KAAA6B,QACA9X,EAAA,IAAAiW,KAAArJ,YAAAzD,GACA+O,EAAAjC,KAAA8B,QACA2B,EAAA1Z,EAAA+X,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8D,EAAAsF,EAAApJ,EAAA,EACA2Z,EAAA,EAAA3Z,GAAAmY,EAAA,EAAArU,GACA6V,EAAA,EAAA3Z,EAAA,GAAAmY,EAAA,EAAArU,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA8L,GAAA7R,UAAA,YAAA,SAAAqZ,GACA,IAAArB,EACAV,EACA/O,EACApJ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACAc,EAAA,GACA7Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA6Y,EAAA9T,KAAAmT,GAAAC,EAAAnY,IAGA,OADA6Y,EAAAsB,KAAAD,GACA,IAAAxH,GAAAmG,EACA,IAoBAjS,EAAA8L,GAAA7R,UAAA,YAAA,WACA,IAAAZ,EACAkY,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,IAFA9D,EAAA,GACAkY,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAAmT,GAAAC,EAAAnY,GAAAyB,YAEA,OAAAxB,EAAAyZ,KAAA,IACA,IA0CA9S,EAAA8L,GAAA7R,UAAA,UAAA,WACA,IAAAuY,EACAtP,EACAV,EACApC,EACAmR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAiBA,OAfA+F,EAAAoM,KACAiC,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAAqY,GAAAC,EAAAnY,GACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAA2Q,QACA,IAjDArB,CAkDA,IAuCAhR,EAAAsK,GAAA7R,UAAA,QAAA,SAAA6Z,EAAA7a,GACA,IAAAsY,EACAlY,EACAmJ,EACA,IAAA0O,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA2E,GAAAgS,GACA,MAAA,IAAA3W,UAAAiB,EAAA,oEAAA0V,IAMA,GAJAtR,EAAA8M,KAAA6B,QACA2C,EAAA,IACAA,GAAAtR,GAEAsR,EAAA,GAAAA,GAAAtR,EACA,MAAA,IAAAkP,WAAAtT,EAAA,kEAAA0V,IAEA,IAAA/D,GAAA9W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAsY,GADAlY,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA8B,UACAA,SACA,EAAA0C,GAAA/C,GAAA9X,GACAsY,EAAA,EAAAuC,EAAA,GAAA9C,GAAA/X,GACAI,CACA,IM15FA,IAAA8Q,GAAA,EAAAoB,GAAApB,kBACA8G,GAAAd,KAYA,SAAAe,GAAAjY,GACA,OACAA,aAAA8S,IAEA,iBAAA9S,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAE,MACA,oBAAAlN,EAAAgN,YAAAE,OAEA,iBAAAlN,EAAAkY,SAGA,iBAAAlY,EAAAmY,OAGA,CASA,SAAAC,GAAApY,GACA,OACAA,IAAA8S,IAGA,mBAAA9S,EAAAkN,IAEA,CAUA,SAAA4N,GAAAxC,EAAAtG,GAEA,OAAA,IAAAkE,GAAAoC,EADAtG,GAAA,GACAsG,EAAAtG,EAAA,GACA,CAyEA,SAAAc,KACA,IAAA2E,EACAc,EACAD,EACA/O,EAGA,GADAgP,EAAAlU,UAAA1D,SACA0V,gBAAAvD,IACA,OAAA,IAAAyF,EACA,IAAAzF,GAEA,IAAAyF,EACA,IAAAzF,GAAAzO,UAAA,IAEA,IAAAkU,EACA,IAAAzF,GAAAzO,UAAA,GAAAA,UAAA,IAEA,IAAAyO,GAAAzO,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAkU,EACAD,EAAA,IAAAhG,GAAA,QACA,GAAA,IAAAiG,EACA,GAAApP,GAAA9E,UAAA,IACAiU,EAAA,IAAAhG,GAAA,EAAAjO,UAAA,SACA,GAAA6H,GAAA7H,UAAA,IAKA,IAHAkF,GADA+O,EAAAjU,UAAA,IACA1D,SAGA0C,GAAAiV,IAAAxB,GAAAwB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnM,GACxB,IAAI5C,EACAxB,EACA5H,EACA8D,EAIJ,IAFAsF,EAAM4C,EAAIxL,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,IAAM2W,GADN/O,EAAIoE,EAAKhM,IAER,OAAO,KAERmY,EAAKrU,GAAMkS,GAAMpO,GACjBuQ,EAAKrU,EAAE,GAAMmS,GAAMrO,GACnB9D,GAAK,CACL,CACD,OAAOqU,CACR,CDsKAE,CAAA,IAAAlG,GAAA,EAAA/I,GAAA+O,GACA,OAAAA,EAAA,CAEA,IAAAvB,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,6GAAAoE,IAGA+O,EAAA,IAAAhG,GAAAjO,UAAA,GACA,MACA,CACA,GAAA2S,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAvB,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,6HAAAoE,IAEA+O,EAAA,IAAAhG,GAAAgG,EACA,MACA,GAAAtC,GAAA3R,UAAA,IAAA,CAEA,IAAAwE,IADAyP,EAAAjU,UAAA,IACA8M,WAAAD,IACA,MAAA,IAAAuH,WAAAtT,EAAA,yFAAA+L,GAAAoH,EAAAnH,aAEAmH,EAAA,IAAAhG,GAAAgG,EACA,KAAA,KAAAhQ,GAAAjE,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAiU,EAAAjU,UAAA,IACA,IAAA2T,GACA,MAAA,IAAA9T,UAAAiB,EAAA,mJAAAmT,IAEA,IAAA5J,GAAA4J,EAAAM,KACA,MAAA,IAAA1U,UAAAiB,EAAA,qHAAAmT,IAGA,IAAA5J,IADA4J,EAAAA,EAAAM,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,qHAAAmT,IAGA,IADAA,EAAAZ,GAAAY,cACA3W,MACA,MAAA2W,EAEAA,EAAA,IAAAhG,GAAAgG,EAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAjU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAmT,IAGA,IAAAnP,GADAsO,EAAApT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAsS,IAEA,IAAA5O,GAAA4O,EAAAvG,IACA,MAAA,IAAAuH,WAAAtT,EAAA,uEAAA+L,GAAAuG,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA1P,IADAU,EAAA+O,EAAAnH,WAAAsG,GACAvG,IACA,MAAA,IAAAuH,WAAAtT,EAAA,oGAAA+L,GAAA3H,IAEA+O,EAAA,IAAAhG,GAAAgG,EAAAb,EACA,KAAA,CAEA,IAAAtO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA2H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAtT,EAAA,iJAAAoE,EAAA2H,KAEAoH,EAAA,IAAAhG,GAAAgG,EAAAb,EAAA,EAAAlO,EACA,CACA,CAIA,OAHAhB,EAAA8N,KAAA,UAAAiC,GACA/P,EAAA8N,KAAA,UAAAiC,EAAA3X,OAAA,GAEA0V,IACA,CEzQA,SAASqB,GAAcC,GACtB,IAAIvX,EACA2H,EAGJ,IADA3H,EAAM,KAEL2H,EAAI4P,EAAGC,QACAC,MAGPzX,EAAI8E,KAAM8E,GAASjC,EAAE/H,QAEtB,OAAOI,CACR,CF2QAmI,EAAAuK,GAAA,oBAAA5B,IAeA3I,EAAAuK,GAAA,OAAA,mBAmDA/L,EAAA+L,GAAA,QAAA,SAAA+F,GACA,IAAAC,EACAP,EACAQ,EACA3Y,EACAkY,EACAU,EACApS,EACA2C,EACA0P,EACAlR,EACA5H,EACA8D,EACA,IAAAyK,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAkU,GAAA/B,MACA,MAAA,IAAAnS,UAAA,6DAGA,IADAqU,EAAAlU,UAAA1D,QACA,EAAA,CAEA,IAAA+N,GADAqK,EAAA1U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4T,IAEAR,EAAA,IACAO,EAAAzU,UAAA,GAEA,CACA,GAAA4T,GAAAY,GAAA,CAEA,GADAtP,EAAAsP,EAAAlY,OACAoY,EAAA,CAIA,IAFAT,GADAlY,EAAA,IAAAiW,KAAA9M,IACA4O,QACAlU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA2W,GADA/O,EAAAgR,EAAA9W,KAAA6W,EAAAD,EAAAjS,IAAAzG,GAAAA,IAEAmY,EAAArU,GAAAkS,GAAApO,GACAuQ,EAAArU,EAAA,GAAAmS,GAAArO,OACA,MAAA8N,GAAA9N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAuQ,EAAArU,GAAA8D,EAAA,GACAuQ,EAAArU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAiW,KAAAwC,EACA,CACA,GAAA3M,GAAA2M,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAxP,EAAAsP,EAAAlY,OAEAiG,EADAiS,EAAAjS,KAAAiS,EAAAhS,IACAqS,GAAA,WAEApO,GAAA,WAGA3K,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA,IAAA2W,GAAAlQ,EAAAiS,EAAA1Y,IAAA,CACA8Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAxN,GACA,MAAA,IAAAkP,WAAAtT,EAAA,gGAAAoE,IAIA,IADA+O,GADAlY,EAAA,IAAAiW,KAAA9M,EAAA,IACA4O,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA4Y,EAAA9W,KAAA6W,EAAAlS,EAAAiS,EAAA1Y,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAkY,GADAlY,EAAA,IAAAiW,KAAA9M,IACA4O,QACAlU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA2W,GADA/O,EAAAgR,EAAA9W,KAAA6W,EAAAlS,EAAAiS,EAAA1Y,GAAAA,IAEAmY,EAAArU,GAAAkS,GAAApO,GACAuQ,EAAArU,EAAA,GAAAmS,GAAArO,OACA,MAAA8N,GAAA9N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAuQ,EAAArU,GAAA8D,EAAA,GACAuQ,EAAArU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAiW,KAAAwC,EACA,CACA,GAAAvQ,GAAAuQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,6FAAA0T,IAOA,GAJAG,EADAD,EG/bA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI1Y,EACA2H,EACAsP,EACAlX,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI4P,EAAGC,QACAC,MAKP,GAFA1X,GAAK,EAEA0V,GADLwB,EAAI0B,EAAK9W,KAAM6W,EAAS/Q,EAAE/H,MAAOG,KACFkX,EAAE1W,QAAU,EAC1CP,EAAI8E,KAAMmS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAInT,UAAWiB,EAAQ,+IAAgJkS,IAF9KjX,EAAI8E,KAAMiR,GAAMkB,GAAKjB,GAAMiB,GAG3B,CAEF,OAAOjX,CACR,CHwaA+Y,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAEAU,aAAArX,MACA,MAAAqX,EAKA,IADAV,GADAlY,EAAA,IAAAiW,KADA9M,EAAAyP,EAAArY,OAAA,IAEAwX,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA6Y,EAAA7Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0T,GACA,IAoBAtQ,EAAAuK,GAAA,MAAA,WACA,IAAA1N,EACAjF,EACA,IAAAuO,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAkU,GAAA/B,MACA,MAAA,IAAAnS,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAkW,KAAAjR,EACA,IAwDA2B,EAAA+L,GAAA9R,UAAA,MAAA,SAAAgR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA2E,GAAAmJ,GACA,MAAA,IAAA9N,UAAAiB,EAAA,0DAAA6M,IAKA,GAHAA,EAAA,IACAA,GAAAqE,KAAA6B,WAEAlG,EAAA,GAAAA,GAAAqE,KAAA6B,SAGA,OAAA4C,GAAAzE,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAiI,GAAA9R,UAAA,UAAA,WACA,OAAAqV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAiI,GAAA9R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAiI,GAAA9R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAV,UACA,IAiBA1Q,EAAA+L,GAAA9R,UAAA,oBAAA8R,GAAA5B,mBAuCA3I,EAAAuK,GAAA9R,UAAA,cAAA,SAAAoY,EAAAC,GACA,IAAApB,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA0V,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAAhV,UAAA,IAEAgS,IACA,IAqCAtP,EAAA+L,GAAA9R,UAAA,WAAA,WACA,IAAAwW,EACAvN,EACAsP,EACAhQ,EACApC,EACAhH,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAkBA,OAhBA+F,EAAAoM,KACAmB,EAAAnB,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EACA8D,GAAA,EAIAsE,EADAgR,EAAA,CAAA,EACA,QAcA,WACA,IAAAlC,EAEA,GADAlX,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAKA,OADAR,EAAA,IAAAnB,GAAAsB,EADAvT,GAAA,GACAuT,EAAAvT,EAAA,IACA,CACAjE,MAAA,CAAAG,EAAAkX,GACAQ,MAAA,EAEA,IA3BAtP,EAAAgR,EAAA,UAoCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA7CAe,IACArQ,EAAAgR,EAAAX,IAoDA,WACA,OAAA3O,EAAAuP,SACA,IApDAD,CAqDA,IA+BAhR,EAAAuK,GAAA9R,UAAA,SAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,IAAAmJ,EAAArH,KAAA6W,EAAAgC,GAAAxC,EAAAnY,GAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA2CA9N,EAAAuK,GAAA9R,UAAA,QAAA,SAAAhB,EAAAqZ,EAAAI,GACA,IAAAnB,EACA/O,EACAyI,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA9W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAsY,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwQ,GACA,MAAA,IAAAnV,UAAAiB,EAAA,qEAAAkU,IAQA,GANAA,EAAA,IACAA,GAAA9P,GACA,IACA8P,EAAA,GAGAhV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,oEAAAsU,IAEAA,EAAA,IACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAGAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,MACAkQ,EAAAlQ,CAEA,MACA8P,EAAA,EACAI,EAAAlQ,EAIA,IAFAgN,EAAAJ,GAAAnW,GACAwW,EAAAJ,GAAApW,GACAG,EAAAkZ,EAAAlZ,EAAAsZ,EAAAtZ,IAEAmY,EADAtG,EAAA,EAAA7R,GACAoW,EACA+B,EAAAtG,EAAA,GAAAwE,EAEA,OAAAH,IACA,IA2CA9N,EAAAuK,GAAA9R,UAAA,UAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAlY,EACAD,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAgP,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAkX,EAAAyD,GAAAxC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,OACAjW,EAAA8E,KAAAmS,GAGA,OAAA,IAAAhB,KAAArJ,YAAA5M,EACA,IAqCAmI,EAAAuK,GAAA9R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADAkX,EAAAyD,GAAAxC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAgB,CAGA,IA+BA9O,EAAAuK,GAAA9R,UAAA,aAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADAkX,EAAAyD,GAAAxC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IAqCAoI,EAAAuK,GAAA9R,UAAA,YAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADAkX,EAAAyD,GAAAxC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAgB,CAGA,IA+BA9O,EAAAuK,GAAA9R,UAAA,iBAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADAkX,EAAAyD,GAAAxC,EAAAnY,GACAmJ,EAAArH,KAAA6W,EAAAzB,EAAAlX,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IA4BAoI,EAAAuK,GAAA9R,UAAA,WAAA,SAAA0Y,EAAAZ,GACA,IAAAR,EACAnY,EACAkX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAGA,IADApB,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAkX,EAAAyD,GAAAxC,EAAAnY,GACAuZ,EAAAzX,KAAA6W,EAAAzB,EAAAlX,EAAAkW,KAEA,IAyCAtP,EAAA+L,GAAA9R,UAAA,OAAA,SAAAgR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAiF,GAAA6I,GACA,MAAA,IAAA9N,UAAAiB,EAAA,qEAAA6M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAA4C,GAAAzE,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAiI,GAAA9R,UAAA,UAAA,WACA,OAAAqV,KAAA6B,OACA,IAmCA3P,EAAAuK,GAAA9R,UAAA,YAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAzJ,EAAAuK,GAAA9R,UAAA,WAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA7R,EAGA,OAAA,CACA,IAyBA4G,EAAA+L,GAAA9R,UAAA,QAAA,SAAA2Y,GACA,IAAAvZ,EACAkY,EACAsB,EACAzZ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAiZ,EAAA,QACA,KAAA7O,GAAA4O,GAGA,MAAA,IAAAzV,UAAAiB,EAAA,kEAAAwU,IAFAC,EAAAD,CAGA,CAGA,IAFAvZ,EAAA,GACAkY,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAA4V,GAAAxC,EAAAnY,GAAAyB,YAEA,OAAAxB,EAAAyZ,KAAAD,EACA,IA4BA7S,EAAA+L,GAAA9R,UAAA,QAAA,WACA,IAAAiJ,EACAsP,EACAhQ,EACApC,EACAhH,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAgBA,OAdA+F,EAAAoM,KACA9M,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAAG,EACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAAgB,MACA,IAjDAsO,CAkDA,IAsCAhR,EAAAuK,GAAA9R,UAAA,eAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACArW,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA4S,GAAA1K,GACA,MAAA,IAAAlI,UAAAiB,EAAA,0EAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAKA,IAHA3B,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,GAAA,EAAAA,IAEA,GAAAoW,IAAA+B,EADAtG,EAAA,EAAA7R,IACAqW,IAAA8B,EAAAtG,EAAA,GACA,OAAA7R,EAGA,OAAA,CACA,IAyCAoI,EAAAuK,GAAA9R,UAAA,OAAA,SAAA0Y,EAAAZ,GACA,IAAAgB,EACAxB,EACAlY,EACAD,EACA4H,EACA,IAAAkQ,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GAAA2W,GADA/O,EAAA2R,EAAAzX,KAAA6W,EAAAgC,GAAAxC,EAAAnY,GAAAA,EAAAkW,OAEAyD,EAAA,EAAA3Z,GAAAgW,GAAApO,GACA+R,EAAA,EAAA3Z,EAAA,GAAAiW,GAAArO,OACA,KAAA8N,GAAA9N,IAAA,IAAAA,EAAApH,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHA+R,EAAA,EAAA3Z,GAAA4H,EAAA,GACA+R,EAAA,EAAA3Z,EAAA,GAAA4H,EAAA,EAGA,CAEA,OAAA3H,CACA,IAmCAmI,EAAAuK,GAAA9R,UAAA,UAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA2B,EACA1Q,EAEApJ,EAEA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAAa,GAAAxC,EAAA,GACAnY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IAEA8Z,EAAAF,EAAAE,EADAa,GAAAxC,EAAAnY,GACAA,EAAAkW,MAEA,OAAA4D,CACA,IAmCA1R,EAAAuK,GAAA9R,UAAA,eAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA2B,EACA1Q,EAEApJ,EAEA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAAa,GAAAxC,EAAA/O,EAAA,GACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IAEA8Z,EAAAF,EAAAE,EADAa,GAAAxC,EAAAnY,GACAA,EAAAkW,MAEA,OAAA4D,CACA,IAmDAlT,EAAA+L,GAAA9R,UAAA,WAAA,WACA,IAAAsX,EACAU,EACAzP,EACA2Q,EACA/Z,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAKA,IAHAqF,EAAA8M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACA+B,EAAAtR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA8D,EAAAsF,EAAApJ,EAAA,EACA6Y,EAAAV,EAAA,EAAAnY,GACAmY,EAAA,EAAAnY,GAAAmY,EAAA,EAAArU,GACAqU,EAAA,EAAArU,GAAA+U,EACAA,EAAAV,EAAA,EAAAnY,EAAA,GACAmY,EAAA,EAAAnY,EAAA,GAAAmY,EAAA,EAAArU,EAAA,GACAqU,EAAA,EAAArU,EAAA,GAAA+U,EAEA,OAAA3C,IACA,IAgEAtP,EAAA+L,GAAA9R,UAAA,OAAA,SAAAhB,GAEA,IAAAma,EACAnI,EACAsG,EACAU,EACAC,EACAiB,EACAnS,EACA5H,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAGA,GADAoU,EAAAjC,KAAA8B,QACA9T,UAAA1D,OAAA,GAEA,IAAAwI,GADA6I,EAAA3N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6M,SAGAA,EAAA,EAEA,GAAA8E,GAAA9W,GAAA,CACA,GAAAgS,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAtT,EAAA,kEAAA6M,IAKA,OAFAsG,EADAtG,GAAA,GACAmE,GAAAnW,QACAsY,EAAAtG,EAAA,GAAAoE,GAAApW,GAEA,CACA,GAAAiY,GAAAjY,GAAA,CAEA,GAAAgS,GADAkI,EAAAla,EAAAkY,SACA7B,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAAna,EAAAmY,QAGAlU,EAAAqU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAxT,GACAkW,EAAA1C,WAAA0C,EAAAhJ,WAAAlN,EAEA,CAGA,IADA+U,EAAA,IAAA1G,GAAA6H,EAAAxZ,QACAR,EAAA,EAAAA,EAAAga,EAAAxZ,OAAAR,IACA6Y,EAAA7Y,GAAAga,EAAAha,GAEAga,EAAAnB,CACA,CAGA,IAFAhH,GAAA,EACA/N,EAAA,EACA9D,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACAmY,EAAAtG,GAAAmI,EAAAlW,GACAqU,EAAAtG,EAAA,GAAAmI,EAAAlW,EAAA,GACA+N,GAAA,EACA/N,GAAA,CAGA,KAhCA,CAiCA,IAAAiI,GAAAlM,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAka,EAAAla,EAAAW,OACAR,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA,IAAA2W,GAAA9W,EAAAG,IAAA,CACA8Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAmD,GACA,MAAA,IAAAzB,WAAAtT,EAAA,6GAAA+U,IAEA,GAAAlI,EAAAkI,EAAA,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAAna,EAGAiE,EAAAqU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAxT,GACAkW,EAAA1C,WAAA0C,EAAAhJ,WAAAlN,EAEA,CAGA,IADA+U,EAAA,IAAA1G,GAAA4H,GACA/Z,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA6Y,EAAA7Y,GAAAga,EAAAha,GAEAga,EAAAnB,CACA,CAIA,IAHAhH,GAAA,EACAkI,GAAA,EACAjW,EAAA,EACA9D,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACAmY,EAAAtG,GAAAmI,EAAAlW,GACAqU,EAAAtG,EAAA,GAAAmI,EAAAlW,EAAA,GACA+N,GAAA,EACA/N,GAAA,EAEA,MACA,CAEA,GAAA+N,EAAAkI,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAzG,GAAA,EACA7R,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA4H,EAAA/H,EAAAG,GACAmY,EAAAtG,GAAAmE,GAAApO,GACAuQ,EAAAtG,EAAA,GAAAoE,GAAArO,GACAiK,GAAA,CAxDA,CA+DA,IA2EAzJ,EAAAuK,GAAA9R,UAAA,SAAA,SAAAqY,EAAAI,GACA,IAAAW,EACAN,EACA1Z,EACA4R,EACAsG,EACA/O,EACApJ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA0Y,EAAA,EACAI,EAAAlQ,MACA,CACA,IAAAV,GAAAwQ,GACA,MAAA,IAAAnV,UAAAiB,EAAA,oEAAAkU,IAQA,GANAA,EAAA,IACAA,GAAA9P,GACA,IACA8P,EAAA,GAGA,IAAAhV,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAQA,IANA6Q,EADAf,EAAAI,EACAA,EAAAJ,EAEA,EAGAS,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAoN,IACAjC,QACAhY,EAAA,EAAAA,EAAAia,EAAAja,IACA6R,EAAA,GAAA7R,EAAAkZ,GACAS,EAAA,EAAA3Z,GAAAmY,EAAAtG,GACA8H,EAAA,EAAA3Z,EAAA,GAAAmY,EAAAtG,EAAA,GAEA,OAAA5R,CACA,IA+BAmI,EAAAuK,GAAA9R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,GAAAmJ,EAAArH,KAAA6W,EAAAgC,GAAAxC,EAAAnY,GAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA6EAtP,EAAA+L,GAAA9R,UAAA,QAAA,SAAAqZ,GACA,IAAArB,EACAV,EACA/O,EACApJ,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACAc,EAAA,GACA7Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA6Y,EAAA9T,KAAA4V,GAAAxC,EAAAnY,IAGA,IADA6Y,EAAAsB,KAAAD,GACAla,EAAA,EAAAA,EAAAoJ,EAAApJ,IAEAmY,EADArU,EAAA,EAAA9D,GACAgW,GAAA6C,EAAA7Y,IACAmY,EAAArU,EAAA,GAAAmS,GAAA4C,EAAA7Y,IAEA,OAAAkW,IACA,IA2EA9N,EAAAuK,GAAA9R,UAAA,YAAA,SAAAuZ,EAAAd,GACA,IAAAlC,EACAe,EACA/O,EACA,IAAA0O,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA4Z,EAAA,EACAd,EAAAlQ,MACA,CACA,IAAAV,GAAA0R,GACA,MAAA,IAAArW,UAAAiB,EAAA,oEAAAoV,IAQA,GANAA,EAAA,IACAA,GAAAhR,GACA,IACAgR,EAAA,GAGA,IAAAlW,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAWA,OAVAgR,GAAAhR,GACAA,EAAA,EACAgO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAlQ,EAAA,EACAgO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA3H,EAAAkQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAhO,EAAA,EAAA,EAAAA,EACA,IAwBAhB,EAAAuK,GAAA9R,UAAA,kBAAA,SAAAwZ,EAAAC,GACA,IAAAnL,EACAoL,EACAta,EACAkY,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACA+Z,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAtW,UAAAiB,EAAA,yFAAAqV,IAFAE,EAAAF,CAGA,CACA,GAAAnW,UAAA1D,OAAA,EACA2O,EAAA,CAAA,MACA,KAAAhH,GAAAmS,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,qEAAAsV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAA4V,GAAAxC,EAAAnY,GAAAwa,eAAAD,EAAApL,IAEA,OAAAlP,EAAAyZ,KAAA,IACA,IAmDA9S,EAAA+L,GAAA9R,UAAA,cAAA,WACA,IAAA8Y,EACA1Z,EACAmJ,EACA+O,EACAnY,EACA8D,EACA,IAAAgU,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAMA,IAJAqF,EAAA8M,KAAA6B,QACA9X,EAAA,IAAAiW,KAAArJ,YAAAzD,GACA+O,EAAAjC,KAAA8B,QACA2B,EAAA1Z,EAAA+X,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8D,EAAAsF,EAAApJ,EAAA,EACA2Z,EAAA,EAAA3Z,GAAAmY,EAAA,EAAArU,GACA6V,EAAA,EAAA3Z,EAAA,GAAAmY,EAAA,EAAArU,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA+L,GAAA9R,UAAA,YAAA,SAAAqZ,GACA,IAAArB,EACAV,EACA/O,EACApJ,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAAwK,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACAc,EAAA,GACA7Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA6Y,EAAA9T,KAAA4V,GAAAxC,EAAAnY,IAGA,OADA6Y,EAAAsB,KAAAD,GACA,IAAAvH,GAAAkG,EACA,IAoBAjS,EAAA+L,GAAA9R,UAAA,YAAA,WACA,IAAAZ,EACAkY,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAIA,IAFA9D,EAAA,GACAkY,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAA4V,GAAAxC,EAAAnY,GAAAyB,YAEA,OAAAxB,EAAAyZ,KAAA,IACA,IA2CA9S,EAAA+L,GAAA9R,UAAA,UAAA,WACA,IAAAuY,EACAtP,EACAV,EACApC,EACAmR,EACAnY,EACA,IAAA8X,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAiBA,OAfA+F,EAAAoM,KACAiC,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAA8a,GAAAxC,EAAAnY,GACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAA2Q,QACA,IAjDArB,CAkDA,IAuCAhR,EAAAuK,GAAA9R,UAAA,QAAA,SAAA6Z,EAAA7a,GACA,IAAAsY,EACAlY,EACAmJ,EACA,IAAA0O,GAAA5B,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA2E,GAAAgS,GACA,MAAA,IAAA3W,UAAAiB,EAAA,oEAAA0V,IAMA,GAJAtR,EAAA8M,KAAA6B,QACA2C,EAAA,IACAA,GAAAtR,GAEAsR,EAAA,GAAAA,GAAAtR,EACA,MAAA,IAAAkP,WAAAtT,EAAA,kEAAA0V,IAEA,IAAA/D,GAAA9W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAsY,GADAlY,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA8B,UACAA,SACA,EAAA0C,GAAA1E,GAAAnW,GACAsY,EAAA,EAAAuC,EAAA,GAAAzE,GAAApW,GACAI,CACA,IIt6FA,IAAA8Q,GAAAyB,GAAAzB,kBACA8G,GAAAd,KAYA,SAAA6D,GAAA/a,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAgN,YAAAE,MACAlN,EAAAkR,oBAAAA,EAEA,CASA,SAAA8J,GAAAhb,GACA,OAAAA,IAAA+S,EACA,CAoEA,SAAAA,KACA,IAAA0E,EACAc,EACAD,EACA/O,EACA/H,EAGA,GADA+W,EAAAlU,UAAA1D,SACA0V,gBAAAtD,IACA,OAAA,IAAAwF,EACA,IAAAxF,GAEA,IAAAwF,EACA,IAAAxF,GAAA1O,UAAA,IAEA,IAAAkU,EACA,IAAAxF,GAAA1O,UAAA,GAAAA,UAAA,IAEA,IAAA0O,GAAA1O,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAkU,EACAD,EAAA,IAAA3F,GAAA,QACA,GAAA,IAAA4F,EAEA,GAAApP,GADA3H,EAAA6C,UAAA,IAEAiU,EAAA,IAAA3F,GAAAnR,QACA,GAAA0K,GAAA1K,GACA8W,EC9IA,SAAoBA,EAAKnM,GACxB,IAAI5C,EACApJ,EAGJ,IADAoJ,EAAM4C,EAAIxL,OACJR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBmY,EAAKnY,GAAM6J,GAASmC,EAAKhM,IAE1B,OAAOmY,CACR,CDqIAE,CAAA,IAAA7F,GAAAnR,EAAAb,QAAAa,QACA,GAAAwU,GAAAxU,GACA8W,EAAA,IAAA3F,GAAAnR,OACA,KAAA8G,GAAA9G,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAwW,GACA,MAAA,IAAA9T,UAAAiB,EAAA,mJAAA3D,IAEA,IAAAkN,GAAAlN,EAAAoX,KACA,MAAA,IAAA1U,UAAAiB,EAAA,qHAAA3D,IAGA,IAAAkN,IADA4J,EAAA9W,EAAAoX,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,qHAAA3D,IAEA8W,EAAA,IAAA3F,GAAA+E,GAAAY,GAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAjU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAmT,IAGA,IAAAnP,GADAsO,EAAApT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAsS,IAEA,GAAA,IAAAc,EACAD,EAAA,IAAA3F,GAAA2F,EAAAb,OACA,CAEA,IAAAtO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA2H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAtT,EAAA,iJAAAoE,EAAA2H,KAEAoH,EAAA,IAAA3F,GAAA2F,EAAAb,EAAAlO,EACA,CACA,CAIA,OAHAhB,EAAA8N,KAAA,UAAAiC,GACA/P,EAAA8N,KAAA,UAAAiC,EAAA3X,QAEA0V,IACA,CAeA9N,EAAAwK,GAAA,oBAAA7B,IAeA3I,EAAAwK,GAAA,OAAA,gBAmCAhM,EAAAgM,GAAA,QAAA,SAAA8F,GACA,IAAAC,EACAP,EACAQ,EACA3Y,EACAkY,EACAU,EACApS,EACA2C,EACApJ,EACA,IAAAuO,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA8W,GAAA3E,MACA,MAAA,IAAAnS,UAAA,sDAGA,IADAqU,EAAAlU,UAAA1D,QACA,EAAA,CAEA,IAAA+N,GADAqK,EAAA1U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4T,IAEAR,EAAA,IACAO,EAAAzU,UAAA,GAEA,CACA,GAAA6H,GAAA2M,GAAA,CACA,GAAAE,EAAA,CASA,IARAxP,EAAAsP,EAAAlY,OAEAiG,EADAiS,EAAAjS,KAAAiS,EAAAhS,IACAqS,GAAA,WAEApO,GAAA,WAGAwN,GADAlY,EAAA,IAAAiW,KAAA9M,IACA4O,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA6J,GAAA+O,EAAA9W,KAAA6W,EAAAlS,EAAAiS,EAAA1Y,GAAAA,IAEA,OAAAC,CACA,CACA,OAAA,IAAAiW,KAAAwC,EACA,CACA,GAAAvQ,GAAAuQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA1T,UAAAiB,EAAA,6FAAA0T,IAUA,IAPAG,EADAD,EE1SA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI1Y,EACA2H,EACA5H,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI4P,EAAGC,QACAC,MAGP1X,GAAK,EACLC,EAAI8E,KAAM8E,GAAS+O,EAAK9W,KAAM6W,EAAS/Q,EAAE/H,MAAOG,KAEjD,OAAOC,CACR,CF2RA+Y,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAIAA,GADAlY,EAAA,IAAAiW,KADA9M,EAAAyP,EAAArY,SAEAwX,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAmY,EAAAnY,GAAA6Y,EAAA7Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0T,GACA,IAoBAtQ,EAAAwK,GAAA,MAAA,WACA,IAAA3N,EACAjF,EACA,IAAAuO,GAAA2H,MACA,MAAA,IAAAnS,UAAA,6DAEA,IAAA8W,GAAA3E,MACA,MAAA,IAAAnS,UAAA,sDAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAkW,KAAAjR,EACA,IA6BA2B,EAAAgM,GAAA/R,UAAA,MAAA,SAAAgR,GACA,IAAAsG,EACA/O,EAEA,IAAAwR,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA2E,GAAAmJ,GACA,MAAA,IAAA9N,UAAAiB,EAAA,0DAAA6M,IAOA,GALAzI,EAAA8M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACAnG,EAAA,IACAA,GAAAzI,KAEAyI,EAAA,GAAAA,GAAAzI,GAGA,OAAAS,GAAAsO,EAAAtG,GACA,IAgBAnH,GAAAkI,GAAA/R,UAAA,UAAA,WACA,OAAAqV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAkI,GAAA/R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAkI,GAAA/R,UAAA,cAAA,WACA,OAAAqV,KAAA8B,QAAAV,UACA,IAiBA1Q,EAAAgM,GAAA/R,UAAA,oBAAA+R,GAAA7B,mBA+BA3I,EAAAwK,GAAA/R,UAAA,cAAA,SAAAoY,EAAAC,GACA,IAAA0B,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAQA,OALA,IAAAG,UAAA1D,OACA0V,KAAA8B,QAAAmB,WAAAF,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAAF,EAAAC,EAAAhV,UAAA,IAEAgS,IACA,IAgCAtP,EAAAgM,GAAA/R,UAAA,WAAA,WACA,IAAAiJ,EACAsP,EACAhQ,EACA+O,EACAnR,EACAhH,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAiBA,OAfA+F,EAAAoM,KACAiC,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAA,CAAAG,EAAA6J,GAAAsO,EAAAnY,KACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAAuP,SACA,IAjDAD,CAkDA,IA4BAhR,EAAAwK,GAAA/R,UAAA,SAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,IAAAmJ,EAAArH,KAAA6W,EAAA9O,GAAAsO,EAAAnY,IAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA+BA9N,EAAAwK,GAAA/R,UAAA,QAAA,SAAAhB,EAAAqZ,EAAAI,GACA,IAAAnB,EACA/O,EACAgG,EACApP,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA4F,GAAA9J,GACA,MAAA,IAAAkE,UAAAiB,EAAA,mEAAAnF,IAIA,GAFAsY,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwQ,GACA,MAAA,IAAAnV,UAAAiB,EAAA,qEAAAkU,IAQA,GANAA,EAAA,IACAA,GAAA9P,GACA,IACA8P,EAAA,GAGAhV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,oEAAAsU,IAEAA,EAAA,IACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAGAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,MACAkQ,EAAAlQ,CAEA,MACA8P,EAAA,EACAI,EAAAlQ,EAOA,IAJAgG,EADAvP,EACA,EAEA,EAEAG,EAAAkZ,EAAAlZ,EAAAsZ,EAAAtZ,IACAmY,EAAAnY,GAAAoP,EAEA,OAAA8G,IACA,IAqCA9N,EAAAwK,GAAA/R,UAAA,UAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAlY,EACAD,EACA4H,EAEA,IAAAgT,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAgP,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA4H,EAAAiC,GAAAsO,EAAAnY,IACAmJ,EAAArH,KAAA6W,EAAA/Q,EAAA5H,EAAAkW,OACAjW,EAAA8E,KAAA6C,GAGA,OAAA,IAAAsO,KAAArJ,YAAA5M,EACA,IA4BAmI,EAAAwK,GAAA/R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAvQ,EACA5H,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADA4H,EAAAiC,GAAAsO,EAAAnY,IACAmJ,EAAArH,KAAA6W,EAAA/Q,EAAA5H,EAAAkW,MACA,OAAAtO,CAGA,IA4BAQ,EAAAwK,GAAA/R,UAAA,aAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAvQ,EACA5H,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IAEA,GADA4H,EAAAiC,GAAAsO,EAAAnY,IACAmJ,EAAArH,KAAA6W,EAAA/Q,EAAA5H,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IA4BAoI,EAAAwK,GAAA/R,UAAA,YAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAvQ,EACA5H,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADA4H,EAAAiC,GAAAsO,EAAAnY,IACAmJ,EAAArH,KAAA6W,EAAA/Q,EAAA5H,EAAAkW,MACA,OAAAtO,CAGA,IA4BAQ,EAAAwK,GAAA/R,UAAA,iBAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAvQ,EACA5H,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAAkW,KAAA6B,QAAA,EAAA/X,GAAA,EAAAA,IAEA,GADA4H,EAAAiC,GAAAsO,EAAAnY,IACAmJ,EAAArH,KAAA6W,EAAA/Q,EAAA5H,EAAAkW,MACA,OAAAlW,EAGA,OAAA,CACA,IA0BAoI,EAAAwK,GAAA/R,UAAA,WAAA,SAAA0Y,EAAAZ,GACA,IAAAR,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAGA,IADApB,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAuZ,EAAAzX,KAAA6W,EAAA9O,GAAAsO,EAAAnY,IAAAA,EAAAkW,KAEA,IA2BAtP,EAAAgM,GAAA/R,UAAA,OAAA,SAAAgR,GACA,IAAA+I,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAiF,GAAA6I,GACA,MAAA,IAAA9N,UAAAiB,EAAA,qEAAA6M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAAlO,GAAAqM,KAAA8B,QAAAnG,GACA,IA8BAzJ,EAAAwK,GAAA/R,UAAA,YAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA4F,GAAAsC,GACA,MAAA,IAAAlI,UAAAiB,EAAA,mEAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAGA,IADAiM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IACA,GAAAiM,IAAApC,GAAAsO,EAAAnY,IACA,OAAA,EAGA,OAAA,CACA,IAiCAoI,EAAAwK,GAAA/R,UAAA,WAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA4F,GAAAsC,GACA,MAAA,IAAAlI,UAAAiB,EAAA,mEAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAGA,IADAiM,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,EAAAkW,KAAA6B,QAAA/X,IACA,GAAAiM,IAAApC,GAAAsO,EAAAnY,IACA,OAAAA,EAGA,OAAA,CACA,IA0BA4G,EAAAgM,GAAA/R,UAAA,QAAA,SAAA2Y,GACA,IAAArB,EACAlY,EACAD,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,GAAAG,UAAA1D,OAAA,GACA,IAAAoK,GAAA4O,GACA,MAAA,IAAAzV,UAAAiB,EAAA,kEAAAwU,SAGAA,EAAA,IAIA,IAFArB,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAmY,EAAAnY,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAAyZ,KAAAF,EACA,IA4BA5S,EAAAgM,GAAA/R,UAAA,QAAA,WACA,IAAAiJ,EACAsP,EACAhQ,EACApC,EACAhH,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAgBA,OAdA+F,EAAAoM,KACA9M,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAAG,EACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAAgB,MACA,IAjDAsO,CAkDA,IAiCAhR,EAAAwK,GAAA/R,UAAA,eAAA,SAAAoL,EAAAC,GACA,IAAAiM,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA4F,GAAAsC,GACA,MAAA,IAAAlI,UAAAiB,EAAA,mEAAAiH,IAEA,GAAA/H,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAwD,GACA,MAAA,IAAAnI,UAAAiB,EAAA,qEAAAkH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAGA,IADAI,EAAAjC,KAAA8B,QACAhY,EAAAkM,EAAAlM,GAAA,EAAAA,IACA,GAAAiM,IAAApC,GAAAsO,EAAAnY,IACA,OAAAA,EAGA,OAAA,CACA,IAgBA0K,GAAAkI,GAAA/R,UAAA,UAAA,WACA,OAAAqV,KAAA6B,OACA,IAqCA3P,EAAAwK,GAAA/R,UAAA,OAAA,SAAA0Y,EAAAZ,GACA,IAAAgB,EACA1Z,EACAkY,EACAnY,EACA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAAgL,GACA,MAAA,IAAAxV,UAAA,oEAAAwV,GAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA2Z,EAAA3Z,GAAA6J,GAAA0P,EAAAzX,KAAA6W,EAAA9O,GAAAsO,EAAAnY,IAAAA,EAAAkW,OAEA,OAAAjW,CACA,IA+BAmI,EAAAwK,GAAA/R,UAAA,UAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA/O,EACA0Q,EACA9Z,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAAjQ,GAAAsO,EAAA,IACAnY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IACA8Z,EAAAF,EAAAE,EAAAjQ,GAAAsO,EAAAnY,IAAAA,EAAAkW,MAEA,OAAA4D,CACA,IA+BA1R,EAAAwK,GAAA/R,UAAA,eAAA,SAAA+Y,EAAAC,GACA,IAAA1B,EACA/O,EACA0Q,EACA9Z,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAAqL,GACA,MAAA,IAAA7V,UAAAiB,EAAA,oEAAA4U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA7T,UAAA1D,OAAA,EACAsZ,EAAAD,EACA7Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAsY,EAAAjQ,GAAAsO,EAAA/O,EAAA,IACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IACA8Z,EAAAF,EAAAE,EAAAjQ,GAAAsO,EAAAnY,IAAAA,EAAAkW,MAEA,OAAA4D,CACA,IA8BAlT,EAAAgM,GAAA/R,UAAA,WAAA,WACA,IAAAsX,EACAU,EACAzP,EACA2Q,EACA/Z,EACA8D,EAEA,IAAA8W,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAKA,IAHAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACAgC,EAAAtR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAA+Z,EAAA/Z,IACA8D,EAAAsF,EAAApJ,EAAA,EACA6Y,EAAAV,EAAAnY,GACAmY,EAAAnY,GAAAmY,EAAArU,GACAqU,EAAArU,GAAA+U,EAEA,OAAA3C,IACA,IA+CAtP,EAAAgM,GAAA/R,UAAA,OAAA,SAAAhB,GACA,IAAAma,EACAnI,EACAsG,EACAU,EACAkB,EACA/Z,EACA8D,EACA,IAAA8W,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAGA,GADAoU,EAAAjC,KAAA8B,QACA9T,UAAA1D,OAAA,GAEA,IAAAwI,GADA6I,EAAA3N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA6M,SAGAA,EAAA,EAEA,GAAA9F,GAAAlM,GAAA,CAEA,GAAAgS,GADAkI,EAAAla,EAAAW,QACA0V,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FASA,GANA0B,EADAY,GAAA/a,GACAA,EAAAmY,QAEAnY,EAGAiE,EAAAqU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAxT,GACAkW,EAAA1C,WAAA0C,EAAAhJ,WAAAlN,EAEA,CAGA,IADA+U,EAAA,IAAArG,GAAAwH,EAAAxZ,QACAR,EAAA,EAAAA,EAAAga,EAAAxZ,OAAAR,IACA6Y,EAAA7Y,GAAAga,EAAAha,GAEAga,EAAAnB,CACA,CACA,IAAA7Y,EAAA,EAAAA,EAAA+Z,EAAAlI,IAAA7R,IACAmY,EAAAtG,GAAAmI,EAAAha,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAA6R,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAtT,EAAA,kEAAA6M,IAEAsG,EAAAtG,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDAzJ,EAAAwK,GAAA/R,UAAA,SAAA,SAAAuZ,EAAAd,GACA,IAAAW,EACAN,EACA1Z,EACAkY,EACA/O,EACApJ,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA4Z,EAAA,EACAd,EAAAlQ,MACA,CACA,IAAAV,GAAA0R,GACA,MAAA,IAAArW,UAAAiB,EAAA,oEAAAoV,IAQA,GANAA,EAAA,IACAA,GAAAhR,GACA,IACAgR,EAAA,GAGA,IAAAlW,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAQA,IANA6Q,EADAG,EAAAd,EACAA,EAAAc,EAEA,EAGAT,GADA1Z,EAAA,IAAAiW,KAAArJ,YAAAoN,IACAjC,QACAhY,EAAA,EAAAA,EAAAia,EAAAja,IACA2Z,EAAA3Z,GAAAmY,EAAAnY,EAAAoa,GAEA,OAAAna,CACA,IA4BAmI,EAAAwK,GAAA/R,UAAA,QAAA,SAAAsI,EAAAwP,GACA,IAAAR,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAAwK,GAAApF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAgP,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACA,GAAAmJ,EAAArH,KAAA6W,EAAA9O,GAAAsO,EAAAnY,IAAAA,EAAAkW,MACA,OAAA,EAGA,OAAA,CACA,IA4CAtP,EAAAgM,GAAA/R,UAAA,QAAA,SAAAqZ,GACA,IAAA/B,EAEA,IAAAyC,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAGA,GADAoU,EAAAjC,KAAA8B,QACA,IAAA9T,UAAA1D,OAEA,OADA2X,EAAAgC,OACAjE,KAEA,IAAA3H,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAGA,OADA/B,EAAAgC,MAWA,SAAAW,EAAAC,GACA,OAAAb,EAAArQ,GAAAiR,GAAAjR,GAAAkR,GACA,IAZA7E,IAaA,IAgDA9N,EAAAwK,GAAA/R,UAAA,YAAA,SAAAuZ,EAAAd,GACA,IAAAlC,EACAe,EACA/O,EAEA,IAAAwR,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAIA,GAFAoU,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QACA,IAAA7T,UAAA1D,OACA4Z,EAAA,EACAd,EAAAlQ,MACA,CACA,IAAAV,GAAA0R,GACA,MAAA,IAAArW,UAAAiB,EAAA,oEAAAoV,IAQA,GANAA,EAAA,IACAA,GAAAhR,GACA,IACAgR,EAAA,GAGA,IAAAlW,UAAA1D,OACA8Y,EAAAlQ,MACA,CACA,IAAAV,GAAA4Q,GACA,MAAA,IAAAvV,UAAAiB,EAAA,qEAAAsU,IAEAA,EAAA,GACAA,GAAAlQ,GACA,IACAkQ,EAAA,GAEAA,EAAAlQ,IACAkQ,EAAAlQ,EAEA,CACA,CAWA,OAVAgR,GAAAhR,GACAA,EAAA,EACAgO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAlQ,EAAA,EACAgO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA3H,EAAAkQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAhO,EAAA,EAAA,EAAAA,EACA,IAyBAhB,EAAAwK,GAAA/R,UAAA,kBAAA,SAAAwZ,EAAAC,GACA,IAAAnL,EACAoL,EACAta,EACAkY,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,GAAA,IAAAG,UAAA1D,OACA+Z,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAtW,UAAAiB,EAAA,yFAAAqV,IAFAE,EAAAF,CAGA,CACA,GAAAnW,UAAA1D,OAAA,EACA2O,EAAA,CAAA,MACA,KAAAhH,GAAAmS,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,qEAAAsV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACA/X,EAAA,GACAD,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAC,EAAA8E,KAAA8E,GAAAsO,EAAAnY,IAAAwa,eAAAD,EAAApL,IAEA,OAAAlP,EAAAyZ,KAAA,IACA,IA8BA9S,EAAAgM,GAAA/R,UAAA,cAAA,WACA,IAAA8Y,EACA1Z,EACAmJ,EACA+O,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAMA,IAJAqF,EAAA8M,KAAA6B,QACA9X,EAAA,IAAAiW,KAAArJ,YAAAzD,GACA+O,EAAAjC,KAAA8B,QACA2B,EAAA1Z,EAAA+X,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA2Z,EAAA3Z,GAAAmY,EAAA/O,EAAApJ,EAAA,GAEA,OAAAC,CACA,IA6CA2G,EAAAgM,GAAA/R,UAAA,YAAA,SAAAqZ,GACA,IAAAP,EACA1Z,EACAmJ,EACA+O,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAMA,IAJAqF,EAAA8M,KAAA6B,QACA9X,EAAA,IAAAiW,KAAArJ,YAAAzD,GACA+O,EAAAjC,KAAA8B,QACA2B,EAAA1Z,EAAA+X,QACAhY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA2Z,EAAA3Z,GAAAmY,EAAAnY,GAEA,GAAA,IAAAkE,UAAA1D,OAEA,OADAmZ,EAAAQ,OACAla,EAEA,IAAAsO,GAAA2L,GACA,MAAA,IAAAnW,UAAAiB,EAAA,oEAAAkV,IAGA,OADAP,EAAAQ,MAWA,SAAAW,EAAAC,GACA,OAAAb,EAAArQ,GAAAiR,GAAAjR,GAAAkR,GACA,IAZA9a,CAaA,IAqBA2G,EAAAgM,GAAA/R,UAAA,YAAA,WACA,IAAAZ,EACAkY,EACAnY,EACA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAIA,IAFA9D,EAAA,GACAkY,EAAAjC,KAAA8B,QACAhY,EAAA,EAAAA,EAAAkW,KAAA6B,QAAA/X,IACAmY,EAAAnY,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAAyZ,KAAA,IACA,IA4BA9S,EAAAgM,GAAA/R,UAAA,UAAA,WACA,IAAAuY,EACAtP,EACAV,EACApC,EACAmR,EACAnY,EAEA,IAAA4a,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAiBA,OAfA+F,EAAAoM,KACAiC,EAAAjC,KAAA8B,QACA5O,EAAA8M,KAAA6B,QAGA/X,GAAA,EAIAoI,EADAgR,EAAA,CAAA,EACA,QAcA,WAEA,GADApZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAsO,MAAA,GAGA,MAAA,CACA7X,MAAAgK,GAAAsO,EAAAnY,IACA0X,MAAA,EAEA,IAxBAtP,EAAAgR,EAAA,UAiCA,SAAAvZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA6X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACArQ,EAAAgR,EAAAX,IAiDA,WACA,OAAA3O,EAAA2Q,QACA,IAjDArB,CAkDA,IA6BAhR,EAAAwK,GAAA/R,UAAA,QAAA,SAAA6Z,EAAA7a,GACA,IACAI,EACAmJ,EAEA,IAAAwR,GAAA1E,MACA,MAAA,IAAAnS,UAAA,sDAEA,IAAA2E,GAAAgS,GACA,MAAA,IAAA3W,UAAAiB,EAAA,oEAAA0V,IAMA,GAJAtR,EAAA8M,KAAA6B,QACA2C,EAAA,IACAA,GAAAtR,GAEAsR,EAAA,GAAAA,GAAAtR,EACA,MAAA,IAAAkP,WAAAtT,EAAA,kEAAA0V,IAEA,IAAA/Q,GAAA9J,GACA,MAAA,IAAAkE,UAAAiB,EAAA,oEAAAnF,IASA,OAPAI,EAAA,IAAAiW,KAAArJ,YAAAqJ,KAAA8B,UACAA,QAEA0C,GADA7a,EACA,EAEA,EAEAI,CACA,IG/4EA,IAAI+a,GAAQ,CACX7I,GACAD,GACAG,GACAE,GACAH,GACAE,GACA9F,GACAgG,GACAC,GACAC,GACAC,GACAC,IC5BGqI,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAOza,OAkBpB,SAASqQ,GAAOhR,GACf,IAAIG,EACJ,GAAKkD,GAASrD,GACb,MAAO,UAER,GAAK8M,GAAU9M,GACd,OAAO,KAER,IAAMG,EAAI,EAAGA,EAAIkb,GAAQlb,IACxB,GAAKH,aAAiBmb,GAAOhb,GAC5B,OAAOib,GAAQjb,GAIjB,OAAOmb,GAAYrO,GAAiBjN,KAAa,IAClD,CCZA,SAASub,GAAkBzS,GAC1B,IAAI0S,EAAKxK,GAAOlI,GAChB,OAAKgJ,GAAiBhJ,GACd,CACN2S,KAAQ3S,EACRkI,MAASwK,EACTE,kBAAoB,EACpBC,UAAa,CACZzC,GAAgBsC,GAChBI,GAAgBJ,KAIZ,CACNC,KAAQ3S,EACRkI,MAASwK,EACTE,kBAAoB,EACpBC,UAAa,CACZ7Q,GAAQ0Q,GACRrJ,GAAQqJ,IAGX,CChDA,IAAIK,GAAavY,MAAMtC,UAAUgE,MA4GjC,SAASA,GAAO8D,EAAGuQ,EAAOI,GACzB,IAAIpT,EACJ,OAzFD,SAAoBA,EAAKyV,GACxB,MAAkC,mBAAlBzV,EAAKyV,EACtB,CAuFMC,CAAWjT,EAAG,SACXA,EAAE9D,MAAOqU,EAAOI,IAExBpT,EAAMkV,GAAkBzS,IACf4S,iBApDV,SAAoB5S,EAAGuQ,EAAOI,GAC7B,IAAIgC,EACA7U,EACAxG,EACAD,EAKJ,IAHAsb,EAAO3S,EAAE2S,KACT7U,EAAMkC,EAAE6S,UAAW,GACnBvb,EAAM,GACAD,EAAIkZ,EAAOlZ,EAAIsZ,EAAKtZ,IACzBC,EAAI8E,KAAM0B,EAAK6U,EAAMtb,IAEtB,OAAOC,CACR,CAwCSub,CAAWtV,EAAKgT,EAAOI,GA3EhC,SAAkB3Q,EAAGuQ,EAAOI,GAC3B,OAAOoC,GAAW5Z,KAAM6G,EAAGuQ,EAAOI,EACnC,CA4EQrT,CAAS0C,EAAGuQ,EAAOI,EAC3B,CCpHA,SAASuC,GAAyBC,EAAOC,GACxC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CCFA,SAASE,GAAsBF,EAAOC,GACrC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CC8BA,SAASG,GAAuBC,EAAOhL,EAASkG,GAC/C,IAAI9F,EACA6K,EACAC,EACAC,EACArc,EAKJ,IAHAsR,EAAQ4K,EAAM1b,OACd2b,EAAM/E,EACNgF,EAAMhF,EACApX,EAAI,EAAGA,EAAIsR,EAAOtR,IAAM,CAC7B,GAAoB,IAAfkc,EAAOlc,GACX,MAAO,CAAEoX,EAAQA,IAElBiF,EAAInL,EAASlR,IACJ,EACRoc,GAAOC,GAAMH,EAAMlc,GAAG,GACXqc,EAAI,IACfF,GAAOE,GAAMH,EAAMlc,GAAG,GAEvB,CACD,MAAO,CAAEmc,EAAKC,EACf,CC9CA,SAASE,GAAqB1U,GAC7B,MAAe,iBAANA,CACV,CCmCAQ,EAAA3I,GAAA,UCIA,SAAgCyc,EAAOhL,EAASkG,EAAQnX,GACvD,IAAIqR,EACA6K,EACAC,EACAC,EACArc,EAKJ,IAHAsR,EAAQ4K,EAAM1b,OACd2b,EAAM/E,EACNgF,EAAMhF,EACApX,EAAI,EAAGA,EAAIsR,EAAOtR,IAAM,CAC7B,GAAoB,IAAfkc,EAAOlc,GAGX,OAFAC,EAAK,GAAMmX,EACXnX,EAAK,GAAMmX,EACJnX,GAERoc,EAAInL,EAASlR,IACJ,EACRoc,GAAOC,GAAMH,EAAMlc,GAAG,GACXqc,EAAI,IACfF,GAAOE,GAAMH,EAAMlc,GAAG,GAEvB,CAGD,OAFAC,EAAK,GAAMkc,EACXlc,EAAK,GAAMmc,EACJnc,CACR,IC7EA,IAAIsc,GAAW,yBCRf,IAAI3X,GAAO4X,OAAO3b,UAAU+D,KCS5B,IAAIoC,GAAMW,IAmBV,SAAS8U,GAAU5c,GAClB,MAAsB,iBAAVA,IACNA,aAAiB2c,SAGjBxV,GCnBP,SAAenH,GACd,IAEC,OADA+E,GAAK9C,KAAMjC,IACJ,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEZA,SAASqC,GAAS/B,EAAKuc,EAAQC,GAC9B,OAAOxc,EAAI+B,QAASwa,EAAQC,EAC7B,CCgBA,SAASza,GAAS/B,EAAKuc,EAAQC,GAC9B,IAAM/R,GAAUzK,GACf,MAAM,IAAI4D,UAAWiB,EAAQ,kEAAmE7E,IAEjG,GAAKyK,GAAU8R,GACdA,EAAS,IAAIF,OL1Bf,SAAkBrc,GACjB,IACIkc,EACArc,EAEJ,IAAM4K,GAAUzK,GACf,MAAM,IAAI4D,UAAWiB,EAAQ,2EAA4E7E,IAG1G,GAAkB,MAAbA,EAAK,GAGT,IAAMH,EADAG,EAAIK,OACI,EAAGR,GAAK,GACH,MAAbG,EAAKH,GADcA,KAO1B,YAAW,IAANA,GAAgBA,GAAK,EAClBG,EAAI+B,QAASqa,GAAU,SAM/BF,GAHAA,EAAIlc,EAAIkE,UAAW,EAAGrE,IAGhBkC,QAASqa,GAAU,QAGzBpc,EAAMA,EAAK,GAAMkc,EAAIlc,EAAIkE,UAAWrE,GAGrC,CKNuB4c,CAASF,GAAU,UAClC,IAAMD,GAAUC,GACtB,MAAM,IAAI3Y,UAAWiB,EAAQ,yFAA0F0X,IAExH,IAAM9R,GAAU+R,KAAapO,GAAYoO,GACxC,MAAM,IAAI5Y,UAAWiB,EAAQ,0FAA2F2X,IAEzH,OAAOxb,GAAMhB,EAAKuc,EAAQC,EAC3B,CCjDA,IAAI3B,GAAQ,CACXvL,KAAQ,gCACRC,MAAS,iCACTC,OAAU,wCACVC,MAAS,iCACTC,OAAU,kCACVC,MAAS,iCACTC,OAAU,kCACVI,QAAW,mCACXC,QAAW,mCACXK,QAAW,eACXD,OAAU,6BACVF,UAAa,qCACbC,WAAc,sCACdxF,KAAQ,oCCfT,ICeK8R,GDfDC,GAAQ,CACXjN,OAAUyC,GACV5C,MAAS8C,KCgBTqK,GAAa,IAAIC,GAAiB,OAAE,IAOxB,GAAM,KAiBnB,IAAAC,GAX6B,KAHhB,IAAID,GAAgB,MAAED,GAAWxF,QAGzB,GCrCjB5X,GAAgC,mBAAhBmW,YAA+BA,YAAc,KCAjE,ICmBI5I,GDnBAA,GAAgC,mBAAhB4I,YAA+BA,iBAAc,ECuBhE5I,GCPD,WACC,IAAIjC,EACAiS,EACA7E,EAEJ,GAAkC,mBAAtB8E,GACX,OAAO,EAGR,KAEClS,EAAS8K,GADTsC,EAAM,IAAI8E,GAAmB,MACwC,mBAA7BA,GAAkBC,WAEzDF,EAAO,IAAI7K,GAAcgG,IACnB,IAAO,KACb6E,EAAM,GAAMhK,IACZjI,EACCA,GACAkS,GAAkBC,OAAQF,IACP,KAAnB7E,EAAInH,aACW,OAAfgM,EAAM,IACNA,EAAM,IAAQA,EAAM,GAGtB,CAAC,MAAQjX,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDxBKoS,GACGlX,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA4b,GAAepQ,GGxBXqQ,GAAoC,mBAAbC,SAsB3B,SAASC,GAAY1d,GACpB,OACGwd,IAAexd,aAAiByd,UACT,sBAAzB5V,EAAa7H,EAEf,CChCA,IAAIJ,GAA6B,mBAAb6d,SAA4BA,SAAW,KCA3D,ICuBItQ,GDvBAA,GAA6B,mBAAbsQ,SAA4BA,cAAW,EC2B1DtQ,GCXD,WACC,IAAIjC,EACAiS,EACA7E,EAEJ,GAA+B,mBAAnBqF,GACX,OAAO,EAGR,IACCrF,EAAM,IAAIvC,GAAa,KAEvB7K,EAASwS,GADTP,EAAO,IAAIQ,GAAgBrF,EAAK,KAC0B,mBAApB6E,EAAKS,YAAwD,mBAApBT,EAAKU,cAEnFV,EAAKU,WAAY,GAAI,MACrBV,EAAKU,WAAY,EAAG1K,KACpBjI,EACCA,GACAiS,EAAK3F,SAAWc,GACI,KAApB6E,EAAKhM,YACe,IAApBgM,EAAK1F,aACqB,OAA1B0F,EAAKS,WAAY,IACjBT,EAAKS,WAAY,IAAQT,EAAKS,WAAY,GAG5C,CAAC,MAAQ1X,GACTgF,GAAO,CACP,CACD,OAAOA,CACR,CDrBK4S,GACG1X,GElBR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFwBA,IAAAoc,GAAe5Q,GG/BX6Q,GAAiC,mBAAXpT,OAA0BA,YAAS,kCCY7D,SAASqT,KACR,OAAOC,GAAOlZ,OACf,qCCFA,SAASmZ,KAER,MAAO,CAEN,YAAa,IAGb,eAAgB,IAElB,CCJA5V,GCLA,WACC,OAAO6V,GAAKpZ,OACb,GDGA,OAAAqZ,IEdA,IAAIC,GHWI,CAEN,YAAa,IAGb,eAAgB,KGGlB,SAASH,KAER,MAAO,CAEN,YAAaG,GAAS,aAGtB,eAAgBA,GAAS,gBAE3B,CCdA/V,EAAA3I,GAAA,OAAAye,gDCLA,SAASE,KACR,OAAOC,GAAMxZ,OACd,CCFA,SAASmZ,KAER,MAAO,CACNM,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,EAEf,CCHArW,EAAAgW,GAAA,OAAAF,ICRA,IAAIjD,GvJOI,CAENlQ,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,KuJ/ClBoN,GAASD,KACTO,GFGI,CACNC,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,GGXf,IAAIC,GAAW,WAGXC,GAAS,WAGTC,GAAQ,IAAIpM,GAAY,GACxBqM,GAAO,IAAIvB,GAAUsB,GAAMvH,QAyB/B,SAASyH,GAAqBnW,EAAG1I,EAAK8e,EAAQ3H,GAC7C,IAAI4H,EACAC,EACAjf,EAEJ,GAAW,IAAN2I,EAAU,CACd,IAAM3I,EAAI,EAAGA,EAAI4e,GAAMpe,OAAQR,IAC9BC,EAAKmX,GAAW,EAChBA,GAAU2H,EAEX,OAAO9e,CACP,CAeD,IAbAgf,GAAMtW,EAAE+V,MAAY,EAGpBM,EAAKvW,GAAOE,EAAEgW,IAGT5B,IACJ8B,GAAKK,UAAW,EAAGD,EAAIlC,IACvB8B,GAAKK,UAAW,EAAGF,EAAIjC,MAEvB8B,GAAKK,UAAW,EAAGF,EAAIjC,IACvB8B,GAAKK,UAAW,EAAGD,EAAIlC,KAElB/c,EAAI,EAAGA,EAAI4e,GAAMpe,OAAQR,IAC9BC,EAAKmX,GAAWwH,GAAO5e,GACvBoX,GAAU2H,EAEX,OAAO9e,CACR,CC7CAmI,GCIA,SAA8BO,GAC7B,IAAIwW,EACAnC,EACAgC,EACAC,EAGJ,OADAE,EAAQ,IAAI3M,GAAY,GACb,IAAN7J,IAILsW,GAjCc,WAiCRtW,KAAc,EAGpBqW,EAAKvW,GAAOE,EAjCA,YAoCZqU,EAAO,IAAIM,GAAU6B,EAAM9H,QACtB0F,IACJC,EAAKkC,UAAW,EAAGD,EAAIlC,IACvBC,EAAKkC,UAAW,EAAGF,EAAIjC,MAEvBC,EAAKkC,UAAW,EAAGF,EAAIjC,IACvBC,EAAKkC,UAAW,EAAGD,EAAIlC,MAfhBoC,CAkBT,GD9BA,SAAAC,IEfA,IAAInE,G3JMI,CAENlQ,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,K2J9ClBoN,GAASD,KACTO,GNEI,CACNC,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,GOwCf,SAASY,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GACxD,IAAIC,EACAuD,EACAC,EACAnW,EACApJ,EACJ,KAAOkW,gBAAgBmJ,IACtB,OAAO,IAAIA,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GAI5D,IADA1S,EAAM,EACApJ,EAAI,EAAGA,EAAIkc,EAAM1b,OAAQR,IAC9BoJ,GAAO8S,EAAOlc,GAsCf,OAlCCsf,EADIjI,EAAOtG,kBACFsG,EAAOtG,kBAAoB3H,EAE3B,KAGV8M,KAAKsJ,YAAcF,EACnBpJ,KAAKuJ,iBAAmB3O,GAAiBD,GACzCqF,KAAK8B,QAAUX,EACfnB,KAAKwJ,OAAS7O,EACdqF,KAAK6B,QAAU3O,EACf8M,KAAKyJ,OAASzD,EAAM1b,OACpB0V,KAAK0J,QAAUxI,EACflB,KAAK2J,OAAS/D,EACd5F,KAAK4J,OAAS5D,EACdhG,KAAK6J,SAAW7O,EAChBgF,KAAK8J,WAAanW,GAASwN,EAAO5Q,KAAO4Q,EAAO3Q,KAEhDwP,KAAK+J,gBAAkBhP,GAAgBC,GAGvC6K,EChFD,SAAuB3S,EAAK8S,EAAOhL,EAASkG,EAAQnG,GACnD,IAAIkH,EAGJ,OAAa,IAAR/O,GAAgC,IAAnB6H,GAKT7H,KADT+O,EAAM8D,GAAuBC,EAAOhL,EAASkG,IACtB,GAAGe,EAAI,GAAG,CAClC,CDsEc+H,CAAc9W,EAAK8S,EAAOhL,EAASkG,EAAQlB,KAAK+J,iBAG7DV,EAAMnO,GAAeF,GAErBgF,KAAKiK,OAAS,CACbC,qBAAwBpE,GAAsBuD,EAAKxD,GACnDsE,wBAA2BxE,GAAyB0D,EAAKxD,GACzDuE,UAAY,GAIbpK,KAAKqK,kBAAoB,KAElBrK,IACR,CEzFA,SAASsK,GAAe5Y,GACvB,OACCA,aAAayX,IAEN,OAANzX,GACa,iBAANA,GACW,iBAAXA,EAAE0T,MACU,iBAAZ1T,EAAEsU,OACY,iBAAdtU,EAAEsJ,SACW,iBAAbtJ,EAAEwP,QACU,iBAAZxP,EAAEkU,OACU,iBAAZlU,EAAE0J,OACT1J,EAAEiJ,OACkB,iBAAbjJ,EAAEpH,QACU,iBAAZoH,EAAEtE,OACQ,mBAAVsE,EAAEnB,KACQ,mBAAVmB,EAAElB,GAGZ,CCtBA,SAAS+Z,GAAU9X,EAAG9I,GACrB,IAAIuJ,EACA3C,EACA4U,EACArb,EAeJ,IAZAqb,EAAKxK,GAAOlI,GAIXlC,EADIkL,GAAiBhJ,GACfoQ,GAAgBsC,GAEhB1Q,GAAQ0Q,GAGfjS,EAAMT,EAAEnI,OAGFR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAKyG,EAAKkC,EAAG3I,KAAQH,EACpB,OAAO,EAGT,OAAO,CACR,CCrBA,SAAS6gB,GAAS/X,GACjB,IAAIlC,EACA2C,EACAiS,EAEJ,IAAMtP,GAAcpD,GACnB,MAAM,IAAI5E,UAAWiB,EAAQ,oEAAqE2D,IAYnG,OATA0S,EAAKxK,GAAOlI,GAGPgJ,GAAiBhJ,KACrBlC,EAAMsS,GAAgBsC,IAGvBjS,EAAMT,EAAEnI,YAES,IAARiG,EAYT,SAAmB5G,GAClB,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAK2I,EAAG3I,KAAQH,EACf,OAAO,EAGT,OAAO,CACP,EAQD,SAAoBA,GACnB,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAKyG,EAAKkC,EAAG3I,KAAQH,EACpB,OAAO,EAGT,OAAO,CACP,CACF,CJ+CAuI,EAAaiX,GAAS,OAAQ,WAsBX3U,GAAE2U,GAAQxe,UAAW,cAAc,WACrD,OAAOqV,KAAKsJ,WACb,IAsBmB9U,GAAE2U,GAAQxe,UAAW,qBAAqB,WAC5D,OAAOqV,KAAKuJ,gBACb,IAoBmB/U,GAAE2U,GAAQxe,UAAW,QAAQ,WAC/C,OAAOqV,KAAK8B,OACb,IAoBmBtN,GAAE2U,GAAQxe,UAAW,SAAS,WAChD,OAAOqV,KAAKwJ,MACb,IAoBmBhV,GAAE2U,GAAQxe,UAAW,SAAS,WAChD,OKvOD,SAAoByC,GACnB,MAAO,CACN8c,qBAAwB9c,EAAM8c,qBAC9BC,wBAA2B/c,EAAM+c,wBACjCC,SAAYhd,EAAMgd,SAEpB,CLiOQK,CAAWzK,KAAKiK,OACxB,IAoBmBzV,GAAE2U,GAAQxe,UAAW,UAAU,WACjD,OAAOqV,KAAK6B,OACb,IAoBmBrN,GAAE2U,GAAQxe,UAAW,SAAS,WAChD,OAAOqV,KAAKyJ,MACb,IAoBmBjV,GAAE2U,GAAQxe,UAAW,UAAU,WACjD,OAAOqV,KAAK0J,OACb,IAwBmBlV,GAAE2U,GAAQxe,UAAW,SAAS,WAChD,OAAOqV,KAAK2J,MACb,IAoBmBnV,GAAE2U,GAAQxe,UAAW,SAAS,WAChD,OAAOgE,GAAOqR,KAAK4J,OAAQ,EAAG5J,KAAK4J,OAAOtf,OAC3C,IAoBmBkK,GAAE2U,GAAQxe,UAAW,WAAW,WAClD,OAAOgE,GAAOqR,KAAK6J,SAAU,EAAG7J,KAAK6J,SAASvf,OAC/C,IA0BWoG,EAAEyY,GAAQxe,UAAW,OMtYhC,WAEC,IAAIgR,EACA7R,EAGJ,IADA6R,EAAMqE,KAAK0J,QACL5f,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAClC6R,GAAOqE,KAAK6J,SAAU/f,GAAMkE,UAAWlE,GAExC,OAAKkW,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKoL,GAEnBqE,KAAK8B,QAASnG,EACtB,INmZWjL,EAAEyY,GAAQxe,UAAW,QO3ZhC,SAAegR,GAEd,IAAIX,EACAgL,EACA5K,EACAsP,EACAvE,EACArc,EAGJ,GAAe,KADfsR,EAAQ4E,KAAKyJ,QAEZ,OAAKzJ,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKyP,KAAK0J,SAExB1J,KAAK8B,QAAS9B,KAAK0J,SAE3B,GAAK1J,KAAKiK,OAAOC,sBAAwBlK,KAAKiK,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzBnK,KAAK+J,gBACT,OAAK/J,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKyP,KAAK0J,QAAQ/N,GAEhCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAGnC,IAA+B,IAA1BqE,KAAK+J,gBACT,OAAK/J,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKyP,KAAKkB,OAAOvF,GAE/BqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,EAEnC,CAKD,GAHAqK,EAAQhG,KAAK4J,OACb5O,EAAUgF,KAAK6J,SACfa,EAAM1K,KAAK0J,QACNiB,GAAe3K,KAAK2J,QAAW,CACnC,IAAM7f,EAAI,EAAGA,EAAIsR,EAAOtR,IAEvB6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAErB,OAAKkW,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKma,GAEnB1K,KAAK8B,QAAS4I,EACrB,CAED,IAAM5gB,EAAIsR,EAAM,EAAGtR,GAAK,EAAGA,IAE1B6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAErB,OAAKkW,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKma,GAEnB1K,KAAK8B,QAAS4I,EACtB,IPmYWha,EAAEyY,GAAQxe,UAAW,OQlchC,WAEC,IAAIgR,EACA7R,EAGJ,IADA6R,EAAMqE,KAAK0J,QACL5f,EAAI,EAAGA,EAAIkE,UAAU1D,OAAO,EAAGR,IACpC6R,GAAOqE,KAAK6J,SAAU/f,GAAMkE,UAAWlE,GAOxC,OALKkW,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKxC,UAAWlE,GAAK6R,GAElCqE,KAAK8B,QAASnG,GAAQ3N,UAAWlE,GAE3BkW,IACR,IRsdWtP,EAAEyY,GAAQxe,UAAW,QShehC,SAAegR,EAAKjK,GAEnB,IAAIsJ,EACAgL,EACA5K,EACAsP,EACAvE,EACArc,EAGJ,GAAe,KADfsR,EAAQ4E,KAAKyJ,QAOZ,OALKzJ,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKmL,EAAKqE,KAAK0J,SAE5B1J,KAAK8B,QAAS9B,KAAK0J,SAAY/N,EAEzBqE,KAER,GAAKA,KAAKiK,OAAOC,sBAAwBlK,KAAKiK,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzBnK,KAAK+J,gBAMT,OALK/J,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKkB,EAAGsO,KAAK0J,QAAQ/N,GAElCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAAQjK,EAE7BsO,KAGR,IAA+B,IAA1BA,KAAK+J,gBAMT,OALK/J,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKkB,EAAGsO,KAAK0J,QAAQ/N,GAElCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAAQjK,EAE7BsO,IAER,CAKD,GAHAgG,EAAQhG,KAAK4J,OACb5O,EAAUgF,KAAK6J,SACfa,EAAM1K,KAAK0J,QACNiB,GAAe3K,KAAK2J,QAAW,CACnC,IAAM7f,EAAI,EAAGA,EAAIsR,EAAOtR,IAEvB6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAOrB,OALKkW,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKkB,EAAGgZ,GAErB1K,KAAK8B,QAAS4I,GAAQhZ,EAEhBsO,IACP,CAED,IAAMlW,EAAIsR,EAAM,EAAGtR,GAAK,EAAGA,IAE1B6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAOrB,OALKkW,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKkB,EAAGgZ,GAErB1K,KAAK8B,QAAS4I,GAAQhZ,EAEhBsO,IACR,ITobWtP,EAAEyY,GAAQxe,UAAW,Y7BrehC,WAEC,IAAIwW,EACA/F,EAEAnR,EACAkb,EACAzT,EACA5H,EAUJ,GARAsR,EAAQ4E,KAAK4J,OAAOtf,OAIpBL,EAAM,cAHNkb,EAAKnF,KAAKwJ,QAGa,MAGvBrI,EAAS,GACJnB,KAAK6B,SAAW,IACpB,GAAY,cAAPsD,GAA6B,eAAPA,EAC1B,IAAMrb,EAAI,EAAGA,EAAIkW,KAAK6B,QAAS/X,IAE9BqX,GAAUrB,GADVpO,EAAIsO,KAAK4K,KAAM9gB,IACO,KAAOiW,GAAMrO,GAC9B5H,EAAIkW,KAAK6B,QAAQ,IACrBV,GAAU,WAIZ,IAAMrX,EAAI,EAAGA,EAAIkW,KAAK6B,QAAS/X,IAC9BqX,GAAUnB,KAAK4K,KAAM9gB,GAChBA,EAAIkW,KAAK6B,QAAQ,IACrBV,GAAU,UAIP,CAEN,GAAY,cAAPgE,GAA6B,eAAPA,EAC1B,IAAMrb,EAAI,EAAGA,EAAI,EAAGA,IAEnBqX,GAAUrB,GADVpO,EAAIsO,KAAK4K,KAAM9gB,IACO,KAAOiW,GAAMrO,GAC9B5H,EAAI,IACRqX,GAAU,WAIZ,IAAMrX,EAAI,EAAGA,EAAI,EAAGA,IACnBqX,GAAUnB,KAAK4K,KAAM9gB,GAChBA,EAAI,IACRqX,GAAU,MAOb,GAHAA,GAAU,UAGE,cAAPgE,GAA6B,eAAPA,EAC1B,IAAMrb,EAAI,EAAGA,GAAK,EAAGA,IAEpBqX,GAAUrB,GADVpO,EAAIsO,KAAK4K,KAAM5K,KAAK6B,QAAQ,EAAE/X,IACR,KAAOiW,GAAMrO,GAC9B5H,EAAI,IACRqX,GAAU,WAIZ,IAAMrX,EAAI,EAAGA,GAAK,EAAGA,IACpBqX,GAAUnB,KAAK4K,KAAM5K,KAAK6B,QAAQ,EAAE/X,GAC/BA,EAAI,IACRqX,GAAU,KAIb,CAeD,GAbAlX,GAAO+B,GADA8Y,GAAO9E,KAAKrF,OACG,WAAYwG,GAClClX,GAAO,KAINA,GADc,IAAVmR,EACG,KAEA,KAAO4E,KAAK4J,OAAOpG,KAAM,MAAS,KAE1CvZ,GAAO,KAGPA,GAAO,KACQ,IAAVmR,EACJnR,GAAO,SAEP,IAAMH,EAAI,EAAGA,EAAIsR,EAAOtR,IAClBkW,KAAK6J,SAAU/f,GAAM,EACzBG,IAAQ+V,KAAK6J,SAAU/f,GAEvBG,GAAO+V,KAAK6J,SAAU/f,GAElBA,EAAIsR,EAAM,IACdnR,GAAO,MAgBV,OAZAA,GAAO,KACPA,GAAO,KAGPA,GAAO,IACPA,GAAO,KAGPA,GAAO,IAAO+V,KAAK2J,OAAS,IAG5B1f,GAAO,IAIR,I6B2YWyG,EAAEyY,GAAQxe,UAAW,UUphBhC,WAEC,IAAIZ,EACAmJ,EACAxB,EACA5H,EAgBJ,IAdAoJ,EAAM8M,KAAK6B,SAGX9X,EAAM,CAAA,GACFkN,KAAO,UACXlN,EAAI4Q,MAAQqF,KAAKrF,MACjB5Q,EAAIqD,MAAQ,CACXgd,SAAYpK,KAAKiK,OAAOG,UAEzBrgB,EAAI6b,MAAQ5F,KAAK2J,OACjB5f,EAAIic,MAAQhG,KAAK4J,OAAOjb,QACxB5E,EAAIiR,QAAUgF,KAAK6J,SAASlb,QAGtB7E,EAAI,EAAGA,EAAIC,EAAIiR,QAAQ1Q,OAAQR,IAC/BC,EAAIiR,QAASlR,GAAM,IACvBC,EAAIiR,QAASlR,KAAQ,GAKvB,GADAC,EAAIqb,KAAO,GACQ,cAAdrb,EAAI4Q,OAAuC,eAAd5Q,EAAI4Q,MACrC,IAAM7Q,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB4H,EAAIsO,KAAK4K,KAAM9gB,GACfC,EAAIqb,KAAKvW,KAAMiR,GAAMpO,GAAKqO,GAAMrO,SAGjC,IAAM5H,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAIqb,KAAKvW,KAAMmR,KAAK4K,KAAM9gB,IAG5B,OAAOC,CAGR,IV+gBW2G,EAAEyY,GAAQxe,UAAW,WW9jBhC,WAEC,OAAqB,IAAhBqV,KAAKyJ,OACFzJ,KAAK4K,OAEN5K,IAGR,IX4lBA9N,EAAaiX,GAAQxe,UAAW,0BAA6B2J,KLxhB7D,WAEC,IAAI8U,EACAyB,EACA3X,EACAiS,EACA2F,EACAC,EACAC,EACAtZ,EACAuZ,EACAC,EACA/E,EACAtC,EACAsH,EACArhB,EAYJ,GAVAmhB,EAAIjL,KAAKoL,OAAS,QAClBJ,EAAKhL,KAAKqL,UAAY,CAAEJ,GAKxB/X,EAAM,GAAQ,IAJd2Q,EAAI7D,KAAKyJ,SACT0B,EAAIH,EAAG1gB,SAMPoH,EAAIsO,KAAKqK,oBACC3Y,EAAEoJ,aAAe5H,EAC1B,OAAOxB,EA0BR,IAvBAA,EAAI,IAAI0V,GAAU,IAAI1H,GAAaxM,IAGnC4X,EAAK9K,KAAK4J,OACVmB,EAAK/K,KAAK6J,SACV1E,EAAKnF,KAAKwJ,OACVJ,EAASpJ,KAAKuJ,iBAGd2B,EAAI,EACJxZ,EAAE4Z,QAASJ,EAAG,GAAuB,EAAI,GAGzCA,GAAK,EACLxZ,EAAE6Z,SAAUL,EAAGnG,GAAQI,GAAM0B,IAG7BqE,GAAK,EACLxZ,EAAE8Z,YAAaN,EAAG3W,GAAQsP,GAAKgD,IAG/BV,EAAQ,EAAJtC,EACJqH,GAAK,EACCphB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB4H,EAAE8Z,YAAaN,EAAG3W,GAAQuW,EAAGhhB,IAAM+c,IACnCnV,EAAE8Z,YAAaN,EAAE/E,EAAG5R,GAAQwW,EAAGjhB,GAAGsf,GAAUvC,IAC5CqE,GAAK,EAoBN,IAjBAA,GAAK/E,EACLzU,EAAE8Z,YAAaN,EAAG3W,GAAQyL,KAAK0J,QAAQN,GAAUvC,IAGjDqE,GAAK,EACLxZ,EAAE4Z,QAASJ,EAAGrD,GAAQ7H,KAAK2J,SAG3BuB,GAAK,EACLxZ,EAAE4Z,QAASJ,EAAG/C,GAAO8C,IAGrBC,GAAK,EACLxZ,EAAE8Z,YAAaN,EAAG3W,GAAQ4W,GAAKtE,IAG/BqE,GAAK,EACCphB,EAAI,EAAGA,EAAIqhB,EAAGrhB,IACnB4H,EAAE4Z,QAASJ,EAAG/C,GAAO6C,EAAGlhB,KACxBohB,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAU7K,KAAKiK,OAAoB,SAAA,EAAI,EACvCvY,EAAE+Z,SAAUP,EAAGL,EAAMhE,IAGrB7G,KAAKqK,kBAAoB3Y,EAElBA,CAGR,EI3FA,WAEC,IAAI0X,EACAH,EACA4B,EACA3X,EACAiS,EACA2F,EACAC,EACAC,EACAtZ,EACAuZ,EACAC,EACA/E,EACAtC,EACAsH,EACArhB,EAYJ,GAVAmhB,EAAIjL,KAAKoL,OAAS,QAClBJ,EAAKhL,KAAKqL,UAAY,CAAEJ,GAKxB/X,EAAM,GAAQ,IAJd2Q,EAAI7D,KAAKyJ,SACT0B,EAAIH,EAAG1gB,SAMPoH,EAAIsO,KAAKqK,oBACC3Y,EAAEoJ,aAAe5H,EAC1B,OAAOxB,EA2BR,IAxBAA,EAAI,IAAI0V,GAAU,IAAI1H,GAAaxM,IACnC+V,EAAQ,IAAI3M,GAAY5K,EAAEyP,QAG1B2J,EAAK9K,KAAK4J,OACVmB,EAAK/K,KAAK6J,SACV1E,EAAKnF,KAAKwJ,OACVJ,EAASpJ,KAAKuJ,iBAGd2B,EAAI,EACJxZ,EAAE4Z,QAASJ,EAAG,GAAuB,EAAI,GAGzCA,GAAK,EACLxZ,EAAE6Z,SAAUL,EAAGnG,GAAQI,GAAM0B,IAI7B+B,GAAqB/E,EAAGoF,EAAO,EAD/BiC,GAAK,GAIL/E,EAAQ,EAAJtC,EACJqH,GAAK,EACCphB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB8e,GAAqBkC,EAAGhhB,GAAImf,EAAO,EAAGiC,GACtCtC,GAAqBmC,EAAGjhB,GAAGsf,EAAQH,EAAO,EAAGiC,EAAE/E,GAC/C+E,GAAK,EAoBN,IAjBAA,GAAK/E,EACLyC,GAAqB5I,KAAK0J,QAAQN,EAAQH,EAAO,EAAGiC,GAGpDA,GAAK,EACLxZ,EAAE4Z,QAASJ,EAAGrD,GAAQ7H,KAAK2J,SAG3BuB,GAAK,EACLxZ,EAAE4Z,QAASJ,EAAG/C,GAAO8C,IAIrBrC,GAAqBuC,EAAGlC,EAAO,EAD/BiC,GAAK,GAILA,GAAK,EACCphB,EAAI,EAAGA,EAAIqhB,EAAGrhB,IACnB4H,EAAE4Z,QAASJ,EAAG/C,GAAO6C,EAAGlhB,KACxBohB,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAU7K,KAAKiK,OAAoB,SAAA,EAAI,EACvCvY,EAAE+Z,SAAUP,EAAGL,EAAMhE,IAGrB7G,KAAKqK,kBAAoB3Y,EAElBA,CAGR,GalKAQ,EAAA3I,GAAA,UAAAihB,gjCCbIkB,GAAY,gBAmBhB,SAASC,KACR,IAAIC,EACA7hB,EACA+G,EACJ,OAA0B,IAArB9C,UAAU1D,OACPya,GAAO8G,IAAIld,SAEnBmC,GAAM,EACN8a,EAAO5d,UAAW,GACb0d,GAAU3Z,KAAM6Z,IAEN,SADdA,EAAO5f,GAAS4f,EAAMF,GAAW,MACD,UAATE,IACtB9a,GAAM,GAIR/G,GADAA,EAAMgb,GAAQ6G,IACE7hB,EAAI4E,QAAU,GACzBmC,GAAO/G,EAAIO,OAAS,GACxBP,EAAI8E,KAAM,WAEJ9E,EACR,CCKA,IAAI+hB,GAAmBvB,GAAUwB,MC5BjC,SAASC,GAASriB,EAAO0H,GACxB,OAAK1H,UAGoB,iBAAb0H,EACJA,KAAY7H,OAAQG,GAEnBe,OAAQ2G,KAAc7H,OAAQG,GACxC,CCDA,SAASsiB,GAAyBtiB,GACjC,OACC0O,GAAY1O,IACZgL,GAAmBhL,EAAMuiB,YACzBvX,GAAmBhL,EAAMmR,aACzBzC,GAAY1O,EAAMwiB,eAClB9T,GAAY1O,EAAMyiB,eAClB/T,GAAY1O,EAAM0iB,WAClBhU,GAAY1O,EAAM2iB,WAClBjU,GAAY1O,EAAM4iB,SAClBnb,EAAYzH,EAAO,WACnByH,EAAYzH,EAAO,SAErB,CCrCA,ICAI6iB,GCAAA,GCCAA,GHDAC,G7KYI,CAEN5X,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,K6KlCtB,SAASiS,GAAU/R,GAClB,IAAIjJ,EAAI+a,GAAM9R,GACd,OAASjR,EAAUgI,GAAQA,EAAI,IAChC,CITA,SAASib,GAAShS,GACjB,IAAIiS,SAAajS,EACjB,MAAW,WAANiS,EAC2B,OAAtBF,GAAU/R,GAAqB,KAAOA,EAErC,WAANiS,EACGlS,GAAUC,GAEP,WAANiS,GAAkBjS,EACfjQ,OAAQiQ,GAEXsR,GAAyBtR,GACtBA,EAAMkS,OAEP,IACR,CC8BA,SAASC,GAAUnjB,EAAOya,GACzB,IAAIlC,EACAjL,EACAgC,EAGJ,GADAiJ,EAAQlU,UAAU1D,SACV0V,gBAAgB8M,IACvB,OAAK5K,EAAQ,EACL,IAAI4K,GAAUnjB,GAEf,IAAImjB,GAAUnjB,EAAOya,GAE7B,GAAK0H,GAAkBniB,GACtBsN,EAAO,cACD,IAnDR,SAAqBtN,GACpB,OACCA,aAAiBmjB,IAEC,iBAAVnjB,GACG,OAAVA,GAC2B,aAA3BA,EAAMgN,YAAYE,MAClBnC,GAAU/K,EAAMojB,OAChBrY,GAAU/K,EAAMqjB,cAChBtY,GAAU/K,EAAMsjB,YAChBjB,GAASriB,EAAO,QAGnB,CAsCaujB,CAAYvjB,GAEvB,OAAO,IAAImjB,GAAUnjB,EAAMA,MAAO,CACjCqjB,YAAerjB,EAAMqjB,cAEhB,IAAKf,GAAyBtiB,GAGpC,MAAM,IAAIkE,UAAWiB,EAAQ,kJAAmJnF,IAFhLsN,EAAO,QAGP,CACD,GAAKiL,EAAQ,EAAI,CAEhB,IAAMtJ,GADNK,EAAOmL,GAEN,MAAM,IAAIvW,UAAWiB,EAAQ,qEAAsEmK,IAEpG,GAAK7H,EAAY6H,EAAM,iBAAoBvE,GAAUuE,EAAK+T,aACzD,MAAM,IAAInf,UAAWiB,EAAQ,8DAA+D,cAAemK,EAAK+T,aAEnH,MACE/T,EAAO,CAAA,EAUR,OARA/G,EAAa8N,KAAM,SAAUrW,GAC7BuI,EAAa8N,KAAM,eAAgB/G,EAAK+T,aJxEzC,SAAoBrS,GACnB,OAA0B,IAArB3M,UAAU1D,OKtBR,CACNgQ,OAAU,OAEVzF,KAAQ,UAERsF,UAAa,+CACbC,UAAa,iDACbC,WAAc,iDAEdL,QAAW,uCACXmT,SAAY,8BACZlT,QAAW,yCACXC,QAAW,yCACXkT,SAAY,4CAEZ7S,QAAW,sBAEXhB,KAAQ,uBACRG,MAAS,wBACTE,MAAS,wBACTE,MAAS,wBACTuT,OAAU,yBACVC,OAAU,yBAEV9T,MAAS,yBACTC,OAAU,mCACVE,OAAU,0BACVE,OAAU,0BACVE,OAAU,0BACVwT,QAAW,2BACXC,QAAW,kCLLG,IAAVhB,KACJA,GK1BM,CACNlS,OAAU,OAEVzF,KAAQ,UAERsF,UAAa,+CACbC,UAAa,iDACbC,WAAc,iDAEdL,QAAW,uCACXmT,SAAY,8BACZlT,QAAW,yCACXC,QAAW,yCACXkT,SAAY,4CAEZ7S,QAAW,sBAEXhB,KAAQ,uBACRG,MAAS,wBACTE,MAAS,wBACTE,MAAS,wBACTuT,OAAU,yBACVC,OAAU,yBAEV9T,MAAS,yBACTC,OAAU,mCACVE,OAAU,0BACVE,OAAU,0BACVE,OAAU,0BACVwT,QAAW,2BACXC,QAAW,6BLFLhB,GAAOG,GAAShS,KAAa,KACrC,CIgE0D8S,CAAY9jB,IAAW,IAChFuI,EAAa8N,KAAM,QHzEpB,SAAoBrF,GACnB,OAA0B,IAArB3M,UAAU1D,OKtBR,CACNgQ,OAAU,IAEVzF,KAAQ,IAERsF,UAAa,IACbC,UAAa,IACbC,WAAc,IAEdL,QAAW,IACXmT,SAAY,IACZlT,QAAW,IACXC,QAAW,IACXkT,SAAY,IAEZ7S,QAAW,IAEXhB,KAAQ,IACRG,MAAS,IACTE,MAAS,IACTE,MAAS,IACTuT,OAAU,IACVC,OAAU,IAEV9T,MAAS,IACTC,OAAU,IACVE,OAAU,IACVE,OAAU,IACVE,OAAU,IACVwT,QAAW,IACXC,QAAW,WLLG,IAAVhB,KACJA,GK1BM,CACNlS,OAAU,IAEVzF,KAAQ,IAERsF,UAAa,IACbC,UAAa,IACbC,WAAc,IAEdL,QAAW,IACXmT,SAAY,IACZlT,QAAW,IACXC,QAAW,IACXkT,SAAY,IAEZ7S,QAAW,IAEXhB,KAAQ,IACRG,MAAS,IACTE,MAAS,IACTE,MAAS,IACTuT,OAAU,IACVC,OAAU,IAEV9T,MAAS,IACTC,OAAU,IACVE,OAAU,IACVE,OAAU,IACVE,OAAU,IACVwT,QAAW,IACXC,QAAW,MLFLhB,GAAOG,GAAShS,KAAa,KACrC,CGiE6B+S,CAAY/jB,IAAW,IACnDuI,EAAa8N,KAAM,QGhFpB,SAAkBrF,GACjB,IAAIiS,SAAajS,EACjB,MAAW,WAANiS,EACKlS,GAAUC,GAAYA,EAAQ,KAE7B,WAANiS,EACGF,GAAU/R,GAEP,WAANiS,GAAkBjS,GAASnI,GAAWmI,EAAMgT,MACzChT,EAAMgT,KAET1B,GAAyBtR,GACtB+R,GAAU,oBAEX,IACR,CHiE6BkB,CAAajkB,KAAY,GACrDuI,EAAa8N,KAAM,aFtEpB,SAAyBrF,GACxB,IAAIjJ,EACJ,OAA0B,IAArB1D,UAAU1D,OM5BR,CACNgQ,OAAU,EAEVzF,KAAQ,EAERsF,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdL,QAAW,EACXmT,SAAY,EACZlT,QAAW,EACXC,QAAW,EACXkT,SAAY,GAEZ7S,QAAW,KAEXhB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EACTuT,OAAU,GACVC,OAAU,GAEV9T,MAAS,EACTC,OAAU,EACVE,OAAU,EACVE,OAAU,EACVE,OAAU,EACVwT,QAAW,GACXC,QAAW,UNCG,IAAVhB,KACJA,GMhCM,CACNlS,OAAU,EAEVzF,KAAQ,EAERsF,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdL,QAAW,EACXmT,SAAY,EACZlT,QAAW,EACXC,QAAW,EACXkT,SAAY,GAEZ7S,QAAW,KAEXhB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EACTuT,OAAU,GACVC,OAAU,GAEV9T,MAAS,EACTC,OAAU,EACVE,OAAU,EACVE,OAAU,EACVE,OAAU,EACVwT,QAAW,GACXC,QAAW,KNIP7S,EAEChG,GADLjD,EAAIiJ,EAAMuR,WAEFxa,EAED8a,GAAOG,GAAShS,KAAa,KAE9B,KACR,CEsDkCkT,CAAiBlkB,KAAY,GAC9DuI,EAAa8N,KAAM,cAAepF,GAAiBjR,KAAY,GAC/DuI,EAAa8N,KAAM,aAAc,QACjC9N,EAAa8N,KAAM,QAAS/I,GACrB+I,IACR,CKlFA,SAAS8N,GAAkBnkB,GAC1B,OACCA,aAAiBmjB,IAEC,iBAAVnjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMuiB,YACjB1Z,GAAW7I,EAAMmR,aACjBpG,GAAU/K,EAAMsjB,YAChBvY,GAAU/K,EAAMojB,OAChBva,GAAW7I,EAAMgkB,OACjB3B,GAASriB,EAAO,QAGnB,CCsBA,SAASokB,GAAkBpkB,GAC1B,OACC0O,GAAY1O,IACZgL,GAAmBhL,EAAMuiB,YACzBvX,GAAmBhL,EAAMmR,aACzBzC,GAAY1O,EAAMwiB,eAClB9T,GAAY1O,EAAMyiB,eAClB/T,GAAY1O,EAAM0iB,WAClBhU,GAAY1O,EAAM4iB,SC5CpB,SAA2B5iB,GAC1B,OACCA,aAAiBmjB,IAEC,iBAAVnjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMuiB,YACjB1Z,GAAW7I,EAAMmR,aACjBpG,GAAU/K,EAAMsjB,YAChBvY,GAAU/K,EAAMojB,OAChBva,GAAW7I,EAAMgkB,OACjB3B,GAASriB,EAAO,QAGnB,CDgCEmkB,CAAkBnkB,IAClBokB,GAAkBpkB,EAAMA,MAE1B,CEzBA,SAASujB,GAAYxb,GACpB,OACCoa,GAAkBpa,IAClBoc,GAAkBpc,IAClBqc,GAAkBrc,EAEpB,CRkEAQ,EAAa4a,GAAU,OAAQ,YAqBZtY,GAAEsY,GAASniB,UAAW,aAAa,WACrD,OAAOqV,KAAKgO,UACb,IAqBmBxZ,GAAEsY,GAASniB,UAAW,cAAc,WACtD,OAAOqV,KAAKsJ,WACb,IAyBmB9U,GAAEsY,GAASniB,UAAW,aAAa,WACrD,OAAOqV,KAAKiO,UACb,IAqBmBzZ,GAAEsY,GAASniB,UAAW,QAAQ,WAChD,OAAOqV,KAAKkO,KACb,IAqBmB1Z,GAAEsY,GAASniB,UAAW,eAAe,WACvD,OAAOqV,KAAKmO,YACb,IAqBmB3Z,GAAEsY,GAASniB,UAAW,QAAQ,WAChD,OAAOqV,KAAKoO,KACb,IAiBmB5Z,GAAEsY,GAASniB,UAAW,SAAS,WACjD,OAAOqV,KAAKqO,MACb,IAqBW3d,EAAEoc,GAASniB,UAAW,UAAU,WAC1C,MAAO,CACNsM,KAAQ,WACRtN,MAASqW,KAAKzU,WACd0hB,UAAajN,KAAKiO,WAClBjB,YAAehN,KAAKmO,aAEtB,IAiBWzd,EAAEoc,GAASniB,UAAW,YAAY,WAC5C,MAAwB,WAAfqV,KAAKsO,MAAuBtO,KAAKqO,OAAOxB,OAASniB,OAAQsV,KAAKqO,OACxE,IAiBW3d,EAAEoc,GAASniB,UAAW,WAAW,WAC3C,OAAOqV,KAAKzU,UACb,okBS/UA,SAASgjB,KACR,OAAOC,GAAS7f,OACjB,CCDA,SAASqZ,KAER,MAAO,CACNyG,KAAQ,EACRC,SAAY,EACZC,aAAgB,EAChBC,QAAW,EACXC,oBAAuB,EACvBC,eAAkB,EAClBC,2BAA8B,EAC9BC,iBAAoB,EACpBC,6BAAgC,EAChCC,QAAW,EACXC,oBAAuB,GACvBC,eAAkB,GAClBC,2BAA8B,GAC9BC,oBAAuB,GACvBC,gCAAmC,GACnCC,uBAA0B,GAC1BC,mCAAsC,GACtC3P,KAAQ,GACR4P,iBAAoB,GACpBC,QAAW,GACXC,oBAAuB,GACvBC,cAAiB,GACjBC,0BAA6B,GAC7BC,cAAiB,GACjBC,0BAA6B,GAC7BC,WAAc,GACdC,uBAA0B,GAC1BtU,QAAW,GACXuU,cAAiB,GAEnB,CC5BAje,EAAA3I,GAAA,OAAAye,ICSA,SAAiBjF,EAAQqN,GACxB,IAAIxb,EACAyC,EACAvN,EAGJ,IADA8K,EAAOyE,GAAY+W,GACbtmB,EAAI,EAAGA,EAAI8K,EAAKtK,OAAQR,IAE7BoI,GAAa6Q,EADb1L,EAAIzC,EAAM9K,GACcsmB,EAAQ/Y,GAGlC,CDnBA6R,CAAA3f,GDJQ,CACNklB,KAAQ,EACRC,SAAY,EACZC,aAAgB,EAChBC,QAAW,EACXC,oBAAuB,EACvBC,eAAkB,EAClBC,2BAA8B,EAC9BC,iBAAoB,EACpBC,6BAAgC,EAChCC,QAAW,EACXC,oBAAuB,GACvBC,eAAkB,GAClBC,2BAA8B,GAC9BC,oBAAuB,GACvBC,gCAAmC,GACnCC,uBAA0B,GAC1BC,mCAAsC,GACtC3P,KAAQ,GACR4P,iBAAoB,GACpBC,QAAW,GACXC,oBAAuB,GACvBC,cAAiB,GACjBC,0BAA6B,GAC7BC,cAAiB,GACjBC,0BAA6B,GAC7BC,WAAc,GACdC,uBAA0B,GAC1BtU,QAAW,GACXuU,cAAiB,KGnBnB,IAAIE,GAAyB9F,GAAUgE,MCtBnC1Z,GAAOwD,GAAY7O,OAAO0f,QCsB1BA,GAAS1f,OAAO0f,OC3BhBrU,QAAiD,IAAjCrL,OAAO8mB,sBCKvBC,GAAkB/mB,GAAO8mB,sBCuB7B,ICTIpH,GDSJqH,GATK7Y,GDKL,SAAgC/N,GAC/B,OAAO4mB,GAAiB/mB,GAAQG,GACjC,EGXA,WACC,MAAO,EACR,ECKA,SAAS6mB,GAAsB7mB,GAC9B,IAAII,EACA4Y,EACA7Y,EAIJ,IAFAC,EAAM6K,GAAMjL,GACZgZ,EAAM4N,GAAiB5mB,GACjBG,EAAI,EAAGA,EAAI6Y,EAAIrY,OAAQR,IACvB2mB,GAAc9mB,EAAOgZ,EAAK7Y,KAC9BC,EAAI8E,KAAM8T,EAAK7Y,IAGjB,OAAOC,CACR,CFdCmf,GADIwH,GACKnnB,GGWV,SAAiBwZ,GAChB,IAAIqN,EACAxb,EACAkE,EACA5F,EACAyd,EACA7mB,EACA8D,EACJ,GAAKmV,QACJ,MAAM,IAAIlV,UAAWiB,EAAQ,2EAA4EiU,IAG1G,IADA4N,EAAKnnB,GAAQuZ,GACPjZ,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAElC,GAAKsmB,OADLA,EAASpiB,UAAWlE,IAOpB,IADAoJ,GADA0B,EAAO4b,GAAsBhnB,GAAQ4mB,KAC1B9lB,OACLsD,EAAI,EAAGA,EAAIsF,EAAKtF,IAErB+iB,EADA7X,EAAMlE,EAAMhH,IACAwiB,EAAQtX,GAGtB,OAAO6X,CACR,EH7BA,IAAAC,GAAe1H,GIXf,SAASzb,GAAMgF,EAAGoE,GACjB,OCDD,SAAgBpE,EAAGoe,GAClB,IAAIpkB,EAAIgG,EAAErF,MACV,MAAkB,iBAANX,GAAwB,OAANA,EACtB,GAEHokB,EACG3H,GAAQ,GAAIzc,GAEbA,CACR,CDRQW,CAAOqF,GAAG,GAASoE,EAC3B,CEIA,IAAIia,GAAUvG,GAAU3C,MCyFxB,SAASmJ,GAASte,EAAGQ,EAAWwP,GAC/B,IAAIzS,EACJ,OA9FD,SAAoBA,EAAKyV,GACxB,MAAkC,mBAAlBzV,EAAKyV,EACtB,CA4FMC,CAAWjT,EAAG,SACXA,EAAEue,MAAO/d,EAAWwP,IAE5BzS,EAAMkV,GAAkBzS,IACf4S,iBA3CV,SAAoB5S,EAAGQ,EAAWwP,GACjC,IAAI2C,EACA7U,EACAzG,EAKJ,IAHAsb,EAAO3S,EAAE2S,KACT7U,EAAMkC,EAAE6S,UAAW,GAEbxb,EAAI,EAAGA,EAAIsb,EAAK9a,OAAQR,IAC7B,IAAMmJ,EAAUrH,KAAM6W,EAASlS,EAAK6U,EAAMtb,GAAKA,EAAGsb,GACjD,OAAO,EAGT,OAAO,CACR,CA8BSE,CAAWtV,EAAKiD,EAAWwP,GA5EpC,SAAmBhQ,EAAGQ,EAAWwP,GAChC,IAAI3Y,EACJ,IAAMA,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAC1B,IAAMmJ,EAAUrH,KAAM6W,EAAShQ,EAAG3I,GAAKA,EAAG2I,GACzC,OAAO,EAGT,OAAO,CACR,CAsEQwe,CAAUxe,EAAGQ,EAAWwP,EAChC,CChHA,SAASyO,GAAerN,EAAGgF,GAC1B,OAAKA,EAAS,EACN,GAEC,EAAIhF,GAAMgF,CACpB,CCIA,SAASsI,GAAmBxnB,GAC3B,OAAA,MAASA,CACV,CCwBA,SAASynB,GAAOvN,EAAGP,EAAW7Q,EAAG4e,EAASC,GACzC,IAAIvnB,EACAwnB,EACArG,EACAxZ,EACA5H,EAEJ,GAAK+Z,GAAK,EACT,MAAO,GAGR,GAAiB,IAAZwN,GAA6B,IAAZC,GAAiBzN,IAAMpR,EAAEnI,QAlChD,SAAoB0F,EAAKyV,GACxB,MAAkC,mBAAlBzV,EAAKyV,EACtB,CAgC0DC,CAAWjT,EAAG,QACtE,OAAOA,EAAE+Q,KAAMF,GAGhB,IADA4H,EAAIhG,GAAkBzS,IACf4S,iBACN,OCnCF,SAAgBxB,EAAGP,EAAW7Q,EAAG4e,EAASC,GACzC,IAAIE,EACAjhB,EACAxG,EACAwnB,EACA7f,EACA5H,EAUJ,IAPA0nB,EAAO/e,EAAE2S,KAGT7U,EAAMkC,EAAE6S,UAAW,GAEnBiM,EAAKD,EACLvnB,EAAM,GACAD,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACdA,EAAI,IACRC,GAAOuZ,GAGF6N,GADNzf,EAAInB,EAAKihB,EAAMD,MAEdxnB,GAAOW,OAAQgH,IAEhB6f,GAAMF,EAEP,OAAOtnB,CACR,CDQSub,CAAWzB,EAAGP,EAAW4H,EAAGmG,EAASC,GAI7C,IAFAC,EAAKD,EACLvnB,EAAM,GACAD,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACdA,EAAI,IACRC,GAAOuZ,GAGF6N,GADNzf,EAAIe,EAAG8e,MAENxnB,GAAOW,OAAQgH,IAEhB6f,GAAMF,EAEP,OAAOtnB,CACR,CErDA,SAASyZ,GAAM/Q,EAAG6Q,GACjB,OAAOmO,GAAShf,EAAEnI,OAAQgZ,EAAW7Q,EAAG,EAAG,EAC5C,CCLA,SAASif,GAAejf,GACvB,IAAI0S,EAAKxK,GAAOlI,GAChB,OAAKgJ,GAAiBhJ,GACdoQ,GAAgBsC,GAEjB1Q,GAAQ0Q,EAChB,CCEA,SAASwM,GAASC,EAAQ5L,EAAOhL,EAAS6W,EAASxO,GAClD,IAAIyO,EACAP,EACA9e,EACAoR,EACA/Z,EAGJ,MADA+Z,EAAImC,EAAO,KACD,GAMV,IAHAuL,EAAKM,EAAS,GACdC,EAAK9W,EAAS,GACdvI,EAAImf,EAAQ,GACN9nB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB2I,EAAG8e,GAAOlO,IACVkO,GAAMO,CAER,CCbA,SAASH,GAASC,EAAQ5L,EAAOhL,EAAS6W,EAASvM,EAAWjC,GAC7D,IAAI0O,EACAD,EACAP,EACA9e,EACAoR,EACA/Z,EAGJ,MADA+Z,EAAImC,EAAO,KACD,GAOV,IAJAuL,EAAKM,EAAS,GACdC,EAAK9W,EAAS,GACdvI,EAAImf,EAAQ,GACZG,EAAOzM,EAAW,GACZxb,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnBioB,EAAMtf,EAAG8e,EAAIlO,KACbkO,GAAMO,CAER,CClBA,SAASH,GAASC,EAAQ5L,EAAOhL,EAASqI,GACzC,IAAI0O,EACAtf,EAMJ,OAHKgJ,GADLhJ,EAAImf,EAAQ,MAEXG,EAAOxM,GAAgB5K,GAAOlI,KAE1Bsf,ECNN,SAAkBH,EAAQ5L,EAAOhL,EAASsK,EAAWjC,GAEpD,OAAO8F,GAASyI,EAAQ5L,EAAOhL,EADjB,CAAEkW,GAAelL,EAAO,GAAKhL,EAAS,KACHsK,EAAWjC,EAC7D,CDKSiC,CAAWsM,EAAQ5L,EAAOhL,EAAS,CAD1C+W,EAAOA,GAAQjW,GAAQnB,GAAOlI,KACsB4Q,GEbtD,SAAkBuO,EAAQ5L,EAAOhL,EAASqI,GAEzC,OAAO8F,GAASyI,EAAQ5L,EAAOhL,EADjB,CAAEkW,GAAelL,EAAO,GAAKhL,EAAS,KACHqI,EAClD,CFYQoO,CAASG,EAAQ5L,EAAOhL,EAASqI,EACzC,CGvCA,SAAS2O,GAAOhM,GACf,IAAI5K,EACAvR,EACAC,EAGJ,GAAe,KADfsR,EAAQ4K,EAAM1b,QAEb,OAAO,EAGR,IADAT,EAAI,EACEC,EAAI,EAAGA,EAAIsR,EAAOtR,IACvBD,GAAKmc,EAAOlc,GAEb,OAAOD,CACR,CCRA,SAAS8Q,GAAOlI,GACf,OAAOA,EAAEkI,KACV,CCRA,SAASkW,GAAMpe,GACd,IAAI1I,EACAmJ,EACApJ,EAIJ,IAFAoJ,EAAMT,EAAEnI,OACRP,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAM4D,EAAG3I,IAEd,OAAOC,CACR,CCHA,SAASic,GAAOvT,EAAGoe,GAClB,IAAI/F,EAAKrY,EAAEuT,MACX,OAAK6K,EACGoB,GAAanH,GAEdA,CACR,CC6CA,SAASoH,GAAelM,EAAOJ,GAC9B,OAAK+E,GAAe/E,GAhCrB,SAAsBI,GACrB,IAAIjc,EACAoc,EACArc,EAIJ,IAFAC,EAAM,GACNoc,EAAI,EACErc,EAAI,EAAGA,EAAIkc,EAAM1b,OAAQR,IAC9BC,EAAI8E,KAAMsX,GACVA,GAAKH,EAAOlc,GAEb,OAAOC,CACR,CAqBSooB,CAAanM,GA3DtB,SAAmBA,GAClB,IAAI5K,EACArR,EACAoc,EACArc,EAIJ,IAFAsR,EAAQ4K,EAAM1b,OACdP,EAAM,GACAD,EAAI,EAAGA,EAAIsR,EAAOtR,IACvBC,EAAI8E,KAAM,GAGX,IADAsX,EAAI,EACErc,EAAIsR,EAAM,EAAGtR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMqc,EACXA,GAAKH,EAAOlc,GAEb,OAAOC,CACR,CA4CQqoB,CAAUpM,EAClB,CC7CA9T,GCRA,SAAgB2R,EAAGP,EAAW7Q,EAAG4e,GAChC,OAAOlI,GAAStF,EAAGP,EAAW7Q,EAAG4e,EAASH,GAAerN,EAAGwN,GAC7D,GDMA,UAAAlI,IEqBAjX,EAAA3I,GAAA,WCZA,SAAkBqoB,EAAQ5L,EAAOhL,EAAS6W,EAASxO,GAClD,IAAI0O,EACAtf,EAMJ,OAHKgJ,GADLhJ,EAAImf,EAAQ,MAEXG,EAAOxM,GAAgB5K,GAAOlI,KAE1Bsf,EAEGzM,GAAWsM,EAAQ5L,EAAOhL,EAAS6W,EAAS,CADnDE,EAAOA,GAAQjW,GAAQnB,GAAOlI,KAC+B4Q,GAEvDoO,GAASG,EAAQ5L,EAAOhL,EAAS6W,EAASxO,EAClD,IC7BAnR,EAAA3I,GAAA,UCgDA,SAAwByc,EAAOJ,EAAO7b,GACrC,OAAK4gB,GAAe/E,GApCrB,SAAsBI,EAAOjc,GAC5B,IAAIoc,EACArc,EAGJ,IADAqc,EAAI,EACErc,EAAI,EAAGA,EAAIkc,EAAM1b,OAAQR,IAC9BC,EAAKD,GAAMqc,EACXA,GAAKH,EAAOlc,GAEb,OAAOC,CACR,CA2BSooB,CAAanM,EAAOjc,GA3D7B,SAAmBic,EAAOjc,GACzB,IACIoc,EACArc,EAIJ,IADAqc,EAAI,EACErc,EAFEkc,EAAM1b,OAEE,EAAGR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMqc,EACXA,GAAKH,EAAOlc,GAEb,OAAOC,CACR,CAiDQqoB,CAAUpM,EAAOjc,EACzB,ICpEA,IAAIsoB,GAAY,YAkBhB,SAASrX,GAASvI,EAAGoe,GACpB,IAAIxH,EACAyB,EACAC,EAGJ,MAAmB,iBADnBA,EAAKtY,EAAEuI,UAC+B,OAAP+P,EAEX,KADnBD,EAAKrY,EAAEuT,OACC1b,OACA,CAAE,IAGJoK,GADN2U,EAAM5W,EAAEmT,SAEPyD,EAAMgJ,IAEAH,GAAepH,EAAIzB,IAEtBwH,EACGoB,GAAalH,GAEdA,CACR,CC5BA,SAAS7J,GAAQzO,GAChB,IAAIsY,EACAD,EACAI,EAGJ,OAAKxhB,EADLwhB,EAAIzY,EAAEyO,QAEEgK,EAGW,KADnBJ,EAAKrY,EAAEuT,OACC1b,QAIW,iBADnBygB,EAAKtY,EAAEuI,UAC+B,OAAP+P,EAHvB,ECfT,SAAyB/E,EAAOhL,GAC/B,IAAIkG,EACA9F,EACAtR,EAIJ,IAFAsR,EAAQ4K,EAAM1b,OACd4W,EAAS,EACHpX,EAAI,EAAGA,EAAIsR,EAAOtR,IAClBkR,EAASlR,GAAM,IAEnBoX,GAAUlG,EAASlR,IAAQkc,EAAOlc,GAAI,IAGxC,OAAOoX,CACR,CDOQoR,CAAgBxH,EAAIC,EAC5B,CE9BA,IAAIsH,GAAY,YACZE,GAAe,eAqBnB,SAAS3M,GAAOnT,GACf,IAAIsY,EACAG,EAGJ,OAAKxW,GADLwW,EAAIzY,EAAEmT,OAEEsF,EAIW,iBADnBH,EAAKtY,EAAEuI,UAC+B,OAAP+P,GAIpB,KADXG,EAAIhQ,GAAe6P,KACG,IAANG,EAHRmH,GAMG,IAANnH,EACGqH,GAGgB,IAAnB9f,EAAEuT,MAAM1b,OACL+nB,GAGD,IACR,CCtCA,SAASjN,GAAM3S,GACd,OAAOA,EAAE2S,IACV,CCmCA,SAASoN,GAAoB/f,GAC5B,IAAI+e,EACA3c,EACAiW,EACA3F,EAQJ,OANAqM,EAAOiB,GAAShgB,GAChBqY,EAAK4H,GAAUjgB,GAAG,GAClB0S,EAAKwN,GAAUlgB,GAEfoC,EAAO4G,GAAiB+V,GAEjB,CACNoB,IAAOngB,EACPkI,MAASwK,EACTC,KAAQoM,EACRlnB,OAAU0nB,GAAOlH,GACjB9E,MAAS8E,EACT9P,QAAW6X,GAAYpgB,GAAG,GAC1ByO,OAAU4R,GAAWrgB,GACrBmT,MAASmN,GAAUtgB,GACnB4S,iBAAoBxQ,EACpByQ,UAAa,EACZ,CAAEzC,GAAgBsC,GAAMI,GAAgBJ,IACxC,CAAE1Q,GAAQ0Q,GAAMrJ,GAAQqJ,IAE3B,CC8DA,SAAS6N,GAAcld,EAAK7F,EAAMtG,GACjC,OAAK8R,GAAiB3F,GAvDvB,SAAoBA,EAAK7F,EAAMtG,GAC9B,IAAI4G,EACAmB,EACA5H,EAGJ,GADAyG,EAAMmhB,GAAe5b,QACN,IAAVnM,EAAmB,CACvB,IAAMG,EAAI,EAAGA,EAAIgM,EAAIxL,OAAQR,IAE5B,GAAKkiB,GADLta,EAAInB,EAAKuF,EAAKhM,GACGmG,IAAUyB,EAAGzB,KAAWtG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMG,EAAI,EAAGA,EAAIgM,EAAIxL,OAAQR,IAC5B,GAAKyG,EAAKuF,EAAKhM,GAAKmG,KAAWtG,EAC9B,OAAO,EAGT,OAAO,CACR,CAmCS2b,CAAWxP,EAAK7F,EAAMtG,GA3G/B,SAAkBmM,EAAK7F,EAAMtG,GAC5B,IAAI+H,EACA5H,EACJ,QAAe,IAAVH,EAAmB,CACvB,IAAMG,EAAI,EAAGA,EAAIgM,EAAIxL,OAAQR,IAE5B,GAAKkiB,GADLta,EAAIoE,EAAKhM,GACQmG,IAAUyB,EAAGzB,KAAWtG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMG,EAAI,EAAGA,EAAIgM,EAAIxL,OAAQR,IAC5B,GAAKgM,EAAKhM,GAAKmG,KAAWtG,EACzB,OAAO,EAGT,OAAO,CACR,CA2FQspB,CAASnd,EAAK7F,EAAMtG,EAC5B,CCxIA,SAASupB,GAAQrpB,GAChB,IAAIiM,EACAhM,EAGJ,GADAgM,EAAM,GACDjM,GAAK,EACT,OAAOiM,EAER,IAAMhM,EAAI,EAAGA,EAAID,EAAGC,IACnBgM,EAAIjH,KAAM/E,GAEX,OAAOgM,CACR,CCiDA,SAASqd,GAASppB,EAAKqb,EAAMyD,EAAQ3H,GACpC,IAAIxP,EACAyU,EACArc,EAKJ,IAHAqc,EAAa,EAAT0C,EACJ/e,EAAa,EAAToX,EACJxP,EAAI,EACI5H,GAAK,GAAKA,EAAIsb,EAAK9a,QAC1B8a,EAAMtb,GAAM4H,EACZ0T,EAAMtb,EAAE,GAAM,EACdA,GAAKqc,EACLzU,GAAK,EAEN,OAAO3H,CACR,CCxEA,SAASqpB,GAAM3gB,EAAG4gB,GACjB,IAAItpB,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIupB,EAAQ/oB,OAAQR,IAChCC,EAAI8E,KAAM4D,EAAG4gB,EAASvpB,KAEvB,OAAOC,CACR,CCsBA,SAASupB,GAAiBxI,EAAIgH,EAAIyB,EAAIC,GACrC,IAAI7Q,ECKL,SAAoBqD,EAAOhL,GAC1B,IAAIW,EACAgH,EACAuD,EACAhT,EACAnJ,EACAghB,EACAlH,EACAsH,EACArhB,EACA8D,EAMJ,IAJAiW,EAAI7I,EAAQ1Q,OAGZqY,EAAM,GACA7Y,EAAI,EAAGA,EAAI,EAAGA,IACnB6Y,EAAI9T,KAAM,IAKX,IAHAsc,EAAIxI,EAAIrY,OAGFR,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB6Y,EAAKzH,GAAeF,EAASlR,KAAQ+E,KAAMmM,EAASlR,IAIrD,IADAoc,EAAMvD,EAAK,GAAIrY,UACFuZ,EAEZkH,EAAK/P,EAAS,QACR,GAAKkL,IAAQrC,EAAE,GAErB,IAAM/Z,EAAI,EAAGA,EAAIqhB,EAAGrhB,IACnB,GAAK6Y,EAAK7Y,GAAIQ,OAAS,CACtBygB,EAAKpI,EAAK7Y,GAAK,GACf,KACA,MAEI,CAGN,IADA8D,EAAI,EACE9D,EAAI,EAAGA,EAAIqhB,EAAGrhB,KACnBoJ,EAAMyP,EAAK7Y,GAAIQ,SACH4b,IACXA,EAAMhT,EACNtF,EAAI9D,GAINihB,EAAKpI,EAAK/U,GAAK,EACf,CAWD,IATA+N,EAAMuX,GAAQlN,EAAM1b,QC3ErB,SAAmBmI,EAAGghB,GACrB,IAAIC,EAEAnC,EACAoC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAlqB,EAMJ,IAJAynB,EAAK,EACLoC,EAAK,EAGC7pB,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAAM,CAUhC,IARA4pB,GADAI,EAAKrhB,EAAG8e,IACK,GAAOuC,EAAKA,EAEzBC,EAAKN,EAAGE,GAERC,EAAKrC,EAAK,EACVsC,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAKvhB,EAAGmhB,IACK,GAAOI,EAAKA,IACbN,IAGZjhB,EAAGmhB,EAAG,GAAMI,EACZP,EAAGI,EAAG,GAAMJ,EAAGI,GACfD,GAAM,EACNC,GAAM,EAEPphB,EAAGmhB,EAAG,GAAME,EACZL,EAAGI,EAAG,GAAME,EACZxC,GAAM,EACNoC,GAAM,CACN,CACF,CDoCCM,CAAUpD,GAAM9F,GAAMpP,GAGtB5R,EAAM,CAAEqpB,GAAMpN,EAAOrK,IAGf7R,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnBC,EAAI8E,KAAMukB,GAAMpY,EAASlR,GAAK6R,IAE/B,OAAO5R,CACR,CDtEWmqB,CAAWpJ,EAAI,CAAEgH,EAAIyB,EAAIC,IACnC,MAAO,CACN1I,GAAMnI,EAAK,GACXmP,GAAMnP,EAAK,GACX4Q,GAAM5Q,EAAK,GACX6Q,GAAM7Q,EAAK,GAEb,CGxBAzQ,EAAA3I,GAAA,UL8HA,SAAiBQ,EAAK8e,EAAQ3H,GAC7B,IAAIlR,EAAMkV,GAAkBnb,GAC5B,OAAKiG,EAAIqV,iBAEW,eAAdrV,EAAI2K,MACDwY,GAASppB,EAAKuY,GAAgBvY,EAAK,GAAK8e,EAAQ3H,GAErC,cAAdlR,EAAI2K,MACDwY,GAASppB,EAAKsY,GAAetY,EAAK,GAAK8e,EAAQ3H,GAlDzD,SAAoBnX,EAAK8e,EAAQ3H,GAChC,IAAIkE,EACA5U,EACAkB,EACA5H,EAOJ,IALAsb,EAAOrb,EAAIqb,KACX5U,EAAMzG,EAAIub,UAAW,GAErBxb,EAAIoX,EACJxP,EAAI,EACI5H,GAAK,GAAKA,EAAIsb,EAAK9a,QAC1BkG,EAAK4U,EAAMtb,EAAG4H,GACd5H,GAAK+e,EACLnX,GAAK,EAEN,OAAO0T,CACR,CAmCSE,CAAWtV,EAAK6Y,EAAQ3H,GAzIjC,SAAkBnX,EAAK8e,EAAQ3H,GAC9B,IAAIxP,EACA5H,EAIJ,IAFAA,EAAIoX,EACJxP,EAAI,EACI5H,GAAK,GAAKA,EAAIC,EAAIO,QACzBP,EAAKD,GAAM4H,EACX5H,GAAK+e,EACLnX,GAAK,EAEN,OAAO3H,CACR,CA+HQkpB,CAASlpB,EAAK8e,EAAQ3H,EAC9B,IMxKA,IAAIiT,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCY3B,SAASC,GAAiBC,EAAQC,EAAQC,GACzC,OCFD,SAAoB1I,GACnB,IAAI7F,EACAhT,EACAwhB,EACA5qB,EAGJ,IADAoJ,EAAM6Y,EAAOzhB,SACD,EACX,OAAO6pB,GAASE,uBAGjB,GAAa,QADbnO,EAAMtL,GAAiBmR,EAAQ,KAE9B,OAAOoI,GAASE,uBAGjB,IAAMvqB,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,GAAY,QADZ4qB,EAAK9Z,GAAiBmR,EAAQjiB,KAE7B,OAAOqqB,GAASE,uBAEZK,EAAKxO,IACTA,EAAMwO,EAEP,CAED,OADAA,EAAOP,GAASC,oBAAoBlO,EAAM,GAC5B,EAAMwO,EAAK,CAC1B,CDxBQC,CAAW,CAAEJ,EAAQC,EAAQC,GACrC,CESA,SAASG,GAAW5O,EAAOhL,EAASkG,EAAQ0E,EAAOjK,EAAKkZ,GACvD,IAAIzZ,EACAlI,EACAwX,EACAvE,EACArc,EAIJ,IAFAsR,EAAQ4K,EAAM1b,OACd4I,EAAM,EACApJ,EAAI,EAAGA,EAAIsR,EAAOtR,IACvBoJ,GAAO8S,EAAOlc,GAEf,GAAc,UAAT+qB,EACClZ,EAAM,EACVA,EAAM,EACKA,GAAOzI,IAClByI,EAAMzI,EAAM,QAEP,GAAc,SAAT2hB,EACNlZ,EAAM,GACVA,GAAOzI,GACI,GAEG,KADbyI,GAAOzI,KAENyI,GAAOzI,GAGEyI,GAAOzI,IAClByI,GAAOzI,IACKA,IACXyI,GAAOzI,QAOT,GAHc,cAAT2hB,GAAwBlZ,EAAM,IAClCA,GAAOzI,GAEHyI,EAAM,GAAKA,GAAOzI,EACtB,MAAM,IAAIkP,WAAYtT,EAAQ,gHAAiHoE,EAAKyI,IAKtJ,GADA+O,EAAMxJ,EACDyJ,GAAe/E,GAAU,CAC7B,IAAM9b,EAAI,EAAGA,EAAIsR,EAAOtR,IAEvB6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAErB,OAAO4gB,CACP,CAED,IAAM5gB,EAAIsR,EAAM,EAAGtR,GAAK,EAAGA,IAE1B6R,GADAwK,EAAIxK,EAAMqK,EAAOlc,GAEjB6R,GAAOqK,EAAOlc,GACd4gB,GAAOvE,EAAInL,EAASlR,GAErB,OAAO4gB,CACR,CClFA,IAAIoK,GAAO,QCAX,IAAIA,GAAO,QC8CX,IAAIC,GAAS,CCiCb,SAAmBtiB,EAAGghB,EAAGzS,EAAGqC,GAC3BrC,EAAEoE,KAAMpE,EAAEE,QAAWmC,EAAK5Q,EAAE2S,KAAM3S,EAAEyO,QAAUuS,EAAErO,KAAMqO,EAAEvS,QACzD,ECFA,SAAmBzO,EAAGghB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACAC,EACAC,EACAC,EACAC,EACA9D,EACAoC,EACA2B,EACAC,EAqBJ,IAhBAF,EAAK5iB,EAAEuT,MAAO,GACdkP,EAAMziB,EAAEuI,QAAS,GACjBma,EAAM1B,EAAEzY,QAAS,GACjBoa,EAAMpU,EAAEhG,QAAS,GAGjBuW,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHmQ,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,CAER,ECrCA,SAAmB3iB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACA7K,EACAuK,EACAO,EACA9D,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EAyCJ,IApCA/K,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHyQ,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACF,ECxEA,SAAmBljB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAlL,EACAuK,EACAO,EACAK,EACAnE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EAiDJ,IA5CApL,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH8Q,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACF,EC1FA,SAAmBvjB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAvL,EACAuK,EACAO,EACAK,EACAK,EACAxE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EAyDJ,IApDAzL,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHmR,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACF,EC1GA,SAAmB5jB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACA5L,EACAuK,EACAO,EACAK,EACAK,EACAK,EACA7E,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EAiEJ,IA5DA9L,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHwR,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACF,EC9HA,SAAmBjkB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAjM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EAyEJ,IApEAnM,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH6R,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACF,EChJA,SAAmBtkB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAiFJ,IA5EAxM,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHkS,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACF,EClKA,SAAmB3kB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACA3M,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5F,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,GAyFJ,IApFA7M,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHuS,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACF,ECpLA,SAAmBhlB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAhN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAiGJ,IA5FAlN,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH4S,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,GAAMwC,CACN,CACF,ECtMA,SAAoBrlB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACxC,IAAImO,EACAwD,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,EACArN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAyGJ,IApGAvN,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQuE,EAAGvE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQuE,EAAGvE,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,GAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHiT,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,IAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,IAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,IAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,IAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,IAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,IAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,IAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,IAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,IAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,IAAMwC,CACN,CACDvG,GAAM0G,EACNtE,GAAMuE,EACN5C,IAAM6C,CACN,CACF,GX/OIG,GAAkB,CY2BtB,SAAmB7lB,EAAGghB,EAAGzS,EAAGqC,GAC3BrC,EAAEsE,UAAW,GAAKtE,EAAEoE,KAAMpE,EAAEE,OAAQmC,EAAK5Q,EAAE6S,UAAW,GAAK7S,EAAE2S,KAAM3S,EAAEyO,QAAUuS,EAAEnO,UAAW,GAAKmO,EAAErO,KAAMqO,EAAEvS,SAC5G,ECDA,SAAmBzO,EAAGghB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAC,EACAC,EACAC,EACA9D,EACAoC,EACA2B,EACAC,EA0BJ,IArBAF,EAAK5iB,EAAEuT,MAAO,GACdkP,EAAMziB,EAAEuI,QAAS,GACjBma,EAAM1B,EAAEzY,QAAS,GACjBoa,EAAMpU,EAAEhG,QAAS,GAGjBuW,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdiQ,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,CAER,EC7CA,SAAmB3iB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACA7K,EACAuK,EACAO,EACA9D,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EA8CJ,IAzCA/K,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGduQ,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACF,EChFA,SAAmBljB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAlL,EACAuK,EACAO,EACAK,EACAnE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EAsDJ,IAjDApL,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd4Q,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACF,EClGA,SAAmBvjB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAvL,EACAuK,EACAO,EACAK,EACAK,EACAxE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EA8DJ,IAzDAzL,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdiR,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACF,EClHA,SAAmB5jB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACA5L,EACAuK,EACAO,EACAK,EACAK,EACAK,EACA7E,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EAsEJ,IAjEA9L,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdsR,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACF,ECtIA,SAAmBjkB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAjM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EA8EJ,IAzEAnM,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd2R,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACF,ECxJA,SAAmBtkB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAtM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAsFJ,IAjFAxM,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdgS,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACF,EC1KA,SAAmB3kB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACA3M,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5F,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,GACAK,GACAK,GACAK,GA8FJ,IAzFA7M,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdqS,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACF,EC5LA,SAAmBhlB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAhN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAsGJ,IAjGAlN,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,IAGzBjC,EAAK9e,EAAEyO,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd0S,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,GAAMwC,CACN,CACF,EC9MA,SAAoBrlB,EAAGghB,EAAGzS,EAAGwU,EAAYnS,GACxC,IAAImO,EACAwD,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,EACArN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtG,EACAyB,EACAC,GACAjC,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GA8GJ,IAzGAvN,EAAKrY,EAAEuT,MACP8L,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,GAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,GAAI,GACVmC,EAAMnC,GAAI,GAAQ6B,EAAG7B,GAAG,GACxBwC,EAAMxC,GAAI,GAAQoC,EAAGpC,GAAG,GACxB6C,EAAM7C,GAAI,GAAQyC,EAAGzC,GAAG,GACxBkD,EAAMlD,GAAI,GAAQ8C,EAAG9C,GAAG,GACxBuD,EAAMvD,GAAI,GAAQmD,EAAGnD,GAAG,GACxB4D,EAAM5D,GAAI,GAAQwD,EAAGxD,GAAG,GACxBiE,EAAMjE,GAAI,GAAQ6D,EAAG7D,GAAG,GACxBsE,EAAMtE,GAAI,GAAQkE,EAAGlE,GAAG,GACxB2E,EAAM3E,GAAI,GAAQuE,EAAGvE,GAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,GAAI,GACVmC,EAAMnC,GAAI,GAAQ6B,EAAG7B,GAAG,GACxBwC,EAAMxC,GAAI,GAAQoC,EAAGpC,GAAG,GACxB6C,EAAM7C,GAAI,GAAQyC,EAAGzC,GAAG,GACxBkD,EAAMlD,GAAI,GAAQ8C,EAAG9C,GAAG,GACxBuD,EAAMvD,GAAI,GAAQmD,EAAGnD,GAAG,GACxB4D,EAAM5D,GAAI,GAAQwD,EAAGxD,GAAG,GACxBiE,EAAMjE,GAAI,GAAQ6D,EAAG7D,GAAG,GACxBsE,EAAMtE,GAAI,GAAQkE,EAAGlE,GAAG,GACxB2E,EAAM3E,GAAI,GAAQuE,EAAGvE,GAAG,IAGzBjC,GAAK9e,EAAEyO,OACPyS,GAAKF,EAAEvS,OACPoU,GAAKtU,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd+S,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,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CACF,GtBlPIO,GAAiB,CuBYrB,SAA0BjmB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAhO,EACAiO,EACAzd,EACAwW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAsD,EACAC,EACAlO,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH4F,EAAKtO,EAAG,GAAIsO,EAAK,GAWtB,IAVKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtH,EAAG,GACnB+G,EAAMI,EAAOG,EAAG7F,EAAG,GACnBuF,EAAMI,EAAOE,EAAG5F,EAAG,GACb2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBqC,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CAGJ,ECrGA,SAA0BljB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACAzO,EACAiO,EACAzd,EACAC,EACAuW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAtO,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGHgG,EAAK1O,EAAG,GAAI0O,EAAK,GAWtB,IAVKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1H,EAAG,GACnBwH,EAAML,EAAOO,EAAGjG,EAAG,GACnBgG,EAAML,EAAOM,EAAGhG,EAAG,GACb4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB0C,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CAIL,ECpIA,SAA0BvjB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACA7O,EACAiO,EACAzd,EACAC,EACAqe,EACA9H,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA3O,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGHqG,EAAK/O,EAAG,GAAI+O,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/H,EAAG,GACnB4H,EAAMT,EAAOY,EAAGtG,EAAG,GACnBoG,EAAMT,EAAOW,EAAGrG,EAAG,GACbgG,EAAK1O,EAAG,GAAI0O,EAAK,GActB,IAbKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,EAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,EAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,EAAGhG,EAAG,GACd4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB+C,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CAKN,ECjKA,SAA0B5jB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAlP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAnI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAhP,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH0G,GAAKpP,EAAG,GAAIoP,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpI,EAAG,GACnBiI,EAAMd,EAAOiB,GAAG3G,EAAG,GACnByG,EAAMd,EAAOgB,GAAG1G,EAAG,GACbqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,EAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBoD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CAMP,EC9LA,SAA0BjkB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAvP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAxI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACArP,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH+G,GAAKzP,EAAG,GAAIyP,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,EAAOuB,GAAGzI,EAAG,GACnBsI,EAAMnB,EAAOsB,GAAGhH,EAAG,GACnB8G,EAAMnB,EAAOqB,GAAG/G,EAAG,GACb0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,EAAG,GAAOmI,EAAGnI,EAAG,GACtBgF,EAAMvD,EAAG,GAAO0G,EAAG1G,EAAG,GACtBwD,EAAMvD,EAAG,GAAOyG,EAAGzG,EAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,EAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,EAAG,GACpByG,EAAMK,EAAQH,GAAG1G,EAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhByD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CAOR,EC3NA,SAA0BtkB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA5P,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAK,GACA7I,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA1P,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHoH,GAAK9P,EAAG,GAAI8P,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9I,GAAG,GACnB2I,EAAMxB,GAAO2B,GAAGrH,GAAG,GACnBmH,EAAMxB,GAAO0B,GAAGpH,GAAG,GACb+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,EAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,EAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,EAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,EAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,EAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,EAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,EAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,EAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,EAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,EAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,EAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,EAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,EAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,EAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,EAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,EAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,EAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,EAAGvF,GAAG,GAGhB8D,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,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CAQT,ECxPA,SAA0B3kB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAjQ,EACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAlJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/P,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHyH,GAAKnQ,EAAG,GAAImQ,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnJ,GAAG,GACnBgJ,EAAM7B,GAAOgC,GAAG1H,GAAG,GACnBwH,EAAM7B,GAAO+B,GAAGzH,GAAG,GACboH,GAAK9P,EAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,EAAMK,EAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBmE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CASV,ECrRA,SAA0BhlB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAtQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACApQ,GA8BJ,IAxBAJ,IADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGH8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxJ,GAAG,GACnBqJ,EAAMlC,GAAOqC,GAAG/H,GAAG,GACnB6H,GAAMlC,GAAOoC,GAAG9H,GAAG,GACbyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,EAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBwE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CAUX,EClTA,SAA2BrlB,EAAGghB,EAAGzS,EAAGqC,GACnC,IAAIsV,EACAnH,EACAwD,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,GACA3Q,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5J,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAzQ,GA8BJ,IAxBAJ,IADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHmI,GAAK7Q,GAAG,GAAI6Q,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7J,GAAG,GACnB0J,GAAMvC,GAAO0C,GAAGpI,GAAG,GACnBkI,GAAMvC,GAAOyC,GAAGnI,GAAG,GACb8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnG,GAAG,GAAOuJ,GAAGvJ,GAAG,GACtBoG,EAAM3E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB4E,EAAM3E,GAAG,GAAO6H,GAAG7H,GAAG,GACtB0H,EAAMK,EAAQD,GAAGxJ,GAAG,GACpBqJ,GAAMK,GAAQF,GAAG/H,GAAG,GACpB6H,GAAMK,GAAQH,GAAG9H,GAAG,GACdyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,GAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhB6E,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CAWZ,G/BlVIyD,GAA0B,CgCS9B,SAA0BnpB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAhO,EACAiO,EACAzd,EACAwW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAsD,EACAC,EACAlO,EAmCJ,IA7BAJ,GADAI,EAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb8T,EAAKtO,EAAG,GAAIsO,EAAK,GAWtB,IAVKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtH,EAAG,GACnB+G,EAAMI,EAAOG,EAAG7F,EAAG,GACnBuF,EAAMI,EAAOE,EAAG5F,EAAG,GACb2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBqC,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CAGJ,EC7GA,SAA0BljB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACAzO,EACAiO,EACAzd,EACAC,EACAuW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAtO,EAmCJ,IA7BAJ,GADAI,EAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbkU,EAAK1O,EAAG,GAAI0O,EAAK,GAWtB,IAVKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1H,EAAG,GACnBwH,EAAML,EAAOO,EAAGjG,EAAG,GACnBgG,EAAML,EAAOM,EAAGhG,EAAG,GACb4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB0C,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CAIL,EC5IA,SAA0BvjB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA7O,EACAiO,EACAzd,EACAC,EACAqe,EACA9H,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA3O,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbuU,EAAK/O,EAAG,GAAI+O,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/H,EAAG,GACnB4H,EAAMT,EAAOY,EAAGtG,EAAG,GACnBoG,EAAMT,EAAOW,EAAGrG,EAAG,GACbgG,EAAK1O,EAAG,GAAI0O,EAAK,GActB,IAbKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,EAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,EAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,EAAGhG,EAAG,GACd4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB+C,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CAKN,ECzKA,SAA0B5jB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAlP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAnI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,GACAK,GACAK,GACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAhP,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb4U,GAAKpP,EAAG,GAAIoP,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpI,EAAG,GACnBiI,EAAMd,EAAOiB,GAAG3G,EAAG,GACnByG,EAAMd,EAAOgB,GAAG1G,EAAG,GACbqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,EAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBoD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CAMP,ECtMA,SAA0BjkB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAvP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAxI,EACAyB,EACAC,EACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACArP,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbiV,GAAKzP,EAAG,GAAIyP,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,GAAOuB,GAAGzI,EAAG,GACnBsI,EAAMnB,GAAOsB,GAAGhH,EAAG,GACnB8G,EAAMnB,GAAOqB,GAAG/G,EAAG,GACb0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,EAAG,GAAOmI,EAAGnI,EAAG,GACtBgF,EAAMvD,EAAG,GAAO0G,EAAG1G,EAAG,GACtBwD,EAAMvD,EAAG,GAAOyG,EAAGzG,EAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,EAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,EAAG,GACpByG,EAAMK,EAAQH,GAAG1G,EAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhByD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CAOR,ECnOA,SAA0BtkB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA5P,EACAiO,EACAzd,EACAC,EACAqe,GACAK,GACAK,GACAK,GACA7I,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA1P,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbsV,GAAK9P,EAAG,GAAI8P,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9I,GAAG,GACnB2I,EAAMxB,GAAO2B,GAAGrH,GAAG,GACnBmH,EAAMxB,GAAO0B,GAAGpH,GAAG,GACb+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,EAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,EAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,EAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,EAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,EAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,EAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,EAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,EAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,EAAGvF,GAAG,GAGhB8D,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,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CAQT,EChQA,SAA0B3kB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAjQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAlJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/P,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb2V,GAAKnQ,GAAG,GAAImQ,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnJ,GAAG,GACnBgJ,EAAM7B,GAAOgC,GAAG1H,GAAG,GACnBwH,GAAM7B,GAAO+B,GAAGzH,GAAG,GACboH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBmE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CASV,EC7RA,SAA0BhlB,EAAGghB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAtQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACApQ,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbgW,GAAKxQ,GAAG,GAAIwQ,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxJ,GAAG,GACnBqJ,EAAMlC,GAAOqC,GAAG/H,GAAG,GACnB6H,GAAMlC,GAAOoC,GAAG9H,GAAG,GACbyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,EAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBwE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CAUX,EC1TA,SAA2BrlB,EAAGghB,EAAGzS,EAAGqC,GACnC,IAAIsV,EACAnH,EACAwD,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,GACA3Q,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5J,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAzQ,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAWzhB,EAAEuT,MAAOvT,EAAEuI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWliB,EAAEkI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKvmB,EAAEyO,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO9lB,EAAE6S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbqW,GAAK7Q,GAAG,GAAI6Q,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7J,GAAG,GACnB0J,GAAMvC,GAAO0C,GAAGpI,GAAG,GACnBkI,GAAMvC,GAAOyC,GAAGnI,GAAG,GACb8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnG,GAAG,GAAOuJ,GAAGvJ,GAAG,GACtBoG,EAAM3E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB4E,EAAM3E,GAAG,GAAO6H,GAAG7H,GAAG,GACtB0H,EAAMK,EAAQD,GAAGxJ,GAAG,GACpBqJ,GAAMK,GAAQF,GAAG/H,GAAG,GACpB6H,GAAMK,GAAQH,GAAG9H,GAAG,GACdyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,GAAMK,GAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,GAAMK,GAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,GAAMK,GAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,GAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhB6E,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CAWZ,GxCvVI0D,GAAW9G,GAAOzqB,OAAS,EAc/B,SAASwxB,GAAcrpB,EAAGghB,EAAGzS,GAC5B,OAAOgS,GAAc,CAAEvgB,EAAGghB,EAAGzS,GAAK,oBAAoB,EACvD,CA+DA,SAAS1G,GAAQsX,EAAQvO,GACxB,IAAIjI,EACA2gB,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACArpB,EACAmW,EACAyI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACAsD,EACA/pB,EACAghB,EACAzS,EACAyb,EACA3yB,EAYJ,GATA2I,EAAIiqB,GAAgB9K,EAAQ,IAC5B6B,EAAIiJ,GAAgB9K,EAAQ,IAC5B5Q,EAAI0b,GAAgB9K,EAAQ,IAG5BsK,EAAMzpB,EAAEuT,MACRmW,EAAM1I,EAAEzN,MACRoW,EAAMpb,EAAEgF,OACR5K,EAAQ8gB,EAAI5xB,UACG6xB,EAAI7xB,QAAU8Q,IAAUghB,EAAI9xB,OAC1C,MAAM,IAAIgB,MAAOwD,EAAQ,uIAAwIsM,EAAO+gB,EAAI7xB,OAAQ8xB,EAAI9xB,SAGzL,GAAe,IAAV8Q,EACJ,OAAK0gB,GAAcrpB,EAAGghB,EAAGzS,GACjBsX,GAAiBld,GAAS3I,EAAGghB,EAAGzS,EAAGqC,GAEpC0R,GAAQ3Z,GAAS3I,EAAGghB,EAAGzS,EAAGqC,GAKlC,IAFAnQ,EAAM,EACNspB,EAAK,EACC1yB,EAAI,EAAGA,EAAIsR,EAAOtR,IAAM,CAE7B,IADA2yB,EAAIP,EAAKpyB,MACEqyB,EAAKryB,IAAO2yB,IAAML,EAAKtyB,GACjC,MAAM,IAAIwB,MAAO,uDAGlB4H,GAAOupB,EAGI,IAANA,IACJD,GAAM,EAEP,CAED,GAAa,IAARtpB,EAAL,CAIA,GAAe,IAAVkI,EACJ,OAAK0gB,GAAcrpB,EAAGghB,EAAGzS,GACjBsX,GAAiBld,GAAS3I,EAAGghB,EAAGzS,EAAGqC,GAEpC0R,GAAQ3Z,GAAS3I,EAAGghB,EAAGzS,EAAGqC,GAOlC,GALAyO,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGFwhB,IAAOphB,EAAM,EAAI,CAErB,IAAMtR,EAAI,EAAGA,EAAIsR,GACE,IAAb8gB,EAAKpyB,GADaA,KAWxB,OANA2I,EAAEuT,MAAQ,CAAEkW,EAAIpyB,IAChB2pB,EAAEzN,MAAQvT,EAAEuT,MACZhF,EAAEgF,MAAQvT,EAAEuT,MACZvT,EAAEuI,QAAU,CAAE8W,EAAGhoB,IACjB2pB,EAAEzY,QAAU,CAAEuY,EAAGzpB,IACjBkX,EAAEhG,QAAU,CAAEwY,EAAG1pB,IACZgyB,GAAcrpB,EAAGghB,EAAGzS,GACjBsX,GAAiB,GAAK7lB,EAAGghB,EAAGzS,EAAGqC,GAEhC0R,GAAQ,GAAKtiB,EAAGghB,EAAGzS,EAAGqC,EAC7B,CAOD,GANAgZ,EAAMthB,GAAgB+W,GACtBwK,EAAMvhB,GAAgBwY,GACtBgJ,EAAMxhB,GAAgByY,GAGtBnK,EAAMnO,GAAe4W,GACR,IAARuK,GAAqB,IAARC,GAAqB,IAARC,GAAalT,IAAQnO,GAAeqY,IAAQlK,IAAQnO,GAAesY,GAAO,CAOxG,GALAuI,EAAOhW,GAAuBmW,EAAKpK,EAAIrf,EAAEyO,QACzC8a,EAAOjW,GAAuBoW,EAAK5I,EAAIE,EAAEvS,QACzC+a,EAAOlW,GAAuBqW,EAAK5I,EAAIxS,EAAEE,QAIxChO,IAAU6oB,EAAK,GAAGA,EAAK,GAAG,GAC1B7oB,IAAU8oB,EAAK,GAAGA,EAAK,GAAG,GAC1B9oB,IAAU+oB,EAAK,GAAGA,EAAK,GAAG,EA2B1B,OAvBCjD,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAGX9C,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAGX9C,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAEZxpB,EAAEuT,MAAQ,CAAE9S,GACZugB,EAAEzN,MAAQvT,EAAEuT,MACZhF,EAAEgF,MAAQvT,EAAEuT,MACZvT,EAAEuI,QAAU,CAAEqhB,GACd5I,EAAEzY,QAAU,CAAEshB,GACdtb,EAAEhG,QAAU,CAAEuhB,GACd9pB,EAAEyO,OAAS8X,EACXvF,EAAEvS,OAAS+X,EACXjY,EAAEE,OAASgY,EACN4C,GAAcrpB,EAAGghB,EAAGzS,GACjBsX,GAAiB,GAAK7lB,EAAGghB,EAAGzS,EAAGqC,GAEhC0R,GAAQ,GAAKtiB,EAAGghB,EAAGzS,EAAGqC,GAK9B,GAAKjI,GAASygB,GAEb,OAAKC,GAAcrpB,EAAGghB,EAAGzS,GACjBsX,GAAiBld,GAAS3I,EAAGghB,EAAGzS,EAAW,IAARqI,EAAWhG,GAE/C0R,GAAQ3Z,GAAS3I,EAAGghB,EAAGzS,EAAW,IAARqI,EAAWhG,EAG7C,CAID,OAAKjI,GAASygB,GACRC,GAAcrpB,EAAGghB,EAAGzS,GACjB4a,GAAyBxgB,EAAM,GAAK3I,EAAGghB,EAAGzS,EAAGqC,GAE9CqV,GAAgBtd,EAAM,GAAK3I,EAAGghB,EAAGzS,EAAGqC,GAGvCyY,GAAcrpB,EAAGghB,EAAGzS,GFjP1B,SAAmBvO,EAAGghB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACA0H,EACAC,EACAC,EACAtE,EACAC,EACAC,EACAvlB,EACA4X,EACAgH,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EAEA7pB,EAiCJ,IA5BAoJ,EAAM8e,GAHNlH,EAAKrY,EAAEuT,OAMPwL,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT0M,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGPge,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPyb,EAAOlqB,EAAEmT,MACTgX,EAAOnJ,EAAE7N,MACTiX,EAAO7b,EAAE4E,MAGT2S,EAAO9lB,EAAE6S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdxb,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBynB,EAAKqD,GAAW9J,EAAIgH,EAAIkH,EAAI2D,EAAM7yB,EAAGgrB,IACrCnB,EAAKiB,GAAW9J,EAAIyI,EAAI0F,EAAI2D,EAAM9yB,EAAGgrB,IAErC2D,EAAMxD,EADDL,GAAW9J,EAAI0I,EAAI0F,EAAI2D,EAAM/yB,EAAGgrB,IACrBzR,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,IAErD,CEsLSmJ,CAAkBrqB,EAAGghB,EAAGzS,EAAGqC,QD1PpC,SAAmB5Q,EAAGghB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACA0H,EACAC,EACAC,EACA3pB,EACA4X,EACAgH,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EAEA7pB,EA4BJ,IAvBAoJ,EAAM8e,GAHNlH,EAAKrY,EAAEuT,OAMPwL,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT0M,EAAKrf,EAAEuI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGPge,EAAKvmB,EAAEyO,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPyb,EAAOlqB,EAAEmT,MACTgX,EAAOnJ,EAAE7N,MACTiX,EAAO7b,EAAE4E,MAGH9b,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBynB,EAAKqD,GAAW9J,EAAIgH,EAAIkH,EAAI2D,EAAM7yB,EAAGgrB,IACrCnB,EAAKiB,GAAW9J,EAAIyI,EAAI0F,EAAI2D,EAAM9yB,EAAGgrB,IAErCG,EADKL,GAAW9J,EAAI0I,EAAI0F,EAAI2D,EAAM/yB,EAAGgrB,KACxBzR,EAAKmO,EAAMD,GAAMyD,EAAMrB,GAEtC,CCwMCoJ,CAAUtqB,EAAGghB,EAAGzS,EAAGqC,EAxGlB,CAyGF,CyC9UA,SAAS2Z,GAAQrzB,EAAOuJ,GACvB,IAAI4C,EACAhM,EAIJ,IADAgM,EAAM,GACAhM,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBgM,EAAIjH,KAAMlF,GAEX,OAAOmM,CACR,CCVA,SAASlM,GAAOsJ,GACf,OAAO8pB,GAAQ,EAAK9pB,EACrB,CCqDA,SAAS+pB,GAAgBnnB,EAAKkQ,GAC7B,IAAIhL,EACAkiB,EACApS,EACAC,EACAlH,EACAsH,EACAsR,EACA3yB,EACA8D,EAKJ,IAHAiW,EAAImC,EAAM1b,SAEV6gB,GADAL,EAAK4H,GAAU5c,GAAK,IACbxL,QAEN,MAAM,IAAIgB,MAAO,gKAOlB,IAJA0P,EAAUpR,GAAOia,GAGjBkH,EAAK8H,GAAY/c,GAAK,GAChBhM,EAAI+Z,EAAE,EAAG/Z,GAAK,EAAGA,IAEtB,MADA8D,EAAIud,EAAItH,EAAI/Z,GACH,GAAT,CAMA,GAFA2yB,EAAI3R,EAAIld,GAEK,KADbsvB,EAAMlX,EAAOlc,KACKozB,EAAMT,EACvB,MAAM,IAAInxB,MAAOwD,EAAQ,8PAA+P+hB,GAAM/F,GAAKtH,KAAM,MAAQqN,GAAM7K,GAAQxC,KAAM,MAAQ1Z,IAE9U,GAAK2yB,IAAMS,EACVliB,EAASlR,GAAMihB,EAAInd,OACb,IAAW,IAAN6uB,EAKX,MAAM,IAAInxB,MAAOwD,EAAQ,2IAA4I+hB,GAAM/F,GAAKtH,KAAM,MAAQqN,GAAM7K,GAAQxC,KAAM,MAAQ1Z,IAH1NkR,EAASlR,GAAM,CAIf,CAdA,CAgBF,OAAOqf,GAASwJ,GAAU7c,GAAO2c,GAAS3c,GAAO+a,GAAM7K,GAAShL,EAAS8X,GAAWhd,GAAOid,GAAUjd,GACtG,CCnDA,SAASqnB,GAAqBrnB,EAAKkQ,GAClC,IAAI8E,EACAjH,EACA/Z,EAMJ,GAJA+Z,EAAImC,EAAM1b,QACVwgB,EAAK4H,GAAU5c,GAAK,IAGZxL,SAAWuZ,EAAI,CACtB,IAAM/Z,EAAI,EAAGA,EAAI+Z,EAAG/Z,IAEnB,GAAKghB,EAAIhhB,KAAQkc,EAAOlc,GAEvB,OAAOszB,GAAWtnB,EAAKkQ,GAGzB,OAAOlQ,CACP,CAED,OAAOsnB,GAAWtnB,EAAKkQ,EACxB,CC9EA,IAAIkH,GAAa3C,GAAUwB,GAAQ,2BAsDnC,SAASsR,GAAgC3rB,GACxC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CC9DA,IAAI4rB,GAAY9zB,OAAOmB,UAAUkO,cC6CjC,SAAS0kB,GAAO1Z,EAAGpR,EAAG4e,EAASC,EAASmC,EAAG+J,EAASC,GACnD,IAAIjM,EACAwD,EACAxkB,EACAD,EACAghB,EACAoC,EACA7pB,EAYJ,IATA0nB,EAAO/e,EAAE2S,KACT4P,EAAOvB,EAAErO,KAGT7U,EAAMkC,EAAE6S,UAAW,GACnB9U,EAAMijB,EAAEnO,UAAW,GAEnBiM,EAAKD,EACLqC,EAAK8J,EACC3zB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB0G,EAAKwkB,EAAMrB,EAAIpjB,EAAKihB,EAAMD,IAC1BA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CChEA,IAAItI,GAAI,EAsBR,SAASoS,GAAO1Z,EAAGpR,EAAG4e,EAASoC,EAAG+J,GACjC,IAAIjM,EACAoC,EACAqF,EACAC,EACAhO,EACAnhB,EAEJ,GAAK+Z,GAAK,EACT,OAAO4P,EAIR,GAFAuF,EAAK9T,GAAkBzS,GACvBwmB,EAAK/T,GAAkBuO,GAClBuF,EAAG3T,kBAAoB4T,EAAG5T,iBAY9B,OADAC,GAAWzB,EAAGmV,EAAI3H,EATjBE,EADIF,EAAU,GACR,EAAExN,GAAKwN,EAER,EAOyB4H,EAAIuE,EAJlC7J,EADI6J,EAAU,GACR,EAAE3Z,GAAK2Z,EAER,GAGCvE,EAAG7T,KAGX,GAAiB,IAAZiM,GAA6B,IAAZmM,EAAgB,CAIrC,IAHAvS,EAAIpH,EAAIsH,IAGC,EACR,IAAMrhB,EAAI,EAAGA,EAAImhB,EAAGnhB,IACnB2pB,EAAG3pB,GAAM2I,EAAG3I,GAGd,GAAK+Z,EAAIsH,GACR,OAAOsI,EAER,IAAM3pB,EAAImhB,EAAGnhB,EAAI+Z,EAAG/Z,GAAKqhB,GACxBsI,EAAG3pB,GAAM2I,EAAG3I,GACZ2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB2pB,EAAG3pB,EAAE,GAAM2I,EAAG3I,EAAE,GAEjB,OAAO2pB,CACP,CAWD,IATClC,EADIF,EAAU,GACR,EAAExN,GAAKwN,EAER,EAGLsC,EADI6J,EAAU,GACR,EAAE3Z,GAAK2Z,EAER,EAEA1zB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB2pB,EAAGE,GAAOlhB,EAAG8e,GACbA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CC1FA,IAAItI,GAAI,EAwBR,SAASoS,GAAO1Z,EAAGpR,EAAG4e,EAASC,EAASmC,EAAG+J,EAASC,GACnD,IAAIlM,EACAoC,EACAqF,EACAC,EACAhO,EACAnhB,EAEJ,GAAK+Z,GAAK,EACT,OAAO4P,EAIR,GAFAuF,EAAK9T,GAAkBzS,GACvBwmB,EAAK/T,GAAkBuO,GAClBuF,EAAG3T,kBAAoB4T,EAAG5T,iBAE9B,OADAC,GAAWzB,EAAGmV,EAAI3H,EAASC,EAAS2H,EAAIuE,EAASC,GAC1CxE,EAAG7T,KAMX,GAJAmM,EAAKD,EACLqC,EAAK8J,EAGY,IAAZpM,GAA6B,IAAZmM,EAAgB,CAIrC,IAHAvS,EAAIpH,EAAIsH,IAGC,EACR,IAAMrhB,EAAI,EAAGA,EAAImhB,EAAGnhB,IACnB2pB,EAAGE,GAAOlhB,EAAG8e,GACbA,GAAMF,EACNsC,GAAM6J,EAGR,GAAK3Z,EAAIsH,GACR,OAAOsI,EAER,IAAM3pB,EAAImhB,EAAGnhB,EAAI+Z,EAAG/Z,GAAKqhB,GACxBsI,EAAGE,GAAOlhB,EAAG8e,GACbkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBkC,EAAGE,EAAG,GAAMlhB,EAAG8e,EAAG,GAClBA,GAAMpG,GACNwI,GAAMxI,GAEP,OAAOsI,CACP,CACD,IAAM3pB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB2pB,EAAGE,GAAOlhB,EAAG8e,GACbA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CC1DA,SAASxN,GAAKxT,EAAGghB,GAChB,OAAKhhB,EAAIghB,EACDhhB,EAEDghB,CACR,CCDAvhB,EAAA3I,GAAA,UAAA4f,IC9BA,IAAIuU,GAAiB,wCCDjBC,GAAY,SCmChB,SAASC,GAAmC5tB,EAAKC,EAAMwE,EAAQqH,GAC9DrS,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOkE,EACPjE,IAAOsL,GAET,CCfA,SAAS+hB,GAAqB7tB,EAAKC,EAAMwE,GACxChL,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOkE,GAET,CCEA,SAASqpB,GAAsB9tB,EAAKC,EAAMwE,EAAQqH,GACjDrS,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOkE,EACPjE,IAAOsL,GAET,CC1CA,IAAIiiB,GAAoB,CACvBxkB,KAAQ,CACPhJ,IAAO,UACPC,IAAO,WAERkJ,MAAS,CACRnJ,IAAO,WACPC,IAAO,YAERoJ,MAAS,CACRrJ,IAAO,WACPC,IAAO,YAERsJ,MAAS,CACRvJ,IAAO,cACPC,IAAO,eAERgJ,MAAS,CACRjJ,IAAO,WACPC,IAAO,YAERmJ,OAAU,CACTpJ,IAAO,YACPC,IAAO,aAERqJ,OAAU,CACTtJ,IAAO,YACPC,IAAO,aAERuJ,OAAU,CACTxJ,IAAO,eACPC,IAAO,gBAERwJ,QAAW,CACVzJ,IAAO,aACPC,IAAO,cAERyJ,QAAW,CACV1J,IAAO,aACPC,IAAO,cAER0J,QAAW,CACV3J,IAAO,aACPC,IAAO,cAER2J,UAAa,CACZ5J,IAAO,aACPC,IAAO,cAER4J,UAAa,CACZ7J,IAAO,aACPC,IAAO,cAER6J,WAAc,CACb9J,IAAO,aACPC,IAAO,cAERqE,KAAQ,CACPtE,IAAO,WACPC,IAAO,aCpDT,IAAIoW,GAAQ,CACXxM,UAAamG,GACblG,WAAcwF,ICUf,SAAS+G,GAAOjM,GACf,OAAOqjB,GAAOrjB,IAAW,IAC1B,CCfA,IAAI6R,GAAQ,CACXtS,QAAW,aACXD,QAAW,aAERgkB,GAAerX,GAAO4F,GAAkB,SCD5C,IAAI0R,GAAgB,CACnB7jB,WAAc,UACdD,UAAa,UACbD,UAAa,WAcd,SAASgkB,GAAYnuB,EAAKyV,GACzB,OAQA,WACC,IAAIqB,EAAO9G,KAAM0d,IACbxd,EAAK4G,EAAMrB,GAAUzV,EAAIoR,WAAYyF,IACrC1G,EAAK2G,EAAMrB,GAAUzV,EAAIoR,WAAYpR,EAAI8K,WAAW,EAAI+L,IAC5D,ODXF,SAAkB/G,EAAMC,EAAMpF,GAC7B,IAAI7D,EACJ,GAAK9I,UAAU1D,OAAS,EAAI,CAE3B,GADAwM,EAAO8P,GAAO4F,GAAO7R,IAEpB,OAAO,IAAI7D,EAAMgJ,EAAMC,GAExB,MAAM,IAAIlS,UAAWiB,EAAQ,sEAAuE6L,GACpG,CACD,OAAO,IAAIsjB,GAAcne,EAAMC,EAChC,CCCSoT,CAASjT,EAAIC,EAAI+d,GAAeluB,EAAIiH,MAC3C,CACF,CCxBA,IAAI2P,GAAQ,CACX1M,QAAW+B,GACXhC,QAAW+B,GACXtC,MAASwC,GACTtC,MAASuC,GACT5C,KAAQjD,GACRqD,OAAUyC,GACVvC,OAAUwC,GACV7C,MAAS8C,GACT7C,OAAU8C,GACVnC,UAAaoC,GACbnC,WAAcoC,GACd5H,KAAQ6H,ICVT,SAASkK,GAAOjM,GACf,OAAOqjB,GAAOrjB,IAAW,IAC1B,CCEA,SAASsG,GAAaxO,EAAGyO,GACxB,OAAO,IAAI5E,GAAY7J,EAAE0O,OAAQ1O,EAAE2O,WAAY3O,EAAEoI,kBAAkBqG,EAASzO,EAAEnI,OAAO4W,EACtF,CChBA,SAASiT,KACR,MAAO,CAENpI,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAGjB,CCxBA,IAAImO,GDKI,CAENrS,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,UCpBboO,GAAO,CACV,iBAAkBD,GAASrS,OAAOnQ,QAClC,iBAAkBwiB,GAASrS,OAAO4D,QAClC,cAAeyO,GAASrS,OAAOjM,KAC/B,wBAAyBse,GAASrS,OAAOqD,eACzC,6BAA8BgP,GAASrS,OAAOuD,oBAC9C,gCAAiC8O,GAASrS,OAAOyD,uBACjD,iBAAkB4O,GAASrS,OAAOmD,QAClC,wBAAyBkP,GAASrS,OAAO+C,eACzC,0BAA2BsP,GAASrS,OAAOiD,iBAC3C,iBAAkBoP,GAASrS,OAAO6C,QAClC,eAAgBwP,GAASrS,OAAOvH,MAChC,uBAAwB4Z,GAASrS,OAAO8D,cACxC,uBAAwBuO,GAASrS,OAAOgE,cACxC,oBAAqBqO,GAASrS,OAAOkE,YCDtC/d,EAAA3I,GAAA,ODiBA,SAAcsN,GACb,IAAInF,EAAI2sB,GAAMxnB,GACd,YAAe,IAANnF,EAAiB,KAAOA,CAClC,IE5BA,IAAI4sB,GAAgBnK,GAAS5jB,IAAK,kBAC9BiM,GAAiBoK,GAAO,aACxBnK,GAAkBmK,GAAO,cACzBlK,GAAekK,GAAO,QAuF1B,SAASvQ,KACR,IAAI6L,EACAvH,EACA7D,EACA3L,EAUJ,GAAc,QADd2L,EAAO8P,GAJNjM,GAHDuH,EAAQlU,UAAU1D,SACJoK,GAAU1G,UAAWkU,EAAM,IAEhClU,UADRkU,GAAS,GAGDoc,KAIR,MAAM,IAAIzwB,UAAWiB,EAAQ,sEAAuE6L,IAErG,OAAKuH,GAAS,EACN,IAAIpL,EAAM,GAEH,IAAVoL,IACJ/W,EAAM6C,UAAW,cAGGwO,GACnBrR,EAAMkX,GAAelX,EAAK,GACfA,aAAesR,GAC1BtR,EAAMmX,GAAgBnX,EAAK,GAChBA,aAAeuR,KAC1BvR,EAAMozB,GAAoBpzB,EAAK,IAEzB,IAAI2L,EAAM3L,IAEH,IAAV+W,EACG,IAAIpL,EAAM9I,UAAU,GAAIA,UAAU,IAEnC,IAAI8I,EAAM9I,UAAU,GAAIA,UAAU,GAAIA,UAAU,GACxD,CCrHA,SAASyG,GAAQzE,GAChB,GAAKA,EAAI1F,OACR,OAAK0F,EAAIwuB,aCTX,SAAyBxuB,GACxB,OAQA,WACC,IAAIkR,EACA4F,EACA/c,EACAD,EAKJ,IAFAoX,GADA4F,EAAO9G,KAAM0d,KACCtc,WAAapR,EAAIoR,WAC/BrX,EAAM,GACAD,EAAI,EAAGA,EAAIkG,EAAI1F,OAAQR,IAC5BC,EAAI8E,KAAM,IAAImB,EAAIiH,KAAM6P,EAAK3F,OAAQD,EAAQlR,EAAI8K,aACjDoG,GAAUlR,EAAIoR,WAEf,OAAOrX,CACP,CACF,CDdU00B,CAAgBzuB,GET1B,SAAwBA,GACvB,OAQA,WACC,IAAI8W,EAAO9G,KAAM0d,IACjB,OAAOrnB,GAAYyQ,EAAK3F,OAAQ2F,EAAK1F,WAAWpR,EAAIoR,WAAYpR,EAAI1F,OAAQ0F,EAAIiH,KAChF,CACF,CFFSynB,CAAe1uB,GAEvB,OAASA,EAAIiH,MACb,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SAGL,IAAK,QACL,IAAK,SACJ,OG1BF,SAAoBjH,EAAKyV,GACxB,OAQA,WAEC,OADWzF,KAAM0d,IACJjY,GAAUzV,EAAIoR,WAAYyF,GACvC,CACF,CHaS8X,CAAW3uB,EAAK+tB,GAAmB/tB,EAAIiH,MAAO1G,KAEtD,IAAK,OACJ,OI5BF,SAAqBP,EAAKyV,GACzB,OAQA,WACC,IAAIqB,EAAO9G,KAAM0d,IACjB,OAAO/pB,GAASmT,EAAMrB,GAAUzV,EAAIoR,WAAYyF,IAChD,CACF,CJeS+X,CAAY5uB,EAAK+tB,GAAmB/tB,EAAIiH,MAAO1G,KAEvD,IAAK,aACL,IAAK,YACL,IAAK,YACJ,OAAO4tB,GAAYnuB,EAAK+tB,GAAmB/tB,EAAIiH,MAAO1G,KAEvD,QACC,GAAKP,EAAIwuB,aACR,OKxCH,SAAoBxuB,GACnB,OAQA,WACC,IAAI8W,EAAO9G,KAAM0d,IACjB,OAAO,IAAI1tB,EAAIiH,KAAM6P,EAAK3F,OAAQ2F,EAAK1F,WAAWpR,EAAIoR,WAAYpR,EAAI8K,WACtE,CACF,CL2BU+jB,CAAW7uB,GAGnB,MAAM,IAAI1E,MAAOwD,EAAQ,yDAA0DkB,EAAIiH,OAEzF,m6BMrDIyU,GAAY,gBAmBhB,SAASK,KACR,IAAIH,EACA7hB,EACA+G,EACJ,OAA0B,IAArB9C,UAAU1D,OACPya,GAAO8G,IAAIld,SAEnBmC,GAAM,EACN8a,EAAO5d,UAAW,GACb0d,GAAU3Z,KAAM6Z,IAEN,SADdA,EAAO5f,GAAS4f,EAAMF,GAAW,MACD,UAATE,IACtB9a,GAAM,GAIR/G,GADAA,EAAMgb,GAAQ6G,IACE7hB,EAAI4E,QAAU,GACzBmC,GAAO/G,EAAIO,OAAS,GACxBP,EAAI8E,KAAM,WAEJ9E,EACR,CCEA,IAAI+0B,GAA8BvU,GAAUwB,GAAQ,wBCAhDgT,GAA0BxU,GAAUwB,GAAQ,mBC5ChD,SAASiT,GAAUr1B,GAClB,MAA0B,iBAAVA,CACjB,CCMA,SAAS4K,GAAQ5K,GAChB,MACkB,iBAAVA,GACkB,oBAAzB6H,EAAa7H,ICRf,SAAeA,GACd,IACC,MAE4B,iBAApBA,EAAMkJ,SAEd,CAAC,MAAQhD,GACT,OAAO,CACP,CACF,CDAEkC,CAAMpI,EAER,CENA,SAASq1B,GAAUr1B,GAClB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCEA,SAAS2e,GAAM3e,GACd,OAQA,WACC,OAAOA,CACP,CACF,CCpBAuI,EAAA+sB,GAAA,cAAAjtB,IACAE,EAAA+sB,GAAA,WAAAhtB,ICHA,IC4CA+sB,GD5CAA,GAAAE,IAAA,GACAltB,GAAAktB,IAAA,GACAjtB,GAAAitB,IAAA,GAEAhtB,EAAA8sB,GAAA,cAAAhtB,IACAE,EAAA8sB,GAAA,WAAA/sB,ICyCA+sB,GADAG,KACA51B,GAEA61B,gCC9CI5S,goGCFJ,IAAIA,GDwFJ,SAAoB7R,GACnB,OAA0B,IAArB3M,UAAU1D,OA5EhB,WACC,IAAIyhB,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYmmB,KACLl1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAIsU,GAAYF,GAChB3c,EAAM,CAAA,EACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAExB+U,EADA4c,EAAMxT,EAAQne,IACDsd,EAAGqU,GAEjBx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAoDS01B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYmmB,KACLl1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAIsU,GAAYF,GAChB3c,EAAM,GACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAEN,IAAbsd,EADLqU,EAAMxT,EAAQne,KAEb+U,EAAI9T,KAAM0wB,GAGZx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAqBU21B,IAET/kB,EAAQgS,GAAShS,GACZvJ,EAAYob,GAAO7R,GAChB6R,GAAO7R,GAAQhM,QAEhB,KACR,CCrGYgxB,OCERnT,goGCFJ,IAAIA,GDwFJ,SAA0B7R,GACzB,OAA0B,IAArB3M,UAAU1D,OA5EhB,WACC,IAAIyhB,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYumB,KACLt1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAI0U,GAAON,GACX3c,EAAM,CAAA,EACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAExB+U,EADA4c,EAAMxT,EAAQne,IACDsd,EAAGqU,GAEjBx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAoDS01B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYumB,KACLt1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAI0U,GAAON,GACX3c,EAAM,GACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAEN,IAAbsd,EADLqU,EAAMxT,EAAQne,KAEb+U,EAAI9T,KAAM0wB,GAGZx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAqBU21B,IAET/kB,EAAQgS,GAAShS,GACZvJ,EAAYob,GAAO7R,GAChB6R,GAAO7R,GAAQhM,QAEhB,KACR,CCrGYkxB,OCERrT,goGCFJ,IAAIA,GDwFJ,SAAwB7R,GACvB,OAA0B,IAArB3M,UAAU1D,OA5EhB,WACC,IAAIyhB,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYymB,KACLx1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAI4U,GAAiBR,GACrB3c,EAAM,CAAA,EACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAExB+U,EADA4c,EAAMxT,EAAQne,IACDsd,EAAGqU,GAEjBx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAoDS01B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYymB,KACLx1B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAI4U,GAAiBR,GACrB3c,EAAM,GACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAEN,IAAbsd,EADLqU,EAAMxT,EAAQne,KAEb+U,EAAI9T,KAAM0wB,GAGZx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CAqBU21B,IAET/kB,EAAQgS,GAAShS,GACZvJ,EAAYob,GAAO7R,GAChB6R,GAAO7R,GAAQhM,QAEhB,KACR,CCrGYoxB,GCiBZ,SAASC,GAAeC,EAAMtP,EAAIuP,GAKjC,MAAiB,WAAZA,IAGCC,GAAYF,KACZE,GAAYxP,IAOD,SAAZuP,GAAkC,UAAZA,IAIV,SAAZA,ELlBN,SAAqBD,EAAMtP,GAC1B,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CKOSyP,CAAYH,EAAMtP,GAGT,gBAAZuP,EHtBN,SAA2BD,EAAMtP,GAChC,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CGWS0P,CAAkBJ,EAAMtP,GDvBjC,SAAyBsP,EAAMtP,GAC9B,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CCcQ2P,CAAgBL,EAAMtP,IAC9B,CClBA,IAAI4P,GAA6B,qBCL7BC,GAA2B,SCA3BC,IAA4B,SCFhC,SAASC,GAAkB/2B,GAC1B,OAAKA,GAAUA,GAASA,IAAU+I,GAAQ/I,IAAUgJ,GAC5C,UAEHH,GAAW7I,GACVA,GAAS82B,IAA4B92B,GAAS62B,GAC3C,UAED,UAIP72B,GAAS42B,IACT52B,EAAQ42B,GAED,UAGD,SACR,CAmBA,SAASI,GAAah3B,GACrB,OAAMD,EAAUC,GAYXA,GAAUA,GAASA,IAAU+I,GAAQ/I,IAAUgJ,GAC5C,UAEHH,GAAW7I,GACA,IAAVA,IC9DQ,KADU8I,ED+Da9I,IC9DhB,EAAI8I,IAAME,ID+DtB,UAEHhJ,EAAQ,EACPA,GAASyV,GACN,OAEHzV,GAAS0U,GACN,QAEH1U,GAAS+T,GACN,QAED,UAEH/T,GAAS+U,GACN,QAEH/U,GAASoU,GACN,SAEHpU,GAAS6L,GACN,SAED,UAIP7L,GAAS42B,IACT52B,EAAQ42B,GAED,UAGD,UAjDD9sB,GAAW9J,GACR,OAEH8W,GAAe9W,GACmB,YAAjC+2B,GAAkB/2B,EAAMuW,KAAuD,YAAjCwgB,GAAkB/2B,EAAMwW,IACnE,aAED,YAED,UCzDT,IAAyB1N,CDkGzB,CEpHA,IAAIsJ,GAAc,CACjBwE,UAAa,YACbV,WAAc,cCEf,ICEI/V,GDFAib,8BEUWpW,QDTXmW,GAAQ,GAEZ,IAAMhb,GAAI,EAAGA,GAAIib,GAAOza,OAAQR,KAC/Bgb,GAAMjW,KAAM+X,GAAO7B,GAAQjb,MED5B,IAAIkb,GAASD,GAAOza,OAoBpB,SAASqQ,GAAOhR,GACf,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAIkb,GAAQlb,IACxB,GAAKH,aAAiBmb,GAAOhb,GAC5B,OAAOib,GAAQjb,GAIjB,OAAOmb,GAAYrO,GAAiBjN,KAAa,IAClD,CC9BA,SAASi3B,GAAgBj3B,GACxB,OAAO,EAAY,EAAI,CACxB,CCGA,SAASk3B,GAAel3B,GACvB,OAAOmI,EAAQnI,EAChB,uDCiBA,SAASm3B,GAAW9wB,EAAKyV,GACxB,OASA,SAAiB9b,GAChB,IACIwb,EACAzT,EACChI,EAAUC,IAEbwb,EADI2Z,GAA6B9uB,EAAIiH,MAChCjH,EAAIiH,KACGzE,GAAW7I,GAEZo1B,GAAyB/uB,EAAIiH,MC1B5C,SAAmCtN,GAClC,OAAKA,EAAQ,EACPA,GAASyV,GACN,OAEHzV,GAAS0U,GACN,QAEH1U,GAAS+T,GACN,QAED,UAEH/T,GAASwV,GACN,OAEHxV,GAASyU,GACN,QAEHzU,GAAS8T,GACN,QAED,SACR,CDISsjB,CAA0Bp3B,GAE1Bg3B,GAAah3B,GAJbwqB,GAASpI,OAAOjM,KAMtBpO,EAAI/H,GACO8W,GAAe9W,IAC1Bwb,EAAK6b,GAAcr3B,KAA4B,YAAbqG,EAAIiH,KAAuB,YAAc,cAC3EvF,EAAI/H,EAAMuW,IACCzM,GAAW9J,IACtBwb,EAAK,OACLzT,EAAIkvB,GAAgBj3B,IACTq1B,GAAUr1B,IACrBwb,EAAK,QACLzT,EAAImvB,GAAel3B,KAEnBwb,EAAK,UACLzT,EAAI/H,GAEL,IAAMq2B,GAAe7a,EAAInV,EAAIiH,KAAMjH,EAAIixB,aACtC,MAAM,IAAIpzB,UAAWiB,EAAQ,oGAAqGkB,EAAI6G,KAAM7G,EAAIiH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAUzV,EAAIoR,WAAY1P,EAAGmV,GACnC,CACF,CE/DA,SAASqa,GAAgBv3B,GACxB,OAAOgK,GAAShK,EACjB,CCFA,SAASw3B,GAAiBx3B,GACzB,OAAOgK,GAAShK,EAAMuW,IAAMvW,EAAMwW,GACnC,CCeA,SAASihB,GAAYpxB,EAAKyV,GACzB,OASA,SAAiB9b,GAChB,IACIwb,EACAzT,EACC+B,GAAW9J,IACfwb,EAAK,OACLzT,EAAIkvB,GAAgBj3B,IACTD,EAAUC,IACrBwb,EAAKgP,GAASpI,OAAOjM,KACrBpO,EAAIkvB,GAAgBM,GAAgBv3B,KACzBq1B,GAAUr1B,IACrBwb,EAAK,QACLzT,EAAIkvB,GCvCP,SAAyBj3B,GACxB,OAAOgK,GAAShK,EACjB,CDqCuB03B,CAAgB13B,KACzB8W,GAAe9W,IAC1Bwb,EAAK6b,GAAcr3B,IAAWwqB,GAASpI,OAAOoH,QAC9CzhB,EAAIkvB,GAAgBO,GAAiBx3B,MAErCwb,EAAK,UACLzT,EAAIiC,GAAShK,IAEd,IAAMq2B,GAAe7a,EAAInV,EAAIiH,KAAMjH,EAAIixB,aACtC,MAAM,IAAIpzB,UAAWiB,EAAQ,oGAAqGkB,EAAI6G,KAAM7G,EAAIiH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAUzV,EAAIoR,WAAY1P,EAAGmV,GACnC,CACF,CEnCA,SAASya,GAAWtxB,EAAKyV,GACxB,OASA,SAAiB9b,GAChB,IACIwb,EACAzT,EACCstB,GAAUr1B,IACdwb,EAAK,QACLzT,EAAI/H,GACOD,EAAUC,GAChB6I,GAAW7I,IACfwb,EAAKwb,GAAah3B,GAClB+H,EAAI6C,GAAQ5K,KAEZwb,EAAKgP,GAASpI,OAAOjM,KACrBpO,EAAI6C,GAAQhC,GAAO5I,KAET8J,GAAW9J,IACtBwb,EAAK,OACLzT,EC7CH,SAAyB/H,GACxB,OAAO4K,GAAQ,EAAY,EAAI,EAChC,CD2COgtB,CAAgB53B,IACT8W,GAAe9W,IAC1Bwb,EAAK6b,GAAcr3B,IAAWwqB,GAASpI,OAAOoH,QAC9CzhB,EAAI6C,GAAQhC,GAAO5I,EAAMuW,OAEzBiF,EAAK,UACLzT,EAAI6C,GAAQhC,GAAOT,EAAQJ,MAE5B,IAAMsuB,GAAe7a,EAAInV,EAAIiH,KAAMjH,EAAIixB,aACtC,MAAM,IAAIpzB,UAAWiB,EAAQ,oGAAqGkB,EAAI6G,KAAM7G,EAAIiH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAUzV,EAAIoR,WAAY1P,EAAGmV,GACnC,CACF,CEzDA,SAAS2a,GAAkB73B,GAE1B,OACCsI,GAAUtI,IACV0d,GAAY1d,EAAO+zB,IAErB,CCkCA,IAAIL,GAAiC9S,GAAUwB,GAAQ,2BCGnD0V,GAAoBlX,GAAUwB,GAAQ,YCNtC2V,GAAiBnX,GAAUwB,GAAQ,SCZvC,SAAS9K,GAAaxO,EAAGyO,GACxB,GAAKN,GAAmBnO,GACvB,OAAO6P,GAAgB7P,EAAGyO,GAE3B,GAAKP,GAAkBlO,GACtB,OAAO4P,GAAe5P,EAAGyO,GAG1B,MAAM,IAAIrT,UAAWiB,EAAQ,+FAAgG2D,GAC9H,CC1CA,IAAI0Y,GAAI,EAqBR,SAASwW,GAAO9d,EAAG+d,EAAOnvB,EAAG4e,EAASC,GACrC,IAAIC,EACAtG,EACAC,EACAphB,EAEJ,GAAK+Z,GAAK,EACT,OAAOpR,EAGR,IADAyY,EAAIhG,GAAkBzS,IACf4S,iBAEN,OCHF,SAAgBxB,EAAG+d,EAAOnvB,EAAG4e,EAASC,GACrC,IAAIE,EACAhhB,EACA+gB,EACAznB,EASJ,IANA0nB,EAAO/e,EAAE2S,KAGT5U,EAAMiC,EAAE6S,UAAW,GAEnBiM,EAAKD,EACCxnB,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB0G,EAAKghB,EAAMD,EAAIqQ,GACfrQ,GAAMF,CAGR,CDhBE/L,CAAWzB,EAAG+d,EAAO1W,EAAGmG,EAASC,GAC1BpG,EAAE9F,KAKV,GAHAmM,EAAKD,EAGY,IAAZD,EAAgB,CAIpB,IAHApG,EAAIpH,EAAIsH,IAGC,EACR,IAAMrhB,EAAI,EAAGA,EAAImhB,EAAGnhB,IACnB2I,EAAG8e,GAAOqQ,EACVrQ,GAAMF,EAGR,GAAKxN,EAAIsH,GACR,OAAO1Y,EAER,IAAM3I,EAAImhB,EAAGnhB,EAAI+Z,EAAG/Z,GAAKqhB,GACxB1Y,EAAG8e,GAAOqQ,EACVnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZnvB,EAAG8e,EAAG,GAAMqQ,EACZrQ,GAAMpG,GAEP,OAAO1Y,CACP,CACD,IAAM3I,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB2I,EAAG8e,GAAOqQ,EACVrQ,GAAMF,EAEP,OAAO5e,CACR,CEtDA,SAASkvB,GAAO9d,EAAG+d,EAAOnvB,EAAG4e,GAC5B,OAAOlI,GAAStF,EAAG+d,EAAOnvB,EAAG4e,EAASH,GAAerN,EAAGwN,GACzD,CCsGA,SAASnI,GAAQzW,EAAGghB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC3C,IAAIof,EACAC,EAIJ,OAFAD,EAAO3c,GAAkBzS,GACzBqvB,EAAO5c,GAAkBuO,GACpBoO,EAAKxc,kBAAoByc,EAAKzc,kBA1DpC,SAAoB5S,EAAGghB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC9C,IAAIsf,EACAC,EACAzJ,EACA0J,EACAC,EACAp4B,EAQJ,IANAi4B,EAAQtvB,EAAE2S,KACV4c,EAAQvO,EAAErO,KACVmT,EAAO9lB,EAAE6S,UAAW,GACpB2c,EAAOxO,EAAEnO,UAAW,GAEpB4c,EAAKhhB,EACCpX,EAAI,EAAGA,EAAIi4B,EAAMz3B,OAAQR,IAC9Bm4B,EAAMD,EAAOE,EAAI7e,EAAIzX,KAAM6W,EAAS8V,EAAMwJ,EAAOj4B,GAAKA,EAAGi4B,IACzDG,GAAMrZ,CAGR,CAwCEvD,CAAWuc,EAAMC,EAAMjZ,EAAQ3H,EAAQmC,EAAKZ,GACrCgR,GApGT,SAAmBhhB,EAAGghB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC7C,IAAIyf,EACAp4B,EAGJ,IADAo4B,EAAKhhB,EACCpX,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAC1B2pB,EAAGyO,GAAO7e,EAAIzX,KAAM6W,EAAShQ,EAAG3I,GAAKA,EAAG2I,GACxCyvB,GAAMrZ,EAEP,OAAO4K,CACR,CA4FQxC,CAAUxe,EAAGghB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,EAC7C,CCxFA,SAAS0f,GAAK1vB,EAAG4Q,EAAKZ,GACrB,OA3BD,SAAoBzS,EAAKyV,GACxB,MAAkC,mBAAlBzV,EAAKyV,EACtB,CAyBMC,CAAWjT,EAAG,OACXA,EAAE0vB,IAAK9e,EAAKZ,GAEbyG,GAAQzW,EAAG7I,GAAO6I,EAAEnI,QAAU,EAAG,EAAG+Y,EAAKZ,EACjD,CC9CA,SAAS2f,GAAgBz4B,GACxB,OAAOA,EAAMuW,EACd,CCYA,SAASpE,GAAQ9L,GAChB,GAAKA,EAAI1F,OACR,OAAK0F,EAAIwuB,aCLX,SAAyBxuB,GACxB,OAWA,SAAiBuU,GAChB,IAAIrD,EACAmhB,EACAvb,EACAwb,EACA9f,EACAP,EACAyS,EACA5qB,EAEJ,IAAM+L,GAAc0O,GACnB,MAAM,IAAI1W,UAAWiB,EAAQ,sEAAuEkB,EAAI6G,KAAM0N,IAE/G,GAAKA,EAAOja,SAAW0F,EAAI1F,OAC1B,MAAM,IAAI8X,WAAYtT,EAAQ,0EAA2EkB,EAAI6G,KAAM7G,EAAI1F,SAExH,GAAqB,SAAhB0F,EAAIkwB,QACR,IAAMp2B,EAAI,EAAGA,EAAIya,EAAOja,OAAQR,IAC/B,KAAQya,EAAQza,aAAekG,EAAIiH,MAClC,MAAM,IAAIpJ,UAAWiB,EAAQ,2FAA4FkB,EAAI6G,KAAM0N,EAAQza,KAS9I,IAJA4qB,EAAK1kB,EAAI8K,WAAa9K,EAAI1F,OAG1B+3B,EAAQ,GACFv4B,EAAI,EAAGA,EAAIya,EAAOja,OAAQR,IAAM,CAErC,IADAmY,EAAMjC,KAAKrJ,YAAY4V,OAAQhI,EAAQza,KAC9BgR,aAAe4Z,EACvB,MAAM,IAAItS,WAAYtT,EAAQ,mHAAoHkB,EAAI6G,OAEvJ2L,EAAM,IAAIlG,GAAY2F,EAAId,OAAQc,EAAIb,WAAYsT,GAClD2N,EAAMxzB,KAAM2T,EACZ,CAID,IADAtB,GADA4F,EAAO9G,KAAM0d,KACCtc,WAAapR,EAAIoR,WACzBtX,EAAI,EAAGA,EAAIya,EAAOja,OAAQR,IAC/Bw4B,EAAO,IAAIhmB,GAAYwK,EAAK3F,OAAQD,EAAQwT,GAC5C6I,GAAOvtB,EAAI1F,OAAQ+3B,EAAOv4B,GAAK,EAAGw4B,EAAM,GACxCphB,GAAUwT,CAEX,CACF,CDnDU6N,CAAgBvyB,GEO1B,SAAwBA,GACvB,OAWA,SAAiBrG,GAChB,IAAImd,EACA7E,EACAkD,EACJ,IAAMtP,GAAclM,IAAW63B,GAAkB73B,GAChD,MAAM,IAAIkE,UAAWiB,EAAQ,sEAAuEkB,EAAI6G,KAAMlN,IAE/G,GAAKA,EAAMW,SAAW0F,EAAI1F,OACzB,MAAM,IAAI8X,WAAYtT,EAAQ,0EAA2EkB,EAAI6G,KAAM7G,EAAI1F,SAGxH,IAAM01B,GADN7a,EAAKxK,GAAOhR,GACaqG,EAAIiH,KAAMjH,EAAIixB,aACtC,MAAM,IAAIpzB,UAAWiB,EAAQ,oGAAqGkB,EAAI6G,KAAM7G,EAAIiH,KAAMkO,IAIvJ,OADA2B,EAAOzQ,IADP4L,EAAMjC,KAAM0d,KACWvc,OAAQc,EAAIb,WAAWpR,EAAIoR,WAAYpR,EAAI1F,OAAQ0F,EAAIiH,MACzEkO,IAAOnV,EAAIiH,KAEVurB,GAAmBrd,QACvBoY,GAAkB,EAAXvtB,EAAI1F,OAAUm4B,GAAoB94B,EAAO,GAAK,EAAG84B,GAAoB3b,EAAM,GAAK,GAInF2a,GAAmBtc,QACvBoY,GAAOvtB,EAAI1F,OAAQi0B,GAAoB50B,EAAO,GAAK,EAAG40B,GAAoBzX,EAAM,GAAK,QAItFyW,GAAOvtB,EAAI1F,OAAQX,EAAO,EAAGmd,EAAM,GAI/B4a,GAAgBvc,GAEfuc,GAAgB1xB,EAAIiH,WACxBsmB,GAAOvtB,EAAI1F,OAAQX,EAAO,EAAGmd,EAAM,GAI/B0b,GAAmBxyB,EAAIiH,OAC3B6P,EAAO2b,GAAoB3b,EAAM,GAGjCyW,GAAOvtB,EAAI1F,OAAQwc,EAAM,EAAGnd,EAAO,QACnCg4B,GAAMxY,QAASnZ,EAAI1F,OAAQ,EAAKwc,EAAM,EAAG,SAI1Cqb,GAAIjZ,OAAQvf,EAAOmd,EAAM,EAAG,EAAGoa,IAI3BsB,GAAmBrd,GAElBuc,GAAgB1xB,EAAIiH,WACxBkrB,GAAIjZ,OAAQvf,EAAOmd,EAAM,EAAG,EAAGsb,IAI3BI,GAAmBxyB,EAAIiH,WAC3BsmB,GAAkB,EAAXvtB,EAAI1F,OAAUm4B,GAAoB94B,EAAO,GAAK,EAAG84B,GAAoB3b,EAAM,GAAK,QAIxFqb,GAAIjZ,OAAQvf,EAAOmd,EAAM,EAAG,EAAGqa,SAM3BO,GAAgB1xB,EAAIiH,MACxBsmB,GAAOvtB,EAAI1F,OAAQi0B,GAAoB50B,EAAO,GAAK,EAAGmd,EAAM,IAI7DA,EAAO2b,GAAoB3b,EAAM,GAGjCyW,GAAOvtB,EAAI1F,OAAQwc,EAAM,EAAGyX,GAAoB50B,EAAO,GAAK,GAC5Dg4B,GAAMxY,QAASnZ,EAAI1F,OAAQ,EAAKwc,EAAM,EAAG,IACzC,CACF,CFlGS4b,CAAe1yB,GAEvB,OAASA,EAAIiH,MACb,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACJ,OAAO6pB,GAAW9wB,EAAK+tB,GAAmB/tB,EAAIiH,MAAOzG,KAEtD,IAAK,QACL,IAAK,SACJ,OAAO8wB,GAAWtxB,EAAK+tB,GAAmB/tB,EAAIiH,MAAOzG,KAEtD,IAAK,OACJ,OAAO4wB,GAAYpxB,EAAK+tB,GAAmB/tB,EAAIiH,MAAOzG,KAEvD,IAAK,aACL,IAAK,YACL,IAAK,YACJ,OGzBF,SAAqBR,EAAKyV,GACzB,OASA,SAAiB9b,GAChB,IAAImd,EACA3B,EACAjF,EACAC,EAsBJ,GArBKM,GAAe9W,IACnBwb,EAAK6b,GAAcr3B,IAAWqG,EAAIiH,KAClCiJ,EAAKvW,EAAMuW,GACXC,EAAKxW,EAAMwW,IACAzW,EAAUC,IACrBwb,EAAoB,cAAbnV,EAAIiH,KAAyB,UAAY,UAChDiJ,EAAKvW,EACLwW,EAAK,GACM6e,GAAUr1B,IACrBwb,EAAK,QACLjF,EAAK2gB,GAAel3B,GACpBwW,EAAK,GACM1M,GAAW9J,IACtBwb,EAAK,OACLjF,EAAK0gB,GAAgBj3B,GACrBwW,EAAK,IAELgF,EAAK,UACLjF,EAAKvW,EACLwW,EAAK,IAEA6f,GAAe7a,EAAInV,EAAIiH,KAAMjH,EAAIixB,aACtC,MAAM,IAAIpzB,UAAWiB,EAAQ,oGAAqGkB,EAAI6G,KAAM7G,EAAIiH,KAAMkO,KAEvJ2B,EAAO9G,KAAM0d,KACPjY,GAAUzV,EAAIoR,WAAYlB,EAAI2G,IACpCC,EAAMrB,GAAUzV,EAAIoR,WAAYpR,EAAI8K,WAAW,EAAIqF,EAAI0G,GACvD,CACF,CHlBS8b,CAAY3yB,EAAK+tB,GAAmB/tB,EAAIiH,MAAOzG,KAEvD,QACC,GAAKR,EAAIwuB,aACR,OIpCH,SAAoBxuB,GACnB,OAWA,SAAiBrG,GAChB,IAAImd,EACAwb,EACA9f,EACAP,EACAyS,EACJ,IAAM8M,GAAkB73B,GACvB,MAAM,IAAIkE,UAAWiB,EAAQ,qEAAsEkB,EAAI6G,KAAMlN,IAE9G,GAAqB,SAAhBqG,EAAIkwB,WAAyBv2B,aAAiBqG,EAAIiH,MACtD,MAAM,IAAIpJ,UAAWiB,EAAQ,2FAA4FkB,EAAI6G,KAAMlN,IAKpI,GAHA+qB,EAAK1kB,EAAI8K,YAETmH,EAAMjC,KAAKrJ,YAAY4V,OAAQ5iB,IACtBmR,aAAe4Z,EACvB,MAAM,IAAItS,WAAYtT,EAAQ,oFAAqFkB,EAAI6G,OAExH2L,EAAM,IAAIlG,GAAY2F,EAAId,OAAQc,EAAIb,WAAYsT,GAElD5N,EAAO9G,KAAM0d,IACb4E,EAAO,IAAIhmB,GAAYwK,EAAK3F,OAAQ2F,EAAK1F,WAAWpR,EAAIoR,WAAYsT,GAEpE6I,GAAOvtB,EAAI1F,OAAQkY,EAAK,EAAG8f,EAAM,EACjC,CACF,CJDUM,CAAW5yB,GAGnB,MAAM,IAAI1E,MAAOwD,EAAQ,yDAA0DkB,EAAIiH,OAEzF,CK9BA/E,EAAA3I,GAAA,UAAA4f,ICcAjX,EAAA3I,GAAA,SAAA2f,IC3CA,IAAI2Z,GAAmB,CACtB,OACA,OACA,cACA,SACA,aACA,WACA,UACA,eCID,SAASC,GAAa9yB,GACrB,MAAoB,UAAbA,EAAIiH,MAAoBpB,GAAc7F,EAAI+yB,OAClD,CCAA,SAASC,GAAgBr5B,EAAOkN,GAC/B,OAAKpD,GAAW9J,GACR,KAED,IAAIkE,UAAWiB,EAAQ,+DAAgE+H,EAAMlN,GACrG,CCnBA,IAAIob,GAAS,CACZ,OACA,QACA,QACA,QAEA,QACA,SACA,SACA,SAIA,UACA,UAIA,YACA,aAEA,QCrBD,ICcuBR,GCdnB0e,GAAa,CAChB1pB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EAETN,MAAS,EACTG,OAAU,EACVE,OAAU,EACVE,OAAU,EAEVC,QAAW,EACXC,QAAW,EACXC,QAAW,EAEXC,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdxF,KAAQ,GCCLquB,GAAwB,CAC3B,OACA,QAGGC,GAAa,CAChBtsB,KCZD,SAAgClN,EAAOkN,GACtC,OAAKnC,GAAU/K,IAAWA,EAAMW,OAAS,EACjC,KAED,IAAIuD,UAAWiB,EAAQ,wEAAyE+H,EAAMlN,GAC9G,EDQCsN,KEXD,SAAsBtN,GACrB,OAAK4gB,GAAUxF,GAAQpb,IAAWsiB,GAAyBtiB,GACnD,KAED,IAAIkE,UAAWiB,EAAQ,wGAAyG,OAAQ0U,GAAMuB,GAAQ,MAAQpb,GACtK,EFOCqjB,YGdD,SAAwBrjB,EAAOkN,GAC9B,OAAKnC,GAAU/K,GACP,KAED,IAAIkE,UAAWiB,EAAQ,8DAA+D+H,EAAMlN,GACpG,EHUCW,OIfD,SAAiCX,EAAOkN,GACvC,OAAKlC,GAAmBhL,GAChB,KAED,IAAIkE,UAAWiB,EAAQ,wEAAyE+H,EAAMlN,GAC9G,EJWCiH,WAAcoyB,GACdnyB,SAAYmyB,GACZpnB,QAAWsjB,GAAkB,MAC7B+B,aFnBsB1c,GDdH,CACnB,OACA,OACA,cACA,YACA,UCoBA,SAAkB5a,EAAOkN,GACxB,OAAK0T,GAAUhG,GAAQ5a,GACf,KAED,IAAIkE,UAAWiB,EAAQ,gFAAiF+H,EAAM2M,GAAMe,GAAQ,MAAQ5a,GAC3I,IEiBF,SAAS4e,GAAWvY,EAAK4E,GACxB,IAAI7K,EACA8F,EACA6B,EACA2F,EACAvN,EAGJ,IADAC,EK/CO,CACNy0B,cAAgB,EAChBxR,YAAe,GACflS,WAAc,EACdsG,WAAc,EACd8K,UAAa,EACbkX,QAAW,EACXxyB,YAAc,EACdC,UAAY,EACZ+K,aAAW,EACXqlB,YAAe,QLsCVn3B,EAAI,EAAGA,EAAI8K,EAAKtK,OAAQR,IAE7B,GAAKkiB,GAAShc,EADdqH,EAAIzC,EAAM9K,IACe,CAGxB,GAFA4H,EAAI1B,EAAKqH,GACTxH,EAAMszB,GAAY9rB,GAAK3F,EAAG2F,GAEzB,OAAOxH,EAER9F,EAAKsN,GAAM3F,CACX,CAEF,OMrDD,SAAwB1B,EAAK4E,GAC5B,IAAI9K,EACJ,IAAMA,EAAI,EAAGA,EAAI8K,EAAKtK,OAAQR,IAC7B,IAAMkiB,GAAShc,EAAK4E,EAAM9K,IACzB,OAAO,EAGT,OAAO,CACR,CN6COu5B,CAAet5B,EAAKm5B,KAG1Bn5B,EAAIy0B,aAAevS,GAAyBliB,EAAIkN,MAChDlN,EAAI+Q,WO1DL,SAAqB9K,GACpB,IAAI0kB,EASJ,OAPCA,EADI1kB,EAAIwuB,aACHxuB,EAAIiH,KAAK6D,WAETF,GAAiB5K,EAAIiH,MAEtBjH,EAAI1F,SACRoqB,GAAM1kB,EAAI1F,QAEJoqB,CACR,CP+CkB5Z,CAAY/Q,GACxBA,EAAIy0B,aACRz0B,EAAImiB,UAAYniB,EAAIkN,KAAKiV,UAEzBniB,EAAImiB,UAAY+W,GAAYl5B,EAAIkN,MAE1BlN,GATC,IAAI8D,UAAWiB,EAAQ,yFAA0F0U,GAAM0f,GAAuB,MAAQI,KAAKC,UAAWvzB,IAU/K,CQtEA,SAASkc,GAAW6W,GACnB,IAAI7c,EACAxU,EACA5H,EAGJ,IADAoc,EAAM,EACApc,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,KAC/B4H,EAAIqxB,EAAQj5B,GAAIoiB,WACPhG,IACRA,EAAMxU,GAGR,OAAOwU,CACR,CCFA,SAASsd,GAAgBxzB,GACxB,IAAI+yB,EACAU,EACA15B,EACA4Y,EACAzP,EACAgY,EACAphB,EAGJ,GAAuB,KADvBi5B,EAAS/yB,EAAI+yB,QACDz4B,OACX,OAAO,KAGR,IADAP,EAAM,GACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAAM,CAErC,IAAMmI,GADNiZ,EAAI6X,EAAQj5B,IAEX,OAAO,KAER,GAAKg5B,GAAa5X,GACjB,OAAO,IAAIrd,UAAWiB,EAAQ,gFAAiFw0B,KAAKC,UAAWR,KAEhI,QAAc,IAATU,GAAmBzX,GAASd,EAAG,WACnCuY,GAAO,OACD,IAAc,IAATA,GAAiBzX,GAASd,EAAG,WACxC,OAAO,IAAIrd,UAAWiB,EAAQ,8FAA+Fw0B,KAAKC,UAAWR,KAG9I,IADApgB,EAAM+gB,GAAgBxY,EAAG2X,eACLv3B,MACnB,OAAOqX,EAER,GAAW,IAAN7Y,EACJoJ,EAAMyP,EAAI7H,gBACJ,GAAK6H,EAAI7H,aAAe5H,EAC9B,OAAO,IAAIkP,WAAYtT,EAAQ,8FAA+Fw0B,KAAKC,UAAWR,KAE/Ih5B,EAAI8E,KAAM8T,EACV,CACD,MAAO,CACN1L,KAAQ,QACR8rB,OAAUh5B,EACV+Q,WAAc5H,EACdkO,WAAc,EACd8K,UAAayX,GAAkB55B,GAC/Bq5B,QAAW,EAEb,CC8CA,SAASr1B,GAAS0E,EAAGsD,EAAeC,GACnC,OAzFD,SAAoBhG,EAAKyV,GACxB,MAAkC,mBAAlBzV,EAAKyV,EACtB,CAuFMC,CAAWjT,EAAG,WACXA,EAAE1E,QAASgI,EAAeC,IAE7BA,EAAY,IAChBA,GAAavD,EAAEnI,QACE,IAChB0L,EAAY,GCzFbH,GAFwBlM,ED8FH8I,IC3FrB4F,GAAY1O,EAAM4G,MAClB8H,GAAY1O,EAAM6G,KDsCpB,SAAoBiC,EAAGsD,EAAeC,GACrC,IAAIzF,EACAzG,EAGJ,IADAyG,EAAMmhB,GAAejf,GACf3I,EAAIkM,EAAWlM,EAAI2I,EAAEnI,OAAQR,IAClC,GAAKiM,IAAkBxF,EAAKkC,EAAG3I,GAC9B,OAAOA,EAGT,OAAQ,CACT,CA0CSwb,CAAW7S,EAAGsD,EAAeC,GAhFtC,SAAmBvD,EAAGsD,EAAeC,GACpC,IAAIlM,EACJ,IAAMA,EAAIkM,EAAWlM,EAAI2I,EAAEnI,OAAQR,IAClC,GAAKiM,IAAkBtD,EAAG3I,GACzB,OAAOA,EAGT,OAAQ,CACT,CA0EQmnB,CAAUxe,EAAGsD,EAAeC,ICjGpC,IAA0BrM,CDkG1B,CE3GA,SAASi6B,GAAYC,EAAOhtB,GAC3B,IAAI8E,EACJ,OAAsB,IAAjBkoB,EAAMv5B,OACH,IAAIgB,MAAO,wDAEnBqQ,EAAM5N,GAAS81B,EAAOhtB,EAAM,IACjB,EACH,IAAIhJ,UAAWiB,EAAQ,gFAAiF0U,GAAMqgB,EAAO,MAAQhtB,IAE9H8E,CACR,CCTA,SAASmoB,GAAYf,EAAQK,GAC5B,IAAIt5B,EACJ,IAAMA,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAC/Bi5B,EAAQj5B,GAAIs5B,QAAUA,EAEvB,OAAOL,CACR,CCDA,SAASgB,GAAU7iB,GAClB,OAUA,SAAkB5S,EAAO01B,GACxB,OAAOl1B,EAAQ,OAAQoS,EAAO9V,SAAU44B,EAAI,IAC5C,CACF,CA0BA,SAASC,GAAclB,GACtB,IAAIh5B,EACA4Y,EACAzC,EACA2D,EACAqH,EACAphB,EAQJ,IANA+Z,EAAIkf,EAAOz4B,OAGX4V,EA7DO,eA+DPnW,EAAM,GACAD,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnBohB,EAAI6X,EAAQj5B,GAGPA,EAAI,GAAOohB,EAAE9J,aAAe2hB,EAAQj5B,EAAE,GAAIsX,aAI1C8J,EAAEsT,aACNz0B,EAAI8E,KAAM7C,GAASkf,EAAEjU,KAAK4V,OAAQ3M,EAAI6jB,GAAU7Y,EAAE9J,cAInDrX,EAAI8E,KAAMC,EAAQ,eAAgBoc,EAAEjU,KAAMiU,EAAE9J,WAAY8J,EAAEpQ,cAQ3D,MAH6B,OAH7B6H,EAAM7T,EAAQ,MAAO/E,EAAIyZ,KAAM,MAGrBb,EAAIrY,OAAO,KACpBqY,EAAMA,EAAIxU,UAAW,EAAGwU,EAAIrY,OAAO,IAE7BqY,CACR,CCxFA,IAAIuhB,GAAU,CACb,OACA,SACA,UAEGC,GAAW5Z,GAAU2Z,IAiBzB,SAAS34B,GAAU64B,EAAQrB,EAAQ3e,GAClC,IAAInL,EACJ,IAAML,GAAewL,GACpB,MAAM,IAAIvW,UAAWiB,EAAQ,qEAAsEsV,IAKpG,GAHAnL,EAAO,CACNnK,OAAU,QAENsC,EAAYgT,EAAS,YACzBnL,EAAKnK,OAASsV,EAAQtV,QAChBq1B,GAAUlrB,EAAKnK,SACpB,MAAM,IAAIjB,UAAWiB,EAAQ,gFAAiF,SAAU0U,GAAM0gB,GAAS,MAAQ9f,EAAQtV,SAGzJ,MAAqB,WAAhBmK,EAAKnK,OCvBX,SAAuBs1B,EAAQrB,GAC9B,IACIsB,EACAC,EACAC,EACAC,EACAC,EACAC,EACA/hB,EACA5Y,EACA6Y,EACA+hB,EACAC,EACAC,EACAC,EAEAC,EACA5tB,EACA0M,EACAqH,EACAze,EACAmgB,EACA9iB,EACA8D,EACAyJ,EAeJ,IAbAwM,EAAIkf,EAAOz4B,OASX+5B,EAAO,KANED,EAAOtpB,WAGF,GAAIvP,WAAWjB,OAGf,IAGdy6B,EAAK,EACCj7B,EAAI,EAAGA,EAAI+Z,EAAG/Z,KAInBqN,GAHA+T,EAAI6X,EAAQj5B,IAGN+M,KAAKvM,OAAS,GAAM4gB,EAAEpQ,WAAW,GAAIvP,WAAWjB,OAAS,GACtDy6B,IACRA,EAAK5tB,GAgBP,IAZAmtB,EAAO,IAAIS,EAAG,IAGdR,EAAO,QAGPG,EAAM,cAGNC,EAAK,EAEL56B,EAAM,GACAD,EAAI,EAAGA,EAAI+Z,EAAG/Z,IAInB,GAHAohB,EAAI6X,EAAQj5B,KAGPA,EAAI,GAAOohB,EAAE9J,aAAe2hB,EAAQj5B,EAAE,GAAIsX,YAA/C,CASA,IAJCwB,EADI9Y,EAAI+Z,EAAE,GACFqH,EAAE9J,aAAe2hB,EAAQj5B,EAAE,GAAIsX,WAIlCxT,EAAI,EAAGA,EAAIsd,EAAEpQ,WAAYlN,IAAM,CAcpC,GAZAg3B,EAAK91B,EAAQu1B,EAAMM,EAAGp5B,YAGtBs5B,EAAK/1B,EAAQw1B,EAAMx1B,EAAQ,SAAUoc,EAAErU,KAAMjJ,IAI5C42B,EADItZ,EAAEgB,UAAY,EACX,aAEA,GAGHtJ,EAAM,CAIV,IAHA6hB,EAAO,gBACP9hB,EAAM,GACNtL,EAAIvN,EAAI,EACAuN,EAAIwM,GAAKqH,EAAE9J,aAAe2hB,EAAQ1rB,GAAI+J,YAG5CwL,GAFDngB,EAAIs2B,EAAQ1rB,IACLmnB,aACF,WAEA/xB,EAAEwK,KAEP0L,EAAI9T,KAAMC,EAAQ,aAAcrC,EAAEoK,KAAM+V,EAAGhf,EAAEnB,EAAEyf,YAC/C7U,GAAK,EAENotB,EAAO31B,EAAQ21B,EAAM9hB,EAAIa,KAAM,MACnC,MACIihB,EAAO,GAER9hB,EAAM7T,EAAQ01B,EAAKC,EAAM72B,EAAEsd,EAAEgB,WAI5B4Y,EADI5Z,EAAE5gB,OACDwE,EAAQy1B,EAAMz1B,EAAQ,WAAYoc,EAAEjU,KAAM1E,GAAO3E,EAAEsd,EAAEgB,WAAavJ,IAIlE7T,EAAQy1B,EAAMz1B,EAAQ,OAAQoc,EAAEjU,KAAM0L,IAG5C5Y,EAAI8E,KAAMC,EAAQ41B,EAAKE,EAAIC,EAAIC,IAC/BH,GAAM,CACN,CACD,IAAM/2B,EAAI,EAAGA,EAAIsd,EAAEkY,QAASx1B,IAC3Bg3B,EAAK91B,EAAQu1B,EAAMM,EAAGp5B,YACtBs5B,EAAK/1B,EAAQw1B,EAAM,MACnBQ,EAAKh2B,EAAQy1B,EAAM,WACnBx6B,EAAI8E,KAAMC,EAAQ41B,EAAKE,EAAIC,EAAIC,IAC/BH,GAAM,CA1DN,CA6DF,OAAO56B,EAAIyZ,KAAM,KAClB,CDzGSwhB,CAAcZ,EAAQrB,GAET,WAAhB9pB,EAAKnK,OACFm1B,GAAclB,GAGf,UACR,CEpDA,SAASkC,KAET,CCGA,IAAIC,GCOmB,QAAbD,GAAIpuB,KCFd,IAAIiO,GAAQ,CACX7I,GACAD,GACAG,GACAE,GACAH,GACAE,GACA9F,GACAgG,GACAC,0ICVG4oB,GAAevoB,KAA6BpE,GAAgByD,IAAiBmpB,GAajF,SAASA,KAAU,CAVnBD,GAAyC,eHqBzC,SAAuB9hB,GAEtB,IAA2B,IAAtBhL,GAAYgL,GAChB,MAAM,IAAIxV,UAAWiB,EAAQ,0DAA2DuU,IAEzF,OAAK6hB,GACG7hB,EAAIxM,KAELzI,GAAGM,KAAM2U,EAAI9X,YAAc,EACnC,CG9Be85B,CAASF,IAAkCA,GAAaC,GCTvE,IAAItgB,GAAQ,CACXrI,GACAD,4CCOD,SAAS8oB,KACR,MACmB,mBAAXv0B,GACoB,iBAApBA,EAAQ,QACfK,EAAYL,EAAQ,gBACU,iBAAvBA,EAAOw0B,WAEhB,CCIA,IAAIC,GAAsBF,KAAkCv0B,OAAOw0B,YAAc,KCnB7EE,GAAaH,KAiCjB,SAASI,GAAY/7B,EAAOgN,GAE3B,GACwB,mBAAhBA,KAEN8uB,IACuB,iBAAhB9uB,GACqC,mBAArCA,EAAa6uB,KAGrB,MAAM,IAAI33B,UAAWiB,EAAQ,mEAAoE6H,IAElG,OAAShN,aAAiBgN,CAC3B,CCrCA,IAAImO,GAAQ,CACX,CAAE7I,GAAc,gBAChB,CAAED,GAAc,gBAChB,CAAEG,GAAY,cACd,CAAEE,GAAa,eACf,CAAEH,GAAY,cACd,CAAEE,GAAa,eACf,CAAE9F,GAAW,aACb,CAAEgG,GAAY,cACd,CAAEC,GAAmB,qBACrB,CAAEC,GAAgB,kBAClB,CAAEC,GAAiB,mBACnB,CAAEC,GAAc,iBCNjB,SAASipB,GAAU7vB,GAClB,IAAIpE,EACA5H,EAGJ,IAAMA,EAAI,EAAGA,EAAIgb,GAAMxa,OAAQR,IAC9B,GAAK47B,GAAY5vB,EAAKgP,GAAOhb,GAAK,IACjC,OAAOgb,GAAOhb,GAAK,GAIrB,KAAQgM,GAAM,CAEb,IADApE,EAAIsF,GAAUlB,GACRhM,EAAI,EAAGA,EAAIgb,GAAMxa,OAAQR,IAC9B,GAAK4H,IAAMoT,GAAOhb,GAAK,GACtB,OAAOgb,GAAOhb,GAAK,GAGrBgM,EAAM0C,GAAgB1C,EACtB,CACF,CCVA,SAAS8vB,GAAiB9vB,GACzB,IAAIsP,EACArb,EACAD,ECboBH,EDexB,GPKD,SAAuBA,GACtB,IAAI+H,EACA5H,EAEJ,GAAsB,iBAAVH,GAAgC,OAAVA,EACjC,OAAO,EAGR,GAAKA,aAAiBw7B,GACrB,OAAO,EAGR,IAAMr7B,EAAI,EAAGA,EAAIgb,GAAMxa,OAAQR,IAC9B,GAAKH,aAAiBmb,GAAOhb,GAC5B,OAAO,EAIT,KAAQH,GAAQ,CAEf,IADA+H,EAAIsF,GAAUrN,GACRG,EAAI,EAAGA,EAAI+7B,GAAMv7B,OAAQR,IAC9B,GAAK+7B,GAAO/7B,KAAQ4H,EACnB,OAAO,EAGT/H,EAAQ6O,GAAgB7O,EACxB,CAED,OAAO,CACR,COlCMm8B,CAAchwB,GAClBsP,EAAOtP,OACD,GEnBR,SAA8BnM,GAC7B,IAAI+H,EACA5H,EAEJ,GAAsB,iBAAVH,GAAgC,OAAVA,EACjC,OAAO,EAGR,IAAMG,EAAI,EAAGA,EAAIgb,GAAMxa,OAAQR,IAC9B,GAAKH,aAAiBmb,GAAOhb,GAC5B,OAAO,EAIT,KAAQH,GAAQ,CAEf,IADA+H,EAAIsF,GAAUrN,GACRG,EAAI,EAAGA,EAAI+7B,GAAMv7B,OAAQR,IAC9B,GAAK+7B,GAAO/7B,KAAQ4H,EACnB,OAAO,EAGT/H,EAAQ6O,GAAgB7O,EACxB,CAED,OAAO,CACR,CFNao8B,CAAqBjwB,GAE/BsP,EAD8B,IAA1BtP,EAAI+E,kBACDwH,GAAevM,EAAK,GAEpBwM,GAAgBxM,EAAK,OAEvB,OCvBiBnM,EDuBImM,aCrBV4G,IACY,iBAA7B9F,GAAiBjN,IDuBjB,MAAM,IAAIkE,UAAWiB,EAAQ,6DAA8DgH,IAF3FsP,EAAOmZ,GAAoBzoB,EAAK,EAGhC,CAKD,IAJA/L,EAAM,CACLkN,KAAQ0uB,GAAU7vB,GAClBsP,KAAQ,IAEHtb,EAAI,EAAGA,EAAIsb,EAAK9a,OAAQR,IAC7BC,EAAIqb,KAAKvW,KAAMuW,EAAMtb,IAEtB,OAAOC,CACR,CG4BA,SAASygB,GAASuY,GACjB,IAAIiD,EACAC,EACAC,EACAC,EACAC,EACAC,EACA1jB,EACAuI,EACJ,IAAMrV,GAAcktB,GACnB,MAAM,IAAIl1B,UAAWiB,EAAQ,8EAA+Ei0B,IAI7G,GADApgB,EClFD,SAAoBogB,GACnB,IAAIh5B,EACA4Y,EACAuI,EACAphB,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAAM,CAErC,IAAMmI,GADNiZ,EAAI6X,EAAQj5B,IAEX,OAAO,IAAI+D,UAAWiB,EAAQ,0FAA2Foc,EAAGphB,IAG7H,GAAKg5B,GAAa5X,GAAM,CAEvB,GAAa,QADbvI,EAAM6gB,GAAgBtY,IAErB,OAAO,IAAIrd,UAAWiB,EAAQ,uFAAwFw0B,KAAKC,UAAWrY,GAAKphB,IAE5I,GAAK6Y,aAAerX,MACnB,OAAOqX,CAEX,MAEG,IADAA,EAAM+gB,GAAgBxY,EAAG2X,eACLv3B,MACnB,OAAOqX,EAGT5Y,EAAI8E,KAAM8T,EACV,CACD,OAAO5Y,CACR,CDoDOwe,CAAWwa,GACZpgB,aAAerX,MACnB,MAAMqX,EAMP,GADAA,EE7FD,SAAqBogB,GACpB,IAAI/pB,EACAjP,EACAu8B,EAEAx8B,EACA8D,EACAyJ,EAIJ,IAFA2B,EAAO,CAAA,EACPjP,EAAM,GACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAG/B,GADAuN,GADAivB,EAAKvD,EAAQj5B,IACN+M,KACFisB,GAAawD,GACjB,IAAM14B,EAAI,EAAGA,EAAI04B,EAAGvD,OAAOz4B,OAAQsD,IAAM,CAGxC,IAAmB,IAAdoL,EADL3B,EADKivB,EAAGvD,OAAQn1B,GACTiJ,MAEN,OAAO,IAAIhJ,UAAWiB,EAAQ,uGAAwGw0B,KAAKC,UAAWR,KAEvJ/pB,EAAM3B,IAAM,EACZtN,EAAI8E,KAAMwI,EACV,KACK,KAAmB,IAAd2B,EAAM3B,GACjB,OAAO,IAAIxJ,UAAWiB,EAAQ,uGAAwGw0B,KAAKC,UAAWR,KAEtJ/pB,EAAM3B,IAAM,EACZtN,EAAI8E,KAAMwI,EACV,CAEF,OAAOtN,CACR,CF6DOw8B,CAHNF,EAAS1jB,GAIJA,aAAerX,MACnB,MAAMqX,EAiCP,SAASyhB,EAAQj5B,EAAKiW,EAAYtG,GACjC,IAAIyJ,EACArC,EACAskB,EACA1f,EACA9W,EACAkb,EACAxZ,EACA5H,EACA8D,EACAyJ,EAGJ,GADA6K,EAAQlU,UAAU1D,SACV0V,gBAAgBokB,GACvB,OAAe,IAAVliB,EACG,IAAIkiB,EAEG,IAAVliB,EACG,IAAIkiB,EAAQj5B,GAEL,IAAV+W,EACG,IAAIkiB,EAAQj5B,EAAKiW,GAElB,IAAIgjB,EAAQj5B,EAAKiW,EAAYtG,GAErC,GAAK6E,GAAexU,GAAQ,CAC3B,GAAe,IAAV+W,EACJ4E,EAAO,IAAIM,GAAUjc,EAAK,EAAG86B,OACvB,CACN,IAAMnzB,GAAsBsO,GAC3B,MAAM,IAAIvT,UAAWiB,EAAQ,4EAA6EsS,IAE3G,GAAe,IAAVc,EACJ4E,EAAO,IAAIM,GAAUjc,EAAKiW,EAAY6kB,OAChC,CACN,IAAMnzB,GAAsBgI,GAC3B,MAAM,IAAIjN,UAAWiB,EAAQ,4EAA6EgM,IAE3GgM,EAAO,IAAIM,GAAUjc,EAAKiW,EAAY6E,GAAKnL,EAAYmrB,GACvD,CACD,CACD,GAAKnf,EAAKhM,WAAamrB,EACtB,MAAM,IAAI7jB,WAAYtT,EAAQ,mFAAoFm3B,GAEtH,MAEG,GADAnf,EAAO,IAAIM,GAAU,IAAI1H,GAAaumB,IACjC/jB,EAAQ,EAAI,CAChB,IAAMjQ,GAAU9G,GACf,MAAM,IAAI0C,UAAWiB,EAAQ,mEAAoE3D,IAElG6E,EAAM7E,CACN,CAMF,GAHA+G,EAAa8N,KAAM0d,GAAgB5W,QAGtB,IAAR9W,EAAiB,CAMrB,IAJAuU,EAASyY,QAAQ,EAAQqJ,EAAO/7B,QAGhCk8B,EAAQ,CAAA,EACF18B,EAAI,EAAGA,EAAIu8B,EAAO/7B,OAAQR,IAG/B,GAFAuN,EAAI2uB,EAAal8B,GACjB8D,EAAIs4B,EAAYp8B,GACXkiB,GAAShc,EAAKqH,GAAM,CAExB,GAAKmvB,EAAO54B,GACX,MAAM,IAAItC,MAAO,6EAElBiZ,EAAQza,GAAMkG,EAAKqH,GACnBmvB,EAAO54B,IAAM,CACb,CAGF,IAAM9D,EAAI,EAAGA,EAAIu8B,EAAO/7B,OAAQR,IAE1B08B,EADL54B,EAAIs4B,EAAYp8B,UAMG,KADnBohB,EAAImb,EAAQv8B,IACL8R,UACN2I,EAAQza,GAAMohB,EAAEtP,SAIlB,IAAM9R,EAAI,EAAGA,EAAIu8B,EAAO/7B,OAAQR,SAEpB,KADX4H,EAAI6S,EAAQza,KAEXs8B,EAAWJ,EAAal8B,IAAO,GAAI8B,KAAMoU,KAAMtO,EAGjD,CACD,OAAOsO,IACP,CAiQD,OAhYAgmB,EAAcrjB,EAGdwjB,EAAYxC,GAAkB0C,GAG9BA,ElB3ED,SAAsBtD,EAAQ7c,GAC7B,IAAIgG,EACAkX,EACAliB,EACAyB,EACAuI,EACAphB,EACA8D,EAGJ,IADAsT,EAAS,EACHpX,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAAM,CAsBrC,GAdAoX,GADAkiB,IAHAlX,EAAYjG,IAHZiF,EAAI6X,EAAQj5B,IAGOoiB,UAAWhG,IAGPhF,EAAOgL,GAAeA,EAIxCpiB,EAAI,KACR6Y,EAAMogB,EAAQj5B,EAAE,IACZs5B,QAAUA,EACTN,GAAa5X,IACjB4Y,GAAYnhB,EAAIogB,OAAQK,IAI1BlY,EAAE9J,WAAaF,EAGV4hB,GAAa5X,GACjB,IAAMtd,EAAI,EAAGA,EAAIsd,EAAE6X,OAAOz4B,OAAQsD,IACjCsd,EAAE6X,OAAQn1B,GAAIwT,WAAaF,EAI7BA,GAAUgK,EAAEpQ,UACZ,CAYD,OAVAsoB,GAAYlX,EAAahL,EAAOgL,GAAeA,EAG/ChB,EAAEkY,QAAUA,EAGPN,GAAa5X,IACjB4Y,GAAY5Y,EAAE6X,OAAQK,GAGhBL,CACR,CkBuBU0D,CAAaJ,EAAQF,GAG9BE,EG3GD,SAAkBtD,GACjB,IAAIh5B,EACAmhB,EACAphB,EACA8D,EAGJ,IADA7D,EAAM,GACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAE/B,GAAKg5B,GADL5X,EAAI6X,EAAQj5B,IAEX,IAAM8D,EAAI,EAAGA,EAAIsd,EAAE6X,OAAOz4B,OAAQsD,IACjC7D,EAAI8E,KAAMqc,EAAE6X,OAAQn1B,SAGrB7D,EAAI8E,KAAMqc,GAGZ,OAAOnhB,CACR,CHyFU28B,CAASL,GAGlBH,EI/GD,SAAqBnD,GACpB,IAAIh5B,EACA8Z,EAEA/Z,EACA8D,EAMJ,IAJAiW,EAAIkf,EAAOz4B,OAEXP,EAAM,GACN6D,EAAI,EACE9D,EAAI,EAAGA,EAAI+Z,EAAE,EAAG/Z,IACjBi5B,EAAQj5B,GAGLsX,aAAe2hB,EAAQj5B,EAAE,GAAIsX,YAIpCrX,EAAI8E,KAAMjB,GACVA,GAAK,GAJJ7D,EAAI8E,KAAMjB,GASZ,OAFA7D,EAAI8E,KAAMjB,GAEH7D,CACR,CJqFc48B,CAAYN,GAGzBnb,EAAImb,EAAQA,EAAO/7B,OAAO,GAC1B27B,EAAc/a,EAAE9J,WAAa8J,EAAEpQ,WAAaoQ,EAAEkY,QA2H9ClxB,EAAakyB,EAAQ,OAAQzG,IAW7BzrB,EAAakyB,EAAQ,YAAa+B,GAWlCj0B,EAAakyB,EAAQ,aAAc6B,GAWnCzxB,GAAkC4vB,EAAQ,UAAU,WACnD,OAAO4B,EAAYr3B,OACrB,IAWC6F,GAAkC4vB,EAAQ,UAAU,WAEnD,OAAOH,GAAcoC,EACvB,IAcCn0B,EAAakyB,EAAQ,YAAY,SAAmBp0B,GACnD,IAAMwxB,GAAkBxxB,GACvB,MAAM,IAAInC,UAAWiB,EAAQ,6EAA8EkB,IAE5G,OAAOA,EAAK0tB,IAAiBvc,MAC/B,IAeCjP,EAAakyB,EAAQ,gBAAgB,SAAuBvtB,GAC3D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAerQ,MACnB,MAAMqQ,EAEP,OAAO0qB,EAAQ1qB,GAAMb,UACvB,IAeC5I,EAAakyB,EAAQ,gBAAgB,SAAuBvtB,GAC3D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAerQ,MACnB,MAAMqQ,EAEP,OAAO0qB,EAAQ1qB,GAAMyF,UACvB,IAeClP,EAAakyB,EAAQ,iBAAiB,SAAwBvtB,GAC7D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAerQ,MACnB,MAAMqQ,EAEP,OAAO0qB,EAAQ1qB,GAAMqR,WACvB,IAaC9a,EAAakyB,EAAQ,YAAY,SAAmBz6B,GACnD,OACCA,aAAiBy6B,GAEhB5C,GAAkB73B,IAClBsiB,GAAyBtiB,EAAMgN,YAGnC,IAeCzE,EAAakyB,EAAQ,UAAU,SAAiBvtB,GAC/C,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAerQ,MACnB,MAAMqQ,EAEP,OAAO0qB,EAAQ1qB,GAAM1E,IACvB,IAcC/E,EAAakyB,EAAQ,UAAU,SAAiBp0B,GAC/C,IAAIiS,EACJ,IAAMuf,GAAkBxxB,GACvB,MAAM,IAAInC,UAAWiB,EAAQ,6EAA8EkB,IAG5G,OADAiS,EAAMjS,EAAK0tB,IACJ,IAAItW,GAAUnF,EAAId,OAAQc,EAAIb,WAAYa,EAAInH,WACvD,IAGCsrB,EK1aD,SAAmCtuB,EAAGirB,GACrC,IAAIxyB,EACAC,EACAzG,EACAmhB,EACAphB,EAGJ,IADAC,EAAM,CAAA,EACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAE/ByG,EAAMkE,GADNyW,EAAI6X,EAAQj5B,IAEZ0G,EAAMsL,GAAQoP,GACTA,EAAEta,WACDsa,EAAEra,SACNitB,GAAsBhmB,EAAGoT,EAAErU,KAAMtG,EAAKC,GAEtCqtB,GAAqB/lB,EAAGoT,EAAErU,KAAMtG,GAEtB2a,EAAEra,SACb+sB,GAAmC9lB,EAAGoT,EAAErU,KAAMtG,EAAKC,GAEnDgE,GAAkCsD,EAAGoT,EAAErU,KAAMtG,GAE9CxG,EAAKmhB,EAAErU,MAAS,CAAEtG,EAAKC,GAExB,OAAOzG,CACR,CLgZa68B,CAA0BxC,EAAOz5B,UAAW07B,GAiBxDn0B,EAAakyB,EAAOz5B,UAAW,YAAY,WAE1C,KAAQqV,gBAAgBokB,GACvB,MAAM,IAAI94B,MAAO,wDAOlB,OAAOu7B,GAAezC,EAAQiC,EALzBr4B,UAAU1D,OAAS,EAChB0D,UAAW,GAEX,CAAA,EAGV,IAaCkE,EAAakyB,EAAOz5B,UAAW,UAAU,WACxC,KAAQqV,gBAAgBokB,GACvB,MAAM,IAAI94B,MAAO,wDAElB,OM1dF,SAAiBw7B,EAAQ/D,GACxB,IAAIh5B,EACAmhB,EACAxZ,EACA5H,EAGJ,IADAC,EAAM,CAAA,EACAD,EAAI,EAAGA,EAAIi5B,EAAOz4B,OAAQR,IAG1B+L,GADLnE,EAAIo1B,GADJ5b,EAAI6X,EAAQj5B,IACE+M,OAEbnF,EAAIk0B,GAAiBl0B,IACV8vB,GAAkB9vB,IAElB+O,GAAe/O,IAAO2G,GAAY3G,EAAEq1B,WAD/Cr1B,EAAIA,EAAEq1B,UAIPh9B,EAAKmhB,EAAErU,MAASnF,EAEjB,OAAO3H,CACR,CNscSi9B,CAAahnB,KAAMqmB,EAC5B,IAEQjC,CACR,CO5dA,SAASjiB,GAAWiiB,EAAQniB,EAAKnM,GAChC,IACImxB,EACA/lB,EACA2L,EACAqa,EACAjuB,EACA/F,EACA3C,EACAqS,EACA8R,EACAhjB,EACA5H,EAmBJ,IAjBAmP,EAAO,CACNnK,OAAU,UAGXoE,EAAM4C,EAAIxL,OAETiG,EADIuF,EAAIvF,KAAOuF,EAAItF,IACbqS,GAAgB,WAEhBpO,GAAQ,WAEfoY,EAASuX,EAAOvX,OAChB6H,EAAK0P,EAAOtpB,WAIZmsB,EAAS,IAAI3qB,GAAY2F,GACzBf,EAAS,EACHpX,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAC3B4H,EAAInB,EAAKuF,EAAKhM,GACd,IACCo9B,EAAQ9C,EAAO7X,OAAQ7a,GACvBkR,GAAM,CACN,CAAC,MAAQ/S,GACT,IAEC6B,EAAI,IAAI0yB,EAAQ1yB,EAChB,CAAC,MAAQ7B,GACT,OAAO,IACP,CACDq3B,EAAQ9C,EAAO7X,OAAQ7a,GACvBkR,GAAM,CACN,CACD,GAAKA,GAAOlR,EAAEnG,SAAU0N,KAAW4T,EAClC,OAAO,KAGR0Q,GAAO7I,EADE,IAAIpY,GAAY4qB,EAAM/lB,OAAQ+lB,EAAM9lB,WAAY8lB,EAAMpsB,YAC5C,EAAG,EAAGmsB,EAAQ,EAAG/lB,GACpCA,GAAUwT,CACV,CACD,OAAOzS,CACR,CC5CA,IAAIN,GAAsBd,KACtB8c,GAAY,cAoFhB,SAASnT,GAASrf,GACjB,IAAI0P,EACAssB,EACAd,EACAjC,EAIJ,GAAKvuB,GAAc1K,GAClBi5B,EAASgD,GAAej8B,OAClB,KAAK8gB,GAAyB9gB,GAGpC,MAAM,IAAI0C,UAAWiB,EAAQ,sGAAuG3D,IAFpIi5B,EAASj5B,CAGT,CAuBD,SAASk8B,EAAal8B,EAAKiW,EAAY9W,GACtC,IAAI4X,EACAD,EACA/O,EACAyP,EAGJ,GADAT,EAAQlU,UAAU1D,SACV0V,gBAAgBqnB,GACvB,OAAe,IAAVnlB,EACG,IAAImlB,EAEG,IAAVnlB,EACG,IAAImlB,EAAal8B,GAEV,IAAV+W,EACG,IAAImlB,EAAal8B,EAAKiW,GAEvB,IAAIimB,EAAal8B,EAAKiW,EAAY9W,GAI1C,GAAe,IAAV4X,EACJD,EAAM,IAAIvC,GAAa,GACvBxM,EAAM,OAGF,GAAe,IAAVgP,EAET,GAAKpP,GAAsB3H,GAC1B8W,EAAM,IAAIvC,GAAavU,EAAI0P,GAC3B3H,EAAM/H,OAGF,GAAK0K,GAAc1K,IAGvB,GAFA+H,EAAM/H,EAAIb,OAEG,QADb2X,EAAME,GAAWiiB,EAAQ,IAAI1kB,GAAaxM,EAAI2H,GAAqB1P,IAElE,MAAM,IAAI0C,UAAWiB,EAAQ,8KAI1B,GAAK6Q,GAAexU,IAGxB,IAAMqH,GADNU,GADA+O,EAAM9W,GACI2P,WAAaD,GAEtB,MAAM,IAAIuH,WAAYtT,EAAQ,yFAA0F+L,EAAmBoH,EAAInH,iBAI5I,KAAK7I,GAAU9G,GAoBnB,MAAM,IAAI0C,UAAWiB,EAAQ,+HAAgI3D,IAnB7J,IAA6B,IAAxBwW,GACJ,MAAM,IAAI9T,UAAWiB,EAAQ,6JAA8J3D,IAE5L,IAAMkN,GAAYlN,EAAKoX,KACtB,MAAM,IAAI1U,UAAWiB,EAAQ,+HAAgI3D,IAG9J,IAAMkN,IADN4J,EAAM9W,EAAKoX,OACWhB,MACrB,MAAM,IAAI1T,UAAWiB,EAAQ,+HAAgI3D,IAK9J,GAFA+H,GADAyP,EC5MJ,SAAuBrB,GACtB,IAAIvX,EACA2H,EAGJ,IADA3H,EAAM,KAEL2H,EAAI4P,EAAGC,QACAC,MAGPzX,EAAI8E,KAAM6C,EAAE/H,OAEb,OAAOI,CACR,CD+LUsX,CAAcY,IACV3X,OAEG,QADb2X,EAAME,GAAWiiB,EAAQ,IAAI1kB,GAAaxM,EAAI2H,GAAqB8H,IAElE,MAAM,IAAI9U,UAAWiB,EAAQ,kLAM9B,KAGG,CAEJ,IAAM6Q,GADNsC,EAAMjU,UAAW,IAEhB,MAAM,IAAIH,UAAWiB,EAAQ,wEAAyE3D,IAEvG,IAAM2H,GAAsBsO,GAC3B,MAAM,IAAIvT,UAAWiB,EAAQ,gFAAiFsS,IAE/G,IAAM5O,GAAW4O,EAAWvG,GAC3B,MAAM,IAAIuH,WAAYtT,EAAQ,2EAA4E+L,EAAmBuG,IAE9H,GAAKA,GAAca,EAAInH,WACtB,MAAM,IAAIsH,WAAYtT,EAAQ,wFAAyFsS,IAGxH,GAAe,IAAVc,GAEJ,IAAM1P,GADNU,GAAQ+O,EAAInH,WAAasG,GAAevG,GAEvC,MAAM,IAAIuH,WAAYtT,EAAQ,mGAAoG+L,EAAmBoH,EAAInH,WAAWsG,QAIjK,CAEJ,IAAMtO,GADNI,EAAM5I,GAEL,MAAM,IAAIuD,UAAWiB,EAAQ,+EAAgFoE,IAE9G,GAAMA,EAAI2H,EAAsBoH,EAAInH,WAAWsG,EAC9C,MAAM,IAAIgB,WAAYtT,EAAQ,iJAAkJoE,EAAI2H,GAErL,CACD,CAKD,OAJA3I,EAAa8N,KAAM,UAAWiC,GAC9B/P,EAAa8N,KAAM,cAAeoB,GAAc,GAChDlP,EAAa8N,KAAM,cAAe9M,EAAI2H,GACtC3I,EAAa8N,KAAM,UAAW9M,GACvB8M,IACP,CAwQD,OA5YAnF,EAAoBupB,EAAOtpB,WAC3BqsB,EAAS/C,EAAOvX,OAChBwZ,EAASjC,EAAOrB,OA6IhB7wB,EAAam1B,EAAa,oBAAqBxsB,GAW/C3I,EAAam1B,EAAa,OAAQ1J,IAWlCzrB,EAAam1B,EAAa,SAAUjD,GAWpCvG,GAAqBwJ,EAAY18B,UAAW,UAAU,WACrD,OAAOqV,KAAK8B,OACd,IAWC+b,GAAqBwJ,EAAY18B,UAAW,cAAc,WACzD,OAAOqV,KAAKsJ,WACd,IAWCuU,GAAqBwJ,EAAY18B,UAAW,cAAc,WACzD,OAAOqV,KAAKsnB,WACd,IAWCp1B,EAAam1B,EAAY18B,UAAW,oBAAqB08B,EAAYxsB,mBAcrE3I,EAAam1B,EAAY18B,UAAW,OAAO,SAAcgR,GACxD,IAAM4rB,EAAevnB,MACpB,MAAM,IAAInS,UAAWiB,EAAQ,0CAA2C6uB,KAEzE,IAAM7qB,GAAsB6I,GAC3B,MAAM,IAAI9N,UAAWiB,EAAQ,qEAAsE6M,IAEpG,KAAKA,GAAOqE,KAAK6B,SAGjB,OAAO,IAAIuiB,EAAQpkB,KAAK8B,QAAS9B,KAAKsnB,YAAc3rB,EAAId,EAAqBA,EAC/E,IAWCgjB,GAAqBwJ,EAAY18B,UAAW,UAAU,WACrD,OAAOqV,KAAK6B,OACd,IAsCC3P,EAAam1B,EAAY18B,UAAW,OAAO,SAAchB,GACxD,IAEIma,EACA7K,EACA0C,EACAsG,EACAU,EACApS,EACAmkB,EACA7Q,EACAsC,EACA1Z,EACA3C,EACA8D,EACJ,IAAM25B,EAAevnB,MACpB,MAAM,IAAInS,UAAWiB,EAAQ,0CAA2C6uB,KAGzE,GADA1b,EAAMjC,KAAK8B,QACN9T,UAAU1D,OAAS,GAEvB,IAAMwI,GADN6I,EAAM3N,UAAW,IAEhB,MAAM,IAAIH,UAAWiB,EAAQ,+EAAgF6M,SAG9GA,EAAM,EAOP,GALA1C,EAAO,CACNnK,OAAU,UAEX4lB,EAAK0P,EAAOtpB,YAEPjF,GAAclM,IAAY4gB,GAAU8b,EAAQ,UAAjD,CAmCA,GAAK1qB,GAAOqE,KAAK6B,QAChB,MAAM,IAAIO,WAAYtT,EAAQ,kEAAmE6M,IAElG,IAAM1J,GAAUtI,GACf,MAAM,IAAIkE,UAAWiB,EAAQ,0FAA2FnF,IAGzH,GAAKA,EAAM4B,SAAU0N,KAAWkuB,EAM/B,OAJArjB,EAAOsgB,EAAO7X,OAAQ5iB,QAGtB4zB,GAAO7I,EAFE,IAAIpY,GAAYwH,EAAK3C,OAAQ2C,EAAK1C,WAAYsT,GAEpC,EAAG,EADb,IAAIpY,GAAY2F,EAAKjC,KAAKsnB,YAAc3rB,EAAId,EAAqB6Z,GACzC,EAAG,GAOrC,IAHAvO,EAAI,IAAIie,EAAQniB,EAAKjC,KAAKsnB,YAAc3rB,EAAId,EAAqB6Z,GAG3D5qB,EAAI,EAAGA,EAAIu8B,EAAO/7B,OAAQR,IAE1BkiB,GAASriB,EADd8C,EAAI45B,EAAQv8B,MAEXqc,EAAG1Z,GAAM9C,EAAO8C,GAvBjB,KAlCD,CAEC,GAAKkP,GADLkI,EAAIla,EAAMW,QACG0V,KAAK6B,QACjB,MAAM,IAAIO,WAAY,0FAUvB,GANC7R,GAFDuT,EAAOna,GACG4G,KAAOuT,EAAKtT,IACfqS,GAAgB,WAEhBpO,GAAQ,WAGf7G,EAAIoS,KAAKsnB,YAAe3rB,EAAId,EAE3BiJ,EAAK3C,SAAWc,GAEf6B,EAAK1C,WAAaxT,GAClBkW,EAAK1C,WAAW0C,EAAKhJ,WAAalN,EAElC,CAKD,IADA+U,EAAM,GACA7Y,EAAI,EAAGA,EAAI+Z,EAAG/Z,IACnB6Y,EAAI9T,KAAM0B,EAAK5G,EAAOG,IAEvBga,EAAOnB,EACPpS,EAAMkE,GAAQ,UACd,CACD,IAAM3K,EAAI,EAAGA,EAAI+Z,EAAGlI,IAAO7R,IAC1BkW,KAAKxP,IAAKD,EAAKuT,EAAMha,GAAK6R,EAG3B,CA0BH,IAWCzJ,EAAam1B,EAAY18B,UAAW,SAAUy5B,GAEvCiD,EASP,SAASE,EAAe59B,GACvB,MACkB,iBAAVA,GACG,OAAVA,IAECA,EAAMgN,YAAYE,OAAS8mB,InI5f/B,SAAwBh0B,EAAO8O,GAC9B,IAAIxB,SAAcwB,EAClB,GACW,OAAVA,GACU,WAATxB,GAA8B,aAATA,EAEtB,MAAM,IAAIpJ,UAAWiB,EAAQ,uGAAwG2J,IAGtI,OADAxB,SAActN,EAEH,OAAVA,IACU,WAATsN,GAA8B,aAATA,IAIhBqmB,GAAU1xB,KAAM6M,EAAO9O,EAC/B,CmI6eIkP,CAAelP,EAAO09B,EAAY18B,aAEnChB,EAAMkR,oBAAsBA,CAE7B,CACF,o+rBEjiB+B2sB,OC6B/B,IAAAA,GCtBA,WACC,MAAM,IAAIl8B,MAAO,kBAClB,ECcA,SAASm8B,KACR,MAAM,IAAIn8B,MAAO,kBAClB,CAMA,IAAIsb,GAAQ,CACXtM,OAAUktB,GACVttB,QAAW+B,GACXhC,QAAW+B,GACXhC,QAAWytB,GACXltB,QAAWtN,MACXyM,MAASwC,GACTtC,MAASuC,GACT5C,KAAQjD,GACRqD,OAAUyC,GACVvC,OAAUwC,GACV7C,MAAS8C,GACT7C,OAAU8C,GACVpC,UAAastB,GACbrtB,UAAaoC,GACbnC,WAAcoC,GACd5H,KAAQ6H,ICrCLgrB,GAAQ,CAAA,ECmBZ,IAAAC,GCvBWtvB,GAAYmvB,GAAOI,aCiB9B,SAAsBC,GACrB,IAAM/0B,GAAsB+0B,GAC3B,MAAM,IAAIh6B,UAAWiB,EAAQ,qEAAsE+4B,IAEpG,OAAOL,GAAOI,YAAaC,EAC5B,ECLA,SAAsBA,GACrB,IAAM/0B,GAAsB+0B,GAC3B,MAAM,IAAIh6B,UAAWiB,EAAQ,qEAAsE+4B,IAEpG,OAAO,IAAIL,GAAQK,EACpB,ECZA,SAASvtB,GAAQutB,GAChB,OC6GD,SAAep1B,EAAG9I,EAAOqZ,EAAOI,GAC/B,IAAIpT,EACJ,OA3GD,SAAoBA,EAAKyV,GACxB,MAAkC,mBAAlBzV,EA0GG,OAzGpB,CAyGM0V,CAAWjT,GACRA,EAAEq1B,KAAMn+B,EAAOqZ,EAAOI,IAEzBJ,EAAQ,IACZA,GAASvQ,EAAEnI,QACE,IACZ0Y,EAAQ,GAGLI,EAAM,EACVA,GAAO3Q,EAAEnI,OACE8Y,EAAM3Q,EAAEnI,SACnB8Y,EAAM3Q,EAAEnI,SAET0F,EAAMkV,GAAkBzS,IACf4S,iBA9DV,SAAoB5S,EAAG9I,EAAOqZ,EAAOI,GACpC,IAAIgC,EACA5U,EACA1G,EAIJ,IAFAsb,EAAO3S,EAAE2S,KACT5U,EAAMiC,EAAE6S,UAAW,GACbxb,EAAIkZ,EAAOlZ,EAAIsZ,EAAKtZ,IACzB0G,EAAK4U,EAAMtb,EAAGH,GAEf,OAAOyb,CACR,CAoDSE,CAAWtV,EAAKrG,EAAOqZ,EAAOI,GAvGvC,SAAkB3Q,EAAG9I,EAAOqZ,EAAOI,GAClC,IAAItZ,EACJ,IAAMA,EAAIkZ,EAAOlZ,EAAIsZ,EAAKtZ,IACzB2I,EAAG3I,GAAMH,EAEV,OAAO8I,CACR,CAmGQwgB,CAASxgB,EAAG9I,EAAOqZ,EAAOI,GAClC,CDlIQ0kB,CAAMF,GAAaC,GAAQ,EAAG,EAAGA,EACzC,CAUA,SAASxxB,GAAYsE,EAAOktB,GAC3B,IAAI/wB,ELAL,SAAgB6D,GACf,IAAImsB,EACAhwB,EACAgC,EAGJ,OAAMT,GAAYsC,KACjB7B,EAAMqnB,GAAYxlB,GAClB7D,EAAOknB,GAAOllB,IAAS,MAEfhC,EAIJiX,GAAkBpT,IACjB7B,EAEJguB,EAASnsB,EAAMhR,MAIfmP,GADAguB,EAASnsB,GACIkS,QAEd/V,EAAO4wB,GAAO5uB,MAIdhC,EAAOswB,GAAeN,GACtBY,GAAO5uB,GAAQhC,GAHPA,GAMF,IACR,CKhCYixB,CAAaptB,GACxB,OAAK7D,EACG,IAAIA,EAAM+wB,GAEX,IACR,CAgBA,SAAS1mB,GAAQxG,EAAOktB,GACvB,IAAI1iB,EAAKgb,GAAYxlB,GACrB,MAAY,YAAPwK,EACGvb,GAAOi+B,GAEH,WAAP1iB,EACG7K,GAAQutB,GAETxxB,GAAYsE,EAAOktB,EAC3B,CEnBA,SAASG,GAAiBr+B,EAAOgR,EAAOqL,EAAOJ,GAC9C,IAAI3D,EAKJ,GAAa,QADbA,EAAMd,GAAQxG,EAAO,IAEpB,MAAM,IAAI9M,UAAWiB,EAAQ,iFAAkF6L,IAahH,OAVK6nB,GADL7nB,EAAQwlB,GAAYxlB,KACejR,EAAUC,KAC5CA,EAAQ,CAAEA,EAAO,KAEb8R,GAAiBwG,GACfsD,GAAgB5K,GAEhBmB,GAAQnB,IAEVsH,EAAK,EAAGtY,GAEN,IAAIwf,GAASxO,EAAOsH,EAAK+D,EAAOpc,GADnCoc,EAAM1b,QAAU,GAC+B,EAAGsb,EACvD,CCtCA,SAASqiB,GAAgBlc,GACxB,IAAIhiB,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIiiB,EAAOzhB,OAAQR,IAC/BC,EAAI8E,KAAMsxB,GAAYpU,EAAQjiB,KAE/B,OAAOC,CACR,CC1BA,IAAImjB,GAAa3C,GAAUwB,GAAQ,mBAgDnC,SAASmc,GAAyBx2B,GACjC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,wBAgDnC,SAAS+S,GAA6BptB,GACrC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,YAgDnC,SAASoc,GAAmBz2B,GAC3B,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,mBAgDnC,SAASgT,GAAyBrtB,GACjC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,qBAgDnC,SAASqc,GAA2B12B,GACnC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,SAmDnC,SAAS2V,GAAgBhwB,GACxB,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CCrDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,YAgDnC,SAASsc,GAAmB32B,GAC3B,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,YAmDnC,SAAS0V,GAAmB/vB,GAC3B,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CCrDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,kBAgDnC,SAASuc,GAAwB52B,GAChC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,kBAgDnC,SAASwc,GAAwB72B,GAChC,OAAOwb,GAAYxiB,OAAQgH,GAC5B,CClDA,IAAIwb,GAAa3C,GAAUwB,GAAQ,eAgDnC,SAASyc,GAAqB92B,GAC7B,OAAOwb,GAAYxiB,OAAQgH,GAC5B,2iKCWA,SAAS+2B,GAAgBC,EAAQC,GAChC,IAAIzd,EACJ,OAA0B,IAArBld,UAAU1D,OAvDhB,WACC,IAAIyhB,EACAsT,EACAt1B,EACA4Y,EACA2c,EACAC,EACArU,EACAtd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENs1B,GADAtT,EAAS1S,GAAYuvB,KACLt+B,OACVR,EAAI,EAAGA,EAAIu1B,EAAQv1B,IAAM,CAI9B,IAHAw1B,EAAMvT,EAAQjiB,GACdohB,EAAI0d,GAAiBtJ,GACrB3c,EAAM,CAAA,EACA/U,EAAI,EAAGA,EAAIyxB,EAAQzxB,IAExB+U,EADA4c,EAAMxT,EAAQne,IACDsd,EAAGqU,GAEjBx1B,EAAKu1B,GAAQ3c,CACb,CACD,OAAO5Y,CACR,CA+BS01B,IAERiJ,EAAS/b,GAAS+b,GACbt3B,EAAYw3B,GAAiBF,IAG5Bt3B,EAFL8Z,EAAI0d,GAAiBF,GACrBC,EAAShc,GAASgc,IAEVzd,EAAGyd,GAGL,KACR,CC9DA,SAASE,GAAkB9c,GAC1B,IAAI5G,EAEArb,EAGJ,GAAW,IADPiiB,EAAOzhB,OAEV,OAAO,KAGR,IADA6a,EAAK4G,EAAQ,GACPjiB,EAAI,EAAGA,EAAIiiB,EAAOzhB,OAAQR,IAE/B,GAAY,QADZqb,EAAKsjB,GAAgBtjB,EAAI4G,EAAQjiB,OACL,IAARqb,EACnB,OAAO,KAGT,OAAOA,CACR,CC3BA,SAASgP,KACR,MAAO,CAENpI,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAIfrK,MAAS,YAGTsa,QAAW,OAGX4I,WAAc,QAEhB,CCjCA,IAAI1K,GDKI,CAENrS,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAIfrK,MAAS,YAGTsa,QAAW,OAGX4I,WAAc,SC9BZzK,GAAO,CACV,iBAAkBD,GAASrS,OAAOnQ,QAClC,iBAAkBwiB,GAASrS,OAAO4D,QAClC,cAAeyO,GAASrS,OAAOjM,KAC/B,wBAAyBse,GAASrS,OAAOqD,eACzC,6BAA8BgP,GAASrS,OAAOuD,oBAC9C,gCAAiC8O,GAASrS,OAAOyD,uBACjD,iBAAkB4O,GAASrS,OAAOmD,QAClC,wBAAyBkP,GAASrS,OAAO+C,eACzC,0BAA2BsP,GAASrS,OAAOiD,iBAC3C,iBAAkBoP,GAASrS,OAAO6C,QAClC,eAAgBwP,GAASrS,OAAOvH,MAChC,uBAAwB4Z,GAASrS,OAAO8D,cACxC,uBAAwBuO,GAASrS,OAAOgE,cACxC,oBAAqBqO,GAASrS,OAAOkE,WACrCrK,MAASwY,GAASxY,MAClBsa,QAAW9B,GAAS8B,QACpB4I,WAAc1K,GAAS0K,YCJxB52B,EAAA3I,GAAA,ODoBA,SAAcsN,GACb,IAAInF,EAAI2sB,GAAMxnB,GACd,YAAe,IAANnF,EAAiB,KAAOA,CAClC,IElBA,IAAI4sB,GAAgBnK,GAAS5jB,IAAK,kBAC9Bw4B,GAAsB5U,GAAS5jB,IAAK,wBACpCy4B,GAA+B7U,GAAS5jB,IAAK,yBAC7C04B,GAAiC9U,GAAS5jB,IAAK,2BAC/C24B,GAAoC/U,GAAS5jB,IAAK,8BAClD44B,GAAuChV,GAAS5jB,IAAK,iCAGrD64B,GAAgB,CACnBxtB,QAmKD,WAEC,OAAO0iB,EACR,EArKCnO,cA6KD,WAEC,OAAO4Y,EACR,EA/KCta,KAyLD,SAAqB1C,GACpB,IAAI5G,EACArb,EAGJ,IADAqb,EAAK4G,EAAQ,GACPjiB,EAAI,EAAGA,EAAIiiB,EAAOzhB,OAAQR,IAE/B,GAAKiiB,EAAQjiB,KAAQqb,EACpB,MAAM,IAAI7Z,MAAOwD,EAAQ,+JAAgK0U,GAAMuI,EAAQ,QAGzM,OAAO5G,CACR,EApMCuJ,SAAY2a,GACZ1a,aA6ND,SAA6B5C,GAC5B,IAAI5G,EAAKkkB,GAAgBtd,GAGzB,GAAKmc,GAAyB/iB,IAAe,YAAPA,EACrC,OAAOA,EAGR,GAAKijB,GAA2BjjB,GAC/B,OAAO0jB,GAAkB,CAAE1jB,EAAI8jB,KAEhC,GAAKlK,GAAyB5Z,GAC7B,OAAO0jB,GAAkB,CAAE1jB,EAAI6jB,KAGhC,OAAOE,EACR,GAzOII,GAAgB,CAEnBla,eAAkB,CACjB8Y,GACA/T,GAAS5jB,IAAK,0BAEf8e,2BAA8B,CAC7B/G,GAAM4f,IACN/T,GAAS5jB,IAAK,0BAEf+e,oBAAuB,CACtBwP,GACAyK,IAEDha,gCAAmC,CAClCjH,GAAMwW,IACNyK,IAED/Z,uBAA0B,CACzB6N,GACAmM,IAED/Z,mCAAsC,CACrCnH,GAAM+U,IACNmM,IAIDta,QAAW,CACViZ,GACAhU,GAAS5jB,IAAK,mBAEf4e,oBAAuB,CACtB7G,GAAM6f,IACNhU,GAAS5jB,IAAK,mBAEfue,eAAkB,CACjBiQ,GACAiK,IAEDja,2BAA8B,CAC7BzG,GAAMyW,IACNiK,IAEDha,iBAAoB,CACnBoZ,GACAa,IAEDha,6BAAgC,CAC/B3G,GAAM8f,IACNa,IAIDnpB,KAAQ,CACP4hB,GACAvN,GAAS5jB,IAAK,gBAEfmf,iBAAoB,CACnBpH,GAAMoZ,IACNvN,GAAS5jB,IAAK,gBAIfof,QAAW,CACV0Y,GACAlU,GAAS5jB,IAAK,mBAEfqf,oBAAuB,CACtBtH,GAAM+f,IACNlU,GAAS5jB,IAAK,mBAIfqe,QAAW,CACV6S,GACAtN,GAAS5jB,IAAK,mBAEfse,oBAAuB,CACtBvG,GAAMmZ,IACNtN,GAAS5jB,IAAK,mBAIfsf,cAAiB,CAChByY,GACAnU,GAAS5jB,IAAK,yBAEfuf,0BAA6B,CAC5BxH,GAAMggB,IACNnU,GAAS5jB,IAAK,yBAEfwf,cAAiB,CAChBwY,GACApU,GAAS5jB,IAAK,yBAEfyf,0BAA6B,CAC5B1H,GAAMigB,IACNpU,GAAS5jB,IAAK,yBAEf0f,WAAc,CACbuY,GACArU,GAAS5jB,IAAK,sBAEf2f,uBAA0B,CACzB5H,GAAMkgB,IACNrU,GAAS5jB,IAAK,uBAKZk5B,GAAgB,CACnBpvB,WAAc,UACdD,UAAa,UACbD,UAAa,WAIVuvB,GAAgB,CACnBxvB,QAAW,aACXD,QAAW,YACXD,QAAW,aAaZ,SAASsO,GAAMjF,GACd,OASA,SAAkB1Z,GACjB,MAAmB,YAAVA,GAAyB0Z,EAAK1Z,EACvC,CACF,CAsDA,SAAS0/B,GAAgBtd,GACxB,IAAI5G,EAAK0jB,GAAkB9c,GAC3B,GAAY,OAAP5G,EACJ,MAAM,IAAI7Z,MAAOwD,EAAQ,wJAAyJ0U,GAAMuI,EAAQ,QAEjM,OAAO5G,CACR,CAmCA,SAASokB,GAAiC5uB,GACzC,OAAO8uB,GAAe9uB,IAAWuuB,EAClC,CASA,SAASM,GAAoC7uB,GAC5C,OAAO+uB,GAAe/uB,IAAWwuB,EAClC,CCrRA,SAASxc,GAASgd,EAAQC,EAAQC,GACjC,ODsSD,SAAkB9d,EAAQ8d,GACzB,IAAI1kB,EACArN,EAGJ,GAAKoV,GAAY2c,GAChB,OAAOA,EAIR,QAAW,KADX/xB,EAAIsxB,GAAeS,IAElB,OAAO/xB,EAAGiU,GAOX,GAJA5G,EAAKkkB,GAAgBtd,QAIV,KADXjU,EAAIwxB,GAAeO,IAGlB,OAAK/xB,EAAG,GAAKqN,GAELA,EAGHzQ,GAAUoD,EAAG,IACVA,EAAG,GAEJA,EAAG,GAAKqN,GAEhB,MAAM,IAAItX,UAAWiB,EAAQ,uFAAwF+6B,GACtH,CCrUQC,CAAgB,CAAEH,EAAQC,GAAUC,EAC5C,CC6BA,SAAS3c,GAAYxb,GACpB,OACCoa,GAAkBpa,MC1BO/H,ED2BP+H,aCzBDob,IAEC,iBAAVnjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMuiB,YACjB1Z,GAAW7I,EAAMmR,aACjBpG,GAAU/K,EAAMsjB,YAChBvY,GAAU/K,EAAMojB,OAChBva,GAAW7I,EAAMgkB,OACjB3B,GAASriB,EAAO,WDiBjBokB,GAAkBrc,GC5BpB,IAA2B/H,CD8B3B,CEjCA,SAASgR,GAAOlI,GACf,IAAI0S,EAGJ,GAAkB,iBAAN1S,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,GAAKya,GADL/H,EAAK1S,EAAEkI,OAEN,OAAOwK,EAGR,MAAM,IAAItX,UAAWiB,EAAQ,uFAAwFqW,GACtH,CChBA,SAAS/J,GAAO3I,GACf,IAAIqY,EACAjhB,EAGJ,GAAkB,iBAAN4I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,GAAKK,GADLjJ,EAAI4I,EAAE2I,OAEL,OAAOvR,EAGR,IAAMgM,GADNiV,EAAKrY,EAAEuT,OAEN,MAAM,IAAInY,UAAWiB,EAAQ,0DAA2D2D,IAEzF,OAAOqY,EAAGxgB,MACX,CC5BA,IAAI+nB,GAAY,YACZE,GAAe,eAsBnB,SAAS3M,GAAOnT,GACf,IAAIsY,EACAG,EAGJ,GAAkB,iBAANzY,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,OADAyY,EAAIzY,EAAEmT,MACDkL,GAAS5F,GACNA,GAGRH,ECvBD,SAAkBtY,GACjB,IAAI1I,EACAsf,EACAyB,EACAC,EACA0R,EACA3yB,EAGJ,GAAkB,iBAAN2I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,IAAMoD,GADNkV,EAAKtY,EAAEuI,SACoB,CAG1B,IAAMnF,GADNiV,EAAKrY,EAAEuT,OAEN,MAAM,IAAInY,UAAWiB,EAAQ,0DAA2D2D,IAEzF,OAAmB,IAAdqY,EAAGxgB,OACA,CAAE,IAEV+e,EAAM5W,EAAEmT,MACFkL,GAASzH,KACdA,EAAM,aAEA6I,GAAepH,EAAIzB,GAC1B,CAGD,IADAtf,EAAM,GACAD,EAAI,EAAGA,EAAIihB,EAAGzgB,OAAQR,IAAM,CAEjC,IAAM0I,GADNiqB,EAAI1R,EAAIjhB,IAEP,MAAM,IAAI+D,UAAWiB,EAAQ,0DAA2D2D,IAEzF1I,EAAI8E,KAAM4tB,EACV,CACD,OAAO1yB,CACR,CDfMiR,CAASvI,GAEH,KADXyY,EAAIhQ,GAAe6P,KACG,IAANG,EACRmH,GAEG,IAANnH,EACGqH,GAGY,IAAfnX,GAAO3I,GACJ4f,GAGD,KACR,CEbA,IAAAhf,GAAAC,GAAAd,GAAAR,aACAuB,GAAAD,GAAAd,GAAAP,UAKA83B,GAAAz2B,GAAAd,IC/BA,SAASw3B,GAAUrgC,GAClB,IAAIsN,SAActN,EAClB,OACW,OAAVA,GACU,WAATsN,GAA8B,aAATA,EAEf,IAAIpJ,UAAWiB,EAAQ,8GAA+GnF,IAEvI,IACR,CDuBAuI,EAAA63B,GAAA,aAAA12B,IACAnB,EAAA63B,GAAA,UAAAx2B,IEtDe,IAAAxD,GAAAvG,OAAOygC,OCKtB,SAASC,KAET,CCSA,IAAAC,GATwB,mBAAZp6B,GACIA,GDehB,SAAuB0I,GAEtB,OADAyxB,GAAKv/B,UAAY8N,EACV,IAAIyxB,EACZ,EETA,SAASE,GAAYzuB,EAAKuK,GACzB,OAAKvK,EAAM,EACH,EAEHA,EAAMuK,EACHA,EAEDvK,CACR,CCRA,SAAS0uB,GAAW1uB,EAAKuK,GACxB,IAAIokB,EAAMpkB,EAAM,EAChB,OAAKvK,EAAM,IACVA,GAAO2uB,GACI,GAEG,KADb3uB,GAAO2uB,KAEN3uB,GAAO2uB,GAGF3uB,GAEHA,EAAMuK,IACVvK,GAAO2uB,GACIpkB,IACVvK,GAAO2uB,GAED3uB,GAEDA,CACR,CCpBA,SAAS4uB,GAAgB5uB,EAAKuK,GAC7B,OAAKvK,EAAM,GACVA,GAAOuK,EAAM,GACF,GACF,EAEFvK,EAEHA,EAAMuK,GACF,EAEFvK,CACR,CCFA,IAAI6uB,GAAcjgB,GAAUrC,MClBxBsE,GAAQ,CACXlE,KAAQ+hB,GACRhiB,MAAS+hB,GACT7hB,UAoDD,SAAyB5M,EAAKuK,GAC7B,IAAI1B,EAAQ+D,GAAW5M,EAAKuK,GAC5B,GAAK1B,EAAQ,GAAKA,EAAQ0B,EACzB,MAAM,IAAI9D,WAAYtT,EAAQ,yFAA0FoX,EAAKvK,IAE9H,OAAO6I,CACR,EAzDC4D,MAyBD,SAA6BzM,EAAKuK,GACjC,GAAKvK,EAAM,GAAKA,EAAMuK,EACrB,MAAM,IAAI9D,WAAYtT,EAAQ,yFAA0FoX,EAAKvK,IAE9H,OAAOA,CACR,GCcA,SAAS+O,GAAK/O,EAAKuK,EAAK2O,GACvB,IAAIrQ,EACJ,GAAc,UAATqQ,EACJ,OAAOuV,GAAYzuB,EAAKuK,GAEzB,GAAc,SAAT2O,EACJ,OAAOwV,GAAW1uB,EAAKuK,GAMxB,GAJA1B,EAAQ7I,EACM,cAATkZ,IACJrQ,EAAQ+lB,GAAgB/lB,EAAO0B,IAE3B1B,EAAQ,GAAKA,EAAQ0B,EACzB,MAAM,IAAI9D,WAAYtT,EAAQ,yFAA0FoX,EAAKvK,IAE9H,OAAO6I,CACR,CCEAtS,EAAA3I,GAAA,WFuDA,SAAkBsrB,GACjB,IAAM2V,GAAa3V,GAClB,MAAM,IAAIhnB,UAAWiB,EAAQ,iFAAkF+lB,IAEhH,OAAOrI,GAAOqI,EACf,IG7HA,IAAI5pB,GAAOw/B,GAAO9/B,UAAUigB,KCA5B,IAAI3f,GAAOw/B,GAAO9/B,UAAU+/B,KCO5B,SAAS7Z,GAAM/a,EAAK5C,GACnB,IAAInJ,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAMiH,EAAKhM,IAEhB,OAAOC,CACR,CCSA,IAEI4gC,GAAaxW,GAAS5jB,IAAK,cA4C/B,SAAS4Y,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,EAAOxB,GAC/D,IAAIhJ,EACAnC,EACApJ,EACAib,EACAC,EAEJ,KAAO/K,gBAAgBmJ,IACtB,OAAKnb,UAAU1D,OAAS,EAChB,IAAI6e,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GAErD,IAAIuD,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,EAAOxB,GAEnE,IAAM8I,GAAYvS,GACjB,MAAM,IAAI9M,UAAWiB,EAAQ,uFAAwF6L,IAEtH,IAAM9E,GAAcsL,GACnB,MAAM,IAAItT,UAAWiB,EAAQ,8GAA+GqS,IACtI,GAAKA,EAAO5Q,KAAO4Q,EAAO3Q,OAAU6H,GAAY8I,EAAO5Q,OAAU8H,GAAY8I,EAAO3Q,MAC1F,MAAM,IAAI3C,UAAWiB,EAAQ,+FAAgGqS,IAE9H,IAAM3N,GAA2BwS,MAC1BnQ,GAAcmQ,IAAUA,EAAM1b,OAAS,GAC5C,MAAM,IAAIuD,UAAWiB,EAAQ,8GAA+GkX,IAI9I,IADA5K,EAAQ4K,EAAM1b,QAxEA,MA0Eb,MAAM,IAAI8X,WAAYtT,EAAQ,8FA1EjB,MA0E0HsM,IAExI,IAAM2uB,GAAgB/uB,GACrB,MAAM,IAAInN,UAAWiB,EAAQ,mGAAoGkM,IAElI,GAAKI,EAAQ,GACZ,GAAKJ,EAAQ1Q,SAAW8Q,EACvB,MAAM,IAAIgH,WAAYtT,EAAQ,2IAA4IsM,EAAOJ,EAAQ1Q,aAEpL,IAAwB,IAAnB0Q,EAAQ1Q,OACnB,MAAM,IAAI8X,WAAY,yGAChB,GAAsB,IAAjBpH,EAAS,GACpB,MAAM,IAAIoH,WAAYtT,EAAQ,2FAA4FkM,EAAS,IACnI,CACD,IAAMlI,GAAsBoO,GAC3B,MAAM,IAAIrT,UAAWiB,EAAQ,+EAAgFoS,IAE9G,IAAM4P,GAASlL,GACd,MAAM,IAAI/X,UAAWiB,EAAQ,2EAA4E8W,IAE1G,GAAKxK,EAAQ,ICnGd,SAAmClI,EAAK8S,EAAOhL,EAASkG,GAEvD,IAAIe,EAAM2oB,GAAQ5kB,EAAOhL,EAASkG,GAGlC,OAASe,EAAK,IAAO,GAAKA,EAAK,GAAM/O,CACtC,CD6FoB23B,CAA0B1pB,EAAO7W,OAAQ0b,EAAOhL,EAASkG,IAAY8Q,GAAOhM,GAAU,EACxG,MAAM,IAAI1a,MAAO,8NAKlB,IAHA2N,EAAO,CAAA,GACF4b,KAAO8V,GACZ1xB,EAAK6xB,SAhGS,MAiGT98B,UAAU1D,OAAS,IACvBuF,EExGF,SAAmBoJ,EAAMmL,GACxB,IAAIta,EACJ,IAAMmI,GAAUmS,GACf,OAAO,IAAIvW,UAAWiB,EAAQ,qEAAsEsV,IAErG,GAAKhT,EAAYgT,EAAS,UACzBnL,EAAK4b,KAAOzQ,EAAQyQ,MACd2V,GAAavxB,EAAK4b,OACvB,OAAO,IAAIhnB,UAAWiB,EAAQ,uEAAwE,OAAQmK,EAAK4b,OAGrH,GAAKzjB,EAAYgT,EAAS,WAAc,CAEvC,GADAnL,EAAK8xB,QAAU3mB,EAAQ2mB,SACjBvrB,GAAmBvG,EAAK8xB,SAC7B,OAAO,IAAIl9B,UAAWiB,EAAQ,0FAA2F,UAAWmK,EAAK8xB,UAE1I,GAA6B,IAAxB9xB,EAAK8xB,QAAQzgC,OACjB,OAAO,IAAIuD,UAAWiB,EAAQ,0FAA2F,UAAWmK,EAAK8xB,QAAQvnB,KAAM,OAExJ,IAAM1Z,EAAI,EAAGA,EAAImP,EAAK8xB,QAAQzgC,OAAQR,IACrC,IAAM0gC,GAAavxB,EAAK8xB,QAASjhC,IAChC,OAAO,IAAI+D,UAAWiB,EAAQ,wEAAyEmK,EAAK8xB,QAASjhC,KAGvHmP,EAAK8xB,QAAU9xB,EAAK8xB,QAAQp8B,OAC5B,CACD,OAAKyC,EAAYgT,EAAS,cACzBnL,EAAK6xB,SAAW1mB,EAAQ0mB,UAClBr3B,GAAWwF,EAAK6xB,WACd,IAAIj9B,UAAWiB,EAAQ,+DAAgE,WAAYmK,EAAK6xB,WAG1G,IACR,CFuEQd,CAAU/wB,EAAMmL,GACjBvU,GACJ,MAAMA,EAiBR,OAdAmQ,KAAKoL,MAAQnS,EAAK4b,UACI,IAAjB5b,EAAK8xB,UACT9xB,EAAK8xB,QAAU,CAAE/qB,KAAKoL,QAEvBpL,KAAKqL,SAAWpS,EAAK8xB,QAGrBjgB,EAAK+F,GAAM7K,EAAO5K,GAClB2P,EAAK8F,GAAM7V,EAASI,GAAS,GAG7BqvB,GAAO7+B,KAAMoU,KAAMrF,EAAOwG,EAAQ2J,EAAIC,EAAI7J,EAAQ0E,GAClD5F,KAAKiK,OAAOG,SAAWnR,EAAK6xB,SAErB9qB,IAGR,CGnJA,SAASgrB,KACR,IAGIlhC,EAHA8a,EAAI5W,UAEJi9B,EAAI,uBADArmB,EAAG,GACsB,IAEjC,IAAM9a,EAAI,EAAGA,EAAI8a,EAAEta,OAAQR,IAC1BmhC,GAAK,UAAYC,mBAAoBtmB,EAAG9a,IAEzC,OAAOmhC,CACR,ECqBA,SAAkBn0B,EAAMq0B,GACvB,IAAIt7B,EAAMm6B,GAAUlzB,GACpB,GAAKjH,EACJ,MAAMA,EAGP,GADAA,EAAMm6B,GAAUmB,GAEf,MAAMt7B,EAEP,QAAoC,IAAxBs7B,EAAUxgC,UACrB,MAAM,IAAIkD,UAAWiB,EAAQ,8GAA+Gq8B,EAAUxgC,YAGvJmM,EAAKnM,UAAYygC,GAAcD,EAAUxgC,WAGzClB,EAAgBqN,EAAKnM,UAAW,cAAe,CAC9CgG,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASmN,GAIX,CJgGAu0B,CAASliB,GAASshB,IAclBv4B,EAAaiX,GAAS,OAAQ,WA0BnBzY,EAAEyY,GAAQxe,UAAW,OKlLhC,WACC,IAAIgR,EACA+O,EACAS,EACArhB,EAEJ,GAAKkE,UAAU1D,SAAW0V,KAAKyJ,OAC9B,MAAM,IAAIrH,WAAYtT,EAAQ,sGAAuGkR,KAAKyJ,OAAQzb,UAAU1D,SAI7J,IAFAqR,EAAMqE,KAAK0J,QACXyB,EAAInL,KAAKqL,SAAS/gB,OACZR,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAAM,CACxC,IAAM0I,GAAWxE,UAAWlE,IAC3B,MAAM,IAAI+D,UAAWiB,EAAQ,iFAAkFhF,EAAGkE,UAAWlE,KAE9H4gB,EAAM4gB,GAAUt9B,UAAWlE,GAAKkW,KAAK4J,OAAQ9f,GAAI,EAAGkW,KAAKqL,SAAUvhB,EAAEqhB,IACrExP,GAAOqE,KAAK6J,SAAU/f,GAAM4gB,CAC5B,CACD,OAAK1K,KAAK8J,WACF9J,KAAK8B,QAAQvR,IAAKoL,GAEnBqE,KAAK8B,QAASnG,EACtB,ILsLWjL,EAAEyY,GAAQxe,UAAW,QHvMhC,SAAegR,GACd,GAAKqE,KAAKyJ,OAAS,EAAI,CACtB,IAAMjX,GAAWmJ,GAChB,MAAM,IAAI9N,UAAWiB,EAAQ,2DAA4D6M,IAG1F,OADAA,EAAM2vB,GAAU3vB,EAAKqE,KAAK6B,QAAQ,EAAG7B,KAAKoL,OACnCngB,GAAKW,KAAMoU,KAAMrE,EACxB,CACD,OAAO1Q,GAAKW,KAAMoU,KACnB,IGiOWtP,EAAEyY,GAAQxe,UAAW,OM7OhC,WACC,IAAIgR,EACA+O,EACAS,EACArhB,EAEJ,GAAKkW,KAAKiK,OAAOG,SAChB,MAAM,IAAI9e,MAAO,0DAElB,GAAK0C,UAAU1D,SAAW0V,KAAKyJ,OAAO,EACrC,MAAM,IAAIrH,WAAYtT,EAAQ,sGAAuGkR,KAAKyJ,OAAQzb,UAAU1D,SAI7J,IAFAqR,EAAMqE,KAAK0J,QACXyB,EAAInL,KAAKqL,SAAS/gB,OACZR,EAAI,EAAGA,EAAIkE,UAAU1D,OAAO,EAAGR,IAAM,CAC1C,IAAM0I,GAAWxE,UAAWlE,IAC3B,MAAM,IAAI+D,UAAWiB,EAAQ,iFAAkFhF,EAAGkE,UAAWlE,KAE9H4gB,EAAM4gB,GAAUt9B,UAAWlE,GAAKkW,KAAK4J,OAAQ9f,GAAI,EAAGkW,KAAKqL,SAAUvhB,EAAEqhB,IACrExP,GAAOqE,KAAK6J,SAAU/f,GAAM4gB,CAC5B,CAMD,OALK1K,KAAK8J,WACT9J,KAAK8B,QAAQtR,IAAKxC,UAAWlE,GAAK6R,GAElCqE,KAAK8B,QAASnG,GAAQ3N,UAAWlE,GAE3BkW,IACR,INqPWtP,EAAEyY,GAAQxe,UAAW,QF3QhC,SAAegR,EAAKjK,GACnB,GAAKsO,KAAKiK,OAAOG,SAChB,MAAM,IAAI9e,MAAO,0DAElB,GAAK0U,KAAKyJ,OAAS,EAAI,CACtB,IAAMjX,GAAWmJ,GAChB,MAAM,IAAI9N,UAAWiB,EAAQ,2DAA4D6M,IAE1FA,EAAM2vB,GAAU3vB,EAAKqE,KAAK6B,QAAQ,EAAG7B,KAAKoL,OAC1CngB,GAAKW,KAAMoU,KAAMrE,EAAKjK,EACxB,MACEzG,GAAKW,KAAMoU,KAAMrE,GAElB,OAAOqE,IACR,ISIA,IAAIurB,GAAW,CAAE,QAAS,SAAU,SA4NpC,SAASC,GAAQC,EAAMC,EAASC,EAASpd,EAAUnK,GAClD,IAAInL,EACAkM,EACArb,EACJ,KAAQkW,gBAAgBwrB,IACvB,OAAKx9B,UAAU1D,OAAS,EAChB,IAAIkhC,GAAQC,EAAMC,EAASC,EAASpd,GAErC,IAAIid,GAAQC,EAAMC,EAASC,EAASpd,EAAUnK,GAEtD,IAAM/L,GAAYozB,GACjB,MAAM,IAAI59B,UAAWiB,GAAQ,SAAU28B,IAExC,IAAM51B,GAAc61B,GACnB,MAAM,IAAI79B,UAAWiB,GAAQ,SAAU48B,IAGxC,IADAA,EC7QD,SAAej5B,GACd,IAAI1I,EACAmJ,EACA3C,EACAzG,EAUJ,IAPAyG,EAAMmhB,GAAejf,GAGrBS,EAAMT,EAAEnI,OAGRP,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAM0B,EAAKkC,EAAG3I,IAEnB,OAAOC,CACR,CD2PW8mB,CAAM6a,GACV5hC,EAAI,EAAGA,EAAI4hC,EAAQphC,OAAQR,IAAM,CAEtC,IACE+L,GAFFsP,EAAKumB,EAAS5hC,KAGbqb,EAAG7a,OAAS,IACXymB,GAAS5L,EAAI+H,IAEd,MAAM,IAAIrf,UAAWiB,GAAQ,oFAAqF48B,IAEnHA,EAAS5hC,GAAMm+B,GAAgB9iB,EAC/B,CACD,IACEtP,GAAc81B,IACfA,EAAQrhC,OAAS,IAChBymB,GAAS4a,EAASze,IAEnB,MAAM,IAAIrf,UAAWiB,GAAQ,gFAAiF68B,IAI/G,GAFAA,EAAU1D,GAAgB0D,IAEpB15B,GAAUsc,GACf,MAAM,IAAI1gB,UAAWiB,GAAQ,SAAUyf,IAExC,IAAM8B,GAAwB9B,EAASqd,QACtC,MAAM,IAAI/9B,UAAWiB,GAAQ,+GAAgHyf,EAASqd,SAKvJ,GAHA3yB,EAAO,CACN2M,MAASuO,GAAS5jB,IAAK,UAEnBvC,UAAU1D,OAAS,EAAI,CAC3B,IAAMsO,GAAewL,GACpB,MAAM,IAAIvW,UAAWiB,GAAQ,SAAUsV,IAExC,GAAKhT,EAAYgT,EAAS,WACzBnL,EAAK2M,MAAQxB,EAAQwB,OACfkL,GAAS7X,EAAK2M,QACnB,MAAM,IAAI/X,UAAWiB,GAAQ,2EAA4E,QAASmK,EAAK2M,OAGzH,CAQD,OAPA5F,KAAK6rB,MAAQJ,EACbzrB,KAAK8rB,SAAWJ,EAChB1rB,KAAK+rB,SAAWJ,EAChB3rB,KAAKgsB,UAAY,CAChBJ,OAAUrd,EAASqd,QAEpB5rB,KAAKisB,MAAQhzB,EACN+G,IACR,QA2CA9N,EAAas5B,GAAO7gC,UAAW,YAAY,SAAmBqb,EAAOkmB,EAAQC,EAAQ/nB,GACpF,IAAIgoB,EACAX,EACAxyB,EACAgJ,EACApS,EACAqD,EACAmW,EACAvY,EACA/G,EAEAob,EACA4F,EACAiZ,EACAqI,EACAviC,EEjXuBH,EFmX3B,IAAM6J,GAA2BwS,KEjXf,iBAFSrc,EFmXqCqc,IEhXrD,OAAVrc,GACiB,IAAjBA,EAAMW,QFgXN,MAAM,IAAIuD,UAAWiB,GAAQ,SAAUkX,IAGxC,GADA/M,EAAO,CAAA,EACFjL,UAAU1D,OAAS,IACvBuF,EG1WF,SAAmBoJ,EAAM8S,EAAQ3H,GAChC,OAAMnS,GAAUmS,GAGXhT,EAAYgT,EAAS,WACzBnL,EAAK0B,MAAQwlB,GAAY/b,EAAQzJ,QAC3B4P,GAAUwB,EAAQ9S,EAAK0B,QACrB,IAAI9M,UAAWiB,GAAQ,SAAU,QAAS0U,GAAMuI,EAAQ,QAAU3H,EAAQzJ,SAI9EvJ,EAAYgT,EAAS,WACzBnL,EAAK2M,MAAQxB,EAAQwB,OAEjBxU,EAAYgT,EAAS,UACzBnL,EAAK4b,KAAOzQ,EAAQyQ,MAEhBzjB,EAAYgT,EAAS,aACzBnL,EAAK8xB,QAAU3mB,EAAQ2mB,SAEnB35B,EAAYgT,EAAS,cACzBnL,EAAK6xB,SAAW1mB,EAAQ0mB,UAElB,MArBC,IAAIj9B,UAAWiB,GAAQ,SAAUsV,GAsB1C,CHkVQ4lB,CAAU/wB,EAAM+G,KAAK+rB,SAAU3nB,GAChCvU,GACJ,MAAMA,EAIR,IADAu8B,EAvVD,SAAsBA,GACrB,IAAIriC,EACA+N,EACAoT,EACAphB,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,IAE/BohB,EAAI,CACHohB,QAAU,EACV3iC,MAHDmO,EAAIs0B,EAAQtiC,GAIX6Q,MAAS,GACTS,MAAS,EACTwK,MAAS,IAELlc,EAAUoO,GACdoT,EAAEvQ,MAAQ,UACC8F,GAAe3I,GACJ,IAAjBA,EAAEgD,WACNoQ,EAAEvQ,MAAQ,YAEVuQ,EAAEvQ,MAAQ,aAEA2P,GAAexS,IAC1BoT,EAAEohB,QAAS,EACXphB,EAAEvQ,MAAQwlB,GAAYxN,GAAU7a,IAChCoT,EAAE9P,MAAQA,GAAOtD,GACjBoT,EAAEtF,MAAQmN,GAAUjb,IAEpBoT,EAAEvQ,MAAQ,UAEX5Q,EAAI8E,KAAMqc,GAEX,OAAOnhB,CACR,CAoTUwiC,CAAa,CAAEL,EAAQC,IAC1BriC,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,IAE/B,GADAqb,EAAKinB,EAAQtiC,GAAI6Q,OACX4P,GAAUvK,KAAK8rB,SAAUhiC,GAAKq2B,GAAYhb,IAC/C,MAAM,IAAItX,UAAWiB,GAAQ,kGAAmGy8B,GAAUzhC,EAAE,GAAK0Z,GAAMxD,KAAK8rB,SAAUhiC,GAAK,QAAUqb,IAuBvL,OApBArU,EA9SD,SAA6Bs7B,GAC5B,IAAII,EACA10B,EACAhO,EAGJ,IADA0iC,EAAQ,EACF1iC,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,MAC/BgO,EAAIs0B,EAAQtiC,IACLwiC,QAAsB,IAAZx0B,EAAEsD,SAClBoxB,GAAS,GAGX,OAASA,IAAUJ,EAAO9hC,MAC3B,CAiSOmiC,CAAoBL,GAEzBA,EADIt7B,EArRN,SAA2Bs7B,GAC1B,IAAIt0B,EACAhO,EAEJ,IAAMA,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,KAEb,KADlBgO,EAAIs0B,EAAQtiC,IACLwiC,SACNx0B,EAAEw0B,QAAS,EACXx0B,EAAEnO,MAAQmO,EAAEnO,MAAM4G,MAClBuH,EAAEsD,MAAQ,EACVtD,EAAE8N,MAAQ,IAGZ,OAAOwmB,CACR,CAwQWM,CAAkBN,GArO7B,SAA8BpmB,EAAOomB,GACpC,IAAI/iB,EACAvR,EACAhO,EAGJ,IADAuf,EA/BD,SAAuB+iB,GACtB,IAAIt0B,EACAhO,EACJ,IAAMA,EAAI,EAAGA,EAAIsiC,EAAO9hC,SAIL,KAHlBwN,EAAIs0B,EAAQtiC,IAGLwiC,OAJwBxiC,KAQhC,OAAOgO,EAAE8N,KACV,CAmBO+mB,CAAcP,GACdtiC,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,KAC/BgO,EAAIs0B,EAAQtiC,IACLwiC,QACNx0B,EAAEw0B,QAAS,EACXx0B,EAAEnO,MAAQq+B,GAAiBlwB,EAAEnO,MAAOmO,EAAE6C,MAAOqL,EAAOqD,GACpDvR,EAAE8N,MAAQyD,GAEVvR,EAAEnO,MAAQyzB,GAAWtlB,EAAEnO,MAAOqc,GAE/BlO,EAAEsD,MAAQ4K,EAAM1b,OAEjB,OAAO8hC,CACR,CAqNWQ,CAAqB5mB,EAAOomB,GAEtCpI,EAAKoI,EAAQ,GACbC,EAAKD,EAAQ,GACbX,EAAOzrB,KAAK6rB,MACZ1mB,EAAKlM,EAAK0B,OAASkyB,GAAsB7I,EAAGrpB,MAAO0xB,EAAG1xB,MAAOqF,KAAKgsB,UAAUJ,QAE3EviB,EADIpQ,EAAK2M,MACH3M,EAAK2M,MACA9U,EACLkP,KAAKisB,MAAMrmB,MAGXoe,EAAGpe,MAIG,KADb1S,EAAM8e,GAAOhM,KAGU,IAAjBA,EAAM1b,SAGLmR,GADLwG,EAAMd,GAAQgE,EAAI,IAEXI,GAAgBJ,GAEhBrJ,GAAQqJ,IAEVlD,EAAK,EAAGwpB,EAAMzH,EAAGr6B,MAAO0iC,EAAG1iC,QAChCohB,EAAK,CAAE,KAGP9I,EAAMd,GAAQgE,EAAIjS,GAClB6X,EAAKmH,GAAelM,EAAOqD,IAErB,IAAIF,GAAShE,EAAIlD,EAAK+D,EAAO+E,EAAI,EAAG1B,EAAKpQ,IAG5CnI,II/ZN,SAA0Bg8B,EAAIC,GAC7B,GAAKjhB,GAAkBghB,SAEhB,GAAKhf,GAAkBgf,GAC7BA,EAAKpiC,OAAQoiC,OACP,KAAK/e,GAAkB+e,GAG7B,OAAO,EAFPA,EAAKA,EAAGjgB,MAGR,CACD,GAAKf,GAAkBihB,SAEhB,GAAKjf,GAAkBif,GAC7BA,EAAKriC,OAAQqiC,OACP,KAAKhf,GAAkBgf,GAG7B,OAAO,EAFPA,EAAKA,EAAGlgB,MAGR,CACD,OAASigB,IAAOC,CACjB,CJ4YOC,CAAiB7nB,EAAI,WAIzB8nB,GAAgB,CADhBhrB,EAAMd,GAAQgE,EAAIjS,IACO,CAAEA,GAAO,CAAE,GAAKg6B,GAHzCjrB,EKtbH,SAAmB/O,EAAKwP,EAAMD,GAC7B,IAAI3M,EACAhM,EAIJ,IADAgM,EAAM,GACAhM,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBgM,EAAIjH,KAAM6T,EAAK9W,KAAM6W,EAAS3Y,IAE/B,OAAOgM,CACR,CL4aSq3B,CAAUj6B,EAAKg6B,GAMf,IAAI/jB,GAAShE,EAAIlD,EAAK+D,EAD7B+E,EAAKmH,GAAelM,EAAOqD,GACa,EAAGA,EAAKpQ,KASjDlP,EAAM,IAAIof,GAAShE,EAJnBlD,EAAMd,GAAQgE,EAAIjS,GAIU8S,EAD5B+E,EAAKmH,GAAelM,EAAOqD,GACY,EAAGA,EAAKpQ,GAG/CqB,GAAQ,CAAE0pB,EAAGr6B,MAAO0iC,EAAG1iC,MAAOI,GAAO0hC,GAE9B1hC,GAQP,SAASmjC,IACR,OAAOzB,EAAMzH,EAAGr6B,MAAO0iC,EAAG1iC,MAC1B,CACF,IAyCAuI,EAAas5B,GAAO7gC,UAAW,UAAU,SAAiBuhC,EAAQC,EAAQpiC,GACzE,IAAIqiC,EACAgB,EACAC,EACAhkB,EACAyB,EACAhT,EACAhO,EAEJ,IAAMwgB,GAAevgB,GACpB,MAAM,IAAI8D,UAAWiB,GAAQ,gFAAiF/E,IAE/G,IM/fqC,IAA5B0D,GN+fQ1D,EM/fG,YNggBnB,MAAM,IAAIuB,MAAOwD,GAAO,WAKzB,GAHAgc,EOvgBD,SAAgBrY,GACf,IAAI1I,EACA+gB,EACA2R,EACA3yB,EAGJ,GAAkB,iBAAN2I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,IAAMoD,GADNiV,EAAKrY,EAAEuT,OAEN,MAAM,IAAInY,UAAWiB,EAAQ,0DAA2D2D,IAIzF,IADA1I,EAAM,GACAD,EAAI,EAAGA,EAAIghB,EAAGxgB,OAAQR,IAAM,CAEjC,IAAMgJ,GADN2pB,EAAI3R,EAAIhhB,IAEP,MAAM,IAAI+D,UAAWiB,EAAQ,0DAA2D2D,IAEzF1I,EAAI8E,KAAM4tB,EACV,CACD,OAAO1yB,CACR,CP+eM2oB,CAAU3oB,GACfsf,EAAM0J,GAAUhpB,GAChBsjC,EAAM1a,GAAU5oB,IACVwgB,GAAUvK,KAAK+rB,SAAU5L,GAAYkN,IAC1C,MAAM,IAAIx/B,UAAWiB,GAAQ,kGAAmGy8B,GAAU,GAAK/nB,GAAMxD,KAAK+rB,SAAU,QAAUsB,IAG/K,IADAjB,EAAS,CAAEF,EAAQC,GACbriC,EAAI,EAAGA,EAAIsiC,EAAO9hC,OAAQR,IAAM,CAyBrC,GArBKJ,EAHLoO,EAAIs0B,EAAQtiC,IAMXgO,EAAIkwB,GAAiBlwB,EADrBs1B,EAAM,UACuBtiB,EAAIzB,GACtB5I,GAAe3I,GAO1BA,EAAIkwB,GAAiBlwB,EALpBs1B,EADqB,IAAjBt1B,EAAEgD,WACA,YAEA,aAGsBgQ,EAAIzB,GACtBiB,GAAexS,IAE1Bs1B,EAAMza,GAAU7a,GAChBA,EAAIslB,GAAWtlB,EAAGgT,IAIlBhT,EAAIkwB,GAAiBlwB,EADrBs1B,EAAM,UACuBtiB,EAAIzB,IAE5BkB,GAAUvK,KAAK8rB,SAAUhiC,GAAKq2B,GAAYiN,IAC/C,MAAM,IAAIv/B,UAAWiB,GAAQ,kGAAmGy8B,GAAUzhC,GAAK0Z,GAAMxD,KAAK8rB,SAAUhiC,GAAK,QAAUsjC,IAEpLhB,EAAQtiC,GAAMgO,CACd,CAKD,OAHAs0B,EAAOv9B,KAAM9E,GACbuQ,GAAQ8xB,EAAQpsB,KAAK6rB,OAEd9hC,CACR","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,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,397,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,463,464,465,466,467,468,469,470,471,472,473,474,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519,520,521,522,523,524,525,526,527,528,529,530,531,532,533,534,535,536,537,538,539,540,541,542,543,544,545,546,547,548,549,550,551,552,553,554,555,556,557,558,559,560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591,592,593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,616,617,619,620,621,622]} \ No newline at end of file diff --git a/dist/index.d.ts b/dist/index.d.ts deleted file mode 100644 index 0b44231..0000000 --- a/dist/index.d.ts +++ /dev/null @@ -1,3 +0,0 @@ -/// -import ctor from '../docs/types/index'; -export = ctor; \ No newline at end of file diff --git a/dist/index.js b/dist/index.js deleted file mode 100644 index b889ce9..0000000 --- a/dist/index.js +++ /dev/null @@ -1,19 +0,0 @@ -"use strict";var C=function(t,r){return function(){try{return r||t((r={exports:{}}).exports,r),r.exports}catch(e){throw r=0,e}}};var R=C(function(xr,N){"use strict";var X=require("@stdlib/assert-is-plain-object"),p=require("@stdlib/assert-has-own-property"),Y=require("@stdlib/array-base-assert-contains"),Z=require("@stdlib/array-base-join"),$=require("@stdlib/ndarray-base-dtype-resolve-str"),A=require("@stdlib/string-format");function rr(t,r,e){return X(e)?p(e,"dtype")&&(t.dtype=$(e.dtype),!Y(r,t.dtype))?new TypeError(A('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"dtype",Z(r,'", "'),e.dtype)):(p(e,"order")&&(t.order=e.order),p(e,"mode")&&(t.mode=e.mode),p(e,"submode")&&(t.submode=e.submode),p(e,"readonly")&&(t.readonly=e.readonly),null):new TypeError(A("invalid argument. Options argument must be an object. Value: `%s`.",e))}N.exports=rr});var W=C(function(Fr,U){"use strict";var z=require("@stdlib/utils-define-nonenumerable-read-only-property"),er=require("@stdlib/assert-is-nonnegative-integer-array").primitives,ar=require("@stdlib/assert-is-empty-collection"),D=require("@stdlib/assert-is-ndarray-like"),H=require("@stdlib/assert-is-number").isPrimitive,tr=require("@stdlib/assert-is-function"),J=require("@stdlib/assert-is-complex-like"),ir=require("@stdlib/assert-is-plain-object"),nr=require("@stdlib/assert-is-object"),S=require("@stdlib/assert-is-collection"),B=require("@stdlib/ndarray-base-assert-is-data-type"),ur=require("@stdlib/ndarray-base-assert-is-equal-data-type"),or=require("@stdlib/ndarray-base-assert-is-output-data-type-policy"),vr=require("@stdlib/ndarray-base-assert-is-read-only"),lr=require("@stdlib/ndarray-base-assert-is-order"),sr=require("@stdlib/assert-has-own-property"),x=require("@stdlib/array-base-assert-contains"),dr=require("@stdlib/array-base-filled-by"),I=require("@stdlib/array-base-every-by"),F=require("@stdlib/array-base-join"),fr=require("@stdlib/array-base-copy"),gr=require("@stdlib/strided-base-nullary"),K=require("@stdlib/ndarray-base-binary"),M=require("@stdlib/ndarray-base-maybe-broadcast-array"),T=require("@stdlib/ndarray-base-broadcast-scalar"),j=require("@stdlib/ndarray-base-shape2strides"),G=require("@stdlib/ndarray-base-dtypes2strings"),E=require("@stdlib/ndarray-base-dtype-resolve-str"),yr=require("@stdlib/ndarray-base-binary-output-dtype"),mr=require("@stdlib/ndarray-base-numel"),b=require("@stdlib/ndarray-base-buffer"),cr=require("@stdlib/ndarray-shape"),k=require("@stdlib/ndarray-dtype"),Q=require("@stdlib/ndarray-order"),hr=require("@stdlib/ndarray-ndims"),V=require("@stdlib/ndarray-ctor"),qr=require("@stdlib/ndarray-defaults"),pr=require("@stdlib/array-base-assert-is-accessor-array"),wr=require("@stdlib/array-base-accessor-setter"),br=require("@stdlib/array-base-setter"),f=require("@stdlib/string-format"),Tr=R(),L=["First","Second","Third"];function Er(t){var r,e,a,n;for(r=[],n=0;n4){if(!ir(n))throw new TypeError(f("invalid argument. Options argument must be an object. Value: `%s`.",n));if(sr(n,"order")&&(i.order=n.order,!lr(i.order)))throw new TypeError(f("invalid option. `%s` option must be a valid memory layout. Option: `%s`.","order",i.order))}return this._prng=t,this._idtypes=r,this._odtypes=e,this._policies={output:a.output},this._opts=i,this}z(h.prototype,"generate",function(r,e,a,n){var i,s,u,v,o,l,g,w,O,_,d,y,c,q,m;if(!er(r)&&!ar(r))throw new TypeError(f("invalid argument. First argument must be an array-like object containing nonnegative integers. Value: `%s`.",r));if(u={},arguments.length>3&&(o=Tr(u,this._odtypes,n),o))throw o;for(i=Er([e,a]),m=0;m} dtypes - list of supported output data types\n* @param {Options} options - function options\n* @param {*} [options.dtype] - array data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var dtypes = [ 'float64', 'float32', 'generic' ];\n*\n* var options = {\n* 'dtype': 'float64'\n* };\n* var err = validate( opts, dtypes, options );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( opts, dtypes, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'dtype' ) ) {\n\t\topts.dtype = resolveStr( options.dtype );\n\t\tif ( !contains( dtypes, opts.dtype ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'dtype', join( dtypes, '\", \"' ), options.dtype ) );\n\t\t}\n\t}\n\t// Pass-through options...\n\tif ( hasOwnProp( options, 'order' ) ) {\n\t\topts.order = options.order;\n\t}\n\tif ( hasOwnProp( options, 'mode' ) ) {\n\t\topts.mode = options.mode;\n\t}\n\tif ( hasOwnProp( options, 'submode' ) ) {\n\t\topts.submode = options.submode;\n\t}\n\tif ( hasOwnProp( options, 'readonly' ) ) {\n\t\topts.readonly = options.readonly;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\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 no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar isNonNegativeIntegerArray = require( '@stdlib/assert-is-nonnegative-integer-array' ).primitives;\nvar isEmptyCollection = require( '@stdlib/assert-is-empty-collection' );\nvar isndarrayLike = require( '@stdlib/assert-is-ndarray-like' );\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar isPlainObject = require( '@stdlib/assert-is-plain-object' );\nvar isObject = require( '@stdlib/assert-is-object' );\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isDataType = require( '@stdlib/ndarray-base-assert-is-data-type' );\nvar isEqualDataType = require( '@stdlib/ndarray-base-assert-is-equal-data-type' );\nvar isOutputDataTypePolicy = require( '@stdlib/ndarray-base-assert-is-output-data-type-policy' );\nvar isReadOnly = require( '@stdlib/ndarray-base-assert-is-read-only' );\nvar isOrder = require( '@stdlib/ndarray-base-assert-is-order' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar contains = require( '@stdlib/array-base-assert-contains' );\nvar filledBy = require( '@stdlib/array-base-filled-by' );\nvar everyBy = require( '@stdlib/array-base-every-by' );\nvar join = require( '@stdlib/array-base-join' );\nvar copy = require( '@stdlib/array-base-copy' );\nvar nullaryStrided = require( '@stdlib/strided-base-nullary' );\nvar binary = require( '@stdlib/ndarray-base-binary' );\nvar broadcast = require( '@stdlib/ndarray-base-maybe-broadcast-array' );\nvar broadcastScalar = require( '@stdlib/ndarray-base-broadcast-scalar' );\nvar shape2strides = require( '@stdlib/ndarray-base-shape2strides' );\nvar dtypes2strings = require( '@stdlib/ndarray-base-dtypes2strings' );\nvar resolveStr = require( '@stdlib/ndarray-base-dtype-resolve-str' );\nvar binaryOutputDataType = require( '@stdlib/ndarray-base-binary-output-dtype' );\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar buffer = require( '@stdlib/ndarray-base-buffer' );\nvar getShape = require( '@stdlib/ndarray-shape' );\nvar getDType = require( '@stdlib/ndarray-dtype' );\nvar getOrder = require( '@stdlib/ndarray-order' );\nvar ndims = require( '@stdlib/ndarray-ndims' );\nvar ndarray = require( '@stdlib/ndarray-ctor' );\nvar defaults = require( '@stdlib/ndarray-defaults' );\nvar isAccessorArray = require( '@stdlib/array-base-assert-is-accessor-array' );\nvar accessorSetter = require( '@stdlib/array-base-accessor-setter' );\nvar setter = require( '@stdlib/array-base-setter' );\nvar format = require( '@stdlib/string-format' );\nvar validate = require( './validate.js' );\n\n\n// VARIABLES //\n\nvar ORDINALS = [ 'First', 'Second', 'Third' ];\n\n\n// FUNCTIONS //\n\n/**\n* Performs an initial scan of a list of parameters.\n*\n* @private\n* @param {Array} params - list of parameters\n* @returns {Array} scan results\n*/\nfunction initialScan( params ) {\n\tvar out;\n\tvar p;\n\tvar o;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\to = {\n\t\t\t'scalar': true,\n\t\t\t'value': p,\n\t\t\t'dtype': '',\n\t\t\t'ndims': 0,\n\t\t\t'order': ''\n\t\t};\n\t\tif ( isNumber( p ) ) {\n\t\t\to.dtype = 'float64';\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\to.dtype = 'complex64';\n\t\t\t} else {\n\t\t\t\to.dtype = 'complex128';\n\t\t\t}\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\to.scalar = false;\n\t\t\to.dtype = resolveStr( getDType( p ) );\n\t\t\to.ndims = ndims( p );\n\t\t\to.order = getOrder( p );\n\t\t} else {\n\t\t\to.dtype = 'generic';\n\t\t}\n\t\tout.push( o );\n\t}\n\treturn out;\n}\n\n/**\n* Checks whether all parameters are scalar compatible.\n*\n* ## Notes\n*\n* - A parameter is scalar compatible if, and only if, the parameter value is either a zero-dimensional ndarray or already a scalar value.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {boolean} boolean indicating whether all parameters are scalar compatible\n*/\nfunction isScalarCompatible( params ) {\n\tvar count;\n\tvar p;\n\tvar i;\n\n\tcount = 0;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar || p.ndims === 0 ) {\n\t\t\tcount += 1;\n\t\t}\n\t}\n\treturn ( count === params.length );\n}\n\n/**\n* Converts a list of parameters to scalar values.\n*\n* ## Notes\n*\n* - The function **mutates** the input array by updating parameter objects which do not already correspond to scalar parameter values.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction convertToScalars( params ) {\n\tvar p;\n\tvar i;\n\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar === false ) {\n\t\t\tp.scalar = true;\n\t\t\tp.value = p.value.get();\n\t\t\tp.ndims = 0;\n\t\t\tp.order = '';\n\t\t}\n\t}\n\treturn params;\n}\n\n/**\n* Resolves a common memory layout from a list of parameter objects.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {string} memory layout\n*/\nfunction resolveOrder( params ) {\n\tvar p;\n\tvar i;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// For a binary parameter function, we simply return the layout of the first parameter having a layout, as there is no clear rationale for picking the layout of one parameter over another and picking the first one we find is as good a rationale as any other...\n\t\tif ( p.scalar === false ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn p.order;\n}\n\n/**\n* Broadcasts parameter values to an ndarray having a specified shape.\n*\n* ## Notes\n*\n* - The function **mutates** the input array.\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction broadcastParameters( shape, params ) {\n\tvar ord;\n\tvar p;\n\tvar i;\n\n\tord = resolveOrder( params );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar ) {\n\t\t\tp.scalar = false;\n\t\t\tp.value = broadcastScalar( p.value, p.dtype, shape, ord );\n\t\t\tp.order = ord;\n\t\t} else {\n\t\t\tp.value = broadcast( p.value, shape ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t}\n\t\tp.ndims = shape.length;\n\t}\n\treturn params;\n}\n\n\n// MAIN //\n\n/**\n* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG.\n*\n* @constructor\n* @param {Function} prng - binary pseudorandom value generator\n* @param {ArrayLikeObject} idtypes - list containing a list of supported input data types for each PRNG parameter\n* @param {ArrayLikeObject} odtypes - list of supported output data types\n* @param {Object} policies - policies\n* @param {string} policies.output - output data type policy\n* @param {Object} [options] - function options\n* @param {string} [options.order] - default memory layout\n* @throws {TypeError} first argument must be a function\n* @throws {TypeError} second argument must be an array containing arrays of supported data types\n* @throws {TypeError} third argument must be an array of supported data types\n* @throws {TypeError} fourth argument must be an object having supported policies\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Random} instance\n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var ndzeros = require( '@stdlib/ndarray-zeros' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nfunction Random( prng, idtypes, odtypes, policies, options ) {\n\tvar opts;\n\tvar dt;\n\tvar i;\n\tif ( !( this instanceof Random ) ) {\n\t\tif ( arguments.length < 5 ) {\n\t\t\treturn new Random( prng, idtypes, odtypes, policies );\n\t\t}\n\t\treturn new Random( prng, idtypes, odtypes, policies, options );\n\t}\n\tif ( !isFunction( prng ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', prng ) );\n\t}\n\tif ( !isCollection( idtypes ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an array-like object. Value: `%s`.', idtypes ) );\n\t}\n\tidtypes = copy( idtypes );\n\tfor ( i = 0; i < idtypes.length; i++ ) {\n\t\tdt = idtypes[ i ];\n\t\tif (\n\t\t\t!isCollection( dt ) ||\n\t\t\tdt.length < 1 ||\n\t\t\t!everyBy( dt, isDataType )\n\t\t) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must contain arrays of data types. Value: `%s`.', idtypes ) );\n\t\t}\n\t\tidtypes[ i ] = dtypes2strings( dt );\n\t}\n\tif (\n\t\t!isCollection( odtypes ) ||\n\t\todtypes.length < 1 ||\n\t\t!everyBy( odtypes, isDataType )\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array of data types. Value: `%s`.', odtypes ) );\n\t}\n\todtypes = dtypes2strings( odtypes );\n\n\tif ( !isObject( policies ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an object. Value: `%s`.', policies ) );\n\t}\n\tif ( !isOutputDataTypePolicy( policies.output ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an object having a supported output data type policy. Value: `%s`.', policies.output ) );\n\t}\n\topts = {\n\t\t'order': defaults.get( 'order' )\n\t};\n\tif ( arguments.length > 4 ) {\n\t\tif ( !isPlainObject( options ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t\t}\n\t\tif ( hasOwnProp( options, 'order' ) ) {\n\t\t\topts.order = options.order;\n\t\t\tif ( !isOrder( opts.order ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a valid memory layout. Option: `%s`.', 'order', opts.order ) );\n\t\t\t}\n\t\t}\n\t}\n\tthis._prng = prng;\n\tthis._idtypes = idtypes;\n\tthis._odtypes = odtypes;\n\tthis._policies = {\n\t\t'output': policies.output\n\t};\n\tthis._opts = opts;\n\treturn this;\n}\n\n/**\n* Returns an ndarray filled with pseudorandom values drawn from a binary PRNG.\n*\n* @name generate\n* @memberof Random.prototype\n* @type {Function}\n* @param {NonNegativeIntegerArray} shape - output shape\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {Options} [options] - function options\n* @param {*} [options.dtype] - output ndarray data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed ndarray dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed ndarray dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an ndarray should be read-only\n* @throws {TypeError} first argument must be a valid shape\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the desired shape must be broadcast compatible\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {ndarray} output ndarray\n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*/\nsetReadOnly( Random.prototype, 'generate', function generate( shape, param1, param2, options ) {\n\tvar params;\n\tvar prng;\n\tvar opts;\n\tvar buf;\n\tvar err;\n\tvar len;\n\tvar ord;\n\tvar FLG;\n\tvar out;\n\tvar set;\n\tvar dt;\n\tvar st;\n\tvar p1;\n\tvar p2;\n\tvar i;\n\n\tif ( !isNonNegativeIntegerArray( shape ) && !isEmptyCollection( shape ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object containing nonnegative integers. Value: `%s`.', shape ) );\n\t}\n\topts = {};\n\tif ( arguments.length > 3 ) {\n\t\terr = validate( opts, this._odtypes, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tparams = initialScan( [ param1, param2 ] );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tdt = params[ i ].dtype;\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( dt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i+1 ], join( this._idtypes[ i ], '\", \"' ), dt ) );\n\t\t}\n\t}\n\tFLG = isScalarCompatible( params );\n\tif ( FLG ) {\n\t\tparams = convertToScalars( params );\n\t} else {\n\t\tparams = broadcastParameters( shape, params );\n\t}\n\tp1 = params[ 0 ];\n\tp2 = params[ 1 ];\n\tprng = this._prng;\n\tdt = opts.dtype || binaryOutputDataType( p1.dtype, p2.dtype, this._policies.output ); // eslint-disable-line max-len\n\tif ( opts.order ) {\n\t\tord = opts.order;\n\t} else if ( FLG ) {\n\t\tord = this._opts.order;\n\t} else {\n\t\t// If we don't have any explicit order info, use the order of the first parameter, as no clear rationale for choosing the order of one parameter over another:\n\t\tord = p1.order;\n\t}\n\t// Handles special cases involving (1) zero-dimensional output ndarrays and (2) shapes having at least one dimension of size zero...\n\tlen = numel( shape );\n\tif ( len === 0 ) {\n\t\t// Check for a zero-dimensional shape...\n\t\tif ( shape.length === 0 ) {\n\t\t\t// If the output array is a zero-dimensional ndarray, we generate a single random variate...\n\t\t\tbuf = buffer( dt, 1 );\n\t\t\tif ( isAccessorArray( buf ) ) {\n\t\t\t\tset = accessorSetter( dt );\n\t\t\t} else {\n\t\t\t\tset = setter( dt );\n\t\t\t}\n\t\t\tset( buf, 0, prng( p1.value, p2.value ) );\n\t\t\tst = [ 0 ];\n\t\t} else {\n\t\t\t// If the output array has one or more dimensions of size zero, we avoid allocating any memory, and instead return an empty ndarray...\n\t\t\tbuf = buffer( dt, len );\n\t\t\tst = shape2strides( shape, ord );\n\t\t}\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// If provided scalar PRNG parameters, we can simply fill a linear buffer with pseudorandom values (as all pseudorandom values are drawn from the same PRNG) and then wrap as an ndarray...\n\tif ( FLG ) {\n\t\tif ( isEqualDataType( dt, 'generic' ) ) {\n\t\t\tbuf = filledBy( len, wrapper );\n\t\t} else {\n\t\t\tbuf = buffer( dt, len );\n\t\t\tnullaryStrided( [ buf ], [ len ], [ 1 ], wrapper );\n\t\t}\n\t\tst = shape2strides( shape, ord );\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// We've been provided ndarrays, so we need to perform element-wise iteration...\n\n\t// Allocate a data buffer:\n\tbuf = buffer( dt, len );\n\n\t// Initialize the output array:\n\tst = shape2strides( shape, ord );\n\tout = new ndarray( dt, buf, shape, st, 0, ord, opts );\n\n\t// Fill the output array with pseudorandom values:\n\tbinary( [ p1.value, p2.value, out ], prng );\n\n\treturn out;\n\n\t/**\n\t* Applies parameters to a pseudorandom number generator function.\n\t*\n\t* @private\n\t* @returns {(number|ComplexLike)} pseudorandom number\n\t*/\n\tfunction wrapper() {\n\t\treturn prng( p1.value, p2.value );\n\t}\n});\n\n/**\n* Fills an ndarray with pseudorandom values drawn from a binary PRNG.\n*\n* @name assign\n* @memberof Random.prototype\n* @type {Function}\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {ndarrayLike} out - output ndarray\n* @throws {TypeError} third argument must be an ndarray\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the output ndarray must be broadcast compatible\n* @throws {Error} cannot write to a read-only ndarray\n* @returns {ndarray} output ndarray\n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var ndzeros = require( '@stdlib/ndarray-zeros' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nsetReadOnly( Random.prototype, 'assign', function assign( param1, param2, out ) {\n\tvar params;\n\tvar pdt;\n\tvar odt;\n\tvar ord;\n\tvar sh;\n\tvar p;\n\tvar i;\n\n\tif ( !isndarrayLike( out ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an ndarray-like object. Value: `%s`.', out ) );\n\t}\n\tif ( isReadOnly( out ) ) {\n\t\tthrow new Error( 'invalid argument. The output ndarray must be writable. Cannot write to a read-only ndarray.' );\n\t}\n\tsh = getShape( out );\n\tord = getOrder( out );\n\todt = getDType( out );\n\tif ( !contains( this._odtypes, resolveStr( odt ) ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ 2 ], join( this._odtypes, '\", \"' ), odt ) );\n\t}\n\tparams = [ param1, param2 ];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// Check whether we've been provided a scalar PRNG parameter...\n\t\tif ( isNumber( p ) ) {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'float64';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\tpdt = 'complex64';\n\t\t\t} else {\n\t\t\t\tpdt = 'complex128';\n\t\t\t}\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\t// Broadcast the PRNG parameter to the desired shape:\n\t\t\tpdt = getDType( p );\n\t\t\tp = broadcast( p, sh ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t} else {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'generic';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t}\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( pdt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i ], join( this._idtypes[ i ], '\", \"' ), pdt ) );\n\t\t}\n\t\tparams[ i ] = p;\n\t}\n\t// Fill the output array with pseudorandom values:\n\tparams.push( out );\n\tbinary( params, this._prng );\n\n\treturn out;\n});\n\n\n// EXPORTS //\n\nmodule.exports = Random;\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* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG.\n*\n* @module @stdlib/random-tools-binary\n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n* var Random = require( '@stdlib/random-tools-binary' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*\n* @example\n* var dtypes = require( '@stdlib/ndarray-dtypes' );\n* var ndzeros = require( '@stdlib/ndarray-zeros' );\n* var uniform = require( '@stdlib/random-base-uniform' );\n* var Random = require( '@stdlib/random-tools-binary' );\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"], - "mappings": "iIAAA,IAAAA,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAW,QAAS,gCAAiC,EACrDC,EAAa,QAAS,iCAAkC,EACxDC,EAAW,QAAS,oCAAqC,EACzDC,EAAO,QAAS,yBAA0B,EAC1CC,EAAa,QAAS,wCAAyC,EAC/DC,EAAS,QAAS,uBAAwB,EA+B9C,SAASC,GAAUC,EAAMC,EAAQC,EAAU,CAC1C,OAAMT,EAAUS,CAAQ,EAGnBR,EAAYQ,EAAS,OAAQ,IACjCF,EAAK,MAAQH,EAAYK,EAAQ,KAAM,EAClC,CAACP,EAAUM,EAAQD,EAAK,KAAM,GAC3B,IAAI,UAAWF,EAAQ,gFAAiF,QAASF,EAAMK,EAAQ,MAAO,EAAGC,EAAQ,KAAM,CAAE,GAI7JR,EAAYQ,EAAS,OAAQ,IACjCF,EAAK,MAAQE,EAAQ,OAEjBR,EAAYQ,EAAS,MAAO,IAChCF,EAAK,KAAOE,EAAQ,MAEhBR,EAAYQ,EAAS,SAAU,IACnCF,EAAK,QAAUE,EAAQ,SAEnBR,EAAYQ,EAAS,UAAW,IACpCF,EAAK,SAAWE,EAAQ,UAElB,MArBC,IAAI,UAAWJ,EAAQ,qEAAsEI,CAAQ,CAAE,CAsBhH,CAKAV,EAAO,QAAUO,KCvFjB,IAAAI,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAwBA,IAAIC,EAAc,QAAS,uDAAwD,EAC/EC,GAA4B,QAAS,6CAA8C,EAAE,WACrFC,GAAoB,QAAS,oCAAqC,EAClEC,EAAgB,QAAS,gCAAiC,EAC1DC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAa,QAAS,4BAA6B,EACnDC,EAAgB,QAAS,gCAAiC,EAC1DC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAW,QAAS,0BAA2B,EAC/CC,EAAe,QAAS,8BAA+B,EACvDC,EAAa,QAAS,0CAA2C,EACjEC,GAAkB,QAAS,gDAAiD,EAC5EC,GAAyB,QAAS,wDAAyD,EAC3FC,GAAa,QAAS,0CAA2C,EACjEC,GAAU,QAAS,sCAAuC,EAC1DC,GAAa,QAAS,iCAAkC,EACxDC,EAAW,QAAS,oCAAqC,EACzDC,GAAW,QAAS,8BAA+B,EACnDC,EAAU,QAAS,6BAA8B,EACjDC,EAAO,QAAS,yBAA0B,EAC1CC,GAAO,QAAS,yBAA0B,EAC1CC,GAAiB,QAAS,8BAA+B,EACzDC,EAAS,QAAS,6BAA8B,EAChDC,EAAY,QAAS,4CAA6C,EAClEC,EAAkB,QAAS,uCAAwC,EACnEC,EAAgB,QAAS,oCAAqC,EAC9DC,EAAiB,QAAS,qCAAsC,EAChEC,EAAa,QAAS,wCAAyC,EAC/DC,GAAuB,QAAS,0CAA2C,EAC3EC,GAAQ,QAAS,4BAA6B,EAC9CC,EAAS,QAAS,6BAA8B,EAChDC,GAAW,QAAS,uBAAwB,EAC5CC,EAAW,QAAS,uBAAwB,EAC5CC,EAAW,QAAS,uBAAwB,EAC5CC,GAAQ,QAAS,uBAAwB,EACzCC,EAAU,QAAS,sBAAuB,EAC1CC,GAAW,QAAS,0BAA2B,EAC/CC,GAAkB,QAAS,6CAA8C,EACzEC,GAAiB,QAAS,oCAAqC,EAC/DC,GAAS,QAAS,2BAA4B,EAC9CC,EAAS,QAAS,uBAAwB,EAC1CC,GAAW,IAKXC,EAAW,CAAE,QAAS,SAAU,OAAQ,EAY5C,SAASC,GAAaC,EAAS,CAC9B,IAAIC,EACAC,EACAC,EACAC,EAGJ,IADAH,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAC/BF,EAAIF,EAAQI,CAAE,EACdD,EAAI,CACH,OAAU,GACV,MAASD,EACT,MAAS,GACT,MAAS,EACT,MAAS,EACV,EACK1C,EAAU0C,CAAE,EAChBC,EAAE,MAAQ,UACCzC,EAAewC,CAAE,EACvBA,EAAE,aAAe,EACrBC,EAAE,MAAQ,YAEVA,EAAE,MAAQ,aAEA5C,EAAe2C,CAAE,GAC5BC,EAAE,OAAS,GACXA,EAAE,MAAQpB,EAAYK,EAAUc,CAAE,CAAE,EACpCC,EAAE,MAAQb,GAAOY,CAAE,EACnBC,EAAE,MAAQd,EAAUa,CAAE,GAEtBC,EAAE,MAAQ,UAEXF,EAAI,KAAME,CAAE,EAEb,OAAOF,CACR,CAaA,SAASI,GAAoBL,EAAS,CACrC,IAAIM,EACAJ,EACAE,EAGJ,IADAE,EAAQ,EACFF,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAC/BF,EAAIF,EAAQI,CAAE,GACTF,EAAE,QAAUA,EAAE,QAAU,KAC5BI,GAAS,GAGX,OAASA,IAAUN,EAAO,MAC3B,CAaA,SAASO,GAAkBP,EAAS,CACnC,IAAIE,EACAE,EAEJ,IAAMA,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAC/BF,EAAIF,EAAQI,CAAE,EACTF,EAAE,SAAW,KACjBA,EAAE,OAAS,GACXA,EAAE,MAAQA,EAAE,MAAM,IAAI,EACtBA,EAAE,MAAQ,EACVA,EAAE,MAAQ,IAGZ,OAAOF,CACR,CASA,SAASQ,GAAcR,EAAS,CAC/B,IAAIE,EACAE,EACJ,IAAMA,EAAI,EAAGA,EAAIJ,EAAO,SACvBE,EAAIF,EAAQI,CAAE,EAGTF,EAAE,SAAW,IAJaE,IAI/B,CAID,OAAOF,EAAE,KACV,CAcA,SAASO,GAAqBC,EAAOV,EAAS,CAC7C,IAAIW,EACAT,EACAE,EAGJ,IADAO,EAAMH,GAAcR,CAAO,EACrBI,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAC/BF,EAAIF,EAAQI,CAAE,EACTF,EAAE,QACNA,EAAE,OAAS,GACXA,EAAE,MAAQtB,EAAiBsB,EAAE,MAAOA,EAAE,MAAOQ,EAAOC,CAAI,EACxDT,EAAE,MAAQS,GAEVT,EAAE,MAAQvB,EAAWuB,EAAE,MAAOQ,CAAM,EAErCR,EAAE,MAAQQ,EAAM,OAEjB,OAAOV,CACR,CAmEA,SAASY,EAAQC,EAAMC,EAASC,EAASC,EAAUC,EAAU,CAC5D,IAAIC,EACAC,EACAf,EACJ,GAAK,EAAG,gBAAgBQ,GACvB,OAAK,UAAU,OAAS,EAChB,IAAIA,EAAQC,EAAMC,EAASC,EAASC,CAAS,EAE9C,IAAIJ,EAAQC,EAAMC,EAASC,EAASC,EAAUC,CAAQ,EAE9D,GAAK,CAACxD,GAAYoD,CAAK,EACtB,MAAM,IAAI,UAAWjB,EAAQ,oEAAqEiB,CAAK,CAAE,EAE1G,GAAK,CAAChD,EAAciD,CAAQ,EAC3B,MAAM,IAAI,UAAWlB,EAAQ,+EAAgFkB,CAAQ,CAAE,EAGxH,IADAA,EAAUtC,GAAMsC,CAAQ,EAClBV,EAAI,EAAGA,EAAIU,EAAQ,OAAQV,IAAM,CAEtC,GADAe,EAAKL,EAASV,CAAE,EAEf,CAACvC,EAAcsD,CAAG,GAClBA,EAAG,OAAS,GACZ,CAAC7C,EAAS6C,EAAIrD,CAAW,EAEzB,MAAM,IAAI,UAAW8B,EAAQ,oFAAqFkB,CAAQ,CAAE,EAE7HA,EAASV,CAAE,EAAItB,EAAgBqC,CAAG,CACnC,CACA,GACC,CAACtD,EAAckD,CAAQ,GACvBA,EAAQ,OAAS,GACjB,CAACzC,EAASyC,EAASjD,CAAW,EAE9B,MAAM,IAAI,UAAW8B,EAAQ,gFAAiFmB,CAAQ,CAAE,EAIzH,GAFAA,EAAUjC,EAAgBiC,CAAQ,EAE7B,CAACnD,GAAUoD,CAAS,EACxB,MAAM,IAAI,UAAWpB,EAAQ,oEAAqEoB,CAAS,CAAE,EAE9G,GAAK,CAAChD,GAAwBgD,EAAS,MAAO,EAC7C,MAAM,IAAI,UAAWpB,EAAQ,+GAAgHoB,EAAS,MAAO,CAAE,EAKhK,GAHAE,EAAO,CACN,MAAS1B,GAAS,IAAK,OAAQ,CAChC,EACK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAAC7B,GAAesD,CAAQ,EAC5B,MAAM,IAAI,UAAWrB,EAAQ,qEAAsEqB,CAAQ,CAAE,EAE9G,GAAK9C,GAAY8C,EAAS,OAAQ,IACjCC,EAAK,MAAQD,EAAQ,MAChB,CAAC/C,GAASgD,EAAK,KAAM,GACzB,MAAM,IAAI,UAAWtB,EAAQ,2EAA4E,QAASsB,EAAK,KAAM,CAAE,CAGlI,CACA,YAAK,MAAQL,EACb,KAAK,SAAWC,EAChB,KAAK,SAAWC,EAChB,KAAK,UAAY,CAChB,OAAUC,EAAS,MACpB,EACA,KAAK,MAAQE,EACN,IACR,CA2CA9D,EAAawD,EAAO,UAAW,WAAY,SAAmBF,EAAOU,EAAQC,EAAQJ,EAAU,CAC9F,IAAIjB,EACAa,EACAK,EACAI,EACAC,EACAC,EACAb,EACAc,EACAxB,EACAyB,EACAP,EACAQ,EACAC,EACAC,EACAzB,EAEJ,GAAK,CAAC/C,GAA2BqD,CAAM,GAAK,CAACpD,GAAmBoD,CAAM,EACrE,MAAM,IAAI,UAAWd,EAAQ,8GAA+Gc,CAAM,CAAE,EAGrJ,GADAQ,EAAO,CAAC,EACH,UAAU,OAAS,IACvBK,EAAM1B,GAAUqB,EAAM,KAAK,SAAUD,CAAQ,EACxCM,GACJ,MAAMA,EAIR,IADAvB,EAASD,GAAa,CAAEqB,EAAQC,CAAO,CAAE,EACnCjB,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAE/B,GADAe,EAAKnB,EAAQI,CAAE,EAAE,MACZ,CAAChC,EAAU,KAAK,SAAUgC,CAAE,EAAGrB,EAAYoC,CAAG,CAAE,EACpD,MAAM,IAAI,UAAWvB,EAAQ,kGAAmGE,EAAUM,EAAE,CAAE,EAAG7B,EAAM,KAAK,SAAU6B,CAAE,EAAG,MAAO,EAAGe,CAAG,CAAE,EAuB5L,GApBAM,EAAMpB,GAAoBL,CAAO,EAC5ByB,EACJzB,EAASO,GAAkBP,CAAO,EAElCA,EAASS,GAAqBC,EAAOV,CAAO,EAE7C4B,EAAK5B,EAAQ,CAAE,EACf6B,EAAK7B,EAAQ,CAAE,EACfa,EAAO,KAAK,MACZM,EAAKD,EAAK,OAASlC,GAAsB4C,EAAG,MAAOC,EAAG,MAAO,KAAK,UAAU,MAAO,EAC9EX,EAAK,MACTP,EAAMO,EAAK,MACAO,EACXd,EAAM,KAAK,MAAM,MAGjBA,EAAMiB,EAAG,MAGVJ,EAAMvC,GAAOyB,CAAM,EACdc,IAAQ,EAEZ,OAAKd,EAAM,SAAW,GAErBY,EAAMpC,EAAQiC,EAAI,CAAE,EACf1B,GAAiB6B,CAAI,EACzBI,EAAMhC,GAAgByB,CAAG,EAEzBO,EAAM/B,GAAQwB,CAAG,EAElBO,EAAKJ,EAAK,EAAGT,EAAMe,EAAG,MAAOC,EAAG,KAAM,CAAE,EACxCF,EAAK,CAAE,CAAE,IAGTL,EAAMpC,EAAQiC,EAAIK,CAAI,EACtBG,EAAK9C,EAAe6B,EAAOC,CAAI,GAEzB,IAAIpB,EAAS4B,EAAIG,EAAKZ,EAAOiB,EAAI,EAAGhB,EAAKO,CAAK,EAGtD,GAAKO,EACJ,OAAK1D,GAAiBoD,EAAI,SAAU,EACnCG,EAAMjD,GAAUmD,EAAKM,CAAQ,GAE7BR,EAAMpC,EAAQiC,EAAIK,CAAI,EACtB/C,GAAgB,CAAE6C,CAAI,EAAG,CAAEE,CAAI,EAAG,CAAE,CAAE,EAAGM,CAAQ,GAElDH,EAAK9C,EAAe6B,EAAOC,CAAI,EACxB,IAAIpB,EAAS4B,EAAIG,EAAKZ,EAAOiB,EAAI,EAAGhB,EAAKO,CAAK,EAKtD,OAAAI,EAAMpC,EAAQiC,EAAIK,CAAI,EAGtBG,EAAK9C,EAAe6B,EAAOC,CAAI,EAC/BV,EAAM,IAAIV,EAAS4B,EAAIG,EAAKZ,EAAOiB,EAAI,EAAGhB,EAAKO,CAAK,EAGpDxC,EAAQ,CAAEkD,EAAG,MAAOC,EAAG,MAAO5B,CAAI,EAAGY,CAAK,EAEnCZ,EAQP,SAAS6B,GAAU,CAClB,OAAOjB,EAAMe,EAAG,MAAOC,EAAG,KAAM,CACjC,CACD,CAAC,EAyCDzE,EAAawD,EAAO,UAAW,SAAU,SAAiBQ,EAAQC,EAAQpB,EAAM,CAC/E,IAAID,EACA+B,EACAC,EACArB,EACAsB,EACA/B,EACAE,EAEJ,GAAK,CAAC7C,EAAe0C,CAAI,EACxB,MAAM,IAAI,UAAWL,EAAQ,gFAAiFK,CAAI,CAAE,EAErH,GAAKhC,GAAYgC,CAAI,EACpB,MAAM,IAAI,MAAO,6FAA8F,EAKhH,GAHAgC,EAAK9C,GAAUc,CAAI,EACnBU,EAAMtB,EAAUY,CAAI,EACpB+B,EAAM5C,EAAUa,CAAI,EACf,CAAC7B,EAAU,KAAK,SAAUW,EAAYiD,CAAI,CAAE,EAChD,MAAM,IAAI,UAAWpC,EAAQ,kGAAmGE,EAAU,CAAE,EAAGvB,EAAM,KAAK,SAAU,MAAO,EAAGyD,CAAI,CAAE,EAGrL,IADAhC,EAAS,CAAEoB,EAAQC,CAAO,EACpBjB,EAAI,EAAGA,EAAIJ,EAAO,OAAQI,IAAM,CAyBrC,GAxBAF,EAAIF,EAAQI,CAAE,EAGT5C,EAAU0C,CAAE,GAEhB6B,EAAM,UACN7B,EAAItB,EAAiBsB,EAAG6B,EAAKE,EAAItB,CAAI,GAC1BjD,EAAewC,CAAE,GACvBA,EAAE,aAAe,EACrB6B,EAAM,YAENA,EAAM,aAGP7B,EAAItB,EAAiBsB,EAAG6B,EAAKE,EAAItB,CAAI,GAC1BpD,EAAe2C,CAAE,GAE5B6B,EAAM3C,EAAUc,CAAE,EAClBA,EAAIvB,EAAWuB,EAAG+B,CAAG,IAGrBF,EAAM,UACN7B,EAAItB,EAAiBsB,EAAG6B,EAAKE,EAAItB,CAAI,GAEjC,CAACvC,EAAU,KAAK,SAAUgC,CAAE,EAAGrB,EAAYgD,CAAI,CAAE,EACrD,MAAM,IAAI,UAAWnC,EAAQ,kGAAmGE,EAAUM,CAAE,EAAG7B,EAAM,KAAK,SAAU6B,CAAE,EAAG,MAAO,EAAG2B,CAAI,CAAE,EAE1L/B,EAAQI,CAAE,EAAIF,CACf,CAEA,OAAAF,EAAO,KAAMC,CAAI,EACjBvB,EAAQsB,EAAQ,KAAK,KAAM,EAEpBC,CACR,CAAC,EAKD9C,EAAO,QAAUyD,ICvhBjB,IAAIsB,GAAO,IAKX,OAAO,QAAUA", - "names": ["require_validate", "__commonJSMin", "exports", "module", "isObject", "hasOwnProp", "contains", "join", "resolveStr", "format", "validate", "opts", "dtypes", "options", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isNonNegativeIntegerArray", "isEmptyCollection", "isndarrayLike", "isNumber", "isFunction", "isComplexLike", "isPlainObject", "isObject", "isCollection", "isDataType", "isEqualDataType", "isOutputDataTypePolicy", "isReadOnly", "isOrder", "hasOwnProp", "contains", "filledBy", "everyBy", "join", "copy", "nullaryStrided", "binary", "broadcast", "broadcastScalar", "shape2strides", "dtypes2strings", "resolveStr", "binaryOutputDataType", "numel", "buffer", "getShape", "getDType", "getOrder", "ndims", "ndarray", "defaults", "isAccessorArray", "accessorSetter", "setter", "format", "validate", "ORDINALS", "initialScan", "params", "out", "p", "o", "i", "isScalarCompatible", "count", "convertToScalars", "resolveOrder", "broadcastParameters", "shape", "ord", "Random", "prng", "idtypes", "odtypes", "policies", "options", "opts", "dt", "param1", "param2", "buf", "err", "len", "FLG", "set", "st", "p1", "p2", "wrapper", "pdt", "odt", "sh", "main"] -} diff --git a/docs/repl.txt b/docs/repl.txt deleted file mode 100644 index 1ef8b35..0000000 --- a/docs/repl.txt +++ /dev/null @@ -1,131 +0,0 @@ - -{{alias}}( prng, idtypes, odtypes, policies[, options] ) - Returns an interface for creating ndarrays filled with pseudorandom values - drawn from a binary PRNG. - - Parameters - ---------- - prng: Function - Binary pseudorandom value generator. - - idtypes: Array> - List containing a list of supported input data types for each PRNG - parameter. - - odtypes: Array - List of supported output data types. - - policies: Object - Interface policies. Must have the following properties: - - - output: output data type policy. - - options: Object (optional) - Function options. - - options.order: string (optional) - Default memory layout. - - Returns - ------- - out: Object - Instance having methods for generating pseudorandom values. - - Examples - -------- - > var dts = [ 'float64', 'float32', 'generic' ]; - > var p = { 'output': 'real_floating_point_and_generic' }; - > var r = {{alias:@stdlib/random/base/uniform}}; - > var out = new {{alias}}( r, [ dts, dts ], dts, p ); - - -{{alias}}.prototype.generate( shape, param1, param2[, options] ) - Returns an ndarray filled with pseudorandom values drawn from a binary PRNG. - - Parameters - ---------- - shape: Array - Output shape. - - param1: ndarray|any - First PRNG parameter. If an ndarray, must be broadcast compatible with - the specified output shape. - - param2: ndarray|any - Second PRNG parameter. If an ndarray, must be broadcast compatible with - the specified output shape. - - options: Object (optional) - Function options. - - options.dtype: string|DataType (optional) - Output data type. Setting this option overrides the output data type - policy. - - options.order: string (optional) - Output memory layout. Setting this option overrides the default memory - layout order. - - options.mode: string (optional) - Specifies how to handle indices which exceed ndarray dimensions. - - options.submode: string (optional) - Specifies how to handle subscripts which exceed ndarray dimensions on a - per dimension basis. - - options.readonly: string (optional) - Boolean indicating whether an ndarray should be read-only. - - Returns - ------- - out: ndarray - Output ndarray. - - Examples - -------- - > var dts = [ 'float64', 'float32', 'generic' ]; - > var p = { 'output': 'real_floating_point_and_generic' }; - > var r = {{alias:@stdlib/random/base/uniform}}; - > var f = new {{alias}}( r, [ dts, dts ], dts, p ); - > var y = f.generate( [ 2, 2 ], 0.0, 1.0 ); - > {{alias:@stdlib/ndarray/to-array}}( y ) - [...] - - -{{alias}}.prototype.assign( param1, param2, out ) - Fills an ndarray with pseudorandom values drawn from a binary PRNG. - - Parameters - ---------- - param1: ndarray|any - First PRNG parameter. If an ndarray, must be broadcast compatible with - the output ndarray. - - param2: ndarray|any - Second PRNG parameter. If an ndarray, must be broadcast compatible with - the output ndarray. - - out: ndarray - Output ndarray. - - Returns - ------- - out: ndarray - Output array. - - Examples - -------- - > var dts = [ 'float64', 'float32', 'generic' ]; - > var p = { 'output': 'real_floating_point_and_generic' }; - > var r = {{alias:@stdlib/random/base/uniform}}; - > var f = new {{alias}}( r, [ dts, dts ], dts, p ); - > var out = {{alias:@stdlib/ndarray/zeros}}( [ 2, 2 ] ); - > var y = f.assign( 0.0, 1.0, out ); - > {{alias:@stdlib/ndarray/to-array}}( y ) - [...] - > var bool = ( out === y ) - true - - See Also - -------- - diff --git a/docs/types/index.d.ts b/docs/types/index.d.ts deleted file mode 100644 index 5e47761..0000000 --- a/docs/types/index.d.ts +++ /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-doctest-alias: Random - -// TypeScript Version: 4.1 - -/// - -import { DataType, Order, Mode, Shape, OutputPolicy, typedndarray } from '@stdlib/types/ndarray'; -import { ArrayLike } from '@stdlib/types/array'; -import { PRNG } from '@stdlib/types/random'; - -/** -* Interface defining constructor options. -*/ -interface ConstructorOptions { - /** - * Default memory layout. - */ - order?: Order; -} - -/** -* Interface defining options. -*/ -interface Options { - /** - * Output ndarray data type. - * - * ## Notes - * - * - Setting this option overrides the output data type policy. - */ - dtype?: DataType; - - /** - * Memory layout. - * - * ## Notes - * - * - Setting this option overrides the default memory layout. - */ - order?: Order; - - /** - * Specifies how to handle indices which exceed ndarray dimensions. - */ - mode?: Mode; - - /** - * Specifies how to handle subscripts which exceed ndarray dimensions on a per dimension basis. - */ - submode?: ArrayLike; - - /** - * Boolean indicating whether an ndarray should be read-only. - */ - readonly?: boolean; -} - -/** -* Interface defining class policies. -*/ -interface Policies { - /** - * Output data type policy. - */ - output: OutputPolicy; -} - -/** -* Interface for generating pseudorandom values drawn from a binary PRNG. -*/ -interface BinaryPRNG extends PRNG { - /** - * Returns a pseudorandom value. - * - * @param param1 - first PRNG parameter - * @param param2 - second PRNG parameter - * @returns pseudorandom value - */ - ( param1: T, param2: U ): V; -} - -/** -* Class for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. -*/ -declare class RandomArray { - /** - * Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. - * - * @param prng - binary pseudorandom value generator - * @param idtypes - list containing a list of supported input data types for each PRNG parameter - * @param odtypes - list of supported output data types - * @param policies - dispatch policies - * @param options - function options - * @returns instance - * - * @example - * var dtypes = require( '@stdlib/ndarray-dtypes' ); - * var uniform = require( '@stdlib/random-base-uniform' ); - * - * var idt = dtypes( 'real_and_generic' ); - * var odt = dtypes( 'real_floating_point_and_generic' ); - * - * var policies = { - * 'output': 'real_floating_point_and_generic' - * }; - * var options = { - * 'order': 'row-major' - * }; - * - * var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); - * - * var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); - * // returns - */ - constructor( prng: BinaryPRNG, idtypes: [ ArrayLike, ArrayLike ], odtypes: ArrayLike, policies: Policies, options?: ConstructorOptions ); - - /** - * Returns an ndarray filled with pseudorandom values drawn from a binary PRNG. - * - * @param shape - output shape - * @param param1 - first PRNG parameter - * @param param2 - second PRNG parameter - * @param options - function options - * @returns output ndarray - * - * @example - * var dtypes = require( '@stdlib/ndarray-dtypes' ); - * var uniform = require( '@stdlib/random-base-uniform' ); - * - * var idt = dtypes( 'real_and_generic' ); - * var odt = dtypes( 'real_floating_point_and_generic' ); - * - * var policies = { - * 'output': 'real_floating_point_and_generic' - * }; - * var options = { - * 'order': 'row-major' - * }; - * - * var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); - * - * var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); - * // returns - */ - generate( shape: Shape, param1: T | typedndarray, param2: U | typedndarray, options?: Options ): typedndarray; - - /** - * Fills an ndarray with pseudorandom values drawn from a binary PRNG. - * - * @param param1 - first PRNG parameter - * @param param2 - second PRNG parameter - * @param out - output ndarray - * @returns output ndarray - * - * @example - * var dtypes = require( '@stdlib/ndarray-dtypes' ); - * var ndzeros = require( '@stdlib/ndarray-zeros' ); - * var uniform = require( '@stdlib/random-base-uniform' ); - * - * var idt = dtypes( 'real_and_generic' ); - * var odt = dtypes( 'real_floating_point_and_generic' ); - * - * var policies = { - * 'output': 'real_floating_point_and_generic' - * }; - * var options = { - * 'order': 'row-major' - * }; - * - * var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); - * - * var out = ndzeros( [ 2, 2 ] ); - * var v = rand.assign( 0.0, 1.0, out ); - * // returns - * - * var bool = ( v === out ); - * // returns true - */ - assign( param1: T | typedndarray, param2: U | typedndarray, out: typedndarray ): typedndarray; -} - -/** -* Interface defining a constructor which is both "newable" and "callable". -*/ -interface RandomArrayConstructor { - /** - * Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. - * - * @param prng - binary pseudorandom value generator - * @param idtypes - list containing a list of supported input data types for each PRNG parameter - * @param odtypes - list of supported output data types - * @param policies - dispatch policies - * @param options - function options - * @returns instance - * - * @example - * var dtypes = require( '@stdlib/ndarray-dtypes' ); - * var uniform = require( '@stdlib/random-base-uniform' ); - * - * var idt = dtypes( 'real_and_generic' ); - * var odt = dtypes( 'real_floating_point_and_generic' ); - * - * var policies = { - * 'output': 'real_floating_point_and_generic' - * }; - * var options = { - * 'order': 'row-major' - * }; - * - * var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); - * - * var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); - * // returns - */ - new( prng: BinaryPRNG, idtypes: [ ArrayLike, ArrayLike ], odtypes: ArrayLike, policies: Policies, options?: ConstructorOptions ): RandomArray; - - /** - * Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. - * - * @param prng - binary pseudorandom value generator - * @param idtypes - list containing a list of supported input data types for each PRNG parameter - * @param odtypes - list of supported output data types - * @param policies - dispatch policies - * @param options - function options - * @returns instance - * - * @example - * var dtypes = require( '@stdlib/ndarray-dtypes' ); - * var uniform = require( '@stdlib/random-base-uniform' ); - * - * var idt = dtypes( 'real_and_generic' ); - * var odt = dtypes( 'real_floating_point_and_generic' ); - * - * var policies = { - * 'output': 'real_floating_point_and_generic' - * }; - * var options = { - * 'order': 'row-major' - * }; - * - * var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); - * - * var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); - * // returns - */ - ( prng: BinaryPRNG, idtypes: [ ArrayLike, ArrayLike ], odtypes: ArrayLike, policies: Policies, options?: ConstructorOptions ): RandomArray; -} - -/** -* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. -* -* @param prng - binary pseudorandom value generator -* @param idtypes - list containing a list of supported input data types for each PRNG parameter -* @param odtypes - list of supported output data types -* @param policies - dispatch policies -* @param options - function options -* @returns instance -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); -* // returns -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var ndzeros = require( '@stdlib/ndarray-zeros' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var out = ndzeros( [ 2, 2 ] ); -* var v = rand.assign( 0.0, 1.0, out ); -* // returns -* -* var bool = ( v === out ); -* // returns true -*/ -declare var ctor: RandomArrayConstructor; - - -// EXPORTS // - -export = ctor; diff --git a/docs/types/test.ts b/docs/types/test.ts deleted file mode 100644 index ea33c7d..0000000 --- a/docs/types/test.ts +++ /dev/null @@ -1,405 +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. -*/ - -/* eslint-disable @typescript-eslint/no-unused-expressions, space-in-parens */ - -/// - -import { DataType, OutputPolicy } from '@stdlib/types/ndarray'; -import uniform = require( '@stdlib/random-base-uniform' ); -import zeros = require( '@stdlib/ndarray-zeros' ); -import Random = require( './index' ); - - -// TESTS // - -// The function returns an instance for generating arrays of pseudorandom values... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - new Random( uniform, [ dt, dt ], dt, policies ); // $ExpectType RandomArray - new Random( uniform, [ dt, dt ], dt, policies, {} ); // $ExpectType RandomArray - - const random = Random; - random( uniform, [ dt, dt ], dt, policies ); // $ExpectType RandomArray - random( uniform, [ dt, dt ], dt, policies, {} ); // $ExpectType RandomArray -} - -// The compiler throws an error if the function is provided a first argument which is not a PRNG function... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - new Random( '5', [ dt, dt ], dt, policies ); // $ExpectError - new Random( 5, [ dt, dt ], dt, policies ); // $ExpectError - new Random( true, [ dt, dt ], dt, policies ); // $ExpectError - new Random( false, [ dt, dt ], dt, policies ); // $ExpectError - new Random( null, [ dt, dt ], dt, policies ); // $ExpectError - new Random( void 0, [ dt, dt ], dt, policies ); // $ExpectError - new Random( 'abc', [ dt, dt ], dt, policies ); // $ExpectError - new Random( {}, [ dt, dt ], dt, policies ); // $ExpectError - new Random( ( x: number ): number => x, [ dt, dt ], dt, policies ); // $ExpectError - - new Random( '5', [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( 5, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( true, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( false, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( null, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( void 0, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( 'abc', [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( {}, [ dt, dt ], dt, policies, {} ); // $ExpectError - new Random( ( x: number ): number => x, [ dt, dt ], dt, policies, {} ); // $ExpectError - - const random = Random; - random( '5', [ dt, dt ], dt, policies ); // $ExpectError - random( 5, [ dt, dt ], dt, policies ); // $ExpectError - random( true, [ dt, dt ], dt, policies ); // $ExpectError - random( false, [ dt, dt ], dt, policies ); // $ExpectError - random( null, [ dt, dt ], dt, policies ); // $ExpectError - random( void 0, [ dt, dt ], dt, policies ); // $ExpectError - random( 'abc', [ dt, dt ], dt, policies ); // $ExpectError - random( {}, [ dt, dt ], dt, policies ); // $ExpectError - random( ( x: number ): number => x, [ dt, dt ], dt, policies ); // $ExpectError - - random( '5', [ dt, dt ], dt, policies, {} ); // $ExpectError - random( 5, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( true, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( false, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( null, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( void 0, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( 'abc', [ dt, dt ], dt, policies, {} ); // $ExpectError - random( {}, [ dt, dt ], dt, policies, {} ); // $ExpectError - random( ( x: number ): number => x, [ dt, dt ], dt, policies, {} ); // $ExpectError -} - -// The compiler throws an error if the function is provided a second argument which is not a list containing lists of data types... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - new Random( uniform, '5', dt, policies ); // $ExpectError - new Random( uniform, 5, dt, policies ); // $ExpectError - new Random( uniform, true, dt, policies ); // $ExpectError - new Random( uniform, false, dt, policies ); // $ExpectError - new Random( uniform, null, dt, policies ); // $ExpectError - new Random( uniform, void 0, dt, policies ); // $ExpectError - new Random( uniform, 'abc', dt, policies ); // $ExpectError - new Random( uniform, {}, dt, policies ); // $ExpectError - new Random( uniform, ( x: number ): number => x, dt, policies ); // $ExpectError - - new Random( uniform, '5', dt, policies, {} ); // $ExpectError - new Random( uniform, 5, dt, policies, {} ); // $ExpectError - new Random( uniform, true, dt, policies, {} ); // $ExpectError - new Random( uniform, false, dt, policies, {} ); // $ExpectError - new Random( uniform, null, dt, policies, {} ); // $ExpectError - new Random( uniform, void 0, dt, policies, {} ); // $ExpectError - new Random( uniform, 'abc', dt, policies, {} ); // $ExpectError - new Random( uniform, {}, dt, policies, {} ); // $ExpectError - new Random( uniform, ( x: number ): number => x, dt, policies, {} ); // $ExpectError - - const random = Random; - random( uniform, '5', dt, policies ); // $ExpectError - random( uniform, 5, dt, policies ); // $ExpectError - random( uniform, true, dt, policies ); // $ExpectError - random( uniform, false, dt, policies ); // $ExpectError - random( uniform, null, dt, policies ); // $ExpectError - random( uniform, void 0, dt, policies ); // $ExpectError - random( uniform, 'abc', dt, policies ); // $ExpectError - random( uniform, {}, dt, policies ); // $ExpectError - random( uniform, ( x: number ): number => x, dt, policies ); // $ExpectError - - random( uniform, '5', dt, policies, {} ); // $ExpectError - random( uniform, 5, dt, policies, {} ); // $ExpectError - random( uniform, true, dt, policies, {} ); // $ExpectError - random( uniform, false, dt, policies, {} ); // $ExpectError - random( uniform, null, dt, policies, {} ); // $ExpectError - random( uniform, void 0, dt, policies, {} ); // $ExpectError - random( uniform, 'abc', dt, policies, {} ); // $ExpectError - random( uniform, {}, dt, policies, {} ); // $ExpectError - random( uniform, ( x: number ): number => x, dt, policies, {} ); // $ExpectError -} - -// The compiler throws an error if the function is provided a third argument which is not a list of data types... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - new Random( uniform, [ dt, dt ], '5', policies ); // $ExpectError - new Random( uniform, [ dt, dt ], 5, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], true, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], false, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], null, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], void 0, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], 'abc', policies ); // $ExpectError - new Random( uniform, [ dt, dt ], {}, policies ); // $ExpectError - new Random( uniform, [ dt, dt ], ( x: number ): number => x, policies ); // $ExpectError - - new Random( uniform, [ dt, dt ], '5', policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], 5, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], true, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], false, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], null, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], void 0, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], 'abc', policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], {}, policies, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], ( x: number ): number => x, policies, {} ); // $ExpectError - - const random = Random; - random( uniform, [ dt, dt ], '5', policies ); // $ExpectError - random( uniform, [ dt, dt ], 5, policies ); // $ExpectError - random( uniform, [ dt, dt ], true, policies ); // $ExpectError - random( uniform, [ dt, dt ], false, policies ); // $ExpectError - random( uniform, [ dt, dt ], null, policies ); // $ExpectError - random( uniform, [ dt, dt ], void 0, policies ); // $ExpectError - random( uniform, [ dt, dt ], 'abc', policies ); // $ExpectError - random( uniform, [ dt, dt ], {}, policies ); // $ExpectError - random( uniform, [ dt, dt ], ( x: number ): number => x, policies ); // $ExpectError - - random( uniform, [ dt, dt ], '5', policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], 5, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], true, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], false, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], null, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], void 0, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], 'abc', policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], {}, policies, {} ); // $ExpectError - random( uniform, [ dt, dt ], ( x: number ): number => x, policies, {} ); // $ExpectError -} - -// The compiler throws an error if the function is provided a fourth argument which is not a valid policy object... -{ - const dt: Array = [ 'float64', 'float32' ]; - - new Random( uniform, [ dt, dt ], dt, '5' ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, 5 ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, true ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, false ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, null ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, void 0 ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, 'abc' ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, ( x: number ): number => x ); // $ExpectError - - new Random( uniform, [ dt, dt ], dt, '5', {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, 5, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, true, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, false, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, null, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, void 0, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, 'abc', {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, {}, {} ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, ( x: number ): number => x, {} ); // $ExpectError - - const random = Random; - random( uniform, [ dt, dt ], dt, '5' ); // $ExpectError - random( uniform, [ dt, dt ], dt, 5 ); // $ExpectError - random( uniform, [ dt, dt ], dt, true ); // $ExpectError - random( uniform, [ dt, dt ], dt, false ); // $ExpectError - random( uniform, [ dt, dt ], dt, null ); // $ExpectError - random( uniform, [ dt, dt ], dt, void 0 ); // $ExpectError - random( uniform, [ dt, dt ], dt, 'abc' ); // $ExpectError - random( uniform, [ dt, dt ], dt, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, ( x: number ): number => x ); // $ExpectError - - random( uniform, [ dt, dt ], dt, '5', {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, 5, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, true, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, false, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, null, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, void 0, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, 'abc', {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, {}, {} ); // $ExpectError - random( uniform, [ dt, dt ], dt, ( x: number ): number => x, {} ); // $ExpectError -} - -// The compiler throws an error if the function is provided an unsupported number of arguments... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - new Random(); // $ExpectError - new Random( uniform ); // $ExpectError - new Random( uniform, [ dt, dt ] ); // $ExpectError - new Random( uniform, [ dt, dt ], dt ); // $ExpectError - new Random( uniform, [ dt, dt ], dt, policies, {}, {} ); // $ExpectError - - const random = Random; - random(); // $ExpectError - random( uniform ); // $ExpectError - random( uniform, [ dt, dt ] ); // $ExpectError - random( uniform, [ dt, dt ], dt ); // $ExpectError - random( uniform, [ dt, dt ], dt, policies, {}, {} ); // $ExpectError -} - -// The function returns an instance having a `generate` method which returns an ndarray... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.generate( [ 2, 2 ], 0.0, 1.0 ); // $ExpectType typedndarray - r1.generate( [ 2, 2 ], 0.0, 1.0, {} ); // $ExpectType typedndarray - - const random = Random; - const r2 = random( uniform, [ dt, dt ], dt, policies ); - r2.generate( [ 2, 2 ], 0.0, 1.0 ); // $ExpectType typedndarray - r2.generate( [ 2, 2 ], 0.0, 1.0, {} ); // $ExpectType typedndarray -} - -// The compiler throws an error if the `generate` method is provided a first argument which is not a valid shape... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.generate( '5', 0.0, 1.0 ); // $ExpectError - r1.generate( 5, 0.0, 1.0 ); // $ExpectError - r1.generate( true, 0.0, 1.0 ); // $ExpectError - r1.generate( false, 0.0, 1.0 ); // $ExpectError - r1.generate( null, 0.0, 1.0 ); // $ExpectError - r1.generate( void 0, 0.0, 1.0 ); // $ExpectError - r1.generate( [ '5' ], 0.0, 1.0 ); // $ExpectError - r1.generate( {}, 0.0, 1.0 ); // $ExpectError - r1.generate( ( x: number ): number => x, 0.0, 1.0 ); // $ExpectError - - r1.generate( '5', 0.0, 1.0, {} ); // $ExpectError - r1.generate( 5, 0.0, 1.0, {} ); // $ExpectError - r1.generate( true, 0.0, 1.0, {} ); // $ExpectError - r1.generate( false, 0.0, 1.0, {} ); // $ExpectError - r1.generate( null, 0.0, 1.0, {} ); // $ExpectError - r1.generate( void 0, 0.0, 1.0, {} ); // $ExpectError - r1.generate( [ '5' ], 0.0, 1.0, {} ); // $ExpectError - r1.generate( {}, 0.0, 1.0, {} ); // $ExpectError - r1.generate( ( x: number ): number => x, 0.0, 1.0, {} ); // $ExpectError -} - -// The compiler throws an error if the `generate` method is provided a fourth argument which is not an object... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.generate( [ 2,2 ], 0.0, 1.0, '5' ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, true ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, false ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, null ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, [] ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, ( x: number ): number => x ); // $ExpectError -} - -// The compiler throws an error if the `generate` method is provided an invalid `dtype` option... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': '5' } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': 5 } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': true } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': false } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': null } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': [] } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': {} } ); // $ExpectError - r1.generate( [ 2,2 ], 0.0, 1.0, { 'dtype': ( x: number ): number => x } ); // $ExpectError -} - -// The compiler throws an error if the `generate` method is provided an unsupported number of arguments... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.generate(); // $ExpectError - r1.generate( [ 2, 2 ] ); // $ExpectError - r1.generate( [ 2, 2 ], 0.0 ); // $ExpectError - r1.generate( [ 2, 2 ], 0.0, 1.0, {}, {} ); // $ExpectError -} - -// The function returns an instance having an `assign` method which returns an ndarray... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - const x = zeros( [ 5, 5 ], { - 'dtype': 'float64' - }); - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.assign( 0.0, 1.0, x ); // $ExpectType typedndarray - - const random = Random; - const r2 = random( uniform, [ dt, dt ], dt, policies ); - r2.assign( 0.0, 1.0, x ); // $ExpectType typedndarray -} - -// The compiler throws an error if the `assign` method is provided a third argument which is not an ndarray... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.assign( 0.0, 1.0, '5' ); // $ExpectError - r1.assign( 0.0, 1.0, 5 ); // $ExpectError - r1.assign( 0.0, 1.0, true ); // $ExpectError - r1.assign( 0.0, 1.0, false ); // $ExpectError - r1.assign( 0.0, 1.0, null ); // $ExpectError - r1.assign( 0.0, 1.0, void 0 ); // $ExpectError - r1.assign( 0.0, 1.0, {} ); // $ExpectError - r1.assign( 0.0, 1.0, ( x: number ): number => x ); // $ExpectError -} - -// The compiler throws an error if the `assign` method is provided an unsupported number of arguments... -{ - const dt: Array = [ 'float64', 'float32' ]; - const policies = { - 'output': 'same' as OutputPolicy - }; - const x = zeros( [ 5, 5 ], { - 'dtype': 'float64' - }); - - const r1 = new Random( uniform, [ dt, dt ], dt, policies ); - r1.assign(); // $ExpectError - r1.assign( 0.0 ); // $ExpectError - r1.assign( 0.0, 1.0 ); // $ExpectError - r1.assign( 0.0, 1.0, x, {} ); // $ExpectError -} diff --git a/examples/index.js b/examples/index.js deleted file mode 100644 index b692f97..0000000 --- a/examples/index.js +++ /dev/null @@ -1,51 +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 uniform = require( '@stdlib/random-base-uniform' ); -var dtypes = require( '@stdlib/ndarray-dtypes' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var ndarray2array = require( '@stdlib/ndarray-to-array' ); -var Random = require( './../lib' ); - -// Create a new PRNG instance... -var idt = dtypes( 'real_and_generic' ); -var odt = dtypes( 'real_floating_point_and_generic' ); -var policies = { - 'output': 'real_floating_point_and_generic' -}; -var random = new Random( uniform, [ idt, idt ], odt, policies ); - -// Generate a 3x3 matrix of pseudorandom numbers: -var x = random.generate( [ 3, 3 ], 0.0, 1.0 ); -console.log( ndarray2array( x ) ); - -// Generate another matrix with a specified data type: -x = random.generate( [ 3, 3 ], 0.0, 1.0, { - 'dtype': 'float32' -}); -console.log( ndarray2array( x ) ); - -// Define arrays of distribution parameters: -var param1 = new ndarray( 'generic', [ 1.0, 10.0, 100.0 ], [ 3, 1 ], [ 1, 1 ], 0, 'row-major' ); -var param2 = new ndarray( 'generic', [ 2.0, 20.0, 200.0 ], [ 3, 1 ], [ 1, 1 ], 0, 'row-major' ); - -// Broadcast the parameters to generate another 3x3 matrix of pseudorandom numbers: -x = random.generate( [ 3, 3 ], param1, param2 ); -console.log( ndarray2array( x ) ); diff --git a/index.js b/index.js new file mode 100644 index 0000000..a9fa8c2 --- /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(t,e){"object"==typeof exports&&"undefined"!=typeof module?module.exports=e(require("buffer")):"function"==typeof define&&define.amd?define(["buffer"],e):(t="undefined"!=typeof globalThis?globalThis:t||self).Random=e(t.require$$0)}(this,(function(t){"use strict";var e="function"==typeof Object.defineProperty?Object.defineProperty:null;var n=Object.defineProperty;function r(t){return"number"==typeof t}function i(t){var e,n="";for(e=0;e0&&(n-=1),r=t.toExponential(n)):r=t.toPrecision(e.precision),e.alternate||(r=p.call(r,v,"$1e"),r=p.call(r,b,"e"),r=p.call(r,y,""));break;default:throw new Error("invalid double notation. Value: "+e.specifier)}return r=p.call(r,h,"e+0$1"),r=p.call(r,g,"e-0$1"),e.alternate&&(r=p.call(r,d,"$1."),r=p.call(r,m,"$1.e")),t>=0&&e.sign&&(r=e.sign+r),r=e.specifier===c.call(e.specifier)?c.call(r):l.call(r)}function _(t){var e,n="";for(e=0;e127)throw new Error("invalid character code. Value: "+i.arg);i.arg=T(u)?String(i.arg):x(u)}break;case"e":case"E":case"f":case"F":case"g":case"G":if(e||(i.precision=6),c=parseFloat(i.arg),!isFinite(c)){if(!r(i.arg))throw new Error("invalid floating-point number. Value: "+s);c=i.arg,i.padZeros=!1}i.arg=w(c,i);break;default:throw new Error("invalid specifier: "+i.specifier)}i.maxWidth>=0&&i.arg.length>i.maxWidth&&(i.arg=i.arg.substring(0,i.maxWidth)),i.padZeros?i.arg=o(i.arg,i.width||i.precision,i.padRight):i.width&&(i.arg=(g=i.arg,d=i.width,m=i.padRight,y=void 0,(y=d-g.length)<0?g:g=m?g+_(y):_(y)+g)),s+=i.arg||"",l+=1}return s}var j=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function A(t){var e={mapping:t[1]?parseInt(t[1],10):void 0,flags:t[2],width:t[3],precision:t[5],specifier:t[6]};return"."===t[4]&&void 0===t[5]&&(e.precision="1"),e}function S(t){var e,n,r,i;for(n=[],i=0,r=j.exec(t);r;)(e=t.slice(i,j.lastIndex-r[0].length)).length&&n.push(e),"%"===r[6]?n.push("%"):n.push(A(r)),i=j.lastIndex,r=j.exec(t);return(e=t.slice(i)).length&&n.push(e),n}function L(t){var e,n;if("string"!=typeof t)throw new TypeError(L("invalid argument. First argument must be a string. Value: `%s`.",t));for(e=[S(t)],n=1;net&&rt(t)}function ot(t){return C(t)&&it(t)}function at(t){return H(t)&&it(t.valueOf())}function ut(t){return ot(t)||at(t)}function ft(t){return ot(t)&&t>=0}function st(t){return at(t)&&t.valueOf()>=0}function lt(t){return ft(t)||st(t)}P(ut,"isPrimitive",ot),P(ut,"isObject",at),P(lt,"isPrimitive",ft),P(lt,"isObject",st);var ct=4294967295;function pt(t){if("function"!=typeof t)throw new TypeError(L("invalid argument. Must provide a function. Value: `%s`.",t));return function(e){var n,r;if(!function(t){return null!=t&&"function"!=typeof t&&"number"==typeof t.length&&rt(t.length)&&t.length>=0&&t.length<=ct}(e))return!1;if(0===(n=e.length))return!1;for(r=0;r0}function Mt(t){return at(t)&&t.valueOf()>0}function Ut(t){return Bt(t)||Mt(t)}function Nt(t){return Object.keys(Object(t))}P(kt,"isPrimitive",Lt),P(kt,"isObject",Rt),P(Ut,"isPrimitive",Bt),P(Ut,"isObject",Mt);var Pt,Ct=void 0!==Object.keys;function Yt(t){return"[object Arguments]"===Z(t)}Pt=function(){return Yt(arguments)}();var zt=Pt;function Dt(t){return t!=t}function Jt(t){return C(t)&&Dt(t)}function $t(t){return H(t)&&Dt(t.valueOf())}function Wt(t){return Jt(t)||$t(t)}P(Wt,"isPrimitive",Jt),P(Wt,"isObject",$t);var Gt=Object.prototype.propertyIsEnumerable;var Zt=!Gt.call("beep","0");function qt(t,e){var n;return null!=t&&(!(n=Gt.call(t,e))&&Zt&&kt(t)?!Jt(e=+e)&&ot(e)&&e>=0&&e=0&&t.length<=Xt&&$(t,"callee")&&!qt(t,"callee")},Qt=Array.prototype.slice;function te(t){if("function"!=typeof t)throw new TypeError(L("invalid argument. Must provide a function. Value: `%s`.",t));return function(e){var n,r;if(!Kt(e))return!1;if(0===(n=e.length))return!1;for(r=0;r=0&&t.length<=ie}function ae(t,e,n){var r,i;if(!oe(t)&&!Lt(t))throw new TypeError(L("invalid argument. First argument must be an array-like object. Value: `%s`.",t));if(0===(r=t.length))return-1;if(3===arguments.length){if(!ot(n))throw new TypeError(L("invalid argument. Third argument must be an integer. Value: `%s`.",n));if(n>=0){if(n>=r)return-1;i=n}else(i=r+n)<0&&(i=0)}else i=0;if(Wt(e)){for(;i0&&!$(t,"0"))for(u=0;u1){if(!Ie(e))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",e));if($(e,"duplicates")&&!mt(s=e.duplicates))throw new TypeError(L("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",s))}if(r=(n=Ee(t)).length,a={},s)for(f=0;fi&&(r=!1),!r&&!e)return 0;i=o}return r&&e?3:r?1:2}var Ce="function";function Ye(t){return typeof t.get===Ce&&typeof t.set===Ce}var ze={float64:function(t,e){return t[e]},float32:function(t,e){return t[e]},int32:function(t,e){return t[e]},int16:function(t,e){return t[e]},int8:function(t,e){return t[e]},uint32:function(t,e){return t[e]},uint16:function(t,e){return t[e]},uint8:function(t,e){return t[e]},uint8c:function(t,e){return t[e]},generic:function(t,e){return t[e]},default:function(t,e){return t[e]}};function De(t){var e=ze[t];return"function"==typeof e?e:ze.default}var Je={float64:function(t,e,n){t[e]=n},float32:function(t,e,n){t[e]=n},int32:function(t,e,n){t[e]=n},int16:function(t,e,n){t[e]=n},int8:function(t,e,n){t[e]=n},uint32:function(t,e,n){t[e]=n},uint16:function(t,e,n){t[e]=n},uint8:function(t,e,n){t[e]=n},uint8c:function(t,e,n){t[e]=n},generic:function(t,e,n){t[e]=n},default:function(t,e,n){t[e]=n}};function $e(t){var e=Je[t];return"function"==typeof e?e:Je.default}var We={complex128:function(t,e){return t.get(e)},complex64:function(t,e){return t.get(e)},default:function(t,e){return t.get(e)}};function Ge(t){var e=We[t];return"function"==typeof e?e:We.default}var Ze={complex128:function(t,e,n){t.set(n,e)},complex64:function(t,e,n){t.set(n,e)},default:function(t,e,n){t.set(n,e)}};function qe(t){var e=Ze[t];return"function"==typeof e?e:Ze.default}var Ke={Float32Array:"float32",Float64Array:"float64",Array:"generic",Int16Array:"int16",Int32Array:"int32",Int8Array:"int8",Uint16Array:"uint16",Uint32Array:"uint32",Uint8Array:"uint8",Uint8ClampedArray:"uint8c",Complex64Array:"complex64",Complex128Array:"complex128",BooleanArray:"bool"},Xe="function"==typeof Float64Array;var He="function"==typeof Float64Array?Float64Array:null;function Qe(){var t,e,n;if("function"!=typeof He)return!1;try{e=new He([1,3.14,-3.14,NaN]),n=e,t=(Xe&&n instanceof Float64Array||"[object Float64Array]"===Z(n))&&1===e[0]&&3.14===e[1]&&-3.14===e[2]&&e[3]!=e[3]}catch(e){t=!1}return t}var tn="function"==typeof Float64Array?Float64Array:void 0;var en=Qe()?tn:function(){throw new Error("not implemented")},nn="function"==typeof Float32Array;var rn="function"==typeof Float32Array?Float32Array:null;var on,an="function"==typeof Float32Array?Float32Array:void 0;on=function(){var t,e,n;if("function"!=typeof rn)return!1;try{e=new rn([1,3.14,-3.14,5e40]),n=e,t=(nn&&n instanceof Float32Array||"[object Float32Array]"===Z(n))&&1===e[0]&&3.140000104904175===e[1]&&-3.140000104904175===e[2]&&e[3]===tt}catch(e){t=!1}return t}()?an:function(){throw new Error("not implemented")};var un=on,fn="function"==typeof Uint32Array;var sn="function"==typeof Uint32Array?Uint32Array:null;var ln,cn="function"==typeof Uint32Array?Uint32Array:void 0;ln=function(){var t,e,n;if("function"!=typeof sn)return!1;try{e=new sn(e=[1,3.14,-3.14,Xt+1,Xt+2]),n=e,t=(fn&&n instanceof Uint32Array||"[object Uint32Array]"===Z(n))&&1===e[0]&&3===e[1]&&e[2]===Xt-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?cn:function(){throw new Error("not implemented")};var pn=ln,hn="function"==typeof Int32Array;var gn=2147483647,dn=-2147483648,mn="function"==typeof Int32Array?Int32Array:null;var yn,bn="function"==typeof Int32Array?Int32Array:void 0;yn=function(){var t,e,n;if("function"!=typeof mn)return!1;try{e=new mn([1,3.14,-3.14,gn+1]),n=e,t=(hn&&n instanceof Int32Array||"[object Int32Array]"===Z(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===dn}catch(e){t=!1}return t}()?bn:function(){throw new Error("not implemented")};var vn=yn,wn="function"==typeof Uint16Array;var _n=65535,xn="function"==typeof Uint16Array?Uint16Array:null;var En,Tn="function"==typeof Uint16Array?Uint16Array:void 0;En=function(){var t,e,n;if("function"!=typeof xn)return!1;try{e=new xn(e=[1,3.14,-3.14,_n+1,_n+2]),n=e,t=(wn&&n instanceof Uint16Array||"[object Uint16Array]"===Z(n))&&1===e[0]&&3===e[1]&&e[2]===_n-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?Tn:function(){throw new Error("not implemented")};var Vn=En,On="function"==typeof Int16Array;var jn=32767,An=-32768,Sn="function"==typeof Int16Array?Int16Array:null;var Ln,Fn="function"==typeof Int16Array?Int16Array:void 0;Ln=function(){var t,e,n;if("function"!=typeof Sn)return!1;try{e=new Sn([1,3.14,-3.14,jn+1]),n=e,t=(On&&n instanceof Int16Array||"[object Int16Array]"===Z(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===An}catch(e){t=!1}return t}()?Fn:function(){throw new Error("not implemented")};var In=Ln,Rn="function"==typeof Uint8Array;var kn=255,Bn="function"==typeof Uint8Array?Uint8Array:null;var Mn,Un="function"==typeof Uint8Array?Uint8Array:void 0;Mn=function(){var t,e,n;if("function"!=typeof Bn)return!1;try{e=new Bn(e=[1,3.14,-3.14,kn+1,kn+2]),n=e,t=(Rn&&n instanceof Uint8Array||"[object Uint8Array]"===Z(n))&&1===e[0]&&3===e[1]&&e[2]===kn-2&&0===e[3]&&1===e[4]}catch(e){t=!1}return t}()?Un:function(){throw new Error("not implemented")};var Nn=Mn,Pn="function"==typeof Uint8ClampedArray;var Cn="function"==typeof Uint8ClampedArray?Uint8ClampedArray:null;var Yn,zn="function"==typeof Uint8ClampedArray?Uint8ClampedArray:void 0;Yn=function(){var t,e,n;if("function"!=typeof Cn)return!1;try{e=new Cn([-1,0,1,3.14,4.99,255,256]),n=e,t=(Pn&&n instanceof Uint8ClampedArray||"[object Uint8ClampedArray]"===Z(n))&&0===e[0]&&0===e[1]&&1===e[2]&&3===e[3]&&5===e[4]&&255===e[5]&&255===e[6]}catch(e){t=!1}return t}()?zn:function(){throw new Error("not implemented")};var Dn=Yn,Jn="function"==typeof Int8Array;var $n=127,Wn=-128,Gn="function"==typeof Int8Array?Int8Array:null;var Zn,qn="function"==typeof Int8Array?Int8Array:void 0;Zn=function(){var t,e,n;if("function"!=typeof Gn)return!1;try{e=new Gn([1,3.14,-3.14,$n+1]),n=e,t=(Jn&&n instanceof Int8Array||"[object Int8Array]"===Z(n))&&1===e[0]&&3===e[1]&&-3===e[2]&&e[3]===Wn}catch(e){t=!1}return t}()?qn:function(){throw new Error("not implemented")};var Kn=Zn;function Xn(t){return"object"==typeof t&&null!==t&&"number"==typeof t.length&&rt(t.length)&&t.length>=0&&t.length<=ct}var Hn="function"==typeof ArrayBuffer;function Qn(t){return Hn&&t instanceof ArrayBuffer||"[object ArrayBuffer]"===Z(t)}var tr=te(kt.isPrimitive),er=te(kt.isObject),nr=te(kt);function rr(t,e,n){N(t,e,{configurable:!1,enumerable:!0,writable:!1,value:n})}function ir(t,e){if(!(this instanceof ir))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!C(t))throw new TypeError(L("invalid argument. Real component must be a number. Value: `%s`.",t));if(!C(e))throw new TypeError(L("invalid argument. Imaginary component must be a number. Value: `%s`.",e));return rr(this,"re",t),rr(this,"im",e),this}P(nr,"primitives",tr),P(nr,"objects",er),P(ir,"name","Complex128"),P(ir,"BYTES_PER_ELEMENT",8),P(ir.prototype,"BYTES_PER_ELEMENT",8),P(ir.prototype,"byteLength",16),P(ir.prototype,"toString",(function(){var t=""+this.re;return this.im<0?t+=" - "+-this.im:t+=" + "+this.im,t+="i"})),P(ir.prototype,"toJSON",(function(){var t={type:"Complex128"};return t.re=this.re,t.im=this.im,t}));var or="function"==typeof Math.fround?Math.fround:null,ar=new un(1);var ur="function"==typeof or?or:function(t){return ar[0]=t,ar[0]};function fr(t,e){if(!(this instanceof fr))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!C(t))throw new TypeError(L("invalid argument. Real component must be a number. Value: `%s`.",t));if(!C(e))throw new TypeError(L("invalid argument. Imaginary component must be a number. Value: `%s`.",e));return rr(this,"re",ur(t)),rr(this,"im",ur(e)),this}function sr(t){return t instanceof ir||t instanceof fr||"object"==typeof t&&null!==t&&"number"==typeof t.re&&"number"==typeof t.im}function lr(t){return rt(t/2)}P(fr,"name","Complex64"),P(fr,"BYTES_PER_ELEMENT",4),P(fr.prototype,"BYTES_PER_ELEMENT",4),P(fr.prototype,"byteLength",8),P(fr.prototype,"toString",(function(){var t=""+this.re;return this.im<0?t+=" - "+-this.im:t+=" + "+this.im,t+="i"})),P(fr.prototype,"toJSON",(function(){var t={type:"Complex64"};return t.re=this.re,t.im=this.im,t}));var cr=8;function pr(t){return"object"==typeof t&&null!==t&&"Complex64Array"===t.constructor.name&&t.BYTES_PER_ELEMENT===cr}var hr=16;function gr(t){return"object"==typeof t&&null!==t&&"Complex128Array"===t.constructor.name&&t.BYTES_PER_ELEMENT===hr}function dr(){return"function"==typeof W&&"symbol"==typeof W("foo")&&$(W,"iterator")&&"symbol"==typeof W.iterator}var mr=dr()?Symbol.iterator:null;function yr(t){return t.re}function br(t){return t.im}function vr(t,e){return new un(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,2*(t.length-e))}function wr(t,e){return new en(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,2*(t.length-e))}function _r(t){var e,n,r;for(e=[];!(n=t.next()).done;)if(Xn(r=n.value)&&r.length>=2)e.push(r[0],r[1]);else{if(!sr(r))return new TypeError(L("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",r));e.push(yr(r),br(r))}return e}var xr=2*un.BYTES_PER_ELEMENT,Er=dr();function Tr(t){return t instanceof jr||"object"==typeof t&&null!==t&&("Complex64Array"===t.constructor.name||"Complex128Array"===t.constructor.name)&&"number"==typeof t._length&&"object"==typeof t._buffer}function Vr(t){return t===jr||"Complex128Array"===t.name}function Or(t,e){return new fr(t[e*=2],t[e+1])}function jr(){var t,e,n,r;if(e=arguments.length,!(this instanceof jr))return 0===e?new jr:1===e?new jr(arguments[0]):2===e?new jr(arguments[0],arguments[1]):new jr(arguments[0],arguments[1],arguments[2]);if(0===e)n=new un(0);else if(1===e)if(ft(arguments[0]))n=new un(2*arguments[0]);else if(oe(arguments[0]))if((r=(n=arguments[0]).length)&&Kt(n)&&sr(n[0])){if(n=function(t,e){var n,r,i,o;for(n=e.length,o=0,i=0;in.byteLength-t)throw new RangeError(L("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*xr));n=new un(n,t,2*r)}}return P(this,"_buffer",n),P(this,"_length",n.length/2),this}function Ar(t){return t.re}function Sr(t){return t.im}function Lr(t){var e,n,r;for(e=[];!(n=t.next()).done;)if(Xn(r=n.value)&&r.length>=2)e.push(r[0],r[1]);else{if(!sr(r))return new TypeError(L("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",r));e.push(Ar(r),Sr(r))}return e}P(jr,"BYTES_PER_ELEMENT",xr),P(jr,"name","Complex64Array"),P(jr,"from",(function(t){var e,n,r,i,o,a,u,f,s,l,c,p;if(!Ve(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Vr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!Ve(r=arguments[1]))throw new TypeError(L("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(Tr(t)){if(f=t.length,r){for(o=(i=new this(f))._buffer,p=0,c=0;c=2))throw new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[p]=l[0],o[p+1]=l[1]}p+=2}return i}return new this(t)}if(oe(t)){if(r){for(f=t.length,u=t.get&&t.set?Ge("default"):De("default"),c=0;c=2))throw new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[p]=l[0],o[p+1]=l[1]}p+=2}return i}return new this(t)}if(Te(t)&&Er&&Ve(t[mr])){if(!Ve((o=t[mr]()).next))throw new TypeError(L("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",t));if(a=r?function(t,e,n){var r,i,o,a;for(r=[],a=-1;!(i=t.next()).done;)if(a+=1,Xn(o=e.call(n,i.value,a))&&o.length>=2)r.push(o[0],o[1]);else{if(!sr(o))return new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));r.push(yr(o),br(o))}return r}(o,r,e):_r(o),a instanceof Error)throw a;for(o=(i=new this(f=a.length/2))._buffer,c=0;c=this._length))return Or(this._buffer,t)})),St(jr.prototype,"buffer",(function(){return this._buffer.buffer})),St(jr.prototype,"byteLength",(function(){return this._buffer.byteLength})),St(jr.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),P(jr.prototype,"BYTES_PER_ELEMENT",jr.BYTES_PER_ELEMENT),P(jr.prototype,"copyWithin",(function(t,e){if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*t,2*e):this._buffer.copyWithin(2*t,2*e,2*arguments[2]),this})),P(jr.prototype,"entries",(function(){var t,e,n,r,i,o;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,o=-1,P(e={},"next",(function(){if(o+=1,i||o>=n)return{done:!0};return{value:[o,Or(r,o)],done:!1}})),P(e,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(e,mr,(function(){return t.entries()})),e})),P(jr.prototype,"every",(function(t,e){var n,r;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!rt(n))throw new TypeError(L("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(a=yr(t),u=br(t),f=e;f=0;r--)if(i=Or(n,r),t.call(e,i,r,this))return i})),P(jr.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=this._length-1;r>=0;r--)if(i=Or(n,r),t.call(e,i,r,this))return r;return-1})),P(jr.prototype,"forEach",(function(t,e){var n,r,i;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return Or(this._buffer,t)})),P(jr.prototype,"includes",(function(t,e){var n,r,i,o,a;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!sr(t))throw new TypeError(L("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=yr(t),o=br(t),n=this._buffer,a=e;a1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=yr(t),o=br(t),n=this._buffer,a=e;a=n)return{done:!0};return{value:i,done:!1}})),P(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(e,mr,(function(){return t.keys()})),e})),P(jr.prototype,"lastIndexOf",(function(t,e){var n,r,i,o,a;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!sr(t))throw new TypeError(L("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(i=yr(t),o=br(t),n=this._buffer,a=e;a>=0;a--)if(i===n[r=2*a]&&o===n[r+1])return a;return-1})),St(jr.prototype,"length",(function(){return this._length})),P(jr.prototype,"map",(function(t,e){var n,r,i,o,a;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(r=this._buffer,n=(i=new this.constructor(this._length))._buffer,o=0;o1)r=e,o=0;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Or(n,0),o=1}for(;o1)r=e,o=i-1;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Or(n,i-1),o=i-2}for(;o>=0;o--)r=t(r,Or(n,o),o,this);return r})),P(jr.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=this._buffer,r=nt(n/2),i=0;i1){if(!ft(n=arguments[1]))throw new TypeError(L("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(sr(t)){if(n>=this._length)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return r[n*=2]=yr(t),void(r[n+1]=br(t))}if(Tr(t)){if(n+(a=t._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t._buffer,s=r.byteOffset+n*xr,e.buffer===r.buffer&&e.byteOffsets){for(i=new un(e.length),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t,s=r.byteOffset+n*xr,e.buffer===r.buffer&&e.byteOffsets){for(i=new un(a),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,f=0;fu&&(e=u)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*xr):(i=e-t,n=r.byteOffset+t*xr),new this.constructor(r.buffer,n,i<0?0:i)})),P(jr.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)r=[];else{if(!Lt(t)&&!tr(t))throw new TypeError(L("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Te(e))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:Or(i,o),done:!1}})),P(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(t,mr,(function(){return e.values()})),t})),P(jr.prototype,"with",(function(t,e){var n,r,i;if(!Tr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!rt(t))throw new TypeError(L("invalid argument. First argument must be an integer. Value: `%s`.",t));if(i=this._length,t<0&&(t+=i),t<0||t>=i)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!sr(e))throw new TypeError(L("invalid argument. Second argument must be a complex number. Value: `%s`.",e));return(n=(r=new this.constructor(this._buffer))._buffer)[2*t]=yr(e),n[2*t+1]=br(e),r}));var Fr=2*en.BYTES_PER_ELEMENT,Ir=dr();function Rr(t){return t instanceof Mr||"object"==typeof t&&null!==t&&("Complex64Array"===t.constructor.name||"Complex128Array"===t.constructor.name)&&"number"==typeof t._length&&"object"==typeof t._buffer}function kr(t){return t===Mr||"Complex64Array"===t.name}function Br(t,e){return new ir(t[e*=2],t[e+1])}function Mr(){var t,e,n,r;if(e=arguments.length,!(this instanceof Mr))return 0===e?new Mr:1===e?new Mr(arguments[0]):2===e?new Mr(arguments[0],arguments[1]):new Mr(arguments[0],arguments[1],arguments[2]);if(0===e)n=new en(0);else if(1===e)if(ft(arguments[0]))n=new en(2*arguments[0]);else if(oe(arguments[0]))if((r=(n=arguments[0]).length)&&Kt(n)&&sr(n[0])){if(n=function(t,e){var n,r,i,o;for(n=e.length,o=0,i=0;in.byteLength-t)throw new RangeError(L("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*Fr));n=new en(n,t,2*r)}}return P(this,"_buffer",n),P(this,"_length",n.length/2),this}function Ur(t){var e,n;for(e=[];!(n=t.next()).done;)e.push(yt(n.value));return e}P(Mr,"BYTES_PER_ELEMENT",Fr),P(Mr,"name","Complex128Array"),P(Mr,"from",(function(t){var e,n,r,i,o,a,u,f,s,l,c,p;if(!Ve(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!kr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!Ve(r=arguments[1]))throw new TypeError(L("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(Rr(t)){if(f=t.length,r){for(o=(i=new this(f))._buffer,p=0,c=0;c=2))throw new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[p]=l[0],o[p+1]=l[1]}p+=2}return i}return new this(t)}if(oe(t)){if(r){for(f=t.length,u=t.get&&t.set?Ge("default"):De("default"),c=0;c=2))throw new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));o[p]=l[0],o[p+1]=l[1]}p+=2}return i}return new this(t)}if(Te(t)&&Ir&&Ve(t[mr])){if(!Ve((o=t[mr]()).next))throw new TypeError(L("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",t));if(a=r?function(t,e,n){var r,i,o,a;for(r=[],a=-1;!(i=t.next()).done;)if(a+=1,Xn(o=e.call(n,i.value,a))&&o.length>=2)r.push(o[0],o[1]);else{if(!sr(o))return new TypeError(L("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));r.push(Ar(o),Sr(o))}return r}(o,r,e):Lr(o),a instanceof Error)throw a;for(o=(i=new this(f=a.length/2))._buffer,c=0;c=this._length))return Br(this._buffer,t)})),St(Mr.prototype,"buffer",(function(){return this._buffer.buffer})),St(Mr.prototype,"byteLength",(function(){return this._buffer.byteLength})),St(Mr.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),P(Mr.prototype,"BYTES_PER_ELEMENT",Mr.BYTES_PER_ELEMENT),P(Mr.prototype,"copyWithin",(function(t,e){if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*t,2*e):this._buffer.copyWithin(2*t,2*e,2*arguments[2]),this})),P(Mr.prototype,"entries",(function(){var t,e,n,r,i,o,a;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return e=this,t=this._buffer,r=this._length,o=-1,a=-2,P(n={},"next",(function(){var e;if(o+=1,i||o>=r)return{done:!0};return e=new ir(t[a+=2],t[a+1]),{value:[o,e],done:!1}})),P(n,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(n,mr,(function(){return e.entries()})),n})),P(Mr.prototype,"every",(function(t,e){var n,r;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!rt(n))throw new TypeError(L("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(a=Ar(t),u=Sr(t),f=e;f=0;r--)if(i=Br(n,r),t.call(e,i,r,this))return i})),P(Mr.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=this._length-1;r>=0;r--)if(i=Br(n,r),t.call(e,i,r,this))return r;return-1})),P(Mr.prototype,"forEach",(function(t,e){var n,r,i;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return Br(this._buffer,t)})),St(Mr.prototype,"length",(function(){return this._length})),P(Mr.prototype,"includes",(function(t,e){var n,r,i,o,a;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!sr(t))throw new TypeError(L("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=Ar(t),o=Sr(t),n=this._buffer,a=e;a1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(i=Ar(t),o=Sr(t),n=this._buffer,a=e;a=n)return{done:!0};return{value:i,done:!1}})),P(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(e,mr,(function(){return t.keys()})),e})),P(Mr.prototype,"lastIndexOf",(function(t,e){var n,r,i,o,a;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!sr(t))throw new TypeError(L("invalid argument. First argument must be a complex number. Value: `%s`.",t));if(arguments.length>1){if(!rt(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(i=Ar(t),o=Sr(t),n=this._buffer,a=e;a>=0;a--)if(i===n[r=2*a]&&o===n[r+1])return a;return-1})),P(Mr.prototype,"map",(function(t,e){var n,r,i,o,a;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(r=this._buffer,n=(i=new this.constructor(this._length))._buffer,o=0;o1)r=e,o=0;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Br(n,0),o=1}for(;o1)r=e,o=i-1;else{if(0===i)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=Br(n,i-1),o=i-2}for(;o>=0;o--)r=t(r,Br(n,o),o,this);return r})),P(Mr.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=this._buffer,r=nt(n/2),i=0;i1){if(!ft(n=arguments[1]))throw new TypeError(L("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(sr(t)){if(n>=this._length)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return r[n*=2]=Ar(t),void(r[n+1]=Sr(t))}if(Rr(t)){if(n+(a=t._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t._buffer,s=r.byteOffset+n*Fr,e.buffer===r.buffer&&e.byteOffsets){for(i=new en(e.length),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=t,s=r.byteOffset+n*Fr,e.buffer===r.buffer&&e.byteOffsets){for(i=new en(a),f=0;fthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,f=0;fu&&(e=u)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*Fr):(i=e-t,n=r.byteOffset+t*Fr),new this.constructor(r.buffer,n,i<0?0:i)})),P(Mr.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)r=[];else{if(!kt(t)&&!tr(t))throw new TypeError(L("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Te(e))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:Br(i,o),done:!1}})),P(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(t,mr,(function(){return e.values()})),t})),P(Mr.prototype,"with",(function(t,e){var n,r,i;if(!Rr(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!rt(t))throw new TypeError(L("invalid argument. First argument must be an integer. Value: `%s`.",t));if(i=this._length,t<0&&(t+=i),t<0||t>=i)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!sr(e))throw new TypeError(L("invalid argument. Second argument must be a complex number. Value: `%s`.",e));return(n=(r=new this.constructor(this._buffer))._buffer)[2*t]=Ar(e),n[2*t+1]=Sr(e),r}));var Nr=Nn.BYTES_PER_ELEMENT,Pr=dr();function Cr(t){return"object"==typeof t&&null!==t&&"BooleanArray"===t.constructor.name&&t.BYTES_PER_ELEMENT===Nr}function Yr(t){return t===zr}function zr(){var t,e,n,r,i;if(e=arguments.length,!(this instanceof zr))return 0===e?new zr:1===e?new zr(arguments[0]):2===e?new zr(arguments[0],arguments[1]):new zr(arguments[0],arguments[1],arguments[2]);if(0===e)n=new Nn(0);else if(1===e)if(ft(i=arguments[0]))n=new Nn(i);else if(oe(i))n=function(t,e){var n,r;for(n=e.length,r=0;rn.byteLength-t)throw new RangeError(L("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",r*Nr));n=new Nn(n,t,r)}}return P(this,"_buffer",n),P(this,"_length",n.length),this}P(zr,"BYTES_PER_ELEMENT",Nr),P(zr,"name","BooleanArray"),P(zr,"from",(function(t){var e,n,r,i,o,a,u,f,s;if(!Ve(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Yr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((n=arguments.length)>1){if(!Ve(r=arguments[1]))throw new TypeError(L("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(e=arguments[2])}if(oe(t)){if(r){for(f=t.length,u=t.get&&t.set?Ge("default"):De("default"),o=(i=new this(f))._buffer,s=0;s=n))return yt(e[t])})),St(zr.prototype,"buffer",(function(){return this._buffer.buffer})),St(zr.prototype,"byteLength",(function(){return this._buffer.byteLength})),St(zr.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),P(zr.prototype,"BYTES_PER_ELEMENT",zr.BYTES_PER_ELEMENT),P(zr.prototype,"copyWithin",(function(t,e){if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(t,e):this._buffer.copyWithin(t,e,arguments[2]),this})),P(zr.prototype,"entries",(function(){var t,e,n,r,i,o;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return t=this,r=this._buffer,n=this._length,o=-1,P(e={},"next",(function(){if(o+=1,i||o>=n)return{done:!0};return{value:[o,yt(r[o])],done:!1}})),P(e,"return",(function(t){if(i=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(e,mr,(function(){return t.entries()})),e})),P(zr.prototype,"every",(function(t,e){var n,r;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r1){if(!ot(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=i)<0&&(e=0),arguments.length>2){if(!ot(n))throw new TypeError(L("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=i)<0&&(n=0),n>i&&(n=i)}else n=i}else e=0,n=i;for(o=t?1:0,a=e;a=0;i--)if(r=yt(n[i]),t.call(e,r,i,this))return r})),P(zr.prototype,"findLastIndex",(function(t,e){var n,r,i;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,i=this._length-1;i>=0;i--)if(r=yt(n[i]),t.call(e,r,i,this))return i;return-1})),P(zr.prototype,"forEach",(function(t,e){var n,r;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Ve(t))throw new TypeError(L("invalid argument. First argument must be a function. Value: `%s`.",t));for(n=this._buffer,r=0;r=this._length))return yt(this._buffer[t])})),P(zr.prototype,"includes",(function(t,e){var n,r;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!mt(t))throw new TypeError(L("invalid argument. First argument must be a boolean. Value: `%s`.",t));if(arguments.length>1){if(!ot(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(n=this._buffer,r=e;r1){if(!ot(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0&&(e+=this._length)<0&&(e=0)}else e=0;for(n=this._buffer,r=e;r0){if(!Lt(t))throw new TypeError(L("invalid argument. First argument must be a string. Value: `%s`.",t))}else t=",";for(e=this._buffer,n=[],r=0;r=n)return{done:!0};return{value:i,done:!1}})),P(e,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(e,mr,(function(){return t.keys()})),e})),P(zr.prototype,"lastIndexOf",(function(t,e){var n,r;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!mt(t))throw new TypeError(L("invalid argument. First argument must be a boolean. Value: `%s`.",t));if(arguments.length>1){if(!ot(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e>=this._length?e=this._length-1:e<0&&(e+=this._length)}else e=this._length-1;for(n=this._buffer,r=e;r>=0;r--)if(t===yt(n[r]))return r;return-1})),St(zr.prototype,"length",(function(){return this._length})),P(zr.prototype,"map",(function(t,e){var n,r,i,o;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Ve(t))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",t);for(i=this._buffer,n=(r=new this.constructor(this._length))._buffer,o=0;o1)i=e,o=0;else{if(0===r)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");i=yt(n[0]),o=1}for(;o1)i=e,o=r-1;else{if(0===r)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");i=yt(n[r-1]),o=r-2}for(;o>=0;o--)i=t(i,yt(n[o]),o,this);return i})),P(zr.prototype,"reverse",(function(){var t,e,n,r,i,o;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(t=this._buffer,n=this._length,r=nt(n/2),i=0;i1){if(!ft(n=arguments[1]))throw new TypeError(L("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(oe(t)){if(n+(o=t.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(e=Cr(t)?t._buffer:t,u=r.byteOffset+n*Nr,e.buffer===r.buffer&&e.byteOffsetu){for(i=new Nn(e.length),a=0;a=this._length)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));r[n]=t?1:0}})),P(zr.prototype,"slice",(function(t,e){var n,r,i,o,a,u;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(o=this._buffer,a=this._length,0===arguments.length)t=0,e=a;else{if(!ot(t))throw new TypeError(L("invalid argument. First argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=a)<0&&(t=0),1===arguments.length)e=a;else{if(!ot(e))throw new TypeError(L("invalid argument. Second argument must be an integer. Value: `%s`.",e));e<0?(e+=a)<0&&(e=0):e>a&&(e=a)}}for(n=ti&&(e=i)}}return t>=i?(i=0,n=r.byteLength):t>=e?(i=0,n=r.byteOffset+t*Nr):(i=e-t,n=r.byteOffset+t*Nr),new this.constructor(r.buffer,n,i<0?0:i)})),P(zr.prototype,"toLocaleString",(function(t,e){var n,r,i,o,a;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)r=[];else{if(!Lt(t)&&!tr(t))throw new TypeError(L("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",t));r=t}if(arguments.length<2)n={};else{if(!Te(e))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",e));n=e}for(o=this._buffer,i=[],a=0;a=n)return{done:!0};return{value:yt(i[o]),done:!1}})),P(t,"return",(function(t){if(r=!0,arguments.length)return{value:t,done:!0};return{done:!0}})),mr&&P(t,mr,(function(){return e.values()})),t})),P(zr.prototype,"with",(function(t,e){var n,r;if(!Cr(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ot(t))throw new TypeError(L("invalid argument. First argument must be an integer. Value: `%s`.",t));if(r=this._length,t<0&&(t+=r),t<0||t>=r)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%s`.",t));if(!mt(e))throw new TypeError(L("invalid argument. Second argument must be a boolean. Value: `%s`.",e));return(n=new this.constructor(this._buffer))._buffer[t]=e?1:0,n}));var Dr=[en,un,vn,pn,In,Vn,Kn,Nn,Dn,jr,Mr,zr],Jr=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],$r=Jr.length;function Wr(t){var e;if(Kt(t))return"generic";if(he(t))return null;for(e=0;e<$r;e++)if(t instanceof Dr[e])return Jr[e];return Ke[ge(t)]||null}function Gr(t){var e=Wr(t);return Ye(t)?{data:t,dtype:e,accessorProtocol:!0,accessors:[Ge(e),qe(e)]}:{data:t,dtype:e,accessorProtocol:!1,accessors:[De(e),$e(e)]}}var Zr=Array.prototype.slice;function qr(t,e,n){var r;return function(t,e){return"function"==typeof t[e]}(t,"slice")?t.slice(e,n):(r=Gr(t)).accessorProtocol?function(t,e,n){var r,i,o,a;for(r=t.data,i=t.accessors[0],o=[],a=e;a0?o+=a*(t[u]-1):a<0&&(i+=a*(t[u]-1))}return[i,o]}function Qr(t){return"column-major"===t}P(Hr,"assign",(function(t,e,n,r){var i,o,a,u,f;for(i=t.length,o=n,a=n,f=0;f0?a+=u*(t[f]-1):u<0&&(o+=u*(t[f]-1))}return r[0]=o,r[1]=a,r}));var ti=/[-\/\\^$*+?.()|[\]{}]/g;var ei=RegExp.prototype.exec;var ni=z();function ri(t){return"object"==typeof t&&(t instanceof RegExp||(ni?function(t){try{return ei.call(t),!0}catch(t){return!1}}(t):"[object RegExp]"===Z(t)))}function ii(t,e,n){return t.replace(e,n)}function oi(t,e,n){if(!Lt(t))throw new TypeError(L("invalid argument. First argument must be a string. Value: `%s`.",t));if(Lt(e))e=new RegExp(function(t){var e,n;if(!Lt(t))throw new TypeError(L("invalid argument. Must provide a regular expression string. Value: `%s`.",t));if("/"===t[0])for(n=t.length-1;n>=0&&"/"!==t[n];n--);return void 0===n||n<=0?t.replace(ti,"\\$&"):(e=(e=t.substring(1,n)).replace(ti,"\\$&"),t=t[0]+e+t.substring(n))}(e),"g");else if(!ri(e))throw new TypeError(L("invalid argument. Second argument must be a string or regular expression. Value: `%s`.",e));if(!Lt(n)&&!Ve(n))throw new TypeError(L("invalid argument. Third argument must be a string or replacement function. Value: `%s`.",n));return ii(t,e,n)}var ai={int8:"new Int8Array( [ {{data}} ] )",uint8:"new Uint8Array( [ {{data}} ] )",uint8c:"new Uint8ClampedArray( [ {{data}} ] )",int16:"new Int16Array( [ {{data}} ] )",uint16:"new Uint16Array( [ {{data}} ] )",int32:"new Int32Array( [ {{data}} ] )",uint32:"new Uint32Array( [ {{data}} ] )",float32:"new Float32Array( [ {{data}} ] )",float64:"new Float64Array( [ {{data}} ] )",generic:"[ {{data}} ]",binary:"new Buffer( [ {{data}} ] )",complex64:"new Complex64Array( [ {{data}} ] )",complex128:"new Complex128Array( [ {{data}} ] )",bool:"new BooleanArray( [ {{data}} ] )"};var ui,fi={uint16:Vn,uint8:Nn};(ui=new fi.uint16(1))[0]=4660;var si=52===new fi.uint8(ui.buffer)[0],li="function"==typeof ArrayBuffer?ArrayBuffer:null;var ci,pi="function"==typeof ArrayBuffer?ArrayBuffer:void 0;ci=function(){var t,e,n;if("function"!=typeof li)return!1;try{(t=Qn(n=new li(16))&&"function"==typeof li.isView)&&((e=new en(n))[0]=-3.14,e[1]=NaN,t=t&&li.isView(e)&&16===n.byteLength&&-3.14===e[0]&&e[1]!=e[1])}catch(e){t=!1}return t}()?pi:function(){throw new Error("not implemented")};var hi=ci,gi="function"==typeof DataView;function di(t){return gi&&t instanceof DataView||"[object DataView]"===Z(t)}var mi="function"==typeof DataView?DataView:null;var yi,bi="function"==typeof DataView?DataView:void 0;yi=function(){var t,e,n;if("function"!=typeof mi)return!1;try{n=new hi(24),(t=di(e=new mi(n,8))&&"function"==typeof e.getFloat64&&"function"==typeof e.setFloat64)&&(e.setFloat64(0,-3.14),e.setFloat64(8,NaN),t=t&&e.buffer===n&&16===e.byteLength&&8===e.byteOffset&&-3.14===e.getFloat64(0)&&e.getFloat64(8)!=e.getFloat64(8))}catch(e){t=!1}return t}()?bi:function(){throw new Error("not implemented")};var vi=yi,wi="function"==typeof BigInt?BigInt:void 0,_i=["row-major","column-major"];function xi(){return _i.slice()}var Ei=["row-major","column-major"];function Ti(){return{"row-major":101,"column-major":102}}P((function(){return Ei.slice()}),"enum",Ti);var Vi={"row-major":101,"column-major":102};function Oi(){return{"row-major":Vi["row-major"],"column-major":Vi["column-major"]}}P(xi,"enum",Oi);var ji=["throw","normalize","clamp","wrap"];function Ai(){return ji.slice()}function Si(){return{throw:1,clamp:2,wrap:3,normalize:4}}P(Ai,"enum",Si);var Li={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256},Fi=Oi(),Ii={throw:1,clamp:2,wrap:3,normalize:4};var Ri=4294967295,ki=4294967296,Bi=new Nn(8),Mi=new vi(Bi.buffer);function Ui(t,e,n,r){var i,o,a;if(0===t){for(a=0;a>>0,i=nt(t/ki),si?(Mi.setUint32(0,o,si),Mi.setUint32(4,i,si)):(Mi.setUint32(0,i,si),Mi.setUint32(4,o,si)),a=0;a>>0,r=nt(t/4294967296),n=new vi(e.buffer),si?(n.setUint32(0,i,si),n.setUint32(4,r,si)):(n.setUint32(0,r,si),n.setUint32(4,i,si))),e}),"assign",Ui);var Ni={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256},Pi=Oi(),Ci={throw:1,clamp:2,wrap:3,normalize:4};function Yi(t,e,n,r,i,o){var a,u,f,s,l;if(!(this instanceof Yi))return new Yi(t,e,n,r,i,o);for(s=1,l=0;l=0;a--)t-=o=t%n[a],t/=n[a],i+=o*e[a];return this._accessors?this._buffer.get(i):this._buffer[i]})),P(Yi.prototype,"set",(function(){var t,e;for(t=this._offset,e=0;e=0;u--)t-=a=t%r[u],t/=r[u],o+=a*n[u];return this._accessors?this._buffer.set(e,o):this._buffer[o]=e,this})),P(Yi.prototype,"toString",(function(){var t,e,n,r,i,o;if(e=this._shape.length,n="ndarray( '"+(r=this._dtype)+"', ",t="",this._length<=100)if("complex64"===r||"complex128"===r)for(o=0;o=0;o--)t+=Ar(i=this.iget(this._length-1-o))+", "+Sr(i),o>0&&(t+=", ");else for(o=2;o>=0;o--)t+=this.iget(this._length-1-o),o>0&&(t+=", ")}if(n+=oi(ai[this.dtype],"{{data}}",t),n+=", ",n+=0===e?"[]":"[ "+this._shape.join(", ")+" ]",n+=", ",n+="[ ",0===e)n+="0";else for(o=0;o0&&e.push("generic"),e)}var Zi=Ji(Gi());function qi(t,e){return null!=t&&("symbol"==typeof e?e in Object(t):String(e)in Object(t))}function Ki(t){return Ve(t)&&Bt(t.alignment)&&Bt(t.byteLength)&&Ve(t.byteLengthOf)&&Ve(t.byteOffsetOf)&&Ve(t.bufferOf)&&Ve(t.isStruct)&&Ve(t.viewOf)&&$(t,"fields")&&$(t,"layout")}var Xi,Hi,Qi,to={bool:0,int8:1,uint8:2,uint8c:3,int16:4,uint16:5,int32:6,uint32:7,int64:8,uint64:9,float16:10,float32:11,float64:12,complex32:13,complex64:14,complex128:15,binary:16,generic:17,notype:18,userdefined_type:256};function eo(t){var e=to[t];return C(e)?e:null}function no(t){var e=typeof t;return"string"===e?null===eo(t)?null:t:"number"===e?ke(t):"object"===e&&t?String(t):Ki(t)?t.layout:null}function ro(t,e){var n,r,i;if(n=arguments.length,!(this instanceof ro))return n<2?new ro(t):new ro(t,e);if(Zi(t))r="builtin";else{if(function(t){return t instanceof ro||"object"==typeof t&&null!==t&&"DataType"===t.constructor.name&&Lt(t.char)&&Lt(t.description)&&Lt(t.byteOrder)&&qi(t,"value")}(t))return new ro(t.value,{description:t.description});if(!Ki(t))throw new TypeError(L("invalid argument. First argument must be either a supported data type string, a struct constructor, or another data type instance. Value: `%s`.",t));r="struct"}if(n>1){if(!Ie(i=e))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",i));if($(i,"description")&&!Lt(i.description))throw new TypeError(L("invalid option. `%s` option must be a string. Option: `%s`.","description",i.description))}else i={};return P(this,"_value",t),P(this,"_description",i.description||function(t){return 0===arguments.length?{binary:"byte",bool:"boolean",complex32:"half-precision floating-point complex number",complex64:"single-precision floating-point complex number",complex128:"double-precision floating-point complex number",float16:"half-precision floating-point number",bfloat16:"brain floating-point number",float32:"single-precision floating-point number",float64:"double-precision floating-point number",float128:"quadruple-precision floating-point number",generic:"generic array value",int8:"signed 8-bit integer",int16:"signed 16-bit integer",int32:"signed 32-bit integer",int64:"signed 64-bit integer",int128:"signed 128-bit integer",int256:"signed 256-bit integer",uint8:"unsigned 8-bit integer",uint8c:"unsigned 8-bit integer (clamped)",uint16:"unsigned 16-bit integer",uint32:"unsigned 32-bit integer",uint64:"unsigned 64-bit integer",uint128:"unsigned 128-bit integer",uint256:"unsigned 256-bit integer"}:(void 0===Xi&&(Xi={binary:"byte",bool:"boolean",complex32:"half-precision floating-point complex number",complex64:"single-precision floating-point complex number",complex128:"double-precision floating-point complex number",float16:"half-precision floating-point number",bfloat16:"brain floating-point number",float32:"single-precision floating-point number",float64:"double-precision floating-point number",float128:"quadruple-precision floating-point number",generic:"generic array value",int8:"signed 8-bit integer",int16:"signed 16-bit integer",int32:"signed 32-bit integer",int64:"signed 64-bit integer",int128:"signed 128-bit integer",int256:"signed 256-bit integer",uint8:"unsigned 8-bit integer",uint8c:"unsigned 8-bit integer (clamped)",uint16:"unsigned 16-bit integer",uint32:"unsigned 32-bit integer",uint64:"unsigned 64-bit integer",uint128:"unsigned 128-bit integer",uint256:"unsigned 256-bit integer"}),Xi[no(t)]||null)}(t)||""),P(this,"_char",function(t){return 0===arguments.length?{binary:"r",bool:"x",complex32:"j",complex64:"c",complex128:"z",float16:"h",bfloat16:"e",float32:"f",float64:"d",float128:"g",generic:"o",int8:"s",int16:"k",int32:"i",int64:"l",int128:"m",int256:"n",uint8:"b",uint8c:"a",uint16:"t",uint32:"u",uint64:"v",uint128:"w",uint256:"y"}:(void 0===Hi&&(Hi={binary:"r",bool:"x",complex32:"j",complex64:"c",complex128:"z",float16:"h",bfloat16:"e",float32:"f",float64:"d",float128:"g",generic:"o",int8:"s",int16:"k",int32:"i",int64:"l",int128:"m",int256:"n",uint8:"b",uint8c:"a",uint16:"t",uint32:"u",uint64:"v",uint128:"w",uint256:"y"}),Hi[no(t)]||null)}(t)||""),P(this,"_enum",function(t){var e=typeof t;return"number"===e?ke(t)?t:null:"string"===e?eo(t):"object"===e&&t&&ot(t.enum)?t.enum:Ki(t)?eo("userdefined_type"):null}(t)||-1),P(this,"_alignment",function(t){var e;return 0===arguments.length?{binary:1,bool:1,complex32:2,complex64:4,complex128:8,float16:2,bfloat16:2,float32:4,float64:8,float128:16,generic:null,int8:1,int16:2,int32:4,int64:8,int128:16,int256:32,uint8:1,uint8c:1,uint16:2,uint32:4,uint64:8,uint128:16,uint256:32}:(void 0===Qi&&(Qi={binary:1,bool:1,complex32:2,complex64:4,complex128:8,float16:2,bfloat16:2,float32:4,float64:8,float128:16,generic:null,int8:1,int16:2,int32:4,int64:8,int128:16,int256:32,uint8:1,uint8c:1,uint16:2,uint32:4,uint64:8,uint128:16,uint256:32}),t?Bt(e=t.alignment)?e:Qi[no(t)]||null:null)}(t)||-1),P(this,"_byteLength",Me(t)||-1),P(this,"_byteOrder","host"),P(this,"_type",r),this}function io(t){return t instanceof ro||"object"==typeof t&&null!==t&&ot(t.alignment)&&ot(t.byteLength)&&Lt(t.byteOrder)&&Lt(t.char)&&ot(t.enum)&&qi(t,"value")}function oo(t){return Ve(t)&&Bt(t.alignment)&&Bt(t.byteLength)&&Ve(t.byteLengthOf)&&Ve(t.byteOffsetOf)&&Ve(t.bufferOf)&&Ve(t.viewOf)||function(t){return t instanceof ro||"object"==typeof t&&null!==t&&ot(t.alignment)&&ot(t.byteLength)&&Lt(t.byteOrder)&&Lt(t.char)&&ot(t.enum)&&qi(t,"value")}(t)&&oo(t.value)}function ao(t){return Zi(t)||io(t)||oo(t)}P(ro,"name","DataType"),St(ro.prototype,"alignment",(function(){return this._alignment})),St(ro.prototype,"byteLength",(function(){return this._byteLength})),St(ro.prototype,"byteOrder",(function(){return this._byteOrder})),St(ro.prototype,"char",(function(){return this._char})),St(ro.prototype,"description",(function(){return this._description})),St(ro.prototype,"enum",(function(){return this._enum})),St(ro.prototype,"value",(function(){return this._value})),P(ro.prototype,"toJSON",(function(){return{type:"DataType",value:this.toString(),byteOrder:this._byteOrder,description:this._description}})),P(ro.prototype,"toString",(function(){return"struct"===this._type?this._value.layout:String(this._value)})),P(ro.prototype,"valueOf",(function(){return this.toString()}));var uo=["same","promoted","accumulation","boolean","boolean_and_generic","signed_integer","signed_integer_and_generic","unsigned_integer","unsigned_integer_and_generic","integer","integer_and_generic","floating_point","floating_point_and_generic","real_floating_point","real_floating_point_and_generic","complex_floating_point","complex_floating_point_and_generic","real_and_generic","real","numeric","numeric_and_generic","integer_index","integer_index_and_generic","boolean_index","boolean_index_and_generic","mask_index","mask_index_and_generic","default","default_index"];function fo(){return uo.slice()}function so(){return{same:0,promoted:1,accumulation:2,boolean:3,boolean_and_generic:4,signed_integer:5,signed_integer_and_generic:6,unsigned_integer:7,unsigned_integer_and_generic:8,integer:9,integer_and_generic:10,floating_point:11,floating_point_and_generic:12,real_floating_point:13,real_floating_point_and_generic:14,complex_floating_point:15,complex_floating_point_and_generic:16,real:17,real_and_generic:18,numeric:19,numeric_and_generic:20,integer_index:21,integer_index_and_generic:22,boolean_index:23,boolean_index_and_generic:24,mask_index:25,mask_index_and_generic:26,default:27,default_index:28}}P(fo,"enum",so),function(t,e){var n,r,i;for(n=Ee(e),i=0;i0?0:(1-t)*e}function To(t){return null==t}function Vo(t,e,n,r,i){var o,a,u,f,s;if(t<=0)return"";if(1===r&&0===i&&t===n.length&&function(t,e){return"function"==typeof t[e]}(n,"join"))return n.join(e);if((u=Gr(n)).accessorProtocol)return function(t,e,n,r,i){var o,a,u,f,s,l;for(o=n.data,a=n.accessors[0],f=i,u="",l=0;l0&&(u+=e),To(s=a(o,f))||(u+=String(s)),f+=r;return u}(t,e,u,r,i);for(a=i,o="",s=0;s0&&(o+=e),To(f=n[a])||(o+=String(f)),a+=r;return o}function Oo(t,e){return Vo(t.length,e,t,1,0)}function jo(t){var e=Wr(t);return Ye(t)?Ge(e):De(e)}function Ao(t,e,n,r,i){var o,a,u,f,s;if(!((f=e[0])<=0))for(a=r[0],o=n[0],u=t[0],s=0;s=0;i--)n[i]=r,r*=t[i];return n}(t)}P((function(t,e,n,r){return Vo(t,e,n,r,Eo(t,r))}),"ndarray",Vo),P(Lo,"ndarray",(function(t,e,n,r,i){var o,a;return Ye(a=t[0])&&(o=qe(Wr(a))),o?So(t,e,n,r,[o=o||$e(Wr(a))],i):Ao(t,e,n,r,i)})),P(Bo,"assign",(function(t,e,n){return Qr(e)?function(t,e){var n,r;for(n=1,r=0;r=0;r--)e[r]=n,n*=t[r];return e}(t,n)}));var Mo="row-major";function Uo(t,e){var n,r,i;return"object"!=typeof(i=t.strides)||null===i?0===(r=t.shape).length?[0]:(Lt(n=t.order)||(n=Mo),Bo(r,n)):e?Ro(i):i}function No(t){var e,n,r;return C(r=t.offset)?r:0===(n=t.shape).length||"object"!=typeof(e=t.strides)||null===e?0:function(t,e){var n,r,i;for(r=t.length,n=0,i=0;i=0&&a=i&&(i=o,c=l);u=r[c][0]}for(n=$o(t.length),function(t,e){var n,r,i,o,a,u,f,s,l;for(r=1,i=1,l=1;l=0&&!(((s=t[o])<0?-s:s)<=n);)t[o+1]=s,e[a+1]=e[a],o-=1,a-=1;t[o+1]=u,e[a+1]=f,r+=1,i+=1}}(Ro(u),n),a=[Go(t,n)],l=0;l=0&&a=0&&ie&&(e=r)}return(r=qo.BLOCK_SIZE_IN_BYTES/e|0)>0?r:1}([t,e,n])}function Xo(t,e,n,r,i,o){var a,u,f,s,l;for(a=t.length,u=1,l=0;l=u&&(i=u-1);else if("wrap"===o)i<0?(i+=u)<0&&0!==(i%=u)&&(i+=u):i>=u&&(i-=u)>=u&&(i%=u);else if("normalize"===o&&i<0&&(i+=u),i<0||i>=u)throw new RangeError(L("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",u,i));if(f=n,Qr(r)){for(l=0;l=0;l--)i-=s=i%t[l],i/=t[l],f+=s*e[l];return f}var Ho="throw";var Qo="throw";var ta=[function(t,e,n,r){n.data[n.offset]=r(t.data[t.offset],e.data[e.offset])},function(t,e,n,r){var i,o,a,u,f,s,l,c,p,h,g;for(l=t.shape[0],u=t.strides[0],f=e.strides[0],s=n.strides[0],c=t.offset,p=e.offset,h=n.offset,i=t.data,o=e.data,a=n.data,g=0;g0;)for(I0;)for(F0;)for(Y0;)for(C0;)for(P0;)for(K0;)for(q0;)for(Z0;)for(G0;)for(ot0;)for(it0;)for(rt0;)for(nt0;)for(et0;)for(gt0;)for(ht0;)for(pt0;)for(ct0;)for(lt0;)for(st0;)for(Et0;)for(xt0;)for(_t0;)for(wt0;)for(vt0;)for(bt0;)for(yt0;)for(It0;)for(Ft0;)for(Lt0;)for(St0;)for(At0;)for(jt0;)for(Ot0;)for(Vt0;)for(Yt0;)for(Ct0;)for(Pt0;)for(Nt0;)for(Ut0;)for(Mt0;)for(Bt0;)for(kt0;)for(Rt0;)for(Kt0;)for(qt0;)for(Zt0;)for(Gt0;)for(Wt0;)for($t0;)for(Jt0;)for(Dt0;)for(zt0;)for(Yt0;)for(B0;)for(k0;)for(J0;)for(D0;)for(z0;)for(Q0;)for(H0;)for(X0;)for(K0;)for(ft0;)for(ut0;)for(at0;)for(ot0;)for(it0;)for(yt0;)for(mt0;)for(dt0;)for(gt0;)for(ht0;)for(pt0;)for(Ot0;)for(Vt0;)for(Tt0;)for(Et0;)for(xt0;)for(_t0;)for(wt0;)for(Bt0;)for(kt0;)for(Rt0;)for(It0;)for(Ft0;)for(Lt0;)for(St0;)for(At0;)for(Jt0;)for(Dt0;)for(zt0;)for(Yt0;)for(Ct0;)for(Pt0;)for(Nt0;)for(Ut0;)for(Mt0;)for(Qt0;)for(Ht0;)for(Xt0;)for(Kt0;)for(qt0;)for(Zt0;)for(Gt0;)for(Wt0;)for($t0;)for(Jt=0;s--)if(!((l=u-a+s)<0)){if(f=i[l],0!==(r=e[s])&&r0)for(l=0;l0)for(p=0;p2){if(r=ja(Aa[n]))return new r(t,e);throw new TypeError(L("invalid argument. Must provide a recognized data type. Value: `%s`.",n))}return new Sa(t,e)}(r,i,La[t.type])}}var Ia={float64:en,float32:un,int16:In,int32:vn,int8:Kn,uint16:Vn,uint32:pn,uint8:Nn,uint8c:Dn,complex64:jr,complex128:Mr,bool:zr};function Ra(t){return Ia[t]||null}function ka(t,e){return new Nn(t.buffer,t.byteOffset+t.BYTES_PER_ELEMENT*e,t.length-e)}function Ba(){return{dtypes:{default:"float64",numeric:"float64",real:"float64",floating_point:"float64",real_floating_point:"float64",complex_floating_point:"complex128",integer:"int32",signed_integer:"int32",unsigned_integer:"uint32",boolean:"bool",index:"int32",integer_index:"int32",boolean_index:"bool",mask_index:"uint8"}}}var Ma={dtypes:{default:"float64",numeric:"float64",real:"float64",floating_point:"float64",real_floating_point:"float64",complex_floating_point:"complex128",integer:"int32",signed_integer:"int32",unsigned_integer:"uint32",boolean:"bool",index:"int32",integer_index:"int32",boolean_index:"bool",mask_index:"uint8"}},Ua={"dtypes.default":Ma.dtypes.default,"dtypes.numeric":Ma.dtypes.numeric,"dtypes.real":Ma.dtypes.real,"dtypes.floating_point":Ma.dtypes.floating_point,"dtypes.real_floating_point":Ma.dtypes.real_floating_point,"dtypes.complex_floating_point":Ma.dtypes.complex_floating_point,"dtypes.integer":Ma.dtypes.integer,"dtypes.signed_integer":Ma.dtypes.signed_integer,"dtypes.unsigned_integer":Ma.dtypes.unsigned_integer,"dtypes.boolean":Ma.dtypes.boolean,"dtypes.index":Ma.dtypes.index,"dtypes.integer_index":Ma.dtypes.integer_index,"dtypes.boolean_index":Ma.dtypes.boolean_index,"dtypes.mask_index":Ma.dtypes.mask_index};P(Ba,"get",(function(t){var e=Ua[t];return void 0===e?null:e}));var Na=Ba.get("dtypes.default"),Pa=Ra("complex64"),Ca=Ra("complex128"),Ya=Ra("bool");function za(){var t,e,n,r;if(null===(n=Ra(e=(t=arguments.length)&&Lt(arguments[t-1])?arguments[t-=1]:Na)))throw new TypeError(L("invalid argument. Must provide a recognized data type. Value: `%s`.",e));return t<=0?new n(0):1===t?((r=arguments[0])instanceof Pa?r=vr(r,0):r instanceof Ca?r=wr(r,0):r instanceof Ya&&(r=ka(r,0)),new n(r)):2===t?new n(arguments[0],arguments[1]):new n(arguments[0],arguments[1],arguments[2])}function Da(t){if(t.length)return t.isStructType?function(t){return function(){var e,n,r,i;for(e=(n=this[wa]).byteOffset+t.byteOffset,r=[],i=0;i0&&e.push("generic"),e)}var Ga=Ji(Wa("real_floating_point")),Za=Ji(Wa("signed_integer"));function qa(t){return"bigint"==typeof t}function Ka(t){return"object"==typeof t&&"[object BigInt]"===Z(t)&&function(t){try{return"bigint"==typeof t.valueOf()}catch(t){return!1}}(t)}function Xa(t){return qa(t)||Ka(t)}function Ha(t){return function(){return t}}P(Xa,"isPrimitive",qa),P(Xa,"isObject",Ka);var Qa,tu=Ha(!1),eu=Ha(!1),nu=Ha(!1);P(tu,"isPrimitive",eu),P(tu,"isObject",nu),Qa=At()?Xa:tu;const{isPrimitive:ru}=Qa;var iu,ou={float64:{float64:1,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},float32:{float64:1,float32:1,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},float16:{float64:1,float32:1,float16:1,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},int64:{float64:0,float32:0,float16:0,int64:1,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},int32:{float64:1,float32:0,float16:0,int64:1,int32:1,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},int16:{float64:1,float32:1,float16:0,int64:1,int32:1,int16:1,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},int8:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:1,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},uint64:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},uint32:{float64:1,float32:0,float16:0,int64:1,int32:0,int16:0,int8:0,uint64:1,uint32:1,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},uint16:{float64:1,float32:1,float16:0,int64:1,int32:1,int16:0,int8:0,uint64:1,uint32:1,uint16:1,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},uint8:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:0,uint64:1,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},uint8c:{float64:1,float32:1,float16:1,int64:1,int32:1,int16:1,int8:0,uint64:1,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},complex128:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,complex32:0,binary:0,generic:1,bool:0},complex64:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:0,binary:0,generic:1,bool:0},complex32:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,complex32:1,binary:0,generic:1,bool:0},generic:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:0},binary:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:1,generic:0,bool:0},bool:{float64:0,float32:0,float16:0,int64:0,int32:0,int16:0,int8:0,uint64:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,complex32:0,binary:0,generic:1,bool:1}};var au=function(t){return 0===arguments.length?function(){var t,e,n,r,i,o,a,u,f;for(n={},e=(t=Ee(ou)).length,f=0;f0}(t,e):"mostly-safe"===n?function(t,e){var n;return(t=no(t))===(e=no(e))||!!(n=su[t])&&n[e]>0}(t,e):function(t,e){var n;return(t=no(t))===(e=no(e))||!!(n=pu[t])&&n[e]>0}(t,e)))}var gu=1401298464324817e-60,du=16777215,mu=-16777215;function yu(t){return t!=t||t===tt||t===et?"float32":rt(t)?t>=mu&&t<=du?"float32":"float64":t>-gu&&t=Wn?"int8":t>=An?"int16":t>=dn?"int32":"float64":t<=kn?"uint8":t<=_n?"uint16":t<=Xt?"uint32":"float64":t>-gu&&t=Wn?"int8":t>=An?"int16":t>=dn?"int32":"float64":t<=$n?"int8":t<=jn?"int16":t<=gn?"int32":"float64"}(n):bu(n):ju.dtypes.real,i=n):sr(n)?(r=Tu(n)||("float32"===t.type?"complex64":"complex128"),i=n.re):mt(n)?(r="bool",i=Vu(n)):ru(n)?(r="int64",i=Ou(n)):(r="generic",i=n);if(!hu(r,t.type,t.castingMode))throw new TypeError(L("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[wa][e](t.byteOffset,i,si)}}function Su(t){return yt(t)}function Lu(t){return yt(t.re||t.im)}function Fu(t,e){return function(n){var r,i;mt(n)?(r="bool",i=Vu(n)):C(n)?(r=ju.dtypes.real,i=Vu(Su(n))):ru(n)?(r="int64",i=Vu(function(t){return yt(t)}(n))):sr(n)?(r=Tu(n)||ju.dtypes.complex,i=Vu(Lu(n))):(r="generic",i=yt(n));if(!hu(r,t.type,t.castingMode))throw new TypeError(L("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[wa][e](t.byteOffset,i,si)}}function Iu(t,e){return function(n){var r,i;ru(n)?(r="int64",i=n):C(n)?ot(n)?(r=bu(n),i=wi(n)):(r=ju.dtypes.real,i=wi(nt(n))):mt(n)?(r="bool",i=function(t){return wi(t?1:0)}(n)):sr(n)?(r=Tu(n)||ju.dtypes.complex,i=wi(nt(n.re))):(r="generic",i=wi(nt(q(i))));if(!hu(r,t.type,t.castingMode))throw new TypeError(L("invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].",t.name,t.type,r));this[wa][e](t.byteOffset,i,si)}}function Ru(t){return Te(t)&&di(t[wa])}var ku=Ji(Wa("complex_floating_point")),Bu=Ji(Wa("boolean")),Mu=Ji(Wa("real"));function Uu(t,e){if(gr(t))return wr(t,e);if(pr(t))return vr(t,e);throw new TypeError(L("invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.",t))}var Nu=8;function Pu(t,e,n,r,i){var o,a,u,f;if(t<=0)return n;if((u=Gr(n)).accessorProtocol)return function(t,e,n,r,i){var o,a,u,f;for(o=n.data,a=n.accessors[1],u=i,f=0;f0)for(f=0;f0?null:new TypeError(L("invalid argument. `%s` field must be a non-empty string. Value: `%s`.",e,t))},type:function(t){return Di(Zu,t)||Ki(t)?null:new TypeError(L('invalid argument. `%s` field must be either a struct type or one of the following: "%s". Value: `%s`.',"type",Oo(Zu,", "),t))},description:function(t,e){return Lt(t)?null:new TypeError(L("invalid argument. `%s` field must be a string. Value: `%s`.",e,t))},length:function(t,e){return Bt(t)?null:new TypeError(L("invalid argument. `%s` field must be a positive integer. Value: `%s`.",e,t))},enumerable:Gu,writable:Gu,default:Ha(null),castingMode:(qu=["none","safe","mostly-safe","same-kind","unsafe"],function(t,e){return Di(qu,t)?null:new TypeError(L('invalid argument. `%s` field must be one of the following: "%s". Value: `%s`.',e,Oo(qu,", "),t))})};function Qu(t,e){var n,r,i,o,a;for(n={isStructType:!1,description:"",byteLength:0,byteOffset:0,alignment:0,padding:0,enumerable:!0,writable:!0,default:void 0,castingMode:"none"},a=0;ae&&(e=n);return e}function ef(t){var e,n,r,i,o,a,u;if(0===(e=t.fields).length)return null;for(r=[],u=0;u0&&o.byteOffset===t[a-1].byteOffset||(o.isStructType?e.push(ii(o.type.layout,r,af(o.byteOffset))):e.push(L("|<%s>[%u,%u]",o.type,o.byteOffset,o.byteLength)));return"|"===(n=L("%s|",e.join("")))[n.length-2]&&(n=n.substring(0,n.length-1)),n}var ff=["none","linear","layout"],sf=Ji(ff);function lf(t,e,n){var r;if(!Ie(n))throw new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",n));if(r={format:"none"},$(n,"format")&&(r.format=n.format,!sf(r.format)))throw new TypeError(L('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"format",Oo(ff,", "),n.format));return"linear"===r.format?function(t,e){var n,r,i,o,a,u,f,s,l,c,p,h,g,d,m,y,b,v,w,_,x,E;for(y=e.length,n="%"+(t.byteLength-1).toString().length+"s",d=0,_=0;_d&&(d=m);for(r="%"+d+"s",i="// %s",u="%s: %s %s",c=0,s=[],_=0;_0&&b.byteOffset===e[_-1].byteOffset)){for(l=_1?" (byte %u)":"",l){for(a=" => union: %s",f=[],E=_+1;E":v.type,f.push(L("%s<%s>[%u]",v.name,w,x%v.alignment)),E+=1;a=L(a,f.join(", "))}else a="";f=L(o+a,x%b.alignment),g=b.length?L(i,L("%s[%u]%s",b.type,nt(x/b.alignment),f)):L(i,L("%s%s",b.type,f)),s.push(L(u,p,h,g)),c+=1}for(x=0;x"}function cf(){}var pf="foo"===cf.name;var hf=[en,un,vn,pn,In,Vn,Kn,Nn,Dn],gf=["Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array"],df=Qe()?Le(en):mf;function mf(){}df="TypedArray"===function(t){if(!1===Ve(t))throw new TypeError(L("invalid argument. Must provide a function. Value: `%s`.",t));return pf?t.name:pe.exec(t.toString())[1]}(df)?df:mf;var yf=[Mr,jr],bf=["Complex64Array","Complex128Array"];function vf(){return"function"==typeof W&&"symbol"==typeof W("foo")&&$(W,"hasInstance")&&"symbol"==typeof W.hasInstance}var wf=vf()?Symbol.hasInstance:null,_f=vf();function xf(t,e){if("function"!=typeof e&&(!_f||"object"!=typeof e||"function"!=typeof e[wf]))throw new TypeError(L("invalid argument. Second argument must be callable. Value: `%s`.",e));return t instanceof e}var Ef=[[en,"Float64Array"],[un,"Float32Array"],[vn,"Int32Array"],[pn,"Uint32Array"],[In,"Int16Array"],[Vn,"Uint16Array"],[Kn,"Int8Array"],[Nn,"Uint8Array"],[Dn,"Uint8ClampedArray"],[jr,"Complex64Array"],[Mr,"Complex128Array"],[zr,"BooleanArray"]];function Tf(t){var e,n;for(n=0;n0){if(!Te(t))throw new TypeError(L("invalid argument. First argument must be an object. Value: `%s`.",t));h=t}if(P(this,wa,p),void 0!==h){for(f=ua(void 0,a.length),c={},m=0;m0&&((o=t[u-1]).padding=r,Wu(a)&&of(o.fields,r)),a.byteOffset=i,Wu(a))for(f=0;f0?arguments[0]:{})})),P(s.prototype,"toJSON",(function(){if(!(this instanceof s))throw new Error("invalid invocation. `this` is not a struct instance.");return function(t,e){var n,r,i,o;for(n={},o=0;o=u.byteLength)throw new RangeError(L("invalid argument. Second argument exceeds the bounds of the ArrayBuffer. Value: `%s`.",n));if(2===a){if(!ot(f=(u.byteLength-n)/e))throw new RangeError(L("invalid argument. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",e,u.byteLength-n))}else{if(!ft(f=r))throw new TypeError(L("invalid argument. Third argument must be a nonnegative integer. Value: `%s`.",f));if(f*e>u.byteLength-n)throw new RangeError(L("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",f*e))}}return P(this,"_buffer",u),P(this,"_byteOffset",n||0),P(this,"_byteLength",f*e),P(this,"_length",f),this}return e=i.byteLength,n=i.layout,r=i.fields,P(o,"BYTES_PER_ELEMENT",e),P(o,"name",Sf),P(o,"struct",i),St(o.prototype,"buffer",(function(){return this._buffer})),St(o.prototype,"byteLength",(function(){return this._byteLength})),St(o.prototype,"byteOffset",(function(){return this._byteOffset})),P(o.prototype,"BYTES_PER_ELEMENT",o.BYTES_PER_ELEMENT),P(o.prototype,"get",(function(t){if(!a(this))throw new TypeError(L("invalid invocation. `this` is not a %s.",Sf));if(!ft(t))throw new TypeError(L("invalid argument. Must provide a nonnegative integer. Value: `%s`.",t));if(!(t>=this._length))return new i(this._buffer,this._byteOffset+t*e,e)})),St(o.prototype,"length",(function(){return this._length})),P(o.prototype,"set",(function(t){var o,u,f,s,l,c,p,h,g,d,m,y;if(!a(this))throw new TypeError(L("invalid invocation. `this` is not a %s.",Sf));if(s=this._buffer,arguments.length>1){if(!ft(f=arguments[1]))throw new TypeError(L("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",f))}else f=0;if(u={format:"layout"},p=i.byteLength,!oe(t)||Di(r,"length")){if(f>=this._length)throw new RangeError(L("invalid argument. Index argument is out-of-bounds. Value: `%u`.",f));if(!Te(t))throw new TypeError(L("invalid argument. Must provide either a valid object or a struct instance. Value: `%s`.",t));if(t.toString(u)===n)return o=i.viewOf(t),void ba(p,new Nn(o.buffer,o.byteOffset,p),1,0,new Nn(s,this._byteOffset+f*e,p),1,0);for(g=new i(s,this._byteOffset+f*e,p),m=0;mthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(c=(o=t).get&&o.set?Ge("default"):De("default"),y=this._byteOffset+f*e,o.buffer===s&&o.byteOffsety){for(l=[],m=0;mt.length&&(r=t.length),(i=Gr(t)).accessorProtocol?function(t,e,n,r){var i,o,a;for(i=t.data,o=t.accessors[1],a=n;ae?e:t}function Gs(t,e){var n=e+1;return t<0?((t+=n)<0&&0!==(t%=n)&&(t+=n),t):t>e?((t-=n)>e&&(t%=n),t):t}function Zs(t,e){return t<0?(t+=e+1)<0?-1:t:t>e?-1:t}var qs=Ji(Ai()),Ks={wrap:Gs,clamp:Ws,normalize:function(t,e){var n=Zs(t,e);if(n<0||n>e)throw new RangeError(L("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return n},throw:function(t,e){if(t<0||t>e)throw new RangeError(L("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return t}};function Xs(t,e,n){var r;if("clamp"===n)return Ws(t,e);if("wrap"===n)return Gs(t,e);if(r=t,"normalize"===n&&(r=Zs(r,e)),r<0||r>e)throw new RangeError(L("invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.",e,t));return r}P(Xs,"factory",(function(t){if(!qs(t))throw new TypeError(L("invalid argument. First argument must be a recognized index mode. Value: `%s`.",t));return Ks[t]}));var Hs=Yi.prototype.iget;var Qs=Yi.prototype.iset;function tl(t,e){var n,r;for(n=[],r=0;r0))throw new TypeError(L("invalid argument. Third argument must be an array-like object containing nonnegative integers. Value: `%s`.",n));if((u=n.length)>32767)throw new RangeError(L("invalid argument. Number of dimensions must not exceed %u due to stack limits. Value: `%u`.",32767,u));if(!Ps(r))throw new TypeError(L("invalid argument. Fourth argument must be an array-like object containing integers. Value: `%s`.",r));if(u>0){if(r.length!==u)throw new RangeError(L("invalid argument. Fourth argument length must match the number of dimensions. Expected number of dimensions: `%u`. Strides length: `%u`.",u,r.length))}else{if(1!==r.length)throw new RangeError("invalid argument. Fourth argument length must be equal to 1 when creating a zero-dimensional ndarray.");if(0!==r[0])throw new RangeError(L("invalid argument. Fourth argument must contain a single element equal to 0. Value: `%d`.",r[0]))}if(!ft(i))throw new TypeError(L("invalid argument. Fifth argument must be a nonnegative integer. Value: `%s`.",i));if(!_o(o))throw new TypeError(L("invalid argument. Sixth argument must be a supported order. Value: `%s`.",o));if(u>0&&!function(t,e,n,r){var i=Hr(e,n,r);return i[0]>=0&&i[1]0)throw new Error("invalid arguments. Input buffer is incompatible with the specified meta data. Ensure that the offset is valid with regard to the strides array and that the buffer has enough elements to satisfy the desired array shape.");if((f={}).mode=el,f.readonly=false,arguments.length>6&&(s=function(t,e){var n;if(!Ie(e))return new TypeError(L("invalid argument. Options argument must be an object. Value: `%s`.",e));if($(e,"mode")&&(t.mode=e.mode,!qs(t.mode)))return new TypeError(L("invalid option. `%s` option must be a recognized mode. Option: `%s`.","mode",t.mode));if($(e,"submode")){if(t.submode=e.submode,!Xn(t.submode))return new TypeError(L("invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.","submode",t.submode));if(0===t.submode.length)return new TypeError(L("invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.","submode",t.submode.join(",")));for(n=0;n0){if(!ot(t))throw new TypeError(L("invalid argument. Index must be an integer. Value: `%s`.",t));return t=Xs(t,this._length-1,this._mode),Hs.call(this,t)}return Hs.call(this)})),P(nl.prototype,"set",(function(){var t,e,n,r;if(this._flags.READONLY)throw new Error("invalid invocation. Cannot write to a read-only array.");if(arguments.length!==this._ndims+1)throw new RangeError(L("invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.",this._ndims,arguments.length));for(t=this._offset,n=this._submode.length,r=0;r0){if(!ot(t))throw new TypeError(L("invalid argument. Index must be an integer. Value: `%s`.",t));t=Xs(t,this._length-1,this._mode),Qs.call(this,t,e)}else Qs.call(this,t);return this}));var il=["First","Second","Third"];function ol(t,e,n,r,i){var o,a,u;if(!(this instanceof ol))return arguments.length<5?new ol(t,e,n,r):new ol(t,e,n,r,i);if(!Ve(t))throw new TypeError(rl("null3c",t));if(!oe(e))throw new TypeError(rl("null2y",e));for(e=function(t){var e,n,r,i;for(r=jo(t),n=t.length,e=[],i=0;i4){if(!Ie(i))throw new TypeError(rl("null2V",i));if($(i,"order")&&(o.order=i.order,!_o(o.order)))throw new TypeError(rl("invalid option. `%s` option must be a valid memory layout. Option: `%s`.","order",o.order))}return this._prng=t,this._idtypes=e,this._odtypes=n,this._policies={output:r.output},this._opts=o,this}return P(ol.prototype,"generate",(function(t,e,n,r){var i,o,a,u,f,s,l,c,p,h,g,d,m,y,b;if(!ht(t)&&("object"!=typeof(b=t)||null===b||0!==b.length))throw new TypeError(rl("null5o",t));if(a={},arguments.length>3&&(f=function(t,e,n){return Ie(n)?$(n,"dtype")&&(t.dtype=no(n.dtype),!Di(e,t.dtype))?new TypeError(rl("null4S","dtype",Oo(e,'", "'),n.dtype)):($(n,"order")&&(t.order=n.order),$(n,"mode")&&(t.mode=n.mode),$(n,"submode")&&(t.submode=n.submode),$(n,"readonly")&&(t.readonly=n.readonly),null):new TypeError(rl("null2V",n))}(a,this._odtypes,r),f))throw f;for(i=function(t){var e,n,r,i;for(e=[],i=0;i 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/**\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// 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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/**\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 isArrayLike from '@stdlib/assert-is-array-like';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array-like object passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array-like object 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 = arraylikefcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arraylikefcn( 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-like object 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-like object 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 ( !isArrayLike( 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 arraylikefcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 array-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is array-like\n*\n* @example\n* var bool = isArrayLike( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLike( { 'length': 10 } );\n* // returns true\n*/\nfunction isArrayLike( value ) {\n\treturn (\n\t\tvalue !== void 0 &&\n\t\tvalue !== null &&\n\t\ttypeof value !== 'function' &&\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 isArrayLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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-like object containing only nonnegative integers.\n*\n* @module @stdlib/assert-is-nonnegative-integer-array\n*\n* @example\n* import isNonNegativeIntegerArray from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ 3.0, new Number(3.0) ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 3.0, '3.0' ] );\n* // returns false\n*\n* @example\n* import { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ 1.0, 0.0, 10.0 ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 3.0, new Number(1.0) ] );\n* // returns false\n*\n* @example\n* import { objects as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\n*\n* var bool = isNonNegativeIntegerArray( [ new Number(3.0), new Number(1.0) ] );\n* // returns true\n*\n* bool = isNonNegativeIntegerArray( [ 1.0, 0.0, 10.0 ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-like-function';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isNonNegativeInteger.isPrimitive );\nvar isObjectArray = arrayfun( isNonNegativeInteger.isObject );\n\n\n// MAIN //\n\nvar isNonNegativeIntegerArray = arrayfun( isNonNegativeInteger );\nsetReadOnly( isNonNegativeIntegerArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isNonNegativeIntegerArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isNonNegativeIntegerArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 { 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) 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 getGlobal from '@stdlib/utils-global';\n\n\n// VARIABLES //\n\nvar Global = getGlobal();\n\n\n// MAIN //\n\n/**\n* Tests for native `BigInt` support.\n*\n* @returns {boolean} boolean indicating if an environment has `BigInt` support\n*\n* @example\n* var bool = hasBigIntSupport();\n* // returns \n*/\nfunction hasBigIntSupport() {\n\treturn (\n\t\ttypeof Global.BigInt === 'function' &&\n\t\ttypeof BigInt === 'function' && // eslint-disable-line stdlib/require-globals\n\t\ttypeof Global.BigInt( '1' ) === 'bigint' &&\n\t\ttypeof BigInt( '1' ) === 'bigint' // eslint-disable-line stdlib/require-globals, no-undef, stdlib/no-builtin-big-int\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasBigIntSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* 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// 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/**\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/**\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 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/**\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 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/**\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 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\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// 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\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) 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// 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 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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// 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 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// 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) 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// 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 array iteration order.\n*\n* ## Notes\n*\n* - Return value key:\n*\n* - `0`: unordered (i.e., strides of mixed sign; e.g., `[ 9, -3, 1 ]`)\n* - `1`: ordered left-to-right (i.e., all nonnegative strides)\n* - `-1`: ordered right-to-left (i.e., all negative strides)\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} iteration order\n*\n* @example\n* var o = iterationOrder( [ 2, 1 ] );\n* // returns 1\n*\n* o = iterationOrder( [ -2, 1 ] );\n* // returns 0\n*\n* o = iterationOrder( [ -2, -1 ] );\n* // returns -1\n*/\nfunction iterationOrder( strides ) {\n\tvar cnt;\n\tvar i;\n\n\tcnt = 0;\n\tfor ( i = 0; i < strides.length; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\tcnt += 1;\n\t\t}\n\t}\n\tif ( cnt === 0 ) {\n\t\t// All nonnegative strides:\n\t\treturn 1|0; // asm-type annotation\n\t}\n\tif ( cnt === strides.length ) {\n\t\t// All negative strides:\n\t\treturn -1|0; // asm-type annotation\n\t}\n\t// Strides of mixed signs:\n\treturn 0|0; // asm-type annotation\n}\n\n\n// EXPORTS //\n\nexport default iterationOrder;\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) 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'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) 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) 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// 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// 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// 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// 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// 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/**\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// 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// 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/**\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// 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// 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/**\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// 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// 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// 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// 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/**\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\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) 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) 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) 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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// VARIABLES //\n\nvar arraySlice = Array.prototype.slice;\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'slice' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns a shallow copy of a portion of an array using the `Array#slice` built-in.\n*\n* @private\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = builtin( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction builtin( x, start, end ) {\n\treturn arraySlice.call( x, start, end );\n}\n\n/**\n* Returns a shallow copy of a portion of an accessor array.\n*\n* @private\n* @param {Object} x - input array object\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} 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 x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction accessors( x, start, end ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\tout = [];\n\tfor ( i = start; i < end; i++ ) {\n\t\tout.push( get( data, i ) );\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of a portion of an array.\n*\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\nfunction slice( x, start, end ) {\n\tvar obj;\n\tif ( hasMethod( x, 'slice' ) ) {\n\t\treturn x.slice( start, end );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, start, end );\n\t}\n\t// Assume we can use the built-in `Array#slice` method to copy elements to a generic array:\n\treturn builtin( x, start, end );\n}\n\n\n// EXPORTS //\n\nexport default slice;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Determines if an array is column-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is column-major contiguous\n*/\nfunction isColumnMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 2 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Determines if an array is row-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is row-major contiguous\n*/\nfunction isRowMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 1 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isRowMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar RE_CHARS = /[-\\/\\\\^$*+?.()|[\\]{}]/g; // eslint-disable-line no-useless-escape\n\n\n// MAIN //\n\n/**\n* Escapes a regular expression string.\n*\n* @param {string} str - regular expression string\n* @throws {TypeError} first argument must be a string\n* @returns {string} escaped string\n*\n* @example\n* var str = rescape( '[A-Z]*' );\n* // returns '\\[A\\-Z\\]\\*'\n*/\nfunction rescape( str ) {\n\tvar len;\n\tvar s;\n\tvar i;\n\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a regular expression string. Value: `%s`.', str ) );\n\t}\n\t// Check if the string starts with a forward slash...\n\tif ( str[ 0 ] === '/' ) {\n\t\t// Find the last forward slash...\n\t\tlen = str.length;\n\t\tfor ( i = len-1; i >= 0; i-- ) {\n\t\t\tif ( str[ i ] === '/' ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t// If we searched the string to no avail or if the first letter is not `/`, assume that the string is not of the form `/[...]/[guimy]`:\n\tif ( i === void 0 || i <= 0 ) {\n\t\treturn str.replace( RE_CHARS, '\\\\$&' );\n\t}\n\t// We need to de-construct the string...\n\ts = str.substring( 1, i );\n\n\t// Only escape the characters between the `/`:\n\ts = s.replace( RE_CHARS, '\\\\$&' );\n\n\t// Reassemble:\n\tstr = str[ 0 ] + s + str.substring( i );\n\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default rescape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express 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 exec = RegExp.prototype.exec; // non-generic\n\n\n// EXPORTS //\n\nexport default exec;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 './try2exec.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a regular expression.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a regular expression\n*\n* @example\n* var bool = isRegExp( /\\.+/ );\n* // returns true\n*\n* @example\n* var bool = isRegExp( {} );\n* // returns false\n*/\nfunction isRegExp( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof RegExp ) {\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 RegExp]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isRegExp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport exec from './exec.js';\n\n\n// MAIN //\n\n/**\n* Attempts to call a `RegExp` method.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if able to call a `RegExp` method\n*/\nfunction test( value ) {\n\ttry {\n\t\texec.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) 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* Replaces search occurrences with a replacement string.\n*\n* @param {string} str - input string\n* @param {RegExp} search - search expression\n* @param {(string|Function)} newval - replacement value or function\n* @returns {string} new string containing replacement(s)\n*\n* @example\n* var str = 'Hello World';\n* var out = replace( str, /world/i, 'Mr. President' );\n* // returns 'Hello Mr. President'\n*\n* @example\n* import capitalize from '@stdlib/string-base-capitalize';\n*\n* var str = 'Oranges and lemons say the bells of St. Clement\\'s';\n*\n* function replacer( match, p1 ) {\n* return capitalize( p1 );\n* }\n*\n* var out = replace( str, /([^\\s]*)/gi, replacer );\n* // returns 'Oranges And Lemons Say The Bells Of St. Clement\\'s'\n*/\nfunction replace( str, search, newval ) {\n\treturn str.replace( search, newval );\n}\n\n\n// EXPORTS //\n\nexport default replace;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport rescape from '@stdlib/utils-escape-regexp-string';\nimport isFunction from '@stdlib/assert-is-function';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isRegExp from '@stdlib/assert-is-regexp';\nimport format from '@stdlib/string-format';\nimport base from '@stdlib/string-base-replace';\n\n\n// MAIN //\n\n/**\n* Replaces search occurrences with a replacement string.\n*\n* @param {string} str - input string\n* @param {(string|RegExp)} search - search expression\n* @param {(string|Function)} newval - replacement value or function\n* @throws {TypeError} first argument must be a string\n* @throws {TypeError} second argument must be a string or regular expression\n* @throws {TypeError} third argument must be a string or function\n* @returns {string} new string containing replacement(s)\n*\n* @example\n* var str = 'beep';\n* var out = replace( str, 'e', 'o' );\n* // returns 'boop'\n*\n* @example\n* var str = 'Hello World';\n* var out = replace( str, /world/i, 'Mr. President' );\n* // returns 'Hello Mr. President'\n*\n* @example\n* import capitalize from '@stdlib/string-capitalize';\n*\n* var str = 'Oranges and lemons say the bells of St. Clement\\'s';\n*\n* function replacer( match, p1 ) {\n* return capitalize( p1 );\n* }\n*\n* var out = replace( str, /([^\\s]*)/gi, replacer );\n* // returns 'Oranges And Lemons Say The Bells Of St. Clement\\'s'\n*/\nfunction replace( str, search, newval ) {\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', str ) );\n\t}\n\tif ( isString( search ) ) {\n\t\tsearch = new RegExp( rescape( search ), 'g' );\n\t} else if ( !isRegExp( search ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a string or regular expression. Value: `%s`.', search ) );\n\t}\n\tif ( !isString( newval ) && !isFunction( newval ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a string or replacement function. Value: `%s`.', newval ) );\n\t}\n\treturn base( str, search, newval );\n}\n\n\n// EXPORTS //\n\nexport default replace;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport replace from '@stdlib/string-replace';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// VARIABLES //\n\nvar CTORS = {\n\t'int8': 'new Int8Array( [ {{data}} ] )',\n\t'uint8': 'new Uint8Array( [ {{data}} ] )',\n\t'uint8c': 'new Uint8ClampedArray( [ {{data}} ] )',\n\t'int16': 'new Int16Array( [ {{data}} ] )',\n\t'uint16': 'new Uint16Array( [ {{data}} ] )',\n\t'int32': 'new Int32Array( [ {{data}} ] )',\n\t'uint32': 'new Uint32Array( [ {{data}} ] )',\n\t'float32': 'new Float32Array( [ {{data}} ] )',\n\t'float64': 'new Float64Array( [ {{data}} ] )',\n\t'generic': '[ {{data}} ]',\n\t'binary': 'new Buffer( [ {{data}} ] )',\n\t'complex64': 'new Complex64Array( [ {{data}} ] )',\n\t'complex128': 'new Complex128Array( [ {{data}} ] )',\n\t'bool': 'new BooleanArray( [ {{data}} ] )'\n};\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {string} string representation\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar buffer;\n\tvar ndims;\n\tvar ctor;\n\tvar str;\n\tvar dt;\n\tvar v;\n\tvar i;\n\n\tndims = this._shape.length;\n\tdt = this._dtype;\n\n\t// Function to invoke to create an ndarray:\n\tstr = 'ndarray( \\''+dt+'\\', ';\n\n\t// Data buffer parameter...\n\tbuffer = '';\n\tif ( this._length <= 100 ) {\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// First three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuffer += ', ..., ';\n\n\t\t// Last three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tv = this.iget( this._length-1-i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tbuffer += this.iget( this._length-1-i );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tctor = CTORS[ this.dtype ];\n\tstr += replace( ctor, '{{data}}', buffer );\n\tstr += ', ';\n\n\t// Array shape...\n\tif ( ndims === 0 ) {\n\t\tstr += '[]';\n\t} else {\n\t\tstr += '[ ' + this._shape.join( ', ' ) + ' ]';\n\t}\n\tstr += ', ';\n\n\t// Stride array...\n\tstr += '[ ';\n\tif ( ndims === 0 ) {\n\t\tstr += '0';\n\t} else {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( this._strides[ i ] < 0 ) {\n\t\t\t\tstr += -this._strides[ i ];\n\t\t\t} else {\n\t\t\t\tstr += this._strides[ i ];\n\t\t\t}\n\t\t\tif ( i < ndims-1 ) {\n\t\t\t\tstr += ', ';\n\t\t\t}\n\t\t}\n\t}\n\tstr += ' ]';\n\tstr += ', ';\n\n\t// Buffer offset:\n\tstr += '0';\n\tstr += ', ';\n\n\t// Order:\n\tstr += '\\'' + this._order + '\\'';\n\n\t// Close the function call:\n\tstr += ' )';\n\treturn str;\n\n\t/* eslint-enable no-invalid-this */\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// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint16Array from '@stdlib/array-uint16';\n\n\n// MAIN //\n\nvar ctors = {\n\t'uint16': Uint16Array,\n\t'uint8': Uint8Array\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctors from './ctors.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if an environment is little endian.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment is little endian\n*\n* @example\n* var bool = isLittleEndian();\n* // returns \n*/\nfunction isLittleEndian() {\n\tvar uint16view;\n\tvar uint8view;\n\n\tuint16view = new ctors[ 'uint16' ]( 1 );\n\n\t/*\n\t* Set the uint16 view to a value having distinguishable lower and higher order words.\n\t*\n\t* 4660 => 0x1234 => 0x12 0x34 => '00010010 00110100' => (0x12,0x34) == (18,52)\n\t*/\n\tuint16view[ 0 ] = 0x1234;\n\n\t// Create a uint8 view on top of the uint16 buffer:\n\tuint8view = new ctors[ 'uint8' ]( uint16view.buffer );\n\n\t// If little endian, the least significant byte will be first...\n\treturn ( uint8view[ 0 ] === 0x34 );\n}\n\n\n// MAIN //\n\nbool = isLittleEndian();\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 main = ( typeof ArrayBuffer === 'function' ) ? ArrayBuffer : 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 ArrayBuffer === 'function' ) ? ArrayBuffer : 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* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\n*\n* @module @stdlib/array-buffer\n*\n* @example\n* import ctor from '@stdlib/array-buffer';\n*\n* var buf = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasArrayBufferSupport from '@stdlib/assert-has-arraybuffer-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasArrayBufferSupport() ) {\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 isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport Float64Array from '@stdlib/array-float64';\nimport GlobalArrayBuffer from './arraybuffer.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `ArrayBuffer` support.\n*\n* @returns {boolean} boolean indicating if an environment has `ArrayBuffer` support\n*\n* @example\n* var bool = hasArrayBufferSupport();\n* // returns \n*/\nfunction hasArrayBufferSupport() {\n\tvar bool;\n\tvar view;\n\tvar buf;\n\n\tif ( typeof GlobalArrayBuffer !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tbuf = new GlobalArrayBuffer( 16 );\n\t\tbool = ( isArrayBuffer( buf ) && typeof GlobalArrayBuffer.isView === 'function' );\n\t\tif ( bool ) {\n\t\t\tview = new Float64Array( buf );\n\t\t\tview[ 0 ] = -3.14;\n\t\t\tview[ 1 ] = NaN;\n\t\t\tbool = (\n\t\t\t\tbool &&\n\t\t\t\tGlobalArrayBuffer.isView( view ) &&\n\t\t\t\tbuf.byteLength === 16 &&\n\t\t\t\tview[ 0 ] === -3.14 &&\n\t\t\t\tview[ 1 ] !== view[ 1 ]\n\t\t\t);\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 hasArrayBufferSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\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) 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 nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasDataView = ( typeof DataView === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `DataView`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a DataView\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n* import DataView from '@stdlib/array-dataview';\n*\n* var bool = isDataView( new DataView( new ArrayBuffer( 10 ) ) );\n* // returns true\n*\n* @example\n* var bool = isDataView( [] );\n* // returns false\n*/\nfunction isDataView( value ) {\n\treturn (\n\t\t( hasDataView && value instanceof DataView ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object DataView]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataView;\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\nvar main = ( typeof DataView === 'function' ) ? DataView : 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) 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\nvar ctor = ( typeof DataView === 'function' ) ? DataView : 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) 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* Constructor which returns a data view representing a provided array buffer.\n*\n* @module @stdlib/array-dataview\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n* import DataView from '@stdlib/array-dataview';\n*\n* var buf = new ArrayBuffer( 10 );\n* // returns \n*\n* var dv = new DataView( buf );\n* // returns \n*/\n\n// MODULES //\n\nimport hasDataViewSupport from '@stdlib/assert-has-dataview-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasDataViewSupport() ) {\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) 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 isDataView from '@stdlib/assert-is-dataview';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport GlobalDataView from './dataview.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `DataView` support.\n*\n* @returns {boolean} boolean indicating if an environment has `DataView` support\n*\n* @example\n* var bool = hasDataViewSupport();\n* // returns \n*/\nfunction hasDataViewSupport() {\n\tvar bool;\n\tvar view;\n\tvar buf;\n\n\tif ( typeof GlobalDataView !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tbuf = new ArrayBuffer( 24 );\n\t\tview = new GlobalDataView( buf, 8 );\n\t\tbool = ( isDataView( view ) && typeof view.getFloat64 === 'function' && typeof view.setFloat64 === 'function' );\n\t\tif ( bool ) {\n\t\t\tview.setFloat64( 0, -3.14 );\n\t\t\tview.setFloat64( 8, NaN );\n\t\t\tbool = (\n\t\t\t\tbool &&\n\t\t\t\tview.buffer === buf &&\n\t\t\t\tview.byteLength === 16 &&\n\t\t\t\tview.byteOffset === 8 &&\n\t\t\t\tview.getFloat64( 0 ) === -3.14 &&\n\t\t\t\tview.getFloat64( 8 ) !== view.getFloat64( 8 )\n\t\t\t);\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 hasDataViewSupport;\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// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Constructor which returns a data view representing a provided array buffer.\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) 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/* global BigInt */\n\n'use strict';\n\n// MAIN //\n\nvar BigInteger = ( typeof BigInt === 'function' ) ? BigInt : void 0; // eslint-disable-line stdlib/require-globals, node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default BigInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ORDERS from './orders.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray orders.\n*\n* @returns {StringArray} list of ndarray orders\n*\n* @example\n* var list = orders();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\nfunction orders() {\n\treturn ORDERS.slice();\n}\n\n\n// EXPORTS //\n\nexport default orders;\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/**\n* Returns an object mapping supported layouts to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `row-major == 101`). Instead, the object should be used in an opaque manner.\n* - The main purpose of this function is JavaScript and C inter-operation of array objects.\n*\n* @returns {Object} object mapping supported layouts to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `layouts.h` enumeration!!!!\n\treturn {\n\t\t// Row-major (C-style):\n\t\t'row-major': 101,\n\n\t\t// Column-major (Fortran-style):\n\t\t'column-major': 102\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\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/**\n* Return a list of BLAS memory layouts.\n*\n* @module @stdlib/blas-base-layouts\n*\n* @example\n* import layouts from '@stdlib/blas-base-layouts';\n*\n* var list = layouts();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\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// MODULES //\n\nimport DATA from './data.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of BLAS memory layouts.\n*\n* @returns {StringArray} list of memory layouts\n*\n* @example\n* var list = layouts();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\nfunction layouts() {\n\treturn DATA.slice();\n}\n\n\n// EXPORTS //\n\nexport default layouts;\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 { enum as layouts } from '@stdlib/blas-base-layouts';\n\n\n// VARIABLES //\n\nvar LAYOUTS = layouts();\n\n\n// MAIN //\n\n/**\n* Returns an object mapping supported orders to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `row-major == 1`). 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 orders to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `orders.h` enumeration!!!!\n\treturn {\n\t\t// Row-major (C-style):\n\t\t'row-major': LAYOUTS[ 'row-major' ],\n\n\t\t// Column-major (Fortran-style):\n\t\t'column-major': LAYOUTS[ 'column-major' ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 list of ndarray orders.\n*\n* @module @stdlib/ndarray-orders\n*\n* @example\n* import orders from '@stdlib/ndarray-orders';\n*\n* var list = orders();\n* // e.g., returns [ 'row-major', 'column-major' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\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 MODES from './modes.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray index modes.\n*\n* @returns {StringArray} list of ndarray index modes\n*\n* @example\n* var list = modes();\n* // returns [ 'throw', 'normalize', 'clamp', 'wrap' ]\n*/\nfunction modes() {\n\treturn MODES.slice();\n}\n\n\n// EXPORTS //\n\nexport default modes;\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 an object mapping supported index modes to integer values for purposes of C inter-operation.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `throw == 1`). 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 index modes to integer values\n*\n* @example\n* var table = enumerated();\n* // returns \n*/\nfunction enumerated() {\n\t// NOTE: the following should match the C `index_modes.h` enumeration!!!!\n\treturn {\n\t\t'throw': 1,\n\t\t'clamp': 2,\n\t\t'wrap': 3,\n\t\t'normalize': 4\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumerated;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 list of ndarray index modes.\n*\n* @module @stdlib/ndarray-index-modes\n*\n* @example\n* import modes from '@stdlib/ndarray-index-modes';\n*\n* var list = modes();\n* // returns [ 'throw', 'normalize', 'clamp', 'wrap' ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport modes from './main.js';\nimport enumeration from './enum.js';\n\n\n// MAIN //\n\nsetReadOnly( modes, 'enum', enumeration );\n\n\n// EXPORTS //\n\nexport default modes;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport BigInt from '@stdlib/bigint-ctor';\nimport dtypes from '@stdlib/ndarray-base-dtype-enums';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* [int8],\n* [int16],\n* [int64],\n* [ndims*int64],\n* [ndims*int64],\n* [int64],\n* [int8],\n* [int8],\n* [int64],\n* [nsubmodes*int8],\n* [int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create a view for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tv.setBigInt64( o, BigInt( N ), IS_LITTLE_ENDIAN );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv.setBigInt64( o, BigInt( sh[i] ), IS_LITTLE_ENDIAN );\n\t\tv.setBigInt64( o+s, BigInt( st[i]*nbytes ), IS_LITTLE_ENDIAN );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tv.setBigInt64( o, BigInt( this._offset*nbytes ), IS_LITTLE_ENDIAN );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tv.setBigInt64( o, BigInt( M ), IS_LITTLE_ENDIAN );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Uint8Array from '@stdlib/array-uint8';\nimport DataView from '@stdlib/array-dataview';\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// VARIABLES //\n\n// 0xFFFFFFFF = 2**32 - 1 => 11111111 11111111 11111111 11111111\nvar LOW_MASK = 0xFFFFFFFF >>> 0;\n\n// 2**32\nvar TWO_32 = 4294967296;\n\n// Byte array workspace:\nvar BYTES = new Uint8Array( 8 );\nvar VIEW = new DataView( BYTES.buffer );\n\n\n// MAIN //\n\n/**\n* Converts an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* ## Notes\n*\n* - This function assumes that the input value is less than the maximum safe double-precision floating-point integer plus one (i.e., `2**53`).\n*\n* @param {number} x - input value\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* import Uint8Array from '@stdlib/array-uint8';\n*\n* var out = new Uint8Array( 8 );\n* var bytes = float64ToInt64Bytes( 1.0, out, 1, 0 );\n* // returns \n*/\nfunction float64ToInt64Bytes( x, out, stride, offset ) {\n\tvar hi;\n\tvar lo;\n\tvar i;\n\n\tif ( x === 0 ) {\n\t\tfor ( i = 0; i < BYTES.length; i++ ) {\n\t\t\tout[ offset ] = 0;\n\t\t\toffset += stride;\n\t\t}\n\t\treturn out;\n\t}\n\t// Get the low 32-bit word:\n\tlo = (x&LOW_MASK)>>>0;\n\n\t// Get the high 32-bit word:\n\thi = floor( x/TWO_32 );\n\n\t// Insert the high and low words according to host byte order (endianness):\n\tif ( IS_LITTLE_ENDIAN ) {\n\t\tVIEW.setUint32( 0, lo, IS_LITTLE_ENDIAN );\n\t\tVIEW.setUint32( 4, hi, IS_LITTLE_ENDIAN );\n\t} else {\n\t\tVIEW.setUint32( 0, hi, IS_LITTLE_ENDIAN );\n\t\tVIEW.setUint32( 4, lo, IS_LITTLE_ENDIAN );\n\t}\n\tfor ( i = 0; i < BYTES.length; i++ ) {\n\t\tout[ offset ] = BYTES[ i ];\n\t\toffset += stride;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default float64ToInt64Bytes;\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* Convert an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* @module @stdlib/number-float64-base-to-int64-bytes\n*\n* @example\n* import float64ToInt64Bytes from '@stdlib/number-float64-base-to-int64-bytes';\n*\n* var bytes = float64ToInt64Bytes( 1.0 );\n* // returns \n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n* import float64ToInt64Bytes from '@stdlib/number-float64-base-to-int64-bytes';\n*\n* var out = new Uint8Array( 8 );\n* var bytes = float64ToInt64Bytes( 1.0, out, 1, 0 );\n* // returns \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) 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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Uint8Array from '@stdlib/array-uint8';\nimport DataView from '@stdlib/array-dataview';\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// VARIABLES //\n\n// 0xFFFFFFFF = 2**32 - 1 => 11111111 11111111 11111111 11111111\nvar LOW_MASK = 0xFFFFFFFF >>> 0;\n\n// 2**32\nvar TWO_32 = 4294967296;\n\n\n// MAIN //\n\n/**\n* Converts an integer-valued double-precision floating-point number to a signed 64-bit integer byte array according to host byte order (endianness).\n*\n* ## Notes\n*\n* - This function assumes that the input value is less than the maximum safe double-precision floating-point integer plus one (i.e., `2**53`).\n*\n* @param {number} x - input value\n* @returns {Uint8Array} byte array\n*\n* @example\n* var bytes = float64ToInt64Bytes( 1.0 );\n* // returns \n*/\nfunction float64ToInt64Bytes( x ) {\n\tvar bytes;\n\tvar view;\n\tvar hi;\n\tvar lo;\n\n\tbytes = new Uint8Array( 8 );\n\tif ( x === 0 ) {\n\t\treturn bytes;\n\t}\n\t// Get the low 32-bit word:\n\tlo = (x&LOW_MASK)>>>0;\n\n\t// Get the high 32-bit word:\n\thi = floor( x/TWO_32 );\n\n\t// Insert the high and low words according to host byte order (endianness):\n\tview = new DataView( bytes.buffer );\n\tif ( IS_LITTLE_ENDIAN ) {\n\t\tview.setUint32( 0, lo, IS_LITTLE_ENDIAN );\n\t\tview.setUint32( 4, hi, IS_LITTLE_ENDIAN );\n\t} else {\n\t\tview.setUint32( 0, hi, IS_LITTLE_ENDIAN );\n\t\tview.setUint32( 4, lo, IS_LITTLE_ENDIAN );\n\t}\n\treturn bytes;\n}\n\n\n// EXPORTS //\n\nexport default float64ToInt64Bytes;\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 IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport Uint8Array from '@stdlib/array-uint8';\nimport dtypes from '@stdlib/ndarray-base-dtype-enums';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\nimport { assign as float64ToInt64Bytes } from '@stdlib/number-float64-base-to-int64-bytes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* [int8],\n* [int16],\n* [int64],\n* [ndims*int64],\n* [ndims*int64],\n* [int64],\n* [int8],\n* [int8],\n* [int64],\n* [nsubmodes*int8],\n* [int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar bytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create views for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\tbytes = new Uint8Array( v.buffer );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tfloat64ToInt64Bytes( N, bytes, 1, o );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tfloat64ToInt64Bytes( sh[i], bytes, 1, o );\n\t\tfloat64ToInt64Bytes( st[i]*nbytes, bytes, 1, o+s );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tfloat64ToInt64Bytes( this._offset*nbytes, bytes, 1, o );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tfloat64ToInt64Bytes( M, bytes, 1, o );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 hasBigIntSupport from '@stdlib/assert-has-bigint-support';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport iterationOrder from '@stdlib/ndarray-base-iteration-order';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport slice from '@stdlib/array-base-slice';\nimport Boolean from '@stdlib/boolean-ctor';\nimport isColumnMajorContiguous from './is_column_major_contiguous.js';\nimport isRowMajorContiguous from './is_row_major_contiguous.js';\nimport isContiguous from './is_contiguous.js';\nimport copyFlags from './copy_flags.js';\nimport igetValue from './iget.js';\nimport isetValue from './iset.js';\nimport setValue from './set.js';\nimport getValue from './get.js';\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\nimport toJSON from './tojson.js';\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\nimport meta2dataview from './meta2dataview.js';\nimport meta2dataviewPolyfill from './meta2dataview.polyfill.js';\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* ## Notes\n*\n* - To create a zero-dimensional array,\n*\n* ```javascript\n* var buffer = [ 1 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n* ```\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {(ArrayLikeObject|TypedArray|Buffer)} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order ) {\n\tvar contiguous;\n\tvar nbytes;\n\tvar ord;\n\tvar len;\n\tvar i;\n\tif ( !(this instanceof ndarray) ) {\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t}\n\t// Compute the number of elements...\n\tlen = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tlen *= shape[ i ]; // TODO: consider supporting accessor arrays here\n\t}\n\t// Compute the number of bytes...\n\tif ( buffer.BYTES_PER_ELEMENT ) {\n\t\tnbytes = buffer.BYTES_PER_ELEMENT * len;\n\t} else {\n\t\tnbytes = null;\n\t}\n\t// Set private properties...\n\tthis._byteLength = nbytes;\n\tthis._bytesPerElement = bytesPerElement( dtype );\n\tthis._buffer = buffer;\n\tthis._dtype = dtype;\n\tthis._length = len;\n\tthis._ndims = shape.length;\n\tthis._offset = offset;\n\tthis._order = order;\n\tthis._shape = shape;\n\tthis._strides = strides;\n\tthis._accessors = Boolean( buffer.get && buffer.set );\n\n\tthis._iterationOrder = iterationOrder( strides );\n\n\t// Determine if the array can be stored contiguously:\n\tcontiguous = isContiguous( len, shape, strides, offset, this._iterationOrder ); // eslint-disable-line max-len\n\n\t// Infer the array \"order\" from the stride array (this is supplementary to the `order` parameter):\n\tord = strides2order( strides );\n\n\tthis._flags = {\n\t\t'ROW_MAJOR_CONTIGUOUS': isRowMajorContiguous( ord, contiguous ),\n\t\t'COLUMN_MAJOR_CONTIGUOUS': isColumnMajorContiguous( ord, contiguous ),\n\t\t'READONLY': false\n\t};\n\n\t// Initialize a property for caching serialized meta data:\n\tthis.__meta_dataview__ = null;\n\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Size (in bytes) of the array (if known).\n*\n* @name byteLength\n* @memberof ndarray.prototype\n* @type {(NonNegativeInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var byteLength = x.byteLength;\n* // returns 48\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Size (in bytes) of each array element (if known).\n*\n* @name BYTES_PER_ELEMENT\n* @memberof ndarray.prototype\n* @type {(PositiveInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var nbytes = x.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'BYTES_PER_ELEMENT', function get() {\n\treturn this._bytesPerElement;\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name data\n* @memberof ndarray.prototype\n* @type {(Array|TypedArray|Buffer)}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var data = x.data;\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'data', function get() {\n\treturn this._buffer;\n});\n\n/**\n* Underlying data type.\n*\n* @name dtype\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dtype = x.dtype;\n* // returns 'generic'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'dtype', function get() {\n\treturn this._dtype;\n});\n\n/**\n* Meta information, such as information concerning the memory layout of the array.\n*\n* @name flags\n* @memberof ndarray.prototype\n* @type {Object}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var flgs = x.flags;\n* // returns \n*/\nsetReadOnlyAccessor( ndarray.prototype, 'flags', function get() {\n\treturn copyFlags( this._flags );\n});\n\n/**\n* Length of the array.\n*\n* @name length\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var len = x.length;\n* // returns 6\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Number of dimensions.\n*\n* @name ndims\n* @memberof ndarray.prototype\n* @type {PositiveInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var ndims = x.ndims;\n* // returns 2\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'ndims', function get() {\n\treturn this._ndims;\n});\n\n/**\n* Index offset which specifies the buffer index at which to start iterating over array elements.\n*\n* @name offset\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.offset;\n* // returns 0\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'offset', function get() {\n\treturn this._offset;\n});\n\n/**\n* Array order.\n*\n* ## Notes\n*\n* - The array order is either row-major (C-style) or column-major (Fortran-style).\n*\n* @name order\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var order = x.order;\n* // returns 'row-major'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'order', function get() {\n\treturn this._order;\n});\n\n/**\n* Shape of the array.\n*\n* @name shape\n* @memberof ndarray.prototype\n* @type {NonNegativeIntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.shape;\n* // returns [ 3, 2 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'shape', function get() {\n\treturn slice( this._shape, 0, this._shape.length );\n});\n\n/**\n* Index strides which specify how to access data along corresponding array dimensions.\n*\n* @name strides\n* @memberof ndarray.prototype\n* @type {IntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.strides;\n* // returns [ 2, 1 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'strides', function get() {\n\treturn slice( this._strides, 0, this._strides.length );\n});\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', getValue );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', igetValue );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', setValue );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', isetValue );\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toString\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {string} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var str = x.toString();\n* // returns \"ndarray( 'generic', [ 3, 4, 5, 6, 7, 8 ], [ 3, 2 ], [ 2, 1 ], 0, 'row-major' )\"\n*/\nsetReadOnly( ndarray.prototype, 'toString', toString );\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying an `ndarray` instance.\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toJSON\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {Object} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.toJSON();\n* // e.g., returns { 'type': 'ndarray', 'dtype': 'generic', 'flags': {...}, 'offset': 0, 'order': 'row-major', 'shape': [ 3, 2 ], 'strides': [ 2, 1 ], 'data': [ 3, 4, 5, 6, 7, 8 ] }\n*/\nsetReadOnly( ndarray.prototype, 'toJSON', toJSON );\n\n/**\n* Converts an ndarray instance to a primitive value.\n*\n* ## Notes\n*\n* - Only zero-dimensional ndarrays are converted to a primitive value. For ndarray instances having one or more dimensions, the method returns the `this` value, as is the default behavior for objects.\n*\n* @name valueOf\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {(*|ndarray)} result\n*\n* @example\n* var buffer = [ 3.14 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.valueOf();\n* // returns 3.14\n*\n* @example\n* var buffer = [ 3.14 ];\n* var shape = [ 1 ];\n* var strides = [ 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.valueOf();\n* // returns \n*/\nsetReadOnly( ndarray.prototype, 'valueOf', valueOf );\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - Meta data format:\n*\n* ```text\n* | (1 byte) | (2 bytes) | (8 bytes) | (ndims*8 bytes) | (ndims*8 bytes) | (8 bytes) | (1 byte) | (1 byte) | (8 bytes) | (nsubmodes*1 bytes) | (4 bytes) |\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Consumers of this method should treat the returned `DataView` as **immutable**. Otherwise, mutation can invalidate meta data and potentially affect other consumers.\n*\n* @private\n* @name __array_meta_dataview__\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {DataView} serialized meta data\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dv = x.__array_meta_dataview__();\n* // returns \n*/\nsetReadOnly( ndarray.prototype, '__array_meta_dataview__', ( hasBigIntSupport() ) ? meta2dataview : meta2dataviewPolyfill );\n\n\n// EXPORTS //\n\nexport default ndarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n\n\n// MAIN //\n\n/**\n* Determines if an array is contiguous.\n*\n* @private\n* @param {NonNegativeInteger} len - array length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {integer} iterationOrder - iteration order\n* @returns {boolean} boolean indicating if an array is contiguous\n*/\nfunction isContiguous( len, shape, strides, offset, iterationOrder ) {\n\tvar buf;\n\n\t// If an array does not contain any elements, then no data to store, and, if the array is unordered, adjacent array elements are not guaranteed to be stored next to each other.\n\tif ( len === 0 || iterationOrder === 0 ) {\n\t\treturn false;\n\t}\n\t// Ensure that the array is compatible with a single memory segment:\n\tbuf = minmaxViewBufferIndex( shape, strides, offset );\n\treturn ( len === ( buf[1]-buf[0]+1 ) );\n}\n\n\n// EXPORTS //\n\nexport default isContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ndarray from '@stdlib/ndarray-base-ctor';\n\n\n// MAIN //\n\n/**\n* Tests if a value is ndarray-like.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating if a value is ndarray-like\n*\n* @example\n* import ndarray from '@stdlib/ndarray-ctor';\n*\n* var arr = ndarray( 'generic', [ 0, 0, 0, 0 ], [ 2, 2 ], [ 2, 1 ], 0, 'row-major' );\n*\n* var bool = isndarrayLike( arr );\n* // returns true\n*\n* bool = isndarrayLike( [] );\n* // returns false\n*/\nfunction isndarrayLike( v ) {\n\treturn (\n\t\tv instanceof ndarray ||\n\t\t(\n\t\t\tv !== null &&\n\t\t\ttypeof v === 'object' &&\n\t\t\ttypeof v.data === 'object' &&\n\t\t\ttypeof v.shape === 'object' &&\n\t\t\ttypeof v.strides === 'object' &&\n\t\t\ttypeof v.offset === 'number' &&\n\t\t\ttypeof v.order === 'string' &&\n\t\t\ttypeof v.ndims === 'number' &&\n\t\t\tv.dtype &&\n\t\t\ttypeof v.length === 'number' &&\n\t\t\ttypeof v.flags === 'object' &&\n\t\t\ttypeof v.get === 'function' &&\n\t\t\ttypeof v.set === 'function'\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isndarrayLike;\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* Tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @param {*} value - search value\n* @returns {boolean} boolean indicating if an array contains a search value\n*\n* @example\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\nfunction contains( x, value ) {\n\tvar len;\n\tvar get;\n\tvar dt;\n\tvar i;\n\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tif ( get( x, i ) === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default contains;\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 isCollection from '@stdlib/assert-is-collection';\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport dtype from '@stdlib/array-dtype';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function to tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @throws {TypeError} must provide an array-like object\n* @returns {Function} function to test if an array contains a search value\n*\n* @example\n* var contains = factory( [ 1, 2, 3 ] );\n* // returns \n*\n* var bool = contains( 2 );\n* // returns true\n*/\nfunction factory( x ) {\n\tvar get;\n\tvar len;\n\tvar dt;\n\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an array-like object. Value: `%s`.', x ) );\n\t}\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\treturn ( get === void 0 ) ? contains : accessors;\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*\n\t* @example\n\t* var out = contains( [ 1, 2, 3 ], 2 );\n\t* // returns true\n\t*/\n\tfunction contains( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( x[ i ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*/\n\tfunction accessors( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( get( x, i ) === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 ndarray flags.\n*\n* @private\n* @param {Object} flags - flags\n* @returns {Object} copy of input object\n*/\nfunction copyFlags( flags ) {\n\treturn {\n\t\t'ROW_MAJOR_CONTIGUOUS': flags.ROW_MAJOR_CONTIGUOUS,\n\t\t'COLUMN_MAJOR_CONTIGUOUS': flags.COLUMN_MAJOR_CONTIGUOUS,\n\t\t'READONLY': flags.READONLY\n\t};\n}\n\n\n// EXPORTS //\n\nexport default copyFlags;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} idx - indices\n* @returns {*} array element\n*/\nfunction get() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nexport default get;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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// MAIN //\n\n/**\n* Returns an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( this._offset );\n\t\t}\n\t\treturn this._buffer[ this._offset ];\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this._offset+idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset+idx ];\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this.offset-idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset-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\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( isColumnMajor( this._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\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( ind );\n\t\t}\n\t\treturn this._buffer[ 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\tif ( this._accessors ) {\n\t\treturn this._buffer.get( ind );\n\t}\n\treturn this._buffer[ ind ];\n}\n\n\n// EXPORTS //\n\nexport default iget;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default set;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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// MAIN //\n\n/**\n* Sets an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( idx, this._offset );\n\t\t} else {\n\t\t\tthis._buffer[ this._offset ] = idx;\n\t\t}\n\t\treturn this;\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset+idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset+idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset-idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset-idx ] = v;\n\t\t\t}\n\t\t\treturn this;\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\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( isColumnMajor( this._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\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( v, ind );\n\t\t} else {\n\t\t\tthis._buffer[ ind ] = v;\n\t\t}\n\t\treturn this;\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\tif ( this._accessors ) {\n\t\tthis._buffer.set( v, ind );\n\t} else {\n\t\tthis._buffer[ ind ] = v;\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default iset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tlen = this._length;\n\n\t// Build an object containing all ndarray properties needed to revive a serialized ndarray...\n\tout = {};\n\tout.type = 'ndarray';\n\tout.dtype = this.dtype;\n\tout.flags = {\n\t\t'READONLY': this._flags.READONLY\n\t};\n\tout.order = this._order;\n\tout.shape = this._shape.slice();\n\tout.strides = this._strides.slice();\n\n\t// Flip the signs of negative strides:\n\tfor ( i = 0; i < out.strides.length; i++ ) {\n\t\tif ( out.strides[ i ] < 0 ) {\n\t\t\tout.strides[ i ] *= -1;\n\t\t}\n\t}\n\t// Cast data to generic array...\n\tout.data = [];\n\tif ( out.dtype === 'complex64' || out.dtype === 'complex128' ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tv = this.iget( i );\n\t\t\tout.data.push( real( v ), imag( v ) );\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tout.data.push( this.iget( i ) );\n\t\t}\n\t}\n\treturn out;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\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* Converts an ndarray instance to a primitive value.\n*\n* ## Notes\n*\n* - Only zero-dimensional ndarrays are converted to a primitive value. For ndarray instances having one or more dimensions, the method returns the `this` value, as is the default behavior for objects.\n*\n* @private\n* @returns {(*|ndarray)} result\n*/\nfunction valueOf() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tif ( this._ndims === 0 ) {\n\t\treturn this.iget();\n\t}\n\treturn this;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default valueOf;\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/**\n* Test if an array contains a provided search value.\n*\n* @module @stdlib/array-base-assert-contains\n*\n* @example\n* import contains from '@stdlib/array-base-assert-contains';\n*\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport factory from './factory.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nexport default main;\n\n// exports: { \"factory\": \"main.factory\" }\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 replace from '@stdlib/string-base-replace';\nimport DTYPES from './dtypes.json';\n\n\n// VARIABLES //\n\nvar RE_SUFFIX = /_and_generic$/;\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data type strings.\n*\n* @param {string} [kind] - data type kind\n* @returns {Array} list of ndarray data type strings\n*\n* @example\n* var list = dtypeStrings();\n* // returns [...]\n*\n* @example\n* var list = dtypeStrings( 'floating_point' );\n* // returns [...]\n*/\nfunction dtypeStrings() {\n\tvar kind;\n\tvar out;\n\tvar FLG;\n\tif ( arguments.length === 0 ) {\n\t\treturn DTYPES.all.slice();\n\t}\n\tFLG = false;\n\tkind = arguments[ 0 ];\n\tif ( RE_SUFFIX.test( kind ) ) {\n\t\tkind = replace( kind, RE_SUFFIX, '' );\n\t\tif ( kind !== 'all' && kind !== 'index' ) {\n\t\t\tFLG = true;\n\t\t}\n\t}\n\tout = DTYPES[ kind ];\n\tout = ( out ) ? out.slice() : [];\n\tif ( FLG && out.length > 0 ) {\n\t\tout.push( 'generic' );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypeStrings;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported built-in ndarray data type string.\n*\n* @name isDataTypeString\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported built-in ndarray data type string\n*\n* @example\n* var bool = isDataTypeString( 'binary' );\n* // returns true\n*\n* bool = isDataTypeString( 'float32' );\n* // returns true\n*\n* bool = isDataTypeString( 'float64' );\n* // returns true\n*\n* bool = isDataTypeString( 'generic' );\n* // returns true\n*\n* bool = isDataTypeString( 'int16' );\n* // returns true\n*\n* bool = isDataTypeString( 'int32' );\n* // returns true\n*\n* bool = isDataTypeString( 'int8' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint16' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint32' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint8' );\n* // returns true\n*\n* bool = isDataTypeString( 'uint8c' );\n* // returns true\n*\n* bool = isDataTypeString( 'foo' );\n* // returns false\n*/\nvar isDataTypeString = contains( dtypes() );\n\n\n// EXPORTS //\n\nexport default isDataTypeString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport isFunction from '@stdlib/assert-is-function';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\n\n\n// MAIN //\n\n/**\n* Tests if a value is struct constructor-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is struct constructor-like\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema = [\n* {\n* 'name': 'foo',\n* 'type': 'float64'\n* }\n* ];\n* var Struct = structFactory( schema );\n*\n* var bool = isStructConstructorLike( Struct );\n* // returns true\n*\n* bool = isStructConstructorLike( [] );\n* // returns false\n*/\nfunction isStructConstructorLike( value ) {\n\treturn (\n\t\tisFunction( value ) &&\n\t\tisPositiveInteger( value.alignment ) &&\n\t\tisPositiveInteger( value.byteLength ) &&\n\t\tisFunction( value.byteLengthOf ) &&\n\t\tisFunction( value.byteOffsetOf ) &&\n\t\tisFunction( value.bufferOf ) &&\n\t\tisFunction( value.isStruct ) &&\n\t\tisFunction( value.viewOf ) &&\n\t\thasOwnProp( value, 'fields' ) &&\n\t\thasOwnProp( value, 'layout' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructConstructorLike;\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 isNumber } from '@stdlib/assert-is-number';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar ENUM = dtypeEnums();\n\n\n// MAIN //\n\n/**\n* Returns the enumeration constant associated with an ndarray data type string.\n*\n* ## Notes\n*\n* - Downstream consumers of this function should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the function should be used in an opaque manner.\n*\n* @param {string} dtype - data type string\n* @returns {(integer|null)} integer value or null\n*\n* @example\n* var v = str2enum( 'int8' );\n* // returns \n*/\nfunction str2enum( dtype ) {\n\tvar v = ENUM[ dtype ];\n\treturn ( isNumber( v ) ) ? v : null; // note: we include this guard to prevent walking the prototype chain\n}\n\n\n// EXPORTS //\n\nexport default str2enum;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the description for a provided data type.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|string|null)} description(s)\n*\n* @example\n* var obj = dtypeDesc();\n* // returns {...}\n*\n* @example\n* var desc = dtypeDesc( 'float64' );\n* // returns '...'\n*\n* desc = dtypeDesc( 'generic' );\n* // returns '...'\n*/\nfunction dtypeDesc( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\treturn TABLE[ resolve( dtype ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeDesc;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the single letter character abbreviation for an underlying array data type.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|string|null)} single letter character abbreviation(s)\n*\n* @example\n* var obj = dtypeChar();\n* // returns {...}\n*\n* @example\n* var ch = dtypeChar( 'float64' );\n* // returns 'd'\n*\n* ch = dtypeChar( 'generic' );\n* // returns 'o'\n*/\nfunction dtypeChar( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\treturn TABLE[ resolve( dtype ) ] || null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeChar;\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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport table from './table.js';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// MAIN //\n\n/**\n* Returns the alignment (in bytes) for an underlying array data type.\n*\n* ## Notes\n*\n* - If provided an unrecognized/unsupported data type, the function returns `null`.\n*\n* @param {*} [dtype] - data type value\n* @returns {(Object|number|null)} alignment (in bytes)\n*\n* @example\n* var obj = dtypeAlignment();\n* // returns {...}\n*\n* @example\n* var out = dtypeAlignment( 'float64' );\n* // returns 8\n*\n* out = dtypeAlignment( 'generic' );\n* // returns null\n*/\nfunction dtypeAlignment( dtype ) {\n\tvar v;\n\tif ( arguments.length === 0 ) {\n\t\treturn table();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\tTABLE = table();\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.alignment;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t\treturn TABLE[ resolve( dtype ) ] || null;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default dtypeAlignment;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with a supported ndarray data type value.\n*\n* @param {*} dtype - data type value\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 = resolve( str2enum( 'float64' ) );\n* // returns 'float64'\n*/\nfunction resolve( dtype ) {\n\tvar t = ( typeof dtype );\n\tif ( t === 'string' ) {\n\t\treturn ( str2enum( dtype ) === null ) ? null : dtype;\n\t}\n\tif ( t === 'number' ) {\n\t\treturn enum2str( dtype );\n\t}\n\tif ( t === 'object' && dtype ) {\n\t\treturn String( dtype );\n\t}\n\tif ( isStructConstructorLike( dtype ) ) {\n\t\treturn dtype.layout;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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 no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport isPlainObject from '@stdlib/assert-is-plain-object';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport hasProp from '@stdlib/assert-has-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport resolveEnum from '@stdlib/ndarray-base-dtype-resolve-enum';\nimport dtype2desc from '@stdlib/ndarray-base-dtype-desc';\nimport dtype2char from '@stdlib/ndarray-base-dtype-char';\nimport dtype2alignment from '@stdlib/ndarray-base-dtype-alignment';\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport format from '@stdlib/string-format';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a `DataType`.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `DataType`\n*/\nfunction isDataType( value ) { // NOTE: we do not use `ndarray/base/assert/is-data-type-object` in order to avoid circular dependencies\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tvalue.constructor.name === 'DataType' &&\n\t\t\tisString( value.char ) &&\n\t\t\tisString( value.description ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// MAIN //\n\n/**\n* Data type constructor.\n*\n* @constructor\n* @param {*} value - data type value\n* @param {Options} [options] - constructor options\n* @param {string} [options.description] - data type description\n* @throws {TypeError} first argument must be a supported data type value\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {DataType} data type instance\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var str = dt.toString();\n* // returns 'float64'\n*/\nfunction DataType( value, options ) {\n\tvar nargs;\n\tvar type;\n\tvar opts;\n\n\tnargs = arguments.length;\n\tif ( !( this instanceof DataType ) ) {\n\t\tif ( nargs < 2 ) {\n\t\t\treturn new DataType( value );\n\t\t}\n\t\treturn new DataType( value, options );\n\t}\n\tif ( isDataTypeString( value ) ) {\n\t\ttype = 'builtin';\n\t} else if ( isDataType( value ) ) {\n\t\t// Clone the input data type:\n\t\treturn new DataType( value.value, {\n\t\t\t'description': value.description\n\t\t});\n\t} else if ( isStructConstructorLike( value ) ) {\n\t\ttype = 'struct';\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a supported data type string, a struct constructor, or another data type instance. Value: `%s`.', value ) );\n\t}\n\tif ( nargs > 1 ) {\n\t\topts = options;\n\t\tif ( !isPlainObject( 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, 'description' ) && !isString( opts.description ) ) {\n\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'description', opts.description ) );\n\t\t}\n\t} else {\n\t\topts = {};\n\t}\n\tsetReadOnly( this, '_value', value );\n\tsetReadOnly( this, '_description', opts.description || ( dtype2desc( value ) || '' ) );\n\tsetReadOnly( this, '_char', dtype2char( value ) || '' );\n\tsetReadOnly( this, '_enum', resolveEnum( value ) || -1 );\n\tsetReadOnly( this, '_alignment', dtype2alignment( value ) || -1 );\n\tsetReadOnly( this, '_byteLength', bytesPerElement( value ) || -1 );\n\tsetReadOnly( this, '_byteOrder', 'host' ); // TODO: consider supporting little-endian and big-endian byte orders\n\tsetReadOnly( this, '_type', type );\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof DataType\n* @type {string}\n* @default 'DataType'\n*\n* @example\n* var v = DataType.name;\n* // returns 'DataType'\n*/\nsetReadOnly( DataType, 'name', 'DataType' );\n\n/**\n* Alignment (in bytes) for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a known alignment, the returned value is `-1`.\n*\n* @name alignment\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.alignment;\n* // returns 8\n*/\nsetReadOnlyAccessor( DataType.prototype, 'alignment', function get() {\n\treturn this._alignment;\n});\n\n/**\n* Size (in bytes) of the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a known size, the returned value is `-1`.\n*\n* @name byteLength\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.byteLength;\n* // returns 8\n*/\nsetReadOnlyAccessor( DataType.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Data type byte order.\n*\n* ## Notes\n*\n* - Potential values:\n*\n* - **host**: host platform byte order.\n* - **little-endian**: little-endian byte order.\n* - **big-endian**: big-endian byte order.\n*\n* @name byteOrder\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.byteOrder;\n* // returns 'host'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'byteOrder', function get() {\n\treturn this._byteOrder;\n});\n\n/**\n* Single letter character abbreviation for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a corresponding single letter character abbreviation, the returned value is an empty string.\n*\n* @name char\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.char;\n* // returns 'd'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'char', function get() {\n\treturn this._char;\n});\n\n/**\n* Data type description.\n*\n* ## Notes\n*\n* - If a data type does not have an associated description, the returned value is an empty string.\n*\n* @name description\n* @memberof DataType.prototype\n* @readonly\n* @type {string}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.description;\n* // returns \n*/\nsetReadOnlyAccessor( DataType.prototype, 'description', function get() {\n\treturn this._description;\n});\n\n/**\n* Enumeration constant for the data type.\n*\n* ## Notes\n*\n* - If a data type does not have a corresponding known enumeration constant, the returned value is `-1`.\n*\n* @name enum\n* @memberof DataType.prototype\n* @readonly\n* @type {integer}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.enum;\n* // returns \n*/\nsetReadOnlyAccessor( DataType.prototype, 'enum', function get() {\n\treturn this._enum;\n});\n\n/**\n* Raw (original) data type value.\n*\n* @name value\n* @memberof DataType.prototype\n* @readonly\n* @type {*}\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.value;\n* // returns 'float64'\n*/\nsetReadOnlyAccessor( DataType.prototype, 'value', function get() {\n\treturn this._value;\n});\n\n/**\n* Serializes a data type instance as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `DataType` instance.\n*\n* @name toJSON\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {Object} serialized instance\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var o = dt.toJSON();\n* // returns {...}\n*/\nsetReadOnly( DataType.prototype, 'toJSON', function toJSON() {\n\treturn {\n\t\t'type': 'DataType',\n\t\t'value': this.toString(),\n\t\t'byteOrder': this._byteOrder,\n\t\t'description': this._description\n\t};\n});\n\n/**\n* Serializes a data type instance to a string.\n*\n* @name toString\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {string} serialized string\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.toString();\n* // returns 'float64'\n*/\nsetReadOnly( DataType.prototype, 'toString', function toString() {\n\treturn ( this._type === 'struct' ) ? this._value.layout : String( this._value );\n});\n\n/**\n* Converts a data type instance to a primitive value.\n*\n* @name valueOf\n* @memberof DataType.prototype\n* @type {Function}\n* @returns {string} primitive value\n*\n* @example\n* var dt = new DataType( 'float64' );\n* // returns \n*\n* var v = dt.valueOf();\n* // returns 'float64'\n*/\nsetReadOnly( DataType.prototype, 'valueOf', function valueOf() {\n\treturn this.toString();\n});\n\n\n// EXPORTS //\n\nexport default DataType;\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 an object mapping data type strings to descriptions.\n*\n* @private\n* @returns {Object} object mapping data type strings to descriptions\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 'byte',\n\n\t\t'bool': 'boolean',\n\n\t\t'complex32': 'half-precision floating-point complex number',\n\t\t'complex64': 'single-precision floating-point complex number',\n\t\t'complex128': 'double-precision floating-point complex number',\n\n\t\t'float16': 'half-precision floating-point number',\n\t\t'bfloat16': 'brain floating-point number',\n\t\t'float32': 'single-precision floating-point number',\n\t\t'float64': 'double-precision floating-point number',\n\t\t'float128': 'quadruple-precision floating-point number',\n\n\t\t'generic': 'generic array value',\n\n\t\t'int8': 'signed 8-bit integer',\n\t\t'int16': 'signed 16-bit integer',\n\t\t'int32': 'signed 32-bit integer',\n\t\t'int64': 'signed 64-bit integer',\n\t\t'int128': 'signed 128-bit integer',\n\t\t'int256': 'signed 256-bit integer',\n\n\t\t'uint8': 'unsigned 8-bit integer',\n\t\t'uint8c': 'unsigned 8-bit integer (clamped)',\n\t\t'uint16': 'unsigned 16-bit integer',\n\t\t'uint32': 'unsigned 32-bit integer',\n\t\t'uint64': 'unsigned 64-bit integer',\n\t\t'uint128': 'unsigned 128-bit integer',\n\t\t'uint256': 'unsigned 256-bit integer'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 an object mapping data type strings to single letter abbreviations.\n*\n* @private\n* @returns {Object} object mapping data type string to single letter abbreviations\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 'r',\n\n\t\t'bool': 'x',\n\n\t\t'complex32': 'j',\n\t\t'complex64': 'c',\n\t\t'complex128': 'z',\n\n\t\t'float16': 'h',\n\t\t'bfloat16': 'e',\n\t\t'float32': 'f',\n\t\t'float64': 'd',\n\t\t'float128': 'g',\n\n\t\t'generic': 'o',\n\n\t\t'int8': 's',\n\t\t'int16': 'k',\n\t\t'int32': 'i',\n\t\t'int64': 'l',\n\t\t'int128': 'm',\n\t\t'int256': 'n',\n\n\t\t'uint8': 'b',\n\t\t'uint8c': 'a',\n\t\t'uint16': 't',\n\t\t'uint32': 'u',\n\t\t'uint64': 'v',\n\t\t'uint128': 'w',\n\t\t'uint256': 'y'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport enum2str from '@stdlib/ndarray-base-dtype-enum2str';\nimport str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n\n\n// MAIN //\n\n/**\n* Returns the enumeration constant associated with a supported ndarray data type value.\n*\n* ## Notes\n*\n* - Downstream consumers of this function should **not** rely on specific integer values (e.g., `INT8 == 0`). Instead, the function should be used in an opaque manner.\n*\n* @param {*} dtype - data type value\n* @returns {(integer|null)} enumeration constant or null\n*\n* @example\n* var v = resolve( 'int8' );\n* // returns \n*/\nfunction resolve( dtype ) {\n\tvar t = ( typeof dtype );\n\tif ( t === 'number' ) {\n\t\treturn ( enum2str( dtype ) ) ? dtype : null;\n\t}\n\tif ( t === 'string' ) {\n\t\treturn str2enum( dtype );\n\t}\n\tif ( t === 'object' && dtype && isInteger( dtype.enum ) ) {\n\t\treturn dtype.enum;\n\t}\n\tif ( isStructConstructorLike( dtype ) ) {\n\t\treturn str2enum( 'userdefined_type' );\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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* Returns an object mapping data type strings to alignments (in bytes).\n*\n* @private\n* @returns {Object} object mapping data type string to alignments (in bytes)\n*/\nfunction table() {\n\treturn {\n\t\t'binary': 1,\n\n\t\t'bool': 1,\n\n\t\t'complex32': 2, // same as float16\n\t\t'complex64': 4, // same as float32\n\t\t'complex128': 8, // same as float64\n\n\t\t'float16': 2,\n\t\t'bfloat16': 2,\n\t\t'float32': 4,\n\t\t'float64': 8,\n\t\t'float128': 16,\n\n\t\t'generic': null,\n\n\t\t'int8': 1,\n\t\t'int16': 2,\n\t\t'int32': 4,\n\t\t'int64': 8,\n\t\t'int128': 16,\n\t\t'int256': 32,\n\n\t\t'uint8': 1,\n\t\t'uint8c': 1,\n\t\t'uint16': 2,\n\t\t'uint32': 4,\n\t\t'uint64': 8,\n\t\t'uint128': 16,\n\t\t'uint256': 32\n\t};\n}\n\n\n// EXPORTS //\n\nexport default table;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\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 isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray struct data type.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray struct data type\n*\n* @example\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var Struct = structFactory([\n* {\n* 'name': 'foo',\n* 'type': 'float64'\n* }\n* ]);\n*\n* var bool = isStructDataType( Struct );\n* // returns true\n*\n* bool = isStructDataType( 'binary' );\n* // returns false\n*\n* bool = isStructDataType( 'float32' );\n* // returns false\n*\n* bool = isStructDataType( 'float64' );\n* // returns false\n*\n* bool = isStructDataType( 'generic' );\n* // returns false\n*\n* bool = isStructDataType( 'int16' );\n* // returns false\n*\n* bool = isStructDataType( 'int32' );\n* // returns false\n*\n* bool = isStructDataType( 'int8' );\n* // returns false\n*\n* bool = isStructDataType( 'uint16' );\n* // returns false\n*\n* bool = isStructDataType( 'uint32' );\n* // returns false\n*\n* bool = isStructDataType( 'uint8' );\n* // returns false\n*\n* bool = isStructDataType( 'uint8c' );\n* // returns false\n*\n* bool = isStructDataType( 'foo' );\n* // returns false\n*/\nfunction isStructDataType( value ) {\n\treturn (\n\t\tisFunction( value ) &&\n\t\tisPositiveInteger( value.alignment ) &&\n\t\tisPositiveInteger( value.byteLength ) &&\n\t\tisFunction( value.byteLengthOf ) &&\n\t\tisFunction( value.byteOffsetOf ) &&\n\t\tisFunction( value.bufferOf ) &&\n\t\tisFunction( value.viewOf )\n\t) || (\n\t\tisDataTypeObject( value ) &&\n\t\tisStructDataType( value.value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructDataType;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray data type\n*\n* @example\n* var bool = isDataType( 'binary' );\n* // returns true\n*\n* bool = isDataType( 'float32' );\n* // returns true\n*\n* bool = isDataType( 'float64' );\n* // returns true\n*\n* bool = isDataType( 'generic' );\n* // returns true\n*\n* bool = isDataType( 'int16' );\n* // returns true\n*\n* bool = isDataType( 'int32' );\n* // returns true\n*\n* bool = isDataType( 'int8' );\n* // returns true\n*\n* bool = isDataType( 'uint16' );\n* // returns true\n*\n* bool = isDataType( 'uint32' );\n* // returns true\n*\n* bool = isDataType( 'uint8' );\n* // returns true\n*\n* bool = isDataType( 'uint8c' );\n* // returns true\n*\n* bool = isDataType( 'foo' );\n* // returns false\n*/\nfunction isDataType( v ) {\n\treturn (\n\t\tisDataTypeString( v ) ||\n\t\tisDataTypeObject( v ) ||\n\t\tisStructDataType( v )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataType;\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 POLICIES from './policies.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of output ndarray data type policies.\n*\n* @returns {StringArray} list of ndarray data type policies\n*\n* @example\n* var list = policies();\n* // returns [...]\n*/\nfunction policies() {\n\treturn POLICIES.slice();\n}\n\n\n// EXPORTS //\n\nexport default policies;\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 an object mapping supported data type policy strings to enumeration constants.\n*\n* ## Notes\n*\n* - Downstream consumers of this mapping should **not** rely on specific integer values (e.g., `SAME == 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* @private\n* @returns {Object} object mapping supported dtype policies to enumeration constants\n*\n* @example\n* var table = enumeration();\n* // returns \n*/\nfunction enumeration() {\n\t// NOTE: the following should match the C `output_dtype_policies.h` enumeration!!!!\n\treturn {\n\t\t'same': 0,\n\t\t'promoted': 1,\n\t\t'accumulation': 2,\n\t\t'boolean': 3,\n\t\t'boolean_and_generic': 4,\n\t\t'signed_integer': 5,\n\t\t'signed_integer_and_generic': 6,\n\t\t'unsigned_integer': 7,\n\t\t'unsigned_integer_and_generic': 8,\n\t\t'integer': 9,\n\t\t'integer_and_generic': 10,\n\t\t'floating_point': 11,\n\t\t'floating_point_and_generic': 12,\n\t\t'real_floating_point': 13,\n\t\t'real_floating_point_and_generic': 14,\n\t\t'complex_floating_point': 15,\n\t\t'complex_floating_point_and_generic': 16,\n\t\t'real': 17,\n\t\t'real_and_generic': 18,\n\t\t'numeric': 19,\n\t\t'numeric_and_generic': 20,\n\t\t'integer_index': 21,\n\t\t'integer_index_and_generic': 22,\n\t\t'boolean_index': 23,\n\t\t'boolean_index_and_generic': 24,\n\t\t'mask_index': 25,\n\t\t'mask_index_and_generic': 26,\n\t\t'default': 27,\n\t\t'default_index': 28\n\t};\n}\n\n\n// EXPORTS //\n\nexport default enumeration;\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/**\n* Return a list of output ndarray data type policies.\n*\n* @module @stdlib/ndarray-output-dtype-policies\n*\n* @example\n* import policies from '@stdlib/ndarray-output-dtype-policies';\n*\n* var list = policies();\n* // returns [...]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport enumeration from './enum.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'enum', enumeration );\nassign( main, enumeration() );\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 setReadOnly from '@stdlib/utils-define-read-only-property';\nimport objectKeys from '@stdlib/utils-keys';\n\n\n// MAIN //\n\n/**\n* Copies all enumerable own properties from a source object to a target object as enumerable read-only properties.\n*\n* @private\n* @param {Object} target - target object\n* @param {Object} source - source object\n* @returns {Object} modified target object\n*\n* @example\n* var source = {\n* 'beep': 'boop'\n* };\n* var target = {};\n*\n* var out = assign( target, source );\n* // returns \n*\n* var bool = ( out === target );\n* // returns true\n*\n* var v = target.beep;\n* // returns 'boop'\n*/\nfunction assign( target, source ) {\n\tvar keys;\n\tvar k;\n\tvar i;\n\n\tkeys = objectKeys( source );\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tk = keys[ i ];\n\t\tsetReadOnly( target, k, source[ k ] );\n\t}\n\treturn target;\n}\n\n\n// EXPORTS //\n\nexport default assign;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport policies from '@stdlib/ndarray-output-dtype-policies';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray output data type policy.\n*\n* @name isOutputDataTypePolicy\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray output data type policy\n*\n* @example\n* var bool = isOutputDataTypePolicy( 'boolean' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'real' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'numeric' );\n* // returns true\n*\n* bool = isOutputDataTypePolicy( 'foo' );\n* // returns false\n*/\nvar isOutputDataTypePolicy = contains( policies() );\n\n\n// EXPORTS //\n\nexport default isOutputDataTypePolicy;\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 isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\nvar bool = isFunction( Object.assign ); // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default bool;\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* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n* - Both string and symbol properties are copied.\n*\n* @name assign\n* @type {Function}\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nvar assign = Object.assign; // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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.getOwnPropertySymbols !== '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 Object from '@stdlib/object-ctor';\n\n\n// VARIABLES //\n\nvar propertySymbols = Object.getOwnPropertySymbols;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, 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 symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n*/\nfunction getOwnPropertySymbols( value ) {\n\treturn propertySymbols( Object( value ) );\n}\n\n\n// EXPORTS //\n\nexport default getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 an array of an object's own symbol properties.\n*\n* @module @stdlib/utils-property-symbols\n*\n* @example\n* import getOwnPropertySymbols from '@stdlib/utils-property-symbols';\n*\n* var symbols = getOwnPropertySymbols( {} );\n*/\n\n// MODULES //\n\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( HAS_BUILTIN ) {\n\tmain = builtin;\n} else {\n\tmain = polyfill;\n}\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/**\n* Copy enumerable own properties from one or more source objects to a target object.\n*\n* @module @stdlib/object-assign\n*\n* @example\n* import assign from '@stdlib/object-assign';\n*\n* var out = assign( {}, { 'foo': 'bar' }, { 'baz': 'beep' } );\n* // returns { 'foo': 'bar', 'baz': 'beep' }\n*/\n\n// MODULES //\n\nimport hasObjectAssign from './has_object_assign.js';\nimport main from './builtin.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar assign;\nif ( hasObjectAssign ) {\n\tassign = main;\n} else {\n\tassign = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, 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 {EmptyArray} a list of own symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n* // returns []\n*/\nfunction getOwnPropertySymbols() {\n\treturn [];\n}\n\n\n// EXPORTS //\n\nexport default getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 '@stdlib/utils-keys';\nimport propertySymbols from '@stdlib/utils-property-symbols';\nimport isEnumerable from '@stdlib/assert-is-enumerable-property';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names and symbols.\n*\n* @param {*} value - input object\n* @returns {Array} a list of own property enumerable names and symbols\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var props = enumerableProperties( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction enumerableProperties( value ) {\n\tvar out;\n\tvar tmp;\n\tvar i;\n\n\tout = keys( value );\n\ttmp = propertySymbols( value );\n\tfor ( i = 0; i < tmp.length; i++ ) {\n\t\tif ( isEnumerable( value, tmp[ i ] ) ) {\n\t\t\tout.push( tmp[ i ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default enumerableProperties;\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 enumerableProperties from '@stdlib/utils-enumerable-properties';\nimport Object from '@stdlib/object-ctor';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n* - Both string and symbol properties are copied.\n*\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nfunction assign( target ) {\n\tvar source;\n\tvar keys;\n\tvar key;\n\tvar len;\n\tvar to;\n\tvar i;\n\tvar j;\n\tif ( target === void 0 || target === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a non-null object. Value: `%s`.', target ) );\n\t}\n\tto = Object( target );\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\tsource = arguments[ i ];\n\t\tif ( source === void 0 || source === null ) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tkeys = enumerableProperties( Object( source ) );\n\t\tlen = keys.length;\n\t\tfor ( j = 0; j < len; j++ ) {\n\t\t\tkey = keys[ j ];\n\t\t\tto[ key ] = source[ key ];\n\t\t}\n\t}\n\treturn to;\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// MODULES //\n\nimport flags from '@stdlib/ndarray-base-flags';\n\n\n// MAIN //\n\n/**\n* Returns a specified flag for a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {(string|symbol)} name - flag name\n* @returns {*} flag value\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = flag( zeros( [ 3, 3, 3 ] ), 'READONLY' );\n* // returns \n*/\nfunction flag( x, name ) {\n\treturn flags( x, false )[ name ];\n}\n\n\n// EXPORTS //\n\nexport default flag;\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 assign from '@stdlib/object-assign';\n\n\n// MAIN //\n\n/**\n* Returns the flags 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 `flags` property\n* @returns {Object} flags\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = flags( zeros( [ 3, 3, 3 ] ), false );\n* // returns {...}\n*/\nfunction flags( x, copy ) {\n\tvar f = x.flags;\n\tif ( typeof f !== 'object' || f === null ) {\n\t\treturn {};\n\t}\n\tif ( copy ) {\n\t\treturn assign( {}, f );\n\t}\n\treturn f;\n}\n\n\n// EXPORTS //\n\nexport default flags;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport orders from '@stdlib/ndarray-orders';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray order.\n*\n* @name isOrder\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray order\n*\n* @example\n* var bool = isOrder( 'row-major' );\n* // returns true\n*\n* bool = isOrder( 'column-major' );\n* // returns true\n*\n* bool = isOrder( 'foo' );\n* // returns false\n*/\nvar isOrder = contains( orders() );\n\n\n// EXPORTS //\n\nexport default isOrder;\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';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'every' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n*\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n* return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyBy( x, isPositive );\n* // returns true\n*/\nfunction everyBy( x, predicate, thisArg ) {\n\tvar obj;\n\tif ( hasMethod( x, 'every' ) ) {\n\t\treturn x.every( predicate, thisArg );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default everyBy;\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/**\n* Returns the index offset which specifies the location of the first indexed value in a strided array.\n*\n* @param {NonNegativeInteger} N - number of indexed elements\n* @param {integer} stride - index increment\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var offset = stride2offset( 10, -10 );\n* // returns 90\n*/\nfunction stride2offset( N, stride ) {\n\tif ( stride > 0 ) {\n\t\treturn 0;\n\t}\n\treturn ( 1 - N ) * stride;\n}\n\n\n// EXPORTS //\n\nexport default stride2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 `undefined` or `null`.\n*\n* ## Notes\n*\n* - In older browsers, `undefined` is a global which can be overridden. `void`, however, is an operator which **cannot** be overridden. Consequently, better to use `void` to check for `undefined`. See [Stack Overflow][1].\n*\n* [1]: http://stackoverflow.com/a/19369078/2225624\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is undefined\n*\n* @example\n* var bool = isUndefinedOrNull( undefined );\n* // returns true\n*\n* bool = isUndefinedOrNull( null );\n* // returns true\n*\n* bool = isUndefinedOrNull( false );\n* // returns false\n*/\nfunction isUndefinedOrNull( value ) {\n\treturn ( value === void 0 || value === null );\n}\n\n\n// EXPORTS //\n\nexport default isUndefinedOrNull;\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 isUndefinedOrNull from '@stdlib/assert-is-undefined-or-null';\nimport arraylike2object from '@stdlib/array-base-arraylike2object';\nimport accessors from './accessors.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'join' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator and alternative indexing semantics.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {string} joined string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', x, 1, 0 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX, offsetX ) {\n\tvar out;\n\tvar ix;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn '';\n\t}\n\t// Check for a contiguous strided array with left-to-right iteration...\n\tif ( strideX === 1 && offsetX === 0 && N === x.length && hasMethod( x, 'join' ) ) {\n\t\treturn x.join( separator );\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\treturn accessors( N, separator, o, strideX, offsetX );\n\t}\n\tix = offsetX;\n\tout = '';\n\tfor ( i = 0; i < N; i++ ) {\n\t\tif ( i > 0 ) {\n\t\t\tout += separator;\n\t\t}\n\t\tv = x[ ix ];\n\t\tif ( !isUndefinedOrNull( v ) ) {\n\t\t\tout += String( v );\n\t\t}\n\t\tix += strideX;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\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 isUndefinedOrNull from '@stdlib/assert-is-undefined-or-null';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {string} joined string\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', arraylike2object( toAccessorArray( x ) ), 1, 0 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX, offsetX ) {\n\tvar xbuf;\n\tvar get;\n\tvar out;\n\tvar ix;\n\tvar v;\n\tvar i;\n\n\t// Cache reference to array data:\n\txbuf = x.data;\n\n\t// Cache a reference to the element accessor:\n\tget = x.accessors[ 0 ];\n\n\tix = offsetX;\n\tout = '';\n\tfor ( i = 0; i < N; i++ ) {\n\t\tif ( i > 0 ) {\n\t\t\tout += separator;\n\t\t}\n\t\tv = get( xbuf, ix );\n\t\tif ( !isUndefinedOrNull( v ) ) {\n\t\t\tout += String( v );\n\t\t}\n\t\tix += strideX;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\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 { ndarray as strided } from '@stdlib/blas-ext-base-gjoin';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining array elements using a specified separator.\n*\n* @param {Collection} x - input array\n* @param {string} separator - separator\n* @returns {string} output string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = join( x, ',' );\n* // returns '1,2,3,4'\n*\n* @example\n* var x = [ 1, 2, 3, null, undefined, 4 ];\n*\n* var out = join( x, '-' );\n* // returns '1-2-3---4'\n*/\nfunction join( x, separator ) {\n\treturn strided( x.length, separator, x, 1, 0 );\n}\n\n\n// EXPORTS //\n\nexport default join;\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) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting index (i.e., index offset) for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, fcn ) {\n\tvar sx;\n\tvar ix;\n\tvar x;\n\tvar N;\n\tvar i;\n\n\tN = shape[ 0 ];\n\tif ( N <= 0 ) {\n\t\treturn;\n\t}\n\tix = offsets[ 0 ];\n\tsx = strides[ 0 ];\n\tx = arrays[ 0 ];\n\tfor ( i = 0; i < N; i++ ) {\n\t\tx[ ix ] = fcn();\n\t\tix += sx;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting indices (i.e., index offsets) for the output array\n* @param {Array} accessors - array-like object containing accessors for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* function set( buf, idx, value ) {\n* buf[ idx ] = value * 2.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, [ set ], fill );\n*\n* console.log( x );\n* // => [ 6.0, 6.0, 6.0, 6.0, 6.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, accessors, fcn ) {\n\tvar xset;\n\tvar sx;\n\tvar ix;\n\tvar x;\n\tvar N;\n\tvar i;\n\n\tN = shape[ 0 ];\n\tif ( N <= 0 ) {\n\t\treturn;\n\t}\n\tix = offsets[ 0 ];\n\tsx = strides[ 0 ];\n\tx = arrays[ 0 ];\n\txset = accessors[ 0 ];\n\tfor ( i = 0; i < N; i++ ) {\n\t\txset( x, ix, fcn() );\n\t\tix += sx;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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 accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport dtype from '@stdlib/array-dtype';\nimport strided from './nullary.js';\nimport accessors from './accessors.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, fcn ) {\n\tvar xset;\n\tvar x;\n\n\tx = arrays[ 0 ];\n\tif ( isAccessorArray( x ) ) {\n\t\txset = accessorSetter( dtype( x ) );\n\t}\n\tif ( xset ) {\n\t\txset = xset || setter( dtype( x ) );\n\t\treturn accessors( arrays, shape, strides, [ xset ], fcn );\n\t}\n\treturn strided( arrays, shape, strides, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\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 stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './accessors.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Array} accessors - array-like object containing accessors for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* function set( buf, idx, value ) {\n* buf[ idx ] = value * 2.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, [ set ], fill );\n*\n* console.log( x );\n* // => [ 6.0, 6.0, 6.0, 6.0, 6.0 ]\n*/\nfunction nullary( arrays, shape, strides, accessors, fcn ) {\n\tvar offsets = [ stride2offset( shape[ 0 ], strides[ 0 ] ) ];\n\treturn ndarray( arrays, shape, strides, offsets, accessors, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './nullary.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @private\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, fcn ) {\n\tvar offsets = [ stride2offset( shape[ 0 ], strides[ 0 ] ) ];\n\treturn ndarray( arrays, shape, strides, offsets, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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) 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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* Return a string created by joining strided array elements using a specified separator.\n*\n* @module @stdlib/blas-ext-base-gjoin\n*\n* @example\n* import gjoin from '@stdlib/blas-ext-base-gjoin';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var str = gjoin( x.length, ',', x, 1 );\n* // returns '1,2,3,4'\n*\n* @example\n* import gjoin from '@stdlib/blas-ext-base-gjoin';\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var str = gjoin.ndarray( x.length, ',', x, 1, 0 );\n* // returns '1,2,3,4'\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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 stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\n/**\n* Returns a string created by joining strided array elements using a specified separator.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {string} separator - separator\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @returns {string} joined string\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = gjoin( x.length, ',', x, 1 );\n* // returns '1,2,3,4'\n*/\nfunction gjoin( N, separator, x, strideX ) {\n\treturn ndarray( N, separator, x, strideX, stride2offset( N, strideX ) );\n}\n\n\n// EXPORTS //\n\nexport default gjoin;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 nullary callback and assign results to elements in a strided output array.\n*\n* @module @stdlib/strided-base-nullary\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import nullary from '@stdlib/strided-base-nullary';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n*\n* nullary( [ x ], shape, strides, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n* import nullary from '@stdlib/strided-base-nullary';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary.ndarray( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\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 accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport dtype from '@stdlib/array-dtype';\nimport strided from './nullary.ndarray.js';\nimport accessors from './accessors.ndarray.js';\n\n\n// MAIN //\n\n/**\n* Applies a nullary callback and assigns results to elements in a strided output array.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing one output array\n* @param {NonNegativeIntegerArray} shape - array-like object containing a single element, the number of indexed elements\n* @param {IntegerArray} strides - array-like object containing the stride length for the output array\n* @param {NonNegativeIntegerArray} offsets - array-like object containing the starting indices (i.e., index offsets) for the output array\n* @param {Callback} fcn - nullary callback\n* @returns {void}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* function fill() {\n* return 3.0;\n* }\n*\n* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );\n*\n* var shape = [ x.length ];\n* var strides = [ 1 ];\n* var offsets = [ 0 ];\n*\n* nullary( [ x ], shape, strides, offsets, fill );\n*\n* console.log( x );\n* // => [ 3.0, 3.0, 3.0, 3.0, 3.0 ]\n*/\nfunction nullary( arrays, shape, strides, offsets, fcn ) {\n\tvar xset;\n\tvar x;\n\n\tx = arrays[ 0 ];\n\tif ( isAccessorArray( x ) ) {\n\t\txset = accessorSetter( dtype( x ) );\n\t}\n\tif ( xset ) {\n\t\txset = xset || setter( dtype( x ) );\n\t\treturn accessors( arrays, shape, strides, offsets, [ xset ], fcn );\n\t}\n\treturn strided( arrays, shape, strides, offsets, fcn );\n}\n\n\n// EXPORTS //\n\nexport default nullary;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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) 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) 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) 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) 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) 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) 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) 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) 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/string-format';\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( '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\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","/**\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 filled \"generic\" array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} filled array\n*\n* @example\n* var out = filled( 0.0, 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var out = filled( 'beep', 3 );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filled( value, len ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( value );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default filled;\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 filled from '@stdlib/array-base-filled';\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled \"generic\" array.\n*\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var out = zeros( 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\nfunction zeros( len ) {\n\treturn filled( 0.0, len );\n}\n\n\n// EXPORTS //\n\nexport default zeros;\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 copy from '@stdlib/array-base-copy-indexed';\nimport ndarray from '@stdlib/ndarray-base-ctor';\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 getDType from '@stdlib/ndarray-base-dtype';\nimport getData from '@stdlib/ndarray-base-data-buffer';\nimport zeros from '@stdlib/array-base-zeros';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Broadcasts an ndarray to a specified shape.\n*\n* ## Notes\n*\n* - The returned array is a view on the input array data buffer. The view is typically **not** contiguous. As more than one element of a returned view may refer to the same memory location, writing to the view may affect multiple elements. If you need to write to the returned array, copy the array before performing operations which may mutate elements.\n*\n* @param {ndarray} arr - input array\n* @param {NonNegativeIntegerArray} shape - desired shape\n* @throws {Error} input array cannot have more dimensions than the desired shape\n* @throws {Error} input array dimension sizes must be `1` or equal to the corresponding dimension in the provided shape\n* @throws {Error} input array and desired shape must be broadcast compatible\n* @returns {ndarray} broadcasted array\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var shx = x.shape;\n* // returns [ 2, 2 ]\n*\n* var y = broadcastArray( x, [ 3, 2, 2 ] );\n* // returns \n*\n* var shy = y.shape;\n* // returns [ 3, 2, 2 ]\n*\n* var v = y.get( 0, 0, 0 );\n* // returns 1\n*\n* v = y.get( 0, 0, 1 );\n* // returns 2\n*\n* v = y.get( 1, 0, 0 );\n* // returns 1\n*\n* v = y.get( 1, 1, 0 );\n* // returns 3\n*\n* v = y.get( 2, 0, 0 );\n* // returns 1\n*\n* v = y.get( 2, 1, 1 );\n* // returns 4\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var y = broadcastArray( x, [ 3, 2 ] );\n* // throws \n*/\nfunction broadcastArray( arr, shape ) {\n\tvar strides;\n\tvar dim;\n\tvar sh;\n\tvar st;\n\tvar N;\n\tvar M;\n\tvar d;\n\tvar i;\n\tvar j;\n\n\tN = shape.length;\n\tsh = getShape( arr, false );\n\tM = sh.length;\n\tif ( N < M ) {\n\t\tthrow new Error( 'invalid argument. Cannot broadcast an array to a shape having fewer dimensions. Arrays can only be broadcasted to shapes having the same or more dimensions.' );\n\t}\n\t// Initialize a strides array:\n\tstrides = zeros( N );\n\n\t// Determine the output array strides...\n\tst = getStrides( arr, false );\n\tfor ( i = N-1; i >= 0; i-- ) {\n\t\tj = M - N + i;\n\t\tif ( j < 0 ) {\n\t\t\t// Prepended singleton dimension; stride is zero...\n\t\t\tcontinue;\n\t\t}\n\t\td = sh[ j ];\n\t\tdim = shape[ i ];\n\t\tif ( dim !== 0 && dim < d ) {\n\t\t\tthrow new Error( format( 'invalid argument. Input array cannot be broadcast to the specified shape, as the specified shape has a dimension whose size is less than the size of the corresponding dimension in the input array. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( sh ).join( ', ' ), copy( shape ).join( ', ' ), i ) );\n\t\t}\n\t\tif ( d === dim ) {\n\t\t\tstrides[ i ] = st[ j ];\n\t\t} else if ( d === 1 ) {\n\t\t\t// In order to broadcast dimensions, we set the stride for that dimension to zero...\n\t\t\tstrides[ i ] = 0;\n\t\t} else {\n\t\t\t// At this point, we know that `dim > d` and that `d` does not equal `1` (e.g., `dim=3` and `d=2`); in which case, the shapes are considered incompatible (even for desired shapes which are multiples of array dimensions, as might be desired when \"tiling\" an array; e.g., `dim=4` and `d=2`)...\n\t\t\tthrow new Error( format( 'invalid argument. Input array and the specified shape are broadcast incompatible. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( sh ).join( ', ' ), copy( shape ).join( ', ' ), i ) );\n\t\t}\n\t}\n\treturn ndarray( getDType( arr ), getData( arr ), copy( shape ), strides, getOffset( arr ), getOrder( arr ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nexport default broadcastArray;\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 broadcast from '@stdlib/ndarray-base-broadcast-array';\nimport getShape from '@stdlib/ndarray-base-shape';\n\n\n// MAIN //\n\n/**\n* Broadcasts an ndarray to a specified shape if and only if the specified shape differs from the provided ndarray's shape.\n*\n* ## Notes\n*\n* - If a provided ndarray has the same shape as the specified shape, the function returns the provided ndarray.\n* - If a provided ndarray has a different (broadcast compatible) shape than the specified shape, the function returns a new (base) ndarray view of the provided ndarray's data. The view is typically **not** contiguous. As more than one element of a returned view may refer to the same memory location, writing to the view may affect multiple elements. If you need to write to the returned array, copy the array before performing operations which may mutate elements.\n*\n* @param {ndarray} arr - input array\n* @param {NonNegativeIntegerArray} shape - desired shape\n* @throws {Error} input array cannot have more dimensions than the desired shape\n* @throws {Error} input array dimension sizes must be `1` or equal to the corresponding dimension in the provided shape\n* @throws {Error} input array and desired shape must be broadcast compatible\n* @returns {ndarray} broadcasted array\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var shx = x.shape;\n* // returns [ 2, 2 ]\n*\n* var y = maybeBroadcastArray( x, [ 3, 2, 2 ] );\n* // returns \n*\n* var shy = y.shape;\n* // returns [ 3, 2, 2 ]\n*\n* var v = y.get( 0, 0, 0 );\n* // returns 1\n*\n* v = y.get( 0, 0, 1 );\n* // returns 2\n*\n* v = y.get( 1, 0, 0 );\n* // returns 1\n*\n* v = y.get( 1, 1, 0 );\n* // returns 3\n*\n* v = y.get( 2, 0, 0 );\n* // returns 1\n*\n* v = y.get( 2, 1, 1 );\n* // returns 4\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2 ], [ 3, 4 ] ] );\n* // returns \n*\n* var y = maybeBroadcastArray( x, [ 3, 2 ] );\n* // throws \n*/\nfunction maybeBroadcastArray( arr, shape ) {\n\tvar sh;\n\tvar N;\n\tvar i;\n\n\tN = shape.length;\n\tsh = getShape( arr, false );\n\n\t// Check whether we need to broadcast the input array...\n\tif ( sh.length === N ) {\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t// Check whether dimensions match...\n\t\t\tif ( sh[ i ] !== shape[ i ] ) {\n\t\t\t\t// We found a mismatched dimension; delegate to `broadcast` to ensure that the input array is broadcast compatible with the desired array shape...\n\t\t\t\treturn broadcast( arr, shape );\n\t\t\t}\n\t\t}\n\t\treturn arr;\n\t}\n\t// If we are provided an array having a different rank (i.e., number of dimensions) than the desired shape, assume we need to broadcast, delegating to `broadcast` to ensure that the input array is broadcast compatible with the desired array shape...\n\treturn broadcast( arr, shape );\n}\n\n\n// EXPORTS //\n\nexport default maybeBroadcastArray;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'complex_floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray complex-valued floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray complex-valued floating-point data type\n*\n* @example\n* var bool = isComplexFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'complex64' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'complex128' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'float32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'float64' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isComplexFloatingPointDataType( v ) { // eslint-disable-line id-length\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isComplexFloatingPointDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 isProtoOf = Object.prototype.isPrototypeOf;\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests if an object's prototype chain contains a provided prototype.\n*\n* @param {*} value - value to test\n* @param {(Object|Function)} proto - prototype\n* @throws {TypeError} second argument must be an object and not null\n* @returns {boolean} boolean indicating if a provided prototype exists in a prototype chain\n*\n* @example\n* import inherit from '@stdlib/utils-inherit';\n*\n* function Foo() {\n* return this;\n* }\n*\n* function Bar() {\n* return this;\n* }\n* inherit( Bar, Foo );\n*\n* var bar = new Bar();\n*\n* var bool = isPrototypeOf( bar, Foo.prototype );\n* // returns true\n*/\nfunction isPrototypeOf( value, proto ) { // eslint-disable-line stdlib/no-redeclare\n\tvar type = typeof proto;\n\tif (\n\t\tproto === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either an object (except null) or a function. Value: `%s`.', proto ) );\n\t}\n\ttype = typeof value;\n\tif (\n\t\tvalue === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\treturn false;\n\t}\n\treturn isProtoOf.call( proto, value );\n}\n\n\n// EXPORTS //\n\nexport default isPrototypeOf;\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 values from `x` into `y`.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Object} y - output array object\n* @param {Collection} y.data - output array data\n* @param {Array} y.accessors - array element accessors\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Object} output array object\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n*\n* function setter( data, idx, value ) {\n* data.set( value, idx );\n* }\n*\n* function getter( data, idx ) {\n* return data.get( idx );\n* }\n*\n* var x = {\n* 'data': new Complex64Array( [ 1.0, 2.0, 3.0, 4.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* var y = {\n* 'data': new Complex64Array( [ 5.0, 6.0, 7.0, 8.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* gcopy( x.data.length, x, 1, 0, y, 1, 0 );\n*\n* var view = reinterpret64( y.data, 0 );\n* // view => [ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar set;\n\tvar get;\n\tvar ix;\n\tvar iy;\n\tvar i;\n\n\t// Cache references to array data:\n\txbuf = x.data;\n\tybuf = y.data;\n\n\t// Cache a reference to the element accessors:\n\tget = x.accessors[ 0 ];\n\tset = y.accessors[ 1 ];\n\n\tix = offsetX;\n\tiy = offsetY;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( ybuf, iy, get( xbuf, ix ) );\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, y, strideY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\tif ( strideX < 0 ) {\n\t\t\tix = (1-N) * strideX;\n\t\t} else {\n\t\t\tix = 0;\n\t\t}\n\t\tif ( strideY < 0 ) {\n\t\t\tiy = (1-N) * strideY;\n\t\t} else {\n\t\t\tiy = 0;\n\t\t}\n\t\taccessors( N, ox, strideX, ix, oy, strideY, iy );\n\t\treturn oy.data;\n\t}\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ i ] = x[ i ];\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ i ] = x[ i ];\n\t\t\ty[ i+1 ] = x[ i+1 ];\n\t\t\ty[ i+2 ] = x[ i+2 ];\n\t\t\ty[ i+3 ] = x[ i+3 ];\n\t\t\ty[ i+4 ] = x[ i+4 ];\n\t\t\ty[ i+5 ] = x[ i+5 ];\n\t\t\ty[ i+6 ] = x[ i+6 ];\n\t\t\ty[ i+7 ] = x[ i+7 ];\n\t\t}\n\t\treturn y;\n\t}\n\tif ( strideX < 0 ) {\n\t\tix = (1-N) * strideX;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( strideY < 0 ) {\n\t\tiy = (1-N) * strideY;\n\t} else {\n\t\tiy = 0;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\taccessors( N, ox, strideX, offsetX, oy, strideY, offsetY );\n\t\treturn oy.data;\n\t}\n\tix = offsetX;\n\tiy = offsetY;\n\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ iy ] = x[ ix ];\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ iy ] = x[ ix ];\n\t\t\ty[ iy+1 ] = x[ ix+1 ];\n\t\t\ty[ iy+2 ] = x[ ix+2 ];\n\t\t\ty[ iy+3 ] = x[ ix+3 ];\n\t\t\ty[ iy+4 ] = x[ ix+4 ];\n\t\t\ty[ iy+5 ] = x[ ix+5 ];\n\t\t\ty[ iy+6 ] = x[ ix+6 ];\n\t\t\ty[ iy+7 ] = x[ ix+7 ];\n\t\t\tix += M;\n\t\t\tiy += M;\n\t\t}\n\t\treturn y;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 minimum value.\n*\n* @param {number} x - first number\n* @param {number} y - second number\n* @returns {number} minimum value\n*\n* @example\n* var v = min( 3.14, 4.2 );\n* // returns 3.14\n*\n* @example\n* var v = min( 3.14, NaN );\n* // returns NaN\n*\n* @example\n* var v = min( NaN, 3.14 );\n* // returns 3.14\n*\n* @example\n* var v = min( -0.0, +0.0 );\n* // returns +0.0\n*\n* @example\n* var v = min( +0.0, -0.0 );\n* // returns -0.0\n*/\nfunction min( x, y ) {\n\tif ( x < y ) {\n\t\treturn x;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nexport default 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/**\n* BLAS level 1 routine to copy values from `x` into `y`.\n*\n* @module @stdlib/blas-base-gcopy\n*\n* @example\n* import gcopy from '@stdlib/blas-base-gcopy';\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*\n* @example\n* import gcopy from '@stdlib/blas-base-gcopy';\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy.ndarray( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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// Define a property name which is unlikely to be used in end user code:\nvar PRIVATE_BUFFER = '__@@##$$@@__struct_buffer__@@$$##@@__';\n\n\n// EXPORTS //\n\nexport default PRIVATE_BUFFER;\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\nvar CTOR_NAME = 'Struct';\n\n\n// EXPORTS //\n\nexport default CTOR_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 defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-write accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - get accessor\n* @param {Function} setter - set accessor\n*\n* @example\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setNonEnumerableReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\nfunction setNonEnumerableReadWriteAccessor( obj, prop, getter, setter ) { // 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\t'set': setter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadWriteAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 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* setReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setReadOnlyAccessor( obj, prop, getter ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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-write accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - get accessor\n* @param {Function} setter - set accessor\n*\n* @example\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\nfunction setReadWriteAccessor( obj, prop, getter, setter ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'get': getter,\n\t\t'set': setter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadWriteAccessor;\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\nvar DATA_VIEW_METHODS = {\n\t'int8': {\n\t\t'get': 'getInt8',\n\t\t'set': 'setInt8'\n\t},\n\t'int16': {\n\t\t'get': 'getInt16',\n\t\t'set': 'setInt16'\n\t},\n\t'int32': {\n\t\t'get': 'getInt32',\n\t\t'set': 'setInt32'\n\t},\n\t'int64': {\n\t\t'get': 'getBigInt64',\n\t\t'set': 'setBigInt64'\n\t},\n\t'uint8': {\n\t\t'get': 'getUint8',\n\t\t'set': 'setUint8'\n\t},\n\t'uint16': {\n\t\t'get': 'getUint16',\n\t\t'set': 'setUint16'\n\t},\n\t'uint32': {\n\t\t'get': 'getUint32',\n\t\t'set': 'setUint32'\n\t},\n\t'uint64': {\n\t\t'get': 'getBigUint64',\n\t\t'set': 'setBigUint64'\n\t},\n\t'float16': {\n\t\t'get': 'getFloat16',\n\t\t'set': 'setFloat16'\n\t},\n\t'float32': {\n\t\t'get': 'getFloat32',\n\t\t'set': 'setFloat32'\n\t},\n\t'float64': {\n\t\t'get': 'getFloat64',\n\t\t'set': 'setFloat64'\n\t},\n\t'complex32': {\n\t\t'get': 'getFloat16',\n\t\t'set': 'setFloat16'\n\t},\n\t'complex64': {\n\t\t'get': 'getFloat32',\n\t\t'set': 'setFloat32'\n\t},\n\t'complex128': {\n\t\t'get': 'getFloat64',\n\t\t'set': 'setFloat64'\n\t},\n\t'bool': {\n\t\t'get': 'getUint8',\n\t\t'set': 'setUint8'\n\t}\n};\n\n\n// EXPORTS //\n\nexport default DATA_VIEW_METHODS;\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 Complex64 from '@stdlib/complex-float32-ctor';\nimport Complex128 from '@stdlib/complex-float64-ctor';\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'complex64': Complex64,\n\t'complex128': Complex128\n};\n\n\n// EXPORTS //\n\nexport default ctors;\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 table from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns a complex number constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'complex128' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'complex' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctors from '@stdlib/complex-ctors';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar TABLE = {\n\t'float64': 'complex128',\n\t'float32': 'complex64'\n};\nvar DEFAULT_CTOR = ctors( TABLE[ 'float64' ] );\n\n\n// MAIN //\n\n/**\n* Creates a complex number.\n*\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {Complex} complex number\n*\n* @example\n* var z = complex( 5.0, 3.0, 'float64' );\n* // returns \n*/\nfunction complex( real, imag, dtype ) {\n\tvar ctor;\n\tif ( arguments.length > 2 ) {\n\t\tctor = ctors( TABLE[ dtype ] );\n\t\tif ( ctor ) {\n\t\t\treturn new ctor( real, imag );\n\t\t}\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\treturn new DEFAULT_CTOR( real, imag );\n}\n\n\n// EXPORTS //\n\nexport default complex;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport complex from '@stdlib/complex-cmplx';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// VARIABLES //\n\nvar CMPLX_TO_REAL = {\n\t'complex128': 'float64',\n\t'complex64': 'float32',\n\t'complex32': 'float16'\n};\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getComplex( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a complex number from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Complex} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\tvar re = view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN );\n\t\tvar im = view[ method ]( obj.byteOffset+(obj.byteLength/2), IS_LITTLE_ENDIAN );\n\t\treturn complex( re, im, CMPLX_TO_REAL[ obj.type ] );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getComplex;\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 Int16Array from '@stdlib/array-int16';\nimport Int32Array from '@stdlib/array-int32';\nimport Int8Array from '@stdlib/array-int8';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array,\n\t'bool': BooleanArray\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport table from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns a typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\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// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\n\n\n// MAIN //\n\n/**\n* Reinterprets a `BooleanArray` as a `Uint8Array`.\n*\n* @param {BooleanArray} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Uint8Array} `Uint8Array` view\n*\n* @example\n* import BooleanArray from '@stdlib/array-bool';\n*\n* var x = new BooleanArray( 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 Uint8Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 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) 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/**\n* Returns default array settings.\n*\n* @returns {Object} defaults\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t// Data types:\n\t\t'dtypes': {\n\t\t\t'default': 'float64',\n\t\t\t'numeric': 'float64',\n\t\t\t'real': 'float64',\n\t\t\t'floating_point': 'float64',\n\t\t\t'real_floating_point': 'float64',\n\t\t\t'complex_floating_point': 'complex128',\n\t\t\t'integer': 'int32',\n\t\t\t'signed_integer': 'int32',\n\t\t\t'unsigned_integer': 'uint32',\n\t\t\t'boolean': 'bool',\n\t\t\t'index': 'int32',\n\t\t\t'integer_index': 'int32',\n\t\t\t'boolean_index': 'bool',\n\t\t\t'mask_index': 'uint8'\n\t\t}\n\t};\n}\n\n\n// EXPORTS //\n\nexport default defaults;\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 defaults from './main.js';\n\n\n// VARIABLES //\n\nvar DEFAULTS = defaults();\nvar HASH = {\n\t'dtypes.default': DEFAULTS.dtypes.default,\n\t'dtypes.numeric': DEFAULTS.dtypes.numeric,\n\t'dtypes.real': DEFAULTS.dtypes.real,\n\t'dtypes.floating_point': DEFAULTS.dtypes.floating_point,\n\t'dtypes.real_floating_point': DEFAULTS.dtypes.real_floating_point,\n\t'dtypes.complex_floating_point': DEFAULTS.dtypes.complex_floating_point,\n\t'dtypes.integer': DEFAULTS.dtypes.integer,\n\t'dtypes.signed_integer': DEFAULTS.dtypes.signed_integer,\n\t'dtypes.unsigned_integer': DEFAULTS.dtypes.unsigned_integer,\n\t'dtypes.boolean': DEFAULTS.dtypes.boolean,\n\t'dtypes.index': DEFAULTS.dtypes.index,\n\t'dtypes.integer_index': DEFAULTS.dtypes.integer_index,\n\t'dtypes.boolean_index': DEFAULTS.dtypes.boolean_index,\n\t'dtypes.mask_index': DEFAULTS.dtypes.mask_index\n};\n\n\n// MAIN //\n\n/**\n* Returns a default array setting.\n*\n* @param {string} name - setting name\n* @returns {*} default setting or null\n*\n* @example\n* var v = get( 'dtypes.default' );\n* // returns \n*/\nfunction get( name ) {\n\tvar v = HASH[ name ];\n\treturn ( v === void 0 ) ? null : v;\n}\n\n\n// EXPORTS //\n\nexport default get;\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/**\n* Return default array settings.\n*\n* @module @stdlib/array-defaults\n*\n* @example\n* import defaults from '@stdlib/array-defaults';\n*\n* var o = defaults();\n* // returns {...}\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport get from './get.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'get', get );\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// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport ctors from '@stdlib/array-typed-ctors';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport defaults from '@stdlib/array-defaults';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\nvar Complex64Array = ctors( 'complex64' );\nvar Complex128Array = ctors( 'complex128' );\nvar BooleanArray = ctors( 'bool' );\n\n\n// MAIN //\n\n/**\n* Creates a typed array.\n*\n* @param {(NonNegativeInteger|ComplexArray|TypedArray|ArrayLikeObject|ArrayBuffer)} [arg] - a length, typed array, array-like object, or buffer\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {(ComplexArray|TypedArray)} typed array\n*\n* @example\n* var arr = typedarray();\n* // returns \n*\n* @example\n* var arr = typedarray( 2 );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( 2, 'float32' );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( [ 0.5, 0.5 ] );\n* // returns [ 0.5, 0.5 ]\n*\n* @example\n* var arr = typedarray( [ 5, -3 ], 'int32' );\n* // returns [ 5, -3 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1 );\n* // returns [ 5.0, 3.0 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1, 'uint32' );\n* // returns [ 5, 3 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 'float32' );\n* // returns [ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8 );\n* // returns [ 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8, 'float32' );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2 );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2, 'int32' );\n* // returns [ 0, 0 ]\n*/\nfunction typedarray() {\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\tnargs -= 1;\n\t\tdtype = arguments[ nargs ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) {\n\t\targ = arguments[ 0 ];\n\n\t\t// Note: the following checks are not particularly robust, as `instanceof` will fail for cross-realm instances...\n\t\tif ( arg instanceof Complex64Array ) {\n\t\t\targ = reinterpret64( arg, 0 );\n\t\t} else if ( arg instanceof Complex128Array ) {\n\t\t\targ = reinterpret128( arg, 0 );\n\t\t} else if ( arg instanceof BooleanArray ) {\n\t\t\targ = reinterpretBoolean( arg, 0 );\n\t\t}\n\t\treturn new ctor( arg );\n\t}\n\tif ( nargs === 2 ) {\n\t\treturn new ctor( arguments[0], arguments[1] );\n\t}\n\treturn new ctor( arguments[0], arguments[1], arguments[2] );\n}\n\n\n// EXPORTS //\n\nexport default typedarray;\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 format from '@stdlib/string-format';\nimport DATA_VIEW_METHODS from './data_view_methods.js';\nimport getNumber from './get_number.js';\nimport getBoolean from './get_boolean.js';\nimport getComplex from './get_complex.js';\nimport getBigInt from './get_bigint.js';\nimport getStruct from './get_struct.js';\nimport getTypedArray from './get_typedarray.js';\nimport getStructArray from './get_struct_array.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @throws {Error} unexpected error\n* @returns {Function} function for resolving field data\n*/\nfunction getter( obj ) {\n\tif ( obj.length ) {\n\t\tif ( obj.isStructType ) {\n\t\t\treturn getStructArray( obj );\n\t\t}\n\t\treturn getTypedArray( obj );\n\t}\n\tswitch ( obj.type ) {\n\tcase 'float64':\n\tcase 'float32':\n\tcase 'float16':\n\tcase 'int8':\n\tcase 'int16':\n\tcase 'int32':\n\tcase 'uint8':\n\tcase 'uint16':\n\tcase 'uint32':\n\t\treturn getNumber( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'int64':\n\tcase 'uint64':\n\t\treturn getBigInt( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'bool':\n\t\treturn getBoolean( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tcase 'complex128':\n\tcase 'complex64':\n\tcase 'complex32':\n\t\treturn getComplex( obj, DATA_VIEW_METHODS[ obj.type ].get );\n\n\tdefault:\n\t\tif ( obj.isStructType ) {\n\t\t\treturn getStruct( obj );\n\t\t}\n\t\t// Ensure that we fail loudly if we have failed to add support for newly added data types:\n\t\tthrow new Error( format( 'unexpected error. Unrecognized data type. Value: `%s`.', obj.type ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getter;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getStructArray( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a list of `struct` views of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Array} result\n\t*/\n\tfunction getter() {\n\t\tvar offset;\n\t\tvar view;\n\t\tvar out;\n\t\tvar i;\n\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\toffset = view.byteOffset + obj.byteOffset;\n\t\tout = [];\n\t\tfor ( i = 0; i < obj.length; i++ ) {\n\t\t\tout.push( new obj.type( view.buffer, offset, obj.byteLength ) );\n\t\t\toffset += obj.byteOffset;\n\t\t}\n\t\treturn out;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getStructArray;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport typedarray from '@stdlib/array-typed';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getTypedArray( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a typed array view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {TypedArray} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn typedarray( view.buffer, view.byteOffset+obj.byteOffset, obj.length, obj.type ); // eslint-disable-line max-len\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getTypedArray;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getBigInt( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a BigInt value from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {BigInt} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getBigInt;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport Boolean from '@stdlib/boolean-ctor';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for resolving field data\n*/\nfunction getBoolean( obj, method ) {\n\treturn getter;\n\n\t/**\n\t* Reads a boolean value from an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {boolean} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn Boolean( view[ method ]( obj.byteOffset, IS_LITTLE_ENDIAN ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getBoolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for resolving field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for resolving field data\n*/\nfunction getStruct( obj ) {\n\treturn getter;\n\n\t/**\n\t* Returns a `struct` view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @returns {Object} result\n\t*/\n\tfunction getter() {\n\t\tvar view = this[ PRIVATE_BUFFER ];\n\t\treturn new obj.type( view.buffer, view.byteOffset+obj.byteOffset, obj.byteLength ); // eslint-disable-line max-len\n\t}\n}\n\n\n// EXPORTS //\n\nexport default getStruct;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport replace from '@stdlib/string-base-replace';\nimport DTYPES from './dtypes.json';\n\n\n// VARIABLES //\n\nvar RE_SUFFIX = /_and_generic$/;\n\n\n// MAIN //\n\n/**\n* Returns a list of array data types.\n*\n* @param {string} [kind] - data type kind\n* @returns {StringArray} list of array data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', ... ]\n*\n* @example\n* var list = dtypes( 'floating_point' );\n* // returns [...]\n*/\nfunction dtypes() {\n\tvar kind;\n\tvar out;\n\tvar FLG;\n\tif ( arguments.length === 0 ) {\n\t\treturn DTYPES.all.slice();\n\t}\n\tFLG = false;\n\tkind = arguments[ 0 ];\n\tif ( RE_SUFFIX.test( kind ) ) {\n\t\tkind = replace( kind, RE_SUFFIX, '' );\n\t\tif ( kind !== 'all' && kind !== 'index' ) {\n\t\t\tFLG = true;\n\t\t}\n\t}\n\tout = DTYPES[ kind ];\n\tout = ( out ) ? out.slice() : [];\n\tif ( FLG && out.length > 0 ) {\n\t\tout.push( 'generic' );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypes;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array real-valued floating-point data type.\n*\n* @name isRealFloatingPointDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array real-valued floating-point data type\n*\n* @example\n* var bool = isRealFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'foo' );\n* // returns false\n*/\nvar isRealFloatingPointDataType = contains( dtypes( 'real_floating_point' ) ); // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nexport default isRealFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array signed integer data type.\n*\n* @name isSignedIntegerDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array signed integer data type\n*\n* @example\n* var bool = isSignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'uint16' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8c' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'foo' );\n* // returns false\n*/\nvar isSignedIntegerDataType = contains( dtypes( 'signed_integer' ) );\n\n\n// EXPORTS //\n\nexport default isSignedIntegerDataType;\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* Tests if a value is a BigInt primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a BigInt primitive\n*/\nfunction isBigInt( value ) {\n\treturn ( typeof value === 'bigint' );\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\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 nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BigInt object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a BigInt object\n*/\nfunction BigInt( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tnativeClass( value ) === '[object BigInt]' &&\n\t\ttest( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default BigInt;\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* Attempts to call a `BigInt` method.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if able to call a `BigInt` method\n*/\nfunction test( value ) {\n\ttry {\n\t\treturn (\n\t\t\t// Objects created via `Object.create( null )` have no `valueOf()` method:\n\t\t\ttypeof value.valueOf() === 'bigint'\n\t\t);\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) 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 from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BigInt.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a BigInt\n*/\nfunction isBigInt( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Creates a function which always returns the same value.\n*\n* @param {*} [value] - value to always return\n* @returns {Function} constant function\n*\n* @example\n* var fcn = wrap( 3.14 );\n*\n* var v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*/\nfunction wrap( value ) {\n\treturn constantFunction;\n\n\t/**\n\t* Constant function.\n\t*\n\t* @private\n\t* @returns {*} constant value\n\t*/\n\tfunction constantFunction() {\n\t\treturn value;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrap;\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 setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport isSymbol from './generic.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( isSymbol, 'isPrimitive', isPrimitive );\nsetReadOnly( isSymbol, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default isSymbol;\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 setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport constantFunction from '@stdlib/utils-constant-function';\n\n\n// MAIN //\n\nvar isBigInt = constantFunction( false );\nvar isPrimitive = constantFunction( false );\nvar isObject = constantFunction( false );\n\nsetReadOnly( isBigInt, 'isPrimitive', isPrimitive );\nsetReadOnly( isBigInt, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default isBigInt;\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* Test if a value is a BigInt.\n*\n* @module @stdlib/assert-is-bigint\n*\n* @example\n* import BigInt from '@stdlib/bigint-ctor';\n* import isBigInt from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigInt( BigInt( '1' ) );\n* // returns true\n*\n* bool = isBigInt( Object( BigInt( '1' ) ) );\n* // returns true\n*\n* bool = isBigInt( {} );\n* // returns false\n*\n* @example\n* import { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigInt( BigInt( '1' ) );\n* // returns true\n*\n* bool = isBigInt( Object( BigInt( '1' ) ) );\n* // returns false\n*\n* bool = isBigInt( {} );\n* // returns false\n*\n* @example\n* import { isObject as isBigIntObject } from '@stdlib/assert-is-bigint';\n*\n* var bool = isBigIntObject( BigInt( '1' ) );\n* // returns false\n*\n* bool = isBigIntObject( Object( BigInt( '1' ) ) );\n* // returns true\n*\n* bool = isBigIntObject( {} );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasBigInts from '@stdlib/assert-has-bigint-support';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isBigInt;\nif ( hasBigInts() ) {\n\tisBigInt = main;\n} else {\n\tisBigInt = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isBigInt;\n\n// exports: { \"isPrimitive\": \"isBigInt.isPrimitive\", \"isObject\": \"isBigInt.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// MODULES //\n\nimport objectKeys from '@stdlib/utils-keys';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport SAFE_CASTS from './safe_casts.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of safe casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of safe casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast.\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = safeCasts( 'float32' );\n* // returns [...]\n*/\nfunction safeCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default safeCasts;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport safeCasts from '@stdlib/ndarray-safe-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = safeCasts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast to another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be safely cast to another data type\n*\n* @example\n* var bool = isSafeCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isSafeCast( 'float64', 'int32' );\n* // returns false\n*/\nfunction isSafeCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isSafeCast;\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 objectKeys from '@stdlib/utils-keys';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport CASTS from './data.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast and, for floating-point data types, can be downcast.\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = mostlySafeCasts( 'float32' );\n* // returns [...]\n*/\nfunction mostlySafeCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default mostlySafeCasts;\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 casts from '@stdlib/ndarray-mostly-safe-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = casts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast or, for floating-point data types, downcast to another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isMostlySafeCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isMostlySafeCast( 'float64', 'int32' );\n* // returns false\n*/\nfunction isMostlySafeCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a \"mostly\" safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isMostlySafeCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport SAME_KIND_CASTS from './same_kind_casts.json';\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of same \"kind\" casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of same \"kind\" casts for each ndarray data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of ndarray data types to which a provided ndarray data type can be safely cast or cast within the same \"kind\".\n*\n* @param {*} [dtype] - ndarray data type value\n* @returns {(Object|StringArray|null)} list of ndarray data types or null\n*\n* @example\n* var list = sameKindCasts( 'float32' );\n* // returns [...]\n*/\nfunction sameKindCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tdtype = resolve( dtype );\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default sameKindCasts;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport sameKindCasts from '@stdlib/ndarray-same-kind-casts';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// VARIABLES //\n\nvar TABLE = sameKindCasts();\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be safely cast to, or is of the same \"kind\" as, another ndarray data type.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isSameKindCast( 'float32', 'float64' );\n* // returns true\n*\n* bool = isSameKindCast( 'uint16', 'int16' );\n* // returns false\n*/\nfunction isSameKindCast( from, to ) {\n\tvar t;\n\tfrom = resolveStr( from );\n\tto = resolveStr( to );\n\tif ( from === to ) { // note: for \"struct\" data types, require strict equality to be considered a safe cast\n\t\treturn true;\n\t}\n\tt = TABLE[ from ];\n\tif ( t ) {\n\t\treturn t[ to ] > 0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isSameKindCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isSafeCast from '@stdlib/ndarray-base-assert-is-safe-data-type-cast';\nimport isMostlySafeCast from '@stdlib/ndarray-base-assert-is-mostly-safe-data-type-cast';\nimport isSameKindCast from '@stdlib/ndarray-base-assert-is-same-kind-data-type-cast';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a provided ndarray data type can be cast to another ndarray data type according to a specified casting mode.\n*\n* @param {*} from - ndarray data type\n* @param {*} to - ndarray data type\n* @param {string} casting - ndarray casting mode\n* @returns {boolean} boolean indicating if a data type can be cast to another data type\n*\n* @example\n* var bool = isAllowedCast( 'float32', 'float64', 'safe' );\n* // returns true\n*\n* bool = isAllowedCast( 'float64', 'int32', 'safe' );\n* // returns false\n*/\nfunction isAllowedCast( from, to, casting ) {\n\tvar dt1;\n\tvar dt2;\n\n\t// Anything goes for \"unsafe\" casting...\n\tif ( casting === 'unsafe' ) {\n\t\treturn true;\n\t}\n\tdt1 = resolveStr( from );\n\tdt2 = resolveStr( to );\n\n\t// \"Casting\" to the same data type is always allowed, regardless of the casting mode...\n\tif ( dt1 === dt2 ) {\n\t\treturn true;\n\t}\n\t// No casts between different data types are allowed in \"none\" or \"equiv\" casting modes...\n\tif ( casting === 'none' || casting === 'equiv' ) {\n\t\treturn false;\n\t}\n\t// In \"safe\" casting mode, only casts which preserve values are allowed...\n\tif ( casting === 'safe' ) {\n\t\treturn isSafeCast( from, to );\n\t}\n\t// In \"mostly-safe\" casting mode, in addition to \"safe\" casts, for floating-point data types, downcasts are allowed...\n\tif ( casting === 'mostly-safe' ) {\n\t\treturn isMostlySafeCast( from, to );\n\t}\n\t// In \"same-kind\" casting mode, in addition to \"safe\" casts, casts within a \"kind\" (e.g., between signed integers or between floating-point numbers) are allowed...\n\treturn isSameKindCast( from, to );\n}\n\n\n// EXPORTS //\n\nexport default isAllowedCast;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Smallest positive single-precision floating-point subnormal number.\n*\n* @module @stdlib/constants-float32-smallest-subnormal\n* @type {number}\n*\n* @example\n* import FLOAT32_SMALLEST_SUBNORMAL from '@stdlib/constants-float32-smallest-subnormal';\n* // returns 1.401298464324817e-45\n*/\n\n\n// MAIN //\n\n/**\n* Smallest positive single-precision floating-point subnormal number.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* \\frac{1}{2^{127-1} 2^{23}}\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 00000000 00000000000000000000001\n* ```\n*\n* @constant\n* @type {number}\n* @default 1.401298464324817e-45\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_SMALLEST_SUBNORMAL = 1.401298464324817e-45;\n\n\n// EXPORTS //\n\nexport default FLOAT32_SMALLEST_SUBNORMAL;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 safe single-precision floating-point integer.\n*\n* @module @stdlib/constants-float32-max-safe-integer\n* @type {number}\n*\n* @example\n* import FLOAT32_MAX_SAFE_INTEGER from '@stdlib/constants-float32-max-safe-integer';\n* // returns 16777215\n*/\n\n\n// MAIN //\n\n/**\n* Maximum safe single-precision floating-point integer.\n*\n* ## Notes\n*\n* The maximum safe integer is given by\n*\n* ```tex\n* 2^{24} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 16777215\n* @see [Safe Integers]{@link http://www.2ality.com/2013/10/safe-integers.html}\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_MAX_SAFE_INTEGER = 16777215;\n\n\n// EXPORTS //\n\nexport default FLOAT32_MAX_SAFE_INTEGER;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 safe single-precision floating-point integer.\n*\n* @module @stdlib/constants-float32-min-safe-integer\n* @type {number}\n*\n* @example\n* import FLOAT32_MIN_SAFE_INTEGER from '@stdlib/constants-float32-min-safe-integer';\n* // returns -16777215\n*/\n\n\n// MAIN //\n\n/**\n* Minimum safe single-precision floating-point integer.\n*\n* ## Notes\n*\n* The minimum safe integer is given by\n*\n* ```tex\n* -(2^{24} - 1)\n* ```\n*\n* @constant\n* @type {number}\n* @default -16777215\n* @see [Safe Integers]{@link http://www.2ality.com/2013/10/safe-integers.html}\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT32_MIN_SAFE_INTEGER = -16777215;\n\n\n// EXPORTS //\n\nexport default FLOAT32_MIN_SAFE_INTEGER;\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 isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport isNegativeZero from '@stdlib/math-base-assert-is-negative-zero';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport FLOAT32_SMALLEST_SUBNORMAL from '@stdlib/constants-float32-smallest-subnormal'; // eslint-disable-line id-length\nimport FLOAT32_MAX_SAFE_INTEGER from '@stdlib/constants-float32-max-safe-integer';\nimport FLOAT32_MIN_SAFE_INTEGER from '@stdlib/constants-float32-min-safe-integer';\nimport INT8_MIN from '@stdlib/constants-int8-min';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport UINT8_MAX from '@stdlib/constants-uint8-max';\nimport UINT16_MAX from '@stdlib/constants-uint16-max';\nimport UINT32_MAX from '@stdlib/constants-uint32-max';\n\n\n// FUNCTIONS //\n\n/**\n* Returns the minimum floating-point array data type of the closest \"kind\" necessary for storing a provided scalar.\n*\n* @private\n* @param {number} value - real value\n* @returns {string} array data type\n*/\nfunction minFloatDataType( value ) {\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value >= FLOAT32_MIN_SAFE_INTEGER && value <= FLOAT32_MAX_SAFE_INTEGER ) { // eslint-disable-line max-len\n\t\t\treturn 'float32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// MAIN //\n\n/**\n* Returns the minimum array data type of the closest \"kind\" necessary for storing a provided scalar value.\n*\n* @param {*} value - scalar value\n* @returns {string} array data type\n*\n* @example\n* var dt = minDataType( 3.141592653589793 );\n* // returns 'float32'\n*\n* @example\n* var dt = minDataType( 3 );\n* // returns 'uint8'\n*/\nfunction minDataType( value ) {\n\tif ( !isNumber( value ) ) {\n\t\tif ( isBoolean( value ) ) {\n\t\t\treturn 'bool';\n\t\t}\n\t\tif ( isComplexLike( value ) ) {\n\t\t\tif ( minFloatDataType( value.re ) === 'float64' || minFloatDataType( value.im ) === 'float64' ) {\n\t\t\t\treturn 'complex128';\n\t\t\t}\n\t\t\treturn 'complex64';\n\t\t}\n\t\treturn 'generic';\n\t}\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value === 0 && isNegativeZero( value ) ) {\n\t\t\treturn 'float32';\n\t\t}\n\t\tif ( value < 0 ) {\n\t\t\tif ( value >= INT8_MIN ) {\n\t\t\t\treturn 'int8';\n\t\t\t}\n\t\t\tif ( value >= INT16_MIN ) {\n\t\t\t\treturn 'int16';\n\t\t\t}\n\t\t\tif ( value >= INT32_MIN ) {\n\t\t\t\treturn 'int32';\n\t\t\t}\n\t\t\treturn 'float64';\n\t\t}\n\t\tif ( value <= UINT8_MAX ) {\n\t\t\treturn 'uint8';\n\t\t}\n\t\tif ( value <= UINT16_MAX ) {\n\t\t\treturn 'uint16';\n\t\t}\n\t\tif ( value <= UINT32_MAX ) {\n\t\t\treturn 'uint32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// EXPORTS //\n\nexport default minDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport NINF from '@stdlib/constants-float64-ninf';\n\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is negative zero.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is negative zero\n*\n* @example\n* var bool = isNegativeZero( -0.0 );\n* // returns true\n*\n* @example\n* var bool = isNegativeZero( 0.0 );\n* // returns false\n*/\nfunction isNegativeZero( x ) {\n\treturn (x === 0.0 && 1.0/x === NINF);\n}\n\n\n// EXPORTS //\n\nexport default isNegativeZero;\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// Mapping from complex number constructors to data types...\nvar ctor2dtypes = {\n\t'Complex64': 'complex64',\n\t'Complex128': 'complex128'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\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 dtypes from '@stdlib/complex-dtypes';\n\n\n// MAIN //\n\nvar DTYPES = dtypes();\n\n\n// EXPORTS //\n\nexport default DTYPES;\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 ctors from '@stdlib/complex-ctors';\nimport DTYPES from './dtypes.js';\n\n\n// MAIN //\n\nvar CTORS = [];\nvar i;\nfor ( i = 0; i < DTYPES.length; i++ ) {\n\tCTORS.push( ctors( DTYPES[ i ] ) );\n}\n\n\n// EXPORTS //\n\nexport default CTORS;\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 DTYPES from './dtypes.json';\n\n\n// MAIN //\n\n/**\n* Returns a list of complex number data types.\n*\n* @returns {StringArray} list of complex number data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'complex64', 'complex128' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nexport default dtypes;\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 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 a complex number.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n*\n* var dt = dtype( new Complex128( 1.0, 2.0 ) );\n* // returns 'complex128'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\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) 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* Converts a boolean to a number.\n*\n* @private\n* @param {boolean} value - input value\n* @returns {number} result\n*/\nfunction boolean2number( value ) {\n\treturn ( value ) ? 1 : 0;\n}\n\n\n// EXPORTS //\n\nexport default boolean2number;\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 Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a BigInt to a number.\n*\n* @private\n* @param {BigInt} value - input value\n* @returns {number} result\n*/\nfunction bigint2number( value ) {\n\treturn Number( value );\n}\n\n\n// EXPORTS //\n\nexport default bigint2number;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport isRealFloatingPointDataType from '@stdlib/array-base-assert-is-real-floating-point-data-type'; // eslint-disable-line id-length\nimport isSignedIntegerDataType from '@stdlib/array-base-assert-is-signed-integer-data-type';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport minDataType from '@stdlib/array-min-dtype';\nimport minSignedIntegerDataType from '@stdlib/array-base-min-signed-integer-dtype';\nimport complexDType from '@stdlib/complex-dtype';\nimport format from '@stdlib/string-format';\nimport boolean2number from './boolean2number.js';\nimport bigint2number from './bigint2number.js';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setNumber( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a number value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isNumber( value ) ) {\n\t\t\tif ( isRealFloatingPointDataType( obj.type ) ) {\n\t\t\t\tdt = obj.type;\n\t\t\t} else if ( !isInteger( value ) ) {\n\t\t\t\tdt = defaults.dtypes.real;\n\t\t\t} else if ( isSignedIntegerDataType( obj.type ) ) {\n\t\t\t\tdt = minSignedIntegerDataType( value );\n\t\t\t} else {\n\t\t\t\tdt = minDataType( value );\n\t\t\t}\n\t\t\tv = value;\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || ( ( obj.type === 'float32' ) ? 'complex64' : 'complex128' );\n\t\t\tv = value.re; // discard imaginary component\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2number( value );\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tv = bigint2number( value );\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = value;\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setNumber;\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 INT8_MIN from '@stdlib/constants-int8-min';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport INT8_MAX from '@stdlib/constants-int8-max';\nimport INT16_MAX from '@stdlib/constants-int16-max';\nimport INT32_MAX from '@stdlib/constants-int32-max';\n\n\n// MAIN //\n\n/**\n* Returns the minimum array data type for storing a provided signed integer value.\n*\n* @param {integer} value - scalar value\n* @returns {string} array data type\n*\n* @example\n* var dt = minSignedIntegerDataType( 9999 );\n* // returns 'int16'\n*\n* @example\n* var dt = minSignedIntegerDataType( 3 );\n* // returns 'int8'\n*/\nfunction minSignedIntegerDataType( value ) {\n\tif ( value < 0 ) {\n\t\tif ( value >= INT8_MIN ) {\n\t\t\treturn 'int8';\n\t\t}\n\t\tif ( value >= INT16_MIN ) {\n\t\t\treturn 'int16';\n\t\t}\n\t\tif ( value >= INT32_MIN ) {\n\t\t\treturn 'int32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\tif ( value <= INT8_MAX ) {\n\t\treturn 'int8';\n\t}\n\tif ( value <= INT16_MAX ) {\n\t\treturn 'int16';\n\t}\n\tif ( value <= INT32_MAX ) {\n\t\treturn 'int32';\n\t}\n\treturn 'float64';\n}\n\n\n// EXPORTS //\n\nexport default minSignedIntegerDataType;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a number to a boolean.\n*\n* @private\n* @param {number} value - input value\n* @returns {boolean} result\n*/\nfunction number2boolean( value ) {\n\treturn Boolean( value );\n}\n\n\n// EXPORTS //\n\nexport default number2boolean;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a complex number to a boolean.\n*\n* @private\n* @param {ComplexLike} value - input value\n* @returns {boolean} result\n*/\nfunction complex2boolean( value ) {\n\treturn Boolean( value.re || value.im );\n}\n\n\n// EXPORTS //\n\nexport default complex2boolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport complexDType from '@stdlib/complex-dtype';\nimport Boolean from '@stdlib/boolean-ctor';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport boolean2number from './boolean2number.js';\nimport number2boolean from './number2boolean.js';\nimport complex2boolean from './complex2boolean.js';\nimport bigint2boolean from './bigint2boolean.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setBoolean( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a boolean value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2number( value );\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tdt = defaults.dtypes.real;\n\t\t\tv = boolean2number( number2boolean( value ) );\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tv = boolean2number( bigint2boolean( value ) );\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || defaults.dtypes.complex;\n\t\t\tv = boolean2number( complex2boolean( value ) );\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = Boolean( value );\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setBoolean;\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 Boolean from '@stdlib/boolean-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a BigInt to a boolean.\n*\n* @private\n* @param {BigInt} value - input value\n* @returns {boolean} result\n*/\nfunction bigint2boolean( value ) {\n\treturn Boolean( value );\n}\n\n\n// EXPORTS //\n\nexport default bigint2boolean;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport minDataType from '@stdlib/array-min-dtype';\nimport complexDType from '@stdlib/complex-dtype';\nimport BigInt from '@stdlib/bigint-ctor';\nimport Number from '@stdlib/number-ctor';\nimport floor from '@stdlib/math-base-special-floor';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport boolean2bigint from './boolean2bigint.js';\nimport defaults from './defaults.json';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setBigInt( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a number value to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar v;\n\t\tif ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // FIXME: support both int64 and uint64\n\t\t\tv = value;\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tif ( isInteger( value ) ) {\n\t\t\t\tdt = minDataType( value );\n\t\t\t\tv = BigInt( value );\n\t\t\t} else {\n\t\t\t\tdt = defaults.dtypes.real;\n\t\t\t\tv = BigInt( floor( value ) );\n\t\t\t}\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tv = boolean2bigint( value );\n\t\t} else if ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || defaults.dtypes.complex;\n\t\t\tv = BigInt( floor( value.re ) ); // discard imaginary component\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tv = BigInt( floor( Number( v ) ) );\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, v, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setBigInt;\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 BigInt from '@stdlib/bigint-ctor';\n\n\n// MAIN //\n\n/**\n* Converts a boolean to a BigInt.\n*\n* @private\n* @param {boolean} value - input value\n* @returns {number} result\n*/\nfunction boolean2bigint( value ) {\n\treturn BigInt( ( value ) ? 1 : 0 );\n}\n\n\n// EXPORTS //\n\nexport default boolean2bigint;\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 isDataView from '@stdlib/assert-is-dataview';\nimport isObject from '@stdlib/assert-is-object';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `struct` instance.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `struct` instance\n*/\nfunction isStructInstance( value ) {\n\t// NOTE: the following is a relatively weak test, but we cannot use `instanceof` checks, etc, due to the factory nature of the implementation. Regardless, here, we are just trying to sniff out a `struct` type. If calling as a constructor later fails, we punt the responsibility off to the user to handle what should be an edge case. If, in the future, this check proves insufficient, we can add further \"brand\" checks...\n\treturn (\n\t\tisObject( value ) &&\n\t\tisDataView( value[ PRIVATE_BUFFER ] )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isStructInstance;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array complex-valued floating-point data type.\n*\n* @name isComplexFloatingPointDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array complex-valued floating-point data type\n*\n* @example\n* var bool = isComplexFloatingPointDataType( 'complex64' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'complex128' );\n* // returns true\n*\n* bool = isComplexFloatingPointDataType( 'float32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'float64' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isComplexFloatingPointDataType( 'foo' );\n* // returns false\n*/\nvar isComplexFloatingPointDataType = contains( dtypes( 'complex_floating_point' ) ); // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nexport default isComplexFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array boolean data type.\n*\n* @name isBooleanDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array boolean data type\n*\n* @example\n* var bool = isBooleanDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanDataType( 'complex64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'complex128' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanDataType( 'foo' );\n* // returns false\n*/\nvar isBooleanDataType = contains( dtypes( 'boolean' ) );\n\n\n// EXPORTS //\n\nexport default isBooleanDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/array-dtypes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported array real-valued data type.\n*\n* @name isRealDataType\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported array real-valued data type\n*\n* @example\n* var bool = isRealDataType( 'float32' );\n* // returns true\n*\n* bool = isRealDataType( 'float64' );\n* // returns true\n*\n* bool = isRealDataType( 'complex128' );\n* // returns false\n*\n* bool = isRealDataType( 'generic' );\n* // returns false\n*\n* bool = isRealDataType( 'int16' );\n* // returns true\n*\n* bool = isRealDataType( 'int32' );\n* // returns true\n*\n* bool = isRealDataType( 'int8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint16' );\n* // returns true\n*\n* bool = isRealDataType( 'uint32' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8c' );\n* // returns true\n*\n* bool = isRealDataType( 'foo' );\n* // returns false\n*/\nvar isRealDataType = contains( dtypes( 'real' ) );\n\n\n// EXPORTS //\n\nexport default isRealDataType;\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 isComplex128Array from '@stdlib/array-base-assert-is-complex128array';\nimport isComplex64Array from '@stdlib/array-base-assert-is-complex64array';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Reinterprets a complex-valued floating-point array as a real-valued floating-point array having the same precision.\n*\n* @param {(Complex128Array|Complex64Array)} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @throws {TypeError} first argument must be a supported complex-valued floating-point array\n* @returns {(Float64Array|Float32Array)} real-valued floating-point array 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*\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\tif ( isComplex128Array( x ) ) {\n\t\treturn reinterpret128( x, offset );\n\t}\n\tif ( isComplex64Array( x ) ) {\n\t\treturn reinterpret64( x, offset );\n\t}\n\t// Note: intentionally throw here to catch the scenario in which we add, e.g., a Complex32Array and need to explicitly add support here...\n\tthrow new TypeError( format( 'invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.', x ) );\n}\n\n\n// EXPORTS //\n\nexport default reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 accessors from './accessors.js';\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Fills a strided array with a specified scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {Collection} input array\n*\n* @example\n* var x = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gfill( 3, 5.0, x, 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX, offsetX ) {\n\tvar ix;\n\tvar m;\n\tvar o;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn x;\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\taccessors( N, alpha, o, strideX, offsetX );\n\t\treturn o.data;\n\t}\n\tix = offsetX;\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( strideX === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\tx[ ix ] = alpha;\n\t\t\t\tix += strideX;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn x;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\tx[ ix ] = alpha;\n\t\t\tx[ ix+1 ] = alpha;\n\t\t\tx[ ix+2 ] = alpha;\n\t\t\tx[ ix+3 ] = alpha;\n\t\t\tx[ ix+4 ] = alpha;\n\t\t\tx[ ix+5 ] = alpha;\n\t\t\tx[ ix+6 ] = alpha;\n\t\t\tx[ ix+7 ] = alpha;\n\t\t\tix += M;\n\t\t}\n\t\treturn x;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\tx[ ix ] = alpha;\n\t\tix += strideX;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gfill;\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* Fills a strided array with a specified scalar constant.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - stride length\n* @param {NonNegativeInteger} offsetX - starting index\n* @returns {Object} input array object\n*\n* @example\n* import Complex64Array from '@stdlib/array-complex64';\n* import Complex64 from '@stdlib/complex-float32-ctor';\n* import reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\n*\n* function setter( data, idx, value ) {\n* data.set( value, idx );\n* }\n*\n* var data = new Complex64Array( [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ] );\n*\n* var x = {\n* 'data': data,\n* 'accessors': [ null, setter ]\n* };\n*\n* var alpha = new Complex64( 5.0, 5.0 );\n*\n* gfill( data.length, alpha, x, 1, 0 );\n*\n* var view = reinterpret64( x.data, 0 );\n* // returns [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX, offsetX ) {\n\tvar xbuf;\n\tvar set;\n\tvar ix;\n\tvar i;\n\n\t// Cache reference to array data:\n\txbuf = x.data;\n\n\t// Cache a reference to the element accessor:\n\tset = x.accessors[ 1 ];\n\n\tix = offsetX;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( xbuf, ix, alpha );\n\t\tix += strideX;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport stride2offset from '@stdlib/strided-base-stride2offset';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\n/**\n* Fills a strided array with a specified scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {*} alpha - scalar constant\n* @param {Collection} x - input array\n* @param {integer} strideX - stride length\n* @returns {Collection} input array\n*\n* @example\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill( x.length, 5.0, x, 1 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\nfunction gfill( N, alpha, x, strideX ) {\n\treturn ndarray( N, alpha, x, strideX, stride2offset( N, strideX ) );\n}\n\n\n// EXPORTS //\n\nexport default gfill;\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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// FUNCTIONS //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} thisArg - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n* var out = internal( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction internal( x, y, stride, offset, fcn, thisArg ) {\n\tvar io;\n\tvar i;\n\n\tio = offset;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\ty[ io ] = fcn.call( thisArg, x[ i ], i, x );\n\t\tio += stride;\n\t}\n\treturn y;\n}\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Object} y - output array object\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} thisArg - callback execution context\n* @returns {Object} output array object\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import arraylike2object from '@stdlib/array-base-arraylike2object';\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = accessors( arraylike2object( toAccessorArray( x ) ), arraylike2object( toAccessorArray( y ) ), 1, 0, scale );\n* // y => [ 10.0, 10.0, 10.0, 10.0 ]\n*/\nfunction accessors( x, y, stride, offset, fcn, thisArg ) {\n\tvar xdata;\n\tvar ydata;\n\tvar xget;\n\tvar yset;\n\tvar io;\n\tvar i;\n\n\txdata = x.data;\n\tydata = y.data;\n\txget = x.accessors[ 0 ];\n\tyset = y.accessors[ 1 ];\n\n\tio = offset;\n\tfor ( i = 0; i < xdata.length; i++ ) {\n\t\tyset( ydata, io, fcn.call( thisArg, xget( xdata, i ), i, xdata ) );\n\t\tio += stride;\n\t}\n\treturn y;\n}\n\n\n// MAIN //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in an output array.\n*\n* @param {Collection} x - input array\n* @param {Collection} y - output array\n* @param {integer} stride - stride length for output array\n* @param {NonNegativeInteger} offset - starting index for output array\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = assign( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction assign( x, y, stride, offset, fcn, thisArg ) {\n\tvar xobj;\n\tvar yobj;\n\n\txobj = arraylike2object( x );\n\tyobj = arraylike2object( y );\n\tif ( xobj.accessorProtocol || yobj.accessorProtocol ) {\n\t\taccessors( xobj, yobj, stride, offset, fcn, thisArg );\n\t\treturn y;\n\t}\n\treturn internal( x, y, stride, offset, fcn, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default assign;\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 zeros from '@stdlib/array-base-zeros';\nimport assign from './assign.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'map' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n\n// MAIN //\n\n/**\n* Applies a callback function to elements in an input array and assigns results to elements in a new output array.\n*\n* @param {Collection} x - input array\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = map( x, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*/\nfunction map( x, fcn, thisArg ) {\n\tif ( hasMethod( x, 'map' ) ) {\n\t\treturn x.map( fcn, thisArg );\n\t}\n\treturn assign( x, zeros( x.length ), 1, 0, fcn, thisArg );\n}\n\n\n// EXPORTS //\n\nexport default map;\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* Converts a complex number to a number.\n*\n* @private\n* @param {ComplexLike} value - input value\n* @returns {number} result\n*/\nfunction complex2number( value ) {\n\treturn value.re;\n}\n\n\n// EXPORTS //\n\nexport default complex2number;\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 format from '@stdlib/string-format';\nimport DATA_VIEW_METHODS from './data_view_methods.js';\nimport setNumber from './set_number.js';\nimport setComplex from './set_complex.js';\nimport setBoolean from './set_boolean.js';\nimport setBigInt from './set_bigint.js';\nimport setStruct from './set_struct.js';\nimport setTypedArray from './set_typedarray.js';\nimport setStructArray from './set_struct_array.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for setting field data.\n*\n* @private\n* @param {Object} obj - field object\n* @throws {Error} unexpected error\n* @returns {Function} function for setting field data\n*/\nfunction setter( obj ) {\n\tif ( obj.length ) {\n\t\tif ( obj.isStructType ) {\n\t\t\treturn setStructArray( obj );\n\t\t}\n\t\treturn setTypedArray( obj );\n\t}\n\tswitch ( obj.type ) {\n\tcase 'float64':\n\tcase 'float32':\n\tcase 'float16':\n\tcase 'int8':\n\tcase 'int16':\n\tcase 'int32':\n\tcase 'uint8':\n\tcase 'uint16':\n\tcase 'uint32':\n\t\treturn setNumber( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'int64':\n\tcase 'uint64':\n\t\treturn setBigInt( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'bool':\n\t\treturn setBoolean( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tcase 'complex128':\n\tcase 'complex64':\n\tcase 'complex32':\n\t\treturn setComplex( obj, DATA_VIEW_METHODS[ obj.type ].set );\n\n\tdefault:\n\t\tif ( obj.isStructType ) {\n\t\t\treturn setStruct( obj );\n\t\t}\n\t\t// Ensure that we fail loudly if we have failed to add support for newly added data types:\n\t\tthrow new Error( format( 'unexpected error. Unrecognized data type. Value: `%s`.', obj.type ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setter;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport isCollection from '@stdlib/assert-is-collection';\nimport Uint8Array from '@stdlib/array-uint8';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setStructArray( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes a list of `struct` instances to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Collection} values - list of `struct` instances\n\t* @throws {TypeError} must provide an array-like object\n\t* @throws {RangeError} must provide an array-like object having an expected length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( values ) {\n\t\tvar offset;\n\t\tvar views;\n\t\tvar view;\n\t\tvar dest;\n\t\tvar src;\n\t\tvar buf;\n\t\tvar nb;\n\t\tvar i;\n\n\t\tif ( !isCollection( values ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be an array-like object. Value: `%s`.', obj.name, values ) );\n\t\t}\n\t\tif ( values.length !== obj.length ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object having length %u.', obj.name, obj.length ) );\n\t\t}\n\t\tif ( obj.casting === 'none' ) {\n\t\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\t\tif ( !( values[ i ] instanceof obj.type ) ) { // note: this check will fail for cross-realm `struct` instances\n\t\t\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Value: `%s`.', obj.name, values[ i ] ) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Compute the expected number of bytes per struct view:\n\t\tnb = obj.byteLength / obj.length; // note: as a field is expected to have a homogeneous data type, the byte length should be evenly divisible by the number of elements\n\n\t\t// Check that all struct instances have the same byte length...\n\t\tviews = [];\n\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\tbuf = this.constructor.viewOf( values[ i ] );\n\t\t\tif ( buf.byteLength !== nb ) {\n\t\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object containing `struct` instances having the same byte length.', obj.name ) );\n\t\t\t}\n\t\t\tsrc = new Uint8Array( buf.buffer, buf.byteOffset, nb );\n\t\t\tviews.push( src );\n\t\t}\n\t\t// Write the data for each `struct` to the underlying byte buffer...\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\toffset = view.byteOffset + obj.byteOffset;\n\t\tfor ( i = 0; i < values.length; i++ ) {\n\t\t\tdest = new Uint8Array( view.buffer, offset, nb );\n\t\t\tgcopy( obj.length, views[ i ], 1, dest, 1 );\n\t\t\toffset += nb;\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setStructArray;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport isCollection from '@stdlib/assert-is-collection';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport isComplexDataType from '@stdlib/array-base-assert-is-complex-floating-point-data-type';\nimport isBooleanDataType from '@stdlib/array-base-assert-is-boolean-data-type';\nimport isRealDataType from '@stdlib/array-base-assert-is-real-data-type';\nimport typedarray from '@stdlib/array-typed';\nimport dtype from '@stdlib/array-dtype';\nimport reinterpretComplex from '@stdlib/strided-base-reinterpret-complex';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport gfill from '@stdlib/blas-ext-base-gfill';\nimport map from '@stdlib/array-base-map';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport isStructInstance from './is_struct_instance.js';\nimport number2boolean from './number2boolean.js';\nimport complex2boolean from './complex2boolean.js';\nimport complex2number from './complex2number.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setTypedArray( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes a list of values to a typed array view of an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Collection} value - value to set\n\t* @throws {TypeError} must provide an array-like object\n\t* @throws {RangeError} must provide an array-like object having an expected length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar buf;\n\t\tvar dt;\n\t\tif ( !isCollection( value ) || isStructInstance( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be an array-like object. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tif ( value.length !== obj.length ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be an array-like object having length %u.', obj.name, obj.length ) );\n\t\t}\n\t\tdt = dtype( value );\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tbuf = this[ PRIVATE_BUFFER ];\n\t\tview = typedarray( buf.buffer, buf.byteOffset+obj.byteOffset, obj.length, obj.type );\n\t\tif ( dt === obj.type ) {\n\t\t\t// Case: complex => complex\n\t\t\tif ( isComplexDataType( dt ) ) {\n\t\t\t\tgcopy( obj.length*2, reinterpretComplex( value, 0 ), 1, reinterpretComplex( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: boolean => boolean\n\t\t\tif ( isBooleanDataType( dt ) ) {\n\t\t\t\tgcopy( obj.length, reinterpretBoolean( value, 0 ), 1, reinterpretBoolean( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => real\n\t\t\tgcopy( obj.length, value, 1, view, 1 );\n\t\t\treturn;\n\t\t}\n\t\t// Case: real => ???\n\t\tif ( isRealDataType( dt ) ) {\n\t\t\t// Case: real => real\n\t\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\t\tgcopy( obj.length, value, 1, view, 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => complex\n\t\t\tif ( isComplexDataType( obj.type ) ) {\n\t\t\t\tview = reinterpretComplex( view, 0 );\n\n\t\t\t\t// TODO: consider refactoring to avoid two-passes; may require creating a separate strided utility explicitly aimed at casting real-valued arrays to complex arrays\n\t\t\t\tgcopy( obj.length, view, 2, value, 1 ); // assign to only real-components\n\t\t\t\tgfill.ndarray( obj.length, 0.0, view, 2, 1 ); // fill imaginary components with zeros\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: real => boolean\n\t\t\tmap.assign( value, view, 1, 0, number2boolean );\n\t\t\treturn;\n\t\t}\n\t\t// Case: complex => ???\n\t\tif ( isComplexDataType( dt ) ) {\n\t\t\t// Case: complex => real\n\t\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\t\tmap.assign( value, view, 1, 0, complex2number ); // discard imaginary components\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: complex => complex\n\t\t\tif ( isComplexDataType( obj.type ) ) {\n\t\t\t\tgcopy( obj.length*2, reinterpretComplex( value, 0 ), 1, reinterpretComplex( view, 0 ), 1 );\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Case: complex => boolean\n\t\t\tmap.assign( value, view, 1, 0, complex2boolean );\n\t\t\treturn;\n\t\t}\n\t\t// Case: boolean => ???\n\n\t\t// Case: boolean => real\n\t\tif ( isRealDataType( obj.type ) ) {\n\t\t\tgcopy( obj.length, reinterpretBoolean( value, 0 ), 1, view, 1 );\n\t\t\treturn;\n\t\t}\n\t\t// Case: boolean => complex\n\t\tview = reinterpretComplex( view, 0 );\n\n\t\t// TODO: consider refactoring to avoid two-passes; may require creating a separate strided utility explicitly aimed at casting real-valued arrays to complex arrays\n\t\tgcopy( obj.length, view, 2, reinterpretBoolean( value, 0 ), 1 ); // assign to only real-components\n\t\tgfill.ndarray( obj.length, 0.0, view, 2, 1 ); // fill imaginary components with zeros\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setTypedArray;\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 no-invalid-this, max-len */\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport { isPrimitive as isBigInt } from '@stdlib/assert-is-bigint';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isAllowedCast from '@stdlib/ndarray-base-assert-is-allowed-data-type-cast';\nimport complexDType from '@stdlib/complex-dtype';\nimport format from '@stdlib/string-format';\nimport boolean2number from './boolean2number.js';\nimport bigint2number from './bigint2number.js';\nimport PRIVATE_BUFFER from './private_buffer.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @param {string} method - data view method name\n* @returns {Function} function for writing field data\n*/\nfunction setComplex( obj, method ) {\n\treturn setter;\n\n\t/**\n\t* Writes a complex number to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {*} value - value to set\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dt;\n\t\tvar re;\n\t\tvar im;\n\t\tif ( isComplexLike( value ) ) {\n\t\t\tdt = complexDType( value ) || obj.type;\n\t\t\tre = value.re;\n\t\t\tim = value.im;\n\t\t} else if ( isNumber( value ) ) {\n\t\t\tdt = ( obj.type === 'complex64' ) ? 'float32' : 'float64';\n\t\t\tre = value;\n\t\t\tim = 0.0;\n\t\t} else if ( isBigInt( value ) ) {\n\t\t\tdt = 'int64'; // note: the specific integer data type (int64 vs uint64) should not matter here\n\t\t\tre = bigint2number( value );\n\t\t\tim = 0.0;\n\t\t} else if ( isBoolean( value ) ) {\n\t\t\tdt = 'bool';\n\t\t\tre = boolean2number( value );\n\t\t\tim = 0.0;\n\t\t} else {\n\t\t\tdt = 'generic';\n\t\t\tre = value;\n\t\t\tim = 0.0;\n\t\t}\n\t\tif ( !isAllowedCast( dt, obj.type, obj.castingMode ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Data types: [%s, %s].', obj.name, obj.type, dt ) );\n\t\t}\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tview[ method ]( obj.byteOffset, re, IS_LITTLE_ENDIAN );\n\t\tview[ method ]( obj.byteOffset+(obj.byteLength/2), im, IS_LITTLE_ENDIAN );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setComplex;\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 no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport Uint8Array from '@stdlib/array-uint8';\nimport gcopy from '@stdlib/blas-base-gcopy';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport isStructInstance from './is_struct_instance.js';\n\n\n// MAIN //\n\n/**\n* Returns a function for writing field data.\n*\n* @private\n* @param {Object} obj - field object\n* @returns {Function} function for writing field data\n*/\nfunction setStruct( obj ) {\n\treturn setter;\n\n\t/**\n\t* Writes `struct` data to an underlying byte buffer.\n\t*\n\t* @private\n\t* @param {Object} value - value to set\n\t* @throws {TypeError} must be a `struct` instance\n\t* @throws {RangeError} must be a `struct` instance having the same byte length\n\t* @throws {TypeError} cannot cast provided values to field data type\n\t*/\n\tfunction setter( value ) {\n\t\tvar view;\n\t\tvar dest;\n\t\tvar src;\n\t\tvar buf;\n\t\tvar nb;\n\t\tif ( !isStructInstance( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. `%s` must be a `struct` instance. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tif ( obj.casting === 'none' && !( value instanceof obj.type ) ) {\n\t\t\tthrow new TypeError( format( 'invalid assignment. Assigned value cannot be cast to the data type of `%s`. Value: `%s`.', obj.name, value ) );\n\t\t}\n\t\tnb = obj.byteLength;\n\n\t\tbuf = this.constructor.viewOf( value );\n\t\tif ( buf.byteLength !== nb ) {\n\t\t\tthrow new RangeError( format( 'invalid assignment. `%s` must be a `struct` instance having the same byte length.', obj.name ) );\n\t\t}\n\t\tsrc = new Uint8Array( buf.buffer, buf.byteOffset, nb );\n\n\t\tview = this[ PRIVATE_BUFFER ];\n\t\tdest = new Uint8Array( view.buffer, view.byteOffset+obj.byteOffset, nb ); // eslint-disable-line max-len\n\n\t\tgcopy( obj.length, src, 1, dest, 1 );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default setStruct;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Fill a strided array with a specified scalar constant.\n*\n* @module @stdlib/blas-ext-base-gfill\n*\n* @example\n* import gfill from '@stdlib/blas-ext-base-gfill';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill( x.length, 5.0, x, 1 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*\n* @example\n* import gfill from '@stdlib/blas-ext-base-gfill';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gfill.ndarray( x.length, 5.0, x, 1, 0 );\n* // x => [ 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport ndarray from './ndarray.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nexport default main;\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 callback function to elements in an input array and assign results to elements in a new output array.\n*\n* @module @stdlib/array-base-map\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import map from '@stdlib/array-base-map';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = map( x, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* @example\n* import ones from '@stdlib/array-base-ones';\n* import zeros from '@stdlib/array-base-zeros';\n* import map from '@stdlib/array-base-map';\n*\n* function scale( x ) {\n* return x * 10.0;\n* }\n*\n* var x = ones( 4 );\n* var y = zeros( x.length );\n*\n* var out = map.assign( x, y, 1, 0, scale );\n* // returns [ 10.0, 10.0, 10.0, 10.0 ]\n*\n* var bool = ( out === y );\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// exports: { \"assign\": \"main.assign\" }\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\nvar FIELD_PROPERTIES = [\n\t'name',\n\t'type',\n\t'description',\n\t'length',\n\t'enumerable',\n\t'writable',\n\t'default',\n\t'castingMode'\n];\n\n\n// EXPORTS //\n\nexport default FIELD_PROPERTIES;\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 isCollection from '@stdlib/assert-is-collection';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating whether a field object represents a union type.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {boolean} result\n*/\nfunction isUnionType( obj ) {\n\treturn obj.type === 'union' && isCollection( obj.fields );\n}\n\n\n// EXPORTS //\n\nexport default isUnionType;\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 { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid boolean field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidBoolean( value, name ) {\n\tif ( isBoolean( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a boolean. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidBoolean;\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\nvar DTYPES = [\n\t'int8',\n\t'int16',\n\t'int32',\n\t'int64',\n\n\t'uint8',\n\t'uint16',\n\t'uint32',\n\t'uint64',\n\n\t// 'float16', // TODO: uncomment once supported\n\n\t'float32',\n\t'float64',\n\n\t// 'complex32', // TODO: uncomment once supported\n\n\t'complex64',\n\t'complex128',\n\n\t'bool'\n];\n\n\n// EXPORTS //\n\nexport default DTYPES;\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\nvar CASTING_MODES = [\n\t'none',\n\t'safe',\n\t'mostly-safe',\n\t'same-kind',\n\t'unsafe'\n];\n\n\n// EXPORTS //\n\nexport default CASTING_MODES;\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 contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function for testing whether a provided value is a valid enumerated field.\n*\n* @private\n* @param {Collection} values - list of possible values\n* @returns {Function} output function\n*/\nfunction isValidOneOf( values ) {\n\treturn isValid;\n\n\t/**\n\t* Tests whether a provided value is a valid enumerated field.\n\t*\n\t* @private\n\t* @param {*} value - input value\n\t* @param {string} name - field name\n\t* @returns {(null|TypeError)} error object or null\n\t*/\n\tfunction isValid( value, name ) {\n\t\tif ( contains( values, value ) ) {\n\t\t\treturn null;\n\t\t}\n\t\treturn new TypeError( format( 'invalid argument. `%s` field must be one of the following: \"%s\". Value: `%s`.', name, join( values, ', ' ), value ) );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default isValidOneOf;\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\nvar ALIGNMENTS = {\n\t'int8': 1,\n\t'int16': 2,\n\t'int32': 4,\n\t'int64': 8,\n\n\t'uint8': 1,\n\t'uint16': 2,\n\t'uint32': 4,\n\t'uint64': 8,\n\n\t'float16': 2,\n\t'float32': 4,\n\t'float64': 8,\n\n\t'complex32': 2, // same as float16\n\t'complex64': 4, // same as float32\n\t'complex128': 8, // same as float64\n\n\t'bool': 1\n};\n\n\n// EXPORTS //\n\nexport default ALIGNMENTS;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport hasProp from '@stdlib/assert-has-property';\nimport join from '@stdlib/array-base-join';\nimport constantFunction from '@stdlib/utils-constant-function';\nimport format from '@stdlib/string-format';\nimport hasProperties from './has_properties.js';\nimport isValidNonEmptyString from './is_valid_nonempty_string.js';\nimport isValidString from './is_valid_string.js';\nimport isValidPositiveInteger from './is_valid_positive_integer.js';\nimport isValidBoolean from './is_valid_boolean.js';\nimport isValidType from './is_valid_type.js';\nimport isValidOneOf from './is_valid_one_of.js';\nimport initFieldObject from './init_field_object.js';\nimport byteLength from './byte_length.js';\nimport CASTING_MODES from './casting_modes.js';\nimport ALIGNMENTS from './alignments.js';\n\n\n// VARIABLES //\n\nvar MANDATORY_FIELD_NAMES = [\n\t'name',\n\t'type'\n];\n\nvar VALIDATORS = {\n\t'name': isValidNonEmptyString,\n\t'type': isValidType,\n\t'description': isValidString,\n\t'length': isValidPositiveInteger,\n\t'enumerable': isValidBoolean,\n\t'writable': isValidBoolean,\n\t'default': constantFunction( null ),\n\t'castingMode': isValidOneOf( CASTING_MODES )\n};\n\n\n// MAIN //\n\n/**\n* Normalizes a provided field object.\n*\n* @private\n* @param {Object} obj - input field object\n* @param {Array} keys - list of keys to standardize\n* @returns {(Object|Error)} output object or an error\n*/\nfunction normalize( obj, keys ) {\n\tvar out;\n\tvar err;\n\tvar v;\n\tvar k;\n\tvar i;\n\n\tout = initFieldObject();\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tk = keys[ i ];\n\t\tif ( hasProp( obj, k ) ) {\n\t\t\tv = obj[ k ];\n\t\t\terr = VALIDATORS[ k ]( v, k );\n\t\t\tif ( err ) {\n\t\t\t\treturn err;\n\t\t\t}\n\t\t\tout[ k ] = v;\n\t\t}\n\t}\n\tif ( !hasProperties( out, MANDATORY_FIELD_NAMES ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Field objects must have the following properties: \"%s\". Value: `%s`.', join( MANDATORY_FIELD_NAMES, ', ' ), JSON.stringify( obj ) ) );\n\t}\n\tout.isStructType = isStructConstructorLike( out.type );\n\tout.byteLength = byteLength( out );\n\tif ( out.isStructType ) {\n\t\tout.alignment = out.type.alignment;\n\t} else {\n\t\tout.alignment = ALIGNMENTS[ out.type ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default normalize;\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 { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid string field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidNonEmptyString( value, name ) {\n\tif ( isString( value ) || value.length > 0 ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a non-empty string. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidNonEmptyString;\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 isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\nimport DTYPES from './dtypes.js';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid `type` field.\n*\n* @private\n* @param {*} value - input value\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidType( value ) {\n\tif ( contains( DTYPES, value ) || isStructConstructorLike( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be either a struct type or one of the following: \"%s\". Value: `%s`.', 'type', join( DTYPES, ', ' ), value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidType;\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 { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid string field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidString( value, name ) {\n\tif ( isString( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a string. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidString;\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 { isPrimitive as isPositiveInteger } from '@stdlib/assert-is-positive-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests whether a provided value is a valid positive integer field.\n*\n* @private\n* @param {*} value - input value\n* @param {string} name - field name\n* @returns {(null|TypeError)} error object or null\n*/\nfunction isValidPositiveInteger( value, name ) {\n\tif ( isPositiveInteger( value ) ) {\n\t\treturn null;\n\t}\n\treturn new TypeError( format( 'invalid argument. `%s` field must be a positive integer. Value: `%s`.', name, value ) );\n}\n\n\n// EXPORTS //\n\nexport default isValidPositiveInteger;\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* Returns an initialized field object.\n*\n* @private\n* @returns {Object} initialized field object\n*/\nfunction initFieldObject() {\n\treturn {\n\t\t'isStructType': false,\n\t\t'description': '',\n\t\t'byteLength': 0,\n\t\t'byteOffset': 0,\n\t\t'alignment': 0,\n\t\t'padding': 0,\n\t\t'enumerable': true,\n\t\t'writable': true,\n\t\t'default': void 0, // explicitly set to `undefined`\n\t\t'castingMode': 'none'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default initFieldObject;\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 hasProp from '@stdlib/assert-has-property';\n\n\n// MAIN //\n\n/**\n* Tests whether an object has a list of properties.\n*\n* @private\n* @param {Object} obj - input object\n* @param {Array} keys - list of property names\n* @returns {boolean} result\n*/\nfunction hasProperties( obj, keys ) {\n\tvar i;\n\tfor ( i = 0; i < keys.length; i++ ) {\n\t\tif ( !hasProp( obj, keys[ i ] ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// EXPORTS //\n\nexport default hasProperties;\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 bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\n\n\n// MAIN //\n\n/**\n* Returns the number of bytes required to store a field value.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {PositiveInteger} number of bytes\n*/\nfunction byteLength( obj ) {\n\tvar nb;\n\tif ( obj.isStructType ) {\n\t\tnb = obj.type.byteLength;\n\t} else {\n\t\tnb = bytesPerElement( obj.type );\n\t}\n\tif ( obj.length ) {\n\t\tnb *= obj.length;\n\t}\n\treturn nb;\n}\n\n\n// EXPORTS //\n\nexport default byteLength;\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* Resolves the struct's byte alignment.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @returns {PositiveInteger} alignment\n*/\nfunction alignment( fields ) {\n\tvar max;\n\tvar v;\n\tvar i;\n\n\tmax = 0;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\tv = fields[ i ].alignment;\n\t\tif ( v > max ) {\n\t\t\tmax = v;\n\t\t}\n\t}\n\treturn max;\n}\n\n\n// EXPORTS //\n\nexport default alignment;\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 isObject from '@stdlib/assert-is-object';\nimport hasProp from '@stdlib/assert-has-property';\nimport format from '@stdlib/string-format';\nimport isUnionType from './is_union_type.js';\nimport FIELD_PROPERTIES from './field_properties.js';\nimport normalizeField from './normalize_field.js';\nimport resolveAlignment from './resolve_alignment.js';\n\n\n// MAIN //\n\n/**\n* Normalizes a field object representing a union type.\n*\n* @private\n* @param {Object} obj - input field object\n* @returns {(Object|null|Error)} normalized field object or error object\n*/\nfunction normalizeUnion( obj ) {\n\tvar fields;\n\tvar dflg;\n\tvar out;\n\tvar tmp;\n\tvar len;\n\tvar o;\n\tvar i;\n\n\tfields = obj.fields;\n\tif ( fields.length === 0 ) {\n\t\treturn null;\n\t}\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( !isObject( o ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tif ( isUnionType( o ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. Union types cannot contain nested union types. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\tif ( dflg === void 0 && hasProp( o, 'default' ) ) {\n\t\t\tdflg = true;\n\t\t} else if ( dflg === true && hasProp( o, 'default' ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. Union types can only contain one field with a default value. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\ttmp = normalizeField( o, FIELD_PROPERTIES );\n\t\tif ( tmp instanceof Error ) {\n\t\t\treturn tmp;\n\t\t}\n\t\tif ( i === 0 ) {\n\t\t\tlen = tmp.byteLength;\n\t\t} else if ( tmp.byteLength !== len ) {\n\t\t\treturn new RangeError( format( 'invalid argument. Union types must contain fields having the same byte length. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn {\n\t\t'type': 'union',\n\t\t'fields': out,\n\t\t'byteLength': len,\n\t\t'byteOffset': 0,\n\t\t'alignment': resolveAlignment( out ),\n\t\t'padding': 0\n\t};\n}\n\n\n// EXPORTS //\n\nexport default normalizeUnion;\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/assert-is-accessor-array';\nimport resolveGetter from '@stdlib/array-base-resolve-getter';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'indexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 0 );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex ) {\n\tvar i;\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n*\n* var x = toAccessorArray( [ 1, 2, 3, 4 ] );\n*\n* var idx = accessors( x, 2, 0 );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex ) {\n\tvar get;\n\tvar i;\n\n\tget = resolveGetter( x );\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === get( x, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* ## Notes\n*\n* - If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = indexOf( x, 2, 0 );\n* // returns 1\n*/\nfunction indexOf( x, searchElement, fromIndex ) {\n\tif ( hasMethod( x, 'indexOf' ) ) {\n\t\treturn x.indexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex = 0;\n\t\t}\n\t}\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessors( x, searchElement, fromIndex );\n\t}\n\treturn internal( x, searchElement, fromIndex );\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\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 isCollection from '@stdlib/assert-is-collection';\nimport isFunction from '@stdlib/assert-is-function';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object supporting the accessor (get/set) protocol.\n*\n* @param {*} 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*\n* @example\n* var bool = isAccessorArray( {} );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn (\n\t\tisCollection( value ) &&\n\t\tisFunction( value.get ) &&\n\t\tisFunction( value.set )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\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 indexOf from '@stdlib/array-base-index-of';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the index of a specified field name in a provided list of field names.\n*\n* @private\n* @param {Array} names - list of field names\n* @param {string} name - field name\n* @throws {Error} struct must have at least one field\n* @throws {TypeError} must provide a recognized field name\n* @returns {(integer|Error)} index or an error object\n*/\nfunction fieldIndex( names, name ) {\n\tvar idx;\n\tif ( names.length === 0 ) {\n\t\treturn new Error( 'invalid operation. struct does not have any fields.' );\n\t}\n\tidx = indexOf( names, name, 0 );\n\tif ( idx < 0 ) {\n\t\treturn new TypeError( format( 'invalid argument. Field name must be one of the following: \"%s\". Value: `%s`.', join( names, ', ' ), name ) );\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default fieldIndex;\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 min from '@stdlib/math-base-special-fast-min';\nimport isUnionType from './is_union_type.js';\n\n\n// FUNCTIONS //\n\n/**\n* Sets alignment padding for one or more field objects.\n*\n* ## Notes\n*\n* - This function mutates each field object.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @param {NonNegativeInteger} padding - alignment padding\n* @returns {Array} input array\n*/\nfunction setPadding( fields, padding ) {\n\tvar i;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\tfields[ i ].padding = padding;\n\t}\n\treturn fields;\n}\n\n\n// MAIN //\n\n/**\n* Computes the byte offset for each field.\n*\n* ## Notes\n*\n* - This function mutates each field object.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @param {PositiveInteger} max - maximum alignment\n* @returns {Array} input array\n*/\nfunction byteOffsets( fields, max ) {\n\tvar alignment;\n\tvar padding;\n\tvar offset;\n\tvar tmp;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\toffset = 0;\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Resolve the alignment requirement for this field:\n\t\talignment = min( o.alignment, max );\n\n\t\t// Align the current offset to the required boundary:\n\t\tpadding = ( alignment-(offset%alignment) ) % alignment;\n\t\toffset += padding;\n\n\t\t// Set the padding for the previous member:\n\t\tif ( i > 0 ) {\n\t\t\ttmp = fields[ i-1 ];\n\t\t\ttmp.padding = padding;\n\t\t\tif ( isUnionType( o ) ) {\n\t\t\t\tsetPadding( tmp.fields, padding );\n\t\t\t}\n\t\t}\n\t\t// Set the offset for the current member:\n\t\to.byteOffset = offset;\n\n\t\t// If the current member is a union type, propagate the offset to its child field objects...\n\t\tif ( isUnionType( o ) ) {\n\t\t\tfor ( j = 0; j < o.fields.length; j++ ) {\n\t\t\t\to.fields[ j ].byteOffset = offset;\n\t\t\t}\n\t\t}\n\t\t// Advance the offset by the size, in bytes, of the member:\n\t\toffset += o.byteLength;\n\t}\n\t// Compute the padding for the last member:\n\tpadding = ( alignment - (offset%alignment) ) % alignment;\n\n\t// Set the padding for the last member:\n\to.padding = padding;\n\n\t// If the last member is a union type, propagate the offset to its child field objects...\n\tif ( isUnionType( o ) ) {\n\t\tsetPadding( o.fields, padding );\n\t}\n\n\treturn fields;\n}\n\n\n// EXPORTS //\n\nexport default byteOffsets;\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 replace from '@stdlib/string-base-replace';\nimport format from '@stdlib/string-format';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a new regular expression for matching byte parameters.\n*\n* @private\n* @returns {RegExp} regular expression\n*/\nfunction reByteOffset() {\n\treturn /\\[(\\d{1,}),/g;\n}\n\n/**\n* Returns a function for replacing byte values in a serialized struct.\n*\n* @private\n* @param {NonNegativeInteger} offset - byte offset\n* @returns {Function} replacer function\n*/\nfunction replacer( offset ) {\n\treturn wrapped;\n\n\t/**\n\t* Callback invoked for each match.\n\t*\n\t* @private\n\t* @param {string} match - matched substring\n\t* @param {string} p1 - first matched capture group substring\n\t* @returns {string} replacement string\n\t*/\n\tfunction wrapped( match, p1 ) {\n\t\treturn format( '[%u,', offset+parseInt( p1, 10 ) );\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a layout format.\n*\n* ## Notes\n*\n* - The output format is a multi-column format having the following layout:\n*\n* ```text\n* | ...[byte_offset,byte_length] |\n* ```\n*\n* For example,\n*\n* ```text\n* |[0,8]|[8,1]|[16,16]|[32,8]|\n* ```\n*\n* @private\n* @param {Array} fields - list of normalized fields\n* @returns {string} string representation\n*/\nfunction layoutFormat( fields ) {\n\tvar out;\n\tvar tmp;\n\tvar re;\n\tvar N;\n\tvar o;\n\tvar i;\n\n\tN = fields.length;\n\n\t// Create a new regular expression for matching byte offsets:\n\tre = reByteOffset();\n\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// If we are currently processing fields in a union, move along to the next non-union field...\n\t\tif ( i > 0 && ( o.byteOffset === fields[ i-1 ].byteOffset ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\t// If the current type is a struct, we need to serialize and then post-process...\n\t\tif ( o.isStructType ) {\n\t\t\tout.push( replace( o.type.layout, re, replacer( o.byteOffset ) ) );\n\t\t\tcontinue;\n\t\t}\n\t\t// Format the field data:\n\t\tout.push( format( '|<%s>[%u,%u]', o.type, o.byteOffset, o.byteLength ) );\n\t}\n\ttmp = format( '%s|', out.join( '' ) );\n\n\t// If we having a trailing `||` due to a nested struct, remove the final `|`:\n\tif ( tmp[ tmp.length-2 ] === '|' ) {\n\t\ttmp = tmp.substring( 0, tmp.length-1 );\n\t}\n\treturn tmp;\n}\n\n\n// EXPORTS //\n\nexport default layoutFormat;\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 isPlainObject from '@stdlib/assert-is-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\nimport linearFormat from './format_linear.js';\nimport layoutFormat from './format_layout.js';\n\n\n// VARIABLES //\n\nvar FORMATS = [\n\t'none',\n\t'linear',\n\t'layout'\n];\nvar isFormat = contains( FORMATS );\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a string.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {Array} fields - list of normalized fields\n* @param {Options} options - function options\n* @param {string} [options.format] - serialization format\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {string} string representation\n*/\nfunction toString( Struct, fields, options ) { // eslint-disable-line stdlib/no-redeclare\n\tvar opts;\n\tif ( !isPlainObject( options ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\topts = {\n\t\t'format': 'none'\n\t};\n\tif ( hasOwnProp( options, 'format' ) ) {\n\t\topts.format = options.format;\n\t\tif ( !isFormat( opts.format ) ) {\n\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'format', join( FORMATS, ', ' ), options.format ) );\n\t\t}\n\t}\n\tif ( opts.format === 'linear' ) {\n\t\treturn linearFormat( Struct, fields );\n\t}\n\tif ( opts.format === 'layout' ) {\n\t\treturn layoutFormat( fields );\n\t}\n\t// Case: opts.format === 'none'\n\treturn '';\n}\n\n\n// EXPORTS //\n\nexport default toString;\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 floor from '@stdlib/math-base-special-floor';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Serializes a struct to a linear string format.\n*\n* ## Notes\n*\n* - The output format is a three-column format having the following layout:\n*\n* ```text\n* | byte_number | [field|padding] | notes |\n* ```\n*\n* - Nested `struct` instances are intentionally treated as opaque types, as we have limited access to struct internals (e.g., packed versus unpacked, field padding, etc), and we would effectively have to recompute all alignments and associated field data for the purposes of rendering. A user can always separately render a nested `struct` instance to a string in order to better understand its layout independently of its surrounding context in a parent `struct` instance.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {Array} fields - list of normalized fields\n* @returns {string} string representation\n*/\nfunction linearFormat( Struct, fields ) {\n\tvar nbytes;\n\tvar fmt0;\n\tvar fmt1;\n\tvar fmt2;\n\tvar bfmt;\n\tvar ufmt;\n\tvar fmt;\n\tvar tmp;\n\tvar out;\n\tvar flg;\n\tvar ib;\n\tvar c0;\n\tvar c1;\n\tvar c2;\n\tvar w0;\n\tvar w1;\n\tvar w;\n\tvar N;\n\tvar o;\n\tvar f;\n\tvar t;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tN = fields.length;\n\n\t// Resolve the size of the struct:\n\tnbytes = Struct.byteLength;\n\n\t// Compute the width of the first column:\n\tw0 = ( nbytes-1 ).toString().length;\n\n\t// Define a format string for the first column:\n\tfmt0 = '%'+w0+'s';\n\n\t// Determine the longest field name...\n\tw1 = 0;\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Format: []\n\t\tw = o.name.length + 1 + ( o.byteLength-1 ).toString().length + 1;\n\t\tif ( w > w1 ) {\n\t\t\tw1 = w;\n\t\t}\n\t}\n\t// Define a format string for the second column:\n\tfmt1 = '%'+w1+'s';\n\n\t// Define a format string for the third column:\n\tfmt2 = '// %s';\n\n\t// Define a format string which combines the columns:\n\tfmt = '%s: %s %s';\n\n\t// Initialize a byte counter:\n\tib = 0;\n\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// If we are currently processing fields in a union, move along to the next non-union field...\n\t\tif ( i > 0 && ( o.byteOffset === fields[ i-1 ].byteOffset ) ) {\n\t\t\tcontinue;\n\t\t}\n\t\t// Check whether this field is the first field of a union...\n\t\tif ( i < N-1 ) {\n\t\t\tflg = ( o.byteOffset === fields[ i+1 ].byteOffset );\n\t\t} else {\n\t\t\tflg = false;\n\t\t}\n\t\tfor ( j = 0; j < o.byteLength; j++ ) {\n\t\t\t// In the first column, render the byte number:\n\t\t\tc0 = format( fmt0, ib.toString() );\n\n\t\t\t// In the second column, render the field name and the byte number relative to the field:\n\t\t\tc1 = format( fmt1, format( '%s[%u]', o.name, j ) );\n\n\t\t\t// If a field type spans multiple bytes, render the byte number:\n\t\t\tif ( o.alignment > 1 ) {\n\t\t\t\tbfmt = ' (byte %u)';\n\t\t\t} else {\n\t\t\t\tbfmt = '';\n\t\t\t}\n\t\t\t// If a field is part of a union, make that explicit:\n\t\t\tif ( flg ) {\n\t\t\t\tufmt = ' => union: %s';\n\t\t\t\ttmp = [];\n\t\t\t\tk = i + 1;\n\t\t\t\twhile ( k < N && o.byteOffset === fields[ k ].byteOffset ) {\n\t\t\t\t\tf = fields[ k ];\n\t\t\t\t\tif ( f.isStructType ) {\n\t\t\t\t\t\tt = '';\n\t\t\t\t\t} else {\n\t\t\t\t\t\tt = f.type;\n\t\t\t\t\t}\n\t\t\t\t\ttmp.push( format( '%s<%s>[%u]', f.name, t, j%f.alignment ) );\n\t\t\t\t\tk += 1;\n\t\t\t\t}\n\t\t\t\tufmt = format( ufmt, tmp.join( ', ' ) );\n\t\t\t} else {\n\t\t\t\tufmt = '';\n\t\t\t}\n\t\t\ttmp = format( bfmt+ufmt, j%o.alignment );\n\n\t\t\t// If a field contains multiple elements (i.e., is an array), render the field type along with the element number:\n\t\t\tif ( o.length ) {\n\t\t\t\tc2 = format( fmt2, format( '%s[%u]%s', o.type, floor( j/o.alignment ), tmp ) );\n\t\t\t}\n\t\t\t// Otherwise, just render the field type:\n\t\t\telse {\n\t\t\t\tc2 = format( fmt2, format( '%s%s', o.type, tmp ) );\n\t\t\t}\n\t\t\t// Render the row string:\n\t\t\tout.push( format( fmt, c0, c1, c2 ) );\n\t\t\tib += 1;\n\t\t}\n\t\tfor ( j = 0; j < o.padding; j++ ) {\n\t\t\tc0 = format( fmt0, ib.toString() );\n\t\t\tc1 = format( fmt1, '--' );\n\t\t\tc2 = format( fmt2, 'padding' );\n\t\t\tout.push( format( fmt, c0, c1, c2 ) );\n\t\t\tib += 1;\n\t\t}\n\t}\n\treturn out.join( '\\n' );\n}\n\n\n// EXPORTS //\n\nexport default linearFormat;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Dummy function.\n*\n* @private\n*/\nfunction foo() {\n\t// No-op...\n}\n\n\n// EXPORTS //\n\nexport default foo;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasFunctionNameSupport from '@stdlib/assert-has-function-name-support';\nimport format from '@stdlib/string-format';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\n\n\n// VARIABLES //\n\nvar isFunctionNameSupported = hasFunctionNameSupport();\n\n\n// MAIN //\n\n/**\n* Returns the name of a function.\n*\n* @param {Function} fcn - input function\n* @throws {TypeError} must provide a function\n* @returns {string} function name\n*\n* @example\n* var v = functionName( Math.sqrt );\n* // returns 'sqrt'\n*\n* @example\n* var v = functionName( function foo(){} );\n* // returns 'foo'\n*\n* @example\n* var v = functionName( function(){} );\n* // returns '' || 'anonymous'\n*\n* @example\n* var v = functionName( String );\n* // returns 'String'\n*/\nfunction functionName( fcn ) {\n\t// TODO: add support for generator functions?\n\tif ( isFunction( fcn ) === false ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', fcn ) );\n\t}\n\tif ( isFunctionNameSupported ) {\n\t\treturn fcn.name;\n\t}\n\treturn RE.exec( fcn.toString() )[ 1 ];\n}\n\n\n// EXPORTS //\n\nexport default functionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport foo from './foo.js';\n\n\n// MAIN //\n\n/**\n* Tests for native function `name` support.\n*\n* @returns {boolean} boolean indicating if an environment has function `name` support\n*\n* @example\n* var bool = hasFunctionNameSupport();\n* // returns \n*/\nfunction hasFunctionNameSupport() {\n\treturn ( foo.name === 'foo' );\n}\n\n\n// EXPORTS //\n\nexport default hasFunctionNameSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Int8Array from '@stdlib/array-int8';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Float32Array from '@stdlib/array-float32';\nimport Float64Array from '@stdlib/array-float64';\n\n\n// MAIN //\n\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport fcnName from '@stdlib/utils-function-name';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasFloat64ArraySupport from '@stdlib/assert-has-float64array-support';\nimport Float64Array from '@stdlib/array-float64';\nimport CTORS from './ctors.js';\nimport NAMES from './names.json';\n\n\n// VARIABLES //\n\n// Abstract `TypedArray` class:\nvar TypedArray = ( hasFloat64ArraySupport() ) ? getPrototypeOf( Float64Array ) : Dummy; // eslint-disable-line max-len\n\n// Ensure abstract typed array class has expected name:\nTypedArray = ( fcnName( TypedArray ) === 'TypedArray' ) ? TypedArray : Dummy;\n\n\n// FUNCTIONS //\n\n/**\n* Dummy constructor.\n*\n* @private\n*/\nfunction Dummy() {} // eslint-disable-line no-empty-function\n\n\n// MAIN //\n\n/**\n* Tests if a value is a typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a typed array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isTypedArray( new Int8Array( 10 ) );\n* // returns true\n*/\nfunction isTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for the abstract class...\n\tif ( value instanceof TypedArray ) {\n\t\treturn true;\n\t}\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isTypedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\n\n\n// MAIN //\n\nvar CTORS = [\n\tComplex128Array,\n\tComplex64Array\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.hasInstance` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.hasInstance` support\n*\n* @example\n* var bool = hasHasInstanceSymbolSupport();\n* // returns \n*/\nfunction hasHasInstanceSymbolSupport() { // eslint-disable-line id-length\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol' &&\n\t\thasOwnProp( Symbol, 'hasInstance' ) &&\n\t\ttypeof Symbol.hasInstance === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasHasInstanceSymbolSupport;\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 hasHasInstanceSymbolSupport from '@stdlib/assert-has-has-instance-symbol-support'; // eslint-disable-line id-length\n\n\n// MAIN //\n\n/**\n* Has instance symbol.\n*\n* @name HasInstanceSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* import isArray from '@stdlib/assert-is-array';\n*\n* function ArrayLike() {\n* return {\n* 'length': 3,\n* '0': 1,\n* '1': 2,\n* '2': 3\n* };\n* };\n*\n* ArrayLike[ HasInstanceSymbol ] = isArray;\n*/\nvar HasInstanceSymbol = ( hasHasInstanceSymbolSupport() ) ? Symbol.hasInstance : null; // eslint-disable-line max-len\n\n\n// EXPORTS //\n\nexport default HasInstanceSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasHasInstanceSymbolSupport from '@stdlib/assert-has-has-instance-symbol-support'; // eslint-disable-line id-length\nimport HasInstanceSymbol from '@stdlib/symbol-has-instance';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar hasSupport = hasHasInstanceSymbolSupport();\n\n\n// MAIN //\n\n/**\n* Tests whether a value has in its prototype chain a specified constructor as a prototype property.\n*\n* @param {*} value - value to test\n* @param {Function} constructor - constructor to test against\n* @throws {TypeError} constructor must be callable\n* @returns {boolean} boolean indicating whether a value is an instance of a provided constructor\n*\n* @example\n* var bool = instanceOf( [], Array );\n* // returns true\n*\n* @example\n* var bool = instanceOf( {}, Object ); // exception\n* // returns true\n*\n* @example\n* var bool = instanceOf( 'beep', String );\n* // returns false\n*\n* @example\n* var bool = instanceOf( null, Object );\n* // returns false\n*\n* @example\n* var bool = instanceOf( 5, Object );\n* // returns false\n*/\nfunction instanceOf( value, constructor ) {\n\t// TODO: replace with `isCallable` check\n\tif (\n\t\ttypeof constructor !== 'function' &&\n\t\t!(\n\t\t\thasSupport &&\n\t\t\ttypeof constructor === 'object' &&\n\t\t\ttypeof constructor[ HasInstanceSymbol ] === 'function'\n\t\t)\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be callable. Value: `%s`.', constructor ) );\n\t}\n\treturn ( value instanceof constructor );\n}\n\n\n// EXPORTS //\n\nexport default instanceOf;\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 Int8Array from '@stdlib/array-int8';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Int16Array from '@stdlib/array-int16';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Int32Array from '@stdlib/array-int32';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Float32Array from '@stdlib/array-float32';\nimport Float64Array from '@stdlib/array-float64';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// MAIN //\n\nvar CTORS = [\n\t[ Float64Array, 'Float64Array' ],\n\t[ Float32Array, 'Float32Array' ],\n\t[ Int32Array, 'Int32Array' ],\n\t[ Uint32Array, 'Uint32Array' ],\n\t[ Int16Array, 'Int16Array' ],\n\t[ Uint16Array, 'Uint16Array' ],\n\t[ Int8Array, 'Int8Array' ],\n\t[ Uint8Array, 'Uint8Array' ],\n\t[ Uint8ClampedArray, 'Uint8ClampedArray' ],\n\t[ Complex64Array, 'Complex64Array' ],\n\t[ Complex128Array, 'Complex128Array' ],\n\t[ BooleanArray, 'BooleanArray' ]\n];\n\n\n// EXPORTS //\n\nexport default CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport instanceOf from '@stdlib/assert-instance-of';\nimport ctorName from '@stdlib/utils-constructor-name';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport CTORS from './ctors.js';\n\n\n// MAIN //\n\n/**\n* Returns the typed array type.\n*\n* @private\n* @param {TypedArray} arr - typed array\n* @returns {(string|void)} typed array type\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 5 );\n* var str = typeName( arr );\n* // returns 'Float64Array'\n*/\nfunction typeName( arr ) {\n\tvar v;\n\tvar i;\n\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( instanceOf( arr, CTORS[ i ][ 0 ] ) ) {\n\t\t\treturn CTORS[ i ][ 1 ];\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired native class...\n\twhile ( arr ) {\n\t\tv = ctorName( arr );\n\t\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\t\tif ( v === CTORS[ i ][ 1 ] ) {\n\t\t\t\treturn CTORS[ i ][ 1 ];\n\t\t\t}\n\t\t}\n\t\tarr = getPrototypeOf( arr );\n\t}\n}\n\n\n// EXPORTS //\n\nexport default typeName;\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 isTypedArray from '@stdlib/assert-is-typed-array';\nimport isComplexTypedArray from '@stdlib/assert-is-complex-typed-array';\nimport isBooleanArray from '@stdlib/assert-is-booleanarray';\nimport reinterpret64 from '@stdlib/strided-base-reinterpret-complex64';\nimport reinterpret128 from '@stdlib/strided-base-reinterpret-complex128';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport format from '@stdlib/string-format';\nimport typeName from './type.js';\n\n\n// MAIN //\n\n/**\n* Returns a JSON representation of a typed array.\n*\n* ## Notes\n*\n* - We build a JSON object representing a typed array similar to how Node.js `Buffer` objects are represented. See [Buffer][1].\n*\n* [1]: https://nodejs.org/api/buffer.html#buffer_buf_tojson\n*\n* @param {TypedArray} arr - typed array to serialize\n* @throws {TypeError} first argument must be a typed array\n* @returns {Object} JSON representation\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\nfunction typedarray2json( arr ) {\n\tvar data;\n\tvar out;\n\tvar i;\n\n\tif ( isTypedArray( arr ) ) {\n\t\tdata = arr;\n\t} else if ( isComplexTypedArray( arr ) ) {\n\t\tif ( arr.BYTES_PER_ELEMENT === 8 ) {\n\t\t\tdata = reinterpret64( arr, 0 );\n\t\t} else { // arr.BYTES_PER_ELEMENT === 16\n\t\t\tdata = reinterpret128( arr, 0 );\n\t\t}\n\t} else if ( isBooleanArray( arr ) ) {\n\t\tdata = reinterpretBoolean( arr, 0 );\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a typed array. Value: `%s`.', arr ) );\n\t}\n\tout = {\n\t\t'type': typeName( arr ),\n\t\t'data': []\n\t};\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tout.data.push( data[ i ] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default typedarray2json;\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 BooleanArray from '@stdlib/array-bool';\nimport constructorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a BooleanArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a BooleanArray\n*\n* @example\n* import BooleanArray from '@stdlib/array-bool';\n*\n* var bool = isBooleanArray( new BooleanArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isBooleanArray( [] );\n* // returns false\n*/\nfunction isBooleanArray( value ) {\n\treturn (\n\t\tvalue instanceof BooleanArray ||\n\t\tconstructorName( value ) === 'BooleanArray'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBooleanArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport CTORS from './ctors.js';\nimport NAMES from './names.json';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isComplexTypedArray( new Complex128Array( 10 ) );\n* // returns true\n*/\nfunction isComplexTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for complex typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isComplexTypedArray;\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 no-restricted-syntax, id-length, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setNonEnumerableReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\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 hasProp from '@stdlib/assert-has-property';\nimport min from '@stdlib/math-base-special-fast-min';\nimport filled from '@stdlib/array-base-filled';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport format from '@stdlib/string-format';\nimport PRIVATE_BUFFER from './private_buffer.js';\nimport CTOR_NAME from './ctor_name.js';\nimport createPrototypeAccessors from './create_prototype_accessors.js';\nimport isStructInstance from './is_struct_instance.js';\nimport normalize from './normalize_field_list.js';\nimport fieldNames from './field_names.js';\nimport fieldIndex from './field_index.js';\nimport resolveAlignment from './resolve_alignment.js';\nimport byteOffsets from './byte_offsets.js';\nimport partitions from './partitions.js';\nimport flatten from './flatten_fields.js';\nimport struct2string from './to_string.js';\nimport struct2json from './to_json.js';\nimport layoutFormat from './format_layout.js';\n\n\n// MAIN //\n\n/**\n* Returns a constructor for creating a fixed-width composite data type (a.k.a., a `struct`).\n*\n* @param {ObjectArray} fields - structure fields\n* @throws {TypeError} first argument must be an array-like object containing objects\n* @throws {TypeError} field objects must have required properties\n* @throws {TypeError} field objects must have valid fields\n* @throws {TypeError} union types must be array-like objects containing objects\n* @throws {RangeError} union types must contain fields having the same byte length\n* @throws {TypeError} union types cannot contain nested union types\n* @throws {TypeError} union types can only contain one field with a default value\n* @throws {Error} unexpected error\n* @returns {Function} constructor\n*\n* @example\n* var fields = [\n* {\n* 'type': 'union',\n* 'fields': [\n* {\n* 'name': 'double',\n* 'description': 'double-precision floating-point number',\n* 'type': 'float64',\n* 'enumerable': true,\n* 'writable': true,\n* 'castingMode': 'none'\n* },\n* {\n* 'name': 'words',\n* 'description': 'high and low words',\n* 'type': 'uint32',\n* 'length': 2,\n* 'enumerable': true,\n* 'writable': true,\n* 'castingMode': 'none'\n* }\n* ]\n* }\n* ];\n* var Struct = factory( fields );\n*\n* var data = {\n* 'double': 3.14\n* };\n* var s = new Struct( data );\n* // returns \n*\n* var v = s.double;\n* // returns 3.14\n*\n* var w = s.words;\n* // e.g., [ 1374389535, 1074339512 ]\n*/\nfunction factory( fields ) {\n\tvar FIELD_NAMES;\n\tvar BYTE_LENGTH;\n\tvar PARTITIONS;\n\tvar ALIGNMENT;\n\tvar ACCESSORS;\n\tvar FIELDS;\n\tvar tmp;\n\tvar o;\n\tif ( !isCollection( fields ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', fields ) );\n\t}\n\t// Normalize the list of field objects:\n\ttmp = normalize( fields );\n\tif ( tmp instanceof Error ) {\n\t\tthrow tmp;\n\t}\n\tFIELDS = tmp;\n\n\t// Resolve the list of unique field names:\n\ttmp = fieldNames( FIELDS );\n\tif ( tmp instanceof Error ) {\n\t\tthrow tmp;\n\t}\n\tFIELD_NAMES = tmp;\n\n\t// Resolve the struct's alignment requirements:\n\tALIGNMENT = resolveAlignment( FIELDS );\n\n\t// Compute the byte offset for each field:\n\tFIELDS = byteOffsets( FIELDS, ALIGNMENT );\n\n\t// Now that we've finished processing provided field objects, flatten the list, such that union types are implied by field objects having the same byte offset:\n\tFIELDS = flatten( FIELDS );\n\n\t// Compute field \"partitions\" (i.e., non-overlapping views):\n\tPARTITIONS = partitions( FIELDS );\n\n\t// Compute the struct's byte length:\n\to = FIELDS[ FIELDS.length-1 ];\n\tBYTE_LENGTH = o.byteOffset + o.byteLength + o.padding;\n\n\t/**\n\t* Constructor for a composite data type (a.k.a., a `struct`).\n\t*\n\t* @private\n\t* @param {(Object|ArrayBuffer)} [arg] - array buffer or data object\n\t* @param {NonNegativeInteger} [byteOffset=0] - offset, in bytes, to the first byte in a provided buffer for the returned `struct` to reference\n\t* @param {NonNegativeInteger} [byteLength] - maximum number of elements in the byte array\n\t* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n\t* @throws {TypeError} second argument must be a nonnegative integer\n\t* @throws {TypeError} third argument must be a nonnegative integer\n\t* @throws {Error} union types may only be initialized by a single member\n\t* @returns {Struct} struct instance\n\t*/\n\tfunction Struct( arg, byteOffset, byteLength ) {\n\t\tvar values;\n\t\tvar nargs;\n\t\tvar cache;\n\t\tvar view;\n\t\tvar obj;\n\t\tvar o;\n\t\tvar v;\n\t\tvar i;\n\t\tvar j;\n\t\tvar k;\n\n\t\tnargs = arguments.length;\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tif ( nargs === 0 ) {\n\t\t\t\treturn new Struct();\n\t\t\t}\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\treturn new Struct( arg );\n\t\t\t}\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\treturn new Struct( arg, byteOffset );\n\t\t\t}\n\t\t\treturn new Struct( arg, byteOffset, byteLength );\n\t\t}\n\t\tif ( isArrayBuffer( arg ) ) {\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\tview = new DataView( arg, 0, BYTE_LENGTH );\n\t\t\t} else {\n\t\t\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t\t\t}\n\t\t\t\tif ( nargs === 2 ) {\n\t\t\t\t\tview = new DataView( arg, byteOffset, BYTE_LENGTH );\n\t\t\t\t} else {\n\t\t\t\t\tif ( !isNonNegativeInteger( byteLength ) ) {\n\t\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Byte length must be a nonnegative integer. Value: `%s`.', byteLength ) );\n\t\t\t\t\t}\n\t\t\t\t\tview = new DataView( arg, byteOffset, min( byteLength, BYTE_LENGTH ) ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( view.byteLength < BYTE_LENGTH ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer has insufficient capacity. Minimum capacity: `%u`.', BYTE_LENGTH ) );\n\t\t\t}\n\t\t} else {\n\t\t\tview = new DataView( new ArrayBuffer( BYTE_LENGTH ) );\n\t\t\tif ( nargs > 0 ) {\n\t\t\t\tif ( !isObject( arg ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tobj = arg;\n\t\t\t}\n\t\t}\n\t\t// Bind the byte buffer to the current instance:\n\t\tsetReadOnly( this, PRIVATE_BUFFER, view );\n\n\t\t// If we were provided a data object, set provided fields...\n\t\tif ( obj !== void 0 ) {\n\t\t\t// Initialize an array containing values to set:\n\t\t\tvalues = filled( void 0, FIELDS.length );\n\n\t\t\t// For each field, determine whether a value has been specified...\n\t\t\tcache = {};\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tk = FIELD_NAMES[ i ];\n\t\t\t\tj = PARTITIONS[ i ];\n\t\t\t\tif ( hasProp( obj, k ) ) {\n\t\t\t\t\t// Check whether a value has already been specified for this view (i.e., via another union member)...\n\t\t\t\t\tif ( cache[ j ] ) {\n\t\t\t\t\t\tthrow new Error( 'invalid argument. Union types may only be initialized by a single member.' );\n\t\t\t\t\t}\n\t\t\t\t\tvalues[ i ] = obj[ k ];\n\t\t\t\t\tcache[ j ] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Perform a second pass over the fields to fill in default initial values...\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tj = PARTITIONS[ i ];\n\t\t\t\tif ( cache[ j ] ) {\n\t\t\t\t\t// Skip fields already having initial values...\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\to = FIELDS[ i ];\n\t\t\t\tif ( o.default !== void 0 ) {\n\t\t\t\t\tvalues[ i ] = o.default;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Set all fields with initialization values...\n\t\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\t\tv = values[ i ];\n\t\t\t\tif ( v !== void 0 ) {\n\t\t\t\t\tACCESSORS[ FIELD_NAMES[ i ] ][ 1 ].call( this, v );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t* Constructor name.\n\t*\n\t* @private\n\t* @name name\n\t* @memberof Struct\n\t* @readonly\n\t* @type {string}\n\t* @default 'Struct'\n\t*/\n\tsetReadOnly( Struct, 'name', CTOR_NAME );\n\n\t/**\n\t* Alignment.\n\t*\n\t* @private\n\t* @name alignment\n\t* @memberof Struct\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( Struct, 'alignment', ALIGNMENT );\n\n\t/**\n\t* Size (in bytes) of the `struct`.\n\t*\n\t* @private\n\t* @name byteLength\n\t* @memberof Struct\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( Struct, 'byteLength', BYTE_LENGTH );\n\n\t/**\n\t* Returns a list of `struct` fields.\n\t*\n\t* @private\n\t* @name fields\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Array}\n\t*/\n\tsetNonEnumerableReadOnlyAccessor( Struct, 'fields', function get() {\n\t\treturn FIELD_NAMES.slice();\n\t});\n\n\t/**\n\t* Returns a string corresponding to the `struct` layout.\n\t*\n\t* @private\n\t* @name layout\n\t* @memberof Struct\n\t* @readonly\n\t* @type {string}\n\t*/\n\tsetNonEnumerableReadOnlyAccessor( Struct, 'layout', function get() {\n\t\t// As this is not likely to be a commonly used API, intentionally recompute the layout format in order to avoid consuming memory for what could be a long string...\n\t\treturn layoutFormat( FIELDS );\n\t});\n\n\t/**\n\t* Returns the underlying byte buffer of a `struct`.\n\t*\n\t* @private\n\t* @name bufferOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {Object} obj - struct instance\n\t* @throws {TypeError} must provide a `struct` instance\n\t* @returns {ArrayBuffer} underlying byte buffer\n\t*/\n\tsetReadOnly( Struct, 'bufferOf', function bufferOf( obj ) {\n\t\tif ( !isStructInstance( obj ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a `struct` instance. Value: `%s`.', obj ) );\n\t\t}\n\t\treturn obj[ PRIVATE_BUFFER ].buffer;\n\t});\n\n\t/**\n\t* Returns the length, in bytes, of the value specified by the provided field name.\n\t*\n\t* @private\n\t* @name byteLengthOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {NonNegativeInteger} byte length\n\t*/\n\tsetReadOnly( Struct, 'byteLengthOf', function byteLengthOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].byteLength;\n\t});\n\n\t/**\n\t* Returns the offset, in bytes, from the beginning of a `struct` to the value specified by the provided field name.\n\t*\n\t* @private\n\t* @name byteOffsetOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {NonNegativeInteger} byte offset\n\t*/\n\tsetReadOnly( Struct, 'byteOffsetOf', function byteOffsetOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].byteOffset;\n\t});\n\n\t/**\n\t* Returns the description associated with a provided field name.\n\t*\n\t* @private\n\t* @name descriptionOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {string} description\n\t*/\n\tsetReadOnly( Struct, 'descriptionOf', function descriptionOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].description;\n\t});\n\n\t/**\n\t* Returns a boolean indicating whether a provided value is a `struct` instance.\n\t*\n\t* @private\n\t* @name isStruct\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {*} value - input value\n\t* @returns {boolean} boolean indicating whether a value is a `struct` instance\n\t*/\n\tsetReadOnly( Struct, 'isStruct', function isStruct( value ) {\n\t\treturn (\n\t\t\tvalue instanceof Struct ||\n\t\t\t(\n\t\t\t\tisStructInstance( value ) &&\n\t\t\t\tisStructConstructorLike( value.constructor )\n\t\t\t)\n\t\t);\n\t});\n\n\t/**\n\t* Returns the type associated with a provided field name.\n\t*\n\t* @private\n\t* @name typeOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {string} name - field name\n\t* @throws {Error} struct must have at least one field\n\t* @throws {TypeError} must provide a recognized field name\n\t* @returns {(string|Object)} type\n\t*/\n\tsetReadOnly( Struct, 'typeOf', function typeOf( name ) {\n\t\tvar idx = fieldIndex( FIELD_NAMES, name );\n\t\tif ( idx instanceof Error ) {\n\t\t\tthrow idx;\n\t\t}\n\t\treturn FIELDS[ idx ].type;\n\t});\n\n\t/**\n\t* Returns the underlying byte buffer of a `struct` as a `DataView`.\n\t*\n\t* @private\n\t* @name viewOf\n\t* @memberof Struct\n\t* @readonly\n\t* @type {Function}\n\t* @param {Object} obj - struct instance\n\t* @throws {TypeError} must provide a `struct` instance\n\t* @returns {DataView} view of underlying byte buffer\n\t*/\n\tsetReadOnly( Struct, 'viewOf', function viewOf( obj ) {\n\t\tvar buf;\n\t\tif ( !isStructInstance( obj ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a `struct` instance. Value: `%s`.', obj ) );\n\t\t}\n\t\tbuf = obj[ PRIVATE_BUFFER ];\n\t\treturn new DataView( buf.buffer, buf.byteOffset, buf.byteLength );\n\t});\n\n\t// Create prototype accessors for getting and setting field values:\n\tACCESSORS = createPrototypeAccessors( Struct.prototype, FIELDS );\n\n\t/**\n\t* Serializes a `struct` to a string.\n\t*\n\t* @private\n\t* @name toString\n\t* @memberof Struct.prototype\n\t* @readonly\n\t* @type {Function}\n\t* @param {Options} [options] - function options\n\t* @param {string} [options.format='none'] - serialization format\n\t* @throws {Error} `this` must be a struct instance\n\t* @throws {TypeError} options argument must be an object\n\t* @throws {TypeError} must provide valid options\n\t* @returns {string} serialized `struct` instance\n\t*/\n\tsetReadOnly( Struct.prototype, 'toString', function toString() {\n\t\tvar opts;\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tthrow new Error( 'invalid invocation. `this` is not a struct instance.' );\n\t\t}\n\t\tif ( arguments.length > 0 ) {\n\t\t\topts = arguments[ 0 ];\n\t\t} else {\n\t\t\topts = {};\n\t\t}\n\t\treturn struct2string( Struct, FIELDS, opts );\n\t});\n\n\t/**\n\t* Serializes a `struct` to JSON.\n\t*\n\t* @private\n\t* @name toJSON\n\t* @memberof Struct.prototype\n\t* @readonly\n\t* @type {Function}\n\t* @throws {Error} `this` must be a struct instance\n\t* @returns {JSON} serialized `struct` instance\n\t*/\n\tsetReadOnly( Struct.prototype, 'toJSON', function toJSON() {\n\t\tif ( !( this instanceof Struct ) ) {\n\t\t\tthrow new Error( 'invalid invocation. `this` is not a struct instance.' );\n\t\t}\n\t\treturn struct2json( this, FIELDS );\n\t});\n\n\treturn Struct;\n}\n\n\n// EXPORTS //\n\nexport default factory;\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 isObject from '@stdlib/assert-is-object';\nimport format from '@stdlib/string-format';\nimport FIELD_PROPERTIES from './field_properties.js';\nimport isUnionType from './is_union_type.js';\nimport normalizeField from './normalize_field.js';\nimport normalizeUnion from './normalize_union.js';\n\n\n// MAIN //\n\n/**\n* Normalizes a list of field objects.\n*\n* @private\n* @param {Array} fields - input fields\n* @returns {(Array|Error)} normalized field objects or an error\n*/\nfunction normalize( fields ) {\n\tvar out;\n\tvar tmp;\n\tvar o;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( !isObject( o ) ) {\n\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects. Value: `%s`. Index: `%d`.', o, i ) );\n\t\t}\n\t\t// Check for a union type which is a collection of nested field objects which all have the same byte length...\n\t\tif ( isUnionType( o ) ) {\n\t\t\ttmp = normalizeUnion( o );\n\t\t\tif ( tmp === null ) {\n\t\t\t\treturn new TypeError( format( 'invalid argument. Union types must be an array of objects. Value: `%s`. Index: `%d`.', JSON.stringify( o ), i ) );\n\t\t\t}\n\t\t\tif ( tmp instanceof Error ) {\n\t\t\t\treturn tmp;\n\t\t\t}\n\t\t} else {\n\t\t\ttmp = normalizeField( o, FIELD_PROPERTIES );\n\t\t\tif ( tmp instanceof Error ) {\n\t\t\t\treturn tmp;\n\t\t\t}\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default normalize;\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 format from '@stdlib/string-format';\nimport isUnionType from './is_union_type.js';\n\n\n// MAIN //\n\n/**\n* Resolves a list of field names.\n*\n* @private\n* @param {Array} fields - list of field objects\n* @returns {(Array|Error)} list of field names or an error\n*/\nfunction fieldNames( fields ) {\n\tvar hash;\n\tvar out;\n\tvar o1;\n\tvar o2;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\thash = {};\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to1 = fields[ i ];\n\t\tk = o1.name;\n\t\tif ( isUnionType( o1 ) ) {\n\t\t\tfor ( j = 0; j < o1.fields.length; j++ ) {\n\t\t\t\to2 = o1.fields[ j ];\n\t\t\t\tk = o2.name;\n\t\t\t\tif ( hash[ k ] === true ) {\n\t\t\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects having unique field names. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t\t\t}\n\t\t\t\thash[ k ] = true;\n\t\t\t\tout.push( k );\n\t\t\t}\n\t\t} else if ( hash[ k ] === true ) {\n\t\t\treturn new TypeError( format( 'invalid argument. First argument must be an array of objects having unique field names. Value: `%s`.', JSON.stringify( fields ) ) );\n\t\t} else {\n\t\t\thash[ k ] = true;\n\t\t\tout.push( k );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default fieldNames;\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 isUnionType from './is_union_type.js';\n\n\n// MAIN //\n\n/**\n* Flattens a list of field objects.\n*\n* @private\n* @param {Array} fields - list of field objects\n* @returns {Array} new list\n*/\nfunction flatten( fields ) {\n\tvar out;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\tout = [];\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tif ( isUnionType( o ) ) {\n\t\t\tfor ( j = 0; j < o.fields.length; j++ ) {\n\t\t\t\tout.push( o.fields[ j ] );\n\t\t\t}\n\t\t} else {\n\t\t\tout.push( o );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default flatten;\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* Returns a list of partition indices.\n*\n* ## Notes\n*\n* - This function partitions field objects according to whether a field object represents a unique \"view\" over an underlying byte buffer. Field objects within a union belong to the same partition.\n*\n* @private\n* @param {Array} fields - list of normalized field objects\n* @returns {NonNegativeIntegerArray} list of indices\n*/\nfunction partitions( fields ) {\n\tvar out;\n\tvar N;\n\tvar o;\n\tvar i;\n\tvar j;\n\n\tN = fields.length;\n\n\tout = [];\n\tj = 0;\n\tfor ( i = 0; i < N-1; i++ ) {\n\t\to = fields[ i ];\n\n\t\t// Check for the start of a union...\n\t\tif ( o.byteOffset === fields[ i+1 ].byteOffset ) {\n\t\t\tout.push( j );\n\t\t\tcontinue;\n\t\t}\n\t\tout.push( j );\n\t\tj += 1;\n\t}\n\t// Set the partition for the last field object:\n\tout.push( j );\n\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default partitions;\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 id-length */\n\n'use strict';\n\n// MODULES //\n\nimport setNonEnumerableReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport setNonEnumerableReadWriteAccessor from '@stdlib/utils-define-nonenumerable-read-write-accessor';\nimport setReadOnlyAccessor from '@stdlib/utils-define-read-only-accessor';\nimport setReadWriteAccessor from '@stdlib/utils-define-read-write-accessor';\nimport getter from './getter.js';\nimport setter from './setter.js';\n\n\n// MAIN //\n\n/**\n* Assigns methods for accessing field values to a provided prototype.\n*\n* @private\n* @param {Object} p - prototype\n* @param {Array} fields - field objects\n* @returns {Object} object containing accessors for each field\n*/\nfunction createPrototypeAccessors( p, fields ) {\n\tvar get;\n\tvar set;\n\tvar out;\n\tvar o;\n\tvar i;\n\n\tout = {};\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tget = getter( o );\n\t\tset = setter( o );\n\t\tif ( o.enumerable ) {\n\t\t\tif ( o.writable ) {\n\t\t\t\tsetReadWriteAccessor( p, o.name, get, set );\n\t\t\t} else {\n\t\t\t\tsetReadOnlyAccessor( p, o.name, get );\n\t\t\t}\n\t\t} else if ( o.writable ) {\n\t\t\tsetNonEnumerableReadWriteAccessor( p, o.name, get, set );\n\t\t} else {\n\t\t\tsetNonEnumerableReadOnlyAccessor( p, o.name, get );\n\t\t}\n\t\tout[ o.name ] = [ get, set ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default createPrototypeAccessors;\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 isCollection from '@stdlib/assert-is-collection';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isFunction from '@stdlib/assert-is-function';\nimport typedarray2json from '@stdlib/array-to-json';\nimport isStructInstance from './is_struct_instance.js';\n\n\n// MAIN //\n\n/**\n* Serializes a `struct` instance to JSON.\n*\n* @private\n* @param {Struct} struct - struct instance\n* @param {Array} fields - list of normalized fields\n* @returns {Object} JSON representation\n*/\nfunction toJSON( struct, fields ) {\n\tvar out;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\tout = {};\n\tfor ( i = 0; i < fields.length; i++ ) {\n\t\to = fields[ i ];\n\t\tv = struct[ o.name ];\n\t\tif ( isCollection( v ) ) {\n\t\t\tv = typedarray2json( v );\n\t\t} else if ( isStructInstance( v ) ) {\n\t\t\tv = v.toJSON();\n\t\t} else if ( isComplexLike( v ) && isFunction( v.toJSON ) ) {\n\t\t\tv = v.toJSON();\n\t\t}\n\t\tout[ o.name ] = v;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\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 getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport Uint8Array from '@stdlib/array-uint8';\nimport { ndarray as gcopy } from '@stdlib/blas-base-gcopy';\n\n\n// MAIN //\n\n/**\n* Fills an output ArrayBuffer with array values.\n*\n* @private\n* @param {Function} Struct - struct constructor\n* @param {ArrayBuffer} buf - output data buffer\n* @param {Collection} arr - input array\n* @throws {TypeError} an input array must contain struct instances\n* @throws {TypeError} each element of an input array must be a struct instance having the expected layout\n* @returns {ArrayBuffer} output data buffer\n*/\nfunction fromArray( Struct, buf, arr ) {\n\tvar sbytes;\n\tvar bbytes;\n\tvar offset;\n\tvar layout;\n\tvar sview;\n\tvar opts;\n\tvar len;\n\tvar get;\n\tvar flg;\n\tvar nb;\n\tvar v;\n\tvar i;\n\n\topts = {\n\t\t'format': 'layout'\n\t};\n\n\tlen = arr.length;\n\tif ( arr.get && arr.set ) {\n\t\tget = accessorGetter( 'default' );\n\t} else {\n\t\tget = getter( 'default' );\n\t}\n\tlayout = Struct.layout;\n\tnb = Struct.byteLength;\n\n\t// FIXME: add optimization for when `buf` is a StructArray having the same layout, as can just copy bytes\n\n\tbbytes = new Uint8Array( buf );\n\toffset = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( arr, i );\n\t\ttry {\n\t\t\tsview = Struct.viewOf( v ); // note: this should throw if `v` is not a struct\n\t\t\tflg = true;\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\ttry {\n\t\t\t\t// Attempt to convert the input value to a struct instance:\n\t\t\t\tv = new Struct( v ); // note: this should throw if `v` is not an object with valid fields\n\t\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tsview = Struct.viewOf( v );\n\t\t\tflg = false;\n\t\t}\n\t\tif ( flg && v.toString( opts ) !== layout ) {\n\t\t\treturn null;\n\t\t}\n\t\tsbytes = new Uint8Array( sview.buffer, sview.byteOffset, sview.byteLength ); // eslint-disable-line max-len\n\t\tgcopy( nb, sbytes, 1, 0, bbytes, 1, offset );\n\t\toffset += nb;\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nexport default fromArray;\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 no-restricted-syntax, no-invalid-this, max-len, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nimport isStructConstructorLike from '@stdlib/assert-is-struct-constructor-like';\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isArrayBuffer from '@stdlib/assert-is-arraybuffer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isFunction from '@stdlib/assert-is-function';\nimport isObject from '@stdlib/assert-is-object';\nimport isPrototypeOf from '@stdlib/assert-is-prototype-of'; // eslint-disable-line stdlib/no-redeclare\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\nimport hasProp from '@stdlib/assert-has-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport ITERATOR_SYMBOL from '@stdlib/symbol-iterator';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport Uint8Array from '@stdlib/array-uint8';\nimport getter from '@stdlib/array-base-getter';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport { ndarray as gcopy } from '@stdlib/blas-base-gcopy';\nimport structFactory from '@stdlib/dstructs-struct';\nimport format from '@stdlib/string-format';\nimport fromArray from './from_array.js';\nimport fromIterator from './from_iterator.js';\n\n\n// VARIABLES //\n\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\nvar CTOR_NAME = 'StructArray';\n\n\n// MAIN //\n\n/**\n* Returns a constructor for creating arrays having a fixed-width composite data type.\n*\n* @param {(Function|Array)} arg - struct constructor or struct schema\n* @throws {TypeError} first argument must be either a struct constructor or struct schema\n* @returns {Function} constructor\n*\n* @example\n* import Complex128 from '@stdlib/complex-float64-ctor';\n* import structFactory from '@stdlib/dstructs-struct';\n*\n* var schema1 = [\n* {\n* 'name': 're',\n* 'type': 'float64'\n* },\n* {\n* 'name': 'im',\n* 'type': 'float64'\n* }\n* ];\n*\n* // Create a struct constructor for storing real and imaginary components:\n* var Components = structFactory( schema1 );\n*\n* var schema2 = [\n* {\n* 'type': 'union',\n* 'fields': [\n* {\n* 'name': 'value',\n* 'type': 'complex128'\n* },\n* {\n* 'name': 'components',\n* 'type': Components\n* }\n* ]\n* }\n* ];\n*\n* // Create a struct constructor for storing a double-precision complex number:\n* var Complex128Struct = structFactory( schema2 );\n*\n* // Create an array constructor for storing complex numbers:\n* var Complex128Array = factory( Complex128Struct );\n*\n* // Create a new array:\n* var x = new Complex128Array( 10 );\n* // returns \n*\n* // Retrieve the first element:\n* var v1 = x.get( 0 );\n*\n* // Resolve the complex number stored within the first element:\n* var z1 = v1.value;\n* // returns [ 0.0, 0.0 ]\n*\n* // Resolve the individual real and imaginary components:\n* var z2 = v1.components;\n*\n* var re = z2.re;\n* // returns 0.0\n*\n* var im = z2.im;\n* // returns 0.0\n*\n* // Create a new complex number struct:\n* var z3 = new Complex128Struct({\n* 'value': new Complex128( 3.0, 5.0 )\n* });\n*\n* // Update the first element of the array:\n* x.set( z3, 0 );\n*\n* // As `v1` is a view on same memory as the first element, resolve the complex number stored within the element:\n* var z4 = v1.value;\n* // returns [ 3.0, 5.0 ]\n*/\nfunction factory( arg ) { // eslint-disable-line stdlib/jsdoc-require-throws-tags\n\tvar BYTES_PER_ELEMENT;\n\tvar LAYOUT;\n\tvar FIELDS;\n\tvar Struct;\n\n\t// FIXME: add option support for strict input object validation (e.g., throw whenever non-struct properties are included on an object passed to `set`)\n\n\tif ( isCollection( arg ) ) {\n\t\tStruct = structFactory( arg ); // NOTE: delegate to `structFactory` to perform input validation\n\t} else if ( isStructConstructorLike( arg ) ) {\n\t\tStruct = arg;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a struct constructor or struct schema. Value: `%s`.', arg ) );\n\t}\n\tBYTES_PER_ELEMENT = Struct.byteLength;\n\tLAYOUT = Struct.layout; // TODO: consider whether to lazily materialize the struct layout, as this could potentially be a long string (hence increased memory consumption) depending on the complexity of the struct\n\tFIELDS = Struct.fields;\n\n\t/**\n\t* Constructor which returns an array having a fixed-width composite data type.\n\t*\n\t* @private\n\t* @constructor\n\t* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n\t* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n\t* @param {NonNegativeInteger} [length] - view length\n\t* @throws {TypeError} must provide a valid first argument\n\t* @throws {TypeError} second argument must be a nonnegative integer\n\t* @throws {TypeError} third argument must be a nonnegative integer\n\t* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n\t* @throws {RangeError} second argument must be a multiple of struct byte length\n\t* @throws {RangeError} second argument must not exceeds the ArrayBuffer bounds\n\t* @throws {TypeError} view length must be a positive multiple of struct byte length\n\t* @throws {TypeError} an input array must contain valid elements\n\t* @returns {StructArray} struct array instance\n\t*/\n\tfunction StructArray( arg, byteOffset, length ) {\n\t\tvar nargs;\n\t\tvar buf;\n\t\tvar len;\n\t\tvar tmp;\n\n\t\tnargs = arguments.length;\n\t\tif ( !( this instanceof StructArray) ) {\n\t\t\tif ( nargs === 0 ) {\n\t\t\t\treturn new StructArray();\n\t\t\t}\n\t\t\tif ( nargs === 1 ) {\n\t\t\t\treturn new StructArray( arg );\n\t\t\t}\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\treturn new StructArray( arg, byteOffset );\n\t\t\t}\n\t\t\treturn new StructArray( arg, byteOffset, length );\n\t\t}\n\n\t\t// Case: new StructArray()\n\t\tif ( nargs === 0 ) {\n\t\t\tbuf = new ArrayBuffer( 0 );\n\t\t\tlen = 0;\n\t\t}\n\t\t// Case: new StructArray( arg )\n\t\telse if ( nargs === 1 ) {\n\t\t\t// Case: new StructArray( length )\n\t\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\t\tbuf = new ArrayBuffer( arg*BYTES_PER_ELEMENT );\n\t\t\t\tlen = arg;\n\t\t\t}\n\t\t\t// Case: new StructArray( collection )\n\t\t\telse if ( isCollection( arg ) ) {\n\t\t\t\tlen = arg.length;\n\t\t\t\tbuf = fromArray( Struct, new ArrayBuffer( len*BYTES_PER_ELEMENT ), arg );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Each element of a provided input array must be a valid object or a struct instance having the same layout as elements in the desired output array.' ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer )\n\t\t\telse if ( isArrayBuffer( arg ) ) {\n\t\t\t\tbuf = arg;\n\t\t\t\tlen = buf.byteLength / BYTES_PER_ELEMENT;\n\t\t\t\tif ( !isInteger( len ) ) {\n\t\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\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( iterable )\n\t\t\telse if ( isObject( arg ) ) {\n\t\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. First argument must be a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tbuf = arg[ ITERATOR_SYMBOL ]();\n\t\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\ttmp = fromIterator( buf );\n\t\t\t\tlen = tmp.length;\n\t\t\t\tbuf = fromArray( Struct, new ArrayBuffer( len*BYTES_PER_ELEMENT ), tmp );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Each element of a provided input iterable must be either a valid object or a struct instance having the same layout as elements in the desired output array.' ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ???? )\n\t\t\telse {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t}\n\t\t// Case: new StructArray( ArrayBuffer, byteOffset[, length] )\n\t\telse {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t\t}\n\t\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Second argument must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t\t}\n\t\t\tif ( byteOffset >= buf.byteLength ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Second argument exceeds the bounds of the ArrayBuffer. Value: `%s`.', byteOffset ) );\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer, byteOffset )\n\t\t\tif ( nargs === 2 ) {\n\t\t\t\tlen = ( buf.byteLength - byteOffset ) / BYTES_PER_ELEMENT;\n\t\t\t\tif ( !isInteger( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength-byteOffset ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Case: new StructArray( ArrayBuffer, byteOffset, length )\n\t\t\telse {\n\t\t\t\tlen = length;\n\t\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t\t}\n\t\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\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\t}\n\t\t\t}\n\t\t}\n\t\tsetReadOnly( this, '_buffer', buf );\n\t\tsetReadOnly( this, '_byteOffset', byteOffset || 0 );\n\t\tsetReadOnly( this, '_byteLength', len*BYTES_PER_ELEMENT );\n\t\tsetReadOnly( this, '_length', len );\n\t\treturn this;\n\t}\n\n\t/**\n\t* Size (in bytes) of each array element.\n\t*\n\t* @private\n\t* @name BYTES_PER_ELEMENT\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( StructArray, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n\t/**\n\t* Constructor name.\n\t*\n\t* @private\n\t* @name name\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {string}\n\t*/\n\tsetReadOnly( StructArray, 'name', CTOR_NAME );\n\n\t/**\n\t* Element constructor.\n\t*\n\t* @private\n\t* @name struct\n\t* @memberof StructArray\n\t* @readonly\n\t* @type {Function}\n\t*/\n\tsetReadOnly( StructArray, 'struct', Struct );\n\n\t/**\n\t* Pointer to the underlying data buffer.\n\t*\n\t* @private\n\t* @name buffer\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {ArrayBuffer}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'buffer', function get() {\n\t\treturn this._buffer;\n\t});\n\n\t/**\n\t* Size (in bytes) of the array.\n\t*\n\t* @private\n\t* @name byteLength\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'byteLength', function get() {\n\t\treturn this._byteLength;\n\t});\n\n\t/**\n\t* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n\t*\n\t* @private\n\t* @name byteOffset\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'byteOffset', function get() {\n\t\treturn this._byteOffset;\n\t});\n\n\t/**\n\t* Size (in bytes) of each array element.\n\t*\n\t* @private\n\t* @name BYTES_PER_ELEMENT\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {PositiveInteger}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'BYTES_PER_ELEMENT', StructArray.BYTES_PER_ELEMENT );\n\n\t/**\n\t* Returns an array element.\n\t*\n\t* @private\n\t* @name get\n\t* @memberof StructArray.prototype\n\t* @type {Function}\n\t* @param {NonNegativeInteger} idx - element index\n\t* @throws {TypeError} `this` must be a struct array instance\n\t* @throws {TypeError} must provide a nonnegative integer\n\t* @returns {(*|void)} array element\n\t*/\n\tsetReadOnly( StructArray.prototype, 'get', function get( idx ) {\n\t\tif ( !isStructArray( this ) ) {\n\t\t\tthrow new TypeError( format( 'invalid invocation. `this` is not a %s.', CTOR_NAME ) );\n\t\t}\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tif ( idx >= this._length ) {\n\t\t\treturn;\n\t\t}\n\t\treturn new Struct( this._buffer, this._byteOffset+( idx*BYTES_PER_ELEMENT ), BYTES_PER_ELEMENT );\n\t});\n\n\t/**\n\t* Number of array elements.\n\t*\n\t* @private\n\t* @name length\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {NonNegativeInteger}\n\t*/\n\tsetReadOnlyAccessor( StructArray.prototype, 'length', function get() {\n\t\treturn this._length;\n\t});\n\n\t/**\n\t* Sets an array element.\n\t*\n\t* ## Notes\n\t*\n\t* - When provided a struct 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\t*\n\t* ```text\n\t* buf: ---------------------\n\t* src: ---------------------\n\t* ```\n\t*\n\t* 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\t*\n\t* In the other overlapping scenario,\n\t*\n\t* ```text\n\t* buf: ---------------------\n\t* src: ---------------------\n\t* ```\n\t*\n\t* 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\t*\n\t* @private\n\t* @name set\n\t* @memberof StructArray.prototype\n\t* @type {Function}\n\t* @param {(Collection|StructArray|Struct|Object)} value - value(s)\n\t* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n\t* @throws {TypeError} `this` must be a struct array instance\n\t* @throws {TypeError} index argument must be a nonnegative integer\n\t* @throws {RangeError} index argument is out-of-bounds\n\t* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n\t* @throws {TypeError} must provide a valid object or a struct instance having the same layout as elements in the target array\n\t* @returns {void}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'set', function set( value ) {\n\t\tvar bbytes;\n\t\tvar sbytes;\n\t\tvar sbuf;\n\t\tvar opts;\n\t\tvar idx;\n\t\tvar buf;\n\t\tvar tmp;\n\t\tvar get;\n\t\tvar nb;\n\t\tvar N;\n\t\tvar s;\n\t\tvar f;\n\t\tvar i;\n\t\tvar j;\n\t\tif ( !isStructArray( this ) ) {\n\t\t\tthrow new TypeError( format( 'invalid invocation. `this` is not a %s.', CTOR_NAME ) );\n\t\t}\n\t\tbuf = this._buffer;\n\t\tif ( arguments.length > 1 ) {\n\t\t\tidx = arguments[ 1 ];\n\t\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t\t}\n\t\t} else {\n\t\t\tidx = 0;\n\t\t}\n\t\topts = {\n\t\t\t'format': 'layout'\n\t\t};\n\t\tnb = Struct.byteLength;\n\n\t\tif ( isCollection( value ) && !contains( FIELDS, 'length' ) ) { // note: when one of the fields is 'length', we always assume that a provided value with a 'length' property is a struct and/or data object as there doesn't seem to be a surefire way to distinguish such an object from a regular array-like object (including accessor arrays)\n\t\t\tN = value.length;\n\t\t\tif ( idx+N > 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\t\t\tif ( sbuf.get && sbuf.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// Check for overlapping memory...\n\t\t\tj = this._byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf &&\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// FIXME: add optimization when `value` is a StructArray sharing the same buffer and having the same layout; in which case, we can simply copy `src` bytes to a temporary array and then copy those bytes into the target array, without needing to intermediate struct instance materialization\n\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = [];\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp.push( get( value, i ) );\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\tfor ( i = 0; i < N; idx++, i++ ) {\n\t\t\t\tthis.set( get( sbuf, i ), idx ); // note: this likely isn't the most performant approach, but it avoids having to replicate branching logic for handling struct instances vs data objects\n\t\t\t}\n\t\t\treturn;\n\t\t}\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\tif ( !isObject( value ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide either a valid object or a struct instance. Value: `%s`.', value ) );\n\t\t}\n\t\t// Check for a struct instance having a matching layout...\n\t\tif ( value.toString( opts ) === LAYOUT ) {\n\t\t\t// Explicitly copy the bytes of the input struct instance to the corresponding array element...\n\t\t\tsbuf = Struct.viewOf( value );\n\t\t\tsbytes = new Uint8Array( sbuf.buffer, sbuf.byteOffset, nb );\n\t\t\tbbytes = new Uint8Array( buf, this._byteOffset+( idx*BYTES_PER_ELEMENT ), nb );\n\t\t\tgcopy( nb, sbytes, 1, 0, bbytes, 1, 0 );\n\t\t\treturn;\n\t\t}\n\t\t// Create a struct instance view for the target element:\n\t\ts = new Struct( buf, this._byteOffset+( idx*BYTES_PER_ELEMENT ), nb );\n\n\t\t// Assign field values from the input object (accounting for both own and inherited properties)...\n\t\tfor ( i = 0; i < FIELDS.length; i++ ) {\n\t\t\tf = FIELDS[ i ];\n\t\t\tif ( hasProp( value, f ) ) {\n\t\t\t\ts[ f ] = value[ f ];\n\t\t\t}\n\t\t}\n\t});\n\n\t/**\n\t* Element constructor.\n\t*\n\t* @private\n\t* @name struct\n\t* @memberof StructArray.prototype\n\t* @readonly\n\t* @type {Function}\n\t*/\n\tsetReadOnly( StructArray.prototype, 'struct', Struct );\n\n\treturn StructArray;\n\n\t/**\n\t* Returns a boolean indicating if a value is a struct array.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating if a value is a struct array\n\t*/\n\tfunction isStructArray( value ) {\n\t\treturn (\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === CTOR_NAME ||\n\t\t\t\tisPrototypeOf( value, StructArray.prototype )\n\t\t\t) &&\n\t\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t\t);\n\t}\n}\n\n\n// EXPORTS //\n\nexport default factory;\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* 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( 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// MAIN //\n\nvar main = ( typeof Buffer === 'function' ) ? Buffer : 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 = require( 'buffer' ).Buffer;\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* Buffer constructor.\n*\n* @module @stdlib/buffer-ctor\n*\n* @example\n* import ctor from '@stdlib/buffer-ctor';\n*\n* var b = new ctor( [ 1, 2, 3, 4 ] );\n* // returns \n*/\n\n// MODULES //\n\nimport hasNodeBufferSupport from '@stdlib/assert-has-node-buffer-support';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasNodeBufferSupport() ) {\n\tctor = main;\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 isBuffer from '@stdlib/assert-is-buffer';\nimport GlobalBuffer from './buffer.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Buffer` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Buffer` support\n*\n* @example\n* var bool = hasNodeBufferSupport();\n* // returns \n*/\nfunction hasNodeBufferSupport() {\n\tvar bool;\n\tvar b;\n\n\tif ( typeof GlobalBuffer !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tif ( typeof GlobalBuffer.from === 'function' ) {\n\t\t\tb = GlobalBuffer.from( [ 1, 2, 3, 4 ] );\n\t\t} else {\n\t\t\tb = new GlobalBuffer( [ 1, 2, 3, 4 ] ); // Note: this is deprecated behavior starting in Node v6 (see https://nodejs.org/api/buffer.html#buffer_new_buffer_array)\n\t\t}\n\t\tbool = (\n\t\t\tisBuffer( b ) &&\n\t\t\tb[ 0 ] === 1 &&\n\t\t\tb[ 1 ] === 2 &&\n\t\t\tb[ 2 ] === 3 &&\n\t\t\tb[ 3 ] === 4\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 hasNodeBufferSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 (browser) polyfill\n\n// MAIN //\n\n/**\n* Buffer constructor.\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) 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 Buffer from '@stdlib/buffer-ctor';\nimport Float64Array from '@stdlib/array-float64';\nimport Float32Array from '@stdlib/array-float32';\nimport Int16Array from '@stdlib/array-int16';\nimport Int32Array from '@stdlib/array-int32';\nimport Int8Array from '@stdlib/array-int8';\nimport Uint16Array from '@stdlib/array-uint16';\nimport Uint32Array from '@stdlib/array-uint32';\nimport Uint8Array from '@stdlib/array-uint8';\nimport Uint8ClampedArray from '@stdlib/array-uint8c';\nimport Complex64Array from '@stdlib/array-complex64';\nimport Complex128Array from '@stdlib/array-complex128';\nimport BooleanArray from '@stdlib/array-bool';\n\n\n// FUNCTIONS //\n\n/**\n* Throws an error.\n*\n* @private\n* @throws {Error} not implemented\n*/\nfunction notImplemented() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// MAIN //\n\n// Mapping from data types to underlying buffer constructors...\nvar ctors = { // eslint-disable-line vars-on-top\n\t'binary': Buffer,\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'float16': notImplemented, // FIXME: replace with Float16Array constructor once implemented\n\t'generic': Array, // TODO: replace with `stdlib` pkg\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex32': notImplemented, // FIXME: replace with Complex32Array constructor once implemented\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array,\n\t'bool': BooleanArray\n};\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport structFactory from '@stdlib/array-struct-factory';\nimport table from './ctors.js';\n\n\n// VARIABLES //\n\n// Initialize a cache to storing memoized struct array constructors:\nvar CACHE = {}; // TODO: consider adding/using `@stdlib/array/memoized-struct-factory`; should we need to memoize struct array constructors elsewhere, we should centralize that logic, rather than have multiple caches.\n\n\n// MAIN //\n\n/**\n* Returns an ndarray data buffer constructor.\n*\n* @param {*} dtype - data type\n* @returns {(Function|null)} data buffer constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns \n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\tvar struct;\n\tvar ctor;\n\tvar key;\n\n\t// Case: string || dtype_instance_with_string\n\tif ( !isFunction( dtype ) ) {\n\t\tkey = resolveStr( dtype );\n\t\tctor = table[ key ] || null;\n\t\tif ( ctor ) {\n\t\t\treturn ctor;\n\t\t}\n\t}\n\t// Case: struct_ctor || dtype_instance_with_struct_ctor\n\tif ( isStructDataType( dtype ) ) {\n\t\tif ( key ) {\n\t\t\t// Data type instance (note: we assume that `key === struct.layout`):\n\t\t\tstruct = dtype.value;\n\t\t} else {\n\t\t\t// Struct constructor:\n\t\t\tstruct = dtype;\n\t\t\tkey = struct.layout;\n\t\t}\n\t\tctor = CACHE[ key ];\n\t\tif ( ctor ) {\n\t\t\treturn ctor;\n\t\t}\n\t\tctor = structFactory( struct );\n\t\tCACHE[ key ] = ctor;\n\t\treturn ctor;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Allocate a buffer having a specified number of bytes.\n*\n* @module @stdlib/buffer-alloc-unsafe\n*\n* @example\n* import allocUnsafe from '@stdlib/buffer-alloc-unsafe';\n*\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\n\n// MODULES //\n\nimport hasAllocUnsafe from './has_alloc_unsafe.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar allocUnsafe;\nif ( hasAllocUnsafe ) {\n\tallocUnsafe = main;\n} else {\n\tallocUnsafe = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\nvar bool = isFunction( Buffer.allocUnsafe );\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 isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport format from '@stdlib/string-format';\nimport Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\n/**\n* Allocates a buffer having a specified number of bytes.\n*\n* ## Notes\n*\n* - The underlying memory of returned `Buffer` instances is not initialized. Memory contents are unknown and may contain sensitive data.\n* - When the size is less than half the pool size (specified on the `Buffer` constructor), memory is allocated from the `Buffer` pool for faster allocation of new `Buffer` instances.\n*\n* @param {NonNegativeInteger} size - number of bytes to allocate\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {Buffer} new `Buffer` instance\n*\n* @example\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\nfunction allocUnsafe( size ) {\n\tif ( !isNonNegativeInteger( size ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', size ) );\n\t}\n\treturn Buffer.allocUnsafe( size );\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\nimport format from '@stdlib/string-format';\nimport Buffer from '@stdlib/buffer-ctor';\n\n\n// MAIN //\n\n/**\n* Allocates a buffer having a specified number of bytes.\n*\n* ## Notes\n*\n* - The underlying memory of returned `Buffer` instances is not initialized. Memory contents are unknown and may contain sensitive data.\n* - When the size is less than half the pool size (specified on the `Buffer` constructor), memory is allocated from the `Buffer` pool for faster allocation of new `Buffer` instances.\n*\n* @param {NonNegativeInteger} size - number of bytes to allocate\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {Buffer} new `Buffer` instance\n*\n* @example\n* var buf = allocUnsafe( 10 );\n* // returns \n*/\nfunction allocUnsafe( size ) {\n\tif ( !isNonNegativeInteger( size ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', size ) );\n\t}\n\treturn new Buffer( size );\n}\n\n\n// EXPORTS //\n\nexport default allocUnsafe;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport bufferCtors from '@stdlib/ndarray-base-buffer-ctors';\nimport allocUnsafe from '@stdlib/buffer-alloc-unsafe';\nimport zeros from '@stdlib/array-base-zeros';\nimport fill from '@stdlib/array-base-fill';\n\n\n// FUNCTIONS //\n\n/**\n* Returns a zero-filled binary buffer.\n*\n* @private\n* @param {NonNegativeInteger} size - buffer size\n* @returns {Buffer} zero-filled binary buffer\n*/\nfunction binary( size ) {\n\treturn fill( allocUnsafe( size ), 0, 0, size );\n}\n\n/**\n* Returns a typed array.\n*\n* @private\n* @param {*} dtype - data type\n* @param {NonNegativeInteger} size - buffer size\n* @returns {(TypedArray|null)} typed array\n*/\nfunction typedarray( dtype, size ) {\n\tvar ctor = bufferCtors( dtype );\n\tif ( ctor ) {\n\t\treturn new ctor( size );\n\t}\n\treturn null;\n}\n\n\n// MAIN //\n\n/**\n* Returns a contiguous linear ndarray data buffer.\n*\n* @param {*} dtype - data type\n* @param {NonNegativeInteger} size - buffer size\n* @returns {(Array|TypedArray|Buffer|null)} data buffer\n*\n* @example\n* var buf = buffer( 'float64', 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\nfunction buffer( dtype, size ) {\n\tvar dt = resolveStr( dtype );\n\tif ( dt === 'generic' ) {\n\t\treturn zeros( size );\n\t}\n\tif ( dt === 'binary' ) {\n\t\treturn binary( size );\n\t}\n\treturn typedarray( dtype, size );\n}\n\n\n// EXPORTS //\n\nexport default buffer;\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 arraylike2object from '@stdlib/array-base-arraylike2object';\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'fill' );\n* // e.g., returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Fills all elements within a portion of an indexed array with a specified value.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = indexed( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*/\nfunction indexed( x, value, start, end ) {\n\tvar i;\n\tfor ( i = start; i < end; i++ ) {\n\t\tx[ i ] = value;\n\t}\n\treturn x;\n}\n\n/**\n* Fills all elements within a portion of an accessor array with a specified value.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {AccessorArray} modified input 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 x = toAccessorArray( [ 1, 2, 3, 4 ] );\n* var obj = arraylike2object( x );\n*\n* var out = accessors( obj, 5, 1, 3 );\n* // returns \n*\n* var v = x.get( 0 );\n* // returns 1\n*\n* v = x.get( 1 );\n* // returns 5\n*\n* v = x.get( 2 );\n* // returns 5\n*\n* v = x.get( 3 );\n* // returns 4\n*/\nfunction accessors( x, value, start, end ) {\n\tvar data;\n\tvar set;\n\tvar i;\n\n\tdata = x.data;\n\tset = x.accessors[ 1 ];\n\tfor ( i = start; i < end; i++ ) {\n\t\tset( data, i, value );\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills all elements within a portion of an array with a specified value.\n*\n* @param {Collection} x - input array\n* @param {*} value - fill value\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = fill( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*\n* var bool = ( out === x );\n* // returns true\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = fill( x, 5, 1, 3 );\n* // returns [ 1, 5, 5, 4 ]\n*\n* var bool = ( out === x );\n* // returns true\n*/\nfunction fill( x, value, start, end ) {\n\tvar obj;\n\tif ( hasMethod( x, 'fill' ) ) {\n\t\treturn x.fill( value, start, end );\n\t}\n\tif ( start < 0 ) {\n\t\tstart += x.length;\n\t\tif ( start < 0 ) {\n\t\t\tstart = 0;\n\t\t}\n\t}\n\tif ( end < 0 ) {\n\t\tend += x.length; // if `end` is still negative, that is fine, as `x` will be returned un-mutated\n\t} else if ( end > x.length ) {\n\t\tend = x.length;\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, value, start, end );\n\t}\n\treturn indexed( x, value, start, end );\n}\n\n\n// EXPORTS //\n\nexport default fill;\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 isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport isComplexDataType from '@stdlib/ndarray-base-assert-is-complex-floating-point-data-type';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport zeros from '@stdlib/array-base-zeros';\nimport buffer from '@stdlib/ndarray-base-buffer';\nimport ndarray from '@stdlib/ndarray-base-ctor';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Broadcasts a scalar value to an ndarray having a specified shape.\n*\n* @param {*} value - scalar value\n* @param {*} dtype - output array data type\n* @param {NonNegativeIntegerArray} shape - output array shape\n* @param {string} order - memory layout (either row-major or column-major)\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {ndarray} ndarray\n*\n* @example\n* import getShape from '@stdlib/ndarray-shape';\n* import getDType from '@stdlib/ndarray-dtype';\n*\n* var x = broadcastScalar( 1.0, 'float64', [ 2, 2 ], 'row-major' );\n* // returns \n*\n* var sh = getShape( x );\n* // returns [ 2, 2 ]\n*\n* var dt = String( getDType( x ) );\n* // returns 'float64'\n*\n* var v = x.get( 0, 1 );\n* // returns 1.0\n*/\nfunction broadcastScalar( value, dtype, shape, order ) {\n\tvar buf;\n\tvar set;\n\tvar N;\n\n\tbuf = buffer( dtype, 1 );\n\tif ( buf === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tdtype = resolveStr( dtype );\n\tif ( isComplexDataType( dtype ) && isNumber( value ) ) {\n\t\tvalue = [ value, 0.0 ]; // note: we're assuming that the ComplexXXArray setter accepts an array of interleaved real and imaginary components\n\t}\n\tif ( isAccessorArray( buf ) ) {\n\t\tset = accessorSetter( dtype );\n\t} else {\n\t\tset = setter( dtype );\n\t}\n\tset( buf, 0, value );\n\tN = shape.length || 1;\n\treturn new ndarray( dtype, buf, shape, zeros( N ), 0, order );\n}\n\n\n// EXPORTS //\n\nexport default broadcastScalar;\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 resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\n\n\n// MAIN //\n\n/**\n* Resolves a list of data type strings.\n*\n* ## Notes\n*\n* - If the function is unable to resolve a data type string for a provided data type, the corresponding element in the returned array will be `null`.\n*\n* @param {Array} dtypes - list of data types\n* @returns {Array} results\n*\n* @example\n* var out = dtypes2strings( [ 'float32', 'float64' ] );\n* // returns [...]\n*\n* @example\n* var out = dtypes2strings( [ 'foo', 'bar' ] );\n* // returns [ null, null ]\n*/\nfunction dtypes2strings( dtypes ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < dtypes.length; i++ ) {\n\t\tout.push( resolveStr( dtypes[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default dtypes2strings;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray floating-point data type\n*\n* @example\n* var bool = isFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isFloatingPointDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'real_floating_point' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray real-valued floating-point data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray real-valued floating-point data type\n*\n* @example\n* var bool = isRealFloatingPointDataType( 'binary' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'float32' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'float64' );\n* // returns true\n*\n* bool = isRealFloatingPointDataType( 'generic' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'int8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint16' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint32' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'uint8c' );\n* // returns false\n*\n* bool = isRealFloatingPointDataType( 'foo' );\n* // returns false\n*/\nfunction isRealFloatingPointDataType( v ) { // eslint-disable-line id-length\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isRealFloatingPointDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray integer data type\n*\n* @example\n* var bool = isIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint16' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint32' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint8' );\n* // returns true\n*\n* bool = isIntegerDataType( 'uint8c' );\n* // returns true\n*\n* bool = isIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'signed_integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray signed integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray signed integer data type\n*\n* @example\n* var bool = isSignedIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'int16' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int32' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'int8' );\n* // returns true\n*\n* bool = isSignedIntegerDataType( 'uint16' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint32' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'uint8c' );\n* // returns false\n*\n* bool = isSignedIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isSignedIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isSignedIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'unsigned_integer' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray unsigned integer data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray unsigned integer data type\n*\n* @example\n* var bool = isUnsignedIntegerDataType( 'binary' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'float32' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'float64' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'generic' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int16' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int32' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'int8' );\n* // returns false\n*\n* bool = isUnsignedIntegerDataType( 'uint16' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint32' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint8' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'uint8c' );\n* // returns true\n*\n* bool = isUnsignedIntegerDataType( 'foo' );\n* // returns false\n*/\nfunction isUnsignedIntegerDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isUnsignedIntegerDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'real' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray real-valued data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray real-valued data type\n*\n* @example\n* var bool = isRealDataType( 'binary' );\n* // returns false\n*\n* bool = isRealDataType( 'float32' );\n* // returns true\n*\n* bool = isRealDataType( 'float64' );\n* // returns true\n*\n* bool = isRealDataType( 'complex128' );\n* // returns false\n*\n* bool = isRealDataType( 'generic' );\n* // returns false\n*\n* bool = isRealDataType( 'int16' );\n* // returns true\n*\n* bool = isRealDataType( 'int32' );\n* // returns true\n*\n* bool = isRealDataType( 'int8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint16' );\n* // returns true\n*\n* bool = isRealDataType( 'uint32' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8' );\n* // returns true\n*\n* bool = isRealDataType( 'uint8c' );\n* // returns true\n*\n* bool = isRealDataType( 'foo' );\n* // returns false\n*/\nfunction isRealDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isRealDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'numeric' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray numeric data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray numeric data type\n*\n* @example\n* var bool = isNumericDataType( 'binary' );\n* // returns false\n*\n* bool = isNumericDataType( 'float32' );\n* // returns true\n*\n* bool = isNumericDataType( 'float64' );\n* // returns true\n*\n* bool = isNumericDataType( 'generic' );\n* // returns false\n*\n* bool = isNumericDataType( 'int16' );\n* // returns true\n*\n* bool = isNumericDataType( 'int32' );\n* // returns true\n*\n* bool = isNumericDataType( 'int8' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint16' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint32' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint8' );\n* // returns true\n*\n* bool = isNumericDataType( 'uint8c' );\n* // returns true\n*\n* bool = isNumericDataType( 'foo' );\n* // returns false\n*/\nfunction isNumericDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumericDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'boolean' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray boolean data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray boolean data type\n*\n* @example\n* var bool = isBooleanDataType( 'binary' );\n* // returns false\n*\n* bool = isBooleanDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanDataType( 'foo' );\n* // returns false\n*/\nfunction isBooleanDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isBooleanDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'integer_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray integer index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray integer index data type\n*\n* @example\n* var bool = isIntegerIndexDataType( 'binary' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'int32' );\n* // returns true\n*\n* bool = isIntegerIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint8' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isIntegerIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isIntegerIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isIntegerIndexDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'boolean_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray boolean index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray boolean index data type\n*\n* @example\n* var bool = isBooleanIndexDataType( 'bool' );\n* // returns true\n*\n* bool = isBooleanIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint8' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isBooleanIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isBooleanIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isBooleanIndexDataType;\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 { factory as contains } from '@stdlib/array-base-assert-contains';\nimport dtypes from '@stdlib/ndarray-base-dtype-strings';\n\n\n// VARIABLES //\n\nvar isDataType = contains( dtypes( 'mask_index' ) );\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray mask index data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray mask index data type\n*\n* @example\n* var bool = isMaskIndexDataType( 'binary' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'float32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'float64' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'generic' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int16' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'int8' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint16' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint32' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'uint8' );\n* // returns true\n*\n* bool = isMaskIndexDataType( 'uint8c' );\n* // returns false\n*\n* bool = isMaskIndexDataType( 'foo' );\n* // returns false\n*/\nfunction isMaskIndexDataType( v ) {\n\treturn isDataType( String( v ) );\n}\n\n\n// EXPORTS //\n\nexport default isMaskIndexDataType;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 hasOwnProp from '@stdlib/assert-has-own-property';\nimport resolve from '@stdlib/ndarray-base-dtype-resolve-str';\nimport PROMOTION_RULES from './promotion_rules.json';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of promotion rules.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( PROMOTION_RULES );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = PROMOTION_RULES[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns the ndarray data type with the smallest size and closest \"kind\" to which ndarray data types can be safely cast.\n*\n* @param {*} [dtype1] - ndarray data type value\n* @param {*} [dtype2] - ndarray data type value\n* @returns {(Object|integer|string|null)} promotion rule(s) or null\n*\n* @example\n* var table = promotionRules();\n* // returns {...}\n*\n* @example\n* var dt = promotionRules( 'float32', 'uint32' );\n* // returns 'float64'\n*\n* @example\n* var dt = promotionRules( 'binary', 'generic' );\n* // returns -1\n*\n* @example\n* var dt = promotionRules( 'float32', 'foo' );\n* // returns null\n*/\nfunction promotionRules( dtype1, dtype2 ) {\n\tvar o;\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tdtype1 = resolve( dtype1 );\n\tif ( hasOwnProp( PROMOTION_RULES, dtype1 ) ) {\n\t\to = PROMOTION_RULES[ dtype1 ];\n\t\tdtype2 = resolve( dtype2 );\n\t\tif ( hasOwnProp( o, dtype2 ) ) {\n\t\t\treturn o[ dtype2 ];\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default promotionRules;\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 promotionRules from '@stdlib/ndarray-promotion-rules';\n\n\n// MAIN //\n\n/**\n* Returns a data type that results from applying promotion rules to a provided list of data types.\n*\n* @param {StringArray} dtypes - list of data types\n* @returns {(string|null)} result\n*\n* @example\n* var dt = promoteDataTypes( [ 'float32', 'float64' ] );\n* // returns 'float64'\n*\n* @example\n* var dt = promoteDataTypes( [ 'binary', 'complex128' ] );\n* // returns null\n*/\nfunction promoteDataTypes( dtypes ) {\n\tvar dt;\n\tvar N;\n\tvar i;\n\n\tN = dtypes.length;\n\tif ( N === 0 ) {\n\t\treturn null;\n\t}\n\tdt = dtypes[ 0 ];\n\tfor ( i = 1; i < dtypes.length; i++ ) {\n\t\tdt = promotionRules( dt, dtypes[ i ] );\n\t\tif ( dt === null || dt === -1 ) {\n\t\t\treturn null;\n\t\t}\n\t}\n\treturn dt;\n}\n\n\n// EXPORTS //\n\nexport default promoteDataTypes;\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/**\n* Returns default ndarray settings.\n*\n* @returns {Object} defaults\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t// Data types:\n\t\t'dtypes': {\n\t\t\t'default': 'float64',\n\t\t\t'numeric': 'float64',\n\t\t\t'real': 'float64',\n\t\t\t'floating_point': 'float64',\n\t\t\t'real_floating_point': 'float64',\n\t\t\t'complex_floating_point': 'complex128',\n\t\t\t'integer': 'int32',\n\t\t\t'signed_integer': 'int32',\n\t\t\t'unsigned_integer': 'uint32',\n\t\t\t'boolean': 'bool',\n\t\t\t'index': 'int32',\n\t\t\t'integer_index': 'int32',\n\t\t\t'boolean_index': 'bool',\n\t\t\t'mask_index': 'uint8'\n\t\t},\n\n\t\t// Memory layout:\n\t\t'order': 'row-major',\n\n\t\t// Casting mode:\n\t\t'casting': 'safe',\n\n\t\t// Index mode:\n\t\t'index_mode': 'throw'\n\t};\n}\n\n\n// EXPORTS //\n\nexport default defaults;\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 defaults from './main.js';\n\n\n// VARIABLES //\n\nvar DEFAULTS = defaults();\nvar HASH = {\n\t'dtypes.default': DEFAULTS.dtypes.default,\n\t'dtypes.numeric': DEFAULTS.dtypes.numeric,\n\t'dtypes.real': DEFAULTS.dtypes.real,\n\t'dtypes.floating_point': DEFAULTS.dtypes.floating_point,\n\t'dtypes.real_floating_point': DEFAULTS.dtypes.real_floating_point,\n\t'dtypes.complex_floating_point': DEFAULTS.dtypes.complex_floating_point,\n\t'dtypes.integer': DEFAULTS.dtypes.integer,\n\t'dtypes.signed_integer': DEFAULTS.dtypes.signed_integer,\n\t'dtypes.unsigned_integer': DEFAULTS.dtypes.unsigned_integer,\n\t'dtypes.boolean': DEFAULTS.dtypes.boolean,\n\t'dtypes.index': DEFAULTS.dtypes.index,\n\t'dtypes.integer_index': DEFAULTS.dtypes.integer_index,\n\t'dtypes.boolean_index': DEFAULTS.dtypes.boolean_index,\n\t'dtypes.mask_index': DEFAULTS.dtypes.mask_index,\n\t'order': DEFAULTS.order,\n\t'casting': DEFAULTS.casting,\n\t'index_mode': DEFAULTS.index_mode\n};\n\n\n// MAIN //\n\n/**\n* Returns a default ndarray setting.\n*\n* @param {string} name - setting name\n* @returns {*} default setting or null\n*\n* @example\n* var v = get( 'dtypes.default' );\n* // returns \n*/\nfunction get( name ) {\n\tvar v = HASH[ name ];\n\treturn ( v === void 0 ) ? null : v;\n}\n\n\n// EXPORTS //\n\nexport default get;\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/**\n* Return default ndarray settings.\n*\n* @module @stdlib/ndarray-defaults\n*\n* @example\n* import defaults from '@stdlib/ndarray-defaults';\n*\n* var o = defaults();\n* // returns {...}\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport get from './get.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'get', get );\n\n\n// EXPORTS //\n\nexport default main;\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 id-length */\n\n'use strict';\n\n// MODULES //\n\nimport isFloatingPointDataType from '@stdlib/ndarray-base-assert-is-floating-point-data-type';\nimport isRealFloatingPointDataType from '@stdlib/ndarray-base-assert-is-real-floating-point-data-type';\nimport isComplexFloatingPointDataType from '@stdlib/ndarray-base-assert-is-complex-floating-point-data-type';\nimport isIntegerDataType from '@stdlib/ndarray-base-assert-is-integer-data-type';\nimport isSignedIntegerDataType from '@stdlib/ndarray-base-assert-is-signed-integer-data-type';\nimport isUnsignedIntegerDataType from '@stdlib/ndarray-base-assert-is-unsigned-integer-data-type';\nimport isRealDataType from '@stdlib/ndarray-base-assert-is-real-data-type';\nimport isNumericDataType from '@stdlib/ndarray-base-assert-is-numeric-data-type';\nimport isBooleanDataType from '@stdlib/ndarray-base-assert-is-boolean-data-type';\nimport isIntegerIndexDataType from '@stdlib/ndarray-base-assert-is-integer-index-data-type';\nimport isBooleanIndexDataType from '@stdlib/ndarray-base-assert-is-boolean-index-data-type';\nimport isMaskIndexDataType from '@stdlib/ndarray-base-assert-is-mask-index-data-type';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport promoteDataTypes from '@stdlib/ndarray-base-promote-dtypes';\nimport defaults from '@stdlib/ndarray-defaults';\nimport join from '@stdlib/array-base-join';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\nvar DEFAULT_INDEX_DTYPE = defaults.get( 'dtypes.default_index' );\nvar DEFAULT_SIGNED_INTEGER_DTYPE = defaults.get( 'dtypes.signed_integer' );\nvar DEFAULT_UNSIGNED_INTEGER_DTYPE = defaults.get( 'dtypes.unsigned_integer' );\nvar DEFAULT_REAL_FLOATING_POINT_DTYPE = defaults.get( 'dtypes.real_floating_point' );\nvar DEFAULT_COMPLEX_FLOATING_POINT_DTYPE = defaults.get( 'dtypes.complex_floating_point' );\n\n// Table where, for each respective policy, the value is a function which applies the policy to an input data type...\nvar POLICY_TABLE1 = {\n\t'default': defaultPolicy,\n\t'default_index': defaultIndexPolicy,\n\t'same': samePolicy,\n\t'promoted': promotedPolicy,\n\t'accumulation': accumulationPolicy\n};\n\n// Table where, for each respective policy, the value is an array whose first element is an assertion and whose second element is a fallback data type...\nvar POLICY_TABLE2 = {\n\t// Floating-point policies...\n\t'floating_point': [\n\t\tisFloatingPointDataType,\n\t\tdefaults.get( 'dtypes.floating_point' )\n\t],\n\t'floating_point_and_generic': [\n\t\twrap( isFloatingPointDataType ),\n\t\tdefaults.get( 'dtypes.floating_point' )\n\t],\n\t'real_floating_point': [\n\t\tisRealFloatingPointDataType,\n\t\tresolveDefaultRealFloatingPoint\n\t],\n\t'real_floating_point_and_generic': [\n\t\twrap( isRealFloatingPointDataType ),\n\t\tresolveDefaultRealFloatingPoint\n\t],\n\t'complex_floating_point': [\n\t\tisComplexFloatingPointDataType,\n\t\tresolveDefaultComplexFloatingPoint\n\t],\n\t'complex_floating_point_and_generic': [\n\t\twrap( isComplexFloatingPointDataType ),\n\t\tresolveDefaultComplexFloatingPoint\n\t],\n\n\t// Integer policies...\n\t'integer': [\n\t\tisIntegerDataType,\n\t\tdefaults.get( 'dtypes.integer' )\n\t],\n\t'integer_and_generic': [\n\t\twrap( isIntegerDataType ),\n\t\tdefaults.get( 'dtypes.integer' )\n\t],\n\t'signed_integer': [\n\t\tisSignedIntegerDataType,\n\t\tDEFAULT_SIGNED_INTEGER_DTYPE\n\t],\n\t'signed_integer_and_generic': [\n\t\twrap( isSignedIntegerDataType ),\n\t\tDEFAULT_SIGNED_INTEGER_DTYPE\n\t],\n\t'unsigned_integer': [\n\t\tisUnsignedIntegerDataType,\n\t\tDEFAULT_UNSIGNED_INTEGER_DTYPE\n\t],\n\t'unsigned_integer_and_generic': [\n\t\twrap( isUnsignedIntegerDataType ),\n\t\tDEFAULT_UNSIGNED_INTEGER_DTYPE\n\t],\n\n\t// Real-valued number policies...\n\t'real': [\n\t\tisRealDataType,\n\t\tdefaults.get( 'dtypes.real' )\n\t],\n\t'real_and_generic': [\n\t\twrap( isRealDataType ),\n\t\tdefaults.get( 'dtypes.real' )\n\t],\n\n\t// Real- and complex-valued number policies...\n\t'numeric': [\n\t\tisNumericDataType,\n\t\tdefaults.get( 'dtypes.numeric' )\n\t],\n\t'numeric_and_generic': [\n\t\twrap( isNumericDataType ),\n\t\tdefaults.get( 'dtypes.numeric' )\n\t],\n\n\t// Boolean policies...\n\t'boolean': [\n\t\tisBooleanDataType,\n\t\tdefaults.get( 'dtypes.boolean' )\n\t],\n\t'boolean_and_generic': [\n\t\twrap( isBooleanDataType ),\n\t\tdefaults.get( 'dtypes.boolean' )\n\t],\n\n\t// Index policies...\n\t'integer_index': [\n\t\tisIntegerIndexDataType,\n\t\tdefaults.get( 'dtypes.integer_index' )\n\t],\n\t'integer_index_and_generic': [\n\t\twrap( isIntegerIndexDataType ),\n\t\tdefaults.get( 'dtypes.integer_index' )\n\t],\n\t'boolean_index': [\n\t\tisBooleanIndexDataType,\n\t\tdefaults.get( 'dtypes.boolean_index' )\n\t],\n\t'boolean_index_and_generic': [\n\t\twrap( isBooleanIndexDataType ),\n\t\tdefaults.get( 'dtypes.boolean_index' )\n\t],\n\t'mask_index': [\n\t\tisMaskIndexDataType,\n\t\tdefaults.get( 'dtypes.mask_index' )\n\t],\n\t'mask_index_and_generic': [\n\t\twrap( isMaskIndexDataType ),\n\t\tdefaults.get( 'dtypes.mask_index' )\n\t]\n};\n\n// Table mapping complex-valued floating-point data types to real-valued floating-point data types having the same precision:\nvar COMPLEX2FLOAT = {\n\t'complex128': 'float64',\n\t'complex64': 'float32',\n\t'complex32': 'float16'\n};\n\n// Table mapping real-valued floating-point data types to complex-valued floating-point data types having the same precision:\nvar FLOAT2COMPLEX = {\n\t'float64': 'complex128',\n\t'float32': 'complex64',\n\t'float16': 'complex32'\n};\n\n\n// FUNCTIONS //\n\n/**\n* Wraps a data type validation function to also check for a \"generic\" data type.\n*\n* @private\n* @param {Function} fcn - validation function\n* @returns {Function} wrapped validation function\n*/\nfunction wrap( fcn ) {\n\treturn wrapper;\n\n\t/**\n\t* Tests whether a provided data type is either \"generic\" or satisfies a data type validation function.\n\t*\n\t* @private\n\t* @param {*} value - input value\n\t* @returns {boolean} boolean indicating whether a provided value passes a test\n\t*/\n\tfunction wrapper( value ) {\n\t\treturn ( value === 'generic' ) || fcn( value );\n\t}\n}\n\n/**\n* Returns the default data type.\n*\n* @private\n* @returns {string} output ndarray data type\n*/\nfunction defaultPolicy() {\n\t// When the policy is \"default\", the output data type should always be the default data type without consideration for the input data types:\n\treturn DEFAULT_DTYPE;\n}\n\n/**\n* Returns the default index data type.\n*\n* @private\n* @returns {string} output ndarray data type\n*/\nfunction defaultIndexPolicy() {\n\t// When the policy is \"default_index\", the output data type should always be the default index data type without consideration for the input data types:\n\treturn DEFAULT_INDEX_DTYPE;\n}\n\n/**\n* Applies the \"same\" policy by returning the common input data type.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} invalid data types\n* @returns {string} output ndarray data type\n*/\nfunction samePolicy( dtypes ) {\n\tvar dt;\n\tvar i;\n\n\tdt = dtypes[ 0 ];\n\tfor ( i = 1; i < dtypes.length; i++ ) {\n\t\t// When the policy is \"same\", we require that all data types (both input and output) be the same...\n\t\tif ( dtypes[ i ] !== dt ) {\n\t\t\tthrow new Error( format( 'invalid argument. Unable to resolve an output data type. The output data type policy is \"same\" and yet the input data types are not equal. Data types: [%s].', join( dtypes, ', ' ) ) );\n\t\t}\n\t}\n\treturn dt;\n}\n\n/**\n* Applies the \"promoted\" policy by applying type promotion to the list of provided data types.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} must provide data types which can be safely cast to a common data type\n* @returns {string} output ndarray data type\n*/\nfunction promotedPolicy( dtypes ) {\n\tvar dt = promoteDataTypes( dtypes );\n\tif ( dt === null ) {\n\t\tthrow new Error( format( 'invalid argument. Unable to apply type promotion rules when resolving a data type to which the input data types can be safely cast. Data types: [%s].', join( dtypes, ', ' ) ) );\n\t}\n\treturn dt;\n}\n\n/**\n* Applies the \"accumulation\" policy to the list of input data types.\n*\n* @private\n* @param {StringArray} dtypes - input ndarray data types\n* @throws {Error} must provide data types which can be safely cast to a common data type\n* @returns {string} output ndarray data type\n*/\nfunction accumulationPolicy( dtypes ) {\n\tvar dt = promotedPolicy( dtypes );\n\n\t// If the promoted data type is floating-point, allow accumulation in that data type as overflow/underflow is handled naturally as a built-in feature of that data type...\n\tif ( isFloatingPointDataType( dt ) || dt === 'generic' ) { // NOTE: we may want to revisit this in the future for float16/complex32, where the value range is much more limited\n\t\treturn dt;\n\t}\n\t// Unless the promoted data type value range is larger than the default un/signed integer data type, accumulate in the default un/signed integer data type, as accumulating in small range integer data types (e.g., `int8`) is at high risk for overflow, especially for ndarrays containing many elements...\n\tif ( isUnsignedIntegerDataType( dt ) ) {\n\t\treturn promoteDataTypes( [ dt, DEFAULT_UNSIGNED_INTEGER_DTYPE ] );\n\t}\n\tif ( isSignedIntegerDataType( dt ) ) {\n\t\treturn promoteDataTypes( [ dt, DEFAULT_SIGNED_INTEGER_DTYPE ] );\n\t}\n\t// For all other data types, accumulate in the default real-valued floating-point data type...\n\treturn DEFAULT_REAL_FLOATING_POINT_DTYPE;\n}\n\n/**\n* Resolves a default real-valued floating-point data type which preserves floating-point precision.\n*\n* @private\n* @param {string} dtype - input ndarray data type\n* @returns {string} output ndarray data type\n*/\nfunction resolveDefaultRealFloatingPoint( dtype ) {\n\treturn COMPLEX2FLOAT[ dtype ] || DEFAULT_REAL_FLOATING_POINT_DTYPE;\n}\n\n/**\n* Resolves a default complex-valued floating-point data type which preserves floating-point precision.\n*\n* @private\n* @param {string} dtype - input ndarray data type\n* @returns {string} output ndarray data type\n*/\nfunction resolveDefaultComplexFloatingPoint( dtype ) {\n\treturn FLOAT2COMPLEX[ dtype ] || DEFAULT_COMPLEX_FLOATING_POINT_DTYPE;\n}\n\n\n// MAIN //\n\n/**\n* Resolves the output data type from a list of input ndarray data types.\n*\n* @param {StringArray} dtypes - list of input ndarray data types\n* @param {string} policy - output ndarray data type policy\n* @throws {TypeError} second argument must be a recognized data type policy\n* @throws {Error} unexpected error\n* @returns {string} output ndarray data type\n*\n* @example\n* var dt = resolve( [ 'float64' ], 'complex_floating_point' );\n* // returns \n*/\nfunction resolve( dtypes, policy ) {\n\tvar dt;\n\tvar p;\n\n\t// First, check whether the policy mandates that the output data type always be a specific data type...\n\tif ( isDataType( policy ) ) {\n\t\treturn policy;\n\t}\n\t// Next, check whether the policy is one in which we may be able to avoid type promotion...\n\tp = POLICY_TABLE1[ policy ];\n\tif ( p !== void 0 ) {\n\t\treturn p( dtypes );\n\t}\n\t// For all other policies, we always apply type promotion rules...\n\tdt = promotedPolicy( dtypes );\n\n\t// Check whether the policy requires determining the data type \"kind\"...\n\tp = POLICY_TABLE2[ policy ];\n\tif ( p !== void 0 ) {\n\t\t// Check whether the promoted data type belongs to the data type \"kind\"...\n\t\tif ( p[ 0 ]( dt ) ) {\n\t\t\t// If so, we can just return the promoted data type:\n\t\t\treturn dt;\n\t\t}\n\t\t// Otherwise, we need to fallback to a default data type belonging to that \"kind\"...\n\t\tif ( isString( p[ 1 ] ) ) {\n\t\t\treturn p[ 1 ];\n\t\t}\n\t\treturn p[ 1 ]( dt );\n\t}\n\tthrow new TypeError( format( 'invalid argument. Second argument must be a supported data type policy. Value: `%s`.', policy ) );\n}\n\n\n// EXPORTS //\n\nexport default resolve;\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 outputDataType from '@stdlib/ndarray-base-output-dtype';\n\n\n// MAIN //\n\n/**\n* Resolves the output ndarray data type for a binary function.\n*\n* @param {*} xdtype - first input ndarray data type\n* @param {*} ydtype - second input ndarray data type\n* @param {(string|*)} policy - output ndarray data type policy\n* @throws {TypeError} third argument must be a recognized data type policy\n* @throws {Error} must provide data types amenable to type promotion\n* @returns {DataType} output ndarray data type\n*\n* @example\n* var dt = resolve( 'float64', 'float32', 'complex_floating_point' );\n* // returns \n*/\nfunction resolve( xdtype, ydtype, policy ) {\n\treturn outputDataType( [ xdtype, ydtype ], policy );\n}\n\n\n// EXPORTS //\n\nexport default resolve;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray data type.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray data type\n*\n* @example\n* var bool = isDataType( 'binary' );\n* // returns true\n*\n* bool = isDataType( 'float32' );\n* // returns true\n*\n* bool = isDataType( 'float64' );\n* // returns true\n*\n* bool = isDataType( 'generic' );\n* // returns true\n*\n* bool = isDataType( 'int16' );\n* // returns true\n*\n* bool = isDataType( 'int32' );\n* // returns true\n*\n* bool = isDataType( 'int8' );\n* // returns true\n*\n* bool = isDataType( 'uint16' );\n* // returns true\n*\n* bool = isDataType( 'uint32' );\n* // returns true\n*\n* bool = isDataType( 'uint8' );\n* // returns true\n*\n* bool = isDataType( 'uint8c' );\n* // returns true\n*\n* bool = isDataType( 'foo' );\n* // returns false\n*/\nfunction isDataType( v ) {\n\treturn (\n\t\tisDataTypeString( v ) ||\n\t\tisDataTypeObject( v ) ||\n\t\tisStructDataType( v )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataType;\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 { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport hasProp from '@stdlib/assert-has-property';\nimport DataType from '@stdlib/ndarray-dtype-ctor';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is an ndarray data type object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether an input value is an ndarray data type object\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isDataTypeObject( new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isDataTypeObject( 'float64' );\n* // returns false\n*\n* bool = isDataTypeObject( {} );\n* // returns false\n*/\nfunction isDataTypeObject( value ) {\n\treturn (\n\t\tvalue instanceof DataType ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\tisInteger( value.alignment ) &&\n\t\t\tisInteger( value.byteLength ) &&\n\t\t\tisString( value.byteOrder ) &&\n\t\t\tisString( value.char ) &&\n\t\t\tisInteger( value.enum ) &&\n\t\t\thasProp( value, 'value' )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isDataTypeObject;\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 isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray having a supported data type\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\tvar dt;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tdt = x.dtype;\n\tif ( isDataType( dt ) ) {\n\t\treturn dt;\n\t}\n\t// A data type is essential for interpreting the memory associated with an ndarray object, so no fallbacks or workarounds for data type resolution...\n\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray having a supported data type. Value: `%s`.', dt ) );\n}\n\n\n// EXPORTS //\n\nexport default dtype;\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 isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the number of ndarray dimensions.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {NonNegativeInteger} number of dimensions\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = ndims( zeros( [ 3, 3, 3 ] ) );\n* // returns 3\n*/\nfunction ndims( x ) {\n\tvar sh;\n\tvar n;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tn = x.ndims;\n\tif ( isNonNegativeInteger( n ) ) {\n\t\treturn n;\n\t}\n\tsh = x.shape;\n\tif ( !isCollection( sh ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\treturn sh.length;\n}\n\n\n// EXPORTS //\n\nexport default ndims;\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 isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport strides from '@stdlib/ndarray-strides';\nimport ndims from '@stdlib/ndarray-ndims';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport format from '@stdlib/string-format';\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* @throws {TypeError} must provide an 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\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\to = x.order;\n\tif ( isOrder( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = strides( x );\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 ( ndims( x ) === 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) 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 isInteger } from '@stdlib/assert-is-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ) );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x ) {\n\tvar out;\n\tvar ord;\n\tvar sh;\n\tvar st;\n\tvar d;\n\tvar i;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tst = x.strides; // TODO: consider whether we want to support ecosystem libraries, such as scijs/ndarray, which name this property `stride`\n\tif ( !isCollection( st ) ) {\n\t\t// WARNING: if no strides array, try to derive the strides from the shape. Note, however, that there is a lot that can go wrong here, as the only thing we are requiring is that the shape is a collection. The main point of going through the effort to compute strides is to support minimal ndarray-esque objects, where the only essential attributes are `shape` and `dtype` and where other attributes can be computed (e.g., `strides`, `offset`, `ndims`, `order`, etc), assuming single-segment contiguous data stored in row-major order...\n\t\tsh = x.shape;\n\t\tif ( !isCollection( sh ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isOrder( ord ) ) {\n\t\t\tord = 'row-major';\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\t// Copy the strides in order to avoid unintended mutation...\n\tout = [];\n\tfor ( i = 0; i < st.length; i++ ) {\n\t\td = st[ i ];\n\t\tif ( !isInteger( d ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tout.push( d );\n\t}\n\treturn out;\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* Test if a value is an array-like object containing only integers.\n*\n* @module @stdlib/assert-is-integer-array\n*\n* @example\n* import isIntegerArray from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ -3.0, new Number(0.0), 2.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -3.0, '3.0' ] );\n* // returns false\n*\n* @example\n* import { primitives as isIntegerArray } from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ -1.0, 10.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -1.0, 0.0, 5.0 ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -3.0, new Number(-1.0) ] );\n* // returns false\n*\n* @example\n* import { objects as isIntegerArray } from '@stdlib/assert-is-integer-array';\n*\n* var bool = isIntegerArray( [ new Number(1.0), new Number(3.0) ] );\n* // returns true\n*\n* bool = isIntegerArray( [ -1.0, 0.0, 3.0 ] );\n* // returns false\n*\n* bool = isIntegerArray( [ 3.0, new Number(-1.0) ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport isInteger from '@stdlib/assert-is-integer';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-like-function';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isInteger.isPrimitive );\nvar isObjectArray = arrayfun( isInteger.isObject );\n\n\n// MAIN //\n\nvar isIntegerArray = arrayfun( isInteger );\nsetReadOnly( isIntegerArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isIntegerArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isIntegerArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Tests that a value is a valid constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {(Error|null)} error object or null\n*\n* @example\n* var ctor = function ctor() {};\n*\n* var err = validate( ctor );\n* // returns null\n*\n* err = validate( null );\n* // returns \n*/\nfunction validate( value ) {\n\tvar type = typeof value;\n\tif (\n\t\tvalue === null ||\n\t\t(type !== 'object' && type !== 'function')\n\t) {\n\t\treturn new TypeError( format( 'invalid argument. A provided constructor must be either an object (except null) or a function. Value: `%s`.', value ) );\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 Object.create;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Dummy constructor.\n*\n* @private\n*/\nfunction Ctor() {\n\t// Empty...\n}\n\n\n// MAIN //\n\n/**\n* An `Object.create` shim for older JavaScript engines.\n*\n* @private\n* @param {Object} proto - prototype\n* @returns {Object} created object\n*\n* @example\n* var obj = createObject( Object.prototype );\n* // returns {}\n*/\nfunction createObject( proto ) {\n\tCtor.prototype = proto;\n\treturn new Ctor();\n}\n\n\n// EXPORTS //\n\nexport default createObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar createObject;\nif ( typeof builtin === 'function' ) {\n\tcreateObject = builtin;\n} else {\n\tcreateObject = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default createObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Restricts an index to the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {NonNegativeInteger} index\n*\n* @example\n* var idx = clampIndex( -1, 10 );\n* // returns 0\n*\n* idx = clampIndex( 15, 10 );\n* // returns 10\n*\n* idx = clampIndex( 5, 10 );\n* // returns 5\n*/\nfunction clampIndex( idx, max ) {\n\tif ( idx < 0 ) {\n\t\treturn 0;\n\t}\n\tif ( idx > max ) {\n\t\treturn max;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default clampIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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* Wraps an index on the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {NonNegativeInteger} index\n*\n* @example\n* var idx = wrapIndex( -1, 10 );\n* // returns 10\n*\n* idx = wrapIndex( 13, 10 );\n* // returns 2\n*\n* idx = wrapIndex( 6, 10 );\n* // returns 6\n*/\nfunction wrapIndex( idx, max ) {\n\tvar mp1 = max + 1;\n\tif ( idx < 0 ) {\n\t\tidx += mp1; // slight optimization to avoid modulo arithmetic when |idx| <= max+1\n\t\tif ( idx < 0 ) {\n\t\t\tidx %= mp1;\n\t\t\tif ( idx !== 0 ) {\n\t\t\t\tidx += mp1;\n\t\t\t}\n\t\t}\n\t\treturn idx;\n\t}\n\tif ( idx > max ) {\n\t\tidx -= mp1; // slight optimization to avoid modulo arithmetic when max+1 < idx <= 2*(max+1)\n\t\tif ( idx > max ) {\n\t\t\tidx %= mp1;\n\t\t}\n\t\treturn idx;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default wrapIndex;\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* Normalizes an index to the interval `[0,max]`.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @returns {integer} index\n*\n* @example\n* var idx = normalizeIndex( -2, 10 );\n* // returns 9\n*\n* idx = normalizeIndex( 15, 10 );\n* // returns -1\n*\n* idx = normalizeIndex( 5, 10 );\n* // returns 5\n*/\nfunction normalizeIndex( idx, max ) {\n\tif ( idx < 0 ) {\n\t\tidx += max + 1;\n\t\tif ( idx < 0 ) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn idx;\n\t}\n\tif ( idx > max ) {\n\t\treturn -1;\n\t}\n\treturn idx;\n}\n\n\n// EXPORTS //\n\nexport default normalizeIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { factory as contains } from '@stdlib/array-base-assert-contains';\nimport modes from '@stdlib/ndarray-index-modes';\n\n\n// MAIN //\n\n/**\n* Tests whether an input value is a supported ndarray index mode.\n*\n* @name isIndexMode\n* @type {Function}\n* @param {*} v - value to test\n* @returns {boolean} boolean indicating whether an input value is a supported ndarray index mode\n*\n* @example\n* var bool = isIndexMode( 'wrap' );\n* // returns true\n*\n* bool = isIndexMode( 'clamp' );\n* // returns true\n*\n* bool = isIndexMode( 'throw' );\n* // returns true\n*\n* bool = isIndexMode( 'foo' );\n* // returns false\n*/\nvar isIndexMode = contains( modes() );\n\n\n// EXPORTS //\n\nexport default isIndexMode;\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 clampIndex from '@stdlib/ndarray-base-clamp-index';\nimport wrapIndex from '@stdlib/ndarray-base-wrap-index';\nimport normalize from '@stdlib/ndarray-base-normalize-index';\nimport isIndexMode from '@stdlib/ndarray-base-assert-is-index-mode';\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar TABLE = {\n\t'wrap': wrapIndex,\n\t'clamp': clampIndex,\n\t'normalize': normalizeIndex,\n\t'throw': throwIfOutOfBounds\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an index if within bounds and throw an error otherwise.\n*\n* @private\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = throwIfOutOfBounds( 2, 9 );\n* // returns 2\n*\n* idx = throwIfOutOfBounds( 10, 9 );\n* // throws \n*\n* idx = throwIfOutOfBounds( -1, 9 );\n* // throws \n*/\nfunction throwIfOutOfBounds( idx, max ) {\n\tif ( idx < 0 || idx > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn idx;\n}\n\n/**\n* Normalizes an index before performing a strict bounds check.\n*\n* @private\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = normalizeIndex( 1, 10 );\n* // returns 1\n*\n* idx = normalizeIndex( -4, 10 );\n* // returns 7\n*\n* idx = normalizeIndex( -100, 10 );\n* // throws \n*/\nfunction normalizeIndex( idx, max ) {\n\tvar index = normalize( idx, max );\n\tif ( index < 0 || index > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn index;\n}\n\n\n// MAIN //\n\n/**\n* Returns a function for returning an index according to a provided index mode.\n*\n* @param {string} mode - specifies how to handle an out-of-bounds index\n* @throws {TypeError} first argument must be a recognized index mode\n* @returns {Function} function for returning an index\n*\n* @example\n* var ind = factory( 'clamp' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // returns 9\n*\n* idx = ind( -1, 9 );\n* // returns 0\n*\n* @example\n* var ind = factory( 'wrap' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // returns 0\n*\n* idx = ind( -1, 9 );\n* // returns 9\n*\n* @example\n* var ind = factory( 'throw' );\n*\n* var idx = ind( 2, 9 );\n* // returns 2\n*\n* idx = ind( 10, 9 );\n* // throws \n*\n* idx = ind( -1, 9 );\n* // throws \n*\n* @example\n* var ind = factory( 'normalize' );\n*\n* var idx = ind( 1, 10 );\n* // returns 1\n*\n* idx = ind( -4, 10 );\n* // returns 7\n*\n* idx = ind( -100, 10 );\n* // throws \n*/\nfunction factory( mode ) {\n\tif ( !isIndexMode( mode ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a recognized index mode. Value: `%s`.', mode ) );\n\t}\n\treturn TABLE[ mode ];\n}\n\n\n// EXPORTS //\n\nexport default factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport clampIndex from '@stdlib/ndarray-base-clamp-index';\nimport wrapIndex from '@stdlib/ndarray-base-wrap-index';\nimport normalizeIndex from '@stdlib/ndarray-base-normalize-index';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an index given an index mode.\n*\n* @param {integer} idx - index\n* @param {NonNegativeInteger} max - maximum index\n* @param {string} mode - specifies how to handle an index outside the interval `[0,max]`\n* @throws {RangeError} index out-of-bounds\n* @returns {integer} index\n*\n* @example\n* var idx = ind( 2, 9, 'clamp' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'clamp' );\n* // returns 9\n*\n* idx = ind( -1, 9, 'clamp' );\n* // returns 0\n*\n* @example\n* var idx = ind( 2, 9, 'wrap' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'wrap' );\n* // returns 0\n*\n* idx = ind( -1, 9, 'wrap' );\n* // returns 9\n*\n* @example\n* var idx = ind( 2, 9, 'throw' );\n* // returns 2\n*\n* idx = ind( 10, 9, 'throw' );\n* // throws \n*\n* idx = ind( -1, 9, 'throw' );\n* // throws \n*\n* @example\n* var idx = ind( 1, 10, 'normalize' );\n* // returns 1\n*\n* idx = ind( -4, 10, 'normalize' );\n* // returns 7\n*\n* idx = ind( -100, 10, 'normalize' );\n* // throws \n*/\nfunction ind( idx, max, mode ) {\n\tvar index;\n\tif ( mode === 'clamp' ) {\n\t\treturn clampIndex( idx, max );\n\t}\n\tif ( mode === 'wrap' ) {\n\t\treturn wrapIndex( idx, max );\n\t}\n\tindex = idx;\n\tif ( mode === 'normalize' ) {\n\t\tindex = normalizeIndex( index, max );\n\t}\n\tif ( index < 0 || index > max ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index must resolve to a value on the interval: [0, %d]. Value: `%d`.', max, idx ) );\n\t}\n\treturn index;\n}\n\n\n// EXPORTS //\n\nexport default ind;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 an index given an index mode.\n*\n* @module @stdlib/ndarray-base-ind\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( -1, 10, 'wrap' );\n* // returns 10\n*\n* idx = ind( 14, 10, 'wrap' );\n* // returns 3\n*\n* idx = ind( 6, 10, 'wrap' );\n* // returns 6\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( -1, 10, 'clamp' );\n* // returns 0\n*\n* idx = ind( 14, 10, 'clamp' );\n* // returns 10\n*\n* idx = ind( 6, 10, 'clamp' );\n* // returns 6\n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( 1, 10, 'throw' );\n* // returns 1\n*\n* idx = ind( 14, 10, 'throw' );\n* // throws \n*\n* idx = ind( -1, 10, 'throw' );\n* // throws \n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var idx = ind( 1, 10, 'normalize' );\n* // returns 1\n*\n* idx = ind( -4, 10, 'normalize' );\n* // returns 7\n*\n* idx = ind( -100, 10, 'normalize' );\n* // throws \n*\n* @example\n* import ind from '@stdlib/ndarray-base-ind';\n*\n* var fcn = ind.factory( 'clamp' );\n*\n* var idx = fcn( -1, 10 );\n* // returns 0\n*\n* idx = fcn( 14, 10 );\n* // returns 10\n*\n* idx = fcn( 6, 10 );\n* // returns 6\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport factory from './factory.js';\nimport main from './main.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\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/* eslint-disable no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar base = parent.prototype.iget;\n\n\n// MAIN //\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @throws {TypeError} index must be an integer\n* @throws {RangeError} index exceeds array dimensions\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\tif ( this._ndims > 0 ) {\n\t\tif ( !isInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index must be an integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tidx = getIndex( idx, this._length-1, this._mode );\n\t\treturn base.call( this, idx );\n\t}\n\treturn base.call( this );\n}\n\n\n// EXPORTS //\n\nexport default iget;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// METHODS //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport format from '@stdlib/string-format';\n\n\n// VARIABLES //\n\nvar base = parent.prototype.iset;\n\n\n// MAIN //\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @throws {Error} cannot write to a read-only array\n* @throws {TypeError} index must be an integer\n* @throws {RangeError} index exceeds array dimensions\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\tif ( this._flags.READONLY ) {\n\t\tthrow new Error( 'invalid invocation. Cannot write to a read-only array.' );\n\t}\n\tif ( this._ndims > 0 ) {\n\t\tif ( !isInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index must be an integer. Value: `%s`.', idx ) );\n\t\t}\n\t\tidx = getIndex( idx, this._length-1, this._mode );\n\t\tbase.call( this, idx, v );\n\t} else {\n\t\tbase.call( this, idx );\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default iset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 contents of array-like value to a new array.\n*\n* @private\n* @param {ArrayLike} arr - input array\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var arr = [ 1.0, 2.0, 3.0 ];\n*\n* var out = copy( arr, arr.length );\n* // returns [ 1.0, 2.0, 3.0 ]\n*\n* var bool = ( arr === out );\n* // returns false\n*/\nfunction copy( arr, len ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( arr[ i ] );\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/* eslint-disable no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\nimport { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport { primitives as isIntegerArray } from '@stdlib/assert-is-integer-array';\nimport isFunction from '@stdlib/assert-is-function';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport isBufferLengthCompatible from '@stdlib/ndarray-base-assert-is-buffer-length-compatible';\nimport numel from '@stdlib/ndarray-base-numel';\nimport parent from '@stdlib/ndarray-base-ctor'; // eslint-disable-line stdlib/no-redeclare\nimport defaults from '@stdlib/ndarray-defaults';\nimport inherit from '@stdlib/utils-inherit';\nimport format from '@stdlib/string-format';\nimport iget from './iget.js';\nimport iset from './iset.js';\nimport get from './get.js';\nimport set from './set.js';\nimport copy from './copy_array.js';\nimport validate from './validate.js';\n\n\n// VARIABLES //\n\n/*\n* See the following references:\n*\n* - https://stackoverflow.com/questions/22747068/is-there-a-max-number-of-arguments-javascript-functions-can-accept\n* - https://bugs.webkit.org/show_bug.cgi?id=80797\n* - https://github.com/numpy/numpy/issues/5744\n*\n* Note that the maximum number of function arguments can vary from engine to engine. Here, we choose something of a lowest common denominator which may **not** be valid everywhere.\n*/\nvar MAX_DIMS = 32767|0;\n\nvar INDEX_MODE = defaults.get( 'index_mode' );\nvar READONLY = false;\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {Collection} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {Options} [options] - function options\n* @param {string} [options.mode=\"throw\"] - specifies how to handle indices which exceed array dimensions\n* @param {StringArray} [options.submode=[\"throw\"]] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis\n* @param {boolean} [options.readonly=false] - boolean indicating whether an array should be read-only\n* @throws {TypeError} `dtype` argument must be a supported ndarray data type\n* @throws {TypeError} `buffer` argument must be an array-like object, typed-array-like, or a Buffer\n* @throws {TypeError} `buffer` argument `get` and `set` properties must be functions\n* @throws {TypeError} `shape` argument must be an array-like object containing nonnegative integers\n* @throws {Error} `shape` argument length must equal the number of dimensions\n* @throws {TypeError} `strides` argument must be an array-like object containing integers\n* @throws {Error} `strides` argument length must equal the number of dimensions (except for zero-dimensional arrays; in which case, the `strides` argument length must be equal to `1`)\n* @throws {Error} for zero-dimensional ndarrays, the `strides` argument must contain a single element equal to `0`\n* @throws {TypeError} `offset` argument must be a nonnegative integer\n* @throws {TypeError} `order` argument must be a supported ndarray order\n* @throws {Error} `buffer` argument must be compatible with specified meta data\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {RangeError} too many dimensions\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order, options ) {\n\tvar ndims;\n\tvar opts;\n\tvar err;\n\tvar sh;\n\tvar st;\n\n\tif ( !(this instanceof ndarray) ) {\n\t\tif ( arguments.length < 7 ) {\n\t\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t\t}\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order, options ); // eslint-disable-line max-len\n\t}\n\tif ( !isDataType( dtype ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a supported ndarray data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( !isCollection( buffer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an array-like object, typed-array-like, or a Buffer. Value: `%s`.', buffer ) );\n\t} else if ( buffer.get && buffer.set && ( !isFunction( buffer.get ) || !isFunction( buffer.set ) ) ) { // eslint-disable-line max-len\n\t\tthrow new TypeError( format( 'invalid argument. Second argument `get` and `set` properties must be functions. Value: `%s`.', buffer ) );\n\t}\n\tif ( !isNonNegativeIntegerArray( shape ) ) {\n\t\tif ( !isCollection( shape) || shape.length > 0 ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array-like object containing nonnegative integers. Value: `%s`.', shape ) );\n\t\t}\n\t}\n\tndims = shape.length;\n\tif ( ndims > MAX_DIMS ) {\n\t\tthrow new RangeError( format( 'invalid argument. Number of dimensions must not exceed %u due to stack limits. Value: `%u`.', MAX_DIMS, ndims ) );\n\t}\n\tif ( !isIntegerArray( strides ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an array-like object containing integers. Value: `%s`.', strides ) );\n\t}\n\tif ( ndims > 0 ) {\n\t\tif ( strides.length !== ndims ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Fourth argument length must match the number of dimensions. Expected number of dimensions: `%u`. Strides length: `%u`.', ndims, strides.length ) );\n\t\t}\n\t} else if ( strides.length !== 1 ) {\n\t\tthrow new RangeError( 'invalid argument. Fourth argument length must be equal to 1 when creating a zero-dimensional ndarray.' );\n\t} else if ( strides[ 0 ] !== 0 ) {\n\t\tthrow new RangeError( format( 'invalid argument. Fourth argument must contain a single element equal to 0. Value: `%d`.', strides[ 0 ] ) );\n\t}\n\tif ( !isNonNegativeInteger( offset ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fifth argument must be a nonnegative integer. Value: `%s`.', offset ) );\n\t}\n\tif ( !isOrder( order ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Sixth argument must be a supported order. Value: `%s`.', order ) );\n\t}\n\tif ( ndims > 0 && !isBufferLengthCompatible( buffer.length, shape, strides, offset ) && numel( shape ) > 0 ) { // eslint-disable-line max-len\n\t\tthrow new Error( 'invalid arguments. Input buffer is incompatible with the specified meta data. Ensure that the offset is valid with regard to the strides array and that the buffer has enough elements to satisfy the desired array shape.' );\n\t}\n\topts = {};\n\topts.mode = INDEX_MODE;\n\topts.readonly = READONLY;\n\tif ( arguments.length > 6 ) {\n\t\terr = validate( opts, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tthis._mode = opts.mode;\n\tif ( opts.submode === void 0 ) {\n\t\topts.submode = [ this._mode ];\n\t}\n\tthis._submode = opts.submode;\n\n\t// Copy `shape` and `strides` to prevent external mutation:\n\tsh = copy( shape, ndims );\n\tst = copy( strides, ndims || 1 );\n\n\t// Call the parent constructor:\n\tparent.call( this, dtype, buffer, sh, st, offset, order );\n\tthis._flags.READONLY = opts.readonly;\n\n\treturn this;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n// Inherit from the parent constructor:\ninherit( ndarray, parent );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', get );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', iget );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', set );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', iset );\n\n\n// EXPORTS //\n\nexport default ndarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport minmax from '@stdlib/ndarray-base-minmax-view-buffer-index';\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a buffer length is compatible with provided ndarray meta data.\n*\n* @param {NonNegativeInteger} len - buffer length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {boolean} boolean indicating if a buffer length is compatible\n*\n* @example\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var bool = isBufferLengthCompatible( 4, shape, strides, offset );\n* // returns true\n*\n* @example\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var bool = isBufferLengthCompatible( 4, shape, strides, offset );\n* // returns false\n*/\nfunction isBufferLengthCompatible( len, shape, strides, offset ) {\n\t// Determine the minimum and maximum linear indices which are accessible by the array view:\n\tvar buf = minmax( shape, strides, offset );\n\n\t// If the indices are \"inbounds\", then the buffer length is compatible:\n\treturn ( buf[ 0 ] >= 0 && buf[ 1 ] < len );\n}\n\n\n// EXPORTS //\n\nexport default isBufferLengthCompatible;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArrayLikeObject from '@stdlib/assert-is-array-like-object';\nimport isIndexMode from '@stdlib/ndarray-base-assert-is-index-mode';\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions\n* @param {StringArray} [options.submode] - specifies how to handle subscripts which exceed array dimensions\n* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var options = {\n* 'mode': 'clamp',\n* 'submode': [ 'throw', 'wrap', 'clamp' ]\n* };\n* var err = validate( opts, options );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tvar i;\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'mode' ) ) {\n\t\topts.mode = options.mode;\n\t\tif ( !isIndexMode( opts.mode ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a recognized mode. Option: `%s`.', 'mode', opts.mode ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'submode' ) ) {\n\t\topts.submode = options.submode;\n\t\tif ( !isArrayLikeObject( opts.submode ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.', 'submode', opts.submode ) );\n\t\t}\n\t\tif ( opts.submode.length === 0 ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be an array containing recognized modes. Option: `%s`.', 'submode', opts.submode.join( ',' ) ) );\n\t\t}\n\t\tfor ( i = 0; i < opts.submode.length; i++ ) {\n\t\t\tif ( !isIndexMode( opts.submode[ i ] ) ) {\n\t\t\t\treturn new TypeError( format( 'invalid option. Each submode must be a recognized mode. Option: `%s`.', opts.submode[ i ] ) );\n\t\t\t}\n\t\t}\n\t\topts.submode = opts.submode.slice();\n\t}\n\tif ( hasOwnProp( options, 'readonly' ) ) {\n\t\topts.readonly = options.readonly;\n\t\tif ( !isBoolean( opts.readonly ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'readonly', opts.readonly ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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';\nimport format from '@stdlib/string-format';\nimport validate from './validate.js';\nimport createObject from './detect.js';\n\n\n// MAIN //\n\n/**\n* Implements prototypical inheritance by replacing the prototype of one constructor with the prototype of another constructor.\n*\n* ## Notes\n*\n* - This implementation is not designed to work with ES2015/ES6 classes. For ES2015/ES6 classes, use `class` with `extends`.\n* - For reference, see [node#3455](https://github.com/nodejs/node/pull/3455), [node#4179](https://github.com/nodejs/node/issues/4179), [node#3452](https://github.com/nodejs/node/issues/3452), and [node commit](https://github.com/nodejs/node/commit/29da8cf8d7ab8f66b9091ab22664067d4468461e#diff-3deb3f32958bb937ae05c6f3e4abbdf5).\n*\n* @param {(Object|Function)} ctor - constructor which will inherit\n* @param {(Object|Function)} superCtor - super (parent) constructor\n* @throws {TypeError} first argument must be either an object or a function which can inherit\n* @throws {TypeError} second argument must be either an object or a function from which a constructor can inherit\n* @throws {TypeError} second argument must have an inheritable prototype\n* @returns {(Object|Function)} child constructor\n*\n* @example\n* function Foo() {\n* return this;\n* }\n* Foo.prototype.beep = function beep() {\n* return 'boop';\n* };\n*\n* function Bar() {\n* Foo.call( this );\n* return this;\n* }\n* inherit( Bar, Foo );\n*\n* var bar = new Bar();\n* var v = bar.beep();\n* // returns 'boop'\n*/\nfunction inherit( ctor, superCtor ) {\n\tvar err = validate( ctor );\n\tif ( err ) {\n\t\tthrow err;\n\t}\n\terr = validate( superCtor );\n\tif ( err ) {\n\t\tthrow err;\n\t}\n\tif ( typeof superCtor.prototype === 'undefined' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must have a prototype from which another object can inherit. Value: `%s`.', superCtor.prototype ) );\n\t}\n\t// Create a prototype which inherits from the parent prototype:\n\tctor.prototype = createObject( superCtor.prototype );\n\n\t// Set the constructor to refer to the child constructor:\n\tdefineProperty( ctor.prototype, 'constructor', {\n\t\t'configurable': true,\n\t\t'enumerable': false,\n\t\t'writable': true,\n\t\t'value': ctor\n\t});\n\n\treturn ctor;\n}\n\n\n// EXPORTS //\n\nexport default inherit;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @throws {TypeError} provided indices must be integer valued\n* @throws {RangeError} index exceeds array dimensions\n* @throws {RangeError} number of indices must equal the number of dimensions\n* @returns {*} array element\n*/\nfunction get() {\n\tvar idx;\n\tvar ind;\n\tvar M;\n\tvar i;\n\n\tif ( arguments.length !== this._ndims ) {\n\t\tthrow new RangeError( format( 'invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.', this._ndims, arguments.length ) );\n\t}\n\tidx = this._offset;\n\tM = this._submode.length;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tif ( !isInteger( arguments[ i ] ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Indices must be integer valued. Argument: `%u`. Value: `%s`.', i, arguments[ i ] ) );\n\t\t}\n\t\tind = getIndex( arguments[ i ], this._shape[ i ]-1, this._submode[ i%M ] ); // eslint-disable-line max-len\n\t\tidx += this._strides[ i ] * ind;\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nexport default get;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport getIndex from '@stdlib/ndarray-base-ind';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @throws {Error} cannot write to a read-only array\n* @throws {TypeError} provided indices must be integer valued\n* @throws {RangeError} index exceeds array dimensions\n* @throws {RangeError} number of indices must equal the number of dimensions\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\tvar idx;\n\tvar ind;\n\tvar M;\n\tvar i;\n\n\tif ( this._flags.READONLY ) {\n\t\tthrow new Error( 'invalid invocation. Cannot write to a read-only array.' );\n\t}\n\tif ( arguments.length !== this._ndims+1 ) {\n\t\tthrow new RangeError( format( 'invalid arguments. Number of indices must match the number of dimensions. ndims: `%u`. nargs: `%u`.', this._ndims, arguments.length ) );\n\t}\n\tidx = this._offset;\n\tM = this._submode.length;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tif ( !isInteger( arguments[ i ] ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Indices must be integer valued. Argument: `%i`. Value: `%s`.', i, arguments[ i ] ) );\n\t\t}\n\t\tind = getIndex( arguments[ i ], this._shape[ i ]-1, this._submode[ i%M ] ); // eslint-disable-line max-len\n\t\tidx += this._strides[ i ] * ind;\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default set;\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 no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport { primitives as isNonNegativeIntegerArray } from '@stdlib/assert-is-nonnegative-integer-array';\nimport isEmptyCollection from '@stdlib/assert-is-empty-collection';\nimport isndarrayLike from '@stdlib/assert-is-ndarray-like';\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isFunction from '@stdlib/assert-is-function';\nimport isComplexLike from '@stdlib/assert-is-complex-like';\nimport isPlainObject from '@stdlib/assert-is-plain-object';\nimport isObject from '@stdlib/assert-is-object';\nimport isCollection from '@stdlib/assert-is-collection';\nimport isDataType from '@stdlib/ndarray-base-assert-is-data-type';\nimport isEqualDataType from '@stdlib/ndarray-base-assert-is-equal-data-type';\nimport isOutputDataTypePolicy from '@stdlib/ndarray-base-assert-is-output-data-type-policy';\nimport isReadOnly from '@stdlib/ndarray-base-assert-is-read-only';\nimport isOrder from '@stdlib/ndarray-base-assert-is-order';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport filledBy from '@stdlib/array-base-filled-by';\nimport everyBy from '@stdlib/array-base-every-by';\nimport join from '@stdlib/array-base-join';\nimport copy from '@stdlib/array-base-copy';\nimport nullaryStrided from '@stdlib/strided-base-nullary';\nimport binary from '@stdlib/ndarray-base-binary';\nimport broadcast from '@stdlib/ndarray-base-maybe-broadcast-array';\nimport broadcastScalar from '@stdlib/ndarray-base-broadcast-scalar';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport dtypes2strings from '@stdlib/ndarray-base-dtypes2strings';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport binaryOutputDataType from '@stdlib/ndarray-base-binary-output-dtype';\nimport numel from '@stdlib/ndarray-base-numel';\nimport buffer from '@stdlib/ndarray-base-buffer';\nimport getShape from '@stdlib/ndarray-shape';\nimport getDType from '@stdlib/ndarray-dtype';\nimport getOrder from '@stdlib/ndarray-order';\nimport ndims from '@stdlib/ndarray-ndims';\nimport ndarray from '@stdlib/ndarray-ctor';\nimport defaults from '@stdlib/ndarray-defaults';\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport setter from '@stdlib/array-base-setter';\nimport format from '@stdlib/error-tools-fmtprodmsg';\nimport validate from './validate.js';\n\n\n// VARIABLES //\n\nvar ORDINALS = [ 'First', 'Second', 'Third' ];\n\n\n// FUNCTIONS //\n\n/**\n* Performs an initial scan of a list of parameters.\n*\n* @private\n* @param {Array} params - list of parameters\n* @returns {Array} scan results\n*/\nfunction initialScan( params ) {\n\tvar out;\n\tvar p;\n\tvar o;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\to = {\n\t\t\t'scalar': true,\n\t\t\t'value': p,\n\t\t\t'dtype': '',\n\t\t\t'ndims': 0,\n\t\t\t'order': ''\n\t\t};\n\t\tif ( isNumber( p ) ) {\n\t\t\to.dtype = 'float64';\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\to.dtype = 'complex64';\n\t\t\t} else {\n\t\t\t\to.dtype = 'complex128';\n\t\t\t}\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\to.scalar = false;\n\t\t\to.dtype = resolveStr( getDType( p ) );\n\t\t\to.ndims = ndims( p );\n\t\t\to.order = getOrder( p );\n\t\t} else {\n\t\t\to.dtype = 'generic';\n\t\t}\n\t\tout.push( o );\n\t}\n\treturn out;\n}\n\n/**\n* Checks whether all parameters are scalar compatible.\n*\n* ## Notes\n*\n* - A parameter is scalar compatible if, and only if, the parameter value is either a zero-dimensional ndarray or already a scalar value.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {boolean} boolean indicating whether all parameters are scalar compatible\n*/\nfunction isScalarCompatible( params ) {\n\tvar count;\n\tvar p;\n\tvar i;\n\n\tcount = 0;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar || p.ndims === 0 ) {\n\t\t\tcount += 1;\n\t\t}\n\t}\n\treturn ( count === params.length );\n}\n\n/**\n* Converts a list of parameters to scalar values.\n*\n* ## Notes\n*\n* - The function **mutates** the input array by updating parameter objects which do not already correspond to scalar parameter values.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction convertToScalars( params ) {\n\tvar p;\n\tvar i;\n\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar === false ) {\n\t\t\tp.scalar = true;\n\t\t\tp.value = p.value.get();\n\t\t\tp.ndims = 0;\n\t\t\tp.order = '';\n\t\t}\n\t}\n\treturn params;\n}\n\n/**\n* Resolves a common memory layout from a list of parameter objects.\n*\n* @private\n* @param {Array} params - list of parameter objects\n* @returns {string} memory layout\n*/\nfunction resolveOrder( params ) {\n\tvar p;\n\tvar i;\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// For a binary parameter function, we simply return the layout of the first parameter having a layout, as there is no clear rationale for picking the layout of one parameter over another and picking the first one we find is as good a rationale as any other...\n\t\tif ( p.scalar === false ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn p.order;\n}\n\n/**\n* Broadcasts parameter values to an ndarray having a specified shape.\n*\n* ## Notes\n*\n* - The function **mutates** the input array.\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Array} params - list of parameter objects\n* @returns {Array} updated list\n*/\nfunction broadcastParameters( shape, params ) {\n\tvar ord;\n\tvar p;\n\tvar i;\n\n\tord = resolveOrder( params );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\t\tif ( p.scalar ) {\n\t\t\tp.scalar = false;\n\t\t\tp.value = broadcastScalar( p.value, p.dtype, shape, ord );\n\t\t\tp.order = ord;\n\t\t} else {\n\t\t\tp.value = broadcast( p.value, shape ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t}\n\t\tp.ndims = shape.length;\n\t}\n\treturn params;\n}\n\n\n// MAIN //\n\n/**\n* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG.\n*\n* @constructor\n* @param {Function} prng - binary pseudorandom value generator\n* @param {ArrayLikeObject} idtypes - list containing a list of supported input data types for each PRNG parameter\n* @param {ArrayLikeObject} odtypes - list of supported output data types\n* @param {Object} policies - policies\n* @param {string} policies.output - output data type policy\n* @param {Object} [options] - function options\n* @param {string} [options.order] - default memory layout\n* @throws {TypeError} first argument must be a function\n* @throws {TypeError} second argument must be an array containing arrays of supported data types\n* @throws {TypeError} third argument must be an array of supported data types\n* @throws {TypeError} fourth argument must be an object having supported policies\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Random} instance\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import ndzeros from '@stdlib/ndarray-zeros';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nfunction Random( prng, idtypes, odtypes, policies, options ) {\n\tvar opts;\n\tvar dt;\n\tvar i;\n\tif ( !( this instanceof Random ) ) {\n\t\tif ( arguments.length < 5 ) {\n\t\t\treturn new Random( prng, idtypes, odtypes, policies );\n\t\t}\n\t\treturn new Random( prng, idtypes, odtypes, policies, options );\n\t}\n\tif ( !isFunction( prng ) ) {\n\t\tthrow new TypeError( format( 'null3c', prng ) );\n\t}\n\tif ( !isCollection( idtypes ) ) {\n\t\tthrow new TypeError( format( 'null2y', idtypes ) );\n\t}\n\tidtypes = copy( idtypes );\n\tfor ( i = 0; i < idtypes.length; i++ ) {\n\t\tdt = idtypes[ i ];\n\t\tif (\n\t\t\t!isCollection( dt ) ||\n\t\t\tdt.length < 1 ||\n\t\t\t!everyBy( dt, isDataType )\n\t\t) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must contain arrays of data types. Value: `%s`.', idtypes ) );\n\t\t}\n\t\tidtypes[ i ] = dtypes2strings( dt );\n\t}\n\tif (\n\t\t!isCollection( odtypes ) ||\n\t\todtypes.length < 1 ||\n\t\t!everyBy( odtypes, isDataType )\n\t) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array of data types. Value: `%s`.', odtypes ) );\n\t}\n\todtypes = dtypes2strings( odtypes );\n\n\tif ( !isObject( policies ) ) {\n\t\tthrow new TypeError( format( 'null43', policies ) );\n\t}\n\tif ( !isOutputDataTypePolicy( policies.output ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be an object having a supported output data type policy. Value: `%s`.', policies.output ) );\n\t}\n\topts = {\n\t\t'order': defaults.get( 'order' )\n\t};\n\tif ( arguments.length > 4 ) {\n\t\tif ( !isPlainObject( options ) ) {\n\t\t\tthrow new TypeError( format( 'null2V', options ) );\n\t\t}\n\t\tif ( hasOwnProp( options, 'order' ) ) {\n\t\t\topts.order = options.order;\n\t\t\tif ( !isOrder( opts.order ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a valid memory layout. Option: `%s`.', 'order', opts.order ) );\n\t\t\t}\n\t\t}\n\t}\n\tthis._prng = prng;\n\tthis._idtypes = idtypes;\n\tthis._odtypes = odtypes;\n\tthis._policies = {\n\t\t'output': policies.output\n\t};\n\tthis._opts = opts;\n\treturn this;\n}\n\n/**\n* Returns an ndarray filled with pseudorandom values drawn from a binary PRNG.\n*\n* @name generate\n* @memberof Random.prototype\n* @type {Function}\n* @param {NonNegativeIntegerArray} shape - output shape\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {Options} [options] - function options\n* @param {*} [options.dtype] - output ndarray data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed ndarray dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed ndarray dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an ndarray should be read-only\n* @throws {TypeError} first argument must be a valid shape\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the desired shape must be broadcast compatible\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {ndarray} output ndarray\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 );\n* // returns \n*/\nsetReadOnly( Random.prototype, 'generate', function generate( shape, param1, param2, options ) {\n\tvar params;\n\tvar prng;\n\tvar opts;\n\tvar buf;\n\tvar err;\n\tvar len;\n\tvar ord;\n\tvar FLG;\n\tvar out;\n\tvar set;\n\tvar dt;\n\tvar st;\n\tvar p1;\n\tvar p2;\n\tvar i;\n\n\tif ( !isNonNegativeIntegerArray( shape ) && !isEmptyCollection( shape ) ) {\n\t\tthrow new TypeError( format( 'null5o', shape ) );\n\t}\n\topts = {};\n\tif ( arguments.length > 3 ) {\n\t\terr = validate( opts, this._odtypes, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tparams = initialScan( [ param1, param2 ] );\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tdt = params[ i ].dtype;\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( dt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i+1 ], join( this._idtypes[ i ], '\", \"' ), dt ) );\n\t\t}\n\t}\n\tFLG = isScalarCompatible( params );\n\tif ( FLG ) {\n\t\tparams = convertToScalars( params );\n\t} else {\n\t\tparams = broadcastParameters( shape, params );\n\t}\n\tp1 = params[ 0 ];\n\tp2 = params[ 1 ];\n\tprng = this._prng;\n\tdt = opts.dtype || binaryOutputDataType( p1.dtype, p2.dtype, this._policies.output ); // eslint-disable-line max-len\n\tif ( opts.order ) {\n\t\tord = opts.order;\n\t} else if ( FLG ) {\n\t\tord = this._opts.order;\n\t} else {\n\t\t// If we don't have any explicit order info, use the order of the first parameter, as no clear rationale for choosing the order of one parameter over another:\n\t\tord = p1.order;\n\t}\n\t// Handles special cases involving (1) zero-dimensional output ndarrays and (2) shapes having at least one dimension of size zero...\n\tlen = numel( shape );\n\tif ( len === 0 ) {\n\t\t// Check for a zero-dimensional shape...\n\t\tif ( shape.length === 0 ) {\n\t\t\t// If the output array is a zero-dimensional ndarray, we generate a single random variate...\n\t\t\tbuf = buffer( dt, 1 );\n\t\t\tif ( isAccessorArray( buf ) ) {\n\t\t\t\tset = accessorSetter( dt );\n\t\t\t} else {\n\t\t\t\tset = setter( dt );\n\t\t\t}\n\t\t\tset( buf, 0, prng( p1.value, p2.value ) );\n\t\t\tst = [ 0 ];\n\t\t} else {\n\t\t\t// If the output array has one or more dimensions of size zero, we avoid allocating any memory, and instead return an empty ndarray...\n\t\t\tbuf = buffer( dt, len );\n\t\t\tst = shape2strides( shape, ord );\n\t\t}\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// If provided scalar PRNG parameters, we can simply fill a linear buffer with pseudorandom values (as all pseudorandom values are drawn from the same PRNG) and then wrap as an ndarray...\n\tif ( FLG ) {\n\t\tif ( isEqualDataType( dt, 'generic' ) ) {\n\t\t\tbuf = filledBy( len, wrapper );\n\t\t} else {\n\t\t\tbuf = buffer( dt, len );\n\t\t\tnullaryStrided( [ buf ], [ len ], [ 1 ], wrapper );\n\t\t}\n\t\tst = shape2strides( shape, ord );\n\t\treturn new ndarray( dt, buf, shape, st, 0, ord, opts );\n\t}\n\t// We've been provided ndarrays, so we need to perform element-wise iteration...\n\n\t// Allocate a data buffer:\n\tbuf = buffer( dt, len );\n\n\t// Initialize the output array:\n\tst = shape2strides( shape, ord );\n\tout = new ndarray( dt, buf, shape, st, 0, ord, opts );\n\n\t// Fill the output array with pseudorandom values:\n\tbinary( [ p1.value, p2.value, out ], prng );\n\n\treturn out;\n\n\t/**\n\t* Applies parameters to a pseudorandom number generator function.\n\t*\n\t* @private\n\t* @returns {(number|ComplexLike)} pseudorandom number\n\t*/\n\tfunction wrapper() {\n\t\treturn prng( p1.value, p2.value );\n\t}\n});\n\n/**\n* Fills an ndarray with pseudorandom values drawn from a binary PRNG.\n*\n* @name assign\n* @memberof Random.prototype\n* @type {Function}\n* @param {(ndarrayLike|*)} param1 - first PRNG parameter\n* @param {(ndarrayLike|*)} param2 - second PRNG parameter\n* @param {ndarrayLike} out - output ndarray\n* @throws {TypeError} third argument must be an ndarray\n* @throws {TypeError} must provide valid PRNG parameters\n* @throws {TypeError} PRNG parameters and the output ndarray must be broadcast compatible\n* @throws {Error} cannot write to a read-only ndarray\n* @returns {ndarray} output ndarray\n*\n* @example\n* import dtypes from '@stdlib/ndarray-dtypes';\n* import ndzeros from '@stdlib/ndarray-zeros';\n* import uniform from '@stdlib/random-base-uniform';\n*\n* var idt = dtypes( 'real_and_generic' );\n* var odt = dtypes( 'real_floating_point_and_generic' );\n*\n* var policies = {\n* 'output': 'real_floating_point_and_generic'\n* };\n* var options = {\n* 'order': 'row-major'\n* };\n*\n* var rand = new Random( uniform, [ idt, idt ], odt, policies, options );\n*\n* var out = ndzeros( [ 2, 2 ] );\n* var v = rand.assign( 0.0, 1.0, out );\n* // returns \n*\n* var bool = ( v === out );\n* // returns true\n*/\nsetReadOnly( Random.prototype, 'assign', function assign( param1, param2, out ) {\n\tvar params;\n\tvar pdt;\n\tvar odt;\n\tvar ord;\n\tvar sh;\n\tvar p;\n\tvar i;\n\n\tif ( !isndarrayLike( out ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an ndarray-like object. Value: `%s`.', out ) );\n\t}\n\tif ( isReadOnly( out ) ) {\n\t\tthrow new Error( format('null1g') );\n\t}\n\tsh = getShape( out );\n\tord = getOrder( out );\n\todt = getDType( out );\n\tif ( !contains( this._odtypes, resolveStr( odt ) ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ 2 ], join( this._odtypes, '\", \"' ), odt ) );\n\t}\n\tparams = [ param1, param2 ];\n\tfor ( i = 0; i < params.length; i++ ) {\n\t\tp = params[ i ];\n\n\t\t// Check whether we've been provided a scalar PRNG parameter...\n\t\tif ( isNumber( p ) ) {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'float64';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isComplexLike( p ) ) {\n\t\t\tif ( p.byteLength === 8 ) {\n\t\t\t\tpdt = 'complex64';\n\t\t\t} else {\n\t\t\t\tpdt = 'complex128';\n\t\t\t}\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t} else if ( isndarrayLike( p ) ) {\n\t\t\t// Broadcast the PRNG parameter to the desired shape:\n\t\t\tpdt = getDType( p );\n\t\t\tp = broadcast( p, sh ); // delegate to `broadcast` to ensure broadcast compatibility\n\t\t} else {\n\t\t\t// Wrap the scalar in a broadcasted ndarray:\n\t\t\tpdt = 'generic';\n\t\t\tp = broadcastScalar( p, pdt, sh, ord );\n\t\t}\n\t\tif ( !contains( this._idtypes[ i ], resolveStr( pdt ) ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. %s argument must have one of the following data types: \"%s\". Data type: `%s`.', ORDINALS[ i ], join( this._idtypes[ i ], '\", \"' ), pdt ) );\n\t\t}\n\t\tparams[ i ] = p;\n\t}\n\t// Fill the output array with pseudorandom values:\n\tparams.push( out );\n\tbinary( params, this._prng );\n\n\treturn out;\n});\n\n\n// EXPORTS //\n\nexport default Random;\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 resolveGetter from '@stdlib/array-base-resolve-getter';\n\n\n// MAIN //\n\n/**\n* Copies the elements of an 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 get;\n\tvar i;\n\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( x );\n\n\t// Get the number of elements to copy:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( get( x, i ) ); // 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) 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* Tests if a value is an empty collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an empty collection\n*\n* @example\n* var bool = isEmptyCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isEmptyCollection( { 'length': 0 } );\n* // returns true\n*\n* @example\n* var bool = isEmptyCollection( [ 1, 2, 3 ] );\n* // returns false\n*\n* @example\n* var bool = isEmptyCollection( {} );\n* // returns false\n*/\nfunction isEmptyCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.length === 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isEmptyCollection;\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 isObject from '@stdlib/assert-is-plain-object';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport contains from '@stdlib/array-base-assert-contains';\nimport join from '@stdlib/array-base-join';\nimport resolveStr from '@stdlib/ndarray-base-dtype-resolve-str';\nimport format from '@stdlib/error-tools-fmtprodmsg';\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Array} dtypes - list of supported output data types\n* @param {Options} options - function options\n* @param {*} [options.dtype] - array data type\n* @param {string} [options.order] - memory layout (either row-major or column-major)\n* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions\n* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis\n* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var dtypes = [ 'float64', 'float32', 'generic' ];\n*\n* var options = {\n* 'dtype': 'float64'\n* };\n* var err = validate( opts, dtypes, options );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( opts, dtypes, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'null2V', options ) );\n\t}\n\tif ( hasOwnProp( options, 'dtype' ) ) {\n\t\topts.dtype = resolveStr( options.dtype );\n\t\tif ( !contains( dtypes, opts.dtype ) ) {\n\t\t\treturn new TypeError( format( 'null4S', 'dtype', join( dtypes, '\", \"' ), options.dtype ) );\n\t\t}\n\t}\n\t// Pass-through options...\n\tif ( hasOwnProp( options, 'order' ) ) {\n\t\topts.order = options.order;\n\t}\n\tif ( hasOwnProp( options, 'mode' ) ) {\n\t\topts.mode = options.mode;\n\t}\n\tif ( hasOwnProp( options, 'submode' ) ) {\n\t\topts.submode = options.submode;\n\t}\n\tif ( hasOwnProp( options, 'readonly' ) ) {\n\t\topts.readonly = options.readonly;\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default validate;\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 isDataTypeString from '@stdlib/ndarray-base-assert-is-data-type-string';\nimport isDataTypeObject from '@stdlib/ndarray-base-assert-is-data-type-object';\nimport isStructDataType from '@stdlib/ndarray-base-assert-is-struct-data-type';\n\n\n// MAIN //\n\n/**\n* Tests whether two values are equal ndarray data types.\n*\n* @param {*} v1 - first input value\n* @param {*} v2 - second input value\n* @returns {boolean} boolean indicating whether two input values are equal ndarray data types\n*\n* @example\n* import DataType from '@stdlib/ndarray-dtype-ctor';\n*\n* var bool = isEqualDataType( 'binary', 'binary' );\n* // returns true\n*\n* bool = isEqualDataType( 'float32', 'float32' );\n* // returns true\n*\n* bool = isEqualDataType( 'float64', new DataType( 'float64' ) );\n* // returns true\n*\n* bool = isEqualDataType( 'generic', new DataType( 'generic' ) );\n* // returns true\n*\n* bool = isEqualDataType( 'int16', 'int32' );\n* // returns false\n*\n* bool = isEqualDataType( 'int32', new DataType( 'int16' ) );\n* // returns false\n*/\nfunction isEqualDataType( v1, v2 ) {\n\tif ( isDataTypeString( v1 ) ) {\n\t\t// Nothing to do here. Branch is kept to avoid additional assertion logic for what is expected to be a common use case; namely, comparing data type strings...\n\t} else if ( isDataTypeObject( v1 ) ) {\n\t\tv1 = String( v1 );\n\t} else if ( isStructDataType( v1 ) ) {\n\t\tv1 = v1.layout;\n\t} else {\n\t\treturn false;\n\t}\n\tif ( isDataTypeString( v2 ) ) {\n\t\t// Nothing to do here. Branch is kept to avoid additional assertion logic for what is expected to be a common use case; namely, comparing data type strings...\n\t} else if ( isDataTypeObject( v2 ) ) {\n\t\tv2 = String( v2 );\n\t} else if ( isStructDataType( v2 ) ) {\n\t\tv2 = v2.layout;\n\t} else {\n\t\treturn false;\n\t}\n\treturn ( v1 === v2 );\n}\n\n\n// EXPORTS //\n\nexport default isEqualDataType;\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 filled \"generic\" array according to a provided callback function.\n*\n* @param {NonNegativeInteger} len - array length\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* import constantFunction from '@stdlib/utils-constant-function';\n*\n* var out = filledBy( 3, constantFunction( 'beep' ) );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filledBy( len, clbk, thisArg ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( clbk.call( thisArg, i ) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nexport default filledBy;\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 flag from '@stdlib/ndarray-base-flag';\n\n\n// MAIN //\n\n/**\n* Tests whether an ndarray is read-only.\n*\n* @param {ndarray} arr - input ndarray\n* @returns {boolean} boolean indicating whether an ndarray is read-only\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ 1, 2, 3, 4 ], {\n* 'readonly': true\n* });\n* var bool = isReadOnly( x );\n* // returns true\n*\n* x = array( [ 1, 2, 3, 4 ] );\n* bool = isReadOnly( x );\n* // returns false\n*/\nfunction isReadOnly( arr ) {\n\treturn ( flag( arr, 'READONLY' ) === true );\n}\n\n\n// EXPORTS //\n\nexport default isReadOnly;\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 isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\nimport isCollection from '@stdlib/assert-is-collection';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @throws {TypeError} must provide an ndarray\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ) );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x ) {\n\tvar out;\n\tvar sh;\n\tvar d;\n\tvar i;\n\n\t// Note: we intentionally avoid rigorous ndarray checks to minimize performance impacts. This obviously means that non-ndarray-like objects can sneak through, but this is likely all right for the purposes of this function...\n\tif ( typeof x !== 'object' || x === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\tsh = x.shape;\n\tif ( !isCollection( sh ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t}\n\t// Copy the shape in order to avoid unintended mutation...\n\tout = [];\n\tfor ( i = 0; i < sh.length; i++ ) {\n\t\td = sh[ i ];\n\t\tif ( !isNonNegativeInteger( d ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an ndarray. Value: `%s`.', x ) );\n\t\t}\n\t\tout.push( d );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n"],"names":["main","Object","defineProperty","isNumber","value","zeros","n","i","out","zeroPad","str","width","right","negative","pad","length","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","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","main$g","Number","test","isPrimitive","isObject","setReadOnly","FLOAT64_PINF","POSITIVE_INFINITY","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","x","PINF","NINF","isInt","valueOf","isNonNegativeInteger","MAX_ARRAY_LENGTH","arraylikefcn","predicate","len","MAX_LENGTH","isArrayLike","isPrimitiveArray","arrayfun","isObjectArray","isNonNegativeIntegerArray","isBoolean","Bool","Boolean","self","window","global","globalThis","getGlobal","codegen","Function","GlobalThis","Self","Win","Global","hasBigIntSupport","BigInt","setNonEnumerableReadOnlyAccessor","getter","isString","isPositiveInteger","keys","bool","isArguments","bool$e","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","main$f","UINT32_MAX","isArguments$1","arrayfcn","isObjectLike","MAX_TYPED_ARRAY_LENGTH","isCollection","arr","searchElement","fromIndex","root","nodeList","document","childNodes","typedarray","Int8Array","reFunctionName","RE_FUNCTION_NAME","isBuffer","_isBuffer","constructor","constructorName","name","ctor","REGEXP","ctorName","type","isConstructorPrototype","w","hasAutomationEqualityBug","k","typeOf","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","main$d","isFunction","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","opts","val","allowDupes","duplicates","objectKeys","objectInverse","int8","uint8","uint8c","int16","uint16","int32","uint32","int64","uint64","float16","float32","float64","complex32","complex64","complex128","binary","generic","notype","userdefined_type","enum2str","dtype","bytesPerElement","BYTES_PER_ELEMENT","byteLength","iterationOrder","strides","cnt","strides2order","column","ndims","row","s1","s2","TYPE","isAccessorArray","GETTERS","idx","default","SETTERS","setter","ctor2dtypes","Float32Array","Float64Array","Int16Array","Int32Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasFloat64Array","hasFloat64ArraySupport","GlobalFloat64Array","NaN","Float64Array$1","hasFloat32Array","GlobalFloat32Array","hasFloat32ArraySupport","Float32Array$1","hasUint32Array","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","INT32_MAX","INT32_MIN","GlobalInt32Array","hasInt32ArraySupport","Int32Array$1","hasUint16Array","UINT16_MAX","GlobalUint16Array","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","INT16_MAX","INT16_MIN","GlobalInt16Array","hasInt16ArraySupport","Int16Array$1","hasUint8Array","UINT8_MAX","GlobalUint8Array","hasUint8ArraySupport","Uint8Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","INT8_MAX","INT8_MIN","GlobalInt8Array","hasInt8ArraySupport","Int8Array$1","isArrayLikeObject","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isStringArray","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","isComplex64Array","isComplex128Array","hasIteratorSymbolSupport","iterator","IteratorSymbol","z","reinterpret","offset","buffer","byteOffset","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","accessorGetter","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","separator","sep","join","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","a","b","CTORS","DTYPES","NTYPES","ctor2dtype","arraylike2object","dt","data","accessorProtocol","accessors","accessorSetter","arraySlice","method","hasMethod","isColumnMajorContiguous","order","contiguous","isRowMajorContiguous","minmaxViewBufferIndex","shape","min","max","s","isColumnMajorString","RE_CHARS","RegExp","isRegExp","search","newval","rescape","uint16view","ctors","IS_LITTLE_ENDIAN","view","GlobalArrayBuffer","isView","hasArrayBufferSupport","ArrayBuffer$1","hasDataView","DataView","isDataView","GlobalDataView","getFloat64","setFloat64","hasDataViewSupport","DataView$1","BigInteger","orders","ORDERS","enumerated","DATA","enumeration","LAYOUTS","modes","MODES","throw","clamp","wrap","normalize","LOW_MASK","TWO_32","BYTES","VIEW","float64ToInt64Bytes","stride","hi","lo","setUint32","bytes","assign","ndarray","nbytes","ord","_byteLength","_bytesPerElement","_dtype","_ndims","_offset","_order","_shape","_strides","_accessors","_iterationOrder","isContiguous","_flags","ROW_MAJOR_CONTIGUOUS","COLUMN_MAJOR_CONTIGUOUS","READONLY","__meta_dataview__","isndarrayLike","contains","factory","copyFlags","ind","isColumnMajor","iget","flgs","sh","st","sm","m","o","M","_mode","_submode","setInt8","setInt16","setBigInt64","setInt32","RE_SUFFIX","dtypeStrings","kind","all","isDataTypeString","dtypes","hasProp","isStructConstructorLike","alignment","byteLengthOf","byteOffsetOf","bufferOf","isStruct","viewOf","TABLE","ENUM","str2enum","resolve","t","layout","DataType","char","description","byteOrder","isDataType","bfloat16","float128","int128","int256","uint128","uint256","dtype2desc","dtype2char","enum","resolveEnum","dtype2alignment","isDataTypeObject","isStructDataType","_alignment","_byteOrder","_char","_description","_enum","_value","_type","policies","POLICIES","same","promoted","accumulation","boolean","boolean_and_generic","signed_integer","signed_integer_and_generic","unsigned_integer","unsigned_integer_and_generic","integer","integer_and_generic","floating_point","floating_point_and_generic","real_floating_point","real_floating_point_and_generic","complex_floating_point","complex_floating_point_and_generic","real_and_generic","numeric","numeric_and_generic","integer_index","integer_index_and_generic","boolean_index","boolean_index_and_generic","mask_index","mask_index_and_generic","default_index","source","isOutputDataTypePolicy","getOwnPropertySymbols","propertySymbols","enumerableProperties","isEnumerable","hasObjectAssign","to","assign$3","copy","isOrder","everyBy","every","internal","stride2offset","isUndefinedOrNull","gjoin","strideX","offsetX","ix","xbuf","strided","resolveGetter","nullary","arrays","offsets","sx","xset","numel","copyIndexed","shape2strides","columnmajor","rowmajor","ROW_MAJOR","strides2offset","COLUMN_MAJOR","ndarraylike2object","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","anyIsEntryIn","indexed","zeroTo","complex","take","indices","binaryLoopOrder","sy","sz","y","avx","iy","jx","jy","vx","vy","ux","sort2ins","loopOrder","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","binaryBlockSize","dtypeX","dtypeY","dtypeZ","nb","blockSize","vind2bind","mode","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","xmmv","ymmv","zmmv","shx","shy","shz","iox","ioy","ioz","ns","d","ndarray2object","ordx","ordy","ordz","accessorbinarynd","binarynd","filled","broadcastArray","dim","maybeBroadcastArray","broadcast","isComplexFloatingPointDataType","isProtoOf","gcopy","strideY","offsetY","PRIVATE_BUFFER","CTOR_NAME","setNonEnumerableReadWriteAccessor","setReadOnlyAccessor","setReadWriteAccessor","DATA_VIEW_METHODS","table","DEFAULT_CTOR","CMPLX_TO_REAL","getComplex","DEFAULTS","HASH","DEFAULT_DTYPE","reinterpretBoolean","isStructType","getStructArray","getTypedArray","getBigInt","getBoolean","getStruct","isRealFloatingPointDataType","isSignedIntegerDataType","isBigInt","isSymbol","constantFunction","hasBigInts","polyfill","ntypes","dt1","dt2","SAFE_CASTS","generateFullTable","generateTable","safeCasts","CASTS","casts","SAME_KIND_CASTS","sameKindCasts","isAllowedCast","from","casting","resolveStr","isSafeCast","isMostlySafeCast","isSameKindCast","FLOAT32_SMALLEST_SUBNORMAL","FLOAT32_MAX_SAFE_INTEGER","FLOAT32_MIN_SAFE_INTEGER","minFloatDataType","minDataType","boolean2number","bigint2number","setNumber","minSignedIntegerDataType","complexDType","castingMode","number2boolean","complex2boolean","setBoolean","bigint2boolean","setBigInt","boolean2bigint","isStructInstance","isBooleanDataType","isRealDataType","gfill","alpha","xobj","yobj","xdata","ydata","yset","io","map","complex2number","views","dest","setStructArray","isComplexDataType","reinterpretComplex","setTypedArray","setComplex","setStruct","FIELD_PROPERTIES","isUnionType","fields","isValidBoolean","ALIGNMENTS","MANDATORY_FIELD_NAMES","VALIDATORS","padding","hasProperties","JSON","stringify","normalizeUnion","dflg","normalizeField","resolveAlignment","fieldIndex","names","setPadding","replacer","p1","layoutFormat","FORMATS","isFormat","Struct","fmt0","fmt1","fmt2","bfmt","ufmt","fmt","ib","c0","c1","c2","w1","linearFormat","foo","isFunctionNameSupported","TypedArray","Dummy","fcnName","hasHasInstanceSymbolSupport","hasInstance","HasInstanceSymbol","hasSupport","instanceOf","typeName","typedarray2json","NAMES","isTypedArray","isComplexTypedArray","FIELD_NAMES","BYTE_LENGTH","PARTITIONS","ALIGNMENT","ACCESSORS","FIELDS","o1","fieldNames","cache","byteOffsets","flatten","partitions","createPrototypeAccessors","struct2string","struct","toJSON","struct2json","bbytes","sview","LAYOUT","structFactory","StructArray","_byteOffset","isStructArray","Buffer","require$$0","GlobalBuffer","hasNodeBufferSupport","Buffer$1","notImplemented","CACHE","allocUnsafe$1","allocUnsafe","size","fill","bufferCtors","broadcastScalar","dtypes2strings","isFloatingPointDataType","isIntegerDataType","isUnsignedIntegerDataType","isNumericDataType","isIntegerIndexDataType","isBooleanIndexDataType","isMaskIndexDataType","promotionRules","dtype1","dtype2","PROMOTION_RULES","promoteDataTypes","index_mode","DEFAULT_INDEX_DTYPE","DEFAULT_SIGNED_INTEGER_DTYPE","DEFAULT_UNSIGNED_INTEGER_DTYPE","DEFAULT_REAL_FLOATING_POINT_DTYPE","DEFAULT_COMPLEX_FLOATING_POINT_DTYPE","POLICY_TABLE1","promotedPolicy","POLICY_TABLE2","resolveDefaultRealFloatingPoint","resolveDefaultComplexFloatingPoint","COMPLEX2FLOAT","FLOAT2COMPLEX","xdtype","ydtype","policy","outputDataType","isIntegerArray","validate","create","Ctor","createObject$1","clampIndex","wrapIndex","mp1","normalizeIndex","isIndexMode","parent","iset","INDEX_MODE","minmax","isBufferLengthCompatible","readonly","submode","fmtprodmsg","u","encodeURIComponent","superCtor","createObject","inherit","getIndex","ORDINALS","Random","prng","idtypes","odtypes","output","_prng","_idtypes","_odtypes","_policies","_opts","param1","param2","params","p2","scalar","initialScan","count","isScalarCompatible","convertToScalars","resolveOrder","broadcastParameters","binaryOutputDataType","v1","v2","isEqualDataType","nullaryStrided","wrapper","filledBy","pdt","odt"],"mappings":";gRAsBA,IAAIA,EAA0C,mBAA1BC,OAAOC,eAAkCD,OAAOC,eAAiB,KCiCrF,IAAIA,EAAiBD,OAAOC,eCjB5B,SAASC,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCAA,SAASC,EAAOC,GACf,IACIC,EADAC,EAAM,GAEV,IAAMD,EAAI,EAAGA,EAAID,EAAGC,IACnBC,GAAO,IAER,OAAOA,CACR,CAcA,SAASC,EAASC,EAAKC,EAAOC,GAC7B,IAAIC,GAAW,EACXC,EAAMH,EAAQD,EAAIK,OACtB,OAAKD,EAAM,IAnCZ,SAA0BJ,GACzB,MAAoB,MAAbA,EAAK,EACb,CAoCMM,CAAiBN,KACrBG,GAAW,EACXH,EAAMA,EAAIO,OAAQ,IAEnBP,EAAM,EACLA,EAAML,EAAOS,GACbT,EAAOS,GAAQJ,EACXG,IACJH,EAAM,IAAMA,IAVLA,CAaT,CCpDA,IAAIQ,EAAYC,OAAOC,UAAUC,YAC7BC,EAAYH,OAAOC,UAAUG,YAajC,SAASC,EAAeC,GACvB,IAAIC,EACAlB,EACAD,EAEJ,OAASkB,EAAME,WACf,IAAK,IAEJD,EAAO,EACP,MACD,IAAK,IAEJA,EAAO,EACP,MACD,IAAK,IACL,IAAK,IAEJA,EAAO,GACP,MAID,QAECA,EAAO,GAKR,GAFAlB,EAAMiB,EAAMG,IACZrB,EAAIsB,SAAUrB,EAAK,KACbsB,SAAUvB,GAAM,CACrB,IAAMJ,EAAUK,GACf,MAAM,IAAIuB,MAAO,2BAA6BvB,GAE/CD,EAAI,CACJ,CAkCD,OAjCKA,EAAI,IAA2B,MAApBkB,EAAME,WAA8B,KAATD,KAC1CnB,EAAI,WAAaA,EAAI,GAEjBA,EAAI,GACRC,IAASD,GAAIyB,SAAUN,GAClBD,EAAMQ,YACVzB,EAAMC,EAASD,EAAKiB,EAAMQ,UAAWR,EAAMS,WAE5C1B,EAAM,IAAMA,IAEZA,EAAMD,EAAEyB,SAAUN,GACZnB,GAAMkB,EAAMQ,UAENR,EAAMQ,YACjBzB,EAAMC,EAASD,EAAKiB,EAAMQ,UAAWR,EAAMS,WAF3C1B,EAAM,GAIFiB,EAAMU,OACV3B,EAAMiB,EAAMU,KAAO3B,IAGP,KAATkB,IACCD,EAAMW,YACV5B,EAAM,KAAOA,GAEdA,EAAQiB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM7B,GAChBU,EAAUmB,KAAM7B,IAEJ,IAATkB,GACCD,EAAMW,WAAiC,MAApB5B,EAAI8B,OAAQ,KACnC9B,EAAM,IAAMA,GAGPA,CACR,CCtFA,IAAI+B,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,EACA3C,EAEJ,OAASiB,EAAME,WACf,IAAK,IACL,IAAK,IACJnB,EAAM0C,EAAEE,cAAe3B,EAAMQ,WAC7B,MACD,IAAK,IACL,IAAK,IACJzB,EAAM0C,EAAEG,QAAS5B,EAAMQ,WACvB,MACD,IAAK,IACL,IAAK,IACCM,EAAKW,GAAM,OACfC,EAAS1B,EAAMQ,WACD,IACbkB,GAAU,GAEX3C,EAAM0C,EAAEE,cAAeD,IAEvB3C,EAAM0C,EAAEI,YAAa7B,EAAMQ,WAEtBR,EAAMW,YACX5B,EAAMiC,EAAQJ,KAAM7B,EAAKwC,EAAoB,OAC7CxC,EAAMiC,EAAQJ,KAAM7B,EAAKuC,EAAoB,KAC7CvC,EAAMiC,EAAQJ,KAAM7B,EAAKsC,EAAyB,KAEnD,MACD,QACC,MAAM,IAAIf,MAAO,mCAAqCN,EAAME,WAc7D,OAZAnB,EAAMiC,EAAQJ,KAAM7B,EAAKkC,EAAmB,SAC5ClC,EAAMiC,EAAQJ,KAAM7B,EAAKmC,EAAmB,SACvClB,EAAMW,YACV5B,EAAMiC,EAAQJ,KAAM7B,EAAKoC,EAAgB,OACzCpC,EAAMiC,EAAQJ,KAAM7B,EAAKqC,EAAsB,SAE3CK,GAAK,GAAKzB,EAAMU,OACpB3B,EAAMiB,EAAMU,KAAO3B,GAEpBA,EAAQiB,EAAME,YAAcL,EAAUe,KAAMZ,EAAME,WACjDL,EAAUe,KAAM7B,GAChBU,EAAUmB,KAAM7B,EAElB,CCpEA,SAAS+C,EAAQjD,GAChB,IACIC,EADAC,EAAM,GAEV,IAAMD,EAAI,EAAGA,EAAID,EAAGC,IACnBC,GAAO,IAER,OAAOA,CACR,CCJA,IAAIgD,EAAerC,OAAOqC,aACtBC,EAAUC,MAAMD,QAoBpB,SAASE,EAAOvD,GACf,OAASA,GAAUA,CACpB,CASA,SAASwD,EAAYnC,GACpB,IAAIjB,EAAM,CAAA,EAMV,OALAA,EAAImB,UAAYF,EAAME,UACtBnB,EAAIyB,eAAkC,IAApBR,EAAMQ,UAAyB,EAAIR,EAAMQ,UAC3DzB,EAAIG,MAAQc,EAAMd,MAClBH,EAAIqD,MAAQpC,EAAMoC,OAAS,GAC3BrD,EAAIsD,QAAUrC,EAAMqC,QACbtD,CACR,CAmBA,SAASuD,EAAmBC,GAC3B,IAAIC,EACAJ,EACApC,EACAyC,EACAC,EACA3D,EACA4D,EACAlB,EACA3C,EACA8D,EDnDc3D,EAAKC,EAAOC,EAC1BE,ECoDJ,IAAM2C,EAASO,GACd,MAAM,IAAIM,UAAW,8DAAgEN,EAAS,MAI/F,IAFAxD,EAAM,GACN4D,EAAM,EACA7D,EAAI,EAAGA,EAAIyD,EAAOjD,OAAQR,IAE/B,GADAkB,EAAQuC,EAAQzD,GC1ES,iBD2EVkB,EACdjB,GAAOiB,MACD,CAGN,GAFAwC,OAAgC,IAApBxC,EAAMQ,YAClBR,EAAQmC,EAAYnC,IACRE,UACX,MAAM,IAAI2C,UAAW,oEAAqE/D,EAAG,cAAgBkB,EAAQ,MAMtH,IAJKA,EAAMqC,UACVM,EAAM3C,EAAMqC,SAEbD,EAAQpC,EAAMoC,MACRQ,EAAI,EAAGA,EAAIR,EAAM9C,OAAQsD,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,EAAMd,MAAgB,CAG1B,GAFAc,EAAMd,MAAQkB,SAAU4C,UAAWL,GAAO,IAC1CA,GAAO,EACFT,EAAOlC,EAAMd,OACjB,MAAM,IAAI2D,UAAW,wCAA0CF,EAAM,6BAA+B3C,EAAMd,MAAQ,MAE9Gc,EAAMd,MAAQ,IAClBc,EAAMS,UAAW,EACjBT,EAAMd,OAASc,EAAMd,MAEtB,CACD,GAAKsD,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,IAAM/C,EAAUsB,EAAMG,KACrB,MAAM,IAAIG,MAAO,yCAA2CvB,GAG7D0C,EAAIzB,EAAMG,IACVH,EAAM8C,UAAW,CACjB,CACD9C,EAAMG,IAAMqB,EAAcC,EAAGzB,GAC7B,MACD,QACC,MAAM,IAAIM,MAAO,sBAAwBN,EAAME,WAG3CF,EAAMiD,UAAY,GAAKjD,EAAMG,IAAIb,OAASU,EAAMiD,WACpDjD,EAAMG,IAAMH,EAAMG,IAAIgD,UAAW,EAAGnD,EAAMiD,WAEtCjD,EAAM8C,SACV9C,EAAMG,IAAMnB,EAASgB,EAAMG,IAAKH,EAAMd,OAASc,EAAMQ,UAAWR,EAAMS,UAC3DT,EAAMd,QACjBc,EAAMG,KDpLSlB,ECoLOe,EAAMG,IDpLRjB,ECoLac,EAAMd,MDpLZC,ECoLmBa,EAAMS,SDnLnDpB,YAAMH,EAAQD,EAAIK,QACX,EACHL,EAERA,EAAM,EACLA,EAAM6C,EAAQzC,GACdyC,EAAQzC,GAAQJ,IC+KfF,GAAOiB,EAAMG,KAAO,GACpBwC,GAAO,CACP,CAEF,OAAO5D,CACR,CEvNA,IAAIqE,EAAK,6EAYT,SAASC,EAAOC,GACf,IAAItD,EAAQ,CACXqC,QAAaiB,EAAO,GAAQlD,SAAUkD,EAAO,GAAK,SAAO,EACzDlB,MAASkB,EAAO,GAChBpE,MAASoE,EAAO,GAChB9C,UAAa8C,EAAO,GACpBpD,UAAaoD,EAAO,IAKrB,MAHoB,MAAfA,EAAO,SAA8B,IAAfA,EAAO,KACjCtD,EAAMQ,UAAY,KAEZR,CACR,CAeA,SAASuD,EAAgBtE,GACxB,IAAIuE,EACAjB,EACAe,EACAG,EAKJ,IAHAlB,EAAS,GACTkB,EAAO,EACPH,EAAQF,EAAGM,KAAMzE,GACTqE,IACPE,EAAUvE,EAAI0E,MAAOF,EAAML,EAAGQ,UAAYN,EAAO,GAAIhE,SACxCA,QACZiD,EAAOsB,KAAML,GAGM,MAAfF,EAAO,GACXf,EAAOsB,KAAM,KAEbtB,EAAOsB,KAAMR,EAAOC,IAErBG,EAAOL,EAAGQ,UACVN,EAAQF,EAAGM,KAAMzE,GAMlB,OAJAuE,EAAUvE,EAAI0E,MAAOF,IACRnE,QACZiD,EAAOsB,KAAML,GAEPjB,CACR,CC3CA,SAASuB,EAAQ7E,GAChB,IAAI8E,EACAjF,EAEJ,GCf0B,iBDeVG,EACf,MAAM,IAAI4D,UAAWiB,EAAQ,kEAAmE7E,IAGjG,IADA8E,EAAO,CAAEC,EAAU/E,IACbH,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAClCiF,EAAKF,KAAMb,UAAWlE,IAEvB,OAAOmF,EAAYC,MAAO,KAAMH,EACjC,CE7BA,ICkBItF,EDlBA0F,EAAiB3F,OAAOmB,UACxByE,EAAQD,EAAe5D,SACvB8D,EAAeF,EAAeG,iBAC9BC,EAAeJ,EAAeK,iBAC9BC,EAAeN,EAAeO,iBAC9BC,EAAeR,EAAeS,iBCiBjCnG,ECdD,WAEC,IAEC,OADAA,EAAgB,CAAE,EAAE,IAAK,CAAA,IAClB,CACP,CAAC,MAAQoG,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,EAAWvG,MAGzBqG,EAAIM,UAAY3F,GAEhBqF,EAAKC,GAASC,EAAWvG,OAG3ByG,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,EAAehH,EEZf,SAASiH,EAA0BV,EAAKC,EAAMtG,GAC7CF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCdA,SAASD,EAAUC,GAClB,MAA0B,iBAAVA,CACjB,CCbA,IAAImH,ECMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,IACR,OAASF,GAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAI7B,EAAQ5F,OAAOmB,UAAUY,SCA7B,IAAI2F,EAAM1H,OAAOmB,UAAUwG,eA4B3B,SAASC,EAAYzH,EAAO0H,GAC3B,OACC1H,SAKMuH,EAAItF,KAAMjC,EAAO0H,EACzB,CCpCA,IAAIC,EAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,EAA+B,mBAAXR,EAA0BA,EAAOE,YAAc,GCiCvE,IAAAO,EATKC,ICDL,SAAsBC,GACrB,IAAIC,EACAC,EACA7H,EAEJ,GAAK2H,QACJ,OAAOtC,EAAMxD,KAAM8F,GAEpBE,EAAMF,EAAGT,GACTU,EAAQP,EAAYM,EAAGT,GAGvB,IACCS,EAAGT,QAAgB,CACnB,CAAC,MAAQpB,GACT,OAAOT,EAAMxD,KAAM8F,EACnB,CAQD,OAPA3H,EAAMqF,EAAMxD,KAAM8F,GAEbC,EACJD,EAAGT,GAAgBW,SAEZF,EAAGT,GAEJlH,CACR,EC3BA,SAAsB2H,GACrB,OAAOtC,EAAMxD,KAAM8F,EACpB,EC5BAG,EAAeC,OCMXvG,EAAWuG,EAAOnH,UAAUY,SCEhC,IAAIuF,EAAMW,IAmBV,SAAS/H,EAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBmI,IAGjBhB,ECpBP,SAAenH,GACd,IAEC,OADA4B,EAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDcUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEVA,SAASD,EAAUC,GAClB,OAASqI,EAAarI,IAAWsI,EAAUtI,EAC5C,CCoBAuI,EAAA3I,EAAA,cAAAyI,GACAE,EAAA3I,EAAA,WAAA0I,GCvBA,IAAIE,GAAeL,OAAOM,kBCItBC,GAAeP,EAAOQ,kBCVtBC,GAAQxG,KAAKwG,MCHjB,SAASC,GAAWC,GACnB,OAAQF,GAAME,KAAOA,CACtB,CCPA,SAASD,GAAW7I,GACnB,OACCA,EAAQ+I,IACR/I,EAAQgJ,IACRC,GAAOjJ,EAET,CCAA,SAAS6I,GAAW7I,GACnB,OACCD,EAAUC,IACViJ,GAAOjJ,EAET,CCLA,SAAS6I,GAAW7I,GACnB,OACCD,EAAUC,IACViJ,GAAOjJ,EAAMkJ,UAEf,CCGA,SAASL,GAAW7I,GACnB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCXA,SAASmJ,GAAsBnJ,GAC9B,OACC6I,GAAW7I,IACXA,GAAS,CAEX,CCLA,SAASmJ,GAAsBnJ,GAC9B,OACC6I,GAAW7I,IACXA,EAAMkJ,WAAa,CAErB,CCQA,SAASC,GAAsBnJ,GAC9B,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCeAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICAAC,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,IC9BA,IAAIc,GAAmB,WCMvB,SAASC,GAAcC,GACtB,GAA0B,mBAAdA,EACX,MAAM,IAAIpF,UAAWiB,EAAQ,0DAA2DmE,IAEzF,OASA,SAAgBtJ,GACf,IAAIuJ,EACApJ,EACJ,ICvBF,SAAsBH,GACrB,OACCA,SAEiB,mBAAVA,GACiB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CDaQC,CAAazJ,GAClB,OAAO,EAGR,GAAa,KADbuJ,EAAMvJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,IAAiC,IAA5BmJ,EAAWtJ,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CEjBA,IAAAuJ,GAAAC,GAAAR,GAAAd,aACAuB,GAAAD,GAAAR,GAAAb,UAKAuB,GAAAF,GAAAR,IC5BA,SAASW,GAAW9J,GACnB,MAA0B,kBAAVA,CACjB,CD2BAuI,EAAAsB,GAAA,aAAAH,IACAnB,EAAAsB,GAAA,UAAAD,IEzBA,IAAIG,GAAOC,QCxBPpI,GAAWoI,QAAQhJ,UAAUY,SCSjC,IAAIuF,GAAMW,IAqBV,SAASgC,GAAW9J,GACnB,MAAsB,iBAAVA,IACNA,aAAiBgK,KAGjB7C,GCtBP,SAAenH,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDgBUkC,CAAMpI,GAEoB,qBAAzB6H,EAAa7H,IAGxB,CERA,SAAS8J,GAAW9J,GACnB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCUAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,IC7CA,IAAIjC,GAAwB,iBAAT4D,KAAsBA,KAAO,KCA5C5D,GAA0B,iBAAX6D,OAAwBA,OAAS,KCAhD7D,GAA0B,iBAAX8D,OAAwBA,OAAS,KCAhD9D,GAA8B,iBAAf+D,WAA4BA,WAAa,KC2B5D,SAASC,GAAWC,GACnB,GAAKjG,UAAU1D,OAAS,CACvB,IAAMmJ,GAAWQ,GAChB,MAAM,IAAIpG,UAAWiB,EAAQ,yDAA0DmF,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,IAAIhJ,MAAO,qDAClB,CElDA,IAAIgJ,GAASN,KAcb,SAASO,KACR,MAC0B,mBAAlBD,GAAOE,QACI,mBAAXA,QACyB,iBAAzBF,GAAOE,OAAQ,MACG,iBAAlBA,OAAQ,IAEjB,CCCA,SAASC,GAAkCzE,EAAKC,EAAMyE,GACrDjL,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOmE,GAET,CCrBA,SAASC,GAAUhL,GAClB,MAA0B,iBAAVA,CACjB,CCfA,IAAIkJ,GAAUnI,OAAOC,UAAUkI,QCQ/B,IAAI/B,GAAMW,IAmBV,SAASkD,GAAUhL,GAClB,MAAsB,iBAAVA,IACNA,aAAiBe,SAGjBoG,GCnBP,SAAenH,GACd,IAEC,OADAkJ,GAAQjH,KAAMjC,IACP,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEjBA,SAASgL,GAAUhL,GAClB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCHA,SAASiL,GAAmBjL,GAC3B,OACC6I,GAAW7I,IACXA,EAAQ,CAEV,CCLA,SAASiL,GAAmBjL,GAC3B,OACC6I,GAAW7I,IACXA,EAAMkJ,UAAY,CAEpB,CCYA,SAAS+B,GAAmBjL,GAC3B,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CClBA,SAASkL,GAAMlL,GACd,OAAOH,OAAOqL,KAAMrL,OAAQG,GAC7B,CCsBAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICKAC,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICnDA,ICKI6C,GDLAA,QAAgC,IAAhBtL,OAAOqL,KEwB3B,SAASE,GAAapL,GACrB,MAAkC,uBAAzB6H,EAAa7H,EACvB,CDCIqL,GAPJ,WACC,OAAOD,GAAa/G,UACrB,CAKOiH,GAKP,IAAAC,GAAeJ,GElBf,SAAS5H,GAAOuF,GACf,OAASA,GAAMA,CAChB,CCQA,SAASvF,GAAOvD,GACf,OACCD,EAAUC,IACVwL,GAAOxL,EAET,CCTA,SAASuD,GAAOvD,GACf,OACCD,EAAUC,IACVwL,GAAOxL,EAAMkJ,UAEf,CCGA,SAAS3F,GAAOvD,GACf,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCoBAuI,EAAA3I,GAAA,cAAAyI,IACAE,EAAA3I,GAAA,WAAA0I,ICzBA,IAAImD,GAAuB5L,OAAOmB,UAAU0K,qBCE5C,IAAAC,IAXSC,GAAO3J,KAAM,OAAQ,KCe9B,SAASwJ,GAAsBzL,EAAO0H,GACrC,IAAIyD,EACJ,OACCnL,YAKDmL,EAAOS,GAAO3J,KAAMjC,EAAO0H,KACbiE,IAAoBX,GAAUhL,IAIzCuD,GAFFmE,GAAYA,IAGXmB,GAAWnB,IACXA,GAAY,GACZA,EAAW1H,EAAMW,OAGZwK,EACR,CCZA,IAAAU,GATKvI,MAAMD,QACNC,MAAMD,QARX,SAAkBrD,GACjB,MAAkC,mBAAzB6H,EAAa7H,EACvB,ECOI8L,GAAa,WCGjB,IAAAC,GATKR,GACU3L,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNqD,GAASrD,IACc,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,IAChB/B,EAAYzH,EAAO,YAClByL,GAAsBzL,EAAO,SAEhC,EClCIgF,GAAQ1B,MAAMtC,UAAUgE,MCqB5B,SAASgH,GAAU1C,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAIpF,UAAWiB,EAAQ,0DAA2DmE,IAEzF,OASA,SAAgBtJ,GACf,IAAIuJ,EACApJ,EACJ,IAAMkD,GAASrD,GACd,OAAO,EAGR,GAAa,KADbuJ,EAAMvJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,IAAiC,IAA5BmJ,EAAWtJ,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAAS8L,GAAcjM,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCkBAuI,EAAA3I,GAAA,oBALA+J,GAAA/J,KC3BA,IAAIuL,GAAOM,ICFX,WAEA,GDAuC,aEMnCN,IAAQM,GARF,CACT7J,SAAY,MAO0B,YCQnCsK,GAAyB,iBCD7B,SAASC,GAAcnM,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CCiCA,SAASpF,GAASgI,EAAKC,EAAeC,GACrC,IAAI/C,EACApJ,EACJ,IAAMgM,GAAcC,KAAUpB,GAAUoB,GACvC,MAAM,IAAIlI,UAAWiB,EAAQ,8EAA+EiH,IAG7G,GAAa,KADb7C,EAAM6C,EAAIzL,QAET,OAAQ,EAET,GAA0B,IAArB0D,UAAU1D,OAAe,CAC7B,IAAMkI,GAAWyD,GAChB,MAAM,IAAIpI,UAAWiB,EAAQ,oEAAqEmH,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAa/C,EACjB,OAAQ,EAETpJ,EAAImM,CACP,MACGnM,EAAIoJ,EAAM+C,GACD,IACRnM,EAAI,EAGR,MACEA,EAAI,EAGL,GAAKoD,GAAO8I,IACX,KAAQlM,EAAIoJ,EAAKpJ,IAChB,GAAKoD,GAAO6I,EAAIjM,IACf,OAAOA,OAIT,KAAQA,EAAIoJ,EAAKpJ,IAChB,GAAKiM,EAAKjM,KAAQkM,EACjB,OAAOlM,EAIV,OAAQ,CACT,CC3GA,IAAIsE,GAAK,ICOL8H,GAAOlC,KACPmC,GAAWD,GAAKE,UAAYF,GAAKE,SAASC,WCR1CC,GAAaC,UC0BjB,SAASC,KACR,MAAO,yBACR,CCMA,IAAIC,GDPI,0BEER,SAASC,GAAU/M,GAClB,OACCiM,GAAcjM,KAGbA,EAAMgN,WAELhN,EAAMiN,aAGgC,mBAA/BjN,EAAMiN,YAAYF,UACzB/M,EAAMiN,YAAYF,SAAU/M,GAIhC,CCTA,SAASkN,GAAiBnF,GACzB,IAAIpD,EACAwI,EACAC,EAEJ,IAAe,YADfD,EAAOtF,EAAaE,GAAI/C,MAAO,GAAI,KACC,UAATmI,IAAqBpF,EAAEkF,YAAc,CAE/D,GAA0B,iBAD1BG,EAAOrF,EAAEkF,aACQE,KAChB,OAAOC,EAAKD,KAGb,GADAxI,EAAQF,GAAGM,KAAMqI,EAAKxL,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKoI,GAAUhF,GACP,SAEDoF,CACR,CCnBA5E,EAAA3I,GAAA,SAAAyN,ICXA,IAAIzN,GCNY,mBAAP6E,IAGe,iBAAfkI,IAGa,mBAAbH,GCXT,SAAiBzE,GAChB,OAAOuF,GAAUvF,GAAI9G,aACtB,ECqBA,SAAiB8G,GAChB,IAAIwF,EAGJ,OAAW,OAANxF,EACG,OAKM,YAHdwF,SAAcxF,GAINuF,GAAUvF,GAAI9G,cAEfsM,CACR,ECzCA,SAASC,GAAwBxN,GAChC,OAASA,EAAMiN,aAAejN,EAAMiN,YAAYjM,YAAchB,CAC/D,6PCTIyN,GAAwB,oBAAXvD,YAA2B,EAASA,OCqDrD,IAAAwD,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlBC,GAAQC,IACZ,OAAO,EAER,IAAMF,KAAKE,GACV,KAEmC,IAAjCzJ,GAAS0J,GAAeH,IACxBlG,EAAYoG,GAAKF,IACJ,OAAbE,GAAKF,IACkB,WAAvBC,GAAQC,GAAKF,KAEbH,GAAwBK,GAAKF,GAE9B,CAAC,MAAQzH,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKO6H,GChDH5C,GAA2B,oBAAXjB,WC0BhBgB,oHAKFA,GAJG8C,GChBL,WACC,OAA8C,KAArC9C,GAAM7G,YAAe,IAAK1D,MACpC,CAgBQyH,CAAM,EAAG,G3BFjB,SAAepI,GACd,OAAKoL,GAAapL,GACVoG,GAASpB,GAAM/C,KAAMjC,IAEtBoG,GAASpG,EACjB,E0BDSoG,GEJT,SAAepG,GACd,IAAIiO,EACAC,EACAC,EACA/N,EACAuN,EACAS,EACAjO,EAGJ,GADAC,EAAM,GACDgL,GAAapL,GAAU,CAE3B,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,YAGb,OAAOxB,CACP,CACD,GAAsB,iBAAVJ,GAEX,GAAKA,EAAMW,OAAS,IAAM8G,EAAYzH,EAAO,KAC5C,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,gBAGR,CAEN,IAAe,IADfuM,EAA2B,mBAAVnO,KACQiM,GAAcjM,GACtC,OAAOI,EAER8N,EAAkBG,IAAsBF,CACxC,CACD,IAAMR,KAAK3N,EACFkO,GAAuB,cAANP,IAAuBlG,EAAYzH,EAAO2N,IAClEvN,EAAI8E,KAAMnE,OAAQ4M,IAGpB,GAAKW,GAEJ,IADAL,ECnDF,SAAkBjO,GACjB,IAAoB,IAAfuO,KAAyBb,GAC7B,OAAOF,GAAwBxN,GAEhC,IACC,OAAOwN,GAAwBxN,EAC/B,CAAC,MAAQwO,GACT,OAAO,CACP,CACF,CD0CoBhB,CAAwBxN,GACpCG,EAAI,EAAGA,EAAIsO,GAAe9N,OAAQR,IACvCiO,EAAIK,GAAgBtO,GACZ8N,GAAyB,gBAANG,IAAyB3G,EAAYzH,EAAOoO,IACtEhO,EAAI8E,KAAMnE,OAAQqN,IAIrB,OAAOhO,CACR,EFlCA,IAAAsO,GAAexD,GIrBf,SAAS5C,GAAUtI,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCqD,GAASrD,EAEZ,CCNA,SAAS2O,GAAY3O,GAEpB,MAA6B,aAApB4N,GAAQ5N,EAClB,CCQA,ICvBI4O,GDuBAC,GAAMhP,OE9BN+O,GAAW/O,OAAOiP,eDSrBF,GADID,GAAY9O,OAAOiP,gBACZ1I,GEKZ,SAAyBC,GACxB,IAAI0I,ECVL,SAAmB1I,GAElB,OAAOA,EAAIM,SACZ,CDOaiI,CAAUvI,GACtB,OAAK0I,GAAmB,OAAVA,EACNA,EAEgC,sBAAnClH,EAAaxB,EAAI4G,aAEd5G,EAAI4G,YAAYjM,UAEnBqF,aAAexG,GACZA,GAAOmB,UAGR,IACR,EFXA,IAAAgO,GAAeJ,GIDf,SAASE,GAAgB9O,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAET4O,GAAU5O,GAClB,CClBA,IAAIiP,GAAkBpP,OAAOmB,UAyC7B,SAASkO,GAAelP,GACvB,IAAI+O,EAGJ,QAAMzG,GAAUtI,OAIhB+O,EAAQD,GAAgB9O,MAOtByH,EAAYzH,EAAO,gBAGpByH,EAAYsH,EAAO,gBACnBJ,GAAYI,EAAM9B,cACmB,sBAArCpF,EAAakH,EAAM9B,cAGnBxF,EAAYsH,EAAO,kBACnBJ,GAAYI,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmB5I,GAClB,IAAI+I,EAGJ,IAAMA,KAAO/I,EACZ,IAAMoB,EAAYpB,EAAK+I,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUrP,IAGb,CC7EA,IAAIsP,GCwCJ,SAAiBjJ,EAAKkJ,GACrB,IACIrE,EACA3B,EACA6F,EACAI,EACApP,EACA2H,EACA5H,EAPAsP,GAAa,EAQjB,IAAMxD,GAAc5F,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAU1D,OAAS,EAAI,CAC3B,IAAM2H,GAAUiH,GACf,MAAM,IAAIrL,UAAWiB,EAAQ,qEAAsEoK,IAEpG,GAAK9H,EAAY8H,EAAM,gBAEhBzF,GADN2F,EAAaF,EAAKG,YAEjB,MAAM,IAAIxL,UAAWiB,EAAQ,+DAAgE,aAAcsK,GAG7G,CAID,GAFAlG,GADA2B,EAAOyE,GAAYtJ,IACR1F,OACXP,EAAM,CAAA,EACDqP,EACJ,IAAMtP,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAGfsH,EAAYrH,EADlBoP,EAAMnJ,EADN+I,EAAMlE,EAAM/K,MAMZ4H,EAAI3H,EAAKoP,GACJnM,GAAS0E,GACb3H,EAAKoP,GAAMtK,KAAMkK,GAEjBhP,EAAKoP,GAAQ,CAAEzH,EAAGqH,IAPlBhP,EAAKoP,GAAQJ,OAWf,IAAMjP,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAErBC,EAAKiG,EADL+I,EAAMlE,EAAM/K,KACQiP,EAGtB,OAAOhP,CACR,CDxFWwP,CEWH,CAENzE,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCrB,YAAc,IAqBf,SAASsB,GAAUC,GAClB,IAAIlJ,EAAIuH,GAAM2B,GACd,OAASjG,GAAUjD,GAAQA,EAAI,IAChC,2OGKA,SAASmJ,GAAiBD,GACzB,IAAIlJ,EACJ,OAAKiD,GAAUiG,GACPE,GAAmBF,IAAW,KAEjClR,EAAUkR,GACPE,GAAmBH,GAAUC,KAAa,KAE7CA,GAEChG,GADLlD,EAAIkJ,EAAMG,YAEFrJ,EAGF,IACR,CC5BA,SAASsJ,GAAgBC,GACxB,IAAIC,EACApR,EAGJ,IADAoR,EAAM,EACApR,EAAI,EAAGA,EAAImR,EAAQ3Q,OAAQR,IAC3BmR,EAASnR,GAAM,IACnBoR,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQD,EAAQ3Q,QAEb,EAGD,CACR,CClBA,SAASwB,GAAK2G,GACb,OAAO1G,KAAKD,IAAK2G,EAClB,CCJA,SAAS0I,GAAeF,GACvB,IAAIG,EACAC,EACAC,EACAC,EACAC,EACA1R,EAGJ,GAAe,KADfuR,EAAQJ,EAAQ3Q,QAEf,OAAO,EAMR,IAJA8Q,GAAS,EACTE,GAAM,EAENC,EAAKzP,GAAKmP,EAAS,IACbnR,EAAI,EAAGA,EAAIuR,EAAOvR,IAAM,CAO7B,GANA0R,EAAK1P,GAAKmP,EAASnR,IACdsR,GAAUI,EAAKD,EACnBH,GAAS,EACEE,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOF,EAGX,OAAO,EAFPG,EAAKC,CAIN,CACD,OAAKF,GAAOF,EACJ,EAEHE,EACG,EAED,CACR,CC5DA,IAAIG,GAAO,WAqBX,SAASC,GAAiB/R,GACzB,cAAgBA,EAAM4G,MAAQkL,WAAe9R,EAAM6G,MAAQiL,EAC5D,CCvBA,IAAIE,GAAU,CACbxB,QAgCD,SAAqBpE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EAjCC1B,QAmDD,SAAqBnE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EApDC/B,MAsED,SAAmB9D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EAvECjC,MAyFD,SAAmB5D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EA1FCpC,KA4GD,SAAkBzD,EAAK6F,GACtB,OAAO7F,EAAK6F,EACb,EA7GC9B,OA+HD,SAAoB/D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAhIChC,OAkJD,SAAoB7D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAnJCnC,MAqKD,SAAmB1D,EAAK6F,GACvB,OAAO7F,EAAK6F,EACb,EAtKClC,OAwLD,SAAoB3D,EAAK6F,GACxB,OAAO7F,EAAK6F,EACb,EAzLCpB,QAyMD,SAAqBzE,EAAK6F,GACzB,OAAO7F,EAAK6F,EACb,EA1MCC,QA0ND,SAAuB9F,EAAK6F,GAC3B,OAAO7F,EAAK6F,EACb,GAoBA,SAASlH,GAAQkG,GAChB,IAAInO,EAAIkP,GAASf,GACjB,MAAkB,mBAANnO,EACJA,EAEDkP,GAAQE,OAChB,CCjQA,IAAIC,GAAU,CACb3B,QAkCD,SAAqBpE,EAAK6F,EAAKjS,GAC9BoM,EAAK6F,GAAQjS,CACd,EAnCCuQ,QAuDD,SAAqBnE,EAAK6F,EAAKjS,GAC9BoM,EAAK6F,GAAQjS,CACd,EAxDCkQ,MA4ED,SAAmB9D,EAAK6F,EAAKjS,GAC5BoM,EAAK6F,GAAQjS,CACd,EA7ECgQ,MAiGD,SAAmB5D,EAAK6F,EAAKjS,GAC5BoM,EAAK6F,GAAQjS,CACd,EAlGC6P,KAsHD,SAAkBzD,EAAK6F,EAAKjS,GAC3BoM,EAAK6F,GAAQjS,CACd,EAvHCmQ,OA2ID,SAAoB/D,EAAK6F,EAAKjS,GAC7BoM,EAAK6F,GAAQjS,CACd,EA5ICiQ,OAgKD,SAAoB7D,EAAK6F,EAAKjS,GAC7BoM,EAAK6F,GAAQjS,CACd,EAjKC8P,MAqLD,SAAmB1D,EAAK6F,EAAKjS,GAC5BoM,EAAK6F,GAAQjS,CACd,EAtLC+P,OA0MD,SAAoB3D,EAAK6F,EAAKjS,GAC7BoM,EAAK6F,GAAQjS,CACd,EA3MC6Q,QA6ND,SAAqBzE,EAAK6F,EAAKjS,GAC9BoM,EAAK6F,GAAQjS,CACd,EA9NCkS,QAgPD,SAAuB9F,EAAK6F,EAAKjS,GAChCoM,EAAK6F,GAAQjS,CACd,GAsBA,SAASoS,GAAQnB,GAChB,IAAInO,EAAIqP,GAASlB,GACjB,MAAkB,mBAANnO,EACJA,EAEDqP,GAAQD,OAChB,CCzRA,IAAIF,GAAU,CACbrB,WAwBD,SAAwBvE,EAAK6F,GAC5B,OAAO7F,EAAIxF,IAAKqL,EACjB,EAzBCvB,UA2CD,SAAuBtE,EAAK6F,GAC3B,OAAO7F,EAAIxF,IAAKqL,EACjB,EA5CCC,QAuED,SAAuB9F,EAAK6F,GAC3B,OAAO7F,EAAIxF,IAAKqL,EACjB,GAqBA,SAASlH,GAAQkG,GAChB,IAAInO,EAAIkP,GAASf,GACjB,MAAkB,mBAANnO,EACJA,EAEDkP,GAAQE,OAChB,CCvGA,IAAIC,GAAU,CACbxB,WA0BD,SAAwBvE,EAAK6F,EAAKjS,GACjCoM,EAAIvF,IAAK7G,EAAOiS,EACjB,EA3BCvB,UA+CD,SAAuBtE,EAAK6F,EAAKjS,GAChCoM,EAAIvF,IAAK7G,EAAOiS,EACjB,EAhDCC,QA6ED,SAAuB9F,EAAK6F,EAAKjS,GAChCoM,EAAIvF,IAAK7G,EAAOiS,EACjB,GAwBA,SAASG,GAAQnB,GAChB,IAAInO,EAAIqP,GAASlB,GACjB,MAAkB,mBAANnO,EACJA,EAEDqP,GAAQD,OAChB,CC/GA,IAAIG,GAAc,CACjBC,aAAgB,UAChBC,aAAgB,UAChBjP,MAAS,UACTkP,WAAc,QACdC,WAAc,QACd7F,UAAa,OACb8F,YAAe,SACfC,YAAe,SACfC,WAAc,QACdC,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QCTbC,GAA4C,mBAAjBV,aCL/B,IAAI3S,GAAiC,mBAAjB2S,aAAgCA,aAAe,KCenE,SAASW,KACR,IAAI/H,EACAiB,EFSoBpM,EEPxB,GAAmC,mBAAvBmT,GACX,OAAO,EAGR,IACC/G,EAAM,IAAI+G,GAAoB,CAAE,EAAK,MAAO,KAAMC,MFE3BpT,EEANoM,EADjBjB,GFGE8H,IAAmBjT,aAAiBuS,cACb,0BAAzB1K,EAAa7H,KEFC,IAAboM,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQlG,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CCpCA,IAAIiC,GAAiC,mBAAjBmF,aAAgCA,kBAAe,EC6BnE,IAAAc,GATKH,KACG9M,GCdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ECJI2R,GAA4C,mBAAjBhB,aCL/B,IAAI1S,GAAiC,mBAAjB0S,aAAgCA,aAAe,KCAnE,ICmBIlF,GDnBAA,GAAiC,mBAAjBkF,aAAgCA,kBAAe,ECuBlElF,GCPD,WACC,IAAIjC,EACAiB,EJQoBpM,EINxB,GAAmC,mBAAvBuT,GACX,OAAO,EAGR,IACCnH,EAAM,IAAImH,GAAoB,CAAE,EAAK,MAAO,KAAM,OJC3BvT,EICNoM,EADjBjB,GJEEmI,IAAmBtT,aAAiBsS,cACb,0BAAzBzK,EAAa7H,KIDC,IAAboM,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQrD,EAEd,CAAC,MAAQ7C,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDjBKqI,GACGpN,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA8R,GAAerG,GGxBXsG,GAA0C,mBAAhBf,YCL9B,IAAI/S,GAAgC,mBAAhB+S,YAA+BA,YAAc,KCAjE,ICmBIvF,GDnBAA,GAAgC,mBAAhBuF,YAA+BA,iBAAc,ECuBhEvF,GCPD,WACC,IAAIjC,EACAiB,EJQmBpM,EINvB,GAAkC,mBAAtB2T,GACX,OAAO,EAGR,IAECvH,EAAM,IAAIuH,GADVvH,EAAM,CAAE,EAAG,MAAO,KAAMN,GAAW,EAAGA,GAAW,IJC3B9L,EIENoM,EADhBjB,GJCEuI,IAAkB1T,aAAiB2S,aACZ,yBAAzB9K,EAAa7H,KIAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQN,GAAW,GACX,IAAbM,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQlG,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKyI,GACGxN,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAkS,GAAezG,GGxBX0G,GAAwC,mBAAfrB,WC4B7B,IAAIsB,GAAY,WCAZC,IAAY,WCjCZpU,GAA+B,mBAAf6S,WAA8BA,WAAa,KCA/D,ICmBIrF,GDnBAA,GAA+B,mBAAfqF,WAA8BA,gBAAa,ECuB9DrF,GCND,WACC,IAAIjC,EACAiB,ENOkBpM,EMLtB,GAAiC,mBAArBiU,GACX,OAAO,EAGR,IACC7H,EAAM,IAAI6H,GAAkB,CAAE,EAAG,MAAO,KAAMF,GAAU,INAnC/T,EMENoM,EADfjB,GNCE2I,IAAiB9T,aAAiByS,YACX,wBAAzB5K,EAAa7H,KMAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQ4H,EAEd,CAAC,MAAQ9N,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDlBK+I,GACG9N,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAwS,GAAe/G,GGxBXgH,GAA0C,mBAAhB1B,YC4B9B,IAAI2B,GAAa,MCjCbzU,GAAgC,mBAAhB8S,YAA+BA,YAAc,KCAjE,ICmBItF,GDnBAA,GAAgC,mBAAhBsF,YAA+BA,iBAAc,ECuBhEtF,GCPD,WACC,IAAIjC,EACAiB,ELQmBpM,EKNvB,GAAkC,mBAAtBsU,GACX,OAAO,EAGR,IAEClI,EAAM,IAAIkI,GADVlI,EAAM,CAAE,EAAG,MAAO,KAAMiI,GAAW,EAAGA,GAAW,ILC3BrU,EKENoM,EADhBjB,GLCEiJ,IAAkBpU,aAAiB0S,aACZ,yBAAzB7K,EAAa7H,KKAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQiI,GAAW,GACX,IAAbjI,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQlG,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKoJ,GACGnO,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA6S,GAAepH,GGxBXqH,GAAwC,mBAAfjC,WC4B7B,IAAIkC,GAAY,MCAZC,IAAY,MCjCZ/U,GAA+B,mBAAf4S,WAA8BA,WAAa,KCA/D,ICmBIpF,GDnBAA,GAA+B,mBAAfoF,WAA8BA,gBAAa,ECuB9DpF,GCND,WACC,IAAIjC,EACAiB,ENOkBpM,EMLtB,GAAiC,mBAArB4U,GACX,OAAO,EAGR,IACCxI,EAAM,IAAIwI,GAAkB,CAAE,EAAG,MAAO,KAAMF,GAAU,INAnC1U,EMENoM,EADfjB,GNCEsJ,IAAiBzU,aAAiBwS,YACX,wBAAzB3K,EAAa7H,KMAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQuI,EAEd,CAAC,MAAQzO,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDlBK0J,GACGzO,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAmT,GAAe1H,GGxBX2H,GAAwC,mBAAfnC,WC4B7B,IAAIoC,GAAY,ICjCZpV,GAA+B,mBAAfgT,WAA8BA,WAAa,KCA/D,ICmBIxF,GDnBAA,GAA+B,mBAAfwF,WAA8BA,gBAAa,ECuB9DxF,GCPD,WACC,IAAIjC,EACAiB,ELQkBpM,EKNtB,GAAiC,mBAArBiV,GACX,OAAO,EAGR,IAEC7I,EAAM,IAAI6I,GADV7I,EAAM,CAAE,EAAG,MAAO,KAAM4I,GAAU,EAAGA,GAAU,ILC1BhV,EKENoM,EADfjB,GLCE4J,IAAiB/U,aAAiB4S,YACX,wBAAzB/K,EAAa7H,KKAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQ4I,GAAU,GACV,IAAb5I,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQlG,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDnBK+J,GACG9O,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAwT,GAAe/H,GGxBXgI,GAAsD,mBAAtBvC,kBCLpC,IAAIjT,GAAsC,mBAAtBiT,kBAAqCA,kBAAoB,KCA7E,ICmBIzF,GDnBAA,GAAsC,mBAAtByF,kBAAqCA,uBAAoB,ECuB5EzF,GCRD,WACC,IAAIjC,EACAiB,EJSyBpM,EIP7B,GAAwC,mBAA5BqV,GACX,OAAO,EAGR,IACCjJ,EAAM,IAAIiJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MJEpCrV,EIANoM,EADtBjB,GJGEiK,IAAwBpV,aAAiB6S,mBAClB,+BAAzBhL,EAAa7H,KIFC,IAAboM,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQlG,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDnBKmK,GACGlP,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA4T,GAAenI,GGxBXoI,GAAsC,mBAAd5I,UC4B5B,IAAI6I,GAAW,ICAXC,IAAW,ICjCX9V,GAA8B,mBAAdgN,UAA6BA,UAAY,KCA7D,ICmBIQ,GDnBAA,GAA8B,mBAAdR,UAA6BA,eAAY,ECuB5DQ,GCND,WACC,IAAIjC,EACAiB,ENOiBpM,EMLrB,GAAgC,mBAApB2V,GACX,OAAO,EAGR,IACCvJ,EAAM,IAAIuJ,GAAiB,CAAE,EAAG,MAAO,KAAMF,GAAS,INAlCzV,EMENoM,EADdjB,GNCEqK,IAAgBxV,aAAiB4M,WACV,uBAAzB/E,EAAa7H,KMAC,IAAboM,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQsJ,EAEd,CAAC,MAAQxP,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDlBKyK,GACGxP,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAkU,GAAezI,GGLf,SAAS0I,GAAmB9V,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbkI,GAAW7I,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU6I,EAElB,CC5BA,IAAIuM,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAejW,GACvB,OACG+V,IAAkB/V,aAAiBgW,aACZ,yBAAzBnO,EAAa7H,EAEf,CCSA,IAAA0J,GAAAC,GAAAqB,GAAA3C,aACAuB,GAAAD,GAAAqB,GAAA1C,UAKA4N,GAAAvM,GAAAqB,ICvBA,SAASzC,GAAalC,EAAKC,EAAMtG,GAChCF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCLA,SAASmW,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAIjS,UAAW,0EAEtB,IAAMnE,EAAUqW,GACf,MAAM,IAAIlS,UAAWiB,EAAQ,kEAAmEiR,IAEjG,IAAMrW,EAAUsW,GACf,MAAM,IAAInS,UAAWiB,EAAQ,uEAAwEkR,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CFSA/N,EAAA2N,GAAA,aAAAxM,IACAnB,EAAA2N,GAAA,UAAAtM,IEKArB,EAAa4N,GAAY,OAAQ,cAcjC5N,EAAa4N,GAAY,oBAAqB,GAgBnCpP,EAAEoP,GAAWnV,UAAW,oBAAqB,GAgB7C+F,EAAEoP,GAAWnV,UAAW,aAAc,IAgBtC+F,EAAEoP,GAAWnV,UAAW,YC/GnC,WAEC,IAAIV,EAAM,GAAKgW,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdnW,GAAO,OAAUgW,KAAKG,GAEtBnW,GAAO,MAAQgW,KAAKG,GAErBnW,GAAO,GAER,IDyHWyG,EAAEoP,GAAWnV,UAAW,UEnInC,WAEC,IAAIZ,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAIoW,GAAKF,KAAKE,GACdpW,EAAIqW,GAAKH,KAAKG,GACPrW,CACR,ICXA,IAAIsW,GAAkC,mBAAhBtU,KAAKsU,OAA0BtU,KAAKsU,OAAS,KCK/DC,GAAe,IAAIrE,GAAc,GCuBrC,IAAAsE,GATwB,mBAAZxQ,GACQA,GDApB,SAA2B0C,GAE1B,OADA6N,GAAc,GAAM7N,EACb6N,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAI3S,UAAW,0EAEtB,IAAMnE,EAAUqW,GACf,MAAM,IAAIlS,UAAWiB,EAAQ,kEAAmEiR,IAEjG,IAAMrW,EAAUsW,GACf,MAAM,IAAInS,UAAWiB,EAAQ,uEAAwEkR,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAe/W,GACvB,OAAKA,aAAiBmW,IAAcnW,aAAiB6W,IAInC,iBAAV7W,GACG,OAAVA,GACoB,iBAAbA,EAAMwW,IACO,iBAAbxW,EAAMyW,EAEf,CCPA,SAASO,GAAQlO,GAChB,OAAOD,GAAWC,EAAE,EACrB,CFyBAP,EAAasO,GAAW,OAAQ,aAchCtO,EAAasO,GAAW,oBAAqB,GAgBlC9P,EAAE8P,GAAU7V,UAAW,oBAAqB,GAgB5C+F,EAAE8P,GAAU7V,UAAW,aAAc,GAgBrC+F,EAAE8P,GAAU7V,UAAW,YGhHlC,WAEC,IAAIV,EAAM,GAAKgW,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdnW,GAAO,OAAUgW,KAAKG,GAEtBnW,GAAO,MAAQgW,KAAKG,GAErBnW,GAAO,GAER,IH0HWyG,EAAE8P,GAAU7V,UAAW,UIpIlC,WAEC,IAAIZ,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAIoW,GAAKF,KAAKE,GACdpW,EAAIqW,GAAKH,KAAKG,GACPrW,CACR,ICXA,IAAI+Q,GAAoB,EAoBxB,SAAS8F,GAAkBjX,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMiN,YAAYE,MAClBnN,EAAMmR,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,GAoBxB,SAAS+F,GAAmBlX,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMiN,YAAYE,MAClBnN,EAAMmR,oBAAsBA,EAE9B,CCbA,SAASgG,KACR,MACmB,mBAAX/P,GACoB,iBAApBA,EAAQ,QACfK,EAAYL,EAAQ,aACO,iBAApBA,EAAOgQ,QAEhB,CC6BA,IAAIC,GAAmBF,KAA+B/P,OAAOgQ,SAAW,KCvCxE,SAAShB,GAAMkB,GACd,OAAOA,EAAEd,EACV,CCFA,SAASH,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCSA,SAASc,GAAazO,EAAG0O,GACxB,OAAO,IAAIlF,GAAcxJ,EAAE2O,OAAQ3O,EAAE4O,WAAY5O,EAAEqI,kBAAkBqG,EAAS,GAAG1O,EAAEnI,OAAO6W,GAC3F,CCFA,SAASD,GAAazO,EAAG0O,GACxB,OAAO,IAAIjF,GAAczJ,EAAE2O,OAAQ3O,EAAE4O,WAAY5O,EAAEqI,kBAAkBqG,EAAS,GAAG1O,EAAEnI,OAAO6W,GAC3F,CCTA,SAASG,GAAcC,GACtB,IAAIxX,EACA2H,EACAuP,EAGJ,IADAlX,EAAM,KAEL2H,EAAI6P,EAAGC,QACAC,MAIP,GAAKhC,GADLwB,EAAIvP,EAAE/H,QACyBsX,EAAE3W,QAAU,EAC1CP,EAAI8E,KAAMoS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAIpT,UAAWiB,EAAQ,kJAAmJmS,IAFjLlX,EAAI8E,KAAM6S,GAAOT,GAAKU,GAAOV,GAG7B,CAEF,OAAOlX,CACR,CCAA,IAAA+Q,GAAA,EAAAmB,GAAAnB,kBACA8G,GAAAd,KAYA,SAAAe,GAAAlY,GACA,OACAA,aAAA8S,IAEA,iBAAA9S,GACA,OAAAA,IAEA,mBAAAA,EAAAiN,YAAAE,MACA,oBAAAnN,EAAAiN,YAAAE,OAEA,iBAAAnN,EAAAmY,SAGA,iBAAAnY,EAAAoY,OAGA,CASA,SAAAC,GAAArY,GACA,OACAA,IAAA8S,IAGA,oBAAA9S,EAAAmN,IAEA,CAUA,SAAAmL,GAAAC,EAAAtG,GAEA,OAAA,IAAA4E,GAAA0B,EADAtG,GAAA,GACAsG,EAAAtG,EAAA,GACA,CAyEA,SAAAa,KACA,IAAA4E,EACAc,EACAD,EACAhP,EAGA,GADAiP,EAAAnU,UAAA1D,SACA2V,gBAAAxD,IACA,OAAA,IAAA0F,EACA,IAAA1F,GAEA,IAAA0F,EACA,IAAA1F,GAAAzO,UAAA,IAEA,IAAAmU,EACA,IAAA1F,GAAAzO,UAAA,GAAAA,UAAA,IAEA,IAAAyO,GAAAzO,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAmU,EACAD,EAAA,IAAAjG,GAAA,QACA,GAAA,IAAAkG,EACA,GAAArP,GAAA9E,UAAA,IACAkU,EAAA,IAAAjG,GAAA,EAAAjO,UAAA,SACA,GAAA8H,GAAA9H,UAAA,IAKA,IAHAkF,GADAgP,EAAAlU,UAAA,IACA1D,SAGA0C,GAAAkV,IAAAxB,GAAAwB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnM,GACxB,IAAI7C,EACAxB,EACA5H,EACA8D,EAIJ,IAFAsF,EAAM6C,EAAIzL,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,IAAM4W,GADNhP,EAAIqE,EAAKjM,IAER,OAAO,KAERoY,EAAKtU,GAAM8T,GAAOhQ,GAClBwQ,EAAKtU,EAAE,GAAM+T,GAAOjQ,GACpB9D,GAAK,CACL,CACD,OAAOsU,CACR,CDsKAE,CAAA,IAAAnG,GAAA,EAAA/I,GAAAgP,GACA,OAAAA,EAAA,CAEA,IAAAvB,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,6GAAAoE,IAGAgP,EAAA,IAAAjG,GAAAjO,UAAA,GACA,MACA,CACA,GAAA4S,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAvB,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,6HAAAoE,IAEAgP,EAAA,IAAAjG,GAAAiG,EACA,MACA,GAAAtC,GAAA5R,UAAA,IAAA,CAEA,IAAAwE,IADA0P,EAAAlU,UAAA,IACA+M,WAAAD,IACA,MAAA,IAAAuH,WAAAvT,EAAA,yFAAAgM,GAAAoH,EAAAnH,aAEAmH,EAAA,IAAAjG,GAAAiG,EACA,KAAA,KAAAjQ,GAAAjE,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAkU,EAAAlU,UAAA,IACA,IAAA4T,GACA,MAAA,IAAA/T,UAAAiB,EAAA,mJAAAoT,IAEA,IAAA5J,GAAA4J,EAAAM,KACA,MAAA,IAAA3U,UAAAiB,EAAA,qHAAAoT,IAGA,IAAA5J,IADA4J,EAAAA,EAAAM,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,qHAAAoT,IAGA,IADAA,EAAAZ,GAAAY,cACA5W,MACA,MAAA4W,EAEAA,EAAA,IAAAjG,GAAAiG,EAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAlU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAoT,IAGA,IAAApP,GADAuO,EAAArT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAuS,IAEA,IAAA7O,GAAA6O,EAAAvG,IACA,MAAA,IAAAuH,WAAAvT,EAAA,uEAAAgM,GAAAuG,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA3P,IADAU,EAAAgP,EAAAnH,WAAAsG,GACAvG,IACA,MAAA,IAAAuH,WAAAvT,EAAA,oGAAAgM,GAAA5H,IAEAgP,EAAA,IAAAjG,GAAAiG,EAAAb,EACA,KAAA,CAEA,IAAAvO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA4H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAvT,EAAA,iJAAAoE,EAAA4H,KAEAoH,EAAA,IAAAjG,GAAAiG,EAAAb,EAAA,EAAAnO,EACA,CACA,CAIA,OAHAhB,EAAA+N,KAAA,UAAAiC,GACAhQ,EAAA+N,KAAA,UAAAiC,EAAA5X,OAAA,GAEA2V,IACA,CEzQA,SAASF,GAAMkB,GACd,OAAOA,EAAEd,EACV,CCFA,SAASH,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCEA,SAASkB,GAAcC,GACtB,IAAIxX,EACA2H,EACAuP,EAGJ,IADAlX,EAAM,KAEL2H,EAAI6P,EAAGC,QACAC,MAIP,GAAKhC,GADLwB,EAAIvP,EAAE/H,QACyBsX,EAAE3W,QAAU,EAC1CP,EAAI8E,KAAMoS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAIpT,UAAWiB,EAAQ,kJAAmJmS,IAFjLlX,EAAI8E,KAAMkR,GAAMkB,GAAKjB,GAAMiB,GAG3B,CAEF,OAAOlX,CACR,CJ+PAmI,EAAAuK,GAAA,oBAAA3B,IAeA5I,EAAAuK,GAAA,OAAA,kBAmDA/L,EAAA+L,GAAA,QAAA,SAAAgG,GACA,IAAAC,EACAP,EACAQ,EACA5Y,EACAmY,EACAU,EACArS,EACA2C,EACA2P,EACAnR,EACA5H,EACA8D,EACA,IAAA0K,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAmU,GAAA/B,MACA,MAAA,IAAApS,UAAA,6DAGA,IADAsU,EAAAnU,UAAA1D,QACA,EAAA,CAEA,IAAAgO,GADAqK,EAAA3U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA6T,IAEAR,EAAA,IACAO,EAAA1U,UAAA,GAEA,CACA,GAAA6T,GAAAY,GAAA,CAEA,GADAvP,EAAAuP,EAAAnY,OACAqY,EAAA,CAIA,IAFAT,GADAnY,EAAA,IAAAkW,KAAA/M,IACA6O,QACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA4W,GADAhP,EAAAiR,EAAA/W,KAAA8W,EAAAD,EAAAlS,IAAAzG,GAAAA,IAEAoY,EAAAtU,GAAA8T,GAAAhQ,GACAwQ,EAAAtU,EAAA,GAAA+T,GAAAjQ,OACA,MAAA+N,GAAA/N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAwQ,EAAAtU,GAAA8D,EAAA,GACAwQ,EAAAtU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAkW,KAAAwC,EACA,CACA,GAAA3M,GAAA2M,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAzP,EAAAuP,EAAAnY,OAEAiG,EADAkS,EAAAlS,KAAAkS,EAAAjS,IACAsS,GAAA,WAEApO,GAAA,WAGA5K,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA,IAAA4W,GAAAnQ,EAAAkS,EAAA3Y,IAAA,CACA+Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,+FAAA,EAAAoE,IAIA,IADAgP,GADAnY,EAAA,IAAAkW,KAAA/M,EAAA,IACA6O,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA6Y,EAAA/W,KAAA8W,EAAAnS,EAAAkS,EAAA3Y,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAmY,GADAnY,EAAA,IAAAkW,KAAA/M,IACA6O,QACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA4W,GADAhP,EAAAiR,EAAA/W,KAAA8W,EAAAnS,EAAAkS,EAAA3Y,GAAAA,IAEAoY,EAAAtU,GAAA8T,GAAAhQ,GACAwQ,EAAAtU,EAAA,GAAA+T,GAAAjQ,OACA,MAAA+N,GAAA/N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAwQ,EAAAtU,GAAA8D,EAAA,GACAwQ,EAAAtU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAkW,KAAAwC,EACA,CACA,GAAAxQ,GAAAwQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,6FAAA2T,IAOA,GAJAG,EADAD,EK/bA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI3Y,EACA2H,EACAuP,EACAnX,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI6P,EAAGC,QACAC,MAKP,GAFA3X,GAAK,EAEA2V,GADLwB,EAAI0B,EAAK/W,KAAM8W,EAAShR,EAAE/H,MAAOG,KACFmX,EAAE3W,QAAU,EAC1CP,EAAI8E,KAAMoS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAIpT,UAAWiB,EAAQ,+IAAgJmS,IAF9KlX,EAAI8E,KAAM6S,GAAOT,GAAKU,GAAOV,GAG7B,CAEF,OAAOlX,CACR,CLwaAgZ,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAEAU,aAAAtX,MACA,MAAAsX,EAKA,IADAV,GADAnY,EAAA,IAAAkW,KADA/M,EAAA0P,EAAAtY,OAAA,IAEAyX,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA8Y,EAAA9Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA2T,GACA,IAoBAvQ,EAAAuK,GAAA,MAAA,WACA,IAAA1N,EACAjF,EACA,IAAAwO,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAmU,GAAA/B,MACA,MAAA,IAAApS,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAmW,KAAAlR,EACA,IAuDA2B,EAAA+L,GAAA9R,UAAA,MAAA,SAAAiR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA2E,GAAAoJ,GACA,MAAA,IAAA/N,UAAAiB,EAAA,0DAAA8M,IAKA,GAHAA,EAAA,IACAA,GAAAqE,KAAA6B,WAEAlG,EAAA,GAAAA,GAAAqE,KAAA6B,SAGA,OAAAG,GAAAhC,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAgI,GAAA9R,UAAA,UAAA,WACA,OAAAsV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAgI,GAAA9R,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAgI,GAAA9R,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAV,UACA,IAiBA3Q,EAAA+L,GAAA9R,UAAA,oBAAA8R,GAAA3B,mBAuCA5I,EAAAuK,GAAA9R,UAAA,cAAA,SAAAqY,EAAAC,GACA,IAAApB,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA2V,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAAjV,UAAA,IAEAiS,IACA,IAqCAvP,EAAA+L,GAAA9R,UAAA,WAAA,WACA,IAAAiJ,EACAuP,EACAjQ,EACAgP,EACApR,EACAhH,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAiBA,OAfA+F,EAAAqM,KACAiC,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAA,CAAAG,EAAAmY,GAAAC,EAAApY,IACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAAwP,SACA,IAjDAD,CAkDA,IA+BAjR,EAAAuK,GAAA9R,UAAA,SAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,IAAAmJ,EAAArH,KAAA8W,EAAAT,GAAAC,EAAApY,GAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA2CA/N,EAAAuK,GAAA9R,UAAA,QAAA,SAAAhB,EAAAsZ,EAAAI,GACA,IAAAnB,EACAhP,EACA0I,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA/W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAuY,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyQ,GACA,MAAA,IAAApV,UAAAiB,EAAA,qEAAAmU,IAQA,GANAA,EAAA,IACAA,GAAA/P,GACA,IACA+P,EAAA,GAGAjV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAEAA,EAAA,IACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAGAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,MACAmQ,EAAAnQ,CAEA,MACA+P,EAAA,EACAI,EAAAnQ,EAIA,IAFAiN,EAAAuB,GAAA/X,GACAyW,EAAAuB,GAAAhY,GACAG,EAAAmZ,EAAAnZ,EAAAuZ,EAAAvZ,IAEAoY,EADAtG,EAAA,EAAA9R,GACAqW,EACA+B,EAAAtG,EAAA,GAAAwE,EAEA,OAAAH,IACA,IA2CA/N,EAAAuK,GAAA9R,UAAA,UAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAnY,EACAD,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAiP,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAmX,EAAAgB,GAAAC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,OACAlW,EAAA8E,KAAAoS,GAGA,OAAA,IAAAhB,KAAArJ,YAAA7M,EACA,IAsCAmI,EAAAuK,GAAA9R,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADAmX,EAAAgB,GAAAC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAgB,CAGA,IAgCA/O,EAAAuK,GAAA9R,UAAA,aAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADAmX,EAAAgB,GAAAC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IAsCAoI,EAAAuK,GAAA9R,UAAA,YAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADAmX,EAAAgB,GAAAC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAgB,CAGA,IAgCA/O,EAAAuK,GAAA9R,UAAA,iBAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADAmX,EAAAgB,GAAAC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IA4BAoI,EAAAuK,GAAA9R,UAAA,WAAA,SAAA2Y,EAAAZ,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAAiB,EAAA,oEAAAwU,IAGA,IADApB,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAmX,EAAAgB,GAAAC,EAAApY,GACAwZ,EAAA1X,KAAA8W,EAAAzB,EAAAnX,EAAAmW,KAEA,IAyCAvP,EAAA+L,GAAA9R,UAAA,OAAA,SAAAiR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAiF,GAAA8I,GACA,MAAA,IAAA/N,UAAAiB,EAAA,qEAAA8M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAAG,GAAAhC,KAAA8B,QAAAnG,EACA,IAmCA1J,EAAAuK,GAAA9R,UAAA,YAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCA1J,EAAAuK,GAAA9R,UAAA,WAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA9R,EAGA,OAAA,CACA,IAyBA4G,EAAA+L,GAAA9R,UAAA,QAAA,SAAA4Y,GACA,IAAAxZ,EACAmY,EACAsB,EACA1Z,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkZ,EAAA,QACA,KAAA7O,GAAA4O,GAGA,MAAA,IAAA1V,UAAAiB,EAAA,kEAAAyU,IAFAC,EAAAD,CAGA,CAGA,IAFAxZ,EAAA,GACAmY,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAAoT,GAAAC,EAAApY,GAAAyB,YAEA,OAAAxB,EAAA0Z,KAAAD,EACA,IA4BA9S,EAAA+L,GAAA9R,UAAA,QAAA,WACA,IAAAiJ,EACAuP,EACAjQ,EACApC,EACAhH,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAgBA,OAdA+F,EAAAqM,KACA/M,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAAG,EACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAAiB,MACA,IAjDAsO,CAkDA,IAsCAjR,EAAAuK,GAAA9R,UAAA,eAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAKA,IAHA3B,EAAAuB,GAAA1L,GACAoK,EAAAuB,GAAA3L,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,GAAA,EAAAA,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA9R,EAGA,OAAA,CACA,IAgBA2K,GAAAgI,GAAA9R,UAAA,UAAA,WACA,OAAAsV,KAAA6B,OACA,IAyCA5P,EAAAuK,GAAA9R,UAAA,OAAA,SAAA2Y,EAAAZ,GACA,IAAAgB,EACAxB,EACAnY,EACAD,EACA4H,EACA,IAAAmQ,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAAiB,EAAA,oEAAAwU,IAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAA4W,GADAhP,EAAA4R,EAAA1X,KAAA8W,EAAAT,GAAAC,EAAApY,GAAAA,EAAAmW,OAEAyD,EAAA,EAAA5Z,GAAA4X,GAAAhQ,GACAgS,EAAA,EAAA5Z,EAAA,GAAA6X,GAAAjQ,OACA,KAAA+N,GAAA/N,IAAA,IAAAA,EAAApH,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAgS,EAAA,EAAA5Z,GAAA4H,EAAA,GACAgS,EAAA,EAAA5Z,EAAA,GAAA4H,EAAA,EAGA,CAEA,OAAA3H,CACA,IAmCAmI,EAAAuK,GAAA9R,UAAA,UAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACA2B,EACA3Q,EAEApJ,EAEA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAA5B,GAAAC,EAAA,GACApY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IAEA+Z,EAAAF,EAAAE,EADA5B,GAAAC,EAAApY,GACAA,EAAAmW,MAEA,OAAA4D,CACA,IAmCA3R,EAAAuK,GAAA9R,UAAA,eAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACA2B,EACA3Q,EAEApJ,EAEA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAA5B,GAAAC,EAAAhP,EAAA,GACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IAEA+Z,EAAAF,EAAAE,EADA5B,GAAAC,EAAApY,GACAA,EAAAmW,MAEA,OAAA4D,CACA,IAmDAnT,EAAA+L,GAAA9R,UAAA,WAAA,WACA,IAAAuX,EACAU,EACA1P,EACA4Q,EACAha,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAKA,IAHAqF,EAAA+M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACA+B,EAAAvR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAAga,EAAAha,IACA8D,EAAAsF,EAAApJ,EAAA,EACA8Y,EAAAV,EAAA,EAAApY,GACAoY,EAAA,EAAApY,GAAAoY,EAAA,EAAAtU,GACAsU,EAAA,EAAAtU,GAAAgV,EACAA,EAAAV,EAAA,EAAApY,EAAA,GACAoY,EAAA,EAAApY,EAAA,GAAAoY,EAAA,EAAAtU,EAAA,GACAsU,EAAA,EAAAtU,EAAA,GAAAgV,EAEA,OAAA3C,IACA,IAgEAvP,EAAA+L,GAAA9R,UAAA,OAAA,SAAAhB,GAEA,IAAAoa,EACAnI,EACAsG,EACAU,EACAC,EACAiB,EACApS,EACA5H,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAGA,GADAqU,EAAAjC,KAAA8B,QACA/T,UAAA1D,OAAA,GAEA,IAAAwI,GADA8I,EAAA5N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8M,SAGAA,EAAA,EAEA,GAAA8E,GAAA/W,GAAA,CACA,GAAAiS,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAvT,EAAA,kEAAA8M,IAKA,OAFAsG,EADAtG,GAAA,GACA8F,GAAA/X,QACAuY,EAAAtG,EAAA,GAAA+F,GAAAhY,GAEA,CACA,GAAAkY,GAAAlY,GAAA,CAEA,GAAAiS,GADAkI,EAAAna,EAAAmY,SACA7B,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAApa,EAAAoY,QAGAnU,EAAAsU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAzT,GACAmW,EAAA1C,WAAA0C,EAAAhJ,WAAAnN,EAEA,CAGA,IADAgV,EAAA,IAAA3G,GAAA8H,EAAAzZ,QACAR,EAAA,EAAAA,EAAAia,EAAAzZ,OAAAR,IACA8Y,EAAA9Y,GAAAia,EAAAja,GAEAia,EAAAnB,CACA,CAGA,IAFAhH,GAAA,EACAhO,EAAA,EACA9D,EAAA,EAAAA,EAAAga,EAAAha,IACAoY,EAAAtG,GAAAmI,EAAAnW,GACAsU,EAAAtG,EAAA,GAAAmI,EAAAnW,EAAA,GACAgO,GAAA,EACAhO,GAAA,CAGA,KAhCA,CAiCA,IAAAkI,GAAAnM,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAma,EAAAna,EAAAW,OACAR,EAAA,EAAAA,EAAAga,EAAAha,IACA,IAAA4W,GAAA/W,EAAAG,IAAA,CACA+Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAmD,GACA,MAAA,IAAAzB,WAAAvT,EAAA,6GAAAgV,IAEA,GAAAlI,EAAAkI,EAAA,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAApa,EAGAiE,EAAAsU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAzT,GACAmW,EAAA1C,WAAA0C,EAAAhJ,WAAAnN,EAEA,CAGA,IADAgV,EAAA,IAAA3G,GAAA6H,GACAha,EAAA,EAAAA,EAAAga,EAAAha,IACA8Y,EAAA9Y,GAAAia,EAAAja,GAEAia,EAAAnB,CACA,CAIA,IAHAhH,GAAA,EACAkI,GAAA,EACAlW,EAAA,EACA9D,EAAA,EAAAA,EAAAga,EAAAha,IACAoY,EAAAtG,GAAAmI,EAAAnW,GACAsU,EAAAtG,EAAA,GAAAmI,EAAAnW,EAAA,GACAgO,GAAA,EACAhO,GAAA,EAEA,MACA,CAEA,GAAAgO,EAAAkI,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAzG,GAAA,EACA9R,EAAA,EAAAA,EAAAga,EAAAha,IACA4H,EAAA/H,EAAAG,GACAoY,EAAAtG,GAAA8F,GAAAhQ,GACAwQ,EAAAtG,EAAA,GAAA+F,GAAAjQ,GACAkK,GAAA,CAxDA,CA+DA,IA2EA1J,EAAAuK,GAAA9R,UAAA,SAAA,SAAAsY,EAAAI,GACA,IAAAW,EACAN,EACA3Z,EACA6R,EACAsG,EACAhP,EACApJ,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA2Y,EAAA,EACAI,EAAAnQ,MACA,CACA,IAAAV,GAAAyQ,GACA,MAAA,IAAApV,UAAAiB,EAAA,oEAAAmU,IAQA,GANAA,EAAA,IACAA,GAAA/P,GACA,IACA+P,EAAA,GAGA,IAAAjV,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAQA,IANA8Q,EADAf,EAAAI,EACAA,EAAAJ,EAEA,EAGAS,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAoN,IACAjC,QACAjY,EAAA,EAAAA,EAAAka,EAAAla,IACA8R,EAAA,GAAA9R,EAAAmZ,GACAS,EAAA,EAAA5Z,GAAAoY,EAAAtG,GACA8H,EAAA,EAAA5Z,EAAA,GAAAoY,EAAAtG,EAAA,GAEA,OAAA7R,CACA,IA+BAmI,EAAAuK,GAAA9R,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,GAAAmJ,EAAArH,KAAA8W,EAAAT,GAAAC,EAAApY,GAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA6EAvP,EAAA+L,GAAA9R,UAAA,QAAA,SAAAsZ,GACA,IAAArB,EACAV,EACAhP,EACApJ,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACAc,EAAA,GACA9Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8Y,EAAA/T,KAAAoT,GAAAC,EAAApY,IAGA,IADA8Y,EAAAsB,KAAAD,GACAna,EAAA,EAAAA,EAAAoJ,EAAApJ,IAEAoY,EADAtU,EAAA,EAAA9D,GACA4X,GAAAkB,EAAA9Y,IACAoY,EAAAtU,EAAA,GAAA+T,GAAAiB,EAAA9Y,IAEA,OAAAmW,IACA,IA2EA/N,EAAAuK,GAAA9R,UAAA,YAAA,SAAAwZ,EAAAd,GACA,IAAAlC,EACAe,EACAhP,EACA,IAAA2O,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA6Z,EAAA,EACAd,EAAAnQ,MACA,CACA,IAAAV,GAAA2R,GACA,MAAA,IAAAtW,UAAAiB,EAAA,oEAAAqV,IAQA,GANAA,EAAA,IACAA,GAAAjR,GACA,IACAiR,EAAA,GAGA,IAAAnW,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAWA,OAVAiR,GAAAjR,GACAA,EAAA,EACAiO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAnQ,EAAA,EACAiO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA5H,EAAAmQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAjO,EAAA,EAAA,EAAAA,EACA,IAwBAhB,EAAAuK,GAAA9R,UAAA,kBAAA,SAAAyZ,EAAAC,GACA,IAAAnL,EACAoL,EACAva,EACAmY,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAga,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,yFAAAsV,IAFAE,EAAAF,CAGA,CACA,GAAApW,UAAA1D,OAAA,EACA4O,EAAA,CAAA,MACA,KAAAjH,GAAAoS,GAGA,MAAA,IAAAxW,UAAAiB,EAAA,qEAAAuV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAAoT,GAAAC,EAAApY,GAAAya,eAAAD,EAAApL,IAEA,OAAAnP,EAAA0Z,KAAA,IACA,IAmDA/S,EAAA+L,GAAA9R,UAAA,cAAA,WACA,IAAA+Y,EACA3Z,EACAmJ,EACAgP,EACApY,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAMA,IAJAqF,EAAA+M,KAAA6B,QACA/X,EAAA,IAAAkW,KAAArJ,YAAA1D,GACAgP,EAAAjC,KAAA8B,QACA2B,EAAA3Z,EAAAgY,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8D,EAAAsF,EAAApJ,EAAA,EACA4Z,EAAA,EAAA5Z,GAAAoY,EAAA,EAAAtU,GACA8V,EAAA,EAAA5Z,EAAA,GAAAoY,EAAA,EAAAtU,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA+L,GAAA9R,UAAA,YAAA,SAAAsZ,GACA,IAAArB,EACAV,EACAhP,EACApJ,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACAc,EAAA,GACA9Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8Y,EAAA/T,KAAAoT,GAAAC,EAAApY,IAGA,OADA8Y,EAAAsB,KAAAD,GACA,IAAAxH,GAAAmG,EACA,IAoBAlS,EAAA+L,GAAA9R,UAAA,YAAA,WACA,IAAAZ,EACAmY,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,IAFA9D,EAAA,GACAmY,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAAoT,GAAAC,EAAApY,GAAAyB,YAEA,OAAAxB,EAAA0Z,KAAA,IACA,IA0CA/S,EAAA+L,GAAA9R,UAAA,UAAA,WACA,IAAAwY,EACAvP,EACAV,EACApC,EACAoR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAiBA,OAfA+F,EAAAqM,KACAiC,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAAsY,GAAAC,EAAApY,GACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAA4Q,QACA,IAjDArB,CAkDA,IAuCAjR,EAAAuK,GAAA9R,UAAA,QAAA,SAAA8Z,EAAA9a,GACA,IAAAuY,EACAnY,EACAmJ,EACA,IAAA2O,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA2E,GAAAiS,GACA,MAAA,IAAA5W,UAAAiB,EAAA,oEAAA2V,IAMA,GAJAvR,EAAA+M,KAAA6B,QACA2C,EAAA,IACAA,GAAAvR,GAEAuR,EAAA,GAAAA,GAAAvR,EACA,MAAA,IAAAmP,WAAAvT,EAAA,kEAAA2V,IAEA,IAAA/D,GAAA/W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAuY,GADAnY,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA8B,UACAA,SACA,EAAA0C,GAAA/C,GAAA/X,GACAuY,EAAA,EAAAuC,EAAA,GAAA9C,GAAAhY,GACAI,CACA,IM15FA,IAAA+Q,GAAA,EAAAoB,GAAApB,kBACA8G,GAAAd,KAYA,SAAAe,GAAAlY,GACA,OACAA,aAAA+S,IAEA,iBAAA/S,GACA,OAAAA,IAEA,mBAAAA,EAAAiN,YAAAE,MACA,oBAAAnN,EAAAiN,YAAAE,OAEA,iBAAAnN,EAAAmY,SAGA,iBAAAnY,EAAAoY,OAGA,CASA,SAAAC,GAAArY,GACA,OACAA,IAAA+S,IAGA,mBAAA/S,EAAAmN,IAEA,CAUA,SAAA4N,GAAAxC,EAAAtG,GAEA,OAAA,IAAAkE,GAAAoC,EADAtG,GAAA,GACAsG,EAAAtG,EAAA,GACA,CAyEA,SAAAc,KACA,IAAA2E,EACAc,EACAD,EACAhP,EAGA,GADAiP,EAAAnU,UAAA1D,SACA2V,gBAAAvD,IACA,OAAA,IAAAyF,EACA,IAAAzF,GAEA,IAAAyF,EACA,IAAAzF,GAAA1O,UAAA,IAEA,IAAAmU,EACA,IAAAzF,GAAA1O,UAAA,GAAAA,UAAA,IAEA,IAAA0O,GAAA1O,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAmU,EACAD,EAAA,IAAAhG,GAAA,QACA,GAAA,IAAAiG,EACA,GAAArP,GAAA9E,UAAA,IACAkU,EAAA,IAAAhG,GAAA,EAAAlO,UAAA,SACA,GAAA8H,GAAA9H,UAAA,IAKA,IAHAkF,GADAgP,EAAAlU,UAAA,IACA1D,SAGA0C,GAAAkV,IAAAxB,GAAAwB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnM,GACxB,IAAI7C,EACAxB,EACA5H,EACA8D,EAIJ,IAFAsF,EAAM6C,EAAIzL,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,IAAM4W,GADNhP,EAAIqE,EAAKjM,IAER,OAAO,KAERoY,EAAKtU,GAAMmS,GAAMrO,GACjBwQ,EAAKtU,EAAE,GAAMoS,GAAMtO,GACnB9D,GAAK,CACL,CACD,OAAOsU,CACR,CDsKAE,CAAA,IAAAlG,GAAA,EAAAhJ,GAAAgP,GACA,OAAAA,EAAA,CAEA,IAAAvB,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,6GAAAoE,IAGAgP,EAAA,IAAAhG,GAAAlO,UAAA,GACA,MACA,CACA,GAAA4S,GAAAsB,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAArB,GAAAqB,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAvB,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,6HAAAoE,IAEAgP,EAAA,IAAAhG,GAAAgG,EACA,MACA,GAAAtC,GAAA5R,UAAA,IAAA,CAEA,IAAAwE,IADA0P,EAAAlU,UAAA,IACA+M,WAAAD,IACA,MAAA,IAAAuH,WAAAvT,EAAA,yFAAAgM,GAAAoH,EAAAnH,aAEAmH,EAAA,IAAAhG,GAAAgG,EACA,KAAA,KAAAjQ,GAAAjE,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAkU,EAAAlU,UAAA,IACA,IAAA4T,GACA,MAAA,IAAA/T,UAAAiB,EAAA,mJAAAoT,IAEA,IAAA5J,GAAA4J,EAAAM,KACA,MAAA,IAAA3U,UAAAiB,EAAA,qHAAAoT,IAGA,IAAA5J,IADA4J,EAAAA,EAAAM,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,qHAAAoT,IAGA,IADAA,EAAAZ,GAAAY,cACA5W,MACA,MAAA4W,EAEAA,EAAA,IAAAhG,GAAAgG,EAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAlU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAoT,IAGA,IAAApP,GADAuO,EAAArT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAuS,IAEA,IAAA7O,GAAA6O,EAAAvG,IACA,MAAA,IAAAuH,WAAAvT,EAAA,uEAAAgM,GAAAuG,IAEA,GAAA,IAAAc,EAAA,CAEA,IAAA3P,IADAU,EAAAgP,EAAAnH,WAAAsG,GACAvG,IACA,MAAA,IAAAuH,WAAAvT,EAAA,oGAAAgM,GAAA5H,IAEAgP,EAAA,IAAAhG,GAAAgG,EAAAb,EACA,KAAA,CAEA,IAAAvO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA4H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAvT,EAAA,iJAAAoE,EAAA4H,KAEAoH,EAAA,IAAAhG,GAAAgG,EAAAb,EAAA,EAAAnO,EACA,CACA,CAIA,OAHAhB,EAAA+N,KAAA,UAAAiC,GACAhQ,EAAA+N,KAAA,UAAAiC,EAAA5X,OAAA,GAEA2V,IACA,CEzQA,SAASqB,GAAcC,GACtB,IAAIxX,EACA2H,EAGJ,IADA3H,EAAM,KAEL2H,EAAI6P,EAAGC,QACAC,MAGP1X,EAAI8E,KAAM8E,GAASjC,EAAE/H,QAEtB,OAAOI,CACR,CF2QAmI,EAAAwK,GAAA,oBAAA5B,IAeA5I,EAAAwK,GAAA,OAAA,mBAmDAhM,EAAAgM,GAAA,QAAA,SAAA+F,GACA,IAAAC,EACAP,EACAQ,EACA5Y,EACAmY,EACAU,EACArS,EACA2C,EACA2P,EACAnR,EACA5H,EACA8D,EACA,IAAA0K,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAmU,GAAA/B,MACA,MAAA,IAAApS,UAAA,6DAGA,IADAsU,EAAAnU,UAAA1D,QACA,EAAA,CAEA,IAAAgO,GADAqK,EAAA3U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA6T,IAEAR,EAAA,IACAO,EAAA1U,UAAA,GAEA,CACA,GAAA6T,GAAAY,GAAA,CAEA,GADAvP,EAAAuP,EAAAnY,OACAqY,EAAA,CAIA,IAFAT,GADAnY,EAAA,IAAAkW,KAAA/M,IACA6O,QACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA4W,GADAhP,EAAAiR,EAAA/W,KAAA8W,EAAAD,EAAAlS,IAAAzG,GAAAA,IAEAoY,EAAAtU,GAAAmS,GAAArO,GACAwQ,EAAAtU,EAAA,GAAAoS,GAAAtO,OACA,MAAA+N,GAAA/N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAwQ,EAAAtU,GAAA8D,EAAA,GACAwQ,EAAAtU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAkW,KAAAwC,EACA,CACA,GAAA3M,GAAA2M,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAzP,EAAAuP,EAAAnY,OAEAiG,EADAkS,EAAAlS,KAAAkS,EAAAjS,IACAsS,GAAA,WAEApO,GAAA,WAGA5K,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA,IAAA4W,GAAAnQ,EAAAkS,EAAA3Y,IAAA,CACA+Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAzN,GACA,MAAA,IAAAmP,WAAAvT,EAAA,gGAAAoE,IAIA,IADAgP,GADAnY,EAAA,IAAAkW,KAAA/M,EAAA,IACA6O,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA6Y,EAAA/W,KAAA8W,EAAAnS,EAAAkS,EAAA3Y,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAmY,GADAnY,EAAA,IAAAkW,KAAA/M,IACA6O,QACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAoJ,EAAApJ,IAAA,CAEA,GAAA4W,GADAhP,EAAAiR,EAAA/W,KAAA8W,EAAAnS,EAAAkS,EAAA3Y,GAAAA,IAEAoY,EAAAtU,GAAAmS,GAAArO,GACAwQ,EAAAtU,EAAA,GAAAoS,GAAAtO,OACA,MAAA+N,GAAA/N,IAAAA,EAAApH,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAwQ,EAAAtU,GAAA8D,EAAA,GACAwQ,EAAAtU,EAAA,GAAA8D,EAAA,EAGA,CACA9D,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAkW,KAAAwC,EACA,CACA,GAAAxQ,GAAAwQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,6FAAA2T,IAOA,GAJAG,EADAD,EG/bA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI3Y,EACA2H,EACAuP,EACAnX,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI6P,EAAGC,QACAC,MAKP,GAFA3X,GAAK,EAEA2V,GADLwB,EAAI0B,EAAK/W,KAAM8W,EAAShR,EAAE/H,MAAOG,KACFmX,EAAE3W,QAAU,EAC1CP,EAAI8E,KAAMoS,EAAG,GAAKA,EAAG,QACf,KAAKP,GAAeO,GAG1B,OAAO,IAAIpT,UAAWiB,EAAQ,+IAAgJmS,IAF9KlX,EAAI8E,KAAMkR,GAAMkB,GAAKjB,GAAMiB,GAG3B,CAEF,OAAOlX,CACR,CHwaAgZ,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAEAU,aAAAtX,MACA,MAAAsX,EAKA,IADAV,GADAnY,EAAA,IAAAkW,KADA/M,EAAA0P,EAAAtY,OAAA,IAEAyX,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA8Y,EAAA9Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA2T,GACA,IAoBAvQ,EAAAwK,GAAA,MAAA,WACA,IAAA3N,EACAjF,EACA,IAAAwO,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAmU,GAAA/B,MACA,MAAA,IAAApS,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAmW,KAAAlR,EACA,IAwDA2B,EAAAgM,GAAA/R,UAAA,MAAA,SAAAiR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA2E,GAAAoJ,GACA,MAAA,IAAA/N,UAAAiB,EAAA,0DAAA8M,IAKA,GAHAA,EAAA,IACAA,GAAAqE,KAAA6B,WAEAlG,EAAA,GAAAA,GAAAqE,KAAA6B,SAGA,OAAA4C,GAAAzE,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAiI,GAAA/R,UAAA,UAAA,WACA,OAAAsV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAiI,GAAA/R,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAiI,GAAA/R,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAV,UACA,IAiBA3Q,EAAAgM,GAAA/R,UAAA,oBAAA+R,GAAA5B,mBAuCA5I,EAAAwK,GAAA/R,UAAA,cAAA,SAAAqY,EAAAC,GACA,IAAApB,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA2V,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAAjV,UAAA,IAEAiS,IACA,IAqCAvP,EAAAgM,GAAA/R,UAAA,WAAA,WACA,IAAAyW,EACAxN,EACAuP,EACAjQ,EACApC,EACAhH,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAkBA,OAhBA+F,EAAAqM,KACAmB,EAAAnB,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EACA8D,GAAA,EAIAsE,EADAiR,EAAA,CAAA,EACA,QAcA,WACA,IAAAlC,EAEA,GADAnX,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAKA,OADAR,EAAA,IAAAnB,GAAAsB,EADAxT,GAAA,GACAwT,EAAAxT,EAAA,IACA,CACAjE,MAAA,CAAAG,EAAAmX,GACAQ,MAAA,EAEA,IA3BAvP,EAAAiR,EAAA,UAoCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA7CAe,IACAtQ,EAAAiR,EAAAX,IAoDA,WACA,OAAA5O,EAAAwP,SACA,IApDAD,CAqDA,IA+BAjR,EAAAwK,GAAA/R,UAAA,SAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,IAAAmJ,EAAArH,KAAA8W,EAAAgC,GAAAxC,EAAApY,GAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA2CA/N,EAAAwK,GAAA/R,UAAA,QAAA,SAAAhB,EAAAsZ,EAAAI,GACA,IAAAnB,EACAhP,EACA0I,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA/W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAuY,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyQ,GACA,MAAA,IAAApV,UAAAiB,EAAA,qEAAAmU,IAQA,GANAA,EAAA,IACAA,GAAA/P,GACA,IACA+P,EAAA,GAGAjV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAEAA,EAAA,IACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAGAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,MACAmQ,EAAAnQ,CAEA,MACA+P,EAAA,EACAI,EAAAnQ,EAIA,IAFAiN,EAAAJ,GAAApW,GACAyW,EAAAJ,GAAArW,GACAG,EAAAmZ,EAAAnZ,EAAAuZ,EAAAvZ,IAEAoY,EADAtG,EAAA,EAAA9R,GACAqW,EACA+B,EAAAtG,EAAA,GAAAwE,EAEA,OAAAH,IACA,IA2CA/N,EAAAwK,GAAA/R,UAAA,UAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAnY,EACAD,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAiP,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAmX,EAAAyD,GAAAxC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,OACAlW,EAAA8E,KAAAoS,GAGA,OAAA,IAAAhB,KAAArJ,YAAA7M,EACA,IAqCAmI,EAAAwK,GAAA/R,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADAmX,EAAAyD,GAAAxC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAgB,CAGA,IA+BA/O,EAAAwK,GAAA/R,UAAA,aAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADAmX,EAAAyD,GAAAxC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IAqCAoI,EAAAwK,GAAA/R,UAAA,YAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADAmX,EAAAyD,GAAAxC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAgB,CAGA,IA+BA/O,EAAAwK,GAAA/R,UAAA,iBAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADAmX,EAAAyD,GAAAxC,EAAApY,GACAmJ,EAAArH,KAAA8W,EAAAzB,EAAAnX,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IA4BAoI,EAAAwK,GAAA/R,UAAA,WAAA,SAAA2Y,EAAAZ,GACA,IAAAR,EACApY,EACAmX,EACA,IAAAY,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAAiB,EAAA,oEAAAwU,IAGA,IADApB,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAmX,EAAAyD,GAAAxC,EAAApY,GACAwZ,EAAA1X,KAAA8W,EAAAzB,EAAAnX,EAAAmW,KAEA,IAyCAvP,EAAAgM,GAAA/R,UAAA,OAAA,SAAAiR,GACA,IAAAiG,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAiF,GAAA8I,GACA,MAAA,IAAA/N,UAAAiB,EAAA,qEAAA8M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAA4C,GAAAzE,KAAA8B,QAAAnG,EACA,IAgBAnH,GAAAiI,GAAA/R,UAAA,UAAA,WACA,OAAAsV,KAAA6B,OACA,IAmCA5P,EAAAwK,GAAA/R,UAAA,YAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCA1J,EAAAwK,GAAA/R,UAAA,WAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAkK,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA9R,EAGA,OAAA,CACA,IAyBA4G,EAAAgM,GAAA/R,UAAA,QAAA,SAAA4Y,GACA,IAAAxZ,EACAmY,EACAsB,EACA1Z,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkZ,EAAA,QACA,KAAA7O,GAAA4O,GAGA,MAAA,IAAA1V,UAAAiB,EAAA,kEAAAyU,IAFAC,EAAAD,CAGA,CAGA,IAFAxZ,EAAA,GACAmY,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAA6V,GAAAxC,EAAApY,GAAAyB,YAEA,OAAAxB,EAAA0Z,KAAAD,EACA,IA4BA9S,EAAAgM,GAAA/R,UAAA,QAAA,WACA,IAAAiJ,EACAuP,EACAjQ,EACApC,EACAhH,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAgBA,OAdA+F,EAAAqM,KACA/M,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAAG,EACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAAiB,MACA,IAjDAsO,CAkDA,IAsCAjR,EAAAwK,GAAA/R,UAAA,eAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACAtG,EACAuE,EACAC,EACAtW,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA6S,GAAA1K,GACA,MAAA,IAAAnI,UAAAiB,EAAA,0EAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAKA,IAHA3B,EAAAJ,GAAA/J,GACAoK,EAAAJ,GAAAhK,GACAkM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,GAAA,EAAAA,IAEA,GAAAqW,IAAA+B,EADAtG,EAAA,EAAA9R,IACAsW,IAAA8B,EAAAtG,EAAA,GACA,OAAA9R,EAGA,OAAA,CACA,IAyCAoI,EAAAwK,GAAA/R,UAAA,OAAA,SAAA2Y,EAAAZ,GACA,IAAAgB,EACAxB,EACAnY,EACAD,EACA4H,EACA,IAAAmQ,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAAiB,EAAA,oEAAAwU,IAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GAAA4W,GADAhP,EAAA4R,EAAA1X,KAAA8W,EAAAgC,GAAAxC,EAAApY,GAAAA,EAAAmW,OAEAyD,EAAA,EAAA5Z,GAAAiW,GAAArO,GACAgS,EAAA,EAAA5Z,EAAA,GAAAkW,GAAAtO,OACA,KAAA+N,GAAA/N,IAAA,IAAAA,EAAApH,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAA4C,IAHAgS,EAAA,EAAA5Z,GAAA4H,EAAA,GACAgS,EAAA,EAAA5Z,EAAA,GAAA4H,EAAA,EAGA,CAEA,OAAA3H,CACA,IAmCAmI,EAAAwK,GAAA/R,UAAA,UAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACA2B,EACA3Q,EAEApJ,EAEA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAAa,GAAAxC,EAAA,GACApY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IAEA+Z,EAAAF,EAAAE,EADAa,GAAAxC,EAAApY,GACAA,EAAAmW,MAEA,OAAA4D,CACA,IAmCA3R,EAAAwK,GAAA/R,UAAA,eAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACA2B,EACA3Q,EAEApJ,EAEA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAAa,GAAAxC,EAAAhP,EAAA,GACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IAEA+Z,EAAAF,EAAAE,EADAa,GAAAxC,EAAApY,GACAA,EAAAmW,MAEA,OAAA4D,CACA,IAmDAnT,EAAAgM,GAAA/R,UAAA,WAAA,WACA,IAAAuX,EACAU,EACA1P,EACA4Q,EACAha,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAKA,IAHAqF,EAAA+M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACA+B,EAAAvR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAAga,EAAAha,IACA8D,EAAAsF,EAAApJ,EAAA,EACA8Y,EAAAV,EAAA,EAAApY,GACAoY,EAAA,EAAApY,GAAAoY,EAAA,EAAAtU,GACAsU,EAAA,EAAAtU,GAAAgV,EACAA,EAAAV,EAAA,EAAApY,EAAA,GACAoY,EAAA,EAAApY,EAAA,GAAAoY,EAAA,EAAAtU,EAAA,GACAsU,EAAA,EAAAtU,EAAA,GAAAgV,EAEA,OAAA3C,IACA,IAgEAvP,EAAAgM,GAAA/R,UAAA,OAAA,SAAAhB,GAEA,IAAAoa,EACAnI,EACAsG,EACAU,EACAC,EACAiB,EACApS,EACA5H,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAGA,GADAqU,EAAAjC,KAAA8B,QACA/T,UAAA1D,OAAA,GAEA,IAAAwI,GADA8I,EAAA5N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8M,SAGAA,EAAA,EAEA,GAAA8E,GAAA/W,GAAA,CACA,GAAAiS,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAvT,EAAA,kEAAA8M,IAKA,OAFAsG,EADAtG,GAAA,GACAmE,GAAApW,QACAuY,EAAAtG,EAAA,GAAAoE,GAAArW,GAEA,CACA,GAAAkY,GAAAlY,GAAA,CAEA,GAAAiS,GADAkI,EAAAna,EAAAmY,SACA7B,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAApa,EAAAoY,QAGAnU,EAAAsU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAzT,GACAmW,EAAA1C,WAAA0C,EAAAhJ,WAAAnN,EAEA,CAGA,IADAgV,EAAA,IAAA1G,GAAA6H,EAAAzZ,QACAR,EAAA,EAAAA,EAAAia,EAAAzZ,OAAAR,IACA8Y,EAAA9Y,GAAAia,EAAAja,GAEAia,EAAAnB,CACA,CAGA,IAFAhH,GAAA,EACAhO,EAAA,EACA9D,EAAA,EAAAA,EAAAga,EAAAha,IACAoY,EAAAtG,GAAAmI,EAAAnW,GACAsU,EAAAtG,EAAA,GAAAmI,EAAAnW,EAAA,GACAgO,GAAA,EACAhO,GAAA,CAGA,KAhCA,CAiCA,IAAAkI,GAAAnM,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAma,EAAAna,EAAAW,OACAR,EAAA,EAAAA,EAAAga,EAAAha,IACA,IAAA4W,GAAA/W,EAAAG,IAAA,CACA+Y,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAAlC,GAAAmD,GACA,MAAA,IAAAzB,WAAAvT,EAAA,6GAAAgV,IAEA,GAAAlI,EAAAkI,EAAA,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA0B,EAAApa,EAGAiE,EAAAsU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAzT,GACAmW,EAAA1C,WAAA0C,EAAAhJ,WAAAnN,EAEA,CAGA,IADAgV,EAAA,IAAA1G,GAAA4H,GACAha,EAAA,EAAAA,EAAAga,EAAAha,IACA8Y,EAAA9Y,GAAAia,EAAAja,GAEAia,EAAAnB,CACA,CAIA,IAHAhH,GAAA,EACAkI,GAAA,EACAlW,EAAA,EACA9D,EAAA,EAAAA,EAAAga,EAAAha,IACAoY,EAAAtG,GAAAmI,EAAAnW,GACAsU,EAAAtG,EAAA,GAAAmI,EAAAnW,EAAA,GACAgO,GAAA,EACAhO,GAAA,EAEA,MACA,CAEA,GAAAgO,EAAAkI,EAAA7D,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAzG,GAAA,EACA9R,EAAA,EAAAA,EAAAga,EAAAha,IACA4H,EAAA/H,EAAAG,GACAoY,EAAAtG,GAAAmE,GAAArO,GACAwQ,EAAAtG,EAAA,GAAAoE,GAAAtO,GACAkK,GAAA,CAxDA,CA+DA,IA2EA1J,EAAAwK,GAAA/R,UAAA,SAAA,SAAAsY,EAAAI,GACA,IAAAW,EACAN,EACA3Z,EACA6R,EACAsG,EACAhP,EACApJ,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA2Y,EAAA,EACAI,EAAAnQ,MACA,CACA,IAAAV,GAAAyQ,GACA,MAAA,IAAApV,UAAAiB,EAAA,oEAAAmU,IAQA,GANAA,EAAA,IACAA,GAAA/P,GACA,IACA+P,EAAA,GAGA,IAAAjV,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAQA,IANA8Q,EADAf,EAAAI,EACAA,EAAAJ,EAEA,EAGAS,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAoN,IACAjC,QACAjY,EAAA,EAAAA,EAAAka,EAAAla,IACA8R,EAAA,GAAA9R,EAAAmZ,GACAS,EAAA,EAAA5Z,GAAAoY,EAAAtG,GACA8H,EAAA,EAAA5Z,EAAA,GAAAoY,EAAAtG,EAAA,GAEA,OAAA7R,CACA,IA+BAmI,EAAAwK,GAAA/R,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,GAAAmJ,EAAArH,KAAA8W,EAAAgC,GAAAxC,EAAApY,GAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA6EAvP,EAAAgM,GAAA/R,UAAA,QAAA,SAAAsZ,GACA,IAAArB,EACAV,EACAhP,EACApJ,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACAc,EAAA,GACA9Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8Y,EAAA/T,KAAA6V,GAAAxC,EAAApY,IAGA,IADA8Y,EAAAsB,KAAAD,GACAna,EAAA,EAAAA,EAAAoJ,EAAApJ,IAEAoY,EADAtU,EAAA,EAAA9D,GACAiW,GAAA6C,EAAA9Y,IACAoY,EAAAtU,EAAA,GAAAoS,GAAA4C,EAAA9Y,IAEA,OAAAmW,IACA,IA2EA/N,EAAAwK,GAAA/R,UAAA,YAAA,SAAAwZ,EAAAd,GACA,IAAAlC,EACAe,EACAhP,EACA,IAAA2O,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA6Z,EAAA,EACAd,EAAAnQ,MACA,CACA,IAAAV,GAAA2R,GACA,MAAA,IAAAtW,UAAAiB,EAAA,oEAAAqV,IAQA,GANAA,EAAA,IACAA,GAAAjR,GACA,IACAiR,EAAA,GAGA,IAAAnW,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAWA,OAVAiR,GAAAjR,GACAA,EAAA,EACAiO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAnQ,EAAA,EACAiO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA5H,EAAAmQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAjO,EAAA,EAAA,EAAAA,EACA,IAwBAhB,EAAAwK,GAAA/R,UAAA,kBAAA,SAAAyZ,EAAAC,GACA,IAAAnL,EACAoL,EACAva,EACAmY,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAga,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,yFAAAsV,IAFAE,EAAAF,CAGA,CACA,GAAApW,UAAA1D,OAAA,EACA4O,EAAA,CAAA,MACA,KAAAjH,GAAAoS,GAGA,MAAA,IAAAxW,UAAAiB,EAAA,qEAAAuV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAA6V,GAAAxC,EAAApY,GAAAya,eAAAD,EAAApL,IAEA,OAAAnP,EAAA0Z,KAAA,IACA,IAmDA/S,EAAAgM,GAAA/R,UAAA,cAAA,WACA,IAAA+Y,EACA3Z,EACAmJ,EACAgP,EACApY,EACA8D,EACA,IAAAiU,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAMA,IAJAqF,EAAA+M,KAAA6B,QACA/X,EAAA,IAAAkW,KAAArJ,YAAA1D,GACAgP,EAAAjC,KAAA8B,QACA2B,EAAA3Z,EAAAgY,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8D,EAAAsF,EAAApJ,EAAA,EACA4Z,EAAA,EAAA5Z,GAAAoY,EAAA,EAAAtU,GACA8V,EAAA,EAAA5Z,EAAA,GAAAoY,EAAA,EAAAtU,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAAgM,GAAA/R,UAAA,YAAA,SAAAsZ,GACA,IAAArB,EACAV,EACAhP,EACApJ,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAAyK,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAKA,IAHA/B,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACAc,EAAA,GACA9Y,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA8Y,EAAA/T,KAAA6V,GAAAxC,EAAApY,IAGA,OADA8Y,EAAAsB,KAAAD,GACA,IAAAvH,GAAAkG,EACA,IAoBAlS,EAAAgM,GAAA/R,UAAA,YAAA,WACA,IAAAZ,EACAmY,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAIA,IAFA9D,EAAA,GACAmY,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAA6V,GAAAxC,EAAApY,GAAAyB,YAEA,OAAAxB,EAAA0Z,KAAA,IACA,IA2CA/S,EAAAgM,GAAA/R,UAAA,UAAA,WACA,IAAAwY,EACAvP,EACAV,EACApC,EACAoR,EACApY,EACA,IAAA+X,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAiBA,OAfA+F,EAAAqM,KACAiC,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAA+a,GAAAxC,EAAApY,GACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAA4Q,QACA,IAjDArB,CAkDA,IAuCAjR,EAAAwK,GAAA/R,UAAA,QAAA,SAAA8Z,EAAA9a,GACA,IAAAuY,EACAnY,EACAmJ,EACA,IAAA2O,GAAA5B,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA2E,GAAAiS,GACA,MAAA,IAAA5W,UAAAiB,EAAA,oEAAA2V,IAMA,GAJAvR,EAAA+M,KAAA6B,QACA2C,EAAA,IACAA,GAAAvR,GAEAuR,EAAA,GAAAA,GAAAvR,EACA,MAAA,IAAAmP,WAAAvT,EAAA,kEAAA2V,IAEA,IAAA/D,GAAA/W,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAuY,GADAnY,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA8B,UACAA,SACA,EAAA0C,GAAA1E,GAAApW,GACAuY,EAAA,EAAAuC,EAAA,GAAAzE,GAAArW,GACAI,CACA,IIt6FA,IAAA+Q,GAAAyB,GAAAzB,kBACA8G,GAAAd,KAYA,SAAA6D,GAAAhb,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAiN,YAAAE,MACAnN,EAAAmR,oBAAAA,EAEA,CASA,SAAA8J,GAAAjb,GACA,OAAAA,IAAAgT,EACA,CAoEA,SAAAA,KACA,IAAA0E,EACAc,EACAD,EACAhP,EACA/H,EAGA,GADAgX,EAAAnU,UAAA1D,SACA2V,gBAAAtD,IACA,OAAA,IAAAwF,EACA,IAAAxF,GAEA,IAAAwF,EACA,IAAAxF,GAAA3O,UAAA,IAEA,IAAAmU,EACA,IAAAxF,GAAA3O,UAAA,GAAAA,UAAA,IAEA,IAAA2O,GAAA3O,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAmU,EACAD,EAAA,IAAA3F,GAAA,QACA,GAAA,IAAA4F,EAEA,GAAArP,GADA3H,EAAA6C,UAAA,IAEAkU,EAAA,IAAA3F,GAAApR,QACA,GAAA2K,GAAA3K,GACA+W,EC9IA,SAAoBA,EAAKnM,GACxB,IAAI7C,EACApJ,EAGJ,IADAoJ,EAAM6C,EAAIzL,OACJR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBoY,EAAKpY,GAAM6J,GAASoC,EAAKjM,IAE1B,OAAOoY,CACR,CDqIAE,CAAA,IAAA7F,GAAApR,EAAAb,QAAAa,QACA,GAAAyU,GAAAzU,GACA+W,EAAA,IAAA3F,GAAApR,OACA,KAAA8G,GAAA9G,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAyW,GACA,MAAA,IAAA/T,UAAAiB,EAAA,mJAAA3D,IAEA,IAAAmN,GAAAnN,EAAAqX,KACA,MAAA,IAAA3U,UAAAiB,EAAA,qHAAA3D,IAGA,IAAAmN,IADA4J,EAAA/W,EAAAqX,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,qHAAA3D,IAEA+W,EAAA,IAAA3F,GAAA+E,GAAAY,GAGA,KACA,CAEA,IAAAtC,GADAsC,EAAAlU,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAoT,IAGA,IAAApP,GADAuO,EAAArT,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAuS,IAEA,GAAA,IAAAc,EACAD,EAAA,IAAA3F,GAAA2F,EAAAb,OACA,CAEA,IAAAvO,GADAI,EAAAlF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAoE,IAEA,GAAAA,EAAA4H,GAAAoH,EAAAnH,WAAAsG,EACA,MAAA,IAAAgB,WAAAvT,EAAA,iJAAAoE,EAAA4H,KAEAoH,EAAA,IAAA3F,GAAA2F,EAAAb,EAAAnO,EACA,CACA,CAIA,OAHAhB,EAAA+N,KAAA,UAAAiC,GACAhQ,EAAA+N,KAAA,UAAAiC,EAAA5X,QAEA2V,IACA,CAeA/N,EAAAyK,GAAA,oBAAA7B,IAeA5I,EAAAyK,GAAA,OAAA,gBAmCAjM,EAAAiM,GAAA,QAAA,SAAA8F,GACA,IAAAC,EACAP,EACAQ,EACA5Y,EACAmY,EACAU,EACArS,EACA2C,EACApJ,EACA,IAAAwO,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA+W,GAAA3E,MACA,MAAA,IAAApS,UAAA,sDAGA,IADAsU,EAAAnU,UAAA1D,QACA,EAAA,CAEA,IAAAgO,GADAqK,EAAA3U,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA6T,IAEAR,EAAA,IACAO,EAAA1U,UAAA,GAEA,CACA,GAAA8H,GAAA2M,GAAA,CACA,GAAAE,EAAA,CASA,IARAzP,EAAAuP,EAAAnY,OAEAiG,EADAkS,EAAAlS,KAAAkS,EAAAjS,IACAsS,GAAA,WAEApO,GAAA,WAGAwN,GADAnY,EAAA,IAAAkW,KAAA/M,IACA6O,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA6J,GAAAgP,EAAA/W,KAAA8W,EAAAnS,EAAAkS,EAAA3Y,GAAAA,IAEA,OAAAC,CACA,CACA,OAAA,IAAAkW,KAAAwC,EACA,CACA,GAAAxQ,GAAAwQ,IAAAb,IAAAtJ,GAAAmK,EAAAD,KAAA,CAEA,IAAAlK,IADA4J,EAAAO,EAAAD,OACAhB,MACA,MAAA,IAAA3T,UAAAiB,EAAA,6FAAA2T,IAUA,IAPAG,EADAD,EE1SA,SAA0BpB,EAAIoB,EAAMD,GACnC,IAAI3Y,EACA2H,EACA5H,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJ4H,EAAI6P,EAAGC,QACAC,MAGP3X,GAAK,EACLC,EAAI8E,KAAM8E,GAASgP,EAAK/W,KAAM8W,EAAShR,EAAE/H,MAAOG,KAEjD,OAAOC,CACR,CF2RAgZ,CAAAb,EAAAS,EAAAD,GAEApB,GAAAY,GAIAA,GADAnY,EAAA,IAAAkW,KADA/M,EAAA0P,EAAAtY,SAEAyX,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACAoY,EAAApY,GAAA8Y,EAAA9Y,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA2T,GACA,IAoBAvQ,EAAAyK,GAAA,MAAA,WACA,IAAA5N,EACAjF,EACA,IAAAwO,GAAA2H,MACA,MAAA,IAAApS,UAAA,6DAEA,IAAA+W,GAAA3E,MACA,MAAA,IAAApS,UAAA,sDAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAmW,KAAAlR,EACA,IA6BA2B,EAAAiM,GAAAhS,UAAA,MAAA,SAAAiR,GACA,IAAAsG,EACAhP,EAEA,IAAAyR,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA2E,GAAAoJ,GACA,MAAA,IAAA/N,UAAAiB,EAAA,0DAAA8M,IAOA,GALA1I,EAAA+M,KAAA6B,QACAI,EAAAjC,KAAA8B,QACAnG,EAAA,IACAA,GAAA1I,KAEA0I,EAAA,GAAAA,GAAA1I,GAGA,OAAAS,GAAAuO,EAAAtG,GACA,IAgBAnH,GAAAkI,GAAAhS,UAAA,UAAA,WACA,OAAAsV,KAAA8B,QAAAX,MACA,IAgBA3M,GAAAkI,GAAAhS,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAhH,UACA,IAgBAtG,GAAAkI,GAAAhS,UAAA,cAAA,WACA,OAAAsV,KAAA8B,QAAAV,UACA,IAiBA3Q,EAAAiM,GAAAhS,UAAA,oBAAAgS,GAAA7B,mBA+BA5I,EAAAyK,GAAAhS,UAAA,cAAA,SAAAqY,EAAAC,GACA,IAAA0B,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAQA,OALA,IAAAG,UAAA1D,OACA2V,KAAA8B,QAAAmB,WAAAF,EAAAC,GAEAhD,KAAA8B,QAAAmB,WAAAF,EAAAC,EAAAjV,UAAA,IAEAiS,IACA,IAgCAvP,EAAAiM,GAAAhS,UAAA,WAAA,WACA,IAAAiJ,EACAuP,EACAjQ,EACAgP,EACApR,EACAhH,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAiBA,OAfA+F,EAAAqM,KACAiC,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAA,CAAAG,EAAA6J,GAAAuO,EAAApY,KACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAAwP,SACA,IAjDAD,CAkDA,IA4BAjR,EAAAyK,GAAAhS,UAAA,SAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,IAAAmJ,EAAArH,KAAA8W,EAAA/O,GAAAuO,EAAApY,IAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA+BA/N,EAAAyK,GAAAhS,UAAA,QAAA,SAAAhB,EAAAsZ,EAAAI,GACA,IAAAnB,EACAhP,EACAiG,EACArP,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA4F,GAAA9J,GACA,MAAA,IAAAkE,UAAAiB,EAAA,mEAAAnF,IAIA,GAFAuY,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyQ,GACA,MAAA,IAAApV,UAAAiB,EAAA,qEAAAmU,IAQA,GANAA,EAAA,IACAA,GAAA/P,GACA,IACA+P,EAAA,GAGAjV,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,oEAAAuU,IAEAA,EAAA,IACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAGAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,MACAmQ,EAAAnQ,CAEA,MACA+P,EAAA,EACAI,EAAAnQ,EAOA,IAJAiG,EADAxP,EACA,EAEA,EAEAG,EAAAmZ,EAAAnZ,EAAAuZ,EAAAvZ,IACAoY,EAAApY,GAAAqP,EAEA,OAAA8G,IACA,IAqCA/N,EAAAyK,GAAAhS,UAAA,UAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAnY,EACAD,EACA4H,EAEA,IAAAiT,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAIA,IAFAiP,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA4H,EAAAiC,GAAAuO,EAAApY,IACAmJ,EAAArH,KAAA8W,EAAAhR,EAAA5H,EAAAmW,OACAlW,EAAA8E,KAAA6C,GAGA,OAAA,IAAAuO,KAAArJ,YAAA7M,EACA,IA4BAmI,EAAAyK,GAAAhS,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAxQ,EACA5H,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADA4H,EAAAiC,GAAAuO,EAAApY,IACAmJ,EAAArH,KAAA8W,EAAAhR,EAAA5H,EAAAmW,MACA,OAAAvO,CAGA,IA4BAQ,EAAAyK,GAAAhS,UAAA,aAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAxQ,EACA5H,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IAEA,GADA4H,EAAAiC,GAAAuO,EAAApY,IACAmJ,EAAArH,KAAA8W,EAAAhR,EAAA5H,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IA4BAoI,EAAAyK,GAAAhS,UAAA,YAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAxQ,EACA5H,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADA4H,EAAAiC,GAAAuO,EAAApY,IACAmJ,EAAArH,KAAA8W,EAAAhR,EAAA5H,EAAAmW,MACA,OAAAvO,CAGA,IA4BAQ,EAAAyK,GAAAhS,UAAA,iBAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACAxQ,EACA5H,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAAmW,KAAA6B,QAAA,EAAAhY,GAAA,EAAAA,IAEA,GADA4H,EAAAiC,GAAAuO,EAAApY,IACAmJ,EAAArH,KAAA8W,EAAAhR,EAAA5H,EAAAmW,MACA,OAAAnW,EAGA,OAAA,CACA,IA0BAoI,EAAAyK,GAAAhS,UAAA,WAAA,SAAA2Y,EAAAZ,GACA,IAAAR,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAAiB,EAAA,oEAAAwU,IAGA,IADApB,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAwZ,EAAA1X,KAAA8W,EAAA/O,GAAAuO,EAAApY,IAAAA,EAAAmW,KAEA,IA2BAvP,EAAAiM,GAAAhS,UAAA,OAAA,SAAAiR,GACA,IAAA+I,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAiF,GAAA8I,GACA,MAAA,IAAA/N,UAAAiB,EAAA,qEAAA8M,IAEA,KAAAA,GAAAqE,KAAA6B,SAGA,OAAAnO,GAAAsM,KAAA8B,QAAAnG,GACA,IA8BA1J,EAAAyK,GAAAhS,UAAA,YAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA4F,GAAAuC,GACA,MAAA,IAAAnI,UAAAiB,EAAA,mEAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAGA,IADAiM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IACA,GAAAkM,IAAArC,GAAAuO,EAAApY,IACA,OAAA,EAGA,OAAA,CACA,IAiCAoI,EAAAyK,GAAAhS,UAAA,WAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA4F,GAAAuC,GACA,MAAA,IAAAnI,UAAAiB,EAAA,mEAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,EAAA,IACAA,GAAAgK,KAAA6B,SACA,IACA7L,EAAA,EAGA,MACAA,EAAA,EAGA,IADAiM,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,EAAAmW,KAAA6B,QAAAhY,IACA,GAAAkM,IAAArC,GAAAuO,EAAApY,IACA,OAAAA,EAGA,OAAA,CACA,IA0BA4G,EAAAiM,GAAAhS,UAAA,QAAA,SAAA4Y,GACA,IAAArB,EACAnY,EACAD,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,GAAAG,UAAA1D,OAAA,GACA,IAAAqK,GAAA4O,GACA,MAAA,IAAA1V,UAAAiB,EAAA,kEAAAyU,SAGAA,EAAA,IAIA,IAFArB,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAoY,EAAApY,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAA0Z,KAAAF,EACA,IA4BA7S,EAAAiM,GAAAhS,UAAA,QAAA,WACA,IAAAiJ,EACAuP,EACAjQ,EACApC,EACAhH,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAgBA,OAdA+F,EAAAqM,KACA/M,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAAG,EACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAAiB,MACA,IAjDAsO,CAkDA,IAiCAjR,EAAAyK,GAAAhS,UAAA,eAAA,SAAAqL,EAAAC,GACA,IAAAiM,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA4F,GAAAuC,GACA,MAAA,IAAAnI,UAAAiB,EAAA,mEAAAkH,IAEA,GAAAhI,UAAA1D,OAAA,EAAA,CACA,IAAAkI,GAAAyD,GACA,MAAA,IAAApI,UAAAiB,EAAA,qEAAAmH,IAEAA,GAAAgK,KAAA6B,QACA7L,EAAAgK,KAAA6B,QAAA,EACA7L,EAAA,IACAA,GAAAgK,KAAA6B,QAEA,MACA7L,EAAAgK,KAAA6B,QAAA,EAGA,IADAI,EAAAjC,KAAA8B,QACAjY,EAAAmM,EAAAnM,GAAA,EAAAA,IACA,GAAAkM,IAAArC,GAAAuO,EAAApY,IACA,OAAAA,EAGA,OAAA,CACA,IAgBA2K,GAAAkI,GAAAhS,UAAA,UAAA,WACA,OAAAsV,KAAA6B,OACA,IAqCA5P,EAAAyK,GAAAhS,UAAA,OAAA,SAAA2Y,EAAAZ,GACA,IAAAgB,EACA3Z,EACAmY,EACApY,EACA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAAgL,GACA,MAAA,IAAAzV,UAAA,oEAAAyV,GAKA,IAHApB,EAAAjC,KAAA8B,QAEA2B,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA6B,UACAC,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA4Z,EAAA5Z,GAAA6J,GAAA2P,EAAA1X,KAAA8W,EAAA/O,GAAAuO,EAAApY,IAAAA,EAAAmW,OAEA,OAAAlW,CACA,IA+BAmI,EAAAyK,GAAAhS,UAAA,UAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACAhP,EACA2Q,EACA/Z,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAA,MACA,CACA,GAAA,IAAAoJ,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAAlQ,GAAAuO,EAAA,IACApY,EAAA,CACA,CACA,KAAAA,EAAAoJ,EAAApJ,IACA+Z,EAAAF,EAAAE,EAAAlQ,GAAAuO,EAAApY,IAAAA,EAAAmW,MAEA,OAAA4D,CACA,IA+BA3R,EAAAyK,GAAAhS,UAAA,eAAA,SAAAgZ,EAAAC,GACA,IAAA1B,EACAhP,EACA2Q,EACA/Z,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAAqL,GACA,MAAA,IAAA9V,UAAAiB,EAAA,oEAAA6U,IAIA,GAFAzB,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA9T,UAAA1D,OAAA,EACAuZ,EAAAD,EACA9Z,EAAAoJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA5H,MAAA,oGAEAuY,EAAAlQ,GAAAuO,EAAAhP,EAAA,IACApJ,EAAAoJ,EAAA,CACA,CACA,KAAApJ,GAAA,EAAAA,IACA+Z,EAAAF,EAAAE,EAAAlQ,GAAAuO,EAAApY,IAAAA,EAAAmW,MAEA,OAAA4D,CACA,IA8BAnT,EAAAiM,GAAAhS,UAAA,WAAA,WACA,IAAAuX,EACAU,EACA1P,EACA4Q,EACAha,EACA8D,EAEA,IAAA+W,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAKA,IAHAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACAgC,EAAAvR,GAAAW,EAAA,GACApJ,EAAA,EAAAA,EAAAga,EAAAha,IACA8D,EAAAsF,EAAApJ,EAAA,EACA8Y,EAAAV,EAAApY,GACAoY,EAAApY,GAAAoY,EAAAtU,GACAsU,EAAAtU,GAAAgV,EAEA,OAAA3C,IACA,IA+CAvP,EAAAiM,GAAAhS,UAAA,OAAA,SAAAhB,GACA,IAAAoa,EACAnI,EACAsG,EACAU,EACAkB,EACAha,EACA8D,EACA,IAAA+W,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAGA,GADAqU,EAAAjC,KAAA8B,QACA/T,UAAA1D,OAAA,GAEA,IAAAwI,GADA8I,EAAA5N,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8M,SAGAA,EAAA,EAEA,GAAA9F,GAAAnM,GAAA,CAEA,GAAAiS,GADAkI,EAAAna,EAAAW,QACA2V,KAAA6B,QACA,MAAA,IAAAO,WAAA,0FASA,GANA0B,EADAY,GAAAhb,GACAA,EAAAoY,QAEApY,EAGAiE,EAAAsU,EAAAb,WAAAzF,EAAAd,GAEAiJ,EAAA3C,SAAAc,EAAAd,QAEA2C,EAAA1C,WAAAzT,GACAmW,EAAA1C,WAAA0C,EAAAhJ,WAAAnN,EAEA,CAGA,IADAgV,EAAA,IAAArG,GAAAwH,EAAAzZ,QACAR,EAAA,EAAAA,EAAAia,EAAAzZ,OAAAR,IACA8Y,EAAA9Y,GAAAia,EAAAja,GAEAia,EAAAnB,CACA,CACA,IAAA9Y,EAAA,EAAAA,EAAAga,EAAAlI,IAAA9R,IACAoY,EAAAtG,GAAAmI,EAAAja,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAA8R,GAAAqE,KAAA6B,QACA,MAAA,IAAAO,WAAAvT,EAAA,kEAAA8M,IAEAsG,EAAAtG,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDA1J,EAAAyK,GAAAhS,UAAA,SAAA,SAAAwZ,EAAAd,GACA,IAAAW,EACAN,EACA3Z,EACAmY,EACAhP,EACApJ,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA6Z,EAAA,EACAd,EAAAnQ,MACA,CACA,IAAAV,GAAA2R,GACA,MAAA,IAAAtW,UAAAiB,EAAA,oEAAAqV,IAQA,GANAA,EAAA,IACAA,GAAAjR,GACA,IACAiR,EAAA,GAGA,IAAAnW,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAQA,IANA8Q,EADAG,EAAAd,EACAA,EAAAc,EAEA,EAGAT,GADA3Z,EAAA,IAAAkW,KAAArJ,YAAAoN,IACAjC,QACAjY,EAAA,EAAAA,EAAAka,EAAAla,IACA4Z,EAAA5Z,GAAAoY,EAAApY,EAAAqa,GAEA,OAAApa,CACA,IA4BAmI,EAAAyK,GAAAhS,UAAA,QAAA,SAAAsI,EAAAyP,GACA,IAAAR,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAAyK,GAAArF,GACA,MAAA,IAAApF,UAAAiB,EAAA,oEAAAmE,IAGA,IADAiP,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACA,GAAAmJ,EAAArH,KAAA8W,EAAA/O,GAAAuO,EAAApY,IAAAA,EAAAmW,MACA,OAAA,EAGA,OAAA,CACA,IA4CAvP,EAAAiM,GAAAhS,UAAA,QAAA,SAAAsZ,GACA,IAAA/B,EAEA,IAAAyC,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAGA,GADAqU,EAAAjC,KAAA8B,QACA,IAAA/T,UAAA1D,OAEA,OADA4X,EAAAgC,OACAjE,KAEA,IAAA3H,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAGA,OADA/B,EAAAgC,MAWA,SAAAW,EAAAC,GACA,OAAAb,EAAAtQ,GAAAkR,GAAAlR,GAAAmR,GACA,IAZA7E,IAaA,IAgDA/N,EAAAyK,GAAAhS,UAAA,YAAA,SAAAwZ,EAAAd,GACA,IAAAlC,EACAe,EACAhP,EAEA,IAAAyR,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAIA,GAFAqU,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QACA,IAAA9T,UAAA1D,OACA6Z,EAAA,EACAd,EAAAnQ,MACA,CACA,IAAAV,GAAA2R,GACA,MAAA,IAAAtW,UAAAiB,EAAA,oEAAAqV,IAQA,GANAA,EAAA,IACAA,GAAAjR,GACA,IACAiR,EAAA,GAGA,IAAAnW,UAAA1D,OACA+Y,EAAAnQ,MACA,CACA,IAAAV,GAAA6Q,GACA,MAAA,IAAAxV,UAAAiB,EAAA,qEAAAuU,IAEAA,EAAA,GACAA,GAAAnQ,GACA,IACAmQ,EAAA,GAEAA,EAAAnQ,IACAmQ,EAAAnQ,EAEA,CACA,CAWA,OAVAiR,GAAAjR,GACAA,EAAA,EACAiO,EAAAe,EAAAnH,YACAoJ,GAAAd,GACAnQ,EAAA,EACAiO,EAAAe,EAAAb,WAAA8C,EAAArJ,KAEA5H,EAAAmQ,EAAAc,EACAhD,EAAAe,EAAAb,WAAA8C,EAAArJ,IAEA,IAAAmF,KAAArJ,YAAAsL,EAAAd,OAAAD,EAAAjO,EAAA,EAAA,EAAAA,EACA,IAyBAhB,EAAAyK,GAAAhS,UAAA,kBAAA,SAAAyZ,EAAAC,GACA,IAAAnL,EACAoL,EACAva,EACAmY,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,GAAA,IAAAG,UAAA1D,OACAga,EAAA,OACA,KAAA3P,GAAAyP,KAAAvE,GAAAuE,GAGA,MAAA,IAAAvW,UAAAiB,EAAA,yFAAAsV,IAFAE,EAAAF,CAGA,CACA,GAAApW,UAAA1D,OAAA,EACA4O,EAAA,CAAA,MACA,KAAAjH,GAAAoS,GAGA,MAAA,IAAAxW,UAAAiB,EAAA,qEAAAuV,IAFAnL,EAAAmL,CAGA,CAGA,IAFAnC,EAAAjC,KAAA8B,QACAhY,EAAA,GACAD,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAC,EAAA8E,KAAA8E,GAAAuO,EAAApY,IAAAya,eAAAD,EAAApL,IAEA,OAAAnP,EAAA0Z,KAAA,IACA,IA8BA/S,EAAAiM,GAAAhS,UAAA,cAAA,WACA,IAAA+Y,EACA3Z,EACAmJ,EACAgP,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAMA,IAJAqF,EAAA+M,KAAA6B,QACA/X,EAAA,IAAAkW,KAAArJ,YAAA1D,GACAgP,EAAAjC,KAAA8B,QACA2B,EAAA3Z,EAAAgY,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA4Z,EAAA5Z,GAAAoY,EAAAhP,EAAApJ,EAAA,GAEA,OAAAC,CACA,IA6CA2G,EAAAiM,GAAAhS,UAAA,YAAA,SAAAsZ,GACA,IAAAP,EACA3Z,EACAmJ,EACAgP,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAMA,IAJAqF,EAAA+M,KAAA6B,QACA/X,EAAA,IAAAkW,KAAArJ,YAAA1D,GACAgP,EAAAjC,KAAA8B,QACA2B,EAAA3Z,EAAAgY,QACAjY,EAAA,EAAAA,EAAAoJ,EAAApJ,IACA4Z,EAAA5Z,GAAAoY,EAAApY,GAEA,GAAA,IAAAkE,UAAA1D,OAEA,OADAoZ,EAAAQ,OACAna,EAEA,IAAAuO,GAAA2L,GACA,MAAA,IAAApW,UAAAiB,EAAA,oEAAAmV,IAGA,OADAP,EAAAQ,MAWA,SAAAW,EAAAC,GACA,OAAAb,EAAAtQ,GAAAkR,GAAAlR,GAAAmR,GACA,IAZA/a,CAaA,IAqBA2G,EAAAiM,GAAAhS,UAAA,YAAA,WACA,IAAAZ,EACAmY,EACApY,EACA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAIA,IAFA9D,EAAA,GACAmY,EAAAjC,KAAA8B,QACAjY,EAAA,EAAAA,EAAAmW,KAAA6B,QAAAhY,IACAoY,EAAApY,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAA0Z,KAAA,IACA,IA4BA/S,EAAAiM,GAAAhS,UAAA,UAAA,WACA,IAAAwY,EACAvP,EACAV,EACApC,EACAoR,EACApY,EAEA,IAAA6a,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAiBA,OAfA+F,EAAAqM,KACAiC,EAAAjC,KAAA8B,QACA7O,EAAA+M,KAAA6B,QAGAhY,GAAA,EAIAoI,EADAiR,EAAA,CAAA,EACA,QAcA,WAEA,GADArZ,GAAA,EACAgH,GAAAhH,GAAAoJ,EACA,MAAA,CACAuO,MAAA,GAGA,MAAA,CACA9X,MAAAgK,GAAAuO,EAAApY,IACA2X,MAAA,EAEA,IAxBAvP,EAAAiR,EAAA,UAiCA,SAAAxZ,GAEA,GADAmH,GAAA,EACA9C,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA8X,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAe,IACAtQ,EAAAiR,EAAAX,IAiDA,WACA,OAAA5O,EAAA4Q,QACA,IAjDArB,CAkDA,IA6BAjR,EAAAyK,GAAAhS,UAAA,QAAA,SAAA8Z,EAAA9a,GACA,IACAI,EACAmJ,EAEA,IAAAyR,GAAA1E,MACA,MAAA,IAAApS,UAAA,sDAEA,IAAA2E,GAAAiS,GACA,MAAA,IAAA5W,UAAAiB,EAAA,oEAAA2V,IAMA,GAJAvR,EAAA+M,KAAA6B,QACA2C,EAAA,IACAA,GAAAvR,GAEAuR,EAAA,GAAAA,GAAAvR,EACA,MAAA,IAAAmP,WAAAvT,EAAA,kEAAA2V,IAEA,IAAAhR,GAAA9J,GACA,MAAA,IAAAkE,UAAAiB,EAAA,oEAAAnF,IASA,OAPAI,EAAA,IAAAkW,KAAArJ,YAAAqJ,KAAA8B,UACAA,QAEA0C,GADA9a,EACA,EAEA,EAEAI,CACA,IG/4EA,IAAIgb,GAAQ,CACX7I,GACAD,GACAG,GACAE,GACAH,GACAE,GACA9F,GACAgG,GACAC,GACAC,GACAC,GACAC,IC5BGqI,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAO1a,OAkBpB,SAASsQ,GAAOjR,GACf,IAAIG,EACJ,GAAKkD,GAASrD,GACb,MAAO,UAER,GAAK+M,GAAU/M,GACd,OAAO,KAER,IAAMG,EAAI,EAAGA,EAAImb,GAAQnb,IACxB,GAAKH,aAAiBob,GAAOjb,GAC5B,OAAOkb,GAAQlb,GAIjB,OAAOob,GAAYrO,GAAiBlN,KAAa,IAClD,CCZA,SAASwb,GAAkB1S,GAC1B,IAAI2S,EAAKxK,GAAOnI,GAChB,OAAKiJ,GAAiBjJ,GACd,CACN4S,KAAQ5S,EACRmI,MAASwK,EACTE,kBAAoB,EACpBC,UAAa,CACZzC,GAAgBsC,GAChBI,GAAgBJ,KAIZ,CACNC,KAAQ5S,EACRmI,MAASwK,EACTE,kBAAoB,EACpBC,UAAa,CACZ7Q,GAAQ0Q,GACRrJ,GAAQqJ,IAGX,CChDA,IAAIK,GAAaxY,MAAMtC,UAAUgE,MA4GjC,SAASA,GAAO8D,EAAGwQ,EAAOI,GACzB,IAAIrT,EACJ,OAzFD,SAAoBA,EAAK0V,GACxB,MAAkC,mBAAlB1V,EAAK0V,EACtB,CAuFMC,CAAWlT,EAAG,SACXA,EAAE9D,MAAOsU,EAAOI,IAExBrT,EAAMmV,GAAkB1S,IACf6S,iBApDV,SAAoB7S,EAAGwQ,EAAOI,GAC7B,IAAIgC,EACA9U,EACAxG,EACAD,EAKJ,IAHAub,EAAO5S,EAAE4S,KACT9U,EAAMkC,EAAE8S,UAAW,GACnBxb,EAAM,GACAD,EAAImZ,EAAOnZ,EAAIuZ,EAAKvZ,IACzBC,EAAI8E,KAAM0B,EAAK8U,EAAMvb,IAEtB,OAAOC,CACR,CAwCSwb,CAAWvV,EAAKiT,EAAOI,GA3EhC,SAAkB5Q,EAAGwQ,EAAOI,GAC3B,OAAOoC,GAAW7Z,KAAM6G,EAAGwQ,EAAOI,EACnC,CA4EQtT,CAAS0C,EAAGwQ,EAAOI,EAC3B,CCpHA,SAASuC,GAAyBC,EAAOC,GACxC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CCFA,SAASE,GAAsBF,EAAOC,GACrC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CC8BA,SAASG,GAAuBC,EAAOhL,EAASkG,GAC/C,IAAI9F,EACA6K,EACAC,EACAC,EACAtc,EAKJ,IAHAuR,EAAQ4K,EAAM3b,OACd4b,EAAM/E,EACNgF,EAAMhF,EACArX,EAAI,EAAGA,EAAIuR,EAAOvR,IAAM,CAC7B,GAAoB,IAAfmc,EAAOnc,GACX,MAAO,CAAEqX,EAAQA,IAElBiF,EAAInL,EAASnR,IACJ,EACRqc,GAAOC,GAAMH,EAAMnc,GAAG,GACXsc,EAAI,IACfF,GAAOE,GAAMH,EAAMnc,GAAG,GAEvB,CACD,MAAO,CAAEoc,EAAKC,EACf,CC9CA,SAASE,GAAqB3U,GAC7B,MAAe,iBAANA,CACV,CCmCAQ,EAAA3I,GAAA,UCIA,SAAgC0c,EAAOhL,EAASkG,EAAQpX,GACvD,IAAIsR,EACA6K,EACAC,EACAC,EACAtc,EAKJ,IAHAuR,EAAQ4K,EAAM3b,OACd4b,EAAM/E,EACNgF,EAAMhF,EACArX,EAAI,EAAGA,EAAIuR,EAAOvR,IAAM,CAC7B,GAAoB,IAAfmc,EAAOnc,GAGX,OAFAC,EAAK,GAAMoX,EACXpX,EAAK,GAAMoX,EACJpX,GAERqc,EAAInL,EAASnR,IACJ,EACRqc,GAAOC,GAAMH,EAAMnc,GAAG,GACXsc,EAAI,IACfF,GAAOE,GAAMH,EAAMnc,GAAG,GAEvB,CAGD,OAFAC,EAAK,GAAMmc,EACXnc,EAAK,GAAMoc,EACJpc,CACR,IC7EA,IAAIuc,GAAW,yBCRf,IAAI5X,GAAO6X,OAAO5b,UAAU+D,KCS5B,IAAIoC,GAAMW,IAmBV,SAAS+U,GAAU7c,GAClB,MAAsB,iBAAVA,IACNA,aAAiB4c,SAGjBzV,GCnBP,SAAenH,GACd,IAEC,OADA+E,GAAK9C,KAAMjC,IACJ,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUkC,CAAMpI,GAEoB,oBAAzB6H,EAAa7H,IAGxB,CEZA,SAASqC,GAAS/B,EAAKwc,EAAQC,GAC9B,OAAOzc,EAAI+B,QAASya,EAAQC,EAC7B,CCgBA,SAAS1a,GAAS/B,EAAKwc,EAAQC,GAC9B,IAAM/R,GAAU1K,GACf,MAAM,IAAI4D,UAAWiB,EAAQ,kEAAmE7E,IAEjG,GAAK0K,GAAU8R,GACdA,EAAS,IAAIF,OL1Bf,SAAkBtc,GACjB,IACImc,EACAtc,EAEJ,IAAM6K,GAAU1K,GACf,MAAM,IAAI4D,UAAWiB,EAAQ,2EAA4E7E,IAG1G,GAAkB,MAAbA,EAAK,GAGT,IAAMH,EADAG,EAAIK,OACI,EAAGR,GAAK,GACH,MAAbG,EAAKH,GADcA,KAO1B,YAAW,IAANA,GAAgBA,GAAK,EAClBG,EAAI+B,QAASsa,GAAU,SAM/BF,GAHAA,EAAInc,EAAIkE,UAAW,EAAGrE,IAGhBkC,QAASsa,GAAU,QAGzBrc,EAAMA,EAAK,GAAMmc,EAAInc,EAAIkE,UAAWrE,GAGrC,CKNuB6c,CAASF,GAAU,UAClC,IAAMD,GAAUC,GACtB,MAAM,IAAI5Y,UAAWiB,EAAQ,yFAA0F2X,IAExH,IAAM9R,GAAU+R,KAAapO,GAAYoO,GACxC,MAAM,IAAI7Y,UAAWiB,EAAQ,0FAA2F4X,IAEzH,OAAOzb,GAAMhB,EAAKwc,EAAQC,EAC3B,CCjDA,IAAI3B,GAAQ,CACXvL,KAAQ,gCACRC,MAAS,iCACTC,OAAU,wCACVC,MAAS,iCACTC,OAAU,kCACVC,MAAS,iCACTC,OAAU,kCACVI,QAAW,mCACXC,QAAW,mCACXK,QAAW,eACXD,OAAU,6BACVF,UAAa,qCACbC,WAAc,sCACdxF,KAAQ,oCCfT,ICeK8R,GDfDC,GAAQ,CACXjN,OAAUyC,GACV5C,MAAS8C,KCgBTqK,GAAa,IAAIC,GAAiB,OAAE,IAOxB,GAAM,KAiBnB,IAAAC,GAX6B,KAHhB,IAAID,GAAgB,MAAED,GAAWxF,QAGzB,GCrCjB7X,GAAgC,mBAAhBoW,YAA+BA,YAAc,KCAjE,ICmBI5I,GDnBAA,GAAgC,mBAAhB4I,YAA+BA,iBAAc,ECuBhE5I,GCPD,WACC,IAAIjC,EACAiS,EACA7E,EAEJ,GAAkC,mBAAtB8E,GACX,OAAO,EAGR,KAEClS,EAAS8K,GADTsC,EAAM,IAAI8E,GAAmB,MACwC,mBAA7BA,GAAkBC,WAEzDF,EAAO,IAAI7K,GAAcgG,IACnB,IAAO,KACb6E,EAAM,GAAMhK,IACZjI,EACCA,GACAkS,GAAkBC,OAAQF,IACP,KAAnB7E,EAAInH,aACW,OAAfgM,EAAM,IACNA,EAAM,IAAQA,EAAM,GAGtB,CAAC,MAAQlX,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDxBKoS,GACGnX,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA6b,GAAepQ,GGxBXqQ,GAAoC,mBAAbC,SAsB3B,SAASC,GAAY3d,GACpB,OACGyd,IAAezd,aAAiB0d,UACT,sBAAzB7V,EAAa7H,EAEf,CChCA,IAAIJ,GAA6B,mBAAb8d,SAA4BA,SAAW,KCA3D,ICuBItQ,GDvBAA,GAA6B,mBAAbsQ,SAA4BA,cAAW,EC2B1DtQ,GCXD,WACC,IAAIjC,EACAiS,EACA7E,EAEJ,GAA+B,mBAAnBqF,GACX,OAAO,EAGR,IACCrF,EAAM,IAAIvC,GAAa,KAEvB7K,EAASwS,GADTP,EAAO,IAAIQ,GAAgBrF,EAAK,KAC0B,mBAApB6E,EAAKS,YAAwD,mBAApBT,EAAKU,cAEnFV,EAAKU,WAAY,GAAI,MACrBV,EAAKU,WAAY,EAAG1K,KACpBjI,EACCA,GACAiS,EAAK3F,SAAWc,GACI,KAApB6E,EAAKhM,YACe,IAApBgM,EAAK1F,aACqB,OAA1B0F,EAAKS,WAAY,IACjBT,EAAKS,WAAY,IAAQT,EAAKS,WAAY,GAG5C,CAAC,MAAQ3X,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDrBK4S,GACG3X,GElBR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFwBA,IAAAqc,GAAe5Q,GG/BX6Q,GAAiC,mBAAXpT,OAA0BA,YAAS,kCCY7D,SAASqT,KACR,OAAOC,GAAOnZ,OACf,qCCFA,SAASoZ,KAER,MAAO,CAEN,YAAa,IAGb,eAAgB,IAElB,CCJA7V,GCLA,WACC,OAAO8V,GAAKrZ,OACb,GDGA,OAAAsZ,IEdA,IAAIC,GHWI,CAEN,YAAa,IAGb,eAAgB,KGGlB,SAASH,KAER,MAAO,CAEN,YAAaG,GAAS,aAGtB,eAAgBA,GAAS,gBAE3B,CCdAhW,EAAA3I,GAAA,OAAA0e,gDCLA,SAASE,KACR,OAAOC,GAAMzZ,OACd,CCFA,SAASoZ,KAER,MAAO,CACNM,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,EAEf,CCHAtW,EAAAiW,GAAA,OAAAF,ICRA,IAAIjD,GvJOI,CAENlQ,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,KuJ/ClBoN,GAASD,KACTO,GFGI,CACNC,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,GGXf,IAAIC,GAAW,WAGXC,GAAS,WAGTC,GAAQ,IAAIpM,GAAY,GACxBqM,GAAO,IAAIvB,GAAUsB,GAAMvH,QAyB/B,SAASyH,GAAqBpW,EAAG1I,EAAK+e,EAAQ3H,GAC7C,IAAI4H,EACAC,EACAlf,EAEJ,GAAW,IAAN2I,EAAU,CACd,IAAM3I,EAAI,EAAGA,EAAI6e,GAAMre,OAAQR,IAC9BC,EAAKoX,GAAW,EAChBA,GAAU2H,EAEX,OAAO/e,CACP,CAeD,IAbAif,GAAMvW,EAAEgW,MAAY,EAGpBM,EAAKxW,GAAOE,EAAEiW,IAGT5B,IACJ8B,GAAKK,UAAW,EAAGD,EAAIlC,IACvB8B,GAAKK,UAAW,EAAGF,EAAIjC,MAEvB8B,GAAKK,UAAW,EAAGF,EAAIjC,IACvB8B,GAAKK,UAAW,EAAGD,EAAIlC,KAElBhd,EAAI,EAAGA,EAAI6e,GAAMre,OAAQR,IAC9BC,EAAKoX,GAAWwH,GAAO7e,GACvBqX,GAAU2H,EAEX,OAAO/e,CACR,CC7CAmI,GCIA,SAA8BO,GAC7B,IAAIyW,EACAnC,EACAgC,EACAC,EAGJ,OADAE,EAAQ,IAAI3M,GAAY,GACb,IAAN9J,IAILuW,GAjCc,WAiCRvW,KAAc,EAGpBsW,EAAKxW,GAAOE,EAjCA,YAoCZsU,EAAO,IAAIM,GAAU6B,EAAM9H,QACtB0F,IACJC,EAAKkC,UAAW,EAAGD,EAAIlC,IACvBC,EAAKkC,UAAW,EAAGF,EAAIjC,MAEvBC,EAAKkC,UAAW,EAAGF,EAAIjC,IACvBC,EAAKkC,UAAW,EAAGD,EAAIlC,MAfhBoC,CAkBT,GD9BA,SAAAC,IEfA,IAAInE,G3JMI,CAENlQ,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,K2J9ClBoN,GAASD,KACTO,GNEI,CACNC,MAAS,EACTC,MAAS,EACTC,KAAQ,EACRC,UAAa,GOwCf,SAASY,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GACxD,IAAIC,EACAuD,EACAC,EACApW,EACApJ,EACJ,KAAOmW,gBAAgBmJ,IACtB,OAAO,IAAIA,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GAI5D,IADA3S,EAAM,EACApJ,EAAI,EAAGA,EAAImc,EAAM3b,OAAQR,IAC9BoJ,GAAO+S,EAAOnc,GAsCf,OAlCCuf,EADIjI,EAAOtG,kBACFsG,EAAOtG,kBAAoB5H,EAE3B,KAGV+M,KAAKsJ,YAAcF,EACnBpJ,KAAKuJ,iBAAmB3O,GAAiBD,GACzCqF,KAAK8B,QAAUX,EACfnB,KAAKwJ,OAAS7O,EACdqF,KAAK6B,QAAU5O,EACf+M,KAAKyJ,OAASzD,EAAM3b,OACpB2V,KAAK0J,QAAUxI,EACflB,KAAK2J,OAAS/D,EACd5F,KAAK4J,OAAS5D,EACdhG,KAAK6J,SAAW7O,EAChBgF,KAAK8J,WAAapW,GAASyN,EAAO7Q,KAAO6Q,EAAO5Q,KAEhDyP,KAAK+J,gBAAkBhP,GAAgBC,GAGvC6K,EChFD,SAAuB5S,EAAK+S,EAAOhL,EAASkG,EAAQnG,GACnD,IAAIkH,EAGJ,OAAa,IAARhP,GAAgC,IAAnB8H,GAKT9H,KADTgP,EAAM8D,GAAuBC,EAAOhL,EAASkG,IACtB,GAAGe,EAAI,GAAG,CAClC,CDsEc+H,CAAc/W,EAAK+S,EAAOhL,EAASkG,EAAQlB,KAAK+J,iBAG7DV,EAAMnO,GAAeF,GAErBgF,KAAKiK,OAAS,CACbC,qBAAwBpE,GAAsBuD,EAAKxD,GACnDsE,wBAA2BxE,GAAyB0D,EAAKxD,GACzDuE,UAAY,GAIbpK,KAAKqK,kBAAoB,KAElBrK,IACR,CEzFA,SAASsK,GAAe7Y,GACvB,OACCA,aAAa0X,IAEN,OAAN1X,GACa,iBAANA,GACW,iBAAXA,EAAE2T,MACU,iBAAZ3T,EAAEuU,OACY,iBAAdvU,EAAEuJ,SACW,iBAAbvJ,EAAEyP,QACU,iBAAZzP,EAAEmU,OACU,iBAAZnU,EAAE2J,OACT3J,EAAEkJ,OACkB,iBAAblJ,EAAEpH,QACU,iBAAZoH,EAAEtE,OACQ,mBAAVsE,EAAEnB,KACQ,mBAAVmB,EAAElB,GAGZ,CCtBA,SAASga,GAAU/X,EAAG9I,GACrB,IAAIuJ,EACA3C,EACA6U,EACAtb,EAeJ,IAZAsb,EAAKxK,GAAOnI,GAIXlC,EADImL,GAAiBjJ,GACfqQ,GAAgBsC,GAEhB1Q,GAAQ0Q,GAGflS,EAAMT,EAAEnI,OAGFR,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAKyG,EAAKkC,EAAG3I,KAAQH,EACpB,OAAO,EAGT,OAAO,CACR,CCrBA,SAAS8gB,GAAShY,GACjB,IAAIlC,EACA2C,EACAkS,EAEJ,IAAMtP,GAAcrD,GACnB,MAAM,IAAI5E,UAAWiB,EAAQ,oEAAqE2D,IAYnG,OATA2S,EAAKxK,GAAOnI,GAGPiJ,GAAiBjJ,KACrBlC,EAAMuS,GAAgBsC,IAGvBlS,EAAMT,EAAEnI,YAES,IAARiG,EAYT,SAAmB5G,GAClB,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAK2I,EAAG3I,KAAQH,EACf,OAAO,EAGT,OAAO,CACP,EAQD,SAAoBA,GACnB,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB,GAAKyG,EAAKkC,EAAG3I,KAAQH,EACpB,OAAO,EAGT,OAAO,CACP,CACF,CJ+CAuI,EAAakX,GAAS,OAAQ,WAsBX3U,GAAE2U,GAAQze,UAAW,cAAc,WACrD,OAAOsV,KAAKsJ,WACb,IAsBmB9U,GAAE2U,GAAQze,UAAW,qBAAqB,WAC5D,OAAOsV,KAAKuJ,gBACb,IAoBmB/U,GAAE2U,GAAQze,UAAW,QAAQ,WAC/C,OAAOsV,KAAK8B,OACb,IAoBmBtN,GAAE2U,GAAQze,UAAW,SAAS,WAChD,OAAOsV,KAAKwJ,MACb,IAoBmBhV,GAAE2U,GAAQze,UAAW,SAAS,WAChD,OKvOD,SAAoByC,GACnB,MAAO,CACN+c,qBAAwB/c,EAAM+c,qBAC9BC,wBAA2Bhd,EAAMgd,wBACjCC,SAAYjd,EAAMid,SAEpB,CLiOQK,CAAWzK,KAAKiK,OACxB,IAoBmBzV,GAAE2U,GAAQze,UAAW,UAAU,WACjD,OAAOsV,KAAK6B,OACb,IAoBmBrN,GAAE2U,GAAQze,UAAW,SAAS,WAChD,OAAOsV,KAAKyJ,MACb,IAoBmBjV,GAAE2U,GAAQze,UAAW,UAAU,WACjD,OAAOsV,KAAK0J,OACb,IAwBmBlV,GAAE2U,GAAQze,UAAW,SAAS,WAChD,OAAOsV,KAAK2J,MACb,IAoBmBnV,GAAE2U,GAAQze,UAAW,SAAS,WAChD,OAAOgE,GAAOsR,KAAK4J,OAAQ,EAAG5J,KAAK4J,OAAOvf,OAC3C,IAoBmBmK,GAAE2U,GAAQze,UAAW,WAAW,WAClD,OAAOgE,GAAOsR,KAAK6J,SAAU,EAAG7J,KAAK6J,SAASxf,OAC/C,IA0BWoG,EAAE0Y,GAAQze,UAAW,OMtYhC,WAEC,IAAIiR,EACA9R,EAGJ,IADA8R,EAAMqE,KAAK0J,QACL7f,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAClC8R,GAAOqE,KAAK6J,SAAUhgB,GAAMkE,UAAWlE,GAExC,OAAKmW,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAKqL,GAEnBqE,KAAK8B,QAASnG,EACtB,INmZWlL,EAAE0Y,GAAQze,UAAW,QO3ZhC,SAAeiR,GAEd,IAAIX,EACAgL,EACA5K,EACAsP,EACAvE,EACAtc,EAGJ,GAAe,KADfuR,EAAQ4E,KAAKyJ,QAEZ,OAAKzJ,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAK0P,KAAK0J,SAExB1J,KAAK8B,QAAS9B,KAAK0J,SAE3B,GAAK1J,KAAKiK,OAAOC,sBAAwBlK,KAAKiK,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzBnK,KAAK+J,gBACT,OAAK/J,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAK0P,KAAK0J,QAAQ/N,GAEhCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAGnC,IAA+B,IAA1BqE,KAAK+J,gBACT,OAAK/J,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAK0P,KAAKkB,OAAOvF,GAE/BqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,EAEnC,CAKD,GAHAqK,EAAQhG,KAAK4J,OACb5O,EAAUgF,KAAK6J,SACfa,EAAM1K,KAAK0J,QACNiB,GAAe3K,KAAK2J,QAAW,CACnC,IAAM9f,EAAI,EAAGA,EAAIuR,EAAOvR,IAEvB8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAErB,OAAKmW,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAKoa,GAEnB1K,KAAK8B,QAAS4I,EACrB,CAED,IAAM7gB,EAAIuR,EAAM,EAAGvR,GAAK,EAAGA,IAE1B8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAErB,OAAKmW,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAKoa,GAEnB1K,KAAK8B,QAAS4I,EACtB,IPmYWja,EAAE0Y,GAAQze,UAAW,OQlchC,WAEC,IAAIiR,EACA9R,EAGJ,IADA8R,EAAMqE,KAAK0J,QACL7f,EAAI,EAAGA,EAAIkE,UAAU1D,OAAO,EAAGR,IACpC8R,GAAOqE,KAAK6J,SAAUhgB,GAAMkE,UAAWlE,GAOxC,OALKmW,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKxC,UAAWlE,GAAK8R,GAElCqE,KAAK8B,QAASnG,GAAQ5N,UAAWlE,GAE3BmW,IACR,IRsdWvP,EAAE0Y,GAAQze,UAAW,QShehC,SAAeiR,EAAKlK,GAEnB,IAAIuJ,EACAgL,EACA5K,EACAsP,EACAvE,EACAtc,EAGJ,GAAe,KADfuR,EAAQ4E,KAAKyJ,QAOZ,OALKzJ,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKoL,EAAKqE,KAAK0J,SAE5B1J,KAAK8B,QAAS9B,KAAK0J,SAAY/N,EAEzBqE,KAER,GAAKA,KAAKiK,OAAOC,sBAAwBlK,KAAKiK,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzBnK,KAAK+J,gBAMT,OALK/J,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKkB,EAAGuO,KAAK0J,QAAQ/N,GAElCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAAQlK,EAE7BuO,KAGR,IAA+B,IAA1BA,KAAK+J,gBAMT,OALK/J,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKkB,EAAGuO,KAAK0J,QAAQ/N,GAElCqE,KAAK8B,QAAS9B,KAAK0J,QAAQ/N,GAAQlK,EAE7BuO,IAER,CAKD,GAHAgG,EAAQhG,KAAK4J,OACb5O,EAAUgF,KAAK6J,SACfa,EAAM1K,KAAK0J,QACNiB,GAAe3K,KAAK2J,QAAW,CACnC,IAAM9f,EAAI,EAAGA,EAAIuR,EAAOvR,IAEvB8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAOrB,OALKmW,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKkB,EAAGiZ,GAErB1K,KAAK8B,QAAS4I,GAAQjZ,EAEhBuO,IACP,CAED,IAAMnW,EAAIuR,EAAM,EAAGvR,GAAK,EAAGA,IAE1B8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAOrB,OALKmW,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKkB,EAAGiZ,GAErB1K,KAAK8B,QAAS4I,GAAQjZ,EAEhBuO,IACR,ITobWvP,EAAE0Y,GAAQze,UAAW,Y7BrehC,WAEC,IAAIyW,EACA/F,EAEApR,EACAmb,EACA1T,EACA5H,EAUJ,GARAuR,EAAQ4E,KAAK4J,OAAOvf,OAIpBL,EAAM,cAHNmb,EAAKnF,KAAKwJ,QAGa,MAGvBrI,EAAS,GACJnB,KAAK6B,SAAW,IACpB,GAAY,cAAPsD,GAA6B,eAAPA,EAC1B,IAAMtb,EAAI,EAAGA,EAAImW,KAAK6B,QAAShY,IAE9BsX,GAAUrB,GADVrO,EAAIuO,KAAK4K,KAAM/gB,IACO,KAAOkW,GAAMtO,GAC9B5H,EAAImW,KAAK6B,QAAQ,IACrBV,GAAU,WAIZ,IAAMtX,EAAI,EAAGA,EAAImW,KAAK6B,QAAShY,IAC9BsX,GAAUnB,KAAK4K,KAAM/gB,GAChBA,EAAImW,KAAK6B,QAAQ,IACrBV,GAAU,UAIP,CAEN,GAAY,cAAPgE,GAA6B,eAAPA,EAC1B,IAAMtb,EAAI,EAAGA,EAAI,EAAGA,IAEnBsX,GAAUrB,GADVrO,EAAIuO,KAAK4K,KAAM/gB,IACO,KAAOkW,GAAMtO,GAC9B5H,EAAI,IACRsX,GAAU,WAIZ,IAAMtX,EAAI,EAAGA,EAAI,EAAGA,IACnBsX,GAAUnB,KAAK4K,KAAM/gB,GAChBA,EAAI,IACRsX,GAAU,MAOb,GAHAA,GAAU,UAGE,cAAPgE,GAA6B,eAAPA,EAC1B,IAAMtb,EAAI,EAAGA,GAAK,EAAGA,IAEpBsX,GAAUrB,GADVrO,EAAIuO,KAAK4K,KAAM5K,KAAK6B,QAAQ,EAAEhY,IACR,KAAOkW,GAAMtO,GAC9B5H,EAAI,IACRsX,GAAU,WAIZ,IAAMtX,EAAI,EAAGA,GAAK,EAAGA,IACpBsX,GAAUnB,KAAK4K,KAAM5K,KAAK6B,QAAQ,EAAEhY,GAC/BA,EAAI,IACRsX,GAAU,KAIb,CAeD,GAbAnX,GAAO+B,GADA+Y,GAAO9E,KAAKrF,OACG,WAAYwG,GAClCnX,GAAO,KAINA,GADc,IAAVoR,EACG,KAEA,KAAO4E,KAAK4J,OAAOpG,KAAM,MAAS,KAE1CxZ,GAAO,KAGPA,GAAO,KACQ,IAAVoR,EACJpR,GAAO,SAEP,IAAMH,EAAI,EAAGA,EAAIuR,EAAOvR,IAClBmW,KAAK6J,SAAUhgB,GAAM,EACzBG,IAAQgW,KAAK6J,SAAUhgB,GAEvBG,GAAOgW,KAAK6J,SAAUhgB,GAElBA,EAAIuR,EAAM,IACdpR,GAAO,MAgBV,OAZAA,GAAO,KACPA,GAAO,KAGPA,GAAO,IACPA,GAAO,KAGPA,GAAO,IAAOgW,KAAK2J,OAAS,IAG5B3f,GAAO,IAIR,I6B2YWyG,EAAE0Y,GAAQze,UAAW,UUphBhC,WAEC,IAAIZ,EACAmJ,EACAxB,EACA5H,EAgBJ,IAdAoJ,EAAM+M,KAAK6B,SAGX/X,EAAM,CAAA,GACFmN,KAAO,UACXnN,EAAI6Q,MAAQqF,KAAKrF,MACjB7Q,EAAIqD,MAAQ,CACXid,SAAYpK,KAAKiK,OAAOG,UAEzBtgB,EAAI8b,MAAQ5F,KAAK2J,OACjB7f,EAAIkc,MAAQhG,KAAK4J,OAAOlb,QACxB5E,EAAIkR,QAAUgF,KAAK6J,SAASnb,QAGtB7E,EAAI,EAAGA,EAAIC,EAAIkR,QAAQ3Q,OAAQR,IAC/BC,EAAIkR,QAASnR,GAAM,IACvBC,EAAIkR,QAASnR,KAAQ,GAKvB,GADAC,EAAIsb,KAAO,GACQ,cAAdtb,EAAI6Q,OAAuC,eAAd7Q,EAAI6Q,MACrC,IAAM9Q,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB4H,EAAIuO,KAAK4K,KAAM/gB,GACfC,EAAIsb,KAAKxW,KAAMkR,GAAMrO,GAAKsO,GAAMtO,SAGjC,IAAM5H,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAIsb,KAAKxW,KAAMoR,KAAK4K,KAAM/gB,IAG5B,OAAOC,CAGR,IV+gBW2G,EAAE0Y,GAAQze,UAAW,WW9jBhC,WAEC,OAAqB,IAAhBsV,KAAKyJ,OACFzJ,KAAK4K,OAEN5K,IAGR,IX4lBA/N,EAAakX,GAAQze,UAAW,0BAA6B4J,KLxhB7D,WAEC,IAAI8U,EACAyB,EACA5X,EACAkS,EACA2F,EACAC,EACAC,EACAvZ,EACAwZ,EACAC,EACA/E,EACAtC,EACAsH,EACAthB,EAYJ,GAVAohB,EAAIjL,KAAKoL,OAAS,QAClBJ,EAAKhL,KAAKqL,UAAY,CAAEJ,GAKxBhY,EAAM,GAAQ,IAJd4Q,EAAI7D,KAAKyJ,SACT0B,EAAIH,EAAG3gB,SAMPoH,EAAIuO,KAAKqK,oBACC5Y,EAAEqJ,aAAe7H,EAC1B,OAAOxB,EA0BR,IAvBAA,EAAI,IAAI2V,GAAU,IAAI1H,GAAazM,IAGnC6X,EAAK9K,KAAK4J,OACVmB,EAAK/K,KAAK6J,SACV1E,EAAKnF,KAAKwJ,OACVJ,EAASpJ,KAAKuJ,iBAGd2B,EAAI,EACJzZ,EAAE6Z,QAASJ,EAAG,GAAuB,EAAI,GAGzCA,GAAK,EACLzZ,EAAE8Z,SAAUL,EAAGnG,GAAQI,GAAM0B,IAG7BqE,GAAK,EACLzZ,EAAE+Z,YAAaN,EAAG3W,GAAQsP,GAAKgD,IAG/BV,EAAQ,EAAJtC,EACJqH,GAAK,EACCrhB,EAAI,EAAGA,EAAIga,EAAGha,IACnB4H,EAAE+Z,YAAaN,EAAG3W,GAAQuW,EAAGjhB,IAAMgd,IACnCpV,EAAE+Z,YAAaN,EAAE/E,EAAG5R,GAAQwW,EAAGlhB,GAAGuf,GAAUvC,IAC5CqE,GAAK,EAoBN,IAjBAA,GAAK/E,EACL1U,EAAE+Z,YAAaN,EAAG3W,GAAQyL,KAAK0J,QAAQN,GAAUvC,IAGjDqE,GAAK,EACLzZ,EAAE6Z,QAASJ,EAAGrD,GAAQ7H,KAAK2J,SAG3BuB,GAAK,EACLzZ,EAAE6Z,QAASJ,EAAG/C,GAAO8C,IAGrBC,GAAK,EACLzZ,EAAE+Z,YAAaN,EAAG3W,GAAQ4W,GAAKtE,IAG/BqE,GAAK,EACCrhB,EAAI,EAAGA,EAAIshB,EAAGthB,IACnB4H,EAAE6Z,QAASJ,EAAG/C,GAAO6C,EAAGnhB,KACxBqhB,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAU7K,KAAKiK,OAAoB,SAAA,EAAI,EACvCxY,EAAEga,SAAUP,EAAGL,EAAMhE,IAGrB7G,KAAKqK,kBAAoB5Y,EAElBA,CAGR,EI3FA,WAEC,IAAI2X,EACAH,EACA4B,EACA5X,EACAkS,EACA2F,EACAC,EACAC,EACAvZ,EACAwZ,EACAC,EACA/E,EACAtC,EACAsH,EACAthB,EAYJ,GAVAohB,EAAIjL,KAAKoL,OAAS,QAClBJ,EAAKhL,KAAKqL,UAAY,CAAEJ,GAKxBhY,EAAM,GAAQ,IAJd4Q,EAAI7D,KAAKyJ,SACT0B,EAAIH,EAAG3gB,SAMPoH,EAAIuO,KAAKqK,oBACC5Y,EAAEqJ,aAAe7H,EAC1B,OAAOxB,EA2BR,IAxBAA,EAAI,IAAI2V,GAAU,IAAI1H,GAAazM,IACnCgW,EAAQ,IAAI3M,GAAY7K,EAAE0P,QAG1B2J,EAAK9K,KAAK4J,OACVmB,EAAK/K,KAAK6J,SACV1E,EAAKnF,KAAKwJ,OACVJ,EAASpJ,KAAKuJ,iBAGd2B,EAAI,EACJzZ,EAAE6Z,QAASJ,EAAG,GAAuB,EAAI,GAGzCA,GAAK,EACLzZ,EAAE8Z,SAAUL,EAAGnG,GAAQI,GAAM0B,IAI7B+B,GAAqB/E,EAAGoF,EAAO,EAD/BiC,GAAK,GAIL/E,EAAQ,EAAJtC,EACJqH,GAAK,EACCrhB,EAAI,EAAGA,EAAIga,EAAGha,IACnB+e,GAAqBkC,EAAGjhB,GAAIof,EAAO,EAAGiC,GACtCtC,GAAqBmC,EAAGlhB,GAAGuf,EAAQH,EAAO,EAAGiC,EAAE/E,GAC/C+E,GAAK,EAoBN,IAjBAA,GAAK/E,EACLyC,GAAqB5I,KAAK0J,QAAQN,EAAQH,EAAO,EAAGiC,GAGpDA,GAAK,EACLzZ,EAAE6Z,QAASJ,EAAGrD,GAAQ7H,KAAK2J,SAG3BuB,GAAK,EACLzZ,EAAE6Z,QAASJ,EAAG/C,GAAO8C,IAIrBrC,GAAqBuC,EAAGlC,EAAO,EAD/BiC,GAAK,GAILA,GAAK,EACCrhB,EAAI,EAAGA,EAAIshB,EAAGthB,IACnB4H,EAAE6Z,QAASJ,EAAG/C,GAAO6C,EAAGnhB,KACxBqhB,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAU7K,KAAKiK,OAAoB,SAAA,EAAI,EACvCxY,EAAEga,SAAUP,EAAGL,EAAMhE,IAGrB7G,KAAKqK,kBAAoB5Y,EAElBA,CAGR,GalKAQ,EAAA3I,GAAA,UAAAkhB,gjCCbIkB,GAAY,gBAmBhB,SAASC,KACR,IAAIC,EACA9hB,EACA+G,EACJ,OAA0B,IAArB9C,UAAU1D,OACP0a,GAAO8G,IAAInd,SAEnBmC,GAAM,EACN+a,EAAO7d,UAAW,GACb2d,GAAU5Z,KAAM8Z,IAEN,SADdA,EAAO7f,GAAS6f,EAAMF,GAAW,MACD,UAATE,IACtB/a,GAAM,GAIR/G,GADAA,EAAMib,GAAQ6G,IACE9hB,EAAI4E,QAAU,GACzBmC,GAAO/G,EAAIO,OAAS,GACxBP,EAAI8E,KAAM,WAEJ9E,EACR,CCKA,IAAIgiB,GAAmBvB,GAAUwB,MC5BjC,SAASC,GAAStiB,EAAO0H,GACxB,OAAK1H,UAGoB,iBAAb0H,EACJA,KAAY7H,OAAQG,GAEnBe,OAAQ2G,KAAc7H,OAAQG,GACxC,CCDA,SAASuiB,GAAyBviB,GACjC,OACC2O,GAAY3O,IACZiL,GAAmBjL,EAAMwiB,YACzBvX,GAAmBjL,EAAMoR,aACzBzC,GAAY3O,EAAMyiB,eAClB9T,GAAY3O,EAAM0iB,eAClB/T,GAAY3O,EAAM2iB,WAClBhU,GAAY3O,EAAM4iB,WAClBjU,GAAY3O,EAAM6iB,SAClBpb,EAAYzH,EAAO,WACnByH,EAAYzH,EAAO,SAErB,CCrCA,ICAI8iB,GCAAA,GCCAA,GHDAC,G7KYI,CAEN5X,KAAQ,EAGR0E,KAAQ,EACRC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EACVC,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXC,QAAW,GACXC,QAAW,GAIXC,UAAa,GACbC,UAAa,GACbC,WAAc,GAGdC,OAAU,GAGVC,QAAW,GAGXC,OAAU,GAGVC,iBAAoB,K6KlCtB,SAASiS,GAAU/R,GAClB,IAAIlJ,EAAIgb,GAAM9R,GACd,OAASlR,EAAUgI,GAAQA,EAAI,IAChC,CITA,SAASkb,GAAShS,GACjB,IAAIiS,SAAajS,EACjB,MAAW,WAANiS,EAC2B,OAAtBF,GAAU/R,GAAqB,KAAOA,EAErC,WAANiS,EACGlS,GAAUC,GAEP,WAANiS,GAAkBjS,EACflQ,OAAQkQ,GAEXsR,GAAyBtR,GACtBA,EAAMkS,OAEP,IACR,CC8BA,SAASC,GAAUpjB,EAAO0a,GACzB,IAAIlC,EACAjL,EACAgC,EAGJ,GADAiJ,EAAQnU,UAAU1D,SACV2V,gBAAgB8M,IACvB,OAAK5K,EAAQ,EACL,IAAI4K,GAAUpjB,GAEf,IAAIojB,GAAUpjB,EAAO0a,GAE7B,GAAK0H,GAAkBpiB,GACtBuN,EAAO,cACD,IAnDR,SAAqBvN,GACpB,OACCA,aAAiBojB,IAEC,iBAAVpjB,GACG,OAAVA,GAC2B,aAA3BA,EAAMiN,YAAYE,MAClBnC,GAAUhL,EAAMqjB,OAChBrY,GAAUhL,EAAMsjB,cAChBtY,GAAUhL,EAAMujB,YAChBjB,GAAStiB,EAAO,QAGnB,CAsCawjB,CAAYxjB,GAEvB,OAAO,IAAIojB,GAAUpjB,EAAMA,MAAO,CACjCsjB,YAAetjB,EAAMsjB,cAEhB,IAAKf,GAAyBviB,GAGpC,MAAM,IAAIkE,UAAWiB,EAAQ,kJAAmJnF,IAFhLuN,EAAO,QAGP,CACD,GAAKiL,EAAQ,EAAI,CAEhB,IAAMtJ,GADNK,EAAOmL,GAEN,MAAM,IAAIxW,UAAWiB,EAAQ,qEAAsEoK,IAEpG,GAAK9H,EAAY8H,EAAM,iBAAoBvE,GAAUuE,EAAK+T,aACzD,MAAM,IAAIpf,UAAWiB,EAAQ,8DAA+D,cAAeoK,EAAK+T,aAEnH,MACE/T,EAAO,CAAA,EAUR,OARAhH,EAAa+N,KAAM,SAAUtW,GAC7BuI,EAAa+N,KAAM,eAAgB/G,EAAK+T,aJxEzC,SAAoBrS,GACnB,OAA0B,IAArB5M,UAAU1D,OKtBR,CACNiQ,OAAU,OAEVzF,KAAQ,UAERsF,UAAa,+CACbC,UAAa,iDACbC,WAAc,iDAEdL,QAAW,uCACXmT,SAAY,8BACZlT,QAAW,yCACXC,QAAW,yCACXkT,SAAY,4CAEZ7S,QAAW,sBAEXhB,KAAQ,uBACRG,MAAS,wBACTE,MAAS,wBACTE,MAAS,wBACTuT,OAAU,yBACVC,OAAU,yBAEV9T,MAAS,yBACTC,OAAU,mCACVE,OAAU,0BACVE,OAAU,0BACVE,OAAU,0BACVwT,QAAW,2BACXC,QAAW,kCLLG,IAAVhB,KACJA,GK1BM,CACNlS,OAAU,OAEVzF,KAAQ,UAERsF,UAAa,+CACbC,UAAa,iDACbC,WAAc,iDAEdL,QAAW,uCACXmT,SAAY,8BACZlT,QAAW,yCACXC,QAAW,yCACXkT,SAAY,4CAEZ7S,QAAW,sBAEXhB,KAAQ,uBACRG,MAAS,wBACTE,MAAS,wBACTE,MAAS,wBACTuT,OAAU,yBACVC,OAAU,yBAEV9T,MAAS,yBACTC,OAAU,mCACVE,OAAU,0BACVE,OAAU,0BACVE,OAAU,0BACVwT,QAAW,2BACXC,QAAW,6BLFLhB,GAAOG,GAAShS,KAAa,KACrC,CIgE0D8S,CAAY/jB,IAAW,IAChFuI,EAAa+N,KAAM,QHzEpB,SAAoBrF,GACnB,OAA0B,IAArB5M,UAAU1D,OKtBR,CACNiQ,OAAU,IAEVzF,KAAQ,IAERsF,UAAa,IACbC,UAAa,IACbC,WAAc,IAEdL,QAAW,IACXmT,SAAY,IACZlT,QAAW,IACXC,QAAW,IACXkT,SAAY,IAEZ7S,QAAW,IAEXhB,KAAQ,IACRG,MAAS,IACTE,MAAS,IACTE,MAAS,IACTuT,OAAU,IACVC,OAAU,IAEV9T,MAAS,IACTC,OAAU,IACVE,OAAU,IACVE,OAAU,IACVE,OAAU,IACVwT,QAAW,IACXC,QAAW,WLLG,IAAVhB,KACJA,GK1BM,CACNlS,OAAU,IAEVzF,KAAQ,IAERsF,UAAa,IACbC,UAAa,IACbC,WAAc,IAEdL,QAAW,IACXmT,SAAY,IACZlT,QAAW,IACXC,QAAW,IACXkT,SAAY,IAEZ7S,QAAW,IAEXhB,KAAQ,IACRG,MAAS,IACTE,MAAS,IACTE,MAAS,IACTuT,OAAU,IACVC,OAAU,IAEV9T,MAAS,IACTC,OAAU,IACVE,OAAU,IACVE,OAAU,IACVE,OAAU,IACVwT,QAAW,IACXC,QAAW,MLFLhB,GAAOG,GAAShS,KAAa,KACrC,CGiE6B+S,CAAYhkB,IAAW,IACnDuI,EAAa+N,KAAM,QGhFpB,SAAkBrF,GACjB,IAAIiS,SAAajS,EACjB,MAAW,WAANiS,EACKlS,GAAUC,GAAYA,EAAQ,KAE7B,WAANiS,EACGF,GAAU/R,GAEP,WAANiS,GAAkBjS,GAASpI,GAAWoI,EAAMgT,MACzChT,EAAMgT,KAET1B,GAAyBtR,GACtB+R,GAAU,oBAEX,IACR,CHiE6BkB,CAAalkB,KAAY,GACrDuI,EAAa+N,KAAM,aFtEpB,SAAyBrF,GACxB,IAAIlJ,EACJ,OAA0B,IAArB1D,UAAU1D,OM5BR,CACNiQ,OAAU,EAEVzF,KAAQ,EAERsF,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdL,QAAW,EACXmT,SAAY,EACZlT,QAAW,EACXC,QAAW,EACXkT,SAAY,GAEZ7S,QAAW,KAEXhB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EACTuT,OAAU,GACVC,OAAU,GAEV9T,MAAS,EACTC,OAAU,EACVE,OAAU,EACVE,OAAU,EACVE,OAAU,EACVwT,QAAW,GACXC,QAAW,UNCG,IAAVhB,KACJA,GMhCM,CACNlS,OAAU,EAEVzF,KAAQ,EAERsF,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdL,QAAW,EACXmT,SAAY,EACZlT,QAAW,EACXC,QAAW,EACXkT,SAAY,GAEZ7S,QAAW,KAEXhB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EACTuT,OAAU,GACVC,OAAU,GAEV9T,MAAS,EACTC,OAAU,EACVE,OAAU,EACVE,OAAU,EACVE,OAAU,EACVwT,QAAW,GACXC,QAAW,KNIP7S,EAEChG,GADLlD,EAAIkJ,EAAMuR,WAEFza,EAED+a,GAAOG,GAAShS,KAAa,KAE9B,KACR,CEsDkCkT,CAAiBnkB,KAAY,GAC9DuI,EAAa+N,KAAM,cAAepF,GAAiBlR,KAAY,GAC/DuI,EAAa+N,KAAM,aAAc,QACjC/N,EAAa+N,KAAM,QAAS/I,GACrB+I,IACR,CKlFA,SAAS8N,GAAkBpkB,GAC1B,OACCA,aAAiBojB,IAEC,iBAAVpjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMwiB,YACjB3Z,GAAW7I,EAAMoR,aACjBpG,GAAUhL,EAAMujB,YAChBvY,GAAUhL,EAAMqjB,OAChBxa,GAAW7I,EAAMikB,OACjB3B,GAAStiB,EAAO,QAGnB,CCsBA,SAASqkB,GAAkBrkB,GAC1B,OACC2O,GAAY3O,IACZiL,GAAmBjL,EAAMwiB,YACzBvX,GAAmBjL,EAAMoR,aACzBzC,GAAY3O,EAAMyiB,eAClB9T,GAAY3O,EAAM0iB,eAClB/T,GAAY3O,EAAM2iB,WAClBhU,GAAY3O,EAAM6iB,SC5CpB,SAA2B7iB,GAC1B,OACCA,aAAiBojB,IAEC,iBAAVpjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMwiB,YACjB3Z,GAAW7I,EAAMoR,aACjBpG,GAAUhL,EAAMujB,YAChBvY,GAAUhL,EAAMqjB,OAChBxa,GAAW7I,EAAMikB,OACjB3B,GAAStiB,EAAO,QAGnB,CDgCEokB,CAAkBpkB,IAClBqkB,GAAkBrkB,EAAMA,MAE1B,CEzBA,SAASwjB,GAAYzb,GACpB,OACCqa,GAAkBra,IAClBqc,GAAkBrc,IAClBsc,GAAkBtc,EAEpB,CRkEAQ,EAAa6a,GAAU,OAAQ,YAqBZtY,GAAEsY,GAASpiB,UAAW,aAAa,WACrD,OAAOsV,KAAKgO,UACb,IAqBmBxZ,GAAEsY,GAASpiB,UAAW,cAAc,WACtD,OAAOsV,KAAKsJ,WACb,IAyBmB9U,GAAEsY,GAASpiB,UAAW,aAAa,WACrD,OAAOsV,KAAKiO,UACb,IAqBmBzZ,GAAEsY,GAASpiB,UAAW,QAAQ,WAChD,OAAOsV,KAAKkO,KACb,IAqBmB1Z,GAAEsY,GAASpiB,UAAW,eAAe,WACvD,OAAOsV,KAAKmO,YACb,IAqBmB3Z,GAAEsY,GAASpiB,UAAW,QAAQ,WAChD,OAAOsV,KAAKoO,KACb,IAiBmB5Z,GAAEsY,GAASpiB,UAAW,SAAS,WACjD,OAAOsV,KAAKqO,MACb,IAqBW5d,EAAEqc,GAASpiB,UAAW,UAAU,WAC1C,MAAO,CACNuM,KAAQ,WACRvN,MAASsW,KAAK1U,WACd2hB,UAAajN,KAAKiO,WAClBjB,YAAehN,KAAKmO,aAEtB,IAiBW1d,EAAEqc,GAASpiB,UAAW,YAAY,WAC5C,MAAwB,WAAfsV,KAAKsO,MAAuBtO,KAAKqO,OAAOxB,OAASpiB,OAAQuV,KAAKqO,OACxE,IAiBW5d,EAAEqc,GAASpiB,UAAW,WAAW,WAC3C,OAAOsV,KAAK1U,UACb,okBS/UA,SAASijB,KACR,OAAOC,GAAS9f,OACjB,CCDA,SAASsZ,KAER,MAAO,CACNyG,KAAQ,EACRC,SAAY,EACZC,aAAgB,EAChBC,QAAW,EACXC,oBAAuB,EACvBC,eAAkB,EAClBC,2BAA8B,EAC9BC,iBAAoB,EACpBC,6BAAgC,EAChCC,QAAW,EACXC,oBAAuB,GACvBC,eAAkB,GAClBC,2BAA8B,GAC9BC,oBAAuB,GACvBC,gCAAmC,GACnCC,uBAA0B,GAC1BC,mCAAsC,GACtC3P,KAAQ,GACR4P,iBAAoB,GACpBC,QAAW,GACXC,oBAAuB,GACvBC,cAAiB,GACjBC,0BAA6B,GAC7BC,cAAiB,GACjBC,0BAA6B,GAC7BC,WAAc,GACdC,uBAA0B,GAC1BtU,QAAW,GACXuU,cAAiB,GAEnB,CC5BAle,EAAA3I,GAAA,OAAA0e,ICSA,SAAiBjF,EAAQqN,GACxB,IAAIxb,EACAyC,EACAxN,EAGJ,IADA+K,EAAOyE,GAAY+W,GACbvmB,EAAI,EAAGA,EAAI+K,EAAKvK,OAAQR,IAE7BoI,GAAa8Q,EADb1L,EAAIzC,EAAM/K,GACcumB,EAAQ/Y,GAGlC,CDnBA6R,CAAA5f,GDJQ,CACNmlB,KAAQ,EACRC,SAAY,EACZC,aAAgB,EAChBC,QAAW,EACXC,oBAAuB,EACvBC,eAAkB,EAClBC,2BAA8B,EAC9BC,iBAAoB,EACpBC,6BAAgC,EAChCC,QAAW,EACXC,oBAAuB,GACvBC,eAAkB,GAClBC,2BAA8B,GAC9BC,oBAAuB,GACvBC,gCAAmC,GACnCC,uBAA0B,GAC1BC,mCAAsC,GACtC3P,KAAQ,GACR4P,iBAAoB,GACpBC,QAAW,GACXC,oBAAuB,GACvBC,cAAiB,GACjBC,0BAA6B,GAC7BC,cAAiB,GACjBC,0BAA6B,GAC7BC,WAAc,GACdC,uBAA0B,GAC1BtU,QAAW,GACXuU,cAAiB,KGnBnB,IAAIE,GAAyB9F,GAAUgE,MCtBnC1Z,GAAOwD,GAAY9O,OAAO2f,QCsB1BA,GAAS3f,OAAO2f,OC3BhBrU,QAAiD,IAAjCtL,OAAO+mB,sBCKvBC,GAAkBhnB,GAAO+mB,sBCuB7B,ICTIpH,GDSJqH,GATK7Y,GDKL,SAAgChO,GAC/B,OAAO6mB,GAAiBhnB,GAAQG,GACjC,EGXA,WACC,MAAO,EACR,ECKA,SAAS8mB,GAAsB9mB,GAC9B,IAAII,EACA6Y,EACA9Y,EAIJ,IAFAC,EAAM8K,GAAMlL,GACZiZ,EAAM4N,GAAiB7mB,GACjBG,EAAI,EAAGA,EAAI8Y,EAAItY,OAAQR,IACvB4mB,GAAc/mB,EAAOiZ,EAAK9Y,KAC9BC,EAAI8E,KAAM+T,EAAK9Y,IAGjB,OAAOC,CACR,CFdCof,GADIwH,GACKpnB,GGWV,SAAiByZ,GAChB,IAAIqN,EACAxb,EACAkE,EACA7F,EACA0d,EACA9mB,EACA8D,EACJ,GAAKoV,QACJ,MAAM,IAAInV,UAAWiB,EAAQ,2EAA4EkU,IAG1G,IADA4N,EAAKpnB,GAAQwZ,GACPlZ,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAElC,GAAKumB,OADLA,EAASriB,UAAWlE,IAOpB,IADAoJ,GADA2B,EAAO4b,GAAsBjnB,GAAQ6mB,KAC1B/lB,OACLsD,EAAI,EAAGA,EAAIsF,EAAKtF,IAErBgjB,EADA7X,EAAMlE,EAAMjH,IACAyiB,EAAQtX,GAGtB,OAAO6X,CACR,EH7BA,IAAAC,GAAe1H,GIXf,SAAS1b,GAAMgF,EAAGqE,GACjB,OCDD,SAAgBrE,EAAGqe,GAClB,IAAIrkB,EAAIgG,EAAErF,MACV,MAAkB,iBAANX,GAAwB,OAANA,EACtB,GAEHqkB,EACG3H,GAAQ,GAAI1c,GAEbA,CACR,CDRQW,CAAOqF,GAAG,GAASqE,EAC3B,CEIA,IAAIia,GAAUvG,GAAU3C,MCyFxB,SAASmJ,GAASve,EAAGQ,EAAWyP,GAC/B,IAAI1S,EACJ,OA9FD,SAAoBA,EAAK0V,GACxB,MAAkC,mBAAlB1V,EAAK0V,EACtB,CA4FMC,CAAWlT,EAAG,SACXA,EAAEwe,MAAOhe,EAAWyP,IAE5B1S,EAAMmV,GAAkB1S,IACf6S,iBA3CV,SAAoB7S,EAAGQ,EAAWyP,GACjC,IAAI2C,EACA9U,EACAzG,EAKJ,IAHAub,EAAO5S,EAAE4S,KACT9U,EAAMkC,EAAE8S,UAAW,GAEbzb,EAAI,EAAGA,EAAIub,EAAK/a,OAAQR,IAC7B,IAAMmJ,EAAUrH,KAAM8W,EAASnS,EAAK8U,EAAMvb,GAAKA,EAAGub,GACjD,OAAO,EAGT,OAAO,CACR,CA8BSE,CAAWvV,EAAKiD,EAAWyP,GA5EpC,SAAmBjQ,EAAGQ,EAAWyP,GAChC,IAAI5Y,EACJ,IAAMA,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAC1B,IAAMmJ,EAAUrH,KAAM8W,EAASjQ,EAAG3I,GAAKA,EAAG2I,GACzC,OAAO,EAGT,OAAO,CACR,CAsEQye,CAAUze,EAAGQ,EAAWyP,EAChC,CChHA,SAASyO,GAAerN,EAAGgF,GAC1B,OAAKA,EAAS,EACN,GAEC,EAAIhF,GAAMgF,CACpB,CCIA,SAASsI,GAAmBznB,GAC3B,OAAA,MAASA,CACV,CCwBA,SAAS0nB,GAAOvN,EAAGP,EAAW9Q,EAAG6e,EAASC,GACzC,IAAIxnB,EACAynB,EACArG,EACAzZ,EACA5H,EAEJ,GAAKga,GAAK,EACT,MAAO,GAGR,GAAiB,IAAZwN,GAA6B,IAAZC,GAAiBzN,IAAMrR,EAAEnI,QAlChD,SAAoB0F,EAAK0V,GACxB,MAAkC,mBAAlB1V,EAAK0V,EACtB,CAgC0DC,CAAWlT,EAAG,QACtE,OAAOA,EAAEgR,KAAMF,GAGhB,IADA4H,EAAIhG,GAAkB1S,IACf6S,iBACN,OCnCF,SAAgBxB,EAAGP,EAAW9Q,EAAG6e,EAASC,GACzC,IAAIE,EACAlhB,EACAxG,EACAynB,EACA9f,EACA5H,EAUJ,IAPA2nB,EAAOhf,EAAE4S,KAGT9U,EAAMkC,EAAE8S,UAAW,GAEnBiM,EAAKD,EACLxnB,EAAM,GACAD,EAAI,EAAGA,EAAIga,EAAGha,IACdA,EAAI,IACRC,GAAOwZ,GAGF6N,GADN1f,EAAInB,EAAKkhB,EAAMD,MAEdznB,GAAOW,OAAQgH,IAEhB8f,GAAMF,EAEP,OAAOvnB,CACR,CDQSwb,CAAWzB,EAAGP,EAAW4H,EAAGmG,EAASC,GAI7C,IAFAC,EAAKD,EACLxnB,EAAM,GACAD,EAAI,EAAGA,EAAIga,EAAGha,IACdA,EAAI,IACRC,GAAOwZ,GAGF6N,GADN1f,EAAIe,EAAG+e,MAENznB,GAAOW,OAAQgH,IAEhB8f,GAAMF,EAEP,OAAOvnB,CACR,CErDA,SAAS0Z,GAAMhR,EAAG8Q,GACjB,OAAOmO,GAASjf,EAAEnI,OAAQiZ,EAAW9Q,EAAG,EAAG,EAC5C,CCLA,SAASkf,GAAelf,GACvB,IAAI2S,EAAKxK,GAAOnI,GAChB,OAAKiJ,GAAiBjJ,GACdqQ,GAAgBsC,GAEjB1Q,GAAQ0Q,EAChB,CCEA,SAASwM,GAASC,EAAQ5L,EAAOhL,EAAS6W,EAASxO,GAClD,IAAIyO,EACAP,EACA/e,EACAqR,EACAha,EAGJ,MADAga,EAAImC,EAAO,KACD,GAMV,IAHAuL,EAAKM,EAAS,GACdC,EAAK9W,EAAS,GACdxI,EAAIof,EAAQ,GACN/nB,EAAI,EAAGA,EAAIga,EAAGha,IACnB2I,EAAG+e,GAAOlO,IACVkO,GAAMO,CAER,CCbA,SAASH,GAASC,EAAQ5L,EAAOhL,EAAS6W,EAASvM,EAAWjC,GAC7D,IAAI0O,EACAD,EACAP,EACA/e,EACAqR,EACAha,EAGJ,MADAga,EAAImC,EAAO,KACD,GAOV,IAJAuL,EAAKM,EAAS,GACdC,EAAK9W,EAAS,GACdxI,EAAIof,EAAQ,GACZG,EAAOzM,EAAW,GACZzb,EAAI,EAAGA,EAAIga,EAAGha,IACnBkoB,EAAMvf,EAAG+e,EAAIlO,KACbkO,GAAMO,CAER,CClBA,SAASH,GAASC,EAAQ5L,EAAOhL,EAASqI,GACzC,IAAI0O,EACAvf,EAMJ,OAHKiJ,GADLjJ,EAAIof,EAAQ,MAEXG,EAAOxM,GAAgB5K,GAAOnI,KAE1Buf,ECNN,SAAkBH,EAAQ5L,EAAOhL,EAASsK,EAAWjC,GAEpD,OAAO8F,GAASyI,EAAQ5L,EAAOhL,EADjB,CAAEkW,GAAelL,EAAO,GAAKhL,EAAS,KACHsK,EAAWjC,EAC7D,CDKSiC,CAAWsM,EAAQ5L,EAAOhL,EAAS,CAD1C+W,EAAOA,GAAQjW,GAAQnB,GAAOnI,KACsB6Q,GEbtD,SAAkBuO,EAAQ5L,EAAOhL,EAASqI,GAEzC,OAAO8F,GAASyI,EAAQ5L,EAAOhL,EADjB,CAAEkW,GAAelL,EAAO,GAAKhL,EAAS,KACHqI,EAClD,CFYQoO,CAASG,EAAQ5L,EAAOhL,EAASqI,EACzC,CGvCA,SAAS2O,GAAOhM,GACf,IAAI5K,EACAxR,EACAC,EAGJ,GAAe,KADfuR,EAAQ4K,EAAM3b,QAEb,OAAO,EAGR,IADAT,EAAI,EACEC,EAAI,EAAGA,EAAIuR,EAAOvR,IACvBD,GAAKoc,EAAOnc,GAEb,OAAOD,CACR,CCRA,SAAS+Q,GAAOnI,GACf,OAAOA,EAAEmI,KACV,CCRA,SAASkW,GAAMre,GACd,IAAI1I,EACAmJ,EACApJ,EAIJ,IAFAoJ,EAAMT,EAAEnI,OACRP,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAM4D,EAAG3I,IAEd,OAAOC,CACR,CCHA,SAASkc,GAAOxT,EAAGqe,GAClB,IAAI/F,EAAKtY,EAAEwT,MACX,OAAK6K,EACGoB,GAAanH,GAEdA,CACR,CC6CA,SAASoH,GAAelM,EAAOJ,GAC9B,OAAK+E,GAAe/E,GAhCrB,SAAsBI,GACrB,IAAIlc,EACAqc,EACAtc,EAIJ,IAFAC,EAAM,GACNqc,EAAI,EACEtc,EAAI,EAAGA,EAAImc,EAAM3b,OAAQR,IAC9BC,EAAI8E,KAAMuX,GACVA,GAAKH,EAAOnc,GAEb,OAAOC,CACR,CAqBSqoB,CAAanM,GA3DtB,SAAmBA,GAClB,IAAI5K,EACAtR,EACAqc,EACAtc,EAIJ,IAFAuR,EAAQ4K,EAAM3b,OACdP,EAAM,GACAD,EAAI,EAAGA,EAAIuR,EAAOvR,IACvBC,EAAI8E,KAAM,GAGX,IADAuX,EAAI,EACEtc,EAAIuR,EAAM,EAAGvR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMsc,EACXA,GAAKH,EAAOnc,GAEb,OAAOC,CACR,CA4CQsoB,CAAUpM,EAClB,CC7CA/T,GCRA,SAAgB4R,EAAGP,EAAW9Q,EAAG6e,GAChC,OAAOlI,GAAStF,EAAGP,EAAW9Q,EAAG6e,EAASH,GAAerN,EAAGwN,GAC7D,GDMA,UAAAlI,IEqBAlX,EAAA3I,GAAA,WCZA,SAAkBsoB,EAAQ5L,EAAOhL,EAAS6W,EAASxO,GAClD,IAAI0O,EACAvf,EAMJ,OAHKiJ,GADLjJ,EAAIof,EAAQ,MAEXG,EAAOxM,GAAgB5K,GAAOnI,KAE1Buf,EAEGzM,GAAWsM,EAAQ5L,EAAOhL,EAAS6W,EAAS,CADnDE,EAAOA,GAAQjW,GAAQnB,GAAOnI,KAC+B6Q,GAEvDoO,GAASG,EAAQ5L,EAAOhL,EAAS6W,EAASxO,EAClD,IC7BApR,EAAA3I,GAAA,UCgDA,SAAwB0c,EAAOJ,EAAO9b,GACrC,OAAK6gB,GAAe/E,GApCrB,SAAsBI,EAAOlc,GAC5B,IAAIqc,EACAtc,EAGJ,IADAsc,EAAI,EACEtc,EAAI,EAAGA,EAAImc,EAAM3b,OAAQR,IAC9BC,EAAKD,GAAMsc,EACXA,GAAKH,EAAOnc,GAEb,OAAOC,CACR,CA2BSqoB,CAAanM,EAAOlc,GA3D7B,SAAmBkc,EAAOlc,GACzB,IACIqc,EACAtc,EAIJ,IADAsc,EAAI,EACEtc,EAFEmc,EAAM3b,OAEE,EAAGR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMsc,EACXA,GAAKH,EAAOnc,GAEb,OAAOC,CACR,CAiDQsoB,CAAUpM,EAAOlc,EACzB,ICpEA,IAAIuoB,GAAY,YAkBhB,SAASrX,GAASxI,EAAGqe,GACpB,IAAIxH,EACAyB,EACAC,EAGJ,MAAmB,iBADnBA,EAAKvY,EAAEwI,UAC+B,OAAP+P,EAEX,KADnBD,EAAKtY,EAAEwT,OACC3b,OACA,CAAE,IAGJqK,GADN2U,EAAM7W,EAAEoT,SAEPyD,EAAMgJ,IAEAH,GAAepH,EAAIzB,IAEtBwH,EACGoB,GAAalH,GAEdA,CACR,CC5BA,SAAS7J,GAAQ1O,GAChB,IAAIuY,EACAD,EACAI,EAGJ,OAAKzhB,EADLyhB,EAAI1Y,EAAE0O,QAEEgK,EAGW,KADnBJ,EAAKtY,EAAEwT,OACC3b,QAIW,iBADnB0gB,EAAKvY,EAAEwI,UAC+B,OAAP+P,EAHvB,ECfT,SAAyB/E,EAAOhL,GAC/B,IAAIkG,EACA9F,EACAvR,EAIJ,IAFAuR,EAAQ4K,EAAM3b,OACd6W,EAAS,EACHrX,EAAI,EAAGA,EAAIuR,EAAOvR,IAClBmR,EAASnR,GAAM,IAEnBqX,GAAUlG,EAASnR,IAAQmc,EAAOnc,GAAI,IAGxC,OAAOqX,CACR,CDOQoR,CAAgBxH,EAAIC,EAC5B,CE9BA,IAAIsH,GAAY,YACZE,GAAe,eAqBnB,SAAS3M,GAAOpT,GACf,IAAIuY,EACAG,EAGJ,OAAKxW,GADLwW,EAAI1Y,EAAEoT,OAEEsF,EAIW,iBADnBH,EAAKvY,EAAEwI,UAC+B,OAAP+P,GAIpB,KADXG,EAAIhQ,GAAe6P,KACG,IAANG,EAHRmH,GAMG,IAANnH,EACGqH,GAGgB,IAAnB/f,EAAEwT,MAAM3b,OACLgoB,GAGD,IACR,CCtCA,SAASjN,GAAM5S,GACd,OAAOA,EAAE4S,IACV,CCmCA,SAASoN,GAAoBhgB,GAC5B,IAAIgf,EACA3c,EACAiW,EACA3F,EAQJ,OANAqM,EAAOiB,GAASjgB,GAChBsY,EAAK4H,GAAUlgB,GAAG,GAClB2S,EAAKwN,GAAUngB,GAEfqC,EAAO4G,GAAiB+V,GAEjB,CACNoB,IAAOpgB,EACPmI,MAASwK,EACTC,KAAQoM,EACRnnB,OAAU2nB,GAAOlH,GACjB9E,MAAS8E,EACT9P,QAAW6X,GAAYrgB,GAAG,GAC1B0O,OAAU4R,GAAWtgB,GACrBoT,MAASmN,GAAUvgB,GACnB6S,iBAAoBxQ,EACpByQ,UAAa,EACZ,CAAEzC,GAAgBsC,GAAMI,GAAgBJ,IACxC,CAAE1Q,GAAQ0Q,GAAMrJ,GAAQqJ,IAE3B,CC8DA,SAAS6N,GAAcld,EAAK9F,EAAMtG,GACjC,OAAK+R,GAAiB3F,GAvDvB,SAAoBA,EAAK9F,EAAMtG,GAC9B,IAAI4G,EACAmB,EACA5H,EAGJ,GADAyG,EAAMohB,GAAe5b,QACN,IAAVpM,EAAmB,CACvB,IAAMG,EAAI,EAAGA,EAAIiM,EAAIzL,OAAQR,IAE5B,GAAKmiB,GADLva,EAAInB,EAAKwF,EAAKjM,GACGmG,IAAUyB,EAAGzB,KAAWtG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMG,EAAI,EAAGA,EAAIiM,EAAIzL,OAAQR,IAC5B,GAAKyG,EAAKwF,EAAKjM,GAAKmG,KAAWtG,EAC9B,OAAO,EAGT,OAAO,CACR,CAmCS4b,CAAWxP,EAAK9F,EAAMtG,GA3G/B,SAAkBoM,EAAK9F,EAAMtG,GAC5B,IAAI+H,EACA5H,EACJ,QAAe,IAAVH,EAAmB,CACvB,IAAMG,EAAI,EAAGA,EAAIiM,EAAIzL,OAAQR,IAE5B,GAAKmiB,GADLva,EAAIqE,EAAKjM,GACQmG,IAAUyB,EAAGzB,KAAWtG,EACxC,OAAO,EAGT,OAAO,CACP,CACD,IAAMG,EAAI,EAAGA,EAAIiM,EAAIzL,OAAQR,IAC5B,GAAKiM,EAAKjM,GAAKmG,KAAWtG,EACzB,OAAO,EAGT,OAAO,CACR,CA2FQupB,CAASnd,EAAK9F,EAAMtG,EAC5B,CCxIA,SAASwpB,GAAQtpB,GAChB,IAAIkM,EACAjM,EAGJ,GADAiM,EAAM,GACDlM,GAAK,EACT,OAAOkM,EAER,IAAMjM,EAAI,EAAGA,EAAID,EAAGC,IACnBiM,EAAIlH,KAAM/E,GAEX,OAAOiM,CACR,CCiDA,SAASqd,GAASrpB,EAAKsb,EAAMyD,EAAQ3H,GACpC,IAAIzP,EACA0U,EACAtc,EAKJ,IAHAsc,EAAa,EAAT0C,EACJhf,EAAa,EAATqX,EACJzP,EAAI,EACI5H,GAAK,GAAKA,EAAIub,EAAK/a,QAC1B+a,EAAMvb,GAAM4H,EACZ2T,EAAMvb,EAAE,GAAM,EACdA,GAAKsc,EACL1U,GAAK,EAEN,OAAO3H,CACR,CCxEA,SAASspB,GAAM5gB,EAAG6gB,GACjB,IAAIvpB,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIwpB,EAAQhpB,OAAQR,IAChCC,EAAI8E,KAAM4D,EAAG6gB,EAASxpB,KAEvB,OAAOC,CACR,CCsBA,SAASwpB,GAAiBxI,EAAIgH,EAAIyB,EAAIC,GACrC,IAAI7Q,ECKL,SAAoBqD,EAAOhL,GAC1B,IAAIW,EACAgH,EACAuD,EACAjT,EACAnJ,EACAihB,EACAlH,EACAsH,EACAthB,EACA8D,EAMJ,IAJAkW,EAAI7I,EAAQ3Q,OAGZsY,EAAM,GACA9Y,EAAI,EAAGA,EAAI,EAAGA,IACnB8Y,EAAI/T,KAAM,IAKX,IAHAuc,EAAIxI,EAAItY,OAGFR,EAAI,EAAGA,EAAIga,EAAGha,IACnB8Y,EAAKzH,GAAeF,EAASnR,KAAQ+E,KAAMoM,EAASnR,IAIrD,IADAqc,EAAMvD,EAAK,GAAItY,UACFwZ,EAEZkH,EAAK/P,EAAS,QACR,GAAKkL,IAAQrC,EAAE,GAErB,IAAMha,EAAI,EAAGA,EAAIshB,EAAGthB,IACnB,GAAK8Y,EAAK9Y,GAAIQ,OAAS,CACtB0gB,EAAKpI,EAAK9Y,GAAK,GACf,KACA,MAEI,CAGN,IADA8D,EAAI,EACE9D,EAAI,EAAGA,EAAIshB,EAAGthB,KACnBoJ,EAAM0P,EAAK9Y,GAAIQ,SACH6b,IACXA,EAAMjT,EACNtF,EAAI9D,GAINkhB,EAAKpI,EAAKhV,GAAK,EACf,CAWD,IATAgO,EAAMuX,GAAQlN,EAAM3b,QC3ErB,SAAmBmI,EAAGihB,GACrB,IAAIC,EAEAnC,EACAoC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAnqB,EAMJ,IAJA0nB,EAAK,EACLoC,EAAK,EAGC9pB,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAAM,CAUhC,IARA6pB,GADAI,EAAKthB,EAAG+e,IACK,GAAOuC,EAAKA,EAEzBC,EAAKN,EAAGE,GAERC,EAAKrC,EAAK,EACVsC,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAKxhB,EAAGohB,IACK,GAAOI,EAAKA,IACbN,IAGZlhB,EAAGohB,EAAG,GAAMI,EACZP,EAAGI,EAAG,GAAMJ,EAAGI,GACfD,GAAM,EACNC,GAAM,EAEPrhB,EAAGohB,EAAG,GAAME,EACZL,EAAGI,EAAG,GAAME,EACZxC,GAAM,EACNoC,GAAM,CACN,CACF,CDoCCM,CAAUpD,GAAM9F,GAAMpP,GAGtB7R,EAAM,CAAEspB,GAAMpN,EAAOrK,IAGf9R,EAAI,EAAGA,EAAIga,EAAGha,IACnBC,EAAI8E,KAAMwkB,GAAMpY,EAASnR,GAAK8R,IAE/B,OAAO7R,CACR,CDtEWoqB,CAAWpJ,EAAI,CAAEgH,EAAIyB,EAAIC,IACnC,MAAO,CACN1I,GAAMnI,EAAK,GACXmP,GAAMnP,EAAK,GACX4Q,GAAM5Q,EAAK,GACX6Q,GAAM7Q,EAAK,GAEb,CGxBA1Q,EAAA3I,GAAA,UL8HA,SAAiBQ,EAAK+e,EAAQ3H,GAC7B,IAAInR,EAAMmV,GAAkBpb,GAC5B,OAAKiG,EAAIsV,iBAEW,eAAdtV,EAAI4K,MACDwY,GAASrpB,EAAKwY,GAAgBxY,EAAK,GAAK+e,EAAQ3H,GAErC,cAAdnR,EAAI4K,MACDwY,GAASrpB,EAAKuY,GAAevY,EAAK,GAAK+e,EAAQ3H,GAlDzD,SAAoBpX,EAAK+e,EAAQ3H,GAChC,IAAIkE,EACA7U,EACAkB,EACA5H,EAOJ,IALAub,EAAOtb,EAAIsb,KACX7U,EAAMzG,EAAIwb,UAAW,GAErBzb,EAAIqX,EACJzP,EAAI,EACI5H,GAAK,GAAKA,EAAIub,EAAK/a,QAC1BkG,EAAK6U,EAAMvb,EAAG4H,GACd5H,GAAKgf,EACLpX,GAAK,EAEN,OAAO2T,CACR,CAmCSE,CAAWvV,EAAK8Y,EAAQ3H,GAzIjC,SAAkBpX,EAAK+e,EAAQ3H,GAC9B,IAAIzP,EACA5H,EAIJ,IAFAA,EAAIqX,EACJzP,EAAI,EACI5H,GAAK,GAAKA,EAAIC,EAAIO,QACzBP,EAAKD,GAAM4H,EACX5H,GAAKgf,EACLpX,GAAK,EAEN,OAAO3H,CACR,CA+HQmpB,CAASnpB,EAAK+e,EAAQ3H,EAC9B,IMxKA,IAAIiT,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCY3B,SAASC,GAAiBC,EAAQC,EAAQC,GACzC,OCFD,SAAoB1I,GACnB,IAAI7F,EACAjT,EACAyhB,EACA7qB,EAGJ,IADAoJ,EAAM8Y,EAAO1hB,SACD,EACX,OAAO8pB,GAASE,uBAGjB,GAAa,QADbnO,EAAMtL,GAAiBmR,EAAQ,KAE9B,OAAOoI,GAASE,uBAGjB,IAAMxqB,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAE3B,GAAY,QADZ6qB,EAAK9Z,GAAiBmR,EAAQliB,KAE7B,OAAOsqB,GAASE,uBAEZK,EAAKxO,IACTA,EAAMwO,EAEP,CAED,OADAA,EAAOP,GAASC,oBAAoBlO,EAAM,GAC5B,EAAMwO,EAAK,CAC1B,CDxBQC,CAAW,CAAEJ,EAAQC,EAAQC,GACrC,CESA,SAASG,GAAW5O,EAAOhL,EAASkG,EAAQ0E,EAAOjK,EAAKkZ,GACvD,IAAIzZ,EACAnI,EACAyX,EACAvE,EACAtc,EAIJ,IAFAuR,EAAQ4K,EAAM3b,OACd4I,EAAM,EACApJ,EAAI,EAAGA,EAAIuR,EAAOvR,IACvBoJ,GAAO+S,EAAOnc,GAEf,GAAc,UAATgrB,EACClZ,EAAM,EACVA,EAAM,EACKA,GAAO1I,IAClB0I,EAAM1I,EAAM,QAEP,GAAc,SAAT4hB,EACNlZ,EAAM,GACVA,GAAO1I,GACI,GAEG,KADb0I,GAAO1I,KAEN0I,GAAO1I,GAGE0I,GAAO1I,IAClB0I,GAAO1I,IACKA,IACX0I,GAAO1I,QAOT,GAHc,cAAT4hB,GAAwBlZ,EAAM,IAClCA,GAAO1I,GAEH0I,EAAM,GAAKA,GAAO1I,EACtB,MAAM,IAAImP,WAAYvT,EAAQ,gHAAiHoE,EAAK0I,IAKtJ,GADA+O,EAAMxJ,EACDyJ,GAAe/E,GAAU,CAC7B,IAAM/b,EAAI,EAAGA,EAAIuR,EAAOvR,IAEvB8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAErB,OAAO6gB,CACP,CAED,IAAM7gB,EAAIuR,EAAM,EAAGvR,GAAK,EAAGA,IAE1B8R,GADAwK,EAAIxK,EAAMqK,EAAOnc,GAEjB8R,GAAOqK,EAAOnc,GACd6gB,GAAOvE,EAAInL,EAASnR,GAErB,OAAO6gB,CACR,CClFA,IAAIoK,GAAO,QCAX,IAAIA,GAAO,QC8CX,IAAIC,GAAS,CCiCb,SAAmBviB,EAAGihB,EAAGzS,EAAGqC,GAC3BrC,EAAEoE,KAAMpE,EAAEE,QAAWmC,EAAK7Q,EAAE4S,KAAM5S,EAAE0O,QAAUuS,EAAErO,KAAMqO,EAAEvS,QACzD,ECFA,SAAmB1O,EAAGihB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACAC,EACAC,EACAC,EACAC,EACA9D,EACAoC,EACA2B,EACAC,EAqBJ,IAhBAF,EAAK7iB,EAAEwT,MAAO,GACdkP,EAAM1iB,EAAEwI,QAAS,GACjBma,EAAM1B,EAAEzY,QAAS,GACjBoa,EAAMpU,EAAEhG,QAAS,GAGjBuW,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHmQ,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,CAER,ECrCA,SAAmB5iB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACA7K,EACAuK,EACAO,EACA9D,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EAyCJ,IApCA/K,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHyQ,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACF,ECxEA,SAAmBnjB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAlL,EACAuK,EACAO,EACAK,EACAnE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EAiDJ,IA5CApL,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH8Q,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACF,EC1FA,SAAmBxjB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAvL,EACAuK,EACAO,EACAK,EACAK,EACAxE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EAyDJ,IApDAzL,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHmR,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACF,EC1GA,SAAmB7jB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACA5L,EACAuK,EACAO,EACAK,EACAK,EACAK,EACA7E,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EAiEJ,IA5DA9L,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHwR,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACF,EC9HA,SAAmBlkB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAjM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EAyEJ,IApEAnM,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH6R,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACF,EChJA,SAAmBvkB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACA/B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAiFJ,IA5EAxM,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHkS,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACF,EClKA,SAAmB5kB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACA3M,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5F,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,GAyFJ,IApFA7M,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHuS,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACF,ECpLA,SAAmBjlB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAhN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAiGJ,IA5FAlN,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGH4S,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,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,GAAMwC,CACN,CACF,ECtMA,SAAoBtlB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACxC,IAAImO,EACAwD,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,EACArN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAyGJ,IApGAvN,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQuE,EAAGvE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQuE,EAAGvE,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,GAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGHiT,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,IAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,IAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,IAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,IAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,IAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,IAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,IAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,IAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,IAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,IAAMwC,CACN,CACDvG,GAAM0G,EACNtE,GAAMuE,EACN5C,IAAM6C,CACN,CACF,GX/OIG,GAAkB,CY2BtB,SAAmB9lB,EAAGihB,EAAGzS,EAAGqC,GAC3BrC,EAAEsE,UAAW,GAAKtE,EAAEoE,KAAMpE,EAAEE,OAAQmC,EAAK7Q,EAAE8S,UAAW,GAAK9S,EAAE4S,KAAM5S,EAAE0O,QAAUuS,EAAEnO,UAAW,GAAKmO,EAAErO,KAAMqO,EAAEvS,SAC5G,ECDA,SAAmB1O,EAAGihB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAC,EACAC,EACAC,EACA9D,EACAoC,EACA2B,EACAC,EA0BJ,IArBAF,EAAK7iB,EAAEwT,MAAO,GACdkP,EAAM1iB,EAAEwI,QAAS,GACjBma,EAAM1B,EAAEzY,QAAS,GACjBoa,EAAMpU,EAAEhG,QAAS,GAGjBuW,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdiQ,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,CAER,EC7CA,SAAmB5iB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACA7K,EACAuK,EACAO,EACA9D,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EA8CJ,IAzCA/K,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGduQ,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACF,EChFA,SAAmBnjB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACAlL,EACAuK,EACAO,EACAK,EACAnE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EAsDJ,IAjDApL,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd4Q,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKF,EAAIE,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACF,EClGA,SAAmBxjB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAvL,EACAuK,EACAO,EACAK,EACAK,EACAxE,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EA8DJ,IAzDAzL,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdiR,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACF,EClHA,SAAmB7jB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACArB,EACAO,EACAK,EACAK,EACAK,EACA5L,EACAuK,EACAO,EACAK,EACAK,EACAK,EACA7E,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EAsEJ,IAjEA9L,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdsR,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACF,ECtIA,SAAmBlkB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACA1B,EACAO,EACAK,EACAK,EACAK,EACAK,EACAjM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAlF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EA8EJ,IAzEAnM,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd2R,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACF,ECxJA,SAAmBvkB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAtM,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAvF,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,EACAK,EACAK,EAsFJ,IAjFAxM,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdgS,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACF,EC1KA,SAAmB5kB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACA3M,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACA5F,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,GACAK,GACAK,GACAK,GA8FJ,IAzFA7M,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdqS,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACF,EC5LA,SAAmBjlB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACvC,IAAImO,EACAwD,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,EACAhN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAjG,EACAyB,EACAC,EACAjC,EACAoC,EACA2B,EACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GAsGJ,IAjGAlN,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB6B,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ6B,EAAG7B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQoC,EAAGpC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQyC,EAAGzC,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ8C,EAAG9C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQmD,EAAGnD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQwD,EAAGxD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ6D,EAAG7D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQkE,EAAGlE,EAAG,IAGzBjC,EAAK/e,EAAE0O,OACPyS,EAAKF,EAAEvS,OACPoU,EAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd0S,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,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CACDnF,GAAMsF,EACNlD,GAAMmD,EACNxB,GAAMyB,CACN,CACDxF,GAAM2F,EACNvD,GAAMwD,EACN7B,GAAM8B,CACN,CACD7F,GAAMgG,EACN5D,GAAM6D,EACNlC,GAAMmC,CACN,CACDlG,GAAMqG,EACNjE,GAAMkE,EACNvC,GAAMwC,CACN,CACF,EC9MA,SAAoBtlB,EAAGihB,EAAGzS,EAAGwU,EAAYnS,GACxC,IAAImO,EACAwD,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,EACArN,EACAuK,EACAO,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAK,EACAtG,EACAyB,EACAC,GACAjC,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GA8GJ,IAzGAvN,EAAKtY,EAAEwT,MACP8L,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,GAAKxS,EAAEhG,QACFwa,GAEJH,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,GAAI,GACVmC,EAAMnC,GAAI,GAAQ6B,EAAG7B,GAAG,GACxBwC,EAAMxC,GAAI,GAAQoC,EAAGpC,GAAG,GACxB6C,EAAM7C,GAAI,GAAQyC,EAAGzC,GAAG,GACxBkD,EAAMlD,GAAI,GAAQ8C,EAAG9C,GAAG,GACxBuD,EAAMvD,GAAI,GAAQmD,EAAGnD,GAAG,GACxB4D,EAAM5D,GAAI,GAAQwD,EAAGxD,GAAG,GACxBiE,EAAMjE,GAAI,GAAQ6D,EAAG7D,GAAG,GACxBsE,EAAMtE,GAAI,GAAQkE,EAAGlE,GAAG,GACxB2E,EAAM3E,GAAI,GAAQuE,EAAGvE,GAAG,KAGxB6B,EAAKvK,EAAI,GACT8K,EAAK9K,EAAI,GACTmL,EAAKnL,EAAI,GACTwL,EAAKxL,EAAI,GACT6L,EAAK7L,EAAI,GACTkM,EAAKlM,EAAI,GACTuM,EAAKvM,EAAI,GACT4M,EAAK5M,EAAI,GACTiN,EAAKjN,EAAI,GACTsN,EAAKtN,EAAI,GACToK,EAAMpD,EAAI,GACV2D,EAAM3D,EAAI,GAAQuD,EAAGvD,EAAG,GACxBgE,EAAMhE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBqE,EAAMrE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB0E,EAAM1E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB+E,EAAM/E,EAAI,GAAQ6E,EAAG7E,EAAG,GACxBoF,EAAMpF,EAAI,GAAQkF,EAAGlF,EAAG,GACxByF,EAAMzF,EAAI,GAAQuF,EAAGvF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBmG,EAAMnG,EAAI,GAAQiG,EAAGjG,EAAG,GACxBqD,EAAM5B,EAAI,GACVmC,EAAMnC,EAAI,GAAQ8B,EAAG9B,EAAG,GACxBwC,EAAMxC,EAAI,GAAQqC,EAAGrC,EAAG,GACxB6C,EAAM7C,EAAI,GAAQ0C,EAAG1C,EAAG,GACxBkD,EAAMlD,EAAI,GAAQ+C,EAAG/C,EAAG,GACxBuD,EAAMvD,EAAI,GAAQoD,EAAGpD,EAAG,GACxB4D,EAAM5D,EAAI,GAAQyD,EAAGzD,EAAG,GACxBiE,EAAMjE,EAAI,GAAQ8D,EAAG9D,EAAG,GACxBsE,EAAMtE,EAAI,GAAQmE,EAAGnE,EAAG,GACxB2E,EAAM3E,EAAI,GAAQwE,EAAGxE,EAAG,GACxB6B,EAAM5B,GAAI,GACVmC,EAAMnC,GAAI,GAAQ6B,EAAG7B,GAAG,GACxBwC,EAAMxC,GAAI,GAAQoC,EAAGpC,GAAG,GACxB6C,EAAM7C,GAAI,GAAQyC,EAAGzC,GAAG,GACxBkD,EAAMlD,GAAI,GAAQ8C,EAAG9C,GAAG,GACxBuD,EAAMvD,GAAI,GAAQmD,EAAGnD,GAAG,GACxB4D,EAAM5D,GAAI,GAAQwD,EAAGxD,GAAG,GACxBiE,EAAMjE,GAAI,GAAQ6D,EAAG7D,GAAG,GACxBsE,EAAMtE,GAAI,GAAQkE,EAAGlE,GAAG,GACxB2E,EAAM3E,GAAI,GAAQuE,EAAGvE,GAAG,IAGzBjC,GAAK/e,EAAE0O,OACPyS,GAAKF,EAAEvS,OACPoU,GAAKtU,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGTmT,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGd+S,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,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CACF,GtBlPIO,GAAiB,CuBYrB,SAA0BlmB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAhO,EACAiO,EACAzd,EACAwW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAsD,EACAC,EACAlO,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH4F,EAAKtO,EAAG,GAAIsO,EAAK,GAWtB,IAVKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtH,EAAG,GACnB+G,EAAMI,EAAOG,EAAG7F,EAAG,GACnBuF,EAAMI,EAAOE,EAAG5F,EAAG,GACb2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBqC,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CAGJ,ECrGA,SAA0BnjB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACAzO,EACAiO,EACAzd,EACAC,EACAuW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAtO,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGHgG,EAAK1O,EAAG,GAAI0O,EAAK,GAWtB,IAVKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1H,EAAG,GACnBwH,EAAML,EAAOO,EAAGjG,EAAG,GACnBgG,EAAML,EAAOM,EAAGhG,EAAG,GACb4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB0C,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CAIL,ECpIA,SAA0BxjB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAC,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAhB,EACAO,EACAK,EACAK,EACAuC,EACAS,EACAI,EACAZ,EACAS,EACAI,EACAZ,EACAS,EACAI,EACA7O,EACAiO,EACAzd,EACAC,EACAqe,EACA9H,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA3O,EA8BJ,IAxBAJ,GADAI,EAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGHqG,EAAK/O,EAAG,GAAI+O,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/H,EAAG,GACnB4H,EAAMT,EAAOY,EAAGtG,EAAG,GACnBoG,EAAMT,EAAOW,EAAGrG,EAAG,GACbgG,EAAK1O,EAAG,GAAI0O,EAAK,GActB,IAbKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,EAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,EAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,EAAGhG,EAAG,GACd4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB+C,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CAKN,ECjKA,SAA0B7jB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAlP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAnI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAhP,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH0G,GAAKpP,EAAG,GAAIoP,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpI,EAAG,GACnBiI,EAAMd,EAAOiB,GAAG3G,EAAG,GACnByG,EAAMd,EAAOgB,GAAG1G,EAAG,GACbqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,EAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBoD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBN,EAAMK,GAAOjS,EAAKmO,EAAMD,GAAMyD,EAAMrB,IACpCpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CAMP,EC9LA,SAA0BlkB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAvP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAxI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACArP,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGH+G,GAAKzP,EAAG,GAAIyP,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,EAAOuB,GAAGzI,EAAG,GACnBsI,EAAMnB,EAAOsB,GAAGhH,EAAG,GACnB8G,EAAMnB,EAAOqB,GAAG/G,EAAG,GACb0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,EAAG,GAAOmI,EAAGnI,EAAG,GACtBgF,EAAMvD,EAAG,GAAO0G,EAAG1G,EAAG,GACtBwD,EAAMvD,EAAG,GAAOyG,EAAGzG,EAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,EAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,EAAG,GACpByG,EAAMK,EAAQH,GAAG1G,EAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhByD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CAOR,EC3NA,SAA0BvkB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA5P,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAK,GACA7I,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA1P,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHoH,GAAK9P,EAAG,GAAI8P,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9I,GAAG,GACnB2I,EAAMxB,GAAO2B,GAAGrH,GAAG,GACnBmH,EAAMxB,GAAO0B,GAAGpH,GAAG,GACb+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,EAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,EAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,EAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,EAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,EAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,EAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,EAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,EAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,EAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,EAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,EAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,EAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,EAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,EAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,EAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,EAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,EAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,EAAGvF,GAAG,GAGhB8D,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,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CAQT,ECxPA,SAA0B5kB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAjQ,EACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAlJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/P,GA8BJ,IAxBAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHyH,GAAKnQ,EAAG,GAAImQ,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnJ,GAAG,GACnBgJ,EAAM7B,GAAOgC,GAAG1H,GAAG,GACnBwH,EAAM7B,GAAO+B,GAAGzH,GAAG,GACboH,GAAK9P,EAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,EAAMK,EAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBmE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CASV,ECrRA,SAA0BjlB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAtQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACApQ,GA8BJ,IAxBAJ,IADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGH8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxJ,GAAG,GACnBqJ,EAAMlC,GAAOqC,GAAG/H,GAAG,GACnB6H,GAAMlC,GAAOoC,GAAG9H,GAAG,GACbyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,EAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBwE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CAUX,EClTA,SAA2BtlB,EAAGihB,EAAGzS,EAAGqC,GACnC,IAAIsV,EACAnH,EACAwD,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,GACA3Q,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5J,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAzQ,GA8BJ,IAxBAJ,IADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGHmI,GAAK7Q,GAAG,GAAI6Q,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7J,GAAG,GACnB0J,GAAMvC,GAAO0C,GAAGpI,GAAG,GACnBkI,GAAMvC,GAAOyC,GAAGnI,GAAG,GACb8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnG,GAAG,GAAOuJ,GAAGvJ,GAAG,GACtBoG,EAAM3E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB4E,EAAM3E,GAAG,GAAO6H,GAAG7H,GAAG,GACtB0H,EAAMK,EAAQD,GAAGxJ,GAAG,GACpBqJ,GAAMK,GAAQF,GAAG/H,GAAG,GACpB6H,GAAMK,GAAQH,GAAG9H,GAAG,GACdyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,GAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhB6E,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBN,EAAMK,IAAOjS,EAAKmO,EAAMD,IAAMyD,EAAMrB,KACpCpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CAWZ,G/BlVIyD,GAA0B,CgCS9B,SAA0BppB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAN,EACAO,EACAN,EACAO,EACAiD,EACAC,EACAC,EACAhO,EACAiO,EACAzd,EACAwW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAsD,EACAC,EACAlO,EAmCJ,IA7BAJ,GADAI,EAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb8T,EAAKtO,EAAG,GAAIsO,EAAK,GAWtB,IAVKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEPC,EAAMI,EAAOI,EAAGtH,EAAG,GACnB+G,EAAMI,EAAOG,EAAG7F,EAAG,GACnBuF,EAAMI,EAAOE,EAAG5F,EAAG,GACb2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBqC,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CAGJ,EC7GA,SAA0BnjB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,EACAC,EACAsD,EACAC,EACAC,EACAvD,EACAO,EACAK,EACAX,EACAO,EACAK,EACAX,EACAO,EACAK,EACA4C,EACAS,EACAR,EACAS,EACAR,EACAS,EACAzO,EACAiO,EACAzd,EACAC,EACAuW,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAiD,EACAC,EACAI,EACAtO,EAmCJ,IA7BAJ,GADAI,EAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,EAAE4G,GACPyB,EAAKrI,EAAEqI,GACPC,EAAKtI,EAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbkU,EAAK1O,EAAG,GAAI0O,EAAK,GAWtB,IAVKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPU,EAAML,EAAOQ,EAAG1H,EAAG,GACnBwH,EAAML,EAAOO,EAAGjG,EAAG,GACnBgG,EAAML,EAAOM,EAAGhG,EAAG,GACb4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB0C,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CAIL,EC5IA,SAA0BxjB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA7O,EACAiO,EACAzd,EACAC,EACAqe,EACA9H,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,EACAK,EACAK,EACA4C,EACAC,EACAI,EACAK,EACA3O,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbuU,EAAK/O,EAAG,GAAI+O,EAAK,GAWtB,IAVKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPc,EAAMT,EAAOa,EAAG/H,EAAG,GACnB4H,EAAMT,EAAOY,EAAGtG,EAAG,GACnBoG,EAAMT,EAAOW,EAAGrG,EAAG,GACbgG,EAAK1O,EAAG,GAAI0O,EAAK,GActB,IAbKA,EAAKb,GACTpd,EAAKie,EACLA,EAAK,IAELje,EAAKod,EACLa,GAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,EAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,EAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,EAAGhG,EAAG,GACd4F,EAAKtO,EAAG,GAAIsO,EAAK,GActB,IAbKA,EAAKT,GACTrd,EAAK8d,EACLA,EAAK,IAEL9d,EAAKqd,EACLS,GAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,EAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,EAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,EAAG5F,EAAG,GACd2F,EAAKrO,EAAG,GAAIqO,EAAK,GAmBtB,IAlBKA,EAAKR,GACTI,EAAKI,EACLA,EAAK,IAELJ,EAAKJ,EACLQ,GAAMR,GAGPpH,EAAKqH,EAAQO,EAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,EAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,EAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhB+C,EAAK,EAAGA,EAAKqD,EAAIrD,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAK3a,EAAI2a,IAAO,CAC7B,IAAML,EAAK,EAAGA,EAAKva,EAAIua,IAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CAKN,ECzKA,SAA0B7jB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAlP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAnI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EACA2B,EACAC,EACAM,GACAK,GACAK,GACAK,GACAuC,GACAC,GACAI,GACAK,GACAK,GACAhP,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb4U,GAAKpP,EAAG,GAAIoP,GAAK,GAWtB,IAVKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEPmB,EAAMd,EAAOkB,GAAGpI,EAAG,GACnBiI,EAAMd,EAAOiB,GAAG3G,EAAG,GACnByG,EAAMd,EAAOgB,GAAG1G,EAAG,GACbqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,EAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,EAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,EAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhBoD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,EAAK,EAAGA,EAAKwD,EAAIxD,IACtBkD,EAAMxD,EAAMK,EAAIjS,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,KACnDpC,GAAM2D,EACNvB,GAAMwB,EACNG,GAAMF,EAEP7D,GAAMkE,EACN9B,GAAM+B,EACNJ,GAAMK,CACN,CACDpE,GAAMuE,EACNnC,GAAMoC,EACNT,GAAMU,CACN,CACDzE,GAAM4E,EACNxC,GAAMyC,EACNd,GAAMe,CACN,CACD9E,GAAMiF,EACN7C,GAAM8C,EACNnB,GAAMoB,CACN,CAMP,ECtMA,SAA0BlkB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACAvP,EACAiO,EACAzd,EACAC,EACAqe,EACAK,EACAK,EACAxI,EACAyB,EACAC,EACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAkC,GACAC,GACAI,GACAK,GACAK,GACAK,GACArP,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,EAAK5G,GAAE4G,GACPyB,EAAKrI,GAAEqI,GACPC,EAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,EAAG,GACTqD,EAAM5B,EAAG,GACT6B,EAAM5B,EAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbiV,GAAKzP,EAAG,GAAIyP,GAAK,GAWtB,IAVKA,GAAK5B,GACT2B,EAAKC,GACLA,GAAK,IAELD,EAAK3B,EACL4B,IAAM5B,GAEPwB,EAAMnB,GAAOuB,GAAGzI,EAAG,GACnBsI,EAAMnB,GAAOsB,GAAGhH,EAAG,GACnB8G,EAAMnB,GAAOqB,GAAG/G,EAAG,GACb0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,EAAKC,GACLA,GAAK,IAELD,EAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,EAAG,GAAOmI,EAAGnI,EAAG,GACtBgF,EAAMvD,EAAG,GAAO0G,EAAG1G,EAAG,GACtBwD,EAAMvD,EAAG,GAAOyG,EAAGzG,EAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,EAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,EAAG,GACpByG,EAAMK,EAAQH,GAAG1G,EAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,EAAG,GAAO8H,EAAG9H,EAAG,GACtB2E,EAAMlD,EAAG,GAAOqG,EAAGrG,EAAG,GACtBmD,EAAMlD,EAAG,GAAOoG,EAAGpG,EAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,EAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,EAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,EAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,EAAG,GAAOvW,EAAGuW,EAAG,GACtBsE,EAAM7C,EAAG,GAAOhY,EAAGgY,EAAG,GACtB8C,EAAM7C,EAAG,GAAOjY,EAAGiY,EAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,EAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,EAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,EAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,EAAG,GAAOxW,EAAGwW,EAAG,GACtBiE,EAAMxC,EAAG,GAAOjY,EAAGiY,EAAG,GACtByC,EAAMxC,EAAG,GAAOlY,EAAGkY,EAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,EAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,EAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,EAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,EAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,EAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,EAAG,GAGnBiC,EAAM3D,EAAG,GAAOiH,EAAGjH,EAAG,GACtB4D,EAAMnC,EAAG,GAAOwF,EAAGxF,EAAG,GACtBoC,EAAMnC,EAAG,GAAOuF,EAAGvF,EAAG,GAGhByD,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKqD,EAAIrD,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CAOR,ECnOA,SAA0BvkB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,EACA5P,EACAiO,EACAzd,EACAC,EACAqe,GACAK,GACAK,GACAK,GACA7I,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACA6B,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACA1P,GAmCJ,IA7BAJ,GADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbsV,GAAK9P,EAAG,GAAI8P,GAAK,GAWtB,IAVKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEP6B,EAAMxB,GAAO4B,GAAG9I,GAAG,GACnB2I,EAAMxB,GAAO2B,GAAGrH,GAAG,GACnBmH,EAAMxB,GAAO0B,GAAGpH,GAAG,GACb+G,GAAKzP,EAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,EAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,EAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,EAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,EAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,EAAKie,GACLA,GAAK,IAELje,EAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,EAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,EAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,EAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,EAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,EAAK8d,GACLA,GAAK,IAEL9d,EAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,EAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,EAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,EAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,EAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,EAAKI,GACLA,GAAK,IAELJ,EAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,EAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,EAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,EAAGvF,GAAG,GAGhB8D,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,GAAK3a,EAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,EAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,EAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CAQT,EChQA,SAA0B5kB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAjQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAlJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAwB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACA/P,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGb2V,GAAKnQ,GAAG,GAAImQ,GAAK,GAWtB,IAVKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPkC,EAAM7B,GAAOiC,GAAGnJ,GAAG,GACnBgJ,EAAM7B,GAAOgC,GAAG1H,GAAG,GACnBwH,GAAM7B,GAAO+B,GAAGzH,GAAG,GACboH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,EAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,EAAMK,EAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,EAAMK,EAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,EAAMI,EAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,EAAMS,EAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,EAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBmE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CASV,EC7RA,SAA0BjlB,EAAGihB,EAAGzS,EAAGqC,GAClC,IAAIsV,EACAnH,EACAwD,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,GACAtQ,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAvJ,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAmB,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACApQ,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbgW,GAAKxQ,GAAG,GAAIwQ,GAAK,GAWtB,IAVKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPuC,EAAMlC,GAAOsC,GAAGxJ,GAAG,GACnBqJ,EAAMlC,GAAOqC,GAAG/H,GAAG,GACnB6H,GAAMlC,GAAOoC,GAAG9H,GAAG,GACbyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,EAAMK,EAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,EAAMK,EAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,EAAMK,EAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,EAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhBwE,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CAUX,EC1TA,SAA2BtlB,EAAGihB,EAAGzS,EAAGqC,GACnC,IAAIsV,EACAnH,EACAwD,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,GACA3Q,GACAiO,GACAzd,GACAC,GACAqe,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACA5J,GACAyB,GACAC,GACAwF,GACAC,GACAC,GACA3H,GACAoC,GACA2B,GACAC,GACAM,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAc,GACAC,GACAI,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAK,GACAzQ,GAmCJ,IA7BAJ,IADAI,GAAIgJ,GAAW1hB,EAAEwT,MAAOxT,EAAEwI,QAASyY,EAAEzY,QAASgG,EAAEhG,UACzC8P,GACPgH,GAAK5G,GAAE4G,GACPyB,GAAKrI,GAAEqI,GACPC,GAAKtI,GAAEsI,GAGPmF,EAAQhE,GAAWniB,EAAEmI,MAAO8Y,EAAE9Y,MAAOqG,EAAErG,OAGvCqe,GAAKxmB,EAAE0O,OACP+X,GAAKxF,EAAEvS,OACPgY,GAAKlY,EAAEE,OAGPsQ,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT8P,EAAMpD,GAAG,GACTqD,EAAM5B,GAAG,GACT6B,EAAM5B,GAAG,GAGT+E,EAAO/lB,EAAE8S,UAAU,GACnBkT,EAAO/E,EAAEnO,UAAU,GACnBmT,EAAOzX,EAAEsE,UAAU,GAGbqW,GAAK7Q,GAAG,GAAI6Q,GAAK,GAWtB,IAVKA,GAAKhD,GACT+C,GAAKC,GACLA,GAAK,IAELD,GAAK/C,EACLgD,IAAMhD,GAEP4C,EAAMvC,GAAO2C,GAAG7J,GAAG,GACnB0J,GAAMvC,GAAO0C,GAAGpI,GAAG,GACnBkI,GAAMvC,GAAOyC,GAAGnI,GAAG,GACb8H,GAAKxQ,GAAG,GAAIwQ,GAAK,GActB,IAbKA,GAAK3C,GACT0C,GAAKC,GACLA,GAAK,IAELD,GAAK1C,EACL2C,IAAM3C,GAEPV,EAAMnG,GAAG,GAAOuJ,GAAGvJ,GAAG,GACtBoG,EAAM3E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB4E,EAAM3E,GAAG,GAAO6H,GAAG7H,GAAG,GACtB0H,EAAMK,EAAQD,GAAGxJ,GAAG,GACpBqJ,GAAMK,GAAQF,GAAG/H,GAAG,GACpB6H,GAAMK,GAAQH,GAAG9H,GAAG,GACdyH,GAAKnQ,GAAG,GAAImQ,GAAK,GActB,IAbKA,GAAKtC,GACTqC,GAAKC,GACLA,GAAK,IAELD,GAAKrC,EACLsC,IAAMtC,GAEPf,EAAM9F,GAAG,GAAOkJ,GAAGlJ,GAAG,GACtB+F,EAAMtE,GAAG,GAAOyH,GAAGzH,GAAG,GACtBuE,EAAMtE,GAAG,GAAOwH,GAAGxH,GAAG,GACtBqH,EAAMK,EAAQD,GAAGnJ,GAAG,GACpBgJ,GAAMK,GAAQF,GAAG1H,GAAG,GACpBwH,GAAMK,GAAQH,GAAGzH,GAAG,GACdoH,GAAK9P,GAAG,GAAI8P,GAAK,GActB,IAbKA,GAAKjC,GACTgC,GAAKC,GACLA,GAAK,IAELD,GAAKhC,EACLiC,IAAMjC,GAEPpB,EAAMzF,GAAG,GAAO6I,GAAG7I,GAAG,GACtB0F,EAAMjE,GAAG,GAAOoH,GAAGpH,GAAG,GACtBkE,EAAMjE,GAAG,GAAOmH,GAAGnH,GAAG,GACtBgH,EAAMK,EAAQD,GAAG9I,GAAG,GACpB2I,GAAMK,GAAQF,GAAGrH,GAAG,GACpBmH,GAAMK,GAAQH,GAAGpH,GAAG,GACd+G,GAAKzP,GAAG,GAAIyP,GAAK,GActB,IAbKA,GAAK5B,GACT2B,GAAKC,GACLA,GAAK,IAELD,GAAK3B,EACL4B,IAAM5B,GAEPzB,EAAMpF,GAAG,GAAOwI,GAAGxI,GAAG,GACtBqF,EAAM5D,GAAG,GAAO+G,GAAG/G,GAAG,GACtB6D,EAAM5D,GAAG,GAAO8G,GAAG9G,GAAG,GACtB2G,EAAMK,EAAQD,GAAGzI,GAAG,GACpBsI,GAAMK,GAAQF,GAAGhH,GAAG,GACpB8G,GAAMK,GAAQH,GAAG/G,GAAG,GACd0G,GAAKpP,GAAG,GAAIoP,GAAK,GActB,IAbKA,GAAKvB,GACTsB,GAAKC,GACLA,GAAK,IAELD,GAAKtB,EACLuB,IAAMvB,GAEP9B,EAAM/E,GAAG,GAAOmI,GAAGnI,GAAG,GACtBgF,EAAMvD,GAAG,GAAO0G,GAAG1G,GAAG,GACtBwD,EAAMvD,GAAG,GAAOyG,GAAGzG,GAAG,GACtBsG,EAAMK,EAAQD,GAAGpI,GAAG,GACpBiI,EAAMK,GAAQF,GAAG3G,GAAG,GACpByG,GAAMK,GAAQH,GAAG1G,GAAG,GACdqG,GAAK/O,GAAG,GAAI+O,GAAK,GActB,IAbKA,GAAKlB,GACTiB,GAAKC,GACLA,GAAK,IAELD,GAAKjB,EACLkB,IAAMlB,GAEPnC,EAAM1E,GAAG,GAAO8H,GAAG9H,GAAG,GACtB2E,EAAMlD,GAAG,GAAOqG,GAAGrG,GAAG,GACtBmD,EAAMlD,GAAG,GAAOoG,GAAGpG,GAAG,GACtBiG,EAAMK,EAAQD,GAAG/H,GAAG,GACpB4H,EAAMK,EAAQF,GAAGtG,GAAG,GACpBoG,GAAMK,GAAQH,GAAGrG,GAAG,GACdgG,GAAK1O,GAAG,GAAI0O,GAAK,GActB,IAbKA,GAAKb,GACTpd,GAAKie,GACLA,GAAK,IAELje,GAAKod,EACLa,IAAMb,GAEPxC,EAAMrE,GAAG,GAAOvW,GAAGuW,GAAG,GACtBsE,EAAM7C,GAAG,GAAOhY,GAAGgY,GAAG,GACtB8C,EAAM7C,GAAG,GAAOjY,GAAGiY,GAAG,GACtB6F,EAAMI,EAAQD,GAAG1H,GAAG,GACpBwH,EAAMI,EAAQF,GAAGjG,GAAG,GACpBgG,GAAMI,GAAQH,GAAGhG,GAAG,GACd4F,GAAKtO,GAAG,GAAIsO,GAAK,GActB,IAbKA,GAAKT,GACTrd,GAAK8d,GACLA,GAAK,IAEL9d,GAAKqd,EACLS,IAAMT,GAEP7C,EAAMhE,GAAG,GAAOxW,GAAGwW,GAAG,GACtBiE,EAAMxC,GAAG,GAAOjY,GAAGiY,GAAG,GACtByC,EAAMxC,GAAG,GAAOlY,GAAGkY,GAAG,GACtBoF,EAAMS,EAAQD,GAAGtH,GAAG,GACpB+G,EAAMS,EAAQF,GAAG7F,GAAG,GACpBuF,GAAMS,GAAQH,GAAG5F,GAAG,GACd2F,GAAKrO,GAAG,GAAIqO,GAAK,GAmBtB,IAlBKA,GAAKR,GACTI,GAAKI,GACLA,GAAK,IAELJ,GAAKJ,EACLQ,IAAMR,GAGPpH,GAAKqH,EAAQO,GAAGrH,GAAG,GACnB6B,GAAKkF,EAAQM,GAAG5F,GAAG,GACnB+B,GAAKwD,GAAQK,GAAG3F,GAAG,GAGnBiC,EAAM3D,GAAG,GAAOiH,GAAGjH,GAAG,GACtB4D,EAAMnC,GAAG,GAAOwF,GAAGxF,GAAG,GACtBoC,EAAMnC,GAAG,GAAOuF,GAAGvF,GAAG,GAGhB6E,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,GAAK3a,GAAI2a,KAAO,CAC7B,IAAML,GAAK,EAAGA,GAAKva,GAAIua,KAAO,CAC7B,IAAMN,GAAK,EAAGA,GAAKwD,GAAIxD,KACtBkD,EAAMxD,EAAMK,GAAIjS,EAAKkV,EAAM/G,EAAMD,IAAMiH,EAAMxD,EAAMrB,MACnDpC,IAAM2D,EACNvB,IAAMwB,EACNG,IAAMF,EAEP7D,IAAMkE,EACN9B,IAAM+B,EACNJ,IAAMK,CACN,CACDpE,IAAMuE,EACNnC,IAAMoC,EACNT,IAAMU,CACN,CACDzE,IAAM4E,EACNxC,IAAMyC,EACNd,IAAMe,CACN,CACD9E,IAAMiF,EACN7C,IAAM8C,EACNnB,IAAMoB,CACN,CACDnF,IAAMsF,EACNlD,IAAMmD,EACNxB,IAAMyB,CACN,CACDxF,IAAM2F,EACNvD,IAAMwD,EACN7B,IAAM8B,CACN,CACD7F,IAAMgG,EACN5D,IAAM6D,EACNlC,IAAMmC,CACN,CACDlG,IAAMqG,EACNjE,IAAMkE,EACNvC,IAAMwC,CACN,CACDvG,IAAM0G,EACNtE,IAAMuE,EACN5C,IAAM6C,CACN,CAWZ,GxCvVI0D,GAAW9G,GAAO1qB,OAAS,EAc/B,SAASyxB,GAActpB,EAAGihB,EAAGzS,GAC5B,OAAOgS,GAAc,CAAExgB,EAAGihB,EAAGzS,GAAK,oBAAoB,EACvD,CA+DA,SAAS1G,GAAQsX,EAAQvO,GACxB,IAAIjI,EACA2gB,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAtpB,EACAoW,EACAyI,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACAsD,EACAhqB,EACAihB,EACAzS,EACAyb,EACA5yB,EAYJ,GATA2I,EAAIkqB,GAAgB9K,EAAQ,IAC5B6B,EAAIiJ,GAAgB9K,EAAQ,IAC5B5Q,EAAI0b,GAAgB9K,EAAQ,IAG5BsK,EAAM1pB,EAAEwT,MACRmW,EAAM1I,EAAEzN,MACRoW,EAAMpb,EAAEgF,OACR5K,EAAQ8gB,EAAI7xB,UACG8xB,EAAI9xB,QAAU+Q,IAAUghB,EAAI/xB,OAC1C,MAAM,IAAIgB,MAAOwD,EAAQ,uIAAwIuM,EAAO+gB,EAAI9xB,OAAQ+xB,EAAI/xB,SAGzL,GAAe,IAAV+Q,EACJ,OAAK0gB,GAActpB,EAAGihB,EAAGzS,GACjBsX,GAAiBld,GAAS5I,EAAGihB,EAAGzS,EAAGqC,GAEpC0R,GAAQ3Z,GAAS5I,EAAGihB,EAAGzS,EAAGqC,GAKlC,IAFApQ,EAAM,EACNupB,EAAK,EACC3yB,EAAI,EAAGA,EAAIuR,EAAOvR,IAAM,CAE7B,IADA4yB,EAAIP,EAAKryB,MACEsyB,EAAKtyB,IAAO4yB,IAAML,EAAKvyB,GACjC,MAAM,IAAIwB,MAAO,uDAGlB4H,GAAOwpB,EAGI,IAANA,IACJD,GAAM,EAEP,CAED,GAAa,IAARvpB,EAAL,CAIA,GAAe,IAAVmI,EACJ,OAAK0gB,GAActpB,EAAGihB,EAAGzS,GACjBsX,GAAiBld,GAAS5I,EAAGihB,EAAGzS,EAAGqC,GAEpC0R,GAAQ3Z,GAAS5I,EAAGihB,EAAGzS,EAAGqC,GAOlC,GALAyO,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGFwhB,IAAOphB,EAAM,EAAI,CAErB,IAAMvR,EAAI,EAAGA,EAAIuR,GACE,IAAb8gB,EAAKryB,GADaA,KAWxB,OANA2I,EAAEwT,MAAQ,CAAEkW,EAAIryB,IAChB4pB,EAAEzN,MAAQxT,EAAEwT,MACZhF,EAAEgF,MAAQxT,EAAEwT,MACZxT,EAAEwI,QAAU,CAAE8W,EAAGjoB,IACjB4pB,EAAEzY,QAAU,CAAEuY,EAAG1pB,IACjBmX,EAAEhG,QAAU,CAAEwY,EAAG3pB,IACZiyB,GAActpB,EAAGihB,EAAGzS,GACjBsX,GAAiB,GAAK9lB,EAAGihB,EAAGzS,EAAGqC,GAEhC0R,GAAQ,GAAKviB,EAAGihB,EAAGzS,EAAGqC,EAC7B,CAOD,GANAgZ,EAAMthB,GAAgB+W,GACtBwK,EAAMvhB,GAAgBwY,GACtBgJ,EAAMxhB,GAAgByY,GAGtBnK,EAAMnO,GAAe4W,GACR,IAARuK,GAAqB,IAARC,GAAqB,IAARC,GAAalT,IAAQnO,GAAeqY,IAAQlK,IAAQnO,GAAesY,GAAO,CAOxG,GALAuI,EAAOhW,GAAuBmW,EAAKpK,EAAItf,EAAE0O,QACzC8a,EAAOjW,GAAuBoW,EAAK5I,EAAIE,EAAEvS,QACzC+a,EAAOlW,GAAuBqW,EAAK5I,EAAIxS,EAAEE,QAIxCjO,IAAU8oB,EAAK,GAAGA,EAAK,GAAG,GAC1B9oB,IAAU+oB,EAAK,GAAGA,EAAK,GAAG,GAC1B/oB,IAAUgpB,EAAK,GAAGA,EAAK,GAAG,EA2B1B,OAvBCjD,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAGX9C,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAGX9C,EADY,IAARqD,EACCN,EAAM,GAENA,EAAM,GAEZzpB,EAAEwT,MAAQ,CAAE/S,GACZwgB,EAAEzN,MAAQxT,EAAEwT,MACZhF,EAAEgF,MAAQxT,EAAEwT,MACZxT,EAAEwI,QAAU,CAAEqhB,GACd5I,EAAEzY,QAAU,CAAEshB,GACdtb,EAAEhG,QAAU,CAAEuhB,GACd/pB,EAAE0O,OAAS8X,EACXvF,EAAEvS,OAAS+X,EACXjY,EAAEE,OAASgY,EACN4C,GAActpB,EAAGihB,EAAGzS,GACjBsX,GAAiB,GAAK9lB,EAAGihB,EAAGzS,EAAGqC,GAEhC0R,GAAQ,GAAKviB,EAAGihB,EAAGzS,EAAGqC,GAK9B,GAAKjI,GAASygB,GAEb,OAAKC,GAActpB,EAAGihB,EAAGzS,GACjBsX,GAAiBld,GAAS5I,EAAGihB,EAAGzS,EAAW,IAARqI,EAAWhG,GAE/C0R,GAAQ3Z,GAAS5I,EAAGihB,EAAGzS,EAAW,IAARqI,EAAWhG,EAG7C,CAID,OAAKjI,GAASygB,GACRC,GAActpB,EAAGihB,EAAGzS,GACjB4a,GAAyBxgB,EAAM,GAAK5I,EAAGihB,EAAGzS,EAAGqC,GAE9CqV,GAAgBtd,EAAM,GAAK5I,EAAGihB,EAAGzS,EAAGqC,GAGvCyY,GAActpB,EAAGihB,EAAGzS,GFjP1B,SAAmBxO,EAAGihB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACA0H,EACAC,EACAC,EACAtE,EACAC,EACAC,EACAxlB,EACA6X,EACAgH,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EAEA9pB,EAiCJ,IA5BAoJ,EAAM+e,GAHNlH,EAAKtY,EAAEwT,OAMPwL,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT0M,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGPge,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPyb,EAAOnqB,EAAEoT,MACTgX,EAAOnJ,EAAE7N,MACTiX,EAAO7b,EAAE4E,MAGT2S,EAAO/lB,EAAE8S,UAAW,GACpBkT,EAAO/E,EAAEnO,UAAW,GACpBmT,EAAOzX,EAAEsE,UAAW,GAGdzb,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB0nB,EAAKqD,GAAW9J,EAAIgH,EAAIkH,EAAI2D,EAAM9yB,EAAGirB,IACrCnB,EAAKiB,GAAW9J,EAAIyI,EAAI0F,EAAI2D,EAAM/yB,EAAGirB,IAErC2D,EAAMxD,EADDL,GAAW9J,EAAI0I,EAAI0F,EAAI2D,EAAMhzB,EAAGirB,IACrBzR,EAAKkV,EAAM/G,EAAMD,GAAMiH,EAAMxD,EAAMrB,IAErD,CEsLSmJ,CAAkBtqB,EAAGihB,EAAGzS,EAAGqC,QD1PpC,SAAmB7Q,EAAGihB,EAAGzS,EAAGqC,GAC3B,IAAImO,EACAwD,EACAC,EACA0H,EACAC,EACAC,EACA5pB,EACA6X,EACAgH,EACAyB,EACAC,EACAwF,EACAC,EACAC,EACA3H,EACAoC,EAEA9pB,EA4BJ,IAvBAoJ,EAAM+e,GAHNlH,EAAKtY,EAAEwT,OAMPwL,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KACT6P,EAAOjU,EAAEoE,KAGT0M,EAAKtf,EAAEwI,QACPuY,EAAKE,EAAEzY,QACPwY,EAAKxS,EAAEhG,QAGPge,EAAKxmB,EAAE0O,OACP+X,EAAKxF,EAAEvS,OACPgY,EAAKlY,EAAEE,OAGPyb,EAAOnqB,EAAEoT,MACTgX,EAAOnJ,EAAE7N,MACTiX,EAAO7b,EAAE4E,MAGH/b,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrB0nB,EAAKqD,GAAW9J,EAAIgH,EAAIkH,EAAI2D,EAAM9yB,EAAGirB,IACrCnB,EAAKiB,GAAW9J,EAAIyI,EAAI0F,EAAI2D,EAAM/yB,EAAGirB,IAErCG,EADKL,GAAW9J,EAAI0I,EAAI0F,EAAI2D,EAAMhzB,EAAGirB,KACxBzR,EAAKmO,EAAMD,GAAMyD,EAAMrB,GAEtC,CCwMCoJ,CAAUvqB,EAAGihB,EAAGzS,EAAGqC,EAxGlB,CAyGF,CyC9UA,SAAS2Z,GAAQtzB,EAAOuJ,GACvB,IAAI6C,EACAjM,EAIJ,IADAiM,EAAM,GACAjM,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBiM,EAAIlH,KAAMlF,GAEX,OAAOoM,CACR,CCVA,SAASnM,GAAOsJ,GACf,OAAO+pB,GAAQ,EAAK/pB,EACrB,CCqDA,SAASgqB,GAAgBnnB,EAAKkQ,GAC7B,IAAIhL,EACAkiB,EACApS,EACAC,EACAlH,EACAsH,EACAsR,EACA5yB,EACA8D,EAKJ,IAHAkW,EAAImC,EAAM3b,SAEV8gB,GADAL,EAAK4H,GAAU5c,GAAK,IACbzL,QAEN,MAAM,IAAIgB,MAAO,gKAOlB,IAJA2P,EAAUrR,GAAOka,GAGjBkH,EAAK8H,GAAY/c,GAAK,GAChBjM,EAAIga,EAAE,EAAGha,GAAK,EAAGA,IAEtB,MADA8D,EAAIwd,EAAItH,EAAIha,GACH,GAAT,CAMA,GAFA4yB,EAAI3R,EAAInd,GAEK,KADbuvB,EAAMlX,EAAOnc,KACKqzB,EAAMT,EACvB,MAAM,IAAIpxB,MAAOwD,EAAQ,8PAA+PgiB,GAAM/F,GAAKtH,KAAM,MAAQqN,GAAM7K,GAAQxC,KAAM,MAAQ3Z,IAE9U,GAAK4yB,IAAMS,EACVliB,EAASnR,GAAMkhB,EAAIpd,OACb,IAAW,IAAN8uB,EAKX,MAAM,IAAIpxB,MAAOwD,EAAQ,2IAA4IgiB,GAAM/F,GAAKtH,KAAM,MAAQqN,GAAM7K,GAAQxC,KAAM,MAAQ3Z,IAH1NmR,EAASnR,GAAM,CAIf,CAdA,CAgBF,OAAOsf,GAASwJ,GAAU7c,GAAO2c,GAAS3c,GAAO+a,GAAM7K,GAAShL,EAAS8X,GAAWhd,GAAOid,GAAUjd,GACtG,CCnDA,SAASqnB,GAAqBrnB,EAAKkQ,GAClC,IAAI8E,EACAjH,EACAha,EAMJ,GAJAga,EAAImC,EAAM3b,QACVygB,EAAK4H,GAAU5c,GAAK,IAGZzL,SAAWwZ,EAAI,CACtB,IAAMha,EAAI,EAAGA,EAAIga,EAAGha,IAEnB,GAAKihB,EAAIjhB,KAAQmc,EAAOnc,GAEvB,OAAOuzB,GAAWtnB,EAAKkQ,GAGzB,OAAOlQ,CACP,CAED,OAAOsnB,GAAWtnB,EAAKkQ,EACxB,CC9EA,IAAIkH,GAAa3C,GAAUwB,GAAQ,2BAsDnC,SAASsR,GAAgC5rB,GACxC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CC9DA,IAAI6rB,GAAY/zB,OAAOmB,UAAUmO,cC6CjC,SAAS0kB,GAAO1Z,EAAGrR,EAAG6e,EAASC,EAASmC,EAAG+J,EAASC,GACnD,IAAIjM,EACAwD,EACAzkB,EACAD,EACAihB,EACAoC,EACA9pB,EAYJ,IATA2nB,EAAOhf,EAAE4S,KACT4P,EAAOvB,EAAErO,KAGT9U,EAAMkC,EAAE8S,UAAW,GACnB/U,EAAMkjB,EAAEnO,UAAW,GAEnBiM,EAAKD,EACLqC,EAAK8J,EACC5zB,EAAI,EAAGA,EAAIga,EAAGha,IACnB0G,EAAKykB,EAAMrB,EAAIrjB,EAAKkhB,EAAMD,IAC1BA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CChEA,IAAItI,GAAI,EAsBR,SAASoS,GAAO1Z,EAAGrR,EAAG6e,EAASoC,EAAG+J,GACjC,IAAIjM,EACAoC,EACAqF,EACAC,EACAhO,EACAphB,EAEJ,GAAKga,GAAK,EACT,OAAO4P,EAIR,GAFAuF,EAAK9T,GAAkB1S,GACvBymB,EAAK/T,GAAkBuO,GAClBuF,EAAG3T,kBAAoB4T,EAAG5T,iBAY9B,OADAC,GAAWzB,EAAGmV,EAAI3H,EATjBE,EADIF,EAAU,GACR,EAAExN,GAAKwN,EAER,EAOyB4H,EAAIuE,EAJlC7J,EADI6J,EAAU,GACR,EAAE3Z,GAAK2Z,EAER,GAGCvE,EAAG7T,KAGX,GAAiB,IAAZiM,GAA6B,IAAZmM,EAAgB,CAIrC,IAHAvS,EAAIpH,EAAIsH,IAGC,EACR,IAAMthB,EAAI,EAAGA,EAAIohB,EAAGphB,IACnB4pB,EAAG5pB,GAAM2I,EAAG3I,GAGd,GAAKga,EAAIsH,GACR,OAAOsI,EAER,IAAM5pB,EAAIohB,EAAGphB,EAAIga,EAAGha,GAAKshB,GACxBsI,EAAG5pB,GAAM2I,EAAG3I,GACZ4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAChB4pB,EAAG5pB,EAAE,GAAM2I,EAAG3I,EAAE,GAEjB,OAAO4pB,CACP,CAWD,IATClC,EADIF,EAAU,GACR,EAAExN,GAAKwN,EAER,EAGLsC,EADI6J,EAAU,GACR,EAAE3Z,GAAK2Z,EAER,EAEA3zB,EAAI,EAAGA,EAAIga,EAAGha,IACnB4pB,EAAGE,GAAOnhB,EAAG+e,GACbA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CC1FA,IAAItI,GAAI,EAwBR,SAASoS,GAAO1Z,EAAGrR,EAAG6e,EAASC,EAASmC,EAAG+J,EAASC,GACnD,IAAIlM,EACAoC,EACAqF,EACAC,EACAhO,EACAphB,EAEJ,GAAKga,GAAK,EACT,OAAO4P,EAIR,GAFAuF,EAAK9T,GAAkB1S,GACvBymB,EAAK/T,GAAkBuO,GAClBuF,EAAG3T,kBAAoB4T,EAAG5T,iBAE9B,OADAC,GAAWzB,EAAGmV,EAAI3H,EAASC,EAAS2H,EAAIuE,EAASC,GAC1CxE,EAAG7T,KAMX,GAJAmM,EAAKD,EACLqC,EAAK8J,EAGY,IAAZpM,GAA6B,IAAZmM,EAAgB,CAIrC,IAHAvS,EAAIpH,EAAIsH,IAGC,EACR,IAAMthB,EAAI,EAAGA,EAAIohB,EAAGphB,IACnB4pB,EAAGE,GAAOnhB,EAAG+e,GACbA,GAAMF,EACNsC,GAAM6J,EAGR,GAAK3Z,EAAIsH,GACR,OAAOsI,EAER,IAAM5pB,EAAIohB,EAAGphB,EAAIga,EAAGha,GAAKshB,GACxBsI,EAAGE,GAAOnhB,EAAG+e,GACbkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBkC,EAAGE,EAAG,GAAMnhB,EAAG+e,EAAG,GAClBA,GAAMpG,GACNwI,GAAMxI,GAEP,OAAOsI,CACP,CACD,IAAM5pB,EAAI,EAAGA,EAAIga,EAAGha,IACnB4pB,EAAGE,GAAOnhB,EAAG+e,GACbA,GAAMF,EACNsC,GAAM6J,EAEP,OAAO/J,CACR,CC1DA,SAASxN,GAAKzT,EAAGihB,GAChB,OAAKjhB,EAAIihB,EACDjhB,EAEDihB,CACR,CCDAxhB,EAAA3I,GAAA,UAAA6f,IC9BA,IAAIuU,GAAiB,wCCDjBC,GAAY,SCmChB,SAASC,GAAmC7tB,EAAKC,EAAMyE,EAAQqH,GAC9DtS,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOmE,EACPlE,IAAOuL,GAET,CCfA,SAAS+hB,GAAqB9tB,EAAKC,EAAMyE,GACxCjL,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOmE,GAET,CCEA,SAASqpB,GAAsB/tB,EAAKC,EAAMyE,EAAQqH,GACjDtS,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOmE,EACPlE,IAAOuL,GAET,CC1CA,IAAIiiB,GAAoB,CACvBxkB,KAAQ,CACPjJ,IAAO,UACPC,IAAO,WAERmJ,MAAS,CACRpJ,IAAO,WACPC,IAAO,YAERqJ,MAAS,CACRtJ,IAAO,WACPC,IAAO,YAERuJ,MAAS,CACRxJ,IAAO,cACPC,IAAO,eAERiJ,MAAS,CACRlJ,IAAO,WACPC,IAAO,YAERoJ,OAAU,CACTrJ,IAAO,YACPC,IAAO,aAERsJ,OAAU,CACTvJ,IAAO,YACPC,IAAO,aAERwJ,OAAU,CACTzJ,IAAO,eACPC,IAAO,gBAERyJ,QAAW,CACV1J,IAAO,aACPC,IAAO,cAER0J,QAAW,CACV3J,IAAO,aACPC,IAAO,cAER2J,QAAW,CACV5J,IAAO,aACPC,IAAO,cAER4J,UAAa,CACZ7J,IAAO,aACPC,IAAO,cAER6J,UAAa,CACZ9J,IAAO,aACPC,IAAO,cAER8J,WAAc,CACb/J,IAAO,aACPC,IAAO,cAERsE,KAAQ,CACPvE,IAAO,WACPC,IAAO,aCpDT,IAAIqW,GAAQ,CACXxM,UAAamG,GACblG,WAAcwF,ICUf,SAAS+G,GAAOjM,GACf,OAAOqjB,GAAOrjB,IAAW,IAC1B,CCfA,IAAI6R,GAAQ,CACXtS,QAAW,aACXD,QAAW,aAERgkB,GAAerX,GAAO4F,GAAkB,SCD5C,IAAI0R,GAAgB,CACnB7jB,WAAc,UACdD,UAAa,UACbD,UAAa,WAcd,SAASgkB,GAAYpuB,EAAK0V,GACzB,OAQA,WACC,IAAIqB,EAAO9G,KAAM0d,IACbxd,EAAK4G,EAAMrB,GAAU1V,EAAIqR,WAAYyF,IACrC1G,EAAK2G,EAAMrB,GAAU1V,EAAIqR,WAAYrR,EAAI+K,WAAW,EAAI+L,IAC5D,ODXF,SAAkB/G,EAAMC,EAAMpF,GAC7B,IAAI7D,EACJ,GAAK/I,UAAU1D,OAAS,EAAI,CAE3B,GADAyM,EAAO8P,GAAO4F,GAAO7R,IAEpB,OAAO,IAAI7D,EAAMgJ,EAAMC,GAExB,MAAM,IAAInS,UAAWiB,EAAQ,sEAAuE8L,GACpG,CACD,OAAO,IAAIsjB,GAAcne,EAAMC,EAChC,CCCSoT,CAASjT,EAAIC,EAAI+d,GAAenuB,EAAIkH,MAC3C,CACF,CCxBA,IAAI2P,GAAQ,CACX1M,QAAW+B,GACXhC,QAAW+B,GACXtC,MAASwC,GACTtC,MAASuC,GACT5C,KAAQjD,GACRqD,OAAUyC,GACVvC,OAAUwC,GACV7C,MAAS8C,GACT7C,OAAU8C,GACVnC,UAAaoC,GACbnC,WAAcoC,GACd5H,KAAQ6H,ICVT,SAASkK,GAAOjM,GACf,OAAOqjB,GAAOrjB,IAAW,IAC1B,CCEA,SAASsG,GAAazO,EAAG0O,GACxB,OAAO,IAAI5E,GAAY9J,EAAE2O,OAAQ3O,EAAE4O,WAAY5O,EAAEqI,kBAAkBqG,EAAS1O,EAAEnI,OAAO6W,EACtF,CChBA,SAASiT,KACR,MAAO,CAENpI,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAGjB,CCxBA,IAAImO,GDKI,CAENrS,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,UCpBboO,GAAO,CACV,iBAAkBD,GAASrS,OAAOnQ,QAClC,iBAAkBwiB,GAASrS,OAAO4D,QAClC,cAAeyO,GAASrS,OAAOjM,KAC/B,wBAAyBse,GAASrS,OAAOqD,eACzC,6BAA8BgP,GAASrS,OAAOuD,oBAC9C,gCAAiC8O,GAASrS,OAAOyD,uBACjD,iBAAkB4O,GAASrS,OAAOmD,QAClC,wBAAyBkP,GAASrS,OAAO+C,eACzC,0BAA2BsP,GAASrS,OAAOiD,iBAC3C,iBAAkBoP,GAASrS,OAAO6C,QAClC,eAAgBwP,GAASrS,OAAOvH,MAChC,uBAAwB4Z,GAASrS,OAAO8D,cACxC,uBAAwBuO,GAASrS,OAAOgE,cACxC,oBAAqBqO,GAASrS,OAAOkE,YCDtChe,EAAA3I,GAAA,ODiBA,SAAcuN,GACb,IAAIpF,EAAI4sB,GAAMxnB,GACd,YAAe,IAANpF,EAAiB,KAAOA,CAClC,IE5BA,IAAI6sB,GAAgBnK,GAAS7jB,IAAK,kBAC9BkM,GAAiBoK,GAAO,aACxBnK,GAAkBmK,GAAO,cACzBlK,GAAekK,GAAO,QAuF1B,SAASvQ,KACR,IAAI6L,EACAvH,EACA7D,EACA5L,EAUJ,GAAc,QADd4L,EAAO8P,GAJNjM,GAHDuH,EAAQnU,UAAU1D,SACJqK,GAAU3G,UAAWmU,EAAM,IAEhCnU,UADRmU,GAAS,GAGDoc,KAIR,MAAM,IAAI1wB,UAAWiB,EAAQ,sEAAuE8L,IAErG,OAAKuH,GAAS,EACN,IAAIpL,EAAM,GAEH,IAAVoL,IACJhX,EAAM6C,UAAW,cAGGyO,GACnBtR,EAAMmX,GAAenX,EAAK,GACfA,aAAeuR,GAC1BvR,EAAMoX,GAAgBpX,EAAK,GAChBA,aAAewR,KAC1BxR,EAAMqzB,GAAoBrzB,EAAK,IAEzB,IAAI4L,EAAM5L,IAEH,IAAVgX,EACG,IAAIpL,EAAM/I,UAAU,GAAIA,UAAU,IAEnC,IAAI+I,EAAM/I,UAAU,GAAIA,UAAU,GAAIA,UAAU,GACxD,CCrHA,SAAS0G,GAAQ1E,GAChB,GAAKA,EAAI1F,OACR,OAAK0F,EAAIyuB,aCTX,SAAyBzuB,GACxB,OAQA,WACC,IAAImR,EACA4F,EACAhd,EACAD,EAKJ,IAFAqX,GADA4F,EAAO9G,KAAM0d,KACCtc,WAAarR,EAAIqR,WAC/BtX,EAAM,GACAD,EAAI,EAAGA,EAAIkG,EAAI1F,OAAQR,IAC5BC,EAAI8E,KAAM,IAAImB,EAAIkH,KAAM6P,EAAK3F,OAAQD,EAAQnR,EAAI+K,aACjDoG,GAAUnR,EAAIqR,WAEf,OAAOtX,CACP,CACF,CDdU20B,CAAgB1uB,GET1B,SAAwBA,GACvB,OAQA,WACC,IAAI+W,EAAO9G,KAAM0d,IACjB,OAAOrnB,GAAYyQ,EAAK3F,OAAQ2F,EAAK1F,WAAWrR,EAAIqR,WAAYrR,EAAI1F,OAAQ0F,EAAIkH,KAChF,CACF,CFFSynB,CAAe3uB,GAEvB,OAASA,EAAIkH,MACb,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SAGL,IAAK,QACL,IAAK,SACJ,OG1BF,SAAoBlH,EAAK0V,GACxB,OAQA,WAEC,OADWzF,KAAM0d,IACJjY,GAAU1V,EAAIqR,WAAYyF,GACvC,CACF,CHaS8X,CAAW5uB,EAAKguB,GAAmBhuB,EAAIkH,MAAO3G,KAEtD,IAAK,OACJ,OI5BF,SAAqBP,EAAK0V,GACzB,OAQA,WACC,IAAIqB,EAAO9G,KAAM0d,IACjB,OAAOhqB,GAASoT,EAAMrB,GAAU1V,EAAIqR,WAAYyF,IAChD,CACF,CJeS+X,CAAY7uB,EAAKguB,GAAmBhuB,EAAIkH,MAAO3G,KAEvD,IAAK,aACL,IAAK,YACL,IAAK,YACJ,OAAO6tB,GAAYpuB,EAAKguB,GAAmBhuB,EAAIkH,MAAO3G,KAEvD,QACC,GAAKP,EAAIyuB,aACR,OKxCH,SAAoBzuB,GACnB,OAQA,WACC,IAAI+W,EAAO9G,KAAM0d,IACjB,OAAO,IAAI3tB,EAAIkH,KAAM6P,EAAK3F,OAAQ2F,EAAK1F,WAAWrR,EAAIqR,WAAYrR,EAAI+K,WACtE,CACF,CL2BU+jB,CAAW9uB,GAGnB,MAAM,IAAI1E,MAAOwD,EAAQ,yDAA0DkB,EAAIkH,OAEzF,m6BMrDIyU,GAAY,gBAmBhB,SAASK,KACR,IAAIH,EACA9hB,EACA+G,EACJ,OAA0B,IAArB9C,UAAU1D,OACP0a,GAAO8G,IAAInd,SAEnBmC,GAAM,EACN+a,EAAO7d,UAAW,GACb2d,GAAU5Z,KAAM8Z,IAEN,SADdA,EAAO7f,GAAS6f,EAAMF,GAAW,MACD,UAATE,IACtB/a,GAAM,GAIR/G,GADAA,EAAMib,GAAQ6G,IACE9hB,EAAI4E,QAAU,GACzBmC,GAAO/G,EAAIO,OAAS,GACxBP,EAAI8E,KAAM,WAEJ9E,EACR,CCEA,IAAIg1B,GAA8BvU,GAAUwB,GAAQ,wBCAhDgT,GAA0BxU,GAAUwB,GAAQ,mBC5ChD,SAASiT,GAAUt1B,GAClB,MAA0B,iBAAVA,CACjB,CCMA,SAAS6K,GAAQ7K,GAChB,MACkB,iBAAVA,GACkB,oBAAzB6H,EAAa7H,ICRf,SAAeA,GACd,IACC,MAE4B,iBAApBA,EAAMkJ,SAEd,CAAC,MAAQhD,GACT,OAAO,CACP,CACF,CDAEkC,CAAMpI,EAER,CENA,SAASs1B,GAAUt1B,GAClB,OAASqI,GAAarI,IAAWsI,GAAUtI,EAC5C,CCEA,SAAS4e,GAAM5e,GACd,OAQA,WACC,OAAOA,CACP,CACF,CCpBAuI,EAAAgtB,GAAA,cAAAltB,IACAE,EAAAgtB,GAAA,WAAAjtB,ICHA,IC4CAgtB,GD5CAA,GAAAE,IAAA,GACAntB,GAAAmtB,IAAA,GACAltB,GAAAktB,IAAA,GAEAjtB,EAAA+sB,GAAA,cAAAjtB,IACAE,EAAA+sB,GAAA,WAAAhtB,ICyCAgtB,GADAG,KACA71B,GAEA81B,gCC9CI5S,goGCFJ,IAAIA,GDwFJ,SAAoB7R,GACnB,OAA0B,IAArB5M,UAAU1D,OA5EhB,WACC,IAAI0hB,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYmmB,KACLn1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAIsU,GAAYF,GAChB3c,EAAM,CAAA,EACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAExBgV,EADA4c,EAAMxT,EAAQpe,IACDud,EAAGqU,GAEjBz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAoDS21B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYmmB,KACLn1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAIsU,GAAYF,GAChB3c,EAAM,GACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAEN,IAAbud,EADLqU,EAAMxT,EAAQpe,KAEbgV,EAAI/T,KAAM2wB,GAGZz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAqBU41B,IAET/kB,EAAQgS,GAAShS,GACZxJ,EAAYqb,GAAO7R,GAChB6R,GAAO7R,GAAQjM,QAEhB,KACR,CCrGYixB,OCERnT,goGCFJ,IAAIA,GDwFJ,SAA0B7R,GACzB,OAA0B,IAArB5M,UAAU1D,OA5EhB,WACC,IAAI0hB,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYumB,KACLv1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAI0U,GAAON,GACX3c,EAAM,CAAA,EACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAExBgV,EADA4c,EAAMxT,EAAQpe,IACDud,EAAGqU,GAEjBz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAoDS21B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYumB,KACLv1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAI0U,GAAON,GACX3c,EAAM,GACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAEN,IAAbud,EADLqU,EAAMxT,EAAQpe,KAEbgV,EAAI/T,KAAM2wB,GAGZz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAqBU41B,IAET/kB,EAAQgS,GAAShS,GACZxJ,EAAYqb,GAAO7R,GAChB6R,GAAO7R,GAAQjM,QAEhB,KACR,CCrGYmxB,OCERrT,goGCFJ,IAAIA,GDwFJ,SAAwB7R,GACvB,OAA0B,IAArB5M,UAAU1D,OA5EhB,WACC,IAAI0hB,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYymB,KACLz1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAI4U,GAAiBR,GACrB3c,EAAM,CAAA,EACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAExBgV,EADA4c,EAAMxT,EAAQpe,IACDud,EAAGqU,GAEjBz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAoDS21B,SAEO,IAAVjT,KAEJA,GAhDF,WACC,IAAIT,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAYymB,KACLz1B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAI4U,GAAiBR,GACrB3c,EAAM,GACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAEN,IAAbud,EADLqU,EAAMxT,EAAQpe,KAEbgV,EAAI/T,KAAM2wB,GAGZz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CAqBU41B,IAET/kB,EAAQgS,GAAShS,GACZxJ,EAAYqb,GAAO7R,GAChB6R,GAAO7R,GAAQjM,QAEhB,KACR,CCrGYqxB,GCiBZ,SAASC,GAAeC,EAAMtP,EAAIuP,GAKjC,MAAiB,WAAZA,IAGCC,GAAYF,KACZE,GAAYxP,IAOD,SAAZuP,GAAkC,UAAZA,IAIV,SAAZA,ELlBN,SAAqBD,EAAMtP,GAC1B,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CKOSyP,CAAYH,EAAMtP,GAGT,gBAAZuP,EHtBN,SAA2BD,EAAMtP,GAChC,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CGWS0P,CAAkBJ,EAAMtP,GDvBjC,SAAyBsP,EAAMtP,GAC9B,IAAI/D,EAGJ,OAFAqT,EAAOE,GAAYF,OACnBtP,EAAKwP,GAAYxP,QAIjB/D,EAAIJ,GAAOyT,KAEHrT,EAAG+D,GAAO,CAGnB,CCcQ2P,CAAgBL,EAAMtP,IAC9B,CClBA,IAAI4P,GAA6B,qBCL7BC,GAA2B,SCA3BC,IAA4B,SCFhC,SAASC,GAAkBh3B,GAC1B,OAAKA,GAAUA,GAASA,IAAU+I,IAAQ/I,IAAUgJ,GAC5C,UAEHH,GAAW7I,GACVA,GAAS+2B,IAA4B/2B,GAAS82B,GAC3C,UAED,UAIP92B,GAAS62B,IACT72B,EAAQ62B,GAED,UAGD,SACR,CAmBA,SAASI,GAAaj3B,GACrB,OAAMD,EAAUC,GAYXA,GAAUA,GAASA,IAAU+I,IAAQ/I,IAAUgJ,GAC5C,UAEHH,GAAW7I,GACA,IAAVA,IC9DQ,KADU8I,ED+Da9I,IC9DhB,EAAI8I,IAAME,ID+DtB,UAEHhJ,EAAQ,EACPA,GAAS0V,GACN,OAEH1V,GAAS2U,GACN,QAEH3U,GAASgU,GACN,QAED,UAEHhU,GAASgV,GACN,QAEHhV,GAASqU,GACN,SAEHrU,GAAS8L,GACN,SAED,UAIP9L,GAAS62B,IACT72B,EAAQ62B,GAED,UAGD,UAjDD/sB,GAAW9J,GACR,OAEH+W,GAAe/W,GACmB,YAAjCg3B,GAAkBh3B,EAAMwW,KAAuD,YAAjCwgB,GAAkBh3B,EAAMyW,IACnE,aAED,YAED,UCzDT,IAAyB3N,CDkGzB,CEpHA,IAAIuJ,GAAc,CACjBwE,UAAa,YACbV,WAAc,cCEf,ICEIhW,GDFAkb,8BEUWrW,QDTXoW,GAAQ,GAEZ,IAAMjb,GAAI,EAAGA,GAAIkb,GAAO1a,OAAQR,KAC/Bib,GAAMlW,KAAMgY,GAAO7B,GAAQlb,MED5B,IAAImb,GAASD,GAAO1a,OAoBpB,SAASsQ,GAAOjR,GACf,IAAIG,EACJ,IAAMA,EAAI,EAAGA,EAAImb,GAAQnb,IACxB,GAAKH,aAAiBob,GAAOjb,GAC5B,OAAOkb,GAAQlb,GAIjB,OAAOob,GAAYrO,GAAiBlN,KAAa,IAClD,CC9BA,SAASk3B,GAAgBl3B,GACxB,OAAO,EAAY,EAAI,CACxB,CCGA,SAASm3B,GAAen3B,GACvB,OAAOmI,EAAQnI,EAChB,uDCiBA,SAASo3B,GAAW/wB,EAAK0V,GACxB,OASA,SAAiB/b,GAChB,IACIyb,EACA1T,EACChI,EAAUC,IAEbyb,EADI2Z,GAA6B/uB,EAAIkH,MAChClH,EAAIkH,KACG1E,GAAW7I,GAEZq1B,GAAyBhvB,EAAIkH,MC1B5C,SAAmCvN,GAClC,OAAKA,EAAQ,EACPA,GAAS0V,GACN,OAEH1V,GAAS2U,GACN,QAEH3U,GAASgU,GACN,QAED,UAEHhU,GAASyV,GACN,OAEHzV,GAAS0U,GACN,QAEH1U,GAAS+T,GACN,QAED,SACR,CDISsjB,CAA0Br3B,GAE1Bi3B,GAAaj3B,GAJbyqB,GAASpI,OAAOjM,KAMtBrO,EAAI/H,GACO+W,GAAe/W,IAC1Byb,EAAK6b,GAAct3B,KAA4B,YAAbqG,EAAIkH,KAAuB,YAAc,cAC3ExF,EAAI/H,EAAMwW,IACC1M,GAAW9J,IACtByb,EAAK,OACL1T,EAAImvB,GAAgBl3B,IACTs1B,GAAUt1B,IACrByb,EAAK,QACL1T,EAAIovB,GAAen3B,KAEnByb,EAAK,UACL1T,EAAI/H,GAEL,IAAMs2B,GAAe7a,EAAIpV,EAAIkH,KAAMlH,EAAIkxB,aACtC,MAAM,IAAIrzB,UAAWiB,EAAQ,oGAAqGkB,EAAI8G,KAAM9G,EAAIkH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAU1V,EAAIqR,WAAY3P,EAAGoV,GACnC,CACF,CE/DA,SAASqa,GAAgBx3B,GACxB,OAAOgK,GAAShK,EACjB,CCFA,SAASy3B,GAAiBz3B,GACzB,OAAOgK,GAAShK,EAAMwW,IAAMxW,EAAMyW,GACnC,CCeA,SAASihB,GAAYrxB,EAAK0V,GACzB,OASA,SAAiB/b,GAChB,IACIyb,EACA1T,EACC+B,GAAW9J,IACfyb,EAAK,OACL1T,EAAImvB,GAAgBl3B,IACTD,EAAUC,IACrByb,EAAKgP,GAASpI,OAAOjM,KACrBrO,EAAImvB,GAAgBM,GAAgBx3B,KACzBs1B,GAAUt1B,IACrByb,EAAK,QACL1T,EAAImvB,GCvCP,SAAyBl3B,GACxB,OAAOgK,GAAShK,EACjB,CDqCuB23B,CAAgB33B,KACzB+W,GAAe/W,IAC1Byb,EAAK6b,GAAct3B,IAAWyqB,GAASpI,OAAOoH,QAC9C1hB,EAAImvB,GAAgBO,GAAiBz3B,MAErCyb,EAAK,UACL1T,EAAIiC,GAAShK,IAEd,IAAMs2B,GAAe7a,EAAIpV,EAAIkH,KAAMlH,EAAIkxB,aACtC,MAAM,IAAIrzB,UAAWiB,EAAQ,oGAAqGkB,EAAI8G,KAAM9G,EAAIkH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAU1V,EAAIqR,WAAY3P,EAAGoV,GACnC,CACF,CEnCA,SAASya,GAAWvxB,EAAK0V,GACxB,OASA,SAAiB/b,GAChB,IACIyb,EACA1T,EACCutB,GAAUt1B,IACdyb,EAAK,QACL1T,EAAI/H,GACOD,EAAUC,GAChB6I,GAAW7I,IACfyb,EAAKwb,GAAaj3B,GAClB+H,EAAI8C,GAAQ7K,KAEZyb,EAAKgP,GAASpI,OAAOjM,KACrBrO,EAAI8C,GAAQjC,GAAO5I,KAET8J,GAAW9J,IACtByb,EAAK,OACL1T,EC7CH,SAAyB/H,GACxB,OAAO6K,GAAQ,EAAY,EAAI,EAChC,CD2COgtB,CAAgB73B,IACT+W,GAAe/W,IAC1Byb,EAAK6b,GAAct3B,IAAWyqB,GAASpI,OAAOoH,QAC9C1hB,EAAI8C,GAAQjC,GAAO5I,EAAMwW,OAEzBiF,EAAK,UACL1T,EAAI8C,GAAQjC,GAAOT,EAAQJ,MAE5B,IAAMuuB,GAAe7a,EAAIpV,EAAIkH,KAAMlH,EAAIkxB,aACtC,MAAM,IAAIrzB,UAAWiB,EAAQ,oGAAqGkB,EAAI8G,KAAM9G,EAAIkH,KAAMkO,IAEhJnF,KAAM0d,IACPjY,GAAU1V,EAAIqR,WAAY3P,EAAGoV,GACnC,CACF,CEzDA,SAAS2a,GAAkB93B,GAE1B,OACCsI,GAAUtI,IACV2d,GAAY3d,EAAOg0B,IAErB,CCkCA,IAAIL,GAAiC9S,GAAUwB,GAAQ,2BCGnD0V,GAAoBlX,GAAUwB,GAAQ,YCNtC2V,GAAiBnX,GAAUwB,GAAQ,SCZvC,SAAS9K,GAAazO,EAAG0O,GACxB,GAAKN,GAAmBpO,GACvB,OAAO8P,GAAgB9P,EAAG0O,GAE3B,GAAKP,GAAkBnO,GACtB,OAAO6P,GAAe7P,EAAG0O,GAG1B,MAAM,IAAItT,UAAWiB,EAAQ,+FAAgG2D,GAC9H,CC1CA,IAAI2Y,GAAI,EAqBR,SAASwW,GAAO9d,EAAG+d,EAAOpvB,EAAG6e,EAASC,GACrC,IAAIC,EACAtG,EACAC,EACArhB,EAEJ,GAAKga,GAAK,EACT,OAAOrR,EAGR,IADA0Y,EAAIhG,GAAkB1S,IACf6S,iBAEN,OCHF,SAAgBxB,EAAG+d,EAAOpvB,EAAG6e,EAASC,GACrC,IAAIE,EACAjhB,EACAghB,EACA1nB,EASJ,IANA2nB,EAAOhf,EAAE4S,KAGT7U,EAAMiC,EAAE8S,UAAW,GAEnBiM,EAAKD,EACCznB,EAAI,EAAGA,EAAIga,EAAGha,IACnB0G,EAAKihB,EAAMD,EAAIqQ,GACfrQ,GAAMF,CAGR,CDhBE/L,CAAWzB,EAAG+d,EAAO1W,EAAGmG,EAASC,GAC1BpG,EAAE9F,KAKV,GAHAmM,EAAKD,EAGY,IAAZD,EAAgB,CAIpB,IAHApG,EAAIpH,EAAIsH,IAGC,EACR,IAAMthB,EAAI,EAAGA,EAAIohB,EAAGphB,IACnB2I,EAAG+e,GAAOqQ,EACVrQ,GAAMF,EAGR,GAAKxN,EAAIsH,GACR,OAAO3Y,EAER,IAAM3I,EAAIohB,EAAGphB,EAAIga,EAAGha,GAAKshB,GACxB3Y,EAAG+e,GAAOqQ,EACVpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZpvB,EAAG+e,EAAG,GAAMqQ,EACZrQ,GAAMpG,GAEP,OAAO3Y,CACP,CACD,IAAM3I,EAAI,EAAGA,EAAIga,EAAGha,IACnB2I,EAAG+e,GAAOqQ,EACVrQ,GAAMF,EAEP,OAAO7e,CACR,CEtDA,SAASmvB,GAAO9d,EAAG+d,EAAOpvB,EAAG6e,GAC5B,OAAOlI,GAAStF,EAAG+d,EAAOpvB,EAAG6e,EAASH,GAAerN,EAAGwN,GACzD,CCsGA,SAASnI,GAAQ1W,EAAGihB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC3C,IAAIof,EACAC,EAIJ,OAFAD,EAAO3c,GAAkB1S,GACzBsvB,EAAO5c,GAAkBuO,GACpBoO,EAAKxc,kBAAoByc,EAAKzc,kBA1DpC,SAAoB7S,EAAGihB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC9C,IAAIsf,EACAC,EACAzJ,EACA0J,EACAC,EACAr4B,EAQJ,IANAk4B,EAAQvvB,EAAE4S,KACV4c,EAAQvO,EAAErO,KACVmT,EAAO/lB,EAAE8S,UAAW,GACpB2c,EAAOxO,EAAEnO,UAAW,GAEpB4c,EAAKhhB,EACCrX,EAAI,EAAGA,EAAIk4B,EAAM13B,OAAQR,IAC9Bo4B,EAAMD,EAAOE,EAAI7e,EAAI1X,KAAM8W,EAAS8V,EAAMwJ,EAAOl4B,GAAKA,EAAGk4B,IACzDG,GAAMrZ,CAGR,CAwCEvD,CAAWuc,EAAMC,EAAMjZ,EAAQ3H,EAAQmC,EAAKZ,GACrCgR,GApGT,SAAmBjhB,EAAGihB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,GAC7C,IAAIyf,EACAr4B,EAGJ,IADAq4B,EAAKhhB,EACCrX,EAAI,EAAGA,EAAI2I,EAAEnI,OAAQR,IAC1B4pB,EAAGyO,GAAO7e,EAAI1X,KAAM8W,EAASjQ,EAAG3I,GAAKA,EAAG2I,GACxC0vB,GAAMrZ,EAEP,OAAO4K,CACR,CA4FQxC,CAAUze,EAAGihB,EAAG5K,EAAQ3H,EAAQmC,EAAKZ,EAC7C,CCxFA,SAAS0f,GAAK3vB,EAAG6Q,EAAKZ,GACrB,OA3BD,SAAoB1S,EAAK0V,GACxB,MAAkC,mBAAlB1V,EAAK0V,EACtB,CAyBMC,CAAWlT,EAAG,OACXA,EAAE2vB,IAAK9e,EAAKZ,GAEbyG,GAAQ1W,EAAG7I,GAAO6I,EAAEnI,QAAU,EAAG,EAAGgZ,EAAKZ,EACjD,CC9CA,SAAS2f,GAAgB14B,GACxB,OAAOA,EAAMwW,EACd,CCYA,SAASpE,GAAQ/L,GAChB,GAAKA,EAAI1F,OACR,OAAK0F,EAAIyuB,aCLX,SAAyBzuB,GACxB,OAWA,SAAiBwU,GAChB,IAAIrD,EACAmhB,EACAvb,EACAwb,EACA9f,EACAP,EACAyS,EACA7qB,EAEJ,IAAMgM,GAAc0O,GACnB,MAAM,IAAI3W,UAAWiB,EAAQ,sEAAuEkB,EAAI8G,KAAM0N,IAE/G,GAAKA,EAAOla,SAAW0F,EAAI1F,OAC1B,MAAM,IAAI+X,WAAYvT,EAAQ,0EAA2EkB,EAAI8G,KAAM9G,EAAI1F,SAExH,GAAqB,SAAhB0F,EAAImwB,QACR,IAAMr2B,EAAI,EAAGA,EAAI0a,EAAOla,OAAQR,IAC/B,KAAQ0a,EAAQ1a,aAAekG,EAAIkH,MAClC,MAAM,IAAIrJ,UAAWiB,EAAQ,2FAA4FkB,EAAI8G,KAAM0N,EAAQ1a,KAS9I,IAJA6qB,EAAK3kB,EAAI+K,WAAa/K,EAAI1F,OAG1Bg4B,EAAQ,GACFx4B,EAAI,EAAGA,EAAI0a,EAAOla,OAAQR,IAAM,CAErC,IADAoY,EAAMjC,KAAKrJ,YAAY4V,OAAQhI,EAAQ1a,KAC9BiR,aAAe4Z,EACvB,MAAM,IAAItS,WAAYvT,EAAQ,mHAAoHkB,EAAI8G,OAEvJ2L,EAAM,IAAIlG,GAAY2F,EAAId,OAAQc,EAAIb,WAAYsT,GAClD2N,EAAMzzB,KAAM4T,EACZ,CAID,IADAtB,GADA4F,EAAO9G,KAAM0d,KACCtc,WAAarR,EAAIqR,WACzBvX,EAAI,EAAGA,EAAI0a,EAAOla,OAAQR,IAC/By4B,EAAO,IAAIhmB,GAAYwK,EAAK3F,OAAQD,EAAQwT,GAC5C6I,GAAOxtB,EAAI1F,OAAQg4B,EAAOx4B,GAAK,EAAGy4B,EAAM,GACxCphB,GAAUwT,CAEX,CACF,CDnDU6N,CAAgBxyB,GEO1B,SAAwBA,GACvB,OAWA,SAAiBrG,GAChB,IAAIod,EACA7E,EACAkD,EACJ,IAAMtP,GAAcnM,IAAW83B,GAAkB93B,GAChD,MAAM,IAAIkE,UAAWiB,EAAQ,sEAAuEkB,EAAI8G,KAAMnN,IAE/G,GAAKA,EAAMW,SAAW0F,EAAI1F,OACzB,MAAM,IAAI+X,WAAYvT,EAAQ,0EAA2EkB,EAAI8G,KAAM9G,EAAI1F,SAGxH,IAAM21B,GADN7a,EAAKxK,GAAOjR,GACaqG,EAAIkH,KAAMlH,EAAIkxB,aACtC,MAAM,IAAIrzB,UAAWiB,EAAQ,oGAAqGkB,EAAI8G,KAAM9G,EAAIkH,KAAMkO,IAIvJ,OADA2B,EAAOzQ,IADP4L,EAAMjC,KAAM0d,KACWvc,OAAQc,EAAIb,WAAWrR,EAAIqR,WAAYrR,EAAI1F,OAAQ0F,EAAIkH,MACzEkO,IAAOpV,EAAIkH,KAEVurB,GAAmBrd,QACvBoY,GAAkB,EAAXxtB,EAAI1F,OAAUo4B,GAAoB/4B,EAAO,GAAK,EAAG+4B,GAAoB3b,EAAM,GAAK,GAInF2a,GAAmBtc,QACvBoY,GAAOxtB,EAAI1F,OAAQk0B,GAAoB70B,EAAO,GAAK,EAAG60B,GAAoBzX,EAAM,GAAK,QAItFyW,GAAOxtB,EAAI1F,OAAQX,EAAO,EAAGod,EAAM,GAI/B4a,GAAgBvc,GAEfuc,GAAgB3xB,EAAIkH,WACxBsmB,GAAOxtB,EAAI1F,OAAQX,EAAO,EAAGod,EAAM,GAI/B0b,GAAmBzyB,EAAIkH,OAC3B6P,EAAO2b,GAAoB3b,EAAM,GAGjCyW,GAAOxtB,EAAI1F,OAAQyc,EAAM,EAAGpd,EAAO,QACnCi4B,GAAMxY,QAASpZ,EAAI1F,OAAQ,EAAKyc,EAAM,EAAG,SAI1Cqb,GAAIjZ,OAAQxf,EAAOod,EAAM,EAAG,EAAGoa,IAI3BsB,GAAmBrd,GAElBuc,GAAgB3xB,EAAIkH,WACxBkrB,GAAIjZ,OAAQxf,EAAOod,EAAM,EAAG,EAAGsb,IAI3BI,GAAmBzyB,EAAIkH,WAC3BsmB,GAAkB,EAAXxtB,EAAI1F,OAAUo4B,GAAoB/4B,EAAO,GAAK,EAAG+4B,GAAoB3b,EAAM,GAAK,QAIxFqb,GAAIjZ,OAAQxf,EAAOod,EAAM,EAAG,EAAGqa,SAM3BO,GAAgB3xB,EAAIkH,MACxBsmB,GAAOxtB,EAAI1F,OAAQk0B,GAAoB70B,EAAO,GAAK,EAAGod,EAAM,IAI7DA,EAAO2b,GAAoB3b,EAAM,GAGjCyW,GAAOxtB,EAAI1F,OAAQyc,EAAM,EAAGyX,GAAoB70B,EAAO,GAAK,GAC5Di4B,GAAMxY,QAASpZ,EAAI1F,OAAQ,EAAKyc,EAAM,EAAG,IACzC,CACF,CFlGS4b,CAAe3yB,GAEvB,OAASA,EAAIkH,MACb,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACJ,OAAO6pB,GAAW/wB,EAAKguB,GAAmBhuB,EAAIkH,MAAO1G,KAEtD,IAAK,QACL,IAAK,SACJ,OAAO+wB,GAAWvxB,EAAKguB,GAAmBhuB,EAAIkH,MAAO1G,KAEtD,IAAK,OACJ,OAAO6wB,GAAYrxB,EAAKguB,GAAmBhuB,EAAIkH,MAAO1G,KAEvD,IAAK,aACL,IAAK,YACL,IAAK,YACJ,OGzBF,SAAqBR,EAAK0V,GACzB,OASA,SAAiB/b,GAChB,IAAIod,EACA3B,EACAjF,EACAC,EAsBJ,GArBKM,GAAe/W,IACnByb,EAAK6b,GAAct3B,IAAWqG,EAAIkH,KAClCiJ,EAAKxW,EAAMwW,GACXC,EAAKzW,EAAMyW,IACA1W,EAAUC,IACrByb,EAAoB,cAAbpV,EAAIkH,KAAyB,UAAY,UAChDiJ,EAAKxW,EACLyW,EAAK,GACM6e,GAAUt1B,IACrByb,EAAK,QACLjF,EAAK2gB,GAAen3B,GACpByW,EAAK,GACM3M,GAAW9J,IACtByb,EAAK,OACLjF,EAAK0gB,GAAgBl3B,GACrByW,EAAK,IAELgF,EAAK,UACLjF,EAAKxW,EACLyW,EAAK,IAEA6f,GAAe7a,EAAIpV,EAAIkH,KAAMlH,EAAIkxB,aACtC,MAAM,IAAIrzB,UAAWiB,EAAQ,oGAAqGkB,EAAI8G,KAAM9G,EAAIkH,KAAMkO,KAEvJ2B,EAAO9G,KAAM0d,KACPjY,GAAU1V,EAAIqR,WAAYlB,EAAI2G,IACpCC,EAAMrB,GAAU1V,EAAIqR,WAAYrR,EAAI+K,WAAW,EAAIqF,EAAI0G,GACvD,CACF,CHlBS8b,CAAY5yB,EAAKguB,GAAmBhuB,EAAIkH,MAAO1G,KAEvD,QACC,GAAKR,EAAIyuB,aACR,OIpCH,SAAoBzuB,GACnB,OAWA,SAAiBrG,GAChB,IAAIod,EACAwb,EACA9f,EACAP,EACAyS,EACJ,IAAM8M,GAAkB93B,GACvB,MAAM,IAAIkE,UAAWiB,EAAQ,qEAAsEkB,EAAI8G,KAAMnN,IAE9G,GAAqB,SAAhBqG,EAAImwB,WAAyBx2B,aAAiBqG,EAAIkH,MACtD,MAAM,IAAIrJ,UAAWiB,EAAQ,2FAA4FkB,EAAI8G,KAAMnN,IAKpI,GAHAgrB,EAAK3kB,EAAI+K,YAETmH,EAAMjC,KAAKrJ,YAAY4V,OAAQ7iB,IACtBoR,aAAe4Z,EACvB,MAAM,IAAItS,WAAYvT,EAAQ,oFAAqFkB,EAAI8G,OAExH2L,EAAM,IAAIlG,GAAY2F,EAAId,OAAQc,EAAIb,WAAYsT,GAElD5N,EAAO9G,KAAM0d,IACb4E,EAAO,IAAIhmB,GAAYwK,EAAK3F,OAAQ2F,EAAK1F,WAAWrR,EAAIqR,WAAYsT,GAEpE6I,GAAOxtB,EAAI1F,OAAQmY,EAAK,EAAG8f,EAAM,EACjC,CACF,CJDUM,CAAW7yB,GAGnB,MAAM,IAAI1E,MAAOwD,EAAQ,yDAA0DkB,EAAIkH,OAEzF,CK9BAhF,EAAA3I,GAAA,UAAA6f,ICcAlX,EAAA3I,GAAA,SAAA4f,IC3CA,IAAI2Z,GAAmB,CACtB,OACA,OACA,cACA,SACA,aACA,WACA,UACA,eCID,SAASC,GAAa/yB,GACrB,MAAoB,UAAbA,EAAIkH,MAAoBpB,GAAc9F,EAAIgzB,OAClD,CCAA,SAASC,GAAgBt5B,EAAOmN,GAC/B,OAAKrD,GAAW9J,GACR,KAED,IAAIkE,UAAWiB,EAAQ,+DAAgEgI,EAAMnN,GACrG,CCnBA,IAAIqb,GAAS,CACZ,OACA,QACA,QACA,QAEA,QACA,SACA,SACA,SAIA,UACA,UAIA,YACA,aAEA,QCrBD,ICcuBR,GCdnB0e,GAAa,CAChB1pB,KAAQ,EACRG,MAAS,EACTE,MAAS,EACTE,MAAS,EAETN,MAAS,EACTG,OAAU,EACVE,OAAU,EACVE,OAAU,EAEVC,QAAW,EACXC,QAAW,EACXC,QAAW,EAEXC,UAAa,EACbC,UAAa,EACbC,WAAc,EAEdxF,KAAQ,GCCLquB,GAAwB,CAC3B,OACA,QAGGC,GAAa,CAChBtsB,KCZD,SAAgCnN,EAAOmN,GACtC,OAAKnC,GAAUhL,IAAWA,EAAMW,OAAS,EACjC,KAED,IAAIuD,UAAWiB,EAAQ,wEAAyEgI,EAAMnN,GAC9G,EDQCuN,KEXD,SAAsBvN,GACrB,OAAK6gB,GAAUxF,GAAQrb,IAAWuiB,GAAyBviB,GACnD,KAED,IAAIkE,UAAWiB,EAAQ,wGAAyG,OAAQ2U,GAAMuB,GAAQ,MAAQrb,GACtK,EFOCsjB,YGdD,SAAwBtjB,EAAOmN,GAC9B,OAAKnC,GAAUhL,GACP,KAED,IAAIkE,UAAWiB,EAAQ,8DAA+DgI,EAAMnN,GACpG,EHUCW,OIfD,SAAiCX,EAAOmN,GACvC,OAAKlC,GAAmBjL,GAChB,KAED,IAAIkE,UAAWiB,EAAQ,wEAAyEgI,EAAMnN,GAC9G,EJWCiH,WAAcqyB,GACdpyB,SAAYoyB,GACZpnB,QAAWsjB,GAAkB,MAC7B+B,aFnBsB1c,GDdH,CACnB,OACA,OACA,cACA,YACA,UCoBA,SAAkB7a,EAAOmN,GACxB,OAAK0T,GAAUhG,GAAQ7a,GACf,KAED,IAAIkE,UAAWiB,EAAQ,gFAAiFgI,EAAM2M,GAAMe,GAAQ,MAAQ7a,GAC3I,IEiBF,SAAS6e,GAAWxY,EAAK6E,GACxB,IAAI9K,EACA8F,EACA6B,EACA4F,EACAxN,EAGJ,IADAC,EK/CO,CACN00B,cAAgB,EAChBxR,YAAe,GACflS,WAAc,EACdsG,WAAc,EACd8K,UAAa,EACbkX,QAAW,EACXzyB,YAAc,EACdC,UAAY,EACZgL,aAAW,EACXqlB,YAAe,QLsCVp3B,EAAI,EAAGA,EAAI+K,EAAKvK,OAAQR,IAE7B,GAAKmiB,GAASjc,EADdsH,EAAIzC,EAAM/K,IACe,CAGxB,GAFA4H,EAAI1B,EAAKsH,GACTzH,EAAMuzB,GAAY9rB,GAAK5F,EAAG4F,GAEzB,OAAOzH,EAER9F,EAAKuN,GAAM5F,CACX,CAEF,OMrDD,SAAwB1B,EAAK6E,GAC5B,IAAI/K,EACJ,IAAMA,EAAI,EAAGA,EAAI+K,EAAKvK,OAAQR,IAC7B,IAAMmiB,GAASjc,EAAK6E,EAAM/K,IACzB,OAAO,EAGT,OAAO,CACR,CN6COw5B,CAAev5B,EAAKo5B,KAG1Bp5B,EAAI00B,aAAevS,GAAyBniB,EAAImN,MAChDnN,EAAIgR,WO1DL,SAAqB/K,GACpB,IAAI2kB,EASJ,OAPCA,EADI3kB,EAAIyuB,aACHzuB,EAAIkH,KAAK6D,WAETF,GAAiB7K,EAAIkH,MAEtBlH,EAAI1F,SACRqqB,GAAM3kB,EAAI1F,QAEJqqB,CACR,CP+CkB5Z,CAAYhR,GACxBA,EAAI00B,aACR10B,EAAIoiB,UAAYpiB,EAAImN,KAAKiV,UAEzBpiB,EAAIoiB,UAAY+W,GAAYn5B,EAAImN,MAE1BnN,GATC,IAAI8D,UAAWiB,EAAQ,yFAA0F2U,GAAM0f,GAAuB,MAAQI,KAAKC,UAAWxzB,IAU/K,CQtEA,SAASmc,GAAW6W,GACnB,IAAI7c,EACAzU,EACA5H,EAGJ,IADAqc,EAAM,EACArc,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,KAC/B4H,EAAIsxB,EAAQl5B,GAAIqiB,WACPhG,IACRA,EAAMzU,GAGR,OAAOyU,CACR,CCFA,SAASsd,GAAgBzzB,GACxB,IAAIgzB,EACAU,EACA35B,EACA6Y,EACA1P,EACAiY,EACArhB,EAGJ,GAAuB,KADvBk5B,EAAShzB,EAAIgzB,QACD14B,OACX,OAAO,KAGR,IADAP,EAAM,GACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAAM,CAErC,IAAMmI,GADNkZ,EAAI6X,EAAQl5B,IAEX,OAAO,KAER,GAAKi5B,GAAa5X,GACjB,OAAO,IAAItd,UAAWiB,EAAQ,gFAAiFy0B,KAAKC,UAAWR,KAEhI,QAAc,IAATU,GAAmBzX,GAASd,EAAG,WACnCuY,GAAO,OACD,IAAc,IAATA,GAAiBzX,GAASd,EAAG,WACxC,OAAO,IAAItd,UAAWiB,EAAQ,8FAA+Fy0B,KAAKC,UAAWR,KAG9I,IADApgB,EAAM+gB,GAAgBxY,EAAG2X,eACLx3B,MACnB,OAAOsX,EAER,GAAW,IAAN9Y,EACJoJ,EAAM0P,EAAI7H,gBACJ,GAAK6H,EAAI7H,aAAe7H,EAC9B,OAAO,IAAImP,WAAYvT,EAAQ,8FAA+Fy0B,KAAKC,UAAWR,KAE/Ij5B,EAAI8E,KAAM+T,EACV,CACD,MAAO,CACN1L,KAAQ,QACR8rB,OAAUj5B,EACVgR,WAAc7H,EACdmO,WAAc,EACd8K,UAAayX,GAAkB75B,GAC/Bs5B,QAAW,EAEb,CC8CA,SAASt1B,GAAS0E,EAAGuD,EAAeC,GACnC,OAzFD,SAAoBjG,EAAK0V,GACxB,MAAkC,mBAAlB1V,EAAK0V,EACtB,CAuFMC,CAAWlT,EAAG,WACXA,EAAE1E,QAASiI,EAAeC,IAE7BA,EAAY,IAChBA,GAAaxD,EAAEnI,QACE,IAChB2L,EAAY,GCzFbH,GAFwBnM,ED8FH8I,IC3FrB6F,GAAY3O,EAAM4G,MAClB+H,GAAY3O,EAAM6G,KDsCpB,SAAoBiC,EAAGuD,EAAeC,GACrC,IAAI1F,EACAzG,EAGJ,IADAyG,EAAMohB,GAAelf,GACf3I,EAAImM,EAAWnM,EAAI2I,EAAEnI,OAAQR,IAClC,GAAKkM,IAAkBzF,EAAKkC,EAAG3I,GAC9B,OAAOA,EAGT,OAAQ,CACT,CA0CSyb,CAAW9S,EAAGuD,EAAeC,GAhFtC,SAAmBxD,EAAGuD,EAAeC,GACpC,IAAInM,EACJ,IAAMA,EAAImM,EAAWnM,EAAI2I,EAAEnI,OAAQR,IAClC,GAAKkM,IAAkBvD,EAAG3I,GACzB,OAAOA,EAGT,OAAQ,CACT,CA0EQonB,CAAUze,EAAGuD,EAAeC,ICjGpC,IAA0BtM,CDkG1B,CE3GA,SAASk6B,GAAYC,EAAOhtB,GAC3B,IAAI8E,EACJ,OAAsB,IAAjBkoB,EAAMx5B,OACH,IAAIgB,MAAO,wDAEnBsQ,EAAM7N,GAAS+1B,EAAOhtB,EAAM,IACjB,EACH,IAAIjJ,UAAWiB,EAAQ,gFAAiF2U,GAAMqgB,EAAO,MAAQhtB,IAE9H8E,CACR,CCTA,SAASmoB,GAAYf,EAAQK,GAC5B,IAAIv5B,EACJ,IAAMA,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAC/Bk5B,EAAQl5B,GAAIu5B,QAAUA,EAEvB,OAAOL,CACR,CCDA,SAASgB,GAAU7iB,GAClB,OAUA,SAAkB7S,EAAO21B,GACxB,OAAOn1B,EAAQ,OAAQqS,EAAO/V,SAAU64B,EAAI,IAC5C,CACF,CA0BA,SAASC,GAAclB,GACtB,IAAIj5B,EACA6Y,EACAzC,EACA2D,EACAqH,EACArhB,EAQJ,IANAga,EAAIkf,EAAO14B,OAGX6V,EA7DO,eA+DPpW,EAAM,GACAD,EAAI,EAAGA,EAAIga,EAAGha,IACnBqhB,EAAI6X,EAAQl5B,GAGPA,EAAI,GAAOqhB,EAAE9J,aAAe2hB,EAAQl5B,EAAE,GAAIuX,aAI1C8J,EAAEsT,aACN10B,EAAI8E,KAAM7C,GAASmf,EAAEjU,KAAK4V,OAAQ3M,EAAI6jB,GAAU7Y,EAAE9J,cAInDtX,EAAI8E,KAAMC,EAAQ,eAAgBqc,EAAEjU,KAAMiU,EAAE9J,WAAY8J,EAAEpQ,cAQ3D,MAH6B,OAH7B6H,EAAM9T,EAAQ,MAAO/E,EAAI0Z,KAAM,MAGrBb,EAAItY,OAAO,KACpBsY,EAAMA,EAAIzU,UAAW,EAAGyU,EAAItY,OAAO,IAE7BsY,CACR,CCxFA,IAAIuhB,GAAU,CACb,OACA,SACA,UAEGC,GAAW5Z,GAAU2Z,IAiBzB,SAAS54B,GAAU84B,EAAQrB,EAAQ3e,GAClC,IAAInL,EACJ,IAAML,GAAewL,GACpB,MAAM,IAAIxW,UAAWiB,EAAQ,qEAAsEuV,IAKpG,GAHAnL,EAAO,CACNpK,OAAU,QAENsC,EAAYiT,EAAS,YACzBnL,EAAKpK,OAASuV,EAAQvV,QAChBs1B,GAAUlrB,EAAKpK,SACpB,MAAM,IAAIjB,UAAWiB,EAAQ,gFAAiF,SAAU2U,GAAM0gB,GAAS,MAAQ9f,EAAQvV,SAGzJ,MAAqB,WAAhBoK,EAAKpK,OCvBX,SAAuBu1B,EAAQrB,GAC9B,IACIsB,EACAC,EACAC,EACAC,EACAC,EACAC,EACA/hB,EACA7Y,EACA8Y,EACA+hB,EACAC,EACAC,EACAC,EAEAC,EACA5tB,EACA0M,EACAqH,EACA1e,EACAogB,EACA/iB,EACA8D,EACA0J,EAeJ,IAbAwM,EAAIkf,EAAO14B,OASXg6B,EAAO,KANED,EAAOtpB,WAGF,GAAIxP,WAAWjB,OAGf,IAGd06B,EAAK,EACCl7B,EAAI,EAAGA,EAAIga,EAAGha,KAInBsN,GAHA+T,EAAI6X,EAAQl5B,IAGNgN,KAAKxM,OAAS,GAAM6gB,EAAEpQ,WAAW,GAAIxP,WAAWjB,OAAS,GACtD06B,IACRA,EAAK5tB,GAgBP,IAZAmtB,EAAO,IAAIS,EAAG,IAGdR,EAAO,QAGPG,EAAM,cAGNC,EAAK,EAEL76B,EAAM,GACAD,EAAI,EAAGA,EAAIga,EAAGha,IAInB,GAHAqhB,EAAI6X,EAAQl5B,KAGPA,EAAI,GAAOqhB,EAAE9J,aAAe2hB,EAAQl5B,EAAE,GAAIuX,YAA/C,CASA,IAJCwB,EADI/Y,EAAIga,EAAE,GACFqH,EAAE9J,aAAe2hB,EAAQl5B,EAAE,GAAIuX,WAIlCzT,EAAI,EAAGA,EAAIud,EAAEpQ,WAAYnN,IAAM,CAcpC,GAZAi3B,EAAK/1B,EAAQw1B,EAAMM,EAAGr5B,YAGtBu5B,EAAKh2B,EAAQy1B,EAAMz1B,EAAQ,SAAUqc,EAAErU,KAAMlJ,IAI5C62B,EADItZ,EAAEgB,UAAY,EACX,aAEA,GAGHtJ,EAAM,CAIV,IAHA6hB,EAAO,gBACP9hB,EAAM,GACNtL,EAAIxN,EAAI,EACAwN,EAAIwM,GAAKqH,EAAE9J,aAAe2hB,EAAQ1rB,GAAI+J,YAG5CwL,GAFDpgB,EAAIu2B,EAAQ1rB,IACLmnB,aACF,WAEAhyB,EAAEyK,KAEP0L,EAAI/T,KAAMC,EAAQ,aAAcrC,EAAEqK,KAAM+V,EAAGjf,EAAEnB,EAAE0f,YAC/C7U,GAAK,EAENotB,EAAO51B,EAAQ41B,EAAM9hB,EAAIa,KAAM,MACnC,MACIihB,EAAO,GAER9hB,EAAM9T,EAAQ21B,EAAKC,EAAM92B,EAAEud,EAAEgB,WAI5B4Y,EADI5Z,EAAE7gB,OACDwE,EAAQ01B,EAAM11B,EAAQ,WAAYqc,EAAEjU,KAAM3E,GAAO3E,EAAEud,EAAEgB,WAAavJ,IAIlE9T,EAAQ01B,EAAM11B,EAAQ,OAAQqc,EAAEjU,KAAM0L,IAG5C7Y,EAAI8E,KAAMC,EAAQ61B,EAAKE,EAAIC,EAAIC,IAC/BH,GAAM,CACN,CACD,IAAMh3B,EAAI,EAAGA,EAAIud,EAAEkY,QAASz1B,IAC3Bi3B,EAAK/1B,EAAQw1B,EAAMM,EAAGr5B,YACtBu5B,EAAKh2B,EAAQy1B,EAAM,MACnBQ,EAAKj2B,EAAQ01B,EAAM,WACnBz6B,EAAI8E,KAAMC,EAAQ61B,EAAKE,EAAIC,EAAIC,IAC/BH,GAAM,CA1DN,CA6DF,OAAO76B,EAAI0Z,KAAM,KAClB,CDzGSwhB,CAAcZ,EAAQrB,GAET,WAAhB9pB,EAAKpK,OACFo1B,GAAclB,GAGf,UACR,CEpDA,SAASkC,KAET,CCGA,IAAIC,GCOmB,QAAbD,GAAIpuB,KCFd,IAAIiO,GAAQ,CACX7I,GACAD,GACAG,GACAE,GACAH,GACAE,GACA9F,GACAgG,GACAC,0ICVG4oB,GAAevoB,KAA6BpE,GAAgByD,IAAiBmpB,GAajF,SAASA,KAAU,CAVnBD,GAAyC,eHqBzC,SAAuB9hB,GAEtB,IAA2B,IAAtBhL,GAAYgL,GAChB,MAAM,IAAIzV,UAAWiB,EAAQ,0DAA2DwU,IAEzF,OAAK6hB,GACG7hB,EAAIxM,KAEL1I,GAAGM,KAAM4U,EAAI/X,YAAc,EACnC,CG9Be+5B,CAASF,IAAkCA,GAAaC,GCTvE,IAAItgB,GAAQ,CACXrI,GACAD,4CCOD,SAAS8oB,KACR,MACmB,mBAAXx0B,GACoB,iBAApBA,EAAQ,QACfK,EAAYL,EAAQ,gBACU,iBAAvBA,EAAOy0B,WAEhB,CCIA,IAAIC,GAAsBF,KAAkCx0B,OAAOy0B,YAAc,KCnB7EE,GAAaH,KAiCjB,SAASI,GAAYh8B,EAAOiN,GAE3B,GACwB,mBAAhBA,KAEN8uB,IACuB,iBAAhB9uB,GACqC,mBAArCA,EAAa6uB,KAGrB,MAAM,IAAI53B,UAAWiB,EAAQ,mEAAoE8H,IAElG,OAASjN,aAAiBiN,CAC3B,CCrCA,IAAImO,GAAQ,CACX,CAAE7I,GAAc,gBAChB,CAAED,GAAc,gBAChB,CAAEG,GAAY,cACd,CAAEE,GAAa,eACf,CAAEH,GAAY,cACd,CAAEE,GAAa,eACf,CAAE9F,GAAW,aACb,CAAEgG,GAAY,cACd,CAAEC,GAAmB,qBACrB,CAAEC,GAAgB,kBAClB,CAAEC,GAAiB,mBACnB,CAAEC,GAAc,iBCNjB,SAASipB,GAAU7vB,GAClB,IAAIrE,EACA5H,EAGJ,IAAMA,EAAI,EAAGA,EAAIib,GAAMza,OAAQR,IAC9B,GAAK67B,GAAY5vB,EAAKgP,GAAOjb,GAAK,IACjC,OAAOib,GAAOjb,GAAK,GAIrB,KAAQiM,GAAM,CAEb,IADArE,EAAIuF,GAAUlB,GACRjM,EAAI,EAAGA,EAAIib,GAAMza,OAAQR,IAC9B,GAAK4H,IAAMqT,GAAOjb,GAAK,GACtB,OAAOib,GAAOjb,GAAK,GAGrBiM,EAAM0C,GAAgB1C,EACtB,CACF,CCVA,SAAS8vB,GAAiB9vB,GACzB,IAAIsP,EACAtb,EACAD,ECboBH,EDexB,GPKD,SAAuBA,GACtB,IAAI+H,EACA5H,EAEJ,GAAsB,iBAAVH,GAAgC,OAAVA,EACjC,OAAO,EAGR,GAAKA,aAAiBy7B,GACrB,OAAO,EAGR,IAAMt7B,EAAI,EAAGA,EAAIib,GAAMza,OAAQR,IAC9B,GAAKH,aAAiBob,GAAOjb,GAC5B,OAAO,EAIT,KAAQH,GAAQ,CAEf,IADA+H,EAAIuF,GAAUtN,GACRG,EAAI,EAAGA,EAAIg8B,GAAMx7B,OAAQR,IAC9B,GAAKg8B,GAAOh8B,KAAQ4H,EACnB,OAAO,EAGT/H,EAAQ8O,GAAgB9O,EACxB,CAED,OAAO,CACR,COlCMo8B,CAAchwB,GAClBsP,EAAOtP,OACD,GEnBR,SAA8BpM,GAC7B,IAAI+H,EACA5H,EAEJ,GAAsB,iBAAVH,GAAgC,OAAVA,EACjC,OAAO,EAGR,IAAMG,EAAI,EAAGA,EAAIib,GAAMza,OAAQR,IAC9B,GAAKH,aAAiBob,GAAOjb,GAC5B,OAAO,EAIT,KAAQH,GAAQ,CAEf,IADA+H,EAAIuF,GAAUtN,GACRG,EAAI,EAAGA,EAAIg8B,GAAMx7B,OAAQR,IAC9B,GAAKg8B,GAAOh8B,KAAQ4H,EACnB,OAAO,EAGT/H,EAAQ8O,GAAgB9O,EACxB,CAED,OAAO,CACR,CFNaq8B,CAAqBjwB,GAE/BsP,EAD8B,IAA1BtP,EAAI+E,kBACDwH,GAAevM,EAAK,GAEpBwM,GAAgBxM,EAAK,OAEvB,OCvBiBpM,EDuBIoM,aCrBV4G,IACY,iBAA7B9F,GAAiBlN,IDuBjB,MAAM,IAAIkE,UAAWiB,EAAQ,6DAA8DiH,IAF3FsP,EAAOmZ,GAAoBzoB,EAAK,EAGhC,CAKD,IAJAhM,EAAM,CACLmN,KAAQ0uB,GAAU7vB,GAClBsP,KAAQ,IAEHvb,EAAI,EAAGA,EAAIub,EAAK/a,OAAQR,IAC7BC,EAAIsb,KAAKxW,KAAMwW,EAAMvb,IAEtB,OAAOC,CACR,CG4BA,SAAS0gB,GAASuY,GACjB,IAAIiD,EACAC,EACAC,EACAC,EACAC,EACAC,EACA1jB,EACAuI,EACJ,IAAMrV,GAAcktB,GACnB,MAAM,IAAIn1B,UAAWiB,EAAQ,8EAA+Ek0B,IAI7G,GADApgB,EClFD,SAAoBogB,GACnB,IAAIj5B,EACA6Y,EACAuI,EACArhB,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAAM,CAErC,IAAMmI,GADNkZ,EAAI6X,EAAQl5B,IAEX,OAAO,IAAI+D,UAAWiB,EAAQ,0FAA2Fqc,EAAGrhB,IAG7H,GAAKi5B,GAAa5X,GAAM,CAEvB,GAAa,QADbvI,EAAM6gB,GAAgBtY,IAErB,OAAO,IAAItd,UAAWiB,EAAQ,uFAAwFy0B,KAAKC,UAAWrY,GAAKrhB,IAE5I,GAAK8Y,aAAetX,MACnB,OAAOsX,CAEX,MAEG,IADAA,EAAM+gB,GAAgBxY,EAAG2X,eACLx3B,MACnB,OAAOsX,EAGT7Y,EAAI8E,KAAM+T,EACV,CACD,OAAO7Y,CACR,CDoDOye,CAAWwa,GACZpgB,aAAetX,MACnB,MAAMsX,EAMP,GADAA,EE7FD,SAAqBogB,GACpB,IAAI/pB,EACAlP,EACAw8B,EAEAz8B,EACA8D,EACA0J,EAIJ,IAFA2B,EAAO,CAAA,EACPlP,EAAM,GACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAG/B,GADAwN,GADAivB,EAAKvD,EAAQl5B,IACNgN,KACFisB,GAAawD,GACjB,IAAM34B,EAAI,EAAGA,EAAI24B,EAAGvD,OAAO14B,OAAQsD,IAAM,CAGxC,IAAmB,IAAdqL,EADL3B,EADKivB,EAAGvD,OAAQp1B,GACTkJ,MAEN,OAAO,IAAIjJ,UAAWiB,EAAQ,uGAAwGy0B,KAAKC,UAAWR,KAEvJ/pB,EAAM3B,IAAM,EACZvN,EAAI8E,KAAMyI,EACV,KACK,KAAmB,IAAd2B,EAAM3B,GACjB,OAAO,IAAIzJ,UAAWiB,EAAQ,uGAAwGy0B,KAAKC,UAAWR,KAEtJ/pB,EAAM3B,IAAM,EACZvN,EAAI8E,KAAMyI,EACV,CAEF,OAAOvN,CACR,CF6DOy8B,CAHNF,EAAS1jB,GAIJA,aAAetX,MACnB,MAAMsX,EAiCP,SAASyhB,EAAQl5B,EAAKkW,EAAYtG,GACjC,IAAIyJ,EACArC,EACAskB,EACA1f,EACA/W,EACAmb,EACAzZ,EACA5H,EACA8D,EACA0J,EAGJ,GADA6K,EAAQnU,UAAU1D,SACV2V,gBAAgBokB,GACvB,OAAe,IAAVliB,EACG,IAAIkiB,EAEG,IAAVliB,EACG,IAAIkiB,EAAQl5B,GAEL,IAAVgX,EACG,IAAIkiB,EAAQl5B,EAAKkW,GAElB,IAAIgjB,EAAQl5B,EAAKkW,EAAYtG,GAErC,GAAK6E,GAAezU,GAAQ,CAC3B,GAAe,IAAVgX,EACJ4E,EAAO,IAAIM,GAAUlc,EAAK,EAAG+6B,OACvB,CACN,IAAMpzB,GAAsBuO,GAC3B,MAAM,IAAIxT,UAAWiB,EAAQ,4EAA6EuS,IAE3G,GAAe,IAAVc,EACJ4E,EAAO,IAAIM,GAAUlc,EAAKkW,EAAY6kB,OAChC,CACN,IAAMpzB,GAAsBiI,GAC3B,MAAM,IAAIlN,UAAWiB,EAAQ,4EAA6EiM,IAE3GgM,EAAO,IAAIM,GAAUlc,EAAKkW,EAAY6E,GAAKnL,EAAYmrB,GACvD,CACD,CACD,GAAKnf,EAAKhM,WAAamrB,EACtB,MAAM,IAAI7jB,WAAYvT,EAAQ,mFAAoFo3B,GAEtH,MAEG,GADAnf,EAAO,IAAIM,GAAU,IAAI1H,GAAaumB,IACjC/jB,EAAQ,EAAI,CAChB,IAAMlQ,GAAU9G,GACf,MAAM,IAAI0C,UAAWiB,EAAQ,mEAAoE3D,IAElG6E,EAAM7E,CACN,CAMF,GAHA+G,EAAa+N,KAAM0d,GAAgB5W,QAGtB,IAAR/W,EAAiB,CAMrB,IAJAwU,EAASyY,QAAQ,EAAQqJ,EAAOh8B,QAGhCm8B,EAAQ,CAAA,EACF38B,EAAI,EAAGA,EAAIw8B,EAAOh8B,OAAQR,IAG/B,GAFAwN,EAAI2uB,EAAan8B,GACjB8D,EAAIu4B,EAAYr8B,GACXmiB,GAASjc,EAAKsH,GAAM,CAExB,GAAKmvB,EAAO74B,GACX,MAAM,IAAItC,MAAO,6EAElBkZ,EAAQ1a,GAAMkG,EAAKsH,GACnBmvB,EAAO74B,IAAM,CACb,CAGF,IAAM9D,EAAI,EAAGA,EAAIw8B,EAAOh8B,OAAQR,IAE1B28B,EADL74B,EAAIu4B,EAAYr8B,UAMG,KADnBqhB,EAAImb,EAAQx8B,IACL+R,UACN2I,EAAQ1a,GAAMqhB,EAAEtP,SAIlB,IAAM/R,EAAI,EAAGA,EAAIw8B,EAAOh8B,OAAQR,SAEpB,KADX4H,EAAI8S,EAAQ1a,KAEXu8B,EAAWJ,EAAan8B,IAAO,GAAI8B,KAAMqU,KAAMvO,EAGjD,CACD,OAAOuO,IACP,CAiQD,OAhYAgmB,EAAcrjB,EAGdwjB,EAAYxC,GAAkB0C,GAG9BA,ElB3ED,SAAsBtD,EAAQ7c,GAC7B,IAAIgG,EACAkX,EACAliB,EACAyB,EACAuI,EACArhB,EACA8D,EAGJ,IADAuT,EAAS,EACHrX,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAAM,CAsBrC,GAdAqX,GADAkiB,IAHAlX,EAAYjG,IAHZiF,EAAI6X,EAAQl5B,IAGOqiB,UAAWhG,IAGPhF,EAAOgL,GAAeA,EAIxCriB,EAAI,KACR8Y,EAAMogB,EAAQl5B,EAAE,IACZu5B,QAAUA,EACTN,GAAa5X,IACjB4Y,GAAYnhB,EAAIogB,OAAQK,IAI1BlY,EAAE9J,WAAaF,EAGV4hB,GAAa5X,GACjB,IAAMvd,EAAI,EAAGA,EAAIud,EAAE6X,OAAO14B,OAAQsD,IACjCud,EAAE6X,OAAQp1B,GAAIyT,WAAaF,EAI7BA,GAAUgK,EAAEpQ,UACZ,CAYD,OAVAsoB,GAAYlX,EAAahL,EAAOgL,GAAeA,EAG/ChB,EAAEkY,QAAUA,EAGPN,GAAa5X,IACjB4Y,GAAY5Y,EAAE6X,OAAQK,GAGhBL,CACR,CkBuBU0D,CAAaJ,EAAQF,GAG9BE,EG3GD,SAAkBtD,GACjB,IAAIj5B,EACAohB,EACArhB,EACA8D,EAGJ,IADA7D,EAAM,GACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAE/B,GAAKi5B,GADL5X,EAAI6X,EAAQl5B,IAEX,IAAM8D,EAAI,EAAGA,EAAIud,EAAE6X,OAAO14B,OAAQsD,IACjC7D,EAAI8E,KAAMsc,EAAE6X,OAAQp1B,SAGrB7D,EAAI8E,KAAMsc,GAGZ,OAAOphB,CACR,CHyFU48B,CAASL,GAGlBH,EI/GD,SAAqBnD,GACpB,IAAIj5B,EACA+Z,EAEAha,EACA8D,EAMJ,IAJAkW,EAAIkf,EAAO14B,OAEXP,EAAM,GACN6D,EAAI,EACE9D,EAAI,EAAGA,EAAIga,EAAE,EAAGha,IACjBk5B,EAAQl5B,GAGLuX,aAAe2hB,EAAQl5B,EAAE,GAAIuX,YAIpCtX,EAAI8E,KAAMjB,GACVA,GAAK,GAJJ7D,EAAI8E,KAAMjB,GASZ,OAFA7D,EAAI8E,KAAMjB,GAEH7D,CACR,CJqFc68B,CAAYN,GAGzBnb,EAAImb,EAAQA,EAAOh8B,OAAO,GAC1B47B,EAAc/a,EAAE9J,WAAa8J,EAAEpQ,WAAaoQ,EAAEkY,QA2H9CnxB,EAAamyB,EAAQ,OAAQzG,IAW7B1rB,EAAamyB,EAAQ,YAAa+B,GAWlCl0B,EAAamyB,EAAQ,aAAc6B,GAWnCzxB,GAAkC4vB,EAAQ,UAAU,WACnD,OAAO4B,EAAYt3B,OACrB,IAWC8F,GAAkC4vB,EAAQ,UAAU,WAEnD,OAAOH,GAAcoC,EACvB,IAcCp0B,EAAamyB,EAAQ,YAAY,SAAmBr0B,GACnD,IAAMyxB,GAAkBzxB,GACvB,MAAM,IAAInC,UAAWiB,EAAQ,6EAA8EkB,IAE5G,OAAOA,EAAK2tB,IAAiBvc,MAC/B,IAeClP,EAAamyB,EAAQ,gBAAgB,SAAuBvtB,GAC3D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAetQ,MACnB,MAAMsQ,EAEP,OAAO0qB,EAAQ1qB,GAAMb,UACvB,IAeC7I,EAAamyB,EAAQ,gBAAgB,SAAuBvtB,GAC3D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAetQ,MACnB,MAAMsQ,EAEP,OAAO0qB,EAAQ1qB,GAAMyF,UACvB,IAeCnP,EAAamyB,EAAQ,iBAAiB,SAAwBvtB,GAC7D,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAetQ,MACnB,MAAMsQ,EAEP,OAAO0qB,EAAQ1qB,GAAMqR,WACvB,IAaC/a,EAAamyB,EAAQ,YAAY,SAAmB16B,GACnD,OACCA,aAAiB06B,GAEhB5C,GAAkB93B,IAClBuiB,GAAyBviB,EAAMiN,YAGnC,IAeC1E,EAAamyB,EAAQ,UAAU,SAAiBvtB,GAC/C,IAAI8E,EAAMioB,GAAYoC,EAAanvB,GACnC,GAAK8E,aAAetQ,MACnB,MAAMsQ,EAEP,OAAO0qB,EAAQ1qB,GAAM1E,IACvB,IAcChF,EAAamyB,EAAQ,UAAU,SAAiBr0B,GAC/C,IAAIkS,EACJ,IAAMuf,GAAkBzxB,GACvB,MAAM,IAAInC,UAAWiB,EAAQ,6EAA8EkB,IAG5G,OADAkS,EAAMlS,EAAK2tB,IACJ,IAAItW,GAAUnF,EAAId,OAAQc,EAAIb,WAAYa,EAAInH,WACvD,IAGCsrB,EK1aD,SAAmCtuB,EAAGirB,GACrC,IAAIzyB,EACAC,EACAzG,EACAohB,EACArhB,EAGJ,IADAC,EAAM,CAAA,EACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAE/ByG,EAAMmE,GADNyW,EAAI6X,EAAQl5B,IAEZ0G,EAAMuL,GAAQoP,GACTA,EAAEva,WACDua,EAAEta,SACNktB,GAAsBhmB,EAAGoT,EAAErU,KAAMvG,EAAKC,GAEtCstB,GAAqB/lB,EAAGoT,EAAErU,KAAMvG,GAEtB4a,EAAEta,SACbgtB,GAAmC9lB,EAAGoT,EAAErU,KAAMvG,EAAKC,GAEnDiE,GAAkCsD,EAAGoT,EAAErU,KAAMvG,GAE9CxG,EAAKohB,EAAErU,MAAS,CAAEvG,EAAKC,GAExB,OAAOzG,CACR,CLgZa88B,CAA0BxC,EAAO15B,UAAW27B,GAiBxDp0B,EAAamyB,EAAO15B,UAAW,YAAY,WAE1C,KAAQsV,gBAAgBokB,GACvB,MAAM,IAAI/4B,MAAO,wDAOlB,OAAOw7B,GAAezC,EAAQiC,EALzBt4B,UAAU1D,OAAS,EAChB0D,UAAW,GAEX,CAAA,EAGV,IAaCkE,EAAamyB,EAAO15B,UAAW,UAAU,WACxC,KAAQsV,gBAAgBokB,GACvB,MAAM,IAAI/4B,MAAO,wDAElB,OM1dF,SAAiBy7B,EAAQ/D,GACxB,IAAIj5B,EACAohB,EACAzZ,EACA5H,EAGJ,IADAC,EAAM,CAAA,EACAD,EAAI,EAAGA,EAAIk5B,EAAO14B,OAAQR,IAG1BgM,GADLpE,EAAIq1B,GADJ5b,EAAI6X,EAAQl5B,IACEgN,OAEbpF,EAAIm0B,GAAiBn0B,IACV+vB,GAAkB/vB,IAElBgP,GAAehP,IAAO4G,GAAY5G,EAAEs1B,WAD/Ct1B,EAAIA,EAAEs1B,UAIPj9B,EAAKohB,EAAErU,MAASpF,EAEjB,OAAO3H,CACR,CNscSk9B,CAAahnB,KAAMqmB,EAC5B,IAEQjC,CACR,CO5dA,SAASjiB,GAAWiiB,EAAQniB,EAAKnM,GAChC,IACImxB,EACA/lB,EACA2L,EACAqa,EACAjuB,EACAhG,EACA3C,EACAsS,EACA8R,EACAjjB,EACA5H,EAmBJ,IAjBAoP,EAAO,CACNpK,OAAU,UAGXoE,EAAM6C,EAAIzL,OAETiG,EADIwF,EAAIxF,KAAOwF,EAAIvF,IACbsS,GAAgB,WAEhBpO,GAAQ,WAEfoY,EAASuX,EAAOvX,OAChB6H,EAAK0P,EAAOtpB,WAIZmsB,EAAS,IAAI3qB,GAAY2F,GACzBf,EAAS,EACHrX,EAAI,EAAGA,EAAIoJ,EAAKpJ,IAAM,CAC3B4H,EAAInB,EAAKwF,EAAKjM,GACd,IACCq9B,EAAQ9C,EAAO7X,OAAQ9a,GACvBmR,GAAM,CACN,CAAC,MAAQhT,GACT,IAEC6B,EAAI,IAAI2yB,EAAQ3yB,EAChB,CAAC,MAAQ7B,GACT,OAAO,IACP,CACDs3B,EAAQ9C,EAAO7X,OAAQ9a,GACvBmR,GAAM,CACN,CACD,GAAKA,GAAOnR,EAAEnG,SAAU2N,KAAW4T,EAClC,OAAO,KAGR0Q,GAAO7I,EADE,IAAIpY,GAAY4qB,EAAM/lB,OAAQ+lB,EAAM9lB,WAAY8lB,EAAMpsB,YAC5C,EAAG,EAAGmsB,EAAQ,EAAG/lB,GACpCA,GAAUwT,CACV,CACD,OAAOzS,CACR,CC5CA,IAAIN,GAAsBd,KACtB8c,GAAY,cAoFhB,SAASnT,GAAStf,GACjB,IAAI2P,EACAssB,EACAd,EACAjC,EAIJ,GAAKvuB,GAAc3K,GAClBk5B,EAASgD,GAAel8B,OAClB,KAAK+gB,GAAyB/gB,GAGpC,MAAM,IAAI0C,UAAWiB,EAAQ,sGAAuG3D,IAFpIk5B,EAASl5B,CAGT,CAuBD,SAASm8B,EAAan8B,EAAKkW,EAAY/W,GACtC,IAAI6X,EACAD,EACAhP,EACA0P,EAGJ,GADAT,EAAQnU,UAAU1D,SACV2V,gBAAgBqnB,GACvB,OAAe,IAAVnlB,EACG,IAAImlB,EAEG,IAAVnlB,EACG,IAAImlB,EAAan8B,GAEV,IAAVgX,EACG,IAAImlB,EAAan8B,EAAKkW,GAEvB,IAAIimB,EAAan8B,EAAKkW,EAAY/W,GAI1C,GAAe,IAAV6X,EACJD,EAAM,IAAIvC,GAAa,GACvBzM,EAAM,OAGF,GAAe,IAAViP,EAET,GAAKrP,GAAsB3H,GAC1B+W,EAAM,IAAIvC,GAAaxU,EAAI2P,GAC3B5H,EAAM/H,OAGF,GAAK2K,GAAc3K,IAGvB,GAFA+H,EAAM/H,EAAIb,OAEG,QADb4X,EAAME,GAAWiiB,EAAQ,IAAI1kB,GAAazM,EAAI4H,GAAqB3P,IAElE,MAAM,IAAI0C,UAAWiB,EAAQ,8KAI1B,GAAK8Q,GAAezU,IAGxB,IAAMqH,GADNU,GADAgP,EAAM/W,GACI4P,WAAaD,GAEtB,MAAM,IAAIuH,WAAYvT,EAAQ,yFAA0FgM,EAAmBoH,EAAInH,iBAI5I,KAAK9I,GAAU9G,GAoBnB,MAAM,IAAI0C,UAAWiB,EAAQ,+HAAgI3D,IAnB7J,IAA6B,IAAxByW,GACJ,MAAM,IAAI/T,UAAWiB,EAAQ,6JAA8J3D,IAE5L,IAAMmN,GAAYnN,EAAKqX,KACtB,MAAM,IAAI3U,UAAWiB,EAAQ,+HAAgI3D,IAG9J,IAAMmN,IADN4J,EAAM/W,EAAKqX,OACWhB,MACrB,MAAM,IAAI3T,UAAWiB,EAAQ,+HAAgI3D,IAK9J,GAFA+H,GADA0P,EC5MJ,SAAuBrB,GACtB,IAAIxX,EACA2H,EAGJ,IADA3H,EAAM,KAEL2H,EAAI6P,EAAGC,QACAC,MAGP1X,EAAI8E,KAAM6C,EAAE/H,OAEb,OAAOI,CACR,CD+LUuX,CAAcY,IACV5X,OAEG,QADb4X,EAAME,GAAWiiB,EAAQ,IAAI1kB,GAAazM,EAAI4H,GAAqB8H,IAElE,MAAM,IAAI/U,UAAWiB,EAAQ,kLAM9B,KAGG,CAEJ,IAAM8Q,GADNsC,EAAMlU,UAAW,IAEhB,MAAM,IAAIH,UAAWiB,EAAQ,wEAAyE3D,IAEvG,IAAM2H,GAAsBuO,GAC3B,MAAM,IAAIxT,UAAWiB,EAAQ,gFAAiFuS,IAE/G,IAAM7O,GAAW6O,EAAWvG,GAC3B,MAAM,IAAIuH,WAAYvT,EAAQ,2EAA4EgM,EAAmBuG,IAE9H,GAAKA,GAAca,EAAInH,WACtB,MAAM,IAAIsH,WAAYvT,EAAQ,wFAAyFuS,IAGxH,GAAe,IAAVc,GAEJ,IAAM3P,GADNU,GAAQgP,EAAInH,WAAasG,GAAevG,GAEvC,MAAM,IAAIuH,WAAYvT,EAAQ,mGAAoGgM,EAAmBoH,EAAInH,WAAWsG,QAIjK,CAEJ,IAAMvO,GADNI,EAAM5I,GAEL,MAAM,IAAIuD,UAAWiB,EAAQ,+EAAgFoE,IAE9G,GAAMA,EAAI4H,EAAsBoH,EAAInH,WAAWsG,EAC9C,MAAM,IAAIgB,WAAYvT,EAAQ,iJAAkJoE,EAAI4H,GAErL,CACD,CAKD,OAJA5I,EAAa+N,KAAM,UAAWiC,GAC9BhQ,EAAa+N,KAAM,cAAeoB,GAAc,GAChDnP,EAAa+N,KAAM,cAAe/M,EAAI4H,GACtC5I,EAAa+N,KAAM,UAAW/M,GACvB+M,IACP,CAwQD,OA5YAnF,EAAoBupB,EAAOtpB,WAC3BqsB,EAAS/C,EAAOvX,OAChBwZ,EAASjC,EAAOrB,OA6IhB9wB,EAAao1B,EAAa,oBAAqBxsB,GAW/C5I,EAAao1B,EAAa,OAAQ1J,IAWlC1rB,EAAao1B,EAAa,SAAUjD,GAWpCvG,GAAqBwJ,EAAY38B,UAAW,UAAU,WACrD,OAAOsV,KAAK8B,OACd,IAWC+b,GAAqBwJ,EAAY38B,UAAW,cAAc,WACzD,OAAOsV,KAAKsJ,WACd,IAWCuU,GAAqBwJ,EAAY38B,UAAW,cAAc,WACzD,OAAOsV,KAAKsnB,WACd,IAWCr1B,EAAao1B,EAAY38B,UAAW,oBAAqB28B,EAAYxsB,mBAcrE5I,EAAao1B,EAAY38B,UAAW,OAAO,SAAciR,GACxD,IAAM4rB,EAAevnB,MACpB,MAAM,IAAIpS,UAAWiB,EAAQ,0CAA2C8uB,KAEzE,IAAM9qB,GAAsB8I,GAC3B,MAAM,IAAI/N,UAAWiB,EAAQ,qEAAsE8M,IAEpG,KAAKA,GAAOqE,KAAK6B,SAGjB,OAAO,IAAIuiB,EAAQpkB,KAAK8B,QAAS9B,KAAKsnB,YAAc3rB,EAAId,EAAqBA,EAC/E,IAWCgjB,GAAqBwJ,EAAY38B,UAAW,UAAU,WACrD,OAAOsV,KAAK6B,OACd,IAsCC5P,EAAao1B,EAAY38B,UAAW,OAAO,SAAchB,GACxD,IAEIoa,EACA7K,EACA0C,EACAsG,EACAU,EACArS,EACAokB,EACA7Q,EACAsC,EACA3Z,EACA3C,EACA8D,EACJ,IAAM45B,EAAevnB,MACpB,MAAM,IAAIpS,UAAWiB,EAAQ,0CAA2C8uB,KAGzE,GADA1b,EAAMjC,KAAK8B,QACN/T,UAAU1D,OAAS,GAEvB,IAAMwI,GADN8I,EAAM5N,UAAW,IAEhB,MAAM,IAAIH,UAAWiB,EAAQ,+EAAgF8M,SAG9GA,EAAM,EAOP,GALA1C,EAAO,CACNpK,OAAU,UAEX6lB,EAAK0P,EAAOtpB,YAEPjF,GAAcnM,IAAY6gB,GAAU8b,EAAQ,UAAjD,CAmCA,GAAK1qB,GAAOqE,KAAK6B,QAChB,MAAM,IAAIO,WAAYvT,EAAQ,kEAAmE8M,IAElG,IAAM3J,GAAUtI,GACf,MAAM,IAAIkE,UAAWiB,EAAQ,0FAA2FnF,IAGzH,GAAKA,EAAM4B,SAAU2N,KAAWkuB,EAM/B,OAJArjB,EAAOsgB,EAAO7X,OAAQ7iB,QAGtB6zB,GAAO7I,EAFE,IAAIpY,GAAYwH,EAAK3C,OAAQ2C,EAAK1C,WAAYsT,GAEpC,EAAG,EADb,IAAIpY,GAAY2F,EAAKjC,KAAKsnB,YAAc3rB,EAAId,EAAqB6Z,GACzC,EAAG,GAOrC,IAHAvO,EAAI,IAAIie,EAAQniB,EAAKjC,KAAKsnB,YAAc3rB,EAAId,EAAqB6Z,GAG3D7qB,EAAI,EAAGA,EAAIw8B,EAAOh8B,OAAQR,IAE1BmiB,GAAStiB,EADd8C,EAAI65B,EAAQx8B,MAEXsc,EAAG3Z,GAAM9C,EAAO8C,GAvBjB,KAlCD,CAEC,GAAKmP,GADLkI,EAAIna,EAAMW,QACG2V,KAAK6B,QACjB,MAAM,IAAIO,WAAY,0FAUvB,GANC9R,GAFDwT,EAAOpa,GACG4G,KAAOwT,EAAKvT,IACfsS,GAAgB,WAEhBpO,GAAQ,WAGf9G,EAAIqS,KAAKsnB,YAAe3rB,EAAId,EAE3BiJ,EAAK3C,SAAWc,GAEf6B,EAAK1C,WAAazT,GAClBmW,EAAK1C,WAAW0C,EAAKhJ,WAAanN,EAElC,CAKD,IADAgV,EAAM,GACA9Y,EAAI,EAAGA,EAAIga,EAAGha,IACnB8Y,EAAI/T,KAAM0B,EAAK5G,EAAOG,IAEvBia,EAAOnB,EACPrS,EAAMmE,GAAQ,UACd,CACD,IAAM5K,EAAI,EAAGA,EAAIga,EAAGlI,IAAO9R,IAC1BmW,KAAKzP,IAAKD,EAAKwT,EAAMja,GAAK8R,EAG3B,CA0BH,IAWC1J,EAAao1B,EAAY38B,UAAW,SAAU05B,GAEvCiD,EASP,SAASE,EAAe79B,GACvB,MACkB,iBAAVA,GACG,OAAVA,IAECA,EAAMiN,YAAYE,OAAS8mB,InI5f/B,SAAwBj0B,EAAO+O,GAC9B,IAAIxB,SAAcwB,EAClB,GACW,OAAVA,GACU,WAATxB,GAA8B,aAATA,EAEtB,MAAM,IAAIrJ,UAAWiB,EAAQ,uGAAwG4J,IAGtI,OADAxB,SAAcvN,EAEH,OAAVA,IACU,WAATuN,GAA8B,aAATA,IAIhBqmB,GAAU3xB,KAAM8M,EAAO/O,EAC/B,CmI6eImP,CAAenP,EAAO29B,EAAY38B,aAEnChB,EAAMmR,oBAAsBA,CAE7B,CACF,CEjiBA,IAAIvR,GAA2B,mBAAXk+B,OAA0BA,OAAS,KCAvD,ICmBI1wB,GDnBAA,GAAO2wB,EAAoBD,OCuB9B1wB,GCRD,WACC,IAAIjC,EACAgQ,EAEJ,GAA6B,mBAAjB6iB,GACX,OAAO,EAGR,IAMC7yB,EACC4B,GALAoO,EADiC,mBAAtB6iB,GAAazH,KACpByH,GAAazH,KAAM,CAAE,EAAG,EAAG,EAAG,IAE9B,IAAIyH,GAAc,CAAE,EAAG,EAAG,EAAG,MAItB,IAAX7iB,EAAG,IACQ,IAAXA,EAAG,IACQ,IAAXA,EAAG,IACQ,IAAXA,EAAG,EAEJ,CAAC,MAAQjV,GACTiF,GAAO,CACP,CACD,OAAOA,CACR,CDpBK8yB,GACGr+B,GEdR,WACC,MAAM,IAAI+B,MAAO,kBAClB,EFoBA,IAAAu8B,GAAe9wB,GGNf,SAAS+wB,KACR,MAAM,IAAIx8B,MAAO,kBAClB,CAMA,IAAIub,GAAQ,CACXtM,OAAUktB,GACVttB,QAAW+B,GACXhC,QAAW+B,GACXhC,QAAW6tB,GACXttB,QAAWvN,MACX0M,MAASwC,GACTtC,MAASuC,GACT5C,KAAQjD,GACRqD,OAAUyC,GACVvC,OAAUwC,GACV7C,MAAS8C,GACT7C,OAAU8C,GACVpC,UAAa0tB,GACbztB,UAAaoC,GACbnC,WAAcoC,GACd5H,KAAQ6H,ICrCLorB,GAAQ,CAAA,ECmBZ,IAAAC,GCvBW1vB,GAAYmvB,GAAOQ,aCiB9B,SAAsBC,GACrB,IAAMp1B,GAAsBo1B,GAC3B,MAAM,IAAIr6B,UAAWiB,EAAQ,qEAAsEo5B,IAEpG,OAAOT,GAAOQ,YAAaC,EAC5B,ECLA,SAAsBA,GACrB,IAAMp1B,GAAsBo1B,GAC3B,MAAM,IAAIr6B,UAAWiB,EAAQ,qEAAsEo5B,IAEpG,OAAO,IAAIT,GAAQS,EACpB,ECZA,SAAS3tB,GAAQ2tB,GAChB,OC6GD,SAAez1B,EAAG9I,EAAOsZ,EAAOI,GAC/B,IAAIrT,EACJ,OA3GD,SAAoBA,EAAK0V,GACxB,MAAkC,mBAAlB1V,EA0GG,OAzGpB,CAyGM2V,CAAWlT,GACRA,EAAE01B,KAAMx+B,EAAOsZ,EAAOI,IAEzBJ,EAAQ,IACZA,GAASxQ,EAAEnI,QACE,IACZ2Y,EAAQ,GAGLI,EAAM,EACVA,GAAO5Q,EAAEnI,OACE+Y,EAAM5Q,EAAEnI,SACnB+Y,EAAM5Q,EAAEnI,SAET0F,EAAMmV,GAAkB1S,IACf6S,iBA9DV,SAAoB7S,EAAG9I,EAAOsZ,EAAOI,GACpC,IAAIgC,EACA7U,EACA1G,EAIJ,IAFAub,EAAO5S,EAAE4S,KACT7U,EAAMiC,EAAE8S,UAAW,GACbzb,EAAImZ,EAAOnZ,EAAIuZ,EAAKvZ,IACzB0G,EAAK6U,EAAMvb,EAAGH,GAEf,OAAO0b,CACR,CAoDSE,CAAWvV,EAAKrG,EAAOsZ,EAAOI,GAvGvC,SAAkB5Q,EAAG9I,EAAOsZ,EAAOI,GAClC,IAAIvZ,EACJ,IAAMA,EAAImZ,EAAOnZ,EAAIuZ,EAAKvZ,IACzB2I,EAAG3I,GAAMH,EAEV,OAAO8I,CACR,CAmGQygB,CAASzgB,EAAG9I,EAAOsZ,EAAOI,GAClC,CDlIQ8kB,CAAMF,GAAaC,GAAQ,EAAG,EAAGA,EACzC,CAUA,SAAS5xB,GAAYsE,EAAOstB,GAC3B,IAAInxB,ELAL,SAAgB6D,GACf,IAAImsB,EACAhwB,EACAgC,EAGJ,OAAMT,GAAYsC,KACjB7B,EAAMqnB,GAAYxlB,GAClB7D,EAAOknB,GAAOllB,IAAS,MAEfhC,EAIJiX,GAAkBpT,IACjB7B,EAEJguB,EAASnsB,EAAMjR,MAIfoP,GADAguB,EAASnsB,GACIkS,QAEd/V,EAAOgxB,GAAOhvB,MAIdhC,EAAOswB,GAAeN,GACtBgB,GAAOhvB,GAAQhC,GAHPA,GAMF,IACR,CKhCYqxB,CAAaxtB,GACxB,OAAK7D,EACG,IAAIA,EAAMmxB,GAEX,IACR,CAgBA,SAAS9mB,GAAQxG,EAAOstB,GACvB,IAAI9iB,EAAKgb,GAAYxlB,GACrB,MAAY,YAAPwK,EACGxb,GAAOs+B,GAEH,WAAP9iB,EACG7K,GAAQ2tB,GAET5xB,GAAYsE,EAAOstB,EAC3B,CEnBA,SAASG,GAAiB1+B,EAAOiR,EAAOqL,EAAOJ,GAC9C,IAAI3D,EAKJ,GAAa,QADbA,EAAMd,GAAQxG,EAAO,IAEpB,MAAM,IAAI/M,UAAWiB,EAAQ,iFAAkF8L,IAahH,OAVK6nB,GADL7nB,EAAQwlB,GAAYxlB,KACelR,EAAUC,KAC5CA,EAAQ,CAAEA,EAAO,KAEb+R,GAAiBwG,GACfsD,GAAgB5K,GAEhBmB,GAAQnB,IAEVsH,EAAK,EAAGvY,GAEN,IAAIyf,GAASxO,EAAOsH,EAAK+D,EAAOrc,GADnCqc,EAAM3b,QAAU,GAC+B,EAAGub,EACvD,CCtCA,SAASyiB,GAAgBtc,GACxB,IAAIjiB,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIkiB,EAAO1hB,OAAQR,IAC/BC,EAAI8E,KAAMuxB,GAAYpU,EAAQliB,KAE/B,OAAOC,CACR,CC1BA,IAAIojB,GAAa3C,GAAUwB,GAAQ,mBAgDnC,SAASuc,GAAyB72B,GACjC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,wBAgDnC,SAAS+S,GAA6BrtB,GACrC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,YAgDnC,SAASwc,GAAmB92B,GAC3B,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,mBAgDnC,SAASgT,GAAyBttB,GACjC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,qBAgDnC,SAASyc,GAA2B/2B,GACnC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,SAmDnC,SAAS2V,GAAgBjwB,GACxB,OAAOyb,GAAYziB,OAAQgH,GAC5B,CCrDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,YAgDnC,SAAS0c,GAAmBh3B,GAC3B,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,YAmDnC,SAAS0V,GAAmBhwB,GAC3B,OAAOyb,GAAYziB,OAAQgH,GAC5B,CCrDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,kBAgDnC,SAAS2c,GAAwBj3B,GAChC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,kBAgDnC,SAAS4c,GAAwBl3B,GAChC,OAAOyb,GAAYziB,OAAQgH,GAC5B,CClDA,IAAIyb,GAAa3C,GAAUwB,GAAQ,eAgDnC,SAAS6c,GAAqBn3B,GAC7B,OAAOyb,GAAYziB,OAAQgH,GAC5B,2iKCWA,SAASo3B,GAAgBC,EAAQC,GAChC,IAAI7d,EACJ,OAA0B,IAArBnd,UAAU1D,OAvDhB,WACC,IAAI0hB,EACAsT,EACAv1B,EACA6Y,EACA2c,EACAC,EACArU,EACAvd,EACA9D,EAKJ,IAHAC,EAAM,CAAA,EAENu1B,GADAtT,EAAS1S,GAAY2vB,KACL3+B,OACVR,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAM,CAI9B,IAHAy1B,EAAMvT,EAAQliB,GACdqhB,EAAI8d,GAAiB1J,GACrB3c,EAAM,CAAA,EACAhV,EAAI,EAAGA,EAAI0xB,EAAQ1xB,IAExBgV,EADA4c,EAAMxT,EAAQpe,IACDud,EAAGqU,GAEjBz1B,EAAKw1B,GAAQ3c,CACb,CACD,OAAO7Y,CACR,CA+BS21B,IAERqJ,EAASnc,GAASmc,GACb33B,EAAY63B,GAAiBF,IAG5B33B,EAFL+Z,EAAI8d,GAAiBF,GACrBC,EAASpc,GAASoc,IAEV7d,EAAG6d,GAGL,KACR,CC9DA,SAASE,GAAkBld,GAC1B,IAAI5G,EAEAtb,EAGJ,GAAW,IADPkiB,EAAO1hB,OAEV,OAAO,KAGR,IADA8a,EAAK4G,EAAQ,GACPliB,EAAI,EAAGA,EAAIkiB,EAAO1hB,OAAQR,IAE/B,GAAY,QADZsb,EAAK0jB,GAAgB1jB,EAAI4G,EAAQliB,OACL,IAARsb,EACnB,OAAO,KAGT,OAAOA,CACR,CC3BA,SAASgP,KACR,MAAO,CAENpI,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAIfrK,MAAS,YAGTsa,QAAW,OAGXgJ,WAAc,QAEhB,CCjCA,IAAI9K,GDKI,CAENrS,OAAU,CACTnQ,QAAW,UACX+T,QAAW,UACX7P,KAAQ,UACRsP,eAAkB,UAClBE,oBAAuB,UACvBE,uBAA0B,aAC1BN,QAAW,QACXJ,eAAkB,QAClBE,iBAAoB,SACpBJ,QAAW,OACXpK,MAAS,QACTqL,cAAiB,QACjBE,cAAiB,OACjBE,WAAc,SAIfrK,MAAS,YAGTsa,QAAW,OAGXgJ,WAAc,SC9BZ7K,GAAO,CACV,iBAAkBD,GAASrS,OAAOnQ,QAClC,iBAAkBwiB,GAASrS,OAAO4D,QAClC,cAAeyO,GAASrS,OAAOjM,KAC/B,wBAAyBse,GAASrS,OAAOqD,eACzC,6BAA8BgP,GAASrS,OAAOuD,oBAC9C,gCAAiC8O,GAASrS,OAAOyD,uBACjD,iBAAkB4O,GAASrS,OAAOmD,QAClC,wBAAyBkP,GAASrS,OAAO+C,eACzC,0BAA2BsP,GAASrS,OAAOiD,iBAC3C,iBAAkBoP,GAASrS,OAAO6C,QAClC,eAAgBwP,GAASrS,OAAOvH,MAChC,uBAAwB4Z,GAASrS,OAAO8D,cACxC,uBAAwBuO,GAASrS,OAAOgE,cACxC,oBAAqBqO,GAASrS,OAAOkE,WACrCrK,MAASwY,GAASxY,MAClBsa,QAAW9B,GAAS8B,QACpBgJ,WAAc9K,GAAS8K,YCJxBj3B,EAAA3I,GAAA,ODoBA,SAAcuN,GACb,IAAIpF,EAAI4sB,GAAMxnB,GACd,YAAe,IAANpF,EAAiB,KAAOA,CAClC,IElBA,IAAI6sB,GAAgBnK,GAAS7jB,IAAK,kBAC9B64B,GAAsBhV,GAAS7jB,IAAK,wBACpC84B,GAA+BjV,GAAS7jB,IAAK,yBAC7C+4B,GAAiClV,GAAS7jB,IAAK,2BAC/Cg5B,GAAoCnV,GAAS7jB,IAAK,8BAClDi5B,GAAuCpV,GAAS7jB,IAAK,iCAGrDk5B,GAAgB,CACnB5tB,QAmKD,WAEC,OAAO0iB,EACR,EArKCnO,cA6KD,WAEC,OAAOgZ,EACR,EA/KC1a,KAyLD,SAAqB1C,GACpB,IAAI5G,EACAtb,EAGJ,IADAsb,EAAK4G,EAAQ,GACPliB,EAAI,EAAGA,EAAIkiB,EAAO1hB,OAAQR,IAE/B,GAAKkiB,EAAQliB,KAAQsb,EACpB,MAAM,IAAI9Z,MAAOwD,EAAQ,+JAAgK2U,GAAMuI,EAAQ,QAGzM,OAAO5G,CACR,EApMCuJ,SAAY+a,GACZ9a,aA6ND,SAA6B5C,GAC5B,IAAI5G,EAAKskB,GAAgB1d,GAGzB,GAAKuc,GAAyBnjB,IAAe,YAAPA,EACrC,OAAOA,EAGR,GAAKqjB,GAA2BrjB,GAC/B,OAAO8jB,GAAkB,CAAE9jB,EAAIkkB,KAEhC,GAAKtK,GAAyB5Z,GAC7B,OAAO8jB,GAAkB,CAAE9jB,EAAIikB,KAGhC,OAAOE,EACR,GAzOII,GAAgB,CAEnBta,eAAkB,CACjBkZ,GACAnU,GAAS7jB,IAAK,0BAEf+e,2BAA8B,CAC7B/G,GAAMggB,IACNnU,GAAS7jB,IAAK,0BAEfgf,oBAAuB,CACtBwP,GACA6K,IAEDpa,gCAAmC,CAClCjH,GAAMwW,IACN6K,IAEDna,uBAA0B,CACzB6N,GACAuM,IAEDna,mCAAsC,CACrCnH,GAAM+U,IACNuM,IAID1a,QAAW,CACVqZ,GACApU,GAAS7jB,IAAK,mBAEf6e,oBAAuB,CACtB7G,GAAMigB,IACNpU,GAAS7jB,IAAK,mBAEfwe,eAAkB,CACjBiQ,GACAqK,IAEDra,2BAA8B,CAC7BzG,GAAMyW,IACNqK,IAEDpa,iBAAoB,CACnBwZ,GACAa,IAEDpa,6BAAgC,CAC/B3G,GAAMkgB,IACNa,IAIDvpB,KAAQ,CACP4hB,GACAvN,GAAS7jB,IAAK,gBAEfof,iBAAoB,CACnBpH,GAAMoZ,IACNvN,GAAS7jB,IAAK,gBAIfqf,QAAW,CACV8Y,GACAtU,GAAS7jB,IAAK,mBAEfsf,oBAAuB,CACtBtH,GAAMmgB,IACNtU,GAAS7jB,IAAK,mBAIfse,QAAW,CACV6S,GACAtN,GAAS7jB,IAAK,mBAEfue,oBAAuB,CACtBvG,GAAMmZ,IACNtN,GAAS7jB,IAAK,mBAIfuf,cAAiB,CAChB6Y,GACAvU,GAAS7jB,IAAK,yBAEfwf,0BAA6B,CAC5BxH,GAAMogB,IACNvU,GAAS7jB,IAAK,yBAEfyf,cAAiB,CAChB4Y,GACAxU,GAAS7jB,IAAK,yBAEf0f,0BAA6B,CAC5B1H,GAAMqgB,IACNxU,GAAS7jB,IAAK,yBAEf2f,WAAc,CACb2Y,GACAzU,GAAS7jB,IAAK,sBAEf4f,uBAA0B,CACzB5H,GAAMsgB,IACNzU,GAAS7jB,IAAK,uBAKZu5B,GAAgB,CACnBxvB,WAAc,UACdD,UAAa,UACbD,UAAa,WAIV2vB,GAAgB,CACnB5vB,QAAW,aACXD,QAAW,YACXD,QAAW,aAaZ,SAASsO,GAAMjF,GACd,OASA,SAAkB3Z,GACjB,MAAmB,YAAVA,GAAyB2Z,EAAK3Z,EACvC,CACF,CAsDA,SAAS+/B,GAAgB1d,GACxB,IAAI5G,EAAK8jB,GAAkBld,GAC3B,GAAY,OAAP5G,EACJ,MAAM,IAAI9Z,MAAOwD,EAAQ,wJAAyJ2U,GAAMuI,EAAQ,QAEjM,OAAO5G,CACR,CAmCA,SAASwkB,GAAiChvB,GACzC,OAAOkvB,GAAelvB,IAAW2uB,EAClC,CASA,SAASM,GAAoCjvB,GAC5C,OAAOmvB,GAAenvB,IAAW4uB,EAClC,CCrRA,SAAS5c,GAASod,EAAQC,EAAQC,GACjC,ODsSD,SAAkBle,EAAQke,GACzB,IAAI9kB,EACArN,EAGJ,GAAKoV,GAAY+c,GAChB,OAAOA,EAIR,QAAW,KADXnyB,EAAI0xB,GAAeS,IAElB,OAAOnyB,EAAGiU,GAOX,GAJA5G,EAAKskB,GAAgB1d,QAIV,KADXjU,EAAI4xB,GAAeO,IAGlB,OAAKnyB,EAAG,GAAKqN,GAELA,EAGHzQ,GAAUoD,EAAG,IACVA,EAAG,GAEJA,EAAG,GAAKqN,GAEhB,MAAM,IAAIvX,UAAWiB,EAAQ,uFAAwFo7B,GACtH,CCrUQC,CAAgB,CAAEH,EAAQC,GAAUC,EAC5C,CC6BA,SAAS/c,GAAYzb,GACpB,OACCqa,GAAkBra,MC1BO/H,ED2BP+H,aCzBDqb,IAEC,iBAAVpjB,GACG,OAAVA,GACA6I,GAAW7I,EAAMwiB,YACjB3Z,GAAW7I,EAAMoR,aACjBpG,GAAUhL,EAAMujB,YAChBvY,GAAUhL,EAAMqjB,OAChBxa,GAAW7I,EAAMikB,OACjB3B,GAAStiB,EAAO,WDiBjBqkB,GAAkBtc,GC5BpB,IAA2B/H,CD8B3B,CEjCA,SAASiR,GAAOnI,GACf,IAAI2S,EAGJ,GAAkB,iBAAN3S,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,GAAK0a,GADL/H,EAAK3S,EAAEmI,OAEN,OAAOwK,EAGR,MAAM,IAAIvX,UAAWiB,EAAQ,uFAAwFsW,GACtH,CChBA,SAAS/J,GAAO5I,GACf,IAAIsY,EACAlhB,EAGJ,GAAkB,iBAAN4I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,GAAKK,GADLjJ,EAAI4I,EAAE4I,OAEL,OAAOxR,EAGR,IAAMiM,GADNiV,EAAKtY,EAAEwT,OAEN,MAAM,IAAIpY,UAAWiB,EAAQ,0DAA2D2D,IAEzF,OAAOsY,EAAGzgB,MACX,CC5BA,IAAIgoB,GAAY,YACZE,GAAe,eAsBnB,SAAS3M,GAAOpT,GACf,IAAIuY,EACAG,EAGJ,GAAkB,iBAAN1Y,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,OADA0Y,EAAI1Y,EAAEoT,MACDkL,GAAS5F,GACNA,GAGRH,ECvBD,SAAkBvY,GACjB,IAAI1I,EACAuf,EACAyB,EACAC,EACA0R,EACA5yB,EAGJ,GAAkB,iBAAN2I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,IAAMqD,GADNkV,EAAKvY,EAAEwI,SACoB,CAG1B,IAAMnF,GADNiV,EAAKtY,EAAEwT,OAEN,MAAM,IAAIpY,UAAWiB,EAAQ,0DAA2D2D,IAEzF,OAAmB,IAAdsY,EAAGzgB,OACA,CAAE,IAEVgf,EAAM7W,EAAEoT,MACFkL,GAASzH,KACdA,EAAM,aAEA6I,GAAepH,EAAIzB,GAC1B,CAGD,IADAvf,EAAM,GACAD,EAAI,EAAGA,EAAIkhB,EAAG1gB,OAAQR,IAAM,CAEjC,IAAM0I,GADNkqB,EAAI1R,EAAIlhB,IAEP,MAAM,IAAI+D,UAAWiB,EAAQ,0DAA2D2D,IAEzF1I,EAAI8E,KAAM6tB,EACV,CACD,OAAO3yB,CACR,CDfMkR,CAASxI,GAEH,KADX0Y,EAAIhQ,GAAe6P,KACG,IAANG,EACRmH,GAEG,IAANnH,EACGqH,GAGY,IAAfnX,GAAO5I,GACJ6f,GAGD,KACR,CEbA,IAAAjf,GAAAC,GAAAd,GAAAR,aACAuB,GAAAD,GAAAd,GAAAP,UAKAm4B,GAAA92B,GAAAd,IC/BA,SAAS63B,GAAU1gC,GAClB,IAAIuN,SAAcvN,EAClB,OACW,OAAVA,GACU,WAATuN,GAA8B,aAATA,EAEf,IAAIrJ,UAAWiB,EAAQ,8GAA+GnF,IAEvI,IACR,CDuBAuI,EAAAk4B,GAAA,aAAA/2B,IACAnB,EAAAk4B,GAAA,UAAA72B,IEtDe,IAAAxD,GAAAvG,OAAO8gC,OCKtB,SAASC,KAET,CCSA,IAAAC,GATwB,mBAAZz6B,GACIA,GDehB,SAAuB2I,GAEtB,OADA6xB,GAAK5/B,UAAY+N,EACV,IAAI6xB,EACZ,EETA,SAASE,GAAY7uB,EAAKuK,GACzB,OAAKvK,EAAM,EACH,EAEHA,EAAMuK,EACHA,EAEDvK,CACR,CCRA,SAAS8uB,GAAW9uB,EAAKuK,GACxB,IAAIwkB,EAAMxkB,EAAM,EAChB,OAAKvK,EAAM,IACVA,GAAO+uB,GACI,GAEG,KADb/uB,GAAO+uB,KAEN/uB,GAAO+uB,GAGF/uB,GAEHA,EAAMuK,IACVvK,GAAO+uB,GACIxkB,IACVvK,GAAO+uB,GAED/uB,GAEDA,CACR,CCpBA,SAASgvB,GAAgBhvB,EAAKuK,GAC7B,OAAKvK,EAAM,GACVA,GAAOuK,EAAM,GACF,GACF,EAEFvK,EAEHA,EAAMuK,GACF,EAEFvK,CACR,CCFA,IAAIivB,GAAcrgB,GAAUrC,MClBxBsE,GAAQ,CACXlE,KAAQmiB,GACRpiB,MAASmiB,GACTjiB,UAoDD,SAAyB5M,EAAKuK,GAC7B,IAAI1B,EAAQ+D,GAAW5M,EAAKuK,GAC5B,GAAK1B,EAAQ,GAAKA,EAAQ0B,EACzB,MAAM,IAAI9D,WAAYvT,EAAQ,yFAA0FqX,EAAKvK,IAE9H,OAAO6I,CACR,EAzDC4D,MAyBD,SAA6BzM,EAAKuK,GACjC,GAAKvK,EAAM,GAAKA,EAAMuK,EACrB,MAAM,IAAI9D,WAAYvT,EAAQ,yFAA0FqX,EAAKvK,IAE9H,OAAOA,CACR,GCcA,SAAS+O,GAAK/O,EAAKuK,EAAK2O,GACvB,IAAIrQ,EACJ,GAAc,UAATqQ,EACJ,OAAO2V,GAAY7uB,EAAKuK,GAEzB,GAAc,SAAT2O,EACJ,OAAO4V,GAAW9uB,EAAKuK,GAMxB,GAJA1B,EAAQ7I,EACM,cAATkZ,IACJrQ,EAAQmmB,GAAgBnmB,EAAO0B,IAE3B1B,EAAQ,GAAKA,EAAQ0B,EACzB,MAAM,IAAI9D,WAAYvT,EAAQ,yFAA0FqX,EAAKvK,IAE9H,OAAO6I,CACR,CCEAvS,EAAA3I,GAAA,WFuDA,SAAkBurB,GACjB,IAAM+V,GAAa/V,GAClB,MAAM,IAAIjnB,UAAWiB,EAAQ,iFAAkFgmB,IAEhH,OAAOrI,GAAOqI,EACf,IG7HA,IAAI7pB,GAAO6/B,GAAOngC,UAAUkgB,KCA5B,IAAI5f,GAAO6/B,GAAOngC,UAAUogC,KCO5B,SAASja,GAAM/a,EAAK7C,GACnB,IAAInJ,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAMkH,EAAKjM,IAEhB,OAAOC,CACR,CCSA,IAEIihC,GAAa5W,GAAS7jB,IAAK,cA4C/B,SAAS6Y,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,EAAOxB,GAC/D,IAAIhJ,EACAnC,EACArJ,EACAkb,EACAC,EAEJ,KAAO/K,gBAAgBmJ,IACtB,OAAKpb,UAAU1D,OAAS,EAChB,IAAI8e,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,GAErD,IAAIuD,GAASxO,EAAOwG,EAAQ6E,EAAOhL,EAASkG,EAAQ0E,EAAOxB,GAEnE,IAAM8I,GAAYvS,GACjB,MAAM,IAAI/M,UAAWiB,EAAQ,uFAAwF8L,IAEtH,IAAM9E,GAAcsL,GACnB,MAAM,IAAIvT,UAAWiB,EAAQ,8GAA+GsS,IACtI,GAAKA,EAAO7Q,KAAO6Q,EAAO5Q,OAAU8H,GAAY8I,EAAO7Q,OAAU+H,GAAY8I,EAAO5Q,MAC1F,MAAM,IAAI3C,UAAWiB,EAAQ,+FAAgGsS,IAE9H,IAAM5N,GAA2ByS,MAC1BnQ,GAAcmQ,IAAUA,EAAM3b,OAAS,GAC5C,MAAM,IAAIuD,UAAWiB,EAAQ,8GAA+GmX,IAI9I,IADA5K,EAAQ4K,EAAM3b,QAxEA,MA0Eb,MAAM,IAAI+X,WAAYvT,EAAQ,8FA1EjB,MA0E0HuM,IAExI,IAAM+uB,GAAgBnvB,GACrB,MAAM,IAAIpN,UAAWiB,EAAQ,mGAAoGmM,IAElI,GAAKI,EAAQ,GACZ,GAAKJ,EAAQ3Q,SAAW+Q,EACvB,MAAM,IAAIgH,WAAYvT,EAAQ,2IAA4IuM,EAAOJ,EAAQ3Q,aAEpL,IAAwB,IAAnB2Q,EAAQ3Q,OACnB,MAAM,IAAI+X,WAAY,yGAChB,GAAsB,IAAjBpH,EAAS,GACpB,MAAM,IAAIoH,WAAYvT,EAAQ,2FAA4FmM,EAAS,IACnI,CACD,IAAMnI,GAAsBqO,GAC3B,MAAM,IAAItT,UAAWiB,EAAQ,+EAAgFqS,IAE9G,IAAM4P,GAASlL,GACd,MAAM,IAAIhY,UAAWiB,EAAQ,2EAA4E+W,IAE1G,GAAKxK,EAAQ,ICnGd,SAAmCnI,EAAK+S,EAAOhL,EAASkG,GAEvD,IAAIe,EAAM+oB,GAAQhlB,EAAOhL,EAASkG,GAGlC,OAASe,EAAK,IAAO,GAAKA,EAAK,GAAMhP,CACtC,CD6FoBg4B,CAA0B9pB,EAAO9W,OAAQ2b,EAAOhL,EAASkG,IAAY8Q,GAAOhM,GAAU,EACxG,MAAM,IAAI3a,MAAO,8NAKlB,IAHA4N,EAAO,CAAA,GACF4b,KAAOkW,GACZ9xB,EAAKiyB,SAhGS,MAiGTn9B,UAAU1D,OAAS,IACvBuF,EExGF,SAAmBqJ,EAAMmL,GACxB,IAAIva,EACJ,IAAMmI,GAAUoS,GACf,OAAO,IAAIxW,UAAWiB,EAAQ,qEAAsEuV,IAErG,GAAKjT,EAAYiT,EAAS,UACzBnL,EAAK4b,KAAOzQ,EAAQyQ,MACd+V,GAAa3xB,EAAK4b,OACvB,OAAO,IAAIjnB,UAAWiB,EAAQ,uEAAwE,OAAQoK,EAAK4b,OAGrH,GAAK1jB,EAAYiT,EAAS,WAAc,CAEvC,GADAnL,EAAKkyB,QAAU/mB,EAAQ+mB,SACjB3rB,GAAmBvG,EAAKkyB,SAC7B,OAAO,IAAIv9B,UAAWiB,EAAQ,0FAA2F,UAAWoK,EAAKkyB,UAE1I,GAA6B,IAAxBlyB,EAAKkyB,QAAQ9gC,OACjB,OAAO,IAAIuD,UAAWiB,EAAQ,0FAA2F,UAAWoK,EAAKkyB,QAAQ3nB,KAAM,OAExJ,IAAM3Z,EAAI,EAAGA,EAAIoP,EAAKkyB,QAAQ9gC,OAAQR,IACrC,IAAM+gC,GAAa3xB,EAAKkyB,QAASthC,IAChC,OAAO,IAAI+D,UAAWiB,EAAQ,wEAAyEoK,EAAKkyB,QAASthC,KAGvHoP,EAAKkyB,QAAUlyB,EAAKkyB,QAAQz8B,OAC5B,CACD,OAAKyC,EAAYiT,EAAS,cACzBnL,EAAKiyB,SAAW9mB,EAAQ8mB,UAClB13B,GAAWyF,EAAKiyB,WACd,IAAIt9B,UAAWiB,EAAQ,+DAAgE,WAAYoK,EAAKiyB,WAG1G,IACR,CFuEQd,CAAUnxB,EAAMmL,GACjBxU,GACJ,MAAMA,EAiBR,OAdAoQ,KAAKoL,MAAQnS,EAAK4b,UACI,IAAjB5b,EAAKkyB,UACTlyB,EAAKkyB,QAAU,CAAEnrB,KAAKoL,QAEvBpL,KAAKqL,SAAWpS,EAAKkyB,QAGrBrgB,EAAK+F,GAAM7K,EAAO5K,GAClB2P,EAAK8F,GAAM7V,EAASI,GAAS,GAG7ByvB,GAAOl/B,KAAMqU,KAAMrF,EAAOwG,EAAQ2J,EAAIC,EAAI7J,EAAQ0E,GAClD5F,KAAKiK,OAAOG,SAAWnR,EAAKiyB,SAErBlrB,IAGR,CGnJA,SAASorB,KACR,IAGIvhC,EAHA+a,EAAI7W,UAEJs9B,EAAI,uBADAzmB,EAAG,GACsB,IAEjC,IAAM/a,EAAI,EAAGA,EAAI+a,EAAEva,OAAQR,IAC1BwhC,GAAK,UAAYC,mBAAoB1mB,EAAG/a,IAEzC,OAAOwhC,CACR,ECqBA,SAAkBv0B,EAAMy0B,GACvB,IAAI37B,EAAMw6B,GAAUtzB,GACpB,GAAKlH,EACJ,MAAMA,EAGP,GADAA,EAAMw6B,GAAUmB,GAEf,MAAM37B,EAEP,QAAoC,IAAxB27B,EAAU7gC,UACrB,MAAM,IAAIkD,UAAWiB,EAAQ,8GAA+G08B,EAAU7gC,YAGvJoM,EAAKpM,UAAY8gC,GAAcD,EAAU7gC,WAGzClB,EAAgBsN,EAAKpM,UAAW,cAAe,CAC9CgG,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASoN,GAIX,CJgGA20B,CAAStiB,GAAS0hB,IAclB54B,EAAakX,GAAS,OAAQ,WA0BnB1Y,EAAE0Y,GAAQze,UAAW,OKlLhC,WACC,IAAIiR,EACA+O,EACAS,EACAthB,EAEJ,GAAKkE,UAAU1D,SAAW2V,KAAKyJ,OAC9B,MAAM,IAAIrH,WAAYvT,EAAQ,sGAAuGmR,KAAKyJ,OAAQ1b,UAAU1D,SAI7J,IAFAsR,EAAMqE,KAAK0J,QACXyB,EAAInL,KAAKqL,SAAShhB,OACZR,EAAI,EAAGA,EAAIkE,UAAU1D,OAAQR,IAAM,CACxC,IAAM0I,GAAWxE,UAAWlE,IAC3B,MAAM,IAAI+D,UAAWiB,EAAQ,iFAAkFhF,EAAGkE,UAAWlE,KAE9H6gB,EAAMghB,GAAU39B,UAAWlE,GAAKmW,KAAK4J,OAAQ/f,GAAI,EAAGmW,KAAKqL,SAAUxhB,EAAEshB,IACrExP,GAAOqE,KAAK6J,SAAUhgB,GAAM6gB,CAC5B,CACD,OAAK1K,KAAK8J,WACF9J,KAAK8B,QAAQxR,IAAKqL,GAEnBqE,KAAK8B,QAASnG,EACtB,ILsLWlL,EAAE0Y,GAAQze,UAAW,QHvMhC,SAAeiR,GACd,GAAKqE,KAAKyJ,OAAS,EAAI,CACtB,IAAMlX,GAAWoJ,GAChB,MAAM,IAAI/N,UAAWiB,EAAQ,2DAA4D8M,IAG1F,OADAA,EAAM+vB,GAAU/vB,EAAKqE,KAAK6B,QAAQ,EAAG7B,KAAKoL,OACnCpgB,GAAKW,KAAMqU,KAAMrE,EACxB,CACD,OAAO3Q,GAAKW,KAAMqU,KACnB,IGiOWvP,EAAE0Y,GAAQze,UAAW,OM7OhC,WACC,IAAIiR,EACA+O,EACAS,EACAthB,EAEJ,GAAKmW,KAAKiK,OAAOG,SAChB,MAAM,IAAI/e,MAAO,0DAElB,GAAK0C,UAAU1D,SAAW2V,KAAKyJ,OAAO,EACrC,MAAM,IAAIrH,WAAYvT,EAAQ,sGAAuGmR,KAAKyJ,OAAQ1b,UAAU1D,SAI7J,IAFAsR,EAAMqE,KAAK0J,QACXyB,EAAInL,KAAKqL,SAAShhB,OACZR,EAAI,EAAGA,EAAIkE,UAAU1D,OAAO,EAAGR,IAAM,CAC1C,IAAM0I,GAAWxE,UAAWlE,IAC3B,MAAM,IAAI+D,UAAWiB,EAAQ,iFAAkFhF,EAAGkE,UAAWlE,KAE9H6gB,EAAMghB,GAAU39B,UAAWlE,GAAKmW,KAAK4J,OAAQ/f,GAAI,EAAGmW,KAAKqL,SAAUxhB,EAAEshB,IACrExP,GAAOqE,KAAK6J,SAAUhgB,GAAM6gB,CAC5B,CAMD,OALK1K,KAAK8J,WACT9J,KAAK8B,QAAQvR,IAAKxC,UAAWlE,GAAK8R,GAElCqE,KAAK8B,QAASnG,GAAQ5N,UAAWlE,GAE3BmW,IACR,INqPWvP,EAAE0Y,GAAQze,UAAW,QF3QhC,SAAeiR,EAAKlK,GACnB,GAAKuO,KAAKiK,OAAOG,SAChB,MAAM,IAAI/e,MAAO,0DAElB,GAAK2U,KAAKyJ,OAAS,EAAI,CACtB,IAAMlX,GAAWoJ,GAChB,MAAM,IAAI/N,UAAWiB,EAAQ,2DAA4D8M,IAE1FA,EAAM+vB,GAAU/vB,EAAKqE,KAAK6B,QAAQ,EAAG7B,KAAKoL,OAC1CpgB,GAAKW,KAAMqU,KAAMrE,EAAKlK,EACxB,MACEzG,GAAKW,KAAMqU,KAAMrE,GAElB,OAAOqE,IACR,ISIA,IAAI2rB,GAAW,CAAE,QAAS,SAAU,SA4NpC,SAASC,GAAQC,EAAMC,EAASC,EAASxd,EAAUnK,GAClD,IAAInL,EACAkM,EACAtb,EACJ,KAAQmW,gBAAgB4rB,IACvB,OAAK79B,UAAU1D,OAAS,EAChB,IAAIuhC,GAAQC,EAAMC,EAASC,EAASxd,GAErC,IAAIqd,GAAQC,EAAMC,EAASC,EAASxd,EAAUnK,GAEtD,IAAM/L,GAAYwzB,GACjB,MAAM,IAAIj+B,UAAWiB,GAAQ,SAAUg9B,IAExC,IAAMh2B,GAAci2B,GACnB,MAAM,IAAIl+B,UAAWiB,GAAQ,SAAUi9B,IAGxC,IADAA,EC7QD,SAAet5B,GACd,IAAI1I,EACAmJ,EACA3C,EACAzG,EAUJ,IAPAyG,EAAMohB,GAAelf,GAGrBS,EAAMT,EAAEnI,OAGRP,EAAM,GACAD,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBC,EAAI8E,KAAM0B,EAAKkC,EAAG3I,IAEnB,OAAOC,CACR,CD2PW+mB,CAAMib,GACVjiC,EAAI,EAAGA,EAAIiiC,EAAQzhC,OAAQR,IAAM,CAEtC,IACEgM,GAFFsP,EAAK2mB,EAASjiC,KAGbsb,EAAG9a,OAAS,IACX0mB,GAAS5L,EAAI+H,IAEd,MAAM,IAAItf,UAAWiB,GAAQ,oFAAqFi9B,IAEnHA,EAASjiC,GAAMw+B,GAAgBljB,EAC/B,CACD,IACEtP,GAAck2B,IACfA,EAAQ1hC,OAAS,IAChB0mB,GAASgb,EAAS7e,IAEnB,MAAM,IAAItf,UAAWiB,GAAQ,gFAAiFk9B,IAI/G,GAFAA,EAAU1D,GAAgB0D,IAEpB/5B,GAAUuc,GACf,MAAM,IAAI3gB,UAAWiB,GAAQ,SAAU0f,IAExC,IAAM8B,GAAwB9B,EAASyd,QACtC,MAAM,IAAIp+B,UAAWiB,GAAQ,+GAAgH0f,EAASyd,SAKvJ,GAHA/yB,EAAO,CACN2M,MAASuO,GAAS7jB,IAAK,UAEnBvC,UAAU1D,OAAS,EAAI,CAC3B,IAAMuO,GAAewL,GACpB,MAAM,IAAIxW,UAAWiB,GAAQ,SAAUuV,IAExC,GAAKjT,EAAYiT,EAAS,WACzBnL,EAAK2M,MAAQxB,EAAQwB,OACfkL,GAAS7X,EAAK2M,QACnB,MAAM,IAAIhY,UAAWiB,GAAQ,2EAA4E,QAASoK,EAAK2M,OAGzH,CAQD,OAPA5F,KAAKisB,MAAQJ,EACb7rB,KAAKksB,SAAWJ,EAChB9rB,KAAKmsB,SAAWJ,EAChB/rB,KAAKosB,UAAY,CAChBJ,OAAUzd,EAASyd,QAEpBhsB,KAAKqsB,MAAQpzB,EACN+G,IACR,QA2CA/N,EAAa25B,GAAOlhC,UAAW,YAAY,SAAmBsb,EAAOsmB,EAAQC,EAAQnoB,GACpF,IAAIooB,EACAX,EACA5yB,EACAgJ,EACArS,EACAqD,EACAoW,EACAxY,EACA/G,EAEAqb,EACA4F,EACAiZ,EACAyI,EACA5iC,EEjXuBH,EFmX3B,IAAM6J,GAA2ByS,KEjXf,iBAFStc,EFmXqCsc,IEhXrD,OAAVtc,GACiB,IAAjBA,EAAMW,QFgXN,MAAM,IAAIuD,UAAWiB,GAAQ,SAAUmX,IAGxC,GADA/M,EAAO,CAAA,EACFlL,UAAU1D,OAAS,IACvBuF,EG1WF,SAAmBqJ,EAAM8S,EAAQ3H,GAChC,OAAMpS,GAAUoS,GAGXjT,EAAYiT,EAAS,WACzBnL,EAAK0B,MAAQwlB,GAAY/b,EAAQzJ,QAC3B4P,GAAUwB,EAAQ9S,EAAK0B,QACrB,IAAI/M,UAAWiB,GAAQ,SAAU,QAAS2U,GAAMuI,EAAQ,QAAU3H,EAAQzJ,SAI9ExJ,EAAYiT,EAAS,WACzBnL,EAAK2M,MAAQxB,EAAQwB,OAEjBzU,EAAYiT,EAAS,UACzBnL,EAAK4b,KAAOzQ,EAAQyQ,MAEhB1jB,EAAYiT,EAAS,aACzBnL,EAAKkyB,QAAU/mB,EAAQ+mB,SAEnBh6B,EAAYiT,EAAS,cACzBnL,EAAKiyB,SAAW9mB,EAAQ8mB,UAElB,MArBC,IAAIt9B,UAAWiB,GAAQ,SAAUuV,GAsB1C,CHkVQgmB,CAAUnxB,EAAM+G,KAAKmsB,SAAU/nB,GAChCxU,GACJ,MAAMA,EAIR,IADA48B,EAvVD,SAAsBA,GACrB,IAAI1iC,EACAgO,EACAoT,EACArhB,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,IAE/BqhB,EAAI,CACHwhB,QAAU,EACVhjC,MAHDoO,EAAI00B,EAAQ3iC,GAIX8Q,MAAS,GACTS,MAAS,EACTwK,MAAS,IAELnc,EAAUqO,GACdoT,EAAEvQ,MAAQ,UACC8F,GAAe3I,GACJ,IAAjBA,EAAEgD,WACNoQ,EAAEvQ,MAAQ,YAEVuQ,EAAEvQ,MAAQ,aAEA2P,GAAexS,IAC1BoT,EAAEwhB,QAAS,EACXxhB,EAAEvQ,MAAQwlB,GAAYxN,GAAU7a,IAChCoT,EAAE9P,MAAQA,GAAOtD,GACjBoT,EAAEtF,MAAQmN,GAAUjb,IAEpBoT,EAAEvQ,MAAQ,UAEX7Q,EAAI8E,KAAMsc,GAEX,OAAOphB,CACR,CAoTU6iC,CAAa,CAAEL,EAAQC,IAC1B1iC,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,IAE/B,GADAsb,EAAKqnB,EAAQ3iC,GAAI8Q,OACX4P,GAAUvK,KAAKksB,SAAUriC,GAAKs2B,GAAYhb,IAC/C,MAAM,IAAIvX,UAAWiB,GAAQ,kGAAmG88B,GAAU9hC,EAAE,GAAK2Z,GAAMxD,KAAKksB,SAAUriC,GAAK,QAAUsb,IAuBvL,OApBAtU,EA9SD,SAA6B27B,GAC5B,IAAII,EACA90B,EACAjO,EAGJ,IADA+iC,EAAQ,EACF/iC,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,MAC/BiO,EAAI00B,EAAQ3iC,IACL6iC,QAAsB,IAAZ50B,EAAEsD,SAClBwxB,GAAS,GAGX,OAASA,IAAUJ,EAAOniC,MAC3B,CAiSOwiC,CAAoBL,GAEzBA,EADI37B,EArRN,SAA2B27B,GAC1B,IAAI10B,EACAjO,EAEJ,IAAMA,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,KAEb,KADlBiO,EAAI00B,EAAQ3iC,IACL6iC,SACN50B,EAAE40B,QAAS,EACX50B,EAAEpO,MAAQoO,EAAEpO,MAAM4G,MAClBwH,EAAEsD,MAAQ,EACVtD,EAAE8N,MAAQ,IAGZ,OAAO4mB,CACR,CAwQWM,CAAkBN,GArO7B,SAA8BxmB,EAAOwmB,GACpC,IAAInjB,EACAvR,EACAjO,EAGJ,IADAwf,EA/BD,SAAuBmjB,GACtB,IAAI10B,EACAjO,EACJ,IAAMA,EAAI,EAAGA,EAAI2iC,EAAOniC,SAIL,KAHlByN,EAAI00B,EAAQ3iC,IAGL6iC,OAJwB7iC,KAQhC,OAAOiO,EAAE8N,KACV,CAmBOmnB,CAAcP,GACd3iC,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,KAC/BiO,EAAI00B,EAAQ3iC,IACL6iC,QACN50B,EAAE40B,QAAS,EACX50B,EAAEpO,MAAQ0+B,GAAiBtwB,EAAEpO,MAAOoO,EAAE6C,MAAOqL,EAAOqD,GACpDvR,EAAE8N,MAAQyD,GAEVvR,EAAEpO,MAAQ0zB,GAAWtlB,EAAEpO,MAAOsc,GAE/BlO,EAAEsD,MAAQ4K,EAAM3b,OAEjB,OAAOmiC,CACR,CAqNWQ,CAAqBhnB,EAAOwmB,GAEtCxI,EAAKwI,EAAQ,GACbC,EAAKD,EAAQ,GACbX,EAAO7rB,KAAKisB,MACZ9mB,EAAKlM,EAAK0B,OAASsyB,GAAsBjJ,EAAGrpB,MAAO8xB,EAAG9xB,MAAOqF,KAAKosB,UAAUJ,QAE3E3iB,EADIpQ,EAAK2M,MACH3M,EAAK2M,MACA/U,EACLmP,KAAKqsB,MAAMzmB,MAGXoe,EAAGpe,MAIG,KADb3S,EAAM+e,GAAOhM,KAGU,IAAjBA,EAAM3b,SAGLoR,GADLwG,EAAMd,GAAQgE,EAAI,IAEXI,GAAgBJ,GAEhBrJ,GAAQqJ,IAEVlD,EAAK,EAAG4pB,EAAM7H,EAAGt6B,MAAO+iC,EAAG/iC,QAChCqhB,EAAK,CAAE,KAGP9I,EAAMd,GAAQgE,EAAIlS,GAClB8X,EAAKmH,GAAelM,EAAOqD,IAErB,IAAIF,GAAShE,EAAIlD,EAAK+D,EAAO+E,EAAI,EAAG1B,EAAKpQ,IAG5CpI,II/ZN,SAA0Bq8B,EAAIC,GAC7B,GAAKrhB,GAAkBohB,SAEhB,GAAKpf,GAAkBof,GAC7BA,EAAKziC,OAAQyiC,OACP,KAAKnf,GAAkBmf,GAG7B,OAAO,EAFPA,EAAKA,EAAGrgB,MAGR,CACD,GAAKf,GAAkBqhB,SAEhB,GAAKrf,GAAkBqf,GAC7BA,EAAK1iC,OAAQ0iC,OACP,KAAKpf,GAAkBof,GAG7B,OAAO,EAFPA,EAAKA,EAAGtgB,MAGR,CACD,OAASqgB,IAAOC,CACjB,CJ4YOC,CAAiBjoB,EAAI,WAIzBkoB,GAAgB,CADhBprB,EAAMd,GAAQgE,EAAIlS,IACO,CAAEA,GAAO,CAAE,GAAKq6B,GAHzCrrB,EKtbH,SAAmBhP,EAAKyP,EAAMD,GAC7B,IAAI3M,EACAjM,EAIJ,IADAiM,EAAM,GACAjM,EAAI,EAAGA,EAAIoJ,EAAKpJ,IACrBiM,EAAIlH,KAAM8T,EAAK/W,KAAM8W,EAAS5Y,IAE/B,OAAOiM,CACR,CL4aSy3B,CAAUt6B,EAAKq6B,GAMf,IAAInkB,GAAShE,EAAIlD,EAAK+D,EAD7B+E,EAAKmH,GAAelM,EAAOqD,GACa,EAAGA,EAAKpQ,KASjDnP,EAAM,IAAIqf,GAAShE,EAJnBlD,EAAMd,GAAQgE,EAAIlS,GAIU+S,EAD5B+E,EAAKmH,GAAelM,EAAOqD,GACY,EAAGA,EAAKpQ,GAG/CqB,GAAQ,CAAE0pB,EAAGt6B,MAAO+iC,EAAG/iC,MAAOI,GAAO+hC,GAE9B/hC,GAQP,SAASwjC,IACR,OAAOzB,EAAM7H,EAAGt6B,MAAO+iC,EAAG/iC,MAC1B,CACF,IAyCAuI,EAAa25B,GAAOlhC,UAAW,UAAU,SAAiB4hC,EAAQC,EAAQziC,GACzE,IAAI0iC,EACAgB,EACAC,EACApkB,EACAyB,EACAhT,EACAjO,EAEJ,IAAMygB,GAAexgB,GACpB,MAAM,IAAI8D,UAAWiB,GAAQ,gFAAiF/E,IAE/G,IM/fqC,IAA5B0D,GN+fQ1D,EM/fG,YNggBnB,MAAM,IAAIuB,MAAOwD,GAAO,WAKzB,GAHAic,EOvgBD,SAAgBtY,GACf,IAAI1I,EACAghB,EACA2R,EACA5yB,EAGJ,GAAkB,iBAAN2I,GAAwB,OAANA,EAC7B,MAAM,IAAI5E,UAAWiB,EAAQ,0DAA2D2D,IAGzF,IAAMqD,GADNiV,EAAKtY,EAAEwT,OAEN,MAAM,IAAIpY,UAAWiB,EAAQ,0DAA2D2D,IAIzF,IADA1I,EAAM,GACAD,EAAI,EAAGA,EAAIihB,EAAGzgB,OAAQR,IAAM,CAEjC,IAAMgJ,GADN4pB,EAAI3R,EAAIjhB,IAEP,MAAM,IAAI+D,UAAWiB,EAAQ,0DAA2D2D,IAEzF1I,EAAI8E,KAAM6tB,EACV,CACD,OAAO3yB,CACR,CP+eM4oB,CAAU5oB,GACfuf,EAAM0J,GAAUjpB,GAChB2jC,EAAM9a,GAAU7oB,IACVygB,GAAUvK,KAAKmsB,SAAUhM,GAAYsN,IAC1C,MAAM,IAAI7/B,UAAWiB,GAAQ,kGAAmG88B,GAAU,GAAKnoB,GAAMxD,KAAKmsB,SAAU,QAAUsB,IAG/K,IADAjB,EAAS,CAAEF,EAAQC,GACb1iC,EAAI,EAAGA,EAAI2iC,EAAOniC,OAAQR,IAAM,CAyBrC,GArBKJ,EAHLqO,EAAI00B,EAAQ3iC,IAMXiO,EAAIswB,GAAiBtwB,EADrB01B,EAAM,UACuB1iB,EAAIzB,GACtB5I,GAAe3I,GAO1BA,EAAIswB,GAAiBtwB,EALpB01B,EADqB,IAAjB11B,EAAEgD,WACA,YAEA,aAGsBgQ,EAAIzB,GACtBiB,GAAexS,IAE1B01B,EAAM7a,GAAU7a,GAChBA,EAAIslB,GAAWtlB,EAAGgT,IAIlBhT,EAAIswB,GAAiBtwB,EADrB01B,EAAM,UACuB1iB,EAAIzB,IAE5BkB,GAAUvK,KAAKksB,SAAUriC,GAAKs2B,GAAYqN,IAC/C,MAAM,IAAI5/B,UAAWiB,GAAQ,kGAAmG88B,GAAU9hC,GAAK2Z,GAAMxD,KAAKksB,SAAUriC,GAAK,QAAU2jC,IAEpLhB,EAAQ3iC,GAAMiO,CACd,CAKD,OAHA00B,EAAO59B,KAAM9E,GACbwQ,GAAQkyB,EAAQxsB,KAAKisB,OAEdniC,CACR","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,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,397,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,463,464,465,466,467,468,469,470,471,472,473,474,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519,520,521,522,523,524,525,526,527,528,529,530,531,532,533,534,535,536,537,538,539,540,541,542,543,544,545,546,547,548,549,550,551,552,553,554,555,556,557,558,559,560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591,592,593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,615,616,617,619,620,622,623,624,625]} \ No newline at end of file diff --git a/lib/index.js b/lib/index.js deleted file mode 100644 index 9ecec8f..0000000 --- a/lib/index.js +++ /dev/null @@ -1,79 +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'; - -/** -* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. -* -* @module @stdlib/random-tools-binary -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* var Random = require( '@stdlib/random-tools-binary' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); -* // returns -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var ndzeros = require( '@stdlib/ndarray-zeros' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* var Random = require( '@stdlib/random-tools-binary' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var out = ndzeros( [ 2, 2 ] ); -* var v = rand.assign( 0.0, 1.0, out ); -* // returns -* -* var bool = ( v === out ); -* // returns true -*/ - -// 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 0b0db1b..0000000 --- a/lib/main.js +++ /dev/null @@ -1,609 +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 no-restricted-syntax, no-invalid-this */ - -'use strict'; - -// MODULES // - -var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' ); -var isNonNegativeIntegerArray = require( '@stdlib/assert-is-nonnegative-integer-array' ).primitives; -var isEmptyCollection = require( '@stdlib/assert-is-empty-collection' ); -var isndarrayLike = require( '@stdlib/assert-is-ndarray-like' ); -var isNumber = require( '@stdlib/assert-is-number' ).isPrimitive; -var isFunction = require( '@stdlib/assert-is-function' ); -var isComplexLike = require( '@stdlib/assert-is-complex-like' ); -var isPlainObject = require( '@stdlib/assert-is-plain-object' ); -var isObject = require( '@stdlib/assert-is-object' ); -var isCollection = require( '@stdlib/assert-is-collection' ); -var isDataType = require( '@stdlib/ndarray-base-assert-is-data-type' ); -var isEqualDataType = require( '@stdlib/ndarray-base-assert-is-equal-data-type' ); -var isOutputDataTypePolicy = require( '@stdlib/ndarray-base-assert-is-output-data-type-policy' ); -var isReadOnly = require( '@stdlib/ndarray-base-assert-is-read-only' ); -var isOrder = require( '@stdlib/ndarray-base-assert-is-order' ); -var hasOwnProp = require( '@stdlib/assert-has-own-property' ); -var contains = require( '@stdlib/array-base-assert-contains' ); -var filledBy = require( '@stdlib/array-base-filled-by' ); -var everyBy = require( '@stdlib/array-base-every-by' ); -var join = require( '@stdlib/array-base-join' ); -var copy = require( '@stdlib/array-base-copy' ); -var nullaryStrided = require( '@stdlib/strided-base-nullary' ); -var binary = require( '@stdlib/ndarray-base-binary' ); -var broadcast = require( '@stdlib/ndarray-base-maybe-broadcast-array' ); -var broadcastScalar = require( '@stdlib/ndarray-base-broadcast-scalar' ); -var shape2strides = require( '@stdlib/ndarray-base-shape2strides' ); -var dtypes2strings = require( '@stdlib/ndarray-base-dtypes2strings' ); -var resolveStr = require( '@stdlib/ndarray-base-dtype-resolve-str' ); -var binaryOutputDataType = require( '@stdlib/ndarray-base-binary-output-dtype' ); -var numel = require( '@stdlib/ndarray-base-numel' ); -var buffer = require( '@stdlib/ndarray-base-buffer' ); -var getShape = require( '@stdlib/ndarray-shape' ); -var getDType = require( '@stdlib/ndarray-dtype' ); -var getOrder = require( '@stdlib/ndarray-order' ); -var ndims = require( '@stdlib/ndarray-ndims' ); -var ndarray = require( '@stdlib/ndarray-ctor' ); -var defaults = require( '@stdlib/ndarray-defaults' ); -var isAccessorArray = require( '@stdlib/array-base-assert-is-accessor-array' ); -var accessorSetter = require( '@stdlib/array-base-accessor-setter' ); -var setter = require( '@stdlib/array-base-setter' ); -var format = require( '@stdlib/string-format' ); -var validate = require( './validate.js' ); - - -// VARIABLES // - -var ORDINALS = [ 'First', 'Second', 'Third' ]; - - -// FUNCTIONS // - -/** -* Performs an initial scan of a list of parameters. -* -* @private -* @param {Array} params - list of parameters -* @returns {Array} scan results -*/ -function initialScan( params ) { - var out; - var p; - var o; - var i; - - out = []; - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - o = { - 'scalar': true, - 'value': p, - 'dtype': '', - 'ndims': 0, - 'order': '' - }; - if ( isNumber( p ) ) { - o.dtype = 'float64'; - } else if ( isComplexLike( p ) ) { - if ( p.byteLength === 8 ) { - o.dtype = 'complex64'; - } else { - o.dtype = 'complex128'; - } - } else if ( isndarrayLike( p ) ) { - o.scalar = false; - o.dtype = resolveStr( getDType( p ) ); - o.ndims = ndims( p ); - o.order = getOrder( p ); - } else { - o.dtype = 'generic'; - } - out.push( o ); - } - return out; -} - -/** -* Checks whether all parameters are scalar compatible. -* -* ## Notes -* -* - A parameter is scalar compatible if, and only if, the parameter value is either a zero-dimensional ndarray or already a scalar value. -* -* @private -* @param {Array} params - list of parameter objects -* @returns {boolean} boolean indicating whether all parameters are scalar compatible -*/ -function isScalarCompatible( params ) { - var count; - var p; - var i; - - count = 0; - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - if ( p.scalar || p.ndims === 0 ) { - count += 1; - } - } - return ( count === params.length ); -} - -/** -* Converts a list of parameters to scalar values. -* -* ## Notes -* -* - The function **mutates** the input array by updating parameter objects which do not already correspond to scalar parameter values. -* -* @private -* @param {Array} params - list of parameter objects -* @returns {Array} updated list -*/ -function convertToScalars( params ) { - var p; - var i; - - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - if ( p.scalar === false ) { - p.scalar = true; - p.value = p.value.get(); - p.ndims = 0; - p.order = ''; - } - } - return params; -} - -/** -* Resolves a common memory layout from a list of parameter objects. -* -* @private -* @param {Array} params - list of parameter objects -* @returns {string} memory layout -*/ -function resolveOrder( params ) { - var p; - var i; - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - - // For a binary parameter function, we simply return the layout of the first parameter having a layout, as there is no clear rationale for picking the layout of one parameter over another and picking the first one we find is as good a rationale as any other... - if ( p.scalar === false ) { - break; - } - } - return p.order; -} - -/** -* Broadcasts parameter values to an ndarray having a specified shape. -* -* ## Notes -* -* - The function **mutates** the input array. -* -* @private -* @param {NonNegativeIntegerArray} shape - array shape -* @param {Array} params - list of parameter objects -* @returns {Array} updated list -*/ -function broadcastParameters( shape, params ) { - var ord; - var p; - var i; - - ord = resolveOrder( params ); - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - if ( p.scalar ) { - p.scalar = false; - p.value = broadcastScalar( p.value, p.dtype, shape, ord ); - p.order = ord; - } else { - p.value = broadcast( p.value, shape ); // delegate to `broadcast` to ensure broadcast compatibility - } - p.ndims = shape.length; - } - return params; -} - - -// MAIN // - -/** -* Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG. -* -* @constructor -* @param {Function} prng - binary pseudorandom value generator -* @param {ArrayLikeObject} idtypes - list containing a list of supported input data types for each PRNG parameter -* @param {ArrayLikeObject} odtypes - list of supported output data types -* @param {Object} policies - policies -* @param {string} policies.output - output data type policy -* @param {Object} [options] - function options -* @param {string} [options.order] - default memory layout -* @throws {TypeError} first argument must be a function -* @throws {TypeError} second argument must be an array containing arrays of supported data types -* @throws {TypeError} third argument must be an array of supported data types -* @throws {TypeError} fourth argument must be an object having supported policies -* @throws {TypeError} options argument must be an object -* @throws {TypeError} must provide valid options -* @returns {Random} instance -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); -* // returns -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var ndzeros = require( '@stdlib/ndarray-zeros' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var out = ndzeros( [ 2, 2 ] ); -* var v = rand.assign( 0.0, 1.0, out ); -* // returns -* -* var bool = ( v === out ); -* // returns true -*/ -function Random( prng, idtypes, odtypes, policies, options ) { - var opts; - var dt; - var i; - if ( !( this instanceof Random ) ) { - if ( arguments.length < 5 ) { - return new Random( prng, idtypes, odtypes, policies ); - } - return new Random( prng, idtypes, odtypes, policies, options ); - } - if ( !isFunction( prng ) ) { - throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', prng ) ); - } - if ( !isCollection( idtypes ) ) { - throw new TypeError( format( 'invalid argument. Second argument must be an array-like object. Value: `%s`.', idtypes ) ); - } - idtypes = copy( idtypes ); - for ( i = 0; i < idtypes.length; i++ ) { - dt = idtypes[ i ]; - if ( - !isCollection( dt ) || - dt.length < 1 || - !everyBy( dt, isDataType ) - ) { - throw new TypeError( format( 'invalid argument. Second argument must contain arrays of data types. Value: `%s`.', idtypes ) ); - } - idtypes[ i ] = dtypes2strings( dt ); - } - if ( - !isCollection( odtypes ) || - odtypes.length < 1 || - !everyBy( odtypes, isDataType ) - ) { - throw new TypeError( format( 'invalid argument. Third argument must be an array of data types. Value: `%s`.', odtypes ) ); - } - odtypes = dtypes2strings( odtypes ); - - if ( !isObject( policies ) ) { - throw new TypeError( format( 'invalid argument. Fourth argument must be an object. Value: `%s`.', policies ) ); - } - if ( !isOutputDataTypePolicy( policies.output ) ) { - throw new TypeError( format( 'invalid argument. Fourth argument must be an object having a supported output data type policy. Value: `%s`.', policies.output ) ); - } - opts = { - 'order': defaults.get( 'order' ) - }; - if ( arguments.length > 4 ) { - if ( !isPlainObject( options ) ) { - throw new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) ); - } - if ( hasOwnProp( options, 'order' ) ) { - opts.order = options.order; - if ( !isOrder( opts.order ) ) { - throw new TypeError( format( 'invalid option. `%s` option must be a valid memory layout. Option: `%s`.', 'order', opts.order ) ); - } - } - } - this._prng = prng; - this._idtypes = idtypes; - this._odtypes = odtypes; - this._policies = { - 'output': policies.output - }; - this._opts = opts; - return this; -} - -/** -* Returns an ndarray filled with pseudorandom values drawn from a binary PRNG. -* -* @name generate -* @memberof Random.prototype -* @type {Function} -* @param {NonNegativeIntegerArray} shape - output shape -* @param {(ndarrayLike|*)} param1 - first PRNG parameter -* @param {(ndarrayLike|*)} param2 - second PRNG parameter -* @param {Options} [options] - function options -* @param {*} [options.dtype] - output ndarray data type -* @param {string} [options.order] - memory layout (either row-major or column-major) -* @param {string} [options.mode] - specifies how to handle indices which exceed ndarray dimensions -* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed ndarray dimensions on a per dimension basis -* @param {boolean} [options.readonly] - boolean indicating whether an ndarray should be read-only -* @throws {TypeError} first argument must be a valid shape -* @throws {TypeError} must provide valid PRNG parameters -* @throws {TypeError} PRNG parameters and the desired shape must be broadcast compatible -* @throws {TypeError} options argument must be an object -* @throws {TypeError} must provide valid options -* @returns {ndarray} output ndarray -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var v = rand.generate( [ 2, 2 ], 0.0, 1.0 ); -* // returns -*/ -setReadOnly( Random.prototype, 'generate', function generate( shape, param1, param2, options ) { - var params; - var prng; - var opts; - var buf; - var err; - var len; - var ord; - var FLG; - var out; - var set; - var dt; - var st; - var p1; - var p2; - var i; - - if ( !isNonNegativeIntegerArray( shape ) && !isEmptyCollection( shape ) ) { - throw new TypeError( format( 'invalid argument. First argument must be an array-like object containing nonnegative integers. Value: `%s`.', shape ) ); - } - opts = {}; - if ( arguments.length > 3 ) { - err = validate( opts, this._odtypes, options ); - if ( err ) { - throw err; - } - } - params = initialScan( [ param1, param2 ] ); - for ( i = 0; i < params.length; i++ ) { - dt = params[ i ].dtype; - if ( !contains( this._idtypes[ i ], resolveStr( dt ) ) ) { - throw new TypeError( format( 'invalid argument. %s argument must have one of the following data types: "%s". Data type: `%s`.', ORDINALS[ i+1 ], join( this._idtypes[ i ], '", "' ), dt ) ); - } - } - FLG = isScalarCompatible( params ); - if ( FLG ) { - params = convertToScalars( params ); - } else { - params = broadcastParameters( shape, params ); - } - p1 = params[ 0 ]; - p2 = params[ 1 ]; - prng = this._prng; - dt = opts.dtype || binaryOutputDataType( p1.dtype, p2.dtype, this._policies.output ); // eslint-disable-line max-len - if ( opts.order ) { - ord = opts.order; - } else if ( FLG ) { - ord = this._opts.order; - } else { - // If we don't have any explicit order info, use the order of the first parameter, as no clear rationale for choosing the order of one parameter over another: - ord = p1.order; - } - // Handles special cases involving (1) zero-dimensional output ndarrays and (2) shapes having at least one dimension of size zero... - len = numel( shape ); - if ( len === 0 ) { - // Check for a zero-dimensional shape... - if ( shape.length === 0 ) { - // If the output array is a zero-dimensional ndarray, we generate a single random variate... - buf = buffer( dt, 1 ); - if ( isAccessorArray( buf ) ) { - set = accessorSetter( dt ); - } else { - set = setter( dt ); - } - set( buf, 0, prng( p1.value, p2.value ) ); - st = [ 0 ]; - } else { - // If the output array has one or more dimensions of size zero, we avoid allocating any memory, and instead return an empty ndarray... - buf = buffer( dt, len ); - st = shape2strides( shape, ord ); - } - return new ndarray( dt, buf, shape, st, 0, ord, opts ); - } - // If provided scalar PRNG parameters, we can simply fill a linear buffer with pseudorandom values (as all pseudorandom values are drawn from the same PRNG) and then wrap as an ndarray... - if ( FLG ) { - if ( isEqualDataType( dt, 'generic' ) ) { - buf = filledBy( len, wrapper ); - } else { - buf = buffer( dt, len ); - nullaryStrided( [ buf ], [ len ], [ 1 ], wrapper ); - } - st = shape2strides( shape, ord ); - return new ndarray( dt, buf, shape, st, 0, ord, opts ); - } - // We've been provided ndarrays, so we need to perform element-wise iteration... - - // Allocate a data buffer: - buf = buffer( dt, len ); - - // Initialize the output array: - st = shape2strides( shape, ord ); - out = new ndarray( dt, buf, shape, st, 0, ord, opts ); - - // Fill the output array with pseudorandom values: - binary( [ p1.value, p2.value, out ], prng ); - - return out; - - /** - * Applies parameters to a pseudorandom number generator function. - * - * @private - * @returns {(number|ComplexLike)} pseudorandom number - */ - function wrapper() { - return prng( p1.value, p2.value ); - } -}); - -/** -* Fills an ndarray with pseudorandom values drawn from a binary PRNG. -* -* @name assign -* @memberof Random.prototype -* @type {Function} -* @param {(ndarrayLike|*)} param1 - first PRNG parameter -* @param {(ndarrayLike|*)} param2 - second PRNG parameter -* @param {ndarrayLike} out - output ndarray -* @throws {TypeError} third argument must be an ndarray -* @throws {TypeError} must provide valid PRNG parameters -* @throws {TypeError} PRNG parameters and the output ndarray must be broadcast compatible -* @throws {Error} cannot write to a read-only ndarray -* @returns {ndarray} output ndarray -* -* @example -* var dtypes = require( '@stdlib/ndarray-dtypes' ); -* var ndzeros = require( '@stdlib/ndarray-zeros' ); -* var uniform = require( '@stdlib/random-base-uniform' ); -* -* var idt = dtypes( 'real_and_generic' ); -* var odt = dtypes( 'real_floating_point_and_generic' ); -* -* var policies = { -* 'output': 'real_floating_point_and_generic' -* }; -* var options = { -* 'order': 'row-major' -* }; -* -* var rand = new Random( uniform, [ idt, idt ], odt, policies, options ); -* -* var out = ndzeros( [ 2, 2 ] ); -* var v = rand.assign( 0.0, 1.0, out ); -* // returns -* -* var bool = ( v === out ); -* // returns true -*/ -setReadOnly( Random.prototype, 'assign', function assign( param1, param2, out ) { - var params; - var pdt; - var odt; - var ord; - var sh; - var p; - var i; - - if ( !isndarrayLike( out ) ) { - throw new TypeError( format( 'invalid argument. Third argument must be an ndarray-like object. Value: `%s`.', out ) ); - } - if ( isReadOnly( out ) ) { - throw new Error( 'invalid argument. The output ndarray must be writable. Cannot write to a read-only ndarray.' ); - } - sh = getShape( out ); - ord = getOrder( out ); - odt = getDType( out ); - if ( !contains( this._odtypes, resolveStr( odt ) ) ) { - throw new TypeError( format( 'invalid argument. %s argument must have one of the following data types: "%s". Data type: `%s`.', ORDINALS[ 2 ], join( this._odtypes, '", "' ), odt ) ); - } - params = [ param1, param2 ]; - for ( i = 0; i < params.length; i++ ) { - p = params[ i ]; - - // Check whether we've been provided a scalar PRNG parameter... - if ( isNumber( p ) ) { - // Wrap the scalar in a broadcasted ndarray: - pdt = 'float64'; - p = broadcastScalar( p, pdt, sh, ord ); - } else if ( isComplexLike( p ) ) { - if ( p.byteLength === 8 ) { - pdt = 'complex64'; - } else { - pdt = 'complex128'; - } - // Wrap the scalar in a broadcasted ndarray: - p = broadcastScalar( p, pdt, sh, ord ); - } else if ( isndarrayLike( p ) ) { - // Broadcast the PRNG parameter to the desired shape: - pdt = getDType( p ); - p = broadcast( p, sh ); // delegate to `broadcast` to ensure broadcast compatibility - } else { - // Wrap the scalar in a broadcasted ndarray: - pdt = 'generic'; - p = broadcastScalar( p, pdt, sh, ord ); - } - if ( !contains( this._idtypes[ i ], resolveStr( pdt ) ) ) { - throw new TypeError( format( 'invalid argument. %s argument must have one of the following data types: "%s". Data type: `%s`.', ORDINALS[ i ], join( this._idtypes[ i ], '", "' ), pdt ) ); - } - params[ i ] = p; - } - // Fill the output array with pseudorandom values: - params.push( out ); - binary( params, this._prng ); - - return out; -}); - - -// EXPORTS // - -module.exports = Random; diff --git a/lib/validate.js b/lib/validate.js deleted file mode 100644 index 6ed34d2..0000000 --- a/lib/validate.js +++ /dev/null @@ -1,88 +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 isObject = require( '@stdlib/assert-is-plain-object' ); -var hasOwnProp = require( '@stdlib/assert-has-own-property' ); -var contains = require( '@stdlib/array-base-assert-contains' ); -var join = require( '@stdlib/array-base-join' ); -var resolveStr = require( '@stdlib/ndarray-base-dtype-resolve-str' ); -var format = require( '@stdlib/string-format' ); - - -// MAIN // - -/** -* Validates function options. -* -* @private -* @param {Object} opts - destination object -* @param {Array} dtypes - list of supported output data types -* @param {Options} options - function options -* @param {*} [options.dtype] - array data type -* @param {string} [options.order] - memory layout (either row-major or column-major) -* @param {string} [options.mode] - specifies how to handle indices which exceed array dimensions -* @param {ArrayLikeObject} [options.submode] - specifies how to handle subscripts which exceed array dimensions on a per dimension basis -* @param {boolean} [options.readonly] - boolean indicating whether an array should be read-only -* @returns {(Error|null)} null or an error object -* -* @example -* var opts = {}; -* var dtypes = [ 'float64', 'float32', 'generic' ]; -* -* var options = { -* 'dtype': 'float64' -* }; -* var err = validate( opts, dtypes, options ); -* if ( err ) { -* throw err; -* } -*/ -function validate( opts, dtypes, options ) { - if ( !isObject( options ) ) { - return new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) ); - } - if ( hasOwnProp( options, 'dtype' ) ) { - opts.dtype = resolveStr( options.dtype ); - if ( !contains( dtypes, opts.dtype ) ) { - return new TypeError( format( 'invalid option. `%s` option must be one of the following: "%s". Option: `%s`.', 'dtype', join( dtypes, '", "' ), options.dtype ) ); - } - } - // Pass-through options... - if ( hasOwnProp( options, 'order' ) ) { - opts.order = options.order; - } - if ( hasOwnProp( options, 'mode' ) ) { - opts.mode = options.mode; - } - if ( hasOwnProp( options, 'submode' ) ) { - opts.submode = options.submode; - } - if ( hasOwnProp( options, 'readonly' ) ) { - opts.readonly = options.readonly; - } - return null; -} - - -// EXPORTS // - -module.exports = validate; diff --git a/package.json b/package.json index 02f652f..3284342 100644 --- a/package.json +++ b/package.json @@ -3,31 +3,7 @@ "version": "0.1.1", "description": "Constructor for creating ndarrays filled with pseudorandom values drawn from a binary PRNG.", "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,78 +12,6 @@ "bugs": { "url": "https://github.com/stdlib-js/stdlib/issues" }, - "dependencies": { - "@stdlib/array-base-accessor-setter": "^0.2.3", - "@stdlib/array-base-assert-contains": "^0.2.3", - "@stdlib/array-base-assert-is-accessor-array": "^0.2.3", - "@stdlib/array-base-copy": "^0.2.3", - "@stdlib/array-base-every-by": "^0.2.3", - "@stdlib/array-base-filled-by": "^0.2.3", - "@stdlib/array-base-join": "^0.1.2", - "@stdlib/array-base-setter": "^0.2.3", - "@stdlib/assert-has-own-property": "^0.2.3", - "@stdlib/assert-is-collection": "^0.2.3", - "@stdlib/assert-is-complex-like": "^0.2.4", - "@stdlib/assert-is-empty-collection": "^0.2.4", - "@stdlib/assert-is-function": "^0.2.3", - "@stdlib/assert-is-ndarray-like": "^0.2.3", - "@stdlib/assert-is-nonnegative-integer-array": "^0.2.3", - "@stdlib/assert-is-number": "^0.2.3", - "@stdlib/assert-is-object": "^0.2.3", - "@stdlib/assert-is-plain-object": "^0.2.3", - "@stdlib/ndarray-base-assert-is-data-type": "^0.2.3", - "@stdlib/ndarray-base-assert-is-equal-data-type": "^0.1.1", - "@stdlib/ndarray-base-assert-is-order": "^0.2.3", - "@stdlib/ndarray-base-assert-is-output-data-type-policy": "^0.1.1", - "@stdlib/ndarray-base-assert-is-read-only": "^0.2.3", - "@stdlib/ndarray-base-binary": "^0.1.1", - "@stdlib/ndarray-base-binary-output-dtype": "^0.1.1", - "@stdlib/ndarray-base-broadcast-scalar": "^0.2.4", - "@stdlib/ndarray-base-buffer": "^0.3.1", - "@stdlib/ndarray-base-dtype-resolve-str": "^0.3.1", - "@stdlib/ndarray-base-dtypes2strings": "^0.1.1", - "@stdlib/ndarray-base-maybe-broadcast-array": "^0.2.5", - "@stdlib/ndarray-base-numel": "^0.2.3", - "@stdlib/ndarray-base-shape2strides": "^0.2.3", - "@stdlib/ndarray-ctor": "^0.3.1", - "@stdlib/ndarray-defaults": "^0.4.1", - "@stdlib/ndarray-dtype": "^0.2.3", - "@stdlib/ndarray-ndims": "^0.2.3", - "@stdlib/ndarray-order": "^0.2.3", - "@stdlib/ndarray-shape": "^0.2.3", - "@stdlib/strided-base-nullary": "^0.3.1", - "@stdlib/string-format": "^0.2.3", - "@stdlib/types": "^0.5.1", - "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.3", - "@stdlib/error-tools-fmtprodmsg": "^0.2.3" - }, - "devDependencies": { - "@stdlib/math-base-assert-is-nan": "^0.2.3", - "@stdlib/math-base-special-pow": "^0.3.1", - "@stdlib/ndarray-dtypes": "^0.4.1", - "@stdlib/ndarray-to-array": "^0.2.2", - "@stdlib/ndarray-zeros": "^0.3.1", - "@stdlib/random-base-uniform": "^0.2.3", - "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", "stdmath", diff --git a/stats_browser.html b/stats_browser.html new file mode 100644 index 0000000..b9ce61d --- /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..3fd576e --- /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.js b/test/test.js deleted file mode 100644 index d13b709..0000000 --- a/test/test.js +++ /dev/null @@ -1,35 +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 Random = require( './../lib' ); - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof Random, 'function', 'main export is a function' ); - t.end(); -}); - -// FIXME: add tests diff --git a/test/test.validate.js b/test/test.validate.js deleted file mode 100644 index d83a636..0000000 --- a/test/test.validate.js +++ /dev/null @@ -1,199 +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 validate = require( './../lib/validate.js' ); - - -// VARIABLES // - -var DTYPES = [ - 'float64', - 'float32', - 'generic' -]; - - -// TESTS // - -tape( 'main export is a function', function test( t ) { - t.ok( true, __filename ); - t.strictEqual( typeof validate, 'function', 'main export is a function' ); - t.end(); -}); - -tape( 'the function returns an error if provided an options argument which is not an object', function test( t ) { - var values; - var err; - var i; - - values = [ - '5', - 5, - NaN, - true, - false, - void 0, - null, - [], - function noop() {} - ]; - - for ( i = 0; i < values.length; i++ ) { - err = validate( {}, DTYPES, values[ i ] ); - t.strictEqual( err instanceof TypeError, true, 'returns a type error when provided '+values[i] ); - } - t.end(); -}); - -tape( 'the function returns an error if provided a `dtype` option which is not a supported data type', function test( t ) { - var values; - var err; - var i; - - values = [ - '5', - 'foo', - NaN, - true, - false, - void 0, - null, - [], - {}, - function noop() {} - ]; - - for ( i = 0; i < values.length; i++ ) { - err = validate( {}, DTYPES, { - 'dtype': values[ i ] - }); - t.strictEqual( err instanceof TypeError, true, 'returns a type error when provided '+values[i] ); - } - t.end(); -}); - -tape( 'the function supports the `order` array creation option', function test( t ) { - var options; - var opts; - var err; - - options = { - 'order': 'row-major' - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, options, 'returns expected value' ); - - t.end(); -}); - -tape( 'the function supports the `mode` array creation option', function test( t ) { - var options; - var opts; - var err; - - options = { - 'mode': 'throw' - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, options, 'returns expected value' ); - - t.end(); -}); - -tape( 'the function supports the `submode` array creation option', function test( t ) { - var options; - var opts; - var err; - - options = { - 'submode': [ 'throw' ] - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, options, 'returns expected value' ); - - t.end(); -}); - -tape( 'the function supports the `readonly` array creation option', function test( t ) { - var options; - var opts; - var err; - - options = { - 'readonly': true - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, options, 'returns expected value' ); - - t.end(); -}); - -tape( 'the function returns null if all options are valid', function test( t ) { - var options; - var opts; - var err; - - options = { - 'dtype': 'float64', - 'order': 'row-major', - 'mode': 'throw', - 'submode': [ 'throw' ], - 'readonly': true - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, options, 'returns expected value' ); - - t.end(); -}); - -tape( 'the function ignores unrecognized/unsupported options', function test( t ) { - var options; - var opts; - var err; - - options = { - 'beep': true, - 'boop': 'bop' - }; - opts = {}; - err = validate( opts, DTYPES, options ); - - t.strictEqual( err, null, 'returns expected value' ); - t.deepEqual( opts, {}, 'does not set any option values' ); - t.end(); -});