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 <http://editorconfig.org/>).
-
-# 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 310b4a9..0000000
--- a/.github/.keepalive
+++ /dev/null
@@ -1 +0,0 @@
-2026-08-17T03:09:46.152Z
diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md
deleted file mode 100644
index d599315..0000000
--- a/.github/PULL_REQUEST_TEMPLATE.md
+++ /dev/null
@@ -1,7 +0,0 @@
-<!-- ----------^ Click "Preview"! -->
-
-We are excited about your pull request, but unfortunately we are not accepting pull requests against this repository, as all development happens on the [main project repository](https://github.com/stdlib-js/stdlib). We kindly request that you submit this pull request against the [respective directory](https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/some) 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 17d9f03..0000000
--- a/.github/workflows/close_pull_requests.yml
+++ /dev/null
@@ -1,54 +0,0 @@
-#/
-# @license Apache-2.0
-#
-# Copyright (c) 2021 The Stdlib Authors.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#    http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-#/
-
-# Workflow name:
-name: close_pull_requests
-
-# Workflow triggers:
-on:
-  pull_request_target:
-    types: [opened]
-
-# Workflow jobs:
-jobs:
-
-  # Define job to close all pull requests:
-  run:
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define the sequence of job steps...
-    steps:
-
-      # Close pull request
-      - name: 'Close pull request'
-        # Pin action to full length commit SHA corresponding to v3.1.2
-        uses: superbrothers/close-pull-request@9c18513d320d7b2c7185fb93396d0c664d5d8448
-        with:
-          comment: |
-            Thank you for submitting a pull request. :raised_hands:
-            
-            We greatly appreciate your willingness to submit a contribution. However, we are not accepting pull requests against this repository, as all development happens on the [main project repository](https://github.com/stdlib-js/stdlib).
-            
-            We kindly request that you submit this pull request against the [respective directory](https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/some) 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 861f214..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: '<minutes> <hours> <day_of_month> <month> <day_of_week>'
-    - cron: '58 22 * * 4'
-
-  # 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/\/\/\/ <reference types=\"@stdlib\/types\"\/>/\/\/\/ <reference types=\"https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js\/types@main\/index.d.ts\"\/>/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 class=\"installation\">[^<]+<\/section>//g;"
-          find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"cli\">[\s\S]+<\!\-\- \/.cli \-\->//g"
-          find ./deno -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"c\">[\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 class=\"installation\">[^<]+<\/section>//g;"
-          find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"cli\">[\s\S]+<\!\-\- \/.cli \-\->//g"
-          find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"c\">[\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<script type=\"text\/javascript\" src=\"https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js\/\3\@umd\/browser.js\"><\/script>\n\`\`\`\n\nIf no recognized module system is present, access bundle contents via the global scope:\n\n\`\`\`html\n<script type=\"text\/javascript\">\n    window.\2;\n<\/script>\n\`\`\`/"
-
-          # Rewrite examples section to be a HTML file:
-          find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/\#\# Examples([\s\S]*)\`\`\`javascript([\s\S]+?)\`\`\`/\#\# Examples\1\`\`\`html\n<\!DOCTYPE html>\n<html lang=\"en\">\n<body>\n<script type=\"text\/javascript\">\2\n<\/script>\n<\/body>\n<\/html>\n\`\`\`/"
-
-          # Rewrite all `require()`s in the examples section as `script` tags loading the respective UMD bundle:
-          find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "1 while s/<script type=\"text\/javascript\">\n(var|let|const)\s+([a-zA-Z0-9_]+)\s+=\s*require\( '\@stdlib\/([^']+)' \);?/<script type=\"text\/javascript\" src=\"https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js\/\3\@umd\/browser.js\"><\/script>\n<script type=\"text\/javascript\">/g"
-
-          # Wrap contents of `<script type="text/javascript">` tag contents in an IIFE:
-          find ./umd -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/<script type=\"text\/javascript\">([\s\S]+?)<\/script>/<script type=\"text\/javascript\">\n\(function \(\) {\1}\)\(\);\n<\/script>/g"
-
-          # Create package.json file for umd branch:
-          jq --indent 2 '{"name": .name, "version": .version, "description": .description, "license": .license, "main": "./index.js", "homepage": .homepage, "repository": .repository, "bugs": .bugs, "keywords": .keywords, "funding": .funding}' package.json > ./umd/package.json
-
-      # Delete everything in current directory aside from umd folder:
-      - name: 'Delete everything in current directory aside from umd folder'
-        run: |
-          find . -type 'f' | grep -v -e "umd" -e ".git/" | xargs -r rm
-          find . -mindepth 1 -type 'd' | grep -v -e "umd" -e ".git" | xargs -r rm -rf
-
-      # Move umd directory to root:
-      - name: 'Move umd directory to root'
-        run: |
-          mv ./umd/* .
-          rmdir ./umd
-
-      # Commit changes:
-      - name: 'Commit changes'
-        run: |
-          git add -A
-          git commit -m "Auto-generated commit"
-
-      # Push changes to `umd` branch:
-      - name: 'Push changes to `umd` branch'
-        run: |
-          SLUG=${{ github.repository }}
-          echo "Pushing changes to $SLUG..."
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" umd
-
-      # 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 ES module build...
-  esm:
-
-    # Define display name:
-    name: 'Create ES module build'
-
-    # 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 `esm` branch exists:
-      - name: 'Check if remote `esm` branch exists'
-        id: esm-branch-exists
-        continue-on-error: true
-        run: |
-          git fetch --all
-          git ls-remote --exit-code --heads origin esm
-          if [ $? -eq 0 ]; then
-            echo "remote-exists=true" >> $GITHUB_OUTPUT
-          else
-            echo "remote-exists=false" >> $GITHUB_OUTPUT
-          fi
-
-      # If `esm` exists, delete everything in branch and merge `production` into it
-      - name: 'If `esm` exists, delete everything in branch and merge `production` into it'
-        if: steps.esm-branch-exists.outputs.remote-exists
-        run: |
-          git checkout -b esm origin/esm
-
-          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 `esm` does not exist, create `esm` branch:
-      - name: 'If `esm` does not exist, create `esm` branch'
-        if: ${{ steps.esm-branch-exists.outputs.remote-exists == false }}
-        run: |
-          git checkout production
-          git checkout -b esm
-
-      # Copy files to esm directory:
-      - name: 'Copy files to esm directory'
-        run: |
-          mkdir -p esm
-          cp README.md LICENSE CONTRIBUTORS NOTICE ./esm
-
-          # Copy TypeScript definitions to esm directory:
-          if [ -e ./docs/types/index.d.ts ]; then
-            cp ./docs/types/index.d.ts ./esm/index.d.ts
-          fi
-          if [ -d index.d.ts ]; then
-            cp index.d.ts ./esm/index.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
-
-      # Create ES Module (ESM) bundle:
-      - name: 'Create ES Module (ESM) bundle'
-        id: esm-bundle
-        uses: stdlib-js/bundle-action@main
-        with:
-          target: 'esm'
-
-      # Rewrite file contents:
-      - name: 'Rewrite file contents'
-        run: |
-
-          # Replace links to other packages with links to the esm branch:
-          find ./esm -type f -name '*.md' -print0 | xargs -0 sed -Ei "/\/tree\/main/b; /^\[@stdlib[^:]+: https:\/\/github.com\/stdlib-js\// s/(.*)/\\1\/tree\/esm/";
-
-          # Replace reference to `@stdlib/types` with esm link:
-          find ./esm -type f -name '*.ts' -print0 | xargs -0 -r sed -Ei "s/\/\/\/ <reference types=\"@stdlib\/types\"\/>/\/\/\/ <reference types=\"https:\/\/cdn.jsdelivr.net\/gh\/stdlib-js\/types@esm\/index.d.ts\"\/>/g"
-
-          # Change wording of project description to avoid reference to JavaScript and Node.js:
-          find ./esm -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 ./esm -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/';/@esm\/index.mjs';/
-          }"
-
-          # 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 ./esm -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 ./esm -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/<section class=\"installation\">[^<]+<\/section>//g;"
-          find ./esm -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"cli\">[\s\S]+<\!\-\- \/.cli \-\->//g"
-          find ./esm -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"c\">[\s\S]+<\!\-\- \/.c \-\->//g"
-
-          # Rewrite examples section to be a HTML file:
-          find ./esm -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/\#\# Examples([\s\S]*)\`\`\`javascript([\s\S]+?)\`\`\`/\#\# Examples\1\`\`\`html\n<\!DOCTYPE html>\n<html lang=\"en\">\n<body>\n<script type=\"module\">\n\2\n<\/script>\n<\/body>\n<\/html>\n\`\`\`/g"
-
-          # Create package.json file for esm branch:
-          jq --indent 2 '{"name": .name, "version": .version, "description": .description, "license": .license, "type": "module", "main": "./index.mjs", "homepage": .homepage, "repository": .repository, "bugs": .bugs, "keywords": .keywords, "funding": .funding}' package.json > ./esm/package.json
-
-      # Delete everything in current directory aside from esm folder:
-      - name: 'Delete everything in current directory aside from esm folder'
-        run: |
-          find . -type 'f' | grep -v -e "esm" -e ".git/" | xargs -r rm
-          find . -mindepth 1 -type 'd' | grep -v -e "esm" -e ".git" | xargs -r rm -rf
-
-      # Move esm directory to root:
-      - name: 'Move esm directory to root'
-        run: |
-          mv ./esm/* .
-          rmdir ./esm
-
-      # Commit changes:
-      - name: 'Commit changes'
-        run: |
-          git add -A
-          git commit -m "Auto-generated commit"
-
-      # Push changes to `esm` branch:
-      - name: 'Push changes to `esm` branch'
-        run: |
-          SLUG=${{ github.repository }}
-          echo "Pushing changes to $SLUG..."
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" esm
-
-      # 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 that succeeds if all bundles were successfully built:
-  create-tag-bundles:
-
-    # Define display name:
-    name: 'Create tag bundles'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Indicate that this job depends on the bundle jobs finishing:
-    needs: [ deno, umd, esm ]
-
-    # Define the steps to be executed:
-    steps:
-
-      # Checkout the repository:
-      - name: 'Checkout repository'
-        # Pin action to full length commit SHA
-        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
-        with:
-          fetch-depth: 2
-
-      # Check if workflow run was triggered by a patch, minor, or major version bump:
-      - name: 'Check if workflow run was triggered by a patch, minor, or major version bump'
-        id: check-if-bump
-        continue-on-error: true
-        run: |
-          VERSION_CHANGE_PKG_JSON=$(git diff HEAD~1 HEAD package.json | grep '"version":')
-          if [ -z "$VERSION_CHANGE_PKG_JSON" ]; then
-            echo "This workflow was not triggered by a version bump."
-            echo "bump=false" >> $GITHUB_OUTPUT
-          else
-            echo "This workflow was triggered by a version bump."
-            echo "bump=true" >> $GITHUB_OUTPUT
-          fi
-
-      # Configure Git:
-      - name: 'Configure Git'
-        if: steps.check-if-bump.outputs.bump
-        run: |
-          git config --local user.email "noreply@stdlib.io"
-          git config --local user.name "stdlib-bot"
-          git fetch --all
-
-      # Create bundle tags:
-      - name: 'Create bundle tags'
-        if: steps.check-if-bump.outputs.bump
-        run: |
-          SLUG=${{ github.repository }}
-          ESCAPED=$(echo $SLUG | sed -E 's/\//\\\//g')
-          VERSION="v$(jq --raw-output '.version' package.json)"
-
-          git checkout -b deno origin/deno
-          sed -i -E "s/$ESCAPED@deno/$ESCAPED@$VERSION-deno/g" README.md
-          git add README.md
-          git commit -m "Update README.md for Deno bundle $VERSION"
-          git tag -a $VERSION-deno -m "$VERSION-deno"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" $VERSION-deno
-          sed -i -E "s/$ESCAPED@$VERSION-deno/$ESCAPED@deno/g" README.md
-
-          perl -0777 -i -pe "s/\`\`\`javascript\nimport\s+([a-zA-Z0-9_]+)\s+from\s*'([^']+)';\n\`\`\`/\`\`\`javascript\nimport \1 from '\2';\n\`\`\`\n\The previous example will load the latest bundled code from the deno branch. Alternatively, you may load a specific version by loading the file from one of the \[tagged bundles\]\(https:\/\/github.com\/$ESCAPED\/tags\). For example,\n\n\`\`\`javascript\nimport \1 from 'https:\/\/cdn\.jsdelivr\.net\/gh\/$ESCAPED\@$VERSION-deno\/mod\.js';\n\`\`\`/" README.md
-
-          git add README.md
-          git commit -m "Auto-generated commit"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" deno
-
-          git checkout -b umd origin/umd
-          sed -i -E "s/$ESCAPED@umd/$ESCAPED@$VERSION-umd/g" README.md
-          git add README.md
-          git commit -m "Update README.md for UMD bundle $VERSION"
-          git tag -a $VERSION-umd -m "$VERSION-umd"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" $VERSION-umd
-          sed -i -E "s/$ESCAPED@$VERSION-umd/$ESCAPED@umd/g" README.md
-
-          perl -0777 -i -pe "s/\`\`\`javascript\n([a-zA-Z0-9_]+)\s+=\s*require\(\s*'([^']+)'\s*\)\n\`\`\`/\`\`\`javascript\n\1 = require\( '\2' \)\n\`\`\`\n\The previous example will load the latest bundled code from the umd branch. Alternatively, you may load a specific version by loading the file from one of the \[tagged bundles\]\(https:\/\/github.com\/$ESCAPED\/tags\). For example,\n\n\`\`\`javascript\n\1 = require\( 'https:\/\/cdn\.jsdelivr\.net\/gh\/$ESCAPED\@$VERSION-umd\/browser\.js' \)\n\`\`\`/" README.md
-
-          git add README.md
-          git commit -m "Auto-generated commit"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" umd
-
-          git checkout -b esm origin/esm
-          sed -i -E "s/$ESCAPED@esm/$ESCAPED@$VERSION-esm/g" README.md
-          git add README.md
-          git commit -m "Update README.md for ESM bundle $VERSION"
-          git tag -a $VERSION-esm -m "$VERSION-esm"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" $VERSION-esm
-          sed -i -E "s/$ESCAPED@$VERSION-esm/$ESCAPED@esm/g" README.md
-
-          perl -0777 -i -pe "s/\`\`\`javascript\nimport\s+([a-zA-Z0-9_]+)\s+from\s*'([^']+)';\n\`\`\`/\`\`\`javascript\nimport \1 from '\2';\n\`\`\`\n\The previous example will load the latest bundled code from the esm branch. Alternatively, you may load a specific version by loading the file from one of the \[tagged bundles\]\(https:\/\/github.com\/$ESCAPED\/tags\). For example,\n\n\`\`\`javascript\nimport \1 from 'https:\/\/cdn\.jsdelivr\.net\/gh\/$ESCAPED\@$VERSION-esm\/index\.mjs';\n\`\`\`/" README.md
-
-          git add README.md
-          git commit -m "Auto-generated commit"
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" esm
diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml
deleted file mode 100644
index f053e42..0000000
--- a/.github/workflows/publish.yml
+++ /dev/null
@@ -1,261 +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: publish
-
-# Workflow triggers:
-on:
-  # Allow the workflow to be manually run:
-  workflow_dispatch:
-    # Workflow inputs:
-    inputs:
-      version:
-        description: 'Version Increment'
-        type: choice
-        default: 'none'
-        options:
-          - 'none'
-          - 'major'
-          - 'minor'
-          - 'patch'
-          - 'premajor'
-          - 'preminor'
-          - 'prepatch'
-          - 'prerelease'
-
-# Workflow jobs:
-jobs:
-
-  # Define job to publish package to npm:
-  publish:
-
-    # Define display name:
-    name: 'Publish package to npm'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-      NPM_TOKEN: ${{ secrets.NPM_TOKEN }}
-
-    # 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
-
-      # Configure Git:
-      - name: 'Configure Git'
-        run: |
-          git config --local user.email "noreply@stdlib.io"
-          git config --local user.name "stdlib-bot"
-
-      # Increment package version (if requested):
-      - name: 'Increment package version (if requested)'
-        if: ${{ github.event.inputs.version != 'none' }}
-        run: |
-          # Save NPM_TOKEN to user's .npmrc:
-          echo "//registry.npmjs.org/:_authToken=${NPM_TOKEN}" > ~/.npmrc
-
-          # Increment package version:
-          npm version ${{ github.event.inputs.version }} --no-git-tag-version
-
-          # Define variable for new version:
-          NEW_VERSION=$(node -p "require('./package.json').version")
-
-          # Replace branch in README.md link definitions for badges with the new version:
-          find . -type f -name '*.md' -print0 | xargs -0 sed -Ei "s/branch([=:])[^ ]+/branch\1v${NEW_VERSION}/g"
-
-          # Rewrite CHANGELOG.md to replace "Unreleased" with the new version:
-          sed -Ei "s/Unreleased/${NEW_VERSION}/g" CHANGELOG.md
-          sed -Ei "s/unreleased/v${NEW_VERSION}/g" CHANGELOG.md
-
-          # Create a new commit and tag:
-          git add package.json README.md
-          git commit -m "Release v${NEW_VERSION}"
-          git tag -a "v${NEW_VERSION}" -m "Release v${NEW_VERSION}"
-
-          # Push changes to GitHub:
-          SLUG=${{ github.repository }}
-          git push "https://$GITHUB_ACTOR:$GITHUB_TOKEN@github.com/$SLUG.git" --follow-tags
-
-      # Remove CLI:
-      - name: 'Remove CLI'
-        if: ${{ github.ref == 'refs/heads/main' }}
-        run: |
-          # Exit if the package does not have a CLI:
-          if ! grep -q '"bin":' package.json; then
-            exit 0
-          fi
-          rm -rf ./bin/cli
-          rm -f test/test.cli.js
-          rm -f etc/cli_opts.json
-          rm -f docs/usage.txt
-
-          # For all dependencies, check in all *.js files if they are still used; if not, remove them:
-          jq -r '.dependencies | keys[]' ./package.json | while read -r dep; do
-            dep=$(echo "$dep" | xargs)
-            if ! find lib -name "*.js" -exec grep -q "$dep" {} + && ! grep -q -s "$dep" manifest.json && ! grep -q -s "$dep" include.gypi; then
-              jq --indent 2 "del(.dependencies[\"$dep\"])" ./package.json > ./package.json.tmp
-              mv ./package.json.tmp ./package.json
-            fi
-          done
-
-          # Set `devDependencies` to an empty object:
-          jq --indent 2 '.devDependencies = {}' ./package.json > ./package.json.tmp
-          mv ./package.json.tmp ./package.json
-
-          # Remove CLI section:
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/(\* \* \*\n+)?<section class=\"cli\">[\s\S]+?<\!\-\- \/.cli \-\->//"
-
-          # Remove CLI from package.json:
-          jq -r 'del(.bin)' package.json > package.json.tmp
-          mv package.json.tmp package.json
-
-          # Add entry for CLI package to See Also section of README.md:
-          cliPkgName=$(jq -r '.name' package.json)-cli
-          escapedPkg=$(echo "$cliPkgName" | sed -e 's/\//\\\//g')
-          escapedPkg=$(echo "$escapedPkg" | sed -e 's/\@/\\\@/g')
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/<section class=\"related\">(?:\n\n\* \* \*\n\n## See Also\n\n)?/<section class=\"related\">\n\n## See Also\n\n-   <span class=\"package-name\">[\`$escapedPkg\`][$escapedPkg]<\/span><span class=\"delimiter\">: <\/span><span class=\"description\">CLI package for use as a command-line utility.<\/span>\n/"
-
-          # Add link definition for CLI package to README.md:
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/<section class=\"links\">/<section class=\"links\">\n\n[$escapedPkg]: https:\/\/www.npmjs.com\/package\/$escapedPkg/"
-
-      # Replace GitHub MathJax equations with SVGs:
-      - name: 'Replace GitHub MathJax equations with SVGs'
-        run: |
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe 's/```math\n([\s\S]+?)\n```\n\n//g'
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe 's/<!-- <div class="equation"(.*?)(<\/div>\s*-->)/<div class="equation"$1<\/div>/sg'
-
-      # Replace GitHub links to individual packages with npm links:
-      - name: 'Replace all GitHub links to individual packages with npm links'
-        run: |
-          find . -type f -name '*.md' -print0 | xargs -0 sed -Ei '/tree\/main/b; s/@stdlib\/([^:]*)\]: https:\/\/github.com\/stdlib-js/@stdlib\/\1\]: https:\/\/www.npmjs.com\/package\/@stdlib/g'
-
-      # Replace list with links to other branches from installation section:
-      - name: 'Replace list with links to other branches from installation section'
-        run: |
-          find . -type f -name '*.md' -print0 | xargs -0 perl -0777 -i -pe "s/\`\`\`\n\nAlternatively,[^<]+<\/section>/\`\`\`\n\n<\/section>/"
-
-      # Remove unnecessary files:
-      - name: 'Remove unnecessary files'
-        run: |
-          rm -f docs/repl.txt
-          rm -f docs/types/test.ts
-
-      # Replace all stdlib GitHub dependencies with the respective npm packages:
-      - name: 'Replace all stdlib GitHub dependencies with the respective npm packages'
-        run: |
-          for dep in $(jq -r '.dependencies | keys | .[]' package.json); do
-            if [[ "$dep" != "@stdlib"* ]]; then
-              continue
-            fi
-            # Trim leading and trailing whitespace:
-            dep=$(echo "$dep" | xargs)
-            version="$(npm view $dep version)"
-            if [[ -z "$version" ]]; then
-              continue
-            fi
-            version="^$version"
-            jq -r --arg dep "$dep" --arg version "$version" '.dependencies[$dep] = $version' package.json > package.json.tmp
-            mv package.json.tmp package.json
-          done
-          for dep in $(jq -r '.devDependencies | keys | .[]' package.json); do
-            if [[ "$dep" != "@stdlib"* ]]; then
-              continue
-            fi
-            # Trim leading and trailing whitespace:
-            dep=$(echo "$dep" | xargs)
-            version="$(npm view $dep version)"
-            if [[ -z "$version" ]]; then
-              continue
-            fi
-            version="^$version"
-            jq -r --arg dep "$dep" --arg version "$version" '.devDependencies[$dep] = $version' package.json > package.json.tmp
-            mv package.json.tmp package.json
-          done
-
-      # Publish package to npm:
-      - name: 'Publish package to npm'
-        # Pin action to full length commit SHA
-        uses: JS-DevTools/npm-publish@19c28f1ef146469e409470805ea4279d47c3d35c # v3.1.1
-        with:
-          token: ${{ secrets.NPM_TOKEN }}
-          access: public
-
-      # Discard any uncommitted changes:
-      - name: 'Discard any uncommitted changes'
-        run: |
-          git reset --hard
-
-      # 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 cancel any running or queued workflow runs...
-  cancel:
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Time out the job after 3 minutes:
-    timeout-minutes: 3
-
-    # Define the sequence of job steps...
-    steps:
-
-      # Cancel any running or queued workflow runs:
-      - name: 'Cancel running or queued 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/test.yml b/.github/workflows/test.yml
deleted file mode 100644
index 1c0c043..0000000
--- a/.github/workflows/test.yml
+++ /dev/null
@@ -1,101 +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: test
-
-# Workflow triggers:
-on:
-  # Run workflow on a weekly schedule:
-  schedule:
-    # * is a special character in YAML so you have to quote this string
-    - cron:  '58 22 * * 4'
-
-  # Allow the workflow to be manually run:
-  workflow_dispatch:
-
-  # Run workflow on each push to the main branch:
-  push:
-
-  # Run workflow upon completion of `publish` workflow run:
-  workflow_run:
-    workflows: ["publish"]
-    types: [completed]
-
-# Workflow jobs:
-jobs:
-
-  # Define job to run tests...
-  test:
-
-    # Define display name:
-    name: 'Run tests'
-
-    # Define the type of virtual host machine:
-    runs-on: 'ubuntu-latest'
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # 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'
-        id: install
-        run: |
-          npm install || npm install || npm install
-        timeout-minutes: 15
-
-      # Run tests:
-      - name: 'Run tests'
-        id: tests
-        run: |
-          npm test || npm test || npm test
-
-      # 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 }})
diff --git a/.github/workflows/test_bundles.yml b/.github/workflows/test_bundles.yml
deleted file mode 100644
index a6ef0cb..0000000
--- a/.github/workflows/test_bundles.yml
+++ /dev/null
@@ -1,213 +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: test_bundles
-
-# Workflow triggers:
-on:
-  # Run workflow upon completion of `productionize` workflow run:
-  workflow_run:
-    workflows: ["productionize"]
-    types: [completed]
-
-  # Allow workflow to be manually run:
-  workflow_dispatch:
-
-# Workflow jobs:
-jobs:
-
-  # Define job to test UMD bundles...
-  test-umd:
-
-    # Define display name:
-    name: 'Test UMD Bundles'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # Define the sequence of job steps...
-    steps:
-      # Checkout UMD branch of the repository:
-      - name: 'Checkout branch with UMD build'
-        # Pin action to full length commit SHA
-        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
-        with:
-          ref: 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
-
-      # Try loading the UMD bundle:
-      - name: 'Try loading UMD bundle'
-        run: |
-          node --eval "require( './index.js' )" || exit $?
-
-      # Install playwright for headless browser testing:
-      - name: 'Install playwright'
-        run: |
-          npm install playwright
-          npx playwright install --with-deps chromium
-
-      # Try loading the UMD browser bundle with playwright:
-      - name: 'Try loading UMD browser bundle with playwright'
-        run: |
-          PLAYWRIGHT_SCRIPT="\
-            const { chromium } = require( 'playwright' );\
-            (async () => {\
-              const browser = await chromium.launch();\
-              const page = await browser.newPage();\
-              page.on( 'pageerror', exception => {\
-                throw new Error( exception.message );\
-              });\
-              await page.addScriptTag({ path: './browser.js' });\
-              await browser.close();\
-            })();"
-          node --eval "$PLAYWRIGHT_SCRIPT" || exit $?
-
-      # 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 test ES modules...
-  test-esm:
-
-    # Define display name:
-    name: 'Test ES Modules'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # Define the sequence of job steps...
-    steps:
-
-      # Checkout ES modules branch of the repository:
-      - name: 'Checkout branch with ESM build'
-        # Pin action to full length commit SHA
-        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
-        with:
-          ref: esm
-
-      # 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
-
-      # Try loading the ES module bundle:
-      - name: 'Try loading ESM'
-        run: |
-          node --experimental-network-imports --eval "import( './index.mjs' )" || exit $?
-
-      # 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 test Deno bundles...
-  test-deno:
-
-    # Define display name:
-    name: 'Test Deno Bundles'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # Define the sequence of job steps...
-    steps:
-
-      # Checkout Deno branch of the repository:
-      - name: 'Checkout branch with Deno build'
-        # Pin action to full length commit SHA
-        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
-        with:
-          ref: deno
-
-      # Install Deno:
-      - name: 'Install Deno'
-        # Pin action to full length commit SHA
-        uses: denoland/setup-deno@041b854f97b325bd60e53e9dc2de9cb9f9ac0cba # v1.1.4
-        with:
-          deno-version: vx.x.x
-
-      # Try loading the Deno bundle:
-      - name: 'Try loading Deno build'
-        run: |
-          deno eval "import main from './mod.js'" || exit $?
-
-      # 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 }})
diff --git a/.github/workflows/test_coverage.yml b/.github/workflows/test_coverage.yml
deleted file mode 100644
index 0ec9372..0000000
--- a/.github/workflows/test_coverage.yml
+++ /dev/null
@@ -1,142 +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: test_coverage
-
-# Workflow triggers:
-on:
-  # Run workflow upon completion of `test` workflow run:
-  workflow_run:
-    workflows: ["test"]
-    types: [completed]
-
-  # Allow workflow to be manually run:
-  workflow_dispatch:
-
-# Workflow jobs:
-jobs:
-
-  # Define job to run test coverage...
-  coverage:
-
-    # Display name:
-    name: 'Calculate Test Coverage'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # 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
-
-      # Build native add-on if present:
-      - name: 'Build native add-on (if present)'
-        run: |
-          if [ -f "binding.gyp" ]; then
-            npm install node-gyp --no-save && ./node_modules/.bin/node-gyp rebuild
-          fi
-
-      # Calculate coverage:
-      - name: 'Calculate test coverage'
-        run: |
-          npm run test-cov || npm run test-cov || npm run test-cov
-        timeout-minutes: 15
-
-      # Upload coverage report to Codecov:
-      - name: 'Upload coverage to Codecov'
-        id: upload
-        # Pin action to full length commit SHA
-        uses: codecov/codecov-action@84508663e988701840491b86de86b666e8a86bed # v4.3.0
-        with:
-          directory: reports/coverage
-          flags: unittests
-          fail_ci_if_error: true
-        env:
-          CODECOV_TOKEN: ${{ secrets.CODECOV_TOKEN }}
-
-      # Extract coverage value:
-      - name: 'Extract coverage value and assign to output'
-        id: extract-coverage
-        run: |
-          coverage=`cat reports/coverage/lcov-report/index.html | grep "fraction" | grep -oP '\d+/\d+' | printf %s "$(cat)" | jq -R -s -c 'split("\n")'`
-          echo "coverage=$coverage" >> $GITHUB_OUTPUT
-
-          # Format coverage as Markdown table row:
-          table=`echo $coverage | sed -e 's/,/|/g; s/"/ /g; s/\[/|/; s/\]/|/'`
-          echo "table=$table" >> $GITHUB_OUTPUT
-
-      # Print coverage report to GitHub Actions log:
-      - name: 'Print coverage report to GitHub Actions log'
-        run: |
-          echo "## Coverage Report" >> $GITHUB_STEP_SUMMARY
-          echo "" >> $GITHUB_STEP_SUMMARY
-          echo "| Statements | Branches | Functions | Lines | " >> $GITHUB_STEP_SUMMARY
-          echo "| ---------- | -------- | --------- | ----- | " >> $GITHUB_STEP_SUMMARY
-          echo "${{ steps.extract-coverage.outputs.table }}" >> $GITHUB_STEP_SUMMARY
-          echo "" >> $GITHUB_STEP_SUMMARY
-
-      # 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 }})
-
-      # 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_COVERAGE_URL }}
-          webhook_secret: ${{ secrets.STDLIB_WEBHOOK_SECRET }}
-          data: '{ "coverage": ${{ steps.extract-coverage.outputs.coverage }}, "run_id": "${{ github.run_id }}" }'
-        if: ${{ false }}
diff --git a/.github/workflows/test_install.yml b/.github/workflows/test_install.yml
deleted file mode 100644
index 42a47ea..0000000
--- a/.github/workflows/test_install.yml
+++ /dev/null
@@ -1,94 +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: test_install
-
-# Workflow triggers:
-on:
-  # Run workflow on a weekly schedule:
-  schedule:
-    # * is a special character in YAML so you have to quote this string
-    - cron:  '58 22 * * 4'
-
-  # Run workflow upon completion of `publish` workflow run:
-  workflow_run:
-    workflows: ["publish"]
-    types: [completed]
-
-  # Allow workflow to be manually run:
-  workflow_dispatch:
-
-# Workflow jobs:
-jobs:
-
-  # Define job to test installing dependencies...
-  test-install:
-
-    # Define display name:
-    name: 'Test installing dependencies'
-
-    # Define the type of virtual host machine on which to run the job:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # Run workflow job if `publish` workflow run is successful or when the workflow is manually triggered or on a schedule:
-    if: ${{ github.event.workflow_run.conclusion == 'success' || github.event_name == 'workflow_dispatch' || github.event_name == 'schedule' }}
-
-    # 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 dependencies via npm'
-        run: |
-          npm install --only=prod || npm install --only=prod || npm install --only=prod
-        timeout-minutes: 15
-
-      # 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 }})
diff --git a/.github/workflows/test_published_package.yml b/.github/workflows/test_published_package.yml
deleted file mode 100644
index 5fcc1db..0000000
--- a/.github/workflows/test_published_package.yml
+++ /dev/null
@@ -1,115 +0,0 @@
-#/
-# @license Apache-2.0
-#
-# Copyright (c) 2024 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: test_published_package
-
-# Workflow triggers:
-on:
-  # Run workflow on a weekly schedule:
-  schedule:
-    # * is a special character in YAML so you have to quote this string
-    - cron:  '58 22 * * 4'
-
-  # Run workflow upon completion of `publish` workflow run:
-  workflow_run:
-    workflows: ["publish"]
-    types: [completed]
-
-  # Allow workflow to be manually run:
-  workflow_dispatch:
-
-# Workflow jobs:
-jobs:
-  test-published:
-    # Define a display name:
-    name: 'Test running examples of published package'
-
-    # Define the type of virtual host machine:
-    runs-on: ubuntu-latest
-
-    # Define environment variables:
-    env:
-      ZULIP_API_KEY: ${{ secrets.ZULIP_API_KEY }}
-
-    # Run workflow job if `publish` workflow run is successful or when the workflow is manually triggered or on a schedule:
-    if: ${{ github.event.workflow_run.conclusion == 'success' || github.event_name == 'workflow_dispatch' || github.event_name == 'schedule' }}
-
-    # Define the job's steps:
-    steps:
-      # Checkout the repository:
-      - name: 'Checkout repository'
-        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
-
-      # Install Node.js:
-      - name: 'Install Node.js'
-        uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1
-        with:
-          node-version: 20
-        timeout-minutes: 5
-
-      # Create test directory and run examples:
-      - name: 'Create test directory and run examples'
-        run: |
-          cd ..
-          mkdir test-published
-          cd test-published
-
-          # Copy example file:
-          cp $GITHUB_WORKSPACE/examples/index.js .
-
-          # Create a minimal package.json
-          echo '{
-            "name": "test-published",
-            "version": "1.0.0",
-            "main": "index.js",
-            "dependencies": {}
-          }' > package.json
-
-          # Get package name and modify example file:
-          PACKAGE_NAME=$(jq -r '.name' $GITHUB_WORKSPACE/package.json)
-          ESCAPED_PACKAGE_NAME=$(echo "$PACKAGE_NAME" | sed 's/[\/&]/\\&/g')
-
-          sed -i "s/require( '.\/..\/lib' )/require( '$ESCAPED_PACKAGE_NAME' )/g" index.js
-
-          # Extract and install dependencies:
-          DEPS=$(grep -oP "require\(\s*'([^']+)'\s*\)" index.js | sed "s/require(\s*'//" | sed "s/'\s*)//" | grep -v "^\.")
-          for dep in $DEPS; do
-            npm install $dep --save
-          done
-
-          # Run the example:
-          node index.js
-
-      # 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 }})
diff --git a/.gitignore b/.gitignore
deleted file mode 100644
index 716769a..0000000
--- a/.gitignore
+++ /dev/null
@@ -1,205 +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.
-#/
-
-# Files #
-#########
-package.json.copy
-.stdlibrc
-
-# Directories #
-###############
-build/
-downloads/
-plans/
-reports/
-tmp/
-
-# Compiled source #
-###################
-*.com
-*.class
-*.dll
-*.o
-*.so
-*.slo
-*.lo
-*.obj
-*.dylib
-*.lai
-*.la
-*.a
-*.lib
-*.ko
-*.elf
-*.node
-
-# Precompiled headers #
-#######################
-*.gch
-*.pch
-
-# Executables #
-###############
-*.exe
-*.out
-*.app
-
-# Packages #
-############
-# It is better to unpack these files and commit the raw source
-# git has its own built in compression methods
-*.7z
-*.dmg
-*.gz
-*.iso
-*.jar
-*.rar
-*.tar
-*.zip
-
-# Logs and databases #
-######################
-*.log
-*.sql
-*.sqlite
-
-# OS generated files #
-######################
-.DS_Store
-.DS_Store?
-._*
-.Spotlight-V100
-.Trashes
-Icon?
-ehthumbs.db
-Thumbs.db
-Desktop.ini
-
-# Temporary files #
-###################
-*~
-
-# Node.js #
-###########
-/node_modules/
-lib/node_modules/**/node_modules/
-docs/**/node_modules/
-pids
-*.pid
-*.seed
-yarn.lock
-package-lock.json
-
-# Typescript #
-##############
-*.tsbuildinfo
-lib/node_modules/**/tsconfig.json
-lib/node_modules/**/tslint.json
-
-# Matlab #
-##########
-*.asv
-*.mex*
-
-# Fortran #
-###########
-*.mod
-
-# R #
-#####
-.Rhistory
-.Rapp.history
-.Rproj.user/
-
-# Python #
-##########
-__pycache__/
-*.py[cod]
-*$py.class
-*.egg-info/
-
-# TeX #
-#######
-*.aux
-*.lof
-*.log
-*.lot
-*.fls
-*.out
-*.toc
-*.dvi
-*-converted-to.*
-*.bbl
-*.bcf
-*.blg
-*-blx.aux
-*-blx.bib
-*.brf
-*.run.xml
-*.fdb_latexmk
-*.synctex
-*.synctex.gz
-*.synctex.gz(busy)
-*.pdfsync
-*.alg
-*.loa
-acs-*.bib
-*.thm
-*.nav
-*.snm
-*.vrb
-*.acn
-*.acr
-*.glg
-*.glo
-*.gls
-*-concordance.tex
-*.tikz
-*-tikzDictionary
-*.idx
-*.ilg
-*.ind
-*.ist
-
-# Git #
-#######
-.worktrees
-
-# Visual Studio #
-#################
-.vscode/
-jsconfig.json
-
-# Sublime Text #
-################
-*.sublime-workspace
-*.sublime-project
-
-# Other editor files #
-######################
-.idea/
-.cursor
-.cursorignore
-.windsurfrules
-.clinerules
-
-# AI coding agents #
-####################
-CLAUDE.md
-GEMINI.md
-.claude/
diff --git a/.npmignore b/.npmignore
deleted file mode 100644
index 8eea7dc..0000000
--- a/.npmignore
+++ /dev/null
@@ -1,229 +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.
-#/
-
-# Files #
-#########
-CITATION.cff
-CHANGELOG.md
-CODE_OF_CONDUCT.md
-CONTRIBUTING.md
-CONTRIBUTORS
-TODO.md
-ROADMAP.md
-branches.md
-.postinstall.json
-Makefile
-
-# Ignore files to avoid compilation of native addon when installing package:
-binding.gyp
-include.gypi
-
-# Directories #
-###############
-.circleci/
-.github/
-**/benchmark/
-**/build/
-**/examples/
-reports/
-support/
-scripts/
-**/tmp/
-workshops/
-
-# Ignore test directories, except for testing dependency installation:
-**/test/
-
-# Compiled source #
-###################
-*.com
-*.class
-*.dll
-*.o
-*.so
-*.slo
-*.lo
-*.obj
-*.dylib
-*.lai
-*.la
-*.a
-*.lib
-*.ko
-*.elf
-*.node
-
-# Precompiled headers #
-#######################
-*.gch
-*.pch
-
-# Executables #
-###############
-*.exe
-*.out
-*.app
-
-# Packages #
-############
-*.7z
-*.dmg
-*.gz
-*.iso
-*.jar
-*.rar
-*.tar
-*.zip
-
-# Make an exception for compressed distributable files:
-!dist/*.gz
-
-# Logs and databases #
-######################
-*.log
-*.sql
-*.sqlite
-
-# OS generated files #
-######################
-.DS_Store
-.DS_Store?
-._*
-.Spotlight-V100
-.Trashes
-Icon?
-ehthumbs.db
-Thumbs.db
-Desktop.ini
-
-# Temporary files #
-###################
-*~
-
-# Node.js #
-###########
-.npmignore
-
-# Only top-level node_modules:
-/node_modules/
-
-# TypeScript #
-##############
-tsconfig.json
-tslint.json
-*.tsbuildinfo
-
-# Matlab #
-##########
-*.asv
-*.mex*
-
-# Fortran #
-###########
-*.mod
-
-# R #
-#####
-.Rhistory
-.Rapp.history
-.Rproj.user/
-
-# Python #
-##########
-__pycache__/
-*.py[cod]
-*$py.class
-*.egg-info/
-.ipynb_checkpoints
-setup.cfg
-setup.py
-
-# TeX #
-#######
-*.aux
-*.lof
-*.log
-*.lot
-*.fls
-*.out
-*.toc
-*.dvi
-*-converted-to.*
-*.bbl
-*.bcf
-*.blg
-*-blx.aux
-*-blx.bib
-*.brf
-*.run.xml
-*.fdb_latexmk
-*.synctex
-*.synctex.gz
-*.synctex.gz(busy)
-*.pdfsync
-*.alg
-*.loa
-acs-*.bib
-*.thm
-*.nav
-*.snm
-*.vrb
-*.acn
-*.acr
-*.glg
-*.glo
-*.gls
-*-concordance.tex
-*.tikz
-*-tikzDictionary
-*.idx
-*.ilg
-*.ind
-*.ist
-
-# Git #
-#######
-.git*
-.mailmap
-
-# Visual Studio #
-#################
-.vscode/
-jsconfig.json
-
-# Utilities #
-#############
-.jshintrc
-.jshintignore
-.eslintrc*
-.eslintignore
-
-.pylintrc
-.pycodestyle
-.pydocstyle
-
-.travis.yml
-circle.yml
-appveyor.yml
-azure-pipelines.yml
-
-.editorconfig
-.codeclimate.yml
-.codecov.yml
-
-.rtlintrc
diff --git a/.npmrc b/.npmrc
deleted file mode 100644
index 3b95c54..0000000
--- a/.npmrc
+++ /dev/null
@@ -1,44 +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 for [npm][1].
-#
-# [1]: https://docs.npmjs.com/files/npmrc
-
-# Disable the creation of a lock file:
-package-lock = false
-shrinkwrap = false
-
-# Disable automatically "saving" dependencies on install:
-save = false
-
-# Do not generate provenance metadata:
-provenance = false
-
-# Prefer cached dependencies during install:
-prefer-offline = true
-
-# Require signing Git commits and tags when using `npm version`:
-sign-git-commit = true
-sign-git-tag = true
-
-# Run Git commit hooks when using `npm version`:
-commit-hooks = true
-
-# Require that dependencies within the dependency tree have a minimum release age (in days) in order to guard against supply chain attacks:
-min-release-age = 90
diff --git a/CHANGELOG.md b/CHANGELOG.md
deleted file mode 100644
index eb393e4..0000000
--- a/CHANGELOG.md
+++ /dev/null
@@ -1,96 +0,0 @@
-# CHANGELOG
-
-> Package changelog.
-
-<section class="release" id="unreleased">
-
-## Unreleased (2026-08-17)
-
-<section class="commits">
-
-### Commits
-
-<details>
-
--   [`853c4b4`](https://github.com/stdlib-js/stdlib/commit/853c4b4f23a7187a6acaf937d9f7af2f079e941d) - **refactor:** remove redundant union member in `ndarray/base/some` [(#12634)](https://github.com/stdlib-js/stdlib/pull/12634) _(by Philipp Burckhardt)_
--   [`7fab453`](https://github.com/stdlib-js/stdlib/commit/7fab4532629dccd39b59721b833da8a9128a3dec) - **bench:** refactor to use string interpolation in `ndarray/base` [(#11436)](https://github.com/stdlib-js/stdlib/pull/11436) _(by Karan Anand, Athan Reines)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 3 people contributed to this release. Thank you to the following contributors:
-
--   Athan Reines
--   Karan Anand
--   Philipp Burckhardt
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.1.1">
-
-## 0.1.1 (2026-02-08)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.1.0">
-
-## 0.1.0 (2026-01-31)
-
-<section class="features">
-
-### Features
-
--   [`dcafcbc`](https://github.com/stdlib-js/stdlib/commit/dcafcbc6ddad41e4cd12d46dad426fe80bf7eab3) - add `ndarray/base/some` [(#7653)](https://github.com/stdlib-js/stdlib/pull/7653)
-
-</section>
-
-<!-- /.features -->
-
-<section class="commits">
-
-### Commits
-
-<details>
-
--   [`dcafcbc`](https://github.com/stdlib-js/stdlib/commit/dcafcbc6ddad41e4cd12d46dad426fe80bf7eab3) - **feat:** add `ndarray/base/some` [(#7653)](https://github.com/stdlib-js/stdlib/pull/7653) _(by Muhammad Haris, Athan Reines)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 2 people contributed to this release. Thank you to the following contributors:
-
--   Athan Reines
--   Muhammad Haris
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
diff --git a/CITATION.cff b/CITATION.cff
deleted file mode 100644
index 2ec6fff..0000000
--- a/CITATION.cff
+++ /dev/null
@@ -1,30 +0,0 @@
-cff-version: 1.2.0
-title: stdlib
-message: >-
-  If you use this software, please cite it using the
-  metadata from this file.
-
-type: software
-
-authors:
-  - name: The Stdlib Authors
-    url: https://github.com/stdlib-js/stdlib/graphs/contributors
-
-repository-code: https://github.com/stdlib-js/stdlib
-url: https://stdlib.io
-
-abstract: |
-  Standard library for JavaScript and Node.js.
-
-keywords:
-  - JavaScript
-  - Node.js
-  - TypeScript
-  - standard library
-  - scientific computing
-  - numerical computing
-  - statistical computing
-
-license: Apache-2.0 AND BSL-1.0
-
-date-released: 2016
diff --git a/CODE_OF_CONDUCT.md b/CODE_OF_CONDUCT.md
deleted file mode 100644
index 35b70c9..0000000
--- a/CODE_OF_CONDUCT.md
+++ /dev/null
@@ -1,3 +0,0 @@
-# Code of Conduct
-
-stdlib expects community participants to adhere to the project Code of Conduct. The [full text](https://github.com/stdlib-js/stdlib/blob/develop/CODE_OF_CONDUCT.md) is available in the main project repository.
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
deleted file mode 100644
index 5f59443..0000000
--- a/CONTRIBUTING.md
+++ /dev/null
@@ -1,3 +0,0 @@
-# Contribution Guidelines
-
-Woot woot! If you are new to stdlib, welcome! And thanks for your interest! Guidelines for how to contribute to the project are [available](https://github.com/stdlib-js/stdlib/blob/develop/CONTRIBUTING.md) in the main project repository.
diff --git a/Makefile b/Makefile
deleted file mode 100644
index 8c0d48f..0000000
--- a/Makefile
+++ /dev/null
@@ -1,534 +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.
-#/
-
-# USER VARIABLES #
-
-ifndef VERBOSE
-	QUIET := @
-else
-	QUIET :=
-endif
-
-# Indicate whether to "fast" fail when linting, running tests, etc:
-ifndef FAST_FAIL
-	FAIL_FAST := true
-else
-ifeq ($(FAST_FAIL), 0)
-	FAIL_FAST := false
-else
-	FAIL_FAST := true
-endif
-endif
-
-# Define the `NODE_PATH` environment variable:
-NODE_PATH ?=
-
-# Define the `NODE_ENV` environment variable:
-NODE_ENV ?=
-
-
-# INTERNAL VARIABLES #
-
-# Instruct make to warn us when we use an undefined variable (e.g., misspellings).
-MAKEFLAGS += --warn-undefined-variables
-
-# Define the default target:
-.DEFAULT_GOAL := all
-
-# Define the `SHELL` variable to avoid issues on systems where the variable may be inherited from the environment.
-#
-# ## Notes
-#
-# -   We use `bash` so that we can use `pipefail`.
-#
-#
-# [1]: https://www.gnu.org/prep/standards/html_node/Makefile-Basics.html#Makefile-Basics
-# [2]: http://clarkgrubb.com/makefile-style-guide
-SHELL := bash
-
-# Define shell flags.
-#
-# ## Notes
-#
-# -   `.SHELLFLAGS` was introduced in GNU Make 3.82 and has no effect on the version of GNU Make installed on Mac OS X, which is 3.81.
-# -   The `-e` flag causes `bash` to exit immediately if a `bash` executed command fails.
-# -   The `-u` flag causes `bash` to exit with an error message if a variable is accessed without being defined.
-# -   The `pipefail` option specifies that, if any of the commands in a pipeline fail, the entire pipeline fails. Otherwise the return value of a pipeline is the return value of the last command.
-# -   The `-c` flag is in the default value of `.SHELLFLAGS`, which must be preserved, as this is how `make` passes the script to be executed to `bash`.
-#
-.SHELLFLAGS := -eu -o pipefail -c
-
-# Remove targets if its recipe fails.
-#
-# ## Notes
-#
-# -   Mentioning this target anywhere in a Makefile prevents a user from re-running make and using an incomplete or invalid target.
-# -   When debugging, it may be necessary to comment this line out so the incomplete or invalid target can be inspected.
-#
-# [1]: https://www.gnu.org/software/make/manual/html_node/Special-Targets.html
-.DELETE_ON_ERROR:
-
-# Remove all the default suffixes, preferring to define all rules explicitly.
-#
-# [1]: https://www.gnu.org/software/make/manual/html_node/Suffix-Rules.html#Suffix-Rules
-# [2]: https://www.gnu.org/software/make/manual/html_node/Suffix-Rules.html#Suffix-Rules
-.SUFFIXES:
-
-# Determine the OS ([1][1], [2][2]).
-#
-# [1]: https://en.wikipedia.org/wiki/Uname#Examples
-# [2]: http://stackoverflow.com/a/27776822/2225624
-OS ?= $(shell uname)
-ifneq (, $(findstring MINGW,$(OS)))
-	OS := WINNT
-else
-ifneq (, $(findstring MSYS,$(OS)))
-	OS := WINNT
-else
-ifneq (, $(findstring CYGWIN,$(OS)))
-	OS := WINNT
-else
-ifneq (, $(findstring Windows_NT,$(OS)))
-	OS := WINNT
-endif
-endif
-endif
-endif
-
-# Determine the filename:
-this_file := $(lastword $(MAKEFILE_LIST))
-
-# Determine the absolute path of the Makefile (see http://blog.jgc.org/2007/01/what-makefile-am-i-in.html):
-this_dir := $(dir $(CURDIR)/$(word $(words $(MAKEFILE_LIST)),$(MAKEFILE_LIST)))
-
-# Remove the trailing slash:
-this_dir := $(patsubst %/,%,$(this_dir))
-
-# Determine root directory:
-ROOT_DIR = $(this_dir)
-
-# Define the root build directory:
-BUILD_DIR ?= $(ROOT_DIR)/build
-
-# Define the root directory for storing distributable files:
-DIST_DIR ?= $(ROOT_DIR)/dist
-
-# Define the root directory for storing temporary files:
-TMP_DIR ?= $(ROOT_DIR)/tmp
-
-# Define the directories for writing reports, including code coverage:
-REPORTS_DIR ?= $(ROOT_DIR)/reports
-COVERAGE_DIR ?= $(REPORTS_DIR)/coverage
-
-# Define the top-level directory containing node module dependencies:
-NODE_MODULES ?= $(ROOT_DIR)/node_modules
-
-# Define the top-level directory containing node module executables:
-BIN_DIR ?= $(NODE_MODULES)/.bin
-
-# Define the path to the root `package.json`:
-ROOT_PACKAGE_JSON ?= $(ROOT_DIR)/package.json
-
-# Define the folder name convention for source files requiring compilation:
-SRC_FOLDER ?= src
-
-# Define the folder name convention for documentation files:
-DOCUMENTATION_FOLDER ?= docs
-
-# Define the folder name convention for configuration files:
-CONFIG_FOLDER ?= etc
-
-# Define the folder name convention for benchmark files:
-BENCHMARKS_FOLDER ?= benchmark
-
-# Define the folder name convention for benchmark fixtures:
-BENCHMARKS_FIXTURES_FOLDER ?= $(BENCHMARKS_FOLDER)/fixtures
-
-# Define the folder name convention for examples files:
-EXAMPLES_FOLDER ?= examples
-
-# Define the folder name convention for examples fixtures:
-EXAMPLES_FIXTURES_FOLDER ?= $(EXAMPLES_FOLDER)/fixtures
-
-# Define the folder name convention for test files:
-TESTS_FOLDER ?= test
-
-# Define the folder name convention for test fixtures:
-TESTS_FIXTURES_FOLDER ?= $(TESTS_FOLDER)/fixtures
-
-# Define a filepath pattern for benchmark files:
-BENCHMARKS_FILTER ?= .*/.*
-
-# Define a filepath pattern for example files:
-EXAMPLES_FILTER ?= .*/.*
-
-# Define a filepath pattern for test files:
-TESTS_FILTER ?= .*/.*
-
-# Define a filename pattern for benchmark files:
-BENCHMARKS_PATTERN ?= benchmark*.js
-
-# Define a filename pattern for example files:
-EXAMPLES_PATTERN ?= *.js
-
-# Define a filename pattern for test files:
-TESTS_PATTERN ?= test*.js
-
-# Define Node environments:
-ifdef NODE_ENV
-	NODE_ENV_BENCHMARK := $(NODE_ENV)
-	NODE_ENV_EXAMPLES := $(NODE_ENV)
-	NODE_ENV_TEST := $(NODE_ENV)
-else
-	NODE_ENV ?=
-	NODE_ENV_BENCHMARK ?= benchmark
-	NODE_ENV_EXAMPLES ?= examples
-	NODE_ENV_TEST ?= test
-endif
-
-# Define whether delete operations should be safe (i.e., deleted items are sent to trash, rather than permanently deleted):
-SAFE_DELETE ?= false
-
-# Define the delete command:
-ifeq ($(SAFE_DELETE), true)
-	# FIXME: -rm -rf
-	DELETE := -rm
-	DELETE_FLAGS := -rf
-else
-	DELETE ?= -rm
-	DELETE_FLAGS ?= -rf
-endif
-
-# Determine the `open` command:
-ifeq ($(OS), Darwin)
-	OPEN ?= open
-else
-	OPEN ?= xdg-open
-endif
-# TODO: add Windows command
-
-# Define the command for `node`:
-NODE ?= node
-
-# Define the command for `npm`:
-NPM ?= npm
-
-# Define the path to a JavaScript test runner.
-#
-# ## Notes
-#
-# -   We reference the `bin` file directly in order to support using `istanbul` for code coverage on Windows (https://github.com/gotwarlost/istanbul#usage-on-windows)
-JAVASCRIPT_TEST ?= $(NODE_MODULES)/tape/bin/tape
-
-# Define any command-line options to use when invoking the test runner:
-JAVASCRIPT_TEST_FLAGS ?=
-
-# Define the path to the executable for parsing TAP output:
-TAP_REPORTER ?= $(BIN_DIR)/tap-min
-
-# Define the path to the Istanbul executable:
-ISTANBUL ?= $(BIN_DIR)/istanbul
-
-# Define which files and directories to exclude from coverage instrumentation:
-ISTANBUL_EXCLUDES_FLAGS ?= \
-	--no-default-excludes \
-	-x 'node_modules/**' \
-	-x 'reports/**' \
-	-x 'tmp/**' \
-	-x 'deps/**' \
-	-x 'dist/**' \
-	-x "**/$(SRC_FOLDER)/**" \
-	-x "**/$(TESTS_FOLDER)/**" \
-	-x "**/$(EXAMPLES_FOLDER)/**" \
-	-x "**/$(BENCHMARKS_FOLDER)/**" \
-	-x "**/$(CONFIG_FOLDER)/**" \
-	-x "**/$(DOCUMENTATION_FOLDER)/**"
-
-# Define the command to generate test coverage:
-ISTANBUL_COVER ?= $(ISTANBUL) cover
-
-# Define the type of report Istanbul should produce:
-ISTANBUL_COVER_REPORT_FORMAT ?= lcov
-
-# Define the command-line options to be used when generating code coverage:
-ISTANBUL_COVER_FLAGS ?= \
-	$(ISTANBUL_EXCLUDES_FLAGS) \
-	--dir $(COVERAGE_DIR) \
-	--report $(ISTANBUL_COVER_REPORT_FORMAT)
-
-# On Mac OSX, in order to use `|` and other regular expression operators, we need to use enhanced regular expression syntax (-E); see https://developer.apple.com/library/mac/documentation/Darwin/Reference/ManPages/man7/re_format.7.html#//apple_ref/doc/man/7/re_format.
-ifeq ($(OS), Darwin)
-	find_kernel_prefix := -E
-else
-	find_kernel_prefix :=
-endif
-
-# Common exclude flags that most recipes for finding package files should use (Note: order does matter to some degree):
-FIND_COMMON_EXCLUDE_FLAGS ?= \
-	'!' -path "$(ROOT_DIR)/.*" \
-	'!' -path "$(NODE_MODULES)/*" \
-	'!' -path "$(BUILD_DIR)/*" \
-	'!' -path "$(REPORTS_DIR)/*" \
-
-# Define exclusion flags to use when searching for benchmark files:
-FIND_BENCHMARKS_EXCLUDE_FLAGS ?= \
-	$(FIND_COMMON_EXCLUDE_FLAGS) \
-	'!' -path "$(ROOT_DIR)/**/$(BENCHMARKS_FIXTURES_FOLDER)/*"
-
-# Define flags for finding benchmark files:
-FIND_BENCHMARKS_FLAGS ?= \
-	-type f \
-	-name "$(BENCHMARKS_PATTERN)" \
-	\( -path "$(ROOT_DIR)/$(BENCHMARKS_FOLDER)/**" -o -path "$(ROOT_DIR)/**/$(BENCHMARKS_FOLDER)/**" \) \
-	-regex "$(BENCHMARKS_FILTER)" \
-	$(FIND_BENCHMARKS_EXCLUDE_FLAGS)
-
-ifneq ($(OS), Darwin)
-	FIND_BENCHMARKS_FLAGS := -regextype posix-extended $(FIND_BENCHMARKS_FLAGS)
-endif
-
-# Define a command to list benchmark files:
-FIND_BENCHMARKS_CMD ?= find $(find_kernel_prefix) $(ROOT_DIR) $(FIND_BENCHMARKS_FLAGS)
-
-# Define exclusion flags to use when searching for examples files:
-FIND_EXAMPLES_EXCLUDE_FLAGS ?= \
-	$(FIND_COMMON_EXCLUDE_FLAGS) \
-	'!' -path "$(ROOT_DIR)/**/$(EXAMPLES_FIXTURES_FOLDER)/*"
-
-# Define flags for finding examples files:
-FIND_EXAMPLES_FLAGS ?= \
-	-type f \
-	-name "$(EXAMPLES_PATTERN)" \
-	\( -path "$(ROOT_DIR)/$(EXAMPLES_FOLDER)/**" -o -path "$(ROOT_DIR)/**/$(EXAMPLES_FOLDER)/**" \) \
-	-regex "$(EXAMPLES_FILTER)" \
-	$(FIND_EXAMPLES_EXCLUDE_FLAGS)
-
-ifneq ($(OS), Darwin)
-	FIND_EXAMPLES_FLAGS := -regextype posix-extended $(FIND_EXAMPLES_FLAGS)
-endif
-
-# Define a command to list example files:
-FIND_EXAMPLES_CMD ?= find $(find_kernel_prefix) $(ROOT_DIR) $(FIND_EXAMPLES_FLAGS)
-
-# Define exclusion flags to use when searching for test files:
-FIND_TESTS_EXCLUDE_FLAGS ?= \
-	$(FIND_COMMON_EXCLUDE_FLAGS) \
-	'!' -path "$(ROOT_DIR)/**/$(TESTS_FIXTURES_FOLDER)/*"
-
-# Define flags for finding test files:
-FIND_TESTS_FLAGS ?= \
-	-type f \
-	-name "$(TESTS_PATTERN)" \
-	-regex "$(TESTS_FILTER)" \
-	$(FIND_TESTS_EXCLUDE_FLAGS)
-
-ifneq ($(OS), Darwin)
-	FIND_TESTS_FLAGS := -regextype posix-extended $(FIND_TESTS_FLAGS)
-endif
-
-# Define a command to list test files:
-FIND_TESTS_CMD ?= find $(find_kernel_prefix) $(ROOT_DIR) $(FIND_TESTS_FLAGS)
-
-
-# RULES #
-
-#/
-# Default target.
-#
-# @example
-# make
-#
-# @example
-# make all
-#/
-all: help
-
-.PHONY: all
-
-#/
-# Prints a `Makefile` help message.
-#
-# @example
-# make help
-#/
-help:
-	$(QUIET) echo 'Read the Makefile to see the list of available commands.'
-	$(QUIET) echo ''
-
-.PHONY: help
-
-#/
-# Prints the runtime value of a `Makefile` variable.
-#
-# ## Notes
-#
-# -   The rule uses the following format:
-#
-#     ```bash
-#     $ make inspect.<variable>
-#     ```
-#
-# @example
-# make inspect.ROOT_DIR
-#
-# @example
-# make inspect.CC
-#/
-inspect.%:
-	$(QUIET) echo '$*=$($*)'
-
-#/
-# Runs the project's install sequence.
-#
-# @example
-# make install
-#/
-install:
-	$(NPM) install
-
-.PHONY: install
-
-#/
-# Removes node module dependencies.
-#
-# @example
-# make clean-node
-#/
-clean-node:
-	$(QUIET) $(DELETE) $(DELETE_FLAGS) $(NODE_MODULES)
-
-#/
-# Runs the project's cleanup sequence.
-#
-# @example
-# make clean
-#/
-clean: clean-node clean-cov
-	$(QUIET) $(DELETE) $(DELETE_FLAGS) $(BUILD_DIR)
-	$(QUIET) $(DELETE) $(DELETE_FLAGS) $(REPORTS_DIR)
-
-.PHONY: clean
-
-#/
-# Runs JavaScript benchmarks consecutively.
-#
-# ## Notes
-#
-# -   The recipe assumes that benchmark files can be run via Node.js.
-# -   This rule is useful when wanting to glob for JavaScript benchmark files (e.g., run all JavaScript benchmarks for a particular package).
-#
-#
-# @param {string} [BENCHMARKS_FILTER] - file path pattern (e.g., `.*/utils/group-by/.*`)
-#
-# @example
-# make benchmark
-#
-# @example
-# make benchmark BENCHMARKS_FILTER=".*/utils/group-by/.*"
-#/
-benchmark: $(NODE_MODULES)
-	$(QUIET) $(FIND_BENCHMARKS_CMD) | grep '^[\/]\|^[a-zA-Z]:[/\]' | while read -r file; do \
-		echo ""; \
-		echo "Running benchmark: $$file"; \
-		NODE_ENV="$(NODE_ENV_BENCHMARK)" \
-		NODE_PATH="$(NODE_PATH)" \
-		$(NODE) $$file || exit 1; \
-	done
-
-.PHONY: benchmark
-
-#/
-# Runs JavaScript examples consecutively.
-#
-# ## Notes
-#
-# -   This rule is useful when wanting to glob for JavaScript examples files (e.g., run all JavaScript examples for a particular package).
-# -   This rule **assumes** that examples files can be run using Node.js.
-#
-#
-# @param {string} [EXAMPLES_FILTER] - file path pattern (e.g., `.*/math/base/special/abs/.*`)
-#
-# @example
-# make examples
-#
-# @example
-# make examples EXAMPLES_FILTER=".*/strided/common/.*"
-#/
-examples: $(NODE_MODULES)
-	$(QUIET) $(FIND_EXAMPLES_CMD) | grep '^[\/]\|^[a-zA-Z]:[/\]' | while read -r file; do \
-		echo ""; \
-		echo "Running example: $$file"; \
-		NODE_ENV="$(NODE_ENV_EXAMPLES)" \
-		NODE_PATH="$(NODE_PATH)" \
-		$(NODE) $$file || exit 1; \
-	done
-
-.PHONY: examples
-
-#/
-# Runs JavaScript tests consecutively.
-#
-# ## Notes
-#
-# -   This rule is useful when wanting to glob for JavaScript test files (e.g., run all JavaScript tests for a particular package).
-# -   This rule **assumes** that test files can be run using Node.js.
-#
-#
-# @param {string} [TEST_FILTER] - file path pattern (e.g., `.*/math/base/special/abs/.*`)
-#
-# @example
-# make test
-#
-# @example
-# make test TESTS_FILTER=".*/strided/common/.*"
-#/
-test: $(NODE_MODULES)
-	$(QUIET) $(FIND_TESTS_CMD) | grep '^[\/]\|^[a-zA-Z]:[/\]' | while read -r test; do \
-		echo ''; \
-		echo "Running test: $$test"; \
-		NODE_ENV="$(NODE_ENV_TEST)" \
-		NODE_PATH="$(NODE_PATH)" \
-		$(JAVASCRIPT_TEST) \
-			$(JAVASCRIPT_TEST_FLAGS) \
-			$$test \
-		| $(TAP_REPORTER) || exit 1; \
-	done
-
-.PHONY: test
-
-#/
-# Runs unit tests and generate a test coverage report.
-#
-# @example
-# make test-cov
-#/
-test-cov: clean-cov
-	$(QUIET) NODE_ENV="$(NODE_ENV_TEST)" \
-	NODE_PATH="$(NODE_PATH)" \
-	$(ISTANBUL_COVER) $(ISTANBUL_COVER_FLAGS) $(JAVASCRIPT_TEST) -- $$( $(FIND_TESTS_CMD) )
-
-.PHONY: test-cov
-
-#/
-# Removes a test coverage directory.
-#
-# @example
-# make clean-cov
-#/
-clean-cov:
-	$(QUIET) $(DELETE) $(DELETE_FLAGS) $(COVERAGE_DIR)
diff --git a/README.md b/README.md
index 9475fdb..86aa652 100644
--- a/README.md
+++ b/README.md
@@ -41,32 +41,38 @@ limitations under the License.
 
 <!-- /.intro -->
 
-<section class="installation">
 
-## Installation
 
-```bash
-npm install @stdlib/ndarray-base-some
-```
+<section class="usage">
 
-Alternatively,
+## Usage
 
--   To load the package in a website via a `script` tag without installation and bundlers, use the [ES Module][es-module] available on the [`esm`][esm-url] branch (see [README][esm-readme]).
--   If you are using Deno, visit the [`deno`][deno-url] branch (see [README][deno-readme] for usage intructions).
--   For use in Observable, or in browser/node environments, use the [Universal Module Definition (UMD)][umd] build available on the [`umd`][umd-url] branch (see [README][umd-readme]).
+To use in Observable,
 
-The [branches.md][branches-url] file summarizes the available branches and displays a diagram illustrating their relationships.
+```javascript
+some = require( 'https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-some@umd/browser.js' )
+```
 
-To view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.
+To vendor stdlib functionality and avoid installing dependency trees for Node.js, you can use the UMD server build:
 
-</section>
+```javascript
+var some = require( 'path/to/vendor/umd/ndarray-base-some/index.js' )
+```
 
-<section class="usage">
+To include the bundle in a webpage,
 
-## Usage
+```html
+<script type="text/javascript" src="https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-some@umd/browser.js"></script>
+```
 
-```javascript
-var some = require( '@stdlib/ndarray-base-some' );
+If no recognized module system is present, access bundle contents via the global scope:
+
+```html
+<script type="text/javascript">
+(function () {
+    window.some;
+})();
+</script>
 ```
 
 #### some( arrays )
@@ -144,11 +150,16 @@ Each provided ndarray should be an object with the following properties:
 
 <!-- eslint no-undef: "error" -->
 
-```javascript
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var ndarray2array = require( '@stdlib/ndarray-base-to-array' );
-var some = require( '@stdlib/ndarray-base-some' );
+```html
+<!DOCTYPE html>
+<html lang="en">
+<body>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/gh/stdlib-js/random-array-discrete-uniform@umd/browser.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-from-scalar@umd/browser.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-to-array@umd/browser.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-some@umd/browser.js"></script>
+<script type="text/javascript">
+(function () {
 
 var x = {
     'dtype': 'generic',
@@ -168,6 +179,11 @@ var n = scalar2ndarray( 5, {
 
 var out = some( [ x, n ] );
 console.log( out );
+
+})();
+</script>
+</body>
+</html>
 ```
 
 </section>
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.10d_blocked_columnmajor.js b/benchmark/benchmark.10d_blocked_columnmajor.js
deleted file mode 100644
index 57c991b..0000000
--- a/benchmark/benchmark.10d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/10d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/10.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 9 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.10d_blocked_rowmajor.js b/benchmark/benchmark.10d_blocked_rowmajor.js
deleted file mode 100644
index 29f74d5..0000000
--- a/benchmark/benchmark.10d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/10d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/10.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 9 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.10d_columnmajor.js b/benchmark/benchmark.10d_columnmajor.js
deleted file mode 100644
index cc56996..0000000
--- a/benchmark/benchmark.10d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/10d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/10.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 9 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.10d_rowmajor.js b/benchmark/benchmark.10d_rowmajor.js
deleted file mode 100644
index cdf5bac..0000000
--- a/benchmark/benchmark.10d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/10d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/10.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 9 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.11d_columnmajor.js b/benchmark/benchmark.11d_columnmajor.js
deleted file mode 100644
index cbf3b1b..0000000
--- a/benchmark/benchmark.11d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/nd.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/11.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 10 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.11d_rowmajor.js b/benchmark/benchmark.11d_rowmajor.js
deleted file mode 100644
index 462d2cc..0000000
--- a/benchmark/benchmark.11d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/nd.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/11.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 10 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.1d_columnmajor.js b/benchmark/benchmark.1d_columnmajor.js
deleted file mode 100644
index 56f7b6f..0000000
--- a/benchmark/benchmark.1d_columnmajor.js
+++ /dev/null
@@ -1,129 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-	var n;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	n = scalar2ndarray( len, {
-		'dtype': 'generic',
-		'order': order
-	});
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( [ x, n ] );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.1d_rowmajor.js b/benchmark/benchmark.1d_rowmajor.js
deleted file mode 100644
index e0dbf22..0000000
--- a/benchmark/benchmark.1d_rowmajor.js
+++ /dev/null
@@ -1,129 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-	var n;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	n = scalar2ndarray( len, {
-		'dtype': 'generic',
-		'order': order
-	});
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( [ x, n ] );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_blocked_columnmajor.js b/benchmark/benchmark.2d_blocked_columnmajor.js
deleted file mode 100644
index 445f5b3..0000000
--- a/benchmark/benchmark.2d_blocked_columnmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_blocked_rowmajor.js b/benchmark/benchmark.2d_blocked_rowmajor.js
deleted file mode 100644
index 583dbf2..0000000
--- a/benchmark/benchmark.2d_blocked_rowmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_columnmajor.js b/benchmark/benchmark.2d_columnmajor.js
deleted file mode 100644
index f2a8745..0000000
--- a/benchmark/benchmark.2d_columnmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_rowmajor.js b/benchmark/benchmark.2d_rowmajor.js
deleted file mode 100644
index ef59186..0000000
--- a/benchmark/benchmark.2d_rowmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_rowmajor_accessors.js b/benchmark/benchmark.2d_rowmajor_accessors.js
deleted file mode 100644
index ae2b1ea..0000000
--- a/benchmark/benchmark.2d_rowmajor_accessors.js
+++ /dev/null
@@ -1,161 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d_accessors.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Returns an array data buffer element.
-*
-* @private
-* @param {Collection} buf - data buffer
-* @param {NonNegativeInteger} idx - element index
-* @returns {*} element
-*/
-function get( buf, idx ) {
-	return buf[ idx ];
-}
-
-/**
-* Sets an array data buffer element.
-*
-* @private
-* @param {Collection} buf - data buffer
-* @param {NonNegativeInteger} idx - element index
-* @param {*} value - value to set
-*/
-function set( buf, idx, value ) {
-	buf[ idx ] = value;
-}
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order,
-		'accessorProtocol': true,
-		'accessors': [ get, set ]
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.2d_rowmajor_accessors_complex.js b/benchmark/benchmark.2d_rowmajor_accessors_complex.js
deleted file mode 100644
index cfa5c74..0000000
--- a/benchmark/benchmark.2d_rowmajor_accessors_complex.js
+++ /dev/null
@@ -1,163 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var sqrt = require( '@stdlib/math-base-special-sqrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var ctors = require( '@stdlib/array-typed-complex-ctors' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/2d_accessors.js' );
-
-
-// VARIABLES //
-
-var types = [ 'complex64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Returns an array data buffer element.
-*
-* @private
-* @param {Collection} buf - data buffer
-* @param {NonNegativeInteger} idx - element index
-* @returns {*} element
-*/
-function get( buf, idx ) {
-	return buf.get( idx );
-}
-
-/**
-* Sets an array data buffer element.
-*
-* @private
-* @param {Collection} buf - data buffer
-* @param {NonNegativeInteger} idx - element index
-* @param {*} value - value to set
-*/
-function set( buf, idx, value ) {
-	buf.set( value, idx );
-}
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var xbuf;
-	var x;
-
-	xbuf = discreteUniform( len*2, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': new ( ctors( xtype ) )( xbuf.buffer ),
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order,
-		'accessorProtocol': true,
-		'accessors': [ get, set ]
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len*2 );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 5; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( sqrt( len ) );
-			sh = [ len, len ];
-			len *= len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::accessors:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.3d_blocked_columnmajor.js b/benchmark/benchmark.3d_blocked_columnmajor.js
deleted file mode 100644
index 0688919..0000000
--- a/benchmark/benchmark.3d_blocked_columnmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var cbrt = require( '@stdlib/math-base-special-cbrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/3d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( cbrt( len ) );
-			sh = [ len, len, len ];
-			len *= len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.3d_blocked_rowmajor.js b/benchmark/benchmark.3d_blocked_rowmajor.js
deleted file mode 100644
index ee0247d..0000000
--- a/benchmark/benchmark.3d_blocked_rowmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var cbrt = require( '@stdlib/math-base-special-cbrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/3d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( cbrt( len ) );
-			sh = [ len, len, len ];
-			len *= len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.3d_columnmajor.js b/benchmark/benchmark.3d_columnmajor.js
deleted file mode 100644
index fda878d..0000000
--- a/benchmark/benchmark.3d_columnmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var cbrt = require( '@stdlib/math-base-special-cbrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/3d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( cbrt( len ) );
-			sh = [ len, len, len ];
-			len *= len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.3d_rowmajor.js b/benchmark/benchmark.3d_rowmajor.js
deleted file mode 100644
index d5d1403..0000000
--- a/benchmark/benchmark.3d_rowmajor.js
+++ /dev/null
@@ -1,135 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var cbrt = require( '@stdlib/math-base-special-cbrt' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/3d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( cbrt( len ) );
-			sh = [ len, len, len ];
-			len *= len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.4d_blocked_columnmajor.js b/benchmark/benchmark.4d_blocked_columnmajor.js
deleted file mode 100644
index 54dbc86..0000000
--- a/benchmark/benchmark.4d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/4d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/4.0 ) );
-			sh = [ len, len, len, len ];
-			len *= len * len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.4d_blocked_rowmajor.js b/benchmark/benchmark.4d_blocked_rowmajor.js
deleted file mode 100644
index aa4e286..0000000
--- a/benchmark/benchmark.4d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/4d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/4.0 ) );
-			sh = [ len, len, len, len ];
-			len *= len * len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.4d_columnmajor.js b/benchmark/benchmark.4d_columnmajor.js
deleted file mode 100644
index 88e7e60..0000000
--- a/benchmark/benchmark.4d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/4d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/4.0 ) );
-			sh = [ len, len, len, len ];
-			len *= len * len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.4d_rowmajor.js b/benchmark/benchmark.4d_rowmajor.js
deleted file mode 100644
index c408692..0000000
--- a/benchmark/benchmark.4d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/4d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/4.0 ) );
-			sh = [ len, len, len, len ];
-			len *= len * len * len;
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.5d_blocked_columnmajor.js b/benchmark/benchmark.5d_blocked_columnmajor.js
deleted file mode 100644
index a96e4df..0000000
--- a/benchmark/benchmark.5d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/5d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/5.0 ) );
-			sh = [ len, len, len, len, len ];
-			len *= pow( len, 4 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.5d_blocked_rowmajor.js b/benchmark/benchmark.5d_blocked_rowmajor.js
deleted file mode 100644
index a95188f..0000000
--- a/benchmark/benchmark.5d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/5d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/5.0 ) );
-			sh = [ len, len, len, len, len ];
-			len *= pow( len, 4 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.5d_columnmajor.js b/benchmark/benchmark.5d_columnmajor.js
deleted file mode 100644
index 7de5ee5..0000000
--- a/benchmark/benchmark.5d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/5d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/5.0 ) );
-			sh = [ len, len, len, len, len ];
-			len *= pow( len, 4 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.5d_rowmajor.js b/benchmark/benchmark.5d_rowmajor.js
deleted file mode 100644
index 1403f6c..0000000
--- a/benchmark/benchmark.5d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/5d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/5.0 ) );
-			sh = [ len, len, len, len, len ];
-			len *= pow( len, 4 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.6d_blocked_columnmajor.js b/benchmark/benchmark.6d_blocked_columnmajor.js
deleted file mode 100644
index d1b5def..0000000
--- a/benchmark/benchmark.6d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/6d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/6.0 ) );
-			sh = [ len, len, len, len, len, len ];
-			len *= pow( len, 5 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.6d_blocked_rowmajor.js b/benchmark/benchmark.6d_blocked_rowmajor.js
deleted file mode 100644
index db5c144..0000000
--- a/benchmark/benchmark.6d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/6d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/6.0 ) );
-			sh = [ len, len, len, len, len, len ];
-			len *= pow( len, 5 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.6d_columnmajor.js b/benchmark/benchmark.6d_columnmajor.js
deleted file mode 100644
index 8d86a70..0000000
--- a/benchmark/benchmark.6d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/6d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/6.0 ) );
-			sh = [ len, len, len, len, len, len ];
-			len *= pow( len, 5 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.6d_rowmajor.js b/benchmark/benchmark.6d_rowmajor.js
deleted file mode 100644
index 961ac13..0000000
--- a/benchmark/benchmark.6d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/6d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/6.0 ) );
-			sh = [ len, len, len, len, len, len ];
-			len *= pow( len, 5 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.7d_blocked_columnmajor.js b/benchmark/benchmark.7d_blocked_columnmajor.js
deleted file mode 100644
index e19250c..0000000
--- a/benchmark/benchmark.7d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/7d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/7.0 ) );
-			sh = [ len, len, len, len, len, len, len ];
-			len *= pow( len, 6 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.7d_blocked_rowmajor.js b/benchmark/benchmark.7d_blocked_rowmajor.js
deleted file mode 100644
index 3f580a3..0000000
--- a/benchmark/benchmark.7d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/7d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/7.0 ) );
-			sh = [ len, len, len, len, len, len, len ];
-			len *= pow( len, 6 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.7d_columnmajor.js b/benchmark/benchmark.7d_columnmajor.js
deleted file mode 100644
index 6efe4f9..0000000
--- a/benchmark/benchmark.7d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/7d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/7.0 ) );
-			sh = [ len, len, len, len, len, len, len ];
-			len *= pow( len, 6 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.7d_rowmajor.js b/benchmark/benchmark.7d_rowmajor.js
deleted file mode 100644
index 842febe..0000000
--- a/benchmark/benchmark.7d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/7d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/7.0 ) );
-			sh = [ len, len, len, len, len, len, len ];
-			len *= pow( len, 6 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.8d_blocked_columnmajor.js b/benchmark/benchmark.8d_blocked_columnmajor.js
deleted file mode 100644
index 7f4cc6d..0000000
--- a/benchmark/benchmark.8d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/8d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/8.0 ) );
-			sh = [ len, len, len, len, len, len, len, len ];
-			len *= pow( len, 7 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.8d_blocked_rowmajor.js b/benchmark/benchmark.8d_blocked_rowmajor.js
deleted file mode 100644
index 7f4cc6d..0000000
--- a/benchmark/benchmark.8d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/8d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/8.0 ) );
-			sh = [ len, len, len, len, len, len, len, len ];
-			len *= pow( len, 7 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.8d_columnmajor.js b/benchmark/benchmark.8d_columnmajor.js
deleted file mode 100644
index 62d3da5..0000000
--- a/benchmark/benchmark.8d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/8d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/8.0 ) );
-			sh = [ len, len, len, len, len, len, len, len ];
-			len *= pow( len, 7 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.8d_rowmajor.js b/benchmark/benchmark.8d_rowmajor.js
deleted file mode 100644
index b7fa586..0000000
--- a/benchmark/benchmark.8d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/8d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/8.0 ) );
-			sh = [ len, len, len, len, len, len, len, len ];
-			len *= pow( len, 7 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.9d_blocked_columnmajor.js b/benchmark/benchmark.9d_blocked_columnmajor.js
deleted file mode 100644
index ff995a5..0000000
--- a/benchmark/benchmark.9d_blocked_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/9d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/9.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 8 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.9d_blocked_rowmajor.js b/benchmark/benchmark.9d_blocked_rowmajor.js
deleted file mode 100644
index bef9898..0000000
--- a/benchmark/benchmark.9d_blocked_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/9d_blocked.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/9.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 8 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s::blocked:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.9d_columnmajor.js b/benchmark/benchmark.9d_columnmajor.js
deleted file mode 100644
index 2221dda..0000000
--- a/benchmark/benchmark.9d_columnmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/9d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'column-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/9.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 8 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/benchmark/benchmark.9d_rowmajor.js b/benchmark/benchmark.9d_rowmajor.js
deleted file mode 100644
index f01cad4..0000000
--- a/benchmark/benchmark.9d_rowmajor.js
+++ /dev/null
@@ -1,134 +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 isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var pow = require( '@stdlib/math-base-special-pow' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var format = require( '@stdlib/string-format' );
-var pkg = require( './../package.json' ).name;
-var some = require( './../lib/9d.js' );
-
-
-// VARIABLES //
-
-var types = [ 'float64' ];
-var order = 'row-major';
-
-
-// FUNCTIONS //
-
-/**
-* Creates a benchmark function.
-*
-* @private
-* @param {PositiveInteger} len - ndarray length
-* @param {NonNegativeIntegerArray} shape - ndarray shape
-* @param {string} xtype - ndarray data type
-* @returns {Function} benchmark function
-*/
-function createBenchmark( len, shape, xtype ) {
-	var x;
-
-	x = discreteUniform( len, 1, 100 );
-	x = {
-		'dtype': xtype,
-		'data': x,
-		'shape': shape,
-		'strides': shape2strides( shape, order ),
-		'offset': 0,
-		'order': order
-	};
-	return benchmark;
-
-	/**
-	* Benchmark function.
-	*
-	* @private
-	* @param {Benchmark} b - benchmark instance
-	*/
-	function benchmark( b ) {
-		var out;
-		var i;
-
-		b.tic();
-		for ( i = 0; i < b.iterations; i++ ) {
-			out = some( x, len );
-			if ( typeof out !== 'boolean' ) {
-				b.fail( 'should return a boolean' );
-			}
-		}
-		b.toc();
-		if ( !isBoolean( out ) ) {
-			b.fail( 'should return a boolean' );
-		}
-		b.pass( 'benchmark finished' );
-		b.end();
-	}
-}
-
-
-// MAIN //
-
-/**
-* Main execution sequence.
-*
-* @private
-*/
-function main() {
-	var len;
-	var min;
-	var max;
-	var sh;
-	var t1;
-	var f;
-	var i;
-	var j;
-
-	min = 1; // 10^min
-	max = 6; // 10^max
-
-	for ( j = 0; j < types.length; j++ ) {
-		t1 = types[ j ];
-		for ( i = min; i <= max; i++ ) {
-			len = pow( 10, i );
-
-			sh = [ len/2, 2, 1, 1, 1, 1, 1, 1, 1 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			sh = [ 1, 1, 1, 1, 1, 1, 1, 2, len/2 ];
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-
-			len = floor( pow( len, 1.0/9.0 ) );
-			sh = [ len, len, len, len, len, len, len, len, len ];
-			len *= pow( len, 8 );
-			f = createBenchmark( len, sh, t1 );
-			bench( format( '%s:ndims=%d,len=%d,shape=[%s],xorder=%s,xtype=%s', pkg, sh.length, len, sh.join(','), order, t1 ), f );
-		}
-	}
-}
-
-main();
diff --git a/branches.md b/branches.md
deleted file mode 100644
index 5f077a3..0000000
--- a/branches.md
+++ /dev/null
@@ -1,56 +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.
-
--->
-
-# Branches
-
-This repository has the following branches:
-
--   **main**: default branch generated from the [stdlib project][stdlib-url], where all development takes place.
--   **production**: [production build][production-url] of the package (e.g., reformatted error messages to reduce bundle sizes and thus the number of bytes transmitted over a network).
--   **esm**: [ES Module][esm-url] branch for use via a `script` tag without the need for installation and bundlers (see [README][esm-readme]).
--   **deno**: [Deno][deno-url] branch for use in Deno (see [README][deno-readme]).
--   **umd**: [UMD][umd-url] branch for use in Observable, or in dual browser/Node.js environments (see [README][umd-readme]).
-
-The following diagram illustrates the relationships among the above branches:
-
-```mermaid
-graph TD;
-A[stdlib]-->|generate standalone package|B;
-B[main] -->|productionize| C[production];
-C -->|bundle| D[esm];
-C -->|bundle| E[deno];
-C -->|bundle| F[umd];
-
-%% click A href "https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/some"
-%% click B href "https://github.com/stdlib-js/ndarray-base-some/tree/main"
-%% click C href "https://github.com/stdlib-js/ndarray-base-some/tree/production"
-%% click D href "https://github.com/stdlib-js/ndarray-base-some/tree/esm"
-%% click E href "https://github.com/stdlib-js/ndarray-base-some/tree/deno"
-%% click F href "https://github.com/stdlib-js/ndarray-base-some/tree/umd"
-```
-
-[stdlib-url]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/some
-[production-url]: https://github.com/stdlib-js/ndarray-base-some/tree/production
-[deno-url]: https://github.com/stdlib-js/ndarray-base-some/tree/deno
-[deno-readme]: https://github.com/stdlib-js/ndarray-base-some/blob/deno/README.md
-[umd-url]: https://github.com/stdlib-js/ndarray-base-some/tree/umd
-[umd-readme]: https://github.com/stdlib-js/ndarray-base-some/blob/umd/README.md
-[esm-url]: https://github.com/stdlib-js/ndarray-base-some/tree/esm
-[esm-readme]: https://github.com/stdlib-js/ndarray-base-some/blob/esm/README.md
\ No newline at end of file
diff --git a/browser.js b/browser.js
new file mode 100644
index 0000000..a55a2a3
--- /dev/null
+++ b/browser.js
@@ -0,0 +1,3 @@
+// Copyright (c) 2026 The Stdlib Authors. License is Apache-2.0: http://www.apache.org/licenses/LICENSE-2.0
+var r,t;r=this,t=function(){"use strict";var r=8,t=16,e=1,n="function"==typeof Object.defineProperty?Object.defineProperty:null,o=Object.defineProperty;function i(r){return"number"==typeof r}function a(r){var t,e="";for(t=0;t<r;t++)e+="0";return e}function f(r,t,e){var n=!1,o=t-r.length;return o<0||(function(r){return"-"===r[0]}(r)&&(n=!0,r=r.substr(1)),r=e?r+a(o):a(o)+r,n&&(r="-"+r)),r}var u=String.prototype.toLowerCase,s=String.prototype.toUpperCase;function l(r){var t,e,n;switch(r.specifier){case"b":t=2;break;case"o":t=8;break;case"x":case"X":t=16;break;default:t=10}if(e=r.arg,n=parseInt(e,10),!isFinite(n)){if(!i(e))throw new Error("invalid integer. Value: "+e);n=0}return n<0&&("u"===r.specifier||10!==t)&&(n=4294967295+n+1),n<0?(e=(-n).toString(t),r.precision&&(e=f(e,r.precision,r.padRight)),e="-"+e):(e=n.toString(t),n||r.precision?r.precision&&(e=f(e,r.precision,r.padRight)):e="",r.sign&&(e=r.sign+e)),16===t&&(r.alternate&&(e="0x"+e),e=r.specifier===s.call(r.specifier)?s.call(e):u.call(e)),8===t&&r.alternate&&"0"!==e.charAt(0)&&(e="0"+e),e}var h=Math.abs,c=String.prototype.toLowerCase,p=String.prototype.toUpperCase,y=String.prototype.replace,g=/e\+(\d)$/,m=/e-(\d)$/,v=/^(\d+)$/,d=/^(\d+)e/,w=/\.0$/,b=/\.0*e/,E=/(\..*[^0])0*e/;function _(r,t){var e,n;switch(t.specifier){case"e":case"E":n=r.toExponential(t.precision);break;case"f":case"F":n=r.toFixed(t.precision);break;case"g":case"G":h(r)<1e-4?((e=t.precision)>0&&(e-=1),n=r.toExponential(e)):n=r.toPrecision(t.precision),t.alternate||(n=y.call(n,E,"$1e"),n=y.call(n,b,"e"),n=y.call(n,w,""));break;default:throw new Error("invalid double notation. Value: "+t.specifier)}return n=y.call(n,g,"e+0$1"),n=y.call(n,m,"e-0$1"),t.alternate&&(n=y.call(n,v,"$1."),n=y.call(n,d,"$1.e")),r>=0&&t.sign&&(n=t.sign+n),n=t.specifier===p.call(t.specifier)?p.call(n):c.call(n)}function T(r){var t,e="";for(t=0;t<r;t++)e+=" ";return e}var x=String.fromCharCode,V=Array.isArray;function A(r){return r!=r}function j(r){var t={};return t.specifier=r.specifier,t.precision=void 0===r.precision?1:r.precision,t.width=r.width,t.flags=r.flags||"",t.mapping=r.mapping,t}function S(r){var t,e,n,o,a,u,s,h,c,p,y,g,m,v;if(!V(r))throw new TypeError("invalid argument. First argument must be an array. Value: `"+r+"`.");for(u="",s=1,c=0;c<r.length;c++)if("string"==typeof(n=r[c]))u+=n;else{if(t=void 0!==n.precision,!(n=j(n)).specifier)throw new TypeError("invalid argument. Token is missing `specifier` property. Index: `"+c+"`. Value: `"+n+"`.");for(n.mapping&&(s=n.mapping),e=n.flags,p=0;p<e.length;p++)switch(o=e.charAt(p)){case" ":n.sign=" ";break;case"+":n.sign="+";break;case"-":n.padRight=!0,n.padZeros=!1;break;case"0":n.padZeros=e.indexOf("-")<0;break;case"#":n.alternate=!0;break;default:throw new Error("invalid flag: "+o)}if("*"===n.width){if(n.width=parseInt(arguments[s],10),s+=1,A(n.width))throw new TypeError("the argument for * width at position "+s+" is not a number. Value: `"+n.width+"`.");n.width<0&&(n.padRight=!0,n.width=-n.width)}if(t&&"*"===n.precision){if(n.precision=parseInt(arguments[s],10),s+=1,A(n.precision))throw new TypeError("the argument for * precision at position "+s+" is not a number. Value: `"+n.precision+"`.");n.precision<0&&(n.precision=1,t=!1)}switch(n.arg=arguments[s],n.specifier){case"b":case"o":case"x":case"X":case"d":case"i":case"u":t&&(n.padZeros=!1),n.arg=l(n);break;case"s":n.maxWidth=t?n.precision:-1,n.arg=String(n.arg);break;case"c":if(!A(n.arg)){if((a=parseInt(n.arg,10))<0||a>127)throw new Error("invalid character code. Value: "+n.arg);n.arg=A(a)?String(n.arg):x(a)}break;case"e":case"E":case"f":case"F":case"g":case"G":if(t||(n.precision=6),h=parseFloat(n.arg),!isFinite(h)){if(!i(n.arg))throw new Error("invalid floating-point number. Value: "+u);h=n.arg,n.padZeros=!1}n.arg=_(h,n);break;default:throw new Error("invalid specifier: "+n.specifier)}n.maxWidth>=0&&n.arg.length>n.maxWidth&&(n.arg=n.arg.substring(0,n.maxWidth)),n.padZeros?n.arg=f(n.arg,n.width||n.precision,n.padRight):n.width&&(n.arg=(y=n.arg,g=n.width,m=n.padRight,v=void 0,(v=g-y.length)<0?y:y=m?y+T(v):T(v)+y)),u+=n.arg||"",s+=1}return u}var F=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function L(r){var t={mapping:r[1]?parseInt(r[1],10):void 0,flags:r[2],width:r[3],precision:r[5],specifier:r[6]};return"."===r[4]&&void 0===r[5]&&(t.precision="1"),t}function O(r){var t,e,n,o;for(e=[],o=0,n=F.exec(r);n;)(t=r.slice(o,F.lastIndex-n[0].length)).length&&e.push(t),"%"===n[6]?e.push("%"):e.push(L(n)),o=F.lastIndex,n=F.exec(r);return(t=r.slice(o)).length&&e.push(t),e}function I(r){var t,e;if("string"!=typeof r)throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));for(t=[O(r)],e=1;e<arguments.length;e++)t.push(arguments[e]);return S.apply(null,t)}var k,B=Object.prototype,R=B.toString,P=B.__defineGetter__,M=B.__defineSetter__,C=B.__lookupGetter__,N=B.__lookupSetter__;k=function(){try{return n({},"x",{}),!0}catch(r){return!1}}()?o:function(r,t,e){var n,o,i,a;if("object"!=typeof r||null===r||"[object Array]"===R.call(r))throw new TypeError(I("invalid argument. First argument must be an object. Value: `%s`.",r));if("object"!=typeof e||null===e||"[object Array]"===R.call(e))throw new TypeError(I("invalid argument. Property descriptor must be an object. Value: `%s`.",e));if((o="value"in e)&&(C.call(r,t)||N.call(r,t)?(n=r.__proto__,r.__proto__=B,delete r[t],r[t]=e.value,r.__proto__=n):r[t]=e.value),i="get"in e,a="set"in e,o&&(i||a))throw new Error("invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.");return i&&P&&P.call(r,t,e.get),a&&M&&M.call(r,t,e.set),r};var U=k;function Y(r,t,e){U(r,t,{configurable:!1,enumerable:!1,writable:!1,value:e})}function W(r,t,e){var n,o,i,a,f;for(n=r.length,o=e,i=e,f=0;f<n;f++){if(0===r[f])return[e,e];(a=t[f])>0?i+=a*(r[f]-1):a<0&&(o+=a*(r[f]-1))}return[o,i]}Y(W,"assign",(function(r,t,e,n){var o,i,a,f,u;for(o=r.length,i=e,a=e,u=0;u<o;u++){if(0===r[u])return n[0]=e,n[1]=e,n;(f=t[u])>0?a+=f*(r[u]-1):f<0&&(i+=f*(r[u]-1))}return n[0]=i,n[1]=a,n}));var Z="function";function $(r){return typeof r.get===Z&&typeof r.set===Z}var G={complex128:function(r,t){return r.get(t)},complex64:function(r,t){return r.get(t)},default:function(r,t){return r.get(t)}};function K(r){var t=G[r];return"function"==typeof t?t:G.default}var X={complex128:function(r,t,e){r.set(e,t)},complex64:function(r,t,e){r.set(e,t)},default:function(r,t,e){r.set(e,t)}};function z(r){var t=X[r];return"function"==typeof t?t:X.default}var H={float64:function(r,t){return r[t]},float32:function(r,t){return r[t]},int32:function(r,t){return r[t]},int16:function(r,t){return r[t]},int8:function(r,t){return r[t]},uint32:function(r,t){return r[t]},uint16:function(r,t){return r[t]},uint8:function(r,t){return r[t]},uint8c:function(r,t){return r[t]},generic:function(r,t){return r[t]},default:function(r,t){return r[t]}};function J(r){var t=H[r];return"function"==typeof t?t:H.default}var D={float64:function(r,t,e){r[t]=e},float32:function(r,t,e){r[t]=e},int32:function(r,t,e){r[t]=e},int16:function(r,t,e){r[t]=e},int8:function(r,t,e){r[t]=e},uint32:function(r,t,e){r[t]=e},uint16:function(r,t,e){r[t]=e},uint8:function(r,t,e){r[t]=e},uint8c:function(r,t,e){r[t]=e},generic:function(r,t,e){r[t]=e},default:function(r,t,e){r[t]=e}};function q(r){var t=D[r];return"function"==typeof t?t:D.default}function Q(r){var t,e,n;if(0===(t=r.length))return 0;for(e=1,n=0;n<t;n++)e*=r[n];return e}function rr(r){var t,e,n;for(e=r.length,t=[],n=0;n<e;n++)t.push(r[n]);return t}function tr(r){return"string"==typeof r}var er="function"==typeof Symbol&&"symbol"==typeof Symbol("foo");function nr(){return er&&"symbol"==typeof Symbol.toStringTag}var or=Object.prototype.toString,ir=Object.prototype.hasOwnProperty;function ar(r,t){return null!=r&&ir.call(r,t)}var fr="function"==typeof Symbol?Symbol:void 0,ur="function"==typeof fr?fr.toStringTag:"",sr=nr()?function(r){var t,e,n;if(null==r)return or.call(r);e=r[ur],t=ar(r,ur);try{r[ur]=void 0}catch(t){return or.call(r)}return n=or.call(r),t?r[ur]=e:delete r[ur],n}:function(r){return or.call(r)},lr=String.prototype.valueOf,hr=nr();function cr(r){return"object"==typeof r&&(r instanceof String||(hr?function(r){try{return lr.call(r),!0}catch(r){return!1}}(r):"[object String]"===sr(r)))}function pr(r){return tr(r)||cr(r)}function yr(r){return"column-major"===r}function gr(r,t){return yr(t)?function(r){var t,e,n;for(t=[],e=1,n=0;n<r.length;n++)t.push(e),e*=r[n];return t}(r):function(r){var t,e,n,o;for(t=r.length,e=[],o=0;o<t;o++)e.push(0);for(n=1,o=t-1;o>=0;o--)e[o]=n,n*=r[o];return e}(r)}Y(pr,"isPrimitive",tr),Y(pr,"isObject",cr),Y(gr,"assign",(function(r,t,e){return yr(t)?function(r,t){var e,n;for(e=1,n=0;n<r.length;n++)t[n]=e,e*=r[n];return t}(r,e):function(r,t){var e,n;for(e=1,n=r.length-1;n>=0;n--)t[n]=e,e*=r[n];return t}(r,e)}));var mr="row-major";function vr(r,t){var e,n,o;return"object"!=typeof(o=r.strides)||null===o?0===(n=r.shape).length?[0]:(tr(e=r.order)||(e=mr),gr(n,e)):t?rr(o):o}function dr(r){return"number"==typeof r}var wr=Number,br=wr.prototype.toString,Er=nr();function _r(r){return"object"==typeof r&&(r instanceof wr||(Er?function(r){try{return br.call(r),!0}catch(r){return!1}}(r):"[object Number]"===sr(r)))}function Tr(r){return dr(r)||_r(r)}function xr(r){var t,e,n;return dr(n=r.offset)?n:0===(e=r.shape).length||"object"!=typeof(t=r.strides)||null===t?0:function(r,t){var e,n,o;for(n=r.length,e=0,o=0;o<n;o++)t[o]<0&&(e-=t[o]*(r[o]-1));return e}(e,t)}function Vr(r){return Math.abs(r)}function Ar(r){var t,e,n,o,i,a;if(0===(e=r.length))return 0;for(t=!0,n=!0,o=Vr(r[0]),a=1;a<e;a++){if(i=Vr(r[a]),t&&i<o?t=!1:n&&i>o&&(n=!1),!n&&!t)return 0;o=i}return n&&t?3:n?1:2}Y(Tr,"isPrimitive",dr),Y(Tr,"isObject",_r);var jr="row-major",Sr="column-major";function Fr(r){var t,e;return tr(e=r.order)?e:"object"!=typeof(t=r.strides)||null===t||1===(e=Ar(t))||3===e?jr:2===e?Sr:0===r.shape.length?jr:null}function Lr(r){var t,e,n,o;return t=function(r){return r.data}(r),n=function(r,t){var e=r.shape;return t?rr(e):e}(r,!0),o=function(r){return r.dtype}(r),e=$(t),{ref:r,dtype:o,data:t,length:Q(n),shape:n,strides:vr(r,!0),offset:xr(r),order:Fr(r),accessorProtocol:e,accessors:e?[K(o),z(o)]:[J(o),q(o)]}}var Or=16;function Ir(r){return"object"==typeof r&&null!==r&&"Complex128Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===Or}var kr=8;function Br(r){return"object"==typeof r&&null!==r&&"Complex64Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===kr}var Rr,Pr="function"==typeof Float64Array,Mr="function"==typeof Float64Array?Float64Array:null,Cr="function"==typeof Float64Array?Float64Array:void 0;Rr=function(){var r,t,e;if("function"!=typeof Mr)return!1;try{t=new Mr([1,3.14,-3.14,NaN]),e=t,r=(Pr&&e instanceof Float64Array||"[object Float64Array]"===sr(e))&&1===t[0]&&3.14===t[1]&&-3.14===t[2]&&t[3]!=t[3]}catch(t){r=!1}return r}()?Cr:function(){throw new Error("not implemented")};var Nr=Rr;function Ur(r,t){return new Nr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}var Yr,Wr="function"==typeof Float32Array,Zr=Number.POSITIVE_INFINITY,$r="function"==typeof Float32Array?Float32Array:null,Gr="function"==typeof Float32Array?Float32Array:void 0;Yr=function(){var r,t,e;if("function"!=typeof $r)return!1;try{t=new $r([1,3.14,-3.14,5e40]),e=t,r=(Wr&&e instanceof Float32Array||"[object Float32Array]"===sr(e))&&1===t[0]&&3.140000104904175===t[1]&&-3.140000104904175===t[2]&&t[3]===Zr}catch(t){r=!1}return r}()?Gr:function(){throw new Error("not implemented")};var Kr=Yr;function Xr(r,t){return new Kr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}var zr,Hr="function"==typeof Uint8Array,Jr="function"==typeof Uint8Array?Uint8Array:null,Dr="function"==typeof Uint8Array?Uint8Array:void 0;zr=function(){var r,t,e;if("function"!=typeof Jr)return!1;try{t=new Jr(t=[1,3.14,-3.14,256,257]),e=t,r=(Hr&&e instanceof Uint8Array||"[object Uint8Array]"===sr(e))&&1===t[0]&&3===t[1]&&253===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?Dr:function(){throw new Error("not implemented")};var qr=zr,Qr=Array.isArray?Array.isArray:function(r){return"[object Array]"===sr(r)};function rt(r){if("function"!=typeof r)throw new TypeError(I("invalid argument. Must provide a function. Value: `%s`.",r));return function(t){var e,n;if(!Qr(t))return!1;if(0===(e=t.length))return!1;for(n=0;n<e;n++)if(!1===r(t[n]))return!1;return!0}}function tt(r){return null!==r&&"object"==typeof r}function et(r){return tt(r)&&(r._isBuffer||r.constructor&&"function"==typeof r.constructor.isBuffer&&r.constructor.isBuffer(r))}function nt(){return/^\s*function\s*([^(]*)/i}Y(tt,"isObjectLikeArray",rt(tt));var ot=/^\s*function\s*([^(]*)/i;function it(r){var t,e,n;if(("Object"===(e=sr(r).slice(8,-1))||"Error"===e)&&r.constructor){if("string"==typeof(n=r.constructor).name)return n.name;if(t=ot.exec(n.toString()))return t[1]}return et(r)?"Buffer":e}Y(nt,"REGEXP",ot);var at,ft={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"},ut="function"==typeof Uint32Array,st=4294967295,lt="function"==typeof Uint32Array?Uint32Array:null,ht="function"==typeof Uint32Array?Uint32Array:void 0;at=function(){var r,t,e;if("function"!=typeof lt)return!1;try{t=new lt(t=[1,3.14,-3.14,4294967296,4294967297]),e=t,r=(ut&&e instanceof Uint32Array||"[object Uint32Array]"===sr(e))&&1===t[0]&&3===t[1]&&4294967293===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?ht:function(){throw new Error("not implemented")};var ct,pt=at,yt="function"==typeof Int32Array,gt="function"==typeof Int32Array?Int32Array:null,mt="function"==typeof Int32Array?Int32Array:void 0;ct=function(){var r,t,e;if("function"!=typeof gt)return!1;try{t=new gt([1,3.14,-3.14,2147483648]),e=t,r=(yt&&e instanceof Int32Array||"[object Int32Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-2147483648===t[3]}catch(t){r=!1}return r}()?mt:function(){throw new Error("not implemented")};var vt,dt=ct,wt="function"==typeof Uint16Array,bt="function"==typeof Uint16Array?Uint16Array:null,Et="function"==typeof Uint16Array?Uint16Array:void 0;vt=function(){var r,t,e;if("function"!=typeof bt)return!1;try{t=new bt(t=[1,3.14,-3.14,65536,65537]),e=t,r=(wt&&e instanceof Uint16Array||"[object Uint16Array]"===sr(e))&&1===t[0]&&3===t[1]&&65533===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?Et:function(){throw new Error("not implemented")};var _t,Tt=vt,xt="function"==typeof Int16Array,Vt="function"==typeof Int16Array?Int16Array:null,At="function"==typeof Int16Array?Int16Array:void 0;_t=function(){var r,t,e;if("function"!=typeof Vt)return!1;try{t=new Vt([1,3.14,-3.14,32768]),e=t,r=(xt&&e instanceof Int16Array||"[object Int16Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-32768===t[3]}catch(t){r=!1}return r}()?At:function(){throw new Error("not implemented")};var jt,St=_t,Ft="function"==typeof Uint8ClampedArray,Lt="function"==typeof Uint8ClampedArray?Uint8ClampedArray:null,Ot="function"==typeof Uint8ClampedArray?Uint8ClampedArray:void 0;jt=function(){var r,t,e;if("function"!=typeof Lt)return!1;try{t=new Lt([-1,0,1,3.14,4.99,255,256]),e=t,r=(Ft&&e instanceof Uint8ClampedArray||"[object Uint8ClampedArray]"===sr(e))&&0===t[0]&&0===t[1]&&1===t[2]&&3===t[3]&&5===t[4]&&255===t[5]&&255===t[6]}catch(t){r=!1}return r}()?Ot:function(){throw new Error("not implemented")};var It,kt=jt,Bt="function"==typeof Int8Array,Rt="function"==typeof Int8Array?Int8Array:null,Pt="function"==typeof Int8Array?Int8Array:void 0;It=function(){var r,t,e;if("function"!=typeof Rt)return!1;try{t=new Rt([1,3.14,-3.14,128]),e=t,r=(Bt&&e instanceof Int8Array||"[object Int8Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-128===t[3]}catch(t){r=!1}return r}()?Pt:function(){throw new Error("not implemented")};var Mt=It,Ct=wr.NEGATIVE_INFINITY,Nt=Math.floor;function Ut(r){return Nt(r)===r}function Yt(r){return r<Zr&&r>Ct&&Ut(r)}function Wt(r){return dr(r)&&Yt(r)}function Zt(r){return _r(r)&&Yt(r.valueOf())}function $t(r){return Wt(r)||Zt(r)}function Gt(r){return Wt(r)&&r>=0}function Kt(r){return Zt(r)&&r.valueOf()>=0}function Xt(r){return Gt(r)||Kt(r)}Y($t,"isPrimitive",Wt),Y($t,"isObject",Zt),Y(Xt,"isPrimitive",Gt),Y(Xt,"isObject",Kt);var zt=4294967295;function Ht(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=zt}var Jt=9007199254740991;function Dt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=Jt}var qt="function"==typeof ArrayBuffer;function Qt(r){return qt&&r instanceof ArrayBuffer||"[object ArrayBuffer]"===sr(r)}function re(r){return"object"==typeof r&&null!==r&&!Qr(r)}var te=rt(pr.isPrimitive),ee=rt(pr.isObject),ne=rt(pr);Y(ne,"primitives",te),Y(ne,"objects",ee);var oe=/./;function ie(r){return"boolean"==typeof r}var ae=Boolean,fe=Boolean.prototype.toString,ue=nr();function se(r){return"object"==typeof r&&(r instanceof ae||(ue?function(r){try{return fe.call(r),!0}catch(r){return!1}}(r):"[object Boolean]"===sr(r)))}function le(r){return ie(r)||se(r)}Y(le,"isPrimitive",ie),Y(le,"isObject",se);var he="object"==typeof self?self:null,ce="object"==typeof window?window:null,pe="object"==typeof globalThis?globalThis:null,ye=function(r){if(arguments.length){if(!ie(r))throw new TypeError(I("invalid argument. Must provide a boolean. Value: `%s`.",r));if(r)return new Function("return this;")()}if(pe)return pe;if(he)return he;if(ce)return ce;throw new Error("unexpected error. Unable to resolve global object.")}(),ge=ye.document&&ye.document.childNodes,me=Int8Array,ve="function"==typeof oe||"object"==typeof me||"function"==typeof ge?function(r){return it(r).toLowerCase()}:function(r){var t;return null===r?"null":"object"==(t=typeof r)?it(r).toLowerCase():t};function de(r){return"function"===ve(r)}function we(r,t,e){U(r,t,{configurable:!1,enumerable:!0,writable:!1,value:e})}function be(r,t){if(!(this instanceof be))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!dr(r))throw new TypeError(I("invalid argument. Real component must be a number. Value: `%s`.",r));if(!dr(t))throw new TypeError(I("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return we(this,"re",r),we(this,"im",t),this}Y(be,"name","Complex128"),Y(be,"BYTES_PER_ELEMENT",8),Y(be.prototype,"BYTES_PER_ELEMENT",8),Y(be.prototype,"byteLength",16),Y(be.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),Y(be.prototype,"toJSON",(function(){var r={type:"Complex128"};return r.re=this.re,r.im=this.im,r}));var Ee="function"==typeof Math.fround?Math.fround:null,_e=new Kr(1),Te="function"==typeof Ee?Ee:function(r){return _e[0]=r,_e[0]};function xe(r,t){if(!(this instanceof xe))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!dr(r))throw new TypeError(I("invalid argument. Real component must be a number. Value: `%s`.",r));if(!dr(t))throw new TypeError(I("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return we(this,"re",Te(r)),we(this,"im",Te(t)),this}function Ve(r){return r instanceof be||r instanceof xe||"object"==typeof r&&null!==r&&"number"==typeof r.re&&"number"==typeof r.im}function Ae(r){return Ut(r/2)}function je(){return"function"==typeof fr&&"symbol"==typeof fr("foo")&&ar(fr,"iterator")&&"symbol"==typeof fr.iterator}Y(xe,"name","Complex64"),Y(xe,"BYTES_PER_ELEMENT",4),Y(xe.prototype,"BYTES_PER_ELEMENT",4),Y(xe.prototype,"byteLength",8),Y(xe.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),Y(xe.prototype,"toJSON",(function(){var r={type:"Complex64"};return r.re=this.re,r.im=this.im,r}));var Se=je()?Symbol.iterator:null;function Fe(r,t,e){U(r,t,{configurable:!1,enumerable:!1,get:e})}function Le(r){return r.re}function Oe(r){return r.im}function Ie(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Ht(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!Ve(n))return new TypeError(I("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Le(n),Oe(n))}return t}var ke=2*Kr.BYTES_PER_ELEMENT,Be=je();function Re(r){return r instanceof Ce||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Pe(r){return r===Ce||"Complex128Array"===r.name}function Me(r,t){return new xe(r[t*=2],r[t+1])}function Ce(){var r,t,e,n;if(t=arguments.length,!(this instanceof Ce))return 0===t?new Ce:1===t?new Ce(arguments[0]):2===t?new Ce(arguments[0],arguments[1]):new Ce(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Kr(0);else if(1===t)if(Gt(arguments[0]))e=new Kr(2*arguments[0]);else if(Dt(arguments[0]))if((n=(e=arguments[0]).length)&&Qr(e)&&Ve(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;o<e;o++){if(!Ve(n=t[o]))return null;r[i]=Le(n),r[i+1]=Oe(n),i+=2}return r}(new Kr(2*n),e),null===e){if(!Ae(n))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Kr(arguments[0])}}else{if(Br(e))e=Xr(e,0);else if(Ir(e))e=Ur(e,0);else if(!Ae(n))throw new RangeError(I("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Kr(e)}else if(Qt(arguments[0])){if(!Ut((e=arguments[0]).byteLength/ke))throw new RangeError(I("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",ke,e.byteLength));e=new Kr(e)}else{if(!re(arguments[0]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(e=arguments[0],!1===Be)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",e));if(!de(e[Se]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if(!de((e=e[Se]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if((e=Ie(e))instanceof Error)throw e;e=new Kr(e)}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!Ut(r/ke))throw new RangeError(I("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",ke,r));if(2===t){if(!Ut((n=e.byteLength-r)/ke))throw new RangeError(I("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",ke,n));e=new Kr(e,r)}else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*ke>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*ke));e=new Kr(e,r,2*n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length/2),this}function Ne(r){return r.re}function Ue(r){return r.im}function Ye(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Ht(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!Ve(n))return new TypeError(I("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Ne(n),Ue(n))}return t}Y(Ce,"BYTES_PER_ELEMENT",ke),Y(Ce,"name","Complex64Array"),Y(Ce,"from",(function(r){var t,e,n,o,i,a,f,u,s,l,h,c;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!de(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Re(r)){if(u=r.length,n){for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ve(l=n.call(t,r.get(h),h)))i[c]=Le(l),i[c+1]=Oe(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),h=0;h<u;h++)if(!Ve(f(r,h))){s=!0;break}if(s){if(!Ae(u))throw new RangeError(I("invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.",2,u));for(i=(o=new this(u/2))._buffer,h=0;h<u;h++)i[h]=n.call(t,f(r,h),h);return o}for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ve(l=n.call(t,f(r,h),h)))i[c]=Le(l),i[c+1]=Oe(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(re(r)&&Be&&de(r[Se])){if(!de((i=r[Se]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Ht(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!Ve(i))return new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Le(i),Oe(i))}return n}(i,n,t):Ie(i),a instanceof Error)throw a;for(i=(o=new this(u=a.length/2))._buffer,h=0;h<u;h++)i[h]=a[h];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(Ce,"of",(function(){var r,t;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(Ce.prototype,"at",(function(r){if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(r<0&&(r+=this._length),!(r<0||r>=this._length))return Me(this._buffer,r)})),Fe(Ce.prototype,"buffer",(function(){return this._buffer.buffer})),Fe(Ce.prototype,"byteLength",(function(){return this._buffer.byteLength})),Fe(Ce.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(Ce.prototype,"BYTES_PER_ELEMENT",Ce.BYTES_PER_ELEMENT),Y(Ce.prototype,"copyWithin",(function(r,t){if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),Y(Ce.prototype,"entries",(function(){var r,t,e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,n=this._buffer,e=this._length,i=-1,Y(t={},"next",(function(){return i+=1,o||i>=e?{done:!0}:{value:[i,Me(n,i)],done:!1}})),Y(t,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(t,Se,(function(){return r.entries()})),t})),Y(Ce.prototype,"every",(function(r,t){var e,n;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,Me(e,n),n,this))return!1;return!0})),Y(Ce.prototype,"fill",(function(r,t,e){var n,o,i,a,f,u;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Ut(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Le(r),f=Oe(r),u=t;u<e;u++)n[i=2*u]=a,n[i+1]=f;return this})),Y(Ce.prototype,"filter",(function(r,t){var e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=Me(e,o),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(Ce.prototype,"find",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Me(e,n),r.call(t,o,n,this))return o})),Y(Ce.prototype,"findIndex",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Me(e,n),r.call(t,o,n,this))return n;return-1})),Y(Ce.prototype,"findLast",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Me(e,n),r.call(t,o,n,this))return o})),Y(Ce.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Me(e,n),r.call(t,o,n,this))return n;return-1})),Y(Ce.prototype,"forEach",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)o=Me(e,n),r.call(t,o,n,this)})),Y(Ce.prototype,"get",(function(r){if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return Me(this._buffer,r)})),Y(Ce.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Le(r),i=Oe(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return!0;return!1})),Y(Ce.prototype,"indexOf",(function(r,t){var e,n,o,i,a;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Le(r),i=Oe(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(Ce.prototype,"join",(function(r){var t,e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=",";else{if(!tr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));n=r}for(t=[],e=this._buffer,o=0;o<this._length;o++)t.push(Me(e,o).toString());return t.join(n)})),Y(Ce.prototype,"keys",(function(){var r,t,e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){return o+=1,n||o>=e?{done:!0}:{value:o,done:!1}})),Y(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(t,Se,(function(){return r.keys()})),t})),Y(Ce.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Le(r),i=Oe(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Fe(Ce.prototype,"length",(function(){return this._length})),Y(Ce.prototype,"map",(function(r,t){var e,n,o,i,a;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)if(Ve(a=r.call(t,Me(n,i),i,this)))e[2*i]=Le(a),e[2*i+1]=Oe(a);else{if(!Ht(a)||2!==a.length)throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",a));e[2*i]=a[0],e[2*i+1]=a[1]}return o})),Y(Ce.prototype,"reduce",(function(r,t){var e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Me(e,0),i=1}for(;i<o;i++)n=r(n,Me(e,i),i,this);return n})),Y(Ce.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Me(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Me(e,i),i,this);return n})),Y(Ce.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[2*o],r[2*o]=r[2*i],r[2*i]=t,t=r[2*o+1],r[2*o+1]=r[2*i+1],r[2*i+1]=t;return this})),Y(Ce.prototype,"set",(function(r){var t,e,n,o,i,a,f,u,s;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Ve(r)){if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Le(r),void(n[e+1]=Oe(r))}if(Re(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,s=n.byteOffset+e*ke,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Kr(t.length),u=0;u<t.length;u++)o[u]=t[u];t=o}for(e*=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2}else{if(!Dt(r))throw new TypeError(I("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",r));for(a=r.length,u=0;u<a;u++)if(!Ve(r[u])){i=!0;break}if(i){if(!Ae(a))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));if(e+a/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,s=n.byteOffset+e*ke,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Kr(a),u=0;u<a;u++)o[u]=t[u];t=o}for(e*=2,a/=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2;return}if(e+a>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,u=0;u<a;u++)f=r[u],n[e]=Le(f),n[e+1]=Oe(f),e+=2}})),Y(Ce.prototype,"slice",(function(r,t){var e,n,o,i,a,f,u;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,f=this._length,0===arguments.length)r=0,t=f;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=f)<0&&(r=0),1===arguments.length)t=f;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=f)<0&&(t=0):t>f&&(t=f)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,u=0;u<e;u++)i=2*(u+r),n[2*u]=a[i],n[2*u+1]=a[i+1];return o})),Y(Ce.prototype,"some",(function(r,t){var e,n;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,Me(e,n),n,this))return!0;return!1})),Y(Ce.prototype,"sort",(function(r){var t,e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Me(e,o));for(t.sort(r),o=0;o<n;o++)e[i=2*o]=Le(t[o]),e[i+1]=Oe(t[o]);return this})),Y(Ce.prototype,"subarray",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*ke):(o=t-r,e=n.byteOffset+r*ke),new this.constructor(n.buffer,e,o<0?0:o)})),Y(Ce.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!tr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(Me(i,a).toLocaleString(n,e));return o.join(",")})),Y(Ce.prototype,"toReversed",(function(){var r,t,e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)i=e-o-1,r[2*o]=n[2*i],r[2*o+1]=n[2*i+1];return t})),Y(Ce.prototype,"toSorted",(function(r){var t,e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Me(e,o));return t.sort(r),new Ce(t)})),Y(Ce.prototype,"toString",(function(){var r,t,e;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)r.push(Me(t,e).toString());return r.join(",")})),Y(Ce.prototype,"values",(function(){var r,t,e,n,o,i;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){return i+=1,n||i>=e?{done:!0}:{value:Me(o,i),done:!1}})),Y(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(r,Se,(function(){return t.values()})),r})),Y(Ce.prototype,"with",(function(r,t){var e,n,o;if(!Re(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Ve(t))throw new TypeError(I("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Le(t),e[2*r+1]=Oe(t),n}));var We=2*Nr.BYTES_PER_ELEMENT,Ze=je();function $e(r){return r instanceof Xe||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Ge(r){return r===Xe||"Complex64Array"===r.name}function Ke(r,t){return new be(r[t*=2],r[t+1])}function Xe(){var r,t,e,n;if(t=arguments.length,!(this instanceof Xe))return 0===t?new Xe:1===t?new Xe(arguments[0]):2===t?new Xe(arguments[0],arguments[1]):new Xe(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Nr(0);else if(1===t)if(Gt(arguments[0]))e=new Nr(2*arguments[0]);else if(Dt(arguments[0]))if((n=(e=arguments[0]).length)&&Qr(e)&&Ve(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;o<e;o++){if(!Ve(n=t[o]))return null;r[i]=Ne(n),r[i+1]=Ue(n),i+=2}return r}(new Nr(2*n),e),null===e){if(!Ae(n))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Nr(arguments[0])}}else{if(Br(e))e=Xr(e,0);else if(Ir(e))e=Ur(e,0);else if(!Ae(n))throw new RangeError(I("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Nr(e)}else if(Qt(arguments[0])){if(!Ut((e=arguments[0]).byteLength/We))throw new RangeError(I("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",We,e.byteLength));e=new Nr(e)}else{if(!re(arguments[0]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(e=arguments[0],!1===Ze)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",e));if(!de(e[Se]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if(!de((e=e[Se]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if((e=Ye(e))instanceof Error)throw e;e=new Nr(e)}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!Ut(r/We))throw new RangeError(I("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",We,r));if(2===t){if(!Ut((n=e.byteLength-r)/We))throw new RangeError(I("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",We,n));e=new Nr(e,r)}else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*We>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*We));e=new Nr(e,r,2*n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length/2),this}function ze(r){var t,e;for(t=[];!(e=r.next()).done;)t.push(ae(e.value));return t}Y(Xe,"BYTES_PER_ELEMENT",We),Y(Xe,"name","Complex128Array"),Y(Xe,"from",(function(r){var t,e,n,o,i,a,f,u,s,l,h,c;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!de(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if($e(r)){if(u=r.length,n){for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ve(l=n.call(t,r.get(h),h)))i[c]=Ne(l),i[c+1]=Ue(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),h=0;h<u;h++)if(!Ve(f(r,h))){s=!0;break}if(s){if(!Ae(u))throw new RangeError(I("invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.",u));for(i=(o=new this(u/2))._buffer,h=0;h<u;h++)i[h]=n.call(t,f(r,h),h);return o}for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ve(l=n.call(t,f(r,h),h)))i[c]=Ne(l),i[c+1]=Ue(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(re(r)&&Ze&&de(r[Se])){if(!de((i=r[Se]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Ht(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!Ve(i))return new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Ne(i),Ue(i))}return n}(i,n,t):Ye(i),a instanceof Error)throw a;for(i=(o=new this(u=a.length/2))._buffer,h=0;h<u;h++)i[h]=a[h];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(Xe,"of",(function(){var r,t;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(Xe.prototype,"at",(function(r){if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(r<0&&(r+=this._length),!(r<0||r>=this._length))return Ke(this._buffer,r)})),Fe(Xe.prototype,"buffer",(function(){return this._buffer.buffer})),Fe(Xe.prototype,"byteLength",(function(){return this._buffer.byteLength})),Fe(Xe.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(Xe.prototype,"BYTES_PER_ELEMENT",Xe.BYTES_PER_ELEMENT),Y(Xe.prototype,"copyWithin",(function(r,t){if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),Y(Xe.prototype,"entries",(function(){var r,t,e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,i=-1,a=-2,Y(e={},"next",(function(){var t;return i+=1,o||i>=n?{done:!0}:(t=new be(r[a+=2],r[a+1]),{value:[i,t],done:!1})})),Y(e,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(e,Se,(function(){return t.entries()})),e})),Y(Xe.prototype,"every",(function(r,t){var e,n;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,Ke(e,n),n,this))return!1;return!0})),Y(Xe.prototype,"fill",(function(r,t,e){var n,o,i,a,f,u;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Ut(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Ne(r),f=Ue(r),u=t;u<e;u++)n[i=2*u]=a,n[i+1]=f;return this})),Y(Xe.prototype,"filter",(function(r,t){var e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=Ke(e,o),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(Xe.prototype,"find",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Ke(e,n),r.call(t,o,n,this))return o})),Y(Xe.prototype,"findIndex",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Ke(e,n),r.call(t,o,n,this))return n;return-1})),Y(Xe.prototype,"findLast",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Ke(e,n),r.call(t,o,n,this))return o})),Y(Xe.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Ke(e,n),r.call(t,o,n,this))return n;return-1})),Y(Xe.prototype,"forEach",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)o=Ke(e,n),r.call(t,o,n,this)})),Y(Xe.prototype,"get",(function(r){if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return Ke(this._buffer,r)})),Fe(Xe.prototype,"length",(function(){return this._length})),Y(Xe.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ne(r),i=Ue(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return!0;return!1})),Y(Xe.prototype,"indexOf",(function(r,t){var e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ne(r),i=Ue(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(Xe.prototype,"join",(function(r){var t,e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=",";else{if(!pr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));n=r}for(t=[],e=this._buffer,o=0;o<this._length;o++)t.push(Ke(e,o).toString());return t.join(n)})),Y(Xe.prototype,"keys",(function(){var r,t,e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){return o+=1,n||o>=e?{done:!0}:{value:o,done:!1}})),Y(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(t,Se,(function(){return r.keys()})),t})),Y(Xe.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ve(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Ne(r),i=Ue(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(Xe.prototype,"map",(function(r,t){var e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)if(Ve(a=r.call(t,Ke(n,i),i,this)))e[2*i]=Ne(a),e[2*i+1]=Ue(a);else{if(!Ht(a)||2!==a.length)throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",a));e[2*i]=a[0],e[2*i+1]=a[1]}return o})),Y(Xe.prototype,"reduce",(function(r,t){var e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ke(e,0),i=1}for(;i<o;i++)n=r(n,Ke(e,i),i,this);return n})),Y(Xe.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ke(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Ke(e,i),i,this);return n})),Y(Xe.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[2*o],r[2*o]=r[2*i],r[2*i]=t,t=r[2*o+1],r[2*o+1]=r[2*i+1],r[2*i+1]=t;return this})),Y(Xe.prototype,"set",(function(r){var t,e,n,o,i,a,f,u,s;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Ve(r)){if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Ne(r),void(n[e+1]=Ue(r))}if($e(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,s=n.byteOffset+e*We,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Nr(t.length),u=0;u<t.length;u++)o[u]=t[u];t=o}for(e*=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2}else{if(!Dt(r))throw new TypeError(I("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",r));for(a=r.length,u=0;u<a;u++)if(!Ve(r[u])){i=!0;break}if(i){if(!Ae(a))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));if(e+a/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,s=n.byteOffset+e*We,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Nr(a),u=0;u<a;u++)o[u]=t[u];t=o}for(e*=2,a/=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2;return}if(e+a>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,u=0;u<a;u++)f=r[u],n[e]=Ne(f),n[e+1]=Ue(f),e+=2}})),Y(Xe.prototype,"slice",(function(r,t){var e,n,o,i,a,f,u;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,f=this._length,0===arguments.length)r=0,t=f;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=f)<0&&(r=0),1===arguments.length)t=f;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=f)<0&&(t=0):t>f&&(t=f)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,u=0;u<e;u++)i=2*(u+r),n[2*u]=a[i],n[2*u+1]=a[i+1];return o})),Y(Xe.prototype,"some",(function(r,t){var e,n;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,Ke(e,n),n,this))return!0;return!1})),Y(Xe.prototype,"sort",(function(r){var t,e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Ke(e,o));for(t.sort(r),o=0;o<n;o++)e[i=2*o]=Ne(t[o]),e[i+1]=Ue(t[o]);return this})),Y(Xe.prototype,"subarray",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*We):(o=t-r,e=n.byteOffset+r*We),new this.constructor(n.buffer,e,o<0?0:o)})),Y(Xe.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!pr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(Ke(i,a).toLocaleString(n,e));return o.join(",")})),Y(Xe.prototype,"toReversed",(function(){var r,t,e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)i=e-o-1,r[2*o]=n[2*i],r[2*o+1]=n[2*i+1];return t})),Y(Xe.prototype,"toSorted",(function(r){var t,e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Ke(e,o));return t.sort(r),new Xe(t)})),Y(Xe.prototype,"toString",(function(){var r,t,e;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)r.push(Ke(t,e).toString());return r.join(",")})),Y(Xe.prototype,"values",(function(){var r,t,e,n,o,i;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){return i+=1,n||i>=e?{done:!0}:{value:Ke(o,i),done:!1}})),Y(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(r,Se,(function(){return t.values()})),r})),Y(Xe.prototype,"with",(function(r,t){var e,n,o;if(!$e(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Ve(t))throw new TypeError(I("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Ne(t),e[2*r+1]=Ue(t),n}));var He=qr.BYTES_PER_ELEMENT,Je=je();function De(r){return"object"==typeof r&&null!==r&&"BooleanArray"===r.constructor.name&&r.BYTES_PER_ELEMENT===He}function qe(r){return r===Qe}function Qe(){var r,t,e,n,o;if(t=arguments.length,!(this instanceof Qe))return 0===t?new Qe:1===t?new Qe(arguments[0]):2===t?new Qe(arguments[0],arguments[1]):new Qe(arguments[0],arguments[1],arguments[2]);if(0===t)e=new qr(0);else if(1===t)if(Gt(o=arguments[0]))e=new qr(o);else if(Dt(o))e=function(r,t){var e,n;for(e=t.length,n=0;n<e;n++)r[n]=ae(t[n]);return r}(new qr(o.length),o);else if(Qt(o))e=new qr(o);else{if(!re(o))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));if(!1===Je)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",o));if(!de(o[Se]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));if(!de((e=o[Se]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));e=new qr(ze(e))}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(2===t)e=new qr(e,r);else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*He>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*He));e=new qr(e,r,n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length),this}Y(Qe,"BYTES_PER_ELEMENT",He),Y(Qe,"name","BooleanArray"),Y(Qe,"from",(function(r){var t,e,n,o,i,a,f,u,s;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((e=arguments.length)>1){if(!de(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),i=(o=new this(u))._buffer,s=0;s<u;s++)i[s]=ae(n.call(t,f(r,s),s));return o}return new this(r)}if(re(r)&&Je&&de(r[Se])){if(!de((i=r[Se]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));for(a=n?function(r,t,e){var n,o,i;for(n=[],i=-1;!(o=r.next()).done;)i+=1,n.push(ae(t.call(e,o.value,i)));return n}(i,n,t):ze(i),i=(o=new this(u=a.length))._buffer,s=0;s<u;s++)i[s]=a[s];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(Qe,"of",(function(){var r,t;if(!de(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(Qe.prototype,"at",(function(r){var t,e;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Wt(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(e=this._length,t=this._buffer,r<0&&(r+=e),!(r<0||r>=e))return ae(t[r])})),Fe(Qe.prototype,"buffer",(function(){return this._buffer.buffer})),Fe(Qe.prototype,"byteLength",(function(){return this._buffer.byteLength})),Fe(Qe.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(Qe.prototype,"BYTES_PER_ELEMENT",Qe.BYTES_PER_ELEMENT),Y(Qe.prototype,"copyWithin",(function(r,t){if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(r,t):this._buffer.copyWithin(r,t,arguments[2]),this})),Y(Qe.prototype,"entries",(function(){var r,t,e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,n=this._buffer,e=this._length,i=-1,Y(t={},"next",(function(){return i+=1,o||i>=e?{done:!0}:{value:[i,ae(n[i])],done:!1}})),Y(t,"return",(function(r){return o=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(t,Se,(function(){return r.entries()})),t})),Y(Qe.prototype,"every",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,ae(e[n]),n,this))return!1;return!0})),Y(Qe.prototype,"fill",(function(r,t,e){var n,o,i,a;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Wt(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(i=r?1:0,a=t;a<e;a++)n[a]=i;return this})),Y(Qe.prototype,"filter",(function(r,t){var e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=ae(e[o]),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(Qe.prototype,"find",(function(r,t){var e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=0;o<this._length;o++)if(n=ae(e[o]),r.call(t,n,o,this))return n})),Y(Qe.prototype,"findIndex",(function(r,t){var e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=0;o<this._length;o++)if(n=ae(e[o]),r.call(t,n,o,this))return o;return-1})),Y(Qe.prototype,"findLast",(function(r,t){var e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=ae(e[o]),r.call(t,n,o,this))return n})),Y(Qe.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=ae(e[o]),r.call(t,n,o,this))return o;return-1})),Y(Qe.prototype,"forEach",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)r.call(t,ae(e[n]),n,this)})),Y(Qe.prototype,"get",(function(r){if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return ae(this._buffer[r])})),Y(Qe.prototype,"includes",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n<this._length;n++)if(r===ae(e[n]))return!0;return!1})),Y(Qe.prototype,"indexOf",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n<this._length;n++)if(r===ae(e[n]))return n;return-1})),Y(Qe.prototype,"join",(function(r){var t,e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(arguments.length>0){if(!tr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r))}else r=",";for(t=this._buffer,e=[],n=0;n<this._length;n++)t[n]?e.push("true"):e.push("false");return e.join(r)})),Y(Qe.prototype,"keys",(function(){var r,t,e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){return o+=1,n||o>=e?{done:!0}:{value:o,done:!1}})),Y(t,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(t,Se,(function(){return r.keys()})),t})),Y(Qe.prototype,"lastIndexOf",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(e=this._buffer,n=t;n>=0;n--)if(r===ae(e[n]))return n;return-1})),Fe(Qe.prototype,"length",(function(){return this._length})),Y(Qe.prototype,"map",(function(r,t){var e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",r);for(o=this._buffer,e=(n=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)e[i]=ae(r.call(t,ae(o[i]),i,this));return n})),Y(Qe.prototype,"reduce",(function(r,t){var e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,n=this._length,arguments.length>1)o=t,i=0;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=ae(e[0]),i=1}for(;i<n;i++)o=r(o,ae(e[i]),i,this);return o})),Y(Qe.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,n=this._length,arguments.length>1)o=t,i=n-1;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=ae(e[n-1]),i=n-2}for(;i>=0;i--)o=r(o,ae(e[i]),i,this);return o})),Y(Qe.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=this._buffer,e=this._length,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[o],r[o]=r[i],r[i]=t;return this})),Y(Qe.prototype,"set",(function(r){var t,e,n,o,i,a,f;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Dt(r)){if(e+(i=r.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=De(r)?r._buffer:r,f=n.byteOffset+e*He,t.buffer===n.buffer&&t.byteOffset<f&&t.byteOffset+t.byteLength>f){for(o=new qr(t.length),a=0;a<t.length;a++)o[a]=t[a];t=o}for(a=0;a<i;e++,a++)n[e]=t[a]?1:0}else{if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));n[e]=r?1:0}})),Y(Qe.prototype,"slice",(function(r,t){var e,n,o,i,a,f;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(i=this._buffer,a=this._length,0===arguments.length)r=0,t=a;else{if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=a)<0&&(r=0),1===arguments.length)t=a;else{if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=a)<0&&(t=0):t>a&&(t=a)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,f=0;f<e;f++)n[f]=i[f+r];return o})),Y(Qe.prototype,"some",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,ae(e[n]),n,this))return!0;return!1})),Y(Qe.prototype,"sort",(function(r){var t;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(t=this._buffer,0===arguments.length)return t.sort(),this;if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));return t.sort((function(t,e){return r(ae(t),ae(e))})),this})),Y(Qe.prototype,"subarray",(function(r,t){var e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*He):(o=t-r,e=n.byteOffset+r*He),new this.constructor(n.buffer,e,o<0?0:o)})),Y(Qe.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)n=[];else{if(!tr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(ae(i[a]).toLocaleString(n,e));return o.join(",")})),Y(Qe.prototype,"toReversed",(function(){var r,t,e,n,o;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)r[o]=n[e-o-1];return t})),Y(Qe.prototype,"toSorted",(function(r){var t,e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(n=this._length,e=new this.constructor(n),o=this._buffer,t=e._buffer,i=0;i<n;i++)t[i]=o[i];if(0===arguments.length)return t.sort(),e;if(!de(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));return t.sort((function(t,e){return r(ae(t),ae(e))})),e})),Y(Qe.prototype,"toString",(function(){var r,t,e;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)t[e]?r.push("true"):r.push("false");return r.join(",")})),Y(Qe.prototype,"values",(function(){var r,t,e,n,o,i;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){return i+=1,n||i>=e?{done:!0}:{value:ae(o[i]),done:!1}})),Y(r,"return",(function(r){return n=!0,arguments.length?{value:r,done:!0}:{done:!0}})),Se&&Y(r,Se,(function(){return t.values()})),r})),Y(Qe.prototype,"with",(function(r,t){var e,n;if(!De(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(n=this._length,r<0&&(r+=n),r<0||r>=n)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!ie(t))throw new TypeError(I("invalid argument. Second argument must be a boolean. Value: `%s`.",t));return(e=new this.constructor(this._buffer))._buffer[r]=t?1:0,e}));var rn=[Nr,Kr,dt,pt,St,Tt,Mt,qr,kt,Ce,Xe,Qe],tn=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],en=tn.length;function nn(r){var t=function(r){var t;if(Qr(r))return"generic";if(et(r))return null;for(t=0;t<en;t++)if(r instanceof rn[t])return tn[t];return ft[it(r)]||null}(r);return $(r)?{data:r,dtype:t,accessorProtocol:!0,accessors:[K(t),z(t)]}:{data:r,dtype:t,accessorProtocol:!1,accessors:[J(t),q(t)]}}var on=5,an=5;function fn(r,t,e,n,o){var i,a,f,u;if(r<=0||1===t)return e;if((f=nn(e)).accessorProtocol)return function(r,t,e,n,o){var i,a,f,u,s,l;if(i=e.data,a=e.accessors[0],f=e.accessors[1],u=o,0===n)return f(i,u,a(i,u)*r*t),e;if(1===n){if((s=r%on)>0)for(l=0;l<s;l++)f(i,u,a(i,u)*t),u+=n;if(r<on)return e;for(l=s;l<r;l+=on)f(i,u,a(i,u)*t),f(i,u+1,a(i,u+1)*t),f(i,u+2,a(i,u+2)*t),f(i,u+3,a(i,u+3)*t),f(i,u+4,a(i,u+4)*t),u+=on;return e}for(l=0;l<r;l++)f(i,u,a(i,u)*t),u+=n}(r,t,f,n,o),e;if(i=o,0===n)return e[i]*=t*r,e;if(1===n){if((a=r%an)>0)for(u=0;u<a;u++)e[i]*=t,i+=n;if(r<an)return e;for(u=a;u<r;u+=an)e[i]*=t,e[i+1]*=t,e[i+2]*=t,e[i+3]*=t,e[i+4]*=t,i+=an;return e}for(u=0;u<r;u++)e[i]*=t,i+=n;return e}function un(r,t,e,n){return fn(r,t,e,n,function(r,t){return t>0?0:(1-r)*t}(r,n))}function sn(r){var t,e;if(t=[],r<=0)return t;for(e=0;e<r;e++)t.push(e);return t}function ln(r,t,e,n){var o,i,a;for(i=2*e,a=2*n,o=0;a>=0&&a<t.length;)t[a]=o,t[a+1]=0,a+=i,o+=1;return r}function hn(r,t){var e;return e=sn(r.length),function(r,t){var e,n,o,i,a,f,u,s,l;for(n=1,o=1,l=1;l<r.length;l++){for(e=(f=r[n])<0?-f:f,u=t[o],i=n-1,a=o-1;i>=0&&!(((s=r[i])<0?-s:s)<=e);)r[i+1]=s,t[a+1]=t[a],i-=1,a-=1;r[i+1]=f,t[a+1]=u,n+=1,o+=1}}(t=rr(t),e),{sh:r=function(r,t){var e,n;for(e=[],n=0;n<t.length;n++)e.push(r[t[n]]);return e}(r,e),sx:t,idx:e}}function cn(r){return Wt(r)&&r>0}function pn(r){return Zt(r)&&r.valueOf()>0}function yn(r){return cn(r)||pn(r)}function gn(r){return Object.keys(Object(r))}Y(un,"ndarray",fn),Y(sn,"assign",(function(r,t,e){var n=nn(r);return n.accessorProtocol?"complex128"===n.dtype?ln(r,Ur(r,0),t,e):"complex64"===n.dtype?ln(r,Xr(r,0),t,e):function(r,t,e){var n,o,i,a;for(n=r.data,o=r.accessors[1],a=e,i=0;a>=0&&a<n.length;)o(n,a,i),a+=t,i+=1;return n}(n,t,e):function(r,t,e){var n,o;for(o=e,n=0;o>=0&&o<r.length;)r[o]=n,o+=t,n+=1;return r}(r,t,e)})),Y(yn,"isPrimitive",cn),Y(yn,"isObject",pn);var mn,vn=void 0!==Object.keys;function dn(r){return"[object Arguments]"===sr(r)}mn=function(){return dn(arguments)}();var wn=mn;function bn(r){return r!=r}function En(r){return dr(r)&&bn(r)}function _n(r){return _r(r)&&bn(r.valueOf())}function Tn(r){return En(r)||_n(r)}Y(Tn,"isPrimitive",En),Y(Tn,"isObject",_n);var xn=Object.prototype.propertyIsEnumerable,Vn=!xn.call("beep","0");function An(r,t){var e;return null!=r&&(!(e=xn.call(r,t))&&Vn&&pr(r)?!En(t=+t)&&Wt(t)&&t>=0&&t<r.length:e)}var jn=wn?dn:function(r){return null!==r&&"object"==typeof r&&!Qr(r)&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=st&&ar(r,"callee")&&!An(r,"callee")},Sn=Array.prototype.slice,Fn=An((function(){}),"prototype"),Ln=!An({toString:null},"toString");function On(r,t,e){var n,o;if(!Dt(r)&&!tr(r))throw new TypeError(I("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(0===(n=r.length))return-1;if(3===arguments.length){if(!Wt(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));if(e>=0){if(e>=n)return-1;o=e}else(o=n+e)<0&&(o=0)}else o=0;if(Tn(t)){for(;o<n;o++)if(Tn(r[o]))return o}else for(;o<n;o++)if(r[o]===t)return o;return-1}function In(r){return r.constructor&&r.constructor.prototype===r}var kn,Bn=["console","external","frame","frameElement","frames","innerHeight","innerWidth","outerHeight","outerWidth","pageXOffset","pageYOffset","parent","scrollLeft","scrollTop","scrollX","scrollY","self","webkitIndexedDB","webkitStorageInfo","window"],Rn="undefined"==typeof window?void 0:window,Pn=function(){var r;if("undefined"===ve(Rn))return!1;for(r in Rn)try{-1===On(Bn,r)&&ar(Rn,r)&&null!==Rn[r]&&"object"===ve(Rn[r])&&In(Rn[r])}catch(r){return!0}return!1}(),Mn="undefined"!=typeof window,Cn=["toString","toLocaleString","valueOf","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","constructor"];kn=vn?function(){return 2!==(gn(arguments)||"").length}(1,2)?function(r){return jn(r)?gn(Sn.call(r)):gn(r)}:gn:function(r){var t,e,n,o,i,a,f;if(o=[],jn(r)){for(f=0;f<r.length;f++)o.push(f.toString());return o}if("string"==typeof r){if(r.length>0&&!ar(r,"0"))for(f=0;f<r.length;f++)o.push(f.toString())}else{if(0==(n="function"==typeof r)&&!tt(r))return o;e=Fn&&n}for(i in r)e&&"prototype"===i||!ar(r,i)||o.push(String(i));if(Ln)for(t=function(r){if(!1===Mn&&!Pn)return In(r);try{return In(r)}catch(r){return!1}}(r),f=0;f<Cn.length;f++)a=Cn[f],t&&"constructor"===a||!ar(r,a)||o.push(String(a));return o};var Nn,Un=kn,Yn=Object,Wn=Object.getPrototypeOf;Nn=de(Object.getPrototypeOf)?Wn:function(r){var t=function(r){return r.__proto__}(r);return t||null===t?t:"[object Function]"===sr(r.constructor)?r.constructor.prototype:r instanceof Yn?Yn.prototype:null};var Zn=Nn,$n=Object.prototype;function Gn(r){var t;return!!re(r)&&(t=function(r){return null==r?null:(r=Yn(r),Zn(r))}(r),!t||!ar(r,"constructor")&&ar(t,"constructor")&&de(t.constructor)&&"[object Function]"===sr(t.constructor)&&ar(t,"isPrototypeOf")&&de(t.isPrototypeOf)&&(t===$n||function(r){var t;for(t in r)if(!ar(r,t))return!1;return!0}(r)))}var Kn=function(r,t){var e,n,o,i,a,f,u,s=!0;if(!tt(r))throw new TypeError(I("invalid argument. First argument must be an object (except null). Value: `%s`.",r));if(arguments.length>1){if(!Gn(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));if(ar(t,"duplicates")&&!ie(s=t.duplicates))throw new TypeError(I("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",s))}if(n=(e=Un(r)).length,a={},s)for(u=0;u<n;u++)ar(a,i=r[o=e[u]])?(f=a[i],Qr(f)?a[i].push(o):a[i]=[f,o]):a[i]=o;else for(u=0;u<n;u++)a[r[o=e[u]]]=o;return a}({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},{duplicates:!1}),Xn={binary:1,bool:1,complex64:8,complex128:16,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};function zn(r){var t;return tr(r)?Xn[r]||null:dr(r)?Xn[function(r){var t=Kn[r];return tr(t)?t:null}(r)]||null:r&&cn(t=r.byteLength)?t:null}var Hn={BLOCK_SIZE_IN_BYTES:64,BLOCK_SIZE_IN_ELEMENTS:8};function Jn(r){return function(r){var t,e,n,o;if((e=r.length)<=0)return Hn.BLOCK_SIZE_IN_ELEMENTS;if(null===(t=zn(r[0])))return Hn.BLOCK_SIZE_IN_ELEMENTS;for(o=1;o<e;o++){if(null===(n=zn(r[o])))return Hn.BLOCK_SIZE_IN_ELEMENTS;n>t&&(t=n)}return(n=Hn.BLOCK_SIZE_IN_BYTES/t|0)>0?n:1}([r])}function Dn(r,t,e,n,o,i){var a,f,u,s,l;for(a=r.length,f=1,l=0;l<a;l++)f*=r[l];if("clamp"===i)o<0?o=0:o>=f&&(o=f-1);else if("wrap"===i)o<0?(o+=f)<0&&0!=(o%=f)&&(o+=f):o>=f&&(o-=f)>=f&&(o%=f);else if("normalize"===i&&o<0&&(o+=f),o<0||o>=f)throw new RangeError(I("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",f,o));if(u=e,yr(n)){for(l=0;l<a;l++)o-=s=o%r[l],o/=r[l],u+=s*t[l];return u}for(l=a-1;l>=0;l--)o-=s=o%r[l],o/=r[l],u+=s*t[l];return u}var qn="throw";function Qn(r,t){var e,n,o,i,a,f,u,s,l;for(i=Q(f=r.shape),n=r.data,u=r.strides,s=r.offset,o=r.order,a=r.accessors[0],e=0,l=0;l<i;l++)if(a(n,Dn(f,u,s,o,l,qn))&&(e+=1)>=t)return!0;return!1}var ro="throw";function to(r,t){var e,n,o,i,a,f,u,s,l;for(i=Q(a=r.shape),n=r.data,f=r.strides,u=r.offset,o=r.order,e=0,l=0;l<i;l++)if((n[s=Dn(a,f,u,o,l,ro)]||n[s+1])&&(e+=1)>=t)return!0;return!1}var eo="throw";function no(r,t){var e,n,o,i,a,f,u,s;for(i=Q(a=r.shape),n=r.data,f=r.strides,u=r.offset,o=r.order,e=0,s=0;s<i;s++)if(n[Dn(a,f,u,o,s,eo)]&&(e+=1)>=t)return!0;return!1}var oo=[function(r,t){return!!(t<=1&&r.data[r.offset])},function(r,t){var e,n,o,i,a,f;for(i=r.shape[0],o=r.strides[0],a=r.offset,n=r.data,e=0,f=0;f<i;f++){if(n[a]&&(e+=1)>=t)return!0;a+=o}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c;for(a=r.shape,1===Ar(s=r.strides)?(f=a[1],u=a[0],o=s[1],i=s[0]-f*s[1]):(f=a[0],u=a[1],o=s[0],i=s[1]-f*s[0]),l=r.offset,n=r.data,e=0,c=0;c<u;c++){for(h=0;h<f;h++){if(n[l]&&(e+=1)>=t)return!0;l+=o}l+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g;for(f=r.shape,1===Ar(h=r.strides)?(u=f[2],s=f[1],l=f[0],o=h[2],i=h[1]-u*h[2],a=h[0]-s*h[1]):(u=f[0],s=f[1],l=f[2],o=h[0],i=h[1]-u*h[0],a=h[2]-s*h[1]),c=r.offset,n=r.data,e=0,g=0;g<l;g++){for(y=0;y<s;y++){for(p=0;p<u;p++){if(n[c]&&(e+=1)>=t)return!0;c+=o}c+=i}c+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=r.shape,1===Ar(p=r.strides)?(s=u[3],l=u[2],h=u[1],c=u[0],o=p[3],i=p[2]-s*p[3],a=p[1]-l*p[2],f=p[0]-h*p[1]):(s=u[0],l=u[1],h=u[2],c=u[3],o=p[0],i=p[1]-s*p[0],a=p[2]-l*p[1],f=p[3]-h*p[2]),y=r.offset,n=r.data,e=0,d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){for(g=0;g<s;g++){if(n[y]&&(e+=1)>=t)return!0;y+=o}y+=i}y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E;for(s=r.shape,1===Ar(g=r.strides)?(l=s[4],h=s[3],c=s[2],p=s[1],y=s[0],o=g[4],i=g[3]-l*g[4],a=g[2]-h*g[3],f=g[1]-c*g[2],u=g[0]-p*g[1]):(l=s[0],h=s[1],c=s[2],p=s[3],y=s[4],o=g[0],i=g[1]-l*g[0],a=g[2]-h*g[1],f=g[3]-c*g[2],u=g[4]-p*g[3]),m=r.offset,n=r.data,e=0,E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){for(v=0;v<l;v++){if(n[m]&&(e+=1)>=t)return!0;m+=o}m+=i}m+=a}m+=f}m+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(l=r.shape,1===Ar(v=r.strides)?(h=l[5],c=l[4],p=l[3],y=l[2],g=l[1],m=l[0],o=v[5],i=v[4]-h*v[5],a=v[3]-c*v[4],f=v[2]-p*v[3],u=v[1]-y*v[2],s=v[0]-g*v[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],m=l[5],o=v[0],i=v[1]-h*v[0],a=v[2]-c*v[1],f=v[3]-p*v[2],u=v[4]-y*v[3],s=v[5]-g*v[4]),d=r.offset,n=r.data,e=0,x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){for(w=0;w<h;w++){if(n[d]&&(e+=1)>=t)return!0;d+=o}d+=i}d+=a}d+=f}d+=u}d+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j;for(h=r.shape,1===Ar(w=r.strides)?(c=h[6],p=h[5],y=h[4],g=h[3],m=h[2],v=h[1],d=h[0],o=w[6],i=w[5]-c*w[6],a=w[4]-p*w[5],f=w[3]-y*w[4],u=w[2]-g*w[3],s=w[1]-m*w[2],l=w[0]-v*w[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],d=h[6],o=w[0],i=w[1]-c*w[0],a=w[2]-p*w[1],f=w[3]-y*w[2],u=w[4]-g*w[3],s=w[5]-m*w[4],l=w[6]-v*w[5]),b=r.offset,n=r.data,e=0,j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){for(E=0;E<c;E++){if(n[b]&&(e+=1)>=t)return!0;b+=o}b+=i}b+=a}b+=f}b+=u}b+=s}b+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L;for(c=r.shape,1===Ar(E=r.strides)?(p=c[7],y=c[6],g=c[5],m=c[4],v=c[3],d=c[2],w=c[1],b=c[0],o=E[7],i=E[6]-p*E[7],a=E[5]-y*E[6],f=E[4]-g*E[5],u=E[3]-m*E[4],s=E[2]-v*E[3],l=E[1]-d*E[2],h=E[0]-w*E[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],b=c[7],o=E[0],i=E[1]-p*E[0],a=E[2]-y*E[1],f=E[3]-g*E[2],u=E[4]-m*E[3],s=E[5]-v*E[4],l=E[6]-d*E[5],h=E[7]-w*E[6]),_=r.offset,n=r.data,e=0,L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){for(T=0;T<p;T++){if(n[_]&&(e+=1)>=t)return!0;_+=o}_+=i}_+=a}_+=f}_+=u}_+=s}_+=l}_+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(p=r.shape,1===Ar(T=r.strides)?(y=p[8],g=p[7],m=p[6],v=p[5],d=p[4],w=p[3],b=p[2],E=p[1],_=p[0],o=T[8],i=T[7]-y*T[8],a=T[6]-g*T[7],f=T[5]-m*T[6],u=T[4]-v*T[5],s=T[3]-d*T[4],l=T[2]-w*T[3],h=T[1]-b*T[2],c=T[0]-E*T[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],_=p[8],o=T[0],i=T[1]-y*T[0],a=T[2]-g*T[1],f=T[3]-m*T[2],u=T[4]-v*T[3],s=T[5]-d*T[4],l=T[6]-w*T[5],h=T[7]-b*T[6],c=T[8]-E*T[7]),x=r.offset,n=r.data,e=0,k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){for(V=0;V<y;V++){if(n[x]&&(e+=1)>=t)return!0;x+=o}x+=i}x+=a}x+=f}x+=u}x+=s}x+=l}x+=h}x+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P;for(y=r.shape,1===Ar(V=r.strides)?(g=y[9],m=y[8],v=y[7],d=y[6],w=y[5],b=y[4],E=y[3],_=y[2],T=y[1],x=y[0],o=V[9],i=V[8]-g*V[9],a=V[7]-m*V[8],f=V[6]-v*V[7],u=V[5]-d*V[6],s=V[4]-w*V[5],l=V[3]-b*V[4],h=V[2]-E*V[3],c=V[1]-_*V[2],p=V[0]-T*V[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],x=y[9],o=V[0],i=V[1]-g*V[0],a=V[2]-m*V[1],f=V[3]-v*V[2],u=V[4]-d*V[3],s=V[5]-w*V[4],l=V[6]-b*V[5],h=V[7]-E*V[6],c=V[8]-_*V[7],p=V[9]-T*V[8]),A=r.offset,n=r.data,e=0,P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){for(j=0;j<g;j++){if(n[A]&&(e+=1)>=t)return!0;A+=o}A+=i}A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}A+=c}A+=p}return!1},no],io=[function(r,t){return!!(t<=1&&r.accessors[0](r.data,r.offset))},function(r,t){var e,n,o,i,a,f,u;for(a=r.shape[0],i=r.strides[0],f=r.offset,n=r.data,o=r.accessors[0],e=0,u=0;u<a;u++){if(o(n,f)&&(e+=1)>=t)return!0;f+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p;for(f=r.shape,1===Ar(l=r.strides)?(u=f[1],s=f[0],i=l[1],a=l[0]-u*l[1]):(u=f[0],s=f[1],i=l[0],a=l[1]-u*l[0]),h=r.offset,n=r.data,o=r.accessors[0],e=0,p=0;p<s;p++){for(c=0;c<u;c++){if(o(n,h)&&(e+=1)>=t)return!0;h+=i}h+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m;for(u=r.shape,1===Ar(c=r.strides)?(s=u[2],l=u[1],h=u[0],i=c[2],a=c[1]-s*c[2],f=c[0]-l*c[1]):(s=u[0],l=u[1],h=u[2],i=c[0],a=c[1]-s*c[0],f=c[2]-l*c[1]),p=r.offset,n=r.data,o=r.accessors[0],e=0,m=0;m<h;m++){for(g=0;g<l;g++){for(y=0;y<s;y++){if(o(n,p)&&(e+=1)>=t)return!0;p+=i}p+=a}p+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w;for(s=r.shape,1===Ar(y=r.strides)?(l=s[3],h=s[2],c=s[1],p=s[0],i=y[3],a=y[2]-l*y[3],f=y[1]-h*y[2],u=y[0]-c*y[1]):(l=s[0],h=s[1],c=s[2],p=s[3],i=y[0],a=y[1]-l*y[0],f=y[2]-h*y[1],u=y[3]-c*y[2]),g=r.offset,n=r.data,o=r.accessors[0],e=0,w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){if(o(n,g)&&(e+=1)>=t)return!0;g+=i}g+=a}g+=f}g+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_;for(l=r.shape,1===Ar(m=r.strides)?(h=l[4],c=l[3],p=l[2],y=l[1],g=l[0],i=m[4],a=m[3]-h*m[4],f=m[2]-c*m[3],u=m[1]-p*m[2],s=m[0]-y*m[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],i=m[0],a=m[1]-h*m[0],f=m[2]-c*m[1],u=m[3]-p*m[2],s=m[4]-y*m[3]),v=r.offset,n=r.data,o=r.accessors[0],e=0,_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){if(o(n,v)&&(e+=1)>=t)return!0;v+=i}v+=a}v+=f}v+=u}v+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V;for(h=r.shape,1===Ar(d=r.strides)?(c=h[5],p=h[4],y=h[3],g=h[2],m=h[1],v=h[0],i=d[5],a=d[4]-c*d[5],f=d[3]-p*d[4],u=d[2]-y*d[3],s=d[1]-g*d[2],l=d[0]-m*d[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],i=d[0],a=d[1]-c*d[0],f=d[2]-p*d[1],u=d[3]-y*d[2],s=d[4]-g*d[3],l=d[5]-m*d[4]),w=r.offset,n=r.data,o=r.accessors[0],e=0,V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){if(o(n,w)&&(e+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}w+=s}w+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=r.shape,1===Ar(b=r.strides)?(p=c[6],y=c[5],g=c[4],m=c[3],v=c[2],d=c[1],w=c[0],i=b[6],a=b[5]-p*b[6],f=b[4]-y*b[5],u=b[3]-g*b[4],s=b[2]-m*b[3],l=b[1]-v*b[2],h=b[0]-d*b[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],i=b[0],a=b[1]-p*b[0],f=b[2]-y*b[1],u=b[3]-g*b[2],s=b[4]-m*b[3],l=b[5]-v*b[4],h=b[6]-d*b[5]),E=r.offset,n=r.data,o=r.accessors[0],e=0,S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){if(o(n,E)&&(e+=1)>=t)return!0;E+=i}E+=a}E+=f}E+=u}E+=s}E+=l}E+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O;for(p=r.shape,1===Ar(_=r.strides)?(y=p[7],g=p[6],m=p[5],v=p[4],d=p[3],w=p[2],b=p[1],E=p[0],i=_[7],a=_[6]-y*_[7],f=_[5]-g*_[6],u=_[4]-m*_[5],s=_[3]-v*_[4],l=_[2]-d*_[3],h=_[1]-w*_[2],c=_[0]-b*_[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],i=_[0],a=_[1]-y*_[0],f=_[2]-g*_[1],u=_[3]-m*_[2],s=_[4]-v*_[3],l=_[5]-d*_[4],h=_[6]-w*_[5],c=_[7]-b*_[6]),T=r.offset,n=r.data,o=r.accessors[0],e=0,O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){if(o(n,T)&&(e+=1)>=t)return!0;T+=i}T+=a}T+=f}T+=u}T+=s}T+=l}T+=h}T+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B;for(y=r.shape,1===Ar(x=r.strides)?(g=y[8],m=y[7],v=y[6],d=y[5],w=y[4],b=y[3],E=y[2],_=y[1],T=y[0],i=x[8],a=x[7]-g*x[8],f=x[6]-m*x[7],u=x[5]-v*x[6],s=x[4]-d*x[5],l=x[3]-w*x[4],h=x[2]-b*x[3],c=x[1]-E*x[2],p=x[0]-_*x[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],i=x[0],a=x[1]-g*x[0],f=x[2]-m*x[1],u=x[3]-v*x[2],s=x[4]-d*x[3],l=x[5]-w*x[4],h=x[6]-b*x[5],c=x[7]-E*x[6],p=x[8]-_*x[7]),V=r.offset,n=r.data,o=r.accessors[0],e=0,B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){if(o(n,V)&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}V+=h}V+=c}V+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M;for(g=r.shape,1===Ar(A=r.strides)?(m=g[9],v=g[8],d=g[7],w=g[6],b=g[5],E=g[4],_=g[3],T=g[2],x=g[1],V=g[0],i=A[9],a=A[8]-m*A[9],f=A[7]-v*A[8],u=A[6]-d*A[7],s=A[5]-w*A[6],l=A[4]-b*A[5],h=A[3]-E*A[4],c=A[2]-_*A[3],p=A[1]-T*A[2],y=A[0]-x*A[1]):(m=g[0],v=g[1],d=g[2],w=g[3],b=g[4],E=g[5],_=g[6],T=g[7],x=g[8],V=g[9],i=A[0],a=A[1]-m*A[0],f=A[2]-v*A[1],u=A[3]-d*A[2],s=A[4]-w*A[3],l=A[5]-b*A[4],h=A[6]-E*A[5],c=A[7]-_*A[6],p=A[8]-T*A[7],y=A[9]-x*A[8]),j=r.offset,n=r.data,o=r.accessors[0],e=0,M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){if(o(n,j)&&(e+=1)>=t)return!0;j+=i}j+=a}j+=f}j+=u}j+=s}j+=l}j+=h}j+=c}j+=p}j+=y}return!1},Qn],ao=[function(r,t){return!!(t<=1&&(r.data[r.offset]||r.data[r.offset+1]))},function(r,t){var e,n,o,i,a,f;for(i=r.shape[0],o=r.strides[0],a=r.offset,n=r.data,e=0,f=0;f<i;f++){if((n[a]||n[a+1])&&(e+=1)>=t)return!0;a+=o}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c;for(a=r.shape,1===Ar(s=r.strides)?(f=a[1],u=a[0],o=s[1],i=s[0]-f*s[1]):(f=a[0],u=a[1],o=s[0],i=s[1]-f*s[0]),l=r.offset,n=r.data,e=0,c=0;c<u;c++){for(h=0;h<f;h++){if((n[l]||n[l+1])&&(e+=1)>=t)return!0;l+=o}l+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g;for(f=r.shape,1===Ar(h=r.strides)?(u=f[2],s=f[1],l=f[0],o=h[2],i=h[1]-u*h[2],a=h[0]-s*h[1]):(u=f[0],s=f[1],l=f[2],o=h[0],i=h[1]-u*h[0],a=h[2]-s*h[1]),c=r.offset,n=r.data,e=0,g=0;g<l;g++){for(y=0;y<s;y++){for(p=0;p<u;p++){if((n[c]||n[c+1])&&(e+=1)>=t)return!0;c+=o}c+=i}c+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=r.shape,1===Ar(p=r.strides)?(s=u[3],l=u[2],h=u[1],c=u[0],o=p[3],i=p[2]-s*p[3],a=p[1]-l*p[2],f=p[0]-h*p[1]):(s=u[0],l=u[1],h=u[2],c=u[3],o=p[0],i=p[1]-s*p[0],a=p[2]-l*p[1],f=p[3]-h*p[2]),y=r.offset,n=r.data,e=0,d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){for(g=0;g<s;g++){if((n[y]||n[y+1])&&(e+=1)>=t)return!0;y+=o}y+=i}y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E;for(s=r.shape,1===Ar(g=r.strides)?(l=s[4],h=s[3],c=s[2],p=s[1],y=s[0],o=g[4],i=g[3]-l*g[4],a=g[2]-h*g[3],f=g[1]-c*g[2],u=g[0]-p*g[1]):(l=s[0],h=s[1],c=s[2],p=s[3],y=s[4],o=g[0],i=g[1]-l*g[0],a=g[2]-h*g[1],f=g[3]-c*g[2],u=g[4]-p*g[3]),m=r.offset,n=r.data,e=0,E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){for(v=0;v<l;v++){if((n[m]||n[m+1])&&(e+=1)>=t)return!0;m+=o}m+=i}m+=a}m+=f}m+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(l=r.shape,1===Ar(v=r.strides)?(h=l[5],c=l[4],p=l[3],y=l[2],g=l[1],m=l[0],o=v[5],i=v[4]-h*v[5],a=v[3]-c*v[4],f=v[2]-p*v[3],u=v[1]-y*v[2],s=v[0]-g*v[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],m=l[5],o=v[0],i=v[1]-h*v[0],a=v[2]-c*v[1],f=v[3]-p*v[2],u=v[4]-y*v[3],s=v[5]-g*v[4]),d=r.offset,n=r.data,e=0,x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){for(w=0;w<h;w++){if((n[d]||n[d+1])&&(e+=1)>=t)return!0;d+=o}d+=i}d+=a}d+=f}d+=u}d+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j;for(h=r.shape,1===Ar(w=r.strides)?(c=h[6],p=h[5],y=h[4],g=h[3],m=h[2],v=h[1],d=h[0],o=w[6],i=w[5]-c*w[6],a=w[4]-p*w[5],f=w[3]-y*w[4],u=w[2]-g*w[3],s=w[1]-m*w[2],l=w[0]-v*w[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],d=h[6],o=w[0],i=w[1]-c*w[0],a=w[2]-p*w[1],f=w[3]-y*w[2],u=w[4]-g*w[3],s=w[5]-m*w[4],l=w[6]-v*w[5]),b=r.offset,n=r.data,e=0,j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){for(E=0;E<c;E++){if((n[b]||n[b+1])&&(e+=1)>=t)return!0;b+=o}b+=i}b+=a}b+=f}b+=u}b+=s}b+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L;for(c=r.shape,1===Ar(E=r.strides)?(p=c[7],y=c[6],g=c[5],m=c[4],v=c[3],d=c[2],w=c[1],b=c[0],o=E[7],i=E[6]-p*E[7],a=E[5]-y*E[6],f=E[4]-g*E[5],u=E[3]-m*E[4],s=E[2]-v*E[3],l=E[1]-d*E[2],h=E[0]-w*E[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],b=c[7],o=E[0],i=E[1]-p*E[0],a=E[2]-y*E[1],f=E[3]-g*E[2],u=E[4]-m*E[3],s=E[5]-v*E[4],l=E[6]-d*E[5],h=E[7]-w*E[6]),_=r.offset,n=r.data,e=0,L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){for(T=0;T<p;T++){if((n[_]||n[_+1])&&(e+=1)>=t)return!0;_+=o}_+=i}_+=a}_+=f}_+=u}_+=s}_+=l}_+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(p=r.shape,1===Ar(T=r.strides)?(y=p[8],g=p[7],m=p[6],v=p[5],d=p[4],w=p[3],b=p[2],E=p[1],_=p[0],o=T[8],i=T[7]-y*T[8],a=T[6]-g*T[7],f=T[5]-m*T[6],u=T[4]-v*T[5],s=T[3]-d*T[4],l=T[2]-w*T[3],h=T[1]-b*T[2],c=T[0]-E*T[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],_=p[8],o=T[0],i=T[1]-y*T[0],a=T[2]-g*T[1],f=T[3]-m*T[2],u=T[4]-v*T[3],s=T[5]-d*T[4],l=T[6]-w*T[5],h=T[7]-b*T[6],c=T[8]-E*T[7]),x=r.offset,n=r.data,e=0,k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){for(V=0;V<y;V++){if((n[x]||n[x+1])&&(e+=1)>=t)return!0;x+=o}x+=i}x+=a}x+=f}x+=u}x+=s}x+=l}x+=h}x+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P;for(y=r.shape,1===Ar(V=r.strides)?(g=y[9],m=y[8],v=y[7],d=y[6],w=y[5],b=y[4],E=y[3],_=y[2],T=y[1],x=y[0],o=V[9],i=V[8]-g*V[9],a=V[7]-m*V[8],f=V[6]-v*V[7],u=V[5]-d*V[6],s=V[4]-w*V[5],l=V[3]-b*V[4],h=V[2]-E*V[3],c=V[1]-_*V[2],p=V[0]-T*V[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],x=y[9],o=V[0],i=V[1]-g*V[0],a=V[2]-m*V[1],f=V[3]-v*V[2],u=V[4]-d*V[3],s=V[5]-w*V[4],l=V[6]-b*V[5],h=V[7]-E*V[6],c=V[8]-_*V[7],p=V[9]-T*V[8]),A=r.offset,n=r.data,e=0,P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){for(j=0;j<g;j++){if((n[A]||n[A+1])&&(e+=1)>=t)return!0;A+=o}A+=i}A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}A+=c}A+=p}return!1},to],fo=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=(d=hn(r.shape,r.strides)).sh,h=d.sx,e=Jn(r.dtype),c=r.offset,o=r.data,i=h[0],n=0,v=u[1];v>0;)for(v<e?(l=v,v=0):(l=e,v-=e),f=c+v*h[1],m=u[0];m>0;)for(m<e?(s=m,m=0):(s=e,m-=e),p=f+m*h[0],a=h[1]-s*h[0],g=0;g<l;g++){for(y=0;y<s;y++){if(o[p]&&(n+=1)>=t)return!0;p+=i}p+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T;for(l=(T=hn(r.shape,r.strides)).sh,y=T.sx,e=Jn(r.dtype),g=r.offset,o=r.data,i=y[0],n=0,_=l[2];_>0;)for(_<e?(p=_,_=0):(p=e,_-=e),s=g+_*y[2],E=l[1];E>0;)for(E<e?(c=E,E=0):(c=e,E-=e),f=y[2]-c*y[1],u=s+E*y[1],b=l[0];b>0;)for(b<e?(h=b,b=0):(h=e,b-=e),m=u+b*y[0],a=y[1]-h*y[0],w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){if(o[m]&&(n+=1)>=t)return!0;m+=i}m+=a}m+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=(S=hn(r.shape,r.strides)).sh,v=S.sx,e=Jn(r.dtype),d=r.offset,o=r.data,i=v[0],n=0,j=c[3];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),h=d+j*v[3],A=c[2];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=v[3]-g*v[2],l=h+A*v[2],V=c[1];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),f=v[2]-y*v[1],s=l+V*v[1],x=c[0];x>0;)for(x<e?(p=x,x=0):(p=e,x-=e),w=s+x*v[0],a=v[1]-p*v[0],T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){if(o[w]&&(n+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(y=(k=hn(r.shape,r.strides)).sh,b=k.sx,e=Jn(r.dtype),E=r.offset,o=r.data,i=b[0],n=0,I=y[4];I>0;)for(I<e?(w=I,I=0):(w=e,I-=e),p=E+I*b[4],O=y[3];O>0;)for(O<e?(d=O,O=0):(d=e,O-=e),s=b[4]-d*b[3],c=p+O*b[3],L=y[2];L>0;)for(L<e?(v=L,L=0):(v=e,L-=e),u=b[3]-v*b[2],h=c+L*b[2],F=y[1];F>0;)for(F<e?(m=F,F=0):(m=e,F-=e),f=b[2]-m*b[1],l=h+F*b[1],S=y[0];S>0;)for(S<e?(g=S,S=0):(g=e,S-=e),_=l+S*b[0],a=b[1]-g*b[0],j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){if(o[_]&&(n+=1)>=t)return!0;_+=i}_+=a}_+=f}_+=u}_+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C;for(m=(C=hn(r.shape,r.strides)).sh,T=C.sx,n=Jn(r.dtype),x=r.offset,o=r.data,i=T[0],e=0,M=m[5];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),g=x+M*T[5],P=m[4];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=T[5]-E*T[4],y=g+P*T[4],R=m[3];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=T[4]-b*T[3],p=y+R*T[3],B=m[2];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=T[3]-w*T[2],c=p+B*T[2],k=m[1];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),f=T[2]-d*T[1],h=c+k*T[1],I=m[0];I>0;)for(I<n?(v=I,I=0):(v=n,I-=n),V=h+I*T[0],a=T[1]-v*T[0],O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){if(o[V]&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z;for(d=(Z=hn(r.shape,r.strides)).sh,A=Z.sx,n=Jn(r.dtype),j=r.offset,o=r.data,i=A[0],e=0,W=d[6];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),v=j+W*A[6],Y=d[5];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=A[6]-x*A[5],m=v+Y*A[5],U=d[4];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=A[5]-T*A[4],g=m+U*A[4],N=d[3];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=A[4]-_*A[3],y=g+N*A[3],C=d[2];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=A[3]-E*A[2],p=y+C*A[2],M=d[1];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),f=A[2]-b*A[1],c=p+M*A[1],P=d[0];P>0;)for(P<n?(w=P,P=0):(w=n,P-=n),S=c+P*A[0],a=A[1]-w*A[0],R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){if(o[S]&&(e+=1)>=t)return!0;S+=i}S+=a}S+=f}S+=u}S+=s}S+=l}S+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z;for(b=(z=hn(r.shape,r.strides)).sh,F=z.sx,n=Jn(r.dtype),L=r.offset,o=r.data,i=F[0],e=0,X=b[7];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),w=L+X*F[7],K=b[6];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=F[7]-j*F[6],d=w+K*F[6],G=b[5];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=F[6]-A*F[5],v=d+G*F[5],$=b[4];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=F[5]-V*F[4],m=v+$*F[4],Z=b[3];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=F[4]-x*F[3],g=m+Z*F[3],W=b[2];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=F[3]-T*F[2],y=g+W*F[2],Y=b[1];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),f=F[2]-_*F[1],p=y+Y*F[1],U=b[0];U>0;)for(U<n?(E=U,U=0):(E=n,U-=n),O=p+U*F[0],a=F[1]-E*F[0],N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){if(o[O]&&(e+=1)>=t)return!0;O+=i}O+=a}O+=f}O+=u}O+=s}O+=l}O+=h}O+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q;for(_=(Q=hn(r.shape,r.strides)).sh,I=Q.sx,n=Jn(r.dtype),k=r.offset,o=r.data,i=I[0],e=0,q=_[8];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),E=k+q*I[8],D=_[7];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=I[8]-L*I[7],b=E+D*I[7],J=_[6];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=I[7]-F*I[6],w=b+J*I[6],H=_[5];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=I[6]-S*I[5],d=w+H*I[5],z=_[4];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=I[5]-j*I[4],v=d+z*I[4],X=_[3];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=I[4]-A*I[3],m=v+X*I[3],K=_[2];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=I[3]-V*I[2],g=m+K*I[2],G=_[1];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),f=I[2]-x*I[1],y=g+G*I[1],$=_[0];$>0;)for($<n?(T=$,$=0):(T=n,$-=n),B=y+$*I[0],a=I[1]-T*I[0],Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){if(o[B]&&(e+=1)>=t)return!0;B+=i}B+=a}B+=f}B+=u}B+=s}B+=l}B+=h}B+=c}B+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or;for(x=(or=hn(r.shape,r.strides)).sh,R=or.sx,n=Jn(r.dtype),P=r.offset,o=r.data,i=R[0],e=0,nr=x[9];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),T=P+nr*R[9],er=x[8];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=R[9]-k*R[8],_=T+er*R[8],tr=x[7];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=R[8]-I*R[7],E=_+tr*R[7],rr=x[6];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=R[7]-O*R[6],b=E+rr*R[6],Q=x[5];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=R[6]-L*R[5],w=b+Q*R[5],q=x[4];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=R[5]-F*R[4],d=w+q*R[4],D=x[3];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=R[4]-S*R[3],v=d+D*R[3],J=x[2];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=R[3]-j*R[2],m=v+J*R[2],H=x[1];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),f=R[2]-A*R[1],g=m+H*R[1],z=x[0];z>0;)for(z<n?(V=z,z=0):(V=n,z-=n),M=g+z*R[0],a=R[1]-V*R[0],X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){for(C=0;C<V;C++){if(o[M]&&(e+=1)>=t)return!0;M+=i}M+=a}M+=f}M+=u}M+=s}M+=l}M+=h}M+=c}M+=p}M+=y}return!1}],uo=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w;for(s=(w=hn(r.shape,r.strides)).sh,c=w.sx,e=Jn(r.dtype),p=r.offset,o=r.data,a=c[0],i=r.accessors[0],n=0,d=s[1];d>0;)for(d<e?(h=d,d=0):(h=e,d-=e),u=p+d*c[1],v=s[0];v>0;)for(v<e?(l=v,v=0):(l=e,v-=e),y=u+v*c[0],f=c[1]-l*c[0],m=0;m<h;m++){for(g=0;g<l;g++){if(i(o,y)&&(n+=1)>=t)return!0;y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(h=(x=hn(r.shape,r.strides)).sh,g=x.sx,e=Jn(r.dtype),m=r.offset,o=r.data,a=g[0],i=r.accessors[0],n=0,T=h[2];T>0;)for(T<e?(y=T,T=0):(y=e,T-=e),l=m+T*g[2],_=h[1];_>0;)for(_<e?(p=_,_=0):(p=e,_-=e),u=g[2]-p*g[1],s=l+_*g[1],E=h[0];E>0;)for(E<e?(c=E,E=0):(c=e,E-=e),v=s+E*g[0],f=g[1]-c*g[0],b=0;b<y;b++){for(w=0;w<p;w++){for(d=0;d<c;d++){if(i(o,v)&&(n+=1)>=t)return!0;v+=a}v+=f}v+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F;for(p=(F=hn(r.shape,r.strides)).sh,d=F.sx,e=Jn(r.dtype),w=r.offset,o=r.data,a=d[0],i=r.accessors[0],n=0,S=p[3];S>0;)for(S<e?(v=S,S=0):(v=e,S-=e),c=w+S*d[3],j=p[2];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),s=d[3]-m*d[2],h=c+j*d[2],A=p[1];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=d[2]-g*d[1],l=h+A*d[1],V=p[0];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),b=l+V*d[0],f=d[1]-y*d[0],x=0;x<v;x++){for(T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){if(i(o,b)&&(n+=1)>=t)return!0;b+=a}b+=f}b+=u}b+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B;for(g=(B=hn(r.shape,r.strides)).sh,E=B.sx,n=Jn(r.dtype),_=r.offset,o=r.data,a=E[0],i=r.accessors[0],e=0,k=g[4];k>0;)for(k<n?(b=k,k=0):(b=n,k-=n),y=_+k*E[4],I=g[3];I>0;)for(I<n?(w=I,I=0):(w=n,I-=n),l=E[4]-w*E[3],p=y+I*E[3],O=g[2];O>0;)for(O<n?(d=O,O=0):(d=n,O-=n),s=E[3]-d*E[2],c=p+O*E[2],L=g[1];L>0;)for(L<n?(v=L,L=0):(v=n,L-=n),u=E[2]-v*E[1],h=c+L*E[1],F=g[0];F>0;)for(F<n?(m=F,F=0):(m=n,F-=n),T=h+F*E[0],f=E[1]-m*E[0],S=0;S<b;S++){for(j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){if(i(o,T)&&(e+=1)>=t)return!0;T+=a}T+=f}T+=u}T+=s}T+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N;for(v=(N=hn(r.shape,r.strides)).sh,x=N.sx,n=Jn(r.dtype),V=r.offset,o=r.data,a=x[0],i=r.accessors[0],e=0,C=v[5];C>0;)for(C<n?(T=C,C=0):(T=n,C-=n),m=V+C*x[5],M=v[4];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),h=x[5]-_*x[4],g=m+M*x[4],P=v[3];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=x[4]-E*x[3],y=g+P*x[3],R=v[2];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=x[3]-b*x[2],p=y+R*x[2],B=v[1];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=x[2]-w*x[1],c=p+B*x[1],k=v[0];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),A=c+k*x[0],f=x[1]-d*x[0],I=0;I<T;I++){for(O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){if(i(o,A)&&(e+=1)>=t)return!0;A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$;for(w=($=hn(r.shape,r.strides)).sh,j=$.sx,n=Jn(r.dtype),S=r.offset,o=r.data,a=j[0],i=r.accessors[0],e=0,Z=w[6];Z>0;)for(Z<n?(A=Z,Z=0):(A=n,Z-=n),d=S+Z*j[6],W=w[5];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),c=j[6]-V*j[5],v=d+W*j[5],Y=w[4];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=j[5]-x*j[4],m=v+Y*j[4],U=w[3];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=j[4]-T*j[3],g=m+U*j[3],N=w[2];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=j[3]-_*j[2],y=g+N*j[2],C=w[1];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=j[2]-E*j[1],p=y+C*j[1],M=w[0];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),F=p+M*j[0],f=j[1]-b*j[0],P=0;P<A;P++){for(R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){if(i(o,F)&&(e+=1)>=t)return!0;F+=a}F+=f}F+=u}F+=s}F+=l}F+=h}F+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H;for(E=(H=hn(r.shape,r.strides)).sh,L=H.sx,n=Jn(r.dtype),O=r.offset,o=r.data,a=L[0],i=r.accessors[0],e=0,z=E[7];z>0;)for(z<n?(F=z,z=0):(F=n,z-=n),b=O+z*L[7],X=E[6];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),p=L[7]-S*L[6],w=b+X*L[6],K=E[5];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=L[6]-j*L[5],d=w+K*L[5],G=E[4];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=L[5]-A*L[4],v=d+G*L[4],$=E[3];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=L[4]-V*L[3],m=v+$*L[3],Z=E[2];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=L[3]-x*L[2],g=m+Z*L[2],W=E[1];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=L[2]-T*L[1],y=g+W*L[1],Y=E[0];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),I=y+Y*L[0],f=L[1]-_*L[0],U=0;U<F;U++){for(N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){if(i(o,I)&&(e+=1)>=t)return!0;I+=a}I+=f}I+=u}I+=s}I+=l}I+=h}I+=c}I+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr;for(T=(rr=hn(r.shape,r.strides)).sh,k=rr.sx,n=Jn(r.dtype),B=r.offset,o=r.data,a=k[0],i=r.accessors[0],e=0,Q=T[8];Q>0;)for(Q<n?(I=Q,Q=0):(I=n,Q-=n),_=B+Q*k[8],q=T[7];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),y=k[8]-O*k[7],E=_+q*k[7],D=T[6];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=k[7]-L*k[6],b=E+D*k[6],J=T[5];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=k[6]-F*k[5],w=b+J*k[5],H=T[4];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=k[5]-S*k[4],d=w+H*k[4],z=T[3];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=k[4]-j*k[3],v=d+z*k[3],X=T[2];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=k[3]-A*k[2],m=v+X*k[2],K=T[1];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=k[2]-V*k[1],g=m+K*k[1],G=T[0];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),R=g+G*k[0],f=k[1]-x*k[0],$=0;$<I;$++){for(Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){if(i(o,R)&&(e+=1)>=t)return!0;R+=a}R+=f}R+=u}R+=s}R+=l}R+=h}R+=c}R+=p}R+=y}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or,ir;for(V=(ir=hn(r.shape,r.strides)).sh,P=ir.sx,n=Jn(r.dtype),M=r.offset,o=r.data,a=P[0],i=r.accessors[0],e=0,or=V[9];or>0;)for(or<n?(R=or,or=0):(R=n,or-=n),x=M+or*P[9],nr=V[8];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),g=P[9]-B*P[8],T=x+nr*P[8],er=V[7];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=P[8]-k*P[7],_=T+er*P[7],tr=V[6];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=P[7]-I*P[6],E=_+tr*P[6],rr=V[5];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=P[6]-O*P[5],b=E+rr*P[5],Q=V[4];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=P[5]-L*P[4],w=b+Q*P[4],q=V[3];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=P[4]-F*P[3],d=w+q*P[3],D=V[2];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=P[3]-S*P[2],v=d+D*P[2],J=V[1];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=P[2]-j*P[1],m=v+J*P[1],H=V[0];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),C=m+H*P[0],f=P[1]-A*P[0],z=0;z<R;z++){for(X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){if(i(o,C)&&(e+=1)>=t)return!0;C+=a}C+=f}C+=u}C+=s}C+=l}C+=h}C+=c}C+=p}C+=y}C+=g}return!1}],so=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=(d=hn(r.shape,r.strides)).sh,h=d.sx,n=Jn(r.dtype),c=r.offset,o=r.data,i=h[0],e=0,v=u[1];v>0;)for(v<n?(l=v,v=0):(l=n,v-=n),f=c+v*h[1],m=u[0];m>0;)for(m<n?(s=m,m=0):(s=n,m-=n),p=f+m*h[0],a=h[1]-s*h[0],g=0;g<l;g++){for(y=0;y<s;y++){if((o[p]||o[p+1])&&(e+=1)>=t)return!0;p+=i}p+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T;for(l=(T=hn(r.shape,r.strides)).sh,y=T.sx,n=Jn(r.dtype),g=r.offset,o=r.data,i=y[0],e=0,_=l[2];_>0;)for(_<n?(p=_,_=0):(p=n,_-=n),s=g+_*y[2],E=l[1];E>0;)for(E<n?(c=E,E=0):(c=n,E-=n),f=y[2]-c*y[1],u=s+E*y[1],b=l[0];b>0;)for(b<n?(h=b,b=0):(h=n,b-=n),m=u+b*y[0],a=y[1]-h*y[0],w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){if((o[m]||o[m+1])&&(e+=1)>=t)return!0;m+=i}m+=a}m+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=(S=hn(r.shape,r.strides)).sh,v=S.sx,e=Jn(r.dtype),d=r.offset,o=r.data,i=v[0],n=0,j=c[3];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),h=d+j*v[3],A=c[2];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=v[3]-g*v[2],l=h+A*v[2],V=c[1];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),f=v[2]-y*v[1],s=l+V*v[1],x=c[0];x>0;)for(x<e?(p=x,x=0):(p=e,x-=e),w=s+x*v[0],a=v[1]-p*v[0],T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){if((o[w]||o[w+1])&&(n+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(y=(k=hn(r.shape,r.strides)).sh,b=k.sx,e=Jn(r.dtype),E=r.offset,o=r.data,i=b[0],n=0,I=y[4];I>0;)for(I<e?(w=I,I=0):(w=e,I-=e),p=E+I*b[4],O=y[3];O>0;)for(O<e?(d=O,O=0):(d=e,O-=e),s=b[4]-d*b[3],c=p+O*b[3],L=y[2];L>0;)for(L<e?(v=L,L=0):(v=e,L-=e),u=b[3]-v*b[2],h=c+L*b[2],F=y[1];F>0;)for(F<e?(m=F,F=0):(m=e,F-=e),f=b[2]-m*b[1],l=h+F*b[1],S=y[0];S>0;)for(S<e?(g=S,S=0):(g=e,S-=e),_=l+S*b[0],a=b[1]-g*b[0],j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){if((o[_]||o[_+1])&&(n+=1)>=t)return!0;_+=i}_+=a}_+=f}_+=u}_+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C;for(m=(C=hn(r.shape,r.strides)).sh,T=C.sx,n=Jn(r.dtype),x=r.offset,o=r.data,i=T[0],e=0,M=m[5];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),g=x+M*T[5],P=m[4];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=T[5]-E*T[4],y=g+P*T[4],R=m[3];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=T[4]-b*T[3],p=y+R*T[3],B=m[2];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=T[3]-w*T[2],c=p+B*T[2],k=m[1];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),f=T[2]-d*T[1],h=c+k*T[1],I=m[0];I>0;)for(I<n?(v=I,I=0):(v=n,I-=n),V=h+I*T[0],a=T[1]-v*T[0],O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){if((o[V]||o[V+1])&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z;for(d=(Z=hn(r.shape,r.strides)).sh,A=Z.sx,n=Jn(r.dtype),j=r.offset,o=r.data,i=A[0],e=0,W=d[6];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),v=j+W*A[6],Y=d[5];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=A[6]-x*A[5],m=v+Y*A[5],U=d[4];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=A[5]-T*A[4],g=m+U*A[4],N=d[3];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=A[4]-_*A[3],y=g+N*A[3],C=d[2];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=A[3]-E*A[2],p=y+C*A[2],M=d[1];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),f=A[2]-b*A[1],c=p+M*A[1],P=d[0];P>0;)for(P<n?(w=P,P=0):(w=n,P-=n),S=c+P*A[0],a=A[1]-w*A[0],R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){if((o[S]||o[S+1])&&(e+=1)>=t)return!0;S+=i}S+=a}S+=f}S+=u}S+=s}S+=l}S+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z;for(b=(z=hn(r.shape,r.strides)).sh,F=z.sx,n=Jn(r.dtype),L=r.offset,o=r.data,i=F[0],e=0,X=b[7];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),w=L+X*F[7],K=b[6];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=F[7]-j*F[6],d=w+K*F[6],G=b[5];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=F[6]-A*F[5],v=d+G*F[5],$=b[4];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=F[5]-V*F[4],m=v+$*F[4],Z=b[3];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=F[4]-x*F[3],g=m+Z*F[3],W=b[2];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=F[3]-T*F[2],y=g+W*F[2],Y=b[1];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),f=F[2]-_*F[1],p=y+Y*F[1],U=b[0];U>0;)for(U<n?(E=U,U=0):(E=n,U-=n),O=p+U*F[0],a=F[1]-E*F[0],N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){if((o[O]||o[O+1])&&(e+=1)>=t)return!0;O+=i}O+=a}O+=f}O+=u}O+=s}O+=l}O+=h}O+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q;for(_=(Q=hn(r.shape,r.strides)).sh,I=Q.sx,n=Jn(r.dtype),k=r.offset,o=r.data,i=I[0],e=0,q=_[8];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),E=k+q*I[8],D=_[7];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=I[8]-L*I[7],b=E+D*I[7],J=_[6];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=I[7]-F*I[6],w=b+J*I[6],H=_[5];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=I[6]-S*I[5],d=w+H*I[5],z=_[4];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=I[5]-j*I[4],v=d+z*I[4],X=_[3];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=I[4]-A*I[3],m=v+X*I[3],K=_[2];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=I[3]-V*I[2],g=m+K*I[2],G=_[1];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),f=I[2]-x*I[1],y=g+G*I[1],$=_[0];$>0;)for($<n?(T=$,$=0):(T=n,$-=n),B=y+$*I[0],a=I[1]-T*I[0],Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){if((o[B]||o[B+1])&&(e+=1)>=t)return!0;B+=i}B+=a}B+=f}B+=u}B+=s}B+=l}B+=h}B+=c}B+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or;for(x=(or=hn(r.shape,r.strides)).sh,R=or.sx,n=Jn(r.dtype),P=r.offset,o=r.data,i=R[0],e=0,nr=x[9];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),T=P+nr*R[9],er=x[8];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=R[9]-k*R[8],_=T+er*R[8],tr=x[7];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=R[8]-I*R[7],E=_+tr*R[7],rr=x[6];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=R[7]-O*R[6],b=E+rr*R[6],Q=x[5];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=R[6]-L*R[5],w=b+Q*R[5],q=x[4];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=R[5]-F*R[4],d=w+q*R[4],D=x[3];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=R[4]-S*R[3],v=d+D*R[3],J=x[2];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=R[3]-j*R[2],m=v+J*R[2],H=x[1];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),f=R[2]-A*R[1],g=m+H*R[1],z=x[0];z>0;)for(z<n?(V=z,z=0):(V=n,z-=n),M=g+z*R[0],a=R[1]-V*R[0],X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){for(C=0;C<V;C++){if((o[M]||o[M+1])&&(e+=1)>=t)return!0;M+=i}M+=a}M+=f}M+=u}M+=s}M+=l}M+=h}M+=c}M+=p}M+=y}return!1}],lo=oo.length-1;return function(n){var o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;if(y=Lr(n[0]),g=Lr(n[1]),i=(f=y.shape).length,p=g.accessors[0](g.data,g.offset),"object"==typeof(d=y.data)&&null!==d&&"BooleanArray"===d.constructor.name&&d.BYTES_PER_ELEMENT===e?(y.data=function(r,t){return new qr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,r.length-t)}(y.data,0),y.accessorProtocol=!1):function(e){return"object"==typeof e&&null!==e&&("Complex128Array"===e.constructor.name&&e.BYTES_PER_ELEMENT===t||"Complex64Array"===e.constructor.name&&e.BYTES_PER_ELEMENT===r)}(y.data)&&(y.data=function(r,t){if(Ir(r))return Ur(r,t);if(Br(r))return Xr(r,t);throw new TypeError(I("invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.",r))}(y.data,0),y.accessorProtocol=!1,y.strides=un(i,2,y.strides,1),y.offset*=2,o=!0),0===i)return y.accessorProtocol?io[i](y,p):o?ao[i](y,p):oo[i](y,p);for(s=1,c=0,v=0;v<i;v++)s*=m=f[v],1===m&&(c+=1);if(0===s)return!1;if(1===i)return y.accessorProtocol?io[i](y,p):o?ao[i](y,p):oo[i](y,p);if(l=y.strides,c===i-1){for(v=0;v<i&&1===f[v];v++);return y.shape=[f[v]],y.strides=[l[v]],y.accessorProtocol?io[1](y,p):o?ao[1](y,p):oo[1](y,p)}if(u=function(r){var t,e;for(t=0,e=0;e<r.length;e++)r[e]<0&&(t+=1);return 0===t?1:t===r.length?-1:0}(l),0!==u){if(s===(a=W(f,l,y.offset))[1]-a[0]+1||o&&2*s==a[1]-a[0]+2)return h=1===u?a[0]:a[1],y.shape=[s],y.strides=[o?2*u:u],y.offset=h,y.accessorProtocol?io[1](y,p):o?ao[1](y,p):oo[1](y,p);if(i<=lo)return y.accessorProtocol?io[i](y,p):o?ao[i](y,p):oo[i](y,p)}return i<=lo?y.accessorProtocol?uo[i-2](y,p):o?so[i-2](y,p):fo[i-2](y,p):y.accessorProtocol?Qn(y,p):o?to(y,p):no(y,p)}},"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(r="undefined"!=typeof globalThis?globalThis:r||self).some=t();
+//# sourceMappingURL=browser.js.map
diff --git a/browser.js.map b/browser.js.map
new file mode 100644
index 0000000..0c3a82c
--- /dev/null
+++ b/browser.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"browser.js","sources":["../node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-booleanarray/lib/main.js","../node_modules/@stdlib/utils-define-property/lib/define_property.js","../node_modules/@stdlib/utils-define-property/lib/builtin.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_number.js","../node_modules/@stdlib/string-base-format-interpolate/lib/zero_pad.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_integer.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_double.js","../node_modules/@stdlib/string-base-format-interpolate/lib/space_pad.js","../node_modules/@stdlib/string-base-format-interpolate/lib/main.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_string.js","../node_modules/@stdlib/string-base-format-tokenize/lib/main.js","../node_modules/@stdlib/string-format/lib/main.js","../node_modules/@stdlib/string-format/lib/is_string.js","../node_modules/@stdlib/utils-define-property/lib/polyfill.js","../node_modules/@stdlib/utils-define-property/lib/index.js","../node_modules/@stdlib/utils-define-property/lib/has_define_property_support.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/main.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/main.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/index.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/assign.js","../node_modules/@stdlib/array-base-assert-is-accessor-array/lib/main.js","../node_modules/@stdlib/array-base-accessor-getter/lib/main.js","../node_modules/@stdlib/array-base-accessor-setter/lib/main.js","../node_modules/@stdlib/array-base-getter/lib/main.js","../node_modules/@stdlib/array-base-setter/lib/main.js","../node_modules/@stdlib/ndarray-base-numel/lib/main.js","../node_modules/@stdlib/array-base-copy-indexed/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/primitive.js","../node_modules/@stdlib/assert-has-tostringtag-support/lib/main.js","../node_modules/@stdlib/assert-has-symbol-support/lib/main.js","../node_modules/@stdlib/utils-native-class/lib/tostring.js","../node_modules/@stdlib/assert-has-own-property/lib/main.js","../node_modules/@stdlib/symbol-ctor/lib/main.js","../node_modules/@stdlib/utils-native-class/lib/tostringtag.js","../node_modules/@stdlib/utils-native-class/lib/index.js","../node_modules/@stdlib/utils-native-class/lib/polyfill.js","../node_modules/@stdlib/utils-native-class/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/valueof.js","../node_modules/@stdlib/assert-is-string/lib/object.js","../node_modules/@stdlib/assert-is-string/lib/try2valueof.js","../node_modules/@stdlib/assert-is-string/lib/main.js","../node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/main.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/index.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/index.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/assign.js","../node_modules/@stdlib/ndarray-base-strides/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/primitive.js","../node_modules/@stdlib/number-ctor/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/tostring.js","../node_modules/@stdlib/assert-is-number/lib/object.js","../node_modules/@stdlib/assert-is-number/lib/try2serialize.js","../node_modules/@stdlib/assert-is-number/lib/main.js","../node_modules/@stdlib/ndarray-base-offset/lib/main.js","../node_modules/@stdlib/ndarray-base-strides2offset/lib/main.js","../node_modules/@stdlib/math-base-special-abs/lib/main.js","../node_modules/@stdlib/ndarray-base-strides2order/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/index.js","../node_modules/@stdlib/ndarray-base-order/lib/main.js","../node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/main.js","../node_modules/@stdlib/ndarray-base-data-buffer/lib/main.js","../node_modules/@stdlib/ndarray-base-shape/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex128array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex64array/lib/main.js","../node_modules/@stdlib/assert-is-float64array/lib/main.js","../node_modules/@stdlib/array-float64/lib/index.js","../node_modules/@stdlib/assert-has-float64array-support/lib/float64array.js","../node_modules/@stdlib/array-float64/lib/main.js","../node_modules/@stdlib/assert-has-float64array-support/lib/main.js","../node_modules/@stdlib/array-float64/lib/polyfill.js","../node_modules/@stdlib/strided-base-reinterpret-complex128/lib/main.js","../node_modules/@stdlib/assert-is-float32array/lib/main.js","../node_modules/@stdlib/array-float32/lib/index.js","../node_modules/@stdlib/constants-float64-pinf/lib/index.js","../node_modules/@stdlib/assert-has-float32array-support/lib/float32array.js","../node_modules/@stdlib/array-float32/lib/main.js","../node_modules/@stdlib/assert-has-float32array-support/lib/main.js","../node_modules/@stdlib/array-float32/lib/polyfill.js","../node_modules/@stdlib/strided-base-reinterpret-complex64/lib/main.js","../node_modules/@stdlib/assert-is-uint8array/lib/main.js","../node_modules/@stdlib/array-uint8/lib/index.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/uint8array.js","../node_modules/@stdlib/array-uint8/lib/main.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/main.js","../node_modules/@stdlib/array-uint8/lib/polyfill.js","../node_modules/@stdlib/assert-is-array/lib/main.js","../node_modules/@stdlib/assert-tools-array-function/lib/main.js","../node_modules/@stdlib/assert-is-object-like/lib/main.js","../node_modules/@stdlib/assert-is-buffer/lib/main.js","../node_modules/@stdlib/regexp-function-name/lib/main.js","../node_modules/@stdlib/assert-is-object-like/lib/index.js","../node_modules/@stdlib/regexp-function-name/lib/regexp.js","../node_modules/@stdlib/utils-constructor-name/lib/main.js","../node_modules/@stdlib/regexp-function-name/lib/index.js","../node_modules/@stdlib/array-dtype/lib/ctor2dtype.js","../node_modules/@stdlib/array-uint32/lib/index.js","../node_modules/@stdlib/assert-is-uint32array/lib/main.js","../node_modules/@stdlib/constants-uint32-max/lib/index.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/uint32array.js","../node_modules/@stdlib/array-uint32/lib/main.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/main.js","../node_modules/@stdlib/array-uint32/lib/polyfill.js","../node_modules/@stdlib/array-int32/lib/index.js","../node_modules/@stdlib/assert-is-int32array/lib/main.js","../node_modules/@stdlib/assert-has-int32array-support/lib/int32array.js","../node_modules/@stdlib/array-int32/lib/main.js","../node_modules/@stdlib/assert-has-int32array-support/lib/main.js","../node_modules/@stdlib/constants-int32-min/lib/index.js","../node_modules/@stdlib/array-int32/lib/polyfill.js","../node_modules/@stdlib/array-uint16/lib/index.js","../node_modules/@stdlib/assert-is-uint16array/lib/main.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/uint16array.js","../node_modules/@stdlib/array-uint16/lib/main.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/main.js","../node_modules/@stdlib/array-uint16/lib/polyfill.js","../node_modules/@stdlib/array-int16/lib/index.js","../node_modules/@stdlib/assert-is-int16array/lib/main.js","../node_modules/@stdlib/assert-has-int16array-support/lib/int16array.js","../node_modules/@stdlib/array-int16/lib/main.js","../node_modules/@stdlib/assert-has-int16array-support/lib/main.js","../node_modules/@stdlib/constants-int16-min/lib/index.js","../node_modules/@stdlib/array-int16/lib/polyfill.js","../node_modules/@stdlib/array-uint8c/lib/index.js","../node_modules/@stdlib/assert-is-uint8clampedarray/lib/main.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/uint8clampedarray.js","../node_modules/@stdlib/array-uint8c/lib/main.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/main.js","../node_modules/@stdlib/array-uint8c/lib/polyfill.js","../node_modules/@stdlib/array-int8/lib/index.js","../node_modules/@stdlib/assert-is-int8array/lib/main.js","../node_modules/@stdlib/assert-has-int8array-support/lib/int8array.js","../node_modules/@stdlib/array-int8/lib/main.js","../node_modules/@stdlib/assert-has-int8array-support/lib/main.js","../node_modules/@stdlib/constants-int8-min/lib/index.js","../node_modules/@stdlib/array-int8/lib/polyfill.js","../node_modules/@stdlib/constants-float64-ninf/lib/index.js","../node_modules/@stdlib/math-base-special-floor/lib/main.js","../node_modules/@stdlib/math-base-assert-is-integer/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/integer.js","../node_modules/@stdlib/assert-is-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-integer/lib/object.js","../node_modules/@stdlib/assert-is-integer/lib/main.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/object.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/index.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/index.js","../node_modules/@stdlib/constants-array-max-array-length/lib/index.js","../node_modules/@stdlib/assert-is-array-like-object/lib/main.js","../node_modules/@stdlib/constants-array-max-typed-array-length/lib/index.js","../node_modules/@stdlib/assert-is-collection/lib/main.js","../node_modules/@stdlib/assert-is-arraybuffer/lib/main.js","../node_modules/@stdlib/assert-is-object/lib/main.js","../node_modules/@stdlib/assert-is-string-array/lib/index.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/re.js","../node_modules/@stdlib/assert-is-boolean/lib/primitive.js","../node_modules/@stdlib/boolean-ctor/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/tostring.js","../node_modules/@stdlib/assert-is-boolean/lib/object.js","../node_modules/@stdlib/assert-is-boolean/lib/try2serialize.js","../node_modules/@stdlib/assert-is-boolean/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/index.js","../node_modules/@stdlib/utils-global/lib/self.js","../node_modules/@stdlib/utils-global/lib/window.js","../node_modules/@stdlib/utils-global/lib/global_this.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/nodelist.js","../node_modules/@stdlib/utils-global/lib/browser.js","../node_modules/@stdlib/utils-global/lib/codegen.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js","../node_modules/@stdlib/utils-type-of/lib/index.js","../node_modules/@stdlib/utils-type-of/lib/check.js","../node_modules/@stdlib/utils-type-of/lib/polyfill.js","../node_modules/@stdlib/utils-type-of/lib/main.js","../node_modules/@stdlib/assert-is-function/lib/main.js","../node_modules/@stdlib/utils-define-read-only-property/lib/main.js","../node_modules/@stdlib/complex-float64-ctor/lib/main.js","../node_modules/@stdlib/complex-float64-ctor/lib/tostring.js","../node_modules/@stdlib/complex-float64-ctor/lib/tojson.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/main.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/polyfill.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/index.js","../node_modules/@stdlib/complex-float32-ctor/lib/main.js","../node_modules/@stdlib/assert-is-complex-like/lib/main.js","../node_modules/@stdlib/math-base-assert-is-even/lib/main.js","../node_modules/@stdlib/assert-has-iterator-symbol-support/lib/main.js","../node_modules/@stdlib/complex-float32-ctor/lib/tostring.js","../node_modules/@stdlib/complex-float32-ctor/lib/tojson.js","../node_modules/@stdlib/symbol-iterator/lib/main.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/main.js","../node_modules/@stdlib/complex-float32-real/lib/main.js","../node_modules/@stdlib/complex-float32-imag/lib/main.js","../node_modules/@stdlib/array-complex64/lib/from_iterator.js","../node_modules/@stdlib/array-complex64/lib/main.js","../node_modules/@stdlib/array-complex64/lib/from_array.js","../node_modules/@stdlib/complex-float64-real/lib/main.js","../node_modules/@stdlib/complex-float64-imag/lib/main.js","../node_modules/@stdlib/array-complex128/lib/from_iterator.js","../node_modules/@stdlib/array-complex64/lib/from_iterator_map.js","../node_modules/@stdlib/array-complex128/lib/main.js","../node_modules/@stdlib/array-complex128/lib/from_array.js","../node_modules/@stdlib/array-bool/lib/from_iterator.js","../node_modules/@stdlib/array-complex128/lib/from_iterator_map.js","../node_modules/@stdlib/array-bool/lib/main.js","../node_modules/@stdlib/array-bool/lib/from_array.js","../node_modules/@stdlib/array-bool/lib/from_iterator_map.js","../node_modules/@stdlib/array-dtype/lib/ctors.js","../node_modules/@stdlib/array-dtype/lib/dtypes.js","../node_modules/@stdlib/array-dtype/lib/main.js","../node_modules/@stdlib/array-base-arraylike2object/lib/main.js","../node_modules/@stdlib/blas-base-gscal/lib/accessors.js","../node_modules/@stdlib/blas-base-gscal/lib/ndarray.js","../node_modules/@stdlib/blas-base-gscal/lib/main.js","../node_modules/@stdlib/strided-base-stride2offset/lib/main.js","../node_modules/@stdlib/array-base-zero-to/lib/main.js","../node_modules/@stdlib/array-base-zero-to/lib/assign.js","../node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/main.js","../node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/sort2ins.js","../node_modules/@stdlib/array-base-take-indexed/lib/main.js","../node_modules/@stdlib/assert-is-positive-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-positive-integer/lib/object.js","../node_modules/@stdlib/assert-is-positive-integer/lib/main.js","../node_modules/@stdlib/utils-keys/lib/builtin.js","../node_modules/@stdlib/blas-base-gscal/lib/index.js","../node_modules/@stdlib/array-base-zero-to/lib/index.js","../node_modules/@stdlib/assert-is-positive-integer/lib/index.js","../node_modules/@stdlib/utils-keys/lib/has_builtin.js","../node_modules/@stdlib/assert-is-arguments/lib/detect.js","../node_modules/@stdlib/assert-is-arguments/lib/main.js","../node_modules/@stdlib/math-base-assert-is-nan/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/primitive.js","../node_modules/@stdlib/assert-is-nan/lib/object.js","../node_modules/@stdlib/assert-is-nan/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/index.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/native.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/has_string_enumerability_bug.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/main.js","../node_modules/@stdlib/assert-is-arguments/lib/index.js","../node_modules/@stdlib/assert-is-arguments/lib/polyfill.js","../node_modules/@stdlib/utils-keys/lib/builtin_wrapper.js","../node_modules/@stdlib/utils-keys/lib/has_enumerable_prototype_bug.js","../node_modules/@stdlib/utils-noop/lib/main.js","../node_modules/@stdlib/utils-keys/lib/has_non_enumerable_properties_bug.js","../node_modules/@stdlib/utils-index-of/lib/main.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype.js","../node_modules/@stdlib/utils-keys/lib/main.js","../node_modules/@stdlib/utils-keys/lib/window.js","../node_modules/@stdlib/utils-keys/lib/has_automation_equality_bug.js","../node_modules/@stdlib/utils-keys/lib/has_window.js","../node_modules/@stdlib/utils-keys/lib/has_arguments_bug.js","../node_modules/@stdlib/utils-keys/lib/polyfill.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype_wrapper.js","../node_modules/@stdlib/utils-get-prototype-of/lib/detect.js","../node_modules/@stdlib/object-ctor/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/native.js","../node_modules/@stdlib/utils-get-prototype-of/lib/polyfill.js","../node_modules/@stdlib/utils-get-prototype-of/lib/proto.js","../node_modules/@stdlib/assert-is-plain-object/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/main.js","../node_modules/@stdlib/object-inverse/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype-enums/lib/main.js","../node_modules/@stdlib/ndarray-base-bytes-per-element/lib/main.js","../node_modules/@stdlib/ndarray-base-tiling-block-size/lib/defaults.js","../node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/main.js","../node_modules/@stdlib/ndarray-base-tiling-block-size/lib/main.js","../node_modules/@stdlib/ndarray-base-vind2bind/lib/main.js","../lib/nd_accessors.js","../lib/nd_complex.js","../lib/nd.js","../lib/main.js","../lib/0d.js","../lib/1d.js","../lib/2d.js","../lib/3d.js","../lib/4d.js","../lib/5d.js","../lib/6d.js","../lib/7d.js","../lib/8d.js","../lib/9d.js","../lib/10d.js","../lib/0d_accessors.js","../lib/1d_accessors.js","../lib/2d_accessors.js","../lib/3d_accessors.js","../lib/4d_accessors.js","../lib/5d_accessors.js","../lib/6d_accessors.js","../lib/7d_accessors.js","../lib/8d_accessors.js","../lib/9d_accessors.js","../lib/10d_accessors.js","../lib/0d_complex.js","../lib/1d_complex.js","../lib/2d_complex.js","../lib/3d_complex.js","../lib/4d_complex.js","../lib/5d_complex.js","../lib/6d_complex.js","../lib/7d_complex.js","../lib/8d_complex.js","../lib/9d_complex.js","../lib/10d_complex.js","../lib/2d_blocked.js","../lib/3d_blocked.js","../lib/4d_blocked.js","../lib/5d_blocked.js","../lib/6d_blocked.js","../lib/7d_blocked.js","../lib/8d_blocked.js","../lib/9d_blocked.js","../lib/10d_blocked.js","../lib/2d_blocked_accessors.js","../lib/3d_blocked_accessors.js","../lib/4d_blocked_accessors.js","../lib/5d_blocked_accessors.js","../lib/6d_blocked_accessors.js","../lib/7d_blocked_accessors.js","../lib/8d_blocked_accessors.js","../lib/9d_blocked_accessors.js","../lib/10d_blocked_accessors.js","../lib/2d_blocked_complex.js","../lib/3d_blocked_complex.js","../lib/4d_blocked_complex.js","../lib/5d_blocked_complex.js","../lib/6d_blocked_complex.js","../lib/7d_blocked_complex.js","../lib/8d_blocked_complex.js","../lib/9d_blocked_complex.js","../lib/10d_blocked_complex.js","../node_modules/@stdlib/strided-base-reinterpret-boolean/lib/main.js","../node_modules/@stdlib/strided-base-reinterpret-complex/lib/main.js","../node_modules/@stdlib/ndarray-base-iteration-order/lib/main.js"],"sourcesContent":["/**\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\nvar C64_BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\nvar C128_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 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*\n* bool = isComplexTypedArray( [] );\n* // returns false\n*/\nfunction isComplexTypedArray( 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-complex-typed-array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t(\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\t\t\tvalue.BYTES_PER_ELEMENT === C128_BYTES_PER_ELEMENT\n\t\t\t) ||\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\t\t\tvalue.BYTES_PER_ELEMENT === C64_BYTES_PER_ELEMENT\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplexTypedArray;\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 = 1; // 1 bytes per uint8\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `BooleanArray`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if 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* bool = isBooleanArray( [] );\n* // returns false\n*/\nfunction isBooleanArray( 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 `BooleanArray` 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-booleanarray`.\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// EXPORTS //\n\nexport default isBooleanArray;\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 Object.defineProperty === 'function' ) ? Object.defineProperty : null;\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* 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* @name defineProperty\n* @type {Function}\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} 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*/\nvar defineProperty = Object.defineProperty;\n\n\n// EXPORTS //\n\nexport default defineProperty;\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 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' );  // NOTE: we inline the `isNumber.isPrimitive` function from `@stdlib/assert/is-number` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\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* Tests if a string starts with a minus sign (`-`).\n*\n* @private\n* @param {string} str - input string\n* @returns {boolean} boolean indicating if a string starts with a minus sign (`-`)\n*/\nfunction startsWithMinus( str ) {\n\treturn str[ 0 ] === '-';\n}\n\n/**\n* Returns a string of `n` zeros.\n*\n* @private\n* @param {number} n - number of zeros\n* @returns {string} string of zeros\n*/\nfunction zeros( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += '0';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with zeros 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 zeroPad( str, width, right ) {\n\tvar negative = false;\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tif ( startsWithMinus( str ) ) {\n\t\tnegative = true;\n\t\tstr = str.substr( 1 );\n\t}\n\tstr = ( right ) ?\n\t\tstr + zeros( pad ) :\n\t\tzeros( pad ) + str;\n\tif ( negative ) {\n\t\tstr = '-' + str;\n\t}\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default zeroPad;\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 isNumber from './is_number.js';\nimport zeroPad from './zero_pad.js';\n\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as an integer.\n*\n* @private\n* @param {Object} token - token object\n* @throws {Error} must provide a valid integer\n* @returns {string} formatted token argument\n*/\nfunction formatInteger( token ) {\n\tvar base;\n\tvar out;\n\tvar i;\n\n\tswitch ( token.specifier ) {\n\tcase 'b':\n\t\t// Case: %b (binary)\n\t\tbase = 2;\n\t\tbreak;\n\tcase 'o':\n\t\t// Case: %o (octal)\n\t\tbase = 8;\n\t\tbreak;\n\tcase 'x':\n\tcase 'X':\n\t\t// Case: %x, %X (hexadecimal)\n\t\tbase = 16;\n\t\tbreak;\n\tcase 'd':\n\tcase 'i':\n\tcase 'u':\n\tdefault:\n\t\t// Case: %d, %i, %u (decimal)\n\t\tbase = 10;\n\t\tbreak;\n\t}\n\tout = token.arg;\n\ti = parseInt( out, 10 );\n\tif ( !isFinite( i ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\tif ( !isNumber( out ) ) {\n\t\t\tthrow new Error( 'invalid integer. Value: ' + out );\n\t\t}\n\t\ti = 0;\n\t}\n\tif ( i < 0 && ( token.specifier === 'u' || base !== 10 ) ) {\n\t\ti = 0xffffffff + i + 1;\n\t}\n\tif ( i < 0 ) {\n\t\tout = ( -i ).toString( base );\n\t\tif ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tout = '-' + out;\n\t} else {\n\t\tout = i.toString( base );\n\t\tif ( !i && !token.precision ) {\n\t\t\tout = '';\n\t\t} else if ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tif ( token.sign ) {\n\t\t\tout = token.sign + out;\n\t\t}\n\t}\n\tif ( base === 16 ) {\n\t\tif ( token.alternate ) {\n\t\t\tout = '0x' + out;\n\t\t}\n\t\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\t\tuppercase.call( out ) :\n\t\t\tlowercase.call( out );\n\t}\n\tif ( base === 8 ) {\n\t\tif ( token.alternate && out.charAt( 0 ) !== '0' ) {\n\t\t\tout = '0' + out;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatInteger;\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\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar abs = Math.abs; // eslint-disable-line stdlib/no-builtin-math\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\nvar replace = String.prototype.replace;\n\n\n// VARIABLES //\n\nvar RE_EXP_POS_DIGITS = /e\\+(\\d)$/;\nvar RE_EXP_NEG_DIGITS = /e-(\\d)$/;\nvar RE_ONLY_DIGITS = /^(\\d+)$/;\nvar RE_DIGITS_BEFORE_EXP = /^(\\d+)e/;\nvar RE_TRAILING_PERIOD_ZERO = /\\.0$/;\nvar RE_PERIOD_ZERO_EXP = /\\.0*e/;\nvar RE_ZERO_BEFORE_EXP = /(\\..*[^0])0*e/;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as a floating-point number.\n*\n* @private\n* @param {number} f - parsed number\n* @param {Object} token - token object\n* @throws {Error} must provide a valid floating-point number\n* @returns {string} formatted token argument\n*/\nfunction formatDouble( f, token ) {\n\tvar digits;\n\tvar out;\n\n\tswitch ( token.specifier ) {\n\tcase 'e':\n\tcase 'E':\n\t\tout = f.toExponential( token.precision );\n\t\tbreak;\n\tcase 'f':\n\tcase 'F':\n\t\tout = f.toFixed( token.precision );\n\t\tbreak;\n\tcase 'g':\n\tcase 'G':\n\t\tif ( abs( f ) < 0.0001 ) {\n\t\t\tdigits = token.precision;\n\t\t\tif ( digits > 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 <boolean>\n*/\nfunction hasDefinePropertySupport() {\n\t// Test basic support...\n\ttry {\n\t\tdefineProperty( {}, 'x', {} );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default hasDefinePropertySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {Array} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\treturn [ offset, offset ];\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\treturn [ min, max ];\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @module @stdlib/ndarray-base-minmax-view-buffer-index\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view and assigns results to a provided output array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset, out ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\tout[ 0 ] = offset;\n\t\t\tout[ 1 ] = offset;\n\t\t\treturn out;\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\tout[ 0 ] = min;\n\tout[ 1 ] = max;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns <Complex128>[ 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 <Complex64>[ 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 <Complex64>[ 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 <Complex128>[ 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 <Complex64>[ 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 <Complex64>[ 10.0, 11.0 ]\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the number of elements in an array.\n*\n* @param {(NonNegativeIntegerArray|EmptyArray)} shape - array shape\n* @returns {NonNegativeInteger} number of elements\n*\n* @example\n* var n = numel( [ 3, 3, 3 ] );\n* // returns 27\n*/\nfunction numel( shape ) {\n\tvar ndims;\n\tvar n;\n\tvar i;\n\n\tndims = shape.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0;\n\t}\n\tn = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tn *= shape[ i ];\n\t}\n\treturn n;\n}\n\n\n// EXPORTS //\n\nexport default numel;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar i;\n\n\tlen = x.length;\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( x[ i ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default copy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasSymbols from '@stdlib/assert-has-symbol-support';\n\n\n// VARIABLES //\n\nvar FLG = hasSymbols();\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.toStringTag` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.toStringTag` support\n*\n* @example\n* var bool = hasToStringTagSupport();\n* // returns <boolean>\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 <boolean>\n*/\nfunction hasSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar toStr = Object.prototype.toString;\n\n\n// EXPORTS //\n\nexport default toStr;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\nvar has = Object.prototype.hasOwnProperty;\n\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasOwnProp( value, property ) {\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\treturn has.call( value, property );\n}\n\n\n// EXPORTS //\n\nexport default hasOwnProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar Sym = ( typeof Symbol === 'function' ) ? Symbol : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Sym;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\nvar toStrTag = ( typeof Symbol === 'function' ) ? Symbol.toStringTag : '';\n\n\n// EXPORTS //\n\nexport default toStrTag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a string value indicating a specification defined classification of an object.\n*\n* @module @stdlib/utils-native-class\n*\n* @example\n* import nativeClass from '@stdlib/utils-native-class';\n*\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* function Beep() {\n*     return this;\n* }\n* str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( hasToStringTag() ) {\n\tmain = polyfill;\n} else {\n\tmain = builtin;\n}\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport toStringTag from './tostringtag.js';\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification of an object in environments supporting `Symbol.toStringTag`.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n*     return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\tvar isOwn;\n\tvar tag;\n\tvar out;\n\n\tif ( v === null || v === void 0 ) {\n\t\treturn toStr.call( v );\n\t}\n\ttag = v[ toStringTag ];\n\tisOwn = hasOwnProp( v, toStringTag );\n\n\t// Attempt to override the `toStringTag` property. For built-ins having a `Symbol.toStringTag` property (e.g., `JSON`, `Math`, etc), the `Symbol.toStringTag` property is read-only (e.g., , so we need to wrap in a `try/catch`.\n\ttry {\n\t\tv[ toStringTag ] = void 0;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn toStr.call( v );\n\t}\n\tout = toStr.call( v );\n\n\tif ( isOwn ) {\n\t\tv[ toStringTag ] = tag;\n\t} else {\n\t\tdelete v[ toStringTag ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification (via the internal property `[[Class]]`) of an object.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n*     return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\treturn toStr.call( v );\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar valueOf = String.prototype.valueOf; // non-generic\n\n\n// EXPORTS //\n\nexport default valueOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string object\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns false\n*/\nfunction isString( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof String ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object String]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to extract a string value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a string can be extracted\n*/\nfunction test( value ) {\n\ttry {\n\t\tvalueOf.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a string\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*/\nfunction isString( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether an input value is the string representing column-major order.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean result\n*\n* @example\n* var bool = isColumnMajorString( 'column-major' );\n* // returns true\n*\n* bool = isColumnMajorString( 'row-major' );\n* // returns false\n*\n* bool = isColumnMajorString( 'foo' );\n* // returns false\n*/\nfunction isColumnMajorString( v ) {\n\treturn ( v === 'column-major' );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction rowmajor( shape ) {\n\tvar ndims;\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tout = [];\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tout.push( 0 );\n\t}\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction columnmajor( shape ) {\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tout = [];\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout.push( s );\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {Array} array strides\n*\n* @example\n* var s = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* s = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape );\n\t}\n\treturn rowmajor( shape );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a string.\n*\n* @module @stdlib/assert-is-string\n*\n* @example\n* import isString from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 5 );\n* // returns false\n*\n* @example\n* import { isObject as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 'beep' );\n* // returns false\n*\n* @example\n* import { isPrimitive as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a stride array from an array shape.\n*\n* @module @stdlib/ndarray-base-shape2strides\n*\n* @example\n* import shape2strides from '@stdlib/ndarray-base-shape2strides';\n*\n* var strides = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* strides = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction rowmajor( shape, out ) {\n\tvar ndims;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction columnmajor( shape, out ) {\n\tvar s;\n\tvar i;\n\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*\n* @example\n* var strides = [ 0, 0 ];\n*\n* var out = shape2strides( [ 3, 2 ], 'row-major', strides );\n* // returns [ 2, 1 ]\n*\n* var bool = ( out === strides );\n* // returns true\n*\n* out = shape2strides( [ 3, 2 ], 'column-major', strides );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order, out ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape, out );\n\t}\n\treturn rowmajor( shape, out );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `strides` property\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x, copy ) {\n\tvar ord;\n\tvar sh;\n\tvar st;\n\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\tsh = x.shape;\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isString( ord ) ) {\n\t\t\tord = ROW_MAJOR;\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\tif ( copy ) {\n\t\treturn copyIndexed( st );\n\t}\n\treturn st;\n}\n\n\n// EXPORTS //\n\nexport default strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// EXPORTS //\n\nexport default Number; // eslint-disable-line stdlib/require-globals\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Number.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Number from '@stdlib/number-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\nfunction isNumber( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Number ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Number]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a number\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( null );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport strides2offset from '@stdlib/ndarray-base-strides2offset';\n\n\n// MAIN //\n\n/**\n* Returns the index offset specifying the underlying buffer index of the first iterated ndarray element.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {NonNegativeInteger} index offset\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = offset( zeros( [ 3, 3, 3 ] ) );\n* // returns 0\n*/\nfunction offset( x ) {\n\tvar st;\n\tvar sh;\n\tvar o;\n\n\to = x.offset;\n\tif ( isNumber( o ) ) {\n\t\treturn o;\n\t}\n\tsh = x.shape;\n\tif ( sh.length === 0 ) {\n\t\treturn 0;\n\t}\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn 0;\n\t}\n\treturn strides2offset( sh, st );\n}\n\n\n// EXPORTS //\n\nexport default offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the index offset which specifies the location of the first indexed value in a multidimensional array based on a stride array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var shape = [ 2, 3, 10 ];\n* var strides = [ 30, -10, 1 ];\n*\n* var offset = strides2offset( shape, strides );\n* // returns 20\n*/\nfunction strides2offset( shape, strides ) {\n\tvar offset;\n\tvar ndims;\n\tvar i;\n\n\tndims = shape.length;\n\toffset = 0;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\t// Note that, since the stride is negative, this operation increments, not decrements, the offset...\n\t\t\toffset -= strides[ i ] * ( shape[ i ]-1 );\n\t\t}\n\t}\n\treturn offset;\n}\n\n\n// EXPORTS //\n\nexport default strides2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the absolute value of a double-precision floating-point number `x`.\n*\n* @param {number} x - input value\n* @returns {number} absolute value\n*\n* @example\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* @example\n* var v = abs( 2.0 );\n* // returns 2.0\n*\n* @example\n* var v = abs( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( -0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( NaN );\n* // returns NaN\n*/\nfunction abs( x ) {\n\treturn Math.abs( x ); // eslint-disable-line stdlib/no-builtin-math\n}\n\n\n// EXPORTS //\n\nexport default abs;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport abs from '@stdlib/math-base-special-abs';\n\n\n// MAIN //\n\n/**\n* Determines the order of a multidimensional array based on a provided stride array.\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} order\n*\n* @example\n* var order = strides2order( [ 2, 1 ] );\n* // returns 1\n*\n* order = strides2order( [ 1, 2 ] );\n* // returns 2\n*\n* order = strides2order( [ 1, 1, 1 ] );\n* // returns 3\n*\n* order = strides2order( [ 2, 3, 1 ] );\n* // returns 0\n*/\nfunction strides2order( strides ) {\n\tvar column;\n\tvar ndims;\n\tvar row;\n\tvar s1;\n\tvar s2;\n\tvar i;\n\n\tndims = strides.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0|0; // 'none'\n\t}\n\tcolumn = true;\n\trow = true;\n\n\ts1 = abs( strides[ 0 ] );\n\tfor ( i = 1; i < ndims; i++ ) {\n\t\ts2 = abs( strides[ i ] );\n\t\tif ( column && s2 < s1 ) {\n\t\t\tcolumn = false;\n\t\t} else if ( row && s2 > s1 ) {\n\t\t\trow = false;\n\t\t}\n\t\tif ( row || column ) {\n\t\t\ts1 = s2;\n\t\t} else {\n\t\t\treturn 0|0; // 'none'\n\t\t}\n\t}\n\tif ( row && column ) {\n\t\treturn 3|0; // 'both'\n\t}\n\tif ( row ) {\n\t\treturn 1|0; // 'row-major'\n\t}\n\treturn 2|0; // 'column-major'\n}\n\n\n// EXPORTS //\n\nexport default strides2order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a number.\n*\n* @module @stdlib/assert-is-number\n*\n* @example\n* import isNumber from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\nvar COLUMN_MAJOR = 'column-major';\n\n\n// MAIN //\n\n/**\n* Returns the layout order of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {(string|null)} layout order\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'order': 'row-major'\n* });\n*\n* var out = order( x );\n* // returns 'row-major'\n*/\nfunction order( x ) {\n\tvar st;\n\tvar o;\n\n\to = x.order;\n\tif ( isString( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn ROW_MAJOR; // WARNING: default to row-major for ndarray-like objects lacking strides. This may or may not be accurate, and we're defaulting to row-major here based on the belief that row-major is more likely given that, e.g., JavaScript arrays are similar to C arrays (i.e., stored in row-major order).\n\t}\n\to = strides2order( st );\n\tif ( o === 1 || o === 3 ) {\n\t\treturn ROW_MAJOR; // for o == 3 (both row- and column-major; e.g., one-dimensional ndarrays), default to row-major\n\t}\n\tif ( o === 2 ) {\n\t\treturn COLUMN_MAJOR;\n\t}\n\t// o === 0\n\tif ( x.shape.length === 0 ) {\n\t\treturn ROW_MAJOR; // default to row-major for zero-dimensional ndarrays\n\t}\n\t// Case: mixed strides (e.g., [ 2, 3, 1 ] )\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport numel from '@stdlib/ndarray-base-numel';\nimport getDType from '@stdlib/ndarray-base-dtype';\nimport getShape from '@stdlib/ndarray-base-shape';\nimport getStrides from '@stdlib/ndarray-base-strides';\nimport getOffset from '@stdlib/ndarray-base-offset';\nimport getOrder from '@stdlib/ndarray-base-order';\nimport getData from '@stdlib/ndarray-base-data-buffer';\n\n\n// MAIN //\n\n/**\n* Converts an ndarray-like object to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* -   This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding ndarray meta data to ensure that internal functions operating on ndarrays are provided consistent argument \"shapes\".\n*\n* -   The returned object has the following properties:\n*\n*     -   **ref**: reference to the original ndarray-like object.\n*     -   **dtype**: underlying data type.\n*     -   **data**: data buffer.\n*     -   **length**: number of elements.\n*     -   **shape**: array dimensions.\n*     -   **strides**: array strides.\n*     -   **offset**: index offset.\n*     -   **order**: order.\n*     -   **accessorProtocol**: `boolean` indicating whether the data buffer supports the get/set protocol (i.e., uses accessors for getting and setting elements).\n*     -   **accessors**: a two-element array whose first element is an accessor for retrieving an ndarray element and whose second element is an accessor for setting an ndarray element.\n*\n* @param {ndarrayLike} x - ndarray-like object\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @returns {Object} object containing ndarray meta data\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ] );\n*\n* var obj = ndarraylike2object( x );\n* // returns {...}\n*/\nfunction ndarraylike2object( x ) {\n\tvar xbuf;\n\tvar bool;\n\tvar sh;\n\tvar dt;\n\n\txbuf = getData( x );\n\tsh = getShape( x, true );\n\tdt = getDType( x );\n\n\tbool = isAccessorArray( xbuf );\n\n\treturn {\n\t\t'ref': x,\n\t\t'dtype': dt,\n\t\t'data': xbuf,\n\t\t'length': numel( sh ),\n\t\t'shape': sh,\n\t\t'strides': getStrides( x, true ),\n\t\t'offset': getOffset( x ),\n\t\t'order': getOrder( x ),\n\t\t'accessorProtocol': bool,\n\t\t'accessors': ( bool ) ?\n\t\t\t[ accessorGetter( dt ), accessorSetter( dt ) ] :\n\t\t\t[ getter( dt ), setter( dt ) ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default ndarraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the underlying data buffer of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {Collection} underlying data buffer\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'dtype': 'float64'\n* });\n*\n* var out = data( x );\n* // returns <Float64Array>\n*/\nfunction data( x ) {\n\treturn x.data;\n}\n\n\n// EXPORTS //\n\nexport default data;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `shape` property\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x, copy ) {\n\tvar sh = x.shape;\n\tif ( copy ) {\n\t\treturn copyIndexed( sh );\n\t}\n\treturn sh;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {string} data type\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'dtype': 'float64'\n* });\n*\n* var dt = dtype( x );\n* // returns 'float64'\n*/\nfunction dtype( x ) {\n\treturn x.dtype;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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/**\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 <Float64Array>\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// MAIN //\n\nvar main = ( typeof Float64Array === 'function' ) ? Float64Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat64Array from '@stdlib/assert-is-float64array';\nimport GlobalFloat64Array from './float64array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float64Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float64Array` support\n*\n* @example\n* var bool = hasFloat64ArraySupport();\n* // returns <boolean>\n*/\nfunction hasFloat64ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat64Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat64Array( [ 1.0, 3.14, -3.14, NaN ] );\n\t\tbool = (\n\t\t\tisFloat64Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.14 &&\n\t\t\tarr[ 2 ] === -3.14 &&\n\t\t\tarr[ 3 ] !== arr[ 3 ]\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 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 <Float64Array>\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 nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat32Array = ( typeof Float32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float32Array\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat32Array( [] );\n* // returns false\n*/\nfunction isFloat32Array( value ) {\n\treturn (\n\t\t( hasFloat32Array && value instanceof Float32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 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 <Float32Array>\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/**\n* Double-precision floating-point positive infinity.\n*\n* @module @stdlib/constants-float64-pinf\n* @type {number}\n*\n* @example\n* import FLOAT64_PINF from '@stdlib/constants-float64-pinf';\n* // returns Infinity\n*/\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point positive infinity has the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.POSITIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_PINF = Number.POSITIVE_INFINITY; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default FLOAT64_PINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float32Array === 'function' ) ? Float32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat32Array from '@stdlib/assert-is-float32array';\nimport PINF from '@stdlib/constants-float64-pinf';\nimport GlobalFloat32Array from './float32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float32Array` support\n*\n* @example\n* var bool = hasFloat32ArraySupport();\n* // returns <boolean>\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) 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 <Float32Array>\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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* 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 <Uint8Array>\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// MAIN //\n\nvar main = ( typeof Uint8Array === 'function' ) ? Uint8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8Array === 'function' ) ? Uint8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8Array from '@stdlib/assert-is-uint8array';\nimport UINT8_MAX from '@stdlib/constants-uint8-max';\nimport GlobalUint8Array from './uint8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8Array` support\n*\n* @example\n* var bool = hasUint8ArraySupport();\n* // returns <boolean>\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 f;\n\n\n// FUNCTIONS //\n\n/**\n* Tests if a value is an array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an array\n*\n* @example\n* var bool = isArray( [] );\n* // returns true\n*\n* @example\n* var bool = isArray( {} );\n* // returns false\n*/\nfunction isArray( value ) {\n\treturn ( nativeClass( value ) === '[object Array]' );\n}\n\n\n// MAIN //\n\nif ( Array.isArray ) {\n\tf = Array.isArray;\n} else {\n\tf = isArray;\n}\n\n\n// EXPORTS //\n\nexport default f;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* import isOdd from '@stdlib/assert-is-odd';\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default arrayfcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is object-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is object-like\n*\n* @example\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( [] );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( null );\n* // returns false\n*/\nfunction isObjectLike( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObjectLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Buffer instance.\n*\n* @param {*} value - value to validate\n* @returns {boolean} boolean indicating if a value is a Buffer instance\n*\n* @example\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( new Buffer( [1,2,3,4] ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( {} );\n* // returns false\n*\n* @example\n* var v = isBuffer( [] );\n* // returns false\n*/\nfunction isBuffer( value ) {\n\treturn (\n\t\tisObjectLike( value ) &&\n\t\t(\n\t\t\t// eslint-disable-next-line no-underscore-dangle\n\t\t\tvalue._isBuffer || // for envs missing Object.prototype.constructor (e.g., Safari 5-7)\n\t\t\t(\n\t\t\t\tvalue.constructor &&\n\n\t\t\t\t// WARNING: `typeof` is not a foolproof check, as certain envs consider RegExp and NodeList instances to be functions\n\t\t\t\ttypeof value.constructor.isBuffer === 'function' &&\n\t\t\t\tvalue.constructor.isBuffer( value )\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @returns {RegExp} regular expression\n*\n* @example\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n*     return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\nfunction reFunctionName() {\n\treturn /^\\s*function\\s*([^(]*)/i;\n}\n\n\n// EXPORTS //\n\nexport default reFunctionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is object-like.\n*\n* @module @stdlib/assert-is-object-like\n*\n* @example\n* import isObjectLike from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* bool = isObjectLike( [] );\n* // returns true\n*\n* bool = isObjectLike( null );\n* // returns false\n*\n* @example\n* import { isObjectLikeArray as isObjectLike } from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( [ {}, [] ] );\n* // returns true\n*\n* bool = isObjectLike( [ {}, '3.0' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport main from './main.js';\n\n\n// VARIABLES //\n\nvar isObjectLikeArray = arrayfun( main );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isObjectLikeArray', isObjectLikeArray );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport reFunctionName from './main.js';\n\n\n// MAIN //\n\n/**\n* Captures everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* Regular expression: `/^\\s*function\\s*([^(]*)/i`\n*\n* -   `/^\\s*`\n*     -   Match zero or more spaces at beginning\n*\n* -   `function`\n*     -   Match the word `function`\n*\n* -   `\\s*`\n*     -   Match zero or more spaces after the word `function`\n*\n* -   `()`\n*     -   Capture\n*\n* -   `[^(]*`\n*     -   Match anything except a left parenthesis `(` zero or more times\n*\n* -   `/i`\n*     -   ignore case\n*\n* @constant\n* @type {RegExp}\n* @default /^\\s*function\\s*([^(]*)/i\n*/\nvar RE_FUNCTION_NAME = reFunctionName();\n\n\n// EXPORTS //\n\nexport default RE_FUNCTION_NAME;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\nimport isBuffer from '@stdlib/assert-is-buffer';\n\n\n// MAIN //\n\n/**\n* Determines the name of a value's constructor.\n*\n* @param {*} v - input value\n* @returns {string} name of a value's constructor\n*\n* @example\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* @example\n* var v = constructorName( 5 );\n* // returns 'Number'\n*\n* @example\n* var v = constructorName( null );\n* // returns 'Null'\n*\n* @example\n* var v = constructorName( undefined );\n* // returns 'Undefined'\n*\n* @example\n* var v = constructorName( function noop() {} );\n* // returns 'Function'\n*/\nfunction constructorName( v ) {\n\tvar match;\n\tvar name;\n\tvar ctor;\n\tname = nativeClass( v ).slice( 8, -1 );\n\tif ( (name === 'Object' || name === 'Error') && v.constructor ) {\n\t\tctor = v.constructor;\n\t\tif ( typeof ctor.name === 'string' ) {\n\t\t\treturn ctor.name;\n\t\t}\n\t\tmatch = RE.exec( ctor.toString() );\n\t\tif ( match ) {\n\t\t\treturn match[ 1 ];\n\t\t}\n\t}\n\tif ( isBuffer( v ) ) {\n\t\treturn 'Buffer';\n\t}\n\treturn name;\n}\n\n\n// EXPORTS //\n\nexport default constructorName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @module @stdlib/regexp-function-name\n*\n* @example\n* import reFunctionName from '@stdlib/regexp-function-name';\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n*     return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport REGEXP from './regexp.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'REGEXP', REGEXP );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128',\n\t'BooleanArray': 'bool'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 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 <Uint32Array>\n*/\n\n// MODULES //\n\nimport hasUint32ArraySupport from '@stdlib/assert-has-uint32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint32Array = ( typeof Uint32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint32Array\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint32Array( [] );\n* // returns false\n*/\nfunction isUint32Array( value ) {\n\treturn (\n\t\t( hasUint32Array && value instanceof Uint32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* @module @stdlib/constants-uint32-max\n* @type {uinteger32}\n*\n* @example\n* import UINT32_MAX from '@stdlib/constants-uint32-max';\n* // returns 4294967295\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar UINT32_MAX = 4294967295;\n\n\n// EXPORTS //\n\nexport default UINT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint32Array === 'function' ) ? Uint32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint32Array from '@stdlib/assert-is-uint32array';\nimport UINT32_MAX from '@stdlib/constants-uint32-max';\nimport GlobalUint32Array from './uint32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint32Array` support\n*\n* @example\n* var bool = hasUint32ArraySupport();\n* // returns <boolean>\n*/\nfunction hasUint32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT32_MAX+1, UINT32_MAX+2 ];\n\t\tarr = new GlobalUint32Array( arr );\n\t\tbool = (\n\t\t\tisUint32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&            // truncation\n\t\t\tarr[ 2 ] === UINT32_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 &&            // wrap around\n\t\t\tarr[ 4 ] === 1               // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int32\n*\n* @example\n* import ctor from '@stdlib/array-int32';\n*\n* var arr = new ctor( 10 );\n* // returns <Int32Array>\n*/\n\n// MODULES //\n\nimport hasInt32ArraySupport from '@stdlib/assert-has-int32array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt32Array = ( typeof Int32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int32Array\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt32Array( [] );\n* // returns false\n*/\nfunction isInt32Array( value ) {\n\treturn (\n\t\t( hasInt32Array && value instanceof Int32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int32Array === 'function' ) ? Int32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt32Array from '@stdlib/assert-is-int32array';\nimport INT32_MAX from '@stdlib/constants-int32-max';\nimport INT32_MIN from '@stdlib/constants-int32-min';\nimport GlobalInt32Array from './int32array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int32Array` support\n*\n* @example\n* var bool = hasInt32ArraySupport();\n* // returns <boolean>\n*/\nfunction hasInt32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt32Array( [ 1, 3.14, -3.14, INT32_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&      // truncation\n\t\t\tarr[ 2 ] === -3 &&     // truncation\n\t\t\tarr[ 3 ] === INT32_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-min\n* @type {integer32}\n*\n* @example\n* import INT32_MIN from '@stdlib/constants-int32-min';\n* // returns -2147483648\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{31})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -2147483648\n*/\nvar INT32_MIN = -2147483648|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint16\n*\n* @example\n* import ctor from '@stdlib/array-uint16';\n*\n* var arr = new ctor( 10 );\n* // returns <Uint16Array>\n*/\n\n// MODULES //\n\nimport hasUint16ArraySupport from '@stdlib/assert-has-uint16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint16Array = ( typeof Uint16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint16Array\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint16Array( [] );\n* // returns false\n*/\nfunction isUint16Array( value ) {\n\treturn (\n\t\t( hasUint16Array && value instanceof Uint16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint16Array === 'function' ) ? Uint16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint16Array from '@stdlib/assert-is-uint16array';\nimport UINT16_MAX from '@stdlib/constants-uint16-max';\nimport GlobalUint16Array from './uint16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint16Array` support\n*\n* @example\n* var bool = hasUint16ArraySupport();\n* // returns <boolean>\n*/\nfunction hasUint16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT16_MAX+1, UINT16_MAX+2 ];\n\t\tarr = new GlobalUint16Array( arr );\n\t\tbool = (\n\t\t\tisUint16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&            // truncation\n\t\t\tarr[ 2 ] === UINT16_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 &&            // wrap around\n\t\t\tarr[ 4 ] === 1               // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int16\n*\n* @example\n* import ctor from '@stdlib/array-int16';\n*\n* var arr = new ctor( 10 );\n* // returns <Int16Array>\n*/\n\n// MODULES //\n\nimport hasInt16ArraySupport from '@stdlib/assert-has-int16array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt16Array = ( typeof Int16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int16Array\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt16Array( [] );\n* // returns false\n*/\nfunction isInt16Array( value ) {\n\treturn (\n\t\t( hasInt16Array && value instanceof Int16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int16Array === 'function' ) ? Int16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt16Array from '@stdlib/assert-is-int16array';\nimport INT16_MAX from '@stdlib/constants-int16-max';\nimport INT16_MIN from '@stdlib/constants-int16-min';\nimport GlobalInt16Array from './int16array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int16Array` support\n*\n* @example\n* var bool = hasInt16ArraySupport();\n* // returns <boolean>\n*/\nfunction hasInt16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt16Array( [ 1, 3.14, -3.14, INT16_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&      // truncation\n\t\t\tarr[ 2 ] === -3 &&     // truncation\n\t\t\tarr[ 3 ] === INT16_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-min\n* @type {integer32}\n*\n* @example\n* import INT16_MIN from '@stdlib/constants-int16-min';\n* // returns -32768\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{15})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 1000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -32768\n*/\nvar INT16_MIN = -32768|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order 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 <Uint8ClampedArray>\n*/\n\n// MODULES //\n\nimport hasUint8ClampedArraySupport from '@stdlib/assert-has-uint8clampedarray-support'; // eslint-disable-line id-length\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ClampedArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint8ClampedArray = ( typeof Uint8ClampedArray === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8ClampedArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8ClampedArray\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var bool = isUint8ClampedArray( new Uint8ClampedArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8ClampedArray( [] );\n* // returns false\n*/\nfunction isUint8ClampedArray( value ) {\n\treturn (\n\t\t( hasUint8ClampedArray && value instanceof Uint8ClampedArray ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8ClampedArray]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint8ClampedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isUint8ClampedArray from '@stdlib/assert-is-uint8clampedarray';\nimport GlobalUint8ClampedArray from './uint8clampedarray.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8ClampedArray` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8ClampedArray` support\n*\n* @example\n* var bool = hasUint8ClampedArraySupport();\n* // returns <boolean>\n*/\nfunction hasUint8ClampedArraySupport() { // eslint-disable-line id-length\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8ClampedArray !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalUint8ClampedArray( [ -1, 0, 1, 3.14, 4.99, 255, 256 ] );\n\t\tbool = (\n\t\t\tisUint8ClampedArray( arr ) &&\n\t\t\tarr[ 0 ] === 0 &&   // clamped\n\t\t\tarr[ 1 ] === 0 &&\n\t\t\tarr[ 2 ] === 1 &&\n\t\t\tarr[ 3 ] === 3 &&   // round to nearest\n\t\t\tarr[ 4 ] === 5 &&   // round to nearest\n\t\t\tarr[ 5 ] === 255 &&\n\t\t\tarr[ 6 ] === 255    // clamped\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int8\n*\n* @example\n* import ctor from '@stdlib/array-int8';\n*\n* var arr = new ctor( 10 );\n* // returns <Int8Array>\n*/\n\n// MODULES //\n\nimport hasInt8ArraySupport from '@stdlib/assert-has-int8array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt8Array = ( typeof Int8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int8Array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt8Array( [] );\n* // returns false\n*/\nfunction isInt8Array( value ) {\n\treturn (\n\t\t( hasInt8Array && value instanceof Int8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int8Array === 'function' ) ? Int8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInt8Array from '@stdlib/assert-is-int8array';\nimport INT8_MAX from '@stdlib/constants-int8-max';\nimport INT8_MIN from '@stdlib/constants-int8-min';\nimport GlobalInt8Array from './int8array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Int8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int8Array` support\n*\n* @example\n* var bool = hasInt8ArraySupport();\n* // returns <boolean>\n*/\nfunction hasInt8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt8Array( [ 1, 3.14, -3.14, INT8_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&     // truncation\n\t\t\tarr[ 2 ] === -3 &&    // truncation\n\t\t\tarr[ 3 ] === INT8_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-min\n* @type {integer32}\n*\n* @example\n* import INT8_MIN from '@stdlib/constants-int8-min';\n* // returns -128\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* -(2^{7})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -128\n*/\nvar INT8_MIN = -128|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* @module @stdlib/constants-float64-ninf\n* @type {number}\n*\n* @example\n* import FLOAT64_NINF from '@stdlib/constants-float64-ninf';\n* // returns -Infinity\n*/\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point negative infinity has the bit sequence\n*\n* ```binarystring\n* 1 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.NEGATIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_NINF = Number.NEGATIVE_INFINITY;\n\n\n// EXPORTS //\n\nexport default FLOAT64_NINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward negative infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* @example\n* var v = floor( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = floor( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = floor( NaN );\n* // returns NaN\n*/\nvar floor = Math.floor; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default floor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// MAIN //\n\n/**\n* Tests if a finite double-precision floating-point number is an integer.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an integer\n*\n* @example\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( 3.14 );\n* // returns false\n*/\nfunction isInteger( x ) {\n\treturn (floor(x) === x);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport isInt from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a number primitive is an integer value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a number primitive is an integer value\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tvalue < PINF &&\n\t\tvalue > NINF &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having an integer value\n*\n* @example\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having an integer value\n*\n* @example\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an integer\n*\n* @example\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isInteger( -3.14 );\n* // returns false\n*\n* @example\n* var bool = isInteger( null );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a nonnegative integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a nonnegative integer\n*\n* @example\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( null );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an integer.\n*\n* @module @stdlib/assert-is-integer\n*\n* @example\n* import isInteger from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isInteger( -3.14 );\n* // returns false\n*\n* bool = isInteger( null );\n* // returns false\n*\n* @example\n* // Use interface to check for integer primitives...\n* import { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*\n* @example\n* // Use interface to check for integer objects...\n* import { isObject as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a nonnegative integer.\n*\n* @module @stdlib/assert-is-nonnegative-integer\n*\n* @example\n* import isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* bool = isNonNegativeInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a generic array.\n*\n* @module @stdlib/constants-array-max-array-length\n*\n* @example\n* import MAX_ARRAY_LENGTH from '@stdlib/constants-array-max-array-length';\n* // returns 4294967295\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a generic array.\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar MAX_ARRAY_LENGTH = 4294967295>>>0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default MAX_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is an array-like object\n*\n* @example\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( { 'length': 10 } );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\nfunction isArrayLikeObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayLikeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a typed array.\n*\n* @module @stdlib/constants-array-max-typed-array-length\n*\n* @example\n* import MAX_TYPED_ARRAY_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n* // returns 9007199254740991\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a typed array.\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n*/\nvar MAX_TYPED_ARRAY_LENGTH = 9007199254740991;\n\n\n// EXPORTS //\n\nexport default MAX_TYPED_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a collection\n*\n* @example\n* var bool = isCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isCollection( {} );\n* // returns false\n*/\nfunction isCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isCollection;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasArrayBuffer = ( typeof ArrayBuffer === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an ArrayBuffer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an ArrayBuffer\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isArrayBuffer( [] );\n* // returns false\n*/\nfunction isArrayBuffer( value ) {\n\treturn (\n\t\t( hasArrayBuffer && value instanceof ArrayBuffer ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object ArrayBuffer]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an object; e.g., `{}`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an object\n*\n* @example\n* var bool = isObject( {} );\n* // returns true\n*\n* @example\n* var bool = isObject( null );\n* // returns false\n*/\nfunction isObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!isArray( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array of strings.\n*\n* @module @stdlib/assert-is-string-array\n*\n* @example\n* import isStringArray from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', 123 ] );\n* // returns false\n*\n* @example\n* import { primitives as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', new String( 'def' ) ] );\n* // returns false\n*\n* @example\n* import { objects as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ new String( 'abc' ), new String( 'def' ) ] );\n* // returns true\n*\n* bool = isStringArray( [ new String( 'abc' ), 'def' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport isString from '@stdlib/assert-is-string';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isString.isPrimitive );\nvar isObjectArray = arrayfun( isString.isObject );\n\n\n// MAIN //\n\nvar isStringArray = arrayfun( isString );\nsetReadOnly( isStringArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isStringArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isStringArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar RE = /./;\n\n\n// EXPORTS //\n\nexport default RE;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a boolean primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean primitive\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns false\n*/\nfunction isBoolean( value ) {\n\treturn ( typeof value === 'boolean' );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns <Boolean>\n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Boolean.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Boolean from '@stdlib/boolean-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean object\n*\n* @example\n* var bool = isBoolean( true );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Boolean ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Boolean]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a boolean\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a boolean.\n*\n* @module @stdlib/assert-is-boolean\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import isBoolean from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( true ) );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isObject as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( true );\n* // returns false\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof self === 'object' ) ? self : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof window === 'object' ) ? window : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof globalThis === 'object' ) ? globalThis : null; // eslint-disable-line no-undef\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport getGlobal from '@stdlib/utils-global';\n\n\n// MAIN //\n\nvar root = getGlobal();\nvar nodeList = root.document && root.document.childNodes;\n\n\n// EXPORTS //\n\nexport default nodeList;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\nimport getThis from './codegen.js';\nimport Self from './self.js';\nimport Win from './window.js';\nimport GlobalThis from './global_this.js';\n\n\n// MAIN //\n\n/**\n* Returns the global object.\n*\n* ## Notes\n*\n* -   Using code generation is the **most** reliable way to resolve the global object; however, doing so is likely to violate content security policies (CSPs) in, e.g., Chrome Apps and elsewhere.\n*\n* @private\n* @param {boolean} [codegen=false] - boolean indicating whether to use code generation to resolve the global object\n* @throws {TypeError} must provide a boolean\n* @throws {Error} unable to resolve global object\n* @returns {Object} global object\n*\n* @example\n* var g = getGlobal();\n* // returns {...}\n*/\nfunction getGlobal( codegen ) {\n\tif ( arguments.length ) {\n\t\tif ( !isBoolean( codegen ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a boolean. Value: `%s`.', codegen ) );\n\t\t}\n\t\tif ( codegen ) {\n\t\t\treturn getThis();\n\t\t}\n\t\t// Fall through...\n\t}\n\t// Case: 2020 revision of ECMAScript standard\n\tif ( GlobalThis ) {\n\t\treturn GlobalThis;\n\t}\n\t// Case: browsers and web workers\n\tif ( Self ) {\n\t\treturn Self;\n\t}\n\t// Case: browsers\n\tif ( Win ) {\n\t\treturn Win;\n\t}\n\t// Case: unknown\n\tthrow new Error( 'unexpected error. Unable to resolve global object.' );\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the global object using code generation.\n*\n* @private\n* @returns {Object} global object\n*/\nfunction getGlobal() {\n\treturn new Function( 'return this;' )(); // eslint-disable-line no-new-func, stdlib/require-globals\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default typedarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* import typeOf from '@stdlib/utils-type-of';\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nimport usePolyfill from './check.js';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport RE from './fixtures/re.js';\nimport nodeList from './fixtures/nodelist.js';\nimport typedarray from './fixtures/typedarray.js';\n\n\n// MAIN //\n\n/**\n* Checks whether a polyfill is needed when using the `typeof` operator.\n*\n* @private\n* @returns {boolean} boolean indicating whether a polyfill is needed\n*/\nfunction check() {\n\tif (\n\t\t// Chrome 1-12 returns 'function' for regular expression instances (see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof):\n\t\ttypeof RE === 'function' ||\n\n\t\t// Safari 8 returns 'object' for typed array and weak map constructors (underscore #1929):\n\t\ttypeof typedarray === 'object' ||\n\n\t\t// PhantomJS 1.9 returns 'function' for `NodeList` instances (underscore #2236):\n\t\ttypeof nodeList === 'function'\n\t) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport typeOf from '@stdlib/utils-type-of';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a function.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a function\n*\n* @example\n* function beep() {\n*     return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\nfunction isFunction( value ) {\n\t// Note: cannot use `typeof` directly, as various browser engines incorrectly return `'function'` when operating on non-function objects, such as regular expressions and NodeLists.\n\treturn ( typeOf( value ) === 'function' );\n}\n\n\n// EXPORTS //\n\nexport default isFunction;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 128-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex128} 128-bit complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n* // returns <Complex128>\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 <Complex64>\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// 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 <boolean>\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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\n\n\n// MAIN //\n\n/**\n* Iterator symbol.\n*\n* @name IteratorSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* function iterator() {\n*     var it;\n*     var i;\n*\n*     i = -1;\n*\n*     it = {};\n*     it.next = next;\n*     it.return = done;\n*\n*     if ( IteratorSymbol ) {\n*         it[ IteratorSymbol ] = iterator;\n*     }\n*     return it;\n*\n*     function next() {\n*         i += 1;\n*         return {\n*             'value': i,\n*             'done': false\n*         };\n*     }\n*\n*     function done( value ) {\n*         if ( arguments.length === 0 ) {\n*             return {\n*                 'done': true\n*             };\n*         }\n*         return {\n*             'value': value,\n*             'done': true\n*         };\n*     }\n* }\n*\n* var obj = iterator();\n*/\nvar IteratorSymbol = ( hasIteratorSymbolSupport() ) ? Symbol.iterator : null;\n\n\n// EXPORTS //\n\nexport default IteratorSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - accessor\n*\n* @example\n* function getter() {\n*     return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnlyAccessor( obj, prop, getter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 <Complex64Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <ArrayBuffer>\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, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex64> ]\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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<string>)} [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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex128Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <ArrayBuffer>\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, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex128> ]\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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<string>)} [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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <BooleanArray>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new BooleanArray( 2 );\n* // returns <BooleanArray>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new BooleanArray( [ true, false ] );\n* // returns <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <ArrayBuffer>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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<string>)} [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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 M = 5;\n\n\n// MAIN //\n\n/**\n* Multiplies `x` by a scalar `alpha`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array<Function>} x.accessors - array element accessors\n* @param {integer} stride - index increment\n* @param {NonNegativeInteger} offset - starting index\n* @returns {NumericArray} 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 = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gscal( 3, 5.0, arraylike2object( toAccessorArray( x ) ), 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, -20.0, 25.0, -30.0 ]\n*/\nfunction gscal( N, alpha, x, stride, offset ) {\n\tvar xbuf;\n\tvar xget;\n\tvar xset;\n\tvar ix;\n\tvar m;\n\tvar i;\n\n\txbuf = x.data;\n\txget = x.accessors[ 0 ];\n\txset = x.accessors[ 1 ];\n\n\tix = offset;\n\tif ( stride === 0 ) {\n\t\txset( xbuf, ix, xget( xbuf, ix ) * N * alpha );\n\t\treturn x;\n\t}\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( stride === 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\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\t\t\tix += stride;\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\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\t\txset( xbuf, ix+1, xget( xbuf, ix+1 ) * alpha );\n\t\t\txset( xbuf, ix+2, xget( xbuf, ix+2 ) * alpha );\n\t\t\txset( xbuf, ix+3, xget( xbuf, ix+3 ) * alpha );\n\t\t\txset( xbuf, ix+4, xget( xbuf, ix+4 ) * alpha );\n\t\t\tix += M;\n\t\t}\n\t\treturn x;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\tix += stride;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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 = 5;\n\n\n// MAIN //\n\n/**\n* Multiplies a vector by a scalar constant using alternative indexing semantics.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @returns {NumericArray} input array\n*\n* @example\n* var x = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gscal( 3, 5.0, x, 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, -20.0, 25.0, -30.0 ]\n*/\nfunction gscal( N, alpha, x, stride, offset ) {\n\tvar ix;\n\tvar m;\n\tvar o;\n\tvar i;\n\n\tif ( N <= 0 || alpha === 1.0 ) {\n\t\treturn x;\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\taccessors( N, alpha, o, stride, offset );\n\t\treturn x;\n\t}\n\n\tix = offset;\n\tif ( stride === 0 ) {\n\t\tx[ ix ] *= alpha * N;\n\t\treturn x;\n\t}\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( stride === 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 += stride;\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\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 += stride;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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* Multiplies a vector by a scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar constant\n* @param {NumericArray} x - input array\n* @param {PositiveInteger} stride -  stride length\n* @returns {NumericArray} 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* gscal( x.length, 5.0, x, 1 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.0 ]\n*/\nfunction gscal( N, alpha, x, stride ) {\n\treturn ndarray( N, alpha, x, stride, stride2offset( N, stride ) );\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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) 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<number>} 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 <Complex128Array>\n*\n* var data = reinterpret128( out, 0 );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns <Complex128Array>\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns <Float64Array>[ 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// 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 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 object has the following properties:\n*\n*     -   **sh**: dimensions sorted in loop order.\n*     -   **sx**: ndarray strides sorted in loop order.\n*     -   **idx**: dimension indices sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} sh - array dimensions\n* @param {IntegerArray} sx - 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*\n* var o = loopOrder( sh, sx );\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 idx = o.idx;\n* // returns [ 2, 1, 0 ]\n*/\nfunction loopOrder( sh, sx ) {\n\tvar idx;\n\n\t// Initialize a loop interchange index array for generating a loop order permutation:\n\tidx = zeroTo( sh.length );\n\n\t// Sort the array strides in increasing order (of magnitude):\n\tsx = copy( sx );\n\tsort2ins( sx, idx );\n\n\t// Permute the shape based on the sorted array strides:\n\tsh = take( sh, idx );\n\n\treturn {\n\t\t'sh': sh,\n\t\t'sx': sx,\n\t\t'idx': idx\n\t};\n}\n\n\n// EXPORTS //\n\nexport default loopOrder;\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* 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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* Multiply a vector by a scalar constant.\n*\n* @module @stdlib/blas-base-gscal\n*\n* @example\n* import gscal from '@stdlib/blas-base-gscal';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gscal( x.length, 5.0, x, 1 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.0 ]\n*\n* @example\n* import gscal from '@stdlib/blas-base-gscal';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gscal.ndarray( x.length, 5.0, x, 1, 0 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\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 <boolean>\n*/\nfunction detect() {\n\treturn isArguments( arguments );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn ( nativeClass( value ) === '[object Arguments]' );\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is `NaN`.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 7.0 );\n* // returns false\n*/\nfunction isnan( x ) {\n\treturn ( x !== x );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `NaN` number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `NaN` number primitive\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a value of `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a value of `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( null );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is `NaN`.\n*\n* @module @stdlib/assert-is-nan\n*\n* @example\n* import isnan from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns false\n*\n* @example\n* import { isObject as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @private\n* @name isEnumerableProperty\n* @type {Function}\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'hasOwnProperty' );\n* // returns false\n*/\nvar isEnumerableProperty = Object.prototype.propertyIsEnumerable;\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnum from './native.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment has a bug where String indices are not detected as \"enumerable\" properties. Observed in Node v0.10.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment has the bug\n*/\nfunction detect() {\n\treturn !isEnum.call( 'beep', '0' );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isString from '@stdlib/assert-is-string';\nimport { isPrimitive as isnan } from '@stdlib/assert-is-nan';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isEnum from './native.js';\nimport hasStringEnumBug from './has_string_enumerability_bug.js';\n\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nfunction isEnumerableProperty( value, property ) {\n\tvar bool;\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\tbool = isEnum.call( value, property );\n\tif ( !bool && hasStringEnumBug && isString( value ) ) {\n\t\t// Note: we only check for indices, as properties attached to a `String` object are properly detected as enumerable above.\n\t\tproperty = +property;\n\t\treturn (\n\t\t\t!isnan( property ) &&\n\t\t\tisInteger( property ) &&\n\t\t\tproperty >= 0 &&\n\t\t\tproperty < value.length\n\t\t);\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an `arguments` object.\n*\n* @module @stdlib/assert-is-arguments\n*\n* @example\n* import isArguments from '@stdlib/assert-is-arguments';\n*\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* bool = isArguments( [] );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasArgumentsClass from './detect.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isArguments;\nif ( hasArgumentsClass ) {\n\tisArguments = main;\n} else {\n\tisArguments = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport isArray from '@stdlib/assert-is-array';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-uint32-max';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!isArray( value ) &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH &&\n\t\thasOwnProp( value, 'callee' ) &&\n\t\t!isEnumerableProperty( value, 'callee' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from '@stdlib/assert-is-arguments';\nimport builtin from './builtin.js';\n\n\n// VARIABLES //\n\nvar slice = Array.prototype.slice;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tif ( isArguments( value ) ) {\n\t\treturn builtin( slice.call( value ) );\n\t}\n\treturn builtin( value );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport noop from '@stdlib/utils-noop';\n\n\n// MAIN //\n\n// Note: certain environments treat an object's prototype as enumerable, which, as a matter of convention, it shouldn't be...\nvar bool = isEnumerableProperty( noop, 'prototype' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @example\n* noop();\n* // ...does nothing.\n*/\nfunction noop() {\n\t// Empty function...\n}\n\n\n// EXPORTS //\n\nexport default noop;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\n\n\n// VARIABLES //\n\nvar obj = {\n\t'toString': null\n};\n\n\n// MAIN //\n\n// Note: certain environments don't allow enumeration of overwritten properties which are considered non-enumerable...\nvar bool = !isEnumerableProperty( obj, 'toString' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isnan from '@stdlib/assert-is-nan';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @param {ArrayLike} arr - array-like object\n* @param {*} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (if negative, the start index is determined relative to last element)\n* @throws {TypeError} must provide an array-like object\n* @throws {TypeError} third argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 5 );\n* // returns -1\n*\n* @example\n* // Using a `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* @example\n* // `fromIndex` which exceeds `array` length:\n* var arr = [ 1, 2, 3, 4, 2, 5 ];\n* var idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* @example\n* // Negative `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* var idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* @example\n* // Negative `fromIndex` exceeding input `array` length:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* @example\n* // Array-like objects:\n* var str = 'bebop';\n* var idx = indexOf( str, 'o' );\n* // returns 3\n*/\nfunction indexOf( arr, searchElement, fromIndex ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( arr ) && !isString( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', arr ) );\n\t}\n\tlen = arr.length;\n\tif ( len === 0 ) {\n\t\treturn -1;\n\t}\n\tif ( arguments.length === 3 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= 0 ) {\n\t\t\tif ( fromIndex >= len ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ti = fromIndex;\n\t\t} else {\n\t\t\ti = len + fromIndex;\n\t\t\tif ( i < 0 ) {\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\ti = 0;\n\t}\n\t// Check for `NaN`...\n\tif ( isnan( searchElement ) ) {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( isnan( arr[i] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( arr[ i ] === searchElement ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether a value equals the prototype of its constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction isConstructorPrototype( value ) {\n\treturn ( value.constructor && value.constructor.prototype === value );\n}\n\n\n// EXPORTS //\n\nexport default isConstructorPrototype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasArgumentsBug from './has_arguments_bug.js';\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport wrapper from './builtin_wrapper.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @name keys\n* @type {Function}\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nvar keys;\nif ( HAS_BUILTIN ) {\n\tif ( hasArgumentsBug() ) {\n\t\tkeys = wrapper;\n\t} else {\n\t\tkeys = builtin;\n\t}\n} else {\n\tkeys = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar w = ( typeof window === 'undefined' ) ? void 0 : window;\n\n\n// EXPORTS //\n\nexport default w;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport indexOf from '@stdlib/utils-index-of';\nimport typeOf from '@stdlib/utils-type-of';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport EXCLUDED_KEYS from './excluded_keys.json';\nimport win from './window.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Determines whether an environment throws when comparing to the prototype of a value's constructor (e.g., [IE9][1]).\n*\n* [1]: https://stackoverflow.com/questions/7688070/why-is-comparing-the-constructor-property-of-two-windows-unreliable\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment is buggy\n*/\nfunction check() {\n\tvar k;\n\tif ( typeOf( win ) === 'undefined' ) {\n\t\treturn false;\n\t}\n\tfor ( k in win ) { // eslint-disable-line guard-for-in\n\t\ttry {\n\t\t\tif (\n\t\t\t\tindexOf( EXCLUDED_KEYS, k ) === -1 &&\n\t\t\t\thasOwnProp( win, k ) &&\n\t\t\t\twin[ k ] !== null &&\n\t\t\t\ttypeOf( win[ k ] ) === 'object'\n\t\t\t) {\n\t\t\t\tisConstructorPrototype( win[ k ] );\n\t\t\t}\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\nbool = check();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof window !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport keys from './builtin.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests the built-in `Object.keys()` implementation when provided `arguments`.\n*\n* @private\n* @returns {boolean} boolean indicating whether the built-in implementation returns the expected number of keys\n*/\nfunction test() {\n\treturn ( keys( arguments ) || '' ).length !== 2;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether the built-in `Object.keys()` implementation supports providing `arguments` as an input value.\n*\n* ## Notes\n*\n* -   Safari 5.0 does **not** support `arguments` as an input value.\n*\n* @private\n* @returns {boolean} boolean indicating whether a built-in implementation supports `arguments`\n*/\nfunction check() {\n\treturn test( 1, 2 );\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArguments from '@stdlib/assert-is-arguments';\nimport HAS_ENUM_PROTO_BUG from './has_enumerable_prototype_bug.js';\nimport HAS_NON_ENUM_PROPS_BUG from './has_non_enumerable_properties_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype_wrapper.js';\nimport NON_ENUMERABLE from './non_enumerable.json';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tvar skipConstructor;\n\tvar skipPrototype;\n\tvar isFcn;\n\tvar out;\n\tvar k;\n\tvar p;\n\tvar i;\n\n\tout = [];\n\tif ( isArguments( value ) ) {\n\t\t// Account for environments which treat `arguments` differently...\n\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\tout.push( i.toString() );\n\t\t}\n\t\t// Note: yes, we are precluding the `arguments` array-like object from having other enumerable properties; however, this should (1) be very rare and (2) not be encouraged (e.g., doing something like `arguments.a = 'b'`; in certain engines directly manipulating the `arguments` value results in automatic de-optimization).\n\t\treturn out;\n\t}\n\tif ( typeof value === 'string' ) {\n\t\t// Account for environments which do not treat string character indices as \"own\" properties...\n\t\tif ( value.length > 0 && !hasOwnProp( value, '0' ) ) {\n\t\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\t\tout.push( i.toString() );\n\t\t\t}\n\t\t}\n\t} else {\n\t\tisFcn = ( typeof value === 'function' );\n\t\tif ( isFcn === false && !isObjectLike( value ) ) {\n\t\t\treturn out;\n\t\t}\n\t\tskipPrototype = ( HAS_ENUM_PROTO_BUG && isFcn );\n\t}\n\tfor ( k in value ) {\n\t\tif ( !( skipPrototype && k === 'prototype' ) && hasOwnProp( value, k ) ) {\n\t\t\tout.push( String( k ) );\n\t\t}\n\t}\n\tif ( HAS_NON_ENUM_PROPS_BUG ) {\n\t\tskipConstructor = isConstructorPrototype( value );\n\t\tfor ( i = 0; i < NON_ENUMERABLE.length; i++ ) {\n\t\t\tp = NON_ENUMERABLE[ i ];\n\t\t\tif ( !( skipConstructor && p === 'constructor' ) && hasOwnProp( value, p ) ) {\n\t\t\t\tout.push( String( p ) );\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasAutomationEqualityBug from './has_automation_equality_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport HAS_WINDOW from './has_window.js';\n\n\n// MAIN //\n\n/**\n* Wraps the test for constructor prototype equality to accommodate buggy environments (e.g., environments which throw when testing equality).\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction wrapper( value ) {\n\tif ( HAS_WINDOW === false && !hasAutomationEqualityBug ) {\n\t\treturn isConstructorPrototype( value );\n\t}\n\ttry {\n\t\treturn isConstructorPrototype( value );\n\t} catch ( error ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrapper;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFunction from '@stdlib/assert-is-function';\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar getProto;\nif ( isFunction( Object.getPrototypeOf ) ) {\n\tgetProto = builtin;\n} else {\n\tgetProto = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object.\n*\n* @name Object\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {Object} object\n*\n* @example\n* var o = new Object( null );\n* // returns {}\n*\n* @example\n* var o = new Object( 5.0 );\n* // returns <Number>\n*\n* @example\n* var o = new Object( 'beep' );\n* // returns <String>\n*\n* @example\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\nvar Obj = Object; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar getProto = Object.getPrototypeOf;\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport Object from '@stdlib/object-ctor';\nimport getProto from './proto.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {(Object|null)} prototype\n*/\nfunction getPrototypeOf( obj ) {\n\tvar proto = getProto( obj );\n\tif ( proto || proto === null ) {\n\t\treturn proto;\n\t}\n\tif ( nativeClass( obj.constructor ) === '[object Function]' ) {\n\t\t// May break if the constructor has been tampered with...\n\t\treturn obj.constructor.prototype;\n\t}\n\tif ( obj instanceof Object ) {\n\t\treturn Object.prototype;\n\t}\n\t// Return `null` for objects created via `Object.create( null )`. Also return `null` for cross-realm objects on browsers that lack `__proto__` support, such as IE < 11.\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the value of the `__proto__` property.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {*} value of `__proto__` property\n*/\nfunction getProto( obj ) {\n\t// eslint-disable-next-line no-proto\n\treturn obj.__proto__;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar objectPrototype = Object.prototype;\n\n\n// FUNCTIONS //\n\n/**\n* Tests that an object only has own properties.\n*\n* @private\n* @param {Object} obj - value to test\n* @returns {boolean} boolean indicating if an object only has own properties\n*/\nfunction ownProps( obj ) {\n\tvar key;\n\n\t// NOTE: possibility of perf boost if key enumeration order is known (see http://stackoverflow.com/questions/18531624/isplainobject-thing).\n\tfor ( key in obj ) {\n\t\tif ( !hasOwnProp( obj, key ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if a value is a plain object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a plain object\n*\n* @example\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* @example\n* var bool = isPlainObject( null );\n* // returns false\n*/\nfunction isPlainObject( value ) {\n\tvar proto;\n\n\t// Screen for obvious non-objects...\n\tif ( !isObject( value ) ) {\n\t\treturn false;\n\t}\n\t// Objects with no prototype (e.g., `Object.create( null )`) are plain...\n\tproto = getPrototypeOf( value );\n\tif ( !proto ) {\n\t\treturn true;\n\t}\n\t// Objects having a prototype are plain if and only if they are constructed with a global `Object` function and the prototype points to the prototype of a plain object...\n\treturn (\n\t\t// Cannot have own `constructor` property:\n\t\t!hasOwnProp( value, 'constructor' ) &&\n\n\t\t// Prototype `constructor` property must be a function (see also https://bugs.jquery.com/ticket/9897 and http://stackoverflow.com/questions/18531624/isplainobject-thing):\n\t\thasOwnProp( proto, 'constructor' ) &&\n\t\tisFunction( proto.constructor ) &&\n\t\tnativeClass( proto.constructor ) === '[object Function]' &&\n\n\t\t// Test for object-specific method:\n\t\thasOwnProp( proto, 'isPrototypeOf' ) &&\n\t\tisFunction( proto.isPrototypeOf ) &&\n\n\t\t(\n\t\t\t// Test if the prototype matches the global `Object` prototype (same realm):\n\t\t\tproto === objectPrototype ||\n\n\t\t\t// Test that all properties are own properties (cross-realm; *most* likely a plain object):\n\t\t\townProps( value )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPlainObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Object from '@stdlib/object-ctor';\nimport getProto from './detect.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @param {*} value - input value\n* @returns {(Object|null)} prototype\n*\n* @example\n* var proto = getPrototypeOf( {} );\n* // returns {}\n*/\nfunction getPrototypeOf( value ) {\n\tif (\n\t\tvalue === null ||\n\t\tvalue === void 0\n\t) {\n\t\treturn null;\n\t}\n\t// In order to ensure consistent ES5/ES6 behavior, cast input value to an object (strings, numbers, booleans); ES5 `Object.getPrototypeOf` throws when provided primitives and ES6 `Object.getPrototypeOf` casts:\n\tvalue = Object( value );\n\n\treturn getProto( value );\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport objectInverse from '@stdlib/object-inverse';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar hash = objectInverse( dtypeEnums(), {\n\t'duplicates': false\n});\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with an ndarray data type enumeration constant.\n*\n* @param {integer} dtype - data type enumeration constant\n* @returns {(string|null)} data type string or null\n*\n* @example\n* import str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n*\n* var v = str2enum( 'float64' );\n* // returns <number>\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 <Function>\n*\n* var nbytes = bytesPerElement( Struct );\n* // returns 8\n*/\nfunction bytesPerElement( dtype ) {\n\tvar v;\n\tif ( isString( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ dtype ] || null;\n\t}\n\tif ( isNumber( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ enum2str( dtype ) ] || null;\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.byteLength;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default bytesPerElement;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar defaults = {\n\t// Define a default block size (in bytes):\n\t'BLOCK_SIZE_IN_BYTES': 64|0, // 64b is a common cache line size. How applicable the common cache line size is here is debatable, given that, depending on the associated stride(s), the innermost loop may not iterate over adjacent elements. The primary goal is to have a block size in which all data within a block can always fit in (L1) cache, regardless of cache size (i.e., cache-oblivious). For reference, a common L1 cache size is 32kB per core. For best performance, block sizes should be tuned based on system hardware; however, such tuning is not readily available to us here. Without obvious better alternatives, 64b has some theoretical (and practical) underpinning, and it should be good enough for most inputs, especially for ndarrays with near contiguity.\n\n\t// Define a default block size (in elements):\n\t'BLOCK_SIZE_IN_ELEMENTS': 8|0 // 64 bytes / 8 bytes per element (i.e., default element size is same as a double)\n};\n\n\n// EXPORTS //\n\nexport default defaults;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport blockSize from '@stdlib/ndarray-base-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {*} dtypeX - array data type\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = nullaryBlockSize( 'float64' );\n* // returns <number>\n*/\nfunction nullaryBlockSize( dtypeX ) {\n\treturn blockSize( [ dtypeX ] );\n}\n\n\n// EXPORTS //\n\nexport default nullaryBlockSize;\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 <number>\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* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar get;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 4 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the output ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexArray from '@stdlib/array-base-assert-is-complex-typed-array';\nimport isBooleanArray from '@stdlib/array-base-assert-is-booleanarray';\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 reinterpretComplex from '@stdlib/strided-base-reinterpret-complex';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport gscal from '@stdlib/blas-base-gscal';\nimport blockedaccessorsome2d from './2d_blocked_accessors.js';\nimport blockedaccessorsome3d from './3d_blocked_accessors.js';\nimport blockedaccessorsome4d from './4d_blocked_accessors.js';\nimport blockedaccessorsome5d from './5d_blocked_accessors.js';\nimport blockedaccessorsome6d from './6d_blocked_accessors.js';\nimport blockedaccessorsome7d from './7d_blocked_accessors.js';\nimport blockedaccessorsome8d from './8d_blocked_accessors.js';\nimport blockedaccessorsome9d from './9d_blocked_accessors.js';\nimport blockedaccessorsome10d from './10d_blocked_accessors.js';\nimport blockedcomplexsome2d from './2d_blocked_complex.js';\nimport blockedcomplexsome3d from './3d_blocked_complex.js';\nimport blockedcomplexsome4d from './4d_blocked_complex.js';\nimport blockedcomplexsome5d from './5d_blocked_complex.js';\nimport blockedcomplexsome6d from './6d_blocked_complex.js';\nimport blockedcomplexsome7d from './7d_blocked_complex.js';\nimport blockedcomplexsome8d from './8d_blocked_complex.js';\nimport blockedcomplexsome9d from './9d_blocked_complex.js';\nimport blockedcomplexsome10d from './10d_blocked_complex.js';\nimport blockedsome2d from './2d_blocked.js';\nimport blockedsome3d from './3d_blocked.js';\nimport blockedsome4d from './4d_blocked.js';\nimport blockedsome5d from './5d_blocked.js';\nimport blockedsome6d from './6d_blocked.js';\nimport blockedsome7d from './7d_blocked.js';\nimport blockedsome8d from './8d_blocked.js';\nimport blockedsome9d from './9d_blocked.js';\nimport blockedsome10d from './10d_blocked.js';\nimport accessorsome0d from './0d_accessors.js';\nimport accessorsome1d from './1d_accessors.js';\nimport accessorsome2d from './2d_accessors.js';\nimport accessorsome3d from './3d_accessors.js';\nimport accessorsome4d from './4d_accessors.js';\nimport accessorsome5d from './5d_accessors.js';\nimport accessorsome6d from './6d_accessors.js';\nimport accessorsome7d from './7d_accessors.js';\nimport accessorsome8d from './8d_accessors.js';\nimport accessorsome9d from './9d_accessors.js';\nimport accessorsome10d from './10d_accessors.js';\nimport accessorsomend from './nd_accessors.js';\nimport complexsome0d from './0d_complex.js';\nimport complexsome1d from './1d_complex.js';\nimport complexsome2d from './2d_complex.js';\nimport complexsome3d from './3d_complex.js';\nimport complexsome4d from './4d_complex.js';\nimport complexsome5d from './5d_complex.js';\nimport complexsome6d from './6d_complex.js';\nimport complexsome7d from './7d_complex.js';\nimport complexsome8d from './8d_complex.js';\nimport complexsome9d from './9d_complex.js';\nimport complexsome10d from './10d_complex.js';\nimport complexsomend from './nd_complex.js';\nimport some0d from './0d.js';\nimport some1d from './1d.js';\nimport some2d from './2d.js';\nimport some3d from './3d.js';\nimport some4d from './4d.js';\nimport some5d from './5d.js';\nimport some6d from './6d.js';\nimport some7d from './7d.js';\nimport some8d from './8d.js';\nimport some9d from './9d.js';\nimport some10d from './10d.js';\nimport somend from './nd.js';\n\n\n// VARIABLES //\n\nvar SOME = [\n\tsome0d,\n\tsome1d,\n\tsome2d,\n\tsome3d,\n\tsome4d,\n\tsome5d,\n\tsome6d,\n\tsome7d,\n\tsome8d,\n\tsome9d,\n\tsome10d,\n\tsomend\n];\nvar ACCESSOR_SOME = [\n\taccessorsome0d,\n\taccessorsome1d,\n\taccessorsome2d,\n\taccessorsome3d,\n\taccessorsome4d,\n\taccessorsome5d,\n\taccessorsome6d,\n\taccessorsome7d,\n\taccessorsome8d,\n\taccessorsome9d,\n\taccessorsome10d,\n\taccessorsomend\n];\nvar COMPLEX_SOME = [\n\tcomplexsome0d,\n\tcomplexsome1d,\n\tcomplexsome2d,\n\tcomplexsome3d,\n\tcomplexsome4d,\n\tcomplexsome5d,\n\tcomplexsome6d,\n\tcomplexsome7d,\n\tcomplexsome8d,\n\tcomplexsome9d,\n\tcomplexsome10d,\n\tcomplexsomend\n];\nvar BLOCKED_SOME = [\n\tblockedsome2d, // 0\n\tblockedsome3d,\n\tblockedsome4d,\n\tblockedsome5d,\n\tblockedsome6d,\n\tblockedsome7d,\n\tblockedsome8d,\n\tblockedsome9d,\n\tblockedsome10d // 8\n];\nvar BLOCKED_ACCESSOR_SOME = [\n\tblockedaccessorsome2d, // 0\n\tblockedaccessorsome3d,\n\tblockedaccessorsome4d,\n\tblockedaccessorsome5d,\n\tblockedaccessorsome6d,\n\tblockedaccessorsome7d,\n\tblockedaccessorsome8d,\n\tblockedaccessorsome9d,\n\tblockedaccessorsome10d // 8\n];\nvar BLOCKED_COMPLEX_SOME = [\n\tblockedcomplexsome2d, // 0\n\tblockedcomplexsome3d,\n\tblockedcomplexsome4d,\n\tblockedcomplexsome5d,\n\tblockedcomplexsome6d,\n\tblockedcomplexsome7d,\n\tblockedcomplexsome8d,\n\tblockedcomplexsome9d,\n\tblockedcomplexsome10d // 8\n];\nvar MAX_DIMS = SOME.length - 1;\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* ## Notes\n*\n* -   A 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<Object>} arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must satisfy the predicate function\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import scalar2ndarray from '@stdlib/ndarray-from-scalar';\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Define the success criterion:\n* var n = scalar2ndarray( 3, {\n*     'dtype': 'generic'\n* });\n*\n* // Test elements:\n* var out = some( [ x, n ] );\n* // returns true\n*/\nfunction some( arrays ) {\n\tvar isCmplx;\n\tvar ndims;\n\tvar xmmv;\n\tvar shx;\n\tvar iox;\n\tvar len;\n\tvar sx;\n\tvar ox;\n\tvar ns;\n\tvar N;\n\tvar x;\n\tvar n;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarray and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\tn = ndarray2object( arrays[ 1 ] );\n\n\tshx = x.shape;\n\tndims = shx.length;\n\n\t// Resolve the success criterion:\n\tN = n.accessors[ 0 ]( n.data, n.offset );\n\n\t// Check for known array types which can be reinterpreted for better iteration performance...\n\tif ( isBooleanArray( x.data ) ) {\n\t\tx.data = reinterpretBoolean( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t} else if ( isComplexArray( x.data ) ) {\n\t\tx.data = reinterpretComplex( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t\tx.strides = gscal( ndims, 2, x.strides, 1 );\n\t\tx.offset *= 2;\n\t\tisCmplx = true;\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\t// Compute the number of elements and the number of singleton 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\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 an empty ndarray...\n\tif ( len === 0 ) {\n\t\treturn false;\n\t}\n\t// Determine whether the ndarray is one-dimensional and thus readily translates to a one-dimensional strided array...\n\tif ( ndims === 1 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\tsx = x.strides;\n\n\t// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat an ndarray as being equivalent to a one-dimensional strided array...\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\tx.strides = [ sx[i] ];\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t}\n\t\treturn SOME[ 1 ]( x, N );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tif ( iox !== 0 ) {\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array view:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarray as a linear one-dimensional strided array...\n\t\tif ( len === ( xmmv[1]-xmmv[0]+1 ) || ( isCmplx && len*2 === ( xmmv[1]-xmmv[0]+2 ) ) ) { // eslint-disable-line max-len\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\tx.shape = [ len ];\n\t\t\tx.strides = [ ( isCmplx ) ? iox*2 : iox ];\n\t\t\tx.offset = ox;\n\t\t\tif ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ 1 ]( x, N );\n\t\t}\n\t\t// The 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 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 ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ ndims ]( x, N );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with a non-contiguous n-dimensional array or a high dimensional n-dimensional array, 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 ( x.accessorProtocol ) {\n\t\t\treturn BLOCKED_ACCESSOR_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn BLOCKED_COMPLEX_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\treturn BLOCKED_SOME[ ndims-2 ]( x, N );\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 ( x.accessorProtocol ) {\n\t\treturn accessorsomend( x, N );\n\t}\n\tif ( isCmplx ) {\n\t\treturn complexsomend( x, N );\n\t}\n\treturn somend( x, N );\n}\n\n\n// EXPORTS //\n\nexport default some;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.data[ x.offset ] ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.accessors[ 0 ]( x.data, x.offset ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && ( x.data[ x.offset ] || x.data[ x.offset+1 ] ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray is truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\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 <Uint8Array>\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// 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 <Float64Array>\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 <Float32Array>\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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"],"names":["C64_BYTES_PER_ELEMENT","C128_BYTES_PER_ELEMENT","BYTES_PER_ELEMENT","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","minmaxViewBufferIndex","shape","strides","offset","ndims","min","max","s","setReadOnly","TYPE","isAccessorArray","GETTERS","complex128","arr","idx","complex64","default","getter","dtype","SETTERS","setter","float64","float32","int32","int16","int8","uint32","uint16","uint8","uint8c","generic","numel","copy","x","len","isString","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","valueOf","test","isPrimitive","isObject","isColumnMajorString","shape2strides","order","isColumnMajor","columnmajor","rowmajor","ROW_MAJOR","ord","sh","st","copyIndexed","main$c","Number","o","strides2offset","strides2order","column","row","s1","s2","COLUMN_MAJOR","ndarraylike2object","xbuf","bool","dt","data","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","accessorProtocol","accessors","accessorGetter","accessorSetter","isComplex128Array","constructor","name","isComplex64Array","ctor","hasFloat64Array","Float64Array","GlobalFloat64Array","NaN","hasFloat64ArraySupport","Float64Array$1","reinterpret","buffer","byteOffset","hasFloat32Array","Float32Array","FLOAT64_PINF","POSITIVE_INFINITY","GlobalFloat32Array","PINF","hasFloat32ArraySupport","Float32Array$1","hasUint8Array","Uint8Array","GlobalUint8Array","UINT8_MAX","hasUint8ArraySupport","Uint8Array$1","main$8","arrayfcn","predicate","isObjectLike","isBuffer","_isBuffer","reFunctionName","arrayfun","RE_FUNCTION_NAME","constructorName","REGEXP","ctor2dtypes","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasUint32Array","UINT32_MAX","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","GlobalInt32Array","INT32_MAX","hasInt32ArraySupport","Int32Array$1","hasUint16Array","GlobalUint16Array","UINT16_MAX","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","GlobalInt16Array","INT16_MAX","hasInt16ArraySupport","Int16Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","GlobalInt8Array","INT8_MAX","hasInt8ArraySupport","Int8Array$1","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","NINF","isInt","isNonNegativeInteger","MAX_ARRAY_LENGTH","isArrayLikeObject","MAX_LENGTH","MAX_TYPED_ARRAY_LENGTH","isCollection","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isPrimitiveArray","isObjectArray","isStringArray","isBoolean","Bool","Boolean","self","window","globalThis","root","codegen","Function","GlobalThis","Self","Win","getGlobal","nodeList","document","childNodes","typedarray","ctorName","type","isFunction","typeOf","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","hasIteratorSymbolSupport","iterator","IteratorSymbol","setNonEnumerableReadOnlyAccessor","z","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","byteLength","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","searchElement","fromIndex","separator","sep","join","keys","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","opts","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","val","a","b","CTORS","DTYPES","NTYPES","arraylike2object","ctor2dtype","M","gscal","alpha","stride","ix","m","xget","xset","ndarray","stride2offset","zeroTo","complex","loopOrder","sx","y","avx","iy","jx","jy","vx","vy","ux","sort2ins","indices","take","isPositiveInteger","indexed","isArguments","bool$6","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","isArguments$1","isConstructorPrototype","w","hasAutomationEqualityBug","k","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","allowDupes","duplicates","objectKeys","objectInverse","int64","uint64","float16","complex32","binary","notype","userdefined_type","bytesPerElement","enum2str","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","nullaryBlockSize","dtypeX","dtypes","nb","blockSize","vind2bind","mode","ind","MODE","somend","count","ordx","ox","SOME","dx0","S0","i0","dx1","S1","i1","dx2","S2","i2","dx3","S3","i3","dx4","S4","i4","dx5","S5","i5","dx6","S6","i6","dx7","S7","i7","dx8","S8","i8","dx9","S9","i9","ACCESSOR_SOME","accessorsomend","COMPLEX_SOME","complexsomend","BLOCKED_SOME","bsize","ox1","s0","j0","j1","ox2","j2","ox3","s3","j3","ox4","s4","j4","ox5","s5","j5","ox6","s6","j6","ox7","s7","j7","ox8","s8","j8","ox9","s9","j9","BLOCKED_ACCESSOR_SOME","BLOCKED_COMPLEX_SOME","MAX_DIMS","arrays","isCmplx","xmmv","shx","iox","ns","d","ndarray2object","reinterpretBoolean","reinterpretComplex","cnt","iterationOrder"],"mappings":";yCAsBA,IAAIA,EAAwB,EACxBC,EAAyB,GCDzBC,EAAoB,ECApBC,EAA0C,mBAA1BC,OAAOC,eAAkCD,OAAOC,eAAiB,KCiCjFA,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,GC3EyB,iBD0EzBkB,EAAQuC,EAAQzD,IAEfC,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,CCUA,SAASmH,EAAuBC,EAAOC,EAASC,GAC/C,IAAIC,EACAC,EACAC,EACAC,EACAvH,EAKJ,IAHAoH,EAAQH,EAAMzG,OACd6G,EAAMF,EACNG,EAAMH,EACAnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAC7B,GAAoB,IAAfiH,EAAOjH,GACX,MAAO,CAAEmH,EAAQA,IAElBI,EAAIL,EAASlH,IACJ,EACRsH,GAAOC,GAAMN,EAAMjH,GAAG,GACXuH,EAAI,IACfF,GAAOE,GAAMN,EAAMjH,GAAG,GAEvB,CACD,MAAO,CAAEqH,EAAKC,EACf,CCTAE,EAAA/H,EAAA,UCIA,SAAgCwH,EAAOC,EAASC,EAAQlH,GACvD,IAAImH,EACAC,EACAC,EACAC,EACAvH,EAKJ,IAHAoH,EAAQH,EAAMzG,OACd6G,EAAMF,EACNG,EAAMH,EACAnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAC7B,GAAoB,IAAfiH,EAAOjH,GAGX,OAFAC,EAAK,GAAMkH,EACXlH,EAAK,GAAMkH,EACJlH,GAERsH,EAAIL,EAASlH,IACJ,EACRsH,GAAOC,GAAMN,EAAMjH,GAAG,GACXuH,EAAI,IACfF,GAAOE,GAAMN,EAAMjH,GAAG,GAEvB,CAGD,OAFAC,EAAK,GAAMoH,EACXpH,EAAK,GAAMqH,EACJrH,CACR,ICnFA,IAAIwH,EAAO,WAqBX,SAASC,EAAiB7H,GACzB,cAAgBA,EAAM4G,MAAQgB,UAAe5H,EAAM6G,MAAQe,CAC5D,CCvBA,IAAIE,EAAU,CACbC,WAwBD,SAAwBC,EAAKC,GAC5B,OAAOD,EAAIpB,IAAKqB,EACjB,EAzBCC,UA2CD,SAAuBF,EAAKC,GAC3B,OAAOD,EAAIpB,IAAKqB,EACjB,EA5CCE,QAuED,SAAuBH,EAAKC,GAC3B,OAAOD,EAAIpB,IAAKqB,EACjB,GAqBA,SAASG,EAAQC,GAChB,IAAIvF,EAAIgF,EAASO,GACjB,MAAkB,mBAANvF,EACJA,EAEDgF,EAAQK,OAChB,CCvGA,IAAIG,EAAU,CACbP,WA0BD,SAAwBC,EAAKC,EAAKjI,GACjCgI,EAAInB,IAAK7G,EAAOiI,EACjB,EA3BCC,UA+CD,SAAuBF,EAAKC,EAAKjI,GAChCgI,EAAInB,IAAK7G,EAAOiI,EACjB,EAhDCE,QA6ED,SAAuBH,EAAKC,EAAKjI,GAChCgI,EAAInB,IAAK7G,EAAOiI,EACjB,GAwBA,SAASM,EAAQF,GAChB,IAAIvF,EAAIwF,EAASD,GACjB,MAAkB,mBAANvF,EACJA,EAEDwF,EAAQH,OAChB,CChHA,IAAIL,EAAU,CACbU,QAgCD,SAAqBR,EAAKC,GACzB,OAAOD,EAAKC,EACb,EAjCCQ,QAmDD,SAAqBT,EAAKC,GACzB,OAAOD,EAAKC,EACb,EApDCS,MAsED,SAAmBV,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAvECU,MAyFD,SAAmBX,EAAKC,GACvB,OAAOD,EAAKC,EACb,EA1FCW,KA4GD,SAAkBZ,EAAKC,GACtB,OAAOD,EAAKC,EACb,EA7GCY,OA+HD,SAAoBb,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAhICa,OAkJD,SAAoBd,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAnJCc,MAqKD,SAAmBf,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAtKCe,OAwLD,SAAoBhB,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAzLCgB,QAyMD,SAAqBjB,EAAKC,GACzB,OAAOD,EAAKC,EACb,EA1MCE,QA0ND,SAAuBH,EAAKC,GAC3B,OAAOD,EAAKC,EACb,GAoBA,SAASG,EAAQC,GAChB,IAAIvF,EAAIgF,EAASO,GACjB,MAAkB,mBAANvF,EACJA,EAEDgF,EAAQK,OAChB,CCjQA,IAAIG,EAAU,CACbE,QAkCD,SAAqBR,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EAnCCyI,QAuDD,SAAqBT,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EAxDC0I,MA4ED,SAAmBV,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EA7EC2I,MAiGD,SAAmBX,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EAlGC4I,KAsHD,SAAkBZ,EAAKC,EAAKjI,GAC3BgI,EAAKC,GAAQjI,CACd,EAvHC6I,OA2ID,SAAoBb,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EA5IC8I,OAgKD,SAAoBd,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EAjKC+I,MAqLD,SAAmBf,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EAtLCgJ,OA0MD,SAAoBhB,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EA3MCiJ,QA6ND,SAAqBjB,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EA9NCmI,QAgPD,SAAuBH,EAAKC,EAAKjI,GAChCgI,EAAKC,GAAQjI,CACd,GAsBA,SAASuI,EAAQF,GAChB,IAAIvF,EAAIwF,EAASD,GACjB,MAAkB,mBAANvF,EACJA,EAEDwF,EAAQH,OAChB,CC/QA,SAASe,EAAO9B,GACf,IAAIG,EACArH,EACAC,EAGJ,GAAe,KADfoH,EAAQH,EAAMzG,QAEb,OAAO,EAGR,IADAT,EAAI,EACEC,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBD,GAAKkH,EAAOjH,GAEb,OAAOD,CACR,CCdA,SAASiJ,GAAMC,GACd,IAAIhJ,EACAiJ,EACAlJ,EAIJ,IAFAkJ,EAAMD,EAAEzI,OACRP,EAAM,GACAD,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrBC,EAAI8E,KAAMkE,EAAGjJ,IAEd,OAAOC,CACR,CCTA,SAASkJ,GAAUtJ,GAClB,MAA0B,iBAAVA,CACjB,CCTA,IAAIuJ,GCMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,KACR,OAASF,IAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAIjE,GAAQ5F,OAAOmB,UAAUY,SCAzB+H,GAAM9J,OAAOmB,UAAU4I,eA4B3B,SAASC,GAAY7J,EAAO8J,GAC3B,OACC9J,SAKM2J,GAAI1H,KAAMjC,EAAO8J,EACzB,CCpCA,IAAIC,GAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,GAA+B,mBAAXR,GAA0BA,GAAOE,YAAc,GCiCvEO,GATKC,KCDL,SAAsBC,GACrB,IAAIC,EACAC,EACAjK,EAEJ,GAAK+J,QACJ,OAAO1E,GAAMxD,KAAMkI,GAEpBE,EAAMF,EAAGT,IACTU,EAAQP,GAAYM,EAAGT,IAGvB,IACCS,EAAGT,SAAgB,CACnB,CAAC,MAAQxD,GACT,OAAOT,GAAMxD,KAAMkI,EACnB,CAQD,OAPA/J,EAAMqF,GAAMxD,KAAMkI,GAEbC,EACJD,EAAGT,IAAgBW,SAEZF,EAAGT,IAEJtJ,CACR,EC3BA,SAAsB+J,GACrB,OAAO1E,GAAMxD,KAAMkI,EACpB,EC7BIG,GAAUvJ,OAAOC,UAAUsJ,QCQ3Bf,GAAMW,KAmBV,SAASZ,GAAUtJ,GAClB,MAAsB,iBAAVA,IACNA,aAAiBe,SAGjBwI,GCnBP,SAAevJ,GACd,IAEC,OADAsK,GAAQrI,KAAMjC,IACP,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUqE,CAAMvK,GAEoB,oBAAzBiK,GAAajK,IAGxB,CEjBA,SAASsJ,GAAUtJ,GAClB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCNA,SAAS0K,GAAqBP,GAC7B,MAAe,iBAANA,CACV,CCmDA,SAASQ,GAAevD,EAAOwD,GAC9B,OAAKC,GAAeD,GAhCrB,SAAsBxD,GACrB,IAAIhH,EACAsH,EACAvH,EAIJ,IAFAC,EAAM,GACNsH,EAAI,EACEvH,EAAI,EAAGA,EAAIiH,EAAMzG,OAAQR,IAC9BC,EAAI8E,KAAMwC,GACVA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CAqBS0K,CAAa1D,GA3DtB,SAAmBA,GAClB,IAAIG,EACAnH,EACAsH,EACAvH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACdP,EAAM,GACAD,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBC,EAAI8E,KAAM,GAGX,IADAwC,EAAI,EACEvH,EAAIoH,EAAM,EAAGpH,GAAK,EAAGA,IAC1BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CA4CQ2K,CAAU3D,EAClB,CC9BAO,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICvBA9C,EAAA/H,GAAA,UCgDA,SAAwBwH,EAAOwD,EAAOxK,GACrC,OAAKyK,GAAeD,GApCrB,SAAsBxD,EAAOhH,GAC5B,IAAIsH,EACAvH,EAGJ,IADAuH,EAAI,EACEvH,EAAI,EAAGA,EAAIiH,EAAMzG,OAAQR,IAC9BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CA2BS0K,CAAa1D,EAAOhH,GA3D7B,SAAmBgH,EAAOhH,GACzB,IACIsH,EACAvH,EAIJ,IADAuH,EAAI,EACEvH,EAFEiH,EAAMzG,OAEE,EAAGR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CAiDQ2K,CAAU3D,EAAOhH,EACzB,ICpEA,IAAI4K,GAAY,YAkBhB,SAAS3D,GAAS+B,EAAGD,GACpB,IAAI8B,EACAC,EACAC,EAGJ,MAAmB,iBADnBA,EAAK/B,EAAE/B,UAC+B,OAAP8D,EAEX,KADnBD,EAAK9B,EAAEhC,OACCzG,OACA,CAAE,IAGJ2I,GADN2B,EAAM7B,EAAEwB,SAEPK,EAAMD,IAEAL,GAAeO,EAAID,IAEtB9B,EACGiC,GAAaD,GAEdA,CACR,CC9BA,SAASpL,GAAUC,GAClB,MAA0B,iBAAVA,CACjB,CClBA,IAAAqL,GAAeC,OCMX1J,GAAW0J,GAAOtK,UAAUY,SCE5B2H,GAAMW,KAmBV,SAASnK,GAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBsL,KAGjB/B,GCpBP,SAAevJ,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDcUqE,CAAMvK,GAEoB,oBAAzBiK,GAAajK,IAGxB,CEVA,SAASD,GAAUC,GAClB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCZA,SAASsH,GAAQ8B,GAChB,IAAI+B,EACAD,EACAK,EAGJ,OAAKxL,GADLwL,EAAInC,EAAE9B,QAEEiE,EAGW,KADnBL,EAAK9B,EAAEhC,OACCzG,QAIW,iBADnBwK,EAAK/B,EAAE/B,UAC+B,OAAP8D,EAHvB,ECfT,SAAyB/D,EAAOC,GAC/B,IAAIC,EACAC,EACApH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACd2G,EAAS,EACHnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAClBkH,EAASlH,GAAM,IAEnBmH,GAAUD,EAASlH,IAAQiH,EAAOjH,GAAI,IAGxC,OAAOmH,CACR,CDOQkE,CAAgBN,EAAIC,EAC5B,CEVA,SAAShJ,GAAKiH,GACb,OAAOhH,KAAKD,IAAKiH,EAClB,CCJA,SAASqC,GAAepE,GACvB,IAAIqE,EACAnE,EACAoE,EACAC,EACAC,EACA1L,EAGJ,GAAe,KADfoH,EAAQF,EAAQ1G,QAEf,OAAO,EAMR,IAJA+K,GAAS,EACTC,GAAM,EAENC,EAAKzJ,GAAKkF,EAAS,IACblH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAO7B,GANA0L,EAAK1J,GAAKkF,EAASlH,IACduL,GAAUG,EAAKD,EACnBF,GAAS,EACEC,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOD,EAGX,OAAO,EAFPE,EAAKC,CAIN,CACD,OAAKF,GAAOD,EACJ,EAEHC,EACG,EAED,CACR,CCVAhE,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC7CA,IAAIO,GAAY,YACZc,GAAe,eAqBnB,SAASlB,GAAOxB,GACf,IAAI+B,EACAI,EAGJ,OAAKjC,GADLiC,EAAInC,EAAEwB,OAEEW,EAIW,iBADnBJ,EAAK/B,EAAE/B,UAC+B,OAAP8D,GAIpB,KADXI,EAAIE,GAAeN,KACG,IAANI,EAHRP,GAMG,IAANO,EACGO,GAGgB,IAAnB1C,EAAEhC,MAAMzG,OACLqK,GAGD,IACR,CCDA,SAASe,GAAoB3C,GAC5B,IAAI4C,EACAC,EACAf,EACAgB,EAQJ,OANAF,EC3CD,SAAe5C,GACd,OAAOA,EAAE+C,IACV,CDyCQC,CAAShD,GAChB8B,EE1CD,SAAgB9B,EAAGD,GAClB,IAAI+B,EAAK9B,EAAEhC,MACX,OAAK+B,EACGiC,GAAaF,GAEdA,CACR,CFoCMmB,CAAUjD,GAAG,GAClB8C,EG7CD,SAAgB9C,GACf,OAAOA,EAAEf,KACV,CH2CMiE,CAAUlD,GAEf6C,EAAOpE,EAAiBmE,GAEjB,CACNO,IAAOnD,EACPf,MAAS6D,EACTC,KAAQH,EACRrL,OAAUuI,EAAOgC,GACjB9D,MAAS8D,EACT7D,QAAWmF,GAAYpD,GAAG,GAC1B9B,OAAUmF,GAAWrD,GACrBwB,MAAS8B,GAAUtD,GACnBuD,iBAAoBV,EACpBW,UAAa,EACZ,CAAEC,EAAgBX,GAAMY,EAAgBZ,IACxC,CAAE9D,EAAQ8D,GAAM3D,EAAQ2D,IAE3B,CI/EA,IAAIvM,GAAoB,GAoBxB,SAASoN,GAAmB/M,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,EAoBxB,SAASuN,GAAkBlN,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,EAE9B,CCvBA,ICcIwN,GDdAC,GAA4C,mBAAjBC,aEL3BzN,GAAiC,mBAAjByN,aAAgCA,aAAe,KCA/DF,GAAiC,mBAAjBE,aAAgCA,kBAAe,EFuBlEF,GGRD,WACC,IAAIlB,EACAjE,EJSoBhI,EIPxB,GAAmC,mBAAvBsN,GACX,OAAO,EAGR,IACCtF,EAAM,IAAIsF,GAAoB,CAAE,EAAK,MAAO,KAAMC,MJE3BvN,EIANgI,EADjBiE,GJGEmB,IAAmBpN,aAAiBqN,cACb,0BAAzBpD,GAAajK,KIFC,IAAbgI,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CHhBKuB,GACGpH,GIdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EJoBA,IAAA8L,GAAeN,GKNf,SAASO,GAAatE,EAAG9B,GACxB,OAAO,IAAI+F,GAAcjE,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS,GAAG8B,EAAEzI,OAAO2G,GAC3F,CCpBA,ICcI6F,GDdAU,GAA4C,mBAAjBC,aEuB3BC,GAAezC,OAAO0C,kBC5BtBpO,GAAiC,mBAAjBkO,aAAgCA,aAAe,KCA/DX,GAAiC,mBAAjBW,aAAgCA,kBAAe,EHuBlEX,GIPD,WACC,IAAIlB,EACAjE,ELQoBhI,EKNxB,GAAmC,mBAAvBiO,GACX,OAAO,EAGR,IACCjG,EAAM,IAAIiG,GAAoB,CAAE,EAAK,MAAO,KAAM,OLC3BjO,EKCNgI,EADjBiE,GLEE4B,IAAmB7N,aAAiB8N,cACb,0BAAzB7D,GAAajK,KKDC,IAAbgI,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQkG,EAEd,CAAC,MAAQhI,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJjBKkC,GACG/H,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IAAAyM,GAAejB,GMNf,SAASO,GAAatE,EAAG9B,GACxB,OAAO,IAAIwG,GAAc1E,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS,GAAG8B,EAAEzI,OAAO2G,GAC3F,CCpBA,ICcI6F,GDdAkB,GAAwC,mBAAfC,WELzB1O,GAA+B,mBAAf0O,WAA8BA,WAAa,KCA3DnB,GAA+B,mBAAfmB,WAA8BA,gBAAa,EFuB9DnB,GGPD,WACC,IAAIlB,EACAjE,EJQkBhI,EINtB,GAAiC,mBAArBuO,GACX,OAAO,EAGR,IAECvG,EAAM,IAAIuG,GADVvG,EAAM,CAAE,EAAG,MAAO,KAAMwG,IAAaA,MJChBxO,EIENgI,EADfiE,GJCEoC,IAAiBrO,aAAiBsO,YACX,wBAAzBrE,GAAajK,KIAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQwG,MAAbxG,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CHnBKwC,GACGrI,GIdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EJoBA,IAAA+M,GAAevB,GKWfwB,GATKrL,MAAMD,QACNC,MAAMD,QARX,SAAkBrD,GACjB,MAAkC,mBAAzBiK,GAAajK,EACvB,ECCA,SAAS4O,GAAUC,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAI3K,UAAWiB,EAAQ,0DAA2D0J,IAEzF,OASA,SAAgB7O,GACf,IAAIqJ,EACAlJ,EACJ,IAAMkD,GAASrD,GACd,OAAO,EAGR,GAAa,KADbqJ,EAAMrJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrB,IAAiC,IAA5B0O,EAAW7O,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAAS2O,GAAc9O,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCMA,SAAS+O,GAAU/O,GAClB,OACC8O,GAAc9O,KAGbA,EAAMgP,WAELhP,EAAMgN,aAGgC,mBAA/BhN,EAAMgN,YAAY+B,UACzB/O,EAAMgN,YAAY+B,SAAU/O,GAIhC,CClBA,SAASiP,KACR,MAAO,yBACR,CCaAtH,EAAA/H,GAAA,oBALAsP,GAAAtP,KCFA,IAAIuP,GFPI,0BGQR,SAASC,GAAiBjF,GACzB,IAAIxF,EACAsI,EACAE,EAEJ,IAAe,YADfF,EAAOhD,GAAaE,GAAInF,MAAO,GAAI,KACC,UAATiI,IAAqB9C,EAAE6C,YAAc,CAE/D,GAA0B,iBAD1BG,EAAOhD,EAAE6C,aACQC,KAChB,OAAOE,EAAKF,KAGb,GADAtI,EAAQF,GAAGM,KAAMoI,EAAKvL,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKoK,GAAU5E,GACP,SAED8C,CACR,CCnBAtF,EAAA/H,GAAA,SAAAyP,IChCA,ICkBIlC,GDlBAmC,GAAc,CACjBxB,aAAgB,UAChBT,aAAgB,UAChB/J,MAAS,UACTiM,WAAc,QACdC,WAAc,QACdC,UAAa,OACbC,YAAe,SACfC,YAAe,SACfrB,WAAc,QACdsB,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QETbC,GAA0C,mBAAhBL,YC4B1BM,GAAa,WCjCbrQ,GAAgC,mBAAhB+P,YAA+BA,YAAc,KCA7DxC,GAAgC,mBAAhBwC,YAA+BA,iBAAc,EJuBhExC,GKPD,WACC,IAAIlB,EACAjE,EJQmBhI,EINvB,GAAkC,mBAAtBkQ,GACX,OAAO,EAGR,IAEClI,EAAM,IAAIkI,GADVlI,EAAM,CAAE,EAAG,MAAO,KAAMiI,WAAcA,aJChBjQ,EIENgI,EADhBiE,GJCE+D,IAAkBhQ,aAAiB2P,aACZ,yBAAzB1F,GAAajK,KIAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQiI,aAAbjI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CLnBKkE,GACG/J,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVIwL,GPUJiD,GAAejD,GQxBXkD,GAAwC,mBAAfb,WCLzB5P,GAA+B,mBAAf4P,WAA8BA,WAAa,KCA3DrC,GAA+B,mBAAfqC,WAA8BA,gBAAa,EHuB9DrC,GIND,WACC,IAAIlB,EACAjE,EHOkBhI,EGLtB,GAAiC,mBAArBsQ,GACX,OAAO,EAGR,IACCtI,EAAM,IAAIsI,GAAkB,CAAE,EAAG,MAAO,KAAMC,aHAzBvQ,EGENgI,EADfiE,GHCEoE,IAAiBrQ,aAAiBwP,YACX,wBAAzBvF,GAAajK,KGAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,aDDbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJlBKuE,GACGpK,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVIwL,GPUJsD,GAAetD,GQxBXuD,GAA0C,mBAAhBhB,YCL1B9P,GAAgC,mBAAhB8P,YAA+BA,YAAc,KCA7DvC,GAAgC,mBAAhBuC,YAA+BA,iBAAc,EHuBhEvC,GIPD,WACC,IAAIlB,EACAjE,EHQmBhI,EGNvB,GAAkC,mBAAtB2Q,GACX,OAAO,EAGR,IAEC3I,EAAM,IAAI2I,GADV3I,EAAM,CAAE,EAAG,MAAO,KAAM4I,MAAcA,QHChB5Q,EGENgI,EADhBiE,GHCEyE,IAAkB1Q,aAAiB0P,aACZ,yBAAzBzF,GAAajK,KGAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQ4I,QAAb5I,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJnBK4E,GACGzK,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVIwL,GNUJ2D,GAAe3D,GOxBX4D,GAAwC,mBAAfxB,WCLzB3P,GAA+B,mBAAf2P,WAA8BA,WAAa,KCA3DpC,GAA+B,mBAAfoC,WAA8BA,gBAAa,EHuB9DpC,GIND,WACC,IAAIlB,EACAjE,EHOkBhI,EGLtB,GAAiC,mBAArBgR,GACX,OAAO,EAGR,IACChJ,EAAM,IAAIgJ,GAAkB,CAAE,EAAG,MAAO,KAAMC,QHAzBjR,EGENgI,EADfiE,GHCE8E,IAAiB/Q,aAAiBuP,YACX,wBAAzBtF,GAAajK,KGAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,QDDbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJlBKiF,GACG9K,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IOVIwL,GPUJgE,GAAehE,GQxBXiE,GAAsD,mBAAtBxB,kBCLhChQ,GAAsC,mBAAtBgQ,kBAAqCA,kBAAoB,KCAzEzC,GAAsC,mBAAtByC,kBAAqCA,uBAAoB,EHuB5EzC,GIRD,WACC,IAAIlB,EACAjE,EHSyBhI,EGP7B,GAAwC,mBAA5BqR,GACX,OAAO,EAGR,IACCrJ,EAAM,IAAIqJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MHEpCrR,EGANgI,EADtBiE,GHGEmF,IAAwBpR,aAAiB4P,mBAClB,+BAAzB3F,GAAajK,KGFC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJnBKqF,GACGlL,GKdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ELoBA,IMVIwL,GNUJoE,GAAepE,GOxBXqE,GAAsC,mBAAd/B,UCLxB7P,GAA8B,mBAAd6P,UAA6BA,UAAY,KCAzDtC,GAA8B,mBAAdsC,UAA6BA,eAAY,EHuB5DtC,GIND,WACC,IAAIlB,EACAjE,EHOiBhI,EGLrB,GAAgC,mBAApByR,GACX,OAAO,EAGR,IACCzJ,EAAM,IAAIyJ,GAAiB,CAAE,EAAG,MAAO,KAAMC,MHAzB1R,EGENgI,EADdiE,GHCEuF,IAAgBxR,aAAiByP,WACV,uBAAzBxF,GAAajK,KGAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEO,MDDZA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CJlBK0F,GACGvL,GMdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,ENoBA,IAAAiQ,GAAezE,GOGX0E,GAAevG,GAAOwG,kBCVtBC,GAAQ3P,KAAK2P,MCHjB,SAASC,GAAW5I,GACnB,OAAQ2I,GAAM3I,KAAOA,CACtB,CCPA,SAAS4I,GAAWhS,GACnB,OACCA,EAAQkO,IACRlO,EAAQiS,IACRC,GAAOlS,EAET,CCAA,SAASgS,GAAWhS,GACnB,OACCD,GAAUC,IACVkS,GAAOlS,EAET,CCLA,SAASgS,GAAWhS,GACnB,OACCD,GAAUC,IACVkS,GAAOlS,EAAMsK,UAEf,CCGA,SAAS0H,GAAWhS,GACnB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCXA,SAASmS,GAAsBnS,GAC9B,OACCgS,GAAWhS,IACXA,GAAS,CAEX,CCLA,SAASmS,GAAsBnS,GAC9B,OACCgS,GAAWhS,IACXA,EAAMsK,WAAa,CAErB,CCQA,SAAS6H,GAAsBnS,GAC9B,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCeA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICAA9C,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC9BA,IAAI2H,GAAmB,WCGvB,SAASC,GAAmBrS,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,EAElB,CCZA,IAAIC,GAAyB,iBCD7B,SAASC,GAAcxS,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,EAElB,CCxBA,IAAIG,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAe3S,GACvB,OACGyS,IAAkBzS,aAAiB0S,aACZ,yBAAzBzI,GAAajK,EAEf,CCZA,SAASyK,GAAUzK,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCqD,GAASrD,EAEZ,CCeA,IAAA4S,GAAA1D,GAAA5F,GAAAkB,aACAqI,GAAA3D,GAAA5F,GAAAmB,UAKAqI,GAAA5D,GAAA5F,IACA3B,EAAAmL,GAAA,aAAAF,IACAjL,EAAAmL,GAAA,UAAAD,IClDA,IAAIpO,GAAK,ICoBT,SAASsO,GAAW/S,GACnB,MAA0B,kBAAVA,CACjB,CCGA,IAAIgT,GAAOC,QCxBPrR,GAAWqR,QAAQjS,UAAUY,SCS7B2H,GAAMW,KAqBV,SAAS6I,GAAW/S,GACnB,MAAsB,iBAAVA,IACNA,aAAiBiT,KAGjB1J,GCtBP,SAAevJ,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDgBUqE,CAAMvK,GAEoB,qBAAzBiK,GAAajK,IAGxB,CERA,SAAS+S,GAAW/S,GACnB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCUA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC7CA,IAAIpE,GAAwB,iBAAT6M,KAAsBA,KAAO,KCA5C7M,GAA0B,iBAAX8M,OAAwBA,OAAS,KCAhD9M,GAA8B,iBAAf+M,WAA4BA,WAAa,KCKxDC,GCsBJ,SAAoBC,GACnB,GAAKjP,UAAU1D,OAAS,CACvB,IAAMoS,GAAWO,GAChB,MAAM,IAAIpP,UAAWiB,EAAQ,yDAA0DmO,IAExF,GAAKA,EACJ,OC1BK,IAAIC,SAAU,eAAd,ED6BN,CAED,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,GAAKC,GACJ,OAAOA,GAGR,MAAM,IAAI/R,MAAO,qDAClB,CD9CWgS,GACPC,GAAWP,GAAKQ,UAAYR,GAAKQ,SAASC,WGR1CC,GAAatE,UCwBb7P,GCNY,mBAAP6E,IAGe,iBAAfsP,IAGa,mBAAbH,GCXT,SAAiBzJ,GAChB,OAAO6J,GAAU7J,GAAIlJ,aACtB,ECqBA,SAAiBkJ,GAChB,IAAI8J,EAGJ,OAAW,OAAN9J,EACG,OAKM,WAHd8J,SAAc9J,GAIN6J,GAAU7J,GAAIlJ,cAEfgT,CACR,EC7BA,SAASC,GAAYlU,GAEpB,MAA6B,aAApBmU,GAAQnU,EAClB,CCCA,SAAS2H,GAAatB,EAAKC,EAAMtG,GAChCF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCLA,SAASoU,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAIlQ,UAAW,0EAEtB,IAAMnE,GAAUsU,GACf,MAAM,IAAInQ,UAAWiB,EAAQ,kEAAmEkP,IAEjG,IAAMtU,GAAUuU,GACf,MAAM,IAAIpQ,UAAWiB,EAAQ,uEAAwEmP,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CAeA5M,EAAayM,GAAY,OAAQ,cAcjCzM,EAAayM,GAAY,oBAAqB,GAgBnCrN,EAAEqN,GAAWpT,UAAW,oBAAqB,GAgB7C+F,EAAEqN,GAAWpT,UAAW,aAAc,IAgBtC+F,EAAEqN,GAAWpT,UAAW,YC/GnC,WAEC,IAAIV,EAAM,GAAKiU,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdpU,GAAO,OAAUiU,KAAKG,GAEtBpU,GAAO,MAAQiU,KAAKG,GAErBpU,GAAO,GAER,IDyHWyG,EAAEqN,GAAWpT,UAAW,UEnInC,WAEC,IAAIZ,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAIqU,GAAKF,KAAKE,GACdrU,EAAIsU,GAAKH,KAAKG,GACPtU,CACR,ICXA,IAAIuU,GAAkC,mBAAhBvS,KAAKuS,OAA0BvS,KAAKuS,OAAS,KCK/DC,GAAe,IAAI9G,GAAc,GCuBrC+G,GATwB,mBAAZzO,GACQA,GDApB,SAA2BgD,GAE1B,OADAwL,GAAc,GAAMxL,EACbwL,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAI5Q,UAAW,0EAEtB,IAAMnE,GAAUsU,GACf,MAAM,IAAInQ,UAAWiB,EAAQ,kEAAmEkP,IAEjG,IAAMtU,GAAUuU,GACf,MAAM,IAAIpQ,UAAWiB,EAAQ,uEAAwEmP,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAehV,GACvB,OAAKA,aAAiBoU,IAAcpU,aAAiB8U,IAInC,iBAAV9U,GACG,OAAVA,GACoB,iBAAbA,EAAMyU,IACO,iBAAbzU,EAAM0U,EAEf,CCPA,SAASO,GAAQ7L,GAChB,OAAO4I,GAAW5I,EAAE,EACrB,CCdA,SAAS8L,KACR,MACmB,mBAAX1L,IACoB,iBAApBA,GAAQ,QACfK,GAAYL,GAAQ,aACO,iBAApBA,GAAO2L,QAEhB,CHgCAxN,EAAamN,GAAW,OAAQ,aAchCnN,EAAamN,GAAW,oBAAqB,GAgBlC/N,EAAE+N,GAAU9T,UAAW,oBAAqB,GAgB5C+F,EAAE+N,GAAU9T,UAAW,aAAc,GAgBrC+F,EAAE+N,GAAU9T,UAAW,YIhHlC,WAEC,IAAIV,EAAM,GAAKiU,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdpU,GAAO,OAAUiU,KAAKG,GAEtBpU,GAAO,MAAQiU,KAAKG,GAErBpU,GAAO,GAER,IJ0HWyG,EAAE+N,GAAU9T,UAAW,UKpIlC,WAEC,IAAIZ,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAIqU,GAAKF,KAAKE,GACdrU,EAAIsU,GAAKH,KAAKG,GACPtU,CACR,ICwCA,IAAIgV,GAAmBF,KAA+B1L,OAAO2L,SAAW,KCxBxE,SAASE,GAAkChP,EAAKC,EAAM8B,GACrDtI,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOwB,GAET,CCrBA,SAASiM,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCFA,SAASH,GAAMgB,GACd,OAAOA,EAAEZ,EACV,CCEA,SAASa,GAAcC,GACtB,IAAIpV,EACA+J,EACAmL,EAGJ,IADAlV,EAAM,KAEL+J,EAAIqL,EAAGC,QACAC,MAIP,GAAKrD,GADLiD,EAAInL,EAAEnK,QACyBsV,EAAE3U,QAAU,EAC1CP,EAAI8E,KAAMoQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAIpR,UAAWiB,EAAQ,kJAAmJmQ,IAFjLlV,EAAI8E,KAAMyQ,GAAOL,GAAKM,GAAON,GAG7B,CAEF,OAAOlV,CACR,CCAA,IAAAT,GAAA,EAAAmO,GAAAnO,kBACAkW,GAAAX,KAYA,SAAAY,GAAA9V,GACA,OACAA,aAAA6P,IAEA,iBAAA7P,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAC,MACA,oBAAAjN,EAAAgN,YAAAC,OAEA,iBAAAjN,EAAA+V,SAGA,iBAAA/V,EAAAgW,OAGA,CASA,SAAAC,GAAAjW,GACA,OACAA,IAAA6P,IAGA,oBAAA7P,EAAAiN,IAEA,CAUA,SAAAiJ,GAAAC,EAAAlO,GAEA,OAAA,IAAA6M,GAAAqB,EADAlO,GAAA,GACAkO,EAAAlO,EAAA,GACA,CAyEA,SAAA4H,KACA,IAAAjC,EACAwI,EACAD,EACA9M,EAGA,GADA+M,EAAA/R,UAAA1D,SACA4T,gBAAA1E,IACA,OAAA,IAAAuG,EACA,IAAAvG,GAEA,IAAAuG,EACA,IAAAvG,GAAAxL,UAAA,IAEA,IAAA+R,EACA,IAAAvG,GAAAxL,UAAA,GAAAA,UAAA,IAEA,IAAAwL,GAAAxL,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAArI,GAAA,QACA,GAAA,IAAAsI,EACA,GAAAjE,GAAA9N,UAAA,IACA8R,EAAA,IAAArI,GAAA,EAAAzJ,UAAA,SACA,GAAAmO,GAAAnO,UAAA,IAKA,IAHAgF,GADA8M,EAAA9R,UAAA,IACA1D,SAGA0C,GAAA8S,IAAAnB,GAAAmB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnO,GACxB,IAAIqB,EACAc,EACAhK,EACA8D,EAIJ,IAFAoF,EAAMrB,EAAIrH,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,IAAM6U,GADN7K,EAAInC,EAAK7H,IAER,OAAO,KAERgW,EAAKlS,GAAM0R,GAAOxL,GAClBgM,EAAKlS,EAAE,GAAM2R,GAAOzL,GACpBlG,GAAK,CACL,CACD,OAAOkS,CACR,CDsKAE,CAAA,IAAAvI,GAAA,EAAAzE,GAAA8M,GACA,OAAAA,EAAA,CAEA,IAAAlB,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,6GAAAkE,IAGA8M,EAAA,IAAArI,GAAAzJ,UAAA,GACA,MACA,CACA,GAAA6I,GAAAiJ,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAApJ,GAAAoJ,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAlB,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,6HAAAkE,IAEA8M,EAAA,IAAArI,GAAAqI,EACA,MACA,GAAAxD,GAAAtO,UAAA,IAAA,CAEA,IAAA2N,IADAmE,EAAA9R,UAAA,IACAoS,WAAA9W,IACA,MAAA,IAAA2W,WAAAnR,EAAA,yFAAAxF,GAAAwW,EAAAM,aAEAN,EAAA,IAAArI,GAAAqI,EACA,KAAA,KAAA1L,GAAApG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADA8R,EAAA9R,UAAA,IACA,IAAAwR,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAAgR,IAEA,IAAAjC,GAAAiC,EAAAO,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAAgR,IAGA,IAAAjC,IADAiC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAAgR,IAGA,IADAA,EAAAZ,GAAAY,cACAxU,MACA,MAAAwU,EAEAA,EAAA,IAAArI,GAAAqI,EAGA,KACA,CAEA,IAAAxD,GADAwD,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAhE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,IAAAoE,GAAApE,EAAAjO,IACA,MAAA,IAAA2W,WAAAnR,EAAA,uEAAAxF,GAAAiO,IAEA,GAAA,IAAAwI,EAAA,CAEA,IAAApE,IADA3I,EAAA8M,EAAAM,WAAA7I,GACAjO,IACA,MAAA,IAAA2W,WAAAnR,EAAA,oGAAAxF,GAAA0J,IAEA8M,EAAA,IAAArI,GAAAqI,EAAAvI,EACA,KAAA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAAwW,EAAAM,WAAA7I,EACA,MAAA,IAAA0I,WAAAnR,EAAA,iJAAAkE,EAAA1J,KAEAwW,EAAA,IAAArI,GAAAqI,EAAAvI,EAAA,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA4M,KAAA,UAAA4B,GACAxO,EAAA4M,KAAA,UAAA4B,EAAAxV,OAAA,GAEA4T,IACA,CEzQA,SAASF,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCFA,SAASH,GAAMgB,GACd,OAAOA,EAAEZ,EACV,CCEA,SAASa,GAAcC,GACtB,IAAIpV,EACA+J,EACAmL,EAGJ,IADAlV,EAAM,KAEL+J,EAAIqL,EAAGC,QACAC,MAIP,GAAKrD,GADLiD,EAAInL,EAAEnK,QACyBsV,EAAE3U,QAAU,EAC1CP,EAAI8E,KAAMoQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAIpR,UAAWiB,EAAQ,kJAAmJmQ,IAFjLlV,EAAI8E,KAAMmP,GAAMiB,GAAKhB,GAAMgB,GAG3B,CAEF,OAAOlV,CACR,CJ+PAuH,EAAAkI,GAAA,oBAAAlQ,IAeAgI,EAAAkI,GAAA,OAAA,kBAmDA9I,EAAA8I,GAAA,QAAA,SAAA8G,GACA,IAAAC,EACAR,EACAS,EACAzW,EACA+V,EACAW,EACAlQ,EACAyC,EACA0N,EACA5M,EACAhK,EACA8D,EACA,IAAAiQ,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+R,GAAA1B,MACA,MAAA,IAAArQ,UAAA,6DAGA,IADAkS,EAAA/R,UAAA1D,QACA,EAAA,CAEA,IAAAuT,GADA2C,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAAyR,GAAAa,GAAA,CAEA,GADAtN,EAAAsN,EAAAhW,OACAkW,EAAA,CAIA,IAFAV,GADA/V,EAAA,IAAAmU,KAAAlL,IACA2M,QACA/R,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA6U,GADA7K,EAAA0M,EAAA5U,KAAA2U,EAAAD,EAAA/P,IAAAzG,GAAAA,IAEAgW,EAAAlS,GAAA0R,GAAAxL,GACAgM,EAAAlS,EAAA,GAAA2R,GAAAzL,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAgM,EAAAlS,GAAAkG,EAAA,GACAgM,EAAAlS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAmU,KAAAoC,EACA,CACA,GAAAnE,GAAAmE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAxN,EAAAsN,EAAAhW,OAEAiG,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACAgG,EAAA,WAEAzE,EAAA,WAGAjI,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA,IAAA6U,GAAApO,EAAA+P,EAAAxW,IAAA,CACA4W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,+FAAA,EAAAkE,IAIA,IADA8M,GADA/V,EAAA,IAAAmU,KAAAlL,EAAA,IACA2M,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA0W,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAAxW,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFA+V,GADA/V,EAAA,IAAAmU,KAAAlL,IACA2M,QACA/R,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA6U,GADA7K,EAAA0M,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAAxW,GAAAA,IAEAgW,EAAAlS,GAAA0R,GAAAxL,GACAgM,EAAAlS,EAAA,GAAA2R,GAAAzL,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAgM,EAAAlS,GAAAkG,EAAA,GACAgM,EAAAlS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAmU,KAAAoC,EACA,CACA,GAAAlM,GAAAkM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAOA,GAJAG,EADAD,EK/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIxW,EACA+J,EACAmL,EACAnV,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIqL,EAAGC,QACAC,MAKP,GAFAvV,GAAK,EAEAkS,GADLiD,EAAIuB,EAAK5U,KAAM2U,EAASzM,EAAEnK,MAAOG,KACFmV,EAAE3U,QAAU,EAC1CP,EAAI8E,KAAMoQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAIpR,UAAWiB,EAAQ,+IAAgJmQ,IAF9KlV,EAAI8E,KAAMyQ,GAAOL,GAAKM,GAAON,GAG7B,CAEF,OAAOlV,CACR,CLwaA4W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAAnV,MACA,MAAAmV,EAKA,IADAX,GADA/V,EAAA,IAAAmU,KADAlL,EAAAyN,EAAAnW,OAAA,IAEAqV,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA2W,EAAA3W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAhP,EAAAkI,GAAA,MAAA,WACA,IAAAzK,EACAjF,EACA,IAAA+T,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+R,GAAA1B,MACA,MAAA,IAAArQ,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAoU,KAAAnP,EACA,IAuDA2B,EAAA8I,GAAA7O,UAAA,MAAA,SAAAiH,GACA,IAAA6N,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAKA,GAHAA,EAAA,IACAA,GAAAsM,KAAAwB,WAEA9N,EAAA,GAAAA,GAAAsM,KAAAwB,SAGA,OAAAG,GAAA3B,KAAAyB,QAAA/N,EACA,IAgBAoN,GAAAxF,GAAA7O,UAAA,UAAA,WACA,OAAAuT,KAAAyB,QAAArI,MACA,IAgBA0H,GAAAxF,GAAA7O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAAS,UACA,IAgBApB,GAAAxF,GAAA7O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAApI,UACA,IAiBA7G,EAAA8I,GAAA7O,UAAA,oBAAA6O,GAAAlQ,mBAuCAgI,EAAAkI,GAAA7O,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAApB,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA4T,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA7S,UAAA,IAEAkQ,IACA,IAqCAxN,EAAA8I,GAAA7O,UAAA,WAAA,WACA,IAAAkS,EACAkE,EACA/N,EACA8M,EACA5M,EACApJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAiBA,OAfAgP,EAAAqB,KACA4B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAA,CAAAG,EAAA+V,GAAAC,EAAAhW,IACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAAmE,SACA,IAjDAD,CAkDA,IA+BAzP,EAAAkI,GAAA7O,UAAA,SAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,IAAA0O,EAAA5M,KAAA2U,EAAAV,GAAAC,EAAAhW,GAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA2CA5M,EAAAkI,GAAA7O,UAAA,QAAA,SAAAhB,EAAAkX,EAAAI,GACA,IAAAnB,EACA9M,EACApB,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAhV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAmW,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAkF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA7N,GACA,IACA6N,EAAA,GAGA7S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAjO,GACA,IACAiO,EAAA,GAGAA,EAAAjO,IACAiO,EAAAjO,EAEA,MACAiO,EAAAjO,CAEA,MACA6N,EAAA,EACAI,EAAAjO,EAIA,IAFAoL,EAAAkB,GAAA3V,GACA0U,EAAAkB,GAAA5V,GACAG,EAAA+W,EAAA/W,EAAAmX,EAAAnX,IAEAgW,EADAlO,EAAA,EAAA9H,GACAsU,EACA0B,EAAAlO,EAAA,GAAAyM,EAEA,OAAAH,IACA,IA2CA5M,EAAAkI,GAAA7O,UAAA,UAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACA/V,EACAD,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAsH,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAmV,EAAAY,GAAAC,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,OACAnU,EAAA8E,KAAAoQ,GAGA,OAAA,IAAAf,KAAAvH,YAAA5M,EACA,IAsCAuH,EAAAkI,GAAA7O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAmV,EAAAY,GAAAC,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAAe,CAGA,IAgCA3N,EAAAkI,GAAA7O,UAAA,aAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAmV,EAAAY,GAAAC,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IAsCAwH,EAAAkI,GAAA7O,UAAA,YAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAmV,EAAAY,GAAAC,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAAe,CAGA,IAgCA3N,EAAAkI,GAAA7O,UAAA,iBAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAmV,EAAAY,GAAAC,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IA4BAwH,EAAAkI,GAAA7O,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAmV,EAAAY,GAAAC,EAAAhW,GACAoX,EAAAtV,KAAA2U,EAAAtB,EAAAnV,EAAAoU,KAEA,IAyCAxN,EAAA8I,GAAA7O,UAAA,OAAA,SAAAiH,GACA,IAAA6N,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAsM,KAAAwB,SAGA,OAAAG,GAAA3B,KAAAyB,QAAA/N,EACA,IAmCAN,EAAAkI,GAAA7O,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAAkI,GAAA7O,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyBA4G,EAAA8I,GAAA7O,UAAA,QAAA,SAAA0W,GACA,IAAAtX,EACA+V,EACAwB,EACAxX,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAgX,EAAA,QACA,KAAArO,GAAAoO,GAGA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,IAFAC,EAAAD,CAGA,CAGA,IAFAtX,EAAA,GACA+V,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAAgR,GAAAC,EAAAhW,GAAAyB,YAEA,OAAAxB,EAAAwX,KAAAD,EACA,IA4BA5Q,EAAA8I,GAAA7O,UAAA,QAAA,WACA,IAAAkS,EACAkE,EACA/N,EACAE,EACApJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAgBA,OAdAgP,EAAAqB,KACAlL,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAAG,EACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2E,MACA,IAjDAT,CAkDA,IAsCAzP,EAAAkI,GAAA7O,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAKA,IAHAtB,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,GAAA,EAAAA,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAgBAkV,GAAAxF,GAAA7O,UAAA,UAAA,WACA,OAAAuT,KAAAwB,OACA,IAyCApO,EAAAkI,GAAA7O,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACA3B,EACA/V,EACAD,EACAgK,EACA,IAAA2L,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAwB,UACAC,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAA6U,GADA7K,EAAAoN,EAAAtV,KAAA2U,EAAAV,GAAAC,EAAAhW,GAAAA,EAAAoU,OAEAuD,EAAA,EAAA3X,GAAAwV,GAAAxL,GACA2N,EAAA,EAAA3X,EAAA,GAAAyV,GAAAzL,OACA,KAAAkI,GAAAlI,IAAA,IAAAA,EAAAxJ,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHA2N,EAAA,EAAA3X,GAAAgK,EAAA,GACA2N,EAAA,EAAA3X,EAAA,GAAAgK,EAAA,EAGA,CAEA,OAAA/J,CACA,IAmCAuH,EAAAkI,GAAA7O,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA5O,EAEAlJ,EAEA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAA/B,GAAAC,EAAA,GACAhW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IAEA8X,EAAAF,EAAAE,EADA/B,GAAAC,EAAAhW,GACAA,EAAAoU,MAEA,OAAA0D,CACA,IAmCAtQ,EAAAkI,GAAA7O,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA5O,EAEAlJ,EAEA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAA/B,GAAAC,EAAA9M,EAAA,GACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IAEA8X,EAAAF,EAAAE,EADA/B,GAAAC,EAAAhW,GACAA,EAAAoU,MAEA,OAAA0D,CACA,IAmDAlR,EAAA8I,GAAA7O,UAAA,WAAA,WACA,IAAAmV,EACAW,EACAzN,EACA6O,EACA/X,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAKA,IAHAmF,EAAAkL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACAkC,EAAAnG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAA+X,EAAA/X,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA2W,EAAAX,EAAA,EAAAhW,GACAgW,EAAA,EAAAhW,GAAAgW,EAAA,EAAAlS,GACAkS,EAAA,EAAAlS,GAAA6S,EACAA,EAAAX,EAAA,EAAAhW,EAAA,GACAgW,EAAA,EAAAhW,EAAA,GAAAgW,EAAA,EAAAlS,EAAA,GACAkS,EAAA,EAAAlS,EAAA,GAAA6S,EAEA,OAAAvC,IACA,IAgEAxN,EAAA8I,GAAA7O,UAAA,OAAA,SAAAhB,GAEA,IAAAmY,EACAlQ,EACAkO,EACAW,EACAC,EACAmB,EACA/N,EACAhK,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAGA,GADAiS,EAAA5B,KAAAyB,QACA3R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAA+M,GAAAhV,GAAA,CACA,GAAAiI,GAAAsM,KAAAwB,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA8C,IAKA,OAFAkO,EADAlO,GAAA,GACA0N,GAAA3V,QACAmW,EAAAlO,EAAA,GAAA2N,GAAA5V,GAEA,CACA,GAAA8V,GAAA9V,GAAA,CAEA,GAAAiI,GADAiQ,EAAAlY,EAAA+V,SACAxB,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAAAgW,QAGA/R,EAAAkS,EAAAvI,WAAA3F,EAAAtI,GAEAwY,EAAAxK,SAAAwI,EAAAxI,QAEAwK,EAAAvK,WAAA3J,GACAkU,EAAAvK,WAAAuK,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAhJ,GAAAqK,EAAAxX,QACAR,EAAA,EAAAA,EAAAgY,EAAAxX,OAAAR,IACA2W,EAAA3W,GAAAgY,EAAAhY,GAEAgY,EAAArB,CACA,CAGA,IAFA7O,GAAA,EACAhE,EAAA,EACA9D,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgW,EAAAlO,GAAAkQ,EAAAlU,GACAkS,EAAAlO,EAAA,GAAAkQ,EAAAlU,EAAA,GACAgE,GAAA,EACAhE,GAAA,CAGA,KAhCA,CAiCA,IAAAuO,GAAAxS,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAkY,EAAAlY,EAAAW,OACAR,EAAA,EAAAA,EAAA+X,EAAA/X,IACA,IAAA6U,GAAAhV,EAAAG,IAAA,CACA4W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAAiD,GACA,MAAA,IAAA5B,WAAAnR,EAAA,6GAAA+S,IAEA,GAAAjQ,EAAAiQ,EAAA,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAGAiE,EAAAkS,EAAAvI,WAAA3F,EAAAtI,GAEAwY,EAAAxK,SAAAwI,EAAAxI,QAEAwK,EAAAvK,WAAA3J,GACAkU,EAAAvK,WAAAuK,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAhJ,GAAAoK,GACA/X,EAAA,EAAAA,EAAA+X,EAAA/X,IACA2W,EAAA3W,GAAAgY,EAAAhY,GAEAgY,EAAArB,CACA,CAIA,IAHA7O,GAAA,EACAiQ,GAAA,EACAjU,EAAA,EACA9D,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgW,EAAAlO,GAAAkQ,EAAAlU,GACAkS,EAAAlO,EAAA,GAAAkQ,EAAAlU,EAAA,GACAgE,GAAA,EACAhE,GAAA,EAEA,MACA,CAEA,GAAAgE,EAAAiQ,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAGA,IADArO,GAAA,EACA9H,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgK,EAAAnK,EAAAG,GACAgW,EAAAlO,GAAA0N,GAAAxL,GACAgM,EAAAlO,EAAA,GAAA2N,GAAAzL,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAAkI,GAAA7O,UAAA,SAAA,SAAAkW,EAAAI,GACA,IAAAc,EACAN,EACA1X,EACA6H,EACAkO,EACA9M,EACAlJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACAuW,EAAA,EACAI,EAAAjO,MACA,CACA,IAAA2I,GAAAkF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,oEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA7N,GACA,IACA6N,EAAA,GAGA,IAAA7S,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAQA,IANA+O,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAoL,IACApC,QACA7V,EAAA,EAAAA,EAAAiY,EAAAjY,IACA8H,EAAA,GAAA9H,EAAA+W,GACAY,EAAA,EAAA3X,GAAAgW,EAAAlO,GACA6P,EAAA,EAAA3X,EAAA,GAAAgW,EAAAlO,EAAA,GAEA,OAAA7H,CACA,IA+BAuH,EAAAkI,GAAA7O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,GAAA0O,EAAA5M,KAAA2U,EAAAV,GAAAC,EAAAhW,GAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA6EAxN,EAAA8I,GAAA7O,UAAA,QAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA9M,EACAlJ,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACAe,EAAA,GACA3W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2W,EAAA5R,KAAAgR,GAAAC,EAAAhW,IAGA,IADA2W,EAAAwB,KAAAD,GACAlY,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAEAgW,EADAlS,EAAA,EAAA9D,GACAwV,GAAAmB,EAAA3W,IACAgW,EAAAlS,EAAA,GAAA2R,GAAAkB,EAAA3W,IAEA,OAAAoU,IACA,IA2EA5M,EAAAkI,GAAA7O,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAhQ,EACA6O,EACA9M,EACA,IAAAyM,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACA4X,EAAA,EACAjB,EAAAjO,MACA,CACA,IAAA2I,GAAAuG,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAlP,GACA,IACAkP,EAAA,GAGA,IAAAlU,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAWA,OAVAkP,GAAAlP,GACAA,EAAA,EACA/B,EAAA6O,EAAAM,YACA8B,GAAAjB,GACAjO,EAAA,EACA/B,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,KAEA0J,EAAAiO,EAAAiB,EACAjR,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,IAEA,IAAA4U,KAAAvH,YAAAmJ,EAAAxI,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAAkI,GAAA7O,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAvY,EACA+V,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAgY,EAAA,OACA,KAAArP,GAAAkP,KAAA1F,GAAA0F,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAA1D,OAAA,EACA+X,EAAA,CAAA,MACA,KAAAjO,GAAAgO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAAgR,GAAAC,EAAAhW,GAAAyY,eAAAD,EAAAD,IAEA,OAAAtY,EAAAwX,KAAA,IACA,IAmDA7Q,EAAA8I,GAAA7O,UAAA,cAAA,WACA,IAAA8W,EACA1X,EACAiJ,EACA8M,EACAhW,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAMA,IAJAmF,EAAAkL,KAAAwB,QACA3V,EAAA,IAAAmU,KAAAvH,YAAA3D,GACA8M,EAAA5B,KAAAyB,QACA8B,EAAA1X,EAAA4V,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA2X,EAAA,EAAA3X,GAAAgW,EAAA,EAAAlS,GACA6T,EAAA,EAAA3X,EAAA,GAAAgW,EAAA,EAAAlS,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA8I,GAAA7O,UAAA,YAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA9M,EACAlJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACAe,EAAA,GACA3W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2W,EAAA5R,KAAAgR,GAAAC,EAAAhW,IAGA,OADA2W,EAAAwB,KAAAD,GACA,IAAAxI,GAAAiH,EACA,IAoBA/P,EAAA8I,GAAA7O,UAAA,YAAA,WACA,IAAAZ,EACA+V,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,IAFA9D,EAAA,GACA+V,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAAgR,GAAAC,EAAAhW,GAAAyB,YAEA,OAAAxB,EAAAwX,KAAA,IACA,IA0CA7Q,EAAA8I,GAAA7O,UAAA,UAAA,WACA,IAAAoW,EACAlE,EACA7J,EACAE,EACA4M,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAiBA,OAfAgP,EAAAqB,KACA4B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAAkW,GAAAC,EAAAhW,GACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2F,QACA,IAjDAzB,CAkDA,IAuCAzP,EAAAkI,GAAA7O,UAAA,QAAA,SAAA8X,EAAA9Y,GACA,IAAAmW,EACA/V,EACAiJ,EACA,IAAAyM,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8N,GAAA8G,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJAzP,EAAAkL,KAAAwB,QACA+C,EAAA,IACAA,GAAAzP,GAEAyP,EAAA,GAAAA,GAAAzP,EACA,MAAA,IAAAiN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAA9D,GAAAhV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAmW,GADA/V,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAyB,UACAA,SACA,EAAA8C,GAAAnD,GAAA3V,GACAmW,EAAA,EAAA2C,EAAA,GAAAlD,GAAA5V,GACAI,CACA,IM15FA,IAAAT,GAAA,EAAA0N,GAAA1N,kBACAkW,GAAAX,KAYA,SAAAY,GAAA9V,GACA,OACAA,aAAA8P,IAEA,iBAAA9P,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAC,MACA,oBAAAjN,EAAAgN,YAAAC,OAEA,iBAAAjN,EAAA+V,SAGA,iBAAA/V,EAAAgW,OAGA,CASA,SAAAC,GAAAjW,GACA,OACAA,IAAA8P,IAGA,mBAAA9P,EAAAiN,IAEA,CAUA,SAAA8L,GAAA5C,EAAAlO,GAEA,OAAA,IAAAmM,GAAA+B,EADAlO,GAAA,GACAkO,EAAAlO,EAAA,GACA,CAyEA,SAAA6H,KACA,IAAAlC,EACAwI,EACAD,EACA9M,EAGA,GADA+M,EAAA/R,UAAA1D,SACA4T,gBAAAzE,IACA,OAAA,IAAAsG,EACA,IAAAtG,GAEA,IAAAsG,EACA,IAAAtG,GAAAzL,UAAA,IAEA,IAAA+R,EACA,IAAAtG,GAAAzL,UAAA,GAAAA,UAAA,IAEA,IAAAyL,GAAAzL,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAA9I,GAAA,QACA,GAAA,IAAA+I,EACA,GAAAjE,GAAA9N,UAAA,IACA8R,EAAA,IAAA9I,GAAA,EAAAhJ,UAAA,SACA,GAAAmO,GAAAnO,UAAA,IAKA,IAHAgF,GADA8M,EAAA9R,UAAA,IACA1D,SAGA0C,GAAA8S,IAAAnB,GAAAmB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKnO,GACxB,IAAIqB,EACAc,EACAhK,EACA8D,EAIJ,IAFAoF,EAAMrB,EAAIrH,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,IAAM6U,GADN7K,EAAInC,EAAK7H,IAER,OAAO,KAERgW,EAAKlS,GAAMoQ,GAAMlK,GACjBgM,EAAKlS,EAAE,GAAMqQ,GAAMnK,GACnBlG,GAAK,CACL,CACD,OAAOkS,CACR,CDsKAE,CAAA,IAAAhJ,GAAA,EAAAhE,GAAA8M,GACA,OAAAA,EAAA,CAEA,IAAAlB,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,6GAAAkE,IAGA8M,EAAA,IAAA9I,GAAAhJ,UAAA,GACA,MACA,CACA,GAAA6I,GAAAiJ,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAApJ,GAAAoJ,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAlB,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,6HAAAkE,IAEA8M,EAAA,IAAA9I,GAAA8I,EACA,MACA,GAAAxD,GAAAtO,UAAA,IAAA,CAEA,IAAA2N,IADAmE,EAAA9R,UAAA,IACAoS,WAAA9W,IACA,MAAA,IAAA2W,WAAAnR,EAAA,yFAAAxF,GAAAwW,EAAAM,aAEAN,EAAA,IAAA9I,GAAA8I,EACA,KAAA,KAAA1L,GAAApG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADA8R,EAAA9R,UAAA,IACA,IAAAwR,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAAgR,IAEA,IAAAjC,GAAAiC,EAAAO,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAAgR,IAGA,IAAAjC,IADAiC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAAgR,IAGA,IADAA,EAAAZ,GAAAY,cACAxU,MACA,MAAAwU,EAEAA,EAAA,IAAA9I,GAAA8I,EAGA,KACA,CAEA,IAAAxD,GADAwD,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAhE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,IAAAoE,GAAApE,EAAAjO,IACA,MAAA,IAAA2W,WAAAnR,EAAA,uEAAAxF,GAAAiO,IAEA,GAAA,IAAAwI,EAAA,CAEA,IAAApE,IADA3I,EAAA8M,EAAAM,WAAA7I,GACAjO,IACA,MAAA,IAAA2W,WAAAnR,EAAA,oGAAAxF,GAAA0J,IAEA8M,EAAA,IAAA9I,GAAA8I,EAAAvI,EACA,KAAA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAAwW,EAAAM,WAAA7I,EACA,MAAA,IAAA0I,WAAAnR,EAAA,iJAAAkE,EAAA1J,KAEAwW,EAAA,IAAA9I,GAAA8I,EAAAvI,EAAA,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA4M,KAAA,UAAA4B,GACAxO,EAAA4M,KAAA,UAAA4B,EAAAxV,OAAA,GAEA4T,IACA,CEzQA,SAASgB,GAAcC,GACtB,IAAIpV,EACA+J,EAGJ,IADA/J,EAAM,KAEL+J,EAAIqL,EAAGC,QACAC,MAGPtV,EAAI8E,KAAM+N,GAAS9I,EAAEnK,QAEtB,OAAOI,CACR,CF2QAuH,EAAAmI,GAAA,oBAAAnQ,IAeAgI,EAAAmI,GAAA,OAAA,mBAmDA/I,EAAA+I,GAAA,QAAA,SAAA6G,GACA,IAAAC,EACAR,EACAS,EACAzW,EACA+V,EACAW,EACAlQ,EACAyC,EACA0N,EACA5M,EACAhK,EACA8D,EACA,IAAAiQ,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+R,GAAA1B,MACA,MAAA,IAAArQ,UAAA,6DAGA,IADAkS,EAAA/R,UAAA1D,QACA,EAAA,CAEA,IAAAuT,GADA2C,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAAyR,GAAAa,GAAA,CAEA,GADAtN,EAAAsN,EAAAhW,OACAkW,EAAA,CAIA,IAFAV,GADA/V,EAAA,IAAAmU,KAAAlL,IACA2M,QACA/R,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA6U,GADA7K,EAAA0M,EAAA5U,KAAA2U,EAAAD,EAAA/P,IAAAzG,GAAAA,IAEAgW,EAAAlS,GAAAoQ,GAAAlK,GACAgM,EAAAlS,EAAA,GAAAqQ,GAAAnK,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAgM,EAAAlS,GAAAkG,EAAA,GACAgM,EAAAlS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAmU,KAAAoC,EACA,CACA,GAAAnE,GAAAmE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPAxN,EAAAsN,EAAAhW,OAEAiG,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACAgG,EAAA,WAEAzE,EAAA,WAGAjI,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA,IAAA6U,GAAApO,EAAA+P,EAAAxW,IAAA,CACA4W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAA5L,GACA,MAAA,IAAAiN,WAAAnR,EAAA,gGAAAkE,IAIA,IADA8M,GADA/V,EAAA,IAAAmU,KAAAlL,EAAA,IACA2M,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA0W,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAAxW,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFA+V,GADA/V,EAAA,IAAAmU,KAAAlL,IACA2M,QACA/R,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA6U,GADA7K,EAAA0M,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAAxW,GAAAA,IAEAgW,EAAAlS,GAAAoQ,GAAAlK,GACAgM,EAAAlS,EAAA,GAAAqQ,GAAAnK,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAgM,EAAAlS,GAAAkG,EAAA,GACAgM,EAAAlS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAmU,KAAAoC,EACA,CACA,GAAAlM,GAAAkM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAOA,GAJAG,EADAD,EG/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIxW,EACA+J,EACAmL,EACAnV,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIqL,EAAGC,QACAC,MAKP,GAFAvV,GAAK,EAEAkS,GADLiD,EAAIuB,EAAK5U,KAAM2U,EAASzM,EAAEnK,MAAOG,KACFmV,EAAE3U,QAAU,EAC1CP,EAAI8E,KAAMoQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAIpR,UAAWiB,EAAQ,+IAAgJmQ,IAF9KlV,EAAI8E,KAAMmP,GAAMiB,GAAKhB,GAAMgB,GAG3B,CAEF,OAAOlV,CACR,CHwaA4W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAAnV,MACA,MAAAmV,EAKA,IADAX,GADA/V,EAAA,IAAAmU,KADAlL,EAAAyN,EAAAnW,OAAA,IAEAqV,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA2W,EAAA3W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAhP,EAAAmI,GAAA,MAAA,WACA,IAAA1K,EACAjF,EACA,IAAA+T,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+R,GAAA1B,MACA,MAAA,IAAArQ,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAoU,KAAAnP,EACA,IAwDA2B,EAAA+I,GAAA9O,UAAA,MAAA,SAAAiH,GACA,IAAA6N,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAKA,GAHAA,EAAA,IACAA,GAAAsM,KAAAwB,WAEA9N,EAAA,GAAAA,GAAAsM,KAAAwB,SAGA,OAAAgD,GAAAxE,KAAAyB,QAAA/N,EACA,IAgBAoN,GAAAvF,GAAA9O,UAAA,UAAA,WACA,OAAAuT,KAAAyB,QAAArI,MACA,IAgBA0H,GAAAvF,GAAA9O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAAS,UACA,IAgBApB,GAAAvF,GAAA9O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAApI,UACA,IAiBA7G,EAAA+I,GAAA9O,UAAA,oBAAA8O,GAAAnQ,mBAuCAgI,EAAAmI,GAAA9O,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAApB,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA4T,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA7S,UAAA,IAEAkQ,IACA,IAqCAxN,EAAA+I,GAAA9O,UAAA,WAAA,WACA,IAAA2M,EACAuF,EACAkE,EACA/N,EACAE,EACApJ,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAkBA,OAhBAgP,EAAAqB,KACA5G,EAAA4G,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EACA8D,GAAA,EAIA0D,EADAyP,EAAA,CAAA,EACA,QAcA,WACA,IAAA9B,EAEA,OADAnV,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,IAIAJ,EAAA,IAAAlB,GAAAzG,EADA1J,GAAA,GACA0J,EAAA1J,EAAA,IACA,CACAjE,MAAA,CAAAG,EAAAmV,GACAI,MAAA,GAEA,IA3BA/N,EAAAyP,EAAA,UAoCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA7CAgB,IACA/O,EAAAyP,EAAAV,IAoDA,WACA,OAAAxD,EAAAmE,SACA,IApDAD,CAqDA,IA+BAzP,EAAAmI,GAAA9O,UAAA,SAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,IAAA0O,EAAA5M,KAAA2U,EAAAmC,GAAA5C,EAAAhW,GAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA2CA5M,EAAAmI,GAAA9O,UAAA,QAAA,SAAAhB,EAAAkX,EAAAI,GACA,IAAAnB,EACA9M,EACApB,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAhV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAmW,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAkF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA7N,GACA,IACA6N,EAAA,GAGA7S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAjO,GACA,IACAiO,EAAA,GAGAA,EAAAjO,IACAiO,EAAAjO,EAEA,MACAiO,EAAAjO,CAEA,MACA6N,EAAA,EACAI,EAAAjO,EAIA,IAFAoL,EAAAJ,GAAArU,GACA0U,EAAAJ,GAAAtU,GACAG,EAAA+W,EAAA/W,EAAAmX,EAAAnX,IAEAgW,EADAlO,EAAA,EAAA9H,GACAsU,EACA0B,EAAAlO,EAAA,GAAAyM,EAEA,OAAAH,IACA,IA2CA5M,EAAAmI,GAAA9O,UAAA,UAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACA/V,EACAD,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAsH,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAmV,EAAAyD,GAAA5C,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,OACAnU,EAAA8E,KAAAoQ,GAGA,OAAA,IAAAf,KAAAvH,YAAA5M,EACA,IAqCAuH,EAAAmI,GAAA9O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAmV,EAAAyD,GAAA5C,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAAe,CAGA,IA+BA3N,EAAAmI,GAAA9O,UAAA,aAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAmV,EAAAyD,GAAA5C,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IAqCAwH,EAAAmI,GAAA9O,UAAA,YAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAmV,EAAAyD,GAAA5C,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAAe,CAGA,IA+BA3N,EAAAmI,GAAA9O,UAAA,iBAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAmV,EAAAyD,GAAA5C,EAAAhW,GACA0O,EAAA5M,KAAA2U,EAAAtB,EAAAnV,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IA4BAwH,EAAAmI,GAAA9O,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAhW,EACAmV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAmV,EAAAyD,GAAA5C,EAAAhW,GACAoX,EAAAtV,KAAA2U,EAAAtB,EAAAnV,EAAAoU,KAEA,IAyCAxN,EAAA+I,GAAA9O,UAAA,OAAA,SAAAiH,GACA,IAAA6N,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAsM,KAAAwB,SAGA,OAAAgD,GAAAxE,KAAAyB,QAAA/N,EACA,IAgBAoN,GAAAvF,GAAA9O,UAAA,UAAA,WACA,OAAAuT,KAAAwB,OACA,IAmCApO,EAAAmI,GAAA9O,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAAmI,GAAA9O,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyBA4G,EAAA+I,GAAA9O,UAAA,QAAA,SAAA0W,GACA,IAAAtX,EACA+V,EACAwB,EACAxX,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAgX,EAAA,QACA,KAAArO,GAAAoO,GAGA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,IAFAC,EAAAD,CAGA,CAGA,IAFAtX,EAAA,GACA+V,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAA6T,GAAA5C,EAAAhW,GAAAyB,YAEA,OAAAxB,EAAAwX,KAAAD,EACA,IA4BA5Q,EAAA+I,GAAA9O,UAAA,QAAA,WACA,IAAAkS,EACAkE,EACA/N,EACAE,EACApJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAgBA,OAdAgP,EAAAqB,KACAlL,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAAG,EACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2E,MACA,IAjDAT,CAkDA,IAsCAzP,EAAAmI,GAAA9O,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAlO,EACAwM,EACAC,EACAvU,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8Q,GAAAwC,GACA,MAAA,IAAAtT,UAAAiB,EAAA,0EAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAKA,IAHAtB,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,GAAA,EAAAA,IAEA,GAAAsU,IAAA0B,EADAlO,EAAA,EAAA9H,IACAuU,IAAAyB,EAAAlO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyCAwH,EAAAmI,GAAA9O,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACA3B,EACA/V,EACAD,EACAgK,EACA,IAAA2L,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAwB,UACAC,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GAAA6U,GADA7K,EAAAoN,EAAAtV,KAAA2U,EAAAmC,GAAA5C,EAAAhW,GAAAA,EAAAoU,OAEAuD,EAAA,EAAA3X,GAAAkU,GAAAlK,GACA2N,EAAA,EAAA3X,EAAA,GAAAmU,GAAAnK,OACA,KAAAkI,GAAAlI,IAAA,IAAAA,EAAAxJ,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHA2N,EAAA,EAAA3X,GAAAgK,EAAA,GACA2N,EAAA,EAAA3X,EAAA,GAAAgK,EAAA,EAGA,CAEA,OAAA/J,CACA,IAmCAuH,EAAAmI,GAAA9O,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA5O,EAEAlJ,EAEA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAAc,GAAA5C,EAAA,GACAhW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IAEA8X,EAAAF,EAAAE,EADAc,GAAA5C,EAAAhW,GACAA,EAAAoU,MAEA,OAAA0D,CACA,IAmCAtQ,EAAAmI,GAAA9O,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA8B,EACA5O,EAEAlJ,EAEA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAAc,GAAA5C,EAAA9M,EAAA,GACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IAEA8X,EAAAF,EAAAE,EADAc,GAAA5C,EAAAhW,GACAA,EAAAoU,MAEA,OAAA0D,CACA,IAmDAlR,EAAA+I,GAAA9O,UAAA,WAAA,WACA,IAAAmV,EACAW,EACAzN,EACA6O,EACA/X,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAKA,IAHAmF,EAAAkL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACAkC,EAAAnG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAA+X,EAAA/X,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA2W,EAAAX,EAAA,EAAAhW,GACAgW,EAAA,EAAAhW,GAAAgW,EAAA,EAAAlS,GACAkS,EAAA,EAAAlS,GAAA6S,EACAA,EAAAX,EAAA,EAAAhW,EAAA,GACAgW,EAAA,EAAAhW,EAAA,GAAAgW,EAAA,EAAAlS,EAAA,GACAkS,EAAA,EAAAlS,EAAA,GAAA6S,EAEA,OAAAvC,IACA,IAgEAxN,EAAA+I,GAAA9O,UAAA,OAAA,SAAAhB,GAEA,IAAAmY,EACAlQ,EACAkO,EACAW,EACAC,EACAmB,EACA/N,EACAhK,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAGA,GADAiS,EAAA5B,KAAAyB,QACA3R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAA+M,GAAAhV,GAAA,CACA,GAAAiI,GAAAsM,KAAAwB,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA8C,IAKA,OAFAkO,EADAlO,GAAA,GACAoM,GAAArU,QACAmW,EAAAlO,EAAA,GAAAqM,GAAAtU,GAEA,CACA,GAAA8V,GAAA9V,GAAA,CAEA,GAAAiI,GADAiQ,EAAAlY,EAAA+V,SACAxB,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAAAgW,QAGA/R,EAAAkS,EAAAvI,WAAA3F,EAAAtI,GAEAwY,EAAAxK,SAAAwI,EAAAxI,QAEAwK,EAAAvK,WAAA3J,GACAkU,EAAAvK,WAAAuK,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAzJ,GAAA8K,EAAAxX,QACAR,EAAA,EAAAA,EAAAgY,EAAAxX,OAAAR,IACA2W,EAAA3W,GAAAgY,EAAAhY,GAEAgY,EAAArB,CACA,CAGA,IAFA7O,GAAA,EACAhE,EAAA,EACA9D,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgW,EAAAlO,GAAAkQ,EAAAlU,GACAkS,EAAAlO,EAAA,GAAAkQ,EAAAlU,EAAA,GACAgE,GAAA,EACAhE,GAAA,CAGA,KAhCA,CAiCA,IAAAuO,GAAAxS,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAkY,EAAAlY,EAAAW,OACAR,EAAA,EAAAA,EAAA+X,EAAA/X,IACA,IAAA6U,GAAAhV,EAAAG,IAAA,CACA4W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAAiD,GACA,MAAA,IAAA5B,WAAAnR,EAAA,6GAAA+S,IAEA,GAAAjQ,EAAAiQ,EAAA,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAAnY,EAGAiE,EAAAkS,EAAAvI,WAAA3F,EAAAtI,GAEAwY,EAAAxK,SAAAwI,EAAAxI,QAEAwK,EAAAvK,WAAA3J,GACAkU,EAAAvK,WAAAuK,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAzJ,GAAA6K,GACA/X,EAAA,EAAAA,EAAA+X,EAAA/X,IACA2W,EAAA3W,GAAAgY,EAAAhY,GAEAgY,EAAArB,CACA,CAIA,IAHA7O,GAAA,EACAiQ,GAAA,EACAjU,EAAA,EACA9D,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgW,EAAAlO,GAAAkQ,EAAAlU,GACAkS,EAAAlO,EAAA,GAAAkQ,EAAAlU,EAAA,GACAgE,GAAA,EACAhE,GAAA,EAEA,MACA,CAEA,GAAAgE,EAAAiQ,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAGA,IADArO,GAAA,EACA9H,EAAA,EAAAA,EAAA+X,EAAA/X,IACAgK,EAAAnK,EAAAG,GACAgW,EAAAlO,GAAAoM,GAAAlK,GACAgM,EAAAlO,EAAA,GAAAqM,GAAAnK,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAAmI,GAAA9O,UAAA,SAAA,SAAAkW,EAAAI,GACA,IAAAc,EACAN,EACA1X,EACA6H,EACAkO,EACA9M,EACAlJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACAuW,EAAA,EACAI,EAAAjO,MACA,CACA,IAAA2I,GAAAkF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,oEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA7N,GACA,IACA6N,EAAA,GAGA,IAAA7S,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAQA,IANA+O,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAoL,IACApC,QACA7V,EAAA,EAAAA,EAAAiY,EAAAjY,IACA8H,EAAA,GAAA9H,EAAA+W,GACAY,EAAA,EAAA3X,GAAAgW,EAAAlO,GACA6P,EAAA,EAAA3X,EAAA,GAAAgW,EAAAlO,EAAA,GAEA,OAAA7H,CACA,IA+BAuH,EAAAmI,GAAA9O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,GAAA0O,EAAA5M,KAAA2U,EAAAmC,GAAA5C,EAAAhW,GAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA6EAxN,EAAA+I,GAAA9O,UAAA,QAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA9M,EACAlJ,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACAe,EAAA,GACA3W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2W,EAAA5R,KAAA6T,GAAA5C,EAAAhW,IAGA,IADA2W,EAAAwB,KAAAD,GACAlY,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAEAgW,EADAlS,EAAA,EAAA9D,GACAkU,GAAAyC,EAAA3W,IACAgW,EAAAlS,EAAA,GAAAqQ,GAAAwC,EAAA3W,IAEA,OAAAoU,IACA,IA2EA5M,EAAAmI,GAAA9O,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAhQ,EACA6O,EACA9M,EACA,IAAAyM,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACA4X,EAAA,EACAjB,EAAAjO,MACA,CACA,IAAA2I,GAAAuG,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAlP,GACA,IACAkP,EAAA,GAGA,IAAAlU,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAWA,OAVAkP,GAAAlP,GACAA,EAAA,EACA/B,EAAA6O,EAAAM,YACA8B,GAAAjB,GACAjO,EAAA,EACA/B,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,KAEA0J,EAAAiO,EAAAiB,EACAjR,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,IAEA,IAAA4U,KAAAvH,YAAAmJ,EAAAxI,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAAmI,GAAA9O,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAvY,EACA+V,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAgY,EAAA,OACA,KAAArP,GAAAkP,KAAA1F,GAAA0F,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAA1D,OAAA,EACA+X,EAAA,CAAA,MACA,KAAAjO,GAAAgO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAA6T,GAAA5C,EAAAhW,GAAAyY,eAAAD,EAAAD,IAEA,OAAAtY,EAAAwX,KAAA,IACA,IAmDA7Q,EAAA+I,GAAA9O,UAAA,cAAA,WACA,IAAA8W,EACA1X,EACAiJ,EACA8M,EACAhW,EACA8D,EACA,IAAA6R,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAMA,IAJAmF,EAAAkL,KAAAwB,QACA3V,EAAA,IAAAmU,KAAAvH,YAAA3D,GACA8M,EAAA5B,KAAAyB,QACA8B,EAAA1X,EAAA4V,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA2X,EAAA,EAAA3X,GAAAgW,EAAA,EAAAlS,GACA6T,EAAA,EAAA3X,EAAA,GAAAgW,EAAA,EAAAlS,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA+I,GAAA9O,UAAA,YAAA,SAAAqX,GACA,IAAAvB,EACAX,EACA9M,EACAlJ,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAAgQ,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACAe,EAAA,GACA3W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2W,EAAA5R,KAAA6T,GAAA5C,EAAAhW,IAGA,OADA2W,EAAAwB,KAAAD,GACA,IAAAvI,GAAAgH,EACA,IAoBA/P,EAAA+I,GAAA9O,UAAA,YAAA,WACA,IAAAZ,EACA+V,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAIA,IAFA9D,EAAA,GACA+V,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAA6T,GAAA5C,EAAAhW,GAAAyB,YAEA,OAAAxB,EAAAwX,KAAA,IACA,IA2CA7Q,EAAA+I,GAAA9O,UAAA,UAAA,WACA,IAAAoW,EACAlE,EACA7J,EACAE,EACA4M,EACAhW,EACA,IAAA2V,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAiBA,OAfAgP,EAAAqB,KACA4B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAA+Y,GAAA5C,EAAAhW,GACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2F,QACA,IAjDAzB,CAkDA,IAuCAzP,EAAAmI,GAAA9O,UAAA,QAAA,SAAA8X,EAAA9Y,GACA,IAAAmW,EACA/V,EACAiJ,EACA,IAAAyM,GAAAvB,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA8N,GAAA8G,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJAzP,EAAAkL,KAAAwB,QACA+C,EAAA,IACAA,GAAAzP,GAEAyP,EAAA,GAAAA,GAAAzP,EACA,MAAA,IAAAiN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAA9D,GAAAhV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAmW,GADA/V,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAyB,UACAA,SACA,EAAA8C,GAAAzE,GAAArU,GACAmW,EAAA,EAAA2C,EAAA,GAAAxE,GAAAtU,GACAI,CACA,IIt6FA,IAAAT,GAAA2O,GAAA3O,kBACAkW,GAAAX,KAYA,SAAA8D,GAAAhZ,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAgN,YAAAC,MACAjN,EAAAL,oBAAAA,EAEA,CASA,SAAAsZ,GAAAjZ,GACA,OAAAA,IAAA+P,EACA,CAoEA,SAAAA,KACA,IAAAnC,EACAwI,EACAD,EACA9M,EACA7H,EAGA,GADA4U,EAAA/R,UAAA1D,SACA4T,gBAAAxE,IACA,OAAA,IAAAqG,EACA,IAAArG,GAEA,IAAAqG,EACA,IAAArG,GAAA1L,UAAA,IAEA,IAAA+R,EACA,IAAArG,GAAA1L,UAAA,GAAAA,UAAA,IAEA,IAAA0L,GAAA1L,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAA+R,EACAD,EAAA,IAAA7H,GAAA,QACA,GAAA,IAAA8H,EAEA,GAAAjE,GADA3Q,EAAA6C,UAAA,IAEA8R,EAAA,IAAA7H,GAAA9M,QACA,GAAAgR,GAAAhR,GACA2U,EC9IA,SAAoBA,EAAKnO,GACxB,IAAIqB,EACAlJ,EAGJ,IADAkJ,EAAMrB,EAAIrH,OACJR,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrBgW,EAAKhW,GAAM8S,GAASjL,EAAK7H,IAE1B,OAAOgW,CACR,CDqIAE,CAAA,IAAA/H,GAAA9M,EAAAb,QAAAa,QACA,GAAAmR,GAAAnR,GACA2U,EAAA,IAAA7H,GAAA9M,OACA,KAAAiJ,GAAAjJ,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAqU,GACA,MAAA,IAAA3R,UAAAiB,EAAA,mJAAA3D,IAEA,IAAA0S,GAAA1S,EAAAkV,KACA,MAAA,IAAAxS,UAAAiB,EAAA,qHAAA3D,IAGA,IAAA0S,IADAiC,EAAA3U,EAAAkV,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,qHAAA3D,IAEA2U,EAAA,IAAA7H,GAAAiH,GAAAY,GAGA,KACA,CAEA,IAAAxD,GADAwD,EAAA9R,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAgR,IAGA,IAAAhE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,GAAA,IAAAwI,EACAD,EAAA,IAAA7H,GAAA6H,EAAAvI,OACA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAAwW,EAAAM,WAAA7I,EACA,MAAA,IAAA0I,WAAAnR,EAAA,iJAAAkE,EAAA1J,KAEAwW,EAAA,IAAA7H,GAAA6H,EAAAvI,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA4M,KAAA,UAAA4B,GACAxO,EAAA4M,KAAA,UAAA4B,EAAAxV,QAEA4T,IACA,CAeA5M,EAAAoI,GAAA,oBAAApQ,IAeAgI,EAAAoI,GAAA,OAAA,gBAmCAhJ,EAAAgJ,GAAA,QAAA,SAAA4G,GACA,IAAAC,EACAR,EACAS,EACAzW,EACA+V,EACAW,EACAlQ,EACAyC,EACAlJ,EACA,IAAA+T,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+U,GAAA1E,MACA,MAAA,IAAArQ,UAAA,sDAGA,IADAkS,EAAA/R,UAAA1D,QACA,EAAA,CAEA,IAAAuT,GADA2C,EAAAxS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA0R,IAEAT,EAAA,IACAQ,EAAAvS,UAAA,GAEA,CACA,GAAAmO,GAAAmE,GAAA,CACA,GAAAE,EAAA,CASA,IARAxN,EAAAsN,EAAAhW,OAEAiG,EADA+P,EAAA/P,KAAA+P,EAAA9P,IACAgG,EAAA,WAEAzE,EAAA,WAGA+N,GADA/V,EAAA,IAAAmU,KAAAlL,IACA2M,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA8S,GAAA4D,EAAA5U,KAAA2U,EAAAhQ,EAAA+P,EAAAxW,GAAAA,IAEA,OAAAC,CACA,CACA,OAAA,IAAAmU,KAAAoC,EACA,CACA,GAAAlM,GAAAkM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAvR,UAAAiB,EAAA,6FAAAwR,IAUA,IAPAG,EADAD,EE1SA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAIxW,EACA+J,EACAhK,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIqL,EAAGC,QACAC,MAGPvV,GAAK,EACLC,EAAI8E,KAAM+N,GAAS4D,EAAK5U,KAAM2U,EAASzM,EAAEnK,MAAOG,KAEjD,OAAOC,CACR,CF2RA4W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAIAA,GADA/V,EAAA,IAAAmU,KADAlL,EAAAyN,EAAAnW,SAEAqV,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAgW,EAAAhW,GAAA2W,EAAA3W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAAwR,GACA,IAoBAhP,EAAAoI,GAAA,MAAA,WACA,IAAA3K,EACAjF,EACA,IAAA+T,GAAAK,MACA,MAAA,IAAArQ,UAAA,6DAEA,IAAA+U,GAAA1E,MACA,MAAA,IAAArQ,UAAA,sDAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAoU,KAAAnP,EACA,IA6BA2B,EAAAgJ,GAAA/O,UAAA,MAAA,SAAAiH,GACA,IAAAkO,EACA9M,EAEA,IAAA2P,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAOA,GALAoB,EAAAkL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACA/N,EAAA,IACAA,GAAAoB,KAEApB,EAAA,GAAAA,GAAAoB,GAGA,OAAA4J,GAAAkD,EAAAlO,GACA,IAgBAoN,GAAAtF,GAAA/O,UAAA,UAAA,WACA,OAAAuT,KAAAyB,QAAArI,MACA,IAgBA0H,GAAAtF,GAAA/O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAAS,UACA,IAgBApB,GAAAtF,GAAA/O,UAAA,cAAA,WACA,OAAAuT,KAAAyB,QAAApI,UACA,IAiBA7G,EAAAgJ,GAAA/O,UAAA,oBAAA+O,GAAApQ,mBA+BAgI,EAAAoI,GAAA/O,UAAA,cAAA,SAAAiW,EAAAC,GACA,IAAA8B,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAQA,OALA,IAAAG,UAAA1D,OACA4T,KAAAyB,QAAAmB,WAAAF,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAAF,EAAAC,EAAA7S,UAAA,IAEAkQ,IACA,IAgCAxN,EAAAgJ,GAAA/O,UAAA,WAAA,WACA,IAAAkS,EACAkE,EACA/N,EACA8M,EACA5M,EACApJ,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAiBA,OAfAgP,EAAAqB,KACA4B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAA,CAAAG,EAAA8S,GAAAkD,EAAAhW,KACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAAmE,SACA,IAjDAD,CAkDA,IA4BAzP,EAAAoI,GAAA/O,UAAA,SAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,IAAA0O,EAAA5M,KAAA2U,EAAA3D,GAAAkD,EAAAhW,IAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA+BA5M,EAAAoI,GAAA/O,UAAA,QAAA,SAAAhB,EAAAkX,EAAAI,GACA,IAAAnB,EACA9M,EACA6P,EACA/Y,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA6O,GAAA/S,GACA,MAAA,IAAAkE,UAAAiB,EAAA,mEAAAnF,IAIA,GAFAmW,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAkF,GACA,MAAA,IAAAhT,UAAAiB,EAAA,qEAAA+R,IAQA,GANAA,EAAA,IACAA,GAAA7N,GACA,IACA6N,EAAA,GAGA7S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,oEAAAmS,IAEAA,EAAA,IACAA,GAAAjO,GACA,IACAiO,EAAA,GAGAA,EAAAjO,IACAiO,EAAAjO,EAEA,MACAiO,EAAAjO,CAEA,MACA6N,EAAA,EACAI,EAAAjO,EAOA,IAJA6P,EADAlZ,EACA,EAEA,EAEAG,EAAA+W,EAAA/W,EAAAmX,EAAAnX,IACAgW,EAAAhW,GAAA+Y,EAEA,OAAA3E,IACA,IAqCA5M,EAAAoI,GAAA/O,UAAA,UAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACA/V,EACAD,EACAgK,EAEA,IAAA6O,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAsH,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAgK,EAAA8I,GAAAkD,EAAAhW,IACA0O,EAAA5M,KAAA2U,EAAAzM,EAAAhK,EAAAoU,OACAnU,EAAA8E,KAAAiF,GAGA,OAAA,IAAAoK,KAAAvH,YAAA5M,EACA,IA4BAuH,EAAAoI,GAAA/O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhM,EACAhK,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAgK,EAAA8I,GAAAkD,EAAAhW,IACA0O,EAAA5M,KAAA2U,EAAAzM,EAAAhK,EAAAoU,MACA,OAAApK,CAGA,IA4BAxC,EAAAoI,GAAA/O,UAAA,aAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhM,EACAhK,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IAEA,GADAgK,EAAA8I,GAAAkD,EAAAhW,IACA0O,EAAA5M,KAAA2U,EAAAzM,EAAAhK,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IA4BAwH,EAAAoI,GAAA/O,UAAA,YAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhM,EACAhK,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAgK,EAAA8I,GAAAkD,EAAAhW,IACA0O,EAAA5M,KAAA2U,EAAAzM,EAAAhK,EAAAoU,MACA,OAAApK,CAGA,IA4BAxC,EAAAoI,GAAA/O,UAAA,iBAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhM,EACAhK,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAAoU,KAAAwB,QAAA,EAAA5V,GAAA,EAAAA,IAEA,GADAgK,EAAA8I,GAAAkD,EAAAhW,IACA0O,EAAA5M,KAAA2U,EAAAzM,EAAAhK,EAAAoU,MACA,OAAApU,EAGA,OAAA,CACA,IA0BAwH,EAAAoI,GAAA/O,UAAA,WAAA,SAAAuW,EAAAX,GACA,IAAAT,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAAiB,EAAA,oEAAAoS,IAGA,IADApB,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAoX,EAAAtV,KAAA2U,EAAA3D,GAAAkD,EAAAhW,IAAAA,EAAAoU,KAEA,IA2BAxN,EAAAgJ,GAAA/O,UAAA,OAAA,SAAAiH,GACA,IAAA+Q,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAsM,KAAAwB,SAGA,OAAA9C,GAAAsB,KAAAyB,QAAA/N,GACA,IA8BAN,EAAAoI,GAAA/O,UAAA,YAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA6O,GAAAyE,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IACA,GAAAqX,IAAAvE,GAAAkD,EAAAhW,IACA,OAAA,EAGA,OAAA,CACA,IAiCAwH,EAAAoI,GAAA/O,UAAA,WAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA6O,GAAAyE,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,EAAAoU,KAAAwB,QAAA5V,IACA,GAAAqX,IAAAvE,GAAAkD,EAAAhW,IACA,OAAAA,EAGA,OAAA,CACA,IA0BA4G,EAAAgJ,GAAA/O,UAAA,QAAA,SAAA0W,GACA,IAAAvB,EACA/V,EACAD,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,GAAAG,UAAA1D,OAAA,GACA,IAAA2I,GAAAoO,GACA,MAAA,IAAAxT,UAAAiB,EAAA,kEAAAuS,SAGAA,EAAA,IAIA,IAFAvB,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAgW,EAAAhW,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAAwX,KAAAF,EACA,IA4BA3Q,EAAAgJ,GAAA/O,UAAA,QAAA,WACA,IAAAkS,EACAkE,EACA/N,EACAE,EACApJ,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAgBA,OAdAgP,EAAAqB,KACAlL,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAAG,EACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2E,MACA,IAjDAT,CAkDA,IAiCAzP,EAAAoI,GAAA/O,UAAA,eAAA,SAAAwW,EAAAC,GACA,IAAAtB,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA6O,GAAAyE,GACA,MAAA,IAAAtT,UAAAiB,EAAA,mEAAAqS,IAEA,GAAAnT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAyF,GACA,MAAA,IAAAvT,UAAAiB,EAAA,qEAAAsS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAGA,IADAI,EAAA5B,KAAAyB,QACA7V,EAAAsX,EAAAtX,GAAA,EAAAA,IACA,GAAAqX,IAAAvE,GAAAkD,EAAAhW,IACA,OAAAA,EAGA,OAAA,CACA,IAgBAkV,GAAAtF,GAAA/O,UAAA,UAAA,WACA,OAAAuT,KAAAwB,OACA,IAqCApO,EAAAoI,GAAA/O,UAAA,OAAA,SAAAuW,EAAAX,GACA,IAAAkB,EACA1X,EACA+V,EACAhW,EACA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAAqD,GACA,MAAA,IAAArT,UAAA,oEAAAqT,GAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAwB,UACAC,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA2X,EAAA3X,GAAA8S,GAAAsE,EAAAtV,KAAA2U,EAAA3D,GAAAkD,EAAAhW,IAAAA,EAAAoU,OAEA,OAAAnU,CACA,IA+BAuH,EAAAoI,GAAA/O,UAAA,UAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA9M,EACA4O,EACA9X,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAAhF,GAAAkD,EAAA,IACAhW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IACA8X,EAAAF,EAAAE,EAAAhF,GAAAkD,EAAAhW,IAAAA,EAAAoU,MAEA,OAAA0D,CACA,IA+BAtQ,EAAAoI,GAAA/O,UAAA,eAAA,SAAA+W,EAAAC,GACA,IAAA7B,EACA9M,EACA4O,EACA9X,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAA6D,GACA,MAAA,IAAA7T,UAAAiB,EAAA,oEAAA4S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA1R,UAAA1D,OAAA,EACAsX,EAAAD,EACA7X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAsW,EAAAhF,GAAAkD,EAAA9M,EAAA,IACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IACA8X,EAAAF,EAAAE,EAAAhF,GAAAkD,EAAAhW,IAAAA,EAAAoU,MAEA,OAAA0D,CACA,IA8BAlR,EAAAgJ,GAAA/O,UAAA,WAAA,WACA,IAAAmV,EACAW,EACAzN,EACA6O,EACA/X,EACA8D,EAEA,IAAA+U,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAKA,IAHAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACAmC,EAAAnG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAA+X,EAAA/X,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA2W,EAAAX,EAAAhW,GACAgW,EAAAhW,GAAAgW,EAAAlS,GACAkS,EAAAlS,GAAA6S,EAEA,OAAAvC,IACA,IA+CAxN,EAAAgJ,GAAA/O,UAAA,OAAA,SAAAhB,GACA,IAAAmY,EACAlQ,EACAkO,EACAW,EACAoB,EACA/X,EACA8D,EACA,IAAA+U,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAGA,GADAiS,EAAA5B,KAAAyB,QACA3R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAAuK,GAAAxS,GAAA,CAEA,GAAAiI,GADAiQ,EAAAlY,EAAAW,QACA4T,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FASA,GANA6B,EADAa,GAAAhZ,GACAA,EAAAgW,QAEAhW,EAGAiE,EAAAkS,EAAAvI,WAAA3F,EAAAtI,GAEAwY,EAAAxK,SAAAwI,EAAAxI,QAEAwK,EAAAvK,WAAA3J,GACAkU,EAAAvK,WAAAuK,EAAA1B,WAAAxS,EAEA,CAGA,IADA6S,EAAA,IAAAxI,GAAA6J,EAAAxX,QACAR,EAAA,EAAAA,EAAAgY,EAAAxX,OAAAR,IACA2W,EAAA3W,GAAAgY,EAAAhY,GAEAgY,EAAArB,CACA,CACA,IAAA3W,EAAA,EAAAA,EAAA+X,EAAAjQ,IAAA9H,IACAgW,EAAAlO,GAAAkQ,EAAAhY,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAA8H,GAAAsM,KAAAwB,QACA,MAAA,IAAAO,WAAAnR,EAAA,kEAAA8C,IAEAkO,EAAAlO,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDAN,EAAAoI,GAAA/O,UAAA,SAAA,SAAAuX,EAAAjB,GACA,IAAAc,EACAN,EACA1X,EACA+V,EACA9M,EACAlJ,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACA4X,EAAA,EACAjB,EAAAjO,MACA,CACA,IAAA2I,GAAAuG,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAlP,GACA,IACAkP,EAAA,GAGA,IAAAlU,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAQA,IANA+O,EADAG,EAAAjB,EACAA,EAAAiB,EAEA,EAGAT,GADA1X,EAAA,IAAAmU,KAAAvH,YAAAoL,IACApC,QACA7V,EAAA,EAAAA,EAAAiY,EAAAjY,IACA2X,EAAA3X,GAAAgW,EAAAhW,EAAAoY,GAEA,OAAAnY,CACA,IA4BAuH,EAAAoI,GAAA/O,UAAA,QAAA,SAAA6N,EAAA+H,GACA,IAAAT,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAAgQ,GAAArF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAsH,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACA,GAAA0O,EAAA5M,KAAA2U,EAAA3D,GAAAkD,EAAAhW,IAAAA,EAAAoU,MACA,OAAA,EAGA,OAAA,CACA,IA4CAxN,EAAAgJ,GAAA/O,UAAA,QAAA,SAAAqX,GACA,IAAAlC,EAEA,IAAA6C,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAGA,GADAiS,EAAA5B,KAAAyB,QACA,IAAA3R,UAAA1D,OAEA,OADAwV,EAAAmC,OACA/D,KAEA,IAAAL,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAGA,OADAlC,EAAAmC,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAApF,GAAAkG,GAAAlG,GAAAmG,GACA,IAZA7E,IAaA,IAgDA5M,EAAAoI,GAAA/O,UAAA,YAAA,SAAAuX,EAAAjB,GACA,IAAAhQ,EACA6O,EACA9M,EAEA,IAAA2P,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAIA,GAFAiS,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QACA,IAAA1R,UAAA1D,OACA4X,EAAA,EACAjB,EAAAjO,MACA,CACA,IAAA2I,GAAAuG,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAQA,GANAA,EAAA,IACAA,GAAAlP,GACA,IACAkP,EAAA,GAGA,IAAAlU,UAAA1D,OACA2W,EAAAjO,MACA,CACA,IAAA2I,GAAAsF,GACA,MAAA,IAAApT,UAAAiB,EAAA,qEAAAmS,IAEAA,EAAA,GACAA,GAAAjO,GACA,IACAiO,EAAA,GAEAA,EAAAjO,IACAiO,EAAAjO,EAEA,CACA,CAWA,OAVAkP,GAAAlP,GACAA,EAAA,EACA/B,EAAA6O,EAAAM,YACA8B,GAAAjB,GACAjO,EAAA,EACA/B,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,KAEA0J,EAAAiO,EAAAiB,EACAjR,EAAA6O,EAAAvI,WAAA2K,EAAA5Y,IAEA,IAAA4U,KAAAvH,YAAAmJ,EAAAxI,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAyBA1B,EAAAoI,GAAA/O,UAAA,kBAAA,SAAAwX,EAAAC,GACA,IAAAC,EACAC,EACAvY,EACA+V,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,GAAA,IAAAG,UAAA1D,OACAgY,EAAA,OACA,KAAArP,GAAAkP,KAAA1F,GAAA0F,GAGA,MAAA,IAAAtU,UAAAiB,EAAA,yFAAAqT,IAFAG,EAAAH,CAGA,CACA,GAAAnU,UAAA1D,OAAA,EACA+X,EAAA,CAAA,MACA,KAAAjO,GAAAgO,GAGA,MAAA,IAAAvU,UAAAiB,EAAA,qEAAAsT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA5V,EAAA,GACAD,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAC,EAAA8E,KAAA+N,GAAAkD,EAAAhW,IAAAyY,eAAAD,EAAAD,IAEA,OAAAtY,EAAAwX,KAAA,IACA,IA8BA7Q,EAAAgJ,GAAA/O,UAAA,cAAA,WACA,IAAA8W,EACA1X,EACAiJ,EACA8M,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAMA,IAJAmF,EAAAkL,KAAAwB,QACA3V,EAAA,IAAAmU,KAAAvH,YAAA3D,GACA8M,EAAA5B,KAAAyB,QACA8B,EAAA1X,EAAA4V,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2X,EAAA3X,GAAAgW,EAAA9M,EAAAlJ,EAAA,GAEA,OAAAC,CACA,IA6CA2G,EAAAgJ,GAAA/O,UAAA,YAAA,SAAAqX,GACA,IAAAP,EACA1X,EACAiJ,EACA8M,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAMA,IAJAmF,EAAAkL,KAAAwB,QACA3V,EAAA,IAAAmU,KAAAvH,YAAA3D,GACA8M,EAAA5B,KAAAyB,QACA8B,EAAA1X,EAAA4V,QACA7V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA2X,EAAA3X,GAAAgW,EAAAhW,GAEA,GAAA,IAAAkE,UAAA1D,OAEA,OADAmX,EAAAQ,OACAlY,EAEA,IAAA8T,GAAAmE,GACA,MAAA,IAAAnU,UAAAiB,EAAA,oEAAAkT,IAGA,OADAP,EAAAQ,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAApF,GAAAkG,GAAAlG,GAAAmG,GACA,IAZAhZ,CAaA,IAqBA2G,EAAAgJ,GAAA/O,UAAA,YAAA,WACA,IAAAZ,EACA+V,EACAhW,EACA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAIA,IAFA9D,EAAA,GACA+V,EAAA5B,KAAAyB,QACA7V,EAAA,EAAAA,EAAAoU,KAAAwB,QAAA5V,IACAgW,EAAAhW,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAAwX,KAAA,IACA,IA4BA7Q,EAAAgJ,GAAA/O,UAAA,UAAA,WACA,IAAAoW,EACAlE,EACA7J,EACAE,EACA4M,EACAhW,EAEA,IAAA6Y,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAiBA,OAfAgP,EAAAqB,KACA4B,EAAA5B,KAAAyB,QACA3M,EAAAkL,KAAAwB,QAGA5V,GAAA,EAIAwH,EADAyP,EAAA,CAAA,EACA,QAcA,WAEA,OADAjX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,CACAqM,MAAA,GAGA,CACA1V,MAAAiT,GAAAkD,EAAAhW,IACAuV,MAAA,EAEA,IAxBA/N,EAAAyP,EAAA,UAiCA,SAAApX,GAEA,OADAuJ,GAAA,EACAlF,UAAA1D,OACA,CACAX,MAAAA,EACA0V,MAAA,GAGA,CACAA,MAAA,EAEA,IA1CAgB,IACA/O,EAAAyP,EAAAV,IAiDA,WACA,OAAAxD,EAAA2F,QACA,IAjDAzB,CAkDA,IA6BAzP,EAAAoI,GAAA/O,UAAA,QAAA,SAAA8X,EAAA9Y,GACA,IACAI,EACAiJ,EAEA,IAAA2P,GAAAzE,MACA,MAAA,IAAArQ,UAAA,sDAEA,IAAA8N,GAAA8G,GACA,MAAA,IAAA5U,UAAAiB,EAAA,oEAAA2T,IAMA,GAJAzP,EAAAkL,KAAAwB,QACA+C,EAAA,IACAA,GAAAzP,GAEAyP,EAAA,GAAAA,GAAAzP,EACA,MAAA,IAAAiN,WAAAnR,EAAA,kEAAA2T,IAEA,IAAA/F,GAAA/S,GACA,MAAA,IAAAkE,UAAAiB,EAAA,oEAAAnF,IASA,OAPAI,EAAA,IAAAmU,KAAAvH,YAAAuH,KAAAyB,UACAA,QAEA8C,GADA9Y,EACA,EAEA,EAEAI,CACA,IG/4EA,IAAIiZ,GAAQ,CACXhM,GACAS,GACA0B,GACAG,GACAJ,GACAG,GACAD,GACAnB,GACAsB,GACAC,GACAC,GACAC,IC5BGuJ,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAO3Y,OCqBpB,SAAS6Y,GAAkBpQ,GAC1B,IAAI8C,EDJL,SAAgBlM,GACf,IAAIG,EACJ,GAAKkD,GAASrD,GACb,MAAO,UAER,GAAK+O,GAAU/O,GACd,OAAO,KAER,IAAMG,EAAI,EAAGA,EAAIoZ,GAAQpZ,IACxB,GAAKH,aAAiBqZ,GAAOlZ,GAC5B,OAAOmZ,GAAQnZ,GAIjB,OAAOsZ,GAAYrK,GAAiBpP,KAAa,IAClD,CCXUqI,CAAOe,GAChB,OAAKvB,EAAiBuB,GACd,CACN+C,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZC,EAAgBX,GAChBY,EAAgBZ,KAIZ,CACNC,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZxE,EAAQ8D,GACR3D,EAAQ2D,IAGX,CCrDA,IAAIwN,GAAI,ECMJA,GAAI,EAqBR,SAASC,GAAOzB,EAAG0B,EAAOxQ,EAAGyQ,EAAQvS,GACpC,IAAIwS,EACAC,EACAxO,EACApL,EAEJ,GAAK+X,GAAK,GAAe,IAAV0B,EACd,OAAOxQ,EAGR,IADAmC,EAAIiO,GAAkBpQ,IACfuD,iBAEN,ODbF,SAAgBuL,EAAG0B,EAAOxQ,EAAGyQ,EAAQvS,GACpC,IAAI0E,EACAgO,EACAC,EACAH,EACAC,EACA5Z,EAOJ,GALA6L,EAAO5C,EAAE+C,KACT6N,EAAO5Q,EAAEwD,UAAW,GACpBqN,EAAO7Q,EAAEwD,UAAW,GAEpBkN,EAAKxS,EACW,IAAXuS,EAEJ,OADAI,EAAMjO,EAAM8N,EAAIE,EAAMhO,EAAM8N,GAAO5B,EAAI0B,GAChCxQ,EAIR,GAAgB,IAAXyQ,EAAe,CAInB,IAHAE,EAAI7B,EAAIwB,IAGC,EACR,IAAMvZ,EAAI,EAAGA,EAAI4Z,EAAG5Z,IACnB8Z,EAAMjO,EAAM8N,EAAIE,EAAMhO,EAAM8N,GAAOF,GACnCE,GAAMD,EAGR,GAAK3B,EAAIwB,GACR,OAAOtQ,EAER,IAAMjJ,EAAI4Z,EAAG5Z,EAAI+X,EAAG/X,GAAKuZ,GACxBO,EAAMjO,EAAM8N,EAAIE,EAAMhO,EAAM8N,GAAOF,GACnCK,EAAMjO,EAAM8N,EAAG,EAAGE,EAAMhO,EAAM8N,EAAG,GAAMF,GACvCK,EAAMjO,EAAM8N,EAAG,EAAGE,EAAMhO,EAAM8N,EAAG,GAAMF,GACvCK,EAAMjO,EAAM8N,EAAG,EAAGE,EAAMhO,EAAM8N,EAAG,GAAMF,GACvCK,EAAMjO,EAAM8N,EAAG,EAAGE,EAAMhO,EAAM8N,EAAG,GAAMF,GACvCE,GAAMJ,GAEP,OAAOtQ,CACP,CACD,IAAMjJ,EAAI,EAAGA,EAAI+X,EAAG/X,IACnB8Z,EAAMjO,EAAM8N,EAAIE,EAAMhO,EAAM8N,GAAOF,GACnCE,GAAMD,CAGR,CCnCEjN,CAAWsL,EAAG0B,EAAOrO,EAAGsO,EAAQvS,GACzB8B,EAIR,GADA0Q,EAAKxS,EACW,IAAXuS,EAEJ,OADAzQ,EAAG0Q,IAAQF,EAAQ1B,EACZ9O,EAIR,GAAgB,IAAXyQ,EAAe,CAInB,IAHAE,EAAI7B,EAAIwB,IAGC,EACR,IAAMvZ,EAAI,EAAGA,EAAI4Z,EAAG5Z,IACnBiJ,EAAG0Q,IAAQF,EACXE,GAAMD,EAGR,GAAK3B,EAAIwB,GACR,OAAOtQ,EAER,IAAMjJ,EAAI4Z,EAAG5Z,EAAI+X,EAAG/X,GAAKuZ,GACxBtQ,EAAG0Q,IAAQF,EACXxQ,EAAG0Q,EAAG,IAAOF,EACbxQ,EAAG0Q,EAAG,IAAOF,EACbxQ,EAAG0Q,EAAG,IAAOF,EACbxQ,EAAG0Q,EAAG,IAAOF,EACbE,GAAMJ,GAEP,OAAOtQ,CACP,CACD,IAAMjJ,EAAI,EAAGA,EAAI+X,EAAG/X,IACnBiJ,EAAG0Q,IAAQF,EACXE,GAAMD,EAEP,OAAOzQ,CACR,CCxDA,SAASuQ,GAAOzB,EAAG0B,EAAOxQ,EAAGyQ,GAC5B,OAAOK,GAAShC,EAAG0B,EAAOxQ,EAAGyQ,ECX9B,SAAwB3B,EAAG2B,GAC1B,OAAKA,EAAS,EACN,GAEC,EAAI3B,GAAM2B,CACpB,CDMsCM,CAAejC,EAAG2B,GACxD,CEbA,SAASO,GAAQla,GAChB,IAAI8H,EACA7H,EAGJ,GADA6H,EAAM,GACD9H,GAAK,EACT,OAAO8H,EAER,IAAM7H,EAAI,EAAGA,EAAID,EAAGC,IACnB6H,EAAI9C,KAAM/E,GAEX,OAAO6H,CACR,CCiDA,SAASqS,GAASja,EAAK+L,EAAM0N,EAAQvS,GACpC,IAAI6C,EACAzC,EACAvH,EAKJ,IAHAuH,EAAa,EAATmS,EACJ1Z,EAAa,EAATmH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIgM,EAAKxL,QAC1BwL,EAAMhM,GAAMgK,EACZgC,EAAMhM,EAAE,GAAM,EACdA,GAAKuH,EACLyC,GAAK,EAEN,OAAO/J,CACR,CC9CA,SAASka,GAAWpP,EAAIqP,GACvB,IAAItS,EAYJ,OATAA,EAAMmS,GAAQlP,EAAGvK,QChBlB,SAAmByI,EAAGoR,GACrB,IAAIC,EAEAX,EACAY,EACAC,EACAC,EACAC,EACAC,EACAC,EACA5a,EAMJ,IAJA2Z,EAAK,EACLY,EAAK,EAGCva,EAAI,EAAGA,EAAIiJ,EAAEzI,OAAQR,IAAM,CAUhC,IARAsa,GADAI,EAAKzR,EAAG0Q,IACK,GAAOe,EAAKA,EAEzBC,EAAKN,EAAGE,GAERC,EAAKb,EAAK,EACVc,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAK3R,EAAGuR,IACK,GAAOI,EAAKA,IACbN,IAGZrR,EAAGuR,EAAG,GAAMI,EACZP,EAAGI,EAAG,GAAMJ,EAAGI,GACfD,GAAM,EACNC,GAAM,EAEPxR,EAAGuR,EAAG,GAAME,EACZL,EAAGI,EAAG,GAAME,EACZhB,GAAM,EACNY,GAAM,CACN,CACF,CDtBCM,CADAT,EAAKpR,GAAMoR,GACGtS,GAKP,CACNiD,GAHDA,EErCD,SAAe9B,EAAG6R,GACjB,IAAI7a,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAI8a,EAAQta,OAAQR,IAChCC,EAAI8E,KAAMkE,EAAG6R,EAAS9a,KAEvB,OAAOC,CACR,CF4BM8a,CAAMhQ,EAAIjD,GAIdsS,GAAMA,EACNtS,IAAOA,EAET,CGvCA,SAASkT,GAAmBnb,GAC3B,OACCgS,GAAWhS,IACXA,EAAQ,CAEV,CCLA,SAASmb,GAAmBnb,GAC3B,OACCgS,GAAWhS,IACXA,EAAMsK,UAAY,CAEpB,CCYA,SAAS6Q,GAAmBnb,GAC3B,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CClBA,SAAS6X,GAAM7X,GACd,OAAOH,OAAOgY,KAAMhY,OAAQG,GAC7B,CCOA2H,EAAA/H,GAAA,UAAAsa,ICAAvS,EAAA/H,GAAA,UT8HA,SAAiBQ,EAAKyZ,EAAQvS,GAC7B,IAAIjB,EAAMmT,GAAkBpZ,GAC5B,OAAKiG,EAAIsG,iBAEW,eAAdtG,EAAIgC,MACDgS,GAASja,EAAKoW,GAAgBpW,EAAK,GAAKyZ,EAAQvS,GAErC,cAAdjB,EAAIgC,MACDgS,GAASja,EAAKmW,GAAenW,EAAK,GAAKyZ,EAAQvS,GAlDzD,SAAoBlH,EAAKyZ,EAAQvS,GAChC,IAAI6E,EACAtF,EACAsD,EACAhK,EAOJ,IALAgM,EAAO/L,EAAI+L,KACXtF,EAAMzG,EAAIwM,UAAW,GAErBzM,EAAImH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIgM,EAAKxL,QAC1BkG,EAAKsF,EAAMhM,EAAGgK,GACdhK,GAAK0Z,EACL1P,GAAK,EAEN,OAAOgC,CACR,CAmCSS,CAAWvG,EAAKwT,EAAQvS,GAzIjC,SAAkBlH,EAAKyZ,EAAQvS,GAC9B,IAAI6C,EACAhK,EAIJ,IAFAA,EAAImH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIC,EAAIO,QACzBP,EAAKD,GAAMgK,EACXhK,GAAK0Z,EACL1P,GAAK,EAEN,OAAO/J,CACR,CA+HQgb,CAAShb,EAAKyZ,EAAQvS,EAC9B,IUtHAK,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICnDA,ICKIwB,GDLAA,QAAgC,IAAhBpM,OAAOgY,KEwB3B,SAASwD,GAAarb,GACrB,MAAkC,uBAAzBiK,GAAajK,EACvB,CDCIsb,GAPJ,WACC,OAAOD,GAAahX,UACrB,CAKOkX,GAKP,IAAAC,GAAevP,GElBf,SAAS1I,GAAO6F,GACf,OAASA,GAAMA,CAChB,CCQA,SAAS7F,GAAOvD,GACf,OACCD,GAAUC,IACVyb,GAAOzb,EAET,CCTA,SAASuD,GAAOvD,GACf,OACCD,GAAUC,IACVyb,GAAOzb,EAAMsK,UAEf,CCGA,SAAS/G,GAAOvD,GACf,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCoBA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICzBA,IAAIiR,GAAuB7b,OAAOmB,UAAU2a,qBCE5CC,IAXSC,GAAO5Z,KAAM,OAAQ,KCe9B,SAASyZ,GAAsB1b,EAAO8J,GACrC,IAAImC,EACJ,OACCjM,YAKDiM,EAAO4P,GAAO5Z,KAAMjC,EAAO8J,KACb8R,IAAoBtS,GAAUtJ,IAIzCuD,GAFFuG,GAAYA,IAGXkI,GAAWlI,IACXA,GAAY,GACZA,EAAW9J,EAAMW,OAGZsL,EACR,CChBA,IAAA6P,GATKN,GACU5b,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNqD,GAASrD,IACc,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,IAChBzI,GAAY7J,EAAO,YAClB0b,GAAsB1b,EAAO,SAEhC,EClCIgF,GAAQ1B,MAAMtC,UAAUgE,MCCxBiH,GAAOyP,ICFX,WAEA,GDAuC,aEMnCzP,IAAQyP,GARF,CACT9Z,SAAY,MAO0B,YCiDvC,SAASwC,GAAS4D,EAAKwP,EAAeC,GACrC,IAAIpO,EACAlJ,EACJ,IAAMqS,GAAcxK,KAAUsB,GAAUtB,GACvC,MAAM,IAAI9D,UAAWiB,EAAQ,8EAA+E6C,IAG7G,GAAa,KADbqB,EAAMrB,EAAIrH,QAET,OAAQ,EAET,GAA0B,IAArB0D,UAAU1D,OAAe,CAC7B,IAAMqR,GAAWyF,GAChB,MAAM,IAAIvT,UAAWiB,EAAQ,oEAAqEsS,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAapO,EACjB,OAAQ,EAETlJ,EAAIsX,CACP,MACGtX,EAAIkJ,EAAMoO,GACD,IACRtX,EAAI,EAGR,MACEA,EAAI,EAGL,GAAKoD,GAAOiU,IACX,KAAQrX,EAAIkJ,EAAKlJ,IAChB,GAAKoD,GAAOyE,EAAI7H,IACf,OAAOA,OAIT,KAAQA,EAAIkJ,EAAKlJ,IAChB,GAAK6H,EAAK7H,KAAQqX,EACjB,OAAOrX,EAIV,OAAQ,CACT,CClGA,SAAS4b,GAAwB/b,GAChC,OAASA,EAAMgN,aAAehN,EAAMgN,YAAYhM,YAAchB,CAC/D,KCiBI6X,2PC1BAmE,GAAwB,oBAAX7I,YAA2B,EAASA,OCqDrD8I,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlB/H,GAAQgI,IACZ,OAAO,EAER,IAAMD,KAAKC,GACV,KAEmC,IAAjC/X,GAASgY,GAAeF,IACxBrS,GAAYsS,GAAKD,IACJ,OAAbC,GAAKD,IACkB,WAAvB/H,GAAQgI,GAAKD,KAEbH,GAAwBI,GAAKD,GAE9B,CAAC,MAAQhW,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKOmW,GChDHpQ,GAA2B,oBAAXkH,wHH+BlB0E,GAJGyE,GIhBL,WACC,OAA8C,KAArCzE,GAAMxT,YAAe,IAAK1D,MACpC,CAgBQ4J,CAAM,EAAG,GVFjB,SAAevK,GACd,OAAKqb,GAAarb,GACVoG,GAASpB,GAAM/C,KAAMjC,IAEtBoG,GAASpG,EACjB,EMDSoG,GKJT,SAAepG,GACd,IAAIuc,EACAC,EACAC,EACArc,EACA8b,EACAQ,EACAvc,EAGJ,GADAC,EAAM,GACDib,GAAarb,GAAU,CAE3B,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,YAGb,OAAOxB,CACP,CACD,GAAsB,iBAAVJ,GAEX,GAAKA,EAAMW,OAAS,IAAMkJ,GAAY7J,EAAO,KAC5C,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,gBAGR,CAEN,GAAe,IADf6a,EAA2B,mBAAVzc,KACQ8O,GAAc9O,GACtC,OAAOI,EAERoc,EAAkBG,IAAsBF,CACxC,CACD,IAAMP,KAAKlc,EACFwc,GAAuB,cAANN,IAAuBrS,GAAY7J,EAAOkc,IAClE9b,EAAI8E,KAAMnE,OAAQmb,IAGpB,GAAKU,GAEJ,IADAL,ECnDF,SAAkBvc,GACjB,IAAoB,IAAf6c,KAAyBZ,GAC7B,OAAOF,GAAwB/b,GAEhC,IACC,OAAO+b,GAAwB/b,EAC/B,CAAC,MAAQ8c,GACT,OAAO,CACP,CACF,CD0CoBf,CAAwB/b,GACpCG,EAAI,EAAGA,EAAI4c,GAAepc,OAAQR,IACvCuc,EAAIK,GAAgB5c,GACZoc,GAAyB,gBAANG,IAAyB7S,GAAY7J,EAAO0c,IACtEtc,EAAI8E,KAAMnE,OAAQ2b,IAIrB,OAAOtc,CACR,ELlCA,IOjCI4c,GPiCJpd,GAAeiY,GQVXoF,GAAMpd,OC9BNmd,GAAWnd,OAAOqd,eFSrBF,GADI9I,GAAYrU,OAAOqd,gBACZ9W,GGKZ,SAAyBC,GACxB,IAAI8W,ECVL,SAAmB9W,GAElB,OAAOA,EAAIM,SACZ,CDOaqW,CAAU3W,GACtB,OAAK8W,GAAmB,OAAVA,EACNA,EAEgC,sBAAnClT,GAAa5D,EAAI2G,aAEd3G,EAAI2G,YAAYhM,UAEnBqF,aAAexG,GACZA,GAAOmB,UAGR,IACR,EHXA,IAAAoc,GAAeJ,GKRXK,GAAkBxd,OAAOmB,UAyC7B,SAASsc,GAAetd,GACvB,IAAImd,EAGJ,QAAM1S,GAAUzK,KAIhBmd,EC1CD,SAAyBnd,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAETgd,GAAUhd,GAClB,CD+BSkd,CAAgBld,IAClBmd,IAMJtT,GAAY7J,EAAO,gBAGpB6J,GAAYsT,EAAO,gBACnBjJ,GAAYiJ,EAAMnQ,cACmB,sBAArC/C,GAAakT,EAAMnQ,cAGnBnD,GAAYsT,EAAO,kBACnBjJ,GAAYiJ,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmBhX,GAClB,IAAImX,EAGJ,IAAMA,KAAOnX,EACZ,IAAMwD,GAAYxD,EAAKmX,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUzd,IAGb,CE7EA,IAAI0d,GCwCJ,SAAiBrX,EAAKqS,GACrB,IACIb,EACAxO,EACAmU,EACAtE,EACA9Y,EACA+J,EACAhK,EAPAwd,GAAa,EAQjB,IAAM7O,GAAczI,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAU1D,OAAS,EAAI,CAC3B,IAAM8J,GAAUiO,GACf,MAAM,IAAIxU,UAAWiB,EAAQ,qEAAsEuT,IAEpG,GAAK7O,GAAY6O,EAAM,gBAEhB3F,GADN4K,EAAajF,EAAKkF,YAEjB,MAAM,IAAI1Z,UAAWiB,EAAQ,+DAAgE,aAAcwY,GAG7G,CAID,GAFAtU,GADAwO,EAAOgG,GAAYxX,IACR1F,OACXP,EAAM,CAAA,EACDud,EACJ,IAAMxd,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAGf0J,GAAYzJ,EADlB8Y,EAAM7S,EADNmX,EAAM3F,EAAM1X,MAMZgK,EAAI/J,EAAK8Y,GACJ7V,GAAS8G,GACb/J,EAAK8Y,GAAMhU,KAAMsY,GAEjBpd,EAAK8Y,GAAQ,CAAE/O,EAAGqT,IAPlBpd,EAAK8Y,GAAQsE,OAWf,IAAMrd,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErBC,EAAKiG,EADLmX,EAAM3F,EAAM1X,KACQqd,EAGtB,OAAOpd,CACR,CDxFW0d,CEWH,CAEN7R,KAAQ,EAGRrD,KAAQ,EACRG,MAAS,EACTC,OAAU,EACVL,MAAS,EACTG,OAAU,EACVJ,MAAS,EACTG,OAAU,EACVkV,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEXxV,QAAW,GACXD,QAAW,GAIX0V,UAAa,GACbhW,UAAa,GACbH,WAAc,GAGdoW,OAAU,GAGVlV,QAAW,GAGXmV,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCT,YAAc,0OG6Bf,SAASU,GAAiBjW,GACzB,IAAI8B,EACJ,OAAKb,GAAUjB,GACP1I,GAAmB0I,IAAW,KAEjCtI,GAAUsI,GACP1I,GHdT,SAAmB0I,GAClB,IAAI8B,EAAIuT,GAAMrV,GACd,OAASiB,GAAUa,GAAQA,EAAI,IAChC,CGW4BoU,CAAUlW,KAAa,KAE7CA,GAEC8S,GADLhR,EAAI9B,EAAMoO,YAEFtM,EAGF,IACR,CCpDA,IAAIqU,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCU3B,SAASC,GAAkBC,GAC1B,OCAD,SAAoBC,GACnB,IAAIpX,EACA4B,EACAyV,EACA3e,EAGJ,IADAkJ,EAAMwV,EAAOle,SACD,EACX,OAAO6d,GAASE,uBAGjB,GAAa,QADbjX,EAAM6W,GAAiBO,EAAQ,KAE9B,OAAOL,GAASE,uBAGjB,IAAMve,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,GAAY,QADZ2e,EAAKR,GAAiBO,EAAQ1e,KAE7B,OAAOqe,GAASE,uBAEZI,EAAKrX,IACTA,EAAMqX,EAEP,CAED,OADAA,EAAON,GAASC,oBAAoBhX,EAAM,GAC5B,EAAMqX,EAAK,CAC1B,CD1BQC,CAAW,CAAEH,GACrB,CEWA,SAASI,GAAW5X,EAAOC,EAASC,EAAQsD,EAAO3C,EAAKgX,GACvD,IAAI1X,EACA8B,EACA6V,EACAxX,EACAvH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACd0I,EAAM,EACAlJ,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBkJ,GAAOjC,EAAOjH,GAEf,GAAc,UAAT8e,EACChX,EAAM,EACVA,EAAM,EACKA,GAAOoB,IAClBpB,EAAMoB,EAAM,QAEP,GAAc,SAAT4V,EACNhX,EAAM,GACVA,GAAOoB,GACI,GAEG,IADbpB,GAAOoB,KAENpB,GAAOoB,GAGEpB,GAAOoB,IAClBpB,GAAOoB,IACKA,IACXpB,GAAOoB,QAOT,GAHc,cAAT4V,GAAwBhX,EAAM,IAClCA,GAAOoB,GAEHpB,EAAM,GAAKA,GAAOoB,EACtB,MAAM,IAAIiN,WAAYnR,EAAQ,gHAAiHkE,EAAKpB,IAKtJ,GADAiX,EAAM5X,EACDuD,GAAeD,GAAU,CAC7B,IAAMzK,EAAI,EAAGA,EAAIoH,EAAOpH,IAEvB8H,GADAP,EAAIO,EAAMb,EAAOjH,GAEjB8H,GAAOb,EAAOjH,GACd+e,GAAOxX,EAAIL,EAASlH,GAErB,OAAO+e,CACP,CAED,IAAM/e,EAAIoH,EAAM,EAAGpH,GAAK,EAAGA,IAE1B8H,GADAP,EAAIO,EAAMb,EAAOjH,GAEjB8H,GAAOb,EAAOjH,GACd+e,GAAOxX,EAAIL,EAASlH,GAErB,OAAO+e,CACR,CClFA,IAAIC,GAAO,QAmDX,SAASC,GAAQhW,EAAGlJ,GACnB,IAAImf,EACArT,EACAsT,EACAjW,EACAzC,EACAsE,EACAqP,EACAgF,EAEApf,EA0BJ,IArBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGToO,EAAKnR,EAAE/B,QAGPkY,EAAKnW,EAAE9B,OAGPgY,EAAOlW,EAAEwB,MAGThE,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFlf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,GAAKyG,EAAKoF,EADLgT,GAAW9T,EAAIqP,EAAIgF,EAAID,EAAMnf,EAAGgf,OAEpCE,GAAS,IACKnf,EACb,OAAO,EAIV,OAAO,CACR,CCjGA,IAAIif,GAAO,QAgDX,SAASC,GAAQhW,EAAGlJ,GACnB,IAAImf,EACArT,EACAsT,EACAjW,EACA6B,EACAqP,EACAgF,EACAzF,EACA3Z,EAuBJ,IAlBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGToO,EAAKnR,EAAE/B,QAGPkY,EAAKnW,EAAE9B,OAGPgY,EAAOlW,EAAEwB,MAGTyU,EAAQ,EAGFlf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,IAAO6L,EADP8N,EAAKkF,GAAW9T,EAAIqP,EAAIgF,EAAID,EAAMnf,EAAGgf,MAChBnT,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAIV,OAAO,CACR,CC1FA,IAAIif,GAAO,QAgDX,SAASC,GAAQhW,EAAGlJ,GACnB,IAAImf,EACArT,EACAsT,EACAjW,EACA6B,EACAqP,EACAgF,EAEApf,EAuBJ,IAlBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGToO,EAAKnR,EAAE/B,QAGPkY,EAAKnW,EAAE9B,OAGPgY,EAAOlW,EAAEwB,MAGTyU,EAAQ,EAGFlf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,GAAK6L,EADAgT,GAAW9T,EAAIqP,EAAIgF,EAAID,EAAMnf,EAAGgf,OAEpCE,GAAS,IACKnf,EACb,OAAO,EAIV,OAAO,CACR,CCrBA,IAAIsf,GAAO,CChCX,SAAiBpW,EAAGlJ,GACnB,SAAKA,GAAK,GAAKkJ,EAAE+C,KAAM/C,EAAE9B,QAI1B,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAC,EACA5F,EACA6F,EAkBJ,IAbAD,EAAKtW,EAAEhC,MAAO,GACdqY,EAAMrW,EAAE/B,QAAS,GAGjByS,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD,OAAO,CACR,EC7BA,SAAiBrW,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACA1U,EACAwU,EACAG,EACAtF,EACAT,EACA6F,EACAG,EA8BJ,IAzBA5U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,ECtDA,SAAiBxW,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACA7U,EACAwU,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAkCJ,IA7BA/U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EC9DA,SAAiB3W,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAhV,EACAwU,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAsCJ,IAjCAlV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC1EA,SAAiB9W,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAnV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA0CJ,IArCArV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECpFA,SAAiBjX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAtV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EA8CJ,IAzCAxV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EC9FA,SAAiBpX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAzV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAkDJ,IA7CA3V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,ECxGA,SAAiBvX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAsDJ,IAjDA9V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,EClHA,SAAiB1X,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA0DJ,IArDAjW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EC5HA,SAAkB7X,EAAGlJ,GACpB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlW,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA8DJ,IAzDApW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EXjGChC,IAEGmC,GAAgB,CY3CpB,SAAiBnY,EAAGlJ,GACnB,SAAKA,GAAK,GAAKkJ,EAAEwD,UAAW,GAAKxD,EAAE+C,KAAM/C,EAAE9B,QAI5C,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAC,EACA5F,EACA6F,EAqBJ,IAhBAD,EAAKtW,EAAEhC,MAAO,GACdqY,EAAMrW,EAAE/B,QAAS,GAGjByS,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD,OAAO,CACR,ECjCA,SAAiBrW,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACA1U,EACAwU,EACAG,EACAtF,EACAT,EACA6F,EACAG,EAiCJ,IA5BA5U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,EC1DA,SAAiBxW,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACA7U,EACAwU,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAqCJ,IAhCA/U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EClEA,SAAiB3W,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAhV,EACAwU,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAyCJ,IApCAlV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC9EA,SAAiB9W,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAnV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA6CJ,IAxCArV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECxFA,SAAiBjX,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAtV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EAiDJ,IA5CAxV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EClGA,SAAiBpX,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAzV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAqDJ,IAhDA3V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,EC5GA,SAAiBvX,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAyDJ,IApDA9V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,ECtHA,SAAiB1X,EAAGlJ,GACnB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA6DJ,IAxDAjW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EChIA,SAAkB7X,EAAGlJ,GACpB,IAAImf,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlW,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAiEJ,IA5DApW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnByS,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EtB1FCI,IAEGC,GAAe,CuB5DnB,SAAiBrY,EAAGlJ,GACnB,SAAKA,GAAK,IAAOkJ,EAAE+C,KAAM/C,EAAE9B,SAAY8B,EAAE+C,KAAM/C,EAAE9B,OAAO,IAIzD,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAC,EACA5F,EACA6F,EAkBJ,IAbAD,EAAKtW,EAAEhC,MAAO,GACdqY,EAAMrW,EAAE/B,QAAS,GAGjByS,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD,OAAO,CACR,EC7BA,SAAiBrW,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACA1U,EACAwU,EACAG,EACAtF,EACAT,EACA6F,EACAG,EA8BJ,IAzBA5U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,ECtDA,SAAiBxW,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACA7U,EACAwU,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAkCJ,IA7BA/U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EC9DA,SAAiB3W,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAhV,EACAwU,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAsCJ,IAjCAlV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC1EA,SAAiB9W,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAnV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA0CJ,IArCArV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECpFA,SAAiBjX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAtV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EA8CJ,IAzCAxV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EC9FA,SAAiBpX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAzV,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAkDJ,IA7CA3V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,ECxGA,SAAiBvX,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAsDJ,IAjDA9V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,EClHA,SAAiB1X,EAAGlJ,GACnB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/V,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA0DJ,IArDAjW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EC5HA,SAAkB7X,EAAGlJ,GACpB,IAAImf,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlW,EACAwU,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA8DJ,IAzDApW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADL8O,EAAKnR,EAAE/B,UAGNqY,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAKxU,EAAI,GACT2U,EAAK3U,EAAI,GACT8U,EAAK9U,EAAI,GACTiV,EAAKjV,EAAI,GACToV,EAAKpV,EAAI,GACTuV,EAAKvV,EAAI,GACT0V,EAAK1V,EAAI,GACT6V,EAAK7V,EAAI,GACTgW,EAAKhW,EAAI,GACTmW,EAAKnW,EAAI,GACTuU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK1Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTkT,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EjCrECM,IAEGC,GAAe,CkClEnB,SAAwBvY,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAiC,EACA3W,EACA4W,EACAlW,EACA2O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACAzW,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF2C,EAAK9W,EAAG,GAAI8W,EAAK,GAStB,IARKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECjFA,SAAwBxW,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAG,EACA8B,EACAI,EACA/W,EACA4W,EACAlW,EACAC,EACA0O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA3W,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF6C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECpGA,SAAwB3W,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAjX,EACA4W,EACAlW,EACAC,EACAuW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACA9W,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFgD,EAAKnX,EAAG,GAAImX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,ECvHA,SAAwB9W,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACApX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAjX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFmD,EAAKtX,EAAG,GAAIsX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC1IA,SAAwBjX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAvX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACApX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFsD,EAAKzX,EAAG,GAAIyX,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,EC7JA,SAAwBpX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA1X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAvX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFyD,EAAK5X,EAAG,GAAI4X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,EChLA,SAAwBvX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA7X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA1X,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF4D,EAAK/X,EAAG,GAAI+X,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECnMA,SAAwB1X,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAhY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA7X,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF+D,EAAKlY,EAAG,GAAIkY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAK/X,EAAG,GAAI+X,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,ECtNA,SAAyB7X,EAAGlJ,GAC3B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAnY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAhY,GAyBJ,IAnBAL,GADAK,GAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,GAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFkE,GAAKrY,EAAG,GAAIqY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKlY,EAAG,GAAIkY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAK/X,EAAG,GAAI+X,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK5X,EAAG,GAAI4X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK3T,EAAM8N,KACVuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,G1C5JIoC,GAAwB,C2C1E5B,SAAwBpa,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACApF,EACA6Y,EACAG,EACAiC,EACA3W,EACA4W,EACAlW,EACA2O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACAzW,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGF2C,EAAK9W,EAAG,GAAI8W,EAAK,GAStB,IARKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECrFA,SAAwBxW,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACA8B,EACAI,EACA/W,EACA4W,EACAlW,EACAC,EACA0O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA3W,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGF6C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECxGA,SAAwB3W,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAjX,EACA4W,EACAlW,EACAC,EACAuW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACA9W,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGFgD,EAAKnX,EAAG,GAAImX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,EC3HA,SAAwB9W,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACApX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAjX,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGFmD,EAAKtX,EAAG,GAAIsX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC9IA,SAAwBjX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAvX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACApX,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGFsD,EAAKzX,EAAG,GAAIyX,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,ECjKA,SAAwBpX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA1X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAvX,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGFyD,EAAK5X,EAAG,GAAI4X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,ECpLA,SAAwBvX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA7X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA1X,EA4BJ,IAtBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGF4D,EAAK/X,EAAG,GAAI+X,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECvMA,SAAwB1X,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAhY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA7X,GA4BJ,IAtBAL,GADAK,GAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,GAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGF+D,EAAKlY,EAAG,GAAIkY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAK/X,EAAG,GAAI+X,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,EC1NA,SAAyB7X,EAAGlJ,GAC3B,IAAImf,EACAuC,EACA5V,EACApF,EACA6Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAnY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAG,GACAhY,GA4BJ,IAtBAL,GADAK,GAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,GAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT3T,EAAMwC,EAAEwD,UAAU,GAGlByS,EAAQ,EAGFkE,GAAKrY,EAAG,GAAIqY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKlY,EAAG,GAAIkY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAK/X,EAAG,GAAI+X,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK5X,EAAG,GAAI4X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,GAAKzX,EAAG,GAAIyX,GAAK,GAUtB,IATKA,GAAKf,GACTc,EAAKC,GACLA,GAAK,IAELD,EAAKd,EACLe,IAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,GAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK/Y,EAAKoF,EAAM8N,KACfuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,GnDxJIqC,GAAuB,CoDxF3B,SAAwBra,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAiC,EACA3W,EACA4W,EACAlW,EACA2O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACAzW,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF2C,EAAK9W,EAAG,GAAI8W,EAAK,GAStB,IARKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECjFA,SAAwBxW,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACA8B,EACAI,EACA/W,EACA4W,EACAlW,EACAC,EACA0O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA3W,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF6C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECpGA,SAAwB3W,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAjX,EACA4W,EACAlW,EACAC,EACAuW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACA9W,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFgD,EAAKnX,EAAG,GAAImX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,ECvHA,SAAwB9W,EAAGlJ,GAC1B,IAAI0hB,EACAvC,EACArT,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACApX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAjX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFmD,EAAKtX,EAAG,GAAIsX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC1IA,SAAwBjX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAvX,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACApX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFsD,EAAKzX,EAAG,GAAIyX,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,EC7JA,SAAwBpX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA1X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAvX,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFyD,EAAK5X,EAAG,GAAI4X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,EChLA,SAAwBvX,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA7X,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA1X,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF4D,EAAK/X,EAAG,GAAI+X,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECnMA,SAAwB1X,EAAGlJ,GAC1B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAhY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA7X,EAyBJ,IAnBAL,GADAK,EAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,EAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF+D,EAAKlY,EAAG,GAAIkY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAK/X,EAAG,GAAI+X,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK5X,EAAG,GAAI4X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,ECtNA,SAAyB7X,EAAGlJ,GAC3B,IAAImf,EACAuC,EACA5V,EACAyT,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAnY,EACA4W,EACAlW,EACAC,EACAuW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAhY,GAyBJ,IAnBAL,GADAK,GAAI+O,GAAWlR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPqP,EAAKhP,GAAEgP,GAGPqH,EAAQ7C,GAAW3V,EAAEf,OAGrBkX,EAAKnW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTsT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFkE,GAAKrY,EAAG,GAAIqY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKlY,EAAG,GAAIkY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAK/X,EAAG,GAAI+X,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK5X,EAAG,GAAI4X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,EAAKzX,EAAG,GAAIyX,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKtX,EAAG,GAAIsX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKnX,EAAG,GAAImX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKN,GACT/V,EAAKqW,EACLA,EAAK,IAELrW,EAAK+V,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO1O,EAAG0O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAK9W,EAAG,GAAI8W,EAAK,GAUtB,IATKA,EAAKJ,GACThW,EAAKoW,EACLA,EAAK,IAELpW,EAAKgW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO3O,EAAG2O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK7W,EAAG,GAAI6W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKlU,EAAIkU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO3T,EAAM8N,IAAQ9N,EAAM8N,EAAG,MAC7BuF,GAAS,IACKnf,EACb,OAAO,EAGT4Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,G5DtIIsC,GAAWlE,GAAK7e,OAAS,SAyD7B,SAAegjB,GACd,IAAIC,EACArc,EACAsc,EACAC,EACAC,EACA1a,EACAkR,EACAgF,EACAyE,EACA9L,EACA9O,EACAlJ,EACA+jB,EACA9jB,E9QzMoBH,E8QiOxB,GArBAoJ,EAAI8a,GAAgBP,EAAQ,IAC5BzjB,EAAIgkB,GAAgBP,EAAQ,IAG5Bpc,GADAuc,EAAM1a,EAAEhC,OACIzG,OAGZuX,EAAIhY,EAAE0M,UAAW,GAAK1M,EAAEiM,KAAMjM,EAAEoH,Q9QhNd,iBAHMtH,E8QsNHoJ,EAAE+C,O9QlNZ,OAAVnM,GAC2B,iBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,G8QiN5ByJ,EAAE+C,K6DpNJ,SAAsB/C,EAAG9B,GACxB,OAAO,IAAIgH,GAAYlF,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS8B,EAAEzI,OAAO2G,EACtF,C7DkNW6c,CAAoB/a,EAAE+C,KAAM,GACrC/C,EAAEuD,kBAAmB,G/QvNvB,SAA8B3M,GAE7B,MACkB,iBAAVA,GACG,OAAVA,IAG6B,oBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBD,GAGD,mBAA3BM,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBF,EAIhC,C+QwMaqW,CAAgB1M,EAAE+C,QAC7B/C,EAAE+C,K8DvMJ,SAAsB/C,EAAG9B,GACxB,GAAKyF,GAAmB3D,GACvB,OAAOoN,GAAgBpN,EAAG9B,GAE3B,GAAK4F,GAAkB9D,GACtB,OAAOmN,GAAenN,EAAG9B,GAG1B,MAAM,IAAIpD,UAAWiB,EAAQ,+FAAgGiE,GAC9H,C9D8LWgb,CAAoBhb,EAAE+C,KAAM,GACrC/C,EAAEuD,kBAAmB,EACrBvD,EAAE/B,QAAUsS,GAAOpS,EAAO,EAAG6B,EAAE/B,QAAS,GACxC+B,EAAE9B,QAAU,EACZsc,GAAU,GAGI,IAAVrc,EACJ,OAAK6B,EAAEuD,iBACC4U,GAAeha,GAAS6B,EAAG8O,GAE9B0L,EACGnC,GAAcla,GAAS6B,EAAG8O,GAE3BsH,GAAMjY,GAAS6B,EAAG8O,GAK1B,IAFA7O,EAAM,EACN2a,EAAK,EACC7jB,EAAI,EAAGA,EAAIoH,EAAOpH,IAIvBkJ,GAHA4a,EAAIH,EAAK3jB,GAME,IAAN8jB,IACJD,GAAM,GAIR,GAAa,IAAR3a,EACJ,OAAO,EAGR,GAAe,IAAV9B,EACJ,OAAK6B,EAAEuD,iBACC4U,GAAeha,GAAS6B,EAAG8O,GAE9B0L,EACGnC,GAAcla,GAAS6B,EAAG8O,GAE3BsH,GAAMjY,GAAS6B,EAAG8O,GAK1B,GAHAqC,EAAKnR,EAAE/B,QAGF2c,IAAOzc,EAAM,EAAI,CAErB,IAAMpH,EAAI,EAAGA,EAAIoH,GACE,IAAbuc,EAAK3jB,GADaA,KAOxB,OAFAiJ,EAAEhC,MAAQ,CAAE0c,EAAI3jB,IAChBiJ,EAAE/B,QAAU,CAAEkT,EAAGpa,IACZiJ,EAAEuD,iBACC4U,GAAe,GAAKnY,EAAG8O,GAE1B0L,EACGnC,GAAc,GAAKrY,EAAG8O,GAEvBsH,GAAM,GAAKpW,EAAG8O,EACrB,CAID,GAHA6L,E+DtRD,SAAyB1c,GACxB,IAAIgd,EACAlkB,EAGJ,IADAkkB,EAAM,EACAlkB,EAAI,EAAGA,EAAIkH,EAAQ1G,OAAQR,IAC3BkH,EAASlH,GAAM,IACnBkkB,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQhd,EAAQ1G,QAEb,EAGD,CACR,C/DkQO2jB,CAAgB/J,GAGT,IAARwJ,EAAY,CAKhB,GAAK1a,KAHLwa,EAAO1c,EAAuB2c,EAAKvJ,EAAInR,EAAE9B,SAGrB,GAAGuc,EAAK,GAAG,GAASD,GAAe,EAAJva,GAAYwa,EAAK,GAAGA,EAAK,GAAG,EAU9E,OAPCtE,EADY,IAARwE,EACCF,EAAM,GAENA,EAAM,GAEZza,EAAEhC,MAAQ,CAAEiC,GACZD,EAAE/B,QAAU,CAAE,EAAkB,EAAJ0c,EAAQA,GACpC3a,EAAE9B,OAASiY,EACNnW,EAAEuD,iBACC4U,GAAe,GAAKnY,EAAG8O,GAE1B0L,EACGnC,GAAc,GAAKrY,EAAG8O,GAEvBsH,GAAM,GAAKpW,EAAG8O,GAKtB,GAAK3Q,GAASmc,GAEb,OAAKta,EAAEuD,iBACC4U,GAAeha,GAAS6B,EAAG8O,GAE9B0L,EACGnC,GAAcla,GAAS6B,EAAG8O,GAE3BsH,GAAMjY,GAAS6B,EAAG8O,EAG1B,CAID,OAAK3Q,GAASmc,GACRta,EAAEuD,iBACC6W,GAAuBjc,EAAM,GAAK6B,EAAG8O,GAExC0L,EACGH,GAAsBlc,EAAM,GAAK6B,EAAG8O,GAErCyJ,GAAcpa,EAAM,GAAK6B,EAAG8O,GAG/B9O,EAAEuD,iBACC6U,GAAgBpY,EAAG8O,GAEtB0L,EACGlC,GAAetY,EAAG8O,GAEnBkH,GAAQhW,EAAG8O,EACnB","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,332,333,334]}
\ No newline at end of file
diff --git a/dist/index.d.ts b/dist/index.d.ts
deleted file mode 100644
index c22fc82..0000000
--- a/dist/index.d.ts
+++ /dev/null
@@ -1,3 +0,0 @@
-/// <reference path="../docs/types/index.d.ts" />
-import some from '../docs/types/index';
-export = some;
\ No newline at end of file
diff --git a/dist/index.js b/dist/index.js
deleted file mode 100644
index a9cd3c1..0000000
--- a/dist/index.js
+++ /dev/null
@@ -1,131 +0,0 @@
-"use strict";var V=function(a,D){return function(){try{return D||a((D={exports:{}}).exports,D),D.exports}catch(v){throw (D=0, v)}};};var xr=V(function(J0,ur){
-var Lv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),wv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Kv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p;for(p=Lv(a.shape,a.strides),b=p.sh,d=p.sx,v=wv(a.dtype),o=a.offset,O=a.data,z=d[0],y=a.accessors[0],r=0,c=b[1];c>0;)for(c<v?(e=c,c=0):(e=v,c-=v),k=o+c*d[1],i=b[0];i>0;)for(i<v?(u=i,i=0):(u=v,i-=v),s=k+i*d[0],h=d[1]-u*d[0],n=0;n<e;n++){for(t=0;t<u;t++){if(y(O,s)&&(r+=1,r>=D))return!0;s+=z}s+=h}return!1}ur.exports=Kv
-});var cr=V(function(Q0,lr){
-var Xv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Iv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Rv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q;for(q=Xv(a.shape,a.strides),e=q.sh,t=q.sx,v=Iv(a.dtype),n=a.offset,O=a.data,z=t[0],y=a.accessors[0],r=0,f=e[2];f>0;)for(f<v?(s=f,f=0):(s=v,f-=v),u=n+f*t[2],m=e[1];m>0;)for(m<v?(o=m,m=0):(o=v,m-=v),k=t[2]-o*t[1],b=u+m*t[1],x=e[0];x>0;)for(x<v?(d=x,x=0):(d=v,x-=v),i=b+x*t[0],h=t[1]-d*t[0],l=0;l<s;l++){for(p=0;p<o;p++){for(c=0;c<d;c++){if(y(O,i)&&(r+=1,r>=D))return!0;i+=z}i+=h}i+=k}return!1}lr.exports=Rv
-});var pr=V(function(T0,nr){
-var Nv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Vv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Fv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E;for(E=Nv(a.shape,a.strides),o=E.sh,c=E.sx,v=Vv(a.dtype),p=a.offset,O=a.data,z=c[0],y=a.accessors[0],r=0,C=o[3];C>0;)for(C<v?(i=C,C=0):(i=v,C-=v),d=p+C*c[3],g=o[2];g>0;)for(g<v?(n=g,g=0):(n=v,g-=v),b=c[3]-n*c[2],e=d+g*c[2],j=o[1];j>0;)for(j<v?(t=j,j=0):(t=v,j-=v),k=c[2]-t*c[1],u=e+j*c[1],S=o[0];S>0;)for(S<v?(s=S,S=0):(s=v,S-=v),l=u+S*c[0],h=c[1]-s*c[0],q=0;q<i;q++){for(f=0;f<n;f++){for(m=0;m<t;m++){for(x=0;x<s;x++){if(y(O,l)&&(r+=1,r>=D))return!0;l+=z}l+=h}l+=k}l+=b}return!1}nr.exports=Fv
-});var br=V(function(U0,Sr){
-var Gv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Hv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Jv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w;for(w=Gv(a.shape,a.strides),t=w.sh,x=w.sx,r=Hv(a.dtype),m=a.offset,O=a.data,z=x[0],y=a.accessors[0],v=0,B=t[4];B>0;)for(B<r?(l=B,B=0):(l=r,B-=r),s=m+B*x[4],M=t[3];M>0;)for(M<r?(p=M,M=0):(p=r,M-=r),u=x[4]-p*x[3],o=s+M*x[3],A=t[2];A>0;)for(A<r?(c=A,A=0):(c=r,A-=r),b=x[3]-c*x[2],d=o+A*x[2],_=t[1];_>0;)for(_<r?(i=_,_=0):(i=r,_-=r),k=x[2]-i*x[1],e=d+_*x[1],E=t[0];E>0;)for(E<r?(n=E,E=0):(n=r,E-=r),f=e+E*x[0],h=x[1]-n*x[0],C=0;C<l;C++){for(g=0;g<p;g++){for(j=0;j<c;j++){for(S=0;S<i;S++){for(q=0;q<n;q++){if(y(O,f)&&(v+=1,v>=D))return!0;f+=z}f+=h}f+=k}f+=b}f+=u}return!1}Sr.exports=Jv
-});var mr=V(function(W0,jr){
-var Qv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Tv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Uv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F;for(F=Qv(a.shape,a.strides),i=F.sh,q=F.sx,r=Tv(a.dtype),S=a.offset,O=a.data,z=q[0],y=a.accessors[0],v=0,X=i[5];X>0;)for(X<r?(f=X,X=0):(f=r,X-=r),n=S+X*q[5],K=i[4];K>0;)for(K<r?(m=K,K=0):(m=r,K-=r),e=q[5]-m*q[4],t=n+K*q[4],L=i[3];L>0;)for(L<r?(x=L,L=0):(x=r,L-=r),u=q[4]-x*q[3],s=t+L*q[3],P=i[2];P>0;)for(P<r?(l=P,P=0):(l=r,P-=r),b=q[3]-l*q[2],o=s+P*q[2],w=i[1];w>0;)for(w<r?(p=w,w=0):(p=r,w-=r),k=q[2]-p*q[1],d=o+w*q[1],B=i[0];B>0;)for(B<r?(c=B,B=0):(c=r,B-=r),j=d+B*q[0],h=q[1]-c*q[0],M=0;M<f;M++){for(A=0;A<m;A++){for(_=0;_<x;_++){for(E=0;E<l;E++){for(C=0;C<p;C++){for(g=0;g<c;g++){if(y(O,j)&&(v+=1,v>=D))return!0;j+=z}j+=h}j+=k}j+=b}j+=u}j+=e}return!1}jr.exports=Uv
-});var hr=V(function(Y0,qr){
-var Wv=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Yv=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Zv(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H;for(H=Wv(a.shape,a.strides),p=H.sh,g=H.sx,r=Yv(a.dtype),C=a.offset,O=a.data,z=g[0],y=a.accessors[0],v=0,G=p[6];G>0;)for(G<r?(j=G,G=0):(j=r,G-=r),c=C+G*g[6],R=p[5];R>0;)for(R<r?(S=R,R=0):(S=r,R-=r),d=g[6]-S*g[5],i=c+R*g[5],I=p[4];I>0;)for(I<r?(q=I,I=0):(q=r,I-=r),e=g[5]-q*g[4],n=i+I*g[4],N=p[3];N>0;)for(N<r?(f=N,N=0):(f=r,N-=r),u=g[4]-f*g[3],t=n+N*g[3],F=p[2];F>0;)for(F<r?(m=F,F=0):(m=r,F-=r),b=g[3]-m*g[2],s=t+F*g[2],X=p[1];X>0;)for(X<r?(x=X,X=0):(x=r,X-=r),k=g[2]-x*g[1],o=s+X*g[1],K=p[0];K>0;)for(K<r?(l=K,K=0):(l=r,K-=r),E=o+K*g[0],h=g[1]-l*g[0],L=0;L<j;L++){for(P=0;P<S;P++){for(w=0;w<q;w++){for(B=0;B<f;B++){for(M=0;M<m;M++){for(A=0;A<x;A++){for(_=0;_<l;_++){if(y(O,E)&&(v+=1,v>=D))return!0;E+=z}E+=h}E+=k}E+=b}E+=u}E+=e}E+=d}return!1}qr.exports=Zv
-});var zr=V(function(Z0,kr){
-var $v=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),re=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ae(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W;for(W=$v(a.shape,a.strides),x=W.sh,_=W.sx,r=re(a.dtype),A=a.offset,O=a.data,z=_[0],y=a.accessors[0],v=0,U=x[7];U>0;)for(U<r?(E=U,U=0):(E=r,U-=r),l=A+U*_[7],T=x[6];T>0;)for(T<r?(C=T,T=0):(C=r,T-=r),o=_[7]-C*_[6],p=l+T*_[6],Q=x[5];Q>0;)for(Q<r?(g=Q,Q=0):(g=r,Q-=r),d=_[6]-g*_[5],c=p+Q*_[5],J=x[4];J>0;)for(J<r?(j=J,J=0):(j=r,J-=r),e=_[5]-j*_[4],i=c+J*_[4],H=x[3];H>0;)for(H<r?(S=H,H=0):(S=r,H-=r),u=_[4]-S*_[3],n=i+H*_[3],G=x[2];G>0;)for(G<r?(q=G,G=0):(q=r,G-=r),b=_[3]-q*_[2],t=n+G*_[2],R=x[1];R>0;)for(R<r?(f=R,R=0):(f=r,R-=r),k=_[2]-f*_[1],s=t+R*_[1],I=x[0];I>0;)for(I<r?(m=I,I=0):(m=r,I-=r),M=s+I*_[0],h=_[1]-m*_[0],N=0;N<E;N++){for(F=0;F<C;F++){for(X=0;X<g;X++){for(K=0;K<j;K++){for(L=0;L<S;L++){for(P=0;P<q;P++){for(w=0;w<f;w++){for(B=0;B<m;B++){if(y(O,M)&&(v+=1,v>=D))return!0;M+=z}M+=h}M+=k}M+=b}M+=u}M+=e}M+=d}M+=o}return!1}kr.exports=ae
-});var yr=V(function($0,Or){
-var ve=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),ee=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function se(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr,ar;for(ar=ve(a.shape,a.strides),f=ar.sh,B=ar.sx,r=ee(a.dtype),w=a.offset,O=a.data,z=B[0],y=a.accessors[0],v=0,rr=f[8];rr>0;)for(rr<r?(M=rr,rr=0):(M=r,rr-=r),m=w+rr*B[8],$=f[7];$>0;)for($<r?(A=$,$=0):(A=r,$-=r),s=B[8]-A*B[7],x=m+$*B[7],Z=f[6];Z>0;)for(Z<r?(_=Z,Z=0):(_=r,Z-=r),o=B[7]-_*B[6],l=x+Z*B[6],Y=f[5];Y>0;)for(Y<r?(E=Y,Y=0):(E=r,Y-=r),d=B[6]-E*B[5],p=l+Y*B[5],W=f[4];W>0;)for(W<r?(C=W,W=0):(C=r,W-=r),e=B[5]-C*B[4],c=p+W*B[4],U=f[3];U>0;)for(U<r?(g=U,U=0):(g=r,U-=r),u=B[4]-g*B[3],i=c+U*B[3],T=f[2];T>0;)for(T<r?(j=T,T=0):(j=r,T-=r),b=B[3]-j*B[2],n=i+T*B[2],Q=f[1];Q>0;)for(Q<r?(S=Q,Q=0):(S=r,Q-=r),k=B[2]-S*B[1],t=n+Q*B[1],J=f[0];J>0;)for(J<r?(q=J,J=0):(q=r,J-=r),P=t+J*B[0],h=B[1]-q*B[0],H=0;H<M;H++){for(G=0;G<A;G++){for(R=0;R<_;R++){for(I=0;I<E;I++){for(N=0;N<C;N++){for(F=0;F<g;F++){for(X=0;X<j;X++){for(K=0;K<S;K++){for(L=0;L<q;L++){if(y(O,P)&&(v+=1,v>=D))return!0;P+=z}P+=h}P+=k}P+=b}P+=u}P+=e}P+=d}P+=o}P+=s}return!1}Or.exports=se
-});var Er=V(function(ri,gr){
-var oe=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),ie=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function fe(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr,ar,vr,er,sr,or,dr;for(dr=oe(a.shape,a.strides),S=dr.sh,L=dr.sx,r=ie(a.dtype),K=a.offset,O=a.data,z=L[0],y=a.accessors[0],v=0,or=S[9];or>0;)for(or<r?(P=or,or=0):(P=r,or-=r),q=K+or*L[9],sr=S[8];sr>0;)for(sr<r?(w=sr,sr=0):(w=r,sr-=r),t=L[9]-w*L[8],f=q+sr*L[8],er=S[7];er>0;)for(er<r?(B=er,er=0):(B=r,er-=r),s=L[8]-B*L[7],m=f+er*L[7],vr=S[6];vr>0;)for(vr<r?(M=vr,vr=0):(M=r,vr-=r),o=L[7]-M*L[6],x=m+vr*L[6],ar=S[5];ar>0;)for(ar<r?(A=ar,ar=0):(A=r,ar-=r),d=L[6]-A*L[5],l=x+ar*L[5],rr=S[4];rr>0;)for(rr<r?(_=rr,rr=0):(_=r,rr-=r),e=L[5]-_*L[4],p=l+rr*L[4],$=S[3];$>0;)for($<r?(E=$,$=0):(E=r,$-=r),u=L[4]-E*L[3],c=p+$*L[3],Z=S[2];Z>0;)for(Z<r?(C=Z,Z=0):(C=r,Z-=r),b=L[3]-C*L[2],i=c+Z*L[2],Y=S[1];Y>0;)for(Y<r?(g=Y,Y=0):(g=r,Y-=r),k=L[2]-g*L[1],n=i+Y*L[1],W=S[0];W>0;)for(W<r?(j=W,W=0):(j=r,W-=r),X=n+W*L[0],h=L[1]-j*L[0],U=0;U<P;U++){for(T=0;T<w;T++){for(Q=0;Q<B;Q++){for(J=0;J<M;J++){for(H=0;H<A;H++){for(G=0;G<_;G++){for(R=0;R<E;R++){for(I=0;I<C;I++){for(N=0;N<g;N++){for(F=0;F<j;F++){if(y(O,X)&&(v+=1,v>=D))return!0;X+=z}X+=h}X+=k}X+=b}X+=u}X+=e}X+=d}X+=o}X+=s}X+=t}return!1}gr.exports=fe
-});var Cr=V(function(ai,Mr){
-var te=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),de=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ue(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c;for(c=te(a.shape,a.strides),k=c.sh,e=c.sx,r=de(a.dtype),d=a.offset,O=a.data,y=e[0],v=0,i=k[1];i>0;)for(i<r?(u=i,i=0):(u=r,i-=r),h=d+i*e[1],n=k[0];n>0;)for(n<r?(b=n,n=0):(b=r,n-=r),o=h+n*e[0],z=e[1]-b*e[0],t=0;t<u;t++){for(s=0;s<b;s++){if((O[o]||O[o+1])&&(v+=1,v>=D))return!0;o+=y}o+=z}return!1}Mr.exports=ue
-});var _r=V(function(vi,Pr){
-var xe=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),le=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ce(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f;for(f=xe(a.shape,a.strides),u=f.sh,s=f.sx,r=le(a.dtype),t=a.offset,O=a.data,y=s[0],v=0,m=u[2];m>0;)for(m<r?(o=m,m=0):(o=r,m-=r),b=t+m*s[2],x=u[1];x>0;)for(x<r?(d=x,x=0):(d=r,x-=r),h=s[2]-d*s[1],k=b+x*s[1],l=u[0];l>0;)for(l<r?(e=l,l=0):(e=r,l-=r),n=k+l*s[0],z=s[1]-e*s[0],p=0;p<o;p++){for(c=0;c<d;c++){for(i=0;i<e;i++){if((O[n]||O[n+1])&&(v+=1,v>=D))return!0;n+=y}n+=z}n+=h}return!1}Pr.exports=ce
-});var Br=V(function(ei,Dr){
-var ne=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),pe=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Se(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C;for(C=ne(a.shape,a.strides),d=C.sh,i=C.sx,v=pe(a.dtype),c=a.offset,O=a.data,y=i[0],r=0,g=d[3];g>0;)for(g<v?(n=g,g=0):(n=v,g-=v),e=c+g*i[3],j=d[2];j>0;)for(j<v?(t=j,j=0):(t=v,j-=v),k=i[3]-t*i[2],u=e+j*i[2],S=d[1];S>0;)for(S<v?(s=S,S=0):(s=v,S-=v),h=i[2]-s*i[1],b=u+S*i[1],q=d[0];q>0;)for(q<v?(o=q,q=0):(o=v,q-=v),p=b+q*i[0],z=i[1]-o*i[0],f=0;f<n;f++){for(m=0;m<t;m++){for(x=0;x<s;x++){for(l=0;l<o;l++){if((O[p]||O[p+1])&&(r+=1,r>=D))return!0;p+=y}p+=z}p+=h}p+=k}return!1}Dr.exports=Se
-});var Lr=V(function(si,Ar){
-var be=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),je=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function me(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B;for(B=be(a.shape,a.strides),s=B.sh,l=B.sx,v=je(a.dtype),x=a.offset,O=a.data,y=l[0],r=0,M=s[4];M>0;)for(M<v?(p=M,M=0):(p=v,M-=v),o=x+M*l[4],A=s[3];A>0;)for(A<v?(c=A,A=0):(c=v,A-=v),b=l[4]-c*l[3],d=o+A*l[3],_=s[2];_>0;)for(_<v?(i=_,_=0):(i=v,_-=v),k=l[3]-i*l[2],e=d+_*l[2],E=s[1];E>0;)for(E<v?(n=E,E=0):(n=v,E-=v),h=l[2]-n*l[1],u=e+E*l[1],C=s[0];C>0;)for(C<v?(t=C,C=0):(t=v,C-=v),m=u+C*l[0],z=l[1]-t*l[0],g=0;g<p;g++){for(j=0;j<c;j++){for(S=0;S<i;S++){for(q=0;q<n;q++){for(f=0;f<t;f++){if((O[m]||O[m+1])&&(r+=1,r>=D))return!0;m+=y}m+=z}m+=h}m+=k}m+=b}return!1}Ar.exports=me
-});var Kr=V(function(oi,wr){
-var qe=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),he=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ke(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X;for(X=qe(a.shape,a.strides),n=X.sh,f=X.sx,r=he(a.dtype),q=a.offset,O=a.data,y=f[0],v=0,K=n[5];K>0;)for(K<r?(m=K,K=0):(m=r,K-=r),t=q+K*f[5],L=n[4];L>0;)for(L<r?(x=L,L=0):(x=r,L-=r),u=f[5]-x*f[4],s=t+L*f[4],P=n[3];P>0;)for(P<r?(l=P,P=0):(l=r,P-=r),b=f[4]-l*f[3],o=s+P*f[3],w=n[2];w>0;)for(w<r?(p=w,w=0):(p=r,w-=r),k=f[3]-p*f[2],d=o+w*f[2],B=n[1];B>0;)for(B<r?(c=B,B=0):(c=r,B-=r),h=f[2]-c*f[1],e=d+B*f[1],M=n[0];M>0;)for(M<r?(i=M,M=0):(i=r,M-=r),S=e+M*f[0],z=f[1]-i*f[0],A=0;A<m;A++){for(_=0;_<x;_++){for(E=0;E<l;E++){for(C=0;C<p;C++){for(g=0;g<c;g++){for(j=0;j<i;j++){if((O[S]||O[S+1])&&(v+=1,v>=D))return!0;S+=y}S+=z}S+=h}S+=k}S+=b}S+=u}return!1}wr.exports=ke
-});var Ir=V(function(ii,Xr){
-var ze=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Oe=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ye(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G;for(G=ze(a.shape,a.strides),c=G.sh,j=G.sx,r=Oe(a.dtype),g=a.offset,O=a.data,y=j[0],v=0,R=c[6];R>0;)for(R<r?(S=R,R=0):(S=r,R-=r),i=g+R*j[6],I=c[5];I>0;)for(I<r?(q=I,I=0):(q=r,I-=r),e=j[6]-q*j[5],n=i+I*j[5],N=c[4];N>0;)for(N<r?(f=N,N=0):(f=r,N-=r),u=j[5]-f*j[4],t=n+N*j[4],F=c[3];F>0;)for(F<r?(m=F,F=0):(m=r,F-=r),b=j[4]-m*j[3],s=t+F*j[3],X=c[2];X>0;)for(X<r?(x=X,X=0):(x=r,X-=r),k=j[3]-x*j[2],o=s+X*j[2],K=c[1];K>0;)for(K<r?(l=K,K=0):(l=r,K-=r),h=j[2]-l*j[1],d=o+K*j[1],L=c[0];L>0;)for(L<r?(p=L,L=0):(p=r,L-=r),C=d+L*j[0],z=j[1]-p*j[0],P=0;P<S;P++){for(w=0;w<q;w++){for(B=0;B<f;B++){for(M=0;M<m;M++){for(A=0;A<x;A++){for(_=0;_<l;_++){for(E=0;E<p;E++){if((O[C]||O[C+1])&&(v+=1,v>=D))return!0;C+=y}C+=z}C+=h}C+=k}C+=b}C+=u}C+=e}return!1}Xr.exports=ye
-});var Nr=V(function(fi,Rr){
-var ge=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Ee=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Me(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U;for(U=ge(a.shape,a.strides),l=U.sh,E=U.sx,r=Ee(a.dtype),_=a.offset,O=a.data,y=E[0],v=0,T=l[7];T>0;)for(T<r?(C=T,T=0):(C=r,T-=r),p=_+T*E[7],Q=l[6];Q>0;)for(Q<r?(g=Q,Q=0):(g=r,Q-=r),d=E[7]-g*E[6],c=p+Q*E[6],J=l[5];J>0;)for(J<r?(j=J,J=0):(j=r,J-=r),e=E[6]-j*E[5],i=c+J*E[5],H=l[4];H>0;)for(H<r?(S=H,H=0):(S=r,H-=r),u=E[5]-S*E[4],n=i+H*E[4],G=l[3];G>0;)for(G<r?(q=G,G=0):(q=r,G-=r),b=E[4]-q*E[3],t=n+G*E[3],R=l[2];R>0;)for(R<r?(f=R,R=0):(f=r,R-=r),k=E[3]-f*E[2],s=t+R*E[2],I=l[1];I>0;)for(I<r?(m=I,I=0):(m=r,I-=r),h=E[2]-m*E[1],o=s+I*E[1],N=l[0];N>0;)for(N<r?(x=N,N=0):(x=r,N-=r),A=o+N*E[0],z=E[1]-x*E[0],F=0;F<C;F++){for(X=0;X<g;X++){for(K=0;K<j;K++){for(L=0;L<S;L++){for(P=0;P<q;P++){for(w=0;w<f;w++){for(B=0;B<m;B++){for(M=0;M<x;M++){if((O[A]||O[A+1])&&(v+=1,v>=D))return!0;A+=y}A+=z}A+=h}A+=k}A+=b}A+=u}A+=e}A+=d}return!1}Rr.exports=Me
-});var Fr=V(function(ti,Vr){
-var Ce=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Pe=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function _e(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr;for(rr=Ce(a.shape,a.strides),m=rr.sh,M=rr.sx,r=Pe(a.dtype),B=a.offset,O=a.data,y=M[0],v=0,$=m[8];$>0;)for($<r?(A=$,$=0):(A=r,$-=r),x=B+$*M[8],Z=m[7];Z>0;)for(Z<r?(_=Z,Z=0):(_=r,Z-=r),o=M[8]-_*M[7],l=x+Z*M[7],Y=m[6];Y>0;)for(Y<r?(E=Y,Y=0):(E=r,Y-=r),d=M[7]-E*M[6],p=l+Y*M[6],W=m[5];W>0;)for(W<r?(C=W,W=0):(C=r,W-=r),e=M[6]-C*M[5],c=p+W*M[5],U=m[4];U>0;)for(U<r?(g=U,U=0):(g=r,U-=r),u=M[5]-g*M[4],i=c+U*M[4],T=m[3];T>0;)for(T<r?(j=T,T=0):(j=r,T-=r),b=M[4]-j*M[3],n=i+T*M[3],Q=m[2];Q>0;)for(Q<r?(S=Q,Q=0):(S=r,Q-=r),k=M[3]-S*M[2],t=n+Q*M[2],J=m[1];J>0;)for(J<r?(q=J,J=0):(q=r,J-=r),h=M[2]-q*M[1],s=t+J*M[1],H=m[0];H>0;)for(H<r?(f=H,H=0):(f=r,H-=r),w=s+H*M[0],z=M[1]-f*M[0],G=0;G<A;G++){for(R=0;R<_;R++){for(I=0;I<E;I++){for(N=0;N<C;N++){for(F=0;F<g;F++){for(X=0;X<j;X++){for(K=0;K<S;K++){for(L=0;L<q;L++){for(P=0;P<f;P++){if((O[w]||O[w+1])&&(v+=1,v>=D))return!0;w+=y}w+=z}w+=h}w+=k}w+=b}w+=u}w+=e}w+=d}w+=o}return!1}Vr.exports=_e
-});var Hr=V(function(di,Gr){
-var De=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Be=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Ae(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr,ar,vr,er,sr,or;for(or=De(a.shape,a.strides),q=or.sh,P=or.sx,r=Be(a.dtype),L=a.offset,O=a.data,y=P[0],v=0,sr=q[9];sr>0;)for(sr<r?(w=sr,sr=0):(w=r,sr-=r),f=L+sr*P[9],er=q[8];er>0;)for(er<r?(B=er,er=0):(B=r,er-=r),s=P[9]-B*P[8],m=f+er*P[8],vr=q[7];vr>0;)for(vr<r?(M=vr,vr=0):(M=r,vr-=r),o=P[8]-M*P[7],x=m+vr*P[7],ar=q[6];ar>0;)for(ar<r?(A=ar,ar=0):(A=r,ar-=r),d=P[7]-A*P[6],l=x+ar*P[6],rr=q[5];rr>0;)for(rr<r?(_=rr,rr=0):(_=r,rr-=r),e=P[6]-_*P[5],p=l+rr*P[5],$=q[4];$>0;)for($<r?(E=$,$=0):(E=r,$-=r),u=P[5]-E*P[4],c=p+$*P[4],Z=q[3];Z>0;)for(Z<r?(C=Z,Z=0):(C=r,Z-=r),b=P[4]-C*P[3],i=c+Z*P[3],Y=q[2];Y>0;)for(Y<r?(g=Y,Y=0):(g=r,Y-=r),k=P[3]-g*P[2],n=i+Y*P[2],W=q[1];W>0;)for(W<r?(j=W,W=0):(j=r,W-=r),h=P[2]-j*P[1],t=n+W*P[1],U=q[0];U>0;)for(U<r?(S=U,U=0):(S=r,U-=r),K=t+U*P[0],z=P[1]-S*P[0],T=0;T<w;T++){for(Q=0;Q<B;Q++){for(J=0;J<M;J++){for(H=0;H<A;H++){for(G=0;G<_;G++){for(R=0;R<E;R++){for(I=0;I<C;I++){for(N=0;N<g;N++){for(F=0;F<j;F++){for(X=0;X<S;X++){if((O[K]||O[K+1])&&(v+=1,v>=D))return!0;K+=y}K+=z}K+=h}K+=k}K+=b}K+=u}K+=e}K+=d}K+=o}K+=s}return!1}Gr.exports=Ae
-});var Qr=V(function(ui,Jr){
-var Le=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),we=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Ke(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c;for(c=Le(a.shape,a.strides),k=c.sh,e=c.sx,v=we(a.dtype),d=a.offset,O=a.data,y=e[0],r=0,i=k[1];i>0;)for(i<v?(u=i,i=0):(u=v,i-=v),h=d+i*e[1],n=k[0];n>0;)for(n<v?(b=n,n=0):(b=v,n-=v),o=h+n*e[0],z=e[1]-b*e[0],t=0;t<u;t++){for(s=0;s<b;s++){if(O[o]&&(r+=1,r>=D))return!0;o+=y}o+=z}return!1}Jr.exports=Ke
-});var Ur=V(function(xi,Tr){
-var Xe=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Ie=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Re(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f;for(f=Xe(a.shape,a.strides),u=f.sh,s=f.sx,v=Ie(a.dtype),t=a.offset,O=a.data,y=s[0],r=0,m=u[2];m>0;)for(m<v?(o=m,m=0):(o=v,m-=v),b=t+m*s[2],x=u[1];x>0;)for(x<v?(d=x,x=0):(d=v,x-=v),h=s[2]-d*s[1],k=b+x*s[1],l=u[0];l>0;)for(l<v?(e=l,l=0):(e=v,l-=v),n=k+l*s[0],z=s[1]-e*s[0],p=0;p<o;p++){for(c=0;c<d;c++){for(i=0;i<e;i++){if(O[n]&&(r+=1,r>=D))return!0;n+=y}n+=z}n+=h}return!1}Tr.exports=Re
-});var Yr=V(function(li,Wr){
-var Ne=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Ve=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Fe(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C;for(C=Ne(a.shape,a.strides),d=C.sh,i=C.sx,v=Ve(a.dtype),c=a.offset,O=a.data,y=i[0],r=0,g=d[3];g>0;)for(g<v?(n=g,g=0):(n=v,g-=v),e=c+g*i[3],j=d[2];j>0;)for(j<v?(t=j,j=0):(t=v,j-=v),k=i[3]-t*i[2],u=e+j*i[2],S=d[1];S>0;)for(S<v?(s=S,S=0):(s=v,S-=v),h=i[2]-s*i[1],b=u+S*i[1],q=d[0];q>0;)for(q<v?(o=q,q=0):(o=v,q-=v),p=b+q*i[0],z=i[1]-o*i[0],f=0;f<n;f++){for(m=0;m<t;m++){for(x=0;x<s;x++){for(l=0;l<o;l++){if(O[p]&&(r+=1,r>=D))return!0;p+=y}p+=z}p+=h}p+=k}return!1}Wr.exports=Fe
-});var $r=V(function(ci,Zr){
-var Ge=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),He=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Je(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B;for(B=Ge(a.shape,a.strides),s=B.sh,l=B.sx,v=He(a.dtype),x=a.offset,O=a.data,y=l[0],r=0,M=s[4];M>0;)for(M<v?(p=M,M=0):(p=v,M-=v),o=x+M*l[4],A=s[3];A>0;)for(A<v?(c=A,A=0):(c=v,A-=v),b=l[4]-c*l[3],d=o+A*l[3],_=s[2];_>0;)for(_<v?(i=_,_=0):(i=v,_-=v),k=l[3]-i*l[2],e=d+_*l[2],E=s[1];E>0;)for(E<v?(n=E,E=0):(n=v,E-=v),h=l[2]-n*l[1],u=e+E*l[1],C=s[0];C>0;)for(C<v?(t=C,C=0):(t=v,C-=v),m=u+C*l[0],z=l[1]-t*l[0],g=0;g<p;g++){for(j=0;j<c;j++){for(S=0;S<i;S++){for(q=0;q<n;q++){for(f=0;f<t;f++){if(O[m]&&(r+=1,r>=D))return!0;m+=y}m+=z}m+=h}m+=k}m+=b}return!1}Zr.exports=Je
-});var aa=V(function(ni,ra){
-var Qe=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Te=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Ue(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X;for(X=Qe(a.shape,a.strides),n=X.sh,f=X.sx,r=Te(a.dtype),q=a.offset,O=a.data,y=f[0],v=0,K=n[5];K>0;)for(K<r?(m=K,K=0):(m=r,K-=r),t=q+K*f[5],L=n[4];L>0;)for(L<r?(x=L,L=0):(x=r,L-=r),u=f[5]-x*f[4],s=t+L*f[4],P=n[3];P>0;)for(P<r?(l=P,P=0):(l=r,P-=r),b=f[4]-l*f[3],o=s+P*f[3],w=n[2];w>0;)for(w<r?(p=w,w=0):(p=r,w-=r),k=f[3]-p*f[2],d=o+w*f[2],B=n[1];B>0;)for(B<r?(c=B,B=0):(c=r,B-=r),h=f[2]-c*f[1],e=d+B*f[1],M=n[0];M>0;)for(M<r?(i=M,M=0):(i=r,M-=r),S=e+M*f[0],z=f[1]-i*f[0],A=0;A<m;A++){for(_=0;_<x;_++){for(E=0;E<l;E++){for(C=0;C<p;C++){for(g=0;g<c;g++){for(j=0;j<i;j++){if(O[S]&&(v+=1,v>=D))return!0;S+=y}S+=z}S+=h}S+=k}S+=b}S+=u}return!1}ra.exports=Ue
-});var ea=V(function(pi,va){
-var We=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),Ye=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function Ze(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G;for(G=We(a.shape,a.strides),c=G.sh,j=G.sx,r=Ye(a.dtype),g=a.offset,O=a.data,y=j[0],v=0,R=c[6];R>0;)for(R<r?(S=R,R=0):(S=r,R-=r),i=g+R*j[6],I=c[5];I>0;)for(I<r?(q=I,I=0):(q=r,I-=r),e=j[6]-q*j[5],n=i+I*j[5],N=c[4];N>0;)for(N<r?(f=N,N=0):(f=r,N-=r),u=j[5]-f*j[4],t=n+N*j[4],F=c[3];F>0;)for(F<r?(m=F,F=0):(m=r,F-=r),b=j[4]-m*j[3],s=t+F*j[3],X=c[2];X>0;)for(X<r?(x=X,X=0):(x=r,X-=r),k=j[3]-x*j[2],o=s+X*j[2],K=c[1];K>0;)for(K<r?(l=K,K=0):(l=r,K-=r),h=j[2]-l*j[1],d=o+K*j[1],L=c[0];L>0;)for(L<r?(p=L,L=0):(p=r,L-=r),C=d+L*j[0],z=j[1]-p*j[0],P=0;P<S;P++){for(w=0;w<q;w++){for(B=0;B<f;B++){for(M=0;M<m;M++){for(A=0;A<x;A++){for(_=0;_<l;_++){for(E=0;E<p;E++){if(O[C]&&(v+=1,v>=D))return!0;C+=y}C+=z}C+=h}C+=k}C+=b}C+=u}C+=e}return!1}va.exports=Ze
-});var oa=V(function(Si,sa){
-var $e=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),rs=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function as(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U;for(U=$e(a.shape,a.strides),l=U.sh,E=U.sx,r=rs(a.dtype),_=a.offset,O=a.data,y=E[0],v=0,T=l[7];T>0;)for(T<r?(C=T,T=0):(C=r,T-=r),p=_+T*E[7],Q=l[6];Q>0;)for(Q<r?(g=Q,Q=0):(g=r,Q-=r),d=E[7]-g*E[6],c=p+Q*E[6],J=l[5];J>0;)for(J<r?(j=J,J=0):(j=r,J-=r),e=E[6]-j*E[5],i=c+J*E[5],H=l[4];H>0;)for(H<r?(S=H,H=0):(S=r,H-=r),u=E[5]-S*E[4],n=i+H*E[4],G=l[3];G>0;)for(G<r?(q=G,G=0):(q=r,G-=r),b=E[4]-q*E[3],t=n+G*E[3],R=l[2];R>0;)for(R<r?(f=R,R=0):(f=r,R-=r),k=E[3]-f*E[2],s=t+R*E[2],I=l[1];I>0;)for(I<r?(m=I,I=0):(m=r,I-=r),h=E[2]-m*E[1],o=s+I*E[1],N=l[0];N>0;)for(N<r?(x=N,N=0):(x=r,N-=r),A=o+N*E[0],z=E[1]-x*E[0],F=0;F<C;F++){for(X=0;X<g;X++){for(K=0;K<j;K++){for(L=0;L<S;L++){for(P=0;P<q;P++){for(w=0;w<f;w++){for(B=0;B<m;B++){for(M=0;M<x;M++){if(O[A]&&(v+=1,v>=D))return!0;A+=y}A+=z}A+=h}A+=k}A+=b}A+=u}A+=e}A+=d}return!1}sa.exports=as
-});var fa=V(function(bi,ia){
-var vs=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),es=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function ss(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr;for(rr=vs(a.shape,a.strides),m=rr.sh,M=rr.sx,r=es(a.dtype),B=a.offset,O=a.data,y=M[0],v=0,$=m[8];$>0;)for($<r?(A=$,$=0):(A=r,$-=r),x=B+$*M[8],Z=m[7];Z>0;)for(Z<r?(_=Z,Z=0):(_=r,Z-=r),o=M[8]-_*M[7],l=x+Z*M[7],Y=m[6];Y>0;)for(Y<r?(E=Y,Y=0):(E=r,Y-=r),d=M[7]-E*M[6],p=l+Y*M[6],W=m[5];W>0;)for(W<r?(C=W,W=0):(C=r,W-=r),e=M[6]-C*M[5],c=p+W*M[5],U=m[4];U>0;)for(U<r?(g=U,U=0):(g=r,U-=r),u=M[5]-g*M[4],i=c+U*M[4],T=m[3];T>0;)for(T<r?(j=T,T=0):(j=r,T-=r),b=M[4]-j*M[3],n=i+T*M[3],Q=m[2];Q>0;)for(Q<r?(S=Q,Q=0):(S=r,Q-=r),k=M[3]-S*M[2],t=n+Q*M[2],J=m[1];J>0;)for(J<r?(q=J,J=0):(q=r,J-=r),h=M[2]-q*M[1],s=t+J*M[1],H=m[0];H>0;)for(H<r?(f=H,H=0):(f=r,H-=r),w=s+H*M[0],z=M[1]-f*M[0],G=0;G<A;G++){for(R=0;R<_;R++){for(I=0;I<E;I++){for(N=0;N<C;N++){for(F=0;F<g;F++){for(X=0;X<j;X++){for(K=0;K<S;K++){for(L=0;L<q;L++){for(P=0;P<f;P++){if(O[w]&&(v+=1,v>=D))return!0;w+=y}w+=z}w+=h}w+=k}w+=b}w+=u}w+=e}w+=d}w+=o}return!1}ia.exports=ss
-});var da=V(function(ji,ta){
-var os=require('@stdlib/ndarray-base-nullary-loop-interchange-order/dist'),is=require('@stdlib/ndarray-base-nullary-tiling-block-size/dist');function fs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K,X,F,N,I,R,G,H,J,Q,T,U,W,Y,Z,$,rr,ar,vr,er,sr,or;for(or=os(a.shape,a.strides),q=or.sh,P=or.sx,r=is(a.dtype),L=a.offset,O=a.data,y=P[0],v=0,sr=q[9];sr>0;)for(sr<r?(w=sr,sr=0):(w=r,sr-=r),f=L+sr*P[9],er=q[8];er>0;)for(er<r?(B=er,er=0):(B=r,er-=r),s=P[9]-B*P[8],m=f+er*P[8],vr=q[7];vr>0;)for(vr<r?(M=vr,vr=0):(M=r,vr-=r),o=P[8]-M*P[7],x=m+vr*P[7],ar=q[6];ar>0;)for(ar<r?(A=ar,ar=0):(A=r,ar-=r),d=P[7]-A*P[6],l=x+ar*P[6],rr=q[5];rr>0;)for(rr<r?(_=rr,rr=0):(_=r,rr-=r),e=P[6]-_*P[5],p=l+rr*P[5],$=q[4];$>0;)for($<r?(E=$,$=0):(E=r,$-=r),u=P[5]-E*P[4],c=p+$*P[4],Z=q[3];Z>0;)for(Z<r?(C=Z,Z=0):(C=r,Z-=r),b=P[4]-C*P[3],i=c+Z*P[3],Y=q[2];Y>0;)for(Y<r?(g=Y,Y=0):(g=r,Y-=r),k=P[3]-g*P[2],n=i+Y*P[2],W=q[1];W>0;)for(W<r?(j=W,W=0):(j=r,W-=r),h=P[2]-j*P[1],t=n+W*P[1],U=q[0];U>0;)for(U<r?(S=U,U=0):(S=r,U-=r),K=t+U*P[0],z=P[1]-S*P[0],T=0;T<w;T++){for(Q=0;Q<B;Q++){for(J=0;J<M;J++){for(H=0;H<A;H++){for(G=0;G<_;G++){for(R=0;R<E;R++){for(I=0;I<C;I++){for(N=0;N<g;N++){for(F=0;F<j;F++){for(X=0;X<S;X++){if(O[K]&&(v+=1,v>=D))return!0;K+=y}K+=z}K+=h}K+=k}K+=b}K+=u}K+=e}K+=d}K+=o}K+=s}return!1}ta.exports=fs
-});var xa=V(function(mi,ua){
-function ts(a,D){return!!(D<=1&&a.accessors[0](a.data,a.offset))}ua.exports=ts
-});var ca=V(function(qi,la){
-function ds(a,D){var v,r,O,y,z,h,k;for(z=a.shape[0],y=a.strides[0],h=a.offset,r=a.data,O=a.accessors[0],v=0,k=0;k<z;k++){if(O(r,h)&&(v+=1,v>=D))return!0;h+=y}return!1}la.exports=ds
-});var pa=V(function(hi,na){
-var us=require('@stdlib/ndarray-base-strides2order/dist');function xs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o;for(h=a.shape,u=a.strides,us(u)===1?(k=h[1],b=h[0],y=u[1],z=u[0]-k*u[1]):(k=h[0],b=h[1],y=u[0],z=u[1]-k*u[0]),e=a.offset,r=a.data,O=a.accessors[0],v=0,o=0;o<b;o++){for(d=0;d<k;d++){if(O(r,e)&&(v+=1,v>=D))return!0;e+=y}e+=z}return!1}na.exports=xs
-});var ba=V(function(ki,Sa){
-var ls=require('@stdlib/ndarray-base-strides2order/dist');function cs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n;for(k=a.shape,d=a.strides,ls(d)===1?(b=k[2],u=k[1],e=k[0],y=d[2],z=d[1]-b*d[2],h=d[0]-u*d[1]):(b=k[0],u=k[1],e=k[2],y=d[0],z=d[1]-b*d[0],h=d[2]-u*d[1]),o=a.offset,r=a.data,O=a.accessors[0],v=0,n=0;n<e;n++){for(t=0;t<u;t++){for(s=0;s<b;s++){if(O(r,o)&&(v+=1,v>=D))return!0;o+=y}o+=z}o+=h}return!1}Sa.exports=cs
-});var ma=V(function(zi,ja){
-var ns=require('@stdlib/ndarray-base-strides2order/dist');function ps(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p;for(b=a.shape,s=a.strides,ns(s)===1?(u=b[3],e=b[2],d=b[1],o=b[0],y=s[3],z=s[2]-u*s[3],h=s[1]-e*s[2],k=s[0]-d*s[1]):(u=b[0],e=b[1],d=b[2],o=b[3],y=s[0],z=s[1]-u*s[0],h=s[2]-e*s[1],k=s[3]-d*s[2]),t=a.offset,r=a.data,O=a.accessors[0],v=0,p=0;p<o;p++){for(c=0;c<d;c++){for(i=0;i<e;i++){for(n=0;n<u;n++){if(O(r,t)&&(v+=1,v>=D))return!0;t+=y}t+=z}t+=h}t+=k}return!1}ja.exports=ps
-});var ha=V(function(Oi,qa){
-var Ss=require('@stdlib/ndarray-base-strides2order/dist');function bs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m;for(u=a.shape,n=a.strides,Ss(n)===1?(e=u[4],d=u[3],o=u[2],s=u[1],t=u[0],y=n[4],z=n[3]-e*n[4],h=n[2]-d*n[3],k=n[1]-o*n[2],b=n[0]-s*n[1]):(e=u[0],d=u[1],o=u[2],s=u[3],t=u[4],y=n[0],z=n[1]-e*n[0],h=n[2]-d*n[1],k=n[3]-o*n[2],b=n[4]-s*n[3]),i=a.offset,r=a.data,O=a.accessors[0],v=0,m=0;m<t;m++){for(x=0;x<s;x++){for(l=0;l<o;l++){for(p=0;p<d;p++){for(c=0;c<e;c++){if(O(r,i)&&(v+=1,v>=D))return!0;i+=y}i+=z}i+=h}i+=k}i+=b}return!1}qa.exports=bs
-});var za=V(function(yi,ka){
-var js=require('@stdlib/ndarray-base-strides2order/dist');function ms(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S;for(e=a.shape,c=a.strides,js(c)===1?(d=e[5],o=e[4],s=e[3],t=e[2],n=e[1],i=e[0],y=c[5],z=c[4]-d*c[5],h=c[3]-o*c[4],k=c[2]-s*c[3],b=c[1]-t*c[2],u=c[0]-n*c[1]):(d=e[0],o=e[1],s=e[2],t=e[3],n=e[4],i=e[5],y=c[0],z=c[1]-d*c[0],h=c[2]-o*c[1],k=c[3]-s*c[2],b=c[4]-t*c[3],u=c[5]-n*c[4]),p=a.offset,r=a.data,O=a.accessors[0],v=0,S=0;S<i;S++){for(q=0;q<n;q++){for(f=0;f<t;f++){for(m=0;m<s;m++){for(x=0;x<o;x++){for(l=0;l<d;l++){if(O(r,p)&&(v+=1,v>=D))return!0;p+=y}p+=z}p+=h}p+=k}p+=b}p+=u}return!1}ka.exports=ms
-});var ya=V(function(gi,Oa){
-var qs=require('@stdlib/ndarray-base-strides2order/dist');function hs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C;for(d=a.shape,l=a.strides,qs(l)===1?(o=d[6],s=d[5],t=d[4],n=d[3],i=d[2],c=d[1],p=d[0],y=l[6],z=l[5]-o*l[6],h=l[4]-s*l[5],k=l[3]-t*l[4],b=l[2]-n*l[3],u=l[1]-i*l[2],e=l[0]-c*l[1]):(o=d[0],s=d[1],t=d[2],n=d[3],i=d[4],c=d[5],p=d[6],y=l[0],z=l[1]-o*l[0],h=l[2]-s*l[1],k=l[3]-t*l[2],b=l[4]-n*l[3],u=l[5]-i*l[4],e=l[6]-c*l[5]),x=a.offset,r=a.data,O=a.accessors[0],v=0,C=0;C<p;C++){for(g=0;g<c;g++){for(j=0;j<i;j++){for(S=0;S<n;S++){for(q=0;q<t;q++){for(f=0;f<s;f++){for(m=0;m<o;m++){if(O(r,x)&&(v+=1,v>=D))return!0;x+=y}x+=z}x+=h}x+=k}x+=b}x+=u}x+=e}return!1}Oa.exports=hs
-});var Ea=V(function(Ei,ga){
-var ks=require('@stdlib/ndarray-base-strides2order/dist');function zs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A;for(o=a.shape,m=a.strides,ks(m)===1?(s=o[7],t=o[6],n=o[5],i=o[4],c=o[3],p=o[2],l=o[1],x=o[0],y=m[7],z=m[6]-s*m[7],h=m[5]-t*m[6],k=m[4]-n*m[5],b=m[3]-i*m[4],u=m[2]-c*m[3],e=m[1]-p*m[2],d=m[0]-l*m[1]):(s=o[0],t=o[1],n=o[2],i=o[3],c=o[4],p=o[5],l=o[6],x=o[7],y=m[0],z=m[1]-s*m[0],h=m[2]-t*m[1],k=m[3]-n*m[2],b=m[4]-i*m[3],u=m[5]-c*m[4],e=m[6]-p*m[5],d=m[7]-l*m[6]),f=a.offset,r=a.data,O=a.accessors[0],v=0,A=0;A<x;A++){for(_=0;_<l;_++){for(E=0;E<p;E++){for(C=0;C<c;C++){for(g=0;g<i;g++){for(j=0;j<n;j++){for(S=0;S<t;S++){for(q=0;q<s;q++){if(O(r,f)&&(v+=1,v>=D))return!0;f+=y}f+=z}f+=h}f+=k}f+=b}f+=u}f+=e}f+=d}return!1}ga.exports=zs
-});var Ca=V(function(Mi,Ma){
-var Os=require('@stdlib/ndarray-base-strides2order/dist');function ys(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w;for(s=a.shape,q=a.strides,Os(q)===1?(t=s[8],n=s[7],i=s[6],c=s[5],p=s[4],l=s[3],x=s[2],m=s[1],f=s[0],y=q[8],z=q[7]-t*q[8],h=q[6]-n*q[7],k=q[5]-i*q[6],b=q[4]-c*q[5],u=q[3]-p*q[4],e=q[2]-l*q[3],d=q[1]-x*q[2],o=q[0]-m*q[1]):(t=s[0],n=s[1],i=s[2],c=s[3],p=s[4],l=s[5],x=s[6],m=s[7],f=s[8],y=q[0],z=q[1]-t*q[0],h=q[2]-n*q[1],k=q[3]-i*q[2],b=q[4]-c*q[3],u=q[5]-p*q[4],e=q[6]-l*q[5],d=q[7]-x*q[6],o=q[8]-m*q[7]),S=a.offset,r=a.data,O=a.accessors[0],v=0,w=0;w<f;w++){for(B=0;B<m;B++){for(M=0;M<x;M++){for(A=0;A<l;A++){for(_=0;_<p;_++){for(E=0;E<c;E++){for(C=0;C<i;C++){for(g=0;g<n;g++){for(j=0;j<t;j++){if(O(r,S)&&(v+=1,v>=D))return!0;S+=y}S+=z}S+=h}S+=k}S+=b}S+=u}S+=e}S+=d}S+=o}return!1}Ma.exports=ys
-});var _a=V(function(Ci,Pa){
-var gs=require('@stdlib/ndarray-base-strides2order/dist');function Es(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L,K;for(t=a.shape,j=a.strides,gs(j)===1?(n=t[9],i=t[8],c=t[7],p=t[6],l=t[5],x=t[4],m=t[3],f=t[2],q=t[1],S=t[0],y=j[9],z=j[8]-n*j[9],h=j[7]-i*j[8],k=j[6]-c*j[7],b=j[5]-p*j[6],u=j[4]-l*j[5],e=j[3]-x*j[4],d=j[2]-m*j[3],o=j[1]-f*j[2],s=j[0]-q*j[1]):(n=t[0],i=t[1],c=t[2],p=t[3],l=t[4],x=t[5],m=t[6],f=t[7],q=t[8],S=t[9],y=j[0],z=j[1]-n*j[0],h=j[2]-i*j[1],k=j[3]-c*j[2],b=j[4]-p*j[3],u=j[5]-l*j[4],e=j[6]-x*j[5],d=j[7]-m*j[6],o=j[8]-f*j[7],s=j[9]-q*j[8]),g=a.offset,r=a.data,O=a.accessors[0],v=0,K=0;K<S;K++){for(L=0;L<q;L++){for(P=0;P<f;P++){for(w=0;w<m;w++){for(B=0;B<x;B++){for(M=0;M<l;M++){for(A=0;A<p;A++){for(_=0;_<c;_++){for(E=0;E<i;E++){for(C=0;C<n;C++){if(O(r,g)&&(v+=1,v>=D))return!0;g+=y}g+=z}g+=h}g+=k}g+=b}g+=u}g+=e}g+=d}g+=o}g+=s}return!1}Pa.exports=Es
-});var Ba=V(function(Pi,Da){
-var Ms=require('@stdlib/ndarray-base-numel/dist'),Cs=require('@stdlib/ndarray-base-vind2bind/dist'),Ps="throw";function _s(a,D){var v,r,O,y,z,h,k,b,u,e;for(h=a.shape,y=Ms(h),r=a.data,k=a.strides,b=a.offset,O=a.order,z=a.accessors[0],v=0,e=0;e<y;e++)if(u=Cs(h,k,b,O,e,Ps),z(r,u)&&(v+=1,v>=D))return!0;return!1}Da.exports=_s
-});var La=V(function(_i,Aa){
-function Ds(a,D){return!!(D<=1&&(a.data[a.offset]||a.data[a.offset+1]))}Aa.exports=Ds
-});var Ka=V(function(Di,wa){
-function Bs(a,D){var v,r,O,y,z,h;for(y=a.shape[0],O=a.strides[0],z=a.offset,r=a.data,v=0,h=0;h<y;h++){if((r[z]||r[z+1])&&(v+=1,v>=D))return!0;z+=O}return!1}wa.exports=Bs
-});var Ia=V(function(Bi,Xa){
-var As=require('@stdlib/ndarray-base-strides2order/dist');function Ls(a,D){var v,r,O,y,z,h,k,b,u,e,d;for(z=a.shape,b=a.strides,As(b)===1?(h=z[1],k=z[0],O=b[1],y=b[0]-h*b[1]):(h=z[0],k=z[1],O=b[0],y=b[1]-h*b[0]),u=a.offset,r=a.data,v=0,d=0;d<k;d++){for(e=0;e<h;e++){if((r[u]||r[u+1])&&(v+=1,v>=D))return!0;u+=O}u+=y}return!1}Xa.exports=Ls
-});var Na=V(function(Ai,Ra){
-var ws=require('@stdlib/ndarray-base-strides2order/dist');function Ks(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t;for(h=a.shape,e=a.strides,ws(e)===1?(k=h[2],b=h[1],u=h[0],O=e[2],y=e[1]-k*e[2],z=e[0]-b*e[1]):(k=h[0],b=h[1],u=h[2],O=e[0],y=e[1]-k*e[0],z=e[2]-b*e[1]),d=a.offset,r=a.data,v=0,t=0;t<u;t++){for(s=0;s<b;s++){for(o=0;o<k;o++){if((r[d]||r[d+1])&&(v+=1,v>=D))return!0;d+=O}d+=y}d+=z}return!1}Ra.exports=Ks
-});var Fa=V(function(Li,Va){
-var Xs=require('@stdlib/ndarray-base-strides2order/dist');function Is(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c;for(k=a.shape,o=a.strides,Xs(o)===1?(b=k[3],u=k[2],e=k[1],d=k[0],O=o[3],y=o[2]-b*o[3],z=o[1]-u*o[2],h=o[0]-e*o[1]):(b=k[0],u=k[1],e=k[2],d=k[3],O=o[0],y=o[1]-b*o[0],z=o[2]-u*o[1],h=o[3]-e*o[2]),s=a.offset,r=a.data,v=0,c=0;c<d;c++){for(i=0;i<e;i++){for(n=0;n<u;n++){for(t=0;t<b;t++){if((r[s]||r[s+1])&&(v+=1,v>=D))return!0;s+=O}s+=y}s+=z}s+=h}return!1}Va.exports=Is
-});var Ha=V(function(wi,Ga){
-var Rs=require('@stdlib/ndarray-base-strides2order/dist');function Ns(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x;for(b=a.shape,t=a.strides,Rs(t)===1?(u=b[4],e=b[3],d=b[2],o=b[1],s=b[0],O=t[4],y=t[3]-u*t[4],z=t[2]-e*t[3],h=t[1]-d*t[2],k=t[0]-o*t[1]):(u=b[0],e=b[1],d=b[2],o=b[3],s=b[4],O=t[0],y=t[1]-u*t[0],z=t[2]-e*t[1],h=t[3]-d*t[2],k=t[4]-o*t[3]),n=a.offset,r=a.data,v=0,x=0;x<s;x++){for(l=0;l<o;l++){for(p=0;p<d;p++){for(c=0;c<e;c++){for(i=0;i<u;i++){if((r[n]||r[n+1])&&(v+=1,v>=D))return!0;n+=O}n+=y}n+=z}n+=h}n+=k}return!1}Ga.exports=Ns
-});var Qa=V(function(Ki,Ja){
-var Vs=require('@stdlib/ndarray-base-strides2order/dist');function Fs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q;for(u=a.shape,i=a.strides,Vs(i)===1?(e=u[5],d=u[4],o=u[3],s=u[2],t=u[1],n=u[0],O=i[5],y=i[4]-e*i[5],z=i[3]-d*i[4],h=i[2]-o*i[3],k=i[1]-s*i[2],b=i[0]-t*i[1]):(e=u[0],d=u[1],o=u[2],s=u[3],t=u[4],n=u[5],O=i[0],y=i[1]-e*i[0],z=i[2]-d*i[1],h=i[3]-o*i[2],k=i[4]-s*i[3],b=i[5]-t*i[4]),c=a.offset,r=a.data,v=0,q=0;q<n;q++){for(f=0;f<t;f++){for(m=0;m<s;m++){for(x=0;x<o;x++){for(l=0;l<d;l++){for(p=0;p<e;p++){if((r[c]||r[c+1])&&(v+=1,v>=D))return!0;c+=O}c+=y}c+=z}c+=h}c+=k}c+=b}return!1}Ja.exports=Fs
-});var Ua=V(function(Xi,Ta){
-var Gs=require('@stdlib/ndarray-base-strides2order/dist');function Hs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g;for(e=a.shape,p=a.strides,Gs(p)===1?(d=e[6],o=e[5],s=e[4],t=e[3],n=e[2],i=e[1],c=e[0],O=p[6],y=p[5]-d*p[6],z=p[4]-o*p[5],h=p[3]-s*p[4],k=p[2]-t*p[3],b=p[1]-n*p[2],u=p[0]-i*p[1]):(d=e[0],o=e[1],s=e[2],t=e[3],n=e[4],i=e[5],c=e[6],O=p[0],y=p[1]-d*p[0],z=p[2]-o*p[1],h=p[3]-s*p[2],k=p[4]-t*p[3],b=p[5]-n*p[4],u=p[6]-i*p[5]),l=a.offset,r=a.data,v=0,g=0;g<c;g++){for(j=0;j<i;j++){for(S=0;S<n;S++){for(q=0;q<t;q++){for(f=0;f<s;f++){for(m=0;m<o;m++){for(x=0;x<d;x++){if((r[l]||r[l+1])&&(v+=1,v>=D))return!0;l+=O}l+=y}l+=z}l+=h}l+=k}l+=b}l+=u}return!1}Ta.exports=Hs
-});var Ya=V(function(Ii,Wa){
-var Js=require('@stdlib/ndarray-base-strides2order/dist');function Qs(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_;for(d=a.shape,x=a.strides,Js(x)===1?(o=d[7],s=d[6],t=d[5],n=d[4],i=d[3],c=d[2],p=d[1],l=d[0],O=x[7],y=x[6]-o*x[7],z=x[5]-s*x[6],h=x[4]-t*x[5],k=x[3]-n*x[4],b=x[2]-i*x[3],u=x[1]-c*x[2],e=x[0]-p*x[1]):(o=d[0],s=d[1],t=d[2],n=d[3],i=d[4],c=d[5],p=d[6],l=d[7],O=x[0],y=x[1]-o*x[0],z=x[2]-s*x[1],h=x[3]-t*x[2],k=x[4]-n*x[3],b=x[5]-i*x[4],u=x[6]-c*x[5],e=x[7]-p*x[6]),m=a.offset,r=a.data,v=0,_=0;_<l;_++){for(E=0;E<p;E++){for(C=0;C<c;C++){for(g=0;g<i;g++){for(j=0;j<n;j++){for(S=0;S<t;S++){for(q=0;q<s;q++){for(f=0;f<o;f++){if((r[m]||r[m+1])&&(v+=1,v>=D))return!0;m+=O}m+=y}m+=z}m+=h}m+=k}m+=b}m+=u}m+=e}return!1}Wa.exports=Qs
-});var $a=V(function(Ri,Za){
-var Ts=require('@stdlib/ndarray-base-strides2order/dist');function Us(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B;for(o=a.shape,f=a.strides,Ts(f)===1?(s=o[8],t=o[7],n=o[6],i=o[5],c=o[4],p=o[3],l=o[2],x=o[1],m=o[0],O=f[8],y=f[7]-s*f[8],z=f[6]-t*f[7],h=f[5]-n*f[6],k=f[4]-i*f[5],b=f[3]-c*f[4],u=f[2]-p*f[3],e=f[1]-l*f[2],d=f[0]-x*f[1]):(s=o[0],t=o[1],n=o[2],i=o[3],c=o[4],p=o[5],l=o[6],x=o[7],m=o[8],O=f[0],y=f[1]-s*f[0],z=f[2]-t*f[1],h=f[3]-n*f[2],k=f[4]-i*f[3],b=f[5]-c*f[4],u=f[6]-p*f[5],e=f[7]-l*f[6],d=f[8]-x*f[7]),q=a.offset,r=a.data,v=0,B=0;B<m;B++){for(M=0;M<x;M++){for(A=0;A<l;A++){for(_=0;_<p;_++){for(E=0;E<c;E++){for(C=0;C<i;C++){for(g=0;g<n;g++){for(j=0;j<t;j++){for(S=0;S<s;S++){if((r[q]||r[q+1])&&(v+=1,v>=D))return!0;q+=O}q+=y}q+=z}q+=h}q+=k}q+=b}q+=u}q+=e}q+=d}return!1}Za.exports=Us
-});var av=V(function(Ni,rv){
-var Ws=require('@stdlib/ndarray-base-strides2order/dist');function Ys(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L;for(s=a.shape,S=a.strides,Ws(S)===1?(t=s[9],n=s[8],i=s[7],c=s[6],p=s[5],l=s[4],x=s[3],m=s[2],f=s[1],q=s[0],O=S[9],y=S[8]-t*S[9],z=S[7]-n*S[8],h=S[6]-i*S[7],k=S[5]-c*S[6],b=S[4]-p*S[5],u=S[3]-l*S[4],e=S[2]-x*S[3],d=S[1]-m*S[2],o=S[0]-f*S[1]):(t=s[0],n=s[1],i=s[2],c=s[3],p=s[4],l=s[5],x=s[6],m=s[7],f=s[8],q=s[9],O=S[0],y=S[1]-t*S[0],z=S[2]-n*S[1],h=S[3]-i*S[2],k=S[4]-c*S[3],b=S[5]-p*S[4],u=S[6]-l*S[5],e=S[7]-x*S[6],d=S[8]-m*S[7],o=S[9]-f*S[8]),j=a.offset,r=a.data,v=0,L=0;L<q;L++){for(P=0;P<f;P++){for(w=0;w<m;w++){for(B=0;B<x;B++){for(M=0;M<l;M++){for(A=0;A<p;A++){for(_=0;_<c;_++){for(E=0;E<i;E++){for(C=0;C<n;C++){for(g=0;g<t;g++){if((r[j]||r[j+1])&&(v+=1,v>=D))return!0;j+=O}j+=y}j+=z}j+=h}j+=k}j+=b}j+=u}j+=e}j+=d}j+=o}return!1}rv.exports=Ys
-});var ev=V(function(Vi,vv){
-var Zs=require('@stdlib/ndarray-base-numel/dist'),$s=require('@stdlib/ndarray-base-vind2bind/dist'),ro="throw";function ao(a,D){var v,r,O,y,z,h,k,b,u;for(z=a.shape,y=Zs(z),r=a.data,h=a.strides,k=a.offset,O=a.order,v=0,u=0;u<y;u++)if(b=$s(z,h,k,O,u,ro),(r[b]||r[b+1])&&(v+=1,v>=D))return!0;return!1}vv.exports=ao
-});var ov=V(function(Fi,sv){
-function vo(a,D){return!!(D<=1&&a.data[a.offset])}sv.exports=vo
-});var fv=V(function(Gi,iv){
-function eo(a,D){var v,r,O,y,z,h;for(y=a.shape[0],O=a.strides[0],z=a.offset,r=a.data,v=0,h=0;h<y;h++){if(r[z]&&(v+=1,v>=D))return!0;z+=O}return!1}iv.exports=eo
-});var dv=V(function(Hi,tv){
-var so=require('@stdlib/ndarray-base-strides2order/dist');function oo(a,D){var v,r,O,y,z,h,k,b,u,e,d;for(z=a.shape,b=a.strides,so(b)===1?(h=z[1],k=z[0],O=b[1],y=b[0]-h*b[1]):(h=z[0],k=z[1],O=b[0],y=b[1]-h*b[0]),u=a.offset,r=a.data,v=0,d=0;d<k;d++){for(e=0;e<h;e++){if(r[u]&&(v+=1,v>=D))return!0;u+=O}u+=y}return!1}tv.exports=oo
-});var xv=V(function(Ji,uv){
-var io=require('@stdlib/ndarray-base-strides2order/dist');function fo(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t;for(h=a.shape,e=a.strides,io(e)===1?(k=h[2],b=h[1],u=h[0],O=e[2],y=e[1]-k*e[2],z=e[0]-b*e[1]):(k=h[0],b=h[1],u=h[2],O=e[0],y=e[1]-k*e[0],z=e[2]-b*e[1]),d=a.offset,r=a.data,v=0,t=0;t<u;t++){for(s=0;s<b;s++){for(o=0;o<k;o++){if(r[d]&&(v+=1,v>=D))return!0;d+=O}d+=y}d+=z}return!1}uv.exports=fo
-});var cv=V(function(Qi,lv){
-var to=require('@stdlib/ndarray-base-strides2order/dist');function uo(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c;for(k=a.shape,o=a.strides,to(o)===1?(b=k[3],u=k[2],e=k[1],d=k[0],O=o[3],y=o[2]-b*o[3],z=o[1]-u*o[2],h=o[0]-e*o[1]):(b=k[0],u=k[1],e=k[2],d=k[3],O=o[0],y=o[1]-b*o[0],z=o[2]-u*o[1],h=o[3]-e*o[2]),s=a.offset,r=a.data,v=0,c=0;c<d;c++){for(i=0;i<e;i++){for(n=0;n<u;n++){for(t=0;t<b;t++){if(r[s]&&(v+=1,v>=D))return!0;s+=O}s+=y}s+=z}s+=h}return!1}lv.exports=uo
-});var pv=V(function(Ti,nv){
-var xo=require('@stdlib/ndarray-base-strides2order/dist');function lo(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x;for(b=a.shape,t=a.strides,xo(t)===1?(u=b[4],e=b[3],d=b[2],o=b[1],s=b[0],O=t[4],y=t[3]-u*t[4],z=t[2]-e*t[3],h=t[1]-d*t[2],k=t[0]-o*t[1]):(u=b[0],e=b[1],d=b[2],o=b[3],s=b[4],O=t[0],y=t[1]-u*t[0],z=t[2]-e*t[1],h=t[3]-d*t[2],k=t[4]-o*t[3]),n=a.offset,r=a.data,v=0,x=0;x<s;x++){for(l=0;l<o;l++){for(p=0;p<d;p++){for(c=0;c<e;c++){for(i=0;i<u;i++){if(r[n]&&(v+=1,v>=D))return!0;n+=O}n+=y}n+=z}n+=h}n+=k}return!1}nv.exports=lo
-});var bv=V(function(Ui,Sv){
-var co=require('@stdlib/ndarray-base-strides2order/dist');function no(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q;for(u=a.shape,i=a.strides,co(i)===1?(e=u[5],d=u[4],o=u[3],s=u[2],t=u[1],n=u[0],O=i[5],y=i[4]-e*i[5],z=i[3]-d*i[4],h=i[2]-o*i[3],k=i[1]-s*i[2],b=i[0]-t*i[1]):(e=u[0],d=u[1],o=u[2],s=u[3],t=u[4],n=u[5],O=i[0],y=i[1]-e*i[0],z=i[2]-d*i[1],h=i[3]-o*i[2],k=i[4]-s*i[3],b=i[5]-t*i[4]),c=a.offset,r=a.data,v=0,q=0;q<n;q++){for(f=0;f<t;f++){for(m=0;m<s;m++){for(x=0;x<o;x++){for(l=0;l<d;l++){for(p=0;p<e;p++){if(r[c]&&(v+=1,v>=D))return!0;c+=O}c+=y}c+=z}c+=h}c+=k}c+=b}return!1}Sv.exports=no
-});var mv=V(function(Wi,jv){
-var po=require('@stdlib/ndarray-base-strides2order/dist');function So(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g;for(e=a.shape,p=a.strides,po(p)===1?(d=e[6],o=e[5],s=e[4],t=e[3],n=e[2],i=e[1],c=e[0],O=p[6],y=p[5]-d*p[6],z=p[4]-o*p[5],h=p[3]-s*p[4],k=p[2]-t*p[3],b=p[1]-n*p[2],u=p[0]-i*p[1]):(d=e[0],o=e[1],s=e[2],t=e[3],n=e[4],i=e[5],c=e[6],O=p[0],y=p[1]-d*p[0],z=p[2]-o*p[1],h=p[3]-s*p[2],k=p[4]-t*p[3],b=p[5]-n*p[4],u=p[6]-i*p[5]),l=a.offset,r=a.data,v=0,g=0;g<c;g++){for(j=0;j<i;j++){for(S=0;S<n;S++){for(q=0;q<t;q++){for(f=0;f<s;f++){for(m=0;m<o;m++){for(x=0;x<d;x++){if(r[l]&&(v+=1,v>=D))return!0;l+=O}l+=y}l+=z}l+=h}l+=k}l+=b}l+=u}return!1}jv.exports=So
-});var hv=V(function(Yi,qv){
-var bo=require('@stdlib/ndarray-base-strides2order/dist');function jo(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_;for(d=a.shape,x=a.strides,bo(x)===1?(o=d[7],s=d[6],t=d[5],n=d[4],i=d[3],c=d[2],p=d[1],l=d[0],O=x[7],y=x[6]-o*x[7],z=x[5]-s*x[6],h=x[4]-t*x[5],k=x[3]-n*x[4],b=x[2]-i*x[3],u=x[1]-c*x[2],e=x[0]-p*x[1]):(o=d[0],s=d[1],t=d[2],n=d[3],i=d[4],c=d[5],p=d[6],l=d[7],O=x[0],y=x[1]-o*x[0],z=x[2]-s*x[1],h=x[3]-t*x[2],k=x[4]-n*x[3],b=x[5]-i*x[4],u=x[6]-c*x[5],e=x[7]-p*x[6]),m=a.offset,r=a.data,v=0,_=0;_<l;_++){for(E=0;E<p;E++){for(C=0;C<c;C++){for(g=0;g<i;g++){for(j=0;j<n;j++){for(S=0;S<t;S++){for(q=0;q<s;q++){for(f=0;f<o;f++){if(r[m]&&(v+=1,v>=D))return!0;m+=O}m+=y}m+=z}m+=h}m+=k}m+=b}m+=u}m+=e}return!1}qv.exports=jo
-});var zv=V(function(Zi,kv){
-var mo=require('@stdlib/ndarray-base-strides2order/dist');function qo(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B;for(o=a.shape,f=a.strides,mo(f)===1?(s=o[8],t=o[7],n=o[6],i=o[5],c=o[4],p=o[3],l=o[2],x=o[1],m=o[0],O=f[8],y=f[7]-s*f[8],z=f[6]-t*f[7],h=f[5]-n*f[6],k=f[4]-i*f[5],b=f[3]-c*f[4],u=f[2]-p*f[3],e=f[1]-l*f[2],d=f[0]-x*f[1]):(s=o[0],t=o[1],n=o[2],i=o[3],c=o[4],p=o[5],l=o[6],x=o[7],m=o[8],O=f[0],y=f[1]-s*f[0],z=f[2]-t*f[1],h=f[3]-n*f[2],k=f[4]-i*f[3],b=f[5]-c*f[4],u=f[6]-p*f[5],e=f[7]-l*f[6],d=f[8]-x*f[7]),q=a.offset,r=a.data,v=0,B=0;B<m;B++){for(M=0;M<x;M++){for(A=0;A<l;A++){for(_=0;_<p;_++){for(E=0;E<c;E++){for(C=0;C<i;C++){for(g=0;g<n;g++){for(j=0;j<t;j++){for(S=0;S<s;S++){if(r[q]&&(v+=1,v>=D))return!0;q+=O}q+=y}q+=z}q+=h}q+=k}q+=b}q+=u}q+=e}q+=d}return!1}kv.exports=qo
-});var yv=V(function($i,Ov){
-var ho=require('@stdlib/ndarray-base-strides2order/dist');function ko(a,D){var v,r,O,y,z,h,k,b,u,e,d,o,s,t,n,i,c,p,l,x,m,f,q,S,j,g,C,E,_,A,M,B,w,P,L;for(s=a.shape,S=a.strides,ho(S)===1?(t=s[9],n=s[8],i=s[7],c=s[6],p=s[5],l=s[4],x=s[3],m=s[2],f=s[1],q=s[0],O=S[9],y=S[8]-t*S[9],z=S[7]-n*S[8],h=S[6]-i*S[7],k=S[5]-c*S[6],b=S[4]-p*S[5],u=S[3]-l*S[4],e=S[2]-x*S[3],d=S[1]-m*S[2],o=S[0]-f*S[1]):(t=s[0],n=s[1],i=s[2],c=s[3],p=s[4],l=s[5],x=s[6],m=s[7],f=s[8],q=s[9],O=S[0],y=S[1]-t*S[0],z=S[2]-n*S[1],h=S[3]-i*S[2],k=S[4]-c*S[3],b=S[5]-p*S[4],u=S[6]-l*S[5],e=S[7]-x*S[6],d=S[8]-m*S[7],o=S[9]-f*S[8]),j=a.offset,r=a.data,v=0,L=0;L<q;L++){for(P=0;P<f;P++){for(w=0;w<m;w++){for(B=0;B<x;B++){for(M=0;M<l;M++){for(A=0;A<p;A++){for(_=0;_<c;_++){for(E=0;E<i;E++){for(C=0;C<n;C++){for(g=0;g<t;g++){if(r[j]&&(v+=1,v>=D))return!0;j+=O}j+=y}j+=z}j+=h}j+=k}j+=b}j+=u}j+=e}j+=d}j+=o}return!1}Ov.exports=ko
-});var Ev=V(function(rf,gv){
-var zo=require('@stdlib/ndarray-base-numel/dist'),Oo=require('@stdlib/ndarray-base-vind2bind/dist'),yo="throw";function go(a,D){var v,r,O,y,z,h,k,b,u;for(z=a.shape,y=zo(z),r=a.data,h=a.strides,k=a.offset,O=a.order,v=0,u=0;u<y;u++)if(b=Oo(z,h,k,O,u,yo),r[b]&&(v+=1,v>=D))return!0;return!1}gv.exports=go
-});var Av=V(function(af,Bv){
-var Eo=require('@stdlib/array-base-assert-is-complex-typed-array/dist'),Mo=require('@stdlib/array-base-assert-is-booleanarray/dist'),Co=require('@stdlib/ndarray-base-iteration-order/dist'),Po=require('@stdlib/ndarray-base-minmax-view-buffer-index/dist'),Mv=require('@stdlib/ndarray-base-ndarraylike2object/dist'),_o=require('@stdlib/strided-base-reinterpret-complex/dist'),Do=require('@stdlib/strided-base-reinterpret-boolean/dist'),Bo=require('@stdlib/blas-base-gscal/dist'),Ao=xr(),Lo=cr(),wo=pr(),Ko=br(),Xo=mr(),Io=hr(),Ro=zr(),No=yr(),Vo=Er(),Fo=Cr(),Go=_r(),Ho=Br(),Jo=Lr(),Qo=Kr(),To=Ir(),Uo=Nr(),Wo=Fr(),Yo=Hr(),Zo=Qr(),$o=Ur(),r0=Yr(),a0=$r(),v0=aa(),e0=ea(),s0=oa(),o0=fa(),i0=da(),f0=xa(),t0=ca(),d0=pa(),u0=ba(),x0=ma(),l0=ha(),c0=za(),n0=ya(),p0=Ea(),S0=Ca(),b0=_a(),Pv=Ba(),j0=La(),m0=Ka(),q0=Ia(),h0=Na(),k0=Fa(),z0=Ha(),O0=Qa(),y0=Ua(),g0=Ya(),E0=$a(),M0=av(),_v=ev(),C0=ov(),P0=fv(),_0=dv(),D0=xv(),B0=cv(),A0=pv(),L0=bv(),w0=mv(),K0=hv(),X0=zv(),I0=yv(),Dv=Ev(),ir=[C0,P0,_0,D0,B0,A0,L0,w0,K0,X0,I0,Dv],fr=[f0,t0,d0,u0,x0,l0,c0,n0,p0,S0,b0,Pv],tr=[j0,m0,q0,h0,k0,z0,O0,y0,g0,E0,M0,_v],R0=[Zo,$o,r0,a0,v0,e0,s0,o0,i0],N0=[Ao,Lo,wo,Ko,Xo,Io,Ro,No,Vo],V0=[Fo,Go,Ho,Jo,Qo,To,Uo,Wo,Yo],Cv=ir.length-1;function F0(a){var D,v,r,O,y,z,h,k,b,u,e,d,o,s;if(e=Mv(a[0]),d=Mv(a[1]),O=e.shape,v=O.length,u=d.accessors[0](d.data,d.offset),Mo(e.data)?(e.data=Do(e.data,0),e.accessorProtocol=!1):Eo(e.data)&&(e.data=_o(e.data,0),e.accessorProtocol=!1,e.strides=Bo(v,2,e.strides,1),e.offset*=2,D=!0),v===0)return e.accessorProtocol?fr[v](e,u):D?tr[v](e,u):ir[v](e,u);for(z=1,b=0,s=0;s<v;s++)o=O[s],z*=o,o===1&&(b+=1);if(z===0)return!1;if(v===1)return e.accessorProtocol?fr[v](e,u):D?tr[v](e,u):ir[v](e,u);if(h=e.strides,b===v-1){for(s=0;s<v&&O[s]===1;s++);return e.shape=[O[s]],e.strides=[h[s]],e.accessorProtocol?fr[1](e,u):D?tr[1](e,u):ir[1](e,u)}if(y=Co(h),y!==0){if(r=Po(O,h,e.offset),z===r[1]-r[0]+1||D&&z*2===r[1]-r[0]+2)return y===1?k=r[0]:k=r[1],e.shape=[z],e.strides=[D?y*2:y],e.offset=k,e.accessorProtocol?fr[1](e,u):D?tr[1](e,u):ir[1](e,u);if(v<=Cv)return e.accessorProtocol?fr[v](e,u):D?tr[v](e,u):ir[v](e,u)}return v<=Cv?e.accessorProtocol?N0[v-2](e,u):D?V0[v-2](e,u):R0[v-2](e,u):e.accessorProtocol?Pv(e,u):D?_v(e,u):Dv(e,u)}Bv.exports=F0
-});var G0=Av();module.exports=G0;
-/** @license Apache-2.0 */
-//# sourceMappingURL=index.js.map
diff --git a/dist/index.js.map b/dist/index.js.map
deleted file mode 100644
index 75a631c..0000000
--- a/dist/index.js.map
+++ /dev/null
@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../lib/2d_blocked_accessors.js", "../lib/3d_blocked_accessors.js", "../lib/4d_blocked_accessors.js", "../lib/5d_blocked_accessors.js", "../lib/6d_blocked_accessors.js", "../lib/7d_blocked_accessors.js", "../lib/8d_blocked_accessors.js", "../lib/9d_blocked_accessors.js", "../lib/10d_blocked_accessors.js", "../lib/2d_blocked_complex.js", "../lib/3d_blocked_complex.js", "../lib/4d_blocked_complex.js", "../lib/5d_blocked_complex.js", "../lib/6d_blocked_complex.js", "../lib/7d_blocked_complex.js", "../lib/8d_blocked_complex.js", "../lib/9d_blocked_complex.js", "../lib/10d_blocked_complex.js", "../lib/2d_blocked.js", "../lib/3d_blocked.js", "../lib/4d_blocked.js", "../lib/5d_blocked.js", "../lib/6d_blocked.js", "../lib/7d_blocked.js", "../lib/8d_blocked.js", "../lib/9d_blocked.js", "../lib/10d_blocked.js", "../lib/0d_accessors.js", "../lib/1d_accessors.js", "../lib/2d_accessors.js", "../lib/3d_accessors.js", "../lib/4d_accessors.js", "../lib/5d_accessors.js", "../lib/6d_accessors.js", "../lib/7d_accessors.js", "../lib/8d_accessors.js", "../lib/9d_accessors.js", "../lib/10d_accessors.js", "../lib/nd_accessors.js", "../lib/0d_complex.js", "../lib/1d_complex.js", "../lib/2d_complex.js", "../lib/3d_complex.js", "../lib/4d_complex.js", "../lib/5d_complex.js", "../lib/6d_complex.js", "../lib/7d_complex.js", "../lib/8d_complex.js", "../lib/9d_complex.js", "../lib/10d_complex.js", "../lib/nd_complex.js", "../lib/0d.js", "../lib/1d.js", "../lib/2d.js", "../lib/3d.js", "../lib/4d.js", "../lib/5d.js", "../lib/6d.js", "../lib/7d.js", "../lib/8d.js", "../lib/9d.js", "../lib/10d.js", "../lib/nd.js", "../lib/main.js", "../lib/index.js"],
-  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray is truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedsome10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.accessors[ 0 ]( x.data, x.offset ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar get;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = somend;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && ( x.data[ x.offset ] || x.data[ x.offset+1 ] ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 4 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the output ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = somend;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.data[ x.offset ] ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MODULES //\n\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = some10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = somend;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexArray = require( '@stdlib/array-base-assert-is-complex-typed-array' );\nvar isBooleanArray = require( '@stdlib/array-base-assert-is-booleanarray' );\nvar iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );\nvar minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' );\nvar ndarray2object = require( '@stdlib/ndarray-base-ndarraylike2object' );\nvar reinterpretComplex = require( '@stdlib/strided-base-reinterpret-complex' );\nvar reinterpretBoolean = require( '@stdlib/strided-base-reinterpret-boolean' );\nvar gscal = require( '@stdlib/blas-base-gscal' );\nvar blockedaccessorsome2d = require( './2d_blocked_accessors.js' );\nvar blockedaccessorsome3d = require( './3d_blocked_accessors.js' );\nvar blockedaccessorsome4d = require( './4d_blocked_accessors.js' );\nvar blockedaccessorsome5d = require( './5d_blocked_accessors.js' );\nvar blockedaccessorsome6d = require( './6d_blocked_accessors.js' );\nvar blockedaccessorsome7d = require( './7d_blocked_accessors.js' );\nvar blockedaccessorsome8d = require( './8d_blocked_accessors.js' );\nvar blockedaccessorsome9d = require( './9d_blocked_accessors.js' );\nvar blockedaccessorsome10d = require( './10d_blocked_accessors.js' );\nvar blockedcomplexsome2d = require( './2d_blocked_complex.js' );\nvar blockedcomplexsome3d = require( './3d_blocked_complex.js' );\nvar blockedcomplexsome4d = require( './4d_blocked_complex.js' );\nvar blockedcomplexsome5d = require( './5d_blocked_complex.js' );\nvar blockedcomplexsome6d = require( './6d_blocked_complex.js' );\nvar blockedcomplexsome7d = require( './7d_blocked_complex.js' );\nvar blockedcomplexsome8d = require( './8d_blocked_complex.js' );\nvar blockedcomplexsome9d = require( './9d_blocked_complex.js' );\nvar blockedcomplexsome10d = require( './10d_blocked_complex.js' );\nvar blockedsome2d = require( './2d_blocked.js' );\nvar blockedsome3d = require( './3d_blocked.js' );\nvar blockedsome4d = require( './4d_blocked.js' );\nvar blockedsome5d = require( './5d_blocked.js' );\nvar blockedsome6d = require( './6d_blocked.js' );\nvar blockedsome7d = require( './7d_blocked.js' );\nvar blockedsome8d = require( './8d_blocked.js' );\nvar blockedsome9d = require( './9d_blocked.js' );\nvar blockedsome10d = require( './10d_blocked.js' );\nvar accessorsome0d = require( './0d_accessors.js' );\nvar accessorsome1d = require( './1d_accessors.js' );\nvar accessorsome2d = require( './2d_accessors.js' );\nvar accessorsome3d = require( './3d_accessors.js' );\nvar accessorsome4d = require( './4d_accessors.js' );\nvar accessorsome5d = require( './5d_accessors.js' );\nvar accessorsome6d = require( './6d_accessors.js' );\nvar accessorsome7d = require( './7d_accessors.js' );\nvar accessorsome8d = require( './8d_accessors.js' );\nvar accessorsome9d = require( './9d_accessors.js' );\nvar accessorsome10d = require( './10d_accessors.js' );\nvar accessorsomend = require( './nd_accessors.js' );\nvar complexsome0d = require( './0d_complex.js' );\nvar complexsome1d = require( './1d_complex.js' );\nvar complexsome2d = require( './2d_complex.js' );\nvar complexsome3d = require( './3d_complex.js' );\nvar complexsome4d = require( './4d_complex.js' );\nvar complexsome5d = require( './5d_complex.js' );\nvar complexsome6d = require( './6d_complex.js' );\nvar complexsome7d = require( './7d_complex.js' );\nvar complexsome8d = require( './8d_complex.js' );\nvar complexsome9d = require( './9d_complex.js' );\nvar complexsome10d = require( './10d_complex.js' );\nvar complexsomend = require( './nd_complex.js' );\nvar some0d = require( './0d.js' );\nvar some1d = require( './1d.js' );\nvar some2d = require( './2d.js' );\nvar some3d = require( './3d.js' );\nvar some4d = require( './4d.js' );\nvar some5d = require( './5d.js' );\nvar some6d = require( './6d.js' );\nvar some7d = require( './7d.js' );\nvar some8d = require( './8d.js' );\nvar some9d = require( './9d.js' );\nvar some10d = require( './10d.js' );\nvar somend = require( './nd.js' );\n\n\n// VARIABLES //\n\nvar SOME = [\n\tsome0d,\n\tsome1d,\n\tsome2d,\n\tsome3d,\n\tsome4d,\n\tsome5d,\n\tsome6d,\n\tsome7d,\n\tsome8d,\n\tsome9d,\n\tsome10d,\n\tsomend\n];\nvar ACCESSOR_SOME = [\n\taccessorsome0d,\n\taccessorsome1d,\n\taccessorsome2d,\n\taccessorsome3d,\n\taccessorsome4d,\n\taccessorsome5d,\n\taccessorsome6d,\n\taccessorsome7d,\n\taccessorsome8d,\n\taccessorsome9d,\n\taccessorsome10d,\n\taccessorsomend\n];\nvar COMPLEX_SOME = [\n\tcomplexsome0d,\n\tcomplexsome1d,\n\tcomplexsome2d,\n\tcomplexsome3d,\n\tcomplexsome4d,\n\tcomplexsome5d,\n\tcomplexsome6d,\n\tcomplexsome7d,\n\tcomplexsome8d,\n\tcomplexsome9d,\n\tcomplexsome10d,\n\tcomplexsomend\n];\nvar BLOCKED_SOME = [\n\tblockedsome2d, // 0\n\tblockedsome3d,\n\tblockedsome4d,\n\tblockedsome5d,\n\tblockedsome6d,\n\tblockedsome7d,\n\tblockedsome8d,\n\tblockedsome9d,\n\tblockedsome10d // 8\n];\nvar BLOCKED_ACCESSOR_SOME = [\n\tblockedaccessorsome2d, // 0\n\tblockedaccessorsome3d,\n\tblockedaccessorsome4d,\n\tblockedaccessorsome5d,\n\tblockedaccessorsome6d,\n\tblockedaccessorsome7d,\n\tblockedaccessorsome8d,\n\tblockedaccessorsome9d,\n\tblockedaccessorsome10d // 8\n];\nvar BLOCKED_COMPLEX_SOME = [\n\tblockedcomplexsome2d, // 0\n\tblockedcomplexsome3d,\n\tblockedcomplexsome4d,\n\tblockedcomplexsome5d,\n\tblockedcomplexsome6d,\n\tblockedcomplexsome7d,\n\tblockedcomplexsome8d,\n\tblockedcomplexsome9d,\n\tblockedcomplexsome10d // 8\n];\nvar MAX_DIMS = SOME.length - 1;\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* ## Notes\n*\n* -   A 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<Object>} arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must satisfy the predicate function\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Define the success criterion:\n* var n = scalar2ndarray( 3, {\n*     'dtype': 'generic'\n* });\n*\n* // Test elements:\n* var out = some( [ x, n ] );\n* // returns true\n*/\nfunction some( arrays ) {\n\tvar isCmplx;\n\tvar ndims;\n\tvar xmmv;\n\tvar shx;\n\tvar iox;\n\tvar len;\n\tvar sx;\n\tvar ox;\n\tvar ns;\n\tvar N;\n\tvar x;\n\tvar n;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarray and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\tn = ndarray2object( arrays[ 1 ] );\n\n\tshx = x.shape;\n\tndims = shx.length;\n\n\t// Resolve the success criterion:\n\tN = n.accessors[ 0 ]( n.data, n.offset );\n\n\t// Check for known array types which can be reinterpreted for better iteration performance...\n\tif ( isBooleanArray( x.data ) ) {\n\t\tx.data = reinterpretBoolean( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t} else if ( isComplexArray( x.data ) ) {\n\t\tx.data = reinterpretComplex( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t\tx.strides = gscal( ndims, 2, x.strides, 1 );\n\t\tx.offset *= 2;\n\t\tisCmplx = true;\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\t// Compute the number of elements and the number of singleton 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\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 an empty ndarray...\n\tif ( len === 0 ) {\n\t\treturn false;\n\t}\n\t// Determine whether the ndarray is one-dimensional and thus readily translates to a one-dimensional strided array...\n\tif ( ndims === 1 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\tsx = x.strides;\n\n\t// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat an ndarray as being equivalent to a one-dimensional strided array...\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\tx.strides = [ sx[i] ];\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t}\n\t\treturn SOME[ 1 ]( x, N );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tif ( iox !== 0 ) {\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array view:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarray as a linear one-dimensional strided array...\n\t\tif ( len === ( xmmv[1]-xmmv[0]+1 ) || ( isCmplx && len*2 === ( xmmv[1]-xmmv[0]+2 ) ) ) { // eslint-disable-line max-len\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\tx.shape = [ len ];\n\t\t\tx.strides = [ ( isCmplx ) ? iox*2 : iox ];\n\t\t\tx.offset = ox;\n\t\t\tif ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ 1 ]( x, N );\n\t\t}\n\t\t// The 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 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 ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ ndims ]( x, N );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with a non-contiguous n-dimensional array or a high dimensional n-dimensional array, 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 ( x.accessorProtocol ) {\n\t\t\treturn BLOCKED_ACCESSOR_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn BLOCKED_COMPLEX_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\treturn BLOCKED_SOME[ ndims-2 ]( x, N );\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 ( x.accessorProtocol ) {\n\t\treturn accessorsomend( x, N );\n\t}\n\tif ( isCmplx ) {\n\t\treturn complexsomend( x, N );\n\t}\n\treturn somend( x, N );\n}\n\n\n// EXPORTS //\n\nmodule.exports = some;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\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 whether at least `n` elements in an ndarray are truthy.\n*\n* @module @stdlib/ndarray-base-some\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );\n* var some = require( '@stdlib/ndarray-base-some' );\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Define the success criterion:\n* var n = scalar2ndarray( 3, {\n*     'dtype': 'generic'\n* });\n*\n* // Test elements:\n* var out = some( [ x, n ] );\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,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAItB,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCS,EAAKU,EAAE,GACPP,EAAKO,EAAE,GAGPjB,EAAQJ,GAAWE,EAAE,KAAM,EAG3Ba,EAAKb,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMM,EAAG,CAAC,EAGVP,EAAML,EAAE,UAAU,CAAC,EAGnBG,EAAQ,EAGFe,EAAKT,EAAG,CAAC,EAAGS,EAAK,GAStB,IARKA,EAAKhB,GACTS,EAAKO,EACLA,EAAK,IAELP,EAAKT,EACLgB,GAAMhB,GAEPM,EAAMK,EAAOK,EAAGN,EAAG,CAAC,EACdK,EAAKR,EAAG,CAAC,EAAGQ,EAAK,GAetB,IAdKA,EAAKf,GACTQ,EAAKO,EACLA,EAAK,IAELP,EAAKR,EACLe,GAAMf,GAGPY,EAAKN,EAAQS,EAAGL,EAAG,CAAC,EAGpBL,EAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EAGjBI,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,GAAKV,EAAKD,EAAMU,CAAG,IAClBX,GAAS,EACJA,GAASF,GACb,MAAO,GAGTa,GAAMR,CACP,CACAQ,GAAMP,CACP,CAGF,MAAO,EACR,CAKAX,GAAO,QAAUG,KCtKjB,IAAAqB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAI3B,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCW,EAAKa,EAAE,GACPT,EAAKS,EAAE,GAGPtB,EAAQJ,GAAWE,EAAE,KAAM,EAG3BgB,EAAKhB,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMS,EAAG,CAAC,EAGVV,EAAML,EAAE,UAAU,CAAC,EAGnBG,EAAQ,EAGFoB,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAStB,IARKA,EAAKrB,GACTY,EAAKS,EACLA,EAAK,IAELT,EAAKZ,EACLqB,GAAMrB,GAEPQ,EAAMM,EAAOO,EAAGR,EAAG,CAAC,EACdO,EAAKX,EAAG,CAAC,EAAGW,EAAK,GAUtB,IATKA,EAAKpB,GACTW,EAAKS,EACLA,EAAK,IAELT,EAAKX,EACLoB,GAAMpB,GAEPM,EAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBN,EAAMC,EAAQY,EAAGP,EAAG,CAAC,EACfM,EAAKV,EAAG,CAAC,EAAGU,EAAK,GAetB,IAdKA,EAAKnB,GACTU,EAAKS,EACLA,EAAK,IAELT,EAAKV,EACLmB,GAAMnB,GAGPe,EAAKR,EAAQY,EAAGN,EAAG,CAAC,EAGpBR,EAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EAGjBK,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,GAAKb,EAAKD,EAAMa,CAAG,IAClBd,GAAS,EACJA,GAASF,GACb,MAAO,GAGTgB,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CAIH,MAAO,EACR,CAKAZ,GAAO,QAAUG,KCzLjB,IAAA0B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAIhC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCa,EAAKgB,EAAE,GACPX,EAAKW,EAAE,GAGP3B,EAAQJ,GAAWE,EAAE,KAAM,EAG3BmB,EAAKnB,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMY,EAAG,CAAC,EAGVb,EAAML,EAAE,UAAU,CAAC,EAGnBG,EAAQ,EAGFyB,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAStB,IARKA,EAAK1B,GACTe,EAAKW,EACLA,EAAK,IAELX,EAAKf,EACL0B,GAAM1B,GAEPU,EAAMO,EAAOS,EAAGV,EAAG,CAAC,EACdS,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAUtB,IATKA,EAAKzB,GACTc,EAAKW,EACLA,EAAK,IAELX,EAAKd,EACLyB,GAAMzB,GAEPO,EAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBP,EAAMC,EAAQe,EAAGT,EAAG,CAAC,EACfQ,EAAKb,EAAG,CAAC,EAAGa,EAAK,GAUtB,IATKA,EAAKxB,GACTa,EAAKW,EACLA,EAAK,IAELX,EAAKb,EACLwB,GAAMxB,GAEPM,EAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBR,EAAMC,EAAQe,EAAGR,EAAG,CAAC,EACfO,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAetB,IAdKA,EAAKvB,GACTY,EAAKW,EACLA,EAAK,IAELX,EAAKZ,EACLuB,GAAMvB,GAGPkB,EAAKV,EAAQe,EAAGP,EAAG,CAAC,EAGpBX,EAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EAGjBM,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,GAAKhB,EAAKD,EAAMgB,CAAG,IAClBjB,GAAS,EACJA,GAASF,GACb,MAAO,GAGTmB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CAKJ,MAAO,EACR,CAKAb,GAAO,QAAUG,KC5MjB,IAAA+B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAIrC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCe,EAAKmB,EAAE,GACPb,EAAKa,EAAE,GAGP/B,EAAQL,GAAWE,EAAE,KAAM,EAG3BsB,EAAKtB,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMe,EAAG,CAAC,EAGVhB,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGF+B,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAStB,IARKA,EAAK9B,GACTiB,EAAKa,EACLA,EAAK,IAELb,EAAKjB,EACL8B,GAAM9B,GAEPW,EAAMQ,EAAOW,EAAGZ,EAAG,CAAC,EACdW,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK7B,GACTgB,EAAKa,EACLA,EAAK,IAELb,EAAKhB,EACL6B,GAAM7B,GAEPO,EAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBR,EAAMC,EAAQkB,EAAGX,EAAG,CAAC,EACfU,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAUtB,IATKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEPM,EAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBT,EAAMC,EAAQkB,EAAGV,EAAG,CAAC,EACfS,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAUtB,IATKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAEPK,EAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBV,EAAMC,EAAQkB,EAAGT,EAAG,CAAC,EACfQ,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAetB,IAdKA,EAAK1B,GACTa,EAAKa,EACLA,EAAK,IAELb,EAAKb,EACL0B,GAAM1B,GAGPoB,EAAKZ,EAAQkB,EAAGR,EAAG,CAAC,EAGpBd,EAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EAGjBO,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,GAAKnB,EAAKD,EAAMmB,CAAG,IAClBrB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTsB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CAML,MAAO,EACR,CAKAd,GAAO,QAAUG,KC/NjB,IAAAoC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAI1C,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCiB,EAAKsB,EAAE,GACPf,EAAKe,EAAE,GAGPpC,EAAQL,GAAWE,EAAE,KAAM,EAG3ByB,EAAKzB,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMkB,EAAG,CAAC,EAGVnB,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGFoC,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAStB,IARKA,EAAKnC,GACToB,EAAKe,EACLA,EAAK,IAELf,EAAKpB,EACLmC,GAAMnC,GAEPa,EAAMS,EAAOa,EAAGd,EAAG,CAAC,EACda,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKlC,GACTmB,EAAKe,EACLA,EAAK,IAELf,EAAKnB,EACLkC,GAAMlC,GAEPQ,EAAMa,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBT,EAAMC,EAAQqB,EAAGb,EAAG,CAAC,EACfY,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKjC,GACTkB,EAAKe,EACLA,EAAK,IAELf,EAAKlB,EACLiC,GAAMjC,GAEPO,EAAMc,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBV,EAAMC,EAAQqB,EAAGZ,EAAG,CAAC,EACfW,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAUtB,IATKA,EAAKhC,GACTiB,EAAKe,EACLA,EAAK,IAELf,EAAKjB,EACLgC,GAAMhC,GAEPM,EAAMe,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBX,EAAMC,EAAQqB,EAAGX,EAAG,CAAC,EACfU,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK/B,GACTgB,EAAKe,EACLA,EAAK,IAELf,EAAKhB,EACL+B,GAAM/B,GAEPK,EAAMgB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBZ,EAAMC,EAAQqB,EAAGV,EAAG,CAAC,EACfS,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAetB,IAdKA,EAAK9B,GACTe,EAAKe,EACLA,EAAK,IAELf,EAAKf,EACL8B,GAAM9B,GAGPuB,EAAKd,EAAQqB,EAAGT,EAAG,CAAC,EAGpBjB,EAAMiB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EAGjBQ,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,GAAKtB,EAAKD,EAAMsB,CAAG,IAClBxB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTyB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CAON,MAAO,EACR,CAKAf,GAAO,QAAUG,KClPjB,IAAAyC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAI/C,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCmB,EAAKyB,EAAE,GACPjB,EAAKiB,EAAE,GAGPzC,EAAQL,GAAWE,EAAE,KAAM,EAG3B4B,EAAK5B,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMqB,EAAG,CAAC,EAGVtB,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGFyC,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAStB,IARKA,EAAKxC,GACTuB,EAAKiB,EACLA,EAAK,IAELjB,EAAKvB,EACLwC,GAAMxC,GAEPe,EAAMU,EAAOe,EAAGhB,EAAG,CAAC,EACde,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKvC,GACTsB,EAAKiB,EACLA,EAAK,IAELjB,EAAKtB,EACLuC,GAAMvC,GAEPS,EAAMe,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBV,EAAMC,EAAQwB,EAAGf,EAAG,CAAC,EACfc,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKtC,GACTqB,EAAKiB,EACLA,EAAK,IAELjB,EAAKrB,EACLsC,GAAMtC,GAEPQ,EAAMgB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBX,EAAMC,EAAQwB,EAAGd,EAAG,CAAC,EACfa,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKrC,GACToB,EAAKiB,EACLA,EAAK,IAELjB,EAAKpB,EACLqC,GAAMrC,GAEPO,EAAMiB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBZ,EAAMC,EAAQwB,EAAGb,EAAG,CAAC,EACfY,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKpC,GACTmB,EAAKiB,EACLA,EAAK,IAELjB,EAAKnB,EACLoC,GAAMpC,GAEPM,EAAMkB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBb,EAAMC,EAAQwB,EAAGZ,EAAG,CAAC,EACfW,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKnC,GACTkB,EAAKiB,EACLA,EAAK,IAELjB,EAAKlB,EACLmC,GAAMnC,GAEPK,EAAMmB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBd,EAAMC,EAAQwB,EAAGX,EAAG,CAAC,EACfU,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAetB,IAdKA,EAAKlC,GACTiB,EAAKiB,EACLA,EAAK,IAELjB,EAAKjB,EACLkC,GAAMlC,GAGP0B,EAAKhB,EAAQwB,EAAGV,EAAG,CAAC,EAGpBpB,EAAMoB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EAGjBS,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,GAAKzB,EAAKD,EAAMyB,CAAG,IAClB3B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT4B,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CAQP,MAAO,EACR,CAKAhB,GAAO,QAAUG,KCrQjB,IAAA8C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA4BJ,IAvBAA,EAAIpD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCqB,EAAK4B,EAAE,GACPnB,EAAKmB,EAAE,GAGP9C,EAAQL,GAAWE,EAAE,KAAM,EAG3B+B,EAAK/B,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAMwB,EAAG,CAAC,EAGVzB,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGF8C,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAStB,IARKA,EAAK7C,GACT0B,EAAKmB,EACLA,EAAK,IAELnB,EAAK1B,EACL6C,GAAM7C,GAEPiB,EAAMW,EAAOiB,EAAGlB,EAAG,CAAC,EACdiB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK5C,GACTyB,EAAKmB,EACLA,EAAK,IAELnB,EAAKzB,EACL4C,GAAM5C,GAEPU,EAAMiB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBX,EAAMC,EAAQ2B,EAAGjB,EAAG,CAAC,EACfgB,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK3C,GACTwB,EAAKmB,EACLA,EAAK,IAELnB,EAAKxB,EACL2C,GAAM3C,GAEPS,EAAMkB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBZ,EAAMC,EAAQ2B,EAAGhB,EAAG,CAAC,EACfe,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAK1C,GACTuB,EAAKmB,EACLA,EAAK,IAELnB,EAAKvB,EACL0C,GAAM1C,GAEPQ,EAAMmB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBb,EAAMC,EAAQ2B,EAAGf,EAAG,CAAC,EACfc,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKzC,GACTsB,EAAKmB,EACLA,EAAK,IAELnB,EAAKtB,EACLyC,GAAMzC,GAEPO,EAAMoB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBd,EAAMC,EAAQ2B,EAAGd,EAAG,CAAC,EACfa,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKxC,GACTqB,EAAKmB,EACLA,EAAK,IAELnB,EAAKrB,EACLwC,GAAMxC,GAEPM,EAAMqB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBf,EAAMC,EAAQ2B,EAAGb,EAAG,CAAC,EACfY,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKvC,GACToB,EAAKmB,EACLA,EAAK,IAELnB,EAAKpB,EACLuC,GAAMvC,GAEPK,EAAMsB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBhB,EAAMC,EAAQ2B,EAAGZ,EAAG,CAAC,EACfW,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAetB,IAdKA,EAAKtC,GACTmB,EAAKmB,EACLA,EAAK,IAELnB,EAAKnB,EACLsC,GAAMtC,GAGP6B,EAAKlB,EAAQ2B,EAAGX,EAAG,CAAC,EAGpBvB,EAAMuB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EAGjBU,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,GAAK5B,EAAKD,EAAM4B,CAAG,IAClB9B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT+B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CASR,MAAO,EACR,CAKAjB,GAAO,QAAUG,KCxRjB,IAAAmD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GA4BJ,IAvBAA,GAAIzD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCuB,EAAK+B,GAAE,GACPrB,EAAKqB,GAAE,GAGPnD,EAAQL,GAAWE,EAAE,KAAM,EAG3BkC,EAAKlC,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAM2B,EAAG,CAAC,EAGV5B,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGFmD,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAStB,IARKA,GAAKlD,GACT6B,EAAKqB,GACLA,GAAK,IAELrB,EAAK7B,EACLkD,IAAMlD,GAEPmB,EAAMY,EAAOmB,GAAGpB,EAAG,CAAC,EACdmB,EAAK7B,EAAG,CAAC,EAAG6B,EAAK,GAUtB,IATKA,EAAKjD,GACT4B,EAAKqB,EACLA,EAAK,IAELrB,EAAK5B,EACLiD,GAAMjD,GAEPW,EAAMmB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBZ,EAAMC,EAAQ8B,EAAGnB,EAAG,CAAC,EACfkB,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAUtB,IATKA,EAAKhD,GACT2B,EAAKqB,EACLA,EAAK,IAELrB,EAAK3B,EACLgD,GAAMhD,GAEPU,EAAMoB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBb,EAAMC,EAAQ8B,EAAGlB,EAAG,CAAC,EACfiB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAK/C,GACT0B,EAAKqB,EACLA,EAAK,IAELrB,EAAK1B,EACL+C,GAAM/C,GAEPS,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBd,EAAMC,EAAQ8B,EAAGjB,EAAG,CAAC,EACfgB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK9C,GACTyB,EAAKqB,EACLA,EAAK,IAELrB,EAAKzB,EACL8C,GAAM9C,GAEPQ,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBf,EAAMC,EAAQ8B,EAAGhB,EAAG,CAAC,EACfe,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK7C,GACTwB,EAAKqB,EACLA,EAAK,IAELrB,EAAKxB,EACL6C,GAAM7C,GAEPO,EAAMuB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBhB,EAAMC,EAAQ8B,EAAGf,EAAG,CAAC,EACfc,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAK5C,GACTuB,EAAKqB,EACLA,EAAK,IAELrB,EAAKvB,EACL4C,GAAM5C,GAEPM,EAAMwB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBjB,EAAMC,EAAQ8B,EAAGd,EAAG,CAAC,EACfa,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAK3C,GACTsB,EAAKqB,EACLA,EAAK,IAELrB,EAAKtB,EACL2C,GAAM3C,GAEPK,EAAMyB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBlB,EAAMC,EAAQ8B,EAAGb,EAAG,CAAC,EACfY,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAetB,IAdKA,EAAK1C,GACTqB,EAAKqB,EACLA,EAAK,IAELrB,EAAKrB,EACL0C,GAAM1C,GAGPgC,EAAKpB,EAAQ8B,EAAGZ,EAAG,CAAC,EAGpB1B,EAAM0B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EAGjBW,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,GAAK/B,EAAKD,EAAM+B,CAAG,IAClBjC,GAAS,EACJA,GAASD,GACb,MAAO,GAGTkC,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CAUT,MAAO,EACR,CAKAlB,GAAO,QAAUG,KC3SjB,IAAAwD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAmD1E,SAASC,GAAgBC,EAAGC,EAAI,CAC/B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GA4BJ,IAvBAA,GAAI9D,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCyB,EAAKkC,GAAE,GACPvB,EAAKuB,GAAE,GAGPxD,EAAQL,GAAWE,EAAE,KAAM,EAG3BqC,EAAKrC,EAAE,OAGPI,EAAOJ,EAAE,KAGTM,EAAM8B,EAAG,CAAC,EAGV/B,EAAML,EAAE,UAAU,CAAC,EAGnBE,EAAQ,EAGFwD,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAStB,IARKA,GAAKvD,GACTgC,EAAKuB,GACLA,GAAK,IAELvB,EAAKhC,EACLuD,IAAMvD,GAEPqB,EAAMa,EAAOqB,GAAGtB,EAAG,CAAC,EACdqB,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GAUtB,IATKA,GAAKtD,GACT+B,EAAKuB,GACLA,GAAK,IAELvB,EAAK/B,EACLsD,IAAMtD,GAEPY,EAAMqB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBb,EAAMC,EAAQiC,GAAGrB,EAAG,CAAC,EACfoB,GAAK/B,EAAG,CAAC,EAAG+B,GAAK,GAUtB,IATKA,GAAKrD,GACT8B,EAAKuB,GACLA,GAAK,IAELvB,EAAK9B,EACLqD,IAAMrD,GAEPW,EAAMsB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBd,EAAMC,EAAQiC,GAAGpB,EAAG,CAAC,EACfmB,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAUtB,IATKA,GAAKpD,GACT6B,EAAKuB,GACLA,GAAK,IAELvB,EAAK7B,EACLoD,IAAMpD,GAEPU,EAAMuB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBf,EAAMC,EAAQiC,GAAGnB,EAAG,CAAC,EACfkB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAUtB,IATKA,GAAKnD,GACT4B,EAAKuB,GACLA,GAAK,IAELvB,EAAK5B,EACLmD,IAAMnD,GAEPS,EAAMwB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhB,EAAMC,EAAQiC,GAAGlB,EAAG,CAAC,EACfiB,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GAUtB,IATKA,GAAKlD,GACT2B,EAAKuB,GACLA,GAAK,IAELvB,EAAK3B,EACLkD,IAAMlD,GAEPQ,EAAMyB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBjB,EAAMC,EAAQiC,GAAGjB,EAAG,CAAC,EACfgB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAKjD,GACT0B,EAAKuB,EACLA,EAAK,IAELvB,EAAK1B,EACLiD,GAAMjD,GAEPO,EAAM0B,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBlB,EAAMC,EAAQiC,EAAGhB,EAAG,CAAC,EACfe,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAKhD,GACTyB,EAAKuB,EACLA,EAAK,IAELvB,EAAKzB,EACLgD,GAAMhD,GAEPM,EAAM2B,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBnB,EAAMC,EAAQiC,EAAGf,EAAG,CAAC,EACfc,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK/C,GACTwB,EAAKuB,EACLA,EAAK,IAELvB,EAAKxB,EACL+C,GAAM/C,GAEPK,EAAM4B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EACvBpB,EAAMC,EAAQiC,EAAGd,EAAG,CAAC,EACfa,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAetB,IAdKA,EAAK9C,GACTuB,EAAKuB,EACLA,EAAK,IAELvB,EAAKvB,EACL8C,GAAM9C,GAGPmC,EAAKtB,EAAQiC,EAAGb,EAAG,CAAC,EAGpB7B,EAAM6B,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,EAGjBY,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,GAAKlC,EAAKD,EAAMkC,CAAG,IAClBpC,GAAS,EACJA,GAASD,GACb,MAAO,GAGTqC,GAAMhC,CACP,CACAgC,GAAM/B,CACP,CACA+B,GAAM9B,CACP,CACA8B,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CAWV,MAAO,EACR,CAKAnB,GAAO,QAAUG,KC9TjB,IAAA6D,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIrB,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCQ,EAAKU,EAAE,GACPP,EAAKO,EAAE,GAGPf,EAAQL,GAAWE,EAAE,KAAM,EAG3BY,EAAKZ,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMM,EAAG,CAAC,EAGVT,EAAQ,EAGFe,EAAKT,EAAG,CAAC,EAAGS,EAAK,GAStB,IARKA,EAAKd,GACTO,EAAKO,EACLA,EAAK,IAELP,EAAKP,EACLc,GAAMd,GAEPI,EAAMK,EAAOK,EAAGN,EAAG,CAAC,EACdK,EAAKR,EAAG,CAAC,EAAGQ,EAAK,GAetB,IAdKA,EAAKb,GACTM,EAAKO,EACLA,EAAK,IAELP,EAAKN,EACLa,GAAMb,GAGPU,EAAKN,EAAQS,EAAGL,EAAG,CAAC,EAGpBL,EAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EAGjBI,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAOV,EAAMS,CAAG,GAAKT,EAAMS,EAAG,CAAE,KAC/BX,GAAS,EACJA,GAASD,GACb,MAAO,GAGTY,GAAMR,CACP,CACAQ,GAAMP,CACP,CAGF,MAAO,EACR,CAKAV,GAAO,QAAUG,KC/JjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI1B,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCU,EAAKa,EAAE,GACPT,EAAKS,EAAE,GAGPpB,EAAQL,GAAWE,EAAE,KAAM,EAG3Be,EAAKf,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMS,EAAG,CAAC,EAGVZ,EAAQ,EAGFoB,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAStB,IARKA,EAAKnB,GACTU,EAAKS,EACLA,EAAK,IAELT,EAAKV,EACLmB,GAAMnB,GAEPM,EAAMM,EAAOO,EAAGR,EAAG,CAAC,EACdO,EAAKX,EAAG,CAAC,EAAGW,EAAK,GAUtB,IATKA,EAAKlB,GACTS,EAAKS,EACLA,EAAK,IAELT,EAAKT,EACLkB,GAAMlB,GAEPI,EAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBN,EAAMC,EAAQY,EAAGP,EAAG,CAAC,EACfM,EAAKV,EAAG,CAAC,EAAGU,EAAK,GAetB,IAdKA,EAAKjB,GACTQ,EAAKS,EACLA,EAAK,IAELT,EAAKR,EACLiB,GAAMjB,GAGPa,EAAKR,EAAQY,EAAGN,EAAG,CAAC,EAGpBR,EAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EAGjBK,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAOb,EAAMY,CAAG,GAAKZ,EAAMY,EAAG,CAAE,KAC/Bd,GAAS,EACJA,GAASD,GACb,MAAO,GAGTe,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CAIH,MAAO,EACR,CAKAX,GAAO,QAAUG,KClLjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI/B,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCY,EAAKgB,EAAE,GACPX,EAAKW,EAAE,GAGP1B,EAAQJ,GAAWE,EAAE,KAAM,EAG3BkB,EAAKlB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMY,EAAG,CAAC,EAGVd,EAAQ,EAGFwB,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAStB,IARKA,EAAKzB,GACTc,EAAKW,EACLA,EAAK,IAELX,EAAKd,EACLyB,GAAMzB,GAEPS,EAAMO,EAAOS,EAAGV,EAAG,CAAC,EACdS,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAUtB,IATKA,EAAKxB,GACTa,EAAKW,EACLA,EAAK,IAELX,EAAKb,EACLwB,GAAMxB,GAEPM,EAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBP,EAAMC,EAAQe,EAAGT,EAAG,CAAC,EACfQ,EAAKb,EAAG,CAAC,EAAGa,EAAK,GAUtB,IATKA,EAAKvB,GACTY,EAAKW,EACLA,EAAK,IAELX,EAAKZ,EACLuB,GAAMvB,GAEPK,EAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBR,EAAMC,EAAQe,EAAGR,EAAG,CAAC,EACfO,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAetB,IAdKA,EAAKtB,GACTW,EAAKW,EACLA,EAAK,IAELX,EAAKX,EACLsB,GAAMtB,GAGPiB,EAAKV,EAAQe,EAAGP,EAAG,CAAC,EAGpBX,EAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EAGjBM,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAOhB,EAAMe,CAAG,GAAKf,EAAMe,EAAG,CAAE,KAC/BhB,GAAS,EACJA,GAASF,GACb,MAAO,GAGTkB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CAKJ,MAAO,EACR,CAKAZ,GAAO,QAAUG,KCrMjB,IAAA8B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIpC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCc,EAAKmB,EAAE,GACPb,EAAKa,EAAE,GAGP/B,EAAQJ,GAAWE,EAAE,KAAM,EAG3BqB,EAAKrB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMe,EAAG,CAAC,EAGVjB,EAAQ,EAGF6B,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAStB,IARKA,EAAK9B,GACTiB,EAAKa,EACLA,EAAK,IAELb,EAAKjB,EACL8B,GAAM9B,GAEPW,EAAMQ,EAAOW,EAAGZ,EAAG,CAAC,EACdW,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK7B,GACTgB,EAAKa,EACLA,EAAK,IAELb,EAAKhB,EACL6B,GAAM7B,GAEPO,EAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBR,EAAMC,EAAQkB,EAAGX,EAAG,CAAC,EACfU,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAUtB,IATKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEPM,EAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBT,EAAMC,EAAQkB,EAAGV,EAAG,CAAC,EACfS,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAUtB,IATKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAEPK,EAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBV,EAAMC,EAAQkB,EAAGT,EAAG,CAAC,EACfQ,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAetB,IAdKA,EAAK1B,GACTa,EAAKa,EACLA,EAAK,IAELb,EAAKb,EACL0B,GAAM1B,GAGPoB,EAAKZ,EAAQkB,EAAGR,EAAG,CAAC,EAGpBd,EAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EAGjBO,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAOnB,EAAMkB,CAAG,GAAKlB,EAAMkB,EAAG,CAAE,KAC/BnB,GAAS,EACJA,GAASF,GACb,MAAO,GAGTqB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CAML,MAAO,EACR,CAKAb,GAAO,QAAUG,KCxNjB,IAAAmC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIzC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCgB,EAAKsB,EAAE,GACPf,EAAKe,EAAE,GAGPnC,EAAQL,GAAWE,EAAE,KAAM,EAG3BwB,EAAKxB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMkB,EAAG,CAAC,EAGVrB,EAAQ,EAGFmC,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAStB,IARKA,EAAKlC,GACTmB,EAAKe,EACLA,EAAK,IAELf,EAAKnB,EACLkC,GAAMlC,GAEPY,EAAMS,EAAOa,EAAGd,EAAG,CAAC,EACda,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKjC,GACTkB,EAAKe,EACLA,EAAK,IAELf,EAAKlB,EACLiC,GAAMjC,GAEPO,EAAMa,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBT,EAAMC,EAAQqB,EAAGb,EAAG,CAAC,EACfY,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKhC,GACTiB,EAAKe,EACLA,EAAK,IAELf,EAAKjB,EACLgC,GAAMhC,GAEPM,EAAMc,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBV,EAAMC,EAAQqB,EAAGZ,EAAG,CAAC,EACfW,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAUtB,IATKA,EAAK/B,GACTgB,EAAKe,EACLA,EAAK,IAELf,EAAKhB,EACL+B,GAAM/B,GAEPK,EAAMe,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBX,EAAMC,EAAQqB,EAAGX,EAAG,CAAC,EACfU,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK9B,GACTe,EAAKe,EACLA,EAAK,IAELf,EAAKf,EACL8B,GAAM9B,GAEPI,EAAMgB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBZ,EAAMC,EAAQqB,EAAGV,EAAG,CAAC,EACfS,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAetB,IAdKA,EAAK7B,GACTc,EAAKe,EACLA,EAAK,IAELf,EAAKd,EACL6B,GAAM7B,GAGPsB,EAAKd,EAAQqB,EAAGT,EAAG,CAAC,EAGpBjB,EAAMiB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EAGjBQ,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAOtB,EAAMqB,CAAG,GAAKrB,EAAMqB,EAAG,CAAE,KAC/BvB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTwB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CAON,MAAO,EACR,CAKAd,GAAO,QAAUG,KC3OjB,IAAAwC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI9C,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCkB,EAAKyB,EAAE,GACPjB,EAAKiB,EAAE,GAGPxC,EAAQL,GAAWE,EAAE,KAAM,EAG3B2B,EAAK3B,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMqB,EAAG,CAAC,EAGVxB,EAAQ,EAGFwC,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAStB,IARKA,EAAKvC,GACTsB,EAAKiB,EACLA,EAAK,IAELjB,EAAKtB,EACLuC,GAAMvC,GAEPc,EAAMU,EAAOe,EAAGhB,EAAG,CAAC,EACde,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKtC,GACTqB,EAAKiB,EACLA,EAAK,IAELjB,EAAKrB,EACLsC,GAAMtC,GAEPQ,EAAMe,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBV,EAAMC,EAAQwB,EAAGf,EAAG,CAAC,EACfc,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKrC,GACToB,EAAKiB,EACLA,EAAK,IAELjB,EAAKpB,EACLqC,GAAMrC,GAEPO,EAAMgB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBX,EAAMC,EAAQwB,EAAGd,EAAG,CAAC,EACfa,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKpC,GACTmB,EAAKiB,EACLA,EAAK,IAELjB,EAAKnB,EACLoC,GAAMpC,GAEPM,EAAMiB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBZ,EAAMC,EAAQwB,EAAGb,EAAG,CAAC,EACfY,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKnC,GACTkB,EAAKiB,EACLA,EAAK,IAELjB,EAAKlB,EACLmC,GAAMnC,GAEPK,EAAMkB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBb,EAAMC,EAAQwB,EAAGZ,EAAG,CAAC,EACfW,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKlC,GACTiB,EAAKiB,EACLA,EAAK,IAELjB,EAAKjB,EACLkC,GAAMlC,GAEPI,EAAMmB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBd,EAAMC,EAAQwB,EAAGX,EAAG,CAAC,EACfU,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAetB,IAdKA,EAAKjC,GACTgB,EAAKiB,EACLA,EAAK,IAELjB,EAAKhB,EACLiC,GAAMjC,GAGPyB,EAAKhB,EAAQwB,EAAGV,EAAG,CAAC,EAGpBpB,EAAMoB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EAGjBS,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAOzB,EAAMwB,CAAG,GAAKxB,EAAMwB,EAAG,CAAE,KAC/B1B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT2B,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CAQP,MAAO,EACR,CAKAf,GAAO,QAAUG,KC9PjB,IAAA6C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAInD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCoB,EAAK4B,EAAE,GACPnB,EAAKmB,EAAE,GAGP7C,EAAQL,GAAWE,EAAE,KAAM,EAG3B8B,EAAK9B,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMwB,EAAG,CAAC,EAGV3B,EAAQ,EAGF6C,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAStB,IARKA,EAAK5C,GACTyB,EAAKmB,EACLA,EAAK,IAELnB,EAAKzB,EACL4C,GAAM5C,GAEPgB,EAAMW,EAAOiB,EAAGlB,EAAG,CAAC,EACdiB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK3C,GACTwB,EAAKmB,EACLA,EAAK,IAELnB,EAAKxB,EACL2C,GAAM3C,GAEPS,EAAMiB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBX,EAAMC,EAAQ2B,EAAGjB,EAAG,CAAC,EACfgB,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK1C,GACTuB,EAAKmB,EACLA,EAAK,IAELnB,EAAKvB,EACL0C,GAAM1C,GAEPQ,EAAMkB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBZ,EAAMC,EAAQ2B,EAAGhB,EAAG,CAAC,EACfe,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAKzC,GACTsB,EAAKmB,EACLA,EAAK,IAELnB,EAAKtB,EACLyC,GAAMzC,GAEPO,EAAMmB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBb,EAAMC,EAAQ2B,EAAGf,EAAG,CAAC,EACfc,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKxC,GACTqB,EAAKmB,EACLA,EAAK,IAELnB,EAAKrB,EACLwC,GAAMxC,GAEPM,EAAMoB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBd,EAAMC,EAAQ2B,EAAGd,EAAG,CAAC,EACfa,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKvC,GACToB,EAAKmB,EACLA,EAAK,IAELnB,EAAKpB,EACLuC,GAAMvC,GAEPK,EAAMqB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBf,EAAMC,EAAQ2B,EAAGb,EAAG,CAAC,EACfY,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKtC,GACTmB,EAAKmB,EACLA,EAAK,IAELnB,EAAKnB,EACLsC,GAAMtC,GAEPI,EAAMsB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBhB,EAAMC,EAAQ2B,EAAGZ,EAAG,CAAC,EACfW,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAetB,IAdKA,EAAKrC,GACTkB,EAAKmB,EACLA,EAAK,IAELnB,EAAKlB,EACLqC,GAAMrC,GAGP4B,EAAKlB,EAAQ2B,EAAGX,EAAG,CAAC,EAGpBvB,EAAMuB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EAGjBU,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAO5B,EAAM2B,CAAG,GAAK3B,EAAM2B,EAAG,CAAE,KAC/B7B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT8B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CASR,MAAO,EACR,CAKAhB,GAAO,QAAUG,KCjRjB,IAAAkD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAyBJ,IApBAA,GAAIxD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCsB,EAAK+B,GAAE,GACPrB,EAAKqB,GAAE,GAGPlD,EAAQL,GAAWE,EAAE,KAAM,EAG3BiC,EAAKjC,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAM2B,EAAG,CAAC,EAGV9B,EAAQ,EAGFkD,EAAK9B,EAAG,CAAC,EAAG8B,EAAK,GAStB,IARKA,EAAKjD,GACT4B,EAAKqB,EACLA,EAAK,IAELrB,EAAK5B,EACLiD,GAAMjD,GAEPkB,EAAMY,EAAOmB,EAAGpB,EAAG,CAAC,EACdmB,EAAK7B,EAAG,CAAC,EAAG6B,EAAK,GAUtB,IATKA,EAAKhD,GACT2B,EAAKqB,EACLA,EAAK,IAELrB,EAAK3B,EACLgD,GAAMhD,GAEPU,EAAMmB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBZ,EAAMC,EAAQ8B,EAAGnB,EAAG,CAAC,EACfkB,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAUtB,IATKA,EAAK/C,GACT0B,EAAKqB,EACLA,EAAK,IAELrB,EAAK1B,EACL+C,GAAM/C,GAEPS,EAAMoB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBb,EAAMC,EAAQ8B,EAAGlB,EAAG,CAAC,EACfiB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAK9C,GACTyB,EAAKqB,EACLA,EAAK,IAELrB,EAAKzB,EACL8C,GAAM9C,GAEPQ,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBd,EAAMC,EAAQ8B,EAAGjB,EAAG,CAAC,EACfgB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK7C,GACTwB,EAAKqB,EACLA,EAAK,IAELrB,EAAKxB,EACL6C,GAAM7C,GAEPO,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBf,EAAMC,EAAQ8B,EAAGhB,EAAG,CAAC,EACfe,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK5C,GACTuB,EAAKqB,EACLA,EAAK,IAELrB,EAAKvB,EACL4C,GAAM5C,GAEPM,EAAMuB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBhB,EAAMC,EAAQ8B,EAAGf,EAAG,CAAC,EACfc,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAK3C,GACTsB,EAAKqB,EACLA,EAAK,IAELrB,EAAKtB,EACL2C,GAAM3C,GAEPK,EAAMwB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBjB,EAAMC,EAAQ8B,EAAGd,EAAG,CAAC,EACfa,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAK1C,GACTqB,EAAKqB,EACLA,EAAK,IAELrB,EAAKrB,EACL0C,GAAM1C,GAEPI,EAAMyB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBlB,EAAMC,EAAQ8B,EAAGb,EAAG,CAAC,EACfY,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAetB,IAdKA,EAAKzC,GACToB,EAAKqB,EACLA,EAAK,IAELrB,EAAKpB,EACLyC,GAAMzC,GAGP+B,EAAKpB,EAAQ8B,EAAGZ,EAAG,CAAC,EAGpB1B,EAAM0B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EAGjBW,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAO/B,EAAM8B,CAAG,GAAK9B,EAAM8B,EAAG,CAAE,KAC/BhC,GAAS,EACJA,GAASD,GACb,MAAO,GAGTiC,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CAUT,MAAO,EACR,CAKAjB,GAAO,QAAUG,KCpSjB,IAAAuD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAgBC,EAAGC,EAAI,CAC/B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAyBJ,IApBAA,GAAI7D,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCwB,EAAKkC,GAAE,GACPvB,EAAKuB,GAAE,GAGPvD,EAAQL,GAAWE,EAAE,KAAM,EAG3BoC,EAAKpC,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAM8B,EAAG,CAAC,EAGVjC,EAAQ,EAGFuD,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAStB,IARKA,GAAKtD,GACT+B,EAAKuB,GACLA,GAAK,IAELvB,EAAK/B,EACLsD,IAAMtD,GAEPoB,EAAMa,EAAOqB,GAAGtB,EAAG,CAAC,EACdqB,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GAUtB,IATKA,GAAKrD,GACT8B,EAAKuB,GACLA,GAAK,IAELvB,EAAK9B,EACLqD,IAAMrD,GAEPW,EAAMqB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBb,EAAMC,EAAQiC,GAAGrB,EAAG,CAAC,EACfoB,GAAK/B,EAAG,CAAC,EAAG+B,GAAK,GAUtB,IATKA,GAAKpD,GACT6B,EAAKuB,GACLA,GAAK,IAELvB,EAAK7B,EACLoD,IAAMpD,GAEPU,EAAMsB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBd,EAAMC,EAAQiC,GAAGpB,EAAG,CAAC,EACfmB,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAUtB,IATKA,GAAKnD,GACT4B,EAAKuB,GACLA,GAAK,IAELvB,EAAK5B,EACLmD,IAAMnD,GAEPS,EAAMuB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBf,EAAMC,EAAQiC,GAAGnB,EAAG,CAAC,EACfkB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAUtB,IATKA,GAAKlD,GACT2B,EAAKuB,GACLA,GAAK,IAELvB,EAAK3B,EACLkD,IAAMlD,GAEPQ,EAAMwB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhB,EAAMC,EAAQiC,GAAGlB,EAAG,CAAC,EACfiB,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAUtB,IATKA,EAAKjD,GACT0B,EAAKuB,EACLA,EAAK,IAELvB,EAAK1B,EACLiD,GAAMjD,GAEPO,EAAMyB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBjB,EAAMC,EAAQiC,EAAGjB,EAAG,CAAC,EACfgB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAKhD,GACTyB,EAAKuB,EACLA,EAAK,IAELvB,EAAKzB,EACLgD,GAAMhD,GAEPM,EAAM0B,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBlB,EAAMC,EAAQiC,EAAGhB,EAAG,CAAC,EACfe,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK/C,GACTwB,EAAKuB,EACLA,EAAK,IAELvB,EAAKxB,EACL+C,GAAM/C,GAEPK,EAAM2B,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBnB,EAAMC,EAAQiC,EAAGf,EAAG,CAAC,EACfc,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK9C,GACTuB,EAAKuB,EACLA,EAAK,IAELvB,EAAKvB,EACL8C,GAAM9C,GAEPI,EAAM4B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EACvBpB,EAAMC,EAAQiC,EAAGd,EAAG,CAAC,EACfa,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAetB,IAdKA,EAAK7C,GACTsB,EAAKuB,EACLA,EAAK,IAELvB,EAAKtB,EACL6C,GAAM7C,GAGPkC,EAAKtB,EAAQiC,EAAGb,EAAG,CAAC,EAGpB7B,EAAM6B,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,EAGjBY,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAOlC,EAAMiC,CAAG,GAAKjC,EAAMiC,EAAG,CAAE,KAC/BnC,GAAS,EACJA,GAASD,GACb,MAAO,GAGToC,GAAMhC,CACP,CACAgC,GAAM/B,CACP,CACA+B,GAAM9B,CACP,CACA8B,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CAWV,MAAO,EACR,CAKAlB,GAAO,QAAUG,KCvTjB,IAAA4D,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIrB,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCQ,EAAKU,EAAE,GACPP,EAAKO,EAAE,GAGPhB,EAAQJ,GAAWE,EAAE,KAAM,EAG3BY,EAAKZ,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMM,EAAG,CAAC,EAGVR,EAAQ,EAGFc,EAAKT,EAAG,CAAC,EAAGS,EAAK,GAStB,IARKA,EAAKf,GACTQ,EAAKO,EACLA,EAAK,IAELP,EAAKR,EACLe,GAAMf,GAEPK,EAAMK,EAAOK,EAAGN,EAAG,CAAC,EACdK,EAAKR,EAAG,CAAC,EAAGQ,EAAK,GAetB,IAdKA,EAAKd,GACTO,EAAKO,EACLA,EAAK,IAELP,EAAKP,EACLc,GAAMd,GAGPW,EAAKN,EAAQS,EAAGL,EAAG,CAAC,EAGpBL,EAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EAGjBI,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,GAAKV,EAAMS,CAAG,IACbV,GAAS,EACJA,GAASF,GACb,MAAO,GAGTY,GAAMR,CACP,CACAQ,GAAMP,CACP,CAGF,MAAO,EACR,CAKAV,GAAO,QAAUG,KC/JjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI1B,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCU,EAAKa,EAAE,GACPT,EAAKS,EAAE,GAGPrB,EAAQJ,GAAWE,EAAE,KAAM,EAG3Be,EAAKf,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMS,EAAG,CAAC,EAGVX,EAAQ,EAGFmB,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAStB,IARKA,EAAKpB,GACTW,EAAKS,EACLA,EAAK,IAELT,EAAKX,EACLoB,GAAMpB,GAEPO,EAAMM,EAAOO,EAAGR,EAAG,CAAC,EACdO,EAAKX,EAAG,CAAC,EAAGW,EAAK,GAUtB,IATKA,EAAKnB,GACTU,EAAKS,EACLA,EAAK,IAELT,EAAKV,EACLmB,GAAMnB,GAEPK,EAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBN,EAAMC,EAAQY,EAAGP,EAAG,CAAC,EACfM,EAAKV,EAAG,CAAC,EAAGU,EAAK,GAetB,IAdKA,EAAKlB,GACTS,EAAKS,EACLA,EAAK,IAELT,EAAKT,EACLkB,GAAMlB,GAGPc,EAAKR,EAAQY,EAAGN,EAAG,CAAC,EAGpBR,EAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EAGjBK,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,GAAKb,EAAMY,CAAG,IACbb,GAAS,EACJA,GAASF,GACb,MAAO,GAGTe,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CAIH,MAAO,EACR,CAKAX,GAAO,QAAUG,KClLjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI/B,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCY,EAAKgB,EAAE,GACPX,EAAKW,EAAE,GAGP1B,EAAQJ,GAAWE,EAAE,KAAM,EAG3BkB,EAAKlB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMY,EAAG,CAAC,EAGVd,EAAQ,EAGFwB,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAStB,IARKA,EAAKzB,GACTc,EAAKW,EACLA,EAAK,IAELX,EAAKd,EACLyB,GAAMzB,GAEPS,EAAMO,EAAOS,EAAGV,EAAG,CAAC,EACdS,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAUtB,IATKA,EAAKxB,GACTa,EAAKW,EACLA,EAAK,IAELX,EAAKb,EACLwB,GAAMxB,GAEPM,EAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBP,EAAMC,EAAQe,EAAGT,EAAG,CAAC,EACfQ,EAAKb,EAAG,CAAC,EAAGa,EAAK,GAUtB,IATKA,EAAKvB,GACTY,EAAKW,EACLA,EAAK,IAELX,EAAKZ,EACLuB,GAAMvB,GAEPK,EAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBR,EAAMC,EAAQe,EAAGR,EAAG,CAAC,EACfO,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAetB,IAdKA,EAAKtB,GACTW,EAAKW,EACLA,EAAK,IAELX,EAAKX,EACLsB,GAAMtB,GAGPiB,EAAKV,EAAQe,EAAGP,EAAG,CAAC,EAGpBX,EAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EAGjBM,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,GAAKhB,EAAMe,CAAG,IACbhB,GAAS,EACJA,GAASF,GACb,MAAO,GAGTkB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CAKJ,MAAO,EACR,CAKAZ,GAAO,QAAUG,KCrMjB,IAAA8B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIpC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCc,EAAKmB,EAAE,GACPb,EAAKa,EAAE,GAGP/B,EAAQJ,GAAWE,EAAE,KAAM,EAG3BqB,EAAKrB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMe,EAAG,CAAC,EAGVjB,EAAQ,EAGF6B,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAStB,IARKA,EAAK9B,GACTiB,EAAKa,EACLA,EAAK,IAELb,EAAKjB,EACL8B,GAAM9B,GAEPW,EAAMQ,EAAOW,EAAGZ,EAAG,CAAC,EACdW,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK7B,GACTgB,EAAKa,EACLA,EAAK,IAELb,EAAKhB,EACL6B,GAAM7B,GAEPO,EAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBR,EAAMC,EAAQkB,EAAGX,EAAG,CAAC,EACfU,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAUtB,IATKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEPM,EAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBT,EAAMC,EAAQkB,EAAGV,EAAG,CAAC,EACfS,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAUtB,IATKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAEPK,EAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBV,EAAMC,EAAQkB,EAAGT,EAAG,CAAC,EACfQ,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAetB,IAdKA,EAAK1B,GACTa,EAAKa,EACLA,EAAK,IAELb,EAAKb,EACL0B,GAAM1B,GAGPoB,EAAKZ,EAAQkB,EAAGR,EAAG,CAAC,EAGpBd,EAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EAGjBO,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,GAAKnB,EAAMkB,CAAG,IACbnB,GAAS,EACJA,GAASF,GACb,MAAO,GAGTqB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CAML,MAAO,EACR,CAKAb,GAAO,QAAUG,KCxNjB,IAAAmC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAIzC,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCgB,EAAKsB,EAAE,GACPf,EAAKe,EAAE,GAGPnC,EAAQL,GAAWE,EAAE,KAAM,EAG3BwB,EAAKxB,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMkB,EAAG,CAAC,EAGVrB,EAAQ,EAGFmC,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAStB,IARKA,EAAKlC,GACTmB,EAAKe,EACLA,EAAK,IAELf,EAAKnB,EACLkC,GAAMlC,GAEPY,EAAMS,EAAOa,EAAGd,EAAG,CAAC,EACda,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKjC,GACTkB,EAAKe,EACLA,EAAK,IAELf,EAAKlB,EACLiC,GAAMjC,GAEPO,EAAMa,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBT,EAAMC,EAAQqB,EAAGb,EAAG,CAAC,EACfY,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKhC,GACTiB,EAAKe,EACLA,EAAK,IAELf,EAAKjB,EACLgC,GAAMhC,GAEPM,EAAMc,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBV,EAAMC,EAAQqB,EAAGZ,EAAG,CAAC,EACfW,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAUtB,IATKA,EAAK/B,GACTgB,EAAKe,EACLA,EAAK,IAELf,EAAKhB,EACL+B,GAAM/B,GAEPK,EAAMe,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBX,EAAMC,EAAQqB,EAAGX,EAAG,CAAC,EACfU,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAUtB,IATKA,EAAK9B,GACTe,EAAKe,EACLA,EAAK,IAELf,EAAKf,EACL8B,GAAM9B,GAEPI,EAAMgB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBZ,EAAMC,EAAQqB,EAAGV,EAAG,CAAC,EACfS,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAetB,IAdKA,EAAK7B,GACTc,EAAKe,EACLA,EAAK,IAELf,EAAKd,EACL6B,GAAM7B,GAGPsB,EAAKd,EAAQqB,EAAGT,EAAG,CAAC,EAGpBjB,EAAMiB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EAGjBQ,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,GAAKtB,EAAMqB,CAAG,IACbvB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTwB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CAON,MAAO,EACR,CAKAd,GAAO,QAAUG,KC3OjB,IAAAwC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAI9C,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCkB,EAAKyB,EAAE,GACPjB,EAAKiB,EAAE,GAGPxC,EAAQL,GAAWE,EAAE,KAAM,EAG3B2B,EAAK3B,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMqB,EAAG,CAAC,EAGVxB,EAAQ,EAGFwC,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAStB,IARKA,EAAKvC,GACTsB,EAAKiB,EACLA,EAAK,IAELjB,EAAKtB,EACLuC,GAAMvC,GAEPc,EAAMU,EAAOe,EAAGhB,EAAG,CAAC,EACde,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKtC,GACTqB,EAAKiB,EACLA,EAAK,IAELjB,EAAKrB,EACLsC,GAAMtC,GAEPQ,EAAMe,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBV,EAAMC,EAAQwB,EAAGf,EAAG,CAAC,EACfc,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKrC,GACToB,EAAKiB,EACLA,EAAK,IAELjB,EAAKpB,EACLqC,GAAMrC,GAEPO,EAAMgB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBX,EAAMC,EAAQwB,EAAGd,EAAG,CAAC,EACfa,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKpC,GACTmB,EAAKiB,EACLA,EAAK,IAELjB,EAAKnB,EACLoC,GAAMpC,GAEPM,EAAMiB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBZ,EAAMC,EAAQwB,EAAGb,EAAG,CAAC,EACfY,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAUtB,IATKA,EAAKnC,GACTkB,EAAKiB,EACLA,EAAK,IAELjB,EAAKlB,EACLmC,GAAMnC,GAEPK,EAAMkB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBb,EAAMC,EAAQwB,EAAGZ,EAAG,CAAC,EACfW,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAUtB,IATKA,EAAKlC,GACTiB,EAAKiB,EACLA,EAAK,IAELjB,EAAKjB,EACLkC,GAAMlC,GAEPI,EAAMmB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBd,EAAMC,EAAQwB,EAAGX,EAAG,CAAC,EACfU,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAetB,IAdKA,EAAKjC,GACTgB,EAAKiB,EACLA,EAAK,IAELjB,EAAKhB,EACLiC,GAAMjC,GAGPyB,EAAKhB,EAAQwB,EAAGV,EAAG,CAAC,EAGpBpB,EAAMoB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EAGjBS,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,GAAKzB,EAAMwB,CAAG,IACb1B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT2B,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CAQP,MAAO,EACR,CAKAf,GAAO,QAAUG,KC9PjB,IAAA6C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IApBAA,EAAInD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCoB,EAAK4B,EAAE,GACPnB,EAAKmB,EAAE,GAGP7C,EAAQL,GAAWE,EAAE,KAAM,EAG3B8B,EAAK9B,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAMwB,EAAG,CAAC,EAGV3B,EAAQ,EAGF6C,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAStB,IARKA,EAAK5C,GACTyB,EAAKmB,EACLA,EAAK,IAELnB,EAAKzB,EACL4C,GAAM5C,GAEPgB,EAAMW,EAAOiB,EAAGlB,EAAG,CAAC,EACdiB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK3C,GACTwB,EAAKmB,EACLA,EAAK,IAELnB,EAAKxB,EACL2C,GAAM3C,GAEPS,EAAMiB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBX,EAAMC,EAAQ2B,EAAGjB,EAAG,CAAC,EACfgB,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK1C,GACTuB,EAAKmB,EACLA,EAAK,IAELnB,EAAKvB,EACL0C,GAAM1C,GAEPQ,EAAMkB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBZ,EAAMC,EAAQ2B,EAAGhB,EAAG,CAAC,EACfe,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAKzC,GACTsB,EAAKmB,EACLA,EAAK,IAELnB,EAAKtB,EACLyC,GAAMzC,GAEPO,EAAMmB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBb,EAAMC,EAAQ2B,EAAGf,EAAG,CAAC,EACfc,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAKxC,GACTqB,EAAKmB,EACLA,EAAK,IAELnB,EAAKrB,EACLwC,GAAMxC,GAEPM,EAAMoB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBd,EAAMC,EAAQ2B,EAAGd,EAAG,CAAC,EACfa,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAUtB,IATKA,EAAKvC,GACToB,EAAKmB,EACLA,EAAK,IAELnB,EAAKpB,EACLuC,GAAMvC,GAEPK,EAAMqB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBf,EAAMC,EAAQ2B,EAAGb,EAAG,CAAC,EACfY,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAUtB,IATKA,EAAKtC,GACTmB,EAAKmB,EACLA,EAAK,IAELnB,EAAKnB,EACLsC,GAAMtC,GAEPI,EAAMsB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBhB,EAAMC,EAAQ2B,EAAGZ,EAAG,CAAC,EACfW,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAetB,IAdKA,EAAKrC,GACTkB,EAAKmB,EACLA,EAAK,IAELnB,EAAKlB,EACLqC,GAAMrC,GAGP4B,EAAKlB,EAAQ2B,EAAGX,EAAG,CAAC,EAGpBvB,EAAMuB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EAGjBU,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,GAAK5B,EAAM2B,CAAG,IACb7B,GAAS,EACJA,GAASD,GACb,MAAO,GAGT8B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CASR,MAAO,EACR,CAKAhB,GAAO,QAAUG,KCjRjB,IAAAkD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAeC,EAAGC,EAAI,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAyBJ,IApBAA,GAAIxD,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCsB,EAAK+B,GAAE,GACPrB,EAAKqB,GAAE,GAGPlD,EAAQL,GAAWE,EAAE,KAAM,EAG3BiC,EAAKjC,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAM2B,EAAG,CAAC,EAGV9B,EAAQ,EAGFkD,EAAK9B,EAAG,CAAC,EAAG8B,EAAK,GAStB,IARKA,EAAKjD,GACT4B,EAAKqB,EACLA,EAAK,IAELrB,EAAK5B,EACLiD,GAAMjD,GAEPkB,EAAMY,EAAOmB,EAAGpB,EAAG,CAAC,EACdmB,EAAK7B,EAAG,CAAC,EAAG6B,EAAK,GAUtB,IATKA,EAAKhD,GACT2B,EAAKqB,EACLA,EAAK,IAELrB,EAAK3B,EACLgD,GAAMhD,GAEPU,EAAMmB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBZ,EAAMC,EAAQ8B,EAAGnB,EAAG,CAAC,EACfkB,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAUtB,IATKA,EAAK/C,GACT0B,EAAKqB,EACLA,EAAK,IAELrB,EAAK1B,EACL+C,GAAM/C,GAEPS,EAAMoB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBb,EAAMC,EAAQ8B,EAAGlB,EAAG,CAAC,EACfiB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAK9C,GACTyB,EAAKqB,EACLA,EAAK,IAELrB,EAAKzB,EACL8C,GAAM9C,GAEPQ,EAAMqB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBd,EAAMC,EAAQ8B,EAAGjB,EAAG,CAAC,EACfgB,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK7C,GACTwB,EAAKqB,EACLA,EAAK,IAELrB,EAAKxB,EACL6C,GAAM7C,GAEPO,EAAMsB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBf,EAAMC,EAAQ8B,EAAGhB,EAAG,CAAC,EACfe,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK5C,GACTuB,EAAKqB,EACLA,EAAK,IAELrB,EAAKvB,EACL4C,GAAM5C,GAEPM,EAAMuB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBhB,EAAMC,EAAQ8B,EAAGf,EAAG,CAAC,EACfc,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAUtB,IATKA,EAAK3C,GACTsB,EAAKqB,EACLA,EAAK,IAELrB,EAAKtB,EACL2C,GAAM3C,GAEPK,EAAMwB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBjB,EAAMC,EAAQ8B,EAAGd,EAAG,CAAC,EACfa,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAUtB,IATKA,EAAK1C,GACTqB,EAAKqB,EACLA,EAAK,IAELrB,EAAKrB,EACL0C,GAAM1C,GAEPI,EAAMyB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBlB,EAAMC,EAAQ8B,EAAGb,EAAG,CAAC,EACfY,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAetB,IAdKA,EAAKzC,GACToB,EAAKqB,EACLA,EAAK,IAELrB,EAAKpB,EACLyC,GAAMzC,GAGP+B,EAAKpB,EAAQ8B,EAAGZ,EAAG,CAAC,EAGpB1B,EAAM0B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EAGjBW,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,GAAK/B,EAAM8B,CAAG,IACbhC,GAAS,EACJA,GAASD,GACb,MAAO,GAGTiC,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CACAuB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CAUT,MAAO,EACR,CAKAjB,GAAO,QAAUG,KCpSjB,IAAAuD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,qDAAsD,EAC3EC,GAAY,QAAS,gDAAiD,EAgD1E,SAASC,GAAgBC,EAAGC,EAAI,CAC/B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAyBJ,IApBAA,GAAI7D,GAAWG,EAAE,MAAOA,EAAE,OAAQ,EAClCwB,EAAKkC,GAAE,GACPvB,EAAKuB,GAAE,GAGPvD,EAAQL,GAAWE,EAAE,KAAM,EAG3BoC,EAAKpC,EAAE,OAGPI,EAAOJ,EAAE,KAGTK,EAAM8B,EAAG,CAAC,EAGVjC,EAAQ,EAGFuD,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAStB,IARKA,GAAKtD,GACT+B,EAAKuB,GACLA,GAAK,IAELvB,EAAK/B,EACLsD,IAAMtD,GAEPoB,EAAMa,EAAOqB,GAAGtB,EAAG,CAAC,EACdqB,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GAUtB,IATKA,GAAKrD,GACT8B,EAAKuB,GACLA,GAAK,IAELvB,EAAK9B,EACLqD,IAAMrD,GAEPW,EAAMqB,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,EACvBb,EAAMC,EAAQiC,GAAGrB,EAAG,CAAC,EACfoB,GAAK/B,EAAG,CAAC,EAAG+B,GAAK,GAUtB,IATKA,GAAKpD,GACT6B,EAAKuB,GACLA,GAAK,IAELvB,EAAK7B,EACLoD,IAAMpD,GAEPU,EAAMsB,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,EACvBd,EAAMC,EAAQiC,GAAGpB,EAAG,CAAC,EACfmB,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAUtB,IATKA,GAAKnD,GACT4B,EAAKuB,GACLA,GAAK,IAELvB,EAAK5B,EACLmD,IAAMnD,GAEPS,EAAMuB,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,EACvBf,EAAMC,EAAQiC,GAAGnB,EAAG,CAAC,EACfkB,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAUtB,IATKA,GAAKlD,GACT2B,EAAKuB,GACLA,GAAK,IAELvB,EAAK3B,EACLkD,IAAMlD,GAEPQ,EAAMwB,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,EACvBhB,EAAMC,EAAQiC,GAAGlB,EAAG,CAAC,EACfiB,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAUtB,IATKA,EAAKjD,GACT0B,EAAKuB,EACLA,EAAK,IAELvB,EAAK1B,EACLiD,GAAMjD,GAEPO,EAAMyB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,EACvBjB,EAAMC,EAAQiC,EAAGjB,EAAG,CAAC,EACfgB,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAUtB,IATKA,EAAKhD,GACTyB,EAAKuB,EACLA,EAAK,IAELvB,EAAKzB,EACLgD,GAAMhD,GAEPM,EAAM0B,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,EACvBlB,EAAMC,EAAQiC,EAAGhB,EAAG,CAAC,EACfe,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAUtB,IATKA,EAAK/C,GACTwB,EAAKuB,EACLA,EAAK,IAELvB,EAAKxB,EACL+C,GAAM/C,GAEPK,EAAM2B,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,EACvBnB,EAAMC,EAAQiC,EAAGf,EAAG,CAAC,EACfc,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAUtB,IATKA,EAAK9C,GACTuB,EAAKuB,EACLA,EAAK,IAELvB,EAAKvB,EACL8C,GAAM9C,GAEPI,EAAM4B,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,EACvBpB,EAAMC,EAAQiC,EAAGd,EAAG,CAAC,EACfa,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAetB,IAdKA,EAAK7C,GACTsB,EAAKuB,EACLA,EAAK,IAELvB,EAAKtB,EACL6C,GAAM7C,GAGPkC,EAAKtB,EAAQiC,EAAGb,EAAG,CAAC,EAGpB7B,EAAM6B,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,EAGjBY,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,GAAKlC,EAAMiC,CAAG,IACbnC,GAAS,EACJA,GAASD,GACb,MAAO,GAGToC,GAAMhC,CACP,CACAgC,GAAM/B,CACP,CACA+B,GAAM9B,CACP,CACA8B,GAAM7B,CACP,CACA6B,GAAM5B,CACP,CACA4B,GAAM3B,CACP,CACA2B,GAAM1B,CACP,CACA0B,GAAMzB,CACP,CACAyB,GAAMxB,CACP,CACAwB,GAAMvB,CACP,CAWV,MAAO,EACR,CAKAlB,GAAO,QAAUG,KCvTjB,IAAA4D,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,MAAK,GAAAA,GAAK,GAAKD,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,MAAO,EAInD,CAKAF,GAAO,QAAUC,KC9EjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAqBJ,IAhBAF,EAAKN,EAAE,MAAO,CAAE,EAChBK,EAAML,EAAE,QAAS,CAAE,EAGnBO,EAAKP,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFM,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAC7B,GAAKJ,EAAKD,EAAMI,CAAG,IAClBL,GAAS,EACJA,GAASD,GACb,MAAO,GAGTM,GAAMF,CACP,CACA,MAAO,EACR,CAKAP,GAAO,QAAUC,KC/GjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiCJ,IA5BAN,EAAKP,EAAE,MACPU,EAAKV,EAAE,QACFF,GAAeY,CAAG,IAAM,GAE5BF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKX,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFW,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,GAAKR,EAAKD,EAAMQ,CAAG,IAClBT,GAAS,EACJA,GAASD,GACb,MAAO,GAGTU,GAAMN,CACP,CACAM,GAAML,CACP,CACA,MAAO,EACR,CAKAT,GAAO,QAAUE,KCxIjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAqCJ,IAhCAR,EAAKR,EAAE,MACPY,EAAKZ,EAAE,QACFF,GAAec,CAAG,IAAM,GAE5BH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKb,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFc,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,GAAKV,EAAKD,EAAMU,CAAG,IAClBX,GAAS,EACJA,GAASD,GACb,MAAO,GAGTY,GAAMR,CACP,CACAQ,GAAMP,CACP,CACAO,GAAMN,CACP,CACA,MAAO,EACR,CAKAV,GAAO,QAAUE,KClJjB,IAAAkB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyCJ,IApCAV,EAAKT,EAAE,MACPc,EAAKd,EAAE,QACFF,GAAegB,CAAG,IAAM,GAE5BJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKf,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFiB,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,GAAKZ,EAAKD,EAAMY,CAAG,IAClBb,GAAS,EACJA,GAASD,GACb,MAAO,GAGTc,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACAQ,GAAMP,CACP,CACA,MAAO,EACR,CAKAX,GAAO,QAAUE,KC9JjB,IAAAqB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA6CJ,IAxCAZ,EAAKV,EAAE,MACPgB,EAAKhB,EAAE,QACFF,GAAekB,CAAG,IAAM,GAE5BL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKjB,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFoB,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,GAAKd,EAAKD,EAAMc,CAAG,IAClBf,GAAS,EACJA,GAASD,GACb,MAAO,GAGTgB,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACA,MAAO,EACR,CAKAZ,GAAO,QAAUE,KCxKjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiDJ,IA5CAd,EAAKX,EAAE,MACPkB,EAAKlB,EAAE,QACFF,GAAeoB,CAAG,IAAM,GAE5BN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKnB,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFuB,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,GAAKhB,EAAKD,EAAMgB,CAAG,IAClBjB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTkB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACA,MAAO,EACR,CAKAb,GAAO,QAAUE,KClLjB,IAAA2B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAqDJ,IAhDAhB,EAAKZ,EAAE,MACPoB,EAAKpB,EAAE,QACFF,GAAesB,CAAG,IAAM,GAE5BP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKrB,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGF0B,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,GAAKlB,EAAKD,EAAMkB,CAAG,IAClBnB,GAAS,EACJA,GAASD,GACb,MAAO,GAGToB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACA,MAAO,EACR,CAKAd,GAAO,QAAUE,KC5LjB,IAAA8B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyDJ,IApDAlB,EAAKb,EAAE,MACPsB,EAAKtB,EAAE,QACFF,GAAewB,CAAG,IAAM,GAE5BR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKvB,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGF6B,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,GAAKpB,EAAKD,EAAMoB,CAAG,IAClBrB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTsB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACA,MAAO,EACR,CAKAf,GAAO,QAAUE,KCtMjB,IAAAiC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA6DJ,IAxDApB,EAAKd,EAAE,MACPwB,EAAKxB,EAAE,QACFF,GAAe0B,CAAG,IAAM,GAE5BT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKzB,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFgC,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,GAAKtB,EAAKD,EAAMsB,CAAG,IAClBvB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTwB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACA,MAAO,EACR,CAKAhB,GAAO,QAAUE,KChNjB,IAAAoC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAmDlE,SAASC,GAASC,EAAGC,EAAI,CACxB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiEJ,IA5DAtB,EAAKf,EAAE,MACP0B,EAAK1B,EAAE,QACFF,GAAe4B,CAAG,IAAM,GAE5BV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAK3B,EAAE,OAGPG,EAAOH,EAAE,KAGTI,EAAMJ,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFmC,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,GAAKxB,EAAKD,EAAMwB,CAAG,IAClBzB,GAAS,EACJA,GAASD,GACb,MAAO,GAGT0B,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACA,MAAO,EACR,CAKAjB,GAAO,QAAUE,KC1NjB,IAAAuC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EAKtDC,GAAO,QAmDX,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0BJ,IAxBAJ,EAAKP,EAAE,MAGPK,EAAMT,GAAOW,CAAG,EAGhBJ,EAAOH,EAAE,KAGTQ,EAAKR,EAAE,QAGPS,EAAKT,EAAE,OAGPI,EAAOJ,EAAE,MAGTM,EAAMN,EAAE,UAAW,CAAE,EAGrBE,EAAQ,EAGFS,EAAI,EAAGA,EAAIN,EAAKM,IAErB,GADAD,EAAKb,GAAWU,EAAIC,EAAIC,EAAIL,EAAMO,EAAGb,EAAK,EACrCQ,EAAKH,EAAMO,CAAG,IAClBR,GAAS,EACJA,GAASD,GACb,MAAO,GAIV,MAAO,EACR,CAKAN,GAAO,QAAUI,KClIjB,IAAAa,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,MAAK,GAAAA,GAAK,IAAOD,EAAE,KAAMA,EAAE,MAAO,GAAKA,EAAE,KAAMA,EAAE,OAAO,CAAE,GAI3D,CAKAF,GAAO,QAAUC,KC3EjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkBJ,IAbAF,EAAKL,EAAE,MAAO,CAAE,EAChBI,EAAMJ,EAAE,QAAS,CAAE,EAGnBM,EAAKN,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFK,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAC7B,IAAOJ,EAAMG,CAAG,GAAKH,EAAMG,EAAG,CAAE,KAC/BJ,GAAS,EACJA,GAASD,GACb,MAAO,GAGTK,GAAMF,CACP,CACA,MAAO,EACR,CAKAN,GAAO,QAAUC,KCxGjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8BJ,IAzBAN,EAAKN,EAAE,MACPS,EAAKT,EAAE,QACFF,GAAeW,CAAG,IAAM,GAE5BF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKV,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFU,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAOR,EAAMO,CAAG,GAAKP,EAAMO,EAAG,CAAE,KAC/BR,GAAS,EACJA,GAASD,GACb,MAAO,GAGTS,GAAMN,CACP,CACAM,GAAML,CACP,CACA,MAAO,EACR,CAKAR,GAAO,QAAUE,KCjIjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkCJ,IA7BAR,EAAKP,EAAE,MACPW,EAAKX,EAAE,QACFF,GAAea,CAAG,IAAM,GAE5BH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKZ,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFa,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAOV,EAAMS,CAAG,GAAKT,EAAMS,EAAG,CAAE,KAC/BV,GAAS,EACJA,GAASD,GACb,MAAO,GAGTW,GAAMR,CACP,CACAQ,GAAMP,CACP,CACAO,GAAMN,CACP,CACA,MAAO,EACR,CAKAT,GAAO,QAAUE,KC3IjB,IAAAiB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsCJ,IAjCAV,EAAKR,EAAE,MACPa,EAAKb,EAAE,QACFF,GAAee,CAAG,IAAM,GAE5BJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKd,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFgB,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAOZ,EAAMW,CAAG,GAAKX,EAAMW,EAAG,CAAE,KAC/BZ,GAAS,EACJA,GAASD,GACb,MAAO,GAGTa,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACAQ,GAAMP,CACP,CACA,MAAO,EACR,CAKAV,GAAO,QAAUE,KCvJjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0CJ,IArCAZ,EAAKT,EAAE,MACPe,EAAKf,EAAE,QACFF,GAAeiB,CAAG,IAAM,GAE5BL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKhB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFmB,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAOd,EAAMa,CAAG,GAAKb,EAAMa,EAAG,CAAE,KAC/Bd,GAAS,EACJA,GAASD,GACb,MAAO,GAGTe,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACA,MAAO,EACR,CAKAX,GAAO,QAAUE,KCjKjB,IAAAuB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8CJ,IAzCAd,EAAKV,EAAE,MACPiB,EAAKjB,EAAE,QACFF,GAAemB,CAAG,IAAM,GAE5BN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKlB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFsB,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAOhB,EAAMe,CAAG,GAAKf,EAAMe,EAAG,CAAE,KAC/BhB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTiB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACA,MAAO,EACR,CAKAZ,GAAO,QAAUE,KC3KjB,IAAA0B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkDJ,IA7CAhB,EAAKX,EAAE,MACPmB,EAAKnB,EAAE,QACFF,GAAeqB,CAAG,IAAM,GAE5BP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKpB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFyB,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAOlB,EAAMiB,CAAG,GAAKjB,EAAMiB,EAAG,CAAE,KAC/BlB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTmB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACA,MAAO,EACR,CAKAb,GAAO,QAAUE,KCrLjB,IAAA6B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsDJ,IAjDAlB,EAAKZ,EAAE,MACPqB,EAAKrB,EAAE,QACFF,GAAeuB,CAAG,IAAM,GAE5BR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKtB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGF4B,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAOpB,EAAMmB,CAAG,GAAKnB,EAAMmB,EAAG,CAAE,KAC/BpB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTqB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACA,MAAO,EACR,CAKAd,GAAO,QAAUE,KC/LjB,IAAAgC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0DJ,IArDApB,EAAKb,EAAE,MACPuB,EAAKvB,EAAE,QACFF,GAAeyB,CAAG,IAAM,GAE5BT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKxB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGF+B,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAOtB,EAAMqB,CAAG,GAAKrB,EAAMqB,EAAG,CAAE,KAC/BtB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTuB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACA,MAAO,EACR,CAKAf,GAAO,QAAUE,KCzMjB,IAAAmC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAASC,EAAGC,EAAI,CACxB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8DJ,IAzDAtB,EAAKd,EAAE,MACPyB,EAAKzB,EAAE,QACFF,GAAe2B,CAAG,IAAM,GAE5BV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAK1B,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFkC,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAOxB,EAAMuB,CAAG,GAAKvB,EAAMuB,EAAG,CAAE,KAC/BxB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTyB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACA,MAAO,EACR,CAKAhB,GAAO,QAAUE,KCnNjB,IAAAsC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EAKtDC,GAAO,QAgDX,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAuBJ,IArBAJ,EAAKN,EAAE,MAGPK,EAAMT,GAAOU,CAAG,EAGhBH,EAAOH,EAAE,KAGTO,EAAKP,EAAE,QAGPQ,EAAKR,EAAE,OAGPI,EAAOJ,EAAE,MAGTE,EAAQ,EAGFQ,EAAI,EAAGA,EAAIL,EAAKK,IAErB,GADAD,EAAKZ,GAAWS,EAAIC,EAAIC,EAAIJ,EAAMM,EAAGZ,EAAK,GACnCK,EAAMM,CAAG,GAAKN,EAAMM,EAAG,CAAE,KAC/BP,GAAS,EACJA,GAASD,GACb,MAAO,GAIV,MAAO,EACR,CAKAN,GAAO,QAAUI,KC3HjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,MAAK,GAAAA,GAAK,GAAKD,EAAE,KAAMA,EAAE,MAAO,EAIjC,CAKAF,GAAO,QAAUC,KC3EjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkBJ,IAbAF,EAAKL,EAAE,MAAO,CAAE,EAChBI,EAAMJ,EAAE,QAAS,CAAE,EAGnBM,EAAKN,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFK,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAC7B,GAAKJ,EAAMG,CAAG,IACbJ,GAAS,EACJA,GAASD,GACb,MAAO,GAGTK,GAAMF,CACP,CACA,MAAO,EACR,CAKAN,GAAO,QAAUC,KCxGjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8BJ,IAzBAN,EAAKN,EAAE,MACPS,EAAKT,EAAE,QACFF,GAAeW,CAAG,IAAM,GAE5BF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAMK,EAAI,CAAE,EACZJ,EAAMI,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKV,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFU,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,GAAKR,EAAMO,CAAG,IACbR,GAAS,EACJA,GAASD,GACb,MAAO,GAGTS,GAAMN,CACP,CACAM,GAAML,CACP,CACA,MAAO,EACR,CAKAR,GAAO,QAAUE,KCjIjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkCJ,IA7BAR,EAAKP,EAAE,MACPW,EAAKX,EAAE,QACFF,GAAea,CAAG,IAAM,GAE5BH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAMO,EAAI,CAAE,EACZN,EAAMM,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBL,EAAMK,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKZ,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFa,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,GAAKV,EAAMS,CAAG,IACbV,GAAS,EACJA,GAASD,GACb,MAAO,GAGTW,GAAMR,CACP,CACAQ,GAAMP,CACP,CACAO,GAAMN,CACP,CACA,MAAO,EACR,CAKAT,GAAO,QAAUE,KC3IjB,IAAAiB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsCJ,IAjCAV,EAAKR,EAAE,MACPa,EAAKb,EAAE,QACFF,GAAee,CAAG,IAAM,GAE5BJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAMS,EAAI,CAAE,EACZR,EAAMQ,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBN,EAAMM,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKd,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFgB,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,GAAKZ,EAAMW,CAAG,IACbZ,GAAS,EACJA,GAASD,GACb,MAAO,GAGTa,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACAQ,GAAMP,CACP,CACA,MAAO,EACR,CAKAV,GAAO,QAAUE,KCvJjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0CJ,IArCAZ,EAAKT,EAAE,MACPe,EAAKf,EAAE,QACFF,GAAeiB,CAAG,IAAM,GAE5BL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBP,EAAMO,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKhB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFmB,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,GAAKd,EAAMa,CAAG,IACbd,GAAS,EACJA,GAASD,GACb,MAAO,GAGTe,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACAS,GAAMR,CACP,CACA,MAAO,EACR,CAKAX,GAAO,QAAUE,KCjKjB,IAAAuB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8CJ,IAzCAd,EAAKV,EAAE,MACPiB,EAAKjB,EAAE,QACFF,GAAemB,CAAG,IAAM,GAE5BN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAMa,EAAI,CAAE,EACZZ,EAAMY,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBR,EAAMQ,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKlB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFsB,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,GAAKhB,EAAMe,CAAG,IACbhB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTiB,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACAU,GAAMT,CACP,CACA,MAAO,EACR,CAKAZ,GAAO,QAAUE,KC3KjB,IAAA0B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAkDJ,IA7CAhB,EAAKX,EAAE,MACPmB,EAAKnB,EAAE,QACFF,GAAeqB,CAAG,IAAM,GAE5BP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAMe,EAAI,CAAE,EACZd,EAAMc,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBT,EAAMS,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKpB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFyB,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,GAAKlB,EAAMiB,CAAG,IACblB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTmB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACAW,GAAMV,CACP,CACA,MAAO,EACR,CAKAb,GAAO,QAAUE,KCrLjB,IAAA6B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAsDJ,IAjDAlB,EAAKZ,EAAE,MACPqB,EAAKrB,EAAE,QACFF,GAAeuB,CAAG,IAAM,GAE5BR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBV,EAAMU,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKtB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGF4B,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,GAAKpB,EAAMmB,CAAG,IACbpB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTqB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACAY,GAAMX,CACP,CACA,MAAO,EACR,CAKAd,GAAO,QAAUE,KC/LjB,IAAAgC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0DJ,IArDApB,EAAKb,EAAE,MACPuB,EAAKvB,EAAE,QACFF,GAAeyB,CAAG,IAAM,GAE5BT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBX,EAAMW,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAKxB,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGF+B,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,GAAKtB,EAAMqB,CAAG,IACbtB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTuB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACAa,GAAMZ,CACP,CACA,MAAO,EACR,CAKAf,GAAO,QAAUE,KCzMjB,IAAAmC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAgDlE,SAASC,GAASC,EAAGC,EAAI,CACxB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA8DJ,IAzDAtB,EAAKd,EAAE,MACPyB,EAAKzB,EAAE,QACFF,GAAe2B,CAAG,IAAM,GAE5BV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,IAGzBV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAAMV,EAAGU,EAAG,CAAC,EACzBnB,EAAMmB,EAAI,CAAE,EAAMT,EAAGS,EAAG,CAAC,EACzBlB,EAAMkB,EAAI,CAAE,EAAMR,EAAGQ,EAAG,CAAC,EACzBjB,EAAMiB,EAAI,CAAE,EAAMP,EAAGO,EAAG,CAAC,EACzBhB,EAAMgB,EAAI,CAAE,EAAMN,EAAGM,EAAG,CAAC,EACzBf,EAAMe,EAAI,CAAE,EAAML,EAAGK,EAAG,CAAC,EACzBd,EAAMc,EAAI,CAAE,EAAMJ,EAAGI,EAAG,CAAC,EACzBb,EAAMa,EAAI,CAAE,EAAMH,EAAGG,EAAG,CAAC,EACzBZ,EAAMY,EAAI,CAAE,EAAMF,EAAGE,EAAG,CAAC,GAG1BC,EAAK1B,EAAE,OAGPG,EAAOH,EAAE,KAGTE,EAAQ,EAGFkC,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,GAAKxB,EAAMuB,CAAG,IACbxB,GAAS,EACJA,GAASD,GACb,MAAO,GAGTyB,GAAMtB,CACP,CACAsB,GAAMrB,CACP,CACAqB,GAAMpB,CACP,CACAoB,GAAMnB,CACP,CACAmB,GAAMlB,CACP,CACAkB,GAAMjB,CACP,CACAiB,GAAMhB,CACP,CACAgB,GAAMf,CACP,CACAe,GAAMd,CACP,CACAc,GAAMb,CACP,CACA,MAAO,EACR,CAKAhB,GAAO,QAAUE,KCnNjB,IAAAsC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EAKtDC,GAAO,QAgDX,SAASC,GAAQC,EAAGC,EAAI,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAuBJ,IArBAJ,EAAKN,EAAE,MAGPK,EAAMT,GAAOU,CAAG,EAGhBH,EAAOH,EAAE,KAGTO,EAAKP,EAAE,QAGPQ,EAAKR,EAAE,OAGPI,EAAOJ,EAAE,MAGTE,EAAQ,EAGFQ,EAAI,EAAGA,EAAIL,EAAKK,IAErB,GADAD,EAAKZ,GAAWS,EAAIC,EAAIC,EAAIJ,EAAMM,EAAGZ,EAAK,EACrCK,EAAMM,CAAG,IACbP,GAAS,EACJA,GAASD,GACb,MAAO,GAIV,MAAO,EACR,CAKAN,GAAO,QAAUI,KC3HjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,kDAAmD,EAC7EC,GAAiB,QAAS,2CAA4C,EACtEC,GAAiB,QAAS,sCAAuC,EACjEC,GAAwB,QAAS,+CAAgD,EACjFC,GAAiB,QAAS,yCAA0C,EACpEC,GAAqB,QAAS,0CAA2C,EACzEC,GAAqB,QAAS,0CAA2C,EACzEC,GAAQ,QAAS,yBAA0B,EAC3CC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAwB,KACxBC,GAAyB,KACzBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAuB,KACvBC,GAAwB,KACxBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAiB,KACjBC,GAAkB,KAClBC,GAAiB,KACjBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAiB,KACjBC,GAAgB,KAChBC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAS,KACTC,GAAU,KACVC,GAAS,KAKTC,GAAO,CACVZ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIE,GAAgB,CACnBrC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACI2B,GAAe,CAClB1B,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIgB,GAAe,CAClBhD,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIyC,GAAwB,CAC3BnE,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACI4D,GAAuB,CAC1B3D,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIoD,GAAWN,GAAK,OAAS,EAyD7B,SAASO,GAAMC,EAAS,CACvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAwBJ,GArBAH,EAAItF,GAAgB2E,EAAQ,CAAE,CAAE,EAChCY,EAAIvF,GAAgB2E,EAAQ,CAAE,CAAE,EAEhCI,EAAMO,EAAE,MACRT,EAAQE,EAAI,OAGZM,EAAIE,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,MAAO,EAGlC1F,GAAgByF,EAAE,IAAK,GAC3BA,EAAE,KAAOpF,GAAoBoF,EAAE,KAAM,CAAE,EACvCA,EAAE,iBAAmB,IACV1F,GAAgB0F,EAAE,IAAK,IAClCA,EAAE,KAAOrF,GAAoBqF,EAAE,KAAM,CAAE,EACvCA,EAAE,iBAAmB,GACrBA,EAAE,QAAUnF,GAAO0E,EAAO,EAAGS,EAAE,QAAS,CAAE,EAC1CA,EAAE,QAAU,EACZV,EAAU,IAGNC,IAAU,EACd,OAAKS,EAAE,iBACClB,GAAeS,CAAM,EAAGS,EAAGD,CAAE,EAEhCT,EACGP,GAAcQ,CAAM,EAAGS,EAAGD,CAAE,EAE7BlB,GAAMU,CAAM,EAAGS,EAAGD,CAAE,EAK5B,IAFAJ,EAAM,EACNG,EAAK,EACCK,EAAI,EAAGA,EAAIZ,EAAOY,IACvBD,EAAIT,EAAKU,CAAE,EAGXR,GAAOO,EAGFA,IAAM,IACVJ,GAAM,GAIR,GAAKH,IAAQ,EACZ,MAAO,GAGR,GAAKJ,IAAU,EACd,OAAKS,EAAE,iBACClB,GAAeS,CAAM,EAAGS,EAAGD,CAAE,EAEhCT,EACGP,GAAcQ,CAAM,EAAGS,EAAGD,CAAE,EAE7BlB,GAAMU,CAAM,EAAGS,EAAGD,CAAE,EAK5B,GAHAH,EAAKI,EAAE,QAGFF,IAAOP,EAAM,EAAI,CAErB,IAAMY,EAAI,EAAGA,EAAIZ,GACXE,EAAKU,CAAE,IAAM,EADKA,IACvB,CAMD,OAFAH,EAAE,MAAQ,CAAEP,EAAIU,CAAC,CAAE,EACnBH,EAAE,QAAU,CAAEJ,EAAGO,CAAC,CAAE,EACfH,EAAE,iBACClB,GAAe,CAAE,EAAGkB,EAAGD,CAAE,EAE5BT,EACGP,GAAc,CAAE,EAAGiB,EAAGD,CAAE,EAEzBlB,GAAM,CAAE,EAAGmB,EAAGD,CAAE,CACxB,CAIA,GAHAL,EAAMlF,GAAgBoF,CAAG,EAGpBF,IAAQ,EAAI,CAKhB,GAHAF,EAAO/E,GAAuBgF,EAAKG,EAAII,EAAE,MAAO,EAG3CL,IAAUH,EAAK,CAAC,EAAEA,EAAK,CAAC,EAAE,GAASF,GAAWK,EAAI,IAAQH,EAAK,CAAC,EAAEA,EAAK,CAAC,EAAE,EAU9E,OARKE,IAAQ,EACZG,EAAKL,EAAM,CAAE,EAEbK,EAAKL,EAAM,CAAE,EAEdQ,EAAE,MAAQ,CAAEL,CAAI,EAChBK,EAAE,QAAU,CAAIV,EAAYI,EAAI,EAAIA,CAAI,EACxCM,EAAE,OAASH,EACNG,EAAE,iBACClB,GAAe,CAAE,EAAGkB,EAAGD,CAAE,EAE5BT,EACGP,GAAc,CAAE,EAAGiB,EAAGD,CAAE,EAEzBlB,GAAM,CAAE,EAAGmB,EAAGD,CAAE,EAKxB,GAAKR,GAASJ,GAEb,OAAKa,EAAE,iBACClB,GAAeS,CAAM,EAAGS,EAAGD,CAAE,EAEhCT,EACGP,GAAcQ,CAAM,EAAGS,EAAGD,CAAE,EAE7BlB,GAAMU,CAAM,EAAGS,EAAGD,CAAE,CAG7B,CAIA,OAAKR,GAASJ,GACRa,EAAE,iBACCf,GAAuBM,EAAM,CAAE,EAAGS,EAAGD,CAAE,EAE1CT,EACGJ,GAAsBK,EAAM,CAAE,EAAGS,EAAGD,CAAE,EAEvCf,GAAcO,EAAM,CAAE,EAAGS,EAAGD,CAAE,EAGjCC,EAAE,iBACC5C,GAAgB4C,EAAGD,CAAE,EAExBT,EACGtB,GAAegC,EAAGD,CAAE,EAErBnB,GAAQoB,EAAGD,CAAE,CACrB,CAKA1F,GAAO,QAAU+E,KCtUjB,IAAIgB,GAAO,KAKX,OAAO,QAAUA",
-  "names": ["require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome2d", "x", "n", "bsize", "count", "xbuf", "get", "dx0", "dx1", "ox1", "sh", "s0", "s1", "sx", "ox", "ix", "i0", "i1", "j0", "j1", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome3d", "x", "n", "bsize", "count", "xbuf", "get", "dx0", "dx1", "dx2", "ox1", "ox2", "sh", "s0", "s1", "s2", "sx", "ox", "ix", "i0", "i1", "i2", "j0", "j1", "j2", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome4d", "x", "n", "bsize", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "ox1", "ox2", "ox3", "sh", "s0", "s1", "s2", "s3", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome5d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "ox1", "ox2", "ox3", "ox4", "sh", "s0", "s1", "s2", "s3", "s4", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome6d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "ox1", "ox2", "ox3", "ox4", "ox5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome7d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome8d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome9d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "o", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome10d", "x", "n", "count", "bsize", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "ox9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome2d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "ox1", "sh", "s0", "s1", "sx", "ox", "ix", "i0", "i1", "j0", "j1", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome3d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "ox1", "ox2", "sh", "s0", "s1", "s2", "sx", "ox", "ix", "i0", "i1", "i2", "j0", "j1", "j2", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome4d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "ox1", "ox2", "ox3", "sh", "s0", "s1", "s2", "s3", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome5d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "ox1", "ox2", "ox3", "ox4", "sh", "s0", "s1", "s2", "s3", "s4", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome6d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "ox1", "ox2", "ox3", "ox4", "ox5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome7d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome8d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome9d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "o", "require_d_blocked_complex", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome10d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "ox9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome2d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "ox1", "sh", "s0", "s1", "sx", "ox", "ix", "i0", "i1", "j0", "j1", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome3d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "dx2", "ox1", "ox2", "sh", "s0", "s1", "s2", "sx", "ox", "ix", "i0", "i1", "i2", "j0", "j1", "j2", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome4d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "ox1", "ox2", "ox3", "sh", "s0", "s1", "s2", "s3", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome5d", "x", "n", "bsize", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "ox1", "ox2", "ox3", "ox4", "sh", "s0", "s1", "s2", "s3", "s4", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome6d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "ox1", "ox2", "ox3", "ox4", "ox5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome7d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome8d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome9d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "o", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "blockedsome10d", "x", "n", "count", "bsize", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "ox1", "ox2", "ox3", "ox4", "ox5", "ox6", "ox7", "ox8", "ox9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sx", "ox", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "o", "require_d_accessors", "__commonJSMin", "exports", "module", "some0d", "x", "n", "require_d_accessors", "__commonJSMin", "exports", "module", "some1d", "x", "n", "count", "xbuf", "get", "dx0", "S0", "ix", "i0", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some2d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "sh", "S0", "S1", "sx", "ix", "i0", "i1", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some3d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "sh", "S0", "S1", "S2", "sx", "ix", "i0", "i1", "i2", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some4d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "sh", "S0", "S1", "S2", "S3", "sx", "ix", "i0", "i1", "i2", "i3", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some5d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "sh", "S0", "S1", "S2", "S3", "S4", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some6d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some7d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some8d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some9d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "require_d_accessors", "__commonJSMin", "exports", "module", "strides2order", "some10d", "x", "n", "count", "xbuf", "get", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "require_nd_accessors", "__commonJSMin", "exports", "module", "numel", "vind2bind", "MODE", "somend", "x", "n", "count", "xbuf", "ordx", "len", "get", "sh", "sx", "ox", "ix", "i", "require_d_complex", "__commonJSMin", "exports", "module", "some0d", "x", "n", "require_d_complex", "__commonJSMin", "exports", "module", "some1d", "x", "n", "count", "xbuf", "dx0", "S0", "ix", "i0", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some2d", "x", "n", "count", "xbuf", "dx0", "dx1", "sh", "S0", "S1", "sx", "ix", "i0", "i1", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some3d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "sh", "S0", "S1", "S2", "sx", "ix", "i0", "i1", "i2", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some4d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "sh", "S0", "S1", "S2", "S3", "sx", "ix", "i0", "i1", "i2", "i3", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some5d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "sh", "S0", "S1", "S2", "S3", "S4", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some6d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some7d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some8d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some9d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "require_d_complex", "__commonJSMin", "exports", "module", "strides2order", "some10d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "require_nd_complex", "__commonJSMin", "exports", "module", "numel", "vind2bind", "MODE", "somend", "x", "n", "count", "xbuf", "ordx", "len", "sh", "sx", "ox", "ix", "i", "require_d", "__commonJSMin", "exports", "module", "some0d", "x", "n", "require_d", "__commonJSMin", "exports", "module", "some1d", "x", "n", "count", "xbuf", "dx0", "S0", "ix", "i0", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some2d", "x", "n", "count", "xbuf", "dx0", "dx1", "sh", "S0", "S1", "sx", "ix", "i0", "i1", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some3d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "sh", "S0", "S1", "S2", "sx", "ix", "i0", "i1", "i2", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some4d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "sh", "S0", "S1", "S2", "S3", "sx", "ix", "i0", "i1", "i2", "i3", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some5d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "sh", "S0", "S1", "S2", "S3", "S4", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some6d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some7d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some8d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some9d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "require_d", "__commonJSMin", "exports", "module", "strides2order", "some10d", "x", "n", "count", "xbuf", "dx0", "dx1", "dx2", "dx3", "dx4", "dx5", "dx6", "dx7", "dx8", "dx9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sx", "ix", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "require_nd", "__commonJSMin", "exports", "module", "numel", "vind2bind", "MODE", "somend", "x", "n", "count", "xbuf", "ordx", "len", "sh", "sx", "ox", "ix", "i", "require_main", "__commonJSMin", "exports", "module", "isComplexArray", "isBooleanArray", "iterationOrder", "minmaxViewBufferIndex", "ndarray2object", "reinterpretComplex", "reinterpretBoolean", "gscal", "blockedaccessorsome2d", "blockedaccessorsome3d", "blockedaccessorsome4d", "blockedaccessorsome5d", "blockedaccessorsome6d", "blockedaccessorsome7d", "blockedaccessorsome8d", "blockedaccessorsome9d", "blockedaccessorsome10d", "blockedcomplexsome2d", "blockedcomplexsome3d", "blockedcomplexsome4d", "blockedcomplexsome5d", "blockedcomplexsome6d", "blockedcomplexsome7d", "blockedcomplexsome8d", "blockedcomplexsome9d", "blockedcomplexsome10d", "blockedsome2d", "blockedsome3d", "blockedsome4d", "blockedsome5d", "blockedsome6d", "blockedsome7d", "blockedsome8d", "blockedsome9d", "blockedsome10d", "accessorsome0d", "accessorsome1d", "accessorsome2d", "accessorsome3d", "accessorsome4d", "accessorsome5d", "accessorsome6d", "accessorsome7d", "accessorsome8d", "accessorsome9d", "accessorsome10d", "accessorsomend", "complexsome0d", "complexsome1d", "complexsome2d", "complexsome3d", "complexsome4d", "complexsome5d", "complexsome6d", "complexsome7d", "complexsome8d", "complexsome9d", "complexsome10d", "complexsomend", "some0d", "some1d", "some2d", "some3d", "some4d", "some5d", "some6d", "some7d", "some8d", "some9d", "some10d", "somend", "SOME", "ACCESSOR_SOME", "COMPLEX_SOME", "BLOCKED_SOME", "BLOCKED_ACCESSOR_SOME", "BLOCKED_COMPLEX_SOME", "MAX_DIMS", "some", "arrays", "isCmplx", "ndims", "xmmv", "shx", "iox", "len", "sx", "ox", "ns", "N", "x", "n", "d", "i", "main"]
-}
diff --git a/docs/repl.txt b/docs/repl.txt
deleted file mode 100644
index 420ecfd..0000000
--- a/docs/repl.txt
+++ /dev/null
@@ -1,58 +0,0 @@
-
-{{alias}}( arrays )
-    Tests whether at least `n` elements in an ndarray are truthy.
-
-    A provided "ndarray" should be an object with the following properties:
-
-    - dtype: data type.
-    - data: data buffer.
-    - shape: dimensions.
-    - strides: stride lengths.
-    - offset: index offset.
-    - order: specifies whether an ndarray is row-major (C-style) or column-major
-    (Fortran-style).
-
-    Parameters
-    ----------
-    arrays: ArrayLikeObject<ndarray>
-        Array-like object containing an input ndarray and a zero-dimensional
-        ndarray specifying the minimum number of elements in the input ndarray
-        that must be truthy.
-
-    Returns
-    -------
-    out: boolean
-        Boolean indicating whether at least `n` elements in an ndarray are
-        truthy.
-
-    Examples
-    --------
-    // Define ndarray data and meta data...
-    > var xbuf = new {{alias:@stdlib/array/float64}}( [ 1.0, 1.0, 0.0, 1.0 ] );
-    > var dt = 'float64';
-    > var sh = [ 2, 2 ];
-    > var sx = [ 2, 1 ];
-    > var ox = 0;
-    > var ord = 'row-major';
-
-    // Using an ndarray...
-    > var x = {{alias:@stdlib/ndarray/ctor}}( dt, xbuf, sh, sx, ox, ord );
-    > var n = {{alias:@stdlib/ndarray/from-scalar}}( 3 );
-    > {{alias}}( [ x, n ] )
-    true
-
-    // Using a minimal ndarray-like object...
-    > xbuf = new {{alias:@stdlib/array/float64}}( [ -1.0, 0.0, 0.0, -1.0 ] );
-    > x = {
-    ...     'dtype': dt,
-    ...     'data': xbuf,
-    ...     'shape': sh,
-    ...     'strides': sx,
-    ...     'offset': ox,
-    ...     'order': ord
-    ... };
-    > {{alias}}( [ x, n ] )
-    false
-
-    See Also
-    --------
diff --git a/docs/types/index.d.ts b/docs/types/index.d.ts
deleted file mode 100644
index 785b37d..0000000
--- a/docs/types/index.d.ts
+++ /dev/null
@@ -1,63 +0,0 @@
-/*
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-// TypeScript Version: 4.1
-
-/// <reference types="@stdlib/types"/>
-
-import { ndarray, typedndarray } from '@stdlib/types/ndarray';
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @param arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must be truthy
-* @returns boolean indicating whether `n` elements pass a test
-*
-* @example
-* var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-* var Float64Array = require( '@stdlib/array-float64' );
-* var ndarray = require( '@stdlib/ndarray-ctor' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the array:
-* var shape = [ 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create the input ndarray:
-* var x = ndarray( 'float64', xbuf, shape, sx, ox, 'row-major' );
-* var n = scalar2ndarray( 3, {
-*     'dtype': 'generic'
-* });
-*
-* // Test elements:
-* var out = some( [ x, n ] );
-* // returns true
-*/
-declare function some( arrays: [ ndarray, typedndarray<number> ] ): boolean;
-
-
-// EXPORTS //
-
-export = some;
diff --git a/docs/types/test.ts b/docs/types/test.ts
deleted file mode 100644
index b0d27b4..0000000
--- a/docs/types/test.ts
+++ /dev/null
@@ -1,63 +0,0 @@
-/*
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-import zeros = require( '@stdlib/ndarray-zeros' );
-import scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-import some = require( './index' );
-
-
-// TESTS //
-
-// The function returns a boolean...
-{
-	const x = zeros( [ 2, 2 ] );
-	const n = scalar2ndarray( 2, { 'dtype': 'generic' } );
-
-	some( [ x, n ] ); // $ExpectType boolean
-}
-
-// The compiler throws an error if the function is provided a first argument which is not an array-like object containing ndarray-like objects...
-{
-	some( 5 ); // $ExpectError
-	some( true ); // $ExpectError
-	some( false ); // $ExpectError
-	some( null ); // $ExpectError
-	some( undefined ); // $ExpectError
-	some( {} ); // $ExpectError
-	some( [ 1 ] ); // $ExpectError
-	some( ( x: number ): number => x ); // $ExpectError
-
-	some( 5 ); // $ExpectError
-	some( true ); // $ExpectError
-	some( false ); // $ExpectError
-	some( null ); // $ExpectError
-	some( undefined ); // $ExpectError
-	some( {} ); // $ExpectError
-	some( [ 1 ] ); // $ExpectError
-	some( ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided an unsupported number of arguments...
-{
-	const x = zeros( [ 2, 2 ] );
-	const n = scalar2ndarray( 2, { 'dtype': 'generic' } );
-
-	some(); // $ExpectError
-	some( [ x ] ); // $ExpectError
-	some( [ x, n ], {}, {} ); // $ExpectError
-}
diff --git a/examples/index.js b/examples/index.js
deleted file mode 100644
index 61d42e9..0000000
--- a/examples/index.js
+++ /dev/null
@@ -1,43 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var ndarray2array = require( '@stdlib/ndarray-base-to-array' );
-var some = require( './../lib' );
-
-var x = {
-	'dtype': 'generic',
-	'data': discreteUniform( 10, -2, 10, {
-		'dtype': 'generic'
-	}),
-	'shape': [ 5, 2 ],
-	'strides': [ 2, 1 ],
-	'offset': 0,
-	'order': 'row-major'
-};
-console.log( ndarray2array( x.data, x.shape, x.strides, x.offset, x.order ) );
-
-var n = scalar2ndarray( 5, {
-	'dtype': 'generic'
-});
-
-var out = some( [ x, n ] );
-console.log( out );
diff --git a/index.js b/index.js
new file mode 100644
index 0000000..fddd062
--- /dev/null
+++ b/index.js
@@ -0,0 +1,3 @@
+// Copyright (c) 2026 The Stdlib Authors. License is Apache-2.0: http://www.apache.org/licenses/LICENSE-2.0
+!function(r,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(r="undefined"!=typeof globalThis?globalThis:r||self).some=t()}(this,(function(){"use strict";var r=8,t=16;var e=1;var n="function"==typeof Object.defineProperty?Object.defineProperty:null;var o=Object.defineProperty;function i(r){return"number"==typeof r}function a(r){var t,e="";for(t=0;t<r;t++)e+="0";return e}function f(r,t,e){var n=!1,o=t-r.length;return o<0||(function(r){return"-"===r[0]}(r)&&(n=!0,r=r.substr(1)),r=e?r+a(o):a(o)+r,n&&(r="-"+r)),r}var u=String.prototype.toLowerCase,s=String.prototype.toUpperCase;function l(r){var t,e,n;switch(r.specifier){case"b":t=2;break;case"o":t=8;break;case"x":case"X":t=16;break;default:t=10}if(e=r.arg,n=parseInt(e,10),!isFinite(n)){if(!i(e))throw new Error("invalid integer. Value: "+e);n=0}return n<0&&("u"===r.specifier||10!==t)&&(n=4294967295+n+1),n<0?(e=(-n).toString(t),r.precision&&(e=f(e,r.precision,r.padRight)),e="-"+e):(e=n.toString(t),n||r.precision?r.precision&&(e=f(e,r.precision,r.padRight)):e="",r.sign&&(e=r.sign+e)),16===t&&(r.alternate&&(e="0x"+e),e=r.specifier===s.call(r.specifier)?s.call(e):u.call(e)),8===t&&r.alternate&&"0"!==e.charAt(0)&&(e="0"+e),e}var h=Math.abs,c=String.prototype.toLowerCase,p=String.prototype.toUpperCase,y=String.prototype.replace,g=/e\+(\d)$/,m=/e-(\d)$/,v=/^(\d+)$/,d=/^(\d+)e/,w=/\.0$/,b=/\.0*e/,E=/(\..*[^0])0*e/;function _(r,t){var e,n;switch(t.specifier){case"e":case"E":n=r.toExponential(t.precision);break;case"f":case"F":n=r.toFixed(t.precision);break;case"g":case"G":h(r)<1e-4?((e=t.precision)>0&&(e-=1),n=r.toExponential(e)):n=r.toPrecision(t.precision),t.alternate||(n=y.call(n,E,"$1e"),n=y.call(n,b,"e"),n=y.call(n,w,""));break;default:throw new Error("invalid double notation. Value: "+t.specifier)}return n=y.call(n,g,"e+0$1"),n=y.call(n,m,"e-0$1"),t.alternate&&(n=y.call(n,v,"$1."),n=y.call(n,d,"$1.e")),r>=0&&t.sign&&(n=t.sign+n),n=t.specifier===p.call(t.specifier)?p.call(n):c.call(n)}function T(r){var t,e="";for(t=0;t<r;t++)e+=" ";return e}var x=String.fromCharCode,V=Array.isArray;function A(r){return r!=r}function j(r){var t={};return t.specifier=r.specifier,t.precision=void 0===r.precision?1:r.precision,t.width=r.width,t.flags=r.flags||"",t.mapping=r.mapping,t}function S(r){var t,e,n,o,a,u,s,h,c,p,y,g,m,v;if(!V(r))throw new TypeError("invalid argument. First argument must be an array. Value: `"+r+"`.");for(u="",s=1,c=0;c<r.length;c++)if(n=r[c],"string"==typeof n)u+=n;else{if(t=void 0!==n.precision,!(n=j(n)).specifier)throw new TypeError("invalid argument. Token is missing `specifier` property. Index: `"+c+"`. Value: `"+n+"`.");for(n.mapping&&(s=n.mapping),e=n.flags,p=0;p<e.length;p++)switch(o=e.charAt(p)){case" ":n.sign=" ";break;case"+":n.sign="+";break;case"-":n.padRight=!0,n.padZeros=!1;break;case"0":n.padZeros=e.indexOf("-")<0;break;case"#":n.alternate=!0;break;default:throw new Error("invalid flag: "+o)}if("*"===n.width){if(n.width=parseInt(arguments[s],10),s+=1,A(n.width))throw new TypeError("the argument for * width at position "+s+" is not a number. Value: `"+n.width+"`.");n.width<0&&(n.padRight=!0,n.width=-n.width)}if(t&&"*"===n.precision){if(n.precision=parseInt(arguments[s],10),s+=1,A(n.precision))throw new TypeError("the argument for * precision at position "+s+" is not a number. Value: `"+n.precision+"`.");n.precision<0&&(n.precision=1,t=!1)}switch(n.arg=arguments[s],n.specifier){case"b":case"o":case"x":case"X":case"d":case"i":case"u":t&&(n.padZeros=!1),n.arg=l(n);break;case"s":n.maxWidth=t?n.precision:-1,n.arg=String(n.arg);break;case"c":if(!A(n.arg)){if((a=parseInt(n.arg,10))<0||a>127)throw new Error("invalid character code. Value: "+n.arg);n.arg=A(a)?String(n.arg):x(a)}break;case"e":case"E":case"f":case"F":case"g":case"G":if(t||(n.precision=6),h=parseFloat(n.arg),!isFinite(h)){if(!i(n.arg))throw new Error("invalid floating-point number. Value: "+u);h=n.arg,n.padZeros=!1}n.arg=_(h,n);break;default:throw new Error("invalid specifier: "+n.specifier)}n.maxWidth>=0&&n.arg.length>n.maxWidth&&(n.arg=n.arg.substring(0,n.maxWidth)),n.padZeros?n.arg=f(n.arg,n.width||n.precision,n.padRight):n.width&&(n.arg=(y=n.arg,g=n.width,m=n.padRight,v=void 0,(v=g-y.length)<0?y:y=m?y+T(v):T(v)+y)),u+=n.arg||"",s+=1}return u}var F=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function L(r){var t={mapping:r[1]?parseInt(r[1],10):void 0,flags:r[2],width:r[3],precision:r[5],specifier:r[6]};return"."===r[4]&&void 0===r[5]&&(t.precision="1"),t}function O(r){var t,e,n,o;for(e=[],o=0,n=F.exec(r);n;)(t=r.slice(o,F.lastIndex-n[0].length)).length&&e.push(t),"%"===n[6]?e.push("%"):e.push(L(n)),o=F.lastIndex,n=F.exec(r);return(t=r.slice(o)).length&&e.push(t),e}function I(r){var t,e;if("string"!=typeof r)throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));for(t=[O(r)],e=1;e<arguments.length;e++)t.push(arguments[e]);return S.apply(null,t)}var k,B=Object.prototype,R=B.toString,P=B.__defineGetter__,M=B.__defineSetter__,C=B.__lookupGetter__,N=B.__lookupSetter__;k=function(){try{return n({},"x",{}),!0}catch(r){return!1}}()?o:function(r,t,e){var n,o,i,a;if("object"!=typeof r||null===r||"[object Array]"===R.call(r))throw new TypeError(I("invalid argument. First argument must be an object. Value: `%s`.",r));if("object"!=typeof e||null===e||"[object Array]"===R.call(e))throw new TypeError(I("invalid argument. Property descriptor must be an object. Value: `%s`.",e));if((o="value"in e)&&(C.call(r,t)||N.call(r,t)?(n=r.__proto__,r.__proto__=B,delete r[t],r[t]=e.value,r.__proto__=n):r[t]=e.value),i="get"in e,a="set"in e,o&&(i||a))throw new Error("invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.");return i&&P&&P.call(r,t,e.get),a&&M&&M.call(r,t,e.set),r};var U=k;function Y(r,t,e){U(r,t,{configurable:!1,enumerable:!1,writable:!1,value:e})}function W(r,t,e){var n,o,i,a,f;for(n=r.length,o=e,i=e,f=0;f<n;f++){if(0===r[f])return[e,e];(a=t[f])>0?i+=a*(r[f]-1):a<0&&(o+=a*(r[f]-1))}return[o,i]}Y(W,"assign",(function(r,t,e,n){var o,i,a,f,u;for(o=r.length,i=e,a=e,u=0;u<o;u++){if(0===r[u])return n[0]=e,n[1]=e,n;(f=t[u])>0?a+=f*(r[u]-1):f<0&&(i+=f*(r[u]-1))}return n[0]=i,n[1]=a,n}));var Z="function";function $(r){return typeof r.get===Z&&typeof r.set===Z}var G={complex128:function(r,t){return r.get(t)},complex64:function(r,t){return r.get(t)},default:function(r,t){return r.get(t)}};function K(r){var t=G[r];return"function"==typeof t?t:G.default}var X={complex128:function(r,t,e){r.set(e,t)},complex64:function(r,t,e){r.set(e,t)},default:function(r,t,e){r.set(e,t)}};function z(r){var t=X[r];return"function"==typeof t?t:X.default}var H={float64:function(r,t){return r[t]},float32:function(r,t){return r[t]},int32:function(r,t){return r[t]},int16:function(r,t){return r[t]},int8:function(r,t){return r[t]},uint32:function(r,t){return r[t]},uint16:function(r,t){return r[t]},uint8:function(r,t){return r[t]},uint8c:function(r,t){return r[t]},generic:function(r,t){return r[t]},default:function(r,t){return r[t]}};function J(r){var t=H[r];return"function"==typeof t?t:H.default}var D={float64:function(r,t,e){r[t]=e},float32:function(r,t,e){r[t]=e},int32:function(r,t,e){r[t]=e},int16:function(r,t,e){r[t]=e},int8:function(r,t,e){r[t]=e},uint32:function(r,t,e){r[t]=e},uint16:function(r,t,e){r[t]=e},uint8:function(r,t,e){r[t]=e},uint8c:function(r,t,e){r[t]=e},generic:function(r,t,e){r[t]=e},default:function(r,t,e){r[t]=e}};function q(r){var t=D[r];return"function"==typeof t?t:D.default}function Q(r){var t,e,n;if(0===(t=r.length))return 0;for(e=1,n=0;n<t;n++)e*=r[n];return e}function rr(r){var t,e,n;for(e=r.length,t=[],n=0;n<e;n++)t.push(r[n]);return t}function tr(r){return"string"==typeof r}var er="function"==typeof Symbol&&"symbol"==typeof Symbol("foo");function nr(){return er&&"symbol"==typeof Symbol.toStringTag}var or=Object.prototype.toString;var ir=Object.prototype.hasOwnProperty;function ar(r,t){return null!=r&&ir.call(r,t)}var fr="function"==typeof Symbol?Symbol:void 0,ur="function"==typeof fr?fr.toStringTag:"";var sr=nr()?function(r){var t,e,n;if(null==r)return or.call(r);e=r[ur],t=ar(r,ur);try{r[ur]=void 0}catch(t){return or.call(r)}return n=or.call(r),t?r[ur]=e:delete r[ur],n}:function(r){return or.call(r)},lr=String.prototype.valueOf;var hr=nr();function cr(r){return"object"==typeof r&&(r instanceof String||(hr?function(r){try{return lr.call(r),!0}catch(r){return!1}}(r):"[object String]"===sr(r)))}function pr(r){return tr(r)||cr(r)}function yr(r){return"column-major"===r}function gr(r,t){return yr(t)?function(r){var t,e,n;for(t=[],e=1,n=0;n<r.length;n++)t.push(e),e*=r[n];return t}(r):function(r){var t,e,n,o;for(t=r.length,e=[],o=0;o<t;o++)e.push(0);for(n=1,o=t-1;o>=0;o--)e[o]=n,n*=r[o];return e}(r)}Y(pr,"isPrimitive",tr),Y(pr,"isObject",cr),Y(gr,"assign",(function(r,t,e){return yr(t)?function(r,t){var e,n;for(e=1,n=0;n<r.length;n++)t[n]=e,e*=r[n];return t}(r,e):function(r,t){var e,n;for(e=1,n=r.length-1;n>=0;n--)t[n]=e,e*=r[n];return t}(r,e)}));var mr="row-major";function vr(r,t){var e,n,o;return"object"!=typeof(o=r.strides)||null===o?0===(n=r.shape).length?[0]:(tr(e=r.order)||(e=mr),gr(n,e)):t?rr(o):o}function dr(r){return"number"==typeof r}var wr=Number,br=wr.prototype.toString;var Er=nr();function _r(r){return"object"==typeof r&&(r instanceof wr||(Er?function(r){try{return br.call(r),!0}catch(r){return!1}}(r):"[object Number]"===sr(r)))}function Tr(r){return dr(r)||_r(r)}function xr(r){var t,e,n;return dr(n=r.offset)?n:0===(e=r.shape).length||"object"!=typeof(t=r.strides)||null===t?0:function(r,t){var e,n,o;for(n=r.length,e=0,o=0;o<n;o++)t[o]<0&&(e-=t[o]*(r[o]-1));return e}(e,t)}function Vr(r){return Math.abs(r)}function Ar(r){var t,e,n,o,i,a;if(0===(e=r.length))return 0;for(t=!0,n=!0,o=Vr(r[0]),a=1;a<e;a++){if(i=Vr(r[a]),t&&i<o?t=!1:n&&i>o&&(n=!1),!n&&!t)return 0;o=i}return n&&t?3:n?1:2}Y(Tr,"isPrimitive",dr),Y(Tr,"isObject",_r);var jr="row-major",Sr="column-major";function Fr(r){var t,e;return tr(e=r.order)?e:"object"!=typeof(t=r.strides)||null===t||1===(e=Ar(t))||3===e?jr:2===e?Sr:0===r.shape.length?jr:null}function Lr(r){var t,e,n,o;return t=function(r){return r.data}(r),n=function(r,t){var e=r.shape;return t?rr(e):e}(r,!0),o=function(r){return r.dtype}(r),e=$(t),{ref:r,dtype:o,data:t,length:Q(n),shape:n,strides:vr(r,!0),offset:xr(r),order:Fr(r),accessorProtocol:e,accessors:e?[K(o),z(o)]:[J(o),q(o)]}}var Or=16;function Ir(r){return"object"==typeof r&&null!==r&&"Complex128Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===Or}var kr=8;function Br(r){return"object"==typeof r&&null!==r&&"Complex64Array"===r.constructor.name&&r.BYTES_PER_ELEMENT===kr}var Rr="function"==typeof Float64Array;var Pr="function"==typeof Float64Array?Float64Array:null;var Mr,Cr="function"==typeof Float64Array?Float64Array:void 0;Mr=function(){var r,t,e;if("function"!=typeof Pr)return!1;try{t=new Pr([1,3.14,-3.14,NaN]),e=t,r=(Rr&&e instanceof Float64Array||"[object Float64Array]"===sr(e))&&1===t[0]&&3.14===t[1]&&-3.14===t[2]&&t[3]!=t[3]}catch(t){r=!1}return r}()?Cr:function(){throw new Error("not implemented")};var Nr=Mr;function Ur(r,t){return new Nr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}var Yr="function"==typeof Float32Array;var Wr=Number.POSITIVE_INFINITY,Zr="function"==typeof Float32Array?Float32Array:null;var $r,Gr="function"==typeof Float32Array?Float32Array:void 0;$r=function(){var r,t,e;if("function"!=typeof Zr)return!1;try{t=new Zr([1,3.14,-3.14,5e40]),e=t,r=(Yr&&e instanceof Float32Array||"[object Float32Array]"===sr(e))&&1===t[0]&&3.140000104904175===t[1]&&-3.140000104904175===t[2]&&t[3]===Wr}catch(t){r=!1}return r}()?Gr:function(){throw new Error("not implemented")};var Kr=$r;function Xr(r,t){return new Kr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,2*(r.length-t))}var zr="function"==typeof Uint8Array;var Hr="function"==typeof Uint8Array?Uint8Array:null;var Jr,Dr="function"==typeof Uint8Array?Uint8Array:void 0;Jr=function(){var r,t,e;if("function"!=typeof Hr)return!1;try{t=new Hr(t=[1,3.14,-3.14,256,257]),e=t,r=(zr&&e instanceof Uint8Array||"[object Uint8Array]"===sr(e))&&1===t[0]&&3===t[1]&&253===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?Dr:function(){throw new Error("not implemented")};var qr=Jr;var Qr=Array.isArray?Array.isArray:function(r){return"[object Array]"===sr(r)};function rt(r){if("function"!=typeof r)throw new TypeError(I("invalid argument. Must provide a function. Value: `%s`.",r));return function(t){var e,n;if(!Qr(t))return!1;if(0===(e=t.length))return!1;for(n=0;n<e;n++)if(!1===r(t[n]))return!1;return!0}}function tt(r){return null!==r&&"object"==typeof r}function et(r){return tt(r)&&(r._isBuffer||r.constructor&&"function"==typeof r.constructor.isBuffer&&r.constructor.isBuffer(r))}function nt(){return/^\s*function\s*([^(]*)/i}Y(tt,"isObjectLikeArray",rt(tt));var ot=/^\s*function\s*([^(]*)/i;function it(r){var t,e,n;if(("Object"===(e=sr(r).slice(8,-1))||"Error"===e)&&r.constructor){if("string"==typeof(n=r.constructor).name)return n.name;if(t=ot.exec(n.toString()))return t[1]}return et(r)?"Buffer":e}Y(nt,"REGEXP",ot);var at={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"},ft="function"==typeof Uint32Array;var ut=4294967295,st="function"==typeof Uint32Array?Uint32Array:null;var lt,ht="function"==typeof Uint32Array?Uint32Array:void 0;lt=function(){var r,t,e;if("function"!=typeof st)return!1;try{t=new st(t=[1,3.14,-3.14,4294967296,4294967297]),e=t,r=(ft&&e instanceof Uint32Array||"[object Uint32Array]"===sr(e))&&1===t[0]&&3===t[1]&&4294967293===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?ht:function(){throw new Error("not implemented")};var ct=lt,pt="function"==typeof Int32Array;var yt="function"==typeof Int32Array?Int32Array:null;var gt,mt="function"==typeof Int32Array?Int32Array:void 0;gt=function(){var r,t,e;if("function"!=typeof yt)return!1;try{t=new yt([1,3.14,-3.14,2147483648]),e=t,r=(pt&&e instanceof Int32Array||"[object Int32Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-2147483648===t[3]}catch(t){r=!1}return r}()?mt:function(){throw new Error("not implemented")};var vt=gt,dt="function"==typeof Uint16Array;var wt="function"==typeof Uint16Array?Uint16Array:null;var bt,Et="function"==typeof Uint16Array?Uint16Array:void 0;bt=function(){var r,t,e;if("function"!=typeof wt)return!1;try{t=new wt(t=[1,3.14,-3.14,65536,65537]),e=t,r=(dt&&e instanceof Uint16Array||"[object Uint16Array]"===sr(e))&&1===t[0]&&3===t[1]&&65533===t[2]&&0===t[3]&&1===t[4]}catch(t){r=!1}return r}()?Et:function(){throw new Error("not implemented")};var _t=bt,Tt="function"==typeof Int16Array;var xt="function"==typeof Int16Array?Int16Array:null;var Vt,At="function"==typeof Int16Array?Int16Array:void 0;Vt=function(){var r,t,e;if("function"!=typeof xt)return!1;try{t=new xt([1,3.14,-3.14,32768]),e=t,r=(Tt&&e instanceof Int16Array||"[object Int16Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-32768===t[3]}catch(t){r=!1}return r}()?At:function(){throw new Error("not implemented")};var jt=Vt,St="function"==typeof Uint8ClampedArray;var Ft="function"==typeof Uint8ClampedArray?Uint8ClampedArray:null;var Lt,Ot="function"==typeof Uint8ClampedArray?Uint8ClampedArray:void 0;Lt=function(){var r,t,e;if("function"!=typeof Ft)return!1;try{t=new Ft([-1,0,1,3.14,4.99,255,256]),e=t,r=(St&&e instanceof Uint8ClampedArray||"[object Uint8ClampedArray]"===sr(e))&&0===t[0]&&0===t[1]&&1===t[2]&&3===t[3]&&5===t[4]&&255===t[5]&&255===t[6]}catch(t){r=!1}return r}()?Ot:function(){throw new Error("not implemented")};var It=Lt,kt="function"==typeof Int8Array;var Bt="function"==typeof Int8Array?Int8Array:null;var Rt,Pt="function"==typeof Int8Array?Int8Array:void 0;Rt=function(){var r,t,e;if("function"!=typeof Bt)return!1;try{t=new Bt([1,3.14,-3.14,128]),e=t,r=(kt&&e instanceof Int8Array||"[object Int8Array]"===sr(e))&&1===t[0]&&3===t[1]&&-3===t[2]&&-128===t[3]}catch(t){r=!1}return r}()?Pt:function(){throw new Error("not implemented")};var Mt=Rt,Ct=wr.NEGATIVE_INFINITY,Nt=Math.floor;function Ut(r){return Nt(r)===r}function Yt(r){return r<Wr&&r>Ct&&Ut(r)}function Wt(r){return dr(r)&&Yt(r)}function Zt(r){return _r(r)&&Yt(r.valueOf())}function $t(r){return Wt(r)||Zt(r)}function Gt(r){return Wt(r)&&r>=0}function Kt(r){return Zt(r)&&r.valueOf()>=0}function Xt(r){return Gt(r)||Kt(r)}Y($t,"isPrimitive",Wt),Y($t,"isObject",Zt),Y(Xt,"isPrimitive",Gt),Y(Xt,"isObject",Kt);var zt=4294967295;function Ht(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=zt}var Jt=9007199254740991;function Dt(r){return"object"==typeof r&&null!==r&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=Jt}var qt="function"==typeof ArrayBuffer;function Qt(r){return qt&&r instanceof ArrayBuffer||"[object ArrayBuffer]"===sr(r)}function re(r){return"object"==typeof r&&null!==r&&!Qr(r)}var te=rt(pr.isPrimitive),ee=rt(pr.isObject),ne=rt(pr);Y(ne,"primitives",te),Y(ne,"objects",ee);var oe=/./;function ie(r){return"boolean"==typeof r}var ae=Boolean,fe=Boolean.prototype.toString;var ue=nr();function se(r){return"object"==typeof r&&(r instanceof ae||(ue?function(r){try{return fe.call(r),!0}catch(r){return!1}}(r):"[object Boolean]"===sr(r)))}function le(r){return ie(r)||se(r)}Y(le,"isPrimitive",ie),Y(le,"isObject",se);var he="object"==typeof self?self:null,ce="object"==typeof window?window:null,pe="object"==typeof global?global:null,ye="object"==typeof globalThis?globalThis:null;var ge=function(r){if(arguments.length){if(!ie(r))throw new TypeError(I("invalid argument. Must provide a boolean. Value: `%s`.",r));if(r)return new Function("return this;")()}if(ye)return ye;if(he)return he;if(ce)return ce;if(pe)return pe;throw new Error("unexpected error. Unable to resolve global object.")}(),me=ge.document&&ge.document.childNodes,ve=Int8Array;var de="function"==typeof oe||"object"==typeof ve||"function"==typeof me?function(r){return it(r).toLowerCase()}:function(r){var t;return null===r?"null":"object"===(t=typeof r)?it(r).toLowerCase():t};function we(r){return"function"===de(r)}function be(r,t,e){U(r,t,{configurable:!1,enumerable:!0,writable:!1,value:e})}function Ee(r,t){if(!(this instanceof Ee))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!dr(r))throw new TypeError(I("invalid argument. Real component must be a number. Value: `%s`.",r));if(!dr(t))throw new TypeError(I("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return be(this,"re",r),be(this,"im",t),this}Y(Ee,"name","Complex128"),Y(Ee,"BYTES_PER_ELEMENT",8),Y(Ee.prototype,"BYTES_PER_ELEMENT",8),Y(Ee.prototype,"byteLength",16),Y(Ee.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),Y(Ee.prototype,"toJSON",(function(){var r={type:"Complex128"};return r.re=this.re,r.im=this.im,r}));var _e="function"==typeof Math.fround?Math.fround:null,Te=new Kr(1);var xe="function"==typeof _e?_e:function(r){return Te[0]=r,Te[0]};function Ve(r,t){if(!(this instanceof Ve))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!dr(r))throw new TypeError(I("invalid argument. Real component must be a number. Value: `%s`.",r));if(!dr(t))throw new TypeError(I("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return be(this,"re",xe(r)),be(this,"im",xe(t)),this}function Ae(r){return r instanceof Ee||r instanceof Ve||"object"==typeof r&&null!==r&&"number"==typeof r.re&&"number"==typeof r.im}function je(r){return Ut(r/2)}function Se(){return"function"==typeof fr&&"symbol"==typeof fr("foo")&&ar(fr,"iterator")&&"symbol"==typeof fr.iterator}Y(Ve,"name","Complex64"),Y(Ve,"BYTES_PER_ELEMENT",4),Y(Ve.prototype,"BYTES_PER_ELEMENT",4),Y(Ve.prototype,"byteLength",8),Y(Ve.prototype,"toString",(function(){var r=""+this.re;return this.im<0?r+=" - "+-this.im:r+=" + "+this.im,r+="i"})),Y(Ve.prototype,"toJSON",(function(){var r={type:"Complex64"};return r.re=this.re,r.im=this.im,r}));var Fe=Se()?Symbol.iterator:null;function Le(r,t,e){U(r,t,{configurable:!1,enumerable:!1,get:e})}function Oe(r){return r.re}function Ie(r){return r.im}function ke(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Ht(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!Ae(n))return new TypeError(I("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Oe(n),Ie(n))}return t}var Be=2*Kr.BYTES_PER_ELEMENT,Re=Se();function Pe(r){return r instanceof Ne||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Me(r){return r===Ne||"Complex128Array"===r.name}function Ce(r,t){return new Ve(r[t*=2],r[t+1])}function Ne(){var r,t,e,n;if(t=arguments.length,!(this instanceof Ne))return 0===t?new Ne:1===t?new Ne(arguments[0]):2===t?new Ne(arguments[0],arguments[1]):new Ne(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Kr(0);else if(1===t)if(Gt(arguments[0]))e=new Kr(2*arguments[0]);else if(Dt(arguments[0]))if((n=(e=arguments[0]).length)&&Qr(e)&&Ae(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;o<e;o++){if(!Ae(n=t[o]))return null;r[i]=Oe(n),r[i+1]=Ie(n),i+=2}return r}(new Kr(2*n),e),null===e){if(!je(n))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Kr(arguments[0])}}else{if(Br(e))e=Xr(e,0);else if(Ir(e))e=Ur(e,0);else if(!je(n))throw new RangeError(I("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Kr(e)}else if(Qt(arguments[0])){if(!Ut((e=arguments[0]).byteLength/Be))throw new RangeError(I("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",Be,e.byteLength));e=new Kr(e)}else{if(!re(arguments[0]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(e=arguments[0],!1===Re)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",e));if(!we(e[Fe]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if(!we((e=e[Fe]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if((e=ke(e))instanceof Error)throw e;e=new Kr(e)}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!Ut(r/Be))throw new RangeError(I("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",Be,r));if(2===t){if(!Ut((n=e.byteLength-r)/Be))throw new RangeError(I("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",Be,n));e=new Kr(e,r)}else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*Be>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Be));e=new Kr(e,r,2*n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length/2),this}function Ue(r){return r.re}function Ye(r){return r.im}function We(r){var t,e,n;for(t=[];!(e=r.next()).done;)if(Ht(n=e.value)&&n.length>=2)t.push(n[0],n[1]);else{if(!Ae(n))return new TypeError(I("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));t.push(Ue(n),Ye(n))}return t}Y(Ne,"BYTES_PER_ELEMENT",Be),Y(Ne,"name","Complex64Array"),Y(Ne,"from",(function(r){var t,e,n,o,i,a,f,u,s,l,h,c;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Me(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!we(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Pe(r)){if(u=r.length,n){for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ae(l=n.call(t,r.get(h),h)))i[c]=Oe(l),i[c+1]=Ie(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),h=0;h<u;h++)if(!Ae(f(r,h))){s=!0;break}if(s){if(!je(u))throw new RangeError(I("invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.",2,u));for(i=(o=new this(u/2))._buffer,h=0;h<u;h++)i[h]=n.call(t,f(r,h),h);return o}for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ae(l=n.call(t,f(r,h),h)))i[c]=Oe(l),i[c+1]=Ie(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(re(r)&&Re&&we(r[Fe])){if(!we((i=r[Fe]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Ht(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!Ae(i))return new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Oe(i),Ie(i))}return n}(i,n,t):ke(i),a instanceof Error)throw a;for(i=(o=new this(u=a.length/2))._buffer,h=0;h<u;h++)i[h]=a[h];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(Ne,"of",(function(){var r,t;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Me(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(Ne.prototype,"at",(function(r){if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(r<0&&(r+=this._length),!(r<0||r>=this._length))return Ce(this._buffer,r)})),Le(Ne.prototype,"buffer",(function(){return this._buffer.buffer})),Le(Ne.prototype,"byteLength",(function(){return this._buffer.byteLength})),Le(Ne.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(Ne.prototype,"BYTES_PER_ELEMENT",Ne.BYTES_PER_ELEMENT),Y(Ne.prototype,"copyWithin",(function(r,t){if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),Y(Ne.prototype,"entries",(function(){var r,t,e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,n=this._buffer,e=this._length,i=-1,Y(t={},"next",(function(){if(i+=1,o||i>=e)return{done:!0};return{value:[i,Ce(n,i)],done:!1}})),Y(t,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(t,Fe,(function(){return r.entries()})),t})),Y(Ne.prototype,"every",(function(r,t){var e,n;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,Ce(e,n),n,this))return!1;return!0})),Y(Ne.prototype,"fill",(function(r,t,e){var n,o,i,a,f,u;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Ut(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Oe(r),f=Ie(r),u=t;u<e;u++)n[i=2*u]=a,n[i+1]=f;return this})),Y(Ne.prototype,"filter",(function(r,t){var e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=Ce(e,o),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(Ne.prototype,"find",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Ce(e,n),r.call(t,o,n,this))return o})),Y(Ne.prototype,"findIndex",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Ce(e,n),r.call(t,o,n,this))return n;return-1})),Y(Ne.prototype,"findLast",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Ce(e,n),r.call(t,o,n,this))return o})),Y(Ne.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Ce(e,n),r.call(t,o,n,this))return n;return-1})),Y(Ne.prototype,"forEach",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)o=Ce(e,n),r.call(t,o,n,this)})),Y(Ne.prototype,"get",(function(r){if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return Ce(this._buffer,r)})),Y(Ne.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Oe(r),i=Ie(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return!0;return!1})),Y(Ne.prototype,"indexOf",(function(r,t){var e,n,o,i,a;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Oe(r),i=Ie(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(Ne.prototype,"join",(function(r){var t,e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=",";else{if(!tr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));n=r}for(t=[],e=this._buffer,o=0;o<this._length;o++)t.push(Ce(e,o).toString());return t.join(n)})),Y(Ne.prototype,"keys",(function(){var r,t,e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){if(o+=1,n||o>=e)return{done:!0};return{value:o,done:!1}})),Y(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(t,Fe,(function(){return r.keys()})),t})),Y(Ne.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Oe(r),i=Ie(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Le(Ne.prototype,"length",(function(){return this._length})),Y(Ne.prototype,"map",(function(r,t){var e,n,o,i,a;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)if(Ae(a=r.call(t,Ce(n,i),i,this)))e[2*i]=Oe(a),e[2*i+1]=Ie(a);else{if(!Ht(a)||2!==a.length)throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",a));e[2*i]=a[0],e[2*i+1]=a[1]}return o})),Y(Ne.prototype,"reduce",(function(r,t){var e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ce(e,0),i=1}for(;i<o;i++)n=r(n,Ce(e,i),i,this);return n})),Y(Ne.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Ce(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Ce(e,i),i,this);return n})),Y(Ne.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[2*o],r[2*o]=r[2*i],r[2*i]=t,t=r[2*o+1],r[2*o+1]=r[2*i+1],r[2*i+1]=t;return this})),Y(Ne.prototype,"set",(function(r){var t,e,n,o,i,a,f,u,s;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Ae(r)){if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Oe(r),void(n[e+1]=Ie(r))}if(Pe(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,s=n.byteOffset+e*Be,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Kr(t.length),u=0;u<t.length;u++)o[u]=t[u];t=o}for(e*=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2}else{if(!Dt(r))throw new TypeError(I("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",r));for(a=r.length,u=0;u<a;u++)if(!Ae(r[u])){i=!0;break}if(i){if(!je(a))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));if(e+a/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,s=n.byteOffset+e*Be,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Kr(a),u=0;u<a;u++)o[u]=t[u];t=o}for(e*=2,a/=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2;return}if(e+a>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,u=0;u<a;u++)f=r[u],n[e]=Oe(f),n[e+1]=Ie(f),e+=2}})),Y(Ne.prototype,"slice",(function(r,t){var e,n,o,i,a,f,u;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,f=this._length,0===arguments.length)r=0,t=f;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=f)<0&&(r=0),1===arguments.length)t=f;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=f)<0&&(t=0):t>f&&(t=f)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,u=0;u<e;u++)i=2*(u+r),n[2*u]=a[i],n[2*u+1]=a[i+1];return o})),Y(Ne.prototype,"some",(function(r,t){var e,n;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,Ce(e,n),n,this))return!0;return!1})),Y(Ne.prototype,"sort",(function(r){var t,e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Ce(e,o));for(t.sort(r),o=0;o<n;o++)e[i=2*o]=Oe(t[o]),e[i+1]=Ie(t[o]);return this})),Y(Ne.prototype,"subarray",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Be):(o=t-r,e=n.byteOffset+r*Be),new this.constructor(n.buffer,e,o<0?0:o)})),Y(Ne.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!tr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(Ce(i,a).toLocaleString(n,e));return o.join(",")})),Y(Ne.prototype,"toReversed",(function(){var r,t,e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)i=e-o-1,r[2*o]=n[2*i],r[2*o+1]=n[2*i+1];return t})),Y(Ne.prototype,"toSorted",(function(r){var t,e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Ce(e,o));return t.sort(r),new Ne(t)})),Y(Ne.prototype,"toString",(function(){var r,t,e;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)r.push(Ce(t,e).toString());return r.join(",")})),Y(Ne.prototype,"values",(function(){var r,t,e,n,o,i;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){if(i+=1,n||i>=e)return{done:!0};return{value:Ce(o,i),done:!1}})),Y(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(r,Fe,(function(){return t.values()})),r})),Y(Ne.prototype,"with",(function(r,t){var e,n,o;if(!Pe(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Ae(t))throw new TypeError(I("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Oe(t),e[2*r+1]=Ie(t),n}));var Ze=2*Nr.BYTES_PER_ELEMENT,$e=Se();function Ge(r){return r instanceof ze||"object"==typeof r&&null!==r&&("Complex64Array"===r.constructor.name||"Complex128Array"===r.constructor.name)&&"number"==typeof r._length&&"object"==typeof r._buffer}function Ke(r){return r===ze||"Complex64Array"===r.name}function Xe(r,t){return new Ee(r[t*=2],r[t+1])}function ze(){var r,t,e,n;if(t=arguments.length,!(this instanceof ze))return 0===t?new ze:1===t?new ze(arguments[0]):2===t?new ze(arguments[0],arguments[1]):new ze(arguments[0],arguments[1],arguments[2]);if(0===t)e=new Nr(0);else if(1===t)if(Gt(arguments[0]))e=new Nr(2*arguments[0]);else if(Dt(arguments[0]))if((n=(e=arguments[0]).length)&&Qr(e)&&Ae(e[0])){if(e=function(r,t){var e,n,o,i;for(e=t.length,i=0,o=0;o<e;o++){if(!Ae(n=t[o]))return null;r[i]=Ue(n),r[i+1]=Ye(n),i+=2}return r}(new Nr(2*n),e),null===e){if(!je(n))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Nr(arguments[0])}}else{if(Br(e))e=Xr(e,0);else if(Ir(e))e=Ur(e,0);else if(!je(n))throw new RangeError(I("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",n));e=new Nr(e)}else if(Qt(arguments[0])){if(!Ut((e=arguments[0]).byteLength/Ze))throw new RangeError(I("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",Ze,e.byteLength));e=new Nr(e)}else{if(!re(arguments[0]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(e=arguments[0],!1===$e)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",e));if(!we(e[Fe]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if(!we((e=e[Fe]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",e));if((e=We(e))instanceof Error)throw e;e=new Nr(e)}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!Ut(r/Ze))throw new RangeError(I("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",Ze,r));if(2===t){if(!Ut((n=e.byteLength-r)/Ze))throw new RangeError(I("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",Ze,n));e=new Nr(e,r)}else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*Ze>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Ze));e=new Nr(e,r,2*n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length/2),this}function He(r){var t,e;for(t=[];!(e=r.next()).done;)t.push(ae(e.value));return t}Y(ze,"BYTES_PER_ELEMENT",Ze),Y(ze,"name","Complex128Array"),Y(ze,"from",(function(r){var t,e,n,o,i,a,f,u,s,l,h,c;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((e=arguments.length)>1){if(!we(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Ge(r)){if(u=r.length,n){for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ae(l=n.call(t,r.get(h),h)))i[c]=Ue(l),i[c+1]=Ye(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),h=0;h<u;h++)if(!Ae(f(r,h))){s=!0;break}if(s){if(!je(u))throw new RangeError(I("invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.",u));for(i=(o=new this(u/2))._buffer,h=0;h<u;h++)i[h]=n.call(t,f(r,h),h);return o}for(i=(o=new this(u))._buffer,c=0,h=0;h<u;h++){if(Ae(l=n.call(t,f(r,h),h)))i[c]=Ue(l),i[c+1]=Ye(l);else{if(!(Ht(l)&&l.length>=2))throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",l));i[c]=l[0],i[c+1]=l[1]}c+=2}return o}return new this(r)}if(re(r)&&$e&&we(r[Fe])){if(!we((i=r[Fe]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));if(a=n?function(r,t,e){var n,o,i,a;for(n=[],a=-1;!(o=r.next()).done;)if(a+=1,Ht(i=t.call(e,o.value,a))&&i.length>=2)n.push(i[0],i[1]);else{if(!Ae(i))return new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));n.push(Ue(i),Ye(i))}return n}(i,n,t):We(i),a instanceof Error)throw a;for(i=(o=new this(u=a.length/2))._buffer,h=0;h<u;h++)i[h]=a[h];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(ze,"of",(function(){var r,t;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Ke(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(ze.prototype,"at",(function(r){if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(r<0&&(r+=this._length),!(r<0||r>=this._length))return Xe(this._buffer,r)})),Le(ze.prototype,"buffer",(function(){return this._buffer.buffer})),Le(ze.prototype,"byteLength",(function(){return this._buffer.byteLength})),Le(ze.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(ze.prototype,"BYTES_PER_ELEMENT",ze.BYTES_PER_ELEMENT),Y(ze.prototype,"copyWithin",(function(r,t){if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*r,2*t):this._buffer.copyWithin(2*r,2*t,2*arguments[2]),this})),Y(ze.prototype,"entries",(function(){var r,t,e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,r=this._buffer,n=this._length,i=-1,a=-2,Y(e={},"next",(function(){var t;if(i+=1,o||i>=n)return{done:!0};return t=new Ee(r[a+=2],r[a+1]),{value:[i,t],done:!1}})),Y(e,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(e,Fe,(function(){return t.entries()})),e})),Y(ze.prototype,"every",(function(r,t){var e,n;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,Xe(e,n),n,this))return!1;return!0})),Y(ze.prototype,"fill",(function(r,t,e){var n,o,i,a,f,u;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Ut(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(a=Ue(r),f=Ye(r),u=t;u<e;u++)n[i=2*u]=a,n[i+1]=f;return this})),Y(ze.prototype,"filter",(function(r,t){var e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=Xe(e,o),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(ze.prototype,"find",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Xe(e,n),r.call(t,o,n,this))return o})),Y(ze.prototype,"findIndex",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(o=Xe(e,n),r.call(t,o,n,this))return n;return-1})),Y(ze.prototype,"findLast",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Xe(e,n),r.call(t,o,n,this))return o})),Y(ze.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length-1;n>=0;n--)if(o=Xe(e,n),r.call(t,o,n,this))return n;return-1})),Y(ze.prototype,"forEach",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)o=Xe(e,n),r.call(t,o,n,this)})),Y(ze.prototype,"get",(function(r){if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return Xe(this._buffer,r)})),Le(ze.prototype,"length",(function(){return this._length})),Y(ze.prototype,"includes",(function(r,t){var e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ue(r),i=Ye(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return!0;return!1})),Y(ze.prototype,"indexOf",(function(r,t){var e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(o=Ue(r),i=Ye(r),e=this._buffer,a=t;a<this._length;a++)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(ze.prototype,"join",(function(r){var t,e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=",";else{if(!pr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r));n=r}for(t=[],e=this._buffer,o=0;o<this._length;o++)t.push(Xe(e,o).toString());return t.join(n)})),Y(ze.prototype,"keys",(function(){var r,t,e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){if(o+=1,n||o>=e)return{done:!0};return{value:o,done:!1}})),Y(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(t,Fe,(function(){return r.keys()})),t})),Y(ze.prototype,"lastIndexOf",(function(r,t){var e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ae(r))throw new TypeError(I("invalid argument. First argument must be a complex number. Value: `%s`.",r));if(arguments.length>1){if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(o=Ue(r),i=Ye(r),e=this._buffer,a=t;a>=0;a--)if(o===e[n=2*a]&&i===e[n+1])return a;return-1})),Y(ze.prototype,"map",(function(r,t){var e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(n=this._buffer,e=(o=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)if(Ae(a=r.call(t,Xe(n,i),i,this)))e[2*i]=Ue(a),e[2*i+1]=Ye(a);else{if(!Ht(a)||2!==a.length)throw new TypeError(I("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",a));e[2*i]=a[0],e[2*i+1]=a[1]}return o})),Y(ze.prototype,"reduce",(function(r,t){var e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=0;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Xe(e,0),i=1}for(;i<o;i++)n=r(n,Xe(e,i),i,this);return n})),Y(ze.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,o=this._length,arguments.length>1)n=t,i=o-1;else{if(0===o)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");n=Xe(e,o-1),i=o-2}for(;i>=0;i--)n=r(n,Xe(e,i),i,this);return n})),Y(ze.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,r=this._buffer,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[2*o],r[2*o]=r[2*i],r[2*i]=t,t=r[2*o+1],r[2*o+1]=r[2*i+1],r[2*i+1]=t;return this})),Y(ze.prototype,"set",(function(r){var t,e,n,o,i,a,f,u,s;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Ae(r)){if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));return n[e*=2]=Ue(r),void(n[e+1]=Ye(r))}if(Ge(r)){if(e+(a=r._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r._buffer,s=n.byteOffset+e*Ze,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Nr(t.length),u=0;u<t.length;u++)o[u]=t[u];t=o}for(e*=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2}else{if(!Dt(r))throw new TypeError(I("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",r));for(a=r.length,u=0;u<a;u++)if(!Ae(r[u])){i=!0;break}if(i){if(!je(a))throw new RangeError(I("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));if(e+a/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=r,s=n.byteOffset+e*Ze,t.buffer===n.buffer&&t.byteOffset<s&&t.byteOffset+t.byteLength>s){for(o=new Nr(a),u=0;u<a;u++)o[u]=t[u];t=o}for(e*=2,a/=2,s=0,u=0;u<a;u++)n[e]=t[s],n[e+1]=t[s+1],e+=2,s+=2;return}if(e+a>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(e*=2,u=0;u<a;u++)f=r[u],n[e]=Ue(f),n[e+1]=Ye(f),e+=2}})),Y(ze.prototype,"slice",(function(r,t){var e,n,o,i,a,f,u;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,f=this._length,0===arguments.length)r=0,t=f;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=f)<0&&(r=0),1===arguments.length)t=f;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=f)<0&&(t=0):t>f&&(t=f)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,u=0;u<e;u++)i=2*(u+r),n[2*u]=a[i],n[2*u+1]=a[i+1];return o})),Y(ze.prototype,"some",(function(r,t){var e,n;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,Xe(e,n),n,this))return!0;return!1})),Y(ze.prototype,"sort",(function(r){var t,e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Xe(e,o));for(t.sort(r),o=0;o<n;o++)e[i=2*o]=Ue(t[o]),e[i+1]=Ye(t[o]);return this})),Y(ze.prototype,"subarray",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Ut(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Ze):(o=t-r,e=n.byteOffset+r*Ze),new this.constructor(n.buffer,e,o<0?0:o)})),Y(ze.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(0===arguments.length)n=[];else{if(!pr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(Xe(i,a).toLocaleString(n,e));return o.join(",")})),Y(ze.prototype,"toReversed",(function(){var r,t,e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)i=e-o-1,r[2*o]=n[2*i],r[2*o+1]=n[2*i+1];return t})),Y(ze.prototype,"toSorted",(function(r){var t,e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=this._length,t=[],o=0;o<n;o++)t.push(Xe(e,o));return t.sort(r),new ze(t)})),Y(ze.prototype,"toString",(function(){var r,t,e;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)r.push(Xe(t,e).toString());return r.join(",")})),Y(ze.prototype,"values",(function(){var r,t,e,n,o,i;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){if(i+=1,n||i>=e)return{done:!0};return{value:Xe(o,i),done:!1}})),Y(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(r,Fe,(function(){return t.values()})),r})),Y(ze.prototype,"with",(function(r,t){var e,n,o;if(!Ge(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!Ut(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(o=this._length,r<0&&(r+=o),r<0||r>=o)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!Ae(t))throw new TypeError(I("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(e=(n=new this.constructor(this._buffer))._buffer)[2*r]=Ue(t),e[2*r+1]=Ye(t),n}));var Je=qr.BYTES_PER_ELEMENT,De=Se();function qe(r){return"object"==typeof r&&null!==r&&"BooleanArray"===r.constructor.name&&r.BYTES_PER_ELEMENT===Je}function Qe(r){return r===rn}function rn(){var r,t,e,n,o;if(t=arguments.length,!(this instanceof rn))return 0===t?new rn:1===t?new rn(arguments[0]):2===t?new rn(arguments[0],arguments[1]):new rn(arguments[0],arguments[1],arguments[2]);if(0===t)e=new qr(0);else if(1===t)if(Gt(o=arguments[0]))e=new qr(o);else if(Dt(o))e=function(r,t){var e,n;for(e=t.length,n=0;n<e;n++)r[n]=ae(t[n]);return r}(new qr(o.length),o);else if(Qt(o))e=new qr(o);else{if(!re(o))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));if(!1===De)throw new TypeError(I("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",o));if(!we(o[Fe]))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));if(!we((e=o[Fe]()).next))throw new TypeError(I("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",o));e=new qr(He(e))}else{if(!Qt(e=arguments[0]))throw new TypeError(I("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",e));if(!Gt(r=arguments[1]))throw new TypeError(I("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(2===t)e=new qr(e,r);else{if(!Gt(n=arguments[2]))throw new TypeError(I("invalid argument. Length must be a nonnegative integer. Value: `%s`.",n));if(n*Je>e.byteLength-r)throw new RangeError(I("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",n*Je));e=new qr(e,r,n)}}return Y(this,"_buffer",e),Y(this,"_length",e.length),this}Y(rn,"BYTES_PER_ELEMENT",Je),Y(rn,"name","BooleanArray"),Y(rn,"from",(function(r){var t,e,n,o,i,a,f,u,s;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if((e=arguments.length)>1){if(!we(n=arguments[1]))throw new TypeError(I("invalid argument. Second argument must be a function. Value: `%s`.",n));e>2&&(t=arguments[2])}if(Dt(r)){if(n){for(u=r.length,f=r.get&&r.set?K("default"):J("default"),i=(o=new this(u))._buffer,s=0;s<u;s++)i[s]=ae(n.call(t,f(r,s),s));return o}return new this(r)}if(re(r)&&De&&we(r[Fe])){if(!we((i=r[Fe]()).next))throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r));for(a=n?function(r,t,e){var n,o,i;for(n=[],i=-1;!(o=r.next()).done;)i+=1,n.push(ae(t.call(e,o.value,i)));return n}(i,n,t):He(i),i=(o=new this(u=a.length))._buffer,s=0;s<u;s++)i[s]=a[s];return o}throw new TypeError(I("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",r))})),Y(rn,"of",(function(){var r,t;if(!we(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=[],t=0;t<arguments.length;t++)r.push(arguments[t]);return new this(r)})),Y(rn.prototype,"at",(function(r){var t,e;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Wt(r))throw new TypeError(I("invalid argument. Must provide an integer. Value: `%s`.",r));if(e=this._length,t=this._buffer,r<0&&(r+=e),!(r<0||r>=e))return ae(t[r])})),Le(rn.prototype,"buffer",(function(){return this._buffer.buffer})),Le(rn.prototype,"byteLength",(function(){return this._buffer.byteLength})),Le(rn.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),Y(rn.prototype,"BYTES_PER_ELEMENT",rn.BYTES_PER_ELEMENT),Y(rn.prototype,"copyWithin",(function(r,t){if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return 2===arguments.length?this._buffer.copyWithin(r,t):this._buffer.copyWithin(r,t,arguments[2]),this})),Y(rn.prototype,"entries",(function(){var r,t,e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,n=this._buffer,e=this._length,i=-1,Y(t={},"next",(function(){if(i+=1,o||i>=e)return{done:!0};return{value:[i,ae(n[i])],done:!1}})),Y(t,"return",(function(r){if(o=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(t,Fe,(function(){return r.entries()})),t})),Y(rn.prototype,"every",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(!r.call(t,ae(e[n]),n,this))return!1;return!0})),Y(rn.prototype,"fill",(function(r,t,e){var n,o,i,a;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(n=this._buffer,o=this._length,arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=o)<0&&(t=0),arguments.length>2){if(!Wt(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));e<0&&(e+=o)<0&&(e=0),e>o&&(e=o)}else e=o}else t=0,e=o;for(i=r?1:0,a=t;a<e;a++)n[a]=i;return this})),Y(rn.prototype,"filter",(function(r,t){var e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=[],o=0;o<this._length;o++)i=ae(e[o]),r.call(t,i,o,this)&&n.push(i);return new this.constructor(n)})),Y(rn.prototype,"find",(function(r,t){var e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=0;o<this._length;o++)if(n=ae(e[o]),r.call(t,n,o,this))return n})),Y(rn.prototype,"findIndex",(function(r,t){var e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=0;o<this._length;o++)if(n=ae(e[o]),r.call(t,n,o,this))return o;return-1})),Y(rn.prototype,"findLast",(function(r,t){var e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=ae(e[o]),r.call(t,n,o,this))return n})),Y(rn.prototype,"findLastIndex",(function(r,t){var e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,o=this._length-1;o>=0;o--)if(n=ae(e[o]),r.call(t,n,o,this))return o;return-1})),Y(rn.prototype,"forEach",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)r.call(t,ae(e[n]),n,this)})),Y(rn.prototype,"get",(function(r){if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Gt(r))throw new TypeError(I("invalid argument. Must provide a nonnegative integer. Value: `%s`.",r));if(!(r>=this._length))return ae(this._buffer[r])})),Y(rn.prototype,"includes",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n<this._length;n++)if(r===ae(e[n]))return!0;return!1})),Y(rn.prototype,"indexOf",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(e=this._buffer,n=t;n<this._length;n++)if(r===ae(e[n]))return n;return-1})),Y(rn.prototype,"join",(function(r){var t,e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(arguments.length>0){if(!tr(r))throw new TypeError(I("invalid argument. First argument must be a string. Value: `%s`.",r))}else r=",";for(t=this._buffer,e=[],n=0;n<this._length;n++)t[n]?e.push("true"):e.push("false");return e.join(r)})),Y(rn.prototype,"keys",(function(){var r,t,e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return r=this,e=this._length,o=-1,Y(t={},"next",(function(){if(o+=1,n||o>=e)return{done:!0};return{value:o,done:!1}})),Y(t,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(t,Fe,(function(){return r.keys()})),t})),Y(rn.prototype,"lastIndexOf",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!ie(r))throw new TypeError(I("invalid argument. First argument must be a boolean. Value: `%s`.",r));if(arguments.length>1){if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(e=this._buffer,n=t;n>=0;n--)if(r===ae(e[n]))return n;return-1})),Le(rn.prototype,"length",(function(){return this._length})),Y(rn.prototype,"map",(function(r,t){var e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError("invalid argument. First argument must be a function. Value: `%s`.",r);for(o=this._buffer,e=(n=new this.constructor(this._length))._buffer,i=0;i<this._length;i++)e[i]=ae(r.call(t,ae(o[i]),i,this));return n})),Y(rn.prototype,"reduce",(function(r,t){var e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,n=this._length,arguments.length>1)o=t,i=0;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=ae(e[0]),i=1}for(;i<n;i++)o=r(o,ae(e[i]),i,this);return o})),Y(rn.prototype,"reduceRight",(function(r,t){var e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));if(e=this._buffer,n=this._length,arguments.length>1)o=t,i=n-1;else{if(0===n)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");o=ae(e[n-1]),i=n-2}for(;i>=0;i--)o=r(o,ae(e[i]),i,this);return o})),Y(rn.prototype,"reverse",(function(){var r,t,e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=this._buffer,e=this._length,n=Nt(e/2),o=0;o<n;o++)i=e-o-1,t=r[o],r[o]=r[i],r[i]=t;return this})),Y(rn.prototype,"set",(function(r){var t,e,n,o,i,a,f;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(n=this._buffer,arguments.length>1){if(!Gt(e=arguments[1]))throw new TypeError(I("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",e))}else e=0;if(Dt(r)){if(e+(i=r.length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=qe(r)?r._buffer:r,f=n.byteOffset+e*Je,t.buffer===n.buffer&&t.byteOffset<f&&t.byteOffset+t.byteLength>f){for(o=new qr(t.length),a=0;a<t.length;a++)o[a]=t[a];t=o}for(a=0;a<i;e++,a++)n[e]=t[a]?1:0}else{if(e>=this._length)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%u`.",e));n[e]=r?1:0}})),Y(rn.prototype,"slice",(function(r,t){var e,n,o,i,a,f;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(i=this._buffer,a=this._length,0===arguments.length)r=0,t=a;else{if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=a)<0&&(r=0),1===arguments.length)t=a;else{if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=a)<0&&(t=0):t>a&&(t=a)}}for(e=r<t?t-r:0,n=(o=new this.constructor(e))._buffer,f=0;f<e;f++)n[f]=i[f+r];return o})),Y(rn.prototype,"some",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));for(e=this._buffer,n=0;n<this._length;n++)if(r.call(t,ae(e[n]),n,this))return!0;return!1})),Y(rn.prototype,"sort",(function(r){var t;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(t=this._buffer,0===arguments.length)return t.sort(),this;if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));return t.sort((function(t,e){return r(ae(t),ae(e))})),this})),Y(rn.prototype,"subarray",(function(r,t){var e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(n=this._buffer,o=this._length,0===arguments.length)r=0,t=o;else{if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(r<0&&(r+=o)<0&&(r=0),1===arguments.length)t=o;else{if(!Wt(t))throw new TypeError(I("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=o)<0&&(t=0):t>o&&(t=o)}}return r>=o?(o=0,e=n.byteLength):r>=t?(o=0,e=n.byteOffset+r*Je):(o=t-r,e=n.byteOffset+r*Je),new this.constructor(n.buffer,e,o<0?0:o)})),Y(rn.prototype,"toLocaleString",(function(r,t){var e,n,o,i,a;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(0===arguments.length)n=[];else{if(!tr(r)&&!te(r))throw new TypeError(I("invalid argument. First argument must be a string or an array of strings. Value: `%s`.",r));n=r}if(arguments.length<2)e={};else{if(!re(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));e=t}for(i=this._buffer,o=[],a=0;a<this._length;a++)o.push(ae(i[a]).toLocaleString(n,e));return o.join(",")})),Y(rn.prototype,"toReversed",(function(){var r,t,e,n,o;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(e=this._length,t=new this.constructor(e),n=this._buffer,r=t._buffer,o=0;o<e;o++)r[o]=n[e-o-1];return t})),Y(rn.prototype,"toSorted",(function(r){var t,e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(n=this._length,e=new this.constructor(n),o=this._buffer,t=e._buffer,i=0;i<n;i++)t[i]=o[i];if(0===arguments.length)return t.sort(),e;if(!we(r))throw new TypeError(I("invalid argument. First argument must be a function. Value: `%s`.",r));return t.sort((function(t,e){return r(ae(t),ae(e))})),e})),Y(rn.prototype,"toString",(function(){var r,t,e;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");for(r=[],t=this._buffer,e=0;e<this._length;e++)t[e]?r.push("true"):r.push("false");return r.join(",")})),Y(rn.prototype,"values",(function(){var r,t,e,n,o,i;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");return t=this,o=this._buffer,e=this._length,i=-1,Y(r={},"next",(function(){if(i+=1,n||i>=e)return{done:!0};return{value:ae(o[i]),done:!1}})),Y(r,"return",(function(r){if(n=!0,arguments.length)return{value:r,done:!0};return{done:!0}})),Fe&&Y(r,Fe,(function(){return t.values()})),r})),Y(rn.prototype,"with",(function(r,t){var e,n;if(!qe(this))throw new TypeError("invalid invocation. `this` is not a boolean array.");if(!Wt(r))throw new TypeError(I("invalid argument. First argument must be an integer. Value: `%s`.",r));if(n=this._length,r<0&&(r+=n),r<0||r>=n)throw new RangeError(I("invalid argument. Index argument is out-of-bounds. Value: `%s`.",r));if(!ie(t))throw new TypeError(I("invalid argument. Second argument must be a boolean. Value: `%s`.",t));return(e=new this.constructor(this._buffer))._buffer[r]=t?1:0,e}));var tn=[Nr,Kr,vt,ct,jt,_t,Mt,qr,It,Ne,ze,rn],en=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128","bool"],nn=en.length;function on(r){var t=function(r){var t;if(Qr(r))return"generic";if(et(r))return null;for(t=0;t<nn;t++)if(r instanceof tn[t])return en[t];return at[it(r)]||null}(r);return $(r)?{data:r,dtype:t,accessorProtocol:!0,accessors:[K(t),z(t)]}:{data:r,dtype:t,accessorProtocol:!1,accessors:[J(t),q(t)]}}var an=5;var fn=5;function un(r,t,e,n,o){var i,a,f,u;if(r<=0||1===t)return e;if((f=on(e)).accessorProtocol)return function(r,t,e,n,o){var i,a,f,u,s,l;if(i=e.data,a=e.accessors[0],f=e.accessors[1],u=o,0===n)return f(i,u,a(i,u)*r*t),e;if(1===n){if((s=r%an)>0)for(l=0;l<s;l++)f(i,u,a(i,u)*t),u+=n;if(r<an)return e;for(l=s;l<r;l+=an)f(i,u,a(i,u)*t),f(i,u+1,a(i,u+1)*t),f(i,u+2,a(i,u+2)*t),f(i,u+3,a(i,u+3)*t),f(i,u+4,a(i,u+4)*t),u+=an;return e}for(l=0;l<r;l++)f(i,u,a(i,u)*t),u+=n}(r,t,f,n,o),e;if(i=o,0===n)return e[i]*=t*r,e;if(1===n){if((a=r%fn)>0)for(u=0;u<a;u++)e[i]*=t,i+=n;if(r<fn)return e;for(u=a;u<r;u+=fn)e[i]*=t,e[i+1]*=t,e[i+2]*=t,e[i+3]*=t,e[i+4]*=t,i+=fn;return e}for(u=0;u<r;u++)e[i]*=t,i+=n;return e}function sn(r,t,e,n){return un(r,t,e,n,function(r,t){return t>0?0:(1-r)*t}(r,n))}function ln(r){var t,e;if(t=[],r<=0)return t;for(e=0;e<r;e++)t.push(e);return t}function hn(r,t,e,n){var o,i,a;for(i=2*e,a=2*n,o=0;a>=0&&a<t.length;)t[a]=o,t[a+1]=0,a+=i,o+=1;return r}function cn(r,t){var e;return e=ln(r.length),function(r,t){var e,n,o,i,a,f,u,s,l;for(n=1,o=1,l=1;l<r.length;l++){for(e=(f=r[n])<0?-f:f,u=t[o],i=n-1,a=o-1;i>=0&&!(((s=r[i])<0?-s:s)<=e);)r[i+1]=s,t[a+1]=t[a],i-=1,a-=1;r[i+1]=f,t[a+1]=u,n+=1,o+=1}}(t=rr(t),e),{sh:r=function(r,t){var e,n;for(e=[],n=0;n<t.length;n++)e.push(r[t[n]]);return e}(r,e),sx:t,idx:e}}function pn(r){return Wt(r)&&r>0}function yn(r){return Zt(r)&&r.valueOf()>0}function gn(r){return pn(r)||yn(r)}function mn(r){return Object.keys(Object(r))}Y(sn,"ndarray",un),Y(ln,"assign",(function(r,t,e){var n=on(r);return n.accessorProtocol?"complex128"===n.dtype?hn(r,Ur(r,0),t,e):"complex64"===n.dtype?hn(r,Xr(r,0),t,e):function(r,t,e){var n,o,i,a;for(n=r.data,o=r.accessors[1],a=e,i=0;a>=0&&a<n.length;)o(n,a,i),a+=t,i+=1;return n}(n,t,e):function(r,t,e){var n,o;for(o=e,n=0;o>=0&&o<r.length;)r[o]=n,o+=t,n+=1;return r}(r,t,e)})),Y(gn,"isPrimitive",pn),Y(gn,"isObject",yn);var vn,dn=void 0!==Object.keys;function wn(r){return"[object Arguments]"===sr(r)}vn=function(){return wn(arguments)}();var bn=vn;function En(r){return r!=r}function _n(r){return dr(r)&&En(r)}function Tn(r){return _r(r)&&En(r.valueOf())}function xn(r){return _n(r)||Tn(r)}Y(xn,"isPrimitive",_n),Y(xn,"isObject",Tn);var Vn=Object.prototype.propertyIsEnumerable;var An=!Vn.call("beep","0");function jn(r,t){var e;return null!=r&&(!(e=Vn.call(r,t))&&An&&pr(r)?!_n(t=+t)&&Wt(t)&&t>=0&&t<r.length:e)}var Sn=bn?wn:function(r){return null!==r&&"object"==typeof r&&!Qr(r)&&"number"==typeof r.length&&Ut(r.length)&&r.length>=0&&r.length<=ut&&ar(r,"callee")&&!jn(r,"callee")},Fn=Array.prototype.slice;var Ln=jn((function(){}),"prototype"),On=!jn({toString:null},"toString");function In(r,t,e){var n,o;if(!Dt(r)&&!tr(r))throw new TypeError(I("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(0===(n=r.length))return-1;if(3===arguments.length){if(!Wt(e))throw new TypeError(I("invalid argument. Third argument must be an integer. Value: `%s`.",e));if(e>=0){if(e>=n)return-1;o=e}else(o=n+e)<0&&(o=0)}else o=0;if(xn(t)){for(;o<n;o++)if(xn(r[o]))return o}else for(;o<n;o++)if(r[o]===t)return o;return-1}function kn(r){return r.constructor&&r.constructor.prototype===r}var Bn=["console","external","frame","frameElement","frames","innerHeight","innerWidth","outerHeight","outerWidth","pageXOffset","pageYOffset","parent","scrollLeft","scrollTop","scrollX","scrollY","self","webkitIndexedDB","webkitStorageInfo","window"],Rn="undefined"==typeof window?void 0:window;var Pn=function(){var r;if("undefined"===de(Rn))return!1;for(r in Rn)try{-1===In(Bn,r)&&ar(Rn,r)&&null!==Rn[r]&&"object"===de(Rn[r])&&kn(Rn[r])}catch(r){return!0}return!1}(),Mn="undefined"!=typeof window;var Cn,Nn=["toString","toLocaleString","valueOf","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","constructor"];Cn=dn?function(){return 2!==(mn(arguments)||"").length}(1,2)?function(r){return Sn(r)?mn(Fn.call(r)):mn(r)}:mn:function(r){var t,e,n,o,i,a,f;if(o=[],Sn(r)){for(f=0;f<r.length;f++)o.push(f.toString());return o}if("string"==typeof r){if(r.length>0&&!ar(r,"0"))for(f=0;f<r.length;f++)o.push(f.toString())}else{if(!1==(n="function"==typeof r)&&!tt(r))return o;e=Ln&&n}for(i in r)e&&"prototype"===i||!ar(r,i)||o.push(String(i));if(On)for(t=function(r){if(!1===Mn&&!Pn)return kn(r);try{return kn(r)}catch(r){return!1}}(r),f=0;f<Nn.length;f++)a=Nn[f],t&&"constructor"===a||!ar(r,a)||o.push(String(a));return o};var Un,Yn=Cn,Wn=Object,Zn=Object.getPrototypeOf;Un=we(Object.getPrototypeOf)?Zn:function(r){var t=function(r){return r.__proto__}(r);return t||null===t?t:"[object Function]"===sr(r.constructor)?r.constructor.prototype:r instanceof Wn?Wn.prototype:null};var $n=Un;var Gn=Object.prototype;function Kn(r){var t;return!!re(r)&&(t=function(r){return null==r?null:(r=Wn(r),$n(r))}(r),!t||!ar(r,"constructor")&&ar(t,"constructor")&&we(t.constructor)&&"[object Function]"===sr(t.constructor)&&ar(t,"isPrototypeOf")&&we(t.isPrototypeOf)&&(t===Gn||function(r){var t;for(t in r)if(!ar(r,t))return!1;return!0}(r)))}var Xn=function(r,t){var e,n,o,i,a,f,u,s=!0;if(!tt(r))throw new TypeError(I("invalid argument. First argument must be an object (except null). Value: `%s`.",r));if(arguments.length>1){if(!Kn(t))throw new TypeError(I("invalid argument. Options argument must be an object. Value: `%s`.",t));if(ar(t,"duplicates")&&!ie(s=t.duplicates))throw new TypeError(I("invalid option. `%s` option must be a boolean. Option: `%s`.","duplicates",s))}if(n=(e=Yn(r)).length,a={},s)for(u=0;u<n;u++)ar(a,i=r[o=e[u]])?(f=a[i],Qr(f)?a[i].push(o):a[i]=[f,o]):a[i]=o;else for(u=0;u<n;u++)a[r[o=e[u]]]=o;return a}({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},{duplicates:!1});var zn={binary:1,bool:1,complex64:8,complex128:16,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};function Hn(r){var t;return tr(r)?zn[r]||null:dr(r)?zn[function(r){var t=Xn[r];return tr(t)?t:null}(r)]||null:r&&pn(t=r.byteLength)?t:null}var Jn={BLOCK_SIZE_IN_BYTES:64,BLOCK_SIZE_IN_ELEMENTS:8};function Dn(r){return function(r){var t,e,n,o;if((e=r.length)<=0)return Jn.BLOCK_SIZE_IN_ELEMENTS;if(null===(t=Hn(r[0])))return Jn.BLOCK_SIZE_IN_ELEMENTS;for(o=1;o<e;o++){if(null===(n=Hn(r[o])))return Jn.BLOCK_SIZE_IN_ELEMENTS;n>t&&(t=n)}return(n=Jn.BLOCK_SIZE_IN_BYTES/t|0)>0?n:1}([r])}function qn(r,t,e,n,o,i){var a,f,u,s,l;for(a=r.length,f=1,l=0;l<a;l++)f*=r[l];if("clamp"===i)o<0?o=0:o>=f&&(o=f-1);else if("wrap"===i)o<0?(o+=f)<0&&0!==(o%=f)&&(o+=f):o>=f&&(o-=f)>=f&&(o%=f);else if("normalize"===i&&o<0&&(o+=f),o<0||o>=f)throw new RangeError(I("invalid argument. Linear index must not exceed array dimensions. Number of array elements: `%u`. Value: `%d`.",f,o));if(u=e,yr(n)){for(l=0;l<a;l++)o-=s=o%r[l],o/=r[l],u+=s*t[l];return u}for(l=a-1;l>=0;l--)o-=s=o%r[l],o/=r[l],u+=s*t[l];return u}var Qn="throw";function ro(r,t){var e,n,o,i,a,f,u,s,l;for(i=Q(f=r.shape),n=r.data,u=r.strides,s=r.offset,o=r.order,a=r.accessors[0],e=0,l=0;l<i;l++)if(a(n,qn(f,u,s,o,l,Qn))&&(e+=1)>=t)return!0;return!1}var to="throw";function eo(r,t){var e,n,o,i,a,f,u,s,l;for(i=Q(a=r.shape),n=r.data,f=r.strides,u=r.offset,o=r.order,e=0,l=0;l<i;l++)if((n[s=qn(a,f,u,o,l,to)]||n[s+1])&&(e+=1)>=t)return!0;return!1}var no="throw";function oo(r,t){var e,n,o,i,a,f,u,s;for(i=Q(a=r.shape),n=r.data,f=r.strides,u=r.offset,o=r.order,e=0,s=0;s<i;s++)if(n[qn(a,f,u,o,s,no)]&&(e+=1)>=t)return!0;return!1}var io=[function(r,t){return!!(t<=1&&r.data[r.offset])},function(r,t){var e,n,o,i,a,f;for(i=r.shape[0],o=r.strides[0],a=r.offset,n=r.data,e=0,f=0;f<i;f++){if(n[a]&&(e+=1)>=t)return!0;a+=o}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c;for(a=r.shape,1===Ar(s=r.strides)?(f=a[1],u=a[0],o=s[1],i=s[0]-f*s[1]):(f=a[0],u=a[1],o=s[0],i=s[1]-f*s[0]),l=r.offset,n=r.data,e=0,c=0;c<u;c++){for(h=0;h<f;h++){if(n[l]&&(e+=1)>=t)return!0;l+=o}l+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g;for(f=r.shape,1===Ar(h=r.strides)?(u=f[2],s=f[1],l=f[0],o=h[2],i=h[1]-u*h[2],a=h[0]-s*h[1]):(u=f[0],s=f[1],l=f[2],o=h[0],i=h[1]-u*h[0],a=h[2]-s*h[1]),c=r.offset,n=r.data,e=0,g=0;g<l;g++){for(y=0;y<s;y++){for(p=0;p<u;p++){if(n[c]&&(e+=1)>=t)return!0;c+=o}c+=i}c+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=r.shape,1===Ar(p=r.strides)?(s=u[3],l=u[2],h=u[1],c=u[0],o=p[3],i=p[2]-s*p[3],a=p[1]-l*p[2],f=p[0]-h*p[1]):(s=u[0],l=u[1],h=u[2],c=u[3],o=p[0],i=p[1]-s*p[0],a=p[2]-l*p[1],f=p[3]-h*p[2]),y=r.offset,n=r.data,e=0,d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){for(g=0;g<s;g++){if(n[y]&&(e+=1)>=t)return!0;y+=o}y+=i}y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E;for(s=r.shape,1===Ar(g=r.strides)?(l=s[4],h=s[3],c=s[2],p=s[1],y=s[0],o=g[4],i=g[3]-l*g[4],a=g[2]-h*g[3],f=g[1]-c*g[2],u=g[0]-p*g[1]):(l=s[0],h=s[1],c=s[2],p=s[3],y=s[4],o=g[0],i=g[1]-l*g[0],a=g[2]-h*g[1],f=g[3]-c*g[2],u=g[4]-p*g[3]),m=r.offset,n=r.data,e=0,E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){for(v=0;v<l;v++){if(n[m]&&(e+=1)>=t)return!0;m+=o}m+=i}m+=a}m+=f}m+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(l=r.shape,1===Ar(v=r.strides)?(h=l[5],c=l[4],p=l[3],y=l[2],g=l[1],m=l[0],o=v[5],i=v[4]-h*v[5],a=v[3]-c*v[4],f=v[2]-p*v[3],u=v[1]-y*v[2],s=v[0]-g*v[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],m=l[5],o=v[0],i=v[1]-h*v[0],a=v[2]-c*v[1],f=v[3]-p*v[2],u=v[4]-y*v[3],s=v[5]-g*v[4]),d=r.offset,n=r.data,e=0,x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){for(w=0;w<h;w++){if(n[d]&&(e+=1)>=t)return!0;d+=o}d+=i}d+=a}d+=f}d+=u}d+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j;for(h=r.shape,1===Ar(w=r.strides)?(c=h[6],p=h[5],y=h[4],g=h[3],m=h[2],v=h[1],d=h[0],o=w[6],i=w[5]-c*w[6],a=w[4]-p*w[5],f=w[3]-y*w[4],u=w[2]-g*w[3],s=w[1]-m*w[2],l=w[0]-v*w[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],d=h[6],o=w[0],i=w[1]-c*w[0],a=w[2]-p*w[1],f=w[3]-y*w[2],u=w[4]-g*w[3],s=w[5]-m*w[4],l=w[6]-v*w[5]),b=r.offset,n=r.data,e=0,j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){for(E=0;E<c;E++){if(n[b]&&(e+=1)>=t)return!0;b+=o}b+=i}b+=a}b+=f}b+=u}b+=s}b+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L;for(c=r.shape,1===Ar(E=r.strides)?(p=c[7],y=c[6],g=c[5],m=c[4],v=c[3],d=c[2],w=c[1],b=c[0],o=E[7],i=E[6]-p*E[7],a=E[5]-y*E[6],f=E[4]-g*E[5],u=E[3]-m*E[4],s=E[2]-v*E[3],l=E[1]-d*E[2],h=E[0]-w*E[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],b=c[7],o=E[0],i=E[1]-p*E[0],a=E[2]-y*E[1],f=E[3]-g*E[2],u=E[4]-m*E[3],s=E[5]-v*E[4],l=E[6]-d*E[5],h=E[7]-w*E[6]),_=r.offset,n=r.data,e=0,L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){for(T=0;T<p;T++){if(n[_]&&(e+=1)>=t)return!0;_+=o}_+=i}_+=a}_+=f}_+=u}_+=s}_+=l}_+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(p=r.shape,1===Ar(T=r.strides)?(y=p[8],g=p[7],m=p[6],v=p[5],d=p[4],w=p[3],b=p[2],E=p[1],_=p[0],o=T[8],i=T[7]-y*T[8],a=T[6]-g*T[7],f=T[5]-m*T[6],u=T[4]-v*T[5],s=T[3]-d*T[4],l=T[2]-w*T[3],h=T[1]-b*T[2],c=T[0]-E*T[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],_=p[8],o=T[0],i=T[1]-y*T[0],a=T[2]-g*T[1],f=T[3]-m*T[2],u=T[4]-v*T[3],s=T[5]-d*T[4],l=T[6]-w*T[5],h=T[7]-b*T[6],c=T[8]-E*T[7]),x=r.offset,n=r.data,e=0,k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){for(V=0;V<y;V++){if(n[x]&&(e+=1)>=t)return!0;x+=o}x+=i}x+=a}x+=f}x+=u}x+=s}x+=l}x+=h}x+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P;for(y=r.shape,1===Ar(V=r.strides)?(g=y[9],m=y[8],v=y[7],d=y[6],w=y[5],b=y[4],E=y[3],_=y[2],T=y[1],x=y[0],o=V[9],i=V[8]-g*V[9],a=V[7]-m*V[8],f=V[6]-v*V[7],u=V[5]-d*V[6],s=V[4]-w*V[5],l=V[3]-b*V[4],h=V[2]-E*V[3],c=V[1]-_*V[2],p=V[0]-T*V[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],x=y[9],o=V[0],i=V[1]-g*V[0],a=V[2]-m*V[1],f=V[3]-v*V[2],u=V[4]-d*V[3],s=V[5]-w*V[4],l=V[6]-b*V[5],h=V[7]-E*V[6],c=V[8]-_*V[7],p=V[9]-T*V[8]),A=r.offset,n=r.data,e=0,P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){for(j=0;j<g;j++){if(n[A]&&(e+=1)>=t)return!0;A+=o}A+=i}A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}A+=c}A+=p}return!1},oo],ao=[function(r,t){return!!(t<=1&&r.accessors[0](r.data,r.offset))},function(r,t){var e,n,o,i,a,f,u;for(a=r.shape[0],i=r.strides[0],f=r.offset,n=r.data,o=r.accessors[0],e=0,u=0;u<a;u++){if(o(n,f)&&(e+=1)>=t)return!0;f+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p;for(f=r.shape,1===Ar(l=r.strides)?(u=f[1],s=f[0],i=l[1],a=l[0]-u*l[1]):(u=f[0],s=f[1],i=l[0],a=l[1]-u*l[0]),h=r.offset,n=r.data,o=r.accessors[0],e=0,p=0;p<s;p++){for(c=0;c<u;c++){if(o(n,h)&&(e+=1)>=t)return!0;h+=i}h+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m;for(u=r.shape,1===Ar(c=r.strides)?(s=u[2],l=u[1],h=u[0],i=c[2],a=c[1]-s*c[2],f=c[0]-l*c[1]):(s=u[0],l=u[1],h=u[2],i=c[0],a=c[1]-s*c[0],f=c[2]-l*c[1]),p=r.offset,n=r.data,o=r.accessors[0],e=0,m=0;m<h;m++){for(g=0;g<l;g++){for(y=0;y<s;y++){if(o(n,p)&&(e+=1)>=t)return!0;p+=i}p+=a}p+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w;for(s=r.shape,1===Ar(y=r.strides)?(l=s[3],h=s[2],c=s[1],p=s[0],i=y[3],a=y[2]-l*y[3],f=y[1]-h*y[2],u=y[0]-c*y[1]):(l=s[0],h=s[1],c=s[2],p=s[3],i=y[0],a=y[1]-l*y[0],f=y[2]-h*y[1],u=y[3]-c*y[2]),g=r.offset,n=r.data,o=r.accessors[0],e=0,w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){if(o(n,g)&&(e+=1)>=t)return!0;g+=i}g+=a}g+=f}g+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_;for(l=r.shape,1===Ar(m=r.strides)?(h=l[4],c=l[3],p=l[2],y=l[1],g=l[0],i=m[4],a=m[3]-h*m[4],f=m[2]-c*m[3],u=m[1]-p*m[2],s=m[0]-y*m[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],i=m[0],a=m[1]-h*m[0],f=m[2]-c*m[1],u=m[3]-p*m[2],s=m[4]-y*m[3]),v=r.offset,n=r.data,o=r.accessors[0],e=0,_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){if(o(n,v)&&(e+=1)>=t)return!0;v+=i}v+=a}v+=f}v+=u}v+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V;for(h=r.shape,1===Ar(d=r.strides)?(c=h[5],p=h[4],y=h[3],g=h[2],m=h[1],v=h[0],i=d[5],a=d[4]-c*d[5],f=d[3]-p*d[4],u=d[2]-y*d[3],s=d[1]-g*d[2],l=d[0]-m*d[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],i=d[0],a=d[1]-c*d[0],f=d[2]-p*d[1],u=d[3]-y*d[2],s=d[4]-g*d[3],l=d[5]-m*d[4]),w=r.offset,n=r.data,o=r.accessors[0],e=0,V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){if(o(n,w)&&(e+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}w+=s}w+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=r.shape,1===Ar(b=r.strides)?(p=c[6],y=c[5],g=c[4],m=c[3],v=c[2],d=c[1],w=c[0],i=b[6],a=b[5]-p*b[6],f=b[4]-y*b[5],u=b[3]-g*b[4],s=b[2]-m*b[3],l=b[1]-v*b[2],h=b[0]-d*b[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],i=b[0],a=b[1]-p*b[0],f=b[2]-y*b[1],u=b[3]-g*b[2],s=b[4]-m*b[3],l=b[5]-v*b[4],h=b[6]-d*b[5]),E=r.offset,n=r.data,o=r.accessors[0],e=0,S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){if(o(n,E)&&(e+=1)>=t)return!0;E+=i}E+=a}E+=f}E+=u}E+=s}E+=l}E+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O;for(p=r.shape,1===Ar(_=r.strides)?(y=p[7],g=p[6],m=p[5],v=p[4],d=p[3],w=p[2],b=p[1],E=p[0],i=_[7],a=_[6]-y*_[7],f=_[5]-g*_[6],u=_[4]-m*_[5],s=_[3]-v*_[4],l=_[2]-d*_[3],h=_[1]-w*_[2],c=_[0]-b*_[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],i=_[0],a=_[1]-y*_[0],f=_[2]-g*_[1],u=_[3]-m*_[2],s=_[4]-v*_[3],l=_[5]-d*_[4],h=_[6]-w*_[5],c=_[7]-b*_[6]),T=r.offset,n=r.data,o=r.accessors[0],e=0,O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){if(o(n,T)&&(e+=1)>=t)return!0;T+=i}T+=a}T+=f}T+=u}T+=s}T+=l}T+=h}T+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B;for(y=r.shape,1===Ar(x=r.strides)?(g=y[8],m=y[7],v=y[6],d=y[5],w=y[4],b=y[3],E=y[2],_=y[1],T=y[0],i=x[8],a=x[7]-g*x[8],f=x[6]-m*x[7],u=x[5]-v*x[6],s=x[4]-d*x[5],l=x[3]-w*x[4],h=x[2]-b*x[3],c=x[1]-E*x[2],p=x[0]-_*x[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],i=x[0],a=x[1]-g*x[0],f=x[2]-m*x[1],u=x[3]-v*x[2],s=x[4]-d*x[3],l=x[5]-w*x[4],h=x[6]-b*x[5],c=x[7]-E*x[6],p=x[8]-_*x[7]),V=r.offset,n=r.data,o=r.accessors[0],e=0,B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){if(o(n,V)&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}V+=h}V+=c}V+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M;for(g=r.shape,1===Ar(A=r.strides)?(m=g[9],v=g[8],d=g[7],w=g[6],b=g[5],E=g[4],_=g[3],T=g[2],x=g[1],V=g[0],i=A[9],a=A[8]-m*A[9],f=A[7]-v*A[8],u=A[6]-d*A[7],s=A[5]-w*A[6],l=A[4]-b*A[5],h=A[3]-E*A[4],c=A[2]-_*A[3],p=A[1]-T*A[2],y=A[0]-x*A[1]):(m=g[0],v=g[1],d=g[2],w=g[3],b=g[4],E=g[5],_=g[6],T=g[7],x=g[8],V=g[9],i=A[0],a=A[1]-m*A[0],f=A[2]-v*A[1],u=A[3]-d*A[2],s=A[4]-w*A[3],l=A[5]-b*A[4],h=A[6]-E*A[5],c=A[7]-_*A[6],p=A[8]-T*A[7],y=A[9]-x*A[8]),j=r.offset,n=r.data,o=r.accessors[0],e=0,M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){if(o(n,j)&&(e+=1)>=t)return!0;j+=i}j+=a}j+=f}j+=u}j+=s}j+=l}j+=h}j+=c}j+=p}j+=y}return!1},ro],fo=[function(r,t){return!!(t<=1&&(r.data[r.offset]||r.data[r.offset+1]))},function(r,t){var e,n,o,i,a,f;for(i=r.shape[0],o=r.strides[0],a=r.offset,n=r.data,e=0,f=0;f<i;f++){if((n[a]||n[a+1])&&(e+=1)>=t)return!0;a+=o}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c;for(a=r.shape,1===Ar(s=r.strides)?(f=a[1],u=a[0],o=s[1],i=s[0]-f*s[1]):(f=a[0],u=a[1],o=s[0],i=s[1]-f*s[0]),l=r.offset,n=r.data,e=0,c=0;c<u;c++){for(h=0;h<f;h++){if((n[l]||n[l+1])&&(e+=1)>=t)return!0;l+=o}l+=i}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g;for(f=r.shape,1===Ar(h=r.strides)?(u=f[2],s=f[1],l=f[0],o=h[2],i=h[1]-u*h[2],a=h[0]-s*h[1]):(u=f[0],s=f[1],l=f[2],o=h[0],i=h[1]-u*h[0],a=h[2]-s*h[1]),c=r.offset,n=r.data,e=0,g=0;g<l;g++){for(y=0;y<s;y++){for(p=0;p<u;p++){if((n[c]||n[c+1])&&(e+=1)>=t)return!0;c+=o}c+=i}c+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=r.shape,1===Ar(p=r.strides)?(s=u[3],l=u[2],h=u[1],c=u[0],o=p[3],i=p[2]-s*p[3],a=p[1]-l*p[2],f=p[0]-h*p[1]):(s=u[0],l=u[1],h=u[2],c=u[3],o=p[0],i=p[1]-s*p[0],a=p[2]-l*p[1],f=p[3]-h*p[2]),y=r.offset,n=r.data,e=0,d=0;d<c;d++){for(v=0;v<h;v++){for(m=0;m<l;m++){for(g=0;g<s;g++){if((n[y]||n[y+1])&&(e+=1)>=t)return!0;y+=o}y+=i}y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E;for(s=r.shape,1===Ar(g=r.strides)?(l=s[4],h=s[3],c=s[2],p=s[1],y=s[0],o=g[4],i=g[3]-l*g[4],a=g[2]-h*g[3],f=g[1]-c*g[2],u=g[0]-p*g[1]):(l=s[0],h=s[1],c=s[2],p=s[3],y=s[4],o=g[0],i=g[1]-l*g[0],a=g[2]-h*g[1],f=g[3]-c*g[2],u=g[4]-p*g[3]),m=r.offset,n=r.data,e=0,E=0;E<y;E++){for(b=0;b<p;b++){for(w=0;w<c;w++){for(d=0;d<h;d++){for(v=0;v<l;v++){if((n[m]||n[m+1])&&(e+=1)>=t)return!0;m+=o}m+=i}m+=a}m+=f}m+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(l=r.shape,1===Ar(v=r.strides)?(h=l[5],c=l[4],p=l[3],y=l[2],g=l[1],m=l[0],o=v[5],i=v[4]-h*v[5],a=v[3]-c*v[4],f=v[2]-p*v[3],u=v[1]-y*v[2],s=v[0]-g*v[1]):(h=l[0],c=l[1],p=l[2],y=l[3],g=l[4],m=l[5],o=v[0],i=v[1]-h*v[0],a=v[2]-c*v[1],f=v[3]-p*v[2],u=v[4]-y*v[3],s=v[5]-g*v[4]),d=r.offset,n=r.data,e=0,x=0;x<m;x++){for(T=0;T<g;T++){for(_=0;_<y;_++){for(E=0;E<p;E++){for(b=0;b<c;b++){for(w=0;w<h;w++){if((n[d]||n[d+1])&&(e+=1)>=t)return!0;d+=o}d+=i}d+=a}d+=f}d+=u}d+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j;for(h=r.shape,1===Ar(w=r.strides)?(c=h[6],p=h[5],y=h[4],g=h[3],m=h[2],v=h[1],d=h[0],o=w[6],i=w[5]-c*w[6],a=w[4]-p*w[5],f=w[3]-y*w[4],u=w[2]-g*w[3],s=w[1]-m*w[2],l=w[0]-v*w[1]):(c=h[0],p=h[1],y=h[2],g=h[3],m=h[4],v=h[5],d=h[6],o=w[0],i=w[1]-c*w[0],a=w[2]-p*w[1],f=w[3]-y*w[2],u=w[4]-g*w[3],s=w[5]-m*w[4],l=w[6]-v*w[5]),b=r.offset,n=r.data,e=0,j=0;j<d;j++){for(A=0;A<v;A++){for(V=0;V<m;V++){for(x=0;x<g;x++){for(T=0;T<y;T++){for(_=0;_<p;_++){for(E=0;E<c;E++){if((n[b]||n[b+1])&&(e+=1)>=t)return!0;b+=o}b+=i}b+=a}b+=f}b+=u}b+=s}b+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L;for(c=r.shape,1===Ar(E=r.strides)?(p=c[7],y=c[6],g=c[5],m=c[4],v=c[3],d=c[2],w=c[1],b=c[0],o=E[7],i=E[6]-p*E[7],a=E[5]-y*E[6],f=E[4]-g*E[5],u=E[3]-m*E[4],s=E[2]-v*E[3],l=E[1]-d*E[2],h=E[0]-w*E[1]):(p=c[0],y=c[1],g=c[2],m=c[3],v=c[4],d=c[5],w=c[6],b=c[7],o=E[0],i=E[1]-p*E[0],a=E[2]-y*E[1],f=E[3]-g*E[2],u=E[4]-m*E[3],s=E[5]-v*E[4],l=E[6]-d*E[5],h=E[7]-w*E[6]),_=r.offset,n=r.data,e=0,L=0;L<b;L++){for(F=0;F<w;F++){for(S=0;S<d;S++){for(j=0;j<v;j++){for(A=0;A<m;A++){for(V=0;V<g;V++){for(x=0;x<y;x++){for(T=0;T<p;T++){if((n[_]||n[_+1])&&(e+=1)>=t)return!0;_+=o}_+=i}_+=a}_+=f}_+=u}_+=s}_+=l}_+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(p=r.shape,1===Ar(T=r.strides)?(y=p[8],g=p[7],m=p[6],v=p[5],d=p[4],w=p[3],b=p[2],E=p[1],_=p[0],o=T[8],i=T[7]-y*T[8],a=T[6]-g*T[7],f=T[5]-m*T[6],u=T[4]-v*T[5],s=T[3]-d*T[4],l=T[2]-w*T[3],h=T[1]-b*T[2],c=T[0]-E*T[1]):(y=p[0],g=p[1],m=p[2],v=p[3],d=p[4],w=p[5],b=p[6],E=p[7],_=p[8],o=T[0],i=T[1]-y*T[0],a=T[2]-g*T[1],f=T[3]-m*T[2],u=T[4]-v*T[3],s=T[5]-d*T[4],l=T[6]-w*T[5],h=T[7]-b*T[6],c=T[8]-E*T[7]),x=r.offset,n=r.data,e=0,k=0;k<_;k++){for(I=0;I<E;I++){for(O=0;O<b;O++){for(L=0;L<w;L++){for(F=0;F<d;F++){for(S=0;S<v;S++){for(j=0;j<m;j++){for(A=0;A<g;A++){for(V=0;V<y;V++){if((n[x]||n[x+1])&&(e+=1)>=t)return!0;x+=o}x+=i}x+=a}x+=f}x+=u}x+=s}x+=l}x+=h}x+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P;for(y=r.shape,1===Ar(V=r.strides)?(g=y[9],m=y[8],v=y[7],d=y[6],w=y[5],b=y[4],E=y[3],_=y[2],T=y[1],x=y[0],o=V[9],i=V[8]-g*V[9],a=V[7]-m*V[8],f=V[6]-v*V[7],u=V[5]-d*V[6],s=V[4]-w*V[5],l=V[3]-b*V[4],h=V[2]-E*V[3],c=V[1]-_*V[2],p=V[0]-T*V[1]):(g=y[0],m=y[1],v=y[2],d=y[3],w=y[4],b=y[5],E=y[6],_=y[7],T=y[8],x=y[9],o=V[0],i=V[1]-g*V[0],a=V[2]-m*V[1],f=V[3]-v*V[2],u=V[4]-d*V[3],s=V[5]-w*V[4],l=V[6]-b*V[5],h=V[7]-E*V[6],c=V[8]-_*V[7],p=V[9]-T*V[8]),A=r.offset,n=r.data,e=0,P=0;P<x;P++){for(R=0;R<T;R++){for(B=0;B<_;B++){for(k=0;k<E;k++){for(I=0;I<b;I++){for(O=0;O<w;O++){for(L=0;L<d;L++){for(F=0;F<v;F++){for(S=0;S<m;S++){for(j=0;j<g;j++){if((n[A]||n[A+1])&&(e+=1)>=t)return!0;A+=o}A+=i}A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}A+=c}A+=p}return!1},eo],uo=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=(d=cn(r.shape,r.strides)).sh,h=d.sx,e=Dn(r.dtype),c=r.offset,o=r.data,i=h[0],n=0,v=u[1];v>0;)for(v<e?(l=v,v=0):(l=e,v-=e),f=c+v*h[1],m=u[0];m>0;)for(m<e?(s=m,m=0):(s=e,m-=e),p=f+m*h[0],a=h[1]-s*h[0],g=0;g<l;g++){for(y=0;y<s;y++){if(o[p]&&(n+=1)>=t)return!0;p+=i}p+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T;for(l=(T=cn(r.shape,r.strides)).sh,y=T.sx,e=Dn(r.dtype),g=r.offset,o=r.data,i=y[0],n=0,_=l[2];_>0;)for(_<e?(p=_,_=0):(p=e,_-=e),s=g+_*y[2],E=l[1];E>0;)for(E<e?(c=E,E=0):(c=e,E-=e),f=y[2]-c*y[1],u=s+E*y[1],b=l[0];b>0;)for(b<e?(h=b,b=0):(h=e,b-=e),m=u+b*y[0],a=y[1]-h*y[0],w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){if(o[m]&&(n+=1)>=t)return!0;m+=i}m+=a}m+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=(S=cn(r.shape,r.strides)).sh,v=S.sx,e=Dn(r.dtype),d=r.offset,o=r.data,i=v[0],n=0,j=c[3];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),h=d+j*v[3],A=c[2];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=v[3]-g*v[2],l=h+A*v[2],V=c[1];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),f=v[2]-y*v[1],s=l+V*v[1],x=c[0];x>0;)for(x<e?(p=x,x=0):(p=e,x-=e),w=s+x*v[0],a=v[1]-p*v[0],T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){if(o[w]&&(n+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(y=(k=cn(r.shape,r.strides)).sh,b=k.sx,e=Dn(r.dtype),E=r.offset,o=r.data,i=b[0],n=0,I=y[4];I>0;)for(I<e?(w=I,I=0):(w=e,I-=e),p=E+I*b[4],O=y[3];O>0;)for(O<e?(d=O,O=0):(d=e,O-=e),s=b[4]-d*b[3],c=p+O*b[3],L=y[2];L>0;)for(L<e?(v=L,L=0):(v=e,L-=e),u=b[3]-v*b[2],h=c+L*b[2],F=y[1];F>0;)for(F<e?(m=F,F=0):(m=e,F-=e),f=b[2]-m*b[1],l=h+F*b[1],S=y[0];S>0;)for(S<e?(g=S,S=0):(g=e,S-=e),_=l+S*b[0],a=b[1]-g*b[0],j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){if(o[_]&&(n+=1)>=t)return!0;_+=i}_+=a}_+=f}_+=u}_+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C;for(m=(C=cn(r.shape,r.strides)).sh,T=C.sx,n=Dn(r.dtype),x=r.offset,o=r.data,i=T[0],e=0,M=m[5];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),g=x+M*T[5],P=m[4];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=T[5]-E*T[4],y=g+P*T[4],R=m[3];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=T[4]-b*T[3],p=y+R*T[3],B=m[2];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=T[3]-w*T[2],c=p+B*T[2],k=m[1];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),f=T[2]-d*T[1],h=c+k*T[1],I=m[0];I>0;)for(I<n?(v=I,I=0):(v=n,I-=n),V=h+I*T[0],a=T[1]-v*T[0],O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){if(o[V]&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z;for(d=(Z=cn(r.shape,r.strides)).sh,A=Z.sx,n=Dn(r.dtype),j=r.offset,o=r.data,i=A[0],e=0,W=d[6];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),v=j+W*A[6],Y=d[5];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=A[6]-x*A[5],m=v+Y*A[5],U=d[4];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=A[5]-T*A[4],g=m+U*A[4],N=d[3];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=A[4]-_*A[3],y=g+N*A[3],C=d[2];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=A[3]-E*A[2],p=y+C*A[2],M=d[1];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),f=A[2]-b*A[1],c=p+M*A[1],P=d[0];P>0;)for(P<n?(w=P,P=0):(w=n,P-=n),S=c+P*A[0],a=A[1]-w*A[0],R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){if(o[S]&&(e+=1)>=t)return!0;S+=i}S+=a}S+=f}S+=u}S+=s}S+=l}S+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z;for(b=(z=cn(r.shape,r.strides)).sh,F=z.sx,n=Dn(r.dtype),L=r.offset,o=r.data,i=F[0],e=0,X=b[7];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),w=L+X*F[7],K=b[6];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=F[7]-j*F[6],d=w+K*F[6],G=b[5];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=F[6]-A*F[5],v=d+G*F[5],$=b[4];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=F[5]-V*F[4],m=v+$*F[4],Z=b[3];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=F[4]-x*F[3],g=m+Z*F[3],W=b[2];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=F[3]-T*F[2],y=g+W*F[2],Y=b[1];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),f=F[2]-_*F[1],p=y+Y*F[1],U=b[0];U>0;)for(U<n?(E=U,U=0):(E=n,U-=n),O=p+U*F[0],a=F[1]-E*F[0],N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){if(o[O]&&(e+=1)>=t)return!0;O+=i}O+=a}O+=f}O+=u}O+=s}O+=l}O+=h}O+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q;for(_=(Q=cn(r.shape,r.strides)).sh,I=Q.sx,n=Dn(r.dtype),k=r.offset,o=r.data,i=I[0],e=0,q=_[8];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),E=k+q*I[8],D=_[7];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=I[8]-L*I[7],b=E+D*I[7],J=_[6];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=I[7]-F*I[6],w=b+J*I[6],H=_[5];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=I[6]-S*I[5],d=w+H*I[5],z=_[4];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=I[5]-j*I[4],v=d+z*I[4],X=_[3];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=I[4]-A*I[3],m=v+X*I[3],K=_[2];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=I[3]-V*I[2],g=m+K*I[2],G=_[1];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),f=I[2]-x*I[1],y=g+G*I[1],$=_[0];$>0;)for($<n?(T=$,$=0):(T=n,$-=n),B=y+$*I[0],a=I[1]-T*I[0],Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){if(o[B]&&(e+=1)>=t)return!0;B+=i}B+=a}B+=f}B+=u}B+=s}B+=l}B+=h}B+=c}B+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or;for(x=(or=cn(r.shape,r.strides)).sh,R=or.sx,n=Dn(r.dtype),P=r.offset,o=r.data,i=R[0],e=0,nr=x[9];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),T=P+nr*R[9],er=x[8];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=R[9]-k*R[8],_=T+er*R[8],tr=x[7];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=R[8]-I*R[7],E=_+tr*R[7],rr=x[6];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=R[7]-O*R[6],b=E+rr*R[6],Q=x[5];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=R[6]-L*R[5],w=b+Q*R[5],q=x[4];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=R[5]-F*R[4],d=w+q*R[4],D=x[3];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=R[4]-S*R[3],v=d+D*R[3],J=x[2];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=R[3]-j*R[2],m=v+J*R[2],H=x[1];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),f=R[2]-A*R[1],g=m+H*R[1],z=x[0];z>0;)for(z<n?(V=z,z=0):(V=n,z-=n),M=g+z*R[0],a=R[1]-V*R[0],X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){for(C=0;C<V;C++){if(o[M]&&(e+=1)>=t)return!0;M+=i}M+=a}M+=f}M+=u}M+=s}M+=l}M+=h}M+=c}M+=p}M+=y}return!1}],so=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w;for(s=(w=cn(r.shape,r.strides)).sh,c=w.sx,e=Dn(r.dtype),p=r.offset,o=r.data,a=c[0],i=r.accessors[0],n=0,d=s[1];d>0;)for(d<e?(h=d,d=0):(h=e,d-=e),u=p+d*c[1],v=s[0];v>0;)for(v<e?(l=v,v=0):(l=e,v-=e),y=u+v*c[0],f=c[1]-l*c[0],m=0;m<h;m++){for(g=0;g<l;g++){if(i(o,y)&&(n+=1)>=t)return!0;y+=a}y+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x;for(h=(x=cn(r.shape,r.strides)).sh,g=x.sx,e=Dn(r.dtype),m=r.offset,o=r.data,a=g[0],i=r.accessors[0],n=0,T=h[2];T>0;)for(T<e?(y=T,T=0):(y=e,T-=e),l=m+T*g[2],_=h[1];_>0;)for(_<e?(p=_,_=0):(p=e,_-=e),u=g[2]-p*g[1],s=l+_*g[1],E=h[0];E>0;)for(E<e?(c=E,E=0):(c=e,E-=e),v=s+E*g[0],f=g[1]-c*g[0],b=0;b<y;b++){for(w=0;w<p;w++){for(d=0;d<c;d++){if(i(o,v)&&(n+=1)>=t)return!0;v+=a}v+=f}v+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F;for(p=(F=cn(r.shape,r.strides)).sh,d=F.sx,e=Dn(r.dtype),w=r.offset,o=r.data,a=d[0],i=r.accessors[0],n=0,S=p[3];S>0;)for(S<e?(v=S,S=0):(v=e,S-=e),c=w+S*d[3],j=p[2];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),s=d[3]-m*d[2],h=c+j*d[2],A=p[1];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=d[2]-g*d[1],l=h+A*d[1],V=p[0];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),b=l+V*d[0],f=d[1]-y*d[0],x=0;x<v;x++){for(T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){if(i(o,b)&&(n+=1)>=t)return!0;b+=a}b+=f}b+=u}b+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B;for(g=(B=cn(r.shape,r.strides)).sh,E=B.sx,n=Dn(r.dtype),_=r.offset,o=r.data,a=E[0],i=r.accessors[0],e=0,k=g[4];k>0;)for(k<n?(b=k,k=0):(b=n,k-=n),y=_+k*E[4],I=g[3];I>0;)for(I<n?(w=I,I=0):(w=n,I-=n),l=E[4]-w*E[3],p=y+I*E[3],O=g[2];O>0;)for(O<n?(d=O,O=0):(d=n,O-=n),s=E[3]-d*E[2],c=p+O*E[2],L=g[1];L>0;)for(L<n?(v=L,L=0):(v=n,L-=n),u=E[2]-v*E[1],h=c+L*E[1],F=g[0];F>0;)for(F<n?(m=F,F=0):(m=n,F-=n),T=h+F*E[0],f=E[1]-m*E[0],S=0;S<b;S++){for(j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){if(i(o,T)&&(e+=1)>=t)return!0;T+=a}T+=f}T+=u}T+=s}T+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N;for(v=(N=cn(r.shape,r.strides)).sh,x=N.sx,n=Dn(r.dtype),V=r.offset,o=r.data,a=x[0],i=r.accessors[0],e=0,C=v[5];C>0;)for(C<n?(T=C,C=0):(T=n,C-=n),m=V+C*x[5],M=v[4];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),h=x[5]-_*x[4],g=m+M*x[4],P=v[3];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=x[4]-E*x[3],y=g+P*x[3],R=v[2];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=x[3]-b*x[2],p=y+R*x[2],B=v[1];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=x[2]-w*x[1],c=p+B*x[1],k=v[0];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),A=c+k*x[0],f=x[1]-d*x[0],I=0;I<T;I++){for(O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){if(i(o,A)&&(e+=1)>=t)return!0;A+=a}A+=f}A+=u}A+=s}A+=l}A+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$;for(w=($=cn(r.shape,r.strides)).sh,j=$.sx,n=Dn(r.dtype),S=r.offset,o=r.data,a=j[0],i=r.accessors[0],e=0,Z=w[6];Z>0;)for(Z<n?(A=Z,Z=0):(A=n,Z-=n),d=S+Z*j[6],W=w[5];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),c=j[6]-V*j[5],v=d+W*j[5],Y=w[4];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=j[5]-x*j[4],m=v+Y*j[4],U=w[3];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=j[4]-T*j[3],g=m+U*j[3],N=w[2];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=j[3]-_*j[2],y=g+N*j[2],C=w[1];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=j[2]-E*j[1],p=y+C*j[1],M=w[0];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),F=p+M*j[0],f=j[1]-b*j[0],P=0;P<A;P++){for(R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){if(i(o,F)&&(e+=1)>=t)return!0;F+=a}F+=f}F+=u}F+=s}F+=l}F+=h}F+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H;for(E=(H=cn(r.shape,r.strides)).sh,L=H.sx,n=Dn(r.dtype),O=r.offset,o=r.data,a=L[0],i=r.accessors[0],e=0,z=E[7];z>0;)for(z<n?(F=z,z=0):(F=n,z-=n),b=O+z*L[7],X=E[6];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),p=L[7]-S*L[6],w=b+X*L[6],K=E[5];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=L[6]-j*L[5],d=w+K*L[5],G=E[4];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=L[5]-A*L[4],v=d+G*L[4],$=E[3];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=L[4]-V*L[3],m=v+$*L[3],Z=E[2];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=L[3]-x*L[2],g=m+Z*L[2],W=E[1];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=L[2]-T*L[1],y=g+W*L[1],Y=E[0];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),I=y+Y*L[0],f=L[1]-_*L[0],U=0;U<F;U++){for(N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){if(i(o,I)&&(e+=1)>=t)return!0;I+=a}I+=f}I+=u}I+=s}I+=l}I+=h}I+=c}I+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr;for(T=(rr=cn(r.shape,r.strides)).sh,k=rr.sx,n=Dn(r.dtype),B=r.offset,o=r.data,a=k[0],i=r.accessors[0],e=0,Q=T[8];Q>0;)for(Q<n?(I=Q,Q=0):(I=n,Q-=n),_=B+Q*k[8],q=T[7];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),y=k[8]-O*k[7],E=_+q*k[7],D=T[6];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=k[7]-L*k[6],b=E+D*k[6],J=T[5];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=k[6]-F*k[5],w=b+J*k[5],H=T[4];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=k[5]-S*k[4],d=w+H*k[4],z=T[3];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=k[4]-j*k[3],v=d+z*k[3],X=T[2];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=k[3]-A*k[2],m=v+X*k[2],K=T[1];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=k[2]-V*k[1],g=m+K*k[1],G=T[0];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),R=g+G*k[0],f=k[1]-x*k[0],$=0;$<I;$++){for(Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){if(i(o,R)&&(e+=1)>=t)return!0;R+=a}R+=f}R+=u}R+=s}R+=l}R+=h}R+=c}R+=p}R+=y}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or,ir;for(V=(ir=cn(r.shape,r.strides)).sh,P=ir.sx,n=Dn(r.dtype),M=r.offset,o=r.data,a=P[0],i=r.accessors[0],e=0,or=V[9];or>0;)for(or<n?(R=or,or=0):(R=n,or-=n),x=M+or*P[9],nr=V[8];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),g=P[9]-B*P[8],T=x+nr*P[8],er=V[7];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=P[8]-k*P[7],_=T+er*P[7],tr=V[6];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=P[7]-I*P[6],E=_+tr*P[6],rr=V[5];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=P[6]-O*P[5],b=E+rr*P[5],Q=V[4];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=P[5]-L*P[4],w=b+Q*P[4],q=V[3];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=P[4]-F*P[3],d=w+q*P[3],D=V[2];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=P[3]-S*P[2],v=d+D*P[2],J=V[1];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=P[2]-j*P[1],m=v+J*P[1],H=V[0];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),C=m+H*P[0],f=P[1]-A*P[0],z=0;z<R;z++){for(X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){if(i(o,C)&&(e+=1)>=t)return!0;C+=a}C+=f}C+=u}C+=s}C+=l}C+=h}C+=c}C+=p}C+=y}C+=g}return!1}],lo=[function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;for(u=(d=cn(r.shape,r.strides)).sh,h=d.sx,n=Dn(r.dtype),c=r.offset,o=r.data,i=h[0],e=0,v=u[1];v>0;)for(v<n?(l=v,v=0):(l=n,v-=n),f=c+v*h[1],m=u[0];m>0;)for(m<n?(s=m,m=0):(s=n,m-=n),p=f+m*h[0],a=h[1]-s*h[0],g=0;g<l;g++){for(y=0;y<s;y++){if((o[p]||o[p+1])&&(e+=1)>=t)return!0;p+=i}p+=a}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T;for(l=(T=cn(r.shape,r.strides)).sh,y=T.sx,n=Dn(r.dtype),g=r.offset,o=r.data,i=y[0],e=0,_=l[2];_>0;)for(_<n?(p=_,_=0):(p=n,_-=n),s=g+_*y[2],E=l[1];E>0;)for(E<n?(c=E,E=0):(c=n,E-=n),f=y[2]-c*y[1],u=s+E*y[1],b=l[0];b>0;)for(b<n?(h=b,b=0):(h=n,b-=n),m=u+b*y[0],a=y[1]-h*y[0],w=0;w<p;w++){for(d=0;d<c;d++){for(v=0;v<h;v++){if((o[m]||o[m+1])&&(e+=1)>=t)return!0;m+=i}m+=a}m+=f}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S;for(c=(S=cn(r.shape,r.strides)).sh,v=S.sx,e=Dn(r.dtype),d=r.offset,o=r.data,i=v[0],n=0,j=c[3];j>0;)for(j<e?(m=j,j=0):(m=e,j-=e),h=d+j*v[3],A=c[2];A>0;)for(A<e?(g=A,A=0):(g=e,A-=e),u=v[3]-g*v[2],l=h+A*v[2],V=c[1];V>0;)for(V<e?(y=V,V=0):(y=e,V-=e),f=v[2]-y*v[1],s=l+V*v[1],x=c[0];x>0;)for(x<e?(p=x,x=0):(p=e,x-=e),w=s+x*v[0],a=v[1]-p*v[0],T=0;T<m;T++){for(_=0;_<g;_++){for(E=0;E<y;E++){for(b=0;b<p;b++){if((o[w]||o[w+1])&&(n+=1)>=t)return!0;w+=i}w+=a}w+=f}w+=u}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k;for(y=(k=cn(r.shape,r.strides)).sh,b=k.sx,e=Dn(r.dtype),E=r.offset,o=r.data,i=b[0],n=0,I=y[4];I>0;)for(I<e?(w=I,I=0):(w=e,I-=e),p=E+I*b[4],O=y[3];O>0;)for(O<e?(d=O,O=0):(d=e,O-=e),s=b[4]-d*b[3],c=p+O*b[3],L=y[2];L>0;)for(L<e?(v=L,L=0):(v=e,L-=e),u=b[3]-v*b[2],h=c+L*b[2],F=y[1];F>0;)for(F<e?(m=F,F=0):(m=e,F-=e),f=b[2]-m*b[1],l=h+F*b[1],S=y[0];S>0;)for(S<e?(g=S,S=0):(g=e,S-=e),_=l+S*b[0],a=b[1]-g*b[0],j=0;j<w;j++){for(A=0;A<d;A++){for(V=0;V<v;V++){for(x=0;x<m;x++){for(T=0;T<g;T++){if((o[_]||o[_+1])&&(n+=1)>=t)return!0;_+=i}_+=a}_+=f}_+=u}_+=s}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C;for(m=(C=cn(r.shape,r.strides)).sh,T=C.sx,n=Dn(r.dtype),x=r.offset,o=r.data,i=T[0],e=0,M=m[5];M>0;)for(M<n?(_=M,M=0):(_=n,M-=n),g=x+M*T[5],P=m[4];P>0;)for(P<n?(E=P,P=0):(E=n,P-=n),l=T[5]-E*T[4],y=g+P*T[4],R=m[3];R>0;)for(R<n?(b=R,R=0):(b=n,R-=n),s=T[4]-b*T[3],p=y+R*T[3],B=m[2];B>0;)for(B<n?(w=B,B=0):(w=n,B-=n),u=T[3]-w*T[2],c=p+B*T[2],k=m[1];k>0;)for(k<n?(d=k,k=0):(d=n,k-=n),f=T[2]-d*T[1],h=c+k*T[1],I=m[0];I>0;)for(I<n?(v=I,I=0):(v=n,I-=n),V=h+I*T[0],a=T[1]-v*T[0],O=0;O<_;O++){for(L=0;L<E;L++){for(F=0;F<b;F++){for(S=0;S<w;S++){for(j=0;j<d;j++){for(A=0;A<v;A++){if((o[V]||o[V+1])&&(e+=1)>=t)return!0;V+=i}V+=a}V+=f}V+=u}V+=s}V+=l}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z;for(d=(Z=cn(r.shape,r.strides)).sh,A=Z.sx,n=Dn(r.dtype),j=r.offset,o=r.data,i=A[0],e=0,W=d[6];W>0;)for(W<n?(V=W,W=0):(V=n,W-=n),v=j+W*A[6],Y=d[5];Y>0;)for(Y<n?(x=Y,Y=0):(x=n,Y-=n),h=A[6]-x*A[5],m=v+Y*A[5],U=d[4];U>0;)for(U<n?(T=U,U=0):(T=n,U-=n),l=A[5]-T*A[4],g=m+U*A[4],N=d[3];N>0;)for(N<n?(_=N,N=0):(_=n,N-=n),s=A[4]-_*A[3],y=g+N*A[3],C=d[2];C>0;)for(C<n?(E=C,C=0):(E=n,C-=n),u=A[3]-E*A[2],p=y+C*A[2],M=d[1];M>0;)for(M<n?(b=M,M=0):(b=n,M-=n),f=A[2]-b*A[1],c=p+M*A[1],P=d[0];P>0;)for(P<n?(w=P,P=0):(w=n,P-=n),S=c+P*A[0],a=A[1]-w*A[0],R=0;R<V;R++){for(B=0;B<x;B++){for(k=0;k<T;k++){for(I=0;I<_;I++){for(O=0;O<E;O++){for(L=0;L<b;L++){for(F=0;F<w;F++){if((o[S]||o[S+1])&&(e+=1)>=t)return!0;S+=i}S+=a}S+=f}S+=u}S+=s}S+=l}S+=h}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z;for(b=(z=cn(r.shape,r.strides)).sh,F=z.sx,n=Dn(r.dtype),L=r.offset,o=r.data,i=F[0],e=0,X=b[7];X>0;)for(X<n?(S=X,X=0):(S=n,X-=n),w=L+X*F[7],K=b[6];K>0;)for(K<n?(j=K,K=0):(j=n,K-=n),c=F[7]-j*F[6],d=w+K*F[6],G=b[5];G>0;)for(G<n?(A=G,G=0):(A=n,G-=n),h=F[6]-A*F[5],v=d+G*F[5],$=b[4];$>0;)for($<n?(V=$,$=0):(V=n,$-=n),l=F[5]-V*F[4],m=v+$*F[4],Z=b[3];Z>0;)for(Z<n?(x=Z,Z=0):(x=n,Z-=n),s=F[4]-x*F[3],g=m+Z*F[3],W=b[2];W>0;)for(W<n?(T=W,W=0):(T=n,W-=n),u=F[3]-T*F[2],y=g+W*F[2],Y=b[1];Y>0;)for(Y<n?(_=Y,Y=0):(_=n,Y-=n),f=F[2]-_*F[1],p=y+Y*F[1],U=b[0];U>0;)for(U<n?(E=U,U=0):(E=n,U-=n),O=p+U*F[0],a=F[1]-E*F[0],N=0;N<S;N++){for(C=0;C<j;C++){for(M=0;M<A;M++){for(P=0;P<V;P++){for(R=0;R<x;R++){for(B=0;B<T;B++){for(k=0;k<_;k++){for(I=0;I<E;I++){if((o[O]||o[O+1])&&(e+=1)>=t)return!0;O+=i}O+=a}O+=f}O+=u}O+=s}O+=l}O+=h}O+=c}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q;for(_=(Q=cn(r.shape,r.strides)).sh,I=Q.sx,n=Dn(r.dtype),k=r.offset,o=r.data,i=I[0],e=0,q=_[8];q>0;)for(q<n?(O=q,q=0):(O=n,q-=n),E=k+q*I[8],D=_[7];D>0;)for(D<n?(L=D,D=0):(L=n,D-=n),p=I[8]-L*I[7],b=E+D*I[7],J=_[6];J>0;)for(J<n?(F=J,J=0):(F=n,J-=n),c=I[7]-F*I[6],w=b+J*I[6],H=_[5];H>0;)for(H<n?(S=H,H=0):(S=n,H-=n),h=I[6]-S*I[5],d=w+H*I[5],z=_[4];z>0;)for(z<n?(j=z,z=0):(j=n,z-=n),l=I[5]-j*I[4],v=d+z*I[4],X=_[3];X>0;)for(X<n?(A=X,X=0):(A=n,X-=n),s=I[4]-A*I[3],m=v+X*I[3],K=_[2];K>0;)for(K<n?(V=K,K=0):(V=n,K-=n),u=I[3]-V*I[2],g=m+K*I[2],G=_[1];G>0;)for(G<n?(x=G,G=0):(x=n,G-=n),f=I[2]-x*I[1],y=g+G*I[1],$=_[0];$>0;)for($<n?(T=$,$=0):(T=n,$-=n),B=y+$*I[0],a=I[1]-T*I[0],Z=0;Z<O;Z++){for(W=0;W<L;W++){for(Y=0;Y<F;Y++){for(U=0;U<S;U++){for(N=0;N<j;N++){for(C=0;C<A;C++){for(M=0;M<V;M++){for(P=0;P<x;P++){for(R=0;R<T;R++){if((o[B]||o[B+1])&&(e+=1)>=t)return!0;B+=i}B+=a}B+=f}B+=u}B+=s}B+=l}B+=h}B+=c}B+=p}return!1},function(r,t){var e,n,o,i,a,f,u,s,l,h,c,p,y,g,m,v,d,w,b,E,_,T,x,V,A,j,S,F,L,O,I,k,B,R,P,M,C,N,U,Y,W,Z,$,G,K,X,z,H,J,D,q,Q,rr,tr,er,nr,or;for(x=(or=cn(r.shape,r.strides)).sh,R=or.sx,n=Dn(r.dtype),P=r.offset,o=r.data,i=R[0],e=0,nr=x[9];nr>0;)for(nr<n?(B=nr,nr=0):(B=n,nr-=n),T=P+nr*R[9],er=x[8];er>0;)for(er<n?(k=er,er=0):(k=n,er-=n),y=R[9]-k*R[8],_=T+er*R[8],tr=x[7];tr>0;)for(tr<n?(I=tr,tr=0):(I=n,tr-=n),p=R[8]-I*R[7],E=_+tr*R[7],rr=x[6];rr>0;)for(rr<n?(O=rr,rr=0):(O=n,rr-=n),c=R[7]-O*R[6],b=E+rr*R[6],Q=x[5];Q>0;)for(Q<n?(L=Q,Q=0):(L=n,Q-=n),h=R[6]-L*R[5],w=b+Q*R[5],q=x[4];q>0;)for(q<n?(F=q,q=0):(F=n,q-=n),l=R[5]-F*R[4],d=w+q*R[4],D=x[3];D>0;)for(D<n?(S=D,D=0):(S=n,D-=n),s=R[4]-S*R[3],v=d+D*R[3],J=x[2];J>0;)for(J<n?(j=J,J=0):(j=n,J-=n),u=R[3]-j*R[2],m=v+J*R[2],H=x[1];H>0;)for(H<n?(A=H,H=0):(A=n,H-=n),f=R[2]-A*R[1],g=m+H*R[1],z=x[0];z>0;)for(z<n?(V=z,z=0):(V=n,z-=n),M=g+z*R[0],a=R[1]-V*R[0],X=0;X<B;X++){for(K=0;K<k;K++){for(G=0;G<I;G++){for($=0;$<O;$++){for(Z=0;Z<L;Z++){for(W=0;W<F;W++){for(Y=0;Y<S;Y++){for(U=0;U<j;U++){for(N=0;N<A;N++){for(C=0;C<V;C++){if((o[M]||o[M+1])&&(e+=1)>=t)return!0;M+=i}M+=a}M+=f}M+=u}M+=s}M+=l}M+=h}M+=c}M+=p}M+=y}return!1}],ho=io.length-1;return function(n){var o,i,a,f,u,s,l,h,c,p,y,g,m,v,d;if(y=Lr(n[0]),g=Lr(n[1]),i=(f=y.shape).length,p=g.accessors[0](g.data,g.offset),"object"==typeof(d=y.data)&&null!==d&&"BooleanArray"===d.constructor.name&&d.BYTES_PER_ELEMENT===e?(y.data=function(r,t){return new qr(r.buffer,r.byteOffset+r.BYTES_PER_ELEMENT*t,r.length-t)}(y.data,0),y.accessorProtocol=!1):function(e){return"object"==typeof e&&null!==e&&("Complex128Array"===e.constructor.name&&e.BYTES_PER_ELEMENT===t||"Complex64Array"===e.constructor.name&&e.BYTES_PER_ELEMENT===r)}(y.data)&&(y.data=function(r,t){if(Ir(r))return Ur(r,t);if(Br(r))return Xr(r,t);throw new TypeError(I("invalid argument. First argument must be a complex-valued floating-point array. Value: `%s`.",r))}(y.data,0),y.accessorProtocol=!1,y.strides=sn(i,2,y.strides,1),y.offset*=2,o=!0),0===i)return y.accessorProtocol?ao[i](y,p):o?fo[i](y,p):io[i](y,p);for(s=1,c=0,v=0;v<i;v++)s*=m=f[v],1===m&&(c+=1);if(0===s)return!1;if(1===i)return y.accessorProtocol?ao[i](y,p):o?fo[i](y,p):io[i](y,p);if(l=y.strides,c===i-1){for(v=0;v<i&&1===f[v];v++);return y.shape=[f[v]],y.strides=[l[v]],y.accessorProtocol?ao[1](y,p):o?fo[1](y,p):io[1](y,p)}if(u=function(r){var t,e;for(t=0,e=0;e<r.length;e++)r[e]<0&&(t+=1);return 0===t?1:t===r.length?-1:0}(l),0!==u){if(s===(a=W(f,l,y.offset))[1]-a[0]+1||o&&2*s==a[1]-a[0]+2)return h=1===u?a[0]:a[1],y.shape=[s],y.strides=[o?2*u:u],y.offset=h,y.accessorProtocol?ao[1](y,p):o?fo[1](y,p):io[1](y,p);if(i<=ho)return y.accessorProtocol?ao[i](y,p):o?fo[i](y,p):io[i](y,p)}return i<=ho?y.accessorProtocol?so[i-2](y,p):o?lo[i-2](y,p):uo[i-2](y,p):y.accessorProtocol?ro(y,p):o?eo(y,p):oo(y,p)}}));
+//# sourceMappingURL=index.js.map
diff --git a/index.js.map b/index.js.map
new file mode 100644
index 0000000..53c2e35
--- /dev/null
+++ b/index.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-booleanarray/lib/main.js","../node_modules/@stdlib/utils-define-property/lib/define_property.js","../node_modules/@stdlib/utils-define-property/lib/builtin.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_number.js","../node_modules/@stdlib/string-base-format-interpolate/lib/zero_pad.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_integer.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_double.js","../node_modules/@stdlib/string-base-format-interpolate/lib/space_pad.js","../node_modules/@stdlib/string-base-format-interpolate/lib/main.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_string.js","../node_modules/@stdlib/string-base-format-tokenize/lib/main.js","../node_modules/@stdlib/string-format/lib/main.js","../node_modules/@stdlib/string-format/lib/is_string.js","../node_modules/@stdlib/utils-define-property/lib/polyfill.js","../node_modules/@stdlib/utils-define-property/lib/index.js","../node_modules/@stdlib/utils-define-property/lib/has_define_property_support.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/main.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/main.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/index.js","../node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/assign.js","../node_modules/@stdlib/array-base-assert-is-accessor-array/lib/main.js","../node_modules/@stdlib/array-base-accessor-getter/lib/main.js","../node_modules/@stdlib/array-base-accessor-setter/lib/main.js","../node_modules/@stdlib/array-base-getter/lib/main.js","../node_modules/@stdlib/array-base-setter/lib/main.js","../node_modules/@stdlib/ndarray-base-numel/lib/main.js","../node_modules/@stdlib/array-base-copy-indexed/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/primitive.js","../node_modules/@stdlib/assert-has-tostringtag-support/lib/main.js","../node_modules/@stdlib/assert-has-symbol-support/lib/main.js","../node_modules/@stdlib/utils-native-class/lib/tostring.js","../node_modules/@stdlib/assert-has-own-property/lib/main.js","../node_modules/@stdlib/symbol-ctor/lib/main.js","../node_modules/@stdlib/utils-native-class/lib/tostringtag.js","../node_modules/@stdlib/utils-native-class/lib/index.js","../node_modules/@stdlib/utils-native-class/lib/polyfill.js","../node_modules/@stdlib/utils-native-class/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/valueof.js","../node_modules/@stdlib/assert-is-string/lib/object.js","../node_modules/@stdlib/assert-is-string/lib/try2valueof.js","../node_modules/@stdlib/assert-is-string/lib/main.js","../node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/main.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/index.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/index.js","../node_modules/@stdlib/ndarray-base-shape2strides/lib/assign.js","../node_modules/@stdlib/ndarray-base-strides/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/primitive.js","../node_modules/@stdlib/number-ctor/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/tostring.js","../node_modules/@stdlib/assert-is-number/lib/object.js","../node_modules/@stdlib/assert-is-number/lib/try2serialize.js","../node_modules/@stdlib/assert-is-number/lib/main.js","../node_modules/@stdlib/ndarray-base-offset/lib/main.js","../node_modules/@stdlib/ndarray-base-strides2offset/lib/main.js","../node_modules/@stdlib/math-base-special-abs/lib/main.js","../node_modules/@stdlib/ndarray-base-strides2order/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/index.js","../node_modules/@stdlib/ndarray-base-order/lib/main.js","../node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/main.js","../node_modules/@stdlib/ndarray-base-data-buffer/lib/main.js","../node_modules/@stdlib/ndarray-base-shape/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex128array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex64array/lib/main.js","../node_modules/@stdlib/assert-is-float64array/lib/main.js","../node_modules/@stdlib/assert-has-float64array-support/lib/float64array.js","../node_modules/@stdlib/array-float64/lib/main.js","../node_modules/@stdlib/array-float64/lib/index.js","../node_modules/@stdlib/assert-has-float64array-support/lib/main.js","../node_modules/@stdlib/array-float64/lib/polyfill.js","../node_modules/@stdlib/strided-base-reinterpret-complex128/lib/main.js","../node_modules/@stdlib/assert-is-float32array/lib/main.js","../node_modules/@stdlib/constants-float64-pinf/lib/index.js","../node_modules/@stdlib/assert-has-float32array-support/lib/float32array.js","../node_modules/@stdlib/array-float32/lib/main.js","../node_modules/@stdlib/array-float32/lib/index.js","../node_modules/@stdlib/assert-has-float32array-support/lib/main.js","../node_modules/@stdlib/array-float32/lib/polyfill.js","../node_modules/@stdlib/strided-base-reinterpret-complex64/lib/main.js","../node_modules/@stdlib/assert-is-uint8array/lib/main.js","../node_modules/@stdlib/constants-uint8-max/lib/index.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/uint8array.js","../node_modules/@stdlib/array-uint8/lib/main.js","../node_modules/@stdlib/array-uint8/lib/index.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/main.js","../node_modules/@stdlib/array-uint8/lib/polyfill.js","../node_modules/@stdlib/assert-is-array/lib/main.js","../node_modules/@stdlib/assert-tools-array-function/lib/main.js","../node_modules/@stdlib/assert-is-object-like/lib/main.js","../node_modules/@stdlib/assert-is-buffer/lib/main.js","../node_modules/@stdlib/regexp-function-name/lib/main.js","../node_modules/@stdlib/assert-is-object-like/lib/index.js","../node_modules/@stdlib/regexp-function-name/lib/regexp.js","../node_modules/@stdlib/utils-constructor-name/lib/main.js","../node_modules/@stdlib/regexp-function-name/lib/index.js","../node_modules/@stdlib/array-dtype/lib/ctor2dtype.js","../node_modules/@stdlib/assert-is-uint32array/lib/main.js","../node_modules/@stdlib/constants-uint32-max/lib/index.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/uint32array.js","../node_modules/@stdlib/array-uint32/lib/main.js","../node_modules/@stdlib/array-uint32/lib/index.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/main.js","../node_modules/@stdlib/array-uint32/lib/polyfill.js","../node_modules/@stdlib/assert-is-int32array/lib/main.js","../node_modules/@stdlib/constants-int32-max/lib/index.js","../node_modules/@stdlib/assert-has-int32array-support/lib/int32array.js","../node_modules/@stdlib/array-int32/lib/main.js","../node_modules/@stdlib/array-int32/lib/index.js","../node_modules/@stdlib/assert-has-int32array-support/lib/main.js","../node_modules/@stdlib/constants-int32-min/lib/index.js","../node_modules/@stdlib/array-int32/lib/polyfill.js","../node_modules/@stdlib/assert-is-uint16array/lib/main.js","../node_modules/@stdlib/constants-uint16-max/lib/index.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/uint16array.js","../node_modules/@stdlib/array-uint16/lib/main.js","../node_modules/@stdlib/array-uint16/lib/index.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/main.js","../node_modules/@stdlib/array-uint16/lib/polyfill.js","../node_modules/@stdlib/assert-is-int16array/lib/main.js","../node_modules/@stdlib/constants-int16-max/lib/index.js","../node_modules/@stdlib/assert-has-int16array-support/lib/int16array.js","../node_modules/@stdlib/array-int16/lib/main.js","../node_modules/@stdlib/array-int16/lib/index.js","../node_modules/@stdlib/assert-has-int16array-support/lib/main.js","../node_modules/@stdlib/constants-int16-min/lib/index.js","../node_modules/@stdlib/array-int16/lib/polyfill.js","../node_modules/@stdlib/assert-is-uint8clampedarray/lib/main.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/uint8clampedarray.js","../node_modules/@stdlib/array-uint8c/lib/main.js","../node_modules/@stdlib/array-uint8c/lib/index.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/main.js","../node_modules/@stdlib/array-uint8c/lib/polyfill.js","../node_modules/@stdlib/assert-is-int8array/lib/main.js","../node_modules/@stdlib/constants-int8-max/lib/index.js","../node_modules/@stdlib/assert-has-int8array-support/lib/int8array.js","../node_modules/@stdlib/array-int8/lib/main.js","../node_modules/@stdlib/array-int8/lib/index.js","../node_modules/@stdlib/assert-has-int8array-support/lib/main.js","../node_modules/@stdlib/constants-int8-min/lib/index.js","../node_modules/@stdlib/array-int8/lib/polyfill.js","../node_modules/@stdlib/constants-float64-ninf/lib/index.js","../node_modules/@stdlib/math-base-special-floor/lib/main.js","../node_modules/@stdlib/math-base-assert-is-integer/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/integer.js","../node_modules/@stdlib/assert-is-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-integer/lib/object.js","../node_modules/@stdlib/assert-is-integer/lib/main.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/object.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/index.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/index.js","../node_modules/@stdlib/constants-array-max-array-length/lib/index.js","../node_modules/@stdlib/assert-is-array-like-object/lib/main.js","../node_modules/@stdlib/constants-array-max-typed-array-length/lib/index.js","../node_modules/@stdlib/assert-is-collection/lib/main.js","../node_modules/@stdlib/assert-is-arraybuffer/lib/main.js","../node_modules/@stdlib/assert-is-object/lib/main.js","../node_modules/@stdlib/assert-is-string-array/lib/index.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/re.js","../node_modules/@stdlib/assert-is-boolean/lib/primitive.js","../node_modules/@stdlib/boolean-ctor/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/tostring.js","../node_modules/@stdlib/assert-is-boolean/lib/object.js","../node_modules/@stdlib/assert-is-boolean/lib/try2serialize.js","../node_modules/@stdlib/assert-is-boolean/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/index.js","../node_modules/@stdlib/utils-global/lib/self.js","../node_modules/@stdlib/utils-global/lib/window.js","../node_modules/@stdlib/utils-global/lib/global.js","../node_modules/@stdlib/utils-global/lib/global_this.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/nodelist.js","../node_modules/@stdlib/utils-global/lib/main.js","../node_modules/@stdlib/utils-global/lib/codegen.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js","../node_modules/@stdlib/utils-type-of/lib/index.js","../node_modules/@stdlib/utils-type-of/lib/check.js","../node_modules/@stdlib/utils-type-of/lib/polyfill.js","../node_modules/@stdlib/utils-type-of/lib/main.js","../node_modules/@stdlib/assert-is-function/lib/main.js","../node_modules/@stdlib/utils-define-read-only-property/lib/main.js","../node_modules/@stdlib/complex-float64-ctor/lib/main.js","../node_modules/@stdlib/complex-float64-ctor/lib/tostring.js","../node_modules/@stdlib/complex-float64-ctor/lib/tojson.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/main.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/polyfill.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/index.js","../node_modules/@stdlib/complex-float32-ctor/lib/main.js","../node_modules/@stdlib/assert-is-complex-like/lib/main.js","../node_modules/@stdlib/math-base-assert-is-even/lib/main.js","../node_modules/@stdlib/assert-has-iterator-symbol-support/lib/main.js","../node_modules/@stdlib/complex-float32-ctor/lib/tostring.js","../node_modules/@stdlib/complex-float32-ctor/lib/tojson.js","../node_modules/@stdlib/symbol-iterator/lib/main.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/main.js","../node_modules/@stdlib/complex-float32-real/lib/main.js","../node_modules/@stdlib/complex-float32-imag/lib/main.js","../node_modules/@stdlib/array-complex64/lib/from_iterator.js","../node_modules/@stdlib/array-complex64/lib/main.js","../node_modules/@stdlib/array-complex64/lib/from_array.js","../node_modules/@stdlib/complex-float64-real/lib/main.js","../node_modules/@stdlib/complex-float64-imag/lib/main.js","../node_modules/@stdlib/array-complex128/lib/from_iterator.js","../node_modules/@stdlib/array-complex64/lib/from_iterator_map.js","../node_modules/@stdlib/array-complex128/lib/main.js","../node_modules/@stdlib/array-complex128/lib/from_array.js","../node_modules/@stdlib/array-bool/lib/from_iterator.js","../node_modules/@stdlib/array-complex128/lib/from_iterator_map.js","../node_modules/@stdlib/array-bool/lib/main.js","../node_modules/@stdlib/array-bool/lib/from_array.js","../node_modules/@stdlib/array-bool/lib/from_iterator_map.js","../node_modules/@stdlib/array-dtype/lib/ctors.js","../node_modules/@stdlib/array-dtype/lib/dtypes.js","../node_modules/@stdlib/array-dtype/lib/main.js","../node_modules/@stdlib/array-base-arraylike2object/lib/main.js","../node_modules/@stdlib/blas-base-gscal/lib/accessors.js","../node_modules/@stdlib/blas-base-gscal/lib/ndarray.js","../node_modules/@stdlib/blas-base-gscal/lib/main.js","../node_modules/@stdlib/strided-base-stride2offset/lib/main.js","../node_modules/@stdlib/array-base-zero-to/lib/main.js","../node_modules/@stdlib/array-base-zero-to/lib/assign.js","../node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/main.js","../node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/sort2ins.js","../node_modules/@stdlib/array-base-take-indexed/lib/main.js","../node_modules/@stdlib/assert-is-positive-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-positive-integer/lib/object.js","../node_modules/@stdlib/assert-is-positive-integer/lib/main.js","../node_modules/@stdlib/utils-keys/lib/builtin.js","../node_modules/@stdlib/blas-base-gscal/lib/index.js","../node_modules/@stdlib/array-base-zero-to/lib/index.js","../node_modules/@stdlib/assert-is-positive-integer/lib/index.js","../node_modules/@stdlib/utils-keys/lib/has_builtin.js","../node_modules/@stdlib/assert-is-arguments/lib/detect.js","../node_modules/@stdlib/assert-is-arguments/lib/main.js","../node_modules/@stdlib/math-base-assert-is-nan/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/primitive.js","../node_modules/@stdlib/assert-is-nan/lib/object.js","../node_modules/@stdlib/assert-is-nan/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/index.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/native.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/has_string_enumerability_bug.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/main.js","../node_modules/@stdlib/assert-is-arguments/lib/index.js","../node_modules/@stdlib/assert-is-arguments/lib/polyfill.js","../node_modules/@stdlib/utils-keys/lib/builtin_wrapper.js","../node_modules/@stdlib/utils-keys/lib/has_enumerable_prototype_bug.js","../node_modules/@stdlib/utils-noop/lib/main.js","../node_modules/@stdlib/utils-keys/lib/has_non_enumerable_properties_bug.js","../node_modules/@stdlib/utils-index-of/lib/main.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype.js","../node_modules/@stdlib/utils-keys/lib/window.js","../node_modules/@stdlib/utils-keys/lib/has_automation_equality_bug.js","../node_modules/@stdlib/utils-keys/lib/has_window.js","../node_modules/@stdlib/utils-keys/lib/main.js","../node_modules/@stdlib/utils-keys/lib/has_arguments_bug.js","../node_modules/@stdlib/utils-keys/lib/polyfill.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype_wrapper.js","../node_modules/@stdlib/utils-get-prototype-of/lib/detect.js","../node_modules/@stdlib/object-ctor/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/native.js","../node_modules/@stdlib/utils-get-prototype-of/lib/polyfill.js","../node_modules/@stdlib/utils-get-prototype-of/lib/proto.js","../node_modules/@stdlib/assert-is-plain-object/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/main.js","../node_modules/@stdlib/object-inverse/lib/main.js","../node_modules/@stdlib/ndarray-base-dtype-enums/lib/main.js","../node_modules/@stdlib/ndarray-base-bytes-per-element/lib/main.js","../node_modules/@stdlib/ndarray-base-tiling-block-size/lib/defaults.js","../node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/main.js","../node_modules/@stdlib/ndarray-base-tiling-block-size/lib/main.js","../node_modules/@stdlib/ndarray-base-vind2bind/lib/main.js","../lib/nd_accessors.js","../lib/nd_complex.js","../lib/nd.js","../lib/main.js","../lib/0d.js","../lib/1d.js","../lib/2d.js","../lib/3d.js","../lib/4d.js","../lib/5d.js","../lib/6d.js","../lib/7d.js","../lib/8d.js","../lib/9d.js","../lib/10d.js","../lib/0d_accessors.js","../lib/1d_accessors.js","../lib/2d_accessors.js","../lib/3d_accessors.js","../lib/4d_accessors.js","../lib/5d_accessors.js","../lib/6d_accessors.js","../lib/7d_accessors.js","../lib/8d_accessors.js","../lib/9d_accessors.js","../lib/10d_accessors.js","../lib/0d_complex.js","../lib/1d_complex.js","../lib/2d_complex.js","../lib/3d_complex.js","../lib/4d_complex.js","../lib/5d_complex.js","../lib/6d_complex.js","../lib/7d_complex.js","../lib/8d_complex.js","../lib/9d_complex.js","../lib/10d_complex.js","../lib/2d_blocked.js","../lib/3d_blocked.js","../lib/4d_blocked.js","../lib/5d_blocked.js","../lib/6d_blocked.js","../lib/7d_blocked.js","../lib/8d_blocked.js","../lib/9d_blocked.js","../lib/10d_blocked.js","../lib/2d_blocked_accessors.js","../lib/3d_blocked_accessors.js","../lib/4d_blocked_accessors.js","../lib/5d_blocked_accessors.js","../lib/6d_blocked_accessors.js","../lib/7d_blocked_accessors.js","../lib/8d_blocked_accessors.js","../lib/9d_blocked_accessors.js","../lib/10d_blocked_accessors.js","../lib/2d_blocked_complex.js","../lib/3d_blocked_complex.js","../lib/4d_blocked_complex.js","../lib/5d_blocked_complex.js","../lib/6d_blocked_complex.js","../lib/7d_blocked_complex.js","../lib/8d_blocked_complex.js","../lib/9d_blocked_complex.js","../lib/10d_blocked_complex.js","../node_modules/@stdlib/strided-base-reinterpret-boolean/lib/main.js","../node_modules/@stdlib/strided-base-reinterpret-complex/lib/main.js","../node_modules/@stdlib/ndarray-base-iteration-order/lib/main.js"],"sourcesContent":["/**\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\nvar C64_BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\nvar C128_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 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*\n* bool = isComplexTypedArray( [] );\n* // returns false\n*/\nfunction isComplexTypedArray( 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-complex-typed-array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t(\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\t\t\tvalue.BYTES_PER_ELEMENT === C128_BYTES_PER_ELEMENT\n\t\t\t) ||\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\t\t\tvalue.BYTES_PER_ELEMENT === C64_BYTES_PER_ELEMENT\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isComplexTypedArray;\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 = 1; // 1 bytes per uint8\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `BooleanArray`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if 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* bool = isBooleanArray( [] );\n* // returns false\n*/\nfunction isBooleanArray( 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 `BooleanArray` 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-booleanarray`.\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// EXPORTS //\n\nexport default isBooleanArray;\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 Object.defineProperty === 'function' ) ? Object.defineProperty : null;\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* 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* @name defineProperty\n* @type {Function}\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} 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*/\nvar defineProperty = Object.defineProperty;\n\n\n// EXPORTS //\n\nexport default defineProperty;\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 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' );  // NOTE: we inline the `isNumber.isPrimitive` function from `@stdlib/assert/is-number` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\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* Tests if a string starts with a minus sign (`-`).\n*\n* @private\n* @param {string} str - input string\n* @returns {boolean} boolean indicating if a string starts with a minus sign (`-`)\n*/\nfunction startsWithMinus( str ) {\n\treturn str[ 0 ] === '-';\n}\n\n/**\n* Returns a string of `n` zeros.\n*\n* @private\n* @param {number} n - number of zeros\n* @returns {string} string of zeros\n*/\nfunction zeros( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += '0';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with zeros 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 zeroPad( str, width, right ) {\n\tvar negative = false;\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tif ( startsWithMinus( str ) ) {\n\t\tnegative = true;\n\t\tstr = str.substr( 1 );\n\t}\n\tstr = ( right ) ?\n\t\tstr + zeros( pad ) :\n\t\tzeros( pad ) + str;\n\tif ( negative ) {\n\t\tstr = '-' + str;\n\t}\n\treturn str;\n}\n\n\n// EXPORTS //\n\nexport default zeroPad;\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 isNumber from './is_number.js';\nimport zeroPad from './zero_pad.js';\n\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as an integer.\n*\n* @private\n* @param {Object} token - token object\n* @throws {Error} must provide a valid integer\n* @returns {string} formatted token argument\n*/\nfunction formatInteger( token ) {\n\tvar base;\n\tvar out;\n\tvar i;\n\n\tswitch ( token.specifier ) {\n\tcase 'b':\n\t\t// Case: %b (binary)\n\t\tbase = 2;\n\t\tbreak;\n\tcase 'o':\n\t\t// Case: %o (octal)\n\t\tbase = 8;\n\t\tbreak;\n\tcase 'x':\n\tcase 'X':\n\t\t// Case: %x, %X (hexadecimal)\n\t\tbase = 16;\n\t\tbreak;\n\tcase 'd':\n\tcase 'i':\n\tcase 'u':\n\tdefault:\n\t\t// Case: %d, %i, %u (decimal)\n\t\tbase = 10;\n\t\tbreak;\n\t}\n\tout = token.arg;\n\ti = parseInt( out, 10 );\n\tif ( !isFinite( i ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\tif ( !isNumber( out ) ) {\n\t\t\tthrow new Error( 'invalid integer. Value: ' + out );\n\t\t}\n\t\ti = 0;\n\t}\n\tif ( i < 0 && ( token.specifier === 'u' || base !== 10 ) ) {\n\t\ti = 0xffffffff + i + 1;\n\t}\n\tif ( i < 0 ) {\n\t\tout = ( -i ).toString( base );\n\t\tif ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tout = '-' + out;\n\t} else {\n\t\tout = i.toString( base );\n\t\tif ( !i && !token.precision ) {\n\t\t\tout = '';\n\t\t} else if ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tif ( token.sign ) {\n\t\t\tout = token.sign + out;\n\t\t}\n\t}\n\tif ( base === 16 ) {\n\t\tif ( token.alternate ) {\n\t\t\tout = '0x' + out;\n\t\t}\n\t\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\t\tuppercase.call( out ) :\n\t\t\tlowercase.call( out );\n\t}\n\tif ( base === 8 ) {\n\t\tif ( token.alternate && out.charAt( 0 ) !== '0' ) {\n\t\t\tout = '0' + out;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default formatInteger;\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\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar abs = Math.abs; // eslint-disable-line stdlib/no-builtin-math\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\nvar replace = String.prototype.replace;\n\n\n// VARIABLES //\n\nvar RE_EXP_POS_DIGITS = /e\\+(\\d)$/;\nvar RE_EXP_NEG_DIGITS = /e-(\\d)$/;\nvar RE_ONLY_DIGITS = /^(\\d+)$/;\nvar RE_DIGITS_BEFORE_EXP = /^(\\d+)e/;\nvar RE_TRAILING_PERIOD_ZERO = /\\.0$/;\nvar RE_PERIOD_ZERO_EXP = /\\.0*e/;\nvar RE_ZERO_BEFORE_EXP = /(\\..*[^0])0*e/;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as a floating-point number.\n*\n* @private\n* @param {number} f - parsed number\n* @param {Object} token - token object\n* @throws {Error} must provide a valid floating-point number\n* @returns {string} formatted token argument\n*/\nfunction formatDouble( f, token ) {\n\tvar digits;\n\tvar out;\n\n\tswitch ( token.specifier ) {\n\tcase 'e':\n\tcase 'E':\n\t\tout = f.toExponential( token.precision );\n\t\tbreak;\n\tcase 'f':\n\tcase 'F':\n\t\tout = f.toFixed( token.precision );\n\t\tbreak;\n\tcase 'g':\n\tcase 'G':\n\t\tif ( abs( f ) < 0.0001 ) {\n\t\t\tdigits = token.precision;\n\t\t\tif ( digits > 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 <boolean>\n*/\nfunction hasDefinePropertySupport() {\n\t// Test basic support...\n\ttry {\n\t\tdefineProperty( {}, 'x', {} );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default hasDefinePropertySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @returns {Array} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\treturn [ offset, offset ];\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\treturn [ min, max ];\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view.\n*\n* @module @stdlib/ndarray-base-minmax-view-buffer-index\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 10, 109 ]\n*\n* @example\n* import minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n*\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var idx = minmaxViewBufferIndex( shape, strides, offset );\n* // returns [ 0, 99 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the minimum and maximum linear indices in an underlying data buffer which are accessible to an array view and assigns results to a provided output array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} linear indices\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 10, 1 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -10, -1 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ 1, 10 ];\n* var offset = 10;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 10, 109 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*\n* @example\n* var shape = [ 10, 10 ];\n* var strides = [ -1, -10 ];\n* var offset = 99;\n*\n* var out = [ 0, 0 ];\n* var idx = minmaxViewBufferIndex( shape, strides, offset, out );\n* // returns [ 0, 99 ]\n*\n* var bool = ( idx === out );\n* // returns true\n*/\nfunction minmaxViewBufferIndex( shape, strides, offset, out ) {\n\tvar ndims;\n\tvar min;\n\tvar max;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tmin = offset;\n\tmax = offset;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shape[ i ] === 0 ) {\n\t\t\tout[ 0 ] = offset;\n\t\t\tout[ 1 ] = offset;\n\t\t\treturn out;\n\t\t}\n\t\ts = strides[ i ];\n\t\tif ( s > 0 ) {\n\t\t\tmax += s * ( shape[i]-1 );\n\t\t} else if ( s < 0 ) {\n\t\t\tmin += s * ( shape[i]-1 ); // decrements min\n\t\t}\n\t}\n\tout[ 0 ] = min;\n\tout[ 1 ] = max;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default minmaxViewBufferIndex;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nexport default isAccessorArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Complex128Array from '@stdlib/array-complex128';\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns <Complex128>[ 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 <Complex64>[ 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 <Complex64>[ 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 <Complex128>[ 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 <Complex64>[ 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 <Complex64>[ 10.0, 11.0 ]\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8Array from '@stdlib/array-uint8';\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* import Uint8ClampedArray from '@stdlib/array-uint8c';\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* import dtype from '@stdlib/array-dtype';\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nexport default setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the number of elements in an array.\n*\n* @param {(NonNegativeIntegerArray|EmptyArray)} shape - array shape\n* @returns {NonNegativeInteger} number of elements\n*\n* @example\n* var n = numel( [ 3, 3, 3 ] );\n* // returns 27\n*/\nfunction numel( shape ) {\n\tvar ndims;\n\tvar n;\n\tvar i;\n\n\tndims = shape.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0;\n\t}\n\tn = 1;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tn *= shape[ i ];\n\t}\n\treturn n;\n}\n\n\n// EXPORTS //\n\nexport default numel;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar i;\n\n\tlen = x.length;\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( x[ i ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default copy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasSymbols from '@stdlib/assert-has-symbol-support';\n\n\n// VARIABLES //\n\nvar FLG = hasSymbols();\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.toStringTag` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.toStringTag` support\n*\n* @example\n* var bool = hasToStringTagSupport();\n* // returns <boolean>\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 <boolean>\n*/\nfunction hasSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default hasSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar toStr = Object.prototype.toString;\n\n\n// EXPORTS //\n\nexport default toStr;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\nvar has = Object.prototype.hasOwnProperty;\n\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasOwnProp( value, property ) {\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\treturn has.call( value, property );\n}\n\n\n// EXPORTS //\n\nexport default hasOwnProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar Sym = ( typeof Symbol === 'function' ) ? Symbol : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Sym;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Symbol from '@stdlib/symbol-ctor';\n\n\n// MAIN //\n\nvar toStrTag = ( typeof Symbol === 'function' ) ? Symbol.toStringTag : '';\n\n\n// EXPORTS //\n\nexport default toStrTag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a string value indicating a specification defined classification of an object.\n*\n* @module @stdlib/utils-native-class\n*\n* @example\n* import nativeClass from '@stdlib/utils-native-class';\n*\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* function Beep() {\n*     return this;\n* }\n* str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main;\nif ( hasToStringTag() ) {\n\tmain = polyfill;\n} else {\n\tmain = builtin;\n}\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport toStringTag from './tostringtag.js';\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification of an object in environments supporting `Symbol.toStringTag`.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n*     return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\tvar isOwn;\n\tvar tag;\n\tvar out;\n\n\tif ( v === null || v === void 0 ) {\n\t\treturn toStr.call( v );\n\t}\n\ttag = v[ toStringTag ];\n\tisOwn = hasOwnProp( v, toStringTag );\n\n\t// Attempt to override the `toStringTag` property. For built-ins having a `Symbol.toStringTag` property (e.g., `JSON`, `Math`, etc), the `Symbol.toStringTag` property is read-only (e.g., , so we need to wrap in a `try/catch`.\n\ttry {\n\t\tv[ toStringTag ] = void 0;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn toStr.call( v );\n\t}\n\tout = toStr.call( v );\n\n\tif ( isOwn ) {\n\t\tv[ toStringTag ] = tag;\n\t} else {\n\t\tdelete v[ toStringTag ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toStr from './tostring.js';\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification (via the internal property `[[Class]]`) of an object.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n*     return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\treturn toStr.call( v );\n}\n\n\n// EXPORTS //\n\nexport default nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar valueOf = String.prototype.valueOf; // non-generic\n\n\n// EXPORTS //\n\nexport default valueOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport test from './try2valueof.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string object\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns false\n*/\nfunction isString( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof String ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object String]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport valueOf from './valueof.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to extract a string value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a string can be extracted\n*/\nfunction test( value ) {\n\ttry {\n\t\tvalueOf.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a string\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*/\nfunction isString( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether an input value is the string representing column-major order.\n*\n* @param {*} v - value to test\n* @returns {boolean} boolean result\n*\n* @example\n* var bool = isColumnMajorString( 'column-major' );\n* // returns true\n*\n* bool = isColumnMajorString( 'row-major' );\n* // returns false\n*\n* bool = isColumnMajorString( 'foo' );\n* // returns false\n*/\nfunction isColumnMajorString( v ) {\n\treturn ( v === 'column-major' );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction rowmajor( shape ) {\n\tvar ndims;\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\tout = [];\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tout.push( 0 );\n\t}\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} array strides\n*/\nfunction columnmajor( shape ) {\n\tvar out;\n\tvar s;\n\tvar i;\n\n\tout = [];\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout.push( s );\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {Array} array strides\n*\n* @example\n* var s = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* s = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape );\n\t}\n\treturn rowmajor( shape );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a string.\n*\n* @module @stdlib/assert-is-string\n*\n* @example\n* import isString from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 5 );\n* // returns false\n*\n* @example\n* import { isObject as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 'beep' );\n* // returns false\n*\n* @example\n* import { isPrimitive as isString } from '@stdlib/assert-is-string';\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a stride array from an array shape.\n*\n* @module @stdlib/ndarray-base-shape2strides\n*\n* @example\n* import shape2strides from '@stdlib/ndarray-base-shape2strides';\n*\n* var strides = shape2strides( [ 3, 2 ], 'row-major' );\n* // returns [ 2, 1 ]\n*\n* strides = shape2strides( [ 3, 2 ], 'column-major' );\n* // returns [ 1, 3 ]\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport assign from './assign.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isColumnMajor from '@stdlib/ndarray-base-assert-is-column-major-string';\n\n\n// FUNCTIONS //\n\n/**\n* Generates a stride array from an array shape (row-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction rowmajor( shape, out ) {\n\tvar ndims;\n\tvar s;\n\tvar i;\n\n\tndims = shape.length;\n\ts = 1;\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n/**\n* Generates a stride array from an array shape (column-major).\n*\n* @private\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*/\nfunction columnmajor( shape, out ) {\n\tvar s;\n\tvar i;\n\n\ts = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tout[ i ] = s;\n\t\ts *= shape[ i ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates a stride array from an array shape.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @param {(Array|TypedArray|Object)} out - output object\n* @returns {(Array|TypedArray|Object)} array strides\n*\n* @example\n* var strides = [ 0, 0 ];\n*\n* var out = shape2strides( [ 3, 2 ], 'row-major', strides );\n* // returns [ 2, 1 ]\n*\n* var bool = ( out === strides );\n* // returns true\n*\n* out = shape2strides( [ 3, 2 ], 'column-major', strides );\n* // returns [ 1, 3 ]\n*/\nfunction shape2strides( shape, order, out ) {\n\tif ( isColumnMajor( order ) ) {\n\t\treturn columnmajor( shape, out );\n\t}\n\treturn rowmajor( shape, out );\n}\n\n\n// EXPORTS //\n\nexport default shape2strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport shape2strides from '@stdlib/ndarray-base-shape2strides';\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\n\n\n// MAIN //\n\n/**\n* Returns the strides of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `strides` property\n* @returns {IntegerArray} strides\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = strides( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 9, 3, 1 ]\n*/\nfunction strides( x, copy ) {\n\tvar ord;\n\tvar sh;\n\tvar st;\n\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\tsh = x.shape;\n\t\tif ( sh.length === 0 ) {\n\t\t\treturn [ 0 ];\n\t\t}\n\t\tord = x.order;\n\t\tif ( !isString( ord ) ) {\n\t\t\tord = ROW_MAJOR;\n\t\t}\n\t\treturn shape2strides( sh, ord );\n\t}\n\tif ( copy ) {\n\t\treturn copyIndexed( st );\n\t}\n\treturn st;\n}\n\n\n// EXPORTS //\n\nexport default strides;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// EXPORTS //\n\nexport default Number; // eslint-disable-line stdlib/require-globals\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Number.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Number from '@stdlib/number-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\nfunction isNumber( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Number ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Number]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a number\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( null );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport strides2offset from '@stdlib/ndarray-base-strides2offset';\n\n\n// MAIN //\n\n/**\n* Returns the index offset specifying the underlying buffer index of the first iterated ndarray element.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {NonNegativeInteger} index offset\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var n = offset( zeros( [ 3, 3, 3 ] ) );\n* // returns 0\n*/\nfunction offset( x ) {\n\tvar st;\n\tvar sh;\n\tvar o;\n\n\to = x.offset;\n\tif ( isNumber( o ) ) {\n\t\treturn o;\n\t}\n\tsh = x.shape;\n\tif ( sh.length === 0 ) {\n\t\treturn 0;\n\t}\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn 0;\n\t}\n\treturn strides2offset( sh, st );\n}\n\n\n// EXPORTS //\n\nexport default offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the index offset which specifies the location of the first indexed value in a multidimensional array based on a stride array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @returns {NonNegativeInteger} offset - offset\n*\n* @example\n* var shape = [ 2, 3, 10 ];\n* var strides = [ 30, -10, 1 ];\n*\n* var offset = strides2offset( shape, strides );\n* // returns 20\n*/\nfunction strides2offset( shape, strides ) {\n\tvar offset;\n\tvar ndims;\n\tvar i;\n\n\tndims = shape.length;\n\toffset = 0;\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( strides[ i ] < 0 ) {\n\t\t\t// Note that, since the stride is negative, this operation increments, not decrements, the offset...\n\t\t\toffset -= strides[ i ] * ( shape[ i ]-1 );\n\t\t}\n\t}\n\treturn offset;\n}\n\n\n// EXPORTS //\n\nexport default strides2offset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the absolute value of a double-precision floating-point number `x`.\n*\n* @param {number} x - input value\n* @returns {number} absolute value\n*\n* @example\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* @example\n* var v = abs( 2.0 );\n* // returns 2.0\n*\n* @example\n* var v = abs( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( -0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( NaN );\n* // returns NaN\n*/\nfunction abs( x ) {\n\treturn Math.abs( x ); // eslint-disable-line stdlib/no-builtin-math\n}\n\n\n// EXPORTS //\n\nexport default abs;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport abs from '@stdlib/math-base-special-abs';\n\n\n// MAIN //\n\n/**\n* Determines the order of a multidimensional array based on a provided stride array.\n*\n* @param {IntegerArray} strides - stride array\n* @returns {integer} order\n*\n* @example\n* var order = strides2order( [ 2, 1 ] );\n* // returns 1\n*\n* order = strides2order( [ 1, 2 ] );\n* // returns 2\n*\n* order = strides2order( [ 1, 1, 1 ] );\n* // returns 3\n*\n* order = strides2order( [ 2, 3, 1 ] );\n* // returns 0\n*/\nfunction strides2order( strides ) {\n\tvar column;\n\tvar ndims;\n\tvar row;\n\tvar s1;\n\tvar s2;\n\tvar i;\n\n\tndims = strides.length;\n\tif ( ndims === 0 ) {\n\t\treturn 0|0; // 'none'\n\t}\n\tcolumn = true;\n\trow = true;\n\n\ts1 = abs( strides[ 0 ] );\n\tfor ( i = 1; i < ndims; i++ ) {\n\t\ts2 = abs( strides[ i ] );\n\t\tif ( column && s2 < s1 ) {\n\t\t\tcolumn = false;\n\t\t} else if ( row && s2 > s1 ) {\n\t\t\trow = false;\n\t\t}\n\t\tif ( row || column ) {\n\t\t\ts1 = s2;\n\t\t} else {\n\t\t\treturn 0|0; // 'none'\n\t\t}\n\t}\n\tif ( row && column ) {\n\t\treturn 3|0; // 'both'\n\t}\n\tif ( row ) {\n\t\treturn 1|0; // 'row-major'\n\t}\n\treturn 2|0; // 'column-major'\n}\n\n\n// EXPORTS //\n\nexport default strides2order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a number.\n*\n* @module @stdlib/assert-is-number\n*\n* @example\n* import isNumber from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNumber } from '@stdlib/assert-is-number';\n*\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// VARIABLES //\n\nvar ROW_MAJOR = 'row-major';\nvar COLUMN_MAJOR = 'column-major';\n\n\n// MAIN //\n\n/**\n* Returns the layout order of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {(string|null)} layout order\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'order': 'row-major'\n* });\n*\n* var out = order( x );\n* // returns 'row-major'\n*/\nfunction order( x ) {\n\tvar st;\n\tvar o;\n\n\to = x.order;\n\tif ( isString( o ) ) {\n\t\treturn o;\n\t}\n\t// Try to infer the layout order from the strides array...\n\tst = x.strides;\n\tif ( typeof st !== 'object' || st === null ) {\n\t\treturn ROW_MAJOR; // WARNING: default to row-major for ndarray-like objects lacking strides. This may or may not be accurate, and we're defaulting to row-major here based on the belief that row-major is more likely given that, e.g., JavaScript arrays are similar to C arrays (i.e., stored in row-major order).\n\t}\n\to = strides2order( st );\n\tif ( o === 1 || o === 3 ) {\n\t\treturn ROW_MAJOR; // for o == 3 (both row- and column-major; e.g., one-dimensional ndarrays), default to row-major\n\t}\n\tif ( o === 2 ) {\n\t\treturn COLUMN_MAJOR;\n\t}\n\t// o === 0\n\tif ( x.shape.length === 0 ) {\n\t\treturn ROW_MAJOR; // default to row-major for zero-dimensional ndarrays\n\t}\n\t// Case: mixed strides (e.g., [ 2, 3, 1 ] )\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default order;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isAccessorArray from '@stdlib/array-base-assert-is-accessor-array';\nimport accessorGetter from '@stdlib/array-base-accessor-getter';\nimport accessorSetter from '@stdlib/array-base-accessor-setter';\nimport getter from '@stdlib/array-base-getter';\nimport setter from '@stdlib/array-base-setter';\nimport numel from '@stdlib/ndarray-base-numel';\nimport getDType from '@stdlib/ndarray-base-dtype';\nimport getShape from '@stdlib/ndarray-base-shape';\nimport getStrides from '@stdlib/ndarray-base-strides';\nimport getOffset from '@stdlib/ndarray-base-offset';\nimport getOrder from '@stdlib/ndarray-base-order';\nimport getData from '@stdlib/ndarray-base-data-buffer';\n\n\n// MAIN //\n\n/**\n* Converts an ndarray-like object to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* -   This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding ndarray meta data to ensure that internal functions operating on ndarrays are provided consistent argument \"shapes\".\n*\n* -   The returned object has the following properties:\n*\n*     -   **ref**: reference to the original ndarray-like object.\n*     -   **dtype**: underlying data type.\n*     -   **data**: data buffer.\n*     -   **length**: number of elements.\n*     -   **shape**: array dimensions.\n*     -   **strides**: array strides.\n*     -   **offset**: index offset.\n*     -   **order**: order.\n*     -   **accessorProtocol**: `boolean` indicating whether the data buffer supports the get/set protocol (i.e., uses accessors for getting and setting elements).\n*     -   **accessors**: a two-element array whose first element is an accessor for retrieving an ndarray element and whose second element is an accessor for setting an ndarray element.\n*\n* @param {ndarrayLike} x - ndarray-like object\n* @param {*} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @returns {Object} object containing ndarray meta data\n*\n* @example\n* import array from '@stdlib/ndarray-array';\n*\n* var x = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ] );\n*\n* var obj = ndarraylike2object( x );\n* // returns {...}\n*/\nfunction ndarraylike2object( x ) {\n\tvar xbuf;\n\tvar bool;\n\tvar sh;\n\tvar dt;\n\n\txbuf = getData( x );\n\tsh = getShape( x, true );\n\tdt = getDType( x );\n\n\tbool = isAccessorArray( xbuf );\n\n\treturn {\n\t\t'ref': x,\n\t\t'dtype': dt,\n\t\t'data': xbuf,\n\t\t'length': numel( sh ),\n\t\t'shape': sh,\n\t\t'strides': getStrides( x, true ),\n\t\t'offset': getOffset( x ),\n\t\t'order': getOrder( x ),\n\t\t'accessorProtocol': bool,\n\t\t'accessors': ( bool ) ?\n\t\t\t[ accessorGetter( dt ), accessorSetter( dt ) ] :\n\t\t\t[ getter( dt ), setter( dt ) ]\n\t};\n}\n\n\n// EXPORTS //\n\nexport default ndarraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the underlying data buffer of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {Collection} underlying data buffer\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'dtype': 'float64'\n* });\n*\n* var out = data( x );\n* // returns <Float64Array>\n*/\nfunction data( x ) {\n\treturn x.data;\n}\n\n\n// EXPORTS //\n\nexport default data;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport copyIndexed from '@stdlib/array-base-copy-indexed';\n\n\n// MAIN //\n\n/**\n* Returns the shape of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @param {boolean} copy - boolean indicating whether to explicitly copy the value assigned to the input ndarray's `shape` property\n* @returns {NonNegativeIntegerArray} shape\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var out = shape( zeros( [ 3, 3, 3 ] ), false );\n* // returns [ 3, 3, 3 ]\n*/\nfunction shape( x, copy ) {\n\tvar sh = x.shape;\n\tif ( copy ) {\n\t\treturn copyIndexed( sh );\n\t}\n\treturn sh;\n}\n\n\n// EXPORTS //\n\nexport default shape;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the data type of a provided ndarray.\n*\n* @param {ndarrayLike} x - input ndarray\n* @returns {string} data type\n*\n* @example\n* import zeros from '@stdlib/ndarray-zeros';\n*\n* var x = zeros( [ 3, 3, 3 ], {\n*     'dtype': 'float64'\n* });\n*\n* var dt = dtype( x );\n* // returns 'float64'\n*/\nfunction dtype( x ) {\n\treturn x.dtype;\n}\n\n\n// EXPORTS //\n\nexport default dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat64Array = ( typeof Float64Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float64Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float64Array\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var bool = isFloat64Array( new Float64Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat64Array( [] );\n* // returns false\n*/\nfunction isFloat64Array( value ) {\n\treturn (\n\t\t( hasFloat64Array && value instanceof Float64Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float64Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float64Array === 'function' ) ? Float64Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of double-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float64\n*\n* @example\n* import ctor from '@stdlib/array-float64';\n*\n* var arr = new ctor( 10 );\n* // returns <Float64Array>\n*/\n\n// MODULES //\n\nimport hasFloat64ArraySupport from '@stdlib/assert-has-float64array-support';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat64ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFloat64Array from '@stdlib/assert-is-float64array';\nimport GlobalFloat64Array from './float64array.js';\n\n\n// MAIN //\n\n/**\n* Tests for native `Float64Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float64Array` support\n*\n* @example\n* var bool = hasFloat64ArraySupport();\n* // returns <boolean>\n*/\nfunction hasFloat64ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat64Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat64Array( [ 1.0, 3.14, -3.14, NaN ] );\n\t\tbool = (\n\t\t\tisFloat64Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.14 &&\n\t\t\tarr[ 2 ] === -3.14 &&\n\t\t\tarr[ 3 ] !== arr[ 3 ]\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 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 <Float64Array>\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 nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasFloat32Array = ( typeof Float32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float32Array\n*\n* @example\n* import Float32Array from '@stdlib/array-float32';\n*\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat32Array( [] );\n* // returns false\n*/\nfunction isFloat32Array( value ) {\n\treturn (\n\t\t( hasFloat32Array && value instanceof Float32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* @module @stdlib/constants-float64-pinf\n* @type {number}\n*\n* @example\n* import FLOAT64_PINF from '@stdlib/constants-float64-pinf';\n* // returns Infinity\n*/\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point positive infinity has the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.POSITIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_PINF = Number.POSITIVE_INFINITY; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default FLOAT64_PINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float32Array === 'function' ) ? Float32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of single-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float32\n*\n* @example\n* import ctor from '@stdlib/array-float32';\n*\n* var arr = new ctor( 10 );\n* // returns <Float32Array>\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 <boolean>\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) 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 <Float32Array>\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 <Uint8Array>\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 <boolean>\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 f;\n\n\n// FUNCTIONS //\n\n/**\n* Tests if a value is an array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an array\n*\n* @example\n* var bool = isArray( [] );\n* // returns true\n*\n* @example\n* var bool = isArray( {} );\n* // returns false\n*/\nfunction isArray( value ) {\n\treturn ( nativeClass( value ) === '[object Array]' );\n}\n\n\n// MAIN //\n\nif ( Array.isArray ) {\n\tf = Array.isArray;\n} else {\n\tf = isArray;\n}\n\n\n// EXPORTS //\n\nexport default f;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* import isOdd from '@stdlib/assert-is-odd';\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default arrayfcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is object-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is object-like\n*\n* @example\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( [] );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( null );\n* // returns false\n*/\nfunction isObjectLike( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObjectLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Buffer instance.\n*\n* @param {*} value - value to validate\n* @returns {boolean} boolean indicating if a value is a Buffer instance\n*\n* @example\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( new Buffer( [1,2,3,4] ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( {} );\n* // returns false\n*\n* @example\n* var v = isBuffer( [] );\n* // returns false\n*/\nfunction isBuffer( value ) {\n\treturn (\n\t\tisObjectLike( value ) &&\n\t\t(\n\t\t\t// eslint-disable-next-line no-underscore-dangle\n\t\t\tvalue._isBuffer || // for envs missing Object.prototype.constructor (e.g., Safari 5-7)\n\t\t\t(\n\t\t\t\tvalue.constructor &&\n\n\t\t\t\t// WARNING: `typeof` is not a foolproof check, as certain envs consider RegExp and NodeList instances to be functions\n\t\t\t\ttypeof value.constructor.isBuffer === 'function' &&\n\t\t\t\tvalue.constructor.isBuffer( value )\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @returns {RegExp} regular expression\n*\n* @example\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n*     return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\nfunction reFunctionName() {\n\treturn /^\\s*function\\s*([^(]*)/i;\n}\n\n\n// EXPORTS //\n\nexport default reFunctionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is object-like.\n*\n* @module @stdlib/assert-is-object-like\n*\n* @example\n* import isObjectLike from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* bool = isObjectLike( [] );\n* // returns true\n*\n* bool = isObjectLike( null );\n* // returns false\n*\n* @example\n* import { isObjectLikeArray as isObjectLike } from '@stdlib/assert-is-object-like';\n*\n* var bool = isObjectLike( [ {}, [] ] );\n* // returns true\n*\n* bool = isObjectLike( [ {}, '3.0' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport main from './main.js';\n\n\n// VARIABLES //\n\nvar isObjectLikeArray = arrayfun( main );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isObjectLikeArray', isObjectLikeArray );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport reFunctionName from './main.js';\n\n\n// MAIN //\n\n/**\n* Captures everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* Regular expression: `/^\\s*function\\s*([^(]*)/i`\n*\n* -   `/^\\s*`\n*     -   Match zero or more spaces at beginning\n*\n* -   `function`\n*     -   Match the word `function`\n*\n* -   `\\s*`\n*     -   Match zero or more spaces after the word `function`\n*\n* -   `()`\n*     -   Capture\n*\n* -   `[^(]*`\n*     -   Match anything except a left parenthesis `(` zero or more times\n*\n* -   `/i`\n*     -   ignore case\n*\n* @constant\n* @type {RegExp}\n* @default /^\\s*function\\s*([^(]*)/i\n*/\nvar RE_FUNCTION_NAME = reFunctionName();\n\n\n// EXPORTS //\n\nexport default RE_FUNCTION_NAME;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport { REGEXP as RE } from '@stdlib/regexp-function-name';\nimport isBuffer from '@stdlib/assert-is-buffer';\n\n\n// MAIN //\n\n/**\n* Determines the name of a value's constructor.\n*\n* @param {*} v - input value\n* @returns {string} name of a value's constructor\n*\n* @example\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* @example\n* var v = constructorName( 5 );\n* // returns 'Number'\n*\n* @example\n* var v = constructorName( null );\n* // returns 'Null'\n*\n* @example\n* var v = constructorName( undefined );\n* // returns 'Undefined'\n*\n* @example\n* var v = constructorName( function noop() {} );\n* // returns 'Function'\n*/\nfunction constructorName( v ) {\n\tvar match;\n\tvar name;\n\tvar ctor;\n\tname = nativeClass( v ).slice( 8, -1 );\n\tif ( (name === 'Object' || name === 'Error') && v.constructor ) {\n\t\tctor = v.constructor;\n\t\tif ( typeof ctor.name === 'string' ) {\n\t\t\treturn ctor.name;\n\t\t}\n\t\tmatch = RE.exec( ctor.toString() );\n\t\tif ( match ) {\n\t\t\treturn match[ 1 ];\n\t\t}\n\t}\n\tif ( isBuffer( v ) ) {\n\t\treturn 'Buffer';\n\t}\n\treturn name;\n}\n\n\n// EXPORTS //\n\nexport default constructorName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @module @stdlib/regexp-function-name\n*\n* @example\n* import reFunctionName from '@stdlib/regexp-function-name';\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n*     return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport REGEXP from './regexp.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'REGEXP', REGEXP );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128',\n\t'BooleanArray': 'bool'\n};\n\n\n// EXPORTS //\n\nexport default ctor2dtypes;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint32Array = ( typeof Uint32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint32Array\n*\n* @example\n* import Uint32Array from '@stdlib/array-uint32';\n*\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint32Array( [] );\n* // returns false\n*/\nfunction isUint32Array( value ) {\n\treturn (\n\t\t( hasUint32Array && value instanceof Uint32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* @module @stdlib/constants-uint32-max\n* @type {uinteger32}\n*\n* @example\n* import UINT32_MAX from '@stdlib/constants-uint32-max';\n* // returns 4294967295\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar UINT32_MAX = 4294967295;\n\n\n// EXPORTS //\n\nexport default UINT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint32Array === 'function' ) ? Uint32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 32-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint32\n*\n* @example\n* import ctor from '@stdlib/array-uint32';\n*\n* var arr = new ctor( 10 );\n* // returns <Uint32Array>\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 <boolean>\n*/\nfunction hasUint32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT32_MAX+1, UINT32_MAX+2 ];\n\t\tarr = new GlobalUint32Array( arr );\n\t\tbool = (\n\t\t\tisUint32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&            // truncation\n\t\t\tarr[ 2 ] === UINT32_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 &&            // wrap around\n\t\t\tarr[ 4 ] === 1               // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt32Array = ( typeof Int32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int32Array\n*\n* @example\n* import Int32Array from '@stdlib/array-int32';\n*\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt32Array( [] );\n* // returns false\n*/\nfunction isInt32Array( value ) {\n\treturn (\n\t\t( hasInt32Array && value instanceof Int32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-max\n* @type {integer32}\n*\n* @example\n* import INT32_MAX from '@stdlib/constants-int32-max';\n* // returns 2147483647\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{31} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 2147483647\n*/\nvar INT32_MAX = 2147483647|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int32Array === 'function' ) ? Int32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int32\n*\n* @example\n* import ctor from '@stdlib/array-int32';\n*\n* var arr = new ctor( 10 );\n* // returns <Int32Array>\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 <boolean>\n*/\nfunction hasInt32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt32Array( [ 1, 3.14, -3.14, INT32_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&      // truncation\n\t\t\tarr[ 2 ] === -3 &&     // truncation\n\t\t\tarr[ 3 ] === INT32_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-min\n* @type {integer32}\n*\n* @example\n* import INT32_MIN from '@stdlib/constants-int32-min';\n* // returns -2147483648\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{31})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -2147483648\n*/\nvar INT32_MIN = -2147483648|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT32_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasUint16Array = ( typeof Uint16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint16Array\n*\n* @example\n* import Uint16Array from '@stdlib/array-uint16';\n*\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint16Array( [] );\n* // returns false\n*/\nfunction isUint16Array( value ) {\n\treturn (\n\t\t( hasUint16Array && value instanceof Uint16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* @module @stdlib/constants-uint16-max\n* @type {integer32}\n*\n* @example\n* import UINT16_MAX from '@stdlib/constants-uint16-max';\n* // returns 65535\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{16} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 1111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 65535\n*/\nvar UINT16_MAX = 65535|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default UINT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint16Array === 'function' ) ? Uint16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint16\n*\n* @example\n* import ctor from '@stdlib/array-uint16';\n*\n* var arr = new ctor( 10 );\n* // returns <Uint16Array>\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 <boolean>\n*/\nfunction hasUint16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT16_MAX+1, UINT16_MAX+2 ];\n\t\tarr = new GlobalUint16Array( arr );\n\t\tbool = (\n\t\t\tisUint16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&            // truncation\n\t\t\tarr[ 2 ] === UINT16_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 &&            // wrap around\n\t\t\tarr[ 4 ] === 1               // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt16Array = ( typeof Int16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int16Array\n*\n* @example\n* import Int16Array from '@stdlib/array-int16';\n*\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt16Array( [] );\n* // returns false\n*/\nfunction isInt16Array( value ) {\n\treturn (\n\t\t( hasInt16Array && value instanceof Int16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-max\n* @type {integer32}\n*\n* @example\n* import INT16_MAX from '@stdlib/constants-int16-max';\n* // returns 32767\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{15} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 32767\n*/\nvar INT16_MAX = 32767|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int16Array === 'function' ) ? Int16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int16\n*\n* @example\n* import ctor from '@stdlib/array-int16';\n*\n* var arr = new ctor( 10 );\n* // returns <Int16Array>\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 <boolean>\n*/\nfunction hasInt16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt16Array( [ 1, 3.14, -3.14, INT16_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&      // truncation\n\t\t\tarr[ 2 ] === -3 &&     // truncation\n\t\t\tarr[ 3 ] === INT16_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-min\n* @type {integer32}\n*\n* @example\n* import INT16_MIN from '@stdlib/constants-int16-min';\n* // returns -32768\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{15})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 1000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -32768\n*/\nvar INT16_MIN = -32768|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT16_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar 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 <Uint8ClampedArray>\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 <boolean>\n*/\nfunction hasUint8ClampedArraySupport() { // eslint-disable-line id-length\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8ClampedArray !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalUint8ClampedArray( [ -1, 0, 1, 3.14, 4.99, 255, 256 ] );\n\t\tbool = (\n\t\t\tisUint8ClampedArray( arr ) &&\n\t\t\tarr[ 0 ] === 0 &&   // clamped\n\t\t\tarr[ 1 ] === 0 &&\n\t\t\tarr[ 2 ] === 1 &&\n\t\t\tarr[ 3 ] === 3 &&   // round to nearest\n\t\t\tarr[ 4 ] === 5 &&   // round to nearest\n\t\t\tarr[ 5 ] === 255 &&\n\t\t\tarr[ 6 ] === 255    // clamped\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasInt8Array = ( typeof Int8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int8Array\n*\n* @example\n* import Int8Array from '@stdlib/array-int8';\n*\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt8Array( [] );\n* // returns false\n*/\nfunction isInt8Array( value ) {\n\treturn (\n\t\t( hasInt8Array && value instanceof Int8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-max\n* @type {integer32}\n*\n* @example\n* import INT8_MAX from '@stdlib/constants-int8-max';\n* // returns 127\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* 2^{7} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 127\n*/\nvar INT8_MAX = 127|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int8Array === 'function' ) ? Int8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int8\n*\n* @example\n* import ctor from '@stdlib/array-int8';\n*\n* var arr = new ctor( 10 );\n* // returns <Int8Array>\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 <boolean>\n*/\nfunction hasInt8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt8Array( [ 1, 3.14, -3.14, INT8_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 &&     // truncation\n\t\t\tarr[ 2 ] === -3 &&    // truncation\n\t\t\tarr[ 3 ] === INT8_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-min\n* @type {integer32}\n*\n* @example\n* import INT8_MIN from '@stdlib/constants-int8-min';\n* // returns -128\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* -(2^{7})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -128\n*/\nvar INT8_MIN = -128|0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default INT8_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nexport default polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* @module @stdlib/constants-float64-ninf\n* @type {number}\n*\n* @example\n* import FLOAT64_NINF from '@stdlib/constants-float64-ninf';\n* // returns -Infinity\n*/\n\n// MODULES //\n\nimport Number from '@stdlib/number-ctor';\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point negative infinity has the bit sequence\n*\n* ```binarystring\n* 1 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.NEGATIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_NINF = Number.NEGATIVE_INFINITY;\n\n\n// EXPORTS //\n\nexport default FLOAT64_NINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward negative infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* @example\n* var v = floor( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = floor( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = floor( NaN );\n* // returns NaN\n*/\nvar floor = Math.floor; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nexport default floor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport floor from '@stdlib/math-base-special-floor';\n\n\n// MAIN //\n\n/**\n* Tests if a finite double-precision floating-point number is an integer.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an integer\n*\n* @example\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( 3.14 );\n* // returns false\n*/\nfunction isInteger( x ) {\n\treturn (floor(x) === x);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport PINF from '@stdlib/constants-float64-pinf';\nimport NINF from '@stdlib/constants-float64-ninf';\nimport isInt from '@stdlib/math-base-assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a number primitive is an integer value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a number primitive is an integer value\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tvalue < PINF &&\n\t\tvalue > NINF &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having an integer value\n*\n* @example\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isInt from './integer.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having an integer value\n*\n* @example\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an integer\n*\n* @example\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isInteger( -3.14 );\n* // returns false\n*\n* @example\n* var bool = isInteger( null );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isInteger } from '@stdlib/assert-is-integer';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a nonnegative integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a nonnegative integer\n*\n* @example\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( null );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an integer.\n*\n* @module @stdlib/assert-is-integer\n*\n* @example\n* import isInteger from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isInteger( -3.14 );\n* // returns false\n*\n* bool = isInteger( null );\n* // returns false\n*\n* @example\n* // Use interface to check for integer primitives...\n* import { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*\n* @example\n* // Use interface to check for integer objects...\n* import { isObject as isInteger } from '@stdlib/assert-is-integer';\n*\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a nonnegative integer.\n*\n* @module @stdlib/assert-is-nonnegative-integer\n*\n* @example\n* import isNonNegativeInteger from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* bool = isNonNegativeInteger( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* import { isObject as isNonNegativeInteger } from '@stdlib/assert-is-nonnegative-integer';\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a generic array.\n*\n* @module @stdlib/constants-array-max-array-length\n*\n* @example\n* import MAX_ARRAY_LENGTH from '@stdlib/constants-array-max-array-length';\n* // returns 4294967295\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a generic array.\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar MAX_ARRAY_LENGTH = 4294967295>>>0; // asm type annotation\n\n\n// EXPORTS //\n\nexport default MAX_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is an array-like object\n*\n* @example\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( { 'length': 10 } );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\nfunction isArrayLikeObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayLikeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a typed array.\n*\n* @module @stdlib/constants-array-max-typed-array-length\n*\n* @example\n* import MAX_TYPED_ARRAY_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n* // returns 9007199254740991\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a typed array.\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n*/\nvar MAX_TYPED_ARRAY_LENGTH = 9007199254740991;\n\n\n// EXPORTS //\n\nexport default MAX_TYPED_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-array-max-typed-array-length';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a collection\n*\n* @example\n* var bool = isCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isCollection( {} );\n* // returns false\n*/\nfunction isCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isCollection;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar hasArrayBuffer = ( typeof ArrayBuffer === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an ArrayBuffer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an ArrayBuffer\n*\n* @example\n* import ArrayBuffer from '@stdlib/array-buffer';\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isArrayBuffer( [] );\n* // returns false\n*/\nfunction isArrayBuffer( value ) {\n\treturn (\n\t\t( hasArrayBuffer && value instanceof ArrayBuffer ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object ArrayBuffer]'\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArrayBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArray from '@stdlib/assert-is-array';\n\n\n// MAIN //\n\n/**\n* Tests if a value is an object; e.g., `{}`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an object\n*\n* @example\n* var bool = isObject( {} );\n* // returns true\n*\n* @example\n* var bool = isObject( null );\n* // returns false\n*/\nfunction isObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!isArray( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array of strings.\n*\n* @module @stdlib/assert-is-string-array\n*\n* @example\n* import isStringArray from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', 123 ] );\n* // returns false\n*\n* @example\n* import { primitives as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ 'abc', 'def' ] );\n* // returns true\n*\n* bool = isStringArray( [ 'abc', new String( 'def' ) ] );\n* // returns false\n*\n* @example\n* import { objects as isStringArray } from '@stdlib/assert-is-string-array';\n*\n* var bool = isStringArray( [ new String( 'abc' ), new String( 'def' ) ] );\n* // returns true\n*\n* bool = isStringArray( [ new String( 'abc' ), 'def' ] );\n* // returns false\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport arrayfun from '@stdlib/assert-tools-array-function';\nimport isString from '@stdlib/assert-is-string';\n\n\n// VARIABLES //\n\nvar isPrimitiveArray = arrayfun( isString.isPrimitive );\nvar isObjectArray = arrayfun( isString.isObject );\n\n\n// MAIN //\n\nvar isStringArray = arrayfun( isString );\nsetReadOnly( isStringArray, 'primitives', isPrimitiveArray );\nsetReadOnly( isStringArray, 'objects', isObjectArray );\n\n\n// EXPORTS //\n\nexport default isStringArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar RE = /./;\n\n\n// EXPORTS //\n\nexport default RE;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a boolean primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean primitive\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns false\n*/\nfunction isBoolean( value ) {\n\treturn ( typeof value === 'boolean' );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns <Boolean>\n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Boolean.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasToStringTag from '@stdlib/assert-has-tostringtag-support';\nimport nativeClass from '@stdlib/utils-native-class';\nimport Boolean from '@stdlib/boolean-ctor';\nimport test from './try2serialize.js';\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean object\n*\n* @example\n* var bool = isBoolean( true );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Boolean ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Boolean]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a boolean\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a boolean.\n*\n* @module @stdlib/assert-is-boolean\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import isBoolean from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( true ) );\n* // returns false\n*\n* @example\n* import Boolean from '@stdlib/boolean-ctor';\n* import { isObject as isBoolean } from '@stdlib/assert-is-boolean';\n*\n* var bool = isBoolean( true );\n* // returns false\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof self === 'object' ) ? self : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof window === 'object' ) ? window : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof global === 'object' ) ? global : null;\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof globalThis === 'object' ) ? globalThis : null; // eslint-disable-line no-undef\n\n\n// EXPORTS //\n\nexport default obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport getGlobal from '@stdlib/utils-global';\n\n\n// MAIN //\n\nvar root = getGlobal();\nvar nodeList = root.document && root.document.childNodes;\n\n\n// EXPORTS //\n\nexport default nodeList;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isBoolean } from '@stdlib/assert-is-boolean';\nimport format from '@stdlib/string-format';\nimport getThis from './codegen.js';\nimport Self from './self.js';\nimport Win from './window.js';\nimport Global from './global.js';\nimport GlobalThis from './global_this.js';\n\n\n// MAIN //\n\n/**\n* Returns the global object.\n*\n* ## Notes\n*\n* -   Using code generation is the **most** reliable way to resolve the global object; however, doing so is likely to violate content security policies (CSPs) in, e.g., Chrome Apps and elsewhere.\n*\n* @param {boolean} [codegen=false] - boolean indicating whether to use code generation to resolve the global object\n* @throws {TypeError} must provide a boolean\n* @throws {Error} unable to resolve global object\n* @returns {Object} global object\n*\n* @example\n* var g = getGlobal();\n* // returns {...}\n*/\nfunction getGlobal( codegen ) {\n\tif ( arguments.length ) {\n\t\tif ( !isBoolean( codegen ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a boolean. Value: `%s`.', codegen ) );\n\t\t}\n\t\tif ( codegen ) {\n\t\t\treturn getThis();\n\t\t}\n\t\t// Fall through...\n\t}\n\t// Case: 2020 revision of ECMAScript standard\n\tif ( GlobalThis ) {\n\t\treturn GlobalThis;\n\t}\n\t// Case: browsers and web workers\n\tif ( Self ) {\n\t\treturn Self;\n\t}\n\t// Case: browsers\n\tif ( Win ) {\n\t\treturn Win;\n\t}\n\t// Case: Node.js\n\tif ( Global ) {\n\t\treturn Global;\n\t}\n\t// Case: unknown\n\tthrow new Error( 'unexpected error. Unable to resolve global object.' );\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the global object using code generation.\n*\n* @private\n* @returns {Object} global object\n*/\nfunction getGlobal() {\n\treturn new Function( 'return this;' )(); // eslint-disable-line no-new-func, stdlib/require-globals\n}\n\n\n// EXPORTS //\n\nexport default getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default typedarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* import typeOf from '@stdlib/utils-type-of';\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nimport usePolyfill from './check.js';\nimport builtin from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport RE from './fixtures/re.js';\nimport nodeList from './fixtures/nodelist.js';\nimport typedarray from './fixtures/typedarray.js';\n\n\n// MAIN //\n\n/**\n* Checks whether a polyfill is needed when using the `typeof` operator.\n*\n* @private\n* @returns {boolean} boolean indicating whether a polyfill is needed\n*/\nfunction check() {\n\tif (\n\t\t// Chrome 1-12 returns 'function' for regular expression instances (see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof):\n\t\ttypeof RE === 'function' ||\n\n\t\t// Safari 8 returns 'object' for typed array and weak map constructors (underscore #1929):\n\t\ttypeof typedarray === 'object' ||\n\n\t\t// PhantomJS 1.9 returns 'function' for `NodeList` instances (underscore #2236):\n\t\ttypeof nodeList === 'function'\n\t) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport ctorName from '@stdlib/utils-constructor-name';\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nexport default typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport typeOf from '@stdlib/utils-type-of';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a function.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a function\n*\n* @example\n* function beep() {\n*     return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\nfunction isFunction( value ) {\n\t// Note: cannot use `typeof` directly, as various browser engines incorrectly return `'function'` when operating on non-function objects, such as regular expressions and NodeLists.\n\treturn ( typeOf( value ) === 'function' );\n}\n\n\n// EXPORTS //\n\nexport default isFunction;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport setEnumerableReadOnly from '@stdlib/utils-define-read-only-property';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport format from '@stdlib/string-format';\nimport toStr from './tostring.js';\nimport toJSON from './tojson.js';\n\n\n// MAIN //\n\n/**\n* 128-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex128} 128-bit complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n* // returns <Complex128>\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 <Complex64>\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// 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 <boolean>\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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasIteratorSymbolSupport from '@stdlib/assert-has-iterator-symbol-support';\n\n\n// MAIN //\n\n/**\n* Iterator symbol.\n*\n* @name IteratorSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* function iterator() {\n*     var it;\n*     var i;\n*\n*     i = -1;\n*\n*     it = {};\n*     it.next = next;\n*     it.return = done;\n*\n*     if ( IteratorSymbol ) {\n*         it[ IteratorSymbol ] = iterator;\n*     }\n*     return it;\n*\n*     function next() {\n*         i += 1;\n*         return {\n*             'value': i,\n*             'done': false\n*         };\n*     }\n*\n*     function done( value ) {\n*         if ( arguments.length === 0 ) {\n*             return {\n*                 'done': true\n*             };\n*         }\n*         return {\n*             'value': value,\n*             'done': true\n*         };\n*     }\n* }\n*\n* var obj = iterator();\n*/\nvar IteratorSymbol = ( hasIteratorSymbolSupport() ) ? Symbol.iterator : null;\n\n\n// EXPORTS //\n\nexport default IteratorSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport defineProperty from '@stdlib/utils-define-property';\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - accessor\n*\n* @example\n* function getter() {\n*     return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n*     obj.foo = 'boop';\n* } catch ( err ) {\n*     console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnlyAccessor( obj, prop, getter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nexport default setNonEnumerableReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nexport default real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* import Complex64 from '@stdlib/complex-float32-ctor';\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nexport default imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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 <Complex64Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64Array>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <ArrayBuffer>\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, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex64> ]\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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<string>)} [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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64>\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 <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\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 <Complex128Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128Array>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <ArrayBuffer>\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, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex128> ]\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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<string>)} [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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128>\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 <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\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 <BooleanArray>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new BooleanArray( 2 );\n* // returns <BooleanArray>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new BooleanArray( [ true, false ] );\n* // returns <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <ArrayBuffer>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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<string>)} [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 <BooleanArray>\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 <BooleanArray>\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 <BooleanArray>\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) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 M = 5;\n\n\n// MAIN //\n\n/**\n* Multiplies `x` by a scalar `alpha`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array<Function>} x.accessors - array element accessors\n* @param {integer} stride - index increment\n* @param {NonNegativeInteger} offset - starting index\n* @returns {NumericArray} 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 = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gscal( 3, 5.0, arraylike2object( toAccessorArray( x ) ), 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, -20.0, 25.0, -30.0 ]\n*/\nfunction gscal( N, alpha, x, stride, offset ) {\n\tvar xbuf;\n\tvar xget;\n\tvar xset;\n\tvar ix;\n\tvar m;\n\tvar i;\n\n\txbuf = x.data;\n\txget = x.accessors[ 0 ];\n\txset = x.accessors[ 1 ];\n\n\tix = offset;\n\tif ( stride === 0 ) {\n\t\txset( xbuf, ix, xget( xbuf, ix ) * N * alpha );\n\t\treturn x;\n\t}\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( stride === 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\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\t\t\tix += stride;\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\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\t\txset( xbuf, ix+1, xget( xbuf, ix+1 ) * alpha );\n\t\t\txset( xbuf, ix+2, xget( xbuf, ix+2 ) * alpha );\n\t\t\txset( xbuf, ix+3, xget( xbuf, ix+3 ) * alpha );\n\t\t\txset( xbuf, ix+4, xget( xbuf, ix+4 ) * alpha );\n\t\t\tix += M;\n\t\t}\n\t\treturn x;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\txset( xbuf, ix, xget( xbuf, ix ) * alpha );\n\t\tix += stride;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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 = 5;\n\n\n// MAIN //\n\n/**\n* Multiplies a vector by a scalar constant using alternative indexing semantics.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @returns {NumericArray} input array\n*\n* @example\n* var x = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ];\n*\n* gscal( 3, 5.0, x, 1, x.length-3 );\n* // x => [ 1.0, -2.0, 3.0, -20.0, 25.0, -30.0 ]\n*/\nfunction gscal( N, alpha, x, stride, offset ) {\n\tvar ix;\n\tvar m;\n\tvar o;\n\tvar i;\n\n\tif ( N <= 0 || alpha === 1.0 ) {\n\t\treturn x;\n\t}\n\to = arraylike2object( x );\n\tif ( o.accessorProtocol ) {\n\t\taccessors( N, alpha, o, stride, offset );\n\t\treturn x;\n\t}\n\n\tix = offset;\n\tif ( stride === 0 ) {\n\t\tx[ ix ] *= alpha * N;\n\t\treturn x;\n\t}\n\n\t// Use loop unrolling if the stride is equal to `1`...\n\tif ( stride === 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 += stride;\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\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 += stride;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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* Multiplies a vector by a scalar constant.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - scalar constant\n* @param {NumericArray} x - input array\n* @param {PositiveInteger} stride -  stride length\n* @returns {NumericArray} 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* gscal( x.length, 5.0, x, 1 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.0 ]\n*/\nfunction gscal( N, alpha, x, stride ) {\n\treturn ndarray( N, alpha, x, stride, stride2offset( N, stride ) );\n}\n\n\n// EXPORTS //\n\nexport default gscal;\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) 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<number>} 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 <Complex128Array>\n*\n* var data = reinterpret128( out, 0 );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns <Complex128Array>\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns <Float64Array>[ 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// 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 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 object has the following properties:\n*\n*     -   **sh**: dimensions sorted in loop order.\n*     -   **sx**: ndarray strides sorted in loop order.\n*     -   **idx**: dimension indices sorted in loop order.\n*\n* @param {NonNegativeIntegerArray} sh - array dimensions\n* @param {IntegerArray} sx - 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*\n* var o = loopOrder( sh, sx );\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 idx = o.idx;\n* // returns [ 2, 1, 0 ]\n*/\nfunction loopOrder( sh, sx ) {\n\tvar idx;\n\n\t// Initialize a loop interchange index array for generating a loop order permutation:\n\tidx = zeroTo( sh.length );\n\n\t// Sort the array strides in increasing order (of magnitude):\n\tsx = copy( sx );\n\tsort2ins( sx, idx );\n\n\t// Permute the shape based on the sorted array strides:\n\tsh = take( sh, idx );\n\n\treturn {\n\t\t'sh': sh,\n\t\t'sx': sx,\n\t\t'idx': idx\n\t};\n}\n\n\n// EXPORTS //\n\nexport default loopOrder;\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* 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) 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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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) 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* Multiply a vector by a scalar constant.\n*\n* @module @stdlib/blas-base-gscal\n*\n* @example\n* import gscal from '@stdlib/blas-base-gscal';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gscal( x.length, 5.0, x, 1 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.0 ]\n*\n* @example\n* import gscal from '@stdlib/blas-base-gscal';\n*\n* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];\n*\n* gscal.ndarray( x.length, 5.0, x, 1, 0 );\n* // x => [ -10.0, 5.0, 15.0, -25.0, 20.0, 0.0, -5.0, -15.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/**\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\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 <boolean>\n*/\nfunction detect() {\n\treturn isArguments( arguments );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn ( nativeClass( value ) === '[object Arguments]' );\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is `NaN`.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 7.0 );\n* // returns false\n*/\nfunction isnan( x ) {\n\treturn ( x !== x );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `NaN` number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `NaN` number primitive\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isObject as isNumber } from '@stdlib/assert-is-number';\nimport isNan from '@stdlib/math-base-assert-is-nan';\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a value of `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a value of `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\n/**\n* Tests if a value is `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( null );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nexport default isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is `NaN`.\n*\n* @module @stdlib/assert-is-nan\n*\n* @example\n* import isnan from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( null );\n* // returns false\n*\n* @example\n* import { isPrimitive as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns false\n*\n* @example\n* import { isObject as isnan } from '@stdlib/assert-is-nan';\n*\n* var bool = isnan( NaN );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*/\n\n// MODULES //\n\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport main from './main.js';\nimport isPrimitive from './primitive.js';\nimport isObject from './object.js';\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nexport default main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @private\n* @name isEnumerableProperty\n* @type {Function}\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty.call( beep, 'hasOwnProperty' );\n* // returns false\n*/\nvar isEnumerableProperty = Object.prototype.propertyIsEnumerable;\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnum from './native.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment has a bug where String indices are not detected as \"enumerable\" properties. Observed in Node v0.10.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment has the bug\n*/\nfunction detect() {\n\treturn !isEnum.call( 'beep', '0' );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isString from '@stdlib/assert-is-string';\nimport { isPrimitive as isnan } from '@stdlib/assert-is-nan';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport isEnum from './native.js';\nimport hasStringEnumBug from './has_string_enumerability_bug.js';\n\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n*     'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nfunction isEnumerableProperty( value, property ) {\n\tvar bool;\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\tbool = isEnum.call( value, property );\n\tif ( !bool && hasStringEnumBug && isString( value ) ) {\n\t\t// Note: we only check for indices, as properties attached to a `String` object are properly detected as enumerable above.\n\t\tproperty = +property;\n\t\treturn (\n\t\t\t!isnan( property ) &&\n\t\t\tisInteger( property ) &&\n\t\t\tproperty >= 0 &&\n\t\t\tproperty < value.length\n\t\t);\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nexport default isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an `arguments` object.\n*\n* @module @stdlib/assert-is-arguments\n*\n* @example\n* import isArguments from '@stdlib/assert-is-arguments';\n*\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* bool = isArguments( [] );\n* // returns false\n*/\n\n// MODULES //\n\nimport hasArgumentsClass from './detect.js';\nimport main from './main.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar isArguments;\nif ( hasArgumentsClass ) {\n\tisArguments = main;\n} else {\n\tisArguments = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport isArray from '@stdlib/assert-is-array';\nimport isInteger from '@stdlib/math-base-assert-is-integer';\nimport MAX_LENGTH from '@stdlib/constants-uint32-max';\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n*     return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!isArray( value ) &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH &&\n\t\thasOwnProp( value, 'callee' ) &&\n\t\t!isEnumerableProperty( value, 'callee' )\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isArguments from '@stdlib/assert-is-arguments';\nimport builtin from './builtin.js';\n\n\n// VARIABLES //\n\nvar slice = Array.prototype.slice;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tif ( isArguments( value ) ) {\n\t\treturn builtin( slice.call( value ) );\n\t}\n\treturn builtin( value );\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\nimport noop from '@stdlib/utils-noop';\n\n\n// MAIN //\n\n// Note: certain environments treat an object's prototype as enumerable, which, as a matter of convention, it shouldn't be...\nvar bool = isEnumerableProperty( noop, 'prototype' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @example\n* noop();\n* // ...does nothing.\n*/\nfunction noop() {\n\t// Empty function...\n}\n\n\n// EXPORTS //\n\nexport default noop;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isEnumerableProperty from '@stdlib/assert-is-enumerable-property';\n\n\n// VARIABLES //\n\nvar obj = {\n\t'toString': null\n};\n\n\n// MAIN //\n\n// Note: certain environments don't allow enumeration of overwritten properties which are considered non-enumerable...\nvar bool = !isEnumerableProperty( obj, 'toString' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isnan from '@stdlib/assert-is-nan';\nimport isCollection from '@stdlib/assert-is-collection';\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport { isPrimitive as isInteger } from '@stdlib/assert-is-integer';\nimport format from '@stdlib/string-format';\n\n\n// MAIN //\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @param {ArrayLike} arr - array-like object\n* @param {*} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (if negative, the start index is determined relative to last element)\n* @throws {TypeError} must provide an array-like object\n* @throws {TypeError} third argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 5 );\n* // returns -1\n*\n* @example\n* // Using a `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* @example\n* // `fromIndex` which exceeds `array` length:\n* var arr = [ 1, 2, 3, 4, 2, 5 ];\n* var idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* @example\n* // Negative `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* var idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* @example\n* // Negative `fromIndex` exceeding input `array` length:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* @example\n* // Array-like objects:\n* var str = 'bebop';\n* var idx = indexOf( str, 'o' );\n* // returns 3\n*/\nfunction indexOf( arr, searchElement, fromIndex ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( arr ) && !isString( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', arr ) );\n\t}\n\tlen = arr.length;\n\tif ( len === 0 ) {\n\t\treturn -1;\n\t}\n\tif ( arguments.length === 3 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= 0 ) {\n\t\t\tif ( fromIndex >= len ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ti = fromIndex;\n\t\t} else {\n\t\t\ti = len + fromIndex;\n\t\t\tif ( i < 0 ) {\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\ti = 0;\n\t}\n\t// Check for `NaN`...\n\tif ( isnan( searchElement ) ) {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( isnan( arr[i] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( arr[ i ] === searchElement ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// EXPORTS //\n\nexport default indexOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether a value equals the prototype of its constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction isConstructorPrototype( value ) {\n\treturn ( value.constructor && value.constructor.prototype === value );\n}\n\n\n// EXPORTS //\n\nexport default isConstructorPrototype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar w = ( typeof window === 'undefined' ) ? void 0 : window;\n\n\n// EXPORTS //\n\nexport default w;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport indexOf from '@stdlib/utils-index-of';\nimport typeOf from '@stdlib/utils-type-of';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport EXCLUDED_KEYS from './excluded_keys.json';\nimport win from './window.js';\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Determines whether an environment throws when comparing to the prototype of a value's constructor (e.g., [IE9][1]).\n*\n* [1]: https://stackoverflow.com/questions/7688070/why-is-comparing-the-constructor-property-of-two-windows-unreliable\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment is buggy\n*/\nfunction check() {\n\tvar k;\n\tif ( typeOf( win ) === 'undefined' ) {\n\t\treturn false;\n\t}\n\tfor ( k in win ) { // eslint-disable-line guard-for-in\n\t\ttry {\n\t\t\tif (\n\t\t\t\tindexOf( EXCLUDED_KEYS, k ) === -1 &&\n\t\t\t\thasOwnProp( win, k ) &&\n\t\t\t\twin[ k ] !== null &&\n\t\t\t\ttypeOf( win[ k ] ) === 'object'\n\t\t\t) {\n\t\t\t\tisConstructorPrototype( win[ k ] );\n\t\t\t}\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\nbool = check();\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof window !== 'undefined' );\n\n\n// EXPORTS //\n\nexport default bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasArgumentsBug from './has_arguments_bug.js';\nimport HAS_BUILTIN from './has_builtin.js';\nimport builtin from './builtin.js';\nimport wrapper from './builtin_wrapper.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @name keys\n* @type {Function}\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nvar keys;\nif ( HAS_BUILTIN ) {\n\tif ( hasArgumentsBug() ) {\n\t\tkeys = wrapper;\n\t} else {\n\t\tkeys = builtin;\n\t}\n} else {\n\tkeys = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport keys from './builtin.js';\n\n\n// FUNCTIONS //\n\n/**\n* Tests the built-in `Object.keys()` implementation when provided `arguments`.\n*\n* @private\n* @returns {boolean} boolean indicating whether the built-in implementation returns the expected number of keys\n*/\nfunction test() {\n\treturn ( keys( arguments ) || '' ).length !== 2;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether the built-in `Object.keys()` implementation supports providing `arguments` as an input value.\n*\n* ## Notes\n*\n* -   Safari 5.0 does **not** support `arguments` as an input value.\n*\n* @private\n* @returns {boolean} boolean indicating whether a built-in implementation supports `arguments`\n*/\nfunction check() {\n\treturn test( 1, 2 );\n}\n\n\n// EXPORTS //\n\nexport default check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObjectLike from '@stdlib/assert-is-object-like';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport isArguments from '@stdlib/assert-is-arguments';\nimport HAS_ENUM_PROTO_BUG from './has_enumerable_prototype_bug.js';\nimport HAS_NON_ENUM_PROPS_BUG from './has_non_enumerable_properties_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype_wrapper.js';\nimport NON_ENUMERABLE from './non_enumerable.json';\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n*     'beep': 'boop',\n*     'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tvar skipConstructor;\n\tvar skipPrototype;\n\tvar isFcn;\n\tvar out;\n\tvar k;\n\tvar p;\n\tvar i;\n\n\tout = [];\n\tif ( isArguments( value ) ) {\n\t\t// Account for environments which treat `arguments` differently...\n\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\tout.push( i.toString() );\n\t\t}\n\t\t// Note: yes, we are precluding the `arguments` array-like object from having other enumerable properties; however, this should (1) be very rare and (2) not be encouraged (e.g., doing something like `arguments.a = 'b'`; in certain engines directly manipulating the `arguments` value results in automatic de-optimization).\n\t\treturn out;\n\t}\n\tif ( typeof value === 'string' ) {\n\t\t// Account for environments which do not treat string character indices as \"own\" properties...\n\t\tif ( value.length > 0 && !hasOwnProp( value, '0' ) ) {\n\t\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\t\tout.push( i.toString() );\n\t\t\t}\n\t\t}\n\t} else {\n\t\tisFcn = ( typeof value === 'function' );\n\t\tif ( isFcn === false && !isObjectLike( value ) ) {\n\t\t\treturn out;\n\t\t}\n\t\tskipPrototype = ( HAS_ENUM_PROTO_BUG && isFcn );\n\t}\n\tfor ( k in value ) {\n\t\tif ( !( skipPrototype && k === 'prototype' ) && hasOwnProp( value, k ) ) {\n\t\t\tout.push( String( k ) );\n\t\t}\n\t}\n\tif ( HAS_NON_ENUM_PROPS_BUG ) {\n\t\tskipConstructor = isConstructorPrototype( value );\n\t\tfor ( i = 0; i < NON_ENUMERABLE.length; i++ ) {\n\t\t\tp = NON_ENUMERABLE[ i ];\n\t\t\tif ( !( skipConstructor && p === 'constructor' ) && hasOwnProp( value, p ) ) {\n\t\t\t\tout.push( String( p ) );\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nexport default keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport hasAutomationEqualityBug from './has_automation_equality_bug.js';\nimport isConstructorPrototype from './is_constructor_prototype.js';\nimport HAS_WINDOW from './has_window.js';\n\n\n// MAIN //\n\n/**\n* Wraps the test for constructor prototype equality to accommodate buggy environments (e.g., environments which throw when testing equality).\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction wrapper( value ) {\n\tif ( HAS_WINDOW === false && !hasAutomationEqualityBug ) {\n\t\treturn isConstructorPrototype( value );\n\t}\n\ttry {\n\t\treturn isConstructorPrototype( value );\n\t} catch ( error ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nexport default wrapper;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isFunction from '@stdlib/assert-is-function';\nimport builtin from './native.js';\nimport polyfill from './polyfill.js';\n\n\n// MAIN //\n\nvar getProto;\nif ( isFunction( Object.getPrototypeOf ) ) {\n\tgetProto = builtin;\n} else {\n\tgetProto = polyfill;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object.\n*\n* @name Object\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {Object} object\n*\n* @example\n* var o = new Object( null );\n* // returns {}\n*\n* @example\n* var o = new Object( 5.0 );\n* // returns <Number>\n*\n* @example\n* var o = new Object( 'beep' );\n* // returns <String>\n*\n* @example\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\nvar Obj = Object; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nexport default Obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar getProto = Object.getPrototypeOf;\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport nativeClass from '@stdlib/utils-native-class';\nimport Object from '@stdlib/object-ctor';\nimport getProto from './proto.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {(Object|null)} prototype\n*/\nfunction getPrototypeOf( obj ) {\n\tvar proto = getProto( obj );\n\tif ( proto || proto === null ) {\n\t\treturn proto;\n\t}\n\tif ( nativeClass( obj.constructor ) === '[object Function]' ) {\n\t\t// May break if the constructor has been tampered with...\n\t\treturn obj.constructor.prototype;\n\t}\n\tif ( obj instanceof Object ) {\n\t\treturn Object.prototype;\n\t}\n\t// Return `null` for objects created via `Object.create( null )`. Also return `null` for cross-realm objects on browsers that lack `__proto__` support, such as IE < 11.\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the value of the `__proto__` property.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {*} value of `__proto__` property\n*/\nfunction getProto( obj ) {\n\t// eslint-disable-next-line no-proto\n\treturn obj.__proto__;\n}\n\n\n// EXPORTS //\n\nexport default getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isObject from '@stdlib/assert-is-object';\nimport isFunction from '@stdlib/assert-is-function';\nimport getPrototypeOf from '@stdlib/utils-get-prototype-of';\nimport hasOwnProp from '@stdlib/assert-has-own-property';\nimport nativeClass from '@stdlib/utils-native-class';\n\n\n// VARIABLES //\n\nvar objectPrototype = Object.prototype;\n\n\n// FUNCTIONS //\n\n/**\n* Tests that an object only has own properties.\n*\n* @private\n* @param {Object} obj - value to test\n* @returns {boolean} boolean indicating if an object only has own properties\n*/\nfunction ownProps( obj ) {\n\tvar key;\n\n\t// NOTE: possibility of perf boost if key enumeration order is known (see http://stackoverflow.com/questions/18531624/isplainobject-thing).\n\tfor ( key in obj ) {\n\t\tif ( !hasOwnProp( obj, key ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if a value is a plain object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a plain object\n*\n* @example\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* @example\n* var bool = isPlainObject( null );\n* // returns false\n*/\nfunction isPlainObject( value ) {\n\tvar proto;\n\n\t// Screen for obvious non-objects...\n\tif ( !isObject( value ) ) {\n\t\treturn false;\n\t}\n\t// Objects with no prototype (e.g., `Object.create( null )`) are plain...\n\tproto = getPrototypeOf( value );\n\tif ( !proto ) {\n\t\treturn true;\n\t}\n\t// Objects having a prototype are plain if and only if they are constructed with a global `Object` function and the prototype points to the prototype of a plain object...\n\treturn (\n\t\t// Cannot have own `constructor` property:\n\t\t!hasOwnProp( value, 'constructor' ) &&\n\n\t\t// Prototype `constructor` property must be a function (see also https://bugs.jquery.com/ticket/9897 and http://stackoverflow.com/questions/18531624/isplainobject-thing):\n\t\thasOwnProp( proto, 'constructor' ) &&\n\t\tisFunction( proto.constructor ) &&\n\t\tnativeClass( proto.constructor ) === '[object Function]' &&\n\n\t\t// Test for object-specific method:\n\t\thasOwnProp( proto, 'isPrototypeOf' ) &&\n\t\tisFunction( proto.isPrototypeOf ) &&\n\n\t\t(\n\t\t\t// Test if the prototype matches the global `Object` prototype (same realm):\n\t\t\tproto === objectPrototype ||\n\n\t\t\t// Test that all properties are own properties (cross-realm; *most* likely a plain object):\n\t\t\townProps( value )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nexport default isPlainObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport Object from '@stdlib/object-ctor';\nimport getProto from './detect.js';\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @param {*} value - input value\n* @returns {(Object|null)} prototype\n*\n* @example\n* var proto = getPrototypeOf( {} );\n* // returns {}\n*/\nfunction getPrototypeOf( value ) {\n\tif (\n\t\tvalue === null ||\n\t\tvalue === void 0\n\t) {\n\t\treturn null;\n\t}\n\t// In order to ensure consistent ES5/ES6 behavior, cast input value to an object (strings, numbers, booleans); ES5 `Object.getPrototypeOf` throws when provided primitives and ES6 `Object.getPrototypeOf` casts:\n\tvalue = Object( value );\n\n\treturn getProto( value );\n}\n\n\n// EXPORTS //\n\nexport default getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport { isPrimitive as isString } from '@stdlib/assert-is-string';\nimport objectInverse from '@stdlib/object-inverse';\nimport dtypeEnums from '@stdlib/ndarray-base-dtype-enums';\n\n\n// VARIABLES //\n\nvar hash = objectInverse( dtypeEnums(), {\n\t'duplicates': false\n});\n\n\n// MAIN //\n\n/**\n* Returns the data type string associated with an ndarray data type enumeration constant.\n*\n* @param {integer} dtype - data type enumeration constant\n* @returns {(string|null)} data type string or null\n*\n* @example\n* import str2enum from '@stdlib/ndarray-base-dtype-str2enum';\n*\n* var v = str2enum( 'float64' );\n* // returns <number>\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 <Function>\n*\n* var nbytes = bytesPerElement( Struct );\n* // returns 8\n*/\nfunction bytesPerElement( dtype ) {\n\tvar v;\n\tif ( isString( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ dtype ] || null;\n\t}\n\tif ( isNumber( dtype ) ) {\n\t\treturn BYTES_PER_ELEMENT[ enum2str( dtype ) ] || null;\n\t}\n\tif ( dtype ) {\n\t\tv = dtype.byteLength;\n\t\tif ( isPositiveInteger( v ) ) {\n\t\t\treturn v;\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nexport default bytesPerElement;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2026 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar defaults = {\n\t// Define a default block size (in bytes):\n\t'BLOCK_SIZE_IN_BYTES': 64|0, // 64b is a common cache line size. How applicable the common cache line size is here is debatable, given that, depending on the associated stride(s), the innermost loop may not iterate over adjacent elements. The primary goal is to have a block size in which all data within a block can always fit in (L1) cache, regardless of cache size (i.e., cache-oblivious). For reference, a common L1 cache size is 32kB per core. For best performance, block sizes should be tuned based on system hardware; however, such tuning is not readily available to us here. Without obvious better alternatives, 64b has some theoretical (and practical) underpinning, and it should be good enough for most inputs, especially for ndarrays with near contiguity.\n\n\t// Define a default block size (in elements):\n\t'BLOCK_SIZE_IN_ELEMENTS': 8|0 // 64 bytes / 8 bytes per element (i.e., default element size is same as a double)\n};\n\n\n// EXPORTS //\n\nexport default defaults;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport blockSize from '@stdlib/ndarray-base-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Returns a loop block size for multi-dimensional array tiled loops.\n*\n* @param {*} dtypeX - array data type\n* @returns {integer} block size (in units of elements)\n*\n* @example\n* var bsize = nullaryBlockSize( 'float64' );\n* // returns <number>\n*/\nfunction nullaryBlockSize( dtypeX ) {\n\treturn blockSize( [ dtypeX ] );\n}\n\n\n// EXPORTS //\n\nexport default nullaryBlockSize;\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 <number>\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* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar get;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 4 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the output ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See 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* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = somend( x, 2 );\n* // returns true\n*/\nfunction somend( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar ordx;\n\tvar len;\n\tvar sh;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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 a reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache a reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default somend;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport isComplexArray from '@stdlib/array-base-assert-is-complex-typed-array';\nimport isBooleanArray from '@stdlib/array-base-assert-is-booleanarray';\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 reinterpretComplex from '@stdlib/strided-base-reinterpret-complex';\nimport reinterpretBoolean from '@stdlib/strided-base-reinterpret-boolean';\nimport gscal from '@stdlib/blas-base-gscal';\nimport blockedaccessorsome2d from './2d_blocked_accessors.js';\nimport blockedaccessorsome3d from './3d_blocked_accessors.js';\nimport blockedaccessorsome4d from './4d_blocked_accessors.js';\nimport blockedaccessorsome5d from './5d_blocked_accessors.js';\nimport blockedaccessorsome6d from './6d_blocked_accessors.js';\nimport blockedaccessorsome7d from './7d_blocked_accessors.js';\nimport blockedaccessorsome8d from './8d_blocked_accessors.js';\nimport blockedaccessorsome9d from './9d_blocked_accessors.js';\nimport blockedaccessorsome10d from './10d_blocked_accessors.js';\nimport blockedcomplexsome2d from './2d_blocked_complex.js';\nimport blockedcomplexsome3d from './3d_blocked_complex.js';\nimport blockedcomplexsome4d from './4d_blocked_complex.js';\nimport blockedcomplexsome5d from './5d_blocked_complex.js';\nimport blockedcomplexsome6d from './6d_blocked_complex.js';\nimport blockedcomplexsome7d from './7d_blocked_complex.js';\nimport blockedcomplexsome8d from './8d_blocked_complex.js';\nimport blockedcomplexsome9d from './9d_blocked_complex.js';\nimport blockedcomplexsome10d from './10d_blocked_complex.js';\nimport blockedsome2d from './2d_blocked.js';\nimport blockedsome3d from './3d_blocked.js';\nimport blockedsome4d from './4d_blocked.js';\nimport blockedsome5d from './5d_blocked.js';\nimport blockedsome6d from './6d_blocked.js';\nimport blockedsome7d from './7d_blocked.js';\nimport blockedsome8d from './8d_blocked.js';\nimport blockedsome9d from './9d_blocked.js';\nimport blockedsome10d from './10d_blocked.js';\nimport accessorsome0d from './0d_accessors.js';\nimport accessorsome1d from './1d_accessors.js';\nimport accessorsome2d from './2d_accessors.js';\nimport accessorsome3d from './3d_accessors.js';\nimport accessorsome4d from './4d_accessors.js';\nimport accessorsome5d from './5d_accessors.js';\nimport accessorsome6d from './6d_accessors.js';\nimport accessorsome7d from './7d_accessors.js';\nimport accessorsome8d from './8d_accessors.js';\nimport accessorsome9d from './9d_accessors.js';\nimport accessorsome10d from './10d_accessors.js';\nimport accessorsomend from './nd_accessors.js';\nimport complexsome0d from './0d_complex.js';\nimport complexsome1d from './1d_complex.js';\nimport complexsome2d from './2d_complex.js';\nimport complexsome3d from './3d_complex.js';\nimport complexsome4d from './4d_complex.js';\nimport complexsome5d from './5d_complex.js';\nimport complexsome6d from './6d_complex.js';\nimport complexsome7d from './7d_complex.js';\nimport complexsome8d from './8d_complex.js';\nimport complexsome9d from './9d_complex.js';\nimport complexsome10d from './10d_complex.js';\nimport complexsomend from './nd_complex.js';\nimport some0d from './0d.js';\nimport some1d from './1d.js';\nimport some2d from './2d.js';\nimport some3d from './3d.js';\nimport some4d from './4d.js';\nimport some5d from './5d.js';\nimport some6d from './6d.js';\nimport some7d from './7d.js';\nimport some8d from './8d.js';\nimport some9d from './9d.js';\nimport some10d from './10d.js';\nimport somend from './nd.js';\n\n\n// VARIABLES //\n\nvar SOME = [\n\tsome0d,\n\tsome1d,\n\tsome2d,\n\tsome3d,\n\tsome4d,\n\tsome5d,\n\tsome6d,\n\tsome7d,\n\tsome8d,\n\tsome9d,\n\tsome10d,\n\tsomend\n];\nvar ACCESSOR_SOME = [\n\taccessorsome0d,\n\taccessorsome1d,\n\taccessorsome2d,\n\taccessorsome3d,\n\taccessorsome4d,\n\taccessorsome5d,\n\taccessorsome6d,\n\taccessorsome7d,\n\taccessorsome8d,\n\taccessorsome9d,\n\taccessorsome10d,\n\taccessorsomend\n];\nvar COMPLEX_SOME = [\n\tcomplexsome0d,\n\tcomplexsome1d,\n\tcomplexsome2d,\n\tcomplexsome3d,\n\tcomplexsome4d,\n\tcomplexsome5d,\n\tcomplexsome6d,\n\tcomplexsome7d,\n\tcomplexsome8d,\n\tcomplexsome9d,\n\tcomplexsome10d,\n\tcomplexsomend\n];\nvar BLOCKED_SOME = [\n\tblockedsome2d, // 0\n\tblockedsome3d,\n\tblockedsome4d,\n\tblockedsome5d,\n\tblockedsome6d,\n\tblockedsome7d,\n\tblockedsome8d,\n\tblockedsome9d,\n\tblockedsome10d // 8\n];\nvar BLOCKED_ACCESSOR_SOME = [\n\tblockedaccessorsome2d, // 0\n\tblockedaccessorsome3d,\n\tblockedaccessorsome4d,\n\tblockedaccessorsome5d,\n\tblockedaccessorsome6d,\n\tblockedaccessorsome7d,\n\tblockedaccessorsome8d,\n\tblockedaccessorsome9d,\n\tblockedaccessorsome10d // 8\n];\nvar BLOCKED_COMPLEX_SOME = [\n\tblockedcomplexsome2d, // 0\n\tblockedcomplexsome3d,\n\tblockedcomplexsome4d,\n\tblockedcomplexsome5d,\n\tblockedcomplexsome6d,\n\tblockedcomplexsome7d,\n\tblockedcomplexsome8d,\n\tblockedcomplexsome9d,\n\tblockedcomplexsome10d // 8\n];\nvar MAX_DIMS = SOME.length - 1;\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* ## Notes\n*\n* -   A 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<Object>} arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must satisfy the predicate function\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import scalar2ndarray from '@stdlib/ndarray-from-scalar';\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Define the success criterion:\n* var n = scalar2ndarray( 3, {\n*     'dtype': 'generic'\n* });\n*\n* // Test elements:\n* var out = some( [ x, n ] );\n* // returns true\n*/\nfunction some( arrays ) {\n\tvar isCmplx;\n\tvar ndims;\n\tvar xmmv;\n\tvar shx;\n\tvar iox;\n\tvar len;\n\tvar sx;\n\tvar ox;\n\tvar ns;\n\tvar N;\n\tvar x;\n\tvar n;\n\tvar d;\n\tvar i;\n\n\t// Unpack the ndarray and standardize ndarray meta data:\n\tx = ndarray2object( arrays[ 0 ] );\n\tn = ndarray2object( arrays[ 1 ] );\n\n\tshx = x.shape;\n\tndims = shx.length;\n\n\t// Resolve the success criterion:\n\tN = n.accessors[ 0 ]( n.data, n.offset );\n\n\t// Check for known array types which can be reinterpreted for better iteration performance...\n\tif ( isBooleanArray( x.data ) ) {\n\t\tx.data = reinterpretBoolean( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t} else if ( isComplexArray( x.data ) ) {\n\t\tx.data = reinterpretComplex( x.data, 0 );\n\t\tx.accessorProtocol = false;\n\t\tx.strides = gscal( ndims, 2, x.strides, 1 );\n\t\tx.offset *= 2;\n\t\tisCmplx = true;\n\t}\n\t// Determine whether we can avoid iteration altogether...\n\tif ( ndims === 0 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\t// Compute the number of elements and the number of singleton 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\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 an empty ndarray...\n\tif ( len === 0 ) {\n\t\treturn false;\n\t}\n\t// Determine whether the ndarray is one-dimensional and thus readily translates to a one-dimensional strided array...\n\tif ( ndims === 1 ) {\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t}\n\t\treturn SOME[ ndims ]( x, N );\n\t}\n\tsx = x.strides;\n\n\t// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat an ndarray as being equivalent to a one-dimensional strided array...\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\tx.strides = [ sx[i] ];\n\t\tif ( x.accessorProtocol ) {\n\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t}\n\t\treturn SOME[ 1 ]( x, N );\n\t}\n\tiox = iterationOrder( sx ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tif ( iox !== 0 ) {\n\t\t// Determine the minimum and maximum linear indices which are accessible by the array view:\n\t\txmmv = minmaxViewBufferIndex( shx, sx, x.offset );\n\n\t\t// Determine whether we can ignore shape (and strides) and treat the ndarray as a linear one-dimensional strided array...\n\t\tif ( len === ( xmmv[1]-xmmv[0]+1 ) || ( isCmplx && len*2 === ( xmmv[1]-xmmv[0]+2 ) ) ) { // eslint-disable-line max-len\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\tx.shape = [ len ];\n\t\t\tx.strides = [ ( isCmplx ) ? iox*2 : iox ];\n\t\t\tx.offset = ox;\n\t\t\tif ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ 1 ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ 1 ]( x, N );\n\t\t}\n\t\t// The 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 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 ( x.accessorProtocol ) {\n\t\t\t\treturn ACCESSOR_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\tif ( isCmplx ) {\n\t\t\t\treturn COMPLEX_SOME[ ndims ]( x, N );\n\t\t\t}\n\t\t\treturn SOME[ ndims ]( x, N );\n\t\t}\n\t\t// Fall-through to blocked iteration...\n\t}\n\t// At this point, we're either dealing with a non-contiguous n-dimensional array or a high dimensional n-dimensional array, 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 ( x.accessorProtocol ) {\n\t\t\treturn BLOCKED_ACCESSOR_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\tif ( isCmplx ) {\n\t\t\treturn BLOCKED_COMPLEX_SOME[ ndims-2 ]( x, N );\n\t\t}\n\t\treturn BLOCKED_SOME[ ndims-2 ]( x, N );\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 ( x.accessorProtocol ) {\n\t\treturn accessorsomend( x, N );\n\t}\n\tif ( isCmplx ) {\n\t\treturn complexsomend( x, N );\n\t}\n\treturn somend( x, N );\n}\n\n\n// EXPORTS //\n\nexport default some;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.data[ x.offset ] ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( xbuf[ ix ] ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && x.accessors[ 0 ]( x.data, x.offset ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( get( xbuf, ix ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\n\tvar get;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [];\n*\n* // Define the array strides:\n* var sx = [ 0 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some0d( x, 1 );\n* // returns true\n*/\nfunction some0d( x, n ) {\n\tif ( n <= 1 && ( x.data[ x.offset ] || x.data[ x.offset+1 ] ) ) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some0d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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 at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 4 ];\n*\n* // Define the array strides:\n* var sx = [ 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some1d( x, 4 );\n* // returns true\n*/\nfunction some1d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar S0;\n\tvar ix;\n\tvar i0;\n\n\t// Note on variable naming convention: S#, dx#, 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\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\n\n\t// Iterate over the ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count >= n ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tix += dx0;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some1d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some2d( x, 4 );\n* // returns true\n*/\nfunction some2d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\tcount += 1;\n\t\t\t\tif ( count >= n ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tix += dx0;\n\t\t}\n\t\tix += dx1;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some3d( x, 4 );\n* // returns true\n*/\nfunction some3d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tix += dx0;\n\t\t\t}\n\t\t\tix += dx1;\n\t\t}\n\t\tix += dx2;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some4d( x, 4 );\n* // returns true\n*/\nfunction some4d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sx;\n\tvar ix;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\t// Note on variable naming convention: S#, dx#, dy#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t\tix += dx2;\n\t\t}\n\t\tix += dx3;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some5d( x, 4 );\n* // returns true\n*/\nfunction some5d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sx;\n\tvar ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx1;\n\t\t\t\t}\n\t\t\t\tix += dx2;\n\t\t\t}\n\t\t\tix += dx3;\n\t\t}\n\t\tix += dx4;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some6d( x, 4 );\n* // returns true\n*/\nfunction some6d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t\tix += dx3;\n\t\t\t}\n\t\t\tix += dx4;\n\t\t}\n\t\tix += dx5;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some7d( x, 4 );\n* // returns true\n*/\nfunction some7d( x, n ) {\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx3;\n\t\t\t\t}\n\t\t\t\tix += dx4;\n\t\t\t}\n\t\t\tix += dx5;\n\t\t}\n\t\tix += dx6;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some8d( x, 4 );\n* // returns true\n*/\nfunction some8d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx4;\n\t\t\t\t}\n\t\t\t\tix += dx5;\n\t\t\t}\n\t\t\tix += dx6;\n\t\t}\n\t\tix += dx7;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some9d( x, 4 );\n* // returns true\n*/\nfunction some9d( x, n ) {\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx5;\n\t\t\t\t}\n\t\t\t\tix += dx6;\n\t\t\t}\n\t\t\tix += dx7;\n\t\t}\n\t\tix += dx8;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport strides2order from '@stdlib/ndarray-base-strides2order';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = some10d( x, 4 );\n* // returns true\n*/\nfunction some10d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar xbuf;\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 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 ix;\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#, 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\tif ( strides2order( sx ) === 1 ) {\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} 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}\n\t// Set a pointer to the first indexed element:\n\tix = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Initialize a counter:\n\tcount = 0;\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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx5;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx6;\n\t\t\t\t}\n\t\t\t\tix += dx7;\n\t\t\t}\n\t\t\tix += dx8;\n\t\t}\n\t\tix += dx9;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default some10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\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*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 1;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( xbuf[ ix ] ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 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 max-depth */\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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<Function>} x.accessors - data buffer accessors\n* @param {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import toAccessorArray from '@stdlib/array-base-to-accessor-array';\n* import accessors from '@stdlib/array-base-accessors';\n*\n* // Create a data buffer:\n* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\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*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar get;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Cache accessor:\n\tget = x.accessors[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( get( xbuf, ix ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome2d( x, 4 );\n* // returns true\n*/\nfunction blockedsome2d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar ox1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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 the index offset for the first input ndarray element in the current block:\n\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t// Compute the loop offset increment:\n\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tix += dx0;\n\t\t\t\t}\n\t\t\t\tix += dx1;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome2d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray is truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome3d( x, 4 );\n* // returns true\n*/\nfunction blockedsome3d( x, n ) {\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ox1;\n\tvar ox2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t// Compute the loop offset increment:\n\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tix += dx0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx1;\n\t\t\t\t\t}\n\t\t\t\t\tix += dx2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome3d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome4d( x, 4 );\n* // returns true\n*/\nfunction blockedsome4d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\treturn true;\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\tix += dx0;\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}\n\t\t\t\t\t\t\tix += dx2;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tix += dx3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome4d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome5d( x, 4 );\n* // returns true\n*/\nfunction blockedsome5d( x, n ) {\n\tvar bsize;\n\tvar count;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sx;\n\tvar ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx0;\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}\n\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\tix += dx4;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome5d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome6d( x, 4 );\n* // returns true\n*/\nfunction blockedsome6d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx2;\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}\n\t\t\t\t\t\t\t\t\tix += dx4;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome6d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome7d( x, 4 );\n* // returns true\n*/\nfunction blockedsome7d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dx5;\n\tvar dx6;\n\tvar ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx4;\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}\n\t\t\t\t\t\t\t\t\tix += dx6;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome7d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome8d( x, 4 );\n* // returns true\n*/\nfunction blockedsome8d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx6;\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome8d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome9d( x, 4 );\n* // returns true\n*/\nfunction blockedsome9d( x, n ) { // eslint-disable-line max-statements\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 ox1;\n\tvar ox2;\n\tvar ox3;\n\tvar ox4;\n\tvar ox5;\n\tvar ox6;\n\tvar ox7;\n\tvar ox8;\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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\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}\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}\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}\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}\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}\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}\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}\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}\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}\n\t\t\t\t\t\t\t\t\t\t\tix += dx8;\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome9d;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\n\n'use strict';\n\n// MODULES //\n\nimport loopOrder from '@stdlib/ndarray-base-nullary-loop-interchange-order';\nimport blockSize from '@stdlib/ndarray-base-nullary-tiling-block-size';\n\n\n// MAIN //\n\n/**\n* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.\n*\n* @private\n* @param {Object} x - object containing ndarray meta data\n* @param {string} 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 {PositiveInteger} n - number of elements\n* @returns {boolean} boolean indicating whether at least `n` elements are truthy\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* // Create a data buffer:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Create an input ndarray-like object:\n* var x = {\n*     'dtype': 'complex128',\n*     'data': xbuf,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n*\n* // Test elements:\n* var out = blockedsome10d( x, 4 );\n* // returns true\n*/\nfunction blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function\n\tvar count;\n\tvar bsize;\n\tvar xbuf;\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 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 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 ox;\n\tvar ix;\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#, 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 );\n\tsh = o.sh;\n\tsx = o.sx;\n\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype );\n\n\t// Set a pointer to the first indexed element:\n\tox = x.offset;\n\n\t// Cache a reference to the input ndarray buffer:\n\txbuf = x.data;\n\n\t// Cache the offset increment for the innermost loop:\n\tdx0 = sx[0];\n\n\t// Initialize a counter:\n\tcount = 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\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\tox8 = ox9 + ( j8*sx[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\tox7 = ox8 + ( j7*sx[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\tox6 = ox7 + ( j6*sx[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\tox5 = ox6 + ( j5*sx[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\tox4 = ox5 + ( j4*sx[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\tox3 = ox4 + ( j3*sx[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\tox2 = ox3 + ( j2*sx[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\tox1 = ox2 + ( j1*sx[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 the index offset for the first input ndarray element in the current block:\n\t\t\t\t\t\t\t\t\t\t\tix = ox1 + ( j0*sx[0] );\n\n\t\t\t\t\t\t\t\t\t\t\t// Compute the loop offset increment:\n\t\t\t\t\t\t\t\t\t\t\tdx1 = sx[1] - ( s0*sx[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\tif ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount += 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif ( count >= n ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\treturn true;\n\t\t\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\t\t}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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}\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\treturn false;\n}\n\n\n// EXPORTS //\n\nexport default blockedsome10d;\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 <Uint8Array>\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// 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 <Float64Array>\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 <Float32Array>\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) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* 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"],"names":["C64_BYTES_PER_ELEMENT","C128_BYTES_PER_ELEMENT","BYTES_PER_ELEMENT","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","minmaxViewBufferIndex","shape","strides","offset","ndims","min","max","s","setReadOnly","TYPE","isAccessorArray","GETTERS","complex128","arr","idx","complex64","default","getter","dtype","SETTERS","setter","float64","float32","int32","int16","int8","uint32","uint16","uint8","uint8c","generic","numel","copy","x","len","isString","FLG","Symbol","hasToStringTagSupport","toStringTag","has","hasOwnProperty","hasOwnProp","property","Sym","toStrTag","nativeClass","hasToStringTag","v","isOwn","tag","valueOf","test","isPrimitive","isObject","isColumnMajorString","shape2strides","order","isColumnMajor","columnmajor","rowmajor","ROW_MAJOR","ord","sh","st","copyIndexed","main$c","Number","o","strides2offset","strides2order","column","row","s1","s2","COLUMN_MAJOR","ndarraylike2object","xbuf","bool","dt","data","getData","getShape","getDType","ref","getStrides","getOffset","getOrder","accessorProtocol","accessors","accessorGetter","accessorSetter","isComplex128Array","constructor","name","isComplex64Array","hasFloat64Array","Float64Array","ctor","GlobalFloat64Array","NaN","hasFloat64ArraySupport","Float64Array$1","reinterpret","buffer","byteOffset","hasFloat32Array","Float32Array","FLOAT64_PINF","POSITIVE_INFINITY","GlobalFloat32Array","PINF","hasFloat32ArraySupport","Float32Array$1","hasUint8Array","Uint8Array","GlobalUint8Array","UINT8_MAX","hasUint8ArraySupport","Uint8Array$1","main$8","arrayfcn","predicate","isObjectLike","isBuffer","_isBuffer","reFunctionName","arrayfun","RE_FUNCTION_NAME","constructorName","REGEXP","ctor2dtypes","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8ClampedArray","Complex64Array","Complex128Array","BooleanArray","hasUint32Array","UINT32_MAX","GlobalUint32Array","hasUint32ArraySupport","Uint32Array$1","hasInt32Array","GlobalInt32Array","INT32_MAX","hasInt32ArraySupport","Int32Array$1","hasUint16Array","GlobalUint16Array","UINT16_MAX","hasUint16ArraySupport","Uint16Array$1","hasInt16Array","GlobalInt16Array","INT16_MAX","hasInt16ArraySupport","Int16Array$1","hasUint8ClampedArray","GlobalUint8ClampedArray","hasUint8ClampedArraySupport","Uint8ClampedArray$1","hasInt8Array","GlobalInt8Array","INT8_MAX","hasInt8ArraySupport","Int8Array$1","FLOAT64_NINF","NEGATIVE_INFINITY","floor","isInteger","NINF","isInt","isNonNegativeInteger","MAX_ARRAY_LENGTH","isArrayLikeObject","MAX_LENGTH","MAX_TYPED_ARRAY_LENGTH","isCollection","hasArrayBuffer","ArrayBuffer","isArrayBuffer","isPrimitiveArray","isObjectArray","isStringArray","isBoolean","Bool","Boolean","self","window","global","globalThis","root","codegen","Function","GlobalThis","Self","Win","Global","getGlobal","nodeList","document","childNodes","typedarray","ctorName","type","isFunction","typeOf","Complex128","real","imag","this","setEnumerableReadOnly","re","im","fround","FLOAT32_VIEW","float64ToFloat32$1","Complex64","float64ToFloat32","isComplexLike","isEven","hasIteratorSymbolSupport","iterator","IteratorSymbol","setNonEnumerableReadOnlyAccessor","z","fromIterator","it","next","done","realf","imagf","HAS_ITERATOR_SYMBOL","isComplexArray","_length","_buffer","isComplexArrayConstructor","getComplex64","buf","nargs","fromArray","RangeError","reinterpret64","reinterpret128","byteLength","ITERATOR_SYMBOL","src","thisArg","clbk","tmp","flg","fromIteratorMap","target","start","copyWithin","iter","entries","end","fcn","searchElement","fromIndex","separator","sep","join","keys","outbuf","reducer","initialValue","acc","N","sbuf","outlen","compareFcn","sort","begin","locales","options","opts","loc","toLocaleString","values","index","getComplex128","isBooleanArray","isBooleanArrayConstructor","val","a","b","CTORS","DTYPES","NTYPES","arraylike2object","ctor2dtype","M","gscal","alpha","stride","ix","m","xget","xset","ndarray","stride2offset","zeroTo","complex","loopOrder","sx","y","avx","iy","jx","jy","vx","vy","ux","sort2ins","indices","take","isPositiveInteger","indexed","isArguments","bool$6","detect","hasArgumentsClass","isNan","isEnumerableProperty","propertyIsEnumerable","hasStringEnumBug","isEnum","isArguments$1","isConstructorPrototype","w","hasAutomationEqualityBug","k","win","EXCLUDED_KEYS","check","HAS_BUILTIN","skipConstructor","skipPrototype","isFcn","p","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","HAS_WINDOW","error","NON_ENUMERABLE","getProto","Obj","getPrototypeOf","proto","getProto$1","objectPrototype","isPlainObject","isPrototypeOf","key","ownProps","hash","allowDupes","duplicates","objectKeys","objectInverse","int64","uint64","float16","complex32","binary","notype","userdefined_type","bytesPerElement","enum2str","defaults","BLOCK_SIZE_IN_BYTES","BLOCK_SIZE_IN_ELEMENTS","nullaryBlockSize","dtypeX","dtypes","nb","blockSize","vind2bind","mode","ind","MODE","somend","count","ordx","ox","SOME","dx0","S0","i0","dx1","S1","i1","dx2","S2","i2","dx3","S3","i3","dx4","S4","i4","dx5","S5","i5","dx6","S6","i6","dx7","S7","i7","dx8","S8","i8","dx9","S9","i9","ACCESSOR_SOME","accessorsomend","COMPLEX_SOME","complexsomend","BLOCKED_SOME","bsize","ox1","s0","j0","j1","ox2","j2","ox3","s3","j3","ox4","s4","j4","ox5","s5","j5","ox6","s6","j6","ox7","s7","j7","ox8","s8","j8","ox9","s9","j9","BLOCKED_ACCESSOR_SOME","BLOCKED_COMPLEX_SOME","MAX_DIMS","arrays","isCmplx","xmmv","shx","iox","ns","d","ndarray2object","reinterpretBoolean","reinterpretComplex","cnt","iterationOrder"],"mappings":";qOAsBA,IAAIA,EAAwB,EACxBC,EAAyB,GCD7B,IAAIC,EAAoB,ECAxB,IAAIC,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,CCUA,SAASmH,EAAuBC,EAAOC,EAASC,GAC/C,IAAIC,EACAC,EACAC,EACAC,EACAvH,EAKJ,IAHAoH,EAAQH,EAAMzG,OACd6G,EAAMF,EACNG,EAAMH,EACAnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAC7B,GAAoB,IAAfiH,EAAOjH,GACX,MAAO,CAAEmH,EAAQA,IAElBI,EAAIL,EAASlH,IACJ,EACRsH,GAAOC,GAAMN,EAAMjH,GAAG,GACXuH,EAAI,IACfF,GAAOE,GAAMN,EAAMjH,GAAG,GAEvB,CACD,MAAO,CAAEqH,EAAKC,EACf,CCTAE,EAAA/H,EAAA,UCIA,SAAgCwH,EAAOC,EAASC,EAAQlH,GACvD,IAAImH,EACAC,EACAC,EACAC,EACAvH,EAKJ,IAHAoH,EAAQH,EAAMzG,OACd6G,EAAMF,EACNG,EAAMH,EACAnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAC7B,GAAoB,IAAfiH,EAAOjH,GAGX,OAFAC,EAAK,GAAMkH,EACXlH,EAAK,GAAMkH,EACJlH,GAERsH,EAAIL,EAASlH,IACJ,EACRsH,GAAOC,GAAMN,EAAMjH,GAAG,GACXuH,EAAI,IACfF,GAAOE,GAAMN,EAAMjH,GAAG,GAEvB,CAGD,OAFAC,EAAK,GAAMoH,EACXpH,EAAK,GAAMqH,EACJrH,CACR,ICnFA,IAAIwH,EAAO,WAqBX,SAASC,EAAiB7H,GACzB,cAAgBA,EAAM4G,MAAQgB,UAAe5H,EAAM6G,MAAQe,CAC5D,CCvBA,IAAIE,EAAU,CACbC,WAwBD,SAAwBC,EAAKC,GAC5B,OAAOD,EAAIpB,IAAKqB,EACjB,EAzBCC,UA2CD,SAAuBF,EAAKC,GAC3B,OAAOD,EAAIpB,IAAKqB,EACjB,EA5CCE,QAuED,SAAuBH,EAAKC,GAC3B,OAAOD,EAAIpB,IAAKqB,EACjB,GAqBA,SAASG,EAAQC,GAChB,IAAIvF,EAAIgF,EAASO,GACjB,MAAkB,mBAANvF,EACJA,EAEDgF,EAAQK,OAChB,CCvGA,IAAIG,EAAU,CACbP,WA0BD,SAAwBC,EAAKC,EAAKjI,GACjCgI,EAAInB,IAAK7G,EAAOiI,EACjB,EA3BCC,UA+CD,SAAuBF,EAAKC,EAAKjI,GAChCgI,EAAInB,IAAK7G,EAAOiI,EACjB,EAhDCE,QA6ED,SAAuBH,EAAKC,EAAKjI,GAChCgI,EAAInB,IAAK7G,EAAOiI,EACjB,GAwBA,SAASM,EAAQF,GAChB,IAAIvF,EAAIwF,EAASD,GACjB,MAAkB,mBAANvF,EACJA,EAEDwF,EAAQH,OAChB,CChHA,IAAIL,EAAU,CACbU,QAgCD,SAAqBR,EAAKC,GACzB,OAAOD,EAAKC,EACb,EAjCCQ,QAmDD,SAAqBT,EAAKC,GACzB,OAAOD,EAAKC,EACb,EApDCS,MAsED,SAAmBV,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAvECU,MAyFD,SAAmBX,EAAKC,GACvB,OAAOD,EAAKC,EACb,EA1FCW,KA4GD,SAAkBZ,EAAKC,GACtB,OAAOD,EAAKC,EACb,EA7GCY,OA+HD,SAAoBb,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAhICa,OAkJD,SAAoBd,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAnJCc,MAqKD,SAAmBf,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAtKCe,OAwLD,SAAoBhB,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAzLCgB,QAyMD,SAAqBjB,EAAKC,GACzB,OAAOD,EAAKC,EACb,EA1MCE,QA0ND,SAAuBH,EAAKC,GAC3B,OAAOD,EAAKC,EACb,GAoBA,SAASG,EAAQC,GAChB,IAAIvF,EAAIgF,EAASO,GACjB,MAAkB,mBAANvF,EACJA,EAEDgF,EAAQK,OAChB,CCjQA,IAAIG,EAAU,CACbE,QAkCD,SAAqBR,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EAnCCyI,QAuDD,SAAqBT,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EAxDC0I,MA4ED,SAAmBV,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EA7EC2I,MAiGD,SAAmBX,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EAlGC4I,KAsHD,SAAkBZ,EAAKC,EAAKjI,GAC3BgI,EAAKC,GAAQjI,CACd,EAvHC6I,OA2ID,SAAoBb,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EA5IC8I,OAgKD,SAAoBd,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EAjKC+I,MAqLD,SAAmBf,EAAKC,EAAKjI,GAC5BgI,EAAKC,GAAQjI,CACd,EAtLCgJ,OA0MD,SAAoBhB,EAAKC,EAAKjI,GAC7BgI,EAAKC,GAAQjI,CACd,EA3MCiJ,QA6ND,SAAqBjB,EAAKC,EAAKjI,GAC9BgI,EAAKC,GAAQjI,CACd,EA9NCmI,QAgPD,SAAuBH,EAAKC,EAAKjI,GAChCgI,EAAKC,GAAQjI,CACd,GAsBA,SAASuI,EAAQF,GAChB,IAAIvF,EAAIwF,EAASD,GACjB,MAAkB,mBAANvF,EACJA,EAEDwF,EAAQH,OAChB,CC/QA,SAASe,EAAO9B,GACf,IAAIG,EACArH,EACAC,EAGJ,GAAe,KADfoH,EAAQH,EAAMzG,QAEb,OAAO,EAGR,IADAT,EAAI,EACEC,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBD,GAAKkH,EAAOjH,GAEb,OAAOD,CACR,CCdA,SAASiJ,GAAMC,GACd,IAAIhJ,EACAiJ,EACAlJ,EAIJ,IAFAkJ,EAAMD,EAAEzI,OACRP,EAAM,GACAD,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrBC,EAAI8E,KAAMkE,EAAGjJ,IAEd,OAAOC,CACR,CCTA,SAASkJ,GAAUtJ,GAClB,MAA0B,iBAAVA,CACjB,CCTA,IAAIuJ,GCMgB,mBAAXC,QACoB,iBAApBA,OAAQ,ODOjB,SAASC,KACR,OAASF,IAAqC,iBAAvBC,OAAOE,WAC/B,CErBA,IAAIjE,GAAQ5F,OAAOmB,UAAUY,SCA7B,IAAI+H,GAAM9J,OAAOmB,UAAU4I,eA4B3B,SAASC,GAAY7J,EAAO8J,GAC3B,OACC9J,SAKM2J,GAAI1H,KAAMjC,EAAO8J,EACzB,CCpCA,IAAIC,GAA0B,mBAAXP,OAA0BA,YAAS,ECKlDQ,GAA+B,mBAAXR,GAA0BA,GAAOE,YAAc,GCiCvE,IAAAO,GATKC,KCDL,SAAsBC,GACrB,IAAIC,EACAC,EACAjK,EAEJ,GAAK+J,QACJ,OAAO1E,GAAMxD,KAAMkI,GAEpBE,EAAMF,EAAGT,IACTU,EAAQP,GAAYM,EAAGT,IAGvB,IACCS,EAAGT,SAAgB,CACnB,CAAC,MAAQxD,GACT,OAAOT,GAAMxD,KAAMkI,EACnB,CAQD,OAPA/J,EAAMqF,GAAMxD,KAAMkI,GAEbC,EACJD,EAAGT,IAAgBW,SAEZF,EAAGT,IAEJtJ,CACR,EC3BA,SAAsB+J,GACrB,OAAO1E,GAAMxD,KAAMkI,EACpB,EC7BIG,GAAUvJ,OAAOC,UAAUsJ,QCQ/B,IAAIf,GAAMW,KAmBV,SAASZ,GAAUtJ,GAClB,MAAsB,iBAAVA,IACNA,aAAiBe,SAGjBwI,GCnBP,SAAevJ,GACd,IAEC,OADAsK,GAAQrI,KAAMjC,IACP,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDaUqE,CAAMvK,GAEoB,oBAAzBiK,GAAajK,IAGxB,CEjBA,SAASsJ,GAAUtJ,GAClB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCNA,SAAS0K,GAAqBP,GAC7B,MAAe,iBAANA,CACV,CCmDA,SAASQ,GAAevD,EAAOwD,GAC9B,OAAKC,GAAeD,GAhCrB,SAAsBxD,GACrB,IAAIhH,EACAsH,EACAvH,EAIJ,IAFAC,EAAM,GACNsH,EAAI,EACEvH,EAAI,EAAGA,EAAIiH,EAAMzG,OAAQR,IAC9BC,EAAI8E,KAAMwC,GACVA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CAqBS0K,CAAa1D,GA3DtB,SAAmBA,GAClB,IAAIG,EACAnH,EACAsH,EACAvH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACdP,EAAM,GACAD,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBC,EAAI8E,KAAM,GAGX,IADAwC,EAAI,EACEvH,EAAIoH,EAAM,EAAGpH,GAAK,EAAGA,IAC1BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CA4CQ2K,CAAU3D,EAClB,CC9BAO,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICvBA9C,EAAA/H,GAAA,UCgDA,SAAwBwH,EAAOwD,EAAOxK,GACrC,OAAKyK,GAAeD,GApCrB,SAAsBxD,EAAOhH,GAC5B,IAAIsH,EACAvH,EAGJ,IADAuH,EAAI,EACEvH,EAAI,EAAGA,EAAIiH,EAAMzG,OAAQR,IAC9BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CA2BS0K,CAAa1D,EAAOhH,GA3D7B,SAAmBgH,EAAOhH,GACzB,IACIsH,EACAvH,EAIJ,IADAuH,EAAI,EACEvH,EAFEiH,EAAMzG,OAEE,EAAGR,GAAK,EAAGA,IAC1BC,EAAKD,GAAMuH,EACXA,GAAKN,EAAOjH,GAEb,OAAOC,CACR,CAiDQ2K,CAAU3D,EAAOhH,EACzB,ICpEA,IAAI4K,GAAY,YAkBhB,SAAS3D,GAAS+B,EAAGD,GACpB,IAAI8B,EACAC,EACAC,EAGJ,MAAmB,iBADnBA,EAAK/B,EAAE/B,UAC+B,OAAP8D,EAEX,KADnBD,EAAK9B,EAAEhC,OACCzG,OACA,CAAE,IAGJ2I,GADN2B,EAAM7B,EAAEwB,SAEPK,EAAMD,IAEAL,GAAeO,EAAID,IAEtB9B,EACGiC,GAAaD,GAEdA,CACR,CC9BA,SAASpL,GAAUC,GAClB,MAA0B,iBAAVA,CACjB,CClBA,IAAAqL,GAAeC,OCMX1J,GAAW0J,GAAOtK,UAAUY,SCEhC,IAAI2H,GAAMW,KAmBV,SAASnK,GAAUC,GAClB,MAAsB,iBAAVA,IACNA,aAAiBsL,KAGjB/B,GCpBP,SAAevJ,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDcUqE,CAAMvK,GAEoB,oBAAzBiK,GAAajK,IAGxB,CEVA,SAASD,GAAUC,GAClB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCZA,SAASsH,GAAQ8B,GAChB,IAAI+B,EACAD,EACAK,EAGJ,OAAKxL,GADLwL,EAAInC,EAAE9B,QAEEiE,EAGW,KADnBL,EAAK9B,EAAEhC,OACCzG,QAIW,iBADnBwK,EAAK/B,EAAE/B,UAC+B,OAAP8D,EAHvB,ECfT,SAAyB/D,EAAOC,GAC/B,IAAIC,EACAC,EACApH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACd2G,EAAS,EACHnH,EAAI,EAAGA,EAAIoH,EAAOpH,IAClBkH,EAASlH,GAAM,IAEnBmH,GAAUD,EAASlH,IAAQiH,EAAOjH,GAAI,IAGxC,OAAOmH,CACR,CDOQkE,CAAgBN,EAAIC,EAC5B,CEVA,SAAShJ,GAAKiH,GACb,OAAOhH,KAAKD,IAAKiH,EAClB,CCJA,SAASqC,GAAepE,GACvB,IAAIqE,EACAnE,EACAoE,EACAC,EACAC,EACA1L,EAGJ,GAAe,KADfoH,EAAQF,EAAQ1G,QAEf,OAAO,EAMR,IAJA+K,GAAS,EACTC,GAAM,EAENC,EAAKzJ,GAAKkF,EAAS,IACblH,EAAI,EAAGA,EAAIoH,EAAOpH,IAAM,CAO7B,GANA0L,EAAK1J,GAAKkF,EAASlH,IACduL,GAAUG,EAAKD,EACnBF,GAAS,EACEC,GAAOE,EAAKD,IACvBD,GAAM,IAEFA,IAAOD,EAGX,OAAO,EAFPE,EAAKC,CAIN,CACD,OAAKF,GAAOD,EACJ,EAEHC,EACG,EAED,CACR,CCVAhE,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC7CA,IAAIO,GAAY,YACZc,GAAe,eAqBnB,SAASlB,GAAOxB,GACf,IAAI+B,EACAI,EAGJ,OAAKjC,GADLiC,EAAInC,EAAEwB,OAEEW,EAIW,iBADnBJ,EAAK/B,EAAE/B,UAC+B,OAAP8D,GAIpB,KADXI,EAAIE,GAAeN,KACG,IAANI,EAHRP,GAMG,IAANO,EACGO,GAGgB,IAAnB1C,EAAEhC,MAAMzG,OACLqK,GAGD,IACR,CCDA,SAASe,GAAoB3C,GAC5B,IAAI4C,EACAC,EACAf,EACAgB,EAQJ,OANAF,EC3CD,SAAe5C,GACd,OAAOA,EAAE+C,IACV,CDyCQC,CAAShD,GAChB8B,EE1CD,SAAgB9B,EAAGD,GAClB,IAAI+B,EAAK9B,EAAEhC,MACX,OAAK+B,EACGiC,GAAaF,GAEdA,CACR,CFoCMmB,CAAUjD,GAAG,GAClB8C,EG7CD,SAAgB9C,GACf,OAAOA,EAAEf,KACV,CH2CMiE,CAAUlD,GAEf6C,EAAOpE,EAAiBmE,GAEjB,CACNO,IAAOnD,EACPf,MAAS6D,EACTC,KAAQH,EACRrL,OAAUuI,EAAOgC,GACjB9D,MAAS8D,EACT7D,QAAWmF,GAAYpD,GAAG,GAC1B9B,OAAUmF,GAAWrD,GACrBwB,MAAS8B,GAAUtD,GACnBuD,iBAAoBV,EACpBW,UAAa,EACZ,CAAEC,EAAgBX,GAAMY,EAAgBZ,IACxC,CAAE9D,EAAQ8D,GAAM3D,EAAQ2D,IAE3B,CI/EA,IAAIvM,GAAoB,GAoBxB,SAASoN,GAAmB/M,GAE3B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,EAE9B,CC5BA,IAAIA,GAAoB,EAoBxB,SAASuN,GAAkBlN,GAE1B,MACkB,iBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,EAE9B,CCvBA,IAAIwN,GAA4C,mBAAjBC,aCL/B,IAAIxN,GAAiC,mBAAjBwN,aAAgCA,aAAe,KCAnE,ICmBIC,GDnBAA,GAAiC,mBAAjBD,aAAgCA,kBAAe,ECuBlEC,GCRD,WACC,IAAIpB,EACAjE,EJSoBhI,EIPxB,GAAmC,mBAAvBsN,GACX,OAAO,EAGR,IACCtF,EAAM,IAAIsF,GAAoB,CAAE,EAAK,MAAO,KAAMC,MJE3BvN,EIANgI,EADjBiE,GJGEkB,IAAmBnN,aAAiBoN,cACb,0BAAzBnD,GAAajK,KIFC,IAAbgI,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,IAAQA,EAAK,EAEnB,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDhBKuB,GACGpH,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA8L,GAAeJ,GGNf,SAASK,GAAatE,EAAG9B,GACxB,OAAO,IAAI8F,GAAchE,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS,GAAG8B,EAAEzI,OAAO2G,GAC3F,CCpBA,IAAIuG,GAA4C,mBAAjBC,aCuB/B,IAAIC,GAAezC,OAAO0C,kBC5BtBpO,GAAiC,mBAAjBkO,aAAgCA,aAAe,KCAnE,ICmBIT,GDnBAA,GAAiC,mBAAjBS,aAAgCA,kBAAe,ECuBlET,GCPD,WACC,IAAIpB,EACAjE,ELQoBhI,EKNxB,GAAmC,mBAAvBiO,GACX,OAAO,EAGR,IACCjG,EAAM,IAAIiG,GAAoB,CAAE,EAAK,MAAO,KAAM,OLC3BjO,EKCNgI,EADjBiE,GLEE4B,IAAmB7N,aAAiB8N,cACb,0BAAzB7D,GAAajK,KKDC,IAAbgI,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQkG,EAEd,CAAC,MAAQhI,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDjBKkC,GACG/H,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAyM,GAAef,GGNf,SAASK,GAAatE,EAAG9B,GACxB,OAAO,IAAIwG,GAAc1E,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS,GAAG8B,EAAEzI,OAAO2G,GAC3F,CCpBA,IAAI+G,GAAwC,mBAAfC,WC4B7B,ICjCI1O,GAA+B,mBAAf0O,WAA8BA,WAAa,KCA/D,ICmBIjB,GDnBAA,GAA+B,mBAAfiB,WAA8BA,gBAAa,ECuB9DjB,GCPD,WACC,IAAIpB,EACAjE,ELQkBhI,EKNtB,GAAiC,mBAArBuO,GACX,OAAO,EAGR,IAECvG,EAAM,IAAIuG,GADVvG,EAAM,CAAE,EAAG,MAAO,KAAMwG,IAAaA,MLChBxO,EKENgI,EADfiE,GLCEoC,IAAiBrO,aAAiBsO,YACX,wBAAzBrE,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQwG,MAAbxG,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKwC,GACGrI,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA+M,GAAerB,GGWf,IAAAsB,GATKrL,MAAMD,QACNC,MAAMD,QARX,SAAkBrD,GACjB,MAAkC,mBAAzBiK,GAAajK,EACvB,ECCA,SAAS4O,GAAUC,GAClB,GAA0B,mBAAdA,EACX,MAAM,IAAI3K,UAAWiB,EAAQ,0DAA2D0J,IAEzF,OASA,SAAgB7O,GACf,IAAIqJ,EACAlJ,EACJ,IAAMkD,GAASrD,GACd,OAAO,EAGR,GAAa,KADbqJ,EAAMrJ,EAAMW,QAEX,OAAO,EAER,IAAMR,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrB,IAAiC,IAA5B0O,EAAW7O,EAAOG,IACtB,OAAO,EAGT,OAAO,CACP,CACF,CCzCA,SAAS2O,GAAc9O,GACtB,OACW,OAAVA,GACiB,iBAAVA,CAET,CCMA,SAAS+O,GAAU/O,GAClB,OACC8O,GAAc9O,KAGbA,EAAMgP,WAELhP,EAAMgN,aAGgC,mBAA/BhN,EAAMgN,YAAY+B,UACzB/O,EAAMgN,YAAY+B,SAAU/O,GAIhC,CClBA,SAASiP,KACR,MAAO,yBACR,CCaAtH,EAAA/H,GAAA,oBALAsP,GAAAtP,KCFA,IAAIuP,GFPI,0BGQR,SAASC,GAAiBjF,GACzB,IAAIxF,EACAsI,EACAI,EAEJ,IAAe,YADfJ,EAAOhD,GAAaE,GAAInF,MAAO,GAAI,KACC,UAATiI,IAAqB9C,EAAE6C,YAAc,CAE/D,GAA0B,iBAD1BK,EAAOlD,EAAE6C,aACQC,KAChB,OAAOI,EAAKJ,KAGb,GADAtI,EAAQF,GAAGM,KAAMsI,EAAKzL,YAErB,OAAO+C,EAAO,EAEf,CACD,OAAKoK,GAAU5E,GACP,SAED8C,CACR,CCnBAtF,EAAA/H,GAAA,SAAAyP,IChCA,IAAIC,GAAc,CACjBxB,aAAgB,UAChBV,aAAgB,UAChB9J,MAAS,UACTiM,WAAc,QACdC,WAAc,QACdC,UAAa,OACbC,YAAe,SACfC,YAAe,SACfrB,WAAc,QACdsB,kBAAqB,SACrBC,eAAkB,YAClBC,gBAAmB,aACnBC,aAAgB,QCTbC,GAA0C,mBAAhBL,YC4B9B,IAAIM,GAAa,WCjCbrQ,GAAgC,mBAAhB+P,YAA+BA,YAAc,KCAjE,ICmBItC,GDnBAA,GAAgC,mBAAhBsC,YAA+BA,iBAAc,ECuBhEtC,GCPD,WACC,IAAIpB,EACAjE,ELQmBhI,EKNvB,GAAkC,mBAAtBkQ,GACX,OAAO,EAGR,IAEClI,EAAM,IAAIkI,GADVlI,EAAM,CAAE,EAAG,MAAO,KAAMiI,WAAcA,aLChBjQ,EKENgI,EADhBiE,GLCE+D,IAAkBhQ,aAAiB2P,aACZ,yBAAzB1F,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQiI,aAAbjI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKkE,GACG/J,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAyO,GAAe/C,GGxBXgD,GAAwC,mBAAfb,WC4B7B,ICjCI5P,GAA+B,mBAAf4P,WAA8BA,WAAa,KCA/D,ICmBInC,GDnBAA,GAA+B,mBAAfmC,WAA8BA,gBAAa,ECuB9DnC,GCND,WACC,IAAIpB,EACAjE,ELOkBhI,EKLtB,GAAiC,mBAArBsQ,GACX,OAAO,EAGR,IACCtI,EAAM,IAAIsI,GAAkB,CAAE,EAAG,MAAO,KAAMC,aLAzBvQ,EKENgI,EADfiE,GLCEoE,IAAiBrQ,aAAiBwP,YACX,wBAAzBvF,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,aDDbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDlBKuE,GACGpK,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAA8O,GAAepD,GIxBXqD,GAA0C,mBAAhBhB,YC4B9B,ICjCI9P,GAAgC,mBAAhB8P,YAA+BA,YAAc,KCAjE,ICmBIrC,GDnBAA,GAAgC,mBAAhBqC,YAA+BA,iBAAc,ECuBhErC,GCPD,WACC,IAAIpB,EACAjE,ELQmBhI,EKNvB,GAAkC,mBAAtB2Q,GACX,OAAO,EAGR,IAEC3I,EAAM,IAAI2I,GADV3I,EAAM,CAAE,EAAG,MAAO,KAAM4I,MAAcA,QLChB5Q,EKENgI,EADhBiE,GLCEyE,IAAkB1Q,aAAiB0P,aACZ,yBAAzBzF,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQ4I,QAAb5I,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDnBK4E,GACGzK,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAAmP,GAAezD,GGxBX0D,GAAwC,mBAAfxB,WC4B7B,ICjCI3P,GAA+B,mBAAf2P,WAA8BA,WAAa,KCA/D,ICmBIlC,GDnBAA,GAA+B,mBAAfkC,WAA8BA,gBAAa,ECuB9DlC,GCND,WACC,IAAIpB,EACAjE,ELOkBhI,EKLtB,GAAiC,mBAArBgR,GACX,OAAO,EAGR,IACChJ,EAAM,IAAIgJ,GAAkB,CAAE,EAAG,MAAO,KAAMC,QLAzBjR,EKENgI,EADfiE,GLCE8E,IAAiB/Q,aAAiBuP,YACX,wBAAzBtF,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEQ,QDDbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDlBKiF,GACG9K,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAAwP,GAAe9D,GIxBX+D,GAAsD,mBAAtBxB,kBCLpC,IAAIhQ,GAAsC,mBAAtBgQ,kBAAqCA,kBAAoB,KCA7E,ICmBIvC,GDnBAA,GAAsC,mBAAtBuC,kBAAqCA,uBAAoB,ECuB5EvC,GCRD,WACC,IAAIpB,EACAjE,EJSyBhI,EIP7B,GAAwC,mBAA5BqR,GACX,OAAO,EAGR,IACCrJ,EAAM,IAAIqJ,GAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MJEpCrR,EIANgI,EADtBiE,GJGEmF,IAAwBpR,aAAiB4P,mBAClB,+BAAzB3F,GAAajK,KIFC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDnBKqF,GACGlL,GEdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EFoBA,IAAA4P,GAAelE,GGxBXmE,GAAsC,mBAAd/B,UC4B5B,ICjCI7P,GAA8B,mBAAd6P,UAA6BA,UAAY,KCA7D,ICmBIpC,GDnBAA,GAA8B,mBAAdoC,UAA6BA,eAAY,ECuB5DpC,GCND,WACC,IAAIpB,EACAjE,ELOiBhI,EKLrB,GAAgC,mBAApByR,GACX,OAAO,EAGR,IACCzJ,EAAM,IAAIyJ,GAAiB,CAAE,EAAG,MAAO,KAAMC,MLAzB1R,EKENgI,EADdiE,GLCEuF,IAAgBxR,aAAiByP,WACV,uBAAzBxF,GAAajK,KKAC,IAAbgI,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,KCEO,MDDZA,EAAK,EAEN,CAAC,MAAQ9B,GACT+F,GAAO,CACP,CACD,OAAOA,CACR,CDlBK0F,GACGvL,GGdR,WACC,MAAM,IAAIzE,MAAO,kBAClB,EHoBA,IAAAiQ,GAAevE,GIGXwE,GAAevG,GAAOwG,kBCVtBC,GAAQ3P,KAAK2P,MCHjB,SAASC,GAAW5I,GACnB,OAAQ2I,GAAM3I,KAAOA,CACtB,CCPA,SAAS4I,GAAWhS,GACnB,OACCA,EAAQkO,IACRlO,EAAQiS,IACRC,GAAOlS,EAET,CCAA,SAASgS,GAAWhS,GACnB,OACCD,GAAUC,IACVkS,GAAOlS,EAET,CCLA,SAASgS,GAAWhS,GACnB,OACCD,GAAUC,IACVkS,GAAOlS,EAAMsK,UAEf,CCGA,SAAS0H,GAAWhS,GACnB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCXA,SAASmS,GAAsBnS,GAC9B,OACCgS,GAAWhS,IACXA,GAAS,CAEX,CCLA,SAASmS,GAAsBnS,GAC9B,OACCgS,GAAWhS,IACXA,EAAMsK,WAAa,CAErB,CCQA,SAAS6H,GAAsBnS,GAC9B,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCeA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICAA9C,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC9BA,IAAI2H,GAAmB,WCGvB,SAASC,GAAmBrS,GAC3B,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,EAElB,CCZA,IAAIC,GAAyB,iBCD7B,SAASC,GAAcxS,GACtB,MACkB,iBAAVA,GACG,OAAVA,GACwB,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,EAElB,CCxBA,IAAIG,GAA0C,mBAAhBC,YAqB9B,SAASC,GAAe3S,GACvB,OACGyS,IAAkBzS,aAAiB0S,aACZ,yBAAzBzI,GAAajK,EAEf,CCZA,SAASyK,GAAUzK,GAClB,MACkB,iBAAVA,GACG,OAAVA,IACCqD,GAASrD,EAEZ,CCeA,IAAA4S,GAAA1D,GAAA5F,GAAAkB,aACAqI,GAAA3D,GAAA5F,GAAAmB,UAKAqI,GAAA5D,GAAA5F,IACA3B,EAAAmL,GAAA,aAAAF,IACAjL,EAAAmL,GAAA,UAAAD,IClDA,IAAIpO,GAAK,ICoBT,SAASsO,GAAW/S,GACnB,MAA0B,kBAAVA,CACjB,CCGA,IAAIgT,GAAOC,QCxBPrR,GAAWqR,QAAQjS,UAAUY,SCSjC,IAAI2H,GAAMW,KAqBV,SAAS6I,GAAW/S,GACnB,MAAsB,iBAAVA,IACNA,aAAiBiT,KAGjB1J,GCtBP,SAAevJ,GACd,IAEC,OADA4B,GAASK,KAAMjC,IACR,CACP,CAAC,MAAQkG,GACT,OAAO,CACP,CACF,CDgBUqE,CAAMvK,GAEoB,qBAAzBiK,GAAajK,IAGxB,CERA,SAAS+S,GAAW/S,GACnB,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCUA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,IC7CA,IAAIpE,GAAwB,iBAAT6M,KAAsBA,KAAO,KCA5C7M,GAA0B,iBAAX8M,OAAwBA,OAAS,KCAhD9M,GAA0B,iBAAX+M,OAAwBA,OAAS,KCAhD/M,GAA8B,iBAAfgN,WAA4BA,WAAa,KCK5D,IAAIC,GCsBJ,SAAoBC,GACnB,GAAKlP,UAAU1D,OAAS,CACvB,IAAMoS,GAAWQ,GAChB,MAAM,IAAIrP,UAAWiB,EAAQ,yDAA0DoO,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,IAAIjS,MAAO,qDAClB,CDlDWkS,GACPC,GAAWR,GAAKS,UAAYT,GAAKS,SAASC,WGR1CC,GAAaxE,UCwBjB,IAAI7P,GCNY,mBAAP6E,IAGe,iBAAfwP,IAGa,mBAAbH,GCXT,SAAiB3J,GAChB,OAAO+J,GAAU/J,GAAIlJ,aACtB,ECqBA,SAAiBkJ,GAChB,IAAIgK,EAGJ,OAAW,OAANhK,EACG,OAKM,YAHdgK,SAAchK,GAIN+J,GAAU/J,GAAIlJ,cAEfkT,CACR,EC7BA,SAASC,GAAYpU,GAEpB,MAA6B,aAApBqU,GAAQrU,EAClB,CCCA,SAAS2H,GAAatB,EAAKC,EAAMtG,GAChCF,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdC,UAAY,EACZlH,MAASA,GAEX,CCLA,SAASsU,GAAYC,EAAMC,GAC1B,KAAQC,gBAAgBH,IACvB,MAAM,IAAIpQ,UAAW,0EAEtB,IAAMnE,GAAUwU,GACf,MAAM,IAAIrQ,UAAWiB,EAAQ,kEAAmEoP,IAEjG,IAAMxU,GAAUyU,GACf,MAAM,IAAItQ,UAAWiB,EAAQ,uEAAwEqP,IAItG,OAFAE,GAAuBD,KAAM,KAAMF,GACnCG,GAAuBD,KAAM,KAAMD,GAC5BC,IACR,CAeA9M,EAAa2M,GAAY,OAAQ,cAcjC3M,EAAa2M,GAAY,oBAAqB,GAgBnCvN,EAAEuN,GAAWtT,UAAW,oBAAqB,GAgB7C+F,EAAEuN,GAAWtT,UAAW,aAAc,IAgBtC+F,EAAEuN,GAAWtT,UAAW,YC/GnC,WAEC,IAAIV,EAAM,GAAKmU,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdtU,GAAO,OAAUmU,KAAKG,GAEtBtU,GAAO,MAAQmU,KAAKG,GAErBtU,GAAO,GAER,IDyHWyG,EAAEuN,GAAWtT,UAAW,UEnInC,WAEC,IAAIZ,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAIuU,GAAKF,KAAKE,GACdvU,EAAIwU,GAAKH,KAAKG,GACPxU,CACR,ICXA,IAAIyU,GAAkC,mBAAhBzS,KAAKyS,OAA0BzS,KAAKyS,OAAS,KCK/DC,GAAe,IAAIhH,GAAc,GCuBrC,IAAAiH,GATwB,mBAAZ3O,GACQA,GDApB,SAA2BgD,GAE1B,OADA0L,GAAc,GAAM1L,EACb0L,GAAc,EACtB,EEGA,SAASE,GAAWT,EAAMC,GACzB,KAAQC,gBAAgBO,IACvB,MAAM,IAAI9Q,UAAW,0EAEtB,IAAMnE,GAAUwU,GACf,MAAM,IAAIrQ,UAAWiB,EAAQ,kEAAmEoP,IAEjG,IAAMxU,GAAUyU,GACf,MAAM,IAAItQ,UAAWiB,EAAQ,uEAAwEqP,IAItG,OAFAE,GAAuBD,KAAM,KAAMQ,GAAkBV,IACrDG,GAAuBD,KAAM,KAAMQ,GAAkBT,IAC9CC,IACR,CCfA,SAASS,GAAelV,GACvB,OAAKA,aAAiBsU,IAActU,aAAiBgV,IAInC,iBAAVhV,GACG,OAAVA,GACoB,iBAAbA,EAAM2U,IACO,iBAAb3U,EAAM4U,EAEf,CCPA,SAASO,GAAQ/L,GAChB,OAAO4I,GAAW5I,EAAE,EACrB,CCdA,SAASgM,KACR,MACmB,mBAAX5L,IACoB,iBAApBA,GAAQ,QACfK,GAAYL,GAAQ,aACO,iBAApBA,GAAO6L,QAEhB,CHgCA1N,EAAaqN,GAAW,OAAQ,aAchCrN,EAAaqN,GAAW,oBAAqB,GAgBlCjO,EAAEiO,GAAUhU,UAAW,oBAAqB,GAgB5C+F,EAAEiO,GAAUhU,UAAW,aAAc,GAgBrC+F,EAAEiO,GAAUhU,UAAW,YIhHlC,WAEC,IAAIV,EAAM,GAAKmU,KAAKE,GAOpB,OANKF,KAAKG,GAAK,EACdtU,GAAO,OAAUmU,KAAKG,GAEtBtU,GAAO,MAAQmU,KAAKG,GAErBtU,GAAO,GAER,IJ0HWyG,EAAEiO,GAAUhU,UAAW,UKpIlC,WAEC,IAAIZ,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAIuU,GAAKF,KAAKE,GACdvU,EAAIwU,GAAKH,KAAKG,GACPxU,CACR,ICwCA,IAAIkV,GAAmBF,KAA+B5L,OAAO6L,SAAW,KCxBxE,SAASE,GAAkClP,EAAKC,EAAM8B,GACrDtI,EAAgBuG,EAAKC,EAAM,CAC1BU,cAAgB,EAChBC,YAAc,EACdL,IAAOwB,GAET,CCrBA,SAASmM,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCFA,SAASH,GAAMgB,GACd,OAAOA,EAAEZ,EACV,CCEA,SAASa,GAAcC,GACtB,IAAItV,EACA+J,EACAqL,EAGJ,IADApV,EAAM,KAEL+J,EAAIuL,EAAGC,QACAC,MAIP,GAAKvD,GADLmD,EAAIrL,EAAEnK,QACyBwV,EAAE7U,QAAU,EAC1CP,EAAI8E,KAAMsQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAItR,UAAWiB,EAAQ,kJAAmJqQ,IAFjLpV,EAAI8E,KAAM2Q,GAAOL,GAAKM,GAAON,GAG7B,CAEF,OAAOpV,CACR,CCAA,IAAAT,GAAA,EAAAmO,GAAAnO,kBACAoW,GAAAX,KAYA,SAAAY,GAAAhW,GACA,OACAA,aAAA6P,IAEA,iBAAA7P,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAC,MACA,oBAAAjN,EAAAgN,YAAAC,OAEA,iBAAAjN,EAAAiW,SAGA,iBAAAjW,EAAAkW,OAGA,CASA,SAAAC,GAAAnW,GACA,OACAA,IAAA6P,IAGA,oBAAA7P,EAAAiN,IAEA,CAUA,SAAAmJ,GAAAC,EAAApO,GAEA,OAAA,IAAA+M,GAAAqB,EADApO,GAAA,GACAoO,EAAApO,EAAA,GACA,CAyEA,SAAA4H,KACA,IAAAjC,EACA0I,EACAD,EACAhN,EAGA,GADAiN,EAAAjS,UAAA1D,SACA8T,gBAAA5E,IACA,OAAA,IAAAyG,EACA,IAAAzG,GAEA,IAAAyG,EACA,IAAAzG,GAAAxL,UAAA,IAEA,IAAAiS,EACA,IAAAzG,GAAAxL,UAAA,GAAAA,UAAA,IAEA,IAAAwL,GAAAxL,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAAvI,GAAA,QACA,GAAA,IAAAwI,EACA,GAAAnE,GAAA9N,UAAA,IACAgS,EAAA,IAAAvI,GAAA,EAAAzJ,UAAA,SACA,GAAAmO,GAAAnO,UAAA,IAKA,IAHAgF,GADAgN,EAAAhS,UAAA,IACA1D,SAGA0C,GAAAgT,IAAAnB,GAAAmB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKrO,GACxB,IAAIqB,EACAc,EACAhK,EACA8D,EAIJ,IAFAoF,EAAMrB,EAAIrH,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,IAAM+U,GADN/K,EAAInC,EAAK7H,IAER,OAAO,KAERkW,EAAKpS,GAAM4R,GAAO1L,GAClBkM,EAAKpS,EAAE,GAAM6R,GAAO3L,GACpBlG,GAAK,CACL,CACD,OAAOoS,CACR,CDsKAE,CAAA,IAAAzI,GAAA,EAAAzE,GAAAgN,GACA,OAAAA,EAAA,CAEA,IAAAlB,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,6GAAAkE,IAGAgN,EAAA,IAAAvI,GAAAzJ,UAAA,GACA,MACA,CACA,GAAA6I,GAAAmJ,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAAtJ,GAAAsJ,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAlB,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,6HAAAkE,IAEAgN,EAAA,IAAAvI,GAAAuI,EACA,MACA,GAAA1D,GAAAtO,UAAA,IAAA,CAEA,IAAA2N,IADAqE,EAAAhS,UAAA,IACAsS,WAAAhX,IACA,MAAA,IAAA6W,WAAArR,EAAA,yFAAAxF,GAAA0W,EAAAM,aAEAN,EAAA,IAAAvI,GAAAuI,EACA,KAAA,KAAA5L,GAAApG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAgS,EAAAhS,UAAA,IACA,IAAA0R,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAAkR,IAEA,IAAAjC,GAAAiC,EAAAO,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAAkR,IAGA,IAAAjC,IADAiC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAAkR,IAGA,IADAA,EAAAZ,GAAAY,cACA1U,MACA,MAAA0U,EAEAA,EAAA,IAAAvI,GAAAuI,EAGA,KACA,CAEA,IAAA1D,GADA0D,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAlE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,IAAAoE,GAAApE,EAAAjO,IACA,MAAA,IAAA6W,WAAArR,EAAA,uEAAAxF,GAAAiO,IAEA,GAAA,IAAA0I,EAAA,CAEA,IAAAtE,IADA3I,EAAAgN,EAAAM,WAAA/I,GACAjO,IACA,MAAA,IAAA6W,WAAArR,EAAA,oGAAAxF,GAAA0J,IAEAgN,EAAA,IAAAvI,GAAAuI,EAAAzI,EACA,KAAA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAA0W,EAAAM,WAAA/I,EACA,MAAA,IAAA4I,WAAArR,EAAA,iJAAAkE,EAAA1J,KAEA0W,EAAA,IAAAvI,GAAAuI,EAAAzI,EAAA,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA8M,KAAA,UAAA4B,GACA1O,EAAA8M,KAAA,UAAA4B,EAAA1V,OAAA,GAEA8T,IACA,CEzQA,SAASF,GAAMiB,GACd,OAAOA,EAAEb,EACV,CCFA,SAASH,GAAMgB,GACd,OAAOA,EAAEZ,EACV,CCEA,SAASa,GAAcC,GACtB,IAAItV,EACA+J,EACAqL,EAGJ,IADApV,EAAM,KAEL+J,EAAIuL,EAAGC,QACAC,MAIP,GAAKvD,GADLmD,EAAIrL,EAAEnK,QACyBwV,EAAE7U,QAAU,EAC1CP,EAAI8E,KAAMsQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAItR,UAAWiB,EAAQ,kJAAmJqQ,IAFjLpV,EAAI8E,KAAMqP,GAAMiB,GAAKhB,GAAMgB,GAG3B,CAEF,OAAOpV,CACR,CJ+PAuH,EAAAkI,GAAA,oBAAAlQ,IAeAgI,EAAAkI,GAAA,OAAA,kBAmDA9I,EAAA8I,GAAA,QAAA,SAAAgH,GACA,IAAAC,EACAR,EACAS,EACA3W,EACAiW,EACAW,EACApQ,EACAyC,EACA4N,EACA9M,EACAhK,EACA8D,EACA,IAAAmQ,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiS,GAAA1B,MACA,MAAA,IAAAvQ,UAAA,6DAGA,IADAoS,EAAAjS,UAAA1D,QACA,EAAA,CAEA,IAAAyT,GADA2C,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAA2R,GAAAa,GAAA,CAEA,GADAxN,EAAAwN,EAAAlW,OACAoW,EAAA,CAIA,IAFAV,GADAjW,EAAA,IAAAqU,KAAApL,IACA6M,QACAjS,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA+U,GADA/K,EAAA4M,EAAA9U,KAAA6U,EAAAD,EAAAjQ,IAAAzG,GAAAA,IAEAkW,EAAApS,GAAA4R,GAAA1L,GACAkM,EAAApS,EAAA,GAAA6R,GAAA3L,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAkM,EAAApS,GAAAkG,EAAA,GACAkM,EAAApS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAqU,KAAAoC,EACA,CACA,GAAArE,GAAAqE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPA1N,EAAAwN,EAAAlW,OAEAiG,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACAgG,EAAA,WAEAzE,EAAA,WAGAjI,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA,IAAA+U,GAAAtO,EAAAiQ,EAAA1W,IAAA,CACA8W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,+FAAA,EAAAkE,IAIA,IADAgN,GADAjW,EAAA,IAAAqU,KAAApL,EAAA,IACA6M,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA4W,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAA1W,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAiW,GADAjW,EAAA,IAAAqU,KAAApL,IACA6M,QACAjS,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA+U,GADA/K,EAAA4M,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAA1W,GAAAA,IAEAkW,EAAApS,GAAA4R,GAAA1L,GACAkM,EAAApS,EAAA,GAAA6R,GAAA3L,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAkM,EAAApS,GAAAkG,EAAA,GACAkM,EAAApS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAqU,KAAAoC,EACA,CACA,GAAApM,GAAAoM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAOA,GAJAG,EADAD,EK/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAI1W,EACA+J,EACAqL,EACArV,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIuL,EAAGC,QACAC,MAKP,GAFAzV,GAAK,EAEAkS,GADLmD,EAAIuB,EAAK9U,KAAM6U,EAAS3M,EAAEnK,MAAOG,KACFqV,EAAE7U,QAAU,EAC1CP,EAAI8E,KAAMsQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAItR,UAAWiB,EAAQ,+IAAgJqQ,IAF9KpV,EAAI8E,KAAM2Q,GAAOL,GAAKM,GAAON,GAG7B,CAEF,OAAOpV,CACR,CLwaA8W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAArV,MACA,MAAAqV,EAKA,IADAX,GADAjW,EAAA,IAAAqU,KADApL,EAAA2N,EAAArW,OAAA,IAEAuV,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA6W,EAAA7W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAlP,EAAAkI,GAAA,MAAA,WACA,IAAAzK,EACAjF,EACA,IAAAiU,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiS,GAAA1B,MACA,MAAA,IAAAvQ,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAsU,KAAArP,EACA,IAuDA2B,EAAA8I,GAAA7O,UAAA,MAAA,SAAAiH,GACA,IAAA+N,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAKA,GAHAA,EAAA,IACAA,GAAAwM,KAAAwB,WAEAhO,EAAA,GAAAA,GAAAwM,KAAAwB,SAGA,OAAAG,GAAA3B,KAAAyB,QAAAjO,EACA,IAgBAsN,GAAA1F,GAAA7O,UAAA,UAAA,WACA,OAAAyT,KAAAyB,QAAAvI,MACA,IAgBA4H,GAAA1F,GAAA7O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAS,UACA,IAgBApB,GAAA1F,GAAA7O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAtI,UACA,IAiBA7G,EAAA8I,GAAA7O,UAAA,oBAAA6O,GAAAlQ,mBAuCAgI,EAAAkI,GAAA7O,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAApB,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA8T,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA/S,UAAA,IAEAoQ,IACA,IAqCA1N,EAAA8I,GAAA7O,UAAA,WAAA,WACA,IAAAkS,EACAoE,EACAjO,EACAgN,EACA9M,EACApJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAiBA,OAfAgP,EAAAuB,KACA4B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAA,CAAAG,EAAAiW,GAAAC,EAAAlW,IACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAAqE,SACA,IAjDAD,CAkDA,IA+BA3P,EAAAkI,GAAA7O,UAAA,SAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,IAAA0O,EAAA5M,KAAA6U,EAAAV,GAAAC,EAAAlW,GAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA2CA9M,EAAAkI,GAAA7O,UAAA,QAAA,SAAAhB,EAAAoX,EAAAI,GACA,IAAAnB,EACAhN,EACApB,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAlV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAqW,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAoF,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAA/N,GACA,IACA+N,EAAA,GAGA/S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAAnO,GACA,IACAmO,EAAA,GAGAA,EAAAnO,IACAmO,EAAAnO,EAEA,MACAmO,EAAAnO,CAEA,MACA+N,EAAA,EACAI,EAAAnO,EAIA,IAFAsL,EAAAkB,GAAA7V,GACA4U,EAAAkB,GAAA9V,GACAG,EAAAiX,EAAAjX,EAAAqX,EAAArX,IAEAkW,EADApO,EAAA,EAAA9H,GACAwU,EACA0B,EAAApO,EAAA,GAAA2M,EAEA,OAAAH,IACA,IA2CA9M,EAAAkI,GAAA7O,UAAA,UAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAjW,EACAD,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAwH,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAqV,EAAAY,GAAAC,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,OACArU,EAAA8E,KAAAsQ,GAGA,OAAA,IAAAf,KAAAzH,YAAA5M,EACA,IAsCAuH,EAAAkI,GAAA7O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAqV,EAAAY,GAAAC,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAe,CAGA,IAgCA7N,EAAAkI,GAAA7O,UAAA,aAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAqV,EAAAY,GAAAC,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IAsCAwH,EAAAkI,GAAA7O,UAAA,YAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAqV,EAAAY,GAAAC,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAe,CAGA,IAgCA7N,EAAAkI,GAAA7O,UAAA,iBAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAqV,EAAAY,GAAAC,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IA4BAwH,EAAAkI,GAAA7O,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAqV,EAAAY,GAAAC,EAAAlW,GACAsX,EAAAxV,KAAA6U,EAAAtB,EAAArV,EAAAsU,KAEA,IAyCA1N,EAAA8I,GAAA7O,UAAA,OAAA,SAAAiH,GACA,IAAA+N,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAwM,KAAAwB,SAGA,OAAAG,GAAA3B,KAAAyB,QAAAjO,EACA,IAmCAN,EAAAkI,GAAA7O,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAAkI,GAAA7O,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyBA4G,EAAA8I,GAAA7O,UAAA,QAAA,SAAA4W,GACA,IAAAxX,EACAiW,EACAwB,EACA1X,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkX,EAAA,QACA,KAAAvO,GAAAsO,GAGA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,IAFAC,EAAAD,CAGA,CAGA,IAFAxX,EAAA,GACAiW,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAAkR,GAAAC,EAAAlW,GAAAyB,YAEA,OAAAxB,EAAA0X,KAAAD,EACA,IA4BA9Q,EAAA8I,GAAA7O,UAAA,QAAA,WACA,IAAAkS,EACAoE,EACAjO,EACAE,EACApJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAgBA,OAdAgP,EAAAuB,KACApL,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAG,EACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6E,MACA,IAjDAT,CAkDA,IAsCA3P,EAAAkI,GAAA7O,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAKA,IAHAtB,EAAAkB,GAAA6B,GACA9C,EAAAkB,GAAA4B,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,GAAA,EAAAA,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAgBAoV,GAAA1F,GAAA7O,UAAA,UAAA,WACA,OAAAyT,KAAAwB,OACA,IAyCAtO,EAAAkI,GAAA7O,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA3B,EACAjW,EACAD,EACAgK,EACA,IAAA6L,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAwB,UACAC,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAA+U,GADA/K,EAAAsN,EAAAxV,KAAA6U,EAAAV,GAAAC,EAAAlW,GAAAA,EAAAsU,OAEAuD,EAAA,EAAA7X,GAAA0V,GAAA1L,GACA6N,EAAA,EAAA7X,EAAA,GAAA2V,GAAA3L,OACA,KAAAkI,GAAAlI,IAAA,IAAAA,EAAAxJ,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHA6N,EAAA,EAAA7X,GAAAgK,EAAA,GACA6N,EAAA,EAAA7X,EAAA,GAAAgK,EAAA,EAGA,CAEA,OAAA/J,CACA,IAmCAuH,EAAAkI,GAAA7O,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA9O,EAEAlJ,EAEA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAA/B,GAAAC,EAAA,GACAlW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IAEAgY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAlW,GACAA,EAAAsU,MAEA,OAAA0D,CACA,IAmCAxQ,EAAAkI,GAAA7O,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA9O,EAEAlJ,EAEA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAA/B,GAAAC,EAAAhN,EAAA,GACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IAEAgY,EAAAF,EAAAE,EADA/B,GAAAC,EAAAlW,GACAA,EAAAsU,MAEA,OAAA0D,CACA,IAmDApR,EAAA8I,GAAA7O,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA3N,EACA+O,EACAjY,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAKA,IAHAmF,EAAAoL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACAkC,EAAArG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAAiY,EAAAjY,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA6W,EAAAX,EAAA,EAAAlW,GACAkW,EAAA,EAAAlW,GAAAkW,EAAA,EAAApS,GACAoS,EAAA,EAAApS,GAAA+S,EACAA,EAAAX,EAAA,EAAAlW,EAAA,GACAkW,EAAA,EAAAlW,EAAA,GAAAkW,EAAA,EAAApS,EAAA,GACAoS,EAAA,EAAApS,EAAA,GAAA+S,EAEA,OAAAvC,IACA,IAgEA1N,EAAA8I,GAAA7O,UAAA,OAAA,SAAAhB,GAEA,IAAAqY,EACApQ,EACAoO,EACAW,EACAC,EACAmB,EACAjO,EACAhK,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAGA,GADAmS,EAAA5B,KAAAyB,QACA7R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAAiN,GAAAlV,GAAA,CACA,GAAAiI,GAAAwM,KAAAwB,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA8C,IAKA,OAFAoO,EADApO,GAAA,GACA4N,GAAA7V,QACAqW,EAAApO,EAAA,GAAA6N,GAAA9V,GAEA,CACA,GAAAgW,GAAAhW,GAAA,CAEA,GAAAiI,GADAmQ,EAAApY,EAAAiW,SACAxB,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAArY,EAAAkW,QAGAjS,EAAAoS,EAAAzI,WAAA3F,EAAAtI,GAEA0Y,EAAA1K,SAAA0I,EAAA1I,QAEA0K,EAAAzK,WAAA3J,GACAoU,EAAAzK,WAAAyK,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAlJ,GAAAuK,EAAA1X,QACAR,EAAA,EAAAA,EAAAkY,EAAA1X,OAAAR,IACA6W,EAAA7W,GAAAkY,EAAAlY,GAEAkY,EAAArB,CACA,CAGA,IAFA/O,GAAA,EACAhE,EAAA,EACA9D,EAAA,EAAAA,EAAAiY,EAAAjY,IACAkW,EAAApO,GAAAoQ,EAAApU,GACAoS,EAAApO,EAAA,GAAAoQ,EAAApU,EAAA,GACAgE,GAAA,EACAhE,GAAA,CAGA,KAhCA,CAiCA,IAAAuO,GAAAxS,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAoY,EAAApY,EAAAW,OACAR,EAAA,EAAAA,EAAAiY,EAAAjY,IACA,IAAA+U,GAAAlV,EAAAG,IAAA,CACA8W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAAiD,GACA,MAAA,IAAA5B,WAAArR,EAAA,6GAAAiT,IAEA,GAAAnQ,EAAAmQ,EAAA,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAArY,EAGAiE,EAAAoS,EAAAzI,WAAA3F,EAAAtI,GAEA0Y,EAAA1K,SAAA0I,EAAA1I,QAEA0K,EAAAzK,WAAA3J,GACAoU,EAAAzK,WAAAyK,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAAlJ,GAAAsK,GACAjY,EAAA,EAAAA,EAAAiY,EAAAjY,IACA6W,EAAA7W,GAAAkY,EAAAlY,GAEAkY,EAAArB,CACA,CAIA,IAHA/O,GAAA,EACAmQ,GAAA,EACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAiY,EAAAjY,IACAkW,EAAApO,GAAAoQ,EAAApU,GACAoS,EAAApO,EAAA,GAAAoQ,EAAApU,EAAA,GACAgE,GAAA,EACAhE,GAAA,EAEA,MACA,CAEA,GAAAgE,EAAAmQ,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAvO,GAAA,EACA9H,EAAA,EAAAA,EAAAiY,EAAAjY,IACAgK,EAAAnK,EAAAG,GACAkW,EAAApO,GAAA4N,GAAA1L,GACAkM,EAAApO,EAAA,GAAA6N,GAAA3L,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAAkI,GAAA7O,UAAA,SAAA,SAAAoW,EAAAI,GACA,IAAAc,EACAN,EACA5X,EACA6H,EACAoO,EACAhN,EACAlJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACAyW,EAAA,EACAI,EAAAnO,MACA,CACA,IAAA2I,GAAAoF,GACA,MAAA,IAAAlT,UAAAiB,EAAA,oEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAA/N,GACA,IACA+N,EAAA,GAGA,IAAA/S,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAQA,IANAiP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAsL,IACApC,QACA/V,EAAA,EAAAA,EAAAmY,EAAAnY,IACA8H,EAAA,GAAA9H,EAAAiX,GACAY,EAAA,EAAA7X,GAAAkW,EAAApO,GACA+P,EAAA,EAAA7X,EAAA,GAAAkW,EAAApO,EAAA,GAEA,OAAA7H,CACA,IA+BAuH,EAAAkI,GAAA7O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,GAAA0O,EAAA5M,KAAA6U,EAAAV,GAAAC,EAAAlW,GAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA6EA1N,EAAA8I,GAAA7O,UAAA,QAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAhN,EACAlJ,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACAe,EAAA,GACA7W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6W,EAAA9R,KAAAkR,GAAAC,EAAAlW,IAGA,IADA6W,EAAAwB,KAAAD,GACApY,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAEAkW,EADApS,EAAA,EAAA9D,GACA0V,GAAAmB,EAAA7W,IACAkW,EAAApS,EAAA,GAAA6R,GAAAkB,EAAA7W,IAEA,OAAAsU,IACA,IA2EA9M,EAAAkI,GAAA7O,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAlQ,EACA+O,EACAhN,EACA,IAAA2M,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACA8X,EAAA,EACAjB,EAAAnO,MACA,CACA,IAAA2I,GAAAyG,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAApP,GACA,IACAoP,EAAA,GAGA,IAAApU,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAWA,OAVAoP,GAAApP,GACAA,EAAA,EACA/B,EAAA+O,EAAAM,YACA8B,GAAAjB,GACAnO,EAAA,EACA/B,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,KAEA0J,EAAAmO,EAAAiB,EACAnR,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,IAEA,IAAA8U,KAAAzH,YAAAqJ,EAAA1I,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAAkI,GAAA7O,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAzY,EACAiW,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkY,EAAA,OACA,KAAAvP,GAAAoP,KAAA5F,GAAA4F,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAA1D,OAAA,EACAiY,EAAA,CAAA,MACA,KAAAnO,GAAAkO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAAkR,GAAAC,EAAAlW,GAAA2Y,eAAAD,EAAAD,IAEA,OAAAxY,EAAA0X,KAAA,IACA,IAmDA/Q,EAAA8I,GAAA7O,UAAA,cAAA,WACA,IAAAgX,EACA5X,EACAiJ,EACAgN,EACAlW,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAMA,IAJAmF,EAAAoL,KAAAwB,QACA7V,EAAA,IAAAqU,KAAAzH,YAAA3D,GACAgN,EAAA5B,KAAAyB,QACA8B,EAAA5X,EAAA8V,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA6X,EAAA,EAAA7X,GAAAkW,EAAA,EAAApS,GACA+T,EAAA,EAAA7X,EAAA,GAAAkW,EAAA,EAAApS,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA8I,GAAA7O,UAAA,YAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAhN,EACAlJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACAe,EAAA,GACA7W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6W,EAAA9R,KAAAkR,GAAAC,EAAAlW,IAGA,OADA6W,EAAAwB,KAAAD,GACA,IAAA1I,GAAAmH,EACA,IAoBAjQ,EAAA8I,GAAA7O,UAAA,YAAA,WACA,IAAAZ,EACAiW,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,IAFA9D,EAAA,GACAiW,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAAkR,GAAAC,EAAAlW,GAAAyB,YAEA,OAAAxB,EAAA0X,KAAA,IACA,IA0CA/Q,EAAA8I,GAAA7O,UAAA,UAAA,WACA,IAAAsW,EACApE,EACA7J,EACAE,EACA8M,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAiBA,OAfAgP,EAAAuB,KACA4B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAoW,GAAAC,EAAAlW,GACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6F,QACA,IAjDAzB,CAkDA,IAuCA3P,EAAAkI,GAAA7O,UAAA,QAAA,SAAAgY,EAAAhZ,GACA,IAAAqW,EACAjW,EACAiJ,EACA,IAAA2M,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAA8N,GAAAgH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA3P,EAAAoL,KAAAwB,QACA+C,EAAA,IACAA,GAAA3P,GAEA2P,EAAA,GAAAA,GAAA3P,EACA,MAAA,IAAAmN,WAAArR,EAAA,kEAAA6T,IAEA,IAAA9D,GAAAlV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAqW,GADAjW,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAyB,UACAA,SACA,EAAA8C,GAAAnD,GAAA7V,GACAqW,EAAA,EAAA2C,EAAA,GAAAlD,GAAA9V,GACAI,CACA,IM15FA,IAAAT,GAAA,EAAAyN,GAAAzN,kBACAoW,GAAAX,KAYA,SAAAY,GAAAhW,GACA,OACAA,aAAA8P,IAEA,iBAAA9P,GACA,OAAAA,IAEA,mBAAAA,EAAAgN,YAAAC,MACA,oBAAAjN,EAAAgN,YAAAC,OAEA,iBAAAjN,EAAAiW,SAGA,iBAAAjW,EAAAkW,OAGA,CASA,SAAAC,GAAAnW,GACA,OACAA,IAAA8P,IAGA,mBAAA9P,EAAAiN,IAEA,CAUA,SAAAgM,GAAA5C,EAAApO,GAEA,OAAA,IAAAqM,GAAA+B,EADApO,GAAA,GACAoO,EAAApO,EAAA,GACA,CAyEA,SAAA6H,KACA,IAAAlC,EACA0I,EACAD,EACAhN,EAGA,GADAiN,EAAAjS,UAAA1D,SACA8T,gBAAA3E,IACA,OAAA,IAAAwG,EACA,IAAAxG,GAEA,IAAAwG,EACA,IAAAxG,GAAAzL,UAAA,IAEA,IAAAiS,EACA,IAAAxG,GAAAzL,UAAA,GAAAA,UAAA,IAEA,IAAAyL,GAAAzL,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAAjJ,GAAA,QACA,GAAA,IAAAkJ,EACA,GAAAnE,GAAA9N,UAAA,IACAgS,EAAA,IAAAjJ,GAAA,EAAA/I,UAAA,SACA,GAAAmO,GAAAnO,UAAA,IAKA,IAHAgF,GADAgN,EAAAhS,UAAA,IACA1D,SAGA0C,GAAAgT,IAAAnB,GAAAmB,EAAA,KAEA,GADAA,ECxLA,SAAoBA,EAAKrO,GACxB,IAAIqB,EACAc,EACAhK,EACA8D,EAIJ,IAFAoF,EAAMrB,EAAIrH,OACVsD,EAAI,EACE9D,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,IAAM+U,GADN/K,EAAInC,EAAK7H,IAER,OAAO,KAERkW,EAAKpS,GAAMsQ,GAAMpK,GACjBkM,EAAKpS,EAAE,GAAMuQ,GAAMrK,GACnBlG,GAAK,CACL,CACD,OAAOoS,CACR,CDsKAE,CAAA,IAAAnJ,GAAA,EAAA/D,GAAAgN,GACA,OAAAA,EAAA,CAEA,IAAAlB,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,6GAAAkE,IAGAgN,EAAA,IAAAjJ,GAAA/I,UAAA,GACA,MACA,CACA,GAAA6I,GAAAmJ,GACAA,EAAAI,GAAAJ,EAAA,QACA,GAAAtJ,GAAAsJ,GACAA,EAAAK,GAAAL,EAAA,QACA,IAAAlB,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,6HAAAkE,IAEAgN,EAAA,IAAAjJ,GAAAiJ,EACA,MACA,GAAA1D,GAAAtO,UAAA,IAAA,CAEA,IAAA2N,IADAqE,EAAAhS,UAAA,IACAsS,WAAAhX,IACA,MAAA,IAAA6W,WAAArR,EAAA,yFAAAxF,GAAA0W,EAAAM,aAEAN,EAAA,IAAAjJ,GAAAiJ,EACA,KAAA,KAAA5L,GAAApG,UAAA,IAkBA,MAAA,IAAAH,UAAAiB,EAAA,qHAAAd,UAAA,KAhBA,GADAgS,EAAAhS,UAAA,IACA,IAAA0R,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAAkR,IAEA,IAAAjC,GAAAiC,EAAAO,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAAkR,IAGA,IAAAjC,IADAiC,EAAAA,EAAAO,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAAkR,IAGA,IADAA,EAAAZ,GAAAY,cACA1U,MACA,MAAA0U,EAEAA,EAAA,IAAAjJ,GAAAiJ,EAGA,KACA,CAEA,IAAA1D,GADA0D,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAlE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,IAAAoE,GAAApE,EAAAjO,IACA,MAAA,IAAA6W,WAAArR,EAAA,uEAAAxF,GAAAiO,IAEA,GAAA,IAAA0I,EAAA,CAEA,IAAAtE,IADA3I,EAAAgN,EAAAM,WAAA/I,GACAjO,IACA,MAAA,IAAA6W,WAAArR,EAAA,oGAAAxF,GAAA0J,IAEAgN,EAAA,IAAAjJ,GAAAiJ,EAAAzI,EACA,KAAA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAA0W,EAAAM,WAAA/I,EACA,MAAA,IAAA4I,WAAArR,EAAA,iJAAAkE,EAAA1J,KAEA0W,EAAA,IAAAjJ,GAAAiJ,EAAAzI,EAAA,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA8M,KAAA,UAAA4B,GACA1O,EAAA8M,KAAA,UAAA4B,EAAA1V,OAAA,GAEA8T,IACA,CEzQA,SAASgB,GAAcC,GACtB,IAAItV,EACA+J,EAGJ,IADA/J,EAAM,KAEL+J,EAAIuL,EAAGC,QACAC,MAGPxV,EAAI8E,KAAM+N,GAAS9I,EAAEnK,QAEtB,OAAOI,CACR,CF2QAuH,EAAAmI,GAAA,oBAAAnQ,IAeAgI,EAAAmI,GAAA,OAAA,mBAmDA/I,EAAA+I,GAAA,QAAA,SAAA+G,GACA,IAAAC,EACAR,EACAS,EACA3W,EACAiW,EACAW,EACApQ,EACAyC,EACA4N,EACA9M,EACAhK,EACA8D,EACA,IAAAmQ,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiS,GAAA1B,MACA,MAAA,IAAAvQ,UAAA,6DAGA,IADAoS,EAAAjS,UAAA1D,QACA,EAAA,CAEA,IAAAyT,GADA2C,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAA2R,GAAAa,GAAA,CAEA,GADAxN,EAAAwN,EAAAlW,OACAoW,EAAA,CAIA,IAFAV,GADAjW,EAAA,IAAAqU,KAAApL,IACA6M,QACAjS,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA+U,GADA/K,EAAA4M,EAAA9U,KAAA6U,EAAAD,EAAAjQ,IAAAzG,GAAAA,IAEAkW,EAAApS,GAAAsQ,GAAApK,GACAkM,EAAApS,EAAA,GAAAuQ,GAAArK,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAkM,EAAApS,GAAAkG,EAAA,GACAkM,EAAApS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAqU,KAAAoC,EACA,CACA,GAAArE,GAAAqE,GAAA,CACA,GAAAE,EAAA,CAUA,IAPA1N,EAAAwN,EAAAlW,OAEAiG,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACAgG,EAAA,WAEAzE,EAAA,WAGAjI,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA,IAAA+U,GAAAtO,EAAAiQ,EAAA1W,IAAA,CACA8W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAA9L,GACA,MAAA,IAAAmN,WAAArR,EAAA,gGAAAkE,IAIA,IADAgN,GADAjW,EAAA,IAAAqU,KAAApL,EAAA,IACA6M,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA4W,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAA1W,GAAAA,GAEA,OAAAC,CACA,CAKA,IAFAiW,GADAjW,EAAA,IAAAqU,KAAApL,IACA6M,QACAjS,EAAA,EACA9D,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAAA,CAEA,GAAA+U,GADA/K,EAAA4M,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAA1W,GAAAA,IAEAkW,EAAApS,GAAAsQ,GAAApK,GACAkM,EAAApS,EAAA,GAAAuQ,GAAArK,OACA,MAAAkI,GAAAlI,IAAAA,EAAAxJ,QAAA,GAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHAkM,EAAApS,GAAAkG,EAAA,GACAkM,EAAApS,EAAA,GAAAkG,EAAA,EAGA,CACAlG,GAAA,CACA,CACA,OAAA7D,CACA,CACA,OAAA,IAAAqU,KAAAoC,EACA,CACA,GAAApM,GAAAoM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAOA,GAJAG,EADAD,EG/bA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAI1W,EACA+J,EACAqL,EACArV,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIuL,EAAGC,QACAC,MAKP,GAFAzV,GAAK,EAEAkS,GADLmD,EAAIuB,EAAK9U,KAAM6U,EAAS3M,EAAEnK,MAAOG,KACFqV,EAAE7U,QAAU,EAC1CP,EAAI8E,KAAMsQ,EAAG,GAAKA,EAAG,QACf,KAAKN,GAAeM,GAG1B,OAAO,IAAItR,UAAWiB,EAAQ,+IAAgJqQ,IAF9KpV,EAAI8E,KAAMqP,GAAMiB,GAAKhB,GAAMgB,GAG3B,CAEF,OAAOpV,CACR,CHwaA8W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAEAW,aAAArV,MACA,MAAAqV,EAKA,IADAX,GADAjW,EAAA,IAAAqU,KADApL,EAAA2N,EAAArW,OAAA,IAEAuV,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA6W,EAAA7W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAlP,EAAAmI,GAAA,MAAA,WACA,IAAA1K,EACAjF,EACA,IAAAiU,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiS,GAAA1B,MACA,MAAA,IAAAvQ,UAAA,6DAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAsU,KAAArP,EACA,IAwDA2B,EAAA+I,GAAA9O,UAAA,MAAA,SAAAiH,GACA,IAAA+N,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAKA,GAHAA,EAAA,IACAA,GAAAwM,KAAAwB,WAEAhO,EAAA,GAAAA,GAAAwM,KAAAwB,SAGA,OAAAgD,GAAAxE,KAAAyB,QAAAjO,EACA,IAgBAsN,GAAAzF,GAAA9O,UAAA,UAAA,WACA,OAAAyT,KAAAyB,QAAAvI,MACA,IAgBA4H,GAAAzF,GAAA9O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAS,UACA,IAgBApB,GAAAzF,GAAA9O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAtI,UACA,IAiBA7G,EAAA+I,GAAA9O,UAAA,oBAAA8O,GAAAnQ,mBAuCAgI,EAAAmI,GAAA9O,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAApB,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAQA,OALA,IAAAG,UAAA1D,OACA8T,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAA,EAAAF,EAAA,EAAAC,EAAA,EAAA/S,UAAA,IAEAoQ,IACA,IAqCA1N,EAAA+I,GAAA9O,UAAA,WAAA,WACA,IAAA2M,EACAuF,EACAoE,EACAjO,EACAE,EACApJ,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAkBA,OAhBAgP,EAAAuB,KACA9G,EAAA8G,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EACA8D,GAAA,EAIA0D,EADA2P,EAAA,CAAA,EACA,QAcA,WACA,IAAA9B,EAEA,GADArV,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAKA,OADAJ,EAAA,IAAAlB,GAAA3G,EADA1J,GAAA,GACA0J,EAAA1J,EAAA,IACA,CACAjE,MAAA,CAAAG,EAAAqV,GACAI,MAAA,EAEA,IA3BAjO,EAAA2P,EAAA,UAoCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA7CAgB,IACAjP,EAAA2P,EAAAV,IAoDA,WACA,OAAA1D,EAAAqE,SACA,IApDAD,CAqDA,IA+BA3P,EAAAmI,GAAA9O,UAAA,SAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,IAAA0O,EAAA5M,KAAA6U,EAAAmC,GAAA5C,EAAAlW,GAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA2CA9M,EAAAmI,GAAA9O,UAAA,QAAA,SAAAhB,EAAAoX,EAAAI,GACA,IAAAnB,EACAhN,EACApB,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAlV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,0EAAAnF,IAIA,GAFAqW,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAoF,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAA/N,GACA,IACA+N,EAAA,GAGA/S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAAnO,GACA,IACAmO,EAAA,GAGAA,EAAAnO,IACAmO,EAAAnO,EAEA,MACAmO,EAAAnO,CAEA,MACA+N,EAAA,EACAI,EAAAnO,EAIA,IAFAsL,EAAAJ,GAAAvU,GACA4U,EAAAJ,GAAAxU,GACAG,EAAAiX,EAAAjX,EAAAqX,EAAArX,IAEAkW,EADApO,EAAA,EAAA9H,GACAwU,EACA0B,EAAApO,EAAA,GAAA2M,EAEA,OAAAH,IACA,IA2CA9M,EAAAmI,GAAA9O,UAAA,UAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAjW,EACAD,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAwH,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAqV,EAAAyD,GAAA5C,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,OACArU,EAAA8E,KAAAsQ,GAGA,OAAA,IAAAf,KAAAzH,YAAA5M,EACA,IAqCAuH,EAAAmI,GAAA9O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAqV,EAAAyD,GAAA5C,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAe,CAGA,IA+BA7N,EAAAmI,GAAA9O,UAAA,aAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAqV,EAAAyD,GAAA5C,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IAqCAwH,EAAAmI,GAAA9O,UAAA,YAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAqV,EAAAyD,GAAA5C,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAe,CAGA,IA+BA7N,EAAAmI,GAAA9O,UAAA,iBAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAqV,EAAAyD,GAAA5C,EAAAlW,GACA0O,EAAA5M,KAAA6U,EAAAtB,EAAArV,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IA4BAwH,EAAAmI,GAAA9O,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAlW,EACAqV,EACA,IAAAQ,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAqV,EAAAyD,GAAA5C,EAAAlW,GACAsX,EAAAxV,KAAA6U,EAAAtB,EAAArV,EAAAsU,KAEA,IAyCA1N,EAAA+I,GAAA9O,UAAA,OAAA,SAAAiH,GACA,IAAA+N,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAwM,KAAAwB,SAGA,OAAAgD,GAAAxE,KAAAyB,QAAAjO,EACA,IAgBAsN,GAAAzF,GAAA9O,UAAA,UAAA,WACA,OAAAyT,KAAAwB,OACA,IAmCAtO,EAAAmI,GAAA9O,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA,EAGA,OAAA,CACA,IAmCAN,EAAAmI,GAAA9O,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAKA,IAHAhD,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyBA4G,EAAA+I,GAAA9O,UAAA,QAAA,SAAA4W,GACA,IAAAxX,EACAiW,EACAwB,EACA1X,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkX,EAAA,QACA,KAAAvO,GAAAsO,GAGA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,IAFAC,EAAAD,CAGA,CAGA,IAFAxX,EAAA,GACAiW,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAA+T,GAAA5C,EAAAlW,GAAAyB,YAEA,OAAAxB,EAAA0X,KAAAD,EACA,IA4BA9Q,EAAA+I,GAAA9O,UAAA,QAAA,WACA,IAAAkS,EACAoE,EACAjO,EACAE,EACApJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAgBA,OAdAgP,EAAAuB,KACApL,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAG,EACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6E,MACA,IAjDAT,CAkDA,IAsCA3P,EAAAmI,GAAA9O,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACApO,EACA0M,EACAC,EACAzU,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAgR,GAAAwC,GACA,MAAA,IAAAxT,UAAAiB,EAAA,0EAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAKA,IAHAtB,EAAAJ,GAAAmD,GACA9C,EAAAJ,GAAAkD,GACArB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,GAAA,EAAAA,IAEA,GAAAwU,IAAA0B,EADApO,EAAA,EAAA9H,IACAyU,IAAAyB,EAAApO,EAAA,GACA,OAAA9H,EAGA,OAAA,CACA,IAyCAwH,EAAAmI,GAAA9O,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA3B,EACAjW,EACAD,EACAgK,EACA,IAAA6L,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAwB,UACAC,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GAAA+U,GADA/K,EAAAsN,EAAAxV,KAAA6U,EAAAmC,GAAA5C,EAAAlW,GAAAA,EAAAsU,OAEAuD,EAAA,EAAA7X,GAAAoU,GAAApK,GACA6N,EAAA,EAAA7X,EAAA,GAAAqU,GAAArK,OACA,KAAAkI,GAAAlI,IAAA,IAAAA,EAAAxJ,OAIA,MAAA,IAAAuD,UAAAiB,EAAA,+IAAAgF,IAHA6N,EAAA,EAAA7X,GAAAgK,EAAA,GACA6N,EAAA,EAAA7X,EAAA,GAAAgK,EAAA,EAGA,CAEA,OAAA/J,CACA,IAmCAuH,EAAAmI,GAAA9O,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA9O,EAEAlJ,EAEA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAAc,GAAA5C,EAAA,GACAlW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IAEAgY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAlW,GACAA,EAAAsU,MAEA,OAAA0D,CACA,IAmCAxQ,EAAAmI,GAAA9O,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACA8B,EACA9O,EAEAlJ,EAEA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAAc,GAAA5C,EAAAhN,EAAA,GACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IAEAgY,EAAAF,EAAAE,EADAc,GAAA5C,EAAAlW,GACAA,EAAAsU,MAEA,OAAA0D,CACA,IAmDApR,EAAA+I,GAAA9O,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA3N,EACA+O,EACAjY,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAKA,IAHAmF,EAAAoL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACAkC,EAAArG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAAiY,EAAAjY,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA6W,EAAAX,EAAA,EAAAlW,GACAkW,EAAA,EAAAlW,GAAAkW,EAAA,EAAApS,GACAoS,EAAA,EAAApS,GAAA+S,EACAA,EAAAX,EAAA,EAAAlW,EAAA,GACAkW,EAAA,EAAAlW,EAAA,GAAAkW,EAAA,EAAApS,EAAA,GACAoS,EAAA,EAAApS,EAAA,GAAA+S,EAEA,OAAAvC,IACA,IAgEA1N,EAAA+I,GAAA9O,UAAA,OAAA,SAAAhB,GAEA,IAAAqY,EACApQ,EACAoO,EACAW,EACAC,EACAmB,EACAjO,EACAhK,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAGA,GADAmS,EAAA5B,KAAAyB,QACA7R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAAiN,GAAAlV,GAAA,CACA,GAAAiI,GAAAwM,KAAAwB,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA8C,IAKA,OAFAoO,EADApO,GAAA,GACAsM,GAAAvU,QACAqW,EAAApO,EAAA,GAAAuM,GAAAxU,GAEA,CACA,GAAAgW,GAAAhW,GAAA,CAEA,GAAAiI,GADAmQ,EAAApY,EAAAiW,SACAxB,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAArY,EAAAkW,QAGAjS,EAAAoS,EAAAzI,WAAA3F,EAAAtI,GAEA0Y,EAAA1K,SAAA0I,EAAA1I,QAEA0K,EAAAzK,WAAA3J,GACAoU,EAAAzK,WAAAyK,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAA5J,GAAAiL,EAAA1X,QACAR,EAAA,EAAAA,EAAAkY,EAAA1X,OAAAR,IACA6W,EAAA7W,GAAAkY,EAAAlY,GAEAkY,EAAArB,CACA,CAGA,IAFA/O,GAAA,EACAhE,EAAA,EACA9D,EAAA,EAAAA,EAAAiY,EAAAjY,IACAkW,EAAApO,GAAAoQ,EAAApU,GACAoS,EAAApO,EAAA,GAAAoQ,EAAApU,EAAA,GACAgE,GAAA,EACAhE,GAAA,CAGA,KAhCA,CAiCA,IAAAuO,GAAAxS,GA2DA,MAAA,IAAAkE,UAAAiB,EAAA,kIAAAnF,IAxDA,IADAoY,EAAApY,EAAAW,OACAR,EAAA,EAAAA,EAAAiY,EAAAjY,IACA,IAAA+U,GAAAlV,EAAAG,IAAA,CACA8W,GAAA,EACA,KACA,CAGA,GAAAA,EAAA,CACA,IAAA9B,GAAAiD,GACA,MAAA,IAAA5B,WAAArR,EAAA,6GAAAiT,IAEA,GAAAnQ,EAAAmQ,EAAA,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAMA,GAJA6B,EAAArY,EAGAiE,EAAAoS,EAAAzI,WAAA3F,EAAAtI,GAEA0Y,EAAA1K,SAAA0I,EAAA1I,QAEA0K,EAAAzK,WAAA3J,GACAoU,EAAAzK,WAAAyK,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAA5J,GAAAgL,GACAjY,EAAA,EAAAA,EAAAiY,EAAAjY,IACA6W,EAAA7W,GAAAkY,EAAAlY,GAEAkY,EAAArB,CACA,CAIA,IAHA/O,GAAA,EACAmQ,GAAA,EACAnU,EAAA,EACA9D,EAAA,EAAAA,EAAAiY,EAAAjY,IACAkW,EAAApO,GAAAoQ,EAAApU,GACAoS,EAAApO,EAAA,GAAAoQ,EAAApU,EAAA,GACAgE,GAAA,EACAhE,GAAA,EAEA,MACA,CAEA,GAAAgE,EAAAmQ,EAAA3D,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FAGA,IADAvO,GAAA,EACA9H,EAAA,EAAAA,EAAAiY,EAAAjY,IACAgK,EAAAnK,EAAAG,GACAkW,EAAApO,GAAAsM,GAAApK,GACAkM,EAAApO,EAAA,GAAAuM,GAAArK,GACAlC,GAAA,CAxDA,CA+DA,IA2EAN,EAAAmI,GAAA9O,UAAA,SAAA,SAAAoW,EAAAI,GACA,IAAAc,EACAN,EACA5X,EACA6H,EACAoO,EACAhN,EACAlJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACAyW,EAAA,EACAI,EAAAnO,MACA,CACA,IAAA2I,GAAAoF,GACA,MAAA,IAAAlT,UAAAiB,EAAA,oEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAA/N,GACA,IACA+N,EAAA,GAGA,IAAA/S,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAQA,IANAiP,EADAlB,EAAAI,EACAA,EAAAJ,EAEA,EAGAY,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAsL,IACApC,QACA/V,EAAA,EAAAA,EAAAmY,EAAAnY,IACA8H,EAAA,GAAA9H,EAAAiX,GACAY,EAAA,EAAA7X,GAAAkW,EAAApO,GACA+P,EAAA,EAAA7X,EAAA,GAAAkW,EAAApO,EAAA,GAEA,OAAA7H,CACA,IA+BAuH,EAAAmI,GAAA9O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,GAAA0O,EAAA5M,KAAA6U,EAAAmC,GAAA5C,EAAAlW,GAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA6EA1N,EAAA+I,GAAA9O,UAAA,QAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAhN,EACAlJ,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACAe,EAAA,GACA7W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6W,EAAA9R,KAAA+T,GAAA5C,EAAAlW,IAGA,IADA6W,EAAAwB,KAAAD,GACApY,EAAA,EAAAA,EAAAkJ,EAAAlJ,IAEAkW,EADApS,EAAA,EAAA9D,GACAoU,GAAAyC,EAAA7W,IACAkW,EAAApS,EAAA,GAAAuQ,GAAAwC,EAAA7W,IAEA,OAAAsU,IACA,IA2EA9M,EAAAmI,GAAA9O,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAlQ,EACA+O,EACAhN,EACA,IAAA2M,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACA8X,EAAA,EACAjB,EAAAnO,MACA,CACA,IAAA2I,GAAAyG,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAApP,GACA,IACAoP,EAAA,GAGA,IAAApU,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAWA,OAVAoP,GAAApP,GACAA,EAAA,EACA/B,EAAA+O,EAAAM,YACA8B,GAAAjB,GACAnO,EAAA,EACA/B,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,KAEA0J,EAAAmO,EAAAiB,EACAnR,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,IAEA,IAAA8U,KAAAzH,YAAAqJ,EAAA1I,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAwBA1B,EAAAmI,GAAA9O,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAzY,EACAiW,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,GAAA,IAAAG,UAAA1D,OACAkY,EAAA,OACA,KAAAvP,GAAAoP,KAAA5F,GAAA4F,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAA1D,OAAA,EACAiY,EAAA,CAAA,MACA,KAAAnO,GAAAkO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAA+T,GAAA5C,EAAAlW,GAAA2Y,eAAAD,EAAAD,IAEA,OAAAxY,EAAA0X,KAAA,IACA,IAmDA/Q,EAAA+I,GAAA9O,UAAA,cAAA,WACA,IAAAgX,EACA5X,EACAiJ,EACAgN,EACAlW,EACA8D,EACA,IAAA+R,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAMA,IAJAmF,EAAAoL,KAAAwB,QACA7V,EAAA,IAAAqU,KAAAzH,YAAA3D,GACAgN,EAAA5B,KAAAyB,QACA8B,EAAA5X,EAAA8V,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA6X,EAAA,EAAA7X,GAAAkW,EAAA,EAAApS,GACA+T,EAAA,EAAA7X,EAAA,GAAAkW,EAAA,EAAApS,EAAA,GAEA,OAAA7D,CACA,IA6EA2G,EAAA+I,GAAA9O,UAAA,YAAA,SAAAuX,GACA,IAAAvB,EACAX,EACAhN,EACAlJ,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAkQ,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAKA,IAHAlC,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACAe,EAAA,GACA7W,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6W,EAAA9R,KAAA+T,GAAA5C,EAAAlW,IAGA,OADA6W,EAAAwB,KAAAD,GACA,IAAAzI,GAAAkH,EACA,IAoBAjQ,EAAA+I,GAAA9O,UAAA,YAAA,WACA,IAAAZ,EACAiW,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAIA,IAFA9D,EAAA,GACAiW,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAA+T,GAAA5C,EAAAlW,GAAAyB,YAEA,OAAAxB,EAAA0X,KAAA,IACA,IA2CA/Q,EAAA+I,GAAA9O,UAAA,UAAA,WACA,IAAAsW,EACApE,EACA7J,EACAE,EACA8M,EACAlW,EACA,IAAA6V,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAiBA,OAfAgP,EAAAuB,KACA4B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAiZ,GAAA5C,EAAAlW,GACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6F,QACA,IAjDAzB,CAkDA,IAuCA3P,EAAAmI,GAAA9O,UAAA,QAAA,SAAAgY,EAAAhZ,GACA,IAAAqW,EACAjW,EACAiJ,EACA,IAAA2M,GAAAvB,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAA8N,GAAAgH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA3P,EAAAoL,KAAAwB,QACA+C,EAAA,IACAA,GAAA3P,GAEA2P,EAAA,GAAAA,GAAA3P,EACA,MAAA,IAAAmN,WAAArR,EAAA,kEAAA6T,IAEA,IAAA9D,GAAAlV,GACA,MAAA,IAAAkE,UAAAiB,EAAA,2EAAAnF,IAMA,OAHAqW,GADAjW,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAyB,UACAA,SACA,EAAA8C,GAAAzE,GAAAvU,GACAqW,EAAA,EAAA2C,EAAA,GAAAxE,GAAAxU,GACAI,CACA,IIt6FA,IAAAT,GAAA2O,GAAA3O,kBACAoW,GAAAX,KAYA,SAAA8D,GAAAlZ,GACA,MACA,iBAAAA,GACA,OAAAA,GACA,iBAAAA,EAAAgN,YAAAC,MACAjN,EAAAL,oBAAAA,EAEA,CASA,SAAAwZ,GAAAnZ,GACA,OAAAA,IAAA+P,EACA,CAoEA,SAAAA,KACA,IAAAnC,EACA0I,EACAD,EACAhN,EACA7H,EAGA,GADA8U,EAAAjS,UAAA1D,SACA8T,gBAAA1E,IACA,OAAA,IAAAuG,EACA,IAAAvG,GAEA,IAAAuG,EACA,IAAAvG,GAAA1L,UAAA,IAEA,IAAAiS,EACA,IAAAvG,GAAA1L,UAAA,GAAAA,UAAA,IAEA,IAAA0L,GAAA1L,UAAA,GAAAA,UAAA,GAAAA,UAAA,IAGA,GAAA,IAAAiS,EACAD,EAAA,IAAA/H,GAAA,QACA,GAAA,IAAAgI,EAEA,GAAAnE,GADA3Q,EAAA6C,UAAA,IAEAgS,EAAA,IAAA/H,GAAA9M,QACA,GAAAgR,GAAAhR,GACA6U,EC9IA,SAAoBA,EAAKrO,GACxB,IAAIqB,EACAlJ,EAGJ,IADAkJ,EAAMrB,EAAIrH,OACJR,EAAI,EAAGA,EAAIkJ,EAAKlJ,IACrBkW,EAAKlW,GAAM8S,GAASjL,EAAK7H,IAE1B,OAAOkW,CACR,CDqIAE,CAAA,IAAAjI,GAAA9M,EAAAb,QAAAa,QACA,GAAAmR,GAAAnR,GACA6U,EAAA,IAAA/H,GAAA9M,OACA,KAAAiJ,GAAAjJ,GAaA,MAAA,IAAA0C,UAAAiB,EAAA,qHAAA3D,IAZA,IAAA,IAAAuU,GACA,MAAA,IAAA7R,UAAAiB,EAAA,mJAAA3D,IAEA,IAAA4S,GAAA5S,EAAAoV,KACA,MAAA,IAAA1S,UAAAiB,EAAA,qHAAA3D,IAGA,IAAA4S,IADAiC,EAAA7U,EAAAoV,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,qHAAA3D,IAEA6U,EAAA,IAAA/H,GAAAmH,GAAAY,GAGA,KACA,CAEA,IAAA1D,GADA0D,EAAAhS,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,wEAAAkR,IAGA,IAAAlE,GADAvE,EAAAvJ,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,4EAAAyI,IAEA,GAAA,IAAA0I,EACAD,EAAA,IAAA/H,GAAA+H,EAAAzI,OACA,CAEA,IAAAuE,GADA9I,EAAAhF,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,uEAAAkE,IAEA,GAAAA,EAAA1J,GAAA0W,EAAAM,WAAA/I,EACA,MAAA,IAAA4I,WAAArR,EAAA,iJAAAkE,EAAA1J,KAEA0W,EAAA,IAAA/H,GAAA+H,EAAAzI,EAAAvE,EACA,CACA,CAIA,OAHA1B,EAAA8M,KAAA,UAAA4B,GACA1O,EAAA8M,KAAA,UAAA4B,EAAA1V,QAEA8T,IACA,CAeA9M,EAAAoI,GAAA,oBAAApQ,IAeAgI,EAAAoI,GAAA,OAAA,gBAmCAhJ,EAAAgJ,GAAA,QAAA,SAAA8G,GACA,IAAAC,EACAR,EACAS,EACA3W,EACAiW,EACAW,EACApQ,EACAyC,EACAlJ,EACA,IAAAiU,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiV,GAAA1E,MACA,MAAA,IAAAvQ,UAAA,sDAGA,IADAoS,EAAAjS,UAAA1D,QACA,EAAA,CAEA,IAAAyT,GADA2C,EAAA1S,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,qEAAA4R,IAEAT,EAAA,IACAQ,EAAAzS,UAAA,GAEA,CACA,GAAAmO,GAAAqE,GAAA,CACA,GAAAE,EAAA,CASA,IARA1N,EAAAwN,EAAAlW,OAEAiG,EADAiQ,EAAAjQ,KAAAiQ,EAAAhQ,IACAgG,EAAA,WAEAzE,EAAA,WAGAiO,GADAjW,EAAA,IAAAqU,KAAApL,IACA6M,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA8S,GAAA8D,EAAA9U,KAAA6U,EAAAlQ,EAAAiQ,EAAA1W,GAAAA,IAEA,OAAAC,CACA,CACA,OAAA,IAAAqU,KAAAoC,EACA,CACA,GAAApM,GAAAoM,IAAAd,IAAA3B,GAAAyC,EAAAD,KAAA,CAEA,IAAAxC,IADAiC,EAAAQ,EAAAD,OACAjB,MACA,MAAA,IAAAzR,UAAAiB,EAAA,6FAAA0R,IAUA,IAPAG,EADAD,EE1SA,SAA0BrB,EAAIqB,EAAMD,GACnC,IAAI1W,EACA+J,EACAhK,EAIJ,IAFAC,EAAM,GACND,GAAK,IAEJgK,EAAIuL,EAAGC,QACAC,MAGPzV,GAAK,EACLC,EAAI8E,KAAM+N,GAAS8D,EAAK9U,KAAM6U,EAAS3M,EAAEnK,MAAOG,KAEjD,OAAOC,CACR,CF2RA8W,CAAAb,EAAAU,EAAAD,GAEArB,GAAAY,GAIAA,GADAjW,EAAA,IAAAqU,KADApL,EAAA2N,EAAArW,SAEAuV,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACAkW,EAAAlW,GAAA6W,EAAA7W,GAEA,OAAAC,CACA,CACA,MAAA,IAAA8D,UAAAiB,EAAA,6FAAA0R,GACA,IAoBAlP,EAAAoI,GAAA,MAAA,WACA,IAAA3K,EACAjF,EACA,IAAAiU,GAAAK,MACA,MAAA,IAAAvQ,UAAA,6DAEA,IAAAiV,GAAA1E,MACA,MAAA,IAAAvQ,UAAA,sDAGA,IADAkB,EAAA,GACAjF,EAAA,EAAAA,EAAAkE,UAAA1D,OAAAR,IACAiF,EAAAF,KAAAb,UAAAlE,IAEA,OAAA,IAAAsU,KAAArP,EACA,IA6BA2B,EAAAgJ,GAAA/O,UAAA,MAAA,SAAAiH,GACA,IAAAoO,EACAhN,EAEA,IAAA6P,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA8N,GAAA/J,GACA,MAAA,IAAA/D,UAAAiB,EAAA,0DAAA8C,IAOA,GALAoB,EAAAoL,KAAAwB,QACAI,EAAA5B,KAAAyB,QACAjO,EAAA,IACAA,GAAAoB,KAEApB,EAAA,GAAAA,GAAAoB,GAGA,OAAA4J,GAAAoD,EAAApO,GACA,IAgBAsN,GAAAxF,GAAA/O,UAAA,UAAA,WACA,OAAAyT,KAAAyB,QAAAvI,MACA,IAgBA4H,GAAAxF,GAAA/O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAS,UACA,IAgBApB,GAAAxF,GAAA/O,UAAA,cAAA,WACA,OAAAyT,KAAAyB,QAAAtI,UACA,IAiBA7G,EAAAgJ,GAAA/O,UAAA,oBAAA+O,GAAApQ,mBA+BAgI,EAAAoI,GAAA/O,UAAA,cAAA,SAAAmW,EAAAC,GACA,IAAA8B,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAQA,OALA,IAAAG,UAAA1D,OACA8T,KAAAyB,QAAAmB,WAAAF,EAAAC,GAEA3C,KAAAyB,QAAAmB,WAAAF,EAAAC,EAAA/S,UAAA,IAEAoQ,IACA,IAgCA1N,EAAAgJ,GAAA/O,UAAA,WAAA,WACA,IAAAkS,EACAoE,EACAjO,EACAgN,EACA9M,EACApJ,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAiBA,OAfAgP,EAAAuB,KACA4B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAA,CAAAG,EAAA8S,GAAAoD,EAAAlW,KACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAAqE,SACA,IAjDAD,CAkDA,IA4BA3P,EAAAoI,GAAA/O,UAAA,SAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,IAAA0O,EAAA5M,KAAA6U,EAAA7D,GAAAoD,EAAAlW,IAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA+BA9M,EAAAoI,GAAA/O,UAAA,QAAA,SAAAhB,EAAAoX,EAAAI,GACA,IAAAnB,EACAhN,EACA+P,EACAjZ,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA6O,GAAA/S,GACA,MAAA,IAAAkE,UAAAiB,EAAA,mEAAAnF,IAIA,GAFAqW,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAoF,GACA,MAAA,IAAAlT,UAAAiB,EAAA,qEAAAiS,IAQA,GANAA,EAAA,IACAA,GAAA/N,GACA,IACA+N,EAAA,GAGA/S,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,oEAAAqS,IAEAA,EAAA,IACAA,GAAAnO,GACA,IACAmO,EAAA,GAGAA,EAAAnO,IACAmO,EAAAnO,EAEA,MACAmO,EAAAnO,CAEA,MACA+N,EAAA,EACAI,EAAAnO,EAOA,IAJA+P,EADApZ,EACA,EAEA,EAEAG,EAAAiX,EAAAjX,EAAAqX,EAAArX,IACAkW,EAAAlW,GAAAiZ,EAEA,OAAA3E,IACA,IAqCA9M,EAAAoI,GAAA/O,UAAA,UAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAjW,EACAD,EACAgK,EAEA,IAAA+O,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAIA,IAFAwH,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAgK,EAAA8I,GAAAoD,EAAAlW,IACA0O,EAAA5M,KAAA6U,EAAA3M,EAAAhK,EAAAsU,OACArU,EAAA8E,KAAAiF,GAGA,OAAA,IAAAsK,KAAAzH,YAAA5M,EACA,IA4BAuH,EAAAoI,GAAA/O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlM,EACAhK,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAgK,EAAA8I,GAAAoD,EAAAlW,IACA0O,EAAA5M,KAAA6U,EAAA3M,EAAAhK,EAAAsU,MACA,OAAAtK,CAGA,IA4BAxC,EAAAoI,GAAA/O,UAAA,aAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlM,EACAhK,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IAEA,GADAgK,EAAA8I,GAAAoD,EAAAlW,IACA0O,EAAA5M,KAAA6U,EAAA3M,EAAAhK,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IA4BAwH,EAAAoI,GAAA/O,UAAA,YAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlM,EACAhK,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAgK,EAAA8I,GAAAoD,EAAAlW,IACA0O,EAAA5M,KAAA6U,EAAA3M,EAAAhK,EAAAsU,MACA,OAAAtK,CAGA,IA4BAxC,EAAAoI,GAAA/O,UAAA,iBAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlM,EACAhK,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAAsU,KAAAwB,QAAA,EAAA9V,GAAA,EAAAA,IAEA,GADAgK,EAAA8I,GAAAoD,EAAAlW,IACA0O,EAAA5M,KAAA6U,EAAA3M,EAAAhK,EAAAsU,MACA,OAAAtU,EAGA,OAAA,CACA,IA0BAwH,EAAAoI,GAAA/O,UAAA,WAAA,SAAAyW,EAAAX,GACA,IAAAT,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAAiB,EAAA,oEAAAsS,IAGA,IADApB,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAsX,EAAAxV,KAAA6U,EAAA7D,GAAAoD,EAAAlW,IAAAA,EAAAsU,KAEA,IA2BA1N,EAAAgJ,GAAA/O,UAAA,OAAA,SAAAiH,GACA,IAAAiR,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAiO,GAAAlK,GACA,MAAA,IAAA/D,UAAAiB,EAAA,qEAAA8C,IAEA,KAAAA,GAAAwM,KAAAwB,SAGA,OAAAhD,GAAAwB,KAAAyB,QAAAjO,GACA,IA8BAN,EAAAoI,GAAA/O,UAAA,YAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA6O,GAAA2E,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IACA,GAAAuX,IAAAzE,GAAAoD,EAAAlW,IACA,OAAA,EAGA,OAAA,CACA,IAiCAwH,EAAAoI,GAAA/O,UAAA,WAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA6O,GAAA2E,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,EAAA,IACAA,GAAAlD,KAAAwB,SACA,IACA0B,EAAA,EAGA,MACAA,EAAA,EAGA,IADAtB,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,EAAAsU,KAAAwB,QAAA9V,IACA,GAAAuX,IAAAzE,GAAAoD,EAAAlW,IACA,OAAAA,EAGA,OAAA,CACA,IA0BA4G,EAAAgJ,GAAA/O,UAAA,QAAA,SAAA4W,GACA,IAAAvB,EACAjW,EACAD,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,GAAAG,UAAA1D,OAAA,GACA,IAAA2I,GAAAsO,GACA,MAAA,IAAA1T,UAAAiB,EAAA,kEAAAyS,SAGAA,EAAA,IAIA,IAFAvB,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAkW,EAAAlW,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAA0X,KAAAF,EACA,IA4BA7Q,EAAAgJ,GAAA/O,UAAA,QAAA,WACA,IAAAkS,EACAoE,EACAjO,EACAE,EACApJ,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAgBA,OAdAgP,EAAAuB,KACApL,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAG,EACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6E,MACA,IAjDAT,CAkDA,IAiCA3P,EAAAoI,GAAA/O,UAAA,eAAA,SAAA0W,EAAAC,GACA,IAAAtB,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA6O,GAAA2E,GACA,MAAA,IAAAxT,UAAAiB,EAAA,mEAAAuS,IAEA,GAAArT,UAAA1D,OAAA,EAAA,CACA,IAAAqR,GAAA2F,GACA,MAAA,IAAAzT,UAAAiB,EAAA,qEAAAwS,IAEAA,GAAAlD,KAAAwB,QACA0B,EAAAlD,KAAAwB,QAAA,EACA0B,EAAA,IACAA,GAAAlD,KAAAwB,QAEA,MACA0B,EAAAlD,KAAAwB,QAAA,EAGA,IADAI,EAAA5B,KAAAyB,QACA/V,EAAAwX,EAAAxX,GAAA,EAAAA,IACA,GAAAuX,IAAAzE,GAAAoD,EAAAlW,IACA,OAAAA,EAGA,OAAA,CACA,IAgBAoV,GAAAxF,GAAA/O,UAAA,UAAA,WACA,OAAAyT,KAAAwB,OACA,IAqCAtO,EAAAoI,GAAA/O,UAAA,OAAA,SAAAyW,EAAAX,GACA,IAAAkB,EACA5X,EACAiW,EACAlW,EACA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAqD,GACA,MAAA,IAAAvT,UAAA,oEAAAuT,GAKA,IAHApB,EAAA5B,KAAAyB,QAEA8B,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAwB,UACAC,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA6X,EAAA7X,GAAA8S,GAAAwE,EAAAxV,KAAA6U,EAAA7D,GAAAoD,EAAAlW,IAAAA,EAAAsU,OAEA,OAAArU,CACA,IA+BAuH,EAAAoI,GAAA/O,UAAA,UAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACAhN,EACA8O,EACAhY,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAA,MACA,CACA,GAAA,IAAAkJ,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAAlF,GAAAoD,EAAA,IACAlW,EAAA,CACA,CACA,KAAAA,EAAAkJ,EAAAlJ,IACAgY,EAAAF,EAAAE,EAAAlF,GAAAoD,EAAAlW,IAAAA,EAAAsU,MAEA,OAAA0D,CACA,IA+BAxQ,EAAAoI,GAAA/O,UAAA,eAAA,SAAAiX,EAAAC,GACA,IAAA7B,EACAhN,EACA8O,EACAhY,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAA6D,GACA,MAAA,IAAA/T,UAAAiB,EAAA,oEAAA8S,IAIA,GAFA5B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA5R,UAAA1D,OAAA,EACAwX,EAAAD,EACA/X,EAAAkJ,EAAA,MACA,CACA,GAAA,IAAAA,EACA,MAAA,IAAA1H,MAAA,oGAEAwW,EAAAlF,GAAAoD,EAAAhN,EAAA,IACAlJ,EAAAkJ,EAAA,CACA,CACA,KAAAlJ,GAAA,EAAAA,IACAgY,EAAAF,EAAAE,EAAAlF,GAAAoD,EAAAlW,IAAAA,EAAAsU,MAEA,OAAA0D,CACA,IA8BApR,EAAAgJ,GAAA/O,UAAA,WAAA,WACA,IAAAqV,EACAW,EACA3N,EACA+O,EACAjY,EACA8D,EAEA,IAAAiV,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAKA,IAHAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACAmC,EAAArG,GAAA1I,EAAA,GACAlJ,EAAA,EAAAA,EAAAiY,EAAAjY,IACA8D,EAAAoF,EAAAlJ,EAAA,EACA6W,EAAAX,EAAAlW,GACAkW,EAAAlW,GAAAkW,EAAApS,GACAoS,EAAApS,GAAA+S,EAEA,OAAAvC,IACA,IA+CA1N,EAAAgJ,GAAA/O,UAAA,OAAA,SAAAhB,GACA,IAAAqY,EACApQ,EACAoO,EACAW,EACAoB,EACAjY,EACA8D,EACA,IAAAiV,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAGA,GADAmS,EAAA5B,KAAAyB,QACA7R,UAAA1D,OAAA,GAEA,IAAAwR,GADAlK,EAAA5D,UAAA,IAEA,MAAA,IAAAH,UAAAiB,EAAA,+EAAA8C,SAGAA,EAAA,EAEA,GAAAuK,GAAAxS,GAAA,CAEA,GAAAiI,GADAmQ,EAAApY,EAAAW,QACA8T,KAAAwB,QACA,MAAA,IAAAO,WAAA,0FASA,GANA6B,EADAa,GAAAlZ,GACAA,EAAAkW,QAEAlW,EAGAiE,EAAAoS,EAAAzI,WAAA3F,EAAAtI,GAEA0Y,EAAA1K,SAAA0I,EAAA1I,QAEA0K,EAAAzK,WAAA3J,GACAoU,EAAAzK,WAAAyK,EAAA1B,WAAA1S,EAEA,CAGA,IADA+S,EAAA,IAAA1I,GAAA+J,EAAA1X,QACAR,EAAA,EAAAA,EAAAkY,EAAA1X,OAAAR,IACA6W,EAAA7W,GAAAkY,EAAAlY,GAEAkY,EAAArB,CACA,CACA,IAAA7W,EAAA,EAAAA,EAAAiY,EAAAnQ,IAAA9H,IACAkW,EAAApO,GAAAoQ,EAAAlY,GAAA,EAAA,CAGA,KA9BA,CA+BA,GAAA8H,GAAAwM,KAAAwB,QACA,MAAA,IAAAO,WAAArR,EAAA,kEAAA8C,IAEAoO,EAAApO,GAAA,EAAA,EAAA,CAJA,CAKA,IAgDAN,EAAAoI,GAAA/O,UAAA,SAAA,SAAAyX,EAAAjB,GACA,IAAAc,EACAN,EACA5X,EACAiW,EACAhN,EACAlJ,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACA8X,EAAA,EACAjB,EAAAnO,MACA,CACA,IAAA2I,GAAAyG,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAApP,GACA,IACAoP,EAAA,GAGA,IAAApU,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAQA,IANAiP,EADAG,EAAAjB,EACAA,EAAAiB,EAEA,EAGAT,GADA5X,EAAA,IAAAqU,KAAAzH,YAAAsL,IACApC,QACA/V,EAAA,EAAAA,EAAAmY,EAAAnY,IACA6X,EAAA7X,GAAAkW,EAAAlW,EAAAsY,GAEA,OAAArY,CACA,IA4BAuH,EAAAoI,GAAA/O,UAAA,QAAA,SAAA6N,EAAAiI,GACA,IAAAT,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAAkQ,GAAAvF,GACA,MAAA,IAAA3K,UAAAiB,EAAA,oEAAA0J,IAGA,IADAwH,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACA,GAAA0O,EAAA5M,KAAA6U,EAAA7D,GAAAoD,EAAAlW,IAAAA,EAAAsU,MACA,OAAA,EAGA,OAAA,CACA,IA4CA1N,EAAAgJ,GAAA/O,UAAA,QAAA,SAAAuX,GACA,IAAAlC,EAEA,IAAA6C,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAGA,GADAmS,EAAA5B,KAAAyB,QACA,IAAA7R,UAAA1D,OAEA,OADA0V,EAAAmC,OACA/D,KAEA,IAAAL,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAGA,OADAlC,EAAAmC,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAAtF,GAAAoG,GAAApG,GAAAqG,GACA,IAZA7E,IAaA,IAgDA9M,EAAAoI,GAAA/O,UAAA,YAAA,SAAAyX,EAAAjB,GACA,IAAAlQ,EACA+O,EACAhN,EAEA,IAAA6P,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAIA,GAFAmS,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QACA,IAAA5R,UAAA1D,OACA8X,EAAA,EACAjB,EAAAnO,MACA,CACA,IAAA2I,GAAAyG,GACA,MAAA,IAAAvU,UAAAiB,EAAA,oEAAAsT,IAQA,GANAA,EAAA,IACAA,GAAApP,GACA,IACAoP,EAAA,GAGA,IAAApU,UAAA1D,OACA6W,EAAAnO,MACA,CACA,IAAA2I,GAAAwF,GACA,MAAA,IAAAtT,UAAAiB,EAAA,qEAAAqS,IAEAA,EAAA,GACAA,GAAAnO,GACA,IACAmO,EAAA,GAEAA,EAAAnO,IACAmO,EAAAnO,EAEA,CACA,CAWA,OAVAoP,GAAApP,GACAA,EAAA,EACA/B,EAAA+O,EAAAM,YACA8B,GAAAjB,GACAnO,EAAA,EACA/B,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,KAEA0J,EAAAmO,EAAAiB,EACAnR,EAAA+O,EAAAzI,WAAA6K,EAAA9Y,IAEA,IAAA8U,KAAAzH,YAAAqJ,EAAA1I,OAAArG,EAAA+B,EAAA,EAAA,EAAAA,EACA,IAyBA1B,EAAAoI,GAAA/O,UAAA,kBAAA,SAAA0X,EAAAC,GACA,IAAAC,EACAC,EACAzY,EACAiW,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,GAAA,IAAAG,UAAA1D,OACAkY,EAAA,OACA,KAAAvP,GAAAoP,KAAA5F,GAAA4F,GAGA,MAAA,IAAAxU,UAAAiB,EAAA,yFAAAuT,IAFAG,EAAAH,CAGA,CACA,GAAArU,UAAA1D,OAAA,EACAiY,EAAA,CAAA,MACA,KAAAnO,GAAAkO,GAGA,MAAA,IAAAzU,UAAAiB,EAAA,qEAAAwT,IAFAC,EAAAD,CAGA,CAGA,IAFAtC,EAAA5B,KAAAyB,QACA9V,EAAA,GACAD,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAC,EAAA8E,KAAA+N,GAAAoD,EAAAlW,IAAA2Y,eAAAD,EAAAD,IAEA,OAAAxY,EAAA0X,KAAA,IACA,IA8BA/Q,EAAAgJ,GAAA/O,UAAA,cAAA,WACA,IAAAgX,EACA5X,EACAiJ,EACAgN,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAMA,IAJAmF,EAAAoL,KAAAwB,QACA7V,EAAA,IAAAqU,KAAAzH,YAAA3D,GACAgN,EAAA5B,KAAAyB,QACA8B,EAAA5X,EAAA8V,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6X,EAAA7X,GAAAkW,EAAAhN,EAAAlJ,EAAA,GAEA,OAAAC,CACA,IA6CA2G,EAAAgJ,GAAA/O,UAAA,YAAA,SAAAuX,GACA,IAAAP,EACA5X,EACAiJ,EACAgN,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAMA,IAJAmF,EAAAoL,KAAAwB,QACA7V,EAAA,IAAAqU,KAAAzH,YAAA3D,GACAgN,EAAA5B,KAAAyB,QACA8B,EAAA5X,EAAA8V,QACA/V,EAAA,EAAAA,EAAAkJ,EAAAlJ,IACA6X,EAAA7X,GAAAkW,EAAAlW,GAEA,GAAA,IAAAkE,UAAA1D,OAEA,OADAqX,EAAAQ,OACApY,EAEA,IAAAgU,GAAAmE,GACA,MAAA,IAAArU,UAAAiB,EAAA,oEAAAoT,IAGA,OADAP,EAAAQ,MAWA,SAAAa,EAAAC,GACA,OAAAf,EAAAtF,GAAAoG,GAAApG,GAAAqG,GACA,IAZAlZ,CAaA,IAqBA2G,EAAAgJ,GAAA/O,UAAA,YAAA,WACA,IAAAZ,EACAiW,EACAlW,EACA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAIA,IAFA9D,EAAA,GACAiW,EAAA5B,KAAAyB,QACA/V,EAAA,EAAAA,EAAAsU,KAAAwB,QAAA9V,IACAkW,EAAAlW,GACAC,EAAA8E,KAAA,QAEA9E,EAAA8E,KAAA,SAGA,OAAA9E,EAAA0X,KAAA,IACA,IA4BA/Q,EAAAgJ,GAAA/O,UAAA,UAAA,WACA,IAAAsW,EACApE,EACA7J,EACAE,EACA8M,EACAlW,EAEA,IAAA+Y,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAiBA,OAfAgP,EAAAuB,KACA4B,EAAA5B,KAAAyB,QACA7M,EAAAoL,KAAAwB,QAGA9V,GAAA,EAIAwH,EADA2P,EAAA,CAAA,EACA,QAcA,WAEA,GADAnX,GAAA,EACAoJ,GAAApJ,GAAAkJ,EACA,MAAA,CACAuM,MAAA,GAGA,MAAA,CACA5V,MAAAiT,GAAAoD,EAAAlW,IACAyV,MAAA,EAEA,IAxBAjO,EAAA2P,EAAA,UAiCA,SAAAtX,GAEA,GADAuJ,GAAA,EACAlF,UAAA1D,OACA,MAAA,CACAX,MAAAA,EACA4V,MAAA,GAGA,MAAA,CACAA,MAAA,EAEA,IA1CAgB,IACAjP,EAAA2P,EAAAV,IAiDA,WACA,OAAA1D,EAAA6F,QACA,IAjDAzB,CAkDA,IA6BA3P,EAAAoI,GAAA/O,UAAA,QAAA,SAAAgY,EAAAhZ,GACA,IACAI,EACAiJ,EAEA,IAAA6P,GAAAzE,MACA,MAAA,IAAAvQ,UAAA,sDAEA,IAAA8N,GAAAgH,GACA,MAAA,IAAA9U,UAAAiB,EAAA,oEAAA6T,IAMA,GAJA3P,EAAAoL,KAAAwB,QACA+C,EAAA,IACAA,GAAA3P,GAEA2P,EAAA,GAAAA,GAAA3P,EACA,MAAA,IAAAmN,WAAArR,EAAA,kEAAA6T,IAEA,IAAAjG,GAAA/S,GACA,MAAA,IAAAkE,UAAAiB,EAAA,oEAAAnF,IASA,OAPAI,EAAA,IAAAqU,KAAAzH,YAAAyH,KAAAyB,UACAA,QAEA8C,GADAhZ,EACA,EAEA,EAEAI,CACA,IG/4EA,IAAImZ,GAAQ,CACXnM,GACAU,GACA0B,GACAG,GACAJ,GACAG,GACAD,GACAnB,GACAsB,GACAC,GACAC,GACAC,IC5BGyJ,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,aACA,QCHGC,GAASD,GAAO7Y,OCqBpB,SAAS+Y,GAAkBtQ,GAC1B,IAAI8C,EDJL,SAAgBlM,GACf,IAAIG,EACJ,GAAKkD,GAASrD,GACb,MAAO,UAER,GAAK+O,GAAU/O,GACd,OAAO,KAER,IAAMG,EAAI,EAAGA,EAAIsZ,GAAQtZ,IACxB,GAAKH,aAAiBuZ,GAAOpZ,GAC5B,OAAOqZ,GAAQrZ,GAIjB,OAAOwZ,GAAYvK,GAAiBpP,KAAa,IAClD,CCXUqI,CAAOe,GAChB,OAAKvB,EAAiBuB,GACd,CACN+C,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZC,EAAgBX,GAChBY,EAAgBZ,KAIZ,CACNC,KAAQ/C,EACRf,MAAS6D,EACTS,kBAAoB,EACpBC,UAAa,CACZxE,EAAQ8D,GACR3D,EAAQ2D,IAGX,CCrDA,IAAI0N,GAAI,ECMR,IAAIA,GAAI,EAqBR,SAASC,GAAOzB,EAAG0B,EAAO1Q,EAAG2Q,EAAQzS,GACpC,IAAI0S,EACAC,EACA1O,EACApL,EAEJ,GAAKiY,GAAK,GAAe,IAAV0B,EACd,OAAO1Q,EAGR,IADAmC,EAAImO,GAAkBtQ,IACfuD,iBAEN,ODbF,SAAgByL,EAAG0B,EAAO1Q,EAAG2Q,EAAQzS,GACpC,IAAI0E,EACAkO,EACAC,EACAH,EACAC,EACA9Z,EAOJ,GALA6L,EAAO5C,EAAE+C,KACT+N,EAAO9Q,EAAEwD,UAAW,GACpBuN,EAAO/Q,EAAEwD,UAAW,GAEpBoN,EAAK1S,EACW,IAAXyS,EAEJ,OADAI,EAAMnO,EAAMgO,EAAIE,EAAMlO,EAAMgO,GAAO5B,EAAI0B,GAChC1Q,EAIR,GAAgB,IAAX2Q,EAAe,CAInB,IAHAE,EAAI7B,EAAIwB,IAGC,EACR,IAAMzZ,EAAI,EAAGA,EAAI8Z,EAAG9Z,IACnBga,EAAMnO,EAAMgO,EAAIE,EAAMlO,EAAMgO,GAAOF,GACnCE,GAAMD,EAGR,GAAK3B,EAAIwB,GACR,OAAOxQ,EAER,IAAMjJ,EAAI8Z,EAAG9Z,EAAIiY,EAAGjY,GAAKyZ,GACxBO,EAAMnO,EAAMgO,EAAIE,EAAMlO,EAAMgO,GAAOF,GACnCK,EAAMnO,EAAMgO,EAAG,EAAGE,EAAMlO,EAAMgO,EAAG,GAAMF,GACvCK,EAAMnO,EAAMgO,EAAG,EAAGE,EAAMlO,EAAMgO,EAAG,GAAMF,GACvCK,EAAMnO,EAAMgO,EAAG,EAAGE,EAAMlO,EAAMgO,EAAG,GAAMF,GACvCK,EAAMnO,EAAMgO,EAAG,EAAGE,EAAMlO,EAAMgO,EAAG,GAAMF,GACvCE,GAAMJ,GAEP,OAAOxQ,CACP,CACD,IAAMjJ,EAAI,EAAGA,EAAIiY,EAAGjY,IACnBga,EAAMnO,EAAMgO,EAAIE,EAAMlO,EAAMgO,GAAOF,GACnCE,GAAMD,CAGR,CCnCEnN,CAAWwL,EAAG0B,EAAOvO,EAAGwO,EAAQzS,GACzB8B,EAIR,GADA4Q,EAAK1S,EACW,IAAXyS,EAEJ,OADA3Q,EAAG4Q,IAAQF,EAAQ1B,EACZhP,EAIR,GAAgB,IAAX2Q,EAAe,CAInB,IAHAE,EAAI7B,EAAIwB,IAGC,EACR,IAAMzZ,EAAI,EAAGA,EAAI8Z,EAAG9Z,IACnBiJ,EAAG4Q,IAAQF,EACXE,GAAMD,EAGR,GAAK3B,EAAIwB,GACR,OAAOxQ,EAER,IAAMjJ,EAAI8Z,EAAG9Z,EAAIiY,EAAGjY,GAAKyZ,GACxBxQ,EAAG4Q,IAAQF,EACX1Q,EAAG4Q,EAAG,IAAOF,EACb1Q,EAAG4Q,EAAG,IAAOF,EACb1Q,EAAG4Q,EAAG,IAAOF,EACb1Q,EAAG4Q,EAAG,IAAOF,EACbE,GAAMJ,GAEP,OAAOxQ,CACP,CACD,IAAMjJ,EAAI,EAAGA,EAAIiY,EAAGjY,IACnBiJ,EAAG4Q,IAAQF,EACXE,GAAMD,EAEP,OAAO3Q,CACR,CCxDA,SAASyQ,GAAOzB,EAAG0B,EAAO1Q,EAAG2Q,GAC5B,OAAOK,GAAShC,EAAG0B,EAAO1Q,EAAG2Q,ECX9B,SAAwB3B,EAAG2B,GAC1B,OAAKA,EAAS,EACN,GAEC,EAAI3B,GAAM2B,CACpB,CDMsCM,CAAejC,EAAG2B,GACxD,CEbA,SAASO,GAAQpa,GAChB,IAAI8H,EACA7H,EAGJ,GADA6H,EAAM,GACD9H,GAAK,EACT,OAAO8H,EAER,IAAM7H,EAAI,EAAGA,EAAID,EAAGC,IACnB6H,EAAI9C,KAAM/E,GAEX,OAAO6H,CACR,CCiDA,SAASuS,GAASna,EAAK+L,EAAM4N,EAAQzS,GACpC,IAAI6C,EACAzC,EACAvH,EAKJ,IAHAuH,EAAa,EAATqS,EACJ5Z,EAAa,EAATmH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIgM,EAAKxL,QAC1BwL,EAAMhM,GAAMgK,EACZgC,EAAMhM,EAAE,GAAM,EACdA,GAAKuH,EACLyC,GAAK,EAEN,OAAO/J,CACR,CC9CA,SAASoa,GAAWtP,EAAIuP,GACvB,IAAIxS,EAYJ,OATAA,EAAMqS,GAAQpP,EAAGvK,QChBlB,SAAmByI,EAAGsR,GACrB,IAAIC,EAEAX,EACAY,EACAC,EACAC,EACAC,EACAC,EACAC,EACA9a,EAMJ,IAJA6Z,EAAK,EACLY,EAAK,EAGCza,EAAI,EAAGA,EAAIiJ,EAAEzI,OAAQR,IAAM,CAUhC,IARAwa,GADAI,EAAK3R,EAAG4Q,IACK,GAAOe,EAAKA,EAEzBC,EAAKN,EAAGE,GAERC,EAAKb,EAAK,EACVc,EAAKF,EAAK,EAGFC,GAAM,OACbI,EAAK7R,EAAGyR,IACK,GAAOI,EAAKA,IACbN,IAGZvR,EAAGyR,EAAG,GAAMI,EACZP,EAAGI,EAAG,GAAMJ,EAAGI,GACfD,GAAM,EACNC,GAAM,EAEP1R,EAAGyR,EAAG,GAAME,EACZL,EAAGI,EAAG,GAAME,EACZhB,GAAM,EACNY,GAAM,CACN,CACF,CDtBCM,CADAT,EAAKtR,GAAMsR,GACGxS,GAKP,CACNiD,GAHDA,EErCD,SAAe9B,EAAG+R,GACjB,IAAI/a,EACAD,EAGJ,IADAC,EAAM,GACAD,EAAI,EAAGA,EAAIgb,EAAQxa,OAAQR,IAChCC,EAAI8E,KAAMkE,EAAG+R,EAAShb,KAEvB,OAAOC,CACR,CF4BMgb,CAAMlQ,EAAIjD,GAIdwS,GAAMA,EACNxS,IAAOA,EAET,CGvCA,SAASoT,GAAmBrb,GAC3B,OACCgS,GAAWhS,IACXA,EAAQ,CAEV,CCLA,SAASqb,GAAmBrb,GAC3B,OACCgS,GAAWhS,IACXA,EAAMsK,UAAY,CAEpB,CCYA,SAAS+Q,GAAmBrb,GAC3B,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CClBA,SAAS+X,GAAM/X,GACd,OAAOH,OAAOkY,KAAMlY,OAAQG,GAC7B,CCOA2H,EAAA/H,GAAA,UAAAwa,ICAAzS,EAAA/H,GAAA,UT8HA,SAAiBQ,EAAK2Z,EAAQzS,GAC7B,IAAIjB,EAAMqT,GAAkBtZ,GAC5B,OAAKiG,EAAIsG,iBAEW,eAAdtG,EAAIgC,MACDkS,GAASna,EAAKsW,GAAgBtW,EAAK,GAAK2Z,EAAQzS,GAErC,cAAdjB,EAAIgC,MACDkS,GAASna,EAAKqW,GAAerW,EAAK,GAAK2Z,EAAQzS,GAlDzD,SAAoBlH,EAAK2Z,EAAQzS,GAChC,IAAI6E,EACAtF,EACAsD,EACAhK,EAOJ,IALAgM,EAAO/L,EAAI+L,KACXtF,EAAMzG,EAAIwM,UAAW,GAErBzM,EAAImH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIgM,EAAKxL,QAC1BkG,EAAKsF,EAAMhM,EAAGgK,GACdhK,GAAK4Z,EACL5P,GAAK,EAEN,OAAOgC,CACR,CAmCSS,CAAWvG,EAAK0T,EAAQzS,GAzIjC,SAAkBlH,EAAK2Z,EAAQzS,GAC9B,IAAI6C,EACAhK,EAIJ,IAFAA,EAAImH,EACJ6C,EAAI,EACIhK,GAAK,GAAKA,EAAIC,EAAIO,QACzBP,EAAKD,GAAMgK,EACXhK,GAAK4Z,EACL5P,GAAK,EAEN,OAAO/J,CACR,CA+HQkb,CAASlb,EAAK2Z,EAAQzS,EAC9B,IUtHAK,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICnDA,ICKIwB,GDLAA,QAAgC,IAAhBpM,OAAOkY,KEwB3B,SAASwD,GAAavb,GACrB,MAAkC,uBAAzBiK,GAAajK,EACvB,CDCIwb,GAPJ,WACC,OAAOD,GAAalX,UACrB,CAKOoX,GAKP,IAAAC,GAAezP,GElBf,SAAS1I,GAAO6F,GACf,OAASA,GAAMA,CAChB,CCQA,SAAS7F,GAAOvD,GACf,OACCD,GAAUC,IACV2b,GAAO3b,EAET,CCTA,SAASuD,GAAOvD,GACf,OACCD,GAAUC,IACV2b,GAAO3b,EAAMsK,UAEf,CCGA,SAAS/G,GAAOvD,GACf,OAASwK,GAAaxK,IAAWyK,GAAUzK,EAC5C,CCoBA2H,EAAA/H,GAAA,cAAA4K,IACA7C,EAAA/H,GAAA,WAAA6K,ICzBA,IAAImR,GAAuB/b,OAAOmB,UAAU6a,qBCE5C,IAAAC,IAXSC,GAAO9Z,KAAM,OAAQ,KCe9B,SAAS2Z,GAAsB5b,EAAO8J,GACrC,IAAImC,EACJ,OACCjM,YAKDiM,EAAO8P,GAAO9Z,KAAMjC,EAAO8J,KACbgS,IAAoBxS,GAAUtJ,IAIzCuD,GAFFuG,GAAYA,IAGXkI,GAAWlI,IACXA,GAAY,GACZA,EAAW9J,EAAMW,OAGZsL,EACR,CChBA,IAAA+P,GATKN,GACU9b,GCAf,SAAsBI,GACrB,OACW,OAAVA,GACiB,iBAAVA,IACNqD,GAASrD,IACc,iBAAjBA,EAAMW,QACbqR,GAAWhS,EAAMW,SACjBX,EAAMW,QAAU,GAChBX,EAAMW,QAAU2R,IAChBzI,GAAY7J,EAAO,YAClB4b,GAAsB5b,EAAO,SAEhC,EClCIgF,GAAQ1B,MAAMtC,UAAUgE,MCC5B,IAAIiH,GAAO2P,ICFX,WAEA,GDAuC,aEMnC3P,IAAQ2P,GARF,CACTha,SAAY,MAO0B,YCiDvC,SAASwC,GAAS4D,EAAK0P,EAAeC,GACrC,IAAItO,EACAlJ,EACJ,IAAMqS,GAAcxK,KAAUsB,GAAUtB,GACvC,MAAM,IAAI9D,UAAWiB,EAAQ,8EAA+E6C,IAG7G,GAAa,KADbqB,EAAMrB,EAAIrH,QAET,OAAQ,EAET,GAA0B,IAArB0D,UAAU1D,OAAe,CAC7B,IAAMqR,GAAW2F,GAChB,MAAM,IAAIzT,UAAWiB,EAAQ,oEAAqEwS,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAatO,EACjB,OAAQ,EAETlJ,EAAIwX,CACP,MACGxX,EAAIkJ,EAAMsO,GACD,IACRxX,EAAI,EAGR,MACEA,EAAI,EAGL,GAAKoD,GAAOmU,IACX,KAAQvX,EAAIkJ,EAAKlJ,IAChB,GAAKoD,GAAOyE,EAAI7H,IACf,OAAOA,OAIT,KAAQA,EAAIkJ,EAAKlJ,IAChB,GAAK6H,EAAK7H,KAAQuX,EACjB,OAAOvX,EAIV,OAAQ,CACT,CClGA,SAAS8b,GAAwBjc,GAChC,OAASA,EAAMgN,aAAehN,EAAMgN,YAAYhM,YAAchB,CAC/D,6PCTIkc,GAAwB,oBAAX/I,YAA2B,EAASA,OCqDrD,IAAAgJ,GA9BA,WACC,IAAIC,EACJ,GAAuB,cAAlB/H,GAAQgI,IACZ,OAAO,EAER,IAAMD,KAAKC,GACV,KAEmC,IAAjCjY,GAASkY,GAAeF,IACxBvS,GAAYwS,GAAKD,IACJ,OAAbC,GAAKD,IACkB,WAAvB/H,GAAQgI,GAAKD,KAEbH,GAAwBI,GAAKD,GAE9B,CAAC,MAAQlW,GACT,OAAO,CACP,CAEF,OAAO,CACR,CAKOqW,GChDHtQ,GAA2B,oBAAXkH,WC0BhB4E,oHAKFA,GAJGyE,GChBL,WACC,OAA8C,KAArCzE,GAAM1T,YAAe,IAAK1D,MACpC,CAgBQ4J,CAAM,EAAG,GVFjB,SAAevK,GACd,OAAKub,GAAavb,GACVoG,GAASpB,GAAM/C,KAAMjC,IAEtBoG,GAASpG,EACjB,ESDSoG,GEJT,SAAepG,GACd,IAAIyc,EACAC,EACAC,EACAvc,EACAgc,EACAQ,EACAzc,EAGJ,GADAC,EAAM,GACDmb,GAAavb,GAAU,CAE3B,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,YAGb,OAAOxB,CACP,CACD,GAAsB,iBAAVJ,GAEX,GAAKA,EAAMW,OAAS,IAAMkJ,GAAY7J,EAAO,KAC5C,IAAMG,EAAI,EAAGA,EAAIH,EAAMW,OAAQR,IAC9BC,EAAI8E,KAAM/E,EAAEyB,gBAGR,CAEN,IAAe,IADf+a,EAA2B,mBAAV3c,KACQ8O,GAAc9O,GACtC,OAAOI,EAERsc,EAAkBG,IAAsBF,CACxC,CACD,IAAMP,KAAKpc,EACF0c,GAAuB,cAANN,IAAuBvS,GAAY7J,EAAOoc,IAClEhc,EAAI8E,KAAMnE,OAAQqb,IAGpB,GAAKU,GAEJ,IADAL,ECnDF,SAAkBzc,GACjB,IAAoB,IAAf+c,KAAyBZ,GAC7B,OAAOF,GAAwBjc,GAEhC,IACC,OAAOic,GAAwBjc,EAC/B,CAAC,MAAQgd,GACT,OAAO,CACP,CACF,CD0CoBf,CAAwBjc,GACpCG,EAAI,EAAGA,EAAI8c,GAAetc,OAAQR,IACvCyc,EAAIK,GAAgB9c,GACZsc,GAAyB,gBAANG,IAAyB/S,GAAY7J,EAAO4c,IACtExc,EAAI8E,KAAMnE,OAAQ6b,IAIrB,OAAOxc,CACR,EFlCA,IIjCI8c,GJiCJtd,GAAemY,GKVXoF,GAAMtd,OC9BNqd,GAAWrd,OAAOud,eFSrBF,GADI9I,GAAYvU,OAAOud,gBACZhX,GGKZ,SAAyBC,GACxB,IAAIgX,ECVL,SAAmBhX,GAElB,OAAOA,EAAIM,SACZ,CDOauW,CAAU7W,GACtB,OAAKgX,GAAmB,OAAVA,EACNA,EAEgC,sBAAnCpT,GAAa5D,EAAI2G,aAEd3G,EAAI2G,YAAYhM,UAEnBqF,aAAexG,GACZA,GAAOmB,UAGR,IACR,EHXA,IAAAsc,GAAeJ,GKRf,IAAIK,GAAkB1d,OAAOmB,UAyC7B,SAASwc,GAAexd,GACvB,IAAIqd,EAGJ,QAAM5S,GAAUzK,KAIhBqd,EC1CD,SAAyBrd,GACxB,OACCA,QAGO,MAGRA,EAAQH,GAAQG,GAETkd,GAAUld,GAClB,CD+BSod,CAAgBpd,IAClBqd,IAMJxT,GAAY7J,EAAO,gBAGpB6J,GAAYwT,EAAO,gBACnBjJ,GAAYiJ,EAAMrQ,cACmB,sBAArC/C,GAAaoT,EAAMrQ,cAGnBnD,GAAYwT,EAAO,kBACnBjJ,GAAYiJ,EAAMI,iBAIjBJ,IAAUE,IAzDb,SAAmBlX,GAClB,IAAIqX,EAGJ,IAAMA,KAAOrX,EACZ,IAAMwD,GAAYxD,EAAKqX,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAU3d,IAGb,CE7EA,IAAI4d,GCwCJ,SAAiBvX,EAAKuS,GACrB,IACIb,EACA1O,EACAqU,EACAtE,EACAhZ,EACA+J,EACAhK,EAPA0d,GAAa,EAQjB,IAAM/O,GAAczI,GACnB,MAAM,IAAInC,UAAWiB,EAAQ,iFAAkFkB,IAEhH,GAAKhC,UAAU1D,OAAS,EAAI,CAC3B,IAAM8J,GAAUmO,GACf,MAAM,IAAI1U,UAAWiB,EAAQ,qEAAsEyT,IAEpG,GAAK/O,GAAY+O,EAAM,gBAEhB7F,GADN8K,EAAajF,EAAKkF,YAEjB,MAAM,IAAI5Z,UAAWiB,EAAQ,+DAAgE,aAAc0Y,GAG7G,CAID,GAFAxU,GADA0O,EAAOgG,GAAY1X,IACR1F,OACXP,EAAM,CAAA,EACDyd,EACJ,IAAM1d,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAGf0J,GAAYzJ,EADlBgZ,EAAM/S,EADNqX,EAAM3F,EAAM5X,MAMZgK,EAAI/J,EAAKgZ,GACJ/V,GAAS8G,GACb/J,EAAKgZ,GAAMlU,KAAMwY,GAEjBtd,EAAKgZ,GAAQ,CAAEjP,EAAGuT,IAPlBtd,EAAKgZ,GAAQsE,OAWf,IAAMvd,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErBC,EAAKiG,EADLqX,EAAM3F,EAAM5X,KACQud,EAGtB,OAAOtd,CACR,CDxFW4d,CEWH,CAEN/R,KAAQ,EAGRrD,KAAQ,EACRG,MAAS,EACTC,OAAU,EACVL,MAAS,EACTG,OAAU,EACVJ,MAAS,EACTG,OAAU,EACVoV,MAAS,EACTC,OAAU,EAOVC,QAAW,GAEX1V,QAAW,GACXD,QAAW,GAIX4V,UAAa,GACblW,UAAa,GACbH,WAAc,GAGdsW,OAAU,GAGVpV,QAAW,GAGXqV,OAAU,GAGVC,iBAAoB,KFpDkB,CACvCT,YAAc,8OG6Bf,SAASU,GAAiBnW,GACzB,IAAI8B,EACJ,OAAKb,GAAUjB,GACP1I,GAAmB0I,IAAW,KAEjCtI,GAAUsI,GACP1I,GHdT,SAAmB0I,GAClB,IAAI8B,EAAIyT,GAAMvV,GACd,OAASiB,GAAUa,GAAQA,EAAI,IAChC,CGW4BsU,CAAUpW,KAAa,KAE7CA,GAECgT,GADLlR,EAAI9B,EAAMsO,YAEFxM,EAGF,IACR,CCpDA,IAAIuU,GAAW,CAEdC,oBAAuB,GAGvBC,uBAA0B,GCU3B,SAASC,GAAkBC,GAC1B,OCAD,SAAoBC,GACnB,IAAItX,EACA4B,EACA2V,EACA7e,EAGJ,IADAkJ,EAAM0V,EAAOpe,SACD,EACX,OAAO+d,GAASE,uBAGjB,GAAa,QADbnX,EAAM+W,GAAiBO,EAAQ,KAE9B,OAAOL,GAASE,uBAGjB,IAAMze,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAAM,CAE3B,GAAY,QADZ6e,EAAKR,GAAiBO,EAAQ5e,KAE7B,OAAOue,GAASE,uBAEZI,EAAKvX,IACTA,EAAMuX,EAEP,CAED,OADAA,EAAON,GAASC,oBAAoBlX,EAAM,GAC5B,EAAMuX,EAAK,CAC1B,CD1BQC,CAAW,CAAEH,GACrB,CEWA,SAASI,GAAW9X,EAAOC,EAASC,EAAQsD,EAAO3C,EAAKkX,GACvD,IAAI5X,EACA8B,EACA+V,EACA1X,EACAvH,EAIJ,IAFAoH,EAAQH,EAAMzG,OACd0I,EAAM,EACAlJ,EAAI,EAAGA,EAAIoH,EAAOpH,IACvBkJ,GAAOjC,EAAOjH,GAEf,GAAc,UAATgf,EACClX,EAAM,EACVA,EAAM,EACKA,GAAOoB,IAClBpB,EAAMoB,EAAM,QAEP,GAAc,SAAT8V,EACNlX,EAAM,GACVA,GAAOoB,GACI,GAEG,KADbpB,GAAOoB,KAENpB,GAAOoB,GAGEpB,GAAOoB,IAClBpB,GAAOoB,IACKA,IACXpB,GAAOoB,QAOT,GAHc,cAAT8V,GAAwBlX,EAAM,IAClCA,GAAOoB,GAEHpB,EAAM,GAAKA,GAAOoB,EACtB,MAAM,IAAImN,WAAYrR,EAAQ,gHAAiHkE,EAAKpB,IAKtJ,GADAmX,EAAM9X,EACDuD,GAAeD,GAAU,CAC7B,IAAMzK,EAAI,EAAGA,EAAIoH,EAAOpH,IAEvB8H,GADAP,EAAIO,EAAMb,EAAOjH,GAEjB8H,GAAOb,EAAOjH,GACdif,GAAO1X,EAAIL,EAASlH,GAErB,OAAOif,CACP,CAED,IAAMjf,EAAIoH,EAAM,EAAGpH,GAAK,EAAGA,IAE1B8H,GADAP,EAAIO,EAAMb,EAAOjH,GAEjB8H,GAAOb,EAAOjH,GACdif,GAAO1X,EAAIL,EAASlH,GAErB,OAAOif,CACR,CClFA,IAAIC,GAAO,QAmDX,SAASC,GAAQlW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACAwT,EACAnW,EACAzC,EACAsE,EACAuP,EACAgF,EAEAtf,EA0BJ,IArBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGTsO,EAAKrR,EAAE/B,QAGPoY,EAAKrW,EAAE9B,OAGPkY,EAAOpW,EAAEwB,MAGThE,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFpf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,GAAKyG,EAAKoF,EADLkT,GAAWhU,EAAIuP,EAAIgF,EAAID,EAAMrf,EAAGkf,OAEpCE,GAAS,IACKrf,EACb,OAAO,EAIV,OAAO,CACR,CCjGA,IAAImf,GAAO,QAgDX,SAASC,GAAQlW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACAwT,EACAnW,EACA6B,EACAuP,EACAgF,EACAzF,EACA7Z,EAuBJ,IAlBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGTsO,EAAKrR,EAAE/B,QAGPoY,EAAKrW,EAAE9B,OAGPkY,EAAOpW,EAAEwB,MAGT2U,EAAQ,EAGFpf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,IAAO6L,EADPgO,EAAKkF,GAAWhU,EAAIuP,EAAIgF,EAAID,EAAMrf,EAAGkf,MAChBrT,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAIV,OAAO,CACR,CC1FA,IAAImf,GAAO,QAgDX,SAASC,GAAQlW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACAwT,EACAnW,EACA6B,EACAuP,EACAgF,EAEAtf,EAuBJ,IAlBAkJ,EAAMH,EAHNgC,EAAK9B,EAAEhC,OAMP4E,EAAO5C,EAAE+C,KAGTsO,EAAKrR,EAAE/B,QAGPoY,EAAKrW,EAAE9B,OAGPkY,EAAOpW,EAAEwB,MAGT2U,EAAQ,EAGFpf,EAAI,EAAGA,EAAIkJ,EAAKlJ,IAErB,GAAK6L,EADAkT,GAAWhU,EAAIuP,EAAIgF,EAAID,EAAMrf,EAAGkf,OAEpCE,GAAS,IACKrf,EACb,OAAO,EAIV,OAAO,CACR,CCrBA,IAAIwf,GAAO,CChCX,SAAiBtW,EAAGlJ,GACnB,SAAKA,GAAK,GAAKkJ,EAAE+C,KAAM/C,EAAE9B,QAI1B,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAC,EACA5F,EACA6F,EAkBJ,IAbAD,EAAKxW,EAAEhC,MAAO,GACduY,EAAMvW,EAAE/B,QAAS,GAGjB2S,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD,OAAO,CACR,EC7BA,SAAiBvW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACA5U,EACA0U,EACAG,EACAtF,EACAT,EACA6F,EACAG,EA8BJ,IAzBA9U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,ECtDA,SAAiB1W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACA/U,EACA0U,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAkCJ,IA7BAjV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EC9DA,SAAiB7W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAlV,EACA0U,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAsCJ,IAjCApV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC1EA,SAAiBhX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACArV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA0CJ,IArCAvV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECpFA,SAAiBnX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EA8CJ,IAzCA1V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EC9FA,SAAiBtX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAkDJ,IA7CA7V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,ECxGA,SAAiBzX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAsDJ,IAjDAhW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,EClHA,SAAiB5X,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAjW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA0DJ,IArDAnW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EC5HA,SAAkB/X,EAAGlJ,GACpB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACApW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA8DJ,IAzDAtW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EXjGChC,IAEGmC,GAAgB,CY3CpB,SAAiBrY,EAAGlJ,GACnB,SAAKA,GAAK,GAAKkJ,EAAEwD,UAAW,GAAKxD,EAAE+C,KAAM/C,EAAE9B,QAI5C,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAC,EACA5F,EACA6F,EAqBJ,IAhBAD,EAAKxW,EAAEhC,MAAO,GACduY,EAAMvW,EAAE/B,QAAS,GAGjB2S,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD,OAAO,CACR,ECjCA,SAAiBvW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACA5U,EACA0U,EACAG,EACAtF,EACAT,EACA6F,EACAG,EAiCJ,IA5BA9U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,EC1DA,SAAiB1W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACA/U,EACA0U,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAqCJ,IAhCAjV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EClEA,SAAiB7W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAlV,EACA0U,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAyCJ,IApCApV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC9EA,SAAiBhX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACArV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA6CJ,IAxCAvV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECxFA,SAAiBnX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EAiDJ,IA5CA1V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EClGA,SAAiBtX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAqDJ,IAhDA7V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,EC5GA,SAAiBzX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAyDJ,IApDAhW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,ECtHA,SAAiB5X,EAAGlJ,GACnB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAjW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA6DJ,IAxDAnW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EChIA,SAAkB/X,EAAGlJ,GACpB,IAAIqf,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACApW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAiEJ,IA5DAtW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTvF,EAAMwC,EAAEwD,UAAW,GAGnB2S,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EtB1FCI,IAEGC,GAAe,CuB5DnB,SAAiBvY,EAAGlJ,GACnB,SAAKA,GAAK,IAAOkJ,EAAE+C,KAAM/C,EAAE9B,SAAY8B,EAAE+C,KAAM/C,EAAE9B,OAAO,IAIzD,ECLA,SAAiB8B,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAC,EACA5F,EACA6F,EAkBJ,IAbAD,EAAKxW,EAAEhC,MAAO,GACduY,EAAMvW,EAAE/B,QAAS,GAGjB2S,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFM,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD,OAAO,CACR,EC7BA,SAAiBvW,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACA5U,EACA0U,EACAG,EACAtF,EACAT,EACA6F,EACAG,EA8BJ,IAzBA9U,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFS,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD,OAAO,CACR,ECtDA,SAAiB1W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACA/U,EACA0U,EACAG,EACAG,EACAzF,EACAT,EACA6F,EACAG,EACAG,EAkCJ,IA7BAjV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFY,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACD,OAAO,CACR,EC9DA,SAAiB7W,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAlV,EACA0U,EACAG,EACAG,EACAG,EACA5F,EACAT,EACA6F,EACAG,EACAG,EACAG,EAsCJ,IAjCApV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFe,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACD,OAAO,CACR,EC1EA,SAAiBhX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACArV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACA/F,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EA0CJ,IArCAvV,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFkB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACD,OAAO,CACR,ECpFA,SAAiBnX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxV,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EA8CJ,IAzCA1V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFqB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD,OAAO,CACR,EC9FA,SAAiBtX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAkDJ,IA7CA7V,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFwB,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD,OAAO,CACR,ECxGA,SAAiBzX,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9V,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAxG,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EAsDJ,IAjDAhW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGF2B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACD,OAAO,CACR,EClHA,SAAiB5X,EAAGlJ,GACnB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAjW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA3G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA0DJ,IArDAnW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGF8B,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACD,OAAO,CACR,EC5HA,SAAkB/X,EAAGlJ,GACpB,IAAIqf,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACApW,EACA0U,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA9G,EACAT,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EA8DJ,IAzDAtW,EAAK9B,EAAEhC,MAEsB,IAAxBqE,GADLgP,EAAKrR,EAAE/B,UAGNuY,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,KAGxBmF,EAAK1U,EAAI,GACT6U,EAAK7U,EAAI,GACTgV,EAAKhV,EAAI,GACTmV,EAAKnV,EAAI,GACTsV,EAAKtV,EAAI,GACTyV,EAAKzV,EAAI,GACT4V,EAAK5V,EAAI,GACT+V,EAAK/V,EAAI,GACTkW,EAAKlW,EAAI,GACTqW,EAAKrW,EAAI,GACTyU,EAAMlF,EAAI,GACVqF,EAAMrF,EAAI,GAAQmF,EAAGnF,EAAG,GACxBwF,EAAMxF,EAAI,GAAQsF,EAAGtF,EAAG,GACxB2F,EAAM3F,EAAI,GAAQyF,EAAGzF,EAAG,GACxB8F,EAAM9F,EAAI,GAAQ4F,EAAG5F,EAAG,GACxBiG,EAAMjG,EAAI,GAAQ+F,EAAG/F,EAAG,GACxBoG,EAAMpG,EAAI,GAAQkG,EAAGlG,EAAG,GACxBuG,EAAMvG,EAAI,GAAQqG,EAAGrG,EAAG,GACxB0G,EAAM1G,EAAI,GAAQwG,EAAGxG,EAAG,GACxB6G,EAAM7G,EAAI,GAAQ2G,EAAG3G,EAAG,IAGzBT,EAAK5Q,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGToT,EAAQ,EAGFiC,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CACD,OAAO,CACR,EjCrECM,IAEGC,GAAe,CkClEnB,SAAwBzY,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAiC,EACA7W,EACA8W,EACApW,EACA6O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACA3W,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF2C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECjFA,SAAwB1W,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAG,EACA8B,EACAI,EACAjX,EACA8W,EACApW,EACAC,EACA4O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA7W,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF6C,EAAKlX,EAAG,GAAIkX,EAAK,GAStB,IARKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECpGA,SAAwB7W,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAnX,EACA8W,EACApW,EACAC,EACAyW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACAhX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFgD,EAAKrX,EAAG,GAAIqX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,ECvHA,SAAwBhX,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACAtX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAnX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFmD,EAAKxX,EAAG,GAAIwX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC1IA,SAAwBnX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAzX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAtX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFsD,EAAK3X,EAAG,GAAI2X,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,EC7JA,SAAwBtX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA5X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAzX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFyD,EAAK9X,EAAG,GAAI8X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,EChLA,SAAwBzX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA/X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5X,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF4D,EAAKjY,EAAG,GAAIiY,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECnMA,SAAwB5X,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/X,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF+D,EAAKpY,EAAG,GAAIoY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAKjY,EAAG,GAAIiY,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,ECtNA,SAAyB/X,EAAGlJ,GAC3B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAlY,GAyBJ,IAnBAL,GADAK,GAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,GAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFkE,GAAKvY,EAAG,GAAIuY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKpY,EAAG,GAAIoY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAKjY,EAAG,GAAIiY,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK9X,EAAG,GAAI8X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAK7T,EAAMgO,KACVuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,G1C5JIoC,GAAwB,C2C1E5B,SAAwBta,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACApF,EACA+Y,EACAG,EACAiC,EACA7W,EACA8W,EACApW,EACA6O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACA3W,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGF2C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECrFA,SAAwB1W,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACA8B,EACAI,EACAjX,EACA8W,EACApW,EACAC,EACA4O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA7W,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGF6C,EAAKlX,EAAG,GAAIkX,EAAK,GAStB,IARKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECxGA,SAAwB7W,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAnX,EACA8W,EACApW,EACAC,EACAyW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACAhX,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGFgD,EAAKrX,EAAG,GAAIqX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,EC3HA,SAAwBhX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACAtX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAnX,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGFmD,EAAKxX,EAAG,GAAIwX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC9IA,SAAwBnX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAzX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAtX,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGFsD,EAAK3X,EAAG,GAAI2X,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,ECjKA,SAAwBtX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA5X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAzX,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGFyD,EAAK9X,EAAG,GAAI8X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,ECpLA,SAAwBzX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA/X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5X,EA4BJ,IAtBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGF4D,EAAKjY,EAAG,GAAIiY,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECvMA,SAAwB5X,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/X,GA4BJ,IAtBAL,GADAK,GAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,GAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGF+D,EAAKpY,EAAG,GAAIoY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAKjY,EAAG,GAAIiY,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,EC1NA,SAAyB/X,EAAGlJ,GAC3B,IAAIqf,EACAuC,EACA9V,EACApF,EACA+Y,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAG,GACAlY,GA4BJ,IAtBAL,GADAK,GAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,GAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT7T,EAAMwC,EAAEwD,UAAU,GAGlB2S,EAAQ,EAGFkE,GAAKvY,EAAG,GAAIuY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKpY,EAAG,GAAIoY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAKjY,EAAG,GAAIiY,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK9X,EAAG,GAAI8X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,GAAK3X,EAAG,GAAI2X,GAAK,GAUtB,IATKA,GAAKf,GACTc,EAAKC,GACLA,GAAK,IAELD,EAAKd,EACLe,IAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,GAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,GAAKjZ,EAAKoF,EAAMgO,KACfuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,GnDxJIqC,GAAuB,CoDxF3B,SAAwBva,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAiC,EACA7W,EACA8W,EACApW,EACA6O,EACAgF,EACAzF,EACA6F,EACAG,EACAiC,EACAC,EACA3W,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF2C,EAAKhX,EAAG,GAAIgX,EAAK,GAStB,IARKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEPC,EAAMtC,EAAOyC,EAAGzH,EAAG,GACbwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBuF,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CAGH,OAAO,CACR,ECjFA,SAAwB1W,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACA8B,EACAI,EACAjX,EACA8W,EACApW,EACAC,EACA4O,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACA8B,EACAC,EACAE,EACA7W,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF6C,EAAKlX,EAAG,GAAIkX,EAAK,GAStB,IARKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEPK,EAAM1C,EAAO2C,EAAG3H,EAAG,GACbyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB0F,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CAIJ,OAAO,CACR,ECpGA,SAAwB7W,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACA2B,EACAI,EACAE,EACAnX,EACA8W,EACApW,EACAC,EACAyW,EACA7H,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACA2B,EACAC,EACAE,EACAG,EACAhX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFgD,EAAKrX,EAAG,GAAIqX,EAAK,GAStB,IARKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPO,EAAM5C,EAAO8C,EAAG9H,EAAG,GACb2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB6F,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CAKL,OAAO,CACR,ECvHA,SAAwBhX,EAAGlJ,GAC1B,IAAI4hB,EACAvC,EACAvT,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAI,EACAE,EACAG,EACAtX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAhI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAwB,EACAC,EACAE,EACAG,EACAG,EACAnX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFmD,EAAKxX,EAAG,GAAIwX,EAAK,GAStB,IARKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPU,EAAM/C,EAAOiD,EAAGjI,EAAG,GACb8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBgG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CAMN,OAAO,CACR,EC1IA,SAAwBnX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAI,EACAE,EACAG,EACAG,EACAzX,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAnI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAqB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAtX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFsD,EAAK3X,EAAG,GAAI2X,EAAK,GAStB,IARKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPa,EAAMlD,EAAOoD,EAAGpI,EAAG,GACbiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBmG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CAOP,OAAO,CACR,EC7JA,SAAwBtX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAI,EACAE,EACAG,EACAG,EACAG,EACA5X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAtI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAkB,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAzX,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFyD,EAAK9X,EAAG,GAAI8X,EAAK,GAStB,IARKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPgB,EAAMrD,EAAOuD,EAAGvI,EAAG,GACboI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhBsG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CAQR,OAAO,CACR,EChLA,SAAwBzX,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACA/X,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAzI,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAe,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5X,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF4D,EAAKjY,EAAG,GAAIiY,EAAK,GAStB,IARKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPmB,EAAMxD,EAAO0D,EAAG1I,EAAG,GACbuI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhByG,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CAST,OAAO,CACR,ECnMA,SAAwB5X,EAAGlJ,GAC1B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAlY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACA5I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAY,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/X,EAyBJ,IAnBAL,GADAK,EAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,EAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGF+D,EAAKpY,EAAG,GAAIoY,EAAK,GAStB,IARKA,EAAKxB,GACTuB,EAAKC,EACLA,EAAK,IAELD,EAAKvB,EACLwB,GAAMxB,GAEPsB,EAAM3D,EAAO6D,EAAG7I,EAAG,GACb0I,EAAKjY,EAAG,GAAIiY,EAAK,GAUtB,IATKA,EAAKrB,GACToB,EAAKC,EACLA,EAAK,IAELD,EAAKpB,EACLqB,GAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,EAAG1I,EAAG,GACduI,EAAK9X,EAAG,GAAI8X,EAAK,GAUtB,IATKA,EAAKlB,GACTiB,EAAKC,EACLA,EAAK,IAELD,EAAKjB,EACLkB,GAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,EAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB4G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CAUV,OAAO,CACR,ECtNA,SAAyB/X,EAAGlJ,GAC3B,IAAIqf,EACAuC,EACA9V,EACA2T,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAI,EACAE,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACArY,EACA8W,EACApW,EACAC,EACAyW,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACA/I,EACAgF,EACAzF,EACA6F,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAG,EACAS,EACAC,EACAE,EACAG,EACAG,EACAG,EACAG,GACAG,GACAG,GACAG,GACAlY,GAyBJ,IAnBAL,GADAK,GAAIiP,GAAWpR,EAAEhC,MAAOgC,EAAE/B,UACnB6D,GACPuP,EAAKlP,GAAEkP,GAGPqH,EAAQ7C,GAAW7V,EAAEf,OAGrBoX,EAAKrW,EAAE9B,OAGP0E,EAAO5C,EAAE+C,KAGTwT,EAAMlF,EAAG,GAGT8E,EAAQ,EAGFkE,GAAKvY,EAAG,GAAIuY,GAAK,GAStB,IARKA,GAAK3B,GACT0B,EAAKC,GACLA,GAAK,IAELD,EAAK1B,EACL2B,IAAM3B,GAEPyB,EAAM9D,EAAOgE,GAAGhJ,EAAG,GACb6I,GAAKpY,EAAG,GAAIoY,GAAK,GAUtB,IATKA,GAAKxB,GACTuB,EAAKC,GACLA,GAAK,IAELD,EAAKvB,EACLwB,IAAMxB,GAEPR,EAAM7G,EAAG,GAAO4I,EAAG5I,EAAG,GACtB2I,EAAMG,EAAQD,GAAG7I,EAAG,GACd0I,GAAKjY,EAAG,GAAIiY,GAAK,GAUtB,IATKA,GAAKrB,GACToB,EAAKC,GACLA,GAAK,IAELD,EAAKpB,EACLqB,IAAMrB,GAEPX,EAAM1G,EAAG,GAAOyI,EAAGzI,EAAG,GACtBwI,EAAMG,EAAQD,GAAG1I,EAAG,GACduI,GAAK9X,EAAG,GAAI8X,GAAK,GAUtB,IATKA,GAAKlB,GACTiB,EAAKC,GACLA,GAAK,IAELD,EAAKjB,EACLkB,IAAMlB,GAEPd,EAAMvG,EAAG,GAAOsI,EAAGtI,EAAG,GACtBqI,EAAMG,EAAQD,GAAGvI,EAAG,GACdoI,EAAK3X,EAAG,GAAI2X,EAAK,GAUtB,IATKA,EAAKf,GACTc,EAAKC,EACLA,EAAK,IAELD,EAAKd,EACLe,GAAMf,GAEPjB,EAAMpG,EAAG,GAAOmI,EAAGnI,EAAG,GACtBkI,EAAMG,EAAQD,EAAGpI,EAAG,GACdiI,EAAKxX,EAAG,GAAIwX,EAAK,GAUtB,IATKA,EAAKZ,GACTW,EAAKC,EACLA,EAAK,IAELD,EAAKX,EACLY,GAAMZ,GAEPpB,EAAMjG,EAAG,GAAOgI,EAAGhI,EAAG,GACtB+H,EAAMG,EAAQD,EAAGjI,EAAG,GACd8H,EAAKrX,EAAG,GAAIqX,EAAK,GAUtB,IATKA,EAAKT,GACTQ,EAAKC,EACLA,EAAK,IAELD,EAAKR,EACLS,GAAMT,GAEPvB,EAAM9F,EAAG,GAAO6H,EAAG7H,EAAG,GACtB4H,EAAMG,EAAQD,EAAG9H,EAAG,GACd2H,EAAKlX,EAAG,GAAIkX,EAAK,GAUtB,IATKA,EAAKN,GACTjW,EAAKuW,EACLA,EAAK,IAELvW,EAAKiW,EACLM,GAAMN,GAEP1B,EAAM3F,EAAG,GAAO5O,EAAG4O,EAAG,GACtB0H,EAAME,EAAQD,EAAG3H,EAAG,GACdyH,EAAKhX,EAAG,GAAIgX,EAAK,GAUtB,IATKA,EAAKJ,GACTlW,EAAKsW,EACLA,EAAK,IAELtW,EAAKkW,EACLI,GAAMJ,GAEP7B,EAAMxF,EAAG,GAAO7O,EAAG6O,EAAG,GACtBsH,EAAMI,EAAQD,EAAGzH,EAAG,GACdwH,EAAK/W,EAAG,GAAI+W,EAAK,GAetB,IAdKA,EAAKH,GACTE,EAAKC,EACLA,EAAK,IAELD,EAAKF,EACLG,GAAMH,GAGP9H,EAAK+H,EAAQE,EAAGxH,EAAG,GAGnBqF,EAAMrF,EAAG,GAAOuH,EAAGvH,EAAG,GAGhB+G,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKgC,EAAIhC,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKtU,EAAIsU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKpU,EAAIoU,IAAO,CAC7B,IAAMH,EAAK,EAAGA,EAAKmC,EAAInC,IAAO,CAC7B,IAAO7T,EAAMgO,IAAQhO,EAAMgO,EAAG,MAC7BuF,GAAS,IACKrf,EACb,OAAO,EAGT8Z,GAAM2F,CACN,CACD3F,GAAM8F,CACN,CACD9F,GAAMiG,CACN,CACDjG,GAAMoG,CACN,CACDpG,GAAMuG,CACN,CACDvG,GAAM0G,CACN,CACD1G,GAAM6G,CACN,CACD7G,GAAMgH,CACN,CACDhH,GAAMmH,CACN,CACDnH,GAAMsH,CACN,CAWX,OAAO,CACR,G5DtIIsC,GAAWlE,GAAK/e,OAAS,SAyD7B,SAAekjB,GACd,IAAIC,EACAvc,EACAwc,EACAC,EACAC,EACA5a,EACAoR,EACAgF,EACAyE,EACA9L,EACAhP,EACAlJ,EACAikB,EACAhkB,EpRzMoBH,EoRiOxB,GArBAoJ,EAAIgb,GAAgBP,EAAQ,IAC5B3jB,EAAIkkB,GAAgBP,EAAQ,IAG5Btc,GADAyc,EAAM5a,EAAEhC,OACIzG,OAGZyX,EAAIlY,EAAE0M,UAAW,GAAK1M,EAAEiM,KAAMjM,EAAEoH,QpRhNd,iBAHMtH,EoRsNHoJ,EAAE+C,OpRlNZ,OAAVnM,GAC2B,iBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBA,GoRiN5ByJ,EAAE+C,K6DpNJ,SAAsB/C,EAAG9B,GACxB,OAAO,IAAIgH,GAAYlF,EAAEuE,OAAQvE,EAAEwE,WAAYxE,EAAEzJ,kBAAkB2H,EAAS8B,EAAEzI,OAAO2G,EACtF,C7DkNW+c,CAAoBjb,EAAE+C,KAAM,GACrC/C,EAAEuD,kBAAmB,GrRvNvB,SAA8B3M,GAE7B,MACkB,iBAAVA,GACG,OAAVA,IAG6B,oBAA3BA,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBD,GAGD,mBAA3BM,EAAMgN,YAAYC,MAClBjN,EAAML,oBAAsBF,EAIhC,CqRwMauW,CAAgB5M,EAAE+C,QAC7B/C,EAAE+C,K8DvMJ,SAAsB/C,EAAG9B,GACxB,GAAKyF,GAAmB3D,GACvB,OAAOsN,GAAgBtN,EAAG9B,GAE3B,GAAK4F,GAAkB9D,GACtB,OAAOqN,GAAerN,EAAG9B,GAG1B,MAAM,IAAIpD,UAAWiB,EAAQ,+FAAgGiE,GAC9H,C9D8LWkb,CAAoBlb,EAAE+C,KAAM,GACrC/C,EAAEuD,kBAAmB,EACrBvD,EAAE/B,QAAUwS,GAAOtS,EAAO,EAAG6B,EAAE/B,QAAS,GACxC+B,EAAE9B,QAAU,EACZwc,GAAU,GAGI,IAAVvc,EACJ,OAAK6B,EAAEuD,iBACC8U,GAAela,GAAS6B,EAAGgP,GAE9B0L,EACGnC,GAAcpa,GAAS6B,EAAGgP,GAE3BsH,GAAMnY,GAAS6B,EAAGgP,GAK1B,IAFA/O,EAAM,EACN6a,EAAK,EACC/jB,EAAI,EAAGA,EAAIoH,EAAOpH,IAIvBkJ,GAHA8a,EAAIH,EAAK7jB,GAME,IAANgkB,IACJD,GAAM,GAIR,GAAa,IAAR7a,EACJ,OAAO,EAGR,GAAe,IAAV9B,EACJ,OAAK6B,EAAEuD,iBACC8U,GAAela,GAAS6B,EAAGgP,GAE9B0L,EACGnC,GAAcpa,GAAS6B,EAAGgP,GAE3BsH,GAAMnY,GAAS6B,EAAGgP,GAK1B,GAHAqC,EAAKrR,EAAE/B,QAGF6c,IAAO3c,EAAM,EAAI,CAErB,IAAMpH,EAAI,EAAGA,EAAIoH,GACE,IAAbyc,EAAK7jB,GADaA,KAOxB,OAFAiJ,EAAEhC,MAAQ,CAAE4c,EAAI7jB,IAChBiJ,EAAE/B,QAAU,CAAEoT,EAAGta,IACZiJ,EAAEuD,iBACC8U,GAAe,GAAKrY,EAAGgP,GAE1B0L,EACGnC,GAAc,GAAKvY,EAAGgP,GAEvBsH,GAAM,GAAKtW,EAAGgP,EACrB,CAID,GAHA6L,E+DtRD,SAAyB5c,GACxB,IAAIkd,EACApkB,EAGJ,IADAokB,EAAM,EACApkB,EAAI,EAAGA,EAAIkH,EAAQ1G,OAAQR,IAC3BkH,EAASlH,GAAM,IACnBokB,GAAO,GAGT,OAAa,IAARA,EAEG,EAEHA,IAAQld,EAAQ1G,QAEb,EAGD,CACR,C/DkQO6jB,CAAgB/J,GAGT,IAARwJ,EAAY,CAKhB,GAAK5a,KAHL0a,EAAO5c,EAAuB6c,EAAKvJ,EAAIrR,EAAE9B,SAGrB,GAAGyc,EAAK,GAAG,GAASD,GAAe,EAAJza,GAAY0a,EAAK,GAAGA,EAAK,GAAG,EAU9E,OAPCtE,EADY,IAARwE,EACCF,EAAM,GAENA,EAAM,GAEZ3a,EAAEhC,MAAQ,CAAEiC,GACZD,EAAE/B,QAAU,CAAE,EAAkB,EAAJ4c,EAAQA,GACpC7a,EAAE9B,OAASmY,EACNrW,EAAEuD,iBACC8U,GAAe,GAAKrY,EAAGgP,GAE1B0L,EACGnC,GAAc,GAAKvY,EAAGgP,GAEvBsH,GAAM,GAAKtW,EAAGgP,GAKtB,GAAK7Q,GAASqc,GAEb,OAAKxa,EAAEuD,iBACC8U,GAAela,GAAS6B,EAAGgP,GAE9B0L,EACGnC,GAAcpa,GAAS6B,EAAGgP,GAE3BsH,GAAMnY,GAAS6B,EAAGgP,EAG1B,CAID,OAAK7Q,GAASqc,GACRxa,EAAEuD,iBACC+W,GAAuBnc,EAAM,GAAK6B,EAAGgP,GAExC0L,EACGH,GAAsBpc,EAAM,GAAK6B,EAAGgP,GAErCyJ,GAActa,EAAM,GAAK6B,EAAGgP,GAG/BhP,EAAEuD,iBACC+U,GAAgBtY,EAAGgP,GAEtB0L,EACGlC,GAAexY,EAAGgP,GAEnBkH,GAAQlW,EAAGgP,EACnB","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,338,339,340]}
\ No newline at end of file
diff --git a/lib/0d.js b/lib/0d.js
deleted file mode 100644
index 14d74ed..0000000
--- a/lib/0d.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [];
-*
-* // Define the array strides:
-* var sx = [ 0 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some0d( x, 1 );
-* // returns true
-*/
-function some0d( x, n ) {
-	if ( n <= 1 && x.data[ x.offset ] ) {
-		return true;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some0d;
diff --git a/lib/0d_accessors.js b/lib/0d_accessors.js
deleted file mode 100644
index aa94e6c..0000000
--- a/lib/0d_accessors.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';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [];
-*
-* // Define the array strides:
-* var sx = [ 0 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some0d( x, 1 );
-* // returns true
-*/
-function some0d( x, n ) {
-	if ( n <= 1 && x.accessors[ 0 ]( x.data, x.offset ) ) {
-		return true;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some0d;
diff --git a/lib/0d_complex.js b/lib/0d_complex.js
deleted file mode 100644
index eabdaf2..0000000
--- a/lib/0d_complex.js
+++ /dev/null
@@ -1,76 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [];
-*
-* // Define the array strides:
-* var sx = [ 0 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some0d( x, 1 );
-* // returns true
-*/
-function some0d( x, n ) {
-	if ( n <= 1 && ( x.data[ x.offset ] || x.data[ x.offset+1 ] ) ) {
-		return true;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some0d;
diff --git a/lib/10d.js b/lib/10d.js
deleted file mode 100644
index 76f3323..0000000
--- a/lib/10d.js
+++ /dev/null
@@ -1,212 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some10d( x, 4 );
-* // returns true
-*/
-function some10d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var S9;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 9 ];
-		S1 = sh[ 8 ];
-		S2 = sh[ 7 ];
-		S3 = sh[ 6 ];
-		S4 = sh[ 5 ];
-		S5 = sh[ 4 ];
-		S6 = sh[ 3 ];
-		S7 = sh[ 2 ];
-		S8 = sh[ 1 ];
-		S9 = sh[ 0 ];
-		dx0 = sx[ 9 ];                // offset increment for innermost loop
-		dx1 = sx[ 8 ] - ( S0*sx[9] );
-		dx2 = sx[ 7 ] - ( S1*sx[8] );
-		dx3 = sx[ 6 ] - ( S2*sx[7] );
-		dx4 = sx[ 5 ] - ( S3*sx[6] );
-		dx5 = sx[ 4 ] - ( S4*sx[5] );
-		dx6 = sx[ 3 ] - ( S5*sx[4] );
-		dx7 = sx[ 2 ] - ( S6*sx[3] );
-		dx8 = sx[ 1 ] - ( S7*sx[2] );
-		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		S9 = sh[ 9 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] );
-		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i9 = 0; i9 < S9; i9++ ) {
-		for ( i8 = 0; i8 < S8; i8++ ) {
-			for ( i7 = 0; i7 < S7; i7++ ) {
-				for ( i6 = 0; i6 < S6; i6++ ) {
-					for ( i5 = 0; i5 < S5; i5++ ) {
-						for ( i4 = 0; i4 < S4; i4++ ) {
-							for ( i3 = 0; i3 < S3; i3++ ) {
-								for ( i2 = 0; i2 < S2; i2++ ) {
-									for ( i1 = 0; i1 < S1; i1++ ) {
-										for ( i0 = 0; i0 < S0; i0++ ) {
-											if ( xbuf[ ix ] ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-						ix += dx5;
-					}
-					ix += dx6;
-				}
-				ix += dx7;
-			}
-			ix += dx8;
-		}
-		ix += dx9;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some10d;
diff --git a/lib/10d_accessors.js b/lib/10d_accessors.js
deleted file mode 100644
index 7af02d3..0000000
--- a/lib/10d_accessors.js
+++ /dev/null
@@ -1,219 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some10d( x, 4 );
-* // returns true
-*/
-function some10d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var S9;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 9 ];
-		S1 = sh[ 8 ];
-		S2 = sh[ 7 ];
-		S3 = sh[ 6 ];
-		S4 = sh[ 5 ];
-		S5 = sh[ 4 ];
-		S6 = sh[ 3 ];
-		S7 = sh[ 2 ];
-		S8 = sh[ 1 ];
-		S9 = sh[ 0 ];
-		dx0 = sx[ 9 ];                // offset increment for innermost loop
-		dx1 = sx[ 8 ] - ( S0*sx[9] );
-		dx2 = sx[ 7 ] - ( S1*sx[8] );
-		dx3 = sx[ 6 ] - ( S2*sx[7] );
-		dx4 = sx[ 5 ] - ( S3*sx[6] );
-		dx5 = sx[ 4 ] - ( S4*sx[5] );
-		dx6 = sx[ 3 ] - ( S5*sx[4] );
-		dx7 = sx[ 2 ] - ( S6*sx[3] );
-		dx8 = sx[ 1 ] - ( S7*sx[2] );
-		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		S9 = sh[ 9 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] );
-		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i9 = 0; i9 < S9; i9++ ) {
-		for ( i8 = 0; i8 < S8; i8++ ) {
-			for ( i7 = 0; i7 < S7; i7++ ) {
-				for ( i6 = 0; i6 < S6; i6++ ) {
-					for ( i5 = 0; i5 < S5; i5++ ) {
-						for ( i4 = 0; i4 < S4; i4++ ) {
-							for ( i3 = 0; i3 < S3; i3++ ) {
-								for ( i2 = 0; i2 < S2; i2++ ) {
-									for ( i1 = 0; i1 < S1; i1++ ) {
-										for ( i0 = 0; i0 < S0; i0++ ) {
-											if ( get( xbuf, ix ) ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-						ix += dx5;
-					}
-					ix += dx6;
-				}
-				ix += dx7;
-			}
-			ix += dx8;
-		}
-		ix += dx9;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some10d;
diff --git a/lib/10d_blocked.js b/lib/10d_blocked.js
deleted file mode 100644
index 0111f62..0000000
--- a/lib/10d_blocked.js
+++ /dev/null
@@ -1,312 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome10d( x, 4 );
-* // returns true
-*/
-function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var ox9;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var s9;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var j9;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j9 = sh[9]; j9 > 0; ) {
-		if ( j9 < bsize ) {
-			s9 = j9;
-			j9 = 0;
-		} else {
-			s9 = bsize;
-			j9 -= bsize;
-		}
-		ox9 = ox + ( j9*sx[9] );
-		for ( j8 = sh[8]; j8 > 0; ) {
-			if ( j8 < bsize ) {
-				s8 = j8;
-				j8 = 0;
-			} else {
-				s8 = bsize;
-				j8 -= bsize;
-			}
-			dx9 = sx[9] - ( s8*sx[8] );
-			ox8 = ox9 + ( j8*sx[8] );
-			for ( j7 = sh[7]; j7 > 0; ) {
-				if ( j7 < bsize ) {
-					s7 = j7;
-					j7 = 0;
-				} else {
-					s7 = bsize;
-					j7 -= bsize;
-				}
-				dx8 = sx[8] - ( s7*sx[7] );
-				ox7 = ox8 + ( j7*sx[7] );
-				for ( j6 = sh[6]; j6 > 0; ) {
-					if ( j6 < bsize ) {
-						s6 = j6;
-						j6 = 0;
-					} else {
-						s6 = bsize;
-						j6 -= bsize;
-					}
-					dx7 = sx[7] - ( s6*sx[6] );
-					ox6 = ox7 + ( j6*sx[6] );
-					for ( j5 = sh[5]; j5 > 0; ) {
-						if ( j5 < bsize ) {
-							s5 = j5;
-							j5 = 0;
-						} else {
-							s5 = bsize;
-							j5 -= bsize;
-						}
-						dx6 = sx[6] - ( s5*sx[5] );
-						ox5 = ox6 + ( j5*sx[5] );
-						for ( j4 = sh[4]; j4 > 0; ) {
-							if ( j4 < bsize ) {
-								s4 = j4;
-								j4 = 0;
-							} else {
-								s4 = bsize;
-								j4 -= bsize;
-							}
-							dx5 = sx[5] - ( s4*sx[4] );
-							ox4 = ox5 + ( j4*sx[4] );
-							for ( j3 = sh[3]; j3 > 0; ) {
-								if ( j3 < bsize ) {
-									s3 = j3;
-									j3 = 0;
-								} else {
-									s3 = bsize;
-									j3 -= bsize;
-								}
-								dx4 = sx[4] - ( s3*sx[3] );
-								ox3 = ox4 + ( j3*sx[3] );
-								for ( j2 = sh[2]; j2 > 0; ) {
-									if ( j2 < bsize ) {
-										s2 = j2;
-										j2 = 0;
-									} else {
-										s2 = bsize;
-										j2 -= bsize;
-									}
-									dx3 = sx[3] - ( s2*sx[2] );
-									ox2 = ox3 + ( j2*sx[2] );
-									for ( j1 = sh[1]; j1 > 0; ) {
-										if ( j1 < bsize ) {
-											s1 = j1;
-											j1 = 0;
-										} else {
-											s1 = bsize;
-											j1 -= bsize;
-										}
-										dx2 = sx[2] - ( s1*sx[1] );
-										ox1 = ox2 + ( j1*sx[1] );
-										for ( j0 = sh[0]; j0 > 0; ) {
-											if ( j0 < bsize ) {
-												s0 = j0;
-												j0 = 0;
-											} else {
-												s0 = bsize;
-												j0 -= bsize;
-											}
-											// Compute the index offset for the first input ndarray element in the current block:
-											ix = ox1 + ( j0*sx[0] );
-
-											// Compute the loop offset increment:
-											dx1 = sx[1] - ( s0*sx[0] );
-
-											// Iterate over the ndarray dimensions...
-											for ( i9 = 0; i9 < s9; i9++ ) {
-												for ( i8 = 0; i8 < s8; i8++ ) {
-													for ( i7 = 0; i7 < s7; i7++ ) {
-														for ( i6 = 0; i6 < s6; i6++ ) {
-															for ( i5 = 0; i5 < s5; i5++ ) {
-																for ( i4 = 0; i4 < s4; i4++ ) {
-																	for ( i3 = 0; i3 < s3; i3++ ) {
-																		for ( i2 = 0; i2 < s2; i2++ ) {
-																			for ( i1 = 0; i1 < s1; i1++ ) {
-																				for ( i0 = 0; i0 < s0; i0++ ) {
-																					if ( xbuf[ ix ] ) {
-																						count += 1;
-																						if ( count >= n ) {
-																							return true;
-																						}
-																					}
-																					ix += dx0;
-																				}
-																				ix += dx1;
-																			}
-																			ix += dx2;
-																		}
-																		ix += dx3;
-																	}
-																	ix += dx4;
-																}
-																ix += dx5;
-															}
-															ix += dx6;
-														}
-														ix += dx7;
-													}
-													ix += dx8;
-												}
-												ix += dx9;
-											}
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome10d;
diff --git a/lib/10d_blocked_accessors.js b/lib/10d_blocked_accessors.js
deleted file mode 100644
index 74c262c..0000000
--- a/lib/10d_blocked_accessors.js
+++ /dev/null
@@ -1,319 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome10d( x, 4 );
-* // returns true
-*/
-function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var ox9;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var s9;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var j9;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j9 = sh[9]; j9 > 0; ) {
-		if ( j9 < bsize ) {
-			s9 = j9;
-			j9 = 0;
-		} else {
-			s9 = bsize;
-			j9 -= bsize;
-		}
-		ox9 = ox + ( j9*sx[9] );
-		for ( j8 = sh[8]; j8 > 0; ) {
-			if ( j8 < bsize ) {
-				s8 = j8;
-				j8 = 0;
-			} else {
-				s8 = bsize;
-				j8 -= bsize;
-			}
-			dx9 = sx[9] - ( s8*sx[8] );
-			ox8 = ox9 + ( j8*sx[8] );
-			for ( j7 = sh[7]; j7 > 0; ) {
-				if ( j7 < bsize ) {
-					s7 = j7;
-					j7 = 0;
-				} else {
-					s7 = bsize;
-					j7 -= bsize;
-				}
-				dx8 = sx[8] - ( s7*sx[7] );
-				ox7 = ox8 + ( j7*sx[7] );
-				for ( j6 = sh[6]; j6 > 0; ) {
-					if ( j6 < bsize ) {
-						s6 = j6;
-						j6 = 0;
-					} else {
-						s6 = bsize;
-						j6 -= bsize;
-					}
-					dx7 = sx[7] - ( s6*sx[6] );
-					ox6 = ox7 + ( j6*sx[6] );
-					for ( j5 = sh[5]; j5 > 0; ) {
-						if ( j5 < bsize ) {
-							s5 = j5;
-							j5 = 0;
-						} else {
-							s5 = bsize;
-							j5 -= bsize;
-						}
-						dx6 = sx[6] - ( s5*sx[5] );
-						ox5 = ox6 + ( j5*sx[5] );
-						for ( j4 = sh[4]; j4 > 0; ) {
-							if ( j4 < bsize ) {
-								s4 = j4;
-								j4 = 0;
-							} else {
-								s4 = bsize;
-								j4 -= bsize;
-							}
-							dx5 = sx[5] - ( s4*sx[4] );
-							ox4 = ox5 + ( j4*sx[4] );
-							for ( j3 = sh[3]; j3 > 0; ) {
-								if ( j3 < bsize ) {
-									s3 = j3;
-									j3 = 0;
-								} else {
-									s3 = bsize;
-									j3 -= bsize;
-								}
-								dx4 = sx[4] - ( s3*sx[3] );
-								ox3 = ox4 + ( j3*sx[3] );
-								for ( j2 = sh[2]; j2 > 0; ) {
-									if ( j2 < bsize ) {
-										s2 = j2;
-										j2 = 0;
-									} else {
-										s2 = bsize;
-										j2 -= bsize;
-									}
-									dx3 = sx[3] - ( s2*sx[2] );
-									ox2 = ox3 + ( j2*sx[2] );
-									for ( j1 = sh[1]; j1 > 0; ) {
-										if ( j1 < bsize ) {
-											s1 = j1;
-											j1 = 0;
-										} else {
-											s1 = bsize;
-											j1 -= bsize;
-										}
-										dx2 = sx[2] - ( s1*sx[1] );
-										ox1 = ox2 + ( j1*sx[1] );
-										for ( j0 = sh[0]; j0 > 0; ) {
-											if ( j0 < bsize ) {
-												s0 = j0;
-												j0 = 0;
-											} else {
-												s0 = bsize;
-												j0 -= bsize;
-											}
-											// Compute the index offset for the first input ndarray element in the current block:
-											ix = ox1 + ( j0*sx[0] );
-
-											// Compute the loop offset increment:
-											dx1 = sx[1] - ( s0*sx[0] );
-
-											// Iterate over the ndarray dimensions...
-											for ( i9 = 0; i9 < s9; i9++ ) {
-												for ( i8 = 0; i8 < s8; i8++ ) {
-													for ( i7 = 0; i7 < s7; i7++ ) {
-														for ( i6 = 0; i6 < s6; i6++ ) {
-															for ( i5 = 0; i5 < s5; i5++ ) {
-																for ( i4 = 0; i4 < s4; i4++ ) {
-																	for ( i3 = 0; i3 < s3; i3++ ) {
-																		for ( i2 = 0; i2 < s2; i2++ ) {
-																			for ( i1 = 0; i1 < s1; i1++ ) {
-																				for ( i0 = 0; i0 < s0; i0++ ) {
-																					if ( get( xbuf, ix ) ) {
-																						count += 1;
-																						if ( count >= n ) {
-																							return true;
-																						}
-																					}
-																					ix += dx0;
-																				}
-																				ix += dx1;
-																			}
-																			ix += dx2;
-																		}
-																		ix += dx3;
-																	}
-																	ix += dx4;
-																}
-																ix += dx5;
-															}
-															ix += dx6;
-														}
-														ix += dx7;
-													}
-													ix += dx8;
-												}
-												ix += dx9;
-											}
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome10d;
diff --git a/lib/10d_blocked_complex.js b/lib/10d_blocked_complex.js
deleted file mode 100644
index 6169677..0000000
--- a/lib/10d_blocked_complex.js
+++ /dev/null
@@ -1,312 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome10d( x, 4 );
-* // returns true
-*/
-function blockedsome10d( x, n ) { // eslint-disable-line max-statements, max-lines-per-function
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var ox9;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var s9;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var j9;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j9 = sh[9]; j9 > 0; ) {
-		if ( j9 < bsize ) {
-			s9 = j9;
-			j9 = 0;
-		} else {
-			s9 = bsize;
-			j9 -= bsize;
-		}
-		ox9 = ox + ( j9*sx[9] );
-		for ( j8 = sh[8]; j8 > 0; ) {
-			if ( j8 < bsize ) {
-				s8 = j8;
-				j8 = 0;
-			} else {
-				s8 = bsize;
-				j8 -= bsize;
-			}
-			dx9 = sx[9] - ( s8*sx[8] );
-			ox8 = ox9 + ( j8*sx[8] );
-			for ( j7 = sh[7]; j7 > 0; ) {
-				if ( j7 < bsize ) {
-					s7 = j7;
-					j7 = 0;
-				} else {
-					s7 = bsize;
-					j7 -= bsize;
-				}
-				dx8 = sx[8] - ( s7*sx[7] );
-				ox7 = ox8 + ( j7*sx[7] );
-				for ( j6 = sh[6]; j6 > 0; ) {
-					if ( j6 < bsize ) {
-						s6 = j6;
-						j6 = 0;
-					} else {
-						s6 = bsize;
-						j6 -= bsize;
-					}
-					dx7 = sx[7] - ( s6*sx[6] );
-					ox6 = ox7 + ( j6*sx[6] );
-					for ( j5 = sh[5]; j5 > 0; ) {
-						if ( j5 < bsize ) {
-							s5 = j5;
-							j5 = 0;
-						} else {
-							s5 = bsize;
-							j5 -= bsize;
-						}
-						dx6 = sx[6] - ( s5*sx[5] );
-						ox5 = ox6 + ( j5*sx[5] );
-						for ( j4 = sh[4]; j4 > 0; ) {
-							if ( j4 < bsize ) {
-								s4 = j4;
-								j4 = 0;
-							} else {
-								s4 = bsize;
-								j4 -= bsize;
-							}
-							dx5 = sx[5] - ( s4*sx[4] );
-							ox4 = ox5 + ( j4*sx[4] );
-							for ( j3 = sh[3]; j3 > 0; ) {
-								if ( j3 < bsize ) {
-									s3 = j3;
-									j3 = 0;
-								} else {
-									s3 = bsize;
-									j3 -= bsize;
-								}
-								dx4 = sx[4] - ( s3*sx[3] );
-								ox3 = ox4 + ( j3*sx[3] );
-								for ( j2 = sh[2]; j2 > 0; ) {
-									if ( j2 < bsize ) {
-										s2 = j2;
-										j2 = 0;
-									} else {
-										s2 = bsize;
-										j2 -= bsize;
-									}
-									dx3 = sx[3] - ( s2*sx[2] );
-									ox2 = ox3 + ( j2*sx[2] );
-									for ( j1 = sh[1]; j1 > 0; ) {
-										if ( j1 < bsize ) {
-											s1 = j1;
-											j1 = 0;
-										} else {
-											s1 = bsize;
-											j1 -= bsize;
-										}
-										dx2 = sx[2] - ( s1*sx[1] );
-										ox1 = ox2 + ( j1*sx[1] );
-										for ( j0 = sh[0]; j0 > 0; ) {
-											if ( j0 < bsize ) {
-												s0 = j0;
-												j0 = 0;
-											} else {
-												s0 = bsize;
-												j0 -= bsize;
-											}
-											// Compute the index offset for the first input ndarray element in the current block:
-											ix = ox1 + ( j0*sx[0] );
-
-											// Compute the loop offset increment:
-											dx1 = sx[1] - ( s0*sx[0] );
-
-											// Iterate over the ndarray dimensions...
-											for ( i9 = 0; i9 < s9; i9++ ) {
-												for ( i8 = 0; i8 < s8; i8++ ) {
-													for ( i7 = 0; i7 < s7; i7++ ) {
-														for ( i6 = 0; i6 < s6; i6++ ) {
-															for ( i5 = 0; i5 < s5; i5++ ) {
-																for ( i4 = 0; i4 < s4; i4++ ) {
-																	for ( i3 = 0; i3 < s3; i3++ ) {
-																		for ( i2 = 0; i2 < s2; i2++ ) {
-																			for ( i1 = 0; i1 < s1; i1++ ) {
-																				for ( i0 = 0; i0 < s0; i0++ ) {
-																					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-																						count += 1;
-																						if ( count >= n ) {
-																							return true;
-																						}
-																					}
-																					ix += dx0;
-																				}
-																				ix += dx1;
-																			}
-																			ix += dx2;
-																		}
-																		ix += dx3;
-																	}
-																	ix += dx4;
-																}
-																ix += dx5;
-															}
-															ix += dx6;
-														}
-														ix += dx7;
-													}
-													ix += dx8;
-												}
-												ix += dx9;
-											}
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome10d;
diff --git a/lib/10d_complex.js b/lib/10d_complex.js
deleted file mode 100644
index 7613f8f..0000000
--- a/lib/10d_complex.js
+++ /dev/null
@@ -1,212 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some10d( x, 4 );
-* // returns true
-*/
-function some10d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var dx9;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var S9;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var i9;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 9 ];
-		S1 = sh[ 8 ];
-		S2 = sh[ 7 ];
-		S3 = sh[ 6 ];
-		S4 = sh[ 5 ];
-		S5 = sh[ 4 ];
-		S6 = sh[ 3 ];
-		S7 = sh[ 2 ];
-		S8 = sh[ 1 ];
-		S9 = sh[ 0 ];
-		dx0 = sx[ 9 ];                // offset increment for innermost loop
-		dx1 = sx[ 8 ] - ( S0*sx[9] );
-		dx2 = sx[ 7 ] - ( S1*sx[8] );
-		dx3 = sx[ 6 ] - ( S2*sx[7] );
-		dx4 = sx[ 5 ] - ( S3*sx[6] );
-		dx5 = sx[ 4 ] - ( S4*sx[5] );
-		dx6 = sx[ 3 ] - ( S5*sx[4] );
-		dx7 = sx[ 2 ] - ( S6*sx[3] );
-		dx8 = sx[ 1 ] - ( S7*sx[2] );
-		dx9 = sx[ 0 ] - ( S8*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		S9 = sh[ 9 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] );
-		dx9 = sx[ 9 ] - ( S8*sx[8] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i9 = 0; i9 < S9; i9++ ) {
-		for ( i8 = 0; i8 < S8; i8++ ) {
-			for ( i7 = 0; i7 < S7; i7++ ) {
-				for ( i6 = 0; i6 < S6; i6++ ) {
-					for ( i5 = 0; i5 < S5; i5++ ) {
-						for ( i4 = 0; i4 < S4; i4++ ) {
-							for ( i3 = 0; i3 < S3; i3++ ) {
-								for ( i2 = 0; i2 < S2; i2++ ) {
-									for ( i1 = 0; i1 < S1; i1++ ) {
-										for ( i0 = 0; i0 < S0; i0++ ) {
-											if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-						ix += dx5;
-					}
-					ix += dx6;
-				}
-				ix += dx7;
-			}
-			ix += dx8;
-		}
-		ix += dx9;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some10d;
diff --git a/lib/1d.js b/lib/1d.js
deleted file mode 100644
index 7e930f5..0000000
--- a/lib/1d.js
+++ /dev/null
@@ -1,105 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 4 ];
-*
-* // Define the array strides:
-* var sx = [ 2 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some1d( x, 4 );
-* // returns true
-*/
-function some1d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var S0;
-	var ix;
-	var i0;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables: dimensions and loop offset (pointer) increments:
-	S0 = x.shape[ 0 ];
-	dx0 = x.strides[ 0 ];
-
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i0 = 0; i0 < S0; i0++ ) {
-		if ( xbuf[ ix ] ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-		ix += dx0;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some1d;
diff --git a/lib/1d_accessors.js b/lib/1d_accessors.js
deleted file mode 100644
index 083765d..0000000
--- a/lib/1d_accessors.js
+++ /dev/null
@@ -1,112 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 4 ];
-*
-* // Define the array strides:
-* var sx = [ 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some1d( x, 4 );
-* // returns true
-*/
-function some1d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var S0;
-	var ix;
-	var i0;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables: dimensions and loop offset (pointer) increments...
-	S0 = x.shape[ 0 ];
-	dx0 = x.strides[ 0 ];
-
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i0 = 0; i0 < S0; i0++ ) {
-		if ( get( xbuf, ix ) ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-		ix += dx0;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some1d;
diff --git a/lib/1d_complex.js b/lib/1d_complex.js
deleted file mode 100644
index c8342b2..0000000
--- a/lib/1d_complex.js
+++ /dev/null
@@ -1,105 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 4 ];
-*
-* // Define the array strides:
-* var sx = [ 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some1d( x, 4 );
-* // returns true
-*/
-function some1d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var S0;
-	var ix;
-	var i0;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables: dimensions and loop offset (pointer) increments:
-	S0 = x.shape[ 0 ];
-	dx0 = x.strides[ 0 ];
-
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i0 = 0; i0 < S0; i0++ ) {
-		if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-		ix += dx0;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some1d;
diff --git a/lib/2d.js b/lib/2d.js
deleted file mode 100644
index 210fd2f..0000000
--- a/lib/2d.js
+++ /dev/null
@@ -1,130 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some2d( x, 4 );
-* // returns true
-*/
-function some2d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var sh;
-	var S0;
-	var S1;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 1 ];
-		S1 = sh[ 0 ];
-		dx0 = sx[ 1 ];                // offset increment for innermost loop
-		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i1 = 0; i1 < S1; i1++ ) {
-		for ( i0 = 0; i0 < S0; i0++ ) {
-			if ( xbuf[ ix ] ) {
-				count += 1;
-				if ( count >= n ) {
-					return true;
-				}
-			}
-			ix += dx0;
-		}
-		ix += dx1;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some2d;
diff --git a/lib/2d_accessors.js b/lib/2d_accessors.js
deleted file mode 100644
index 37f0b26..0000000
--- a/lib/2d_accessors.js
+++ /dev/null
@@ -1,137 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some2d( x, 4 );
-* // returns true
-*/
-function some2d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var sh;
-	var S0;
-	var S1;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 1 ];
-		S1 = sh[ 0 ];
-		dx0 = sx[ 1 ];                // offset increment for innermost loop
-		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i1 = 0; i1 < S1; i1++ ) {
-		for ( i0 = 0; i0 < S0; i0++ ) {
-			if ( get( xbuf, ix ) ) {
-				count += 1;
-				if ( count >= n ) {
-					return true;
-				}
-			}
-			ix += dx0;
-		}
-		ix += dx1;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some2d;
diff --git a/lib/2d_blocked.js b/lib/2d_blocked.js
deleted file mode 100644
index 28b33ee..0000000
--- a/lib/2d_blocked.js
+++ /dev/null
@@ -1,160 +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';
-
-/* eslint-disable max-depth */
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome2d( x, 4 );
-* // returns true
-*/
-function blockedsome2d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var ox1;
-	var sh;
-	var s0;
-	var s1;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var j0;
-	var j1;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j1 = sh[1]; j1 > 0; ) {
-		if ( j1 < bsize ) {
-			s1 = j1;
-			j1 = 0;
-		} else {
-			s1 = bsize;
-			j1 -= bsize;
-		}
-		ox1 = ox + ( j1*sx[1] );
-		for ( j0 = sh[0]; j0 > 0; ) {
-			if ( j0 < bsize ) {
-				s0 = j0;
-				j0 = 0;
-			} else {
-				s0 = bsize;
-				j0 -= bsize;
-			}
-			// Compute the index offset for the first input ndarray element in the current block:
-			ix = ox1 + ( j0*sx[0] );
-
-			// Compute the loop offset increment:
-			dx1 = sx[1] - ( s0*sx[0] );
-
-			// Iterate over the ndarray dimensions...
-			for ( i1 = 0; i1 < s1; i1++ ) {
-				for ( i0 = 0; i0 < s0; i0++ ) {
-					if ( xbuf[ ix ] ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome2d;
diff --git a/lib/2d_blocked_accessors.js b/lib/2d_blocked_accessors.js
deleted file mode 100644
index 79f58cd..0000000
--- a/lib/2d_blocked_accessors.js
+++ /dev/null
@@ -1,167 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-/* eslint-disable max-depth */
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome2d( x, 4 );
-* // returns true
-*/
-function blockedsome2d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var ox1;
-	var sh;
-	var s0;
-	var s1;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var j0;
-	var j1;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j1 = sh[1]; j1 > 0; ) {
-		if ( j1 < bsize ) {
-			s1 = j1;
-			j1 = 0;
-		} else {
-			s1 = bsize;
-			j1 -= bsize;
-		}
-		ox1 = ox + ( j1*sx[1] );
-		for ( j0 = sh[0]; j0 > 0; ) {
-			if ( j0 < bsize ) {
-				s0 = j0;
-				j0 = 0;
-			} else {
-				s0 = bsize;
-				j0 -= bsize;
-			}
-			// Compute the index offset for the first input ndarray element in the current block:
-			ix = ox1 + ( j0*sx[0] );
-
-			// Compute the loop offset increment:
-			dx1 = sx[1] - ( s0*sx[0] );
-
-			// Iterate over the ndarray dimensions...
-			for ( i1 = 0; i1 < s1; i1++ ) {
-				for ( i0 = 0; i0 < s0; i0++ ) {
-					if ( get( xbuf, ix ) ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome2d;
diff --git a/lib/2d_blocked_complex.js b/lib/2d_blocked_complex.js
deleted file mode 100644
index bb2bb55..0000000
--- a/lib/2d_blocked_complex.js
+++ /dev/null
@@ -1,160 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome2d( x, 4 );
-* // returns true
-*/
-function blockedsome2d( x, n ) {
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var ox1;
-	var sh;
-	var s0;
-	var s1;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var j0;
-	var j1;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j1 = sh[1]; j1 > 0; ) {
-		if ( j1 < bsize ) {
-			s1 = j1;
-			j1 = 0;
-		} else {
-			s1 = bsize;
-			j1 -= bsize;
-		}
-		ox1 = ox + ( j1*sx[1] );
-		for ( j0 = sh[0]; j0 > 0; ) {
-			if ( j0 < bsize ) {
-				s0 = j0;
-				j0 = 0;
-			} else {
-				s0 = bsize;
-				j0 -= bsize;
-			}
-			// Compute the index offset for the first input ndarray element in the current block:
-			ix = ox1 + ( j0*sx[0] );
-
-			// Compute the loop offset increment:
-			dx1 = sx[1] - ( s0*sx[0] );
-
-			// Iterate over the ndarray dimensions...
-			for ( i1 = 0; i1 < s1; i1++ ) {
-				for ( i0 = 0; i0 < s0; i0++ ) {
-					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome2d;
diff --git a/lib/2d_complex.js b/lib/2d_complex.js
deleted file mode 100644
index 44ca3e5..0000000
--- a/lib/2d_complex.js
+++ /dev/null
@@ -1,130 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some2d( x, 4 );
-* // returns true
-*/
-function some2d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var sh;
-	var S0;
-	var S1;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 1 ];
-		S1 = sh[ 0 ];
-		dx0 = sx[ 1 ];                // offset increment for innermost loop
-		dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i1 = 0; i1 < S1; i1++ ) {
-		for ( i0 = 0; i0 < S0; i0++ ) {
-			if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-				count += 1;
-				if ( count >= n ) {
-					return true;
-				}
-			}
-			ix += dx0;
-		}
-		ix += dx1;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some2d;
diff --git a/lib/3d.js b/lib/3d.js
deleted file mode 100644
index 75b77ea..0000000
--- a/lib/3d.js
+++ /dev/null
@@ -1,140 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some3d( x, 4 );
-* // returns true
-*/
-function some3d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 2 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 0 ];
-		dx0 = sx[ 2 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[2] );
-		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i2 = 0; i2 < S2; i2++ ) {
-		for ( i1 = 0; i1 < S1; i1++ ) {
-			for ( i0 = 0; i0 < S0; i0++ ) {
-				if ( xbuf[ ix ] ) {
-					count += 1;
-					if ( count >= n ) {
-						return true;
-					}
-				}
-				ix += dx0;
-			}
-			ix += dx1;
-		}
-		ix += dx2;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some3d;
diff --git a/lib/3d_accessors.js b/lib/3d_accessors.js
deleted file mode 100644
index 103290d..0000000
--- a/lib/3d_accessors.js
+++ /dev/null
@@ -1,147 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some3d( x, 4 );
-* // returns true
-*/
-function some3d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-
-	// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 2 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 0 ];
-		dx0 = sx[ 2 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[2] );
-		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i2 = 0; i2 < S2; i2++ ) {
-		for ( i1 = 0; i1 < S1; i1++ ) {
-			for ( i0 = 0; i0 < S0; i0++ ) {
-				if ( get( xbuf, ix ) ) {
-					count += 1;
-					if ( count >= n ) {
-						return true;
-					}
-				}
-				ix += dx0;
-			}
-			ix += dx1;
-		}
-		ix += dx2;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some3d;
diff --git a/lib/3d_blocked.js b/lib/3d_blocked.js
deleted file mode 100644
index 013ee1d..0000000
--- a/lib/3d_blocked.js
+++ /dev/null
@@ -1,179 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome3d( x, 4 );
-* // returns true
-*/
-function blockedsome3d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var ox1;
-	var ox2;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var j0;
-	var j1;
-	var j2;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j2 = sh[2]; j2 > 0; ) {
-		if ( j2 < bsize ) {
-			s2 = j2;
-			j2 = 0;
-		} else {
-			s2 = bsize;
-			j2 -= bsize;
-		}
-		ox2 = ox + ( j2*sx[2] );
-		for ( j1 = sh[1]; j1 > 0; ) {
-			if ( j1 < bsize ) {
-				s1 = j1;
-				j1 = 0;
-			} else {
-				s1 = bsize;
-				j1 -= bsize;
-			}
-			dx2 = sx[2] - ( s1*sx[1] );
-			ox1 = ox2 + ( j1*sx[1] );
-			for ( j0 = sh[0]; j0 > 0; ) {
-				if ( j0 < bsize ) {
-					s0 = j0;
-					j0 = 0;
-				} else {
-					s0 = bsize;
-					j0 -= bsize;
-				}
-				// Compute the index offset for the first input ndarray element in the current block:
-				ix = ox1 + ( j0*sx[0] );
-
-				// Compute the loop offset increment:
-				dx1 = sx[1] - ( s0*sx[0] );
-
-				// Iterate over the ndarray dimensions...
-				for ( i2 = 0; i2 < s2; i2++ ) {
-					for ( i1 = 0; i1 < s1; i1++ ) {
-						for ( i0 = 0; i0 < s0; i0++ ) {
-							if ( xbuf[ ix ] ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome3d;
diff --git a/lib/3d_blocked_accessors.js b/lib/3d_blocked_accessors.js
deleted file mode 100644
index 9388f08..0000000
--- a/lib/3d_blocked_accessors.js
+++ /dev/null
@@ -1,186 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome3d( x, 4 );
-* // returns true
-*/
-function blockedsome3d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var ox1;
-	var ox2;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var j0;
-	var j1;
-	var j2;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j2 = sh[2]; j2 > 0; ) {
-		if ( j2 < bsize ) {
-			s2 = j2;
-			j2 = 0;
-		} else {
-			s2 = bsize;
-			j2 -= bsize;
-		}
-		ox2 = ox + ( j2*sx[2] );
-		for ( j1 = sh[1]; j1 > 0; ) {
-			if ( j1 < bsize ) {
-				s1 = j1;
-				j1 = 0;
-			} else {
-				s1 = bsize;
-				j1 -= bsize;
-			}
-			dx2 = sx[2] - ( s1*sx[1] );
-			ox1 = ox2 + ( j1*sx[1] );
-			for ( j0 = sh[0]; j0 > 0; ) {
-				if ( j0 < bsize ) {
-					s0 = j0;
-					j0 = 0;
-				} else {
-					s0 = bsize;
-					j0 -= bsize;
-				}
-				// Compute the index offset for the first input ndarray element in the current block:
-				ix = ox1 + ( j0*sx[0] );
-
-				// Compute the loop offset increment:
-				dx1 = sx[1] - ( s0*sx[0] );
-
-				// Iterate over the ndarray dimensions...
-				for ( i2 = 0; i2 < s2; i2++ ) {
-					for ( i1 = 0; i1 < s1; i1++ ) {
-						for ( i0 = 0; i0 < s0; i0++ ) {
-							if ( get( xbuf, ix ) ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome3d;
diff --git a/lib/3d_blocked_complex.js b/lib/3d_blocked_complex.js
deleted file mode 100644
index 42d004f..0000000
--- a/lib/3d_blocked_complex.js
+++ /dev/null
@@ -1,179 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray is truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome3d( x, 4 );
-* // returns true
-*/
-function blockedsome3d( x, n ) {
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var ox1;
-	var ox2;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var j0;
-	var j1;
-	var j2;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j2 = sh[2]; j2 > 0; ) {
-		if ( j2 < bsize ) {
-			s2 = j2;
-			j2 = 0;
-		} else {
-			s2 = bsize;
-			j2 -= bsize;
-		}
-		ox2 = ox + ( j2*sx[2] );
-		for ( j1 = sh[1]; j1 > 0; ) {
-			if ( j1 < bsize ) {
-				s1 = j1;
-				j1 = 0;
-			} else {
-				s1 = bsize;
-				j1 -= bsize;
-			}
-			dx2 = sx[2] - ( s1*sx[1] );
-			ox1 = ox2 + ( j1*sx[1] );
-			for ( j0 = sh[0]; j0 > 0; ) {
-				if ( j0 < bsize ) {
-					s0 = j0;
-					j0 = 0;
-				} else {
-					s0 = bsize;
-					j0 -= bsize;
-				}
-				// Compute the index offset for the first input ndarray element in the current block:
-				ix = ox1 + ( j0*sx[0] );
-
-				// Compute the loop offset increment:
-				dx1 = sx[1] - ( s0*sx[0] );
-
-				// Iterate over the ndarray dimensions...
-				for ( i2 = 0; i2 < s2; i2++ ) {
-					for ( i1 = 0; i1 < s1; i1++ ) {
-						for ( i0 = 0; i0 < s0; i0++ ) {
-							if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome3d;
diff --git a/lib/3d_complex.js b/lib/3d_complex.js
deleted file mode 100644
index 888e376..0000000
--- a/lib/3d_complex.js
+++ /dev/null
@@ -1,140 +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 strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some3d( x, 4 );
-* // returns true
-*/
-function some3d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 2 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 0 ];
-		dx0 = sx[ 2 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[2] );
-		dx2 = sx[ 0 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i2 = 0; i2 < S2; i2++ ) {
-		for ( i1 = 0; i1 < S1; i1++ ) {
-			for ( i0 = 0; i0 < S0; i0++ ) {
-				if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-					count += 1;
-					if ( count >= n ) {
-						return true;
-					}
-				}
-				ix += dx0;
-			}
-			ix += dx1;
-		}
-		ix += dx2;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some3d;
diff --git a/lib/4d.js b/lib/4d.js
deleted file mode 100644
index c95ddd3..0000000
--- a/lib/4d.js
+++ /dev/null
@@ -1,152 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some4d( x, 4 );
-* // returns true
-*/
-function some4d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 3 ];
-		S1 = sh[ 2 ];
-		S2 = sh[ 1 ];
-		S3 = sh[ 0 ];
-		dx0 = sx[ 3 ];                // offset increment for innermost loop
-		dx1 = sx[ 2 ] - ( S0*sx[3] );
-		dx2 = sx[ 1 ] - ( S1*sx[2] );
-		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i3 = 0; i3 < S3; i3++ ) {
-		for ( i2 = 0; i2 < S2; i2++ ) {
-			for ( i1 = 0; i1 < S1; i1++ ) {
-				for ( i0 = 0; i0 < S0; i0++ ) {
-					if ( xbuf[ ix ] ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-			ix += dx2;
-		}
-		ix += dx3;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some4d;
diff --git a/lib/4d_accessors.js b/lib/4d_accessors.js
deleted file mode 100644
index 6acb335..0000000
--- a/lib/4d_accessors.js
+++ /dev/null
@@ -1,159 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some4d( x, 4 );
-* // returns true
-*/
-function some4d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 3 ];
-		S1 = sh[ 2 ];
-		S2 = sh[ 1 ];
-		S3 = sh[ 0 ];
-		dx0 = sx[ 3 ];                // offset increment for innermost loop
-		dx1 = sx[ 2 ] - ( S0*sx[3] );
-		dx2 = sx[ 1 ] - ( S1*sx[2] );
-		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i3 = 0; i3 < S3; i3++ ) {
-		for ( i2 = 0; i2 < S2; i2++ ) {
-			for ( i1 = 0; i1 < S1; i1++ ) {
-				for ( i0 = 0; i0 < S0; i0++ ) {
-					if ( get( xbuf, ix ) ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-			ix += dx2;
-		}
-		ix += dx3;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some4d;
diff --git a/lib/4d_blocked.js b/lib/4d_blocked.js
deleted file mode 100644
index 2cc3901..0000000
--- a/lib/4d_blocked.js
+++ /dev/null
@@ -1,198 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome4d( x, 4 );
-* // returns true
-*/
-function blockedsome4d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var ox1;
-	var ox2;
-	var ox3;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j3 = sh[3]; j3 > 0; ) {
-		if ( j3 < bsize ) {
-			s3 = j3;
-			j3 = 0;
-		} else {
-			s3 = bsize;
-			j3 -= bsize;
-		}
-		ox3 = ox + ( j3*sx[3] );
-		for ( j2 = sh[2]; j2 > 0; ) {
-			if ( j2 < bsize ) {
-				s2 = j2;
-				j2 = 0;
-			} else {
-				s2 = bsize;
-				j2 -= bsize;
-			}
-			dx3 = sx[3] - ( s2*sx[2] );
-			ox2 = ox3 + ( j2*sx[2] );
-			for ( j1 = sh[1]; j1 > 0; ) {
-				if ( j1 < bsize ) {
-					s1 = j1;
-					j1 = 0;
-				} else {
-					s1 = bsize;
-					j1 -= bsize;
-				}
-				dx2 = sx[2] - ( s1*sx[1] );
-				ox1 = ox2 + ( j1*sx[1] );
-				for ( j0 = sh[0]; j0 > 0; ) {
-					if ( j0 < bsize ) {
-						s0 = j0;
-						j0 = 0;
-					} else {
-						s0 = bsize;
-						j0 -= bsize;
-					}
-					// Compute the index offset for the first input ndarray element in the current block:
-					ix = ox1 + ( j0*sx[0] );
-
-					// Compute the loop offset increment:
-					dx1 = sx[1] - ( s0*sx[0] );
-
-					// Iterate over the ndarray dimensions...
-					for ( i3 = 0; i3 < s3; i3++ ) {
-						for ( i2 = 0; i2 < s2; i2++ ) {
-							for ( i1 = 0; i1 < s1; i1++ ) {
-								for ( i0 = 0; i0 < s0; i0++ ) {
-									if ( xbuf[ ix ] ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome4d;
diff --git a/lib/4d_blocked_accessors.js b/lib/4d_blocked_accessors.js
deleted file mode 100644
index dd92e5c..0000000
--- a/lib/4d_blocked_accessors.js
+++ /dev/null
@@ -1,205 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome4d( x, 4 );
-* // returns true
-*/
-function blockedsome4d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var ox1;
-	var ox2;
-	var ox3;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j3 = sh[3]; j3 > 0; ) {
-		if ( j3 < bsize ) {
-			s3 = j3;
-			j3 = 0;
-		} else {
-			s3 = bsize;
-			j3 -= bsize;
-		}
-		ox3 = ox + ( j3*sx[3] );
-		for ( j2 = sh[2]; j2 > 0; ) {
-			if ( j2 < bsize ) {
-				s2 = j2;
-				j2 = 0;
-			} else {
-				s2 = bsize;
-				j2 -= bsize;
-			}
-			dx3 = sx[3] - ( s2*sx[2] );
-			ox2 = ox3 + ( j2*sx[2] );
-			for ( j1 = sh[1]; j1 > 0; ) {
-				if ( j1 < bsize ) {
-					s1 = j1;
-					j1 = 0;
-				} else {
-					s1 = bsize;
-					j1 -= bsize;
-				}
-				dx2 = sx[2] - ( s1*sx[1] );
-				ox1 = ox2 + ( j1*sx[1] );
-				for ( j0 = sh[0]; j0 > 0; ) {
-					if ( j0 < bsize ) {
-						s0 = j0;
-						j0 = 0;
-					} else {
-						s0 = bsize;
-						j0 -= bsize;
-					}
-					// Compute the index offset for the first input ndarray element in the current block:
-					ix = ox1 + ( j0*sx[0] );
-
-					// Compute the loop offset increment:
-					dx1 = sx[1] - ( s0*sx[0] );
-
-					// Iterate over the ndarray dimensions...
-					for ( i3 = 0; i3 < s3; i3++ ) {
-						for ( i2 = 0; i2 < s2; i2++ ) {
-							for ( i1 = 0; i1 < s1; i1++ ) {
-								for ( i0 = 0; i0 < s0; i0++ ) {
-									if ( get( xbuf, ix ) ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome4d;
diff --git a/lib/4d_blocked_complex.js b/lib/4d_blocked_complex.js
deleted file mode 100644
index dbb811b..0000000
--- a/lib/4d_blocked_complex.js
+++ /dev/null
@@ -1,198 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome4d( x, 4 );
-* // returns true
-*/
-function blockedsome4d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var ox1;
-	var ox2;
-	var ox3;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j3 = sh[3]; j3 > 0; ) {
-		if ( j3 < bsize ) {
-			s3 = j3;
-			j3 = 0;
-		} else {
-			s3 = bsize;
-			j3 -= bsize;
-		}
-		ox3 = ox + ( j3*sx[3] );
-		for ( j2 = sh[2]; j2 > 0; ) {
-			if ( j2 < bsize ) {
-				s2 = j2;
-				j2 = 0;
-			} else {
-				s2 = bsize;
-				j2 -= bsize;
-			}
-			dx3 = sx[3] - ( s2*sx[2] );
-			ox2 = ox3 + ( j2*sx[2] );
-			for ( j1 = sh[1]; j1 > 0; ) {
-				if ( j1 < bsize ) {
-					s1 = j1;
-					j1 = 0;
-				} else {
-					s1 = bsize;
-					j1 -= bsize;
-				}
-				dx2 = sx[2] - ( s1*sx[1] );
-				ox1 = ox2 + ( j1*sx[1] );
-				for ( j0 = sh[0]; j0 > 0; ) {
-					if ( j0 < bsize ) {
-						s0 = j0;
-						j0 = 0;
-					} else {
-						s0 = bsize;
-						j0 -= bsize;
-					}
-					// Compute the index offset for the first input ndarray element in the current block:
-					ix = ox1 + ( j0*sx[0] );
-
-					// Compute the loop offset increment:
-					dx1 = sx[1] - ( s0*sx[0] );
-
-					// Iterate over the ndarray dimensions...
-					for ( i3 = 0; i3 < s3; i3++ ) {
-						for ( i2 = 0; i2 < s2; i2++ ) {
-							for ( i1 = 0; i1 < s1; i1++ ) {
-								for ( i0 = 0; i0 < s0; i0++ ) {
-									if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome4d;
diff --git a/lib/4d_complex.js b/lib/4d_complex.js
deleted file mode 100644
index 5f92e02..0000000
--- a/lib/4d_complex.js
+++ /dev/null
@@ -1,152 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some4d( x, 4 );
-* // returns true
-*/
-function some4d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 3 ];
-		S1 = sh[ 2 ];
-		S2 = sh[ 1 ];
-		S3 = sh[ 0 ];
-		dx0 = sx[ 3 ];                // offset increment for innermost loop
-		dx1 = sx[ 2 ] - ( S0*sx[3] );
-		dx2 = sx[ 1 ] - ( S1*sx[2] );
-		dx3 = sx[ 0 ] - ( S2*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i3 = 0; i3 < S3; i3++ ) {
-		for ( i2 = 0; i2 < S2; i2++ ) {
-			for ( i1 = 0; i1 < S1; i1++ ) {
-				for ( i0 = 0; i0 < S0; i0++ ) {
-					if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-						count += 1;
-						if ( count >= n ) {
-							return true;
-						}
-					}
-					ix += dx0;
-				}
-				ix += dx1;
-			}
-			ix += dx2;
-		}
-		ix += dx3;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some4d;
diff --git a/lib/5d.js b/lib/5d.js
deleted file mode 100644
index 589546f..0000000
--- a/lib/5d.js
+++ /dev/null
@@ -1,162 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some5d( x, 4 );
-* // returns true
-*/
-function some5d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 4 ];
-		S1 = sh[ 3 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 1 ];
-		S4 = sh[ 0 ];
-		dx0 = sx[ 4 ];                // offset increment for innermost loop
-		dx1 = sx[ 3 ] - ( S0*sx[4] );
-		dx2 = sx[ 2 ] - ( S1*sx[3] );
-		dx3 = sx[ 1 ] - ( S2*sx[2] );
-		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i4 = 0; i4 < S4; i4++ ) {
-		for ( i3 = 0; i3 < S3; i3++ ) {
-			for ( i2 = 0; i2 < S2; i2++ ) {
-				for ( i1 = 0; i1 < S1; i1++ ) {
-					for ( i0 = 0; i0 < S0; i0++ ) {
-						if ( xbuf[ ix ] ) {
-							count += 1;
-							if ( count >= n ) {
-								return true;
-							}
-						}
-						ix += dx0;
-					}
-					ix += dx1;
-				}
-				ix += dx2;
-			}
-			ix += dx3;
-		}
-		ix += dx4;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some5d;
diff --git a/lib/5d_accessors.js b/lib/5d_accessors.js
deleted file mode 100644
index 79be9eb..0000000
--- a/lib/5d_accessors.js
+++ /dev/null
@@ -1,169 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some5d( x, 4 );
-* // returns true
-*/
-function some5d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 4 ];
-		S1 = sh[ 3 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 1 ];
-		S4 = sh[ 0 ];
-		dx0 = sx[ 4 ];                // offset increment for innermost loop
-		dx1 = sx[ 3 ] - ( S0*sx[4] );
-		dx2 = sx[ 2 ] - ( S1*sx[3] );
-		dx3 = sx[ 1 ] - ( S2*sx[2] );
-		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i4 = 0; i4 < S4; i4++ ) {
-		for ( i3 = 0; i3 < S3; i3++ ) {
-			for ( i2 = 0; i2 < S2; i2++ ) {
-				for ( i1 = 0; i1 < S1; i1++ ) {
-					for ( i0 = 0; i0 < S0; i0++ ) {
-						if ( get( xbuf, ix ) ) {
-							count += 1;
-							if ( count >= n ) {
-								return true;
-							}
-						}
-						ix += dx0;
-					}
-					ix += dx1;
-				}
-				ix += dx2;
-			}
-			ix += dx3;
-		}
-		ix += dx4;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some5d;
diff --git a/lib/5d_blocked.js b/lib/5d_blocked.js
deleted file mode 100644
index 5324ed0..0000000
--- a/lib/5d_blocked.js
+++ /dev/null
@@ -1,217 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome5d( x, 4 );
-* // returns true
-*/
-function blockedsome5d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j4 = sh[4]; j4 > 0; ) {
-		if ( j4 < bsize ) {
-			s4 = j4;
-			j4 = 0;
-		} else {
-			s4 = bsize;
-			j4 -= bsize;
-		}
-		ox4 = ox + ( j4*sx[4] );
-		for ( j3 = sh[3]; j3 > 0; ) {
-			if ( j3 < bsize ) {
-				s3 = j3;
-				j3 = 0;
-			} else {
-				s3 = bsize;
-				j3 -= bsize;
-			}
-			dx4 = sx[4] - ( s3*sx[3] );
-			ox3 = ox4 + ( j3*sx[3] );
-			for ( j2 = sh[2]; j2 > 0; ) {
-				if ( j2 < bsize ) {
-					s2 = j2;
-					j2 = 0;
-				} else {
-					s2 = bsize;
-					j2 -= bsize;
-				}
-				dx3 = sx[3] - ( s2*sx[2] );
-				ox2 = ox3 + ( j2*sx[2] );
-				for ( j1 = sh[1]; j1 > 0; ) {
-					if ( j1 < bsize ) {
-						s1 = j1;
-						j1 = 0;
-					} else {
-						s1 = bsize;
-						j1 -= bsize;
-					}
-					dx2 = sx[2] - ( s1*sx[1] );
-					ox1 = ox2 + ( j1*sx[1] );
-					for ( j0 = sh[0]; j0 > 0; ) {
-						if ( j0 < bsize ) {
-							s0 = j0;
-							j0 = 0;
-						} else {
-							s0 = bsize;
-							j0 -= bsize;
-						}
-						// Compute the index offset for the first input ndarray element in the current block:
-						ix = ox1 + ( j0*sx[0] );
-
-						// Compute the loop offset increment:
-						dx1 = sx[1] - ( s0*sx[0] );
-
-						// Iterate over the ndarray dimensions...
-						for ( i4 = 0; i4 < s4; i4++ ) {
-							for ( i3 = 0; i3 < s3; i3++ ) {
-								for ( i2 = 0; i2 < s2; i2++ ) {
-									for ( i1 = 0; i1 < s1; i1++ ) {
-										for ( i0 = 0; i0 < s0; i0++ ) {
-											if ( xbuf[ ix ] ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome5d;
diff --git a/lib/5d_blocked_accessors.js b/lib/5d_blocked_accessors.js
deleted file mode 100644
index c4308d5..0000000
--- a/lib/5d_blocked_accessors.js
+++ /dev/null
@@ -1,224 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome5d( x, 4 );
-* // returns true
-*/
-function blockedsome5d( x, n ) {
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j4 = sh[4]; j4 > 0; ) {
-		if ( j4 < bsize ) {
-			s4 = j4;
-			j4 = 0;
-		} else {
-			s4 = bsize;
-			j4 -= bsize;
-		}
-		ox4 = ox + ( j4*sx[4] );
-		for ( j3 = sh[3]; j3 > 0; ) {
-			if ( j3 < bsize ) {
-				s3 = j3;
-				j3 = 0;
-			} else {
-				s3 = bsize;
-				j3 -= bsize;
-			}
-			dx4 = sx[4] - ( s3*sx[3] );
-			ox3 = ox4 + ( j3*sx[3] );
-			for ( j2 = sh[2]; j2 > 0; ) {
-				if ( j2 < bsize ) {
-					s2 = j2;
-					j2 = 0;
-				} else {
-					s2 = bsize;
-					j2 -= bsize;
-				}
-				dx3 = sx[3] - ( s2*sx[2] );
-				ox2 = ox3 + ( j2*sx[2] );
-				for ( j1 = sh[1]; j1 > 0; ) {
-					if ( j1 < bsize ) {
-						s1 = j1;
-						j1 = 0;
-					} else {
-						s1 = bsize;
-						j1 -= bsize;
-					}
-					dx2 = sx[2] - ( s1*sx[1] );
-					ox1 = ox2 + ( j1*sx[1] );
-					for ( j0 = sh[0]; j0 > 0; ) {
-						if ( j0 < bsize ) {
-							s0 = j0;
-							j0 = 0;
-						} else {
-							s0 = bsize;
-							j0 -= bsize;
-						}
-						// Compute the index offset for the first input ndarray element in the current block:
-						ix = ox1 + ( j0*sx[0] );
-
-						// Compute the loop offset increment:
-						dx1 = sx[1] - ( s0*sx[0] );
-
-						// Iterate over the ndarray dimensions...
-						for ( i4 = 0; i4 < s4; i4++ ) {
-							for ( i3 = 0; i3 < s3; i3++ ) {
-								for ( i2 = 0; i2 < s2; i2++ ) {
-									for ( i1 = 0; i1 < s1; i1++ ) {
-										for ( i0 = 0; i0 < s0; i0++ ) {
-											if ( get( xbuf, ix ) ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome5d;
diff --git a/lib/5d_blocked_complex.js b/lib/5d_blocked_complex.js
deleted file mode 100644
index 37a5a80..0000000
--- a/lib/5d_blocked_complex.js
+++ /dev/null
@@ -1,217 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome5d( x, 4 );
-* // returns true
-*/
-function blockedsome5d( x, n ) {
-	var bsize;
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j4 = sh[4]; j4 > 0; ) {
-		if ( j4 < bsize ) {
-			s4 = j4;
-			j4 = 0;
-		} else {
-			s4 = bsize;
-			j4 -= bsize;
-		}
-		ox4 = ox + ( j4*sx[4] );
-		for ( j3 = sh[3]; j3 > 0; ) {
-			if ( j3 < bsize ) {
-				s3 = j3;
-				j3 = 0;
-			} else {
-				s3 = bsize;
-				j3 -= bsize;
-			}
-			dx4 = sx[4] - ( s3*sx[3] );
-			ox3 = ox4 + ( j3*sx[3] );
-			for ( j2 = sh[2]; j2 > 0; ) {
-				if ( j2 < bsize ) {
-					s2 = j2;
-					j2 = 0;
-				} else {
-					s2 = bsize;
-					j2 -= bsize;
-				}
-				dx3 = sx[3] - ( s2*sx[2] );
-				ox2 = ox3 + ( j2*sx[2] );
-				for ( j1 = sh[1]; j1 > 0; ) {
-					if ( j1 < bsize ) {
-						s1 = j1;
-						j1 = 0;
-					} else {
-						s1 = bsize;
-						j1 -= bsize;
-					}
-					dx2 = sx[2] - ( s1*sx[1] );
-					ox1 = ox2 + ( j1*sx[1] );
-					for ( j0 = sh[0]; j0 > 0; ) {
-						if ( j0 < bsize ) {
-							s0 = j0;
-							j0 = 0;
-						} else {
-							s0 = bsize;
-							j0 -= bsize;
-						}
-						// Compute the index offset for the first input ndarray element in the current block:
-						ix = ox1 + ( j0*sx[0] );
-
-						// Compute the loop offset increment:
-						dx1 = sx[1] - ( s0*sx[0] );
-
-						// Iterate over the ndarray dimensions...
-						for ( i4 = 0; i4 < s4; i4++ ) {
-							for ( i3 = 0; i3 < s3; i3++ ) {
-								for ( i2 = 0; i2 < s2; i2++ ) {
-									for ( i1 = 0; i1 < s1; i1++ ) {
-										for ( i0 = 0; i0 < s0; i0++ ) {
-											if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-												count += 1;
-												if ( count >= n ) {
-													return true;
-												}
-											}
-											ix += dx0;
-										}
-										ix += dx1;
-									}
-									ix += dx2;
-								}
-								ix += dx3;
-							}
-							ix += dx4;
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome5d;
diff --git a/lib/5d_complex.js b/lib/5d_complex.js
deleted file mode 100644
index 95d4f4e..0000000
--- a/lib/5d_complex.js
+++ /dev/null
@@ -1,162 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some5d( x, 4 );
-* // returns true
-*/
-function some5d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 4 ];
-		S1 = sh[ 3 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 1 ];
-		S4 = sh[ 0 ];
-		dx0 = sx[ 4 ];                // offset increment for innermost loop
-		dx1 = sx[ 3 ] - ( S0*sx[4] );
-		dx2 = sx[ 2 ] - ( S1*sx[3] );
-		dx3 = sx[ 1 ] - ( S2*sx[2] );
-		dx4 = sx[ 0 ] - ( S3*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i4 = 0; i4 < S4; i4++ ) {
-		for ( i3 = 0; i3 < S3; i3++ ) {
-			for ( i2 = 0; i2 < S2; i2++ ) {
-				for ( i1 = 0; i1 < S1; i1++ ) {
-					for ( i0 = 0; i0 < S0; i0++ ) {
-						if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-							count += 1;
-							if ( count >= n ) {
-								return true;
-							}
-						}
-						ix += dx0;
-					}
-					ix += dx1;
-				}
-				ix += dx2;
-			}
-			ix += dx3;
-		}
-		ix += dx4;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some5d;
diff --git a/lib/6d.js b/lib/6d.js
deleted file mode 100644
index 57b2366..0000000
--- a/lib/6d.js
+++ /dev/null
@@ -1,172 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some6d( x, 4 );
-* // returns true
-*/
-function some6d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 5 ];
-		S1 = sh[ 4 ];
-		S2 = sh[ 3 ];
-		S3 = sh[ 2 ];
-		S4 = sh[ 1 ];
-		S5 = sh[ 0 ];
-		dx0 = sx[ 5 ];                // offset increment for innermost loop
-		dx1 = sx[ 4 ] - ( S0*sx[5] );
-		dx2 = sx[ 3 ] - ( S1*sx[4] );
-		dx3 = sx[ 2 ] - ( S2*sx[3] );
-		dx4 = sx[ 1 ] - ( S3*sx[2] );
-		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i5 = 0; i5 < S5; i5++ ) {
-		for ( i4 = 0; i4 < S4; i4++ ) {
-			for ( i3 = 0; i3 < S3; i3++ ) {
-				for ( i2 = 0; i2 < S2; i2++ ) {
-					for ( i1 = 0; i1 < S1; i1++ ) {
-						for ( i0 = 0; i0 < S0; i0++ ) {
-							if ( xbuf[ ix ] ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-				ix += dx3;
-			}
-			ix += dx4;
-		}
-		ix += dx5;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some6d;
diff --git a/lib/6d_accessors.js b/lib/6d_accessors.js
deleted file mode 100644
index 65db36e..0000000
--- a/lib/6d_accessors.js
+++ /dev/null
@@ -1,179 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some6d( x, 4 );
-* // returns true
-*/
-function some6d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 5 ];
-		S1 = sh[ 4 ];
-		S2 = sh[ 3 ];
-		S3 = sh[ 2 ];
-		S4 = sh[ 1 ];
-		S5 = sh[ 0 ];
-		dx0 = sx[ 5 ];                // offset increment for innermost loop
-		dx1 = sx[ 4 ] - ( S0*sx[5] );
-		dx2 = sx[ 3 ] - ( S1*sx[4] );
-		dx3 = sx[ 2 ] - ( S2*sx[3] );
-		dx4 = sx[ 1 ] - ( S3*sx[2] );
-		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i5 = 0; i5 < S5; i5++ ) {
-		for ( i4 = 0; i4 < S4; i4++ ) {
-			for ( i3 = 0; i3 < S3; i3++ ) {
-				for ( i2 = 0; i2 < S2; i2++ ) {
-					for ( i1 = 0; i1 < S1; i1++ ) {
-						for ( i0 = 0; i0 < S0; i0++ ) {
-							if ( get( xbuf, ix ) ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-				ix += dx3;
-			}
-			ix += dx4;
-		}
-		ix += dx5;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some6d;
diff --git a/lib/6d_blocked.js b/lib/6d_blocked.js
deleted file mode 100644
index 642c90d..0000000
--- a/lib/6d_blocked.js
+++ /dev/null
@@ -1,236 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome6d( x, 4 );
-* // returns true
-*/
-function blockedsome6d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j5 = sh[5]; j5 > 0; ) {
-		if ( j5 < bsize ) {
-			s5 = j5;
-			j5 = 0;
-		} else {
-			s5 = bsize;
-			j5 -= bsize;
-		}
-		ox5 = ox + ( j5*sx[5] );
-		for ( j4 = sh[4]; j4 > 0; ) {
-			if ( j4 < bsize ) {
-				s4 = j4;
-				j4 = 0;
-			} else {
-				s4 = bsize;
-				j4 -= bsize;
-			}
-			dx5 = sx[5] - ( s4*sx[4] );
-			ox4 = ox5 + ( j4*sx[4] );
-			for ( j3 = sh[3]; j3 > 0; ) {
-				if ( j3 < bsize ) {
-					s3 = j3;
-					j3 = 0;
-				} else {
-					s3 = bsize;
-					j3 -= bsize;
-				}
-				dx4 = sx[4] - ( s3*sx[3] );
-				ox3 = ox4 + ( j3*sx[3] );
-				for ( j2 = sh[2]; j2 > 0; ) {
-					if ( j2 < bsize ) {
-						s2 = j2;
-						j2 = 0;
-					} else {
-						s2 = bsize;
-						j2 -= bsize;
-					}
-					dx3 = sx[3] - ( s2*sx[2] );
-					ox2 = ox3 + ( j2*sx[2] );
-					for ( j1 = sh[1]; j1 > 0; ) {
-						if ( j1 < bsize ) {
-							s1 = j1;
-							j1 = 0;
-						} else {
-							s1 = bsize;
-							j1 -= bsize;
-						}
-						dx2 = sx[2] - ( s1*sx[1] );
-						ox1 = ox2 + ( j1*sx[1] );
-						for ( j0 = sh[0]; j0 > 0; ) {
-							if ( j0 < bsize ) {
-								s0 = j0;
-								j0 = 0;
-							} else {
-								s0 = bsize;
-								j0 -= bsize;
-							}
-							// Compute the index offset for the first input ndarray element in the current block:
-							ix = ox1 + ( j0*sx[0] );
-
-							// Compute the loop offset increment:
-							dx1 = sx[1] - ( s0*sx[0] );
-
-							// Iterate over the ndarray dimensions...
-							for ( i5 = 0; i5 < s5; i5++ ) {
-								for ( i4 = 0; i4 < s4; i4++ ) {
-									for ( i3 = 0; i3 < s3; i3++ ) {
-										for ( i2 = 0; i2 < s2; i2++ ) {
-											for ( i1 = 0; i1 < s1; i1++ ) {
-												for ( i0 = 0; i0 < s0; i0++ ) {
-													if ( xbuf[ ix ] ) {
-														count += 1;
-														if ( count >= n ) {
-															return true;
-														}
-													}
-													ix += dx0;
-												}
-												ix += dx1;
-											}
-											ix += dx2;
-										}
-										ix += dx3;
-									}
-									ix += dx4;
-								}
-								ix += dx5;
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome6d;
diff --git a/lib/6d_blocked_accessors.js b/lib/6d_blocked_accessors.js
deleted file mode 100644
index 47d6a8d..0000000
--- a/lib/6d_blocked_accessors.js
+++ /dev/null
@@ -1,243 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome6d( x, 4 );
-* // returns true
-*/
-function blockedsome6d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j5 = sh[5]; j5 > 0; ) {
-		if ( j5 < bsize ) {
-			s5 = j5;
-			j5 = 0;
-		} else {
-			s5 = bsize;
-			j5 -= bsize;
-		}
-		ox5 = ox + ( j5*sx[5] );
-		for ( j4 = sh[4]; j4 > 0; ) {
-			if ( j4 < bsize ) {
-				s4 = j4;
-				j4 = 0;
-			} else {
-				s4 = bsize;
-				j4 -= bsize;
-			}
-			dx5 = sx[5] - ( s4*sx[4] );
-			ox4 = ox5 + ( j4*sx[4] );
-			for ( j3 = sh[3]; j3 > 0; ) {
-				if ( j3 < bsize ) {
-					s3 = j3;
-					j3 = 0;
-				} else {
-					s3 = bsize;
-					j3 -= bsize;
-				}
-				dx4 = sx[4] - ( s3*sx[3] );
-				ox3 = ox4 + ( j3*sx[3] );
-				for ( j2 = sh[2]; j2 > 0; ) {
-					if ( j2 < bsize ) {
-						s2 = j2;
-						j2 = 0;
-					} else {
-						s2 = bsize;
-						j2 -= bsize;
-					}
-					dx3 = sx[3] - ( s2*sx[2] );
-					ox2 = ox3 + ( j2*sx[2] );
-					for ( j1 = sh[1]; j1 > 0; ) {
-						if ( j1 < bsize ) {
-							s1 = j1;
-							j1 = 0;
-						} else {
-							s1 = bsize;
-							j1 -= bsize;
-						}
-						dx2 = sx[2] - ( s1*sx[1] );
-						ox1 = ox2 + ( j1*sx[1] );
-						for ( j0 = sh[0]; j0 > 0; ) {
-							if ( j0 < bsize ) {
-								s0 = j0;
-								j0 = 0;
-							} else {
-								s0 = bsize;
-								j0 -= bsize;
-							}
-							// Compute the index offset for the first input ndarray element in the current block:
-							ix = ox1 + ( j0*sx[0] );
-
-							// Compute the loop offset increment:
-							dx1 = sx[1] - ( s0*sx[0] );
-
-							// Iterate over the ndarray dimensions...
-							for ( i5 = 0; i5 < s5; i5++ ) {
-								for ( i4 = 0; i4 < s4; i4++ ) {
-									for ( i3 = 0; i3 < s3; i3++ ) {
-										for ( i2 = 0; i2 < s2; i2++ ) {
-											for ( i1 = 0; i1 < s1; i1++ ) {
-												for ( i0 = 0; i0 < s0; i0++ ) {
-													if ( get( xbuf, ix ) ) {
-														count += 1;
-														if ( count >= n ) {
-															return true;
-														}
-													}
-													ix += dx0;
-												}
-												ix += dx1;
-											}
-											ix += dx2;
-										}
-										ix += dx3;
-									}
-									ix += dx4;
-								}
-								ix += dx5;
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome6d;
diff --git a/lib/6d_blocked_complex.js b/lib/6d_blocked_complex.js
deleted file mode 100644
index 593b0fe..0000000
--- a/lib/6d_blocked_complex.js
+++ /dev/null
@@ -1,236 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome6d( x, 4 );
-* // returns true
-*/
-function blockedsome6d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j5 = sh[5]; j5 > 0; ) {
-		if ( j5 < bsize ) {
-			s5 = j5;
-			j5 = 0;
-		} else {
-			s5 = bsize;
-			j5 -= bsize;
-		}
-		ox5 = ox + ( j5*sx[5] );
-		for ( j4 = sh[4]; j4 > 0; ) {
-			if ( j4 < bsize ) {
-				s4 = j4;
-				j4 = 0;
-			} else {
-				s4 = bsize;
-				j4 -= bsize;
-			}
-			dx5 = sx[5] - ( s4*sx[4] );
-			ox4 = ox5 + ( j4*sx[4] );
-			for ( j3 = sh[3]; j3 > 0; ) {
-				if ( j3 < bsize ) {
-					s3 = j3;
-					j3 = 0;
-				} else {
-					s3 = bsize;
-					j3 -= bsize;
-				}
-				dx4 = sx[4] - ( s3*sx[3] );
-				ox3 = ox4 + ( j3*sx[3] );
-				for ( j2 = sh[2]; j2 > 0; ) {
-					if ( j2 < bsize ) {
-						s2 = j2;
-						j2 = 0;
-					} else {
-						s2 = bsize;
-						j2 -= bsize;
-					}
-					dx3 = sx[3] - ( s2*sx[2] );
-					ox2 = ox3 + ( j2*sx[2] );
-					for ( j1 = sh[1]; j1 > 0; ) {
-						if ( j1 < bsize ) {
-							s1 = j1;
-							j1 = 0;
-						} else {
-							s1 = bsize;
-							j1 -= bsize;
-						}
-						dx2 = sx[2] - ( s1*sx[1] );
-						ox1 = ox2 + ( j1*sx[1] );
-						for ( j0 = sh[0]; j0 > 0; ) {
-							if ( j0 < bsize ) {
-								s0 = j0;
-								j0 = 0;
-							} else {
-								s0 = bsize;
-								j0 -= bsize;
-							}
-							// Compute the index offset for the first input ndarray element in the current block:
-							ix = ox1 + ( j0*sx[0] );
-
-							// Compute the loop offset increment:
-							dx1 = sx[1] - ( s0*sx[0] );
-
-							// Iterate over the ndarray dimensions...
-							for ( i5 = 0; i5 < s5; i5++ ) {
-								for ( i4 = 0; i4 < s4; i4++ ) {
-									for ( i3 = 0; i3 < s3; i3++ ) {
-										for ( i2 = 0; i2 < s2; i2++ ) {
-											for ( i1 = 0; i1 < s1; i1++ ) {
-												for ( i0 = 0; i0 < s0; i0++ ) {
-													if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-														count += 1;
-														if ( count >= n ) {
-															return true;
-														}
-													}
-													ix += dx0;
-												}
-												ix += dx1;
-											}
-											ix += dx2;
-										}
-										ix += dx3;
-									}
-									ix += dx4;
-								}
-								ix += dx5;
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome6d;
diff --git a/lib/6d_complex.js b/lib/6d_complex.js
deleted file mode 100644
index 6af5866..0000000
--- a/lib/6d_complex.js
+++ /dev/null
@@ -1,172 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some6d( x, 4 );
-* // returns true
-*/
-function some6d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 5 ];
-		S1 = sh[ 4 ];
-		S2 = sh[ 3 ];
-		S3 = sh[ 2 ];
-		S4 = sh[ 1 ];
-		S5 = sh[ 0 ];
-		dx0 = sx[ 5 ];                // offset increment for innermost loop
-		dx1 = sx[ 4 ] - ( S0*sx[5] );
-		dx2 = sx[ 3 ] - ( S1*sx[4] );
-		dx3 = sx[ 2 ] - ( S2*sx[3] );
-		dx4 = sx[ 1 ] - ( S3*sx[2] );
-		dx5 = sx[ 0 ] - ( S4*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i5 = 0; i5 < S5; i5++ ) {
-		for ( i4 = 0; i4 < S4; i4++ ) {
-			for ( i3 = 0; i3 < S3; i3++ ) {
-				for ( i2 = 0; i2 < S2; i2++ ) {
-					for ( i1 = 0; i1 < S1; i1++ ) {
-						for ( i0 = 0; i0 < S0; i0++ ) {
-							if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-								count += 1;
-								if ( count >= n ) {
-									return true;
-								}
-							}
-							ix += dx0;
-						}
-						ix += dx1;
-					}
-					ix += dx2;
-				}
-				ix += dx3;
-			}
-			ix += dx4;
-		}
-		ix += dx5;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some6d;
diff --git a/lib/7d.js b/lib/7d.js
deleted file mode 100644
index d0babe6..0000000
--- a/lib/7d.js
+++ /dev/null
@@ -1,182 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some7d( x, 4 );
-* // returns true
-*/
-function some7d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 6 ];
-		S1 = sh[ 5 ];
-		S2 = sh[ 4 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 2 ];
-		S5 = sh[ 1 ];
-		S6 = sh[ 0 ];
-		dx0 = sx[ 6 ];                // offset increment for innermost loop
-		dx1 = sx[ 5 ] - ( S0*sx[6] );
-		dx2 = sx[ 4 ] - ( S1*sx[5] );
-		dx3 = sx[ 3 ] - ( S2*sx[4] );
-		dx4 = sx[ 2 ] - ( S3*sx[3] );
-		dx5 = sx[ 1 ] - ( S4*sx[2] );
-		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i6 = 0; i6 < S6; i6++ ) {
-		for ( i5 = 0; i5 < S5; i5++ ) {
-			for ( i4 = 0; i4 < S4; i4++ ) {
-				for ( i3 = 0; i3 < S3; i3++ ) {
-					for ( i2 = 0; i2 < S2; i2++ ) {
-						for ( i1 = 0; i1 < S1; i1++ ) {
-							for ( i0 = 0; i0 < S0; i0++ ) {
-								if ( xbuf[ ix ] ) {
-									count += 1;
-									if ( count >= n ) {
-										return true;
-									}
-								}
-								ix += dx0;
-							}
-							ix += dx1;
-						}
-						ix += dx2;
-					}
-					ix += dx3;
-				}
-				ix += dx4;
-			}
-			ix += dx5;
-		}
-		ix += dx6;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some7d;
diff --git a/lib/7d_accessors.js b/lib/7d_accessors.js
deleted file mode 100644
index 04621a4..0000000
--- a/lib/7d_accessors.js
+++ /dev/null
@@ -1,189 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some7d( x, 4 );
-* // returns true
-*/
-function some7d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 6 ];
-		S1 = sh[ 5 ];
-		S2 = sh[ 4 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 2 ];
-		S5 = sh[ 1 ];
-		S6 = sh[ 0 ];
-		dx0 = sx[ 6 ];                // offset increment for innermost loop
-		dx1 = sx[ 5 ] - ( S0*sx[6] );
-		dx2 = sx[ 4 ] - ( S1*sx[5] );
-		dx3 = sx[ 3 ] - ( S2*sx[4] );
-		dx4 = sx[ 2 ] - ( S3*sx[3] );
-		dx5 = sx[ 1 ] - ( S4*sx[2] );
-		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i6 = 0; i6 < S6; i6++ ) {
-		for ( i5 = 0; i5 < S5; i5++ ) {
-			for ( i4 = 0; i4 < S4; i4++ ) {
-				for ( i3 = 0; i3 < S3; i3++ ) {
-					for ( i2 = 0; i2 < S2; i2++ ) {
-						for ( i1 = 0; i1 < S1; i1++ ) {
-							for ( i0 = 0; i0 < S0; i0++ ) {
-								if ( get( xbuf, ix ) ) {
-									count += 1;
-									if ( count >= n ) {
-										return true;
-									}
-								}
-								ix += dx0;
-							}
-							ix += dx1;
-						}
-						ix += dx2;
-					}
-					ix += dx3;
-				}
-				ix += dx4;
-			}
-			ix += dx5;
-		}
-		ix += dx6;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some7d;
diff --git a/lib/7d_blocked.js b/lib/7d_blocked.js
deleted file mode 100644
index 185c3a0..0000000
--- a/lib/7d_blocked.js
+++ /dev/null
@@ -1,255 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome7d( x, 4 );
-* // returns true
-*/
-function blockedsome7d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j6 = sh[6]; j6 > 0; ) {
-		if ( j6 < bsize ) {
-			s6 = j6;
-			j6 = 0;
-		} else {
-			s6 = bsize;
-			j6 -= bsize;
-		}
-		ox6 = ox + ( j6*sx[6] );
-		for ( j5 = sh[5]; j5 > 0; ) {
-			if ( j5 < bsize ) {
-				s5 = j5;
-				j5 = 0;
-			} else {
-				s5 = bsize;
-				j5 -= bsize;
-			}
-			dx6 = sx[6] - ( s5*sx[5] );
-			ox5 = ox6 + ( j5*sx[5] );
-			for ( j4 = sh[4]; j4 > 0; ) {
-				if ( j4 < bsize ) {
-					s4 = j4;
-					j4 = 0;
-				} else {
-					s4 = bsize;
-					j4 -= bsize;
-				}
-				dx5 = sx[5] - ( s4*sx[4] );
-				ox4 = ox5 + ( j4*sx[4] );
-				for ( j3 = sh[3]; j3 > 0; ) {
-					if ( j3 < bsize ) {
-						s3 = j3;
-						j3 = 0;
-					} else {
-						s3 = bsize;
-						j3 -= bsize;
-					}
-					dx4 = sx[4] - ( s3*sx[3] );
-					ox3 = ox4 + ( j3*sx[3] );
-					for ( j2 = sh[2]; j2 > 0; ) {
-						if ( j2 < bsize ) {
-							s2 = j2;
-							j2 = 0;
-						} else {
-							s2 = bsize;
-							j2 -= bsize;
-						}
-						dx3 = sx[3] - ( s2*sx[2] );
-						ox2 = ox3 + ( j2*sx[2] );
-						for ( j1 = sh[1]; j1 > 0; ) {
-							if ( j1 < bsize ) {
-								s1 = j1;
-								j1 = 0;
-							} else {
-								s1 = bsize;
-								j1 -= bsize;
-							}
-							dx2 = sx[2] - ( s1*sx[1] );
-							ox1 = ox2 + ( j1*sx[1] );
-							for ( j0 = sh[0]; j0 > 0; ) {
-								if ( j0 < bsize ) {
-									s0 = j0;
-									j0 = 0;
-								} else {
-									s0 = bsize;
-									j0 -= bsize;
-								}
-								// Compute the index offset for the first input ndarray element in the current block:
-								ix = ox1 + ( j0*sx[0] );
-
-								// Compute the loop offset increment:
-								dx1 = sx[1] - ( s0*sx[0] );
-
-								// Iterate over the ndarray dimensions...
-								for ( i6 = 0; i6 < s6; i6++ ) {
-									for ( i5 = 0; i5 < s5; i5++ ) {
-										for ( i4 = 0; i4 < s4; i4++ ) {
-											for ( i3 = 0; i3 < s3; i3++ ) {
-												for ( i2 = 0; i2 < s2; i2++ ) {
-													for ( i1 = 0; i1 < s1; i1++ ) {
-														for ( i0 = 0; i0 < s0; i0++ ) {
-															if ( xbuf[ ix ] ) {
-																count += 1;
-																if ( count >= n ) {
-																	return true;
-																}
-															}
-															ix += dx0;
-														}
-														ix += dx1;
-													}
-													ix += dx2;
-												}
-												ix += dx3;
-											}
-											ix += dx4;
-										}
-										ix += dx5;
-									}
-									ix += dx6;
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome7d;
diff --git a/lib/7d_blocked_accessors.js b/lib/7d_blocked_accessors.js
deleted file mode 100644
index 0fe98a1..0000000
--- a/lib/7d_blocked_accessors.js
+++ /dev/null
@@ -1,262 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome7d( x, 4 );
-* // returns true
-*/
-function blockedsome7d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j6 = sh[6]; j6 > 0; ) {
-		if ( j6 < bsize ) {
-			s6 = j6;
-			j6 = 0;
-		} else {
-			s6 = bsize;
-			j6 -= bsize;
-		}
-		ox6 = ox + ( j6*sx[6] );
-		for ( j5 = sh[5]; j5 > 0; ) {
-			if ( j5 < bsize ) {
-				s5 = j5;
-				j5 = 0;
-			} else {
-				s5 = bsize;
-				j5 -= bsize;
-			}
-			dx6 = sx[6] - ( s5*sx[5] );
-			ox5 = ox6 + ( j5*sx[5] );
-			for ( j4 = sh[4]; j4 > 0; ) {
-				if ( j4 < bsize ) {
-					s4 = j4;
-					j4 = 0;
-				} else {
-					s4 = bsize;
-					j4 -= bsize;
-				}
-				dx5 = sx[5] - ( s4*sx[4] );
-				ox4 = ox5 + ( j4*sx[4] );
-				for ( j3 = sh[3]; j3 > 0; ) {
-					if ( j3 < bsize ) {
-						s3 = j3;
-						j3 = 0;
-					} else {
-						s3 = bsize;
-						j3 -= bsize;
-					}
-					dx4 = sx[4] - ( s3*sx[3] );
-					ox3 = ox4 + ( j3*sx[3] );
-					for ( j2 = sh[2]; j2 > 0; ) {
-						if ( j2 < bsize ) {
-							s2 = j2;
-							j2 = 0;
-						} else {
-							s2 = bsize;
-							j2 -= bsize;
-						}
-						dx3 = sx[3] - ( s2*sx[2] );
-						ox2 = ox3 + ( j2*sx[2] );
-						for ( j1 = sh[1]; j1 > 0; ) {
-							if ( j1 < bsize ) {
-								s1 = j1;
-								j1 = 0;
-							} else {
-								s1 = bsize;
-								j1 -= bsize;
-							}
-							dx2 = sx[2] - ( s1*sx[1] );
-							ox1 = ox2 + ( j1*sx[1] );
-							for ( j0 = sh[0]; j0 > 0; ) {
-								if ( j0 < bsize ) {
-									s0 = j0;
-									j0 = 0;
-								} else {
-									s0 = bsize;
-									j0 -= bsize;
-								}
-								// Compute the index offset for the first input ndarray element in the current block:
-								ix = ox1 + ( j0*sx[0] );
-
-								// Compute the loop offset increment:
-								dx1 = sx[1] - ( s0*sx[0] );
-
-								// Iterate over the ndarray dimensions...
-								for ( i6 = 0; i6 < s6; i6++ ) {
-									for ( i5 = 0; i5 < s5; i5++ ) {
-										for ( i4 = 0; i4 < s4; i4++ ) {
-											for ( i3 = 0; i3 < s3; i3++ ) {
-												for ( i2 = 0; i2 < s2; i2++ ) {
-													for ( i1 = 0; i1 < s1; i1++ ) {
-														for ( i0 = 0; i0 < s0; i0++ ) {
-															if ( get( xbuf, ix ) ) {
-																count += 1;
-																if ( count >= n ) {
-																	return true;
-																}
-															}
-															ix += dx0;
-														}
-														ix += dx1;
-													}
-													ix += dx2;
-												}
-												ix += dx3;
-											}
-											ix += dx4;
-										}
-										ix += dx5;
-									}
-									ix += dx6;
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome7d;
diff --git a/lib/7d_blocked_complex.js b/lib/7d_blocked_complex.js
deleted file mode 100644
index 3f49bf9..0000000
--- a/lib/7d_blocked_complex.js
+++ /dev/null
@@ -1,255 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome7d( x, 4 );
-* // returns true
-*/
-function blockedsome7d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j6 = sh[6]; j6 > 0; ) {
-		if ( j6 < bsize ) {
-			s6 = j6;
-			j6 = 0;
-		} else {
-			s6 = bsize;
-			j6 -= bsize;
-		}
-		ox6 = ox + ( j6*sx[6] );
-		for ( j5 = sh[5]; j5 > 0; ) {
-			if ( j5 < bsize ) {
-				s5 = j5;
-				j5 = 0;
-			} else {
-				s5 = bsize;
-				j5 -= bsize;
-			}
-			dx6 = sx[6] - ( s5*sx[5] );
-			ox5 = ox6 + ( j5*sx[5] );
-			for ( j4 = sh[4]; j4 > 0; ) {
-				if ( j4 < bsize ) {
-					s4 = j4;
-					j4 = 0;
-				} else {
-					s4 = bsize;
-					j4 -= bsize;
-				}
-				dx5 = sx[5] - ( s4*sx[4] );
-				ox4 = ox5 + ( j4*sx[4] );
-				for ( j3 = sh[3]; j3 > 0; ) {
-					if ( j3 < bsize ) {
-						s3 = j3;
-						j3 = 0;
-					} else {
-						s3 = bsize;
-						j3 -= bsize;
-					}
-					dx4 = sx[4] - ( s3*sx[3] );
-					ox3 = ox4 + ( j3*sx[3] );
-					for ( j2 = sh[2]; j2 > 0; ) {
-						if ( j2 < bsize ) {
-							s2 = j2;
-							j2 = 0;
-						} else {
-							s2 = bsize;
-							j2 -= bsize;
-						}
-						dx3 = sx[3] - ( s2*sx[2] );
-						ox2 = ox3 + ( j2*sx[2] );
-						for ( j1 = sh[1]; j1 > 0; ) {
-							if ( j1 < bsize ) {
-								s1 = j1;
-								j1 = 0;
-							} else {
-								s1 = bsize;
-								j1 -= bsize;
-							}
-							dx2 = sx[2] - ( s1*sx[1] );
-							ox1 = ox2 + ( j1*sx[1] );
-							for ( j0 = sh[0]; j0 > 0; ) {
-								if ( j0 < bsize ) {
-									s0 = j0;
-									j0 = 0;
-								} else {
-									s0 = bsize;
-									j0 -= bsize;
-								}
-								// Compute the index offset for the first input ndarray element in the current block:
-								ix = ox1 + ( j0*sx[0] );
-
-								// Compute the loop offset increment:
-								dx1 = sx[1] - ( s0*sx[0] );
-
-								// Iterate over the ndarray dimensions...
-								for ( i6 = 0; i6 < s6; i6++ ) {
-									for ( i5 = 0; i5 < s5; i5++ ) {
-										for ( i4 = 0; i4 < s4; i4++ ) {
-											for ( i3 = 0; i3 < s3; i3++ ) {
-												for ( i2 = 0; i2 < s2; i2++ ) {
-													for ( i1 = 0; i1 < s1; i1++ ) {
-														for ( i0 = 0; i0 < s0; i0++ ) {
-															if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-																count += 1;
-																if ( count >= n ) {
-																	return true;
-																}
-															}
-															ix += dx0;
-														}
-														ix += dx1;
-													}
-													ix += dx2;
-												}
-												ix += dx3;
-											}
-											ix += dx4;
-										}
-										ix += dx5;
-									}
-									ix += dx6;
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome7d;
diff --git a/lib/7d_complex.js b/lib/7d_complex.js
deleted file mode 100644
index efd2a79..0000000
--- a/lib/7d_complex.js
+++ /dev/null
@@ -1,182 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some7d( x, 4 );
-* // returns true
-*/
-function some7d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 6 ];
-		S1 = sh[ 5 ];
-		S2 = sh[ 4 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 2 ];
-		S5 = sh[ 1 ];
-		S6 = sh[ 0 ];
-		dx0 = sx[ 6 ];                // offset increment for innermost loop
-		dx1 = sx[ 5 ] - ( S0*sx[6] );
-		dx2 = sx[ 4 ] - ( S1*sx[5] );
-		dx3 = sx[ 3 ] - ( S2*sx[4] );
-		dx4 = sx[ 2 ] - ( S3*sx[3] );
-		dx5 = sx[ 1 ] - ( S4*sx[2] );
-		dx6 = sx[ 0 ] - ( S5*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i6 = 0; i6 < S6; i6++ ) {
-		for ( i5 = 0; i5 < S5; i5++ ) {
-			for ( i4 = 0; i4 < S4; i4++ ) {
-				for ( i3 = 0; i3 < S3; i3++ ) {
-					for ( i2 = 0; i2 < S2; i2++ ) {
-						for ( i1 = 0; i1 < S1; i1++ ) {
-							for ( i0 = 0; i0 < S0; i0++ ) {
-								if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-									count += 1;
-									if ( count >= n ) {
-										return true;
-									}
-								}
-								ix += dx0;
-							}
-							ix += dx1;
-						}
-						ix += dx2;
-					}
-					ix += dx3;
-				}
-				ix += dx4;
-			}
-			ix += dx5;
-		}
-		ix += dx6;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some7d;
diff --git a/lib/8d.js b/lib/8d.js
deleted file mode 100644
index 8fe9236..0000000
--- a/lib/8d.js
+++ /dev/null
@@ -1,192 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some8d( x, 4 );
-* // returns true
-*/
-function some8d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 7 ];
-		S1 = sh[ 6 ];
-		S2 = sh[ 5 ];
-		S3 = sh[ 4 ];
-		S4 = sh[ 3 ];
-		S5 = sh[ 2 ];
-		S6 = sh[ 1 ];
-		S7 = sh[ 0 ];
-		dx0 = sx[ 7 ];                // offset increment for innermost loop
-		dx1 = sx[ 6 ] - ( S0*sx[7] );
-		dx2 = sx[ 5 ] - ( S1*sx[6] );
-		dx3 = sx[ 4 ] - ( S2*sx[5] );
-		dx4 = sx[ 3 ] - ( S3*sx[4] );
-		dx5 = sx[ 2 ] - ( S4*sx[3] );
-		dx6 = sx[ 1 ] - ( S5*sx[2] );
-		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i7 = 0; i7 < S7; i7++ ) {
-		for ( i6 = 0; i6 < S6; i6++ ) {
-			for ( i5 = 0; i5 < S5; i5++ ) {
-				for ( i4 = 0; i4 < S4; i4++ ) {
-					for ( i3 = 0; i3 < S3; i3++ ) {
-						for ( i2 = 0; i2 < S2; i2++ ) {
-							for ( i1 = 0; i1 < S1; i1++ ) {
-								for ( i0 = 0; i0 < S0; i0++ ) {
-									if ( xbuf[ ix ] ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-					ix += dx4;
-				}
-				ix += dx5;
-			}
-			ix += dx6;
-		}
-		ix += dx7;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some8d;
diff --git a/lib/8d_accessors.js b/lib/8d_accessors.js
deleted file mode 100644
index 10d0033..0000000
--- a/lib/8d_accessors.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.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some8d( x, 4 );
-* // returns true
-*/
-function some8d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 7 ];
-		S1 = sh[ 6 ];
-		S2 = sh[ 5 ];
-		S3 = sh[ 4 ];
-		S4 = sh[ 3 ];
-		S5 = sh[ 2 ];
-		S6 = sh[ 1 ];
-		S7 = sh[ 0 ];
-		dx0 = sx[ 7 ];                // offset increment for innermost loop
-		dx1 = sx[ 6 ] - ( S0*sx[7] );
-		dx2 = sx[ 5 ] - ( S1*sx[6] );
-		dx3 = sx[ 4 ] - ( S2*sx[5] );
-		dx4 = sx[ 3 ] - ( S3*sx[4] );
-		dx5 = sx[ 2 ] - ( S4*sx[3] );
-		dx6 = sx[ 1 ] - ( S5*sx[2] );
-		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i7 = 0; i7 < S7; i7++ ) {
-		for ( i6 = 0; i6 < S6; i6++ ) {
-			for ( i5 = 0; i5 < S5; i5++ ) {
-				for ( i4 = 0; i4 < S4; i4++ ) {
-					for ( i3 = 0; i3 < S3; i3++ ) {
-						for ( i2 = 0; i2 < S2; i2++ ) {
-							for ( i1 = 0; i1 < S1; i1++ ) {
-								for ( i0 = 0; i0 < S0; i0++ ) {
-									if ( get( xbuf, ix ) ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-					ix += dx4;
-				}
-				ix += dx5;
-			}
-			ix += dx6;
-		}
-		ix += dx7;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some8d;
diff --git a/lib/8d_blocked.js b/lib/8d_blocked.js
deleted file mode 100644
index 25e9cf1..0000000
--- a/lib/8d_blocked.js
+++ /dev/null
@@ -1,274 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome8d( x, 4 );
-* // returns true
-*/
-function blockedsome8d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j7 = sh[7]; j7 > 0; ) {
-		if ( j7 < bsize ) {
-			s7 = j7;
-			j7 = 0;
-		} else {
-			s7 = bsize;
-			j7 -= bsize;
-		}
-		ox7 = ox + ( j7*sx[7] );
-		for ( j6 = sh[6]; j6 > 0; ) {
-			if ( j6 < bsize ) {
-				s6 = j6;
-				j6 = 0;
-			} else {
-				s6 = bsize;
-				j6 -= bsize;
-			}
-			dx7 = sx[7] - ( s6*sx[6] );
-			ox6 = ox7 + ( j6*sx[6] );
-			for ( j5 = sh[5]; j5 > 0; ) {
-				if ( j5 < bsize ) {
-					s5 = j5;
-					j5 = 0;
-				} else {
-					s5 = bsize;
-					j5 -= bsize;
-				}
-				dx6 = sx[6] - ( s5*sx[5] );
-				ox5 = ox6 + ( j5*sx[5] );
-				for ( j4 = sh[4]; j4 > 0; ) {
-					if ( j4 < bsize ) {
-						s4 = j4;
-						j4 = 0;
-					} else {
-						s4 = bsize;
-						j4 -= bsize;
-					}
-					dx5 = sx[5] - ( s4*sx[4] );
-					ox4 = ox5 + ( j4*sx[4] );
-					for ( j3 = sh[3]; j3 > 0; ) {
-						if ( j3 < bsize ) {
-							s3 = j3;
-							j3 = 0;
-						} else {
-							s3 = bsize;
-							j3 -= bsize;
-						}
-						dx4 = sx[4] - ( s3*sx[3] );
-						ox3 = ox4 + ( j3*sx[3] );
-						for ( j2 = sh[2]; j2 > 0; ) {
-							if ( j2 < bsize ) {
-								s2 = j2;
-								j2 = 0;
-							} else {
-								s2 = bsize;
-								j2 -= bsize;
-							}
-							dx3 = sx[3] - ( s2*sx[2] );
-							ox2 = ox3 + ( j2*sx[2] );
-							for ( j1 = sh[1]; j1 > 0; ) {
-								if ( j1 < bsize ) {
-									s1 = j1;
-									j1 = 0;
-								} else {
-									s1 = bsize;
-									j1 -= bsize;
-								}
-								dx2 = sx[2] - ( s1*sx[1] );
-								ox1 = ox2 + ( j1*sx[1] );
-								for ( j0 = sh[0]; j0 > 0; ) {
-									if ( j0 < bsize ) {
-										s0 = j0;
-										j0 = 0;
-									} else {
-										s0 = bsize;
-										j0 -= bsize;
-									}
-									// Compute the index offset for the first input ndarray element in the current block:
-									ix = ox1 + ( j0*sx[0] );
-
-									// Compute the loop offset increment:
-									dx1 = sx[1] - ( s0*sx[0] );
-
-									// Iterate over the ndarray dimensions...
-									for ( i7 = 0; i7 < s7; i7++ ) {
-										for ( i6 = 0; i6 < s6; i6++ ) {
-											for ( i5 = 0; i5 < s5; i5++ ) {
-												for ( i4 = 0; i4 < s4; i4++ ) {
-													for ( i3 = 0; i3 < s3; i3++ ) {
-														for ( i2 = 0; i2 < s2; i2++ ) {
-															for ( i1 = 0; i1 < s1; i1++ ) {
-																for ( i0 = 0; i0 < s0; i0++ ) {
-																	if ( xbuf[ ix ] ) {
-																		count += 1;
-																		if ( count >= n ) {
-																			return true;
-																		}
-																	}
-																	ix += dx0;
-																}
-																ix += dx1;
-															}
-															ix += dx2;
-														}
-														ix += dx3;
-													}
-													ix += dx4;
-												}
-												ix += dx5;
-											}
-											ix += dx6;
-										}
-										ix += dx7;
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome8d;
diff --git a/lib/8d_blocked_accessors.js b/lib/8d_blocked_accessors.js
deleted file mode 100644
index f38a910..0000000
--- a/lib/8d_blocked_accessors.js
+++ /dev/null
@@ -1,281 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome8d( x, 4 );
-* // returns true
-*/
-function blockedsome8d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j7 = sh[7]; j7 > 0; ) {
-		if ( j7 < bsize ) {
-			s7 = j7;
-			j7 = 0;
-		} else {
-			s7 = bsize;
-			j7 -= bsize;
-		}
-		ox7 = ox + ( j7*sx[7] );
-		for ( j6 = sh[6]; j6 > 0; ) {
-			if ( j6 < bsize ) {
-				s6 = j6;
-				j6 = 0;
-			} else {
-				s6 = bsize;
-				j6 -= bsize;
-			}
-			dx7 = sx[7] - ( s6*sx[6] );
-			ox6 = ox7 + ( j6*sx[6] );
-			for ( j5 = sh[5]; j5 > 0; ) {
-				if ( j5 < bsize ) {
-					s5 = j5;
-					j5 = 0;
-				} else {
-					s5 = bsize;
-					j5 -= bsize;
-				}
-				dx6 = sx[6] - ( s5*sx[5] );
-				ox5 = ox6 + ( j5*sx[5] );
-				for ( j4 = sh[4]; j4 > 0; ) {
-					if ( j4 < bsize ) {
-						s4 = j4;
-						j4 = 0;
-					} else {
-						s4 = bsize;
-						j4 -= bsize;
-					}
-					dx5 = sx[5] - ( s4*sx[4] );
-					ox4 = ox5 + ( j4*sx[4] );
-					for ( j3 = sh[3]; j3 > 0; ) {
-						if ( j3 < bsize ) {
-							s3 = j3;
-							j3 = 0;
-						} else {
-							s3 = bsize;
-							j3 -= bsize;
-						}
-						dx4 = sx[4] - ( s3*sx[3] );
-						ox3 = ox4 + ( j3*sx[3] );
-						for ( j2 = sh[2]; j2 > 0; ) {
-							if ( j2 < bsize ) {
-								s2 = j2;
-								j2 = 0;
-							} else {
-								s2 = bsize;
-								j2 -= bsize;
-							}
-							dx3 = sx[3] - ( s2*sx[2] );
-							ox2 = ox3 + ( j2*sx[2] );
-							for ( j1 = sh[1]; j1 > 0; ) {
-								if ( j1 < bsize ) {
-									s1 = j1;
-									j1 = 0;
-								} else {
-									s1 = bsize;
-									j1 -= bsize;
-								}
-								dx2 = sx[2] - ( s1*sx[1] );
-								ox1 = ox2 + ( j1*sx[1] );
-								for ( j0 = sh[0]; j0 > 0; ) {
-									if ( j0 < bsize ) {
-										s0 = j0;
-										j0 = 0;
-									} else {
-										s0 = bsize;
-										j0 -= bsize;
-									}
-									// Compute the index offset for the first input ndarray element in the current block:
-									ix = ox1 + ( j0*sx[0] );
-
-									// Compute the loop offset increment:
-									dx1 = sx[1] - ( s0*sx[0] );
-
-									// Iterate over the ndarray dimensions...
-									for ( i7 = 0; i7 < s7; i7++ ) {
-										for ( i6 = 0; i6 < s6; i6++ ) {
-											for ( i5 = 0; i5 < s5; i5++ ) {
-												for ( i4 = 0; i4 < s4; i4++ ) {
-													for ( i3 = 0; i3 < s3; i3++ ) {
-														for ( i2 = 0; i2 < s2; i2++ ) {
-															for ( i1 = 0; i1 < s1; i1++ ) {
-																for ( i0 = 0; i0 < s0; i0++ ) {
-																	if ( get( xbuf, ix ) ) {
-																		count += 1;
-																		if ( count >= n ) {
-																			return true;
-																		}
-																	}
-																	ix += dx0;
-																}
-																ix += dx1;
-															}
-															ix += dx2;
-														}
-														ix += dx3;
-													}
-													ix += dx4;
-												}
-												ix += dx5;
-											}
-											ix += dx6;
-										}
-										ix += dx7;
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome8d;
diff --git a/lib/8d_blocked_complex.js b/lib/8d_blocked_complex.js
deleted file mode 100644
index 3311039..0000000
--- a/lib/8d_blocked_complex.js
+++ /dev/null
@@ -1,274 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome8d( x, 4 );
-* // returns true
-*/
-function blockedsome8d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j7 = sh[7]; j7 > 0; ) {
-		if ( j7 < bsize ) {
-			s7 = j7;
-			j7 = 0;
-		} else {
-			s7 = bsize;
-			j7 -= bsize;
-		}
-		ox7 = ox + ( j7*sx[7] );
-		for ( j6 = sh[6]; j6 > 0; ) {
-			if ( j6 < bsize ) {
-				s6 = j6;
-				j6 = 0;
-			} else {
-				s6 = bsize;
-				j6 -= bsize;
-			}
-			dx7 = sx[7] - ( s6*sx[6] );
-			ox6 = ox7 + ( j6*sx[6] );
-			for ( j5 = sh[5]; j5 > 0; ) {
-				if ( j5 < bsize ) {
-					s5 = j5;
-					j5 = 0;
-				} else {
-					s5 = bsize;
-					j5 -= bsize;
-				}
-				dx6 = sx[6] - ( s5*sx[5] );
-				ox5 = ox6 + ( j5*sx[5] );
-				for ( j4 = sh[4]; j4 > 0; ) {
-					if ( j4 < bsize ) {
-						s4 = j4;
-						j4 = 0;
-					} else {
-						s4 = bsize;
-						j4 -= bsize;
-					}
-					dx5 = sx[5] - ( s4*sx[4] );
-					ox4 = ox5 + ( j4*sx[4] );
-					for ( j3 = sh[3]; j3 > 0; ) {
-						if ( j3 < bsize ) {
-							s3 = j3;
-							j3 = 0;
-						} else {
-							s3 = bsize;
-							j3 -= bsize;
-						}
-						dx4 = sx[4] - ( s3*sx[3] );
-						ox3 = ox4 + ( j3*sx[3] );
-						for ( j2 = sh[2]; j2 > 0; ) {
-							if ( j2 < bsize ) {
-								s2 = j2;
-								j2 = 0;
-							} else {
-								s2 = bsize;
-								j2 -= bsize;
-							}
-							dx3 = sx[3] - ( s2*sx[2] );
-							ox2 = ox3 + ( j2*sx[2] );
-							for ( j1 = sh[1]; j1 > 0; ) {
-								if ( j1 < bsize ) {
-									s1 = j1;
-									j1 = 0;
-								} else {
-									s1 = bsize;
-									j1 -= bsize;
-								}
-								dx2 = sx[2] - ( s1*sx[1] );
-								ox1 = ox2 + ( j1*sx[1] );
-								for ( j0 = sh[0]; j0 > 0; ) {
-									if ( j0 < bsize ) {
-										s0 = j0;
-										j0 = 0;
-									} else {
-										s0 = bsize;
-										j0 -= bsize;
-									}
-									// Compute the index offset for the first input ndarray element in the current block:
-									ix = ox1 + ( j0*sx[0] );
-
-									// Compute the loop offset increment:
-									dx1 = sx[1] - ( s0*sx[0] );
-
-									// Iterate over the ndarray dimensions...
-									for ( i7 = 0; i7 < s7; i7++ ) {
-										for ( i6 = 0; i6 < s6; i6++ ) {
-											for ( i5 = 0; i5 < s5; i5++ ) {
-												for ( i4 = 0; i4 < s4; i4++ ) {
-													for ( i3 = 0; i3 < s3; i3++ ) {
-														for ( i2 = 0; i2 < s2; i2++ ) {
-															for ( i1 = 0; i1 < s1; i1++ ) {
-																for ( i0 = 0; i0 < s0; i0++ ) {
-																	if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-																		count += 1;
-																		if ( count >= n ) {
-																			return true;
-																		}
-																	}
-																	ix += dx0;
-																}
-																ix += dx1;
-															}
-															ix += dx2;
-														}
-														ix += dx3;
-													}
-													ix += dx4;
-												}
-												ix += dx5;
-											}
-											ix += dx6;
-										}
-										ix += dx7;
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome8d;
diff --git a/lib/8d_complex.js b/lib/8d_complex.js
deleted file mode 100644
index b736593..0000000
--- a/lib/8d_complex.js
+++ /dev/null
@@ -1,192 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some8d( x, 4 );
-* // returns true
-*/
-function some8d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 7 ];
-		S1 = sh[ 6 ];
-		S2 = sh[ 5 ];
-		S3 = sh[ 4 ];
-		S4 = sh[ 3 ];
-		S5 = sh[ 2 ];
-		S6 = sh[ 1 ];
-		S7 = sh[ 0 ];
-		dx0 = sx[ 7 ];                // offset increment for innermost loop
-		dx1 = sx[ 6 ] - ( S0*sx[7] );
-		dx2 = sx[ 5 ] - ( S1*sx[6] );
-		dx3 = sx[ 4 ] - ( S2*sx[5] );
-		dx4 = sx[ 3 ] - ( S3*sx[4] );
-		dx5 = sx[ 2 ] - ( S4*sx[3] );
-		dx6 = sx[ 1 ] - ( S5*sx[2] );
-		dx7 = sx[ 0 ] - ( S6*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i7 = 0; i7 < S7; i7++ ) {
-		for ( i6 = 0; i6 < S6; i6++ ) {
-			for ( i5 = 0; i5 < S5; i5++ ) {
-				for ( i4 = 0; i4 < S4; i4++ ) {
-					for ( i3 = 0; i3 < S3; i3++ ) {
-						for ( i2 = 0; i2 < S2; i2++ ) {
-							for ( i1 = 0; i1 < S1; i1++ ) {
-								for ( i0 = 0; i0 < S0; i0++ ) {
-									if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-										count += 1;
-										if ( count >= n ) {
-											return true;
-										}
-									}
-									ix += dx0;
-								}
-								ix += dx1;
-							}
-							ix += dx2;
-						}
-						ix += dx3;
-					}
-					ix += dx4;
-				}
-				ix += dx5;
-			}
-			ix += dx6;
-		}
-		ix += dx7;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some8d;
diff --git a/lib/9d.js b/lib/9d.js
deleted file mode 100644
index 3de9596..0000000
--- a/lib/9d.js
+++ /dev/null
@@ -1,202 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some9d( x, 4 );
-* // returns true
-*/
-function some9d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 8 ];
-		S1 = sh[ 7 ];
-		S2 = sh[ 6 ];
-		S3 = sh[ 5 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 3 ];
-		S6 = sh[ 2 ];
-		S7 = sh[ 1 ];
-		S8 = sh[ 0 ];
-		dx0 = sx[ 8 ];                // offset increment for innermost loop
-		dx1 = sx[ 7 ] - ( S0*sx[8] );
-		dx2 = sx[ 6 ] - ( S1*sx[7] );
-		dx3 = sx[ 5 ] - ( S2*sx[6] );
-		dx4 = sx[ 4 ] - ( S3*sx[5] );
-		dx5 = sx[ 3 ] - ( S4*sx[4] );
-		dx6 = sx[ 2 ] - ( S5*sx[3] );
-		dx7 = sx[ 1 ] - ( S6*sx[2] );
-		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i8 = 0; i8 < S8; i8++ ) {
-		for ( i7 = 0; i7 < S7; i7++ ) {
-			for ( i6 = 0; i6 < S6; i6++ ) {
-				for ( i5 = 0; i5 < S5; i5++ ) {
-					for ( i4 = 0; i4 < S4; i4++ ) {
-						for ( i3 = 0; i3 < S3; i3++ ) {
-							for ( i2 = 0; i2 < S2; i2++ ) {
-								for ( i1 = 0; i1 < S1; i1++ ) {
-									for ( i0 = 0; i0 < S0; i0++ ) {
-										if ( xbuf[ ix ] ) {
-											count += 1;
-											if ( count >= n ) {
-												return true;
-											}
-										}
-										ix += dx0;
-									}
-									ix += dx1;
-								}
-								ix += dx2;
-							}
-							ix += dx3;
-						}
-						ix += dx4;
-					}
-					ix += dx5;
-				}
-				ix += dx6;
-			}
-			ix += dx7;
-		}
-		ix += dx8;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some9d;
diff --git a/lib/9d_accessors.js b/lib/9d_accessors.js
deleted file mode 100644
index 1ed1e3a..0000000
--- a/lib/9d_accessors.js
+++ /dev/null
@@ -1,209 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = some9d( x, 4 );
-* // returns true
-*/
-function some9d( x, n ) {
-	var count;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 8 ];
-		S1 = sh[ 7 ];
-		S2 = sh[ 6 ];
-		S3 = sh[ 5 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 3 ];
-		S6 = sh[ 2 ];
-		S7 = sh[ 1 ];
-		S8 = sh[ 0 ];
-		dx0 = sx[ 8 ];                // offset increment for innermost loop
-		dx1 = sx[ 7 ] - ( S0*sx[8] );
-		dx2 = sx[ 6 ] - ( S1*sx[7] );
-		dx3 = sx[ 5 ] - ( S2*sx[6] );
-		dx4 = sx[ 4 ] - ( S3*sx[5] );
-		dx5 = sx[ 3 ] - ( S4*sx[4] );
-		dx6 = sx[ 2 ] - ( S5*sx[3] );
-		dx7 = sx[ 1 ] - ( S6*sx[2] );
-		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i8 = 0; i8 < S8; i8++ ) {
-		for ( i7 = 0; i7 < S7; i7++ ) {
-			for ( i6 = 0; i6 < S6; i6++ ) {
-				for ( i5 = 0; i5 < S5; i5++ ) {
-					for ( i4 = 0; i4 < S4; i4++ ) {
-						for ( i3 = 0; i3 < S3; i3++ ) {
-							for ( i2 = 0; i2 < S2; i2++ ) {
-								for ( i1 = 0; i1 < S1; i1++ ) {
-									for ( i0 = 0; i0 < S0; i0++ ) {
-										if ( get( xbuf, ix ) ) {
-											count += 1;
-											if ( count >= n ) {
-												return true;
-											}
-										}
-										ix += dx0;
-									}
-									ix += dx1;
-								}
-								ix += dx2;
-							}
-							ix += dx3;
-						}
-						ix += dx4;
-					}
-					ix += dx5;
-				}
-				ix += dx6;
-			}
-			ix += dx7;
-		}
-		ix += dx8;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some9d;
diff --git a/lib/9d_blocked.js b/lib/9d_blocked.js
deleted file mode 100644
index 0f09958..0000000
--- a/lib/9d_blocked.js
+++ /dev/null
@@ -1,293 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* 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 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 12, 12, 12, 12, 12, 12, 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome9d( x, 4 );
-* // returns true
-*/
-function blockedsome9d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j8 = sh[8]; j8 > 0; ) {
-		if ( j8 < bsize ) {
-			s8 = j8;
-			j8 = 0;
-		} else {
-			s8 = bsize;
-			j8 -= bsize;
-		}
-		ox8 = ox + ( j8*sx[8] );
-		for ( j7 = sh[7]; j7 > 0; ) {
-			if ( j7 < bsize ) {
-				s7 = j7;
-				j7 = 0;
-			} else {
-				s7 = bsize;
-				j7 -= bsize;
-			}
-			dx8 = sx[8] - ( s7*sx[7] );
-			ox7 = ox8 + ( j7*sx[7] );
-			for ( j6 = sh[6]; j6 > 0; ) {
-				if ( j6 < bsize ) {
-					s6 = j6;
-					j6 = 0;
-				} else {
-					s6 = bsize;
-					j6 -= bsize;
-				}
-				dx7 = sx[7] - ( s6*sx[6] );
-				ox6 = ox7 + ( j6*sx[6] );
-				for ( j5 = sh[5]; j5 > 0; ) {
-					if ( j5 < bsize ) {
-						s5 = j5;
-						j5 = 0;
-					} else {
-						s5 = bsize;
-						j5 -= bsize;
-					}
-					dx6 = sx[6] - ( s5*sx[5] );
-					ox5 = ox6 + ( j5*sx[5] );
-					for ( j4 = sh[4]; j4 > 0; ) {
-						if ( j4 < bsize ) {
-							s4 = j4;
-							j4 = 0;
-						} else {
-							s4 = bsize;
-							j4 -= bsize;
-						}
-						dx5 = sx[5] - ( s4*sx[4] );
-						ox4 = ox5 + ( j4*sx[4] );
-						for ( j3 = sh[3]; j3 > 0; ) {
-							if ( j3 < bsize ) {
-								s3 = j3;
-								j3 = 0;
-							} else {
-								s3 = bsize;
-								j3 -= bsize;
-							}
-							dx4 = sx[4] - ( s3*sx[3] );
-							ox3 = ox4 + ( j3*sx[3] );
-							for ( j2 = sh[2]; j2 > 0; ) {
-								if ( j2 < bsize ) {
-									s2 = j2;
-									j2 = 0;
-								} else {
-									s2 = bsize;
-									j2 -= bsize;
-								}
-								dx3 = sx[3] - ( s2*sx[2] );
-								ox2 = ox3 + ( j2*sx[2] );
-								for ( j1 = sh[1]; j1 > 0; ) {
-									if ( j1 < bsize ) {
-										s1 = j1;
-										j1 = 0;
-									} else {
-										s1 = bsize;
-										j1 -= bsize;
-									}
-									dx2 = sx[2] - ( s1*sx[1] );
-									ox1 = ox2 + ( j1*sx[1] );
-									for ( j0 = sh[0]; j0 > 0; ) {
-										if ( j0 < bsize ) {
-											s0 = j0;
-											j0 = 0;
-										} else {
-											s0 = bsize;
-											j0 -= bsize;
-										}
-										// Compute the index offset for the first input ndarray element in the current block:
-										ix = ox1 + ( j0*sx[0] );
-
-										// Compute the loop offset increment:
-										dx1 = sx[1] - ( s0*sx[0] );
-
-										// Iterate over the ndarray dimensions...
-										for ( i8 = 0; i8 < s8; i8++ ) {
-											for ( i7 = 0; i7 < s7; i7++ ) {
-												for ( i6 = 0; i6 < s6; i6++ ) {
-													for ( i5 = 0; i5 < s5; i5++ ) {
-														for ( i4 = 0; i4 < s4; i4++ ) {
-															for ( i3 = 0; i3 < s3; i3++ ) {
-																for ( i2 = 0; i2 < s2; i2++ ) {
-																	for ( i1 = 0; i1 < s1; i1++ ) {
-																		for ( i0 = 0; i0 < s0; i0++ ) {
-																			if ( xbuf[ ix ] ) {
-																				count += 1;
-																				if ( count >= n ) {
-																					return true;
-																				}
-																			}
-																			ix += dx0;
-																		}
-																		ix += dx1;
-																	}
-																	ix += dx2;
-																}
-																ix += dx3;
-															}
-															ix += dx4;
-														}
-														ix += dx5;
-													}
-													ix += dx6;
-												}
-												ix += dx7;
-											}
-											ix += dx8;
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome9d;
diff --git a/lib/9d_blocked_accessors.js b/lib/9d_blocked_accessors.js
deleted file mode 100644
index 4ce2b95..0000000
--- a/lib/9d_blocked_accessors.js
+++ /dev/null
@@ -1,300 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 4, 4, 4, 4, 4, 2, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = blockedsome9d( x, 4 );
-* // returns true
-*/
-function blockedsome9d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var get;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Cache accessor:
-	get = x.accessors[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j8 = sh[8]; j8 > 0; ) {
-		if ( j8 < bsize ) {
-			s8 = j8;
-			j8 = 0;
-		} else {
-			s8 = bsize;
-			j8 -= bsize;
-		}
-		ox8 = ox + ( j8*sx[8] );
-		for ( j7 = sh[7]; j7 > 0; ) {
-			if ( j7 < bsize ) {
-				s7 = j7;
-				j7 = 0;
-			} else {
-				s7 = bsize;
-				j7 -= bsize;
-			}
-			dx8 = sx[8] - ( s7*sx[7] );
-			ox7 = ox8 + ( j7*sx[7] );
-			for ( j6 = sh[6]; j6 > 0; ) {
-				if ( j6 < bsize ) {
-					s6 = j6;
-					j6 = 0;
-				} else {
-					s6 = bsize;
-					j6 -= bsize;
-				}
-				dx7 = sx[7] - ( s6*sx[6] );
-				ox6 = ox7 + ( j6*sx[6] );
-				for ( j5 = sh[5]; j5 > 0; ) {
-					if ( j5 < bsize ) {
-						s5 = j5;
-						j5 = 0;
-					} else {
-						s5 = bsize;
-						j5 -= bsize;
-					}
-					dx6 = sx[6] - ( s5*sx[5] );
-					ox5 = ox6 + ( j5*sx[5] );
-					for ( j4 = sh[4]; j4 > 0; ) {
-						if ( j4 < bsize ) {
-							s4 = j4;
-							j4 = 0;
-						} else {
-							s4 = bsize;
-							j4 -= bsize;
-						}
-						dx5 = sx[5] - ( s4*sx[4] );
-						ox4 = ox5 + ( j4*sx[4] );
-						for ( j3 = sh[3]; j3 > 0; ) {
-							if ( j3 < bsize ) {
-								s3 = j3;
-								j3 = 0;
-							} else {
-								s3 = bsize;
-								j3 -= bsize;
-							}
-							dx4 = sx[4] - ( s3*sx[3] );
-							ox3 = ox4 + ( j3*sx[3] );
-							for ( j2 = sh[2]; j2 > 0; ) {
-								if ( j2 < bsize ) {
-									s2 = j2;
-									j2 = 0;
-								} else {
-									s2 = bsize;
-									j2 -= bsize;
-								}
-								dx3 = sx[3] - ( s2*sx[2] );
-								ox2 = ox3 + ( j2*sx[2] );
-								for ( j1 = sh[1]; j1 > 0; ) {
-									if ( j1 < bsize ) {
-										s1 = j1;
-										j1 = 0;
-									} else {
-										s1 = bsize;
-										j1 -= bsize;
-									}
-									dx2 = sx[2] - ( s1*sx[1] );
-									ox1 = ox2 + ( j1*sx[1] );
-									for ( j0 = sh[0]; j0 > 0; ) {
-										if ( j0 < bsize ) {
-											s0 = j0;
-											j0 = 0;
-										} else {
-											s0 = bsize;
-											j0 -= bsize;
-										}
-										// Compute the index offset for the first input ndarray element in the current block:
-										ix = ox1 + ( j0*sx[0] );
-
-										// Compute the loop offset increment:
-										dx1 = sx[1] - ( s0*sx[0] );
-
-										// Iterate over the ndarray dimensions...
-										for ( i8 = 0; i8 < s8; i8++ ) {
-											for ( i7 = 0; i7 < s7; i7++ ) {
-												for ( i6 = 0; i6 < s6; i6++ ) {
-													for ( i5 = 0; i5 < s5; i5++ ) {
-														for ( i4 = 0; i4 < s4; i4++ ) {
-															for ( i3 = 0; i3 < s3; i3++ ) {
-																for ( i2 = 0; i2 < s2; i2++ ) {
-																	for ( i1 = 0; i1 < s1; i1++ ) {
-																		for ( i0 = 0; i0 < s0; i0++ ) {
-																			if ( get( xbuf, ix ) ) {
-																				count += 1;
-																				if ( count >= n ) {
-																					return true;
-																				}
-																			}
-																			ix += dx0;
-																		}
-																		ix += dx1;
-																	}
-																	ix += dx2;
-																}
-																ix += dx3;
-															}
-															ix += dx4;
-														}
-														ix += dx5;
-													}
-													ix += dx6;
-												}
-												ix += dx7;
-											}
-											ix += dx8;
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome9d;
diff --git a/lib/9d_blocked_complex.js b/lib/9d_blocked_complex.js
deleted file mode 100644
index c85cdec..0000000
--- a/lib/9d_blocked_complex.js
+++ /dev/null
@@ -1,293 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth, max-len */
-
-'use strict';
-
-// MODULES //
-
-var loopOrder = require( '@stdlib/ndarray-base-nullary-loop-interchange-order' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy via loop blocking.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = blockedsome9d( x, 4 );
-* // returns true
-*/
-function blockedsome9d( x, n ) { // eslint-disable-line max-statements
-	var count;
-	var bsize;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var ox1;
-	var ox2;
-	var ox3;
-	var ox4;
-	var ox5;
-	var ox6;
-	var ox7;
-	var ox8;
-	var sh;
-	var s0;
-	var s1;
-	var s2;
-	var s3;
-	var s4;
-	var s5;
-	var s6;
-	var s7;
-	var s8;
-	var sx;
-	var ox;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-	var j0;
-	var j1;
-	var j2;
-	var j3;
-	var j4;
-	var j5;
-	var j6;
-	var j7;
-	var j8;
-	var o;
-
-	// Note on variable naming convention: s#, dx#, dy#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Resolve the loop interchange order:
-	o = loopOrder( x.shape, x.strides );
-	sh = o.sh;
-	sx = o.sx;
-
-	// Determine the block size:
-	bsize = blockSize( x.dtype );
-
-	// Set a pointer to the first indexed element:
-	ox = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Cache the offset increment for the innermost loop:
-	dx0 = sx[0];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over blocks...
-	for ( j8 = sh[8]; j8 > 0; ) {
-		if ( j8 < bsize ) {
-			s8 = j8;
-			j8 = 0;
-		} else {
-			s8 = bsize;
-			j8 -= bsize;
-		}
-		ox8 = ox + ( j8*sx[8] );
-		for ( j7 = sh[7]; j7 > 0; ) {
-			if ( j7 < bsize ) {
-				s7 = j7;
-				j7 = 0;
-			} else {
-				s7 = bsize;
-				j7 -= bsize;
-			}
-			dx8 = sx[8] - ( s7*sx[7] );
-			ox7 = ox8 + ( j7*sx[7] );
-			for ( j6 = sh[6]; j6 > 0; ) {
-				if ( j6 < bsize ) {
-					s6 = j6;
-					j6 = 0;
-				} else {
-					s6 = bsize;
-					j6 -= bsize;
-				}
-				dx7 = sx[7] - ( s6*sx[6] );
-				ox6 = ox7 + ( j6*sx[6] );
-				for ( j5 = sh[5]; j5 > 0; ) {
-					if ( j5 < bsize ) {
-						s5 = j5;
-						j5 = 0;
-					} else {
-						s5 = bsize;
-						j5 -= bsize;
-					}
-					dx6 = sx[6] - ( s5*sx[5] );
-					ox5 = ox6 + ( j5*sx[5] );
-					for ( j4 = sh[4]; j4 > 0; ) {
-						if ( j4 < bsize ) {
-							s4 = j4;
-							j4 = 0;
-						} else {
-							s4 = bsize;
-							j4 -= bsize;
-						}
-						dx5 = sx[5] - ( s4*sx[4] );
-						ox4 = ox5 + ( j4*sx[4] );
-						for ( j3 = sh[3]; j3 > 0; ) {
-							if ( j3 < bsize ) {
-								s3 = j3;
-								j3 = 0;
-							} else {
-								s3 = bsize;
-								j3 -= bsize;
-							}
-							dx4 = sx[4] - ( s3*sx[3] );
-							ox3 = ox4 + ( j3*sx[3] );
-							for ( j2 = sh[2]; j2 > 0; ) {
-								if ( j2 < bsize ) {
-									s2 = j2;
-									j2 = 0;
-								} else {
-									s2 = bsize;
-									j2 -= bsize;
-								}
-								dx3 = sx[3] - ( s2*sx[2] );
-								ox2 = ox3 + ( j2*sx[2] );
-								for ( j1 = sh[1]; j1 > 0; ) {
-									if ( j1 < bsize ) {
-										s1 = j1;
-										j1 = 0;
-									} else {
-										s1 = bsize;
-										j1 -= bsize;
-									}
-									dx2 = sx[2] - ( s1*sx[1] );
-									ox1 = ox2 + ( j1*sx[1] );
-									for ( j0 = sh[0]; j0 > 0; ) {
-										if ( j0 < bsize ) {
-											s0 = j0;
-											j0 = 0;
-										} else {
-											s0 = bsize;
-											j0 -= bsize;
-										}
-										// Compute the index offset for the first input ndarray element in the current block:
-										ix = ox1 + ( j0*sx[0] );
-
-										// Compute the loop offset increment:
-										dx1 = sx[1] - ( s0*sx[0] );
-
-										// Iterate over the ndarray dimensions...
-										for ( i8 = 0; i8 < s8; i8++ ) {
-											for ( i7 = 0; i7 < s7; i7++ ) {
-												for ( i6 = 0; i6 < s6; i6++ ) {
-													for ( i5 = 0; i5 < s5; i5++ ) {
-														for ( i4 = 0; i4 < s4; i4++ ) {
-															for ( i3 = 0; i3 < s3; i3++ ) {
-																for ( i2 = 0; i2 < s2; i2++ ) {
-																	for ( i1 = 0; i1 < s1; i1++ ) {
-																		for ( i0 = 0; i0 < s0; i0++ ) {
-																			if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-																				count += 1;
-																				if ( count >= n ) {
-																					return true;
-																				}
-																			}
-																			ix += dx0;
-																		}
-																		ix += dx1;
-																	}
-																	ix += dx2;
-																}
-																ix += dx3;
-															}
-															ix += dx4;
-														}
-														ix += dx5;
-													}
-													ix += dx6;
-												}
-												ix += dx7;
-											}
-											ix += dx8;
-										}
-									}
-								}
-							}
-						}
-					}
-				}
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = blockedsome9d;
diff --git a/lib/9d_complex.js b/lib/9d_complex.js
deleted file mode 100644
index a5be98d..0000000
--- a/lib/9d_complex.js
+++ /dev/null
@@ -1,202 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable max-depth */
-
-'use strict';
-
-// MODULES //
-
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 1, 1, 1, 1, 1, 1, 1, 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 8, 8, 8, 8, 8, 8, 8, 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = some9d( x, 4 );
-* // returns true
-*/
-function some9d( x, n ) {
-	var count;
-	var xbuf;
-	var dx0;
-	var dx1;
-	var dx2;
-	var dx3;
-	var dx4;
-	var dx5;
-	var dx6;
-	var dx7;
-	var dx8;
-	var sh;
-	var S0;
-	var S1;
-	var S2;
-	var S3;
-	var S4;
-	var S5;
-	var S6;
-	var S7;
-	var S8;
-	var sx;
-	var ix;
-	var i0;
-	var i1;
-	var i2;
-	var i3;
-	var i4;
-	var i5;
-	var i6;
-	var i7;
-	var i8;
-
-	// Note on variable naming convention: S#, dx#, dy#, i# where # corresponds to the loop number, with `0` being the innermost loop...
-
-	// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
-	sh = x.shape;
-	sx = x.strides;
-	if ( strides2order( sx ) === 1 ) {
-		// For row-major ndarrays, the last dimensions have the fastest changing indices...
-		S0 = sh[ 8 ];
-		S1 = sh[ 7 ];
-		S2 = sh[ 6 ];
-		S3 = sh[ 5 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 3 ];
-		S6 = sh[ 2 ];
-		S7 = sh[ 1 ];
-		S8 = sh[ 0 ];
-		dx0 = sx[ 8 ];                // offset increment for innermost loop
-		dx1 = sx[ 7 ] - ( S0*sx[8] );
-		dx2 = sx[ 6 ] - ( S1*sx[7] );
-		dx3 = sx[ 5 ] - ( S2*sx[6] );
-		dx4 = sx[ 4 ] - ( S3*sx[5] );
-		dx5 = sx[ 3 ] - ( S4*sx[4] );
-		dx6 = sx[ 2 ] - ( S5*sx[3] );
-		dx7 = sx[ 1 ] - ( S6*sx[2] );
-		dx8 = sx[ 0 ] - ( S7*sx[1] ); // offset increment for outermost loop
-	} else { // order === 'column-major'
-		// For column-major ndarrays, the first dimensions have the fastest changing indices...
-		S0 = sh[ 0 ];
-		S1 = sh[ 1 ];
-		S2 = sh[ 2 ];
-		S3 = sh[ 3 ];
-		S4 = sh[ 4 ];
-		S5 = sh[ 5 ];
-		S6 = sh[ 6 ];
-		S7 = sh[ 7 ];
-		S8 = sh[ 8 ];
-		dx0 = sx[ 0 ];                // offset increment for innermost loop
-		dx1 = sx[ 1 ] - ( S0*sx[0] );
-		dx2 = sx[ 2 ] - ( S1*sx[1] );
-		dx3 = sx[ 3 ] - ( S2*sx[2] );
-		dx4 = sx[ 4 ] - ( S3*sx[3] );
-		dx5 = sx[ 5 ] - ( S4*sx[4] );
-		dx6 = sx[ 6 ] - ( S5*sx[5] );
-		dx7 = sx[ 7 ] - ( S6*sx[6] );
-		dx8 = sx[ 8 ] - ( S7*sx[7] ); // offset increment for outermost loop
-	}
-	// Set a pointer to the first indexed element:
-	ix = x.offset;
-
-	// Cache a reference to the input ndarray buffer:
-	xbuf = x.data;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over the ndarray dimensions...
-	for ( i8 = 0; i8 < S8; i8++ ) {
-		for ( i7 = 0; i7 < S7; i7++ ) {
-			for ( i6 = 0; i6 < S6; i6++ ) {
-				for ( i5 = 0; i5 < S5; i5++ ) {
-					for ( i4 = 0; i4 < S4; i4++ ) {
-						for ( i3 = 0; i3 < S3; i3++ ) {
-							for ( i2 = 0; i2 < S2; i2++ ) {
-								for ( i1 = 0; i1 < S1; i1++ ) {
-									for ( i0 = 0; i0 < S0; i0++ ) {
-										if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-											count += 1;
-											if ( count >= n ) {
-												return true;
-											}
-										}
-										ix += dx0;
-									}
-									ix += dx1;
-								}
-								ix += dx2;
-							}
-							ix += dx3;
-						}
-						ix += dx4;
-					}
-					ix += dx5;
-				}
-				ix += dx6;
-			}
-			ix += dx7;
-		}
-		ix += dx8;
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = some9d;
diff --git a/lib/index.js b/lib/index.js
deleted file mode 100644
index 80de369..0000000
--- a/lib/index.js
+++ /dev/null
@@ -1,70 +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';
-
-/**
-* Test whether at least `n` elements in an ndarray are truthy.
-*
-* @module @stdlib/ndarray-base-some
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-* var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-* var some = require( '@stdlib/ndarray-base-some' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Define the success criterion:
-* var n = scalar2ndarray( 3, {
-*     'dtype': 'generic'
-* });
-*
-* // Test elements:
-* var out = some( [ x, n ] );
-* // 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 7556989..0000000
--- a/lib/main.js
+++ /dev/null
@@ -1,391 +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 isComplexArray = require( '@stdlib/array-base-assert-is-complex-typed-array' );
-var isBooleanArray = require( '@stdlib/array-base-assert-is-booleanarray' );
-var iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );
-var minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' );
-var ndarray2object = require( '@stdlib/ndarray-base-ndarraylike2object' );
-var reinterpretComplex = require( '@stdlib/strided-base-reinterpret-complex' );
-var reinterpretBoolean = require( '@stdlib/strided-base-reinterpret-boolean' );
-var gscal = require( '@stdlib/blas-base-gscal' );
-var blockedaccessorsome2d = require( './2d_blocked_accessors.js' );
-var blockedaccessorsome3d = require( './3d_blocked_accessors.js' );
-var blockedaccessorsome4d = require( './4d_blocked_accessors.js' );
-var blockedaccessorsome5d = require( './5d_blocked_accessors.js' );
-var blockedaccessorsome6d = require( './6d_blocked_accessors.js' );
-var blockedaccessorsome7d = require( './7d_blocked_accessors.js' );
-var blockedaccessorsome8d = require( './8d_blocked_accessors.js' );
-var blockedaccessorsome9d = require( './9d_blocked_accessors.js' );
-var blockedaccessorsome10d = require( './10d_blocked_accessors.js' );
-var blockedcomplexsome2d = require( './2d_blocked_complex.js' );
-var blockedcomplexsome3d = require( './3d_blocked_complex.js' );
-var blockedcomplexsome4d = require( './4d_blocked_complex.js' );
-var blockedcomplexsome5d = require( './5d_blocked_complex.js' );
-var blockedcomplexsome6d = require( './6d_blocked_complex.js' );
-var blockedcomplexsome7d = require( './7d_blocked_complex.js' );
-var blockedcomplexsome8d = require( './8d_blocked_complex.js' );
-var blockedcomplexsome9d = require( './9d_blocked_complex.js' );
-var blockedcomplexsome10d = require( './10d_blocked_complex.js' );
-var blockedsome2d = require( './2d_blocked.js' );
-var blockedsome3d = require( './3d_blocked.js' );
-var blockedsome4d = require( './4d_blocked.js' );
-var blockedsome5d = require( './5d_blocked.js' );
-var blockedsome6d = require( './6d_blocked.js' );
-var blockedsome7d = require( './7d_blocked.js' );
-var blockedsome8d = require( './8d_blocked.js' );
-var blockedsome9d = require( './9d_blocked.js' );
-var blockedsome10d = require( './10d_blocked.js' );
-var accessorsome0d = require( './0d_accessors.js' );
-var accessorsome1d = require( './1d_accessors.js' );
-var accessorsome2d = require( './2d_accessors.js' );
-var accessorsome3d = require( './3d_accessors.js' );
-var accessorsome4d = require( './4d_accessors.js' );
-var accessorsome5d = require( './5d_accessors.js' );
-var accessorsome6d = require( './6d_accessors.js' );
-var accessorsome7d = require( './7d_accessors.js' );
-var accessorsome8d = require( './8d_accessors.js' );
-var accessorsome9d = require( './9d_accessors.js' );
-var accessorsome10d = require( './10d_accessors.js' );
-var accessorsomend = require( './nd_accessors.js' );
-var complexsome0d = require( './0d_complex.js' );
-var complexsome1d = require( './1d_complex.js' );
-var complexsome2d = require( './2d_complex.js' );
-var complexsome3d = require( './3d_complex.js' );
-var complexsome4d = require( './4d_complex.js' );
-var complexsome5d = require( './5d_complex.js' );
-var complexsome6d = require( './6d_complex.js' );
-var complexsome7d = require( './7d_complex.js' );
-var complexsome8d = require( './8d_complex.js' );
-var complexsome9d = require( './9d_complex.js' );
-var complexsome10d = require( './10d_complex.js' );
-var complexsomend = require( './nd_complex.js' );
-var some0d = require( './0d.js' );
-var some1d = require( './1d.js' );
-var some2d = require( './2d.js' );
-var some3d = require( './3d.js' );
-var some4d = require( './4d.js' );
-var some5d = require( './5d.js' );
-var some6d = require( './6d.js' );
-var some7d = require( './7d.js' );
-var some8d = require( './8d.js' );
-var some9d = require( './9d.js' );
-var some10d = require( './10d.js' );
-var somend = require( './nd.js' );
-
-
-// VARIABLES //
-
-var SOME = [
-	some0d,
-	some1d,
-	some2d,
-	some3d,
-	some4d,
-	some5d,
-	some6d,
-	some7d,
-	some8d,
-	some9d,
-	some10d,
-	somend
-];
-var ACCESSOR_SOME = [
-	accessorsome0d,
-	accessorsome1d,
-	accessorsome2d,
-	accessorsome3d,
-	accessorsome4d,
-	accessorsome5d,
-	accessorsome6d,
-	accessorsome7d,
-	accessorsome8d,
-	accessorsome9d,
-	accessorsome10d,
-	accessorsomend
-];
-var COMPLEX_SOME = [
-	complexsome0d,
-	complexsome1d,
-	complexsome2d,
-	complexsome3d,
-	complexsome4d,
-	complexsome5d,
-	complexsome6d,
-	complexsome7d,
-	complexsome8d,
-	complexsome9d,
-	complexsome10d,
-	complexsomend
-];
-var BLOCKED_SOME = [
-	blockedsome2d, // 0
-	blockedsome3d,
-	blockedsome4d,
-	blockedsome5d,
-	blockedsome6d,
-	blockedsome7d,
-	blockedsome8d,
-	blockedsome9d,
-	blockedsome10d // 8
-];
-var BLOCKED_ACCESSOR_SOME = [
-	blockedaccessorsome2d, // 0
-	blockedaccessorsome3d,
-	blockedaccessorsome4d,
-	blockedaccessorsome5d,
-	blockedaccessorsome6d,
-	blockedaccessorsome7d,
-	blockedaccessorsome8d,
-	blockedaccessorsome9d,
-	blockedaccessorsome10d // 8
-];
-var BLOCKED_COMPLEX_SOME = [
-	blockedcomplexsome2d, // 0
-	blockedcomplexsome3d,
-	blockedcomplexsome4d,
-	blockedcomplexsome5d,
-	blockedcomplexsome6d,
-	blockedcomplexsome7d,
-	blockedcomplexsome8d,
-	blockedcomplexsome9d,
-	blockedcomplexsome10d // 8
-];
-var MAX_DIMS = SOME.length - 1;
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* ## Notes
-*
-* -   A provided ndarray should be an object with the following properties:
-*
-*     -   **dtype**: data type.
-*     -   **data**: data buffer.
-*     -   **shape**: dimensions.
-*     -   **strides**: stride lengths.
-*     -   **offset**: index offset.
-*     -   **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).
-*
-* @param {ArrayLikeObject<Object>} arrays - array-like object containing an input ndarray and a zero-dimensional ndarray specifying the minimum number of elements in the input ndarray that must satisfy the predicate function
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 0.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 3, 1, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Define the success criterion:
-* var n = scalar2ndarray( 3, {
-*     'dtype': 'generic'
-* });
-*
-* // Test elements:
-* var out = some( [ x, n ] );
-* // returns true
-*/
-function some( arrays ) {
-	var isCmplx;
-	var ndims;
-	var xmmv;
-	var shx;
-	var iox;
-	var len;
-	var sx;
-	var ox;
-	var ns;
-	var N;
-	var x;
-	var n;
-	var d;
-	var i;
-
-	// Unpack the ndarray and standardize ndarray meta data:
-	x = ndarray2object( arrays[ 0 ] );
-	n = ndarray2object( arrays[ 1 ] );
-
-	shx = x.shape;
-	ndims = shx.length;
-
-	// Resolve the success criterion:
-	N = n.accessors[ 0 ]( n.data, n.offset );
-
-	// Check for known array types which can be reinterpreted for better iteration performance...
-	if ( isBooleanArray( x.data ) ) {
-		x.data = reinterpretBoolean( x.data, 0 );
-		x.accessorProtocol = false;
-	} else if ( isComplexArray( x.data ) ) {
-		x.data = reinterpretComplex( x.data, 0 );
-		x.accessorProtocol = false;
-		x.strides = gscal( ndims, 2, x.strides, 1 );
-		x.offset *= 2;
-		isCmplx = true;
-	}
-	// Determine whether we can avoid iteration altogether...
-	if ( ndims === 0 ) {
-		if ( x.accessorProtocol ) {
-			return ACCESSOR_SOME[ ndims ]( x, N );
-		}
-		if ( isCmplx ) {
-			return COMPLEX_SOME[ ndims ]( x, N );
-		}
-		return SOME[ ndims ]( x, N );
-	}
-	// Compute the number of elements and the number of singleton dimensions...
-	len = 1; // number of elements
-	ns = 0;  // number of singleton dimensions
-	for ( i = 0; i < ndims; i++ ) {
-		d = shx[ i ];
-
-		// Note that, if one of the dimensions is `0`, the length will be `0`...
-		len *= d;
-
-		// Check whether the current dimension is a singleton dimension...
-		if ( d === 1 ) {
-			ns += 1;
-		}
-	}
-	// Check whether we were provided an empty ndarray...
-	if ( len === 0 ) {
-		return false;
-	}
-	// Determine whether the ndarray is one-dimensional and thus readily translates to a one-dimensional strided array...
-	if ( ndims === 1 ) {
-		if ( x.accessorProtocol ) {
-			return ACCESSOR_SOME[ ndims ]( x, N );
-		}
-		if ( isCmplx ) {
-			return COMPLEX_SOME[ ndims ]( x, N );
-		}
-		return SOME[ ndims ]( x, N );
-	}
-	sx = x.strides;
-
-	// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can treat an ndarray as being equivalent to a one-dimensional strided array...
-	if ( ns === ndims-1 ) {
-		// Get the index of the non-singleton dimension...
-		for ( i = 0; i < ndims; i++ ) {
-			if ( shx[ i ] !== 1 ) {
-				break;
-			}
-		}
-		x.shape = [ shx[i] ];
-		x.strides = [ sx[i] ];
-		if ( x.accessorProtocol ) {
-			return ACCESSOR_SOME[ 1 ]( x, N );
-		}
-		if ( isCmplx ) {
-			return COMPLEX_SOME[ 1 ]( x, N );
-		}
-		return SOME[ 1 ]( x, N );
-	}
-	iox = iterationOrder( sx ); // +/-1
-
-	// Determine whether we can avoid blocked iteration...
-	if ( iox !== 0 ) {
-		// Determine the minimum and maximum linear indices which are accessible by the array view:
-		xmmv = minmaxViewBufferIndex( shx, sx, x.offset );
-
-		// Determine whether we can ignore shape (and strides) and treat the ndarray as a linear one-dimensional strided array...
-		if ( len === ( xmmv[1]-xmmv[0]+1 ) || ( isCmplx && len*2 === ( xmmv[1]-xmmv[0]+2 ) ) ) { // eslint-disable-line max-len
-			// Note: the above is equivalent to @stdlib/ndarray/base/assert/is-contiguous, but in-lined so we can retain computed values...
-			if ( iox === 1 ) {
-				ox = xmmv[ 0 ];
-			} else {
-				ox = xmmv[ 1 ];
-			}
-			x.shape = [ len ];
-			x.strides = [ ( isCmplx ) ? iox*2 : iox ];
-			x.offset = ox;
-			if ( x.accessorProtocol ) {
-				return ACCESSOR_SOME[ 1 ]( x, N );
-			}
-			if ( isCmplx ) {
-				return COMPLEX_SOME[ 1 ]( x, N );
-			}
-			return SOME[ 1 ]( x, N );
-		}
-		// The ndarray is non-contiguous, so we cannot directly use one-dimensional array functionality...
-
-		// Determine whether we can use simple nested loops...
-		if ( ndims <= MAX_DIMS ) {
-			// So long as iteration always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...
-			if ( x.accessorProtocol ) {
-				return ACCESSOR_SOME[ ndims ]( x, N );
-			}
-			if ( isCmplx ) {
-				return COMPLEX_SOME[ ndims ]( x, N );
-			}
-			return SOME[ ndims ]( x, N );
-		}
-		// Fall-through to blocked iteration...
-	}
-	// At this point, we're either dealing with a non-contiguous n-dimensional array or a high dimensional n-dimensional array, so our only hope is that we can still perform blocked iteration...
-
-	// Determine whether we can perform blocked iteration...
-	if ( ndims <= MAX_DIMS ) {
-		if ( x.accessorProtocol ) {
-			return BLOCKED_ACCESSOR_SOME[ ndims-2 ]( x, N );
-		}
-		if ( isCmplx ) {
-			return BLOCKED_COMPLEX_SOME[ ndims-2 ]( x, N );
-		}
-		return BLOCKED_SOME[ ndims-2 ]( x, N );
-	}
-	// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...
-	if ( x.accessorProtocol ) {
-		return accessorsomend( x, N );
-	}
-	if ( isCmplx ) {
-		return complexsomend( x, N );
-	}
-	return somend( x, N );
-}
-
-
-// EXPORTS //
-
-module.exports = some;
diff --git a/lib/nd.js b/lib/nd.js
deleted file mode 100644
index 762b52f..0000000
--- a/lib/nd.js
+++ /dev/null
@@ -1,124 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MODULES //
-
-var numel = require( '@stdlib/ndarray-base-numel' );
-var vind2bind = require( '@stdlib/ndarray-base-vind2bind' );
-
-
-// VARIABLES //
-
-var MODE = 'throw';
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 1;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'float64',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = somend( x, 2 );
-* // returns true
-*/
-function somend( x, n ) {
-	var count;
-	var xbuf;
-	var ordx;
-	var len;
-	var sh;
-	var sx;
-	var ox;
-	var ix;
-	var i;
-
-	sh = x.shape;
-
-	// Compute the total number of elements over which to iterate:
-	len = numel( sh );
-
-	// Cache a reference to the input ndarray data buffer:
-	xbuf = x.data;
-
-	// Cache a reference to the stride array:
-	sx = x.strides;
-
-	// Cache the index of the first indexed element:
-	ox = x.offset;
-
-	// Cache the array order:
-	ordx = x.order;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
-	for ( i = 0; i < len; i++ ) {
-		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
-		if ( xbuf[ ix ] ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = somend;
diff --git a/lib/nd_accessors.js b/lib/nd_accessors.js
deleted file mode 100644
index c5f3ea2..0000000
--- a/lib/nd_accessors.js
+++ /dev/null
@@ -1,131 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MODULES //
-
-var numel = require( '@stdlib/ndarray-base-numel' );
-var vind2bind = require( '@stdlib/ndarray-base-vind2bind' );
-
-
-// VARIABLES //
-
-var MODE = 'throw';
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements in an ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {Array<Function>} x.accessors - data buffer accessors
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-* var accessors = require( '@stdlib/array-base-accessors' );
-*
-* // Create a data buffer:
-* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 1 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'generic',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major',
-*     'accessors': accessors( xbuf ).accessors
-* };
-*
-* // Test elements:
-* var out = somend( x, 2 );
-* // returns true
-*/
-function somend( x, n ) {
-	var count;
-	var xbuf;
-	var ordx;
-	var len;
-	var get;
-	var sh;
-	var sx;
-	var ox;
-	var ix;
-	var i;
-
-	sh = x.shape;
-
-	// Compute the total number of elements over which to iterate:
-	len = numel( sh );
-
-	// Cache a reference to the input ndarray data buffer:
-	xbuf = x.data;
-
-	// Cache a reference to the stride array:
-	sx = x.strides;
-
-	// Cache the index of the first indexed element:
-	ox = x.offset;
-
-	// Cache the array order:
-	ordx = x.order;
-
-	// Cache accessor:
-	get = x.accessors[ 0 ];
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
-	for ( i = 0; i < len; i++ ) {
-		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
-		if ( get( xbuf, ix ) ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = somend;
diff --git a/lib/nd_complex.js b/lib/nd_complex.js
deleted file mode 100644
index bc2584c..0000000
--- a/lib/nd_complex.js
+++ /dev/null
@@ -1,124 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MODULES //
-
-var numel = require( '@stdlib/ndarray-base-numel' );
-var vind2bind = require( '@stdlib/ndarray-base-vind2bind' );
-
-
-// VARIABLES //
-
-var MODE = 'throw';
-
-
-// MAIN //
-
-/**
-* Tests whether at least `n` elements of a reinterpreted complex number ndarray are truthy.
-*
-* @private
-* @param {Object} x - object containing ndarray meta data
-* @param {string} x.dtype - data type
-* @param {Collection} x.data - data buffer
-* @param {NonNegativeIntegerArray} x.shape - dimensions
-* @param {IntegerArray} x.strides - stride lengths
-* @param {NonNegativeInteger} x.offset - index offset
-* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
-* @param {PositiveInteger} n - number of elements
-* @returns {boolean} boolean indicating whether at least `n` elements are truthy
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* // Create a data buffer:
-* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
-*
-* // Define the shape of the input array:
-* var shape = [ 2, 2 ];
-*
-* // Define the array strides:
-* var sx = [ 4, 2 ];
-*
-* // Define the index offset:
-* var ox = 0;
-*
-* // Create an input ndarray-like object:
-* var x = {
-*     'dtype': 'complex128',
-*     'data': xbuf,
-*     'shape': shape,
-*     'strides': sx,
-*     'offset': ox,
-*     'order': 'row-major'
-* };
-*
-* // Test elements:
-* var out = somend( x, 4 );
-* // returns true
-*/
-function somend( x, n ) {
-	var count;
-	var xbuf;
-	var ordx;
-	var len;
-	var sh;
-	var sx;
-	var ox;
-	var ix;
-	var i;
-
-	sh = x.shape;
-
-	// Compute the total number of elements over which to iterate:
-	len = numel( sh );
-
-	// Cache a reference to the output ndarray data buffer:
-	xbuf = x.data;
-
-	// Cache a reference to the stride array:
-	sx = x.strides;
-
-	// Cache the index of the first indexed element:
-	ox = x.offset;
-
-	// Cache the array order:
-	ordx = x.order;
-
-	// Initialize a counter:
-	count = 0;
-
-	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory...
-	for ( i = 0; i < len; i++ ) {
-		ix = vind2bind( sh, sx, ox, ordx, i, MODE );
-		if ( ( xbuf[ ix ] || xbuf[ ix+1 ] ) ) {
-			count += 1;
-			if ( count >= n ) {
-				return true;
-			}
-		}
-	}
-	return false;
-}
-
-
-// EXPORTS //
-
-module.exports = somend;
diff --git a/package.json b/package.json
index ab68ab4..8e4bf6f 100644
--- a/package.json
+++ b/package.json
@@ -3,31 +3,7 @@
   "version": "0.1.1",
   "description": "Test whether at least `n` elements in an ndarray are truthy.",
   "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,62 +12,6 @@
   "bugs": {
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
-  "dependencies": {
-    "@stdlib/array-base-assert-is-booleanarray": "^0.0.3",
-    "@stdlib/array-base-assert-is-complex-typed-array": "^0.1.3",
-    "@stdlib/blas-base-gscal": "^0.3.1",
-    "@stdlib/ndarray-base-iteration-order": "^0.2.3",
-    "@stdlib/ndarray-base-minmax-view-buffer-index": "^0.2.3",
-    "@stdlib/ndarray-base-ndarraylike2object": "^0.2.3",
-    "@stdlib/ndarray-base-nullary-loop-interchange-order": "^0.2.3",
-    "@stdlib/ndarray-base-nullary-tiling-block-size": "^0.2.3",
-    "@stdlib/ndarray-base-numel": "^0.2.3",
-    "@stdlib/ndarray-base-strides2order": "^0.2.3",
-    "@stdlib/ndarray-base-vind2bind": "^0.2.3",
-    "@stdlib/strided-base-reinterpret-boolean": "^0.0.3",
-    "@stdlib/strided-base-reinterpret-complex": "^0.1.3",
-    "@stdlib/types": "^0.5.1"
-  },
-  "devDependencies": {
-    "@stdlib/array-base-to-accessor-array": "^0.2.3",
-    "@stdlib/array-bool": "^0.1.2",
-    "@stdlib/array-complex128": "^0.3.2",
-    "@stdlib/array-ones": "^0.2.2",
-    "@stdlib/array-typed-complex-ctors": "^0.2.3",
-    "@stdlib/array-zeros": "^0.2.3",
-    "@stdlib/assert-is-boolean": "^0.2.3",
-    "@stdlib/complex-float64-ctor": "^0.1.2",
-    "@stdlib/math-base-special-cbrt": "^0.2.3",
-    "@stdlib/math-base-special-floor": "^0.2.4",
-    "@stdlib/math-base-special-pow": "^0.3.1",
-    "@stdlib/math-base-special-sqrt": "^0.2.3",
-    "@stdlib/ndarray-base-shape2strides": "^0.2.3",
-    "@stdlib/ndarray-base-strides2offset": "^0.2.3",
-    "@stdlib/ndarray-base-to-array": "^0.2.2",
-    "@stdlib/ndarray-ctor": "^0.3.1",
-    "@stdlib/ndarray-from-scalar": "^0.3.1",
-    "@stdlib/random-array-discrete-uniform": "^0.2.2",
-    "@stdlib/string-format": "^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",
     "base",
diff --git a/stats_browser.html b/stats_browser.html
new file mode 100644
index 0000000..e83bea6
--- /dev/null
+++ b/stats_browser.html
@@ -0,0 +1,4842 @@
+
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8" />
+  <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+  <meta http-equiv="X-UA-Compatible" content="ie=edge" />
+  <title>Rollup Visualizer</title>
+  <style>
+:root {
+  --font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, "Helvetica Neue", Arial, "Noto Sans", sans-serif,
+    "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol", "Noto Color Emoji";
+  --background-color: #2b2d42;
+  --text-color: #edf2f4;
+}
+
+html {
+  box-sizing: border-box;
+}
+
+*,
+*:before,
+*:after {
+  box-sizing: inherit;
+}
+
+html {
+  background-color: var(--background-color);
+  color: var(--text-color);
+  font-family: var(--font-family);
+}
+
+body {
+  padding: 0;
+  margin: 0;
+}
+
+html,
+body {
+  height: 100%;
+  width: 100%;
+  overflow: hidden;
+}
+
+body {
+  display: flex;
+  flex-direction: column;
+}
+
+svg {
+  vertical-align: middle;
+  width: 100%;
+  height: 100%;
+  max-height: 100vh;
+}
+
+main {
+  flex-grow: 1;
+  height: 100vh;
+  padding: 20px;
+}
+
+.tooltip {
+  position: absolute;
+  z-index: 1070;
+  border: 2px solid;
+  border-radius: 5px;
+  padding: 5px;
+  white-space: nowrap;
+  font-size: 0.875rem;
+  background-color: var(--background-color);
+  color: var(--text-color);
+}
+
+.tooltip-hidden {
+  visibility: hidden;
+  opacity: 0;
+}
+
+.sidebar {
+  position: fixed;
+  top: 0;
+  left: 0;
+  right: 0;
+  display: flex;
+  flex-direction: row;
+  font-size: 0.7rem;
+  align-items: center;
+  margin: 0 50px;
+  height: 20px;
+}
+
+.size-selectors {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+}
+
+.size-selector {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+  justify-content: center;
+  margin-right: 1rem;
+}
+.size-selector input {
+  margin: 0 0.3rem 0 0;
+}
+
+.filters {
+  flex: 1;
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+}
+
+.module-filters {
+  display: flex;
+  flex-grow: 1;
+}
+
+.module-filter {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+  justify-content: center;
+  flex: 1;
+}
+.module-filter input {
+  flex: 1;
+  height: 1rem;
+  padding: 0.01rem;
+  font-size: 0.7rem;
+  margin-left: 0.3rem;
+}
+.module-filter + .module-filter {
+  margin-left: 0.5rem;
+}
+
+.node {
+  cursor: pointer;
+}
+  </style>
+</head>
+<body>
+  <main></main>
+  <script>
+  /*<!--*/
+var drawChart = (function (exports) {
+  'use strict';
+
+  var n,l$1,u$2,i$1,o$1,r$1,f$2,e$1,c$1={},s$1=[],a$1=/acit|ex(?:s|g|n|p|$)|rph|grid|ows|mnc|ntw|ine[ch]|zoo|^ord|itera/i,h$1=Array.isArray;function v$1(n,l){for(var u in l)n[u]=l[u];return n}function p$1(n){var l=n.parentNode;l&&l.removeChild(n);}function y$1(l,u,t){var i,o,r,f={};for(r in u)"key"==r?i=u[r]:"ref"==r?o=u[r]:f[r]=u[r];if(arguments.length>2&&(f.children=arguments.length>3?n.call(arguments,2):t),"function"==typeof l&&null!=l.defaultProps)for(r in l.defaultProps)void 0===f[r]&&(f[r]=l.defaultProps[r]);return d$1(l,f,i,o,null)}function d$1(n,t,i,o,r){var f={type:n,props:t,key:i,ref:o,__k:null,__:null,__b:0,__e:null,__d:void 0,__c:null,constructor:void 0,__v:null==r?++u$2:r,__i:-1,__u:0};return null==r&&null!=l$1.vnode&&l$1.vnode(f),f}function g$1(n){return n.children}function b$1(n,l){this.props=n,this.context=l;}function m$1(n,l){if(null==l)return n.__?m$1(n.__,n.__i+1):null;for(var u;l<n.__k.length;l++)if(null!=(u=n.__k[l])&&null!=u.__e)return u.__e;return "function"==typeof n.type?m$1(n):null}function k$1(n){var l,u;if(null!=(n=n.__)&&null!=n.__c){for(n.__e=n.__c.base=null,l=0;l<n.__k.length;l++)if(null!=(u=n.__k[l])&&null!=u.__e){n.__e=n.__c.base=u.__e;break}return k$1(n)}}function w$1(n){(!n.__d&&(n.__d=!0)&&i$1.push(n)&&!x.__r++||o$1!==l$1.debounceRendering)&&((o$1=l$1.debounceRendering)||r$1)(x);}function x(){var n,u,t,o,r,e,c,s,a;for(i$1.sort(f$2);n=i$1.shift();)n.__d&&(u=i$1.length,o=void 0,e=(r=(t=n).__v).__e,s=[],a=[],(c=t.__P)&&((o=v$1({},r)).__v=r.__v+1,l$1.vnode&&l$1.vnode(o),L(c,o,r,t.__n,void 0!==c.ownerSVGElement,32&r.__u?[e]:null,s,null==e?m$1(r):e,!!(32&r.__u),a),o.__.__k[o.__i]=o,M(s,o,a),o.__e!=e&&k$1(o)),i$1.length>u&&i$1.sort(f$2));x.__r=0;}function C(n,l,u,t,i,o,r,f,e,a,h){var v,p,y,d,_,g=t&&t.__k||s$1,b=l.length;for(u.__d=e,P(u,l,g),e=u.__d,v=0;v<b;v++)null!=(y=u.__k[v])&&"boolean"!=typeof y&&"function"!=typeof y&&(p=-1===y.__i?c$1:g[y.__i]||c$1,y.__i=v,L(n,y,p,i,o,r,f,e,a,h),d=y.__e,y.ref&&p.ref!=y.ref&&(p.ref&&z$1(p.ref,null,y),h.push(y.ref,y.__c||d,y)),null==_&&null!=d&&(_=d),65536&y.__u||p.__k===y.__k?e=S(y,e,n):"function"==typeof y.type&&void 0!==y.__d?e=y.__d:d&&(e=d.nextSibling),y.__d=void 0,y.__u&=-196609);u.__d=e,u.__e=_;}function P(n,l,u){var t,i,o,r,f,e=l.length,c=u.length,s=c,a=0;for(n.__k=[],t=0;t<e;t++)null!=(i=n.__k[t]=null==(i=l[t])||"boolean"==typeof i||"function"==typeof i?null:"string"==typeof i||"number"==typeof i||"bigint"==typeof i||i.constructor==String?d$1(null,i,null,null,i):h$1(i)?d$1(g$1,{children:i},null,null,null):void 0===i.constructor&&i.__b>0?d$1(i.type,i.props,i.key,i.ref?i.ref:null,i.__v):i)?(i.__=n,i.__b=n.__b+1,f=H(i,u,r=t+a,s),i.__i=f,o=null,-1!==f&&(s--,(o=u[f])&&(o.__u|=131072)),null==o||null===o.__v?(-1==f&&a--,"function"!=typeof i.type&&(i.__u|=65536)):f!==r&&(f===r+1?a++:f>r?s>e-r?a+=f-r:a--:a=f<r&&f==r-1?f-r:0,f!==t+a&&(i.__u|=65536))):(o=u[t])&&null==o.key&&o.__e&&(o.__e==n.__d&&(n.__d=m$1(o)),N(o,o,!1),u[t]=null,s--);if(s)for(t=0;t<c;t++)null!=(o=u[t])&&0==(131072&o.__u)&&(o.__e==n.__d&&(n.__d=m$1(o)),N(o,o));}function S(n,l,u){var t,i;if("function"==typeof n.type){for(t=n.__k,i=0;t&&i<t.length;i++)t[i]&&(t[i].__=n,l=S(t[i],l,u));return l}return n.__e!=l&&(u.insertBefore(n.__e,l||null),l=n.__e),l&&l.nextSibling}function H(n,l,u,t){var i=n.key,o=n.type,r=u-1,f=u+1,e=l[u];if(null===e||e&&i==e.key&&o===e.type)return u;if(t>(null!=e&&0==(131072&e.__u)?1:0))for(;r>=0||f<l.length;){if(r>=0){if((e=l[r])&&0==(131072&e.__u)&&i==e.key&&o===e.type)return r;r--;}if(f<l.length){if((e=l[f])&&0==(131072&e.__u)&&i==e.key&&o===e.type)return f;f++;}}return -1}function I(n,l,u){"-"===l[0]?n.setProperty(l,null==u?"":u):n[l]=null==u?"":"number"!=typeof u||a$1.test(l)?u:u+"px";}function T$1(n,l,u,t,i){var o;n:if("style"===l)if("string"==typeof u)n.style.cssText=u;else {if("string"==typeof t&&(n.style.cssText=t=""),t)for(l in t)u&&l in u||I(n.style,l,"");if(u)for(l in u)t&&u[l]===t[l]||I(n.style,l,u[l]);}else if("o"===l[0]&&"n"===l[1])o=l!==(l=l.replace(/(PointerCapture)$|Capture$/,"$1")),l=l.toLowerCase()in n?l.toLowerCase().slice(2):l.slice(2),n.l||(n.l={}),n.l[l+o]=u,u?t?u.u=t.u:(u.u=Date.now(),n.addEventListener(l,o?D:A,o)):n.removeEventListener(l,o?D:A,o);else {if(i)l=l.replace(/xlink(H|:h)/,"h").replace(/sName$/,"s");else if("width"!==l&&"height"!==l&&"href"!==l&&"list"!==l&&"form"!==l&&"tabIndex"!==l&&"download"!==l&&"rowSpan"!==l&&"colSpan"!==l&&"role"!==l&&l in n)try{n[l]=null==u?"":u;break n}catch(n){}"function"==typeof u||(null==u||!1===u&&"-"!==l[4]?n.removeAttribute(l):n.setAttribute(l,u));}}function A(n){var u=this.l[n.type+!1];if(n.t){if(n.t<=u.u)return}else n.t=Date.now();return u(l$1.event?l$1.event(n):n)}function D(n){return this.l[n.type+!0](l$1.event?l$1.event(n):n)}function L(n,u,t,i,o,r,f,e,c,s){var a,p,y,d,_,m,k,w,x,P,S,$,H,I,T,A=u.type;if(void 0!==u.constructor)return null;128&t.__u&&(c=!!(32&t.__u),r=[e=u.__e=t.__e]),(a=l$1.__b)&&a(u);n:if("function"==typeof A)try{if(w=u.props,x=(a=A.contextType)&&i[a.__c],P=a?x?x.props.value:a.__:i,t.__c?k=(p=u.__c=t.__c).__=p.__E:("prototype"in A&&A.prototype.render?u.__c=p=new A(w,P):(u.__c=p=new b$1(w,P),p.constructor=A,p.render=O),x&&x.sub(p),p.props=w,p.state||(p.state={}),p.context=P,p.__n=i,y=p.__d=!0,p.__h=[],p._sb=[]),null==p.__s&&(p.__s=p.state),null!=A.getDerivedStateFromProps&&(p.__s==p.state&&(p.__s=v$1({},p.__s)),v$1(p.__s,A.getDerivedStateFromProps(w,p.__s))),d=p.props,_=p.state,p.__v=u,y)null==A.getDerivedStateFromProps&&null!=p.componentWillMount&&p.componentWillMount(),null!=p.componentDidMount&&p.__h.push(p.componentDidMount);else {if(null==A.getDerivedStateFromProps&&w!==d&&null!=p.componentWillReceiveProps&&p.componentWillReceiveProps(w,P),!p.__e&&(null!=p.shouldComponentUpdate&&!1===p.shouldComponentUpdate(w,p.__s,P)||u.__v===t.__v)){for(u.__v!==t.__v&&(p.props=w,p.state=p.__s,p.__d=!1),u.__e=t.__e,u.__k=t.__k,u.__k.forEach(function(n){n&&(n.__=u);}),S=0;S<p._sb.length;S++)p.__h.push(p._sb[S]);p._sb=[],p.__h.length&&f.push(p);break n}null!=p.componentWillUpdate&&p.componentWillUpdate(w,p.__s,P),null!=p.componentDidUpdate&&p.__h.push(function(){p.componentDidUpdate(d,_,m);});}if(p.context=P,p.props=w,p.__P=n,p.__e=!1,$=l$1.__r,H=0,"prototype"in A&&A.prototype.render){for(p.state=p.__s,p.__d=!1,$&&$(u),a=p.render(p.props,p.state,p.context),I=0;I<p._sb.length;I++)p.__h.push(p._sb[I]);p._sb=[];}else do{p.__d=!1,$&&$(u),a=p.render(p.props,p.state,p.context),p.state=p.__s;}while(p.__d&&++H<25);p.state=p.__s,null!=p.getChildContext&&(i=v$1(v$1({},i),p.getChildContext())),y||null==p.getSnapshotBeforeUpdate||(m=p.getSnapshotBeforeUpdate(d,_)),C(n,h$1(T=null!=a&&a.type===g$1&&null==a.key?a.props.children:a)?T:[T],u,t,i,o,r,f,e,c,s),p.base=u.__e,u.__u&=-161,p.__h.length&&f.push(p),k&&(p.__E=p.__=null);}catch(n){u.__v=null,c||null!=r?(u.__e=e,u.__u|=c?160:32,r[r.indexOf(e)]=null):(u.__e=t.__e,u.__k=t.__k),l$1.__e(n,u,t);}else null==r&&u.__v===t.__v?(u.__k=t.__k,u.__e=t.__e):u.__e=j$1(t.__e,u,t,i,o,r,f,c,s);(a=l$1.diffed)&&a(u);}function M(n,u,t){u.__d=void 0;for(var i=0;i<t.length;i++)z$1(t[i],t[++i],t[++i]);l$1.__c&&l$1.__c(u,n),n.some(function(u){try{n=u.__h,u.__h=[],n.some(function(n){n.call(u);});}catch(n){l$1.__e(n,u.__v);}});}function j$1(l,u,t,i,o,r,f,e,s){var a,v,y,d,_,g,b,k=t.props,w=u.props,x=u.type;if("svg"===x&&(o=!0),null!=r)for(a=0;a<r.length;a++)if((_=r[a])&&"setAttribute"in _==!!x&&(x?_.localName===x:3===_.nodeType)){l=_,r[a]=null;break}if(null==l){if(null===x)return document.createTextNode(w);l=o?document.createElementNS("http://www.w3.org/2000/svg",x):document.createElement(x,w.is&&w),r=null,e=!1;}if(null===x)k===w||e&&l.data===w||(l.data=w);else {if(r=r&&n.call(l.childNodes),k=t.props||c$1,!e&&null!=r)for(k={},a=0;a<l.attributes.length;a++)k[(_=l.attributes[a]).name]=_.value;for(a in k)_=k[a],"children"==a||("dangerouslySetInnerHTML"==a?y=_:"key"===a||a in w||T$1(l,a,null,_,o));for(a in w)_=w[a],"children"==a?d=_:"dangerouslySetInnerHTML"==a?v=_:"value"==a?g=_:"checked"==a?b=_:"key"===a||e&&"function"!=typeof _||k[a]===_||T$1(l,a,_,k[a],o);if(v)e||y&&(v.__html===y.__html||v.__html===l.innerHTML)||(l.innerHTML=v.__html),u.__k=[];else if(y&&(l.innerHTML=""),C(l,h$1(d)?d:[d],u,t,i,o&&"foreignObject"!==x,r,f,r?r[0]:t.__k&&m$1(t,0),e,s),null!=r)for(a=r.length;a--;)null!=r[a]&&p$1(r[a]);e||(a="value",void 0!==g&&(g!==l[a]||"progress"===x&&!g||"option"===x&&g!==k[a])&&T$1(l,a,g,k[a],!1),a="checked",void 0!==b&&b!==l[a]&&T$1(l,a,b,k[a],!1));}return l}function z$1(n,u,t){try{"function"==typeof n?n(u):n.current=u;}catch(n){l$1.__e(n,t);}}function N(n,u,t){var i,o;if(l$1.unmount&&l$1.unmount(n),(i=n.ref)&&(i.current&&i.current!==n.__e||z$1(i,null,u)),null!=(i=n.__c)){if(i.componentWillUnmount)try{i.componentWillUnmount();}catch(n){l$1.__e(n,u);}i.base=i.__P=null,n.__c=void 0;}if(i=n.__k)for(o=0;o<i.length;o++)i[o]&&N(i[o],u,t||"function"!=typeof n.type);t||null==n.__e||p$1(n.__e),n.__=n.__e=n.__d=void 0;}function O(n,l,u){return this.constructor(n,u)}function q$1(u,t,i){var o,r,f,e;l$1.__&&l$1.__(u,t),r=(o="function"==typeof i)?null:i&&i.__k||t.__k,f=[],e=[],L(t,u=(!o&&i||t).__k=y$1(g$1,null,[u]),r||c$1,c$1,void 0!==t.ownerSVGElement,!o&&i?[i]:r?null:t.firstChild?n.call(t.childNodes):null,f,!o&&i?i:r?r.__e:t.firstChild,o,e),M(f,u,e);}function F$1(n,l){var u={__c:l="__cC"+e$1++,__:n,Consumer:function(n,l){return n.children(l)},Provider:function(n){var u,t;return this.getChildContext||(u=[],(t={})[l]=this,this.getChildContext=function(){return t},this.shouldComponentUpdate=function(n){this.props.value!==n.value&&u.some(function(n){n.__e=!0,w$1(n);});},this.sub=function(n){u.push(n);var l=n.componentWillUnmount;n.componentWillUnmount=function(){u.splice(u.indexOf(n),1),l&&l.call(n);};}),n.children}};return u.Provider.__=u.Consumer.contextType=u}n=s$1.slice,l$1={__e:function(n,l,u,t){for(var i,o,r;l=l.__;)if((i=l.__c)&&!i.__)try{if((o=i.constructor)&&null!=o.getDerivedStateFromError&&(i.setState(o.getDerivedStateFromError(n)),r=i.__d),null!=i.componentDidCatch&&(i.componentDidCatch(n,t||{}),r=i.__d),r)return i.__E=i}catch(l){n=l;}throw n}},u$2=0,b$1.prototype.setState=function(n,l){var u;u=null!=this.__s&&this.__s!==this.state?this.__s:this.__s=v$1({},this.state),"function"==typeof n&&(n=n(v$1({},u),this.props)),n&&v$1(u,n),null!=n&&this.__v&&(l&&this._sb.push(l),w$1(this));},b$1.prototype.forceUpdate=function(n){this.__v&&(this.__e=!0,n&&this.__h.push(n),w$1(this));},b$1.prototype.render=g$1,i$1=[],r$1="function"==typeof Promise?Promise.prototype.then.bind(Promise.resolve()):setTimeout,f$2=function(n,l){return n.__v.__b-l.__v.__b},x.__r=0,e$1=0;
+
+  var f$1=0;function u$1(e,t,n,o,i,u){var a,c,p={};for(c in t)"ref"==c?a=t[c]:p[c]=t[c];var l={type:e,props:p,key:n,ref:a,__k:null,__:null,__b:0,__e:null,__d:void 0,__c:null,constructor:void 0,__v:--f$1,__i:-1,__u:0,__source:i,__self:u};if("function"==typeof e&&(a=e.defaultProps))for(c in a)void 0===p[c]&&(p[c]=a[c]);return l$1.vnode&&l$1.vnode(l),l}
+
+  function count$1(node) {
+    var sum = 0,
+        children = node.children,
+        i = children && children.length;
+    if (!i) sum = 1;
+    else while (--i >= 0) sum += children[i].value;
+    node.value = sum;
+  }
+
+  function node_count() {
+    return this.eachAfter(count$1);
+  }
+
+  function node_each(callback, that) {
+    let index = -1;
+    for (const node of this) {
+      callback.call(that, node, ++index, this);
+    }
+    return this;
+  }
+
+  function node_eachBefore(callback, that) {
+    var node = this, nodes = [node], children, i, index = -1;
+    while (node = nodes.pop()) {
+      callback.call(that, node, ++index, this);
+      if (children = node.children) {
+        for (i = children.length - 1; i >= 0; --i) {
+          nodes.push(children[i]);
+        }
+      }
+    }
+    return this;
+  }
+
+  function node_eachAfter(callback, that) {
+    var node = this, nodes = [node], next = [], children, i, n, index = -1;
+    while (node = nodes.pop()) {
+      next.push(node);
+      if (children = node.children) {
+        for (i = 0, n = children.length; i < n; ++i) {
+          nodes.push(children[i]);
+        }
+      }
+    }
+    while (node = next.pop()) {
+      callback.call(that, node, ++index, this);
+    }
+    return this;
+  }
+
+  function node_find(callback, that) {
+    let index = -1;
+    for (const node of this) {
+      if (callback.call(that, node, ++index, this)) {
+        return node;
+      }
+    }
+  }
+
+  function node_sum(value) {
+    return this.eachAfter(function(node) {
+      var sum = +value(node.data) || 0,
+          children = node.children,
+          i = children && children.length;
+      while (--i >= 0) sum += children[i].value;
+      node.value = sum;
+    });
+  }
+
+  function node_sort(compare) {
+    return this.eachBefore(function(node) {
+      if (node.children) {
+        node.children.sort(compare);
+      }
+    });
+  }
+
+  function node_path(end) {
+    var start = this,
+        ancestor = leastCommonAncestor(start, end),
+        nodes = [start];
+    while (start !== ancestor) {
+      start = start.parent;
+      nodes.push(start);
+    }
+    var k = nodes.length;
+    while (end !== ancestor) {
+      nodes.splice(k, 0, end);
+      end = end.parent;
+    }
+    return nodes;
+  }
+
+  function leastCommonAncestor(a, b) {
+    if (a === b) return a;
+    var aNodes = a.ancestors(),
+        bNodes = b.ancestors(),
+        c = null;
+    a = aNodes.pop();
+    b = bNodes.pop();
+    while (a === b) {
+      c = a;
+      a = aNodes.pop();
+      b = bNodes.pop();
+    }
+    return c;
+  }
+
+  function node_ancestors() {
+    var node = this, nodes = [node];
+    while (node = node.parent) {
+      nodes.push(node);
+    }
+    return nodes;
+  }
+
+  function node_descendants() {
+    return Array.from(this);
+  }
+
+  function node_leaves() {
+    var leaves = [];
+    this.eachBefore(function(node) {
+      if (!node.children) {
+        leaves.push(node);
+      }
+    });
+    return leaves;
+  }
+
+  function node_links() {
+    var root = this, links = [];
+    root.each(function(node) {
+      if (node !== root) { // Don’t include the root’s parent, if any.
+        links.push({source: node.parent, target: node});
+      }
+    });
+    return links;
+  }
+
+  function* node_iterator() {
+    var node = this, current, next = [node], children, i, n;
+    do {
+      current = next.reverse(), next = [];
+      while (node = current.pop()) {
+        yield node;
+        if (children = node.children) {
+          for (i = 0, n = children.length; i < n; ++i) {
+            next.push(children[i]);
+          }
+        }
+      }
+    } while (next.length);
+  }
+
+  function hierarchy(data, children) {
+    if (data instanceof Map) {
+      data = [undefined, data];
+      if (children === undefined) children = mapChildren;
+    } else if (children === undefined) {
+      children = objectChildren;
+    }
+
+    var root = new Node$1(data),
+        node,
+        nodes = [root],
+        child,
+        childs,
+        i,
+        n;
+
+    while (node = nodes.pop()) {
+      if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {
+        node.children = childs;
+        for (i = n - 1; i >= 0; --i) {
+          nodes.push(child = childs[i] = new Node$1(childs[i]));
+          child.parent = node;
+          child.depth = node.depth + 1;
+        }
+      }
+    }
+
+    return root.eachBefore(computeHeight);
+  }
+
+  function node_copy() {
+    return hierarchy(this).eachBefore(copyData);
+  }
+
+  function objectChildren(d) {
+    return d.children;
+  }
+
+  function mapChildren(d) {
+    return Array.isArray(d) ? d[1] : null;
+  }
+
+  function copyData(node) {
+    if (node.data.value !== undefined) node.value = node.data.value;
+    node.data = node.data.data;
+  }
+
+  function computeHeight(node) {
+    var height = 0;
+    do node.height = height;
+    while ((node = node.parent) && (node.height < ++height));
+  }
+
+  function Node$1(data) {
+    this.data = data;
+    this.depth =
+    this.height = 0;
+    this.parent = null;
+  }
+
+  Node$1.prototype = hierarchy.prototype = {
+    constructor: Node$1,
+    count: node_count,
+    each: node_each,
+    eachAfter: node_eachAfter,
+    eachBefore: node_eachBefore,
+    find: node_find,
+    sum: node_sum,
+    sort: node_sort,
+    path: node_path,
+    ancestors: node_ancestors,
+    descendants: node_descendants,
+    leaves: node_leaves,
+    links: node_links,
+    copy: node_copy,
+    [Symbol.iterator]: node_iterator
+  };
+
+  function required(f) {
+    if (typeof f !== "function") throw new Error;
+    return f;
+  }
+
+  function constantZero() {
+    return 0;
+  }
+
+  function constant$1(x) {
+    return function() {
+      return x;
+    };
+  }
+
+  function roundNode(node) {
+    node.x0 = Math.round(node.x0);
+    node.y0 = Math.round(node.y0);
+    node.x1 = Math.round(node.x1);
+    node.y1 = Math.round(node.y1);
+  }
+
+  function treemapDice(parent, x0, y0, x1, y1) {
+    var nodes = parent.children,
+        node,
+        i = -1,
+        n = nodes.length,
+        k = parent.value && (x1 - x0) / parent.value;
+
+    while (++i < n) {
+      node = nodes[i], node.y0 = y0, node.y1 = y1;
+      node.x0 = x0, node.x1 = x0 += node.value * k;
+    }
+  }
+
+  function treemapSlice(parent, x0, y0, x1, y1) {
+    var nodes = parent.children,
+        node,
+        i = -1,
+        n = nodes.length,
+        k = parent.value && (y1 - y0) / parent.value;
+
+    while (++i < n) {
+      node = nodes[i], node.x0 = x0, node.x1 = x1;
+      node.y0 = y0, node.y1 = y0 += node.value * k;
+    }
+  }
+
+  var phi = (1 + Math.sqrt(5)) / 2;
+
+  function squarifyRatio(ratio, parent, x0, y0, x1, y1) {
+    var rows = [],
+        nodes = parent.children,
+        row,
+        nodeValue,
+        i0 = 0,
+        i1 = 0,
+        n = nodes.length,
+        dx, dy,
+        value = parent.value,
+        sumValue,
+        minValue,
+        maxValue,
+        newRatio,
+        minRatio,
+        alpha,
+        beta;
+
+    while (i0 < n) {
+      dx = x1 - x0, dy = y1 - y0;
+
+      // Find the next non-empty node.
+      do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);
+      minValue = maxValue = sumValue;
+      alpha = Math.max(dy / dx, dx / dy) / (value * ratio);
+      beta = sumValue * sumValue * alpha;
+      minRatio = Math.max(maxValue / beta, beta / minValue);
+
+      // Keep adding nodes while the aspect ratio maintains or improves.
+      for (; i1 < n; ++i1) {
+        sumValue += nodeValue = nodes[i1].value;
+        if (nodeValue < minValue) minValue = nodeValue;
+        if (nodeValue > maxValue) maxValue = nodeValue;
+        beta = sumValue * sumValue * alpha;
+        newRatio = Math.max(maxValue / beta, beta / minValue);
+        if (newRatio > minRatio) { sumValue -= nodeValue; break; }
+        minRatio = newRatio;
+      }
+
+      // Position and record the row orientation.
+      rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});
+      if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);
+      else treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);
+      value -= sumValue, i0 = i1;
+    }
+
+    return rows;
+  }
+
+  var squarify = (function custom(ratio) {
+
+    function squarify(parent, x0, y0, x1, y1) {
+      squarifyRatio(ratio, parent, x0, y0, x1, y1);
+    }
+
+    squarify.ratio = function(x) {
+      return custom((x = +x) > 1 ? x : 1);
+    };
+
+    return squarify;
+  })(phi);
+
+  function treemap() {
+    var tile = squarify,
+        round = false,
+        dx = 1,
+        dy = 1,
+        paddingStack = [0],
+        paddingInner = constantZero,
+        paddingTop = constantZero,
+        paddingRight = constantZero,
+        paddingBottom = constantZero,
+        paddingLeft = constantZero;
+
+    function treemap(root) {
+      root.x0 =
+      root.y0 = 0;
+      root.x1 = dx;
+      root.y1 = dy;
+      root.eachBefore(positionNode);
+      paddingStack = [0];
+      if (round) root.eachBefore(roundNode);
+      return root;
+    }
+
+    function positionNode(node) {
+      var p = paddingStack[node.depth],
+          x0 = node.x0 + p,
+          y0 = node.y0 + p,
+          x1 = node.x1 - p,
+          y1 = node.y1 - p;
+      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
+      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
+      node.x0 = x0;
+      node.y0 = y0;
+      node.x1 = x1;
+      node.y1 = y1;
+      if (node.children) {
+        p = paddingStack[node.depth + 1] = paddingInner(node) / 2;
+        x0 += paddingLeft(node) - p;
+        y0 += paddingTop(node) - p;
+        x1 -= paddingRight(node) - p;
+        y1 -= paddingBottom(node) - p;
+        if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
+        if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
+        tile(node, x0, y0, x1, y1);
+      }
+    }
+
+    treemap.round = function(x) {
+      return arguments.length ? (round = !!x, treemap) : round;
+    };
+
+    treemap.size = function(x) {
+      return arguments.length ? (dx = +x[0], dy = +x[1], treemap) : [dx, dy];
+    };
+
+    treemap.tile = function(x) {
+      return arguments.length ? (tile = required(x), treemap) : tile;
+    };
+
+    treemap.padding = function(x) {
+      return arguments.length ? treemap.paddingInner(x).paddingOuter(x) : treemap.paddingInner();
+    };
+
+    treemap.paddingInner = function(x) {
+      return arguments.length ? (paddingInner = typeof x === "function" ? x : constant$1(+x), treemap) : paddingInner;
+    };
+
+    treemap.paddingOuter = function(x) {
+      return arguments.length ? treemap.paddingTop(x).paddingRight(x).paddingBottom(x).paddingLeft(x) : treemap.paddingTop();
+    };
+
+    treemap.paddingTop = function(x) {
+      return arguments.length ? (paddingTop = typeof x === "function" ? x : constant$1(+x), treemap) : paddingTop;
+    };
+
+    treemap.paddingRight = function(x) {
+      return arguments.length ? (paddingRight = typeof x === "function" ? x : constant$1(+x), treemap) : paddingRight;
+    };
+
+    treemap.paddingBottom = function(x) {
+      return arguments.length ? (paddingBottom = typeof x === "function" ? x : constant$1(+x), treemap) : paddingBottom;
+    };
+
+    treemap.paddingLeft = function(x) {
+      return arguments.length ? (paddingLeft = typeof x === "function" ? x : constant$1(+x), treemap) : paddingLeft;
+    };
+
+    return treemap;
+  }
+
+  var treemapResquarify = (function custom(ratio) {
+
+    function resquarify(parent, x0, y0, x1, y1) {
+      if ((rows = parent._squarify) && (rows.ratio === ratio)) {
+        var rows,
+            row,
+            nodes,
+            i,
+            j = -1,
+            n,
+            m = rows.length,
+            value = parent.value;
+
+        while (++j < m) {
+          row = rows[j], nodes = row.children;
+          for (i = row.value = 0, n = nodes.length; i < n; ++i) row.value += nodes[i].value;
+          if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += (y1 - y0) * row.value / value : y1);
+          else treemapSlice(row, x0, y0, value ? x0 += (x1 - x0) * row.value / value : x1, y1);
+          value -= row.value;
+        }
+      } else {
+        parent._squarify = rows = squarifyRatio(ratio, parent, x0, y0, x1, y1);
+        rows.ratio = ratio;
+      }
+    }
+
+    resquarify.ratio = function(x) {
+      return custom((x = +x) > 1 ? x : 1);
+    };
+
+    return resquarify;
+  })(phi);
+
+  const isModuleTree = (mod) => "children" in mod;
+
+  let count = 0;
+  class Id {
+      constructor(id) {
+          this._id = id;
+          const url = new URL(window.location.href);
+          url.hash = id;
+          this._href = url.toString();
+      }
+      get id() {
+          return this._id;
+      }
+      get href() {
+          return this._href;
+      }
+      toString() {
+          return `url(${this.href})`;
+      }
+  }
+  function generateUniqueId(name) {
+      count += 1;
+      const id = ["O", name, count].filter(Boolean).join("-");
+      return new Id(id);
+  }
+
+  const LABELS = {
+      renderedLength: "Rendered",
+      gzipLength: "Gzip",
+      brotliLength: "Brotli",
+  };
+  const getAvailableSizeOptions = (options) => {
+      const availableSizeProperties = ["renderedLength"];
+      if (options.gzip) {
+          availableSizeProperties.push("gzipLength");
+      }
+      if (options.brotli) {
+          availableSizeProperties.push("brotliLength");
+      }
+      return availableSizeProperties;
+  };
+
+  var t,r,u,i,o=0,f=[],c=[],e=l$1.__b,a=l$1.__r,v=l$1.diffed,l=l$1.__c,m=l$1.unmount;function d(t,u){l$1.__h&&l$1.__h(r,t,o||u),o=0;var i=r.__H||(r.__H={__:[],__h:[]});return t>=i.__.length&&i.__.push({__V:c}),i.__[t]}function h(n){return o=1,s(B,n)}function s(n,u,i){var o=d(t++,2);if(o.t=n,!o.__c&&(o.__=[i?i(u):B(void 0,u),function(n){var t=o.__N?o.__N[0]:o.__[0],r=o.t(t,n);t!==r&&(o.__N=[r,o.__[1]],o.__c.setState({}));}],o.__c=r,!r.u)){var f=function(n,t,r){if(!o.__c.__H)return !0;var u=o.__c.__H.__.filter(function(n){return n.__c});if(u.every(function(n){return !n.__N}))return !c||c.call(this,n,t,r);var i=!1;return u.forEach(function(n){if(n.__N){var t=n.__[0];n.__=n.__N,n.__N=void 0,t!==n.__[0]&&(i=!0);}}),!(!i&&o.__c.props===n)&&(!c||c.call(this,n,t,r))};r.u=!0;var c=r.shouldComponentUpdate,e=r.componentWillUpdate;r.componentWillUpdate=function(n,t,r){if(this.__e){var u=c;c=void 0,f(n,t,r),c=u;}e&&e.call(this,n,t,r);},r.shouldComponentUpdate=f;}return o.__N||o.__}function p(u,i){var o=d(t++,3);!l$1.__s&&z(o.__H,i)&&(o.__=u,o.i=i,r.__H.__h.push(o));}function y(u,i){var o=d(t++,4);!l$1.__s&&z(o.__H,i)&&(o.__=u,o.i=i,r.__h.push(o));}function _(n){return o=5,F(function(){return {current:n}},[])}function F(n,r){var u=d(t++,7);return z(u.__H,r)?(u.__V=n(),u.i=r,u.__h=n,u.__V):u.__}function T(n,t){return o=8,F(function(){return n},t)}function q(n){var u=r.context[n.__c],i=d(t++,9);return i.c=n,u?(null==i.__&&(i.__=!0,u.sub(r)),u.props.value):n.__}function b(){for(var t;t=f.shift();)if(t.__P&&t.__H)try{t.__H.__h.forEach(k),t.__H.__h.forEach(w),t.__H.__h=[];}catch(r){t.__H.__h=[],l$1.__e(r,t.__v);}}l$1.__b=function(n){r=null,e&&e(n);},l$1.__r=function(n){a&&a(n),t=0;var i=(r=n.__c).__H;i&&(u===r?(i.__h=[],r.__h=[],i.__.forEach(function(n){n.__N&&(n.__=n.__N),n.__V=c,n.__N=n.i=void 0;})):(i.__h.forEach(k),i.__h.forEach(w),i.__h=[],t=0)),u=r;},l$1.diffed=function(t){v&&v(t);var o=t.__c;o&&o.__H&&(o.__H.__h.length&&(1!==f.push(o)&&i===l$1.requestAnimationFrame||((i=l$1.requestAnimationFrame)||j)(b)),o.__H.__.forEach(function(n){n.i&&(n.__H=n.i),n.__V!==c&&(n.__=n.__V),n.i=void 0,n.__V=c;})),u=r=null;},l$1.__c=function(t,r){r.some(function(t){try{t.__h.forEach(k),t.__h=t.__h.filter(function(n){return !n.__||w(n)});}catch(u){r.some(function(n){n.__h&&(n.__h=[]);}),r=[],l$1.__e(u,t.__v);}}),l&&l(t,r);},l$1.unmount=function(t){m&&m(t);var r,u=t.__c;u&&u.__H&&(u.__H.__.forEach(function(n){try{k(n);}catch(n){r=n;}}),u.__H=void 0,r&&l$1.__e(r,u.__v));};var g="function"==typeof requestAnimationFrame;function j(n){var t,r=function(){clearTimeout(u),g&&cancelAnimationFrame(t),setTimeout(n);},u=setTimeout(r,100);g&&(t=requestAnimationFrame(r));}function k(n){var t=r,u=n.__c;"function"==typeof u&&(n.__c=void 0,u()),r=t;}function w(n){var t=r;n.__c=n.__(),r=t;}function z(n,t){return !n||n.length!==t.length||t.some(function(t,r){return t!==n[r]})}function B(n,t){return "function"==typeof t?t(n):t}
+
+  const PLACEHOLDER = "*/**/file.js";
+  const SideBar = ({ availableSizeProperties, sizeProperty, setSizeProperty, onExcludeChange, onIncludeChange, }) => {
+      const [includeValue, setIncludeValue] = h("");
+      const [excludeValue, setExcludeValue] = h("");
+      const handleSizePropertyChange = (sizeProp) => () => {
+          if (sizeProp !== sizeProperty) {
+              setSizeProperty(sizeProp);
+          }
+      };
+      const handleIncludeChange = (event) => {
+          const value = event.currentTarget.value;
+          setIncludeValue(value);
+          onIncludeChange(value);
+      };
+      const handleExcludeChange = (event) => {
+          const value = event.currentTarget.value;
+          setExcludeValue(value);
+          onExcludeChange(value);
+      };
+      return (u$1("aside", { className: "sidebar", children: [u$1("div", { className: "size-selectors", children: availableSizeProperties.length > 1 &&
+                      availableSizeProperties.map((sizeProp) => {
+                          const id = `selector-${sizeProp}`;
+                          return (u$1("div", { className: "size-selector", children: [u$1("input", { type: "radio", id: id, checked: sizeProp === sizeProperty, onChange: handleSizePropertyChange(sizeProp) }), u$1("label", { htmlFor: id, children: LABELS[sizeProp] })] }, sizeProp));
+                      }) }), u$1("div", { className: "module-filters", children: [u$1("div", { className: "module-filter", children: [u$1("label", { htmlFor: "module-filter-exclude", children: "Exclude" }), u$1("input", { type: "text", id: "module-filter-exclude", value: excludeValue, onInput: handleExcludeChange, placeholder: PLACEHOLDER })] }), u$1("div", { className: "module-filter", children: [u$1("label", { htmlFor: "module-filter-include", children: "Include" }), u$1("input", { type: "text", id: "module-filter-include", value: includeValue, onInput: handleIncludeChange, placeholder: PLACEHOLDER })] })] })] }));
+  };
+
+  function getDefaultExportFromCjs (x) {
+  	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+  }
+
+  var utils$3 = {};
+
+  const WIN_SLASH = '\\\\/';
+  const WIN_NO_SLASH = `[^${WIN_SLASH}]`;
+
+  /**
+   * Posix glob regex
+   */
+
+  const DOT_LITERAL = '\\.';
+  const PLUS_LITERAL = '\\+';
+  const QMARK_LITERAL = '\\?';
+  const SLASH_LITERAL = '\\/';
+  const ONE_CHAR = '(?=.)';
+  const QMARK = '[^/]';
+  const END_ANCHOR = `(?:${SLASH_LITERAL}|$)`;
+  const START_ANCHOR = `(?:^|${SLASH_LITERAL})`;
+  const DOTS_SLASH = `${DOT_LITERAL}{1,2}${END_ANCHOR}`;
+  const NO_DOT = `(?!${DOT_LITERAL})`;
+  const NO_DOTS = `(?!${START_ANCHOR}${DOTS_SLASH})`;
+  const NO_DOT_SLASH = `(?!${DOT_LITERAL}{0,1}${END_ANCHOR})`;
+  const NO_DOTS_SLASH = `(?!${DOTS_SLASH})`;
+  const QMARK_NO_DOT = `[^.${SLASH_LITERAL}]`;
+  const STAR = `${QMARK}*?`;
+  const SEP = '/';
+
+  const POSIX_CHARS = {
+    DOT_LITERAL,
+    PLUS_LITERAL,
+    QMARK_LITERAL,
+    SLASH_LITERAL,
+    ONE_CHAR,
+    QMARK,
+    END_ANCHOR,
+    DOTS_SLASH,
+    NO_DOT,
+    NO_DOTS,
+    NO_DOT_SLASH,
+    NO_DOTS_SLASH,
+    QMARK_NO_DOT,
+    STAR,
+    START_ANCHOR,
+    SEP
+  };
+
+  /**
+   * Windows glob regex
+   */
+
+  const WINDOWS_CHARS = {
+    ...POSIX_CHARS,
+
+    SLASH_LITERAL: `[${WIN_SLASH}]`,
+    QMARK: WIN_NO_SLASH,
+    STAR: `${WIN_NO_SLASH}*?`,
+    DOTS_SLASH: `${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$)`,
+    NO_DOT: `(?!${DOT_LITERAL})`,
+    NO_DOTS: `(?!(?:^|[${WIN_SLASH}])${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$))`,
+    NO_DOT_SLASH: `(?!${DOT_LITERAL}{0,1}(?:[${WIN_SLASH}]|$))`,
+    NO_DOTS_SLASH: `(?!${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$))`,
+    QMARK_NO_DOT: `[^.${WIN_SLASH}]`,
+    START_ANCHOR: `(?:^|[${WIN_SLASH}])`,
+    END_ANCHOR: `(?:[${WIN_SLASH}]|$)`,
+    SEP: '\\'
+  };
+
+  /**
+   * POSIX Bracket Regex
+   */
+
+  const POSIX_REGEX_SOURCE$1 = {
+    alnum: 'a-zA-Z0-9',
+    alpha: 'a-zA-Z',
+    ascii: '\\x00-\\x7F',
+    blank: ' \\t',
+    cntrl: '\\x00-\\x1F\\x7F',
+    digit: '0-9',
+    graph: '\\x21-\\x7E',
+    lower: 'a-z',
+    print: '\\x20-\\x7E ',
+    punct: '\\-!"#$%&\'()\\*+,./:;<=>?@[\\]^_`{|}~',
+    space: ' \\t\\r\\n\\v\\f',
+    upper: 'A-Z',
+    word: 'A-Za-z0-9_',
+    xdigit: 'A-Fa-f0-9'
+  };
+
+  var constants$3 = {
+    MAX_LENGTH: 1024 * 64,
+    POSIX_REGEX_SOURCE: POSIX_REGEX_SOURCE$1,
+
+    // regular expressions
+    REGEX_BACKSLASH: /\\(?![*+?^${}(|)[\]])/g,
+    REGEX_NON_SPECIAL_CHARS: /^[^@![\].,$*+?^{}()|\\/]+/,
+    REGEX_SPECIAL_CHARS: /[-*+?.^${}(|)[\]]/,
+    REGEX_SPECIAL_CHARS_BACKREF: /(\\?)((\W)(\3*))/g,
+    REGEX_SPECIAL_CHARS_GLOBAL: /([-*+?.^${}(|)[\]])/g,
+    REGEX_REMOVE_BACKSLASH: /(?:\[.*?[^\\]\]|\\(?=.))/g,
+
+    // Replace globs with equivalent patterns to reduce parsing time.
+    REPLACEMENTS: {
+      '***': '*',
+      '**/**': '**',
+      '**/**/**': '**'
+    },
+
+    // Digits
+    CHAR_0: 48, /* 0 */
+    CHAR_9: 57, /* 9 */
+
+    // Alphabet chars.
+    CHAR_UPPERCASE_A: 65, /* A */
+    CHAR_LOWERCASE_A: 97, /* a */
+    CHAR_UPPERCASE_Z: 90, /* Z */
+    CHAR_LOWERCASE_Z: 122, /* z */
+
+    CHAR_LEFT_PARENTHESES: 40, /* ( */
+    CHAR_RIGHT_PARENTHESES: 41, /* ) */
+
+    CHAR_ASTERISK: 42, /* * */
+
+    // Non-alphabetic chars.
+    CHAR_AMPERSAND: 38, /* & */
+    CHAR_AT: 64, /* @ */
+    CHAR_BACKWARD_SLASH: 92, /* \ */
+    CHAR_CARRIAGE_RETURN: 13, /* \r */
+    CHAR_CIRCUMFLEX_ACCENT: 94, /* ^ */
+    CHAR_COLON: 58, /* : */
+    CHAR_COMMA: 44, /* , */
+    CHAR_DOT: 46, /* . */
+    CHAR_DOUBLE_QUOTE: 34, /* " */
+    CHAR_EQUAL: 61, /* = */
+    CHAR_EXCLAMATION_MARK: 33, /* ! */
+    CHAR_FORM_FEED: 12, /* \f */
+    CHAR_FORWARD_SLASH: 47, /* / */
+    CHAR_GRAVE_ACCENT: 96, /* ` */
+    CHAR_HASH: 35, /* # */
+    CHAR_HYPHEN_MINUS: 45, /* - */
+    CHAR_LEFT_ANGLE_BRACKET: 60, /* < */
+    CHAR_LEFT_CURLY_BRACE: 123, /* { */
+    CHAR_LEFT_SQUARE_BRACKET: 91, /* [ */
+    CHAR_LINE_FEED: 10, /* \n */
+    CHAR_NO_BREAK_SPACE: 160, /* \u00A0 */
+    CHAR_PERCENT: 37, /* % */
+    CHAR_PLUS: 43, /* + */
+    CHAR_QUESTION_MARK: 63, /* ? */
+    CHAR_RIGHT_ANGLE_BRACKET: 62, /* > */
+    CHAR_RIGHT_CURLY_BRACE: 125, /* } */
+    CHAR_RIGHT_SQUARE_BRACKET: 93, /* ] */
+    CHAR_SEMICOLON: 59, /* ; */
+    CHAR_SINGLE_QUOTE: 39, /* ' */
+    CHAR_SPACE: 32, /*   */
+    CHAR_TAB: 9, /* \t */
+    CHAR_UNDERSCORE: 95, /* _ */
+    CHAR_VERTICAL_LINE: 124, /* | */
+    CHAR_ZERO_WIDTH_NOBREAK_SPACE: 65279, /* \uFEFF */
+
+    /**
+     * Create EXTGLOB_CHARS
+     */
+
+    extglobChars(chars) {
+      return {
+        '!': { type: 'negate', open: '(?:(?!(?:', close: `))${chars.STAR})` },
+        '?': { type: 'qmark', open: '(?:', close: ')?' },
+        '+': { type: 'plus', open: '(?:', close: ')+' },
+        '*': { type: 'star', open: '(?:', close: ')*' },
+        '@': { type: 'at', open: '(?:', close: ')' }
+      };
+    },
+
+    /**
+     * Create GLOB_CHARS
+     */
+
+    globChars(win32) {
+      return win32 === true ? WINDOWS_CHARS : POSIX_CHARS;
+    }
+  };
+
+  (function (exports) {
+
+  	const {
+  	  REGEX_BACKSLASH,
+  	  REGEX_REMOVE_BACKSLASH,
+  	  REGEX_SPECIAL_CHARS,
+  	  REGEX_SPECIAL_CHARS_GLOBAL
+  	} = constants$3;
+
+  	exports.isObject = val => val !== null && typeof val === 'object' && !Array.isArray(val);
+  	exports.hasRegexChars = str => REGEX_SPECIAL_CHARS.test(str);
+  	exports.isRegexChar = str => str.length === 1 && exports.hasRegexChars(str);
+  	exports.escapeRegex = str => str.replace(REGEX_SPECIAL_CHARS_GLOBAL, '\\$1');
+  	exports.toPosixSlashes = str => str.replace(REGEX_BACKSLASH, '/');
+
+  	exports.removeBackslashes = str => {
+  	  return str.replace(REGEX_REMOVE_BACKSLASH, match => {
+  	    return match === '\\' ? '' : match;
+  	  });
+  	};
+
+  	exports.supportsLookbehinds = () => {
+  	  const segs = process.version.slice(1).split('.').map(Number);
+  	  if (segs.length === 3 && segs[0] >= 9 || (segs[0] === 8 && segs[1] >= 10)) {
+  	    return true;
+  	  }
+  	  return false;
+  	};
+
+  	exports.escapeLast = (input, char, lastIdx) => {
+  	  const idx = input.lastIndexOf(char, lastIdx);
+  	  if (idx === -1) return input;
+  	  if (input[idx - 1] === '\\') return exports.escapeLast(input, char, idx - 1);
+  	  return `${input.slice(0, idx)}\\${input.slice(idx)}`;
+  	};
+
+  	exports.removePrefix = (input, state = {}) => {
+  	  let output = input;
+  	  if (output.startsWith('./')) {
+  	    output = output.slice(2);
+  	    state.prefix = './';
+  	  }
+  	  return output;
+  	};
+
+  	exports.wrapOutput = (input, state = {}, options = {}) => {
+  	  const prepend = options.contains ? '' : '^';
+  	  const append = options.contains ? '' : '$';
+
+  	  let output = `${prepend}(?:${input})${append}`;
+  	  if (state.negated === true) {
+  	    output = `(?:^(?!${output}).*$)`;
+  	  }
+  	  return output;
+  	};
+
+  	exports.basename = (path, { windows } = {}) => {
+  	  if (windows) {
+  	    return path.replace(/[\\/]$/, '').replace(/.*[\\/]/, '');
+  	  } else {
+  	    return path.replace(/\/$/, '').replace(/.*\//, '');
+  	  }
+  	}; 
+  } (utils$3));
+
+  const utils$2 = utils$3;
+  const {
+    CHAR_ASTERISK,             /* * */
+    CHAR_AT,                   /* @ */
+    CHAR_BACKWARD_SLASH,       /* \ */
+    CHAR_COMMA,                /* , */
+    CHAR_DOT,                  /* . */
+    CHAR_EXCLAMATION_MARK,     /* ! */
+    CHAR_FORWARD_SLASH,        /* / */
+    CHAR_LEFT_CURLY_BRACE,     /* { */
+    CHAR_LEFT_PARENTHESES,     /* ( */
+    CHAR_LEFT_SQUARE_BRACKET,  /* [ */
+    CHAR_PLUS,                 /* + */
+    CHAR_QUESTION_MARK,        /* ? */
+    CHAR_RIGHT_CURLY_BRACE,    /* } */
+    CHAR_RIGHT_PARENTHESES,    /* ) */
+    CHAR_RIGHT_SQUARE_BRACKET  /* ] */
+  } = constants$3;
+
+  const isPathSeparator = code => {
+    return code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;
+  };
+
+  const depth = token => {
+    if (token.isPrefix !== true) {
+      token.depth = token.isGlobstar ? Infinity : 1;
+    }
+  };
+
+  /**
+   * Quickly scans a glob pattern and returns an object with a handful of
+   * useful properties, like `isGlob`, `path` (the leading non-glob, if it exists),
+   * `glob` (the actual pattern), and `negated` (true if the path starts with `!`).
+   *
+   * ```js
+   * const pm = require('picomatch');
+   * console.log(pm.scan('foo/bar/*.js'));
+   * { isGlob: true, input: 'foo/bar/*.js', base: 'foo/bar', glob: '*.js' }
+   * ```
+   * @param {String} `str`
+   * @param {Object} `options`
+   * @return {Object} Returns an object with tokens and regex source string.
+   * @api public
+   */
+
+  const scan$1 = (input, options) => {
+    const opts = options || {};
+
+    const length = input.length - 1;
+    const scanToEnd = opts.parts === true || opts.scanToEnd === true;
+    const slashes = [];
+    const tokens = [];
+    const parts = [];
+
+    let str = input;
+    let index = -1;
+    let start = 0;
+    let lastIndex = 0;
+    let isBrace = false;
+    let isBracket = false;
+    let isGlob = false;
+    let isExtglob = false;
+    let isGlobstar = false;
+    let braceEscaped = false;
+    let backslashes = false;
+    let negated = false;
+    let finished = false;
+    let braces = 0;
+    let prev;
+    let code;
+    let token = { value: '', depth: 0, isGlob: false };
+
+    const eos = () => index >= length;
+    const peek = () => str.charCodeAt(index + 1);
+    const advance = () => {
+      prev = code;
+      return str.charCodeAt(++index);
+    };
+
+    while (index < length) {
+      code = advance();
+      let next;
+
+      if (code === CHAR_BACKWARD_SLASH) {
+        backslashes = token.backslashes = true;
+        code = advance();
+
+        if (code === CHAR_LEFT_CURLY_BRACE) {
+          braceEscaped = true;
+        }
+        continue;
+      }
+
+      if (braceEscaped === true || code === CHAR_LEFT_CURLY_BRACE) {
+        braces++;
+
+        while (eos() !== true && (code = advance())) {
+          if (code === CHAR_BACKWARD_SLASH) {
+            backslashes = token.backslashes = true;
+            advance();
+            continue;
+          }
+
+          if (code === CHAR_LEFT_CURLY_BRACE) {
+            braces++;
+            continue;
+          }
+
+          if (braceEscaped !== true && code === CHAR_DOT && (code = advance()) === CHAR_DOT) {
+            isBrace = token.isBrace = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+
+            break;
+          }
+
+          if (braceEscaped !== true && code === CHAR_COMMA) {
+            isBrace = token.isBrace = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+
+            break;
+          }
+
+          if (code === CHAR_RIGHT_CURLY_BRACE) {
+            braces--;
+
+            if (braces === 0) {
+              braceEscaped = false;
+              isBrace = token.isBrace = true;
+              finished = true;
+              break;
+            }
+          }
+        }
+
+        if (scanToEnd === true) {
+          continue;
+        }
+
+        break;
+      }
+
+      if (code === CHAR_FORWARD_SLASH) {
+        slashes.push(index);
+        tokens.push(token);
+        token = { value: '', depth: 0, isGlob: false };
+
+        if (finished === true) continue;
+        if (prev === CHAR_DOT && index === (start + 1)) {
+          start += 2;
+          continue;
+        }
+
+        lastIndex = index + 1;
+        continue;
+      }
+
+      if (opts.noext !== true) {
+        const isExtglobChar = code === CHAR_PLUS
+          || code === CHAR_AT
+          || code === CHAR_ASTERISK
+          || code === CHAR_QUESTION_MARK
+          || code === CHAR_EXCLAMATION_MARK;
+
+        if (isExtglobChar === true && peek() === CHAR_LEFT_PARENTHESES) {
+          isGlob = token.isGlob = true;
+          isExtglob = token.isExtglob = true;
+          finished = true;
+
+          if (scanToEnd === true) {
+            while (eos() !== true && (code = advance())) {
+              if (code === CHAR_BACKWARD_SLASH) {
+                backslashes = token.backslashes = true;
+                code = advance();
+                continue;
+              }
+
+              if (code === CHAR_RIGHT_PARENTHESES) {
+                isGlob = token.isGlob = true;
+                finished = true;
+                break;
+              }
+            }
+            continue;
+          }
+          break;
+        }
+      }
+
+      if (code === CHAR_ASTERISK) {
+        if (prev === CHAR_ASTERISK) isGlobstar = token.isGlobstar = true;
+        isGlob = token.isGlob = true;
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+        break;
+      }
+
+      if (code === CHAR_QUESTION_MARK) {
+        isGlob = token.isGlob = true;
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+        break;
+      }
+
+      if (code === CHAR_LEFT_SQUARE_BRACKET) {
+        while (eos() !== true && (next = advance())) {
+          if (next === CHAR_BACKWARD_SLASH) {
+            backslashes = token.backslashes = true;
+            advance();
+            continue;
+          }
+
+          if (next === CHAR_RIGHT_SQUARE_BRACKET) {
+            isBracket = token.isBracket = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+            break;
+          }
+        }
+      }
+
+      if (opts.nonegate !== true && code === CHAR_EXCLAMATION_MARK && index === start) {
+        negated = token.negated = true;
+        start++;
+        continue;
+      }
+
+      if (opts.noparen !== true && code === CHAR_LEFT_PARENTHESES) {
+        isGlob = token.isGlob = true;
+
+        if (scanToEnd === true) {
+          while (eos() !== true && (code = advance())) {
+            if (code === CHAR_LEFT_PARENTHESES) {
+              backslashes = token.backslashes = true;
+              code = advance();
+              continue;
+            }
+
+            if (code === CHAR_RIGHT_PARENTHESES) {
+              finished = true;
+              break;
+            }
+          }
+          continue;
+        }
+        break;
+      }
+
+      if (isGlob === true) {
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+
+        break;
+      }
+    }
+
+    if (opts.noext === true) {
+      isExtglob = false;
+      isGlob = false;
+    }
+
+    let base = str;
+    let prefix = '';
+    let glob = '';
+
+    if (start > 0) {
+      prefix = str.slice(0, start);
+      str = str.slice(start);
+      lastIndex -= start;
+    }
+
+    if (base && isGlob === true && lastIndex > 0) {
+      base = str.slice(0, lastIndex);
+      glob = str.slice(lastIndex);
+    } else if (isGlob === true) {
+      base = '';
+      glob = str;
+    } else {
+      base = str;
+    }
+
+    if (base && base !== '' && base !== '/' && base !== str) {
+      if (isPathSeparator(base.charCodeAt(base.length - 1))) {
+        base = base.slice(0, -1);
+      }
+    }
+
+    if (opts.unescape === true) {
+      if (glob) glob = utils$2.removeBackslashes(glob);
+
+      if (base && backslashes === true) {
+        base = utils$2.removeBackslashes(base);
+      }
+    }
+
+    const state = {
+      prefix,
+      input,
+      start,
+      base,
+      glob,
+      isBrace,
+      isBracket,
+      isGlob,
+      isExtglob,
+      isGlobstar,
+      negated
+    };
+
+    if (opts.tokens === true) {
+      state.maxDepth = 0;
+      if (!isPathSeparator(code)) {
+        tokens.push(token);
+      }
+      state.tokens = tokens;
+    }
+
+    if (opts.parts === true || opts.tokens === true) {
+      let prevIndex;
+
+      for (let idx = 0; idx < slashes.length; idx++) {
+        const n = prevIndex ? prevIndex + 1 : start;
+        const i = slashes[idx];
+        const value = input.slice(n, i);
+        if (opts.tokens) {
+          if (idx === 0 && start !== 0) {
+            tokens[idx].isPrefix = true;
+            tokens[idx].value = prefix;
+          } else {
+            tokens[idx].value = value;
+          }
+          depth(tokens[idx]);
+          state.maxDepth += tokens[idx].depth;
+        }
+        if (idx !== 0 || value !== '') {
+          parts.push(value);
+        }
+        prevIndex = i;
+      }
+
+      if (prevIndex && prevIndex + 1 < input.length) {
+        const value = input.slice(prevIndex + 1);
+        parts.push(value);
+
+        if (opts.tokens) {
+          tokens[tokens.length - 1].value = value;
+          depth(tokens[tokens.length - 1]);
+          state.maxDepth += tokens[tokens.length - 1].depth;
+        }
+      }
+
+      state.slashes = slashes;
+      state.parts = parts;
+    }
+
+    return state;
+  };
+
+  var scan_1 = scan$1;
+
+  const constants$2 = constants$3;
+  const utils$1 = utils$3;
+
+  /**
+   * Constants
+   */
+
+  const {
+    MAX_LENGTH,
+    POSIX_REGEX_SOURCE,
+    REGEX_NON_SPECIAL_CHARS,
+    REGEX_SPECIAL_CHARS_BACKREF,
+    REPLACEMENTS
+  } = constants$2;
+
+  /**
+   * Helpers
+   */
+
+  const expandRange = (args, options) => {
+    if (typeof options.expandRange === 'function') {
+      return options.expandRange(...args, options);
+    }
+
+    args.sort();
+    const value = `[${args.join('-')}]`;
+
+    try {
+      /* eslint-disable-next-line no-new */
+      new RegExp(value);
+    } catch (ex) {
+      return args.map(v => utils$1.escapeRegex(v)).join('..');
+    }
+
+    return value;
+  };
+
+  /**
+   * Create the message for a syntax error
+   */
+
+  const syntaxError = (type, char) => {
+    return `Missing ${type}: "${char}" - use "\\\\${char}" to match literal characters`;
+  };
+
+  /**
+   * Parse the given input string.
+   * @param {String} input
+   * @param {Object} options
+   * @return {Object}
+   */
+
+  const parse$2 = (input, options) => {
+    if (typeof input !== 'string') {
+      throw new TypeError('Expected a string');
+    }
+
+    input = REPLACEMENTS[input] || input;
+
+    const opts = { ...options };
+    const max = typeof opts.maxLength === 'number' ? Math.min(MAX_LENGTH, opts.maxLength) : MAX_LENGTH;
+
+    let len = input.length;
+    if (len > max) {
+      throw new SyntaxError(`Input length: ${len}, exceeds maximum allowed length: ${max}`);
+    }
+
+    const bos = { type: 'bos', value: '', output: opts.prepend || '' };
+    const tokens = [bos];
+
+    const capture = opts.capture ? '' : '?:';
+
+    // create constants based on platform, for windows or posix
+    const PLATFORM_CHARS = constants$2.globChars(opts.windows);
+    const EXTGLOB_CHARS = constants$2.extglobChars(PLATFORM_CHARS);
+
+    const {
+      DOT_LITERAL,
+      PLUS_LITERAL,
+      SLASH_LITERAL,
+      ONE_CHAR,
+      DOTS_SLASH,
+      NO_DOT,
+      NO_DOT_SLASH,
+      NO_DOTS_SLASH,
+      QMARK,
+      QMARK_NO_DOT,
+      STAR,
+      START_ANCHOR
+    } = PLATFORM_CHARS;
+
+    const globstar = (opts) => {
+      return `(${capture}(?:(?!${START_ANCHOR}${opts.dot ? DOTS_SLASH : DOT_LITERAL}).)*?)`;
+    };
+
+    const nodot = opts.dot ? '' : NO_DOT;
+    const qmarkNoDot = opts.dot ? QMARK : QMARK_NO_DOT;
+    let star = opts.bash === true ? globstar(opts) : STAR;
+
+    if (opts.capture) {
+      star = `(${star})`;
+    }
+
+    // minimatch options support
+    if (typeof opts.noext === 'boolean') {
+      opts.noextglob = opts.noext;
+    }
+
+    const state = {
+      input,
+      index: -1,
+      start: 0,
+      dot: opts.dot === true,
+      consumed: '',
+      output: '',
+      prefix: '',
+      backtrack: false,
+      negated: false,
+      brackets: 0,
+      braces: 0,
+      parens: 0,
+      quotes: 0,
+      globstar: false,
+      tokens
+    };
+
+    input = utils$1.removePrefix(input, state);
+    len = input.length;
+
+    const extglobs = [];
+    const braces = [];
+    const stack = [];
+    let prev = bos;
+    let value;
+
+    /**
+     * Tokenizing helpers
+     */
+
+    const eos = () => state.index === len - 1;
+    const peek = state.peek = (n = 1) => input[state.index + n];
+    const advance = state.advance = () => input[++state.index];
+    const remaining = () => input.slice(state.index + 1);
+    const consume = (value = '', num = 0) => {
+      state.consumed += value;
+      state.index += num;
+    };
+    const append = token => {
+      state.output += token.output != null ? token.output : token.value;
+      consume(token.value);
+    };
+
+    const negate = () => {
+      let count = 1;
+
+      while (peek() === '!' && (peek(2) !== '(' || peek(3) === '?')) {
+        advance();
+        state.start++;
+        count++;
+      }
+
+      if (count % 2 === 0) {
+        return false;
+      }
+
+      state.negated = true;
+      state.start++;
+      return true;
+    };
+
+    const increment = type => {
+      state[type]++;
+      stack.push(type);
+    };
+
+    const decrement = type => {
+      state[type]--;
+      stack.pop();
+    };
+
+    /**
+     * Push tokens onto the tokens array. This helper speeds up
+     * tokenizing by 1) helping us avoid backtracking as much as possible,
+     * and 2) helping us avoid creating extra tokens when consecutive
+     * characters are plain text. This improves performance and simplifies
+     * lookbehinds.
+     */
+
+    const push = tok => {
+      if (prev.type === 'globstar') {
+        const isBrace = state.braces > 0 && (tok.type === 'comma' || tok.type === 'brace');
+        const isExtglob = tok.extglob === true || (extglobs.length && (tok.type === 'pipe' || tok.type === 'paren'));
+
+        if (tok.type !== 'slash' && tok.type !== 'paren' && !isBrace && !isExtglob) {
+          state.output = state.output.slice(0, -prev.output.length);
+          prev.type = 'star';
+          prev.value = '*';
+          prev.output = star;
+          state.output += prev.output;
+        }
+      }
+
+      if (extglobs.length && tok.type !== 'paren' && !EXTGLOB_CHARS[tok.value]) {
+        extglobs[extglobs.length - 1].inner += tok.value;
+      }
+
+      if (tok.value || tok.output) append(tok);
+      if (prev && prev.type === 'text' && tok.type === 'text') {
+        prev.value += tok.value;
+        prev.output = (prev.output || '') + tok.value;
+        return;
+      }
+
+      tok.prev = prev;
+      tokens.push(tok);
+      prev = tok;
+    };
+
+    const extglobOpen = (type, value) => {
+      const token = { ...EXTGLOB_CHARS[value], conditions: 1, inner: '' };
+
+      token.prev = prev;
+      token.parens = state.parens;
+      token.output = state.output;
+      const output = (opts.capture ? '(' : '') + token.open;
+
+      increment('parens');
+      push({ type, value, output: state.output ? '' : ONE_CHAR });
+      push({ type: 'paren', extglob: true, value: advance(), output });
+      extglobs.push(token);
+    };
+
+    const extglobClose = token => {
+      let output = token.close + (opts.capture ? ')' : '');
+
+      if (token.type === 'negate') {
+        let extglobStar = star;
+
+        if (token.inner && token.inner.length > 1 && token.inner.includes('/')) {
+          extglobStar = globstar(opts);
+        }
+
+        if (extglobStar !== star || eos() || /^\)+$/.test(remaining())) {
+          output = token.close = `)$))${extglobStar}`;
+        }
+
+        if (token.prev.type === 'bos' && eos()) {
+          state.negatedExtglob = true;
+        }
+      }
+
+      push({ type: 'paren', extglob: true, value, output });
+      decrement('parens');
+    };
+
+    /**
+     * Fast paths
+     */
+
+    if (opts.fastpaths !== false && !/(^[*!]|[/()[\]{}"])/.test(input)) {
+      let backslashes = false;
+
+      let output = input.replace(REGEX_SPECIAL_CHARS_BACKREF, (m, esc, chars, first, rest, index) => {
+        if (first === '\\') {
+          backslashes = true;
+          return m;
+        }
+
+        if (first === '?') {
+          if (esc) {
+            return esc + first + (rest ? QMARK.repeat(rest.length) : '');
+          }
+          if (index === 0) {
+            return qmarkNoDot + (rest ? QMARK.repeat(rest.length) : '');
+          }
+          return QMARK.repeat(chars.length);
+        }
+
+        if (first === '.') {
+          return DOT_LITERAL.repeat(chars.length);
+        }
+
+        if (first === '*') {
+          if (esc) {
+            return esc + first + (rest ? star : '');
+          }
+          return star;
+        }
+        return esc ? m : `\\${m}`;
+      });
+
+      if (backslashes === true) {
+        if (opts.unescape === true) {
+          output = output.replace(/\\/g, '');
+        } else {
+          output = output.replace(/\\+/g, m => {
+            return m.length % 2 === 0 ? '\\\\' : (m ? '\\' : '');
+          });
+        }
+      }
+
+      if (output === input && opts.contains === true) {
+        state.output = input;
+        return state;
+      }
+
+      state.output = utils$1.wrapOutput(output, state, options);
+      return state;
+    }
+
+    /**
+     * Tokenize input until we reach end-of-string
+     */
+
+    while (!eos()) {
+      value = advance();
+
+      if (value === '\u0000') {
+        continue;
+      }
+
+      /**
+       * Escaped characters
+       */
+
+      if (value === '\\') {
+        const next = peek();
+
+        if (next === '/' && opts.bash !== true) {
+          continue;
+        }
+
+        if (next === '.' || next === ';') {
+          continue;
+        }
+
+        if (!next) {
+          value += '\\';
+          push({ type: 'text', value });
+          continue;
+        }
+
+        // collapse slashes to reduce potential for exploits
+        const match = /^\\+/.exec(remaining());
+        let slashes = 0;
+
+        if (match && match[0].length > 2) {
+          slashes = match[0].length;
+          state.index += slashes;
+          if (slashes % 2 !== 0) {
+            value += '\\';
+          }
+        }
+
+        if (opts.unescape === true) {
+          value = advance() || '';
+        } else {
+          value += advance() || '';
+        }
+
+        if (state.brackets === 0) {
+          push({ type: 'text', value });
+          continue;
+        }
+      }
+
+      /**
+       * If we're inside a regex character class, continue
+       * until we reach the closing bracket.
+       */
+
+      if (state.brackets > 0 && (value !== ']' || prev.value === '[' || prev.value === '[^')) {
+        if (opts.posix !== false && value === ':') {
+          const inner = prev.value.slice(1);
+          if (inner.includes('[')) {
+            prev.posix = true;
+
+            if (inner.includes(':')) {
+              const idx = prev.value.lastIndexOf('[');
+              const pre = prev.value.slice(0, idx);
+              const rest = prev.value.slice(idx + 2);
+              const posix = POSIX_REGEX_SOURCE[rest];
+              if (posix) {
+                prev.value = pre + posix;
+                state.backtrack = true;
+                advance();
+
+                if (!bos.output && tokens.indexOf(prev) === 1) {
+                  bos.output = ONE_CHAR;
+                }
+                continue;
+              }
+            }
+          }
+        }
+
+        if ((value === '[' && peek() !== ':') || (value === '-' && peek() === ']')) {
+          value = `\\${value}`;
+        }
+
+        if (value === ']' && (prev.value === '[' || prev.value === '[^')) {
+          value = `\\${value}`;
+        }
+
+        if (opts.posix === true && value === '!' && prev.value === '[') {
+          value = '^';
+        }
+
+        prev.value += value;
+        append({ value });
+        continue;
+      }
+
+      /**
+       * If we're inside a quoted string, continue
+       * until we reach the closing double quote.
+       */
+
+      if (state.quotes === 1 && value !== '"') {
+        value = utils$1.escapeRegex(value);
+        prev.value += value;
+        append({ value });
+        continue;
+      }
+
+      /**
+       * Double quotes
+       */
+
+      if (value === '"') {
+        state.quotes = state.quotes === 1 ? 0 : 1;
+        if (opts.keepQuotes === true) {
+          push({ type: 'text', value });
+        }
+        continue;
+      }
+
+      /**
+       * Parentheses
+       */
+
+      if (value === '(') {
+        increment('parens');
+        push({ type: 'paren', value });
+        continue;
+      }
+
+      if (value === ')') {
+        if (state.parens === 0 && opts.strictBrackets === true) {
+          throw new SyntaxError(syntaxError('opening', '('));
+        }
+
+        const extglob = extglobs[extglobs.length - 1];
+        if (extglob && state.parens === extglob.parens + 1) {
+          extglobClose(extglobs.pop());
+          continue;
+        }
+
+        push({ type: 'paren', value, output: state.parens ? ')' : '\\)' });
+        decrement('parens');
+        continue;
+      }
+
+      /**
+       * Square brackets
+       */
+
+      if (value === '[') {
+        if (opts.nobracket === true || !remaining().includes(']')) {
+          if (opts.nobracket !== true && opts.strictBrackets === true) {
+            throw new SyntaxError(syntaxError('closing', ']'));
+          }
+
+          value = `\\${value}`;
+        } else {
+          increment('brackets');
+        }
+
+        push({ type: 'bracket', value });
+        continue;
+      }
+
+      if (value === ']') {
+        if (opts.nobracket === true || (prev && prev.type === 'bracket' && prev.value.length === 1)) {
+          push({ type: 'text', value, output: `\\${value}` });
+          continue;
+        }
+
+        if (state.brackets === 0) {
+          if (opts.strictBrackets === true) {
+            throw new SyntaxError(syntaxError('opening', '['));
+          }
+
+          push({ type: 'text', value, output: `\\${value}` });
+          continue;
+        }
+
+        decrement('brackets');
+
+        const prevValue = prev.value.slice(1);
+        if (prev.posix !== true && prevValue[0] === '^' && !prevValue.includes('/')) {
+          value = `/${value}`;
+        }
+
+        prev.value += value;
+        append({ value });
+
+        // when literal brackets are explicitly disabled
+        // assume we should match with a regex character class
+        if (opts.literalBrackets === false || utils$1.hasRegexChars(prevValue)) {
+          continue;
+        }
+
+        const escaped = utils$1.escapeRegex(prev.value);
+        state.output = state.output.slice(0, -prev.value.length);
+
+        // when literal brackets are explicitly enabled
+        // assume we should escape the brackets to match literal characters
+        if (opts.literalBrackets === true) {
+          state.output += escaped;
+          prev.value = escaped;
+          continue;
+        }
+
+        // when the user specifies nothing, try to match both
+        prev.value = `(${capture}${escaped}|${prev.value})`;
+        state.output += prev.value;
+        continue;
+      }
+
+      /**
+       * Braces
+       */
+
+      if (value === '{' && opts.nobrace !== true) {
+        increment('braces');
+
+        const open = {
+          type: 'brace',
+          value,
+          output: '(',
+          outputIndex: state.output.length,
+          tokensIndex: state.tokens.length
+        };
+
+        braces.push(open);
+        push(open);
+        continue;
+      }
+
+      if (value === '}') {
+        const brace = braces[braces.length - 1];
+
+        if (opts.nobrace === true || !brace) {
+          push({ type: 'text', value, output: value });
+          continue;
+        }
+
+        let output = ')';
+
+        if (brace.dots === true) {
+          const arr = tokens.slice();
+          const range = [];
+
+          for (let i = arr.length - 1; i >= 0; i--) {
+            tokens.pop();
+            if (arr[i].type === 'brace') {
+              break;
+            }
+            if (arr[i].type !== 'dots') {
+              range.unshift(arr[i].value);
+            }
+          }
+
+          output = expandRange(range, opts);
+          state.backtrack = true;
+        }
+
+        if (brace.comma !== true && brace.dots !== true) {
+          const out = state.output.slice(0, brace.outputIndex);
+          const toks = state.tokens.slice(brace.tokensIndex);
+          brace.value = brace.output = '\\{';
+          value = output = '\\}';
+          state.output = out;
+          for (const t of toks) {
+            state.output += (t.output || t.value);
+          }
+        }
+
+        push({ type: 'brace', value, output });
+        decrement('braces');
+        braces.pop();
+        continue;
+      }
+
+      /**
+       * Pipes
+       */
+
+      if (value === '|') {
+        if (extglobs.length > 0) {
+          extglobs[extglobs.length - 1].conditions++;
+        }
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Commas
+       */
+
+      if (value === ',') {
+        let output = value;
+
+        const brace = braces[braces.length - 1];
+        if (brace && stack[stack.length - 1] === 'braces') {
+          brace.comma = true;
+          output = '|';
+        }
+
+        push({ type: 'comma', value, output });
+        continue;
+      }
+
+      /**
+       * Slashes
+       */
+
+      if (value === '/') {
+        // if the beginning of the glob is "./", advance the start
+        // to the current index, and don't add the "./" characters
+        // to the state. This greatly simplifies lookbehinds when
+        // checking for BOS characters like "!" and "." (not "./")
+        if (prev.type === 'dot' && state.index === state.start + 1) {
+          state.start = state.index + 1;
+          state.consumed = '';
+          state.output = '';
+          tokens.pop();
+          prev = bos; // reset "prev" to the first token
+          continue;
+        }
+
+        push({ type: 'slash', value, output: SLASH_LITERAL });
+        continue;
+      }
+
+      /**
+       * Dots
+       */
+
+      if (value === '.') {
+        if (state.braces > 0 && prev.type === 'dot') {
+          if (prev.value === '.') prev.output = DOT_LITERAL;
+          const brace = braces[braces.length - 1];
+          prev.type = 'dots';
+          prev.output += value;
+          prev.value += value;
+          brace.dots = true;
+          continue;
+        }
+
+        if ((state.braces + state.parens) === 0 && prev.type !== 'bos' && prev.type !== 'slash') {
+          push({ type: 'text', value, output: DOT_LITERAL });
+          continue;
+        }
+
+        push({ type: 'dot', value, output: DOT_LITERAL });
+        continue;
+      }
+
+      /**
+       * Question marks
+       */
+
+      if (value === '?') {
+        const isGroup = prev && prev.value === '(';
+        if (!isGroup && opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          extglobOpen('qmark', value);
+          continue;
+        }
+
+        if (prev && prev.type === 'paren') {
+          const next = peek();
+          let output = value;
+
+          if (next === '<' && !utils$1.supportsLookbehinds()) {
+            throw new Error('Node.js v10 or higher is required for regex lookbehinds');
+          }
+
+          if ((prev.value === '(' && !/[!=<:]/.test(next)) || (next === '<' && !/<([!=]|\w+>)/.test(remaining()))) {
+            output = `\\${value}`;
+          }
+
+          push({ type: 'text', value, output });
+          continue;
+        }
+
+        if (opts.dot !== true && (prev.type === 'slash' || prev.type === 'bos')) {
+          push({ type: 'qmark', value, output: QMARK_NO_DOT });
+          continue;
+        }
+
+        push({ type: 'qmark', value, output: QMARK });
+        continue;
+      }
+
+      /**
+       * Exclamation
+       */
+
+      if (value === '!') {
+        if (opts.noextglob !== true && peek() === '(') {
+          if (peek(2) !== '?' || !/[!=<:]/.test(peek(3))) {
+            extglobOpen('negate', value);
+            continue;
+          }
+        }
+
+        if (opts.nonegate !== true && state.index === 0) {
+          negate();
+          continue;
+        }
+      }
+
+      /**
+       * Plus
+       */
+
+      if (value === '+') {
+        if (opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          extglobOpen('plus', value);
+          continue;
+        }
+
+        if ((prev && prev.value === '(') || opts.regex === false) {
+          push({ type: 'plus', value, output: PLUS_LITERAL });
+          continue;
+        }
+
+        if ((prev && (prev.type === 'bracket' || prev.type === 'paren' || prev.type === 'brace')) || state.parens > 0) {
+          push({ type: 'plus', value });
+          continue;
+        }
+
+        push({ type: 'plus', value: PLUS_LITERAL });
+        continue;
+      }
+
+      /**
+       * Plain text
+       */
+
+      if (value === '@') {
+        if (opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          push({ type: 'at', extglob: true, value, output: '' });
+          continue;
+        }
+
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Plain text
+       */
+
+      if (value !== '*') {
+        if (value === '$' || value === '^') {
+          value = `\\${value}`;
+        }
+
+        const match = REGEX_NON_SPECIAL_CHARS.exec(remaining());
+        if (match) {
+          value += match[0];
+          state.index += match[0].length;
+        }
+
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Stars
+       */
+
+      if (prev && (prev.type === 'globstar' || prev.star === true)) {
+        prev.type = 'star';
+        prev.star = true;
+        prev.value += value;
+        prev.output = star;
+        state.backtrack = true;
+        state.globstar = true;
+        consume(value);
+        continue;
+      }
+
+      let rest = remaining();
+      if (opts.noextglob !== true && /^\([^?]/.test(rest)) {
+        extglobOpen('star', value);
+        continue;
+      }
+
+      if (prev.type === 'star') {
+        if (opts.noglobstar === true) {
+          consume(value);
+          continue;
+        }
+
+        const prior = prev.prev;
+        const before = prior.prev;
+        const isStart = prior.type === 'slash' || prior.type === 'bos';
+        const afterStar = before && (before.type === 'star' || before.type === 'globstar');
+
+        if (opts.bash === true && (!isStart || (rest[0] && rest[0] !== '/'))) {
+          push({ type: 'star', value, output: '' });
+          continue;
+        }
+
+        const isBrace = state.braces > 0 && (prior.type === 'comma' || prior.type === 'brace');
+        const isExtglob = extglobs.length && (prior.type === 'pipe' || prior.type === 'paren');
+        if (!isStart && prior.type !== 'paren' && !isBrace && !isExtglob) {
+          push({ type: 'star', value, output: '' });
+          continue;
+        }
+
+        // strip consecutive `/**/`
+        while (rest.slice(0, 3) === '/**') {
+          const after = input[state.index + 4];
+          if (after && after !== '/') {
+            break;
+          }
+          rest = rest.slice(3);
+          consume('/**', 3);
+        }
+
+        if (prior.type === 'bos' && eos()) {
+          prev.type = 'globstar';
+          prev.value += value;
+          prev.output = globstar(opts);
+          state.output = prev.output;
+          state.globstar = true;
+          consume(value);
+          continue;
+        }
+
+        if (prior.type === 'slash' && prior.prev.type !== 'bos' && !afterStar && eos()) {
+          state.output = state.output.slice(0, -(prior.output + prev.output).length);
+          prior.output = `(?:${prior.output}`;
+
+          prev.type = 'globstar';
+          prev.output = globstar(opts) + (opts.strictSlashes ? ')' : '|$)');
+          prev.value += value;
+          state.globstar = true;
+          state.output += prior.output + prev.output;
+          consume(value);
+          continue;
+        }
+
+        if (prior.type === 'slash' && prior.prev.type !== 'bos' && rest[0] === '/') {
+          const end = rest[1] !== void 0 ? '|$' : '';
+
+          state.output = state.output.slice(0, -(prior.output + prev.output).length);
+          prior.output = `(?:${prior.output}`;
+
+          prev.type = 'globstar';
+          prev.output = `${globstar(opts)}${SLASH_LITERAL}|${SLASH_LITERAL}${end})`;
+          prev.value += value;
+
+          state.output += prior.output + prev.output;
+          state.globstar = true;
+
+          consume(value + advance());
+
+          push({ type: 'slash', value: '/', output: '' });
+          continue;
+        }
+
+        if (prior.type === 'bos' && rest[0] === '/') {
+          prev.type = 'globstar';
+          prev.value += value;
+          prev.output = `(?:^|${SLASH_LITERAL}|${globstar(opts)}${SLASH_LITERAL})`;
+          state.output = prev.output;
+          state.globstar = true;
+          consume(value + advance());
+          push({ type: 'slash', value: '/', output: '' });
+          continue;
+        }
+
+        // remove single star from output
+        state.output = state.output.slice(0, -prev.output.length);
+
+        // reset previous token to globstar
+        prev.type = 'globstar';
+        prev.output = globstar(opts);
+        prev.value += value;
+
+        // reset output with globstar
+        state.output += prev.output;
+        state.globstar = true;
+        consume(value);
+        continue;
+      }
+
+      const token = { type: 'star', value, output: star };
+
+      if (opts.bash === true) {
+        token.output = '.*?';
+        if (prev.type === 'bos' || prev.type === 'slash') {
+          token.output = nodot + token.output;
+        }
+        push(token);
+        continue;
+      }
+
+      if (prev && (prev.type === 'bracket' || prev.type === 'paren') && opts.regex === true) {
+        token.output = value;
+        push(token);
+        continue;
+      }
+
+      if (state.index === state.start || prev.type === 'slash' || prev.type === 'dot') {
+        if (prev.type === 'dot') {
+          state.output += NO_DOT_SLASH;
+          prev.output += NO_DOT_SLASH;
+
+        } else if (opts.dot === true) {
+          state.output += NO_DOTS_SLASH;
+          prev.output += NO_DOTS_SLASH;
+
+        } else {
+          state.output += nodot;
+          prev.output += nodot;
+        }
+
+        if (peek() !== '*') {
+          state.output += ONE_CHAR;
+          prev.output += ONE_CHAR;
+        }
+      }
+
+      push(token);
+    }
+
+    while (state.brackets > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', ']'));
+      state.output = utils$1.escapeLast(state.output, '[');
+      decrement('brackets');
+    }
+
+    while (state.parens > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', ')'));
+      state.output = utils$1.escapeLast(state.output, '(');
+      decrement('parens');
+    }
+
+    while (state.braces > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', '}'));
+      state.output = utils$1.escapeLast(state.output, '{');
+      decrement('braces');
+    }
+
+    if (opts.strictSlashes !== true && (prev.type === 'star' || prev.type === 'bracket')) {
+      push({ type: 'maybe_slash', value: '', output: `${SLASH_LITERAL}?` });
+    }
+
+    // rebuild the output if we had to backtrack at any point
+    if (state.backtrack === true) {
+      state.output = '';
+
+      for (const token of state.tokens) {
+        state.output += token.output != null ? token.output : token.value;
+
+        if (token.suffix) {
+          state.output += token.suffix;
+        }
+      }
+    }
+
+    return state;
+  };
+
+  /**
+   * Fast paths for creating regular expressions for common glob patterns.
+   * This can significantly speed up processing and has very little downside
+   * impact when none of the fast paths match.
+   */
+
+  parse$2.fastpaths = (input, options) => {
+    const opts = { ...options };
+    const max = typeof opts.maxLength === 'number' ? Math.min(MAX_LENGTH, opts.maxLength) : MAX_LENGTH;
+    const len = input.length;
+    if (len > max) {
+      throw new SyntaxError(`Input length: ${len}, exceeds maximum allowed length: ${max}`);
+    }
+
+    input = REPLACEMENTS[input] || input;
+
+    // create constants based on platform, for windows or posix
+    const {
+      DOT_LITERAL,
+      SLASH_LITERAL,
+      ONE_CHAR,
+      DOTS_SLASH,
+      NO_DOT,
+      NO_DOTS,
+      NO_DOTS_SLASH,
+      STAR,
+      START_ANCHOR
+    } = constants$2.globChars(opts.windows);
+
+    const nodot = opts.dot ? NO_DOTS : NO_DOT;
+    const slashDot = opts.dot ? NO_DOTS_SLASH : NO_DOT;
+    const capture = opts.capture ? '' : '?:';
+    const state = { negated: false, prefix: '' };
+    let star = opts.bash === true ? '.*?' : STAR;
+
+    if (opts.capture) {
+      star = `(${star})`;
+    }
+
+    const globstar = (opts) => {
+      if (opts.noglobstar === true) return star;
+      return `(${capture}(?:(?!${START_ANCHOR}${opts.dot ? DOTS_SLASH : DOT_LITERAL}).)*?)`;
+    };
+
+    const create = str => {
+      switch (str) {
+        case '*':
+          return `${nodot}${ONE_CHAR}${star}`;
+
+        case '.*':
+          return `${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '*.*':
+          return `${nodot}${star}${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '*/*':
+          return `${nodot}${star}${SLASH_LITERAL}${ONE_CHAR}${slashDot}${star}`;
+
+        case '**':
+          return nodot + globstar(opts);
+
+        case '**/*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${slashDot}${ONE_CHAR}${star}`;
+
+        case '**/*.*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${slashDot}${star}${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '**/.*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        default: {
+          const match = /^(.*?)\.(\w+)$/.exec(str);
+          if (!match) return;
+
+          const source = create(match[1]);
+          if (!source) return;
+
+          return source + DOT_LITERAL + match[2];
+        }
+      }
+    };
+
+    const output = utils$1.removePrefix(input, state);
+    let source = create(output);
+
+    if (source && opts.strictSlashes !== true) {
+      source += `${SLASH_LITERAL}?`;
+    }
+
+    return source;
+  };
+
+  var parse_1 = parse$2;
+
+  const scan = scan_1;
+  const parse$1 = parse_1;
+  const utils = utils$3;
+  const constants$1 = constants$3;
+  const isObject = val => val && typeof val === 'object' && !Array.isArray(val);
+
+  /**
+   * Creates a matcher function from one or more glob patterns. The
+   * returned function takes a string to match as its first argument,
+   * and returns true if the string is a match. The returned matcher
+   * function also takes a boolean as the second argument that, when true,
+   * returns an object with additional information.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch(glob[, options]);
+   *
+   * const isMatch = picomatch('*.!(*a)');
+   * console.log(isMatch('a.a')); //=> false
+   * console.log(isMatch('a.b')); //=> true
+   * ```
+   * @name picomatch
+   * @param {String|Array} `globs` One or more glob patterns.
+   * @param {Object=} `options`
+   * @return {Function=} Returns a matcher function.
+   * @api public
+   */
+
+  const picomatch = (glob, options, returnState = false) => {
+    if (Array.isArray(glob)) {
+      const fns = glob.map(input => picomatch(input, options, returnState));
+      const arrayMatcher = str => {
+        for (const isMatch of fns) {
+          const state = isMatch(str);
+          if (state) return state;
+        }
+        return false;
+      };
+      return arrayMatcher;
+    }
+
+    const isState = isObject(glob) && glob.tokens && glob.input;
+
+    if (glob === '' || (typeof glob !== 'string' && !isState)) {
+      throw new TypeError('Expected pattern to be a non-empty string');
+    }
+
+    const opts = options || {};
+    const posix = opts.windows;
+    const regex = isState
+      ? picomatch.compileRe(glob, options)
+      : picomatch.makeRe(glob, options, false, true);
+
+    const state = regex.state;
+    delete regex.state;
+
+    let isIgnored = () => false;
+    if (opts.ignore) {
+      const ignoreOpts = { ...options, ignore: null, onMatch: null, onResult: null };
+      isIgnored = picomatch(opts.ignore, ignoreOpts, returnState);
+    }
+
+    const matcher = (input, returnObject = false) => {
+      const { isMatch, match, output } = picomatch.test(input, regex, options, { glob, posix });
+      const result = { glob, state, regex, posix, input, output, match, isMatch };
+
+      if (typeof opts.onResult === 'function') {
+        opts.onResult(result);
+      }
+
+      if (isMatch === false) {
+        result.isMatch = false;
+        return returnObject ? result : false;
+      }
+
+      if (isIgnored(input)) {
+        if (typeof opts.onIgnore === 'function') {
+          opts.onIgnore(result);
+        }
+        result.isMatch = false;
+        return returnObject ? result : false;
+      }
+
+      if (typeof opts.onMatch === 'function') {
+        opts.onMatch(result);
+      }
+      return returnObject ? result : true;
+    };
+
+    if (returnState) {
+      matcher.state = state;
+    }
+
+    return matcher;
+  };
+
+  /**
+   * Test `input` with the given `regex`. This is used by the main
+   * `picomatch()` function to test the input string.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.test(input, regex[, options]);
+   *
+   * console.log(picomatch.test('foo/bar', /^(?:([^/]*?)\/([^/]*?))$/));
+   * // { isMatch: true, match: [ 'foo/', 'foo', 'bar' ], output: 'foo/bar' }
+   * ```
+   * @param {String} `input` String to test.
+   * @param {RegExp} `regex`
+   * @return {Object} Returns an object with matching info.
+   * @api public
+   */
+
+  picomatch.test = (input, regex, options, { glob, posix } = {}) => {
+    if (typeof input !== 'string') {
+      throw new TypeError('Expected input to be a string');
+    }
+
+    if (input === '') {
+      return { isMatch: false, output: '' };
+    }
+
+    const opts = options || {};
+    const format = opts.format || (posix ? utils.toPosixSlashes : null);
+    let match = input === glob;
+    let output = (match && format) ? format(input) : input;
+
+    if (match === false) {
+      output = format ? format(input) : input;
+      match = output === glob;
+    }
+
+    if (match === false || opts.capture === true) {
+      if (opts.matchBase === true || opts.basename === true) {
+        match = picomatch.matchBase(input, regex, options, posix);
+      } else {
+        match = regex.exec(output);
+      }
+    }
+
+    return { isMatch: Boolean(match), match, output };
+  };
+
+  /**
+   * Match the basename of a filepath.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.matchBase(input, glob[, options]);
+   * console.log(picomatch.matchBase('foo/bar.js', '*.js'); // true
+   * ```
+   * @param {String} `input` String to test.
+   * @param {RegExp|String} `glob` Glob pattern or regex created by [.makeRe](#makeRe).
+   * @return {Boolean}
+   * @api public
+   */
+
+  picomatch.matchBase = (input, glob, options) => {
+    const regex = glob instanceof RegExp ? glob : picomatch.makeRe(glob, options);
+    return regex.test(utils.basename(input));
+  };
+
+  /**
+   * Returns true if **any** of the given glob `patterns` match the specified `string`.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.isMatch(string, patterns[, options]);
+   *
+   * console.log(picomatch.isMatch('a.a', ['b.*', '*.a'])); //=> true
+   * console.log(picomatch.isMatch('a.a', 'b.*')); //=> false
+   * ```
+   * @param {String|Array} str The string to test.
+   * @param {String|Array} patterns One or more glob patterns to use for matching.
+   * @param {Object} [options] See available [options](#options).
+   * @return {Boolean} Returns true if any patterns match `str`
+   * @api public
+   */
+
+  picomatch.isMatch = (str, patterns, options) => picomatch(patterns, options)(str);
+
+  /**
+   * Parse a glob pattern to create the source string for a regular
+   * expression.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * const result = picomatch.parse(pattern[, options]);
+   * ```
+   * @param {String} `pattern`
+   * @param {Object} `options`
+   * @return {Object} Returns an object with useful properties and output to be used as a regex source string.
+   * @api public
+   */
+
+  picomatch.parse = (pattern, options) => {
+    if (Array.isArray(pattern)) return pattern.map(p => picomatch.parse(p, options));
+    return parse$1(pattern, { ...options, fastpaths: false });
+  };
+
+  /**
+   * Scan a glob pattern to separate the pattern into segments.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.scan(input[, options]);
+   *
+   * const result = picomatch.scan('!./foo/*.js');
+   * console.log(result);
+   * { prefix: '!./',
+   *   input: '!./foo/*.js',
+   *   start: 3,
+   *   base: 'foo',
+   *   glob: '*.js',
+   *   isBrace: false,
+   *   isBracket: false,
+   *   isGlob: true,
+   *   isExtglob: false,
+   *   isGlobstar: false,
+   *   negated: true }
+   * ```
+   * @param {String} `input` Glob pattern to scan.
+   * @param {Object} `options`
+   * @return {Object} Returns an object with
+   * @api public
+   */
+
+  picomatch.scan = (input, options) => scan(input, options);
+
+  /**
+   * Create a regular expression from a parsed glob pattern.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * const state = picomatch.parse('*.js');
+   * // picomatch.compileRe(state[, options]);
+   *
+   * console.log(picomatch.compileRe(state));
+   * //=> /^(?:(?!\.)(?=.)[^/]*?\.js)$/
+   * ```
+   * @param {String} `state` The object returned from the `.parse` method.
+   * @param {Object} `options`
+   * @return {RegExp} Returns a regex created from the given pattern.
+   * @api public
+   */
+
+  picomatch.compileRe = (parsed, options, returnOutput = false, returnState = false) => {
+    if (returnOutput === true) {
+      return parsed.output;
+    }
+
+    const opts = options || {};
+    const prepend = opts.contains ? '' : '^';
+    const append = opts.contains ? '' : '$';
+
+    let source = `${prepend}(?:${parsed.output})${append}`;
+    if (parsed && parsed.negated === true) {
+      source = `^(?!${source}).*$`;
+    }
+
+    const regex = picomatch.toRegex(source, options);
+    if (returnState === true) {
+      regex.state = parsed;
+    }
+
+    return regex;
+  };
+
+  picomatch.makeRe = (input, options, returnOutput = false, returnState = false) => {
+    if (!input || typeof input !== 'string') {
+      throw new TypeError('Expected a non-empty string');
+    }
+
+    const opts = options || {};
+    let parsed = { negated: false, fastpaths: true };
+    let prefix = '';
+    let output;
+
+    if (input.startsWith('./')) {
+      input = input.slice(2);
+      prefix = parsed.prefix = './';
+    }
+
+    if (opts.fastpaths !== false && (input[0] === '.' || input[0] === '*')) {
+      output = parse$1.fastpaths(input, options);
+    }
+
+    if (output === undefined) {
+      parsed = parse$1(input, options);
+      parsed.prefix = prefix + (parsed.prefix || '');
+    } else {
+      parsed.output = output;
+    }
+
+    return picomatch.compileRe(parsed, options, returnOutput, returnState);
+  };
+
+  /**
+   * Create a regular expression from the given regex source string.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.toRegex(source[, options]);
+   *
+   * const { output } = picomatch.parse('*.js');
+   * console.log(picomatch.toRegex(output));
+   * //=> /^(?:(?!\.)(?=.)[^/]*?\.js)$/
+   * ```
+   * @param {String} `source` Regular expression source string.
+   * @param {Object} `options`
+   * @return {RegExp}
+   * @api public
+   */
+
+  picomatch.toRegex = (source, options) => {
+    try {
+      const opts = options || {};
+      return new RegExp(source, opts.flags || (opts.nocase ? 'i' : ''));
+    } catch (err) {
+      if (options && options.debug === true) throw err;
+      return /$^/;
+    }
+  };
+
+  /**
+   * Picomatch constants.
+   * @return {Object}
+   */
+
+  picomatch.constants = constants$1;
+
+  /**
+   * Expose "picomatch"
+   */
+
+  var picomatch_1 = picomatch;
+
+  var picomatchBrowser = picomatch_1;
+
+  var pm = /*@__PURE__*/getDefaultExportFromCjs(picomatchBrowser);
+
+  function isArray(arg) {
+      return Array.isArray(arg);
+  }
+  function ensureArray(thing) {
+      if (isArray(thing))
+          return thing;
+      if (thing == null)
+          return [];
+      return [thing];
+  }
+  const globToTest = (glob) => {
+      const pattern = glob;
+      const fn = pm(pattern, { dot: true });
+      return {
+          test: (what) => {
+              const result = fn(what);
+              return result;
+          },
+      };
+  };
+  const testTrue = {
+      test: () => true,
+  };
+  const getMatcher = (filter) => {
+      const bundleTest = "bundle" in filter && filter.bundle != null ? globToTest(filter.bundle) : testTrue;
+      const fileTest = "file" in filter && filter.file != null ? globToTest(filter.file) : testTrue;
+      return { bundleTest, fileTest };
+  };
+  const createFilter = (include, exclude) => {
+      const includeMatchers = ensureArray(include).map(getMatcher);
+      const excludeMatchers = ensureArray(exclude).map(getMatcher);
+      return (bundleId, id) => {
+          for (let i = 0; i < excludeMatchers.length; ++i) {
+              const { bundleTest, fileTest } = excludeMatchers[i];
+              if (bundleTest.test(bundleId) && fileTest.test(id))
+                  return false;
+          }
+          for (let i = 0; i < includeMatchers.length; ++i) {
+              const { bundleTest, fileTest } = includeMatchers[i];
+              if (bundleTest.test(bundleId) && fileTest.test(id))
+                  return true;
+          }
+          return !includeMatchers.length;
+      };
+  };
+
+  const throttleFilter = (callback, limit) => {
+      let waiting = false;
+      return (val) => {
+          if (!waiting) {
+              callback(val);
+              waiting = true;
+              setTimeout(() => {
+                  waiting = false;
+              }, limit);
+          }
+      };
+  };
+  const prepareFilter = (filt) => {
+      if (filt === "")
+          return [];
+      return (filt
+          .split(",")
+          // remove spaces before and after
+          .map((entry) => entry.trim())
+          // unquote "
+          .map((entry) => entry.startsWith('"') && entry.endsWith('"') ? entry.substring(1, entry.length - 1) : entry)
+          // unquote '
+          .map((entry) => entry.startsWith("'") && entry.endsWith("'") ? entry.substring(1, entry.length - 1) : entry)
+          // remove empty strings
+          .filter((entry) => entry)
+          // parse bundle:file
+          .map((entry) => entry.split(":"))
+          // normalize entry just in case
+          .flatMap((entry) => {
+          if (entry.length === 0)
+              return [];
+          let bundle = null;
+          let file = null;
+          if (entry.length === 1 && entry[0]) {
+              file = entry[0];
+              return [{ file, bundle }];
+          }
+          bundle = entry[0] || null;
+          file = entry.slice(1).join(":") || null;
+          return [{ bundle, file }];
+      }));
+  };
+  const useFilter = () => {
+      const [includeFilter, setIncludeFilter] = h("");
+      const [excludeFilter, setExcludeFilter] = h("");
+      const setIncludeFilterTrottled = F(() => throttleFilter(setIncludeFilter, 200), []);
+      const setExcludeFilterTrottled = F(() => throttleFilter(setExcludeFilter, 200), []);
+      const isIncluded = F(() => createFilter(prepareFilter(includeFilter), prepareFilter(excludeFilter)), [includeFilter, excludeFilter]);
+      const getModuleFilterMultiplier = T((bundleId, data) => {
+          return isIncluded(bundleId, data.id) ? 1 : 0;
+      }, [isIncluded]);
+      return {
+          getModuleFilterMultiplier,
+          includeFilter,
+          excludeFilter,
+          setExcludeFilter: setExcludeFilterTrottled,
+          setIncludeFilter: setIncludeFilterTrottled,
+      };
+  };
+
+  function ascending(a, b) {
+    return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
+  }
+
+  function descending(a, b) {
+    return a == null || b == null ? NaN
+      : b < a ? -1
+      : b > a ? 1
+      : b >= a ? 0
+      : NaN;
+  }
+
+  function bisector(f) {
+    let compare1, compare2, delta;
+
+    // If an accessor is specified, promote it to a comparator. In this case we
+    // can test whether the search value is (self-) comparable. We can’t do this
+    // for a comparator (except for specific, known comparators) because we can’t
+    // tell if the comparator is symmetric, and an asymmetric comparator can’t be
+    // used to test whether a single value is comparable.
+    if (f.length !== 2) {
+      compare1 = ascending;
+      compare2 = (d, x) => ascending(f(d), x);
+      delta = (d, x) => f(d) - x;
+    } else {
+      compare1 = f === ascending || f === descending ? f : zero$1;
+      compare2 = f;
+      delta = f;
+    }
+
+    function left(a, x, lo = 0, hi = a.length) {
+      if (lo < hi) {
+        if (compare1(x, x) !== 0) return hi;
+        do {
+          const mid = (lo + hi) >>> 1;
+          if (compare2(a[mid], x) < 0) lo = mid + 1;
+          else hi = mid;
+        } while (lo < hi);
+      }
+      return lo;
+    }
+
+    function right(a, x, lo = 0, hi = a.length) {
+      if (lo < hi) {
+        if (compare1(x, x) !== 0) return hi;
+        do {
+          const mid = (lo + hi) >>> 1;
+          if (compare2(a[mid], x) <= 0) lo = mid + 1;
+          else hi = mid;
+        } while (lo < hi);
+      }
+      return lo;
+    }
+
+    function center(a, x, lo = 0, hi = a.length) {
+      const i = left(a, x, lo, hi - 1);
+      return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;
+    }
+
+    return {left, center, right};
+  }
+
+  function zero$1() {
+    return 0;
+  }
+
+  function number$1(x) {
+    return x === null ? NaN : +x;
+  }
+
+  const ascendingBisect = bisector(ascending);
+  const bisectRight = ascendingBisect.right;
+  bisector(number$1).center;
+  var bisect = bisectRight;
+
+  class InternMap extends Map {
+    constructor(entries, key = keyof) {
+      super();
+      Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});
+      if (entries != null) for (const [key, value] of entries) this.set(key, value);
+    }
+    get(key) {
+      return super.get(intern_get(this, key));
+    }
+    has(key) {
+      return super.has(intern_get(this, key));
+    }
+    set(key, value) {
+      return super.set(intern_set(this, key), value);
+    }
+    delete(key) {
+      return super.delete(intern_delete(this, key));
+    }
+  }
+
+  function intern_get({_intern, _key}, value) {
+    const key = _key(value);
+    return _intern.has(key) ? _intern.get(key) : value;
+  }
+
+  function intern_set({_intern, _key}, value) {
+    const key = _key(value);
+    if (_intern.has(key)) return _intern.get(key);
+    _intern.set(key, value);
+    return value;
+  }
+
+  function intern_delete({_intern, _key}, value) {
+    const key = _key(value);
+    if (_intern.has(key)) {
+      value = _intern.get(key);
+      _intern.delete(key);
+    }
+    return value;
+  }
+
+  function keyof(value) {
+    return value !== null && typeof value === "object" ? value.valueOf() : value;
+  }
+
+  function identity$2(x) {
+    return x;
+  }
+
+  function group(values, ...keys) {
+    return nest(values, identity$2, identity$2, keys);
+  }
+
+  function nest(values, map, reduce, keys) {
+    return (function regroup(values, i) {
+      if (i >= keys.length) return reduce(values);
+      const groups = new InternMap();
+      const keyof = keys[i++];
+      let index = -1;
+      for (const value of values) {
+        const key = keyof(value, ++index, values);
+        const group = groups.get(key);
+        if (group) group.push(value);
+        else groups.set(key, [value]);
+      }
+      for (const [key, values] of groups) {
+        groups.set(key, regroup(values, i));
+      }
+      return map(groups);
+    })(values, 0);
+  }
+
+  const e10 = Math.sqrt(50),
+      e5 = Math.sqrt(10),
+      e2 = Math.sqrt(2);
+
+  function tickSpec(start, stop, count) {
+    const step = (stop - start) / Math.max(0, count),
+        power = Math.floor(Math.log10(step)),
+        error = step / Math.pow(10, power),
+        factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;
+    let i1, i2, inc;
+    if (power < 0) {
+      inc = Math.pow(10, -power) / factor;
+      i1 = Math.round(start * inc);
+      i2 = Math.round(stop * inc);
+      if (i1 / inc < start) ++i1;
+      if (i2 / inc > stop) --i2;
+      inc = -inc;
+    } else {
+      inc = Math.pow(10, power) * factor;
+      i1 = Math.round(start / inc);
+      i2 = Math.round(stop / inc);
+      if (i1 * inc < start) ++i1;
+      if (i2 * inc > stop) --i2;
+    }
+    if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);
+    return [i1, i2, inc];
+  }
+
+  function ticks(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    if (!(count > 0)) return [];
+    if (start === stop) return [start];
+    const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);
+    if (!(i2 >= i1)) return [];
+    const n = i2 - i1 + 1, ticks = new Array(n);
+    if (reverse) {
+      if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;
+      else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;
+    } else {
+      if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;
+      else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;
+    }
+    return ticks;
+  }
+
+  function tickIncrement(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    return tickSpec(start, stop, count)[2];
+  }
+
+  function tickStep(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);
+    return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);
+  }
+
+  const TOP_PADDING = 20;
+  const PADDING = 2;
+
+  const Node = ({ node, onMouseOver, onClick, selected }) => {
+      const { getModuleColor } = q(StaticContext);
+      const { backgroundColor, fontColor } = getModuleColor(node);
+      const { x0, x1, y1, y0, data, children = null } = node;
+      const textRef = _(null);
+      const textRectRef = _();
+      const width = x1 - x0;
+      const height = y1 - y0;
+      const textProps = {
+          "font-size": "0.7em",
+          "dominant-baseline": "middle",
+          "text-anchor": "middle",
+          x: width / 2,
+      };
+      if (children != null) {
+          textProps.y = (TOP_PADDING + PADDING) / 2;
+      }
+      else {
+          textProps.y = height / 2;
+      }
+      y(() => {
+          if (width == 0 || height == 0 || !textRef.current) {
+              return;
+          }
+          if (textRectRef.current == null) {
+              textRectRef.current = textRef.current.getBoundingClientRect();
+          }
+          let scale = 1;
+          if (children != null) {
+              scale = Math.min((width * 0.9) / textRectRef.current.width, Math.min(height, TOP_PADDING + PADDING) / textRectRef.current.height);
+              scale = Math.min(1, scale);
+              textRef.current.setAttribute("y", String(Math.min(TOP_PADDING + PADDING, height) / 2 / scale));
+              textRef.current.setAttribute("x", String(width / 2 / scale));
+          }
+          else {
+              scale = Math.min((width * 0.9) / textRectRef.current.width, (height * 0.9) / textRectRef.current.height);
+              scale = Math.min(1, scale);
+              textRef.current.setAttribute("y", String(height / 2 / scale));
+              textRef.current.setAttribute("x", String(width / 2 / scale));
+          }
+          textRef.current.setAttribute("transform", `scale(${scale.toFixed(2)})`);
+      }, [children, height, width]);
+      if (width == 0 || height == 0) {
+          return null;
+      }
+      return (u$1("g", { className: "node", transform: `translate(${x0},${y0})`, onClick: (event) => {
+              event.stopPropagation();
+              onClick(node);
+          }, onMouseOver: (event) => {
+              event.stopPropagation();
+              onMouseOver(node);
+          }, children: [u$1("rect", { fill: backgroundColor, rx: 2, ry: 2, width: x1 - x0, height: y1 - y0, stroke: selected ? "#fff" : undefined, "stroke-width": selected ? 2 : undefined }), u$1("text", Object.assign({ ref: textRef, fill: fontColor, onClick: (event) => {
+                      var _a;
+                      if (((_a = window.getSelection()) === null || _a === void 0 ? void 0 : _a.toString()) !== "") {
+                          event.stopPropagation();
+                      }
+                  } }, textProps, { children: data.name }))] }));
+  };
+
+  const TreeMap = ({ root, onNodeHover, selectedNode, onNodeClick, }) => {
+      const { width, height, getModuleIds } = q(StaticContext);
+      console.time("layering");
+      // this will make groups by height
+      const nestedData = F(() => {
+          const nestedDataMap = group(root.descendants(), (d) => d.height);
+          const nestedData = Array.from(nestedDataMap, ([key, values]) => ({
+              key,
+              values,
+          }));
+          nestedData.sort((a, b) => b.key - a.key);
+          return nestedData;
+      }, [root]);
+      console.timeEnd("layering");
+      return (u$1("svg", { xmlns: "http://www.w3.org/2000/svg", viewBox: `0 0 ${width} ${height}`, children: nestedData.map(({ key, values }) => {
+              return (u$1("g", { className: "layer", children: values.map((node) => {
+                      return (u$1(Node, { node: node, onMouseOver: onNodeHover, selected: selectedNode === node, onClick: onNodeClick }, getModuleIds(node.data).nodeUid.id));
+                  }) }, key));
+          }) }));
+  };
+
+  var bytes$1 = {exports: {}};
+
+  /*!
+   * bytes
+   * Copyright(c) 2012-2014 TJ Holowaychuk
+   * Copyright(c) 2015 Jed Watson
+   * MIT Licensed
+   */
+
+  /**
+   * Module exports.
+   * @public
+   */
+
+  bytes$1.exports = bytes;
+  var format_1 = bytes$1.exports.format = format$1;
+  bytes$1.exports.parse = parse;
+
+  /**
+   * Module variables.
+   * @private
+   */
+
+  var formatThousandsRegExp = /\B(?=(\d{3})+(?!\d))/g;
+
+  var formatDecimalsRegExp = /(?:\.0*|(\.[^0]+)0+)$/;
+
+  var map$1 = {
+    b:  1,
+    kb: 1 << 10,
+    mb: 1 << 20,
+    gb: 1 << 30,
+    tb: Math.pow(1024, 4),
+    pb: Math.pow(1024, 5),
+  };
+
+  var parseRegExp = /^((-|\+)?(\d+(?:\.\d+)?)) *(kb|mb|gb|tb|pb)$/i;
+
+  /**
+   * Convert the given value in bytes into a string or parse to string to an integer in bytes.
+   *
+   * @param {string|number} value
+   * @param {{
+   *  case: [string],
+   *  decimalPlaces: [number]
+   *  fixedDecimals: [boolean]
+   *  thousandsSeparator: [string]
+   *  unitSeparator: [string]
+   *  }} [options] bytes options.
+   *
+   * @returns {string|number|null}
+   */
+
+  function bytes(value, options) {
+    if (typeof value === 'string') {
+      return parse(value);
+    }
+
+    if (typeof value === 'number') {
+      return format$1(value, options);
+    }
+
+    return null;
+  }
+
+  /**
+   * Format the given value in bytes into a string.
+   *
+   * If the value is negative, it is kept as such. If it is a float,
+   * it is rounded.
+   *
+   * @param {number} value
+   * @param {object} [options]
+   * @param {number} [options.decimalPlaces=2]
+   * @param {number} [options.fixedDecimals=false]
+   * @param {string} [options.thousandsSeparator=]
+   * @param {string} [options.unit=]
+   * @param {string} [options.unitSeparator=]
+   *
+   * @returns {string|null}
+   * @public
+   */
+
+  function format$1(value, options) {
+    if (!Number.isFinite(value)) {
+      return null;
+    }
+
+    var mag = Math.abs(value);
+    var thousandsSeparator = (options && options.thousandsSeparator) || '';
+    var unitSeparator = (options && options.unitSeparator) || '';
+    var decimalPlaces = (options && options.decimalPlaces !== undefined) ? options.decimalPlaces : 2;
+    var fixedDecimals = Boolean(options && options.fixedDecimals);
+    var unit = (options && options.unit) || '';
+
+    if (!unit || !map$1[unit.toLowerCase()]) {
+      if (mag >= map$1.pb) {
+        unit = 'PB';
+      } else if (mag >= map$1.tb) {
+        unit = 'TB';
+      } else if (mag >= map$1.gb) {
+        unit = 'GB';
+      } else if (mag >= map$1.mb) {
+        unit = 'MB';
+      } else if (mag >= map$1.kb) {
+        unit = 'KB';
+      } else {
+        unit = 'B';
+      }
+    }
+
+    var val = value / map$1[unit.toLowerCase()];
+    var str = val.toFixed(decimalPlaces);
+
+    if (!fixedDecimals) {
+      str = str.replace(formatDecimalsRegExp, '$1');
+    }
+
+    if (thousandsSeparator) {
+      str = str.split('.').map(function (s, i) {
+        return i === 0
+          ? s.replace(formatThousandsRegExp, thousandsSeparator)
+          : s
+      }).join('.');
+    }
+
+    return str + unitSeparator + unit;
+  }
+
+  /**
+   * Parse the string value into an integer in bytes.
+   *
+   * If no unit is given, it is assumed the value is in bytes.
+   *
+   * @param {number|string} val
+   *
+   * @returns {number|null}
+   * @public
+   */
+
+  function parse(val) {
+    if (typeof val === 'number' && !isNaN(val)) {
+      return val;
+    }
+
+    if (typeof val !== 'string') {
+      return null;
+    }
+
+    // Test if the string passed is valid
+    var results = parseRegExp.exec(val);
+    var floatValue;
+    var unit = 'b';
+
+    if (!results) {
+      // Nothing could be extracted from the given string
+      floatValue = parseInt(val, 10);
+      unit = 'b';
+    } else {
+      // Retrieve the value and the unit
+      floatValue = parseFloat(results[1]);
+      unit = results[4].toLowerCase();
+    }
+
+    if (isNaN(floatValue)) {
+      return null;
+    }
+
+    return Math.floor(map$1[unit] * floatValue);
+  }
+
+  const Tooltip_marginX = 10;
+  const Tooltip_marginY = 30;
+  const SOURCEMAP_RENDERED = (u$1("span", { children: [" ", u$1("b", { children: LABELS.renderedLength }), " is a number of characters in the file after individual and ", u$1("br", {}), " ", "whole bundle transformations according to sourcemap."] }));
+  const RENDRED = (u$1("span", { children: [u$1("b", { children: LABELS.renderedLength }), " is a byte size of individual file after transformations and treeshake."] }));
+  const COMPRESSED = (u$1("span", { children: [u$1("b", { children: LABELS.gzipLength }), " and ", u$1("b", { children: LABELS.brotliLength }), " is a byte size of individual file after individual transformations,", u$1("br", {}), " treeshake and compression."] }));
+  const Tooltip = ({ node, visible, root, sizeProperty, }) => {
+      const { availableSizeProperties, getModuleSize, data } = q(StaticContext);
+      const ref = _(null);
+      const [style, setStyle] = h({});
+      const content = F(() => {
+          if (!node)
+              return null;
+          const mainSize = getModuleSize(node.data, sizeProperty);
+          const percentageNum = (100 * mainSize) / getModuleSize(root.data, sizeProperty);
+          const percentage = percentageNum.toFixed(2);
+          const percentageString = percentage + "%";
+          const path = node
+              .ancestors()
+              .reverse()
+              .map((d) => d.data.name)
+              .join("/");
+          let dataNode = null;
+          if (!isModuleTree(node.data)) {
+              const mainUid = data.nodeParts[node.data.uid].metaUid;
+              dataNode = data.nodeMetas[mainUid];
+          }
+          return (u$1(g$1, { children: [u$1("div", { children: path }), availableSizeProperties.map((sizeProp) => {
+                      if (sizeProp === sizeProperty) {
+                          return (u$1("div", { children: [u$1("b", { children: [LABELS[sizeProp], ": ", format_1(mainSize)] }), " ", "(", percentageString, ")"] }, sizeProp));
+                      }
+                      else {
+                          return (u$1("div", { children: [LABELS[sizeProp], ": ", format_1(getModuleSize(node.data, sizeProp))] }, sizeProp));
+                      }
+                  }), u$1("br", {}), dataNode && dataNode.importedBy.length > 0 && (u$1("div", { children: [u$1("div", { children: [u$1("b", { children: "Imported By" }), ":"] }), dataNode.importedBy.map(({ uid }) => {
+                              const id = data.nodeMetas[uid].id;
+                              return u$1("div", { children: id }, id);
+                          })] })), u$1("br", {}), u$1("small", { children: data.options.sourcemap ? SOURCEMAP_RENDERED : RENDRED }), (data.options.gzip || data.options.brotli) && (u$1(g$1, { children: [u$1("br", {}), u$1("small", { children: COMPRESSED })] }))] }));
+      }, [availableSizeProperties, data, getModuleSize, node, root.data, sizeProperty]);
+      const updatePosition = (mouseCoords) => {
+          if (!ref.current)
+              return;
+          const pos = {
+              left: mouseCoords.x + Tooltip_marginX,
+              top: mouseCoords.y + Tooltip_marginY,
+          };
+          const boundingRect = ref.current.getBoundingClientRect();
+          if (pos.left + boundingRect.width > window.innerWidth) {
+              // Shifting horizontally
+              pos.left = window.innerWidth - boundingRect.width;
+          }
+          if (pos.top + boundingRect.height > window.innerHeight) {
+              // Flipping vertically
+              pos.top = mouseCoords.y - Tooltip_marginY - boundingRect.height;
+          }
+          setStyle(pos);
+      };
+      p(() => {
+          const handleMouseMove = (event) => {
+              updatePosition({
+                  x: event.pageX,
+                  y: event.pageY,
+              });
+          };
+          document.addEventListener("mousemove", handleMouseMove, true);
+          return () => {
+              document.removeEventListener("mousemove", handleMouseMove, true);
+          };
+      }, []);
+      return (u$1("div", { className: `tooltip ${visible ? "" : "tooltip-hidden"}`, ref: ref, style: style, children: content }));
+  };
+
+  const Chart = ({ root, sizeProperty, selectedNode, setSelectedNode, }) => {
+      const [showTooltip, setShowTooltip] = h(false);
+      const [tooltipNode, setTooltipNode] = h(undefined);
+      p(() => {
+          const handleMouseOut = () => {
+              setShowTooltip(false);
+          };
+          document.addEventListener("mouseover", handleMouseOut);
+          return () => {
+              document.removeEventListener("mouseover", handleMouseOut);
+          };
+      }, []);
+      return (u$1(g$1, { children: [u$1(TreeMap, { root: root, onNodeHover: (node) => {
+                      setTooltipNode(node);
+                      setShowTooltip(true);
+                  }, selectedNode: selectedNode, onNodeClick: (node) => {
+                      setSelectedNode(selectedNode === node ? undefined : node);
+                  } }), u$1(Tooltip, { visible: showTooltip, node: tooltipNode, root: root, sizeProperty: sizeProperty })] }));
+  };
+
+  const Main = () => {
+      const { availableSizeProperties, rawHierarchy, getModuleSize, layout, data } = q(StaticContext);
+      const [sizeProperty, setSizeProperty] = h(availableSizeProperties[0]);
+      const [selectedNode, setSelectedNode] = h(undefined);
+      const { getModuleFilterMultiplier, setExcludeFilter, setIncludeFilter } = useFilter();
+      console.time("getNodeSizeMultiplier");
+      const getNodeSizeMultiplier = F(() => {
+          const selectedMultiplier = 1; // selectedSize < rootSize * increaseFactor ? (rootSize * increaseFactor) / selectedSize : rootSize / selectedSize;
+          const nonSelectedMultiplier = 0; // 1 / selectedMultiplier
+          if (selectedNode === undefined) {
+              return () => 1;
+          }
+          else if (isModuleTree(selectedNode.data)) {
+              const leaves = new Set(selectedNode.leaves().map((d) => d.data));
+              return (node) => {
+                  if (leaves.has(node)) {
+                      return selectedMultiplier;
+                  }
+                  return nonSelectedMultiplier;
+              };
+          }
+          else {
+              return (node) => {
+                  if (node === selectedNode.data) {
+                      return selectedMultiplier;
+                  }
+                  return nonSelectedMultiplier;
+              };
+          }
+      }, [getModuleSize, rawHierarchy.data, selectedNode, sizeProperty]);
+      console.timeEnd("getNodeSizeMultiplier");
+      console.time("root hierarchy compute");
+      // root here always be the same as rawHierarchy even after layouting
+      const root = F(() => {
+          const rootWithSizesAndSorted = rawHierarchy
+              .sum((node) => {
+              var _a;
+              if (isModuleTree(node))
+                  return 0;
+              const meta = data.nodeMetas[data.nodeParts[node.uid].metaUid];
+              const bundleId = (_a = Object.entries(meta.moduleParts).find(([bundleId, uid]) => uid == node.uid)) === null || _a === void 0 ? void 0 : _a[0];
+              const ownSize = getModuleSize(node, sizeProperty);
+              const zoomMultiplier = getNodeSizeMultiplier(node);
+              const filterMultiplier = getModuleFilterMultiplier(bundleId, meta);
+              return ownSize * zoomMultiplier * filterMultiplier;
+          })
+              .sort((a, b) => getModuleSize(a.data, sizeProperty) - getModuleSize(b.data, sizeProperty));
+          return layout(rootWithSizesAndSorted);
+      }, [
+          data,
+          getModuleFilterMultiplier,
+          getModuleSize,
+          getNodeSizeMultiplier,
+          layout,
+          rawHierarchy,
+          sizeProperty,
+      ]);
+      console.timeEnd("root hierarchy compute");
+      return (u$1(g$1, { children: [u$1(SideBar, { sizeProperty: sizeProperty, availableSizeProperties: availableSizeProperties, setSizeProperty: setSizeProperty, onExcludeChange: setExcludeFilter, onIncludeChange: setIncludeFilter }), u$1(Chart, { root: root, sizeProperty: sizeProperty, selectedNode: selectedNode, setSelectedNode: setSelectedNode })] }));
+  };
+
+  function initRange(domain, range) {
+    switch (arguments.length) {
+      case 0: break;
+      case 1: this.range(domain); break;
+      default: this.range(range).domain(domain); break;
+    }
+    return this;
+  }
+
+  function initInterpolator(domain, interpolator) {
+    switch (arguments.length) {
+      case 0: break;
+      case 1: {
+        if (typeof domain === "function") this.interpolator(domain);
+        else this.range(domain);
+        break;
+      }
+      default: {
+        this.domain(domain);
+        if (typeof interpolator === "function") this.interpolator(interpolator);
+        else this.range(interpolator);
+        break;
+      }
+    }
+    return this;
+  }
+
+  function define(constructor, factory, prototype) {
+    constructor.prototype = factory.prototype = prototype;
+    prototype.constructor = constructor;
+  }
+
+  function extend(parent, definition) {
+    var prototype = Object.create(parent.prototype);
+    for (var key in definition) prototype[key] = definition[key];
+    return prototype;
+  }
+
+  function Color() {}
+
+  var darker = 0.7;
+  var brighter = 1 / darker;
+
+  var reI = "\\s*([+-]?\\d+)\\s*",
+      reN = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)\\s*",
+      reP = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)%\\s*",
+      reHex = /^#([0-9a-f]{3,8})$/,
+      reRgbInteger = new RegExp(`^rgb\\(${reI},${reI},${reI}\\)$`),
+      reRgbPercent = new RegExp(`^rgb\\(${reP},${reP},${reP}\\)$`),
+      reRgbaInteger = new RegExp(`^rgba\\(${reI},${reI},${reI},${reN}\\)$`),
+      reRgbaPercent = new RegExp(`^rgba\\(${reP},${reP},${reP},${reN}\\)$`),
+      reHslPercent = new RegExp(`^hsl\\(${reN},${reP},${reP}\\)$`),
+      reHslaPercent = new RegExp(`^hsla\\(${reN},${reP},${reP},${reN}\\)$`);
+
+  var named = {
+    aliceblue: 0xf0f8ff,
+    antiquewhite: 0xfaebd7,
+    aqua: 0x00ffff,
+    aquamarine: 0x7fffd4,
+    azure: 0xf0ffff,
+    beige: 0xf5f5dc,
+    bisque: 0xffe4c4,
+    black: 0x000000,
+    blanchedalmond: 0xffebcd,
+    blue: 0x0000ff,
+    blueviolet: 0x8a2be2,
+    brown: 0xa52a2a,
+    burlywood: 0xdeb887,
+    cadetblue: 0x5f9ea0,
+    chartreuse: 0x7fff00,
+    chocolate: 0xd2691e,
+    coral: 0xff7f50,
+    cornflowerblue: 0x6495ed,
+    cornsilk: 0xfff8dc,
+    crimson: 0xdc143c,
+    cyan: 0x00ffff,
+    darkblue: 0x00008b,
+    darkcyan: 0x008b8b,
+    darkgoldenrod: 0xb8860b,
+    darkgray: 0xa9a9a9,
+    darkgreen: 0x006400,
+    darkgrey: 0xa9a9a9,
+    darkkhaki: 0xbdb76b,
+    darkmagenta: 0x8b008b,
+    darkolivegreen: 0x556b2f,
+    darkorange: 0xff8c00,
+    darkorchid: 0x9932cc,
+    darkred: 0x8b0000,
+    darksalmon: 0xe9967a,
+    darkseagreen: 0x8fbc8f,
+    darkslateblue: 0x483d8b,
+    darkslategray: 0x2f4f4f,
+    darkslategrey: 0x2f4f4f,
+    darkturquoise: 0x00ced1,
+    darkviolet: 0x9400d3,
+    deeppink: 0xff1493,
+    deepskyblue: 0x00bfff,
+    dimgray: 0x696969,
+    dimgrey: 0x696969,
+    dodgerblue: 0x1e90ff,
+    firebrick: 0xb22222,
+    floralwhite: 0xfffaf0,
+    forestgreen: 0x228b22,
+    fuchsia: 0xff00ff,
+    gainsboro: 0xdcdcdc,
+    ghostwhite: 0xf8f8ff,
+    gold: 0xffd700,
+    goldenrod: 0xdaa520,
+    gray: 0x808080,
+    green: 0x008000,
+    greenyellow: 0xadff2f,
+    grey: 0x808080,
+    honeydew: 0xf0fff0,
+    hotpink: 0xff69b4,
+    indianred: 0xcd5c5c,
+    indigo: 0x4b0082,
+    ivory: 0xfffff0,
+    khaki: 0xf0e68c,
+    lavender: 0xe6e6fa,
+    lavenderblush: 0xfff0f5,
+    lawngreen: 0x7cfc00,
+    lemonchiffon: 0xfffacd,
+    lightblue: 0xadd8e6,
+    lightcoral: 0xf08080,
+    lightcyan: 0xe0ffff,
+    lightgoldenrodyellow: 0xfafad2,
+    lightgray: 0xd3d3d3,
+    lightgreen: 0x90ee90,
+    lightgrey: 0xd3d3d3,
+    lightpink: 0xffb6c1,
+    lightsalmon: 0xffa07a,
+    lightseagreen: 0x20b2aa,
+    lightskyblue: 0x87cefa,
+    lightslategray: 0x778899,
+    lightslategrey: 0x778899,
+    lightsteelblue: 0xb0c4de,
+    lightyellow: 0xffffe0,
+    lime: 0x00ff00,
+    limegreen: 0x32cd32,
+    linen: 0xfaf0e6,
+    magenta: 0xff00ff,
+    maroon: 0x800000,
+    mediumaquamarine: 0x66cdaa,
+    mediumblue: 0x0000cd,
+    mediumorchid: 0xba55d3,
+    mediumpurple: 0x9370db,
+    mediumseagreen: 0x3cb371,
+    mediumslateblue: 0x7b68ee,
+    mediumspringgreen: 0x00fa9a,
+    mediumturquoise: 0x48d1cc,
+    mediumvioletred: 0xc71585,
+    midnightblue: 0x191970,
+    mintcream: 0xf5fffa,
+    mistyrose: 0xffe4e1,
+    moccasin: 0xffe4b5,
+    navajowhite: 0xffdead,
+    navy: 0x000080,
+    oldlace: 0xfdf5e6,
+    olive: 0x808000,
+    olivedrab: 0x6b8e23,
+    orange: 0xffa500,
+    orangered: 0xff4500,
+    orchid: 0xda70d6,
+    palegoldenrod: 0xeee8aa,
+    palegreen: 0x98fb98,
+    paleturquoise: 0xafeeee,
+    palevioletred: 0xdb7093,
+    papayawhip: 0xffefd5,
+    peachpuff: 0xffdab9,
+    peru: 0xcd853f,
+    pink: 0xffc0cb,
+    plum: 0xdda0dd,
+    powderblue: 0xb0e0e6,
+    purple: 0x800080,
+    rebeccapurple: 0x663399,
+    red: 0xff0000,
+    rosybrown: 0xbc8f8f,
+    royalblue: 0x4169e1,
+    saddlebrown: 0x8b4513,
+    salmon: 0xfa8072,
+    sandybrown: 0xf4a460,
+    seagreen: 0x2e8b57,
+    seashell: 0xfff5ee,
+    sienna: 0xa0522d,
+    silver: 0xc0c0c0,
+    skyblue: 0x87ceeb,
+    slateblue: 0x6a5acd,
+    slategray: 0x708090,
+    slategrey: 0x708090,
+    snow: 0xfffafa,
+    springgreen: 0x00ff7f,
+    steelblue: 0x4682b4,
+    tan: 0xd2b48c,
+    teal: 0x008080,
+    thistle: 0xd8bfd8,
+    tomato: 0xff6347,
+    turquoise: 0x40e0d0,
+    violet: 0xee82ee,
+    wheat: 0xf5deb3,
+    white: 0xffffff,
+    whitesmoke: 0xf5f5f5,
+    yellow: 0xffff00,
+    yellowgreen: 0x9acd32
+  };
+
+  define(Color, color, {
+    copy(channels) {
+      return Object.assign(new this.constructor, this, channels);
+    },
+    displayable() {
+      return this.rgb().displayable();
+    },
+    hex: color_formatHex, // Deprecated! Use color.formatHex.
+    formatHex: color_formatHex,
+    formatHex8: color_formatHex8,
+    formatHsl: color_formatHsl,
+    formatRgb: color_formatRgb,
+    toString: color_formatRgb
+  });
+
+  function color_formatHex() {
+    return this.rgb().formatHex();
+  }
+
+  function color_formatHex8() {
+    return this.rgb().formatHex8();
+  }
+
+  function color_formatHsl() {
+    return hslConvert(this).formatHsl();
+  }
+
+  function color_formatRgb() {
+    return this.rgb().formatRgb();
+  }
+
+  function color(format) {
+    var m, l;
+    format = (format + "").trim().toLowerCase();
+    return (m = reHex.exec(format)) ? (l = m[1].length, m = parseInt(m[1], 16), l === 6 ? rgbn(m) // #ff0000
+        : l === 3 ? new Rgb((m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), ((m & 0xf) << 4) | (m & 0xf), 1) // #f00
+        : l === 8 ? rgba(m >> 24 & 0xff, m >> 16 & 0xff, m >> 8 & 0xff, (m & 0xff) / 0xff) // #ff000000
+        : l === 4 ? rgba((m >> 12 & 0xf) | (m >> 8 & 0xf0), (m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), (((m & 0xf) << 4) | (m & 0xf)) / 0xff) // #f000
+        : null) // invalid hex
+        : (m = reRgbInteger.exec(format)) ? new Rgb(m[1], m[2], m[3], 1) // rgb(255, 0, 0)
+        : (m = reRgbPercent.exec(format)) ? new Rgb(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, 1) // rgb(100%, 0%, 0%)
+        : (m = reRgbaInteger.exec(format)) ? rgba(m[1], m[2], m[3], m[4]) // rgba(255, 0, 0, 1)
+        : (m = reRgbaPercent.exec(format)) ? rgba(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, m[4]) // rgb(100%, 0%, 0%, 1)
+        : (m = reHslPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, 1) // hsl(120, 50%, 50%)
+        : (m = reHslaPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, m[4]) // hsla(120, 50%, 50%, 1)
+        : named.hasOwnProperty(format) ? rgbn(named[format]) // eslint-disable-line no-prototype-builtins
+        : format === "transparent" ? new Rgb(NaN, NaN, NaN, 0)
+        : null;
+  }
+
+  function rgbn(n) {
+    return new Rgb(n >> 16 & 0xff, n >> 8 & 0xff, n & 0xff, 1);
+  }
+
+  function rgba(r, g, b, a) {
+    if (a <= 0) r = g = b = NaN;
+    return new Rgb(r, g, b, a);
+  }
+
+  function rgbConvert(o) {
+    if (!(o instanceof Color)) o = color(o);
+    if (!o) return new Rgb;
+    o = o.rgb();
+    return new Rgb(o.r, o.g, o.b, o.opacity);
+  }
+
+  function rgb$1(r, g, b, opacity) {
+    return arguments.length === 1 ? rgbConvert(r) : new Rgb(r, g, b, opacity == null ? 1 : opacity);
+  }
+
+  function Rgb(r, g, b, opacity) {
+    this.r = +r;
+    this.g = +g;
+    this.b = +b;
+    this.opacity = +opacity;
+  }
+
+  define(Rgb, rgb$1, extend(Color, {
+    brighter(k) {
+      k = k == null ? brighter : Math.pow(brighter, k);
+      return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+    },
+    darker(k) {
+      k = k == null ? darker : Math.pow(darker, k);
+      return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+    },
+    rgb() {
+      return this;
+    },
+    clamp() {
+      return new Rgb(clampi(this.r), clampi(this.g), clampi(this.b), clampa(this.opacity));
+    },
+    displayable() {
+      return (-0.5 <= this.r && this.r < 255.5)
+          && (-0.5 <= this.g && this.g < 255.5)
+          && (-0.5 <= this.b && this.b < 255.5)
+          && (0 <= this.opacity && this.opacity <= 1);
+    },
+    hex: rgb_formatHex, // Deprecated! Use color.formatHex.
+    formatHex: rgb_formatHex,
+    formatHex8: rgb_formatHex8,
+    formatRgb: rgb_formatRgb,
+    toString: rgb_formatRgb
+  }));
+
+  function rgb_formatHex() {
+    return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}`;
+  }
+
+  function rgb_formatHex8() {
+    return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}${hex((isNaN(this.opacity) ? 1 : this.opacity) * 255)}`;
+  }
+
+  function rgb_formatRgb() {
+    const a = clampa(this.opacity);
+    return `${a === 1 ? "rgb(" : "rgba("}${clampi(this.r)}, ${clampi(this.g)}, ${clampi(this.b)}${a === 1 ? ")" : `, ${a})`}`;
+  }
+
+  function clampa(opacity) {
+    return isNaN(opacity) ? 1 : Math.max(0, Math.min(1, opacity));
+  }
+
+  function clampi(value) {
+    return Math.max(0, Math.min(255, Math.round(value) || 0));
+  }
+
+  function hex(value) {
+    value = clampi(value);
+    return (value < 16 ? "0" : "") + value.toString(16);
+  }
+
+  function hsla(h, s, l, a) {
+    if (a <= 0) h = s = l = NaN;
+    else if (l <= 0 || l >= 1) h = s = NaN;
+    else if (s <= 0) h = NaN;
+    return new Hsl(h, s, l, a);
+  }
+
+  function hslConvert(o) {
+    if (o instanceof Hsl) return new Hsl(o.h, o.s, o.l, o.opacity);
+    if (!(o instanceof Color)) o = color(o);
+    if (!o) return new Hsl;
+    if (o instanceof Hsl) return o;
+    o = o.rgb();
+    var r = o.r / 255,
+        g = o.g / 255,
+        b = o.b / 255,
+        min = Math.min(r, g, b),
+        max = Math.max(r, g, b),
+        h = NaN,
+        s = max - min,
+        l = (max + min) / 2;
+    if (s) {
+      if (r === max) h = (g - b) / s + (g < b) * 6;
+      else if (g === max) h = (b - r) / s + 2;
+      else h = (r - g) / s + 4;
+      s /= l < 0.5 ? max + min : 2 - max - min;
+      h *= 60;
+    } else {
+      s = l > 0 && l < 1 ? 0 : h;
+    }
+    return new Hsl(h, s, l, o.opacity);
+  }
+
+  function hsl(h, s, l, opacity) {
+    return arguments.length === 1 ? hslConvert(h) : new Hsl(h, s, l, opacity == null ? 1 : opacity);
+  }
+
+  function Hsl(h, s, l, opacity) {
+    this.h = +h;
+    this.s = +s;
+    this.l = +l;
+    this.opacity = +opacity;
+  }
+
+  define(Hsl, hsl, extend(Color, {
+    brighter(k) {
+      k = k == null ? brighter : Math.pow(brighter, k);
+      return new Hsl(this.h, this.s, this.l * k, this.opacity);
+    },
+    darker(k) {
+      k = k == null ? darker : Math.pow(darker, k);
+      return new Hsl(this.h, this.s, this.l * k, this.opacity);
+    },
+    rgb() {
+      var h = this.h % 360 + (this.h < 0) * 360,
+          s = isNaN(h) || isNaN(this.s) ? 0 : this.s,
+          l = this.l,
+          m2 = l + (l < 0.5 ? l : 1 - l) * s,
+          m1 = 2 * l - m2;
+      return new Rgb(
+        hsl2rgb(h >= 240 ? h - 240 : h + 120, m1, m2),
+        hsl2rgb(h, m1, m2),
+        hsl2rgb(h < 120 ? h + 240 : h - 120, m1, m2),
+        this.opacity
+      );
+    },
+    clamp() {
+      return new Hsl(clamph(this.h), clampt(this.s), clampt(this.l), clampa(this.opacity));
+    },
+    displayable() {
+      return (0 <= this.s && this.s <= 1 || isNaN(this.s))
+          && (0 <= this.l && this.l <= 1)
+          && (0 <= this.opacity && this.opacity <= 1);
+    },
+    formatHsl() {
+      const a = clampa(this.opacity);
+      return `${a === 1 ? "hsl(" : "hsla("}${clamph(this.h)}, ${clampt(this.s) * 100}%, ${clampt(this.l) * 100}%${a === 1 ? ")" : `, ${a})`}`;
+    }
+  }));
+
+  function clamph(value) {
+    value = (value || 0) % 360;
+    return value < 0 ? value + 360 : value;
+  }
+
+  function clampt(value) {
+    return Math.max(0, Math.min(1, value || 0));
+  }
+
+  /* From FvD 13.37, CSS Color Module Level 3 */
+  function hsl2rgb(h, m1, m2) {
+    return (h < 60 ? m1 + (m2 - m1) * h / 60
+        : h < 180 ? m2
+        : h < 240 ? m1 + (m2 - m1) * (240 - h) / 60
+        : m1) * 255;
+  }
+
+  var constant = x => () => x;
+
+  function linear$1(a, d) {
+    return function(t) {
+      return a + t * d;
+    };
+  }
+
+  function exponential(a, b, y) {
+    return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {
+      return Math.pow(a + t * b, y);
+    };
+  }
+
+  function gamma(y) {
+    return (y = +y) === 1 ? nogamma : function(a, b) {
+      return b - a ? exponential(a, b, y) : constant(isNaN(a) ? b : a);
+    };
+  }
+
+  function nogamma(a, b) {
+    var d = b - a;
+    return d ? linear$1(a, d) : constant(isNaN(a) ? b : a);
+  }
+
+  var rgb = (function rgbGamma(y) {
+    var color = gamma(y);
+
+    function rgb(start, end) {
+      var r = color((start = rgb$1(start)).r, (end = rgb$1(end)).r),
+          g = color(start.g, end.g),
+          b = color(start.b, end.b),
+          opacity = nogamma(start.opacity, end.opacity);
+      return function(t) {
+        start.r = r(t);
+        start.g = g(t);
+        start.b = b(t);
+        start.opacity = opacity(t);
+        return start + "";
+      };
+    }
+
+    rgb.gamma = rgbGamma;
+
+    return rgb;
+  })(1);
+
+  function numberArray(a, b) {
+    if (!b) b = [];
+    var n = a ? Math.min(b.length, a.length) : 0,
+        c = b.slice(),
+        i;
+    return function(t) {
+      for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;
+      return c;
+    };
+  }
+
+  function isNumberArray(x) {
+    return ArrayBuffer.isView(x) && !(x instanceof DataView);
+  }
+
+  function genericArray(a, b) {
+    var nb = b ? b.length : 0,
+        na = a ? Math.min(nb, a.length) : 0,
+        x = new Array(na),
+        c = new Array(nb),
+        i;
+
+    for (i = 0; i < na; ++i) x[i] = interpolate(a[i], b[i]);
+    for (; i < nb; ++i) c[i] = b[i];
+
+    return function(t) {
+      for (i = 0; i < na; ++i) c[i] = x[i](t);
+      return c;
+    };
+  }
+
+  function date(a, b) {
+    var d = new Date;
+    return a = +a, b = +b, function(t) {
+      return d.setTime(a * (1 - t) + b * t), d;
+    };
+  }
+
+  function interpolateNumber(a, b) {
+    return a = +a, b = +b, function(t) {
+      return a * (1 - t) + b * t;
+    };
+  }
+
+  function object(a, b) {
+    var i = {},
+        c = {},
+        k;
+
+    if (a === null || typeof a !== "object") a = {};
+    if (b === null || typeof b !== "object") b = {};
+
+    for (k in b) {
+      if (k in a) {
+        i[k] = interpolate(a[k], b[k]);
+      } else {
+        c[k] = b[k];
+      }
+    }
+
+    return function(t) {
+      for (k in i) c[k] = i[k](t);
+      return c;
+    };
+  }
+
+  var reA = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,
+      reB = new RegExp(reA.source, "g");
+
+  function zero(b) {
+    return function() {
+      return b;
+    };
+  }
+
+  function one(b) {
+    return function(t) {
+      return b(t) + "";
+    };
+  }
+
+  function string(a, b) {
+    var bi = reA.lastIndex = reB.lastIndex = 0, // scan index for next number in b
+        am, // current match in a
+        bm, // current match in b
+        bs, // string preceding current number in b, if any
+        i = -1, // index in s
+        s = [], // string constants and placeholders
+        q = []; // number interpolators
+
+    // Coerce inputs to strings.
+    a = a + "", b = b + "";
+
+    // Interpolate pairs of numbers in a & b.
+    while ((am = reA.exec(a))
+        && (bm = reB.exec(b))) {
+      if ((bs = bm.index) > bi) { // a string precedes the next number in b
+        bs = b.slice(bi, bs);
+        if (s[i]) s[i] += bs; // coalesce with previous string
+        else s[++i] = bs;
+      }
+      if ((am = am[0]) === (bm = bm[0])) { // numbers in a & b match
+        if (s[i]) s[i] += bm; // coalesce with previous string
+        else s[++i] = bm;
+      } else { // interpolate non-matching numbers
+        s[++i] = null;
+        q.push({i: i, x: interpolateNumber(am, bm)});
+      }
+      bi = reB.lastIndex;
+    }
+
+    // Add remains of b.
+    if (bi < b.length) {
+      bs = b.slice(bi);
+      if (s[i]) s[i] += bs; // coalesce with previous string
+      else s[++i] = bs;
+    }
+
+    // Special optimization for only a single match.
+    // Otherwise, interpolate each of the numbers and rejoin the string.
+    return s.length < 2 ? (q[0]
+        ? one(q[0].x)
+        : zero(b))
+        : (b = q.length, function(t) {
+            for (var i = 0, o; i < b; ++i) s[(o = q[i]).i] = o.x(t);
+            return s.join("");
+          });
+  }
+
+  function interpolate(a, b) {
+    var t = typeof b, c;
+    return b == null || t === "boolean" ? constant(b)
+        : (t === "number" ? interpolateNumber
+        : t === "string" ? ((c = color(b)) ? (b = c, rgb) : string)
+        : b instanceof color ? rgb
+        : b instanceof Date ? date
+        : isNumberArray(b) ? numberArray
+        : Array.isArray(b) ? genericArray
+        : typeof b.valueOf !== "function" && typeof b.toString !== "function" || isNaN(b) ? object
+        : interpolateNumber)(a, b);
+  }
+
+  function interpolateRound(a, b) {
+    return a = +a, b = +b, function(t) {
+      return Math.round(a * (1 - t) + b * t);
+    };
+  }
+
+  function constants(x) {
+    return function() {
+      return x;
+    };
+  }
+
+  function number(x) {
+    return +x;
+  }
+
+  var unit = [0, 1];
+
+  function identity$1(x) {
+    return x;
+  }
+
+  function normalize(a, b) {
+    return (b -= (a = +a))
+        ? function(x) { return (x - a) / b; }
+        : constants(isNaN(b) ? NaN : 0.5);
+  }
+
+  function clamper(a, b) {
+    var t;
+    if (a > b) t = a, a = b, b = t;
+    return function(x) { return Math.max(a, Math.min(b, x)); };
+  }
+
+  // normalize(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1].
+  // interpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding range value x in [a,b].
+  function bimap(domain, range, interpolate) {
+    var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];
+    if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);
+    else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);
+    return function(x) { return r0(d0(x)); };
+  }
+
+  function polymap(domain, range, interpolate) {
+    var j = Math.min(domain.length, range.length) - 1,
+        d = new Array(j),
+        r = new Array(j),
+        i = -1;
+
+    // Reverse descending domains.
+    if (domain[j] < domain[0]) {
+      domain = domain.slice().reverse();
+      range = range.slice().reverse();
+    }
+
+    while (++i < j) {
+      d[i] = normalize(domain[i], domain[i + 1]);
+      r[i] = interpolate(range[i], range[i + 1]);
+    }
+
+    return function(x) {
+      var i = bisect(domain, x, 1, j) - 1;
+      return r[i](d[i](x));
+    };
+  }
+
+  function copy$1(source, target) {
+    return target
+        .domain(source.domain())
+        .range(source.range())
+        .interpolate(source.interpolate())
+        .clamp(source.clamp())
+        .unknown(source.unknown());
+  }
+
+  function transformer$1() {
+    var domain = unit,
+        range = unit,
+        interpolate$1 = interpolate,
+        transform,
+        untransform,
+        unknown,
+        clamp = identity$1,
+        piecewise,
+        output,
+        input;
+
+    function rescale() {
+      var n = Math.min(domain.length, range.length);
+      if (clamp !== identity$1) clamp = clamper(domain[0], domain[n - 1]);
+      piecewise = n > 2 ? polymap : bimap;
+      output = input = null;
+      return scale;
+    }
+
+    function scale(x) {
+      return x == null || isNaN(x = +x) ? unknown : (output || (output = piecewise(domain.map(transform), range, interpolate$1)))(transform(clamp(x)));
+    }
+
+    scale.invert = function(y) {
+      return clamp(untransform((input || (input = piecewise(range, domain.map(transform), interpolateNumber)))(y)));
+    };
+
+    scale.domain = function(_) {
+      return arguments.length ? (domain = Array.from(_, number), rescale()) : domain.slice();
+    };
+
+    scale.range = function(_) {
+      return arguments.length ? (range = Array.from(_), rescale()) : range.slice();
+    };
+
+    scale.rangeRound = function(_) {
+      return range = Array.from(_), interpolate$1 = interpolateRound, rescale();
+    };
+
+    scale.clamp = function(_) {
+      return arguments.length ? (clamp = _ ? true : identity$1, rescale()) : clamp !== identity$1;
+    };
+
+    scale.interpolate = function(_) {
+      return arguments.length ? (interpolate$1 = _, rescale()) : interpolate$1;
+    };
+
+    scale.unknown = function(_) {
+      return arguments.length ? (unknown = _, scale) : unknown;
+    };
+
+    return function(t, u) {
+      transform = t, untransform = u;
+      return rescale();
+    };
+  }
+
+  function continuous() {
+    return transformer$1()(identity$1, identity$1);
+  }
+
+  function formatDecimal(x) {
+    return Math.abs(x = Math.round(x)) >= 1e21
+        ? x.toLocaleString("en").replace(/,/g, "")
+        : x.toString(10);
+  }
+
+  // Computes the decimal coefficient and exponent of the specified number x with
+  // significant digits p, where x is positive and p is in [1, 21] or undefined.
+  // For example, formatDecimalParts(1.23) returns ["123", 0].
+  function formatDecimalParts(x, p) {
+    if ((i = (x = p ? x.toExponential(p - 1) : x.toExponential()).indexOf("e")) < 0) return null; // NaN, ±Infinity
+    var i, coefficient = x.slice(0, i);
+
+    // The string returned by toExponential either has the form \d\.\d+e[-+]\d+
+    // (e.g., 1.2e+3) or the form \de[-+]\d+ (e.g., 1e+3).
+    return [
+      coefficient.length > 1 ? coefficient[0] + coefficient.slice(2) : coefficient,
+      +x.slice(i + 1)
+    ];
+  }
+
+  function exponent(x) {
+    return x = formatDecimalParts(Math.abs(x)), x ? x[1] : NaN;
+  }
+
+  function formatGroup(grouping, thousands) {
+    return function(value, width) {
+      var i = value.length,
+          t = [],
+          j = 0,
+          g = grouping[0],
+          length = 0;
+
+      while (i > 0 && g > 0) {
+        if (length + g + 1 > width) g = Math.max(1, width - length);
+        t.push(value.substring(i -= g, i + g));
+        if ((length += g + 1) > width) break;
+        g = grouping[j = (j + 1) % grouping.length];
+      }
+
+      return t.reverse().join(thousands);
+    };
+  }
+
+  function formatNumerals(numerals) {
+    return function(value) {
+      return value.replace(/[0-9]/g, function(i) {
+        return numerals[+i];
+      });
+    };
+  }
+
+  // [[fill]align][sign][symbol][0][width][,][.precision][~][type]
+  var re = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+
+  function formatSpecifier(specifier) {
+    if (!(match = re.exec(specifier))) throw new Error("invalid format: " + specifier);
+    var match;
+    return new FormatSpecifier({
+      fill: match[1],
+      align: match[2],
+      sign: match[3],
+      symbol: match[4],
+      zero: match[5],
+      width: match[6],
+      comma: match[7],
+      precision: match[8] && match[8].slice(1),
+      trim: match[9],
+      type: match[10]
+    });
+  }
+
+  formatSpecifier.prototype = FormatSpecifier.prototype; // instanceof
+
+  function FormatSpecifier(specifier) {
+    this.fill = specifier.fill === undefined ? " " : specifier.fill + "";
+    this.align = specifier.align === undefined ? ">" : specifier.align + "";
+    this.sign = specifier.sign === undefined ? "-" : specifier.sign + "";
+    this.symbol = specifier.symbol === undefined ? "" : specifier.symbol + "";
+    this.zero = !!specifier.zero;
+    this.width = specifier.width === undefined ? undefined : +specifier.width;
+    this.comma = !!specifier.comma;
+    this.precision = specifier.precision === undefined ? undefined : +specifier.precision;
+    this.trim = !!specifier.trim;
+    this.type = specifier.type === undefined ? "" : specifier.type + "";
+  }
+
+  FormatSpecifier.prototype.toString = function() {
+    return this.fill
+        + this.align
+        + this.sign
+        + this.symbol
+        + (this.zero ? "0" : "")
+        + (this.width === undefined ? "" : Math.max(1, this.width | 0))
+        + (this.comma ? "," : "")
+        + (this.precision === undefined ? "" : "." + Math.max(0, this.precision | 0))
+        + (this.trim ? "~" : "")
+        + this.type;
+  };
+
+  // Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.
+  function formatTrim(s) {
+    out: for (var n = s.length, i = 1, i0 = -1, i1; i < n; ++i) {
+      switch (s[i]) {
+        case ".": i0 = i1 = i; break;
+        case "0": if (i0 === 0) i0 = i; i1 = i; break;
+        default: if (!+s[i]) break out; if (i0 > 0) i0 = 0; break;
+      }
+    }
+    return i0 > 0 ? s.slice(0, i0) + s.slice(i1 + 1) : s;
+  }
+
+  var prefixExponent;
+
+  function formatPrefixAuto(x, p) {
+    var d = formatDecimalParts(x, p);
+    if (!d) return x + "";
+    var coefficient = d[0],
+        exponent = d[1],
+        i = exponent - (prefixExponent = Math.max(-8, Math.min(8, Math.floor(exponent / 3))) * 3) + 1,
+        n = coefficient.length;
+    return i === n ? coefficient
+        : i > n ? coefficient + new Array(i - n + 1).join("0")
+        : i > 0 ? coefficient.slice(0, i) + "." + coefficient.slice(i)
+        : "0." + new Array(1 - i).join("0") + formatDecimalParts(x, Math.max(0, p + i - 1))[0]; // less than 1y!
+  }
+
+  function formatRounded(x, p) {
+    var d = formatDecimalParts(x, p);
+    if (!d) return x + "";
+    var coefficient = d[0],
+        exponent = d[1];
+    return exponent < 0 ? "0." + new Array(-exponent).join("0") + coefficient
+        : coefficient.length > exponent + 1 ? coefficient.slice(0, exponent + 1) + "." + coefficient.slice(exponent + 1)
+        : coefficient + new Array(exponent - coefficient.length + 2).join("0");
+  }
+
+  var formatTypes = {
+    "%": (x, p) => (x * 100).toFixed(p),
+    "b": (x) => Math.round(x).toString(2),
+    "c": (x) => x + "",
+    "d": formatDecimal,
+    "e": (x, p) => x.toExponential(p),
+    "f": (x, p) => x.toFixed(p),
+    "g": (x, p) => x.toPrecision(p),
+    "o": (x) => Math.round(x).toString(8),
+    "p": (x, p) => formatRounded(x * 100, p),
+    "r": formatRounded,
+    "s": formatPrefixAuto,
+    "X": (x) => Math.round(x).toString(16).toUpperCase(),
+    "x": (x) => Math.round(x).toString(16)
+  };
+
+  function identity(x) {
+    return x;
+  }
+
+  var map = Array.prototype.map,
+      prefixes = ["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"];
+
+  function formatLocale(locale) {
+    var group = locale.grouping === undefined || locale.thousands === undefined ? identity : formatGroup(map.call(locale.grouping, Number), locale.thousands + ""),
+        currencyPrefix = locale.currency === undefined ? "" : locale.currency[0] + "",
+        currencySuffix = locale.currency === undefined ? "" : locale.currency[1] + "",
+        decimal = locale.decimal === undefined ? "." : locale.decimal + "",
+        numerals = locale.numerals === undefined ? identity : formatNumerals(map.call(locale.numerals, String)),
+        percent = locale.percent === undefined ? "%" : locale.percent + "",
+        minus = locale.minus === undefined ? "−" : locale.minus + "",
+        nan = locale.nan === undefined ? "NaN" : locale.nan + "";
+
+    function newFormat(specifier) {
+      specifier = formatSpecifier(specifier);
+
+      var fill = specifier.fill,
+          align = specifier.align,
+          sign = specifier.sign,
+          symbol = specifier.symbol,
+          zero = specifier.zero,
+          width = specifier.width,
+          comma = specifier.comma,
+          precision = specifier.precision,
+          trim = specifier.trim,
+          type = specifier.type;
+
+      // The "n" type is an alias for ",g".
+      if (type === "n") comma = true, type = "g";
+
+      // The "" type, and any invalid type, is an alias for ".12~g".
+      else if (!formatTypes[type]) precision === undefined && (precision = 12), trim = true, type = "g";
+
+      // If zero fill is specified, padding goes after sign and before digits.
+      if (zero || (fill === "0" && align === "=")) zero = true, fill = "0", align = "=";
+
+      // Compute the prefix and suffix.
+      // For SI-prefix, the suffix is lazily computed.
+      var prefix = symbol === "$" ? currencyPrefix : symbol === "#" && /[boxX]/.test(type) ? "0" + type.toLowerCase() : "",
+          suffix = symbol === "$" ? currencySuffix : /[%p]/.test(type) ? percent : "";
+
+      // What format function should we use?
+      // Is this an integer type?
+      // Can this type generate exponential notation?
+      var formatType = formatTypes[type],
+          maybeSuffix = /[defgprs%]/.test(type);
+
+      // Set the default precision if not specified,
+      // or clamp the specified precision to the supported range.
+      // For significant precision, it must be in [1, 21].
+      // For fixed precision, it must be in [0, 20].
+      precision = precision === undefined ? 6
+          : /[gprs]/.test(type) ? Math.max(1, Math.min(21, precision))
+          : Math.max(0, Math.min(20, precision));
+
+      function format(value) {
+        var valuePrefix = prefix,
+            valueSuffix = suffix,
+            i, n, c;
+
+        if (type === "c") {
+          valueSuffix = formatType(value) + valueSuffix;
+          value = "";
+        } else {
+          value = +value;
+
+          // Determine the sign. -0 is not less than 0, but 1 / -0 is!
+          var valueNegative = value < 0 || 1 / value < 0;
+
+          // Perform the initial formatting.
+          value = isNaN(value) ? nan : formatType(Math.abs(value), precision);
+
+          // Trim insignificant zeros.
+          if (trim) value = formatTrim(value);
+
+          // If a negative value rounds to zero after formatting, and no explicit positive sign is requested, hide the sign.
+          if (valueNegative && +value === 0 && sign !== "+") valueNegative = false;
+
+          // Compute the prefix and suffix.
+          valuePrefix = (valueNegative ? (sign === "(" ? sign : minus) : sign === "-" || sign === "(" ? "" : sign) + valuePrefix;
+          valueSuffix = (type === "s" ? prefixes[8 + prefixExponent / 3] : "") + valueSuffix + (valueNegative && sign === "(" ? ")" : "");
+
+          // Break the formatted value into the integer “value” part that can be
+          // grouped, and fractional or exponential “suffix” part that is not.
+          if (maybeSuffix) {
+            i = -1, n = value.length;
+            while (++i < n) {
+              if (c = value.charCodeAt(i), 48 > c || c > 57) {
+                valueSuffix = (c === 46 ? decimal + value.slice(i + 1) : value.slice(i)) + valueSuffix;
+                value = value.slice(0, i);
+                break;
+              }
+            }
+          }
+        }
+
+        // If the fill character is not "0", grouping is applied before padding.
+        if (comma && !zero) value = group(value, Infinity);
+
+        // Compute the padding.
+        var length = valuePrefix.length + value.length + valueSuffix.length,
+            padding = length < width ? new Array(width - length + 1).join(fill) : "";
+
+        // If the fill character is "0", grouping is applied after padding.
+        if (comma && zero) value = group(padding + value, padding.length ? width - valueSuffix.length : Infinity), padding = "";
+
+        // Reconstruct the final output based on the desired alignment.
+        switch (align) {
+          case "<": value = valuePrefix + value + valueSuffix + padding; break;
+          case "=": value = valuePrefix + padding + value + valueSuffix; break;
+          case "^": value = padding.slice(0, length = padding.length >> 1) + valuePrefix + value + valueSuffix + padding.slice(length); break;
+          default: value = padding + valuePrefix + value + valueSuffix; break;
+        }
+
+        return numerals(value);
+      }
+
+      format.toString = function() {
+        return specifier + "";
+      };
+
+      return format;
+    }
+
+    function formatPrefix(specifier, value) {
+      var f = newFormat((specifier = formatSpecifier(specifier), specifier.type = "f", specifier)),
+          e = Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3,
+          k = Math.pow(10, -e),
+          prefix = prefixes[8 + e / 3];
+      return function(value) {
+        return f(k * value) + prefix;
+      };
+    }
+
+    return {
+      format: newFormat,
+      formatPrefix: formatPrefix
+    };
+  }
+
+  var locale;
+  var format;
+  var formatPrefix;
+
+  defaultLocale({
+    thousands: ",",
+    grouping: [3],
+    currency: ["$", ""]
+  });
+
+  function defaultLocale(definition) {
+    locale = formatLocale(definition);
+    format = locale.format;
+    formatPrefix = locale.formatPrefix;
+    return locale;
+  }
+
+  function precisionFixed(step) {
+    return Math.max(0, -exponent(Math.abs(step)));
+  }
+
+  function precisionPrefix(step, value) {
+    return Math.max(0, Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3 - exponent(Math.abs(step)));
+  }
+
+  function precisionRound(step, max) {
+    step = Math.abs(step), max = Math.abs(max) - step;
+    return Math.max(0, exponent(max) - exponent(step)) + 1;
+  }
+
+  function tickFormat(start, stop, count, specifier) {
+    var step = tickStep(start, stop, count),
+        precision;
+    specifier = formatSpecifier(specifier == null ? ",f" : specifier);
+    switch (specifier.type) {
+      case "s": {
+        var value = Math.max(Math.abs(start), Math.abs(stop));
+        if (specifier.precision == null && !isNaN(precision = precisionPrefix(step, value))) specifier.precision = precision;
+        return formatPrefix(specifier, value);
+      }
+      case "":
+      case "e":
+      case "g":
+      case "p":
+      case "r": {
+        if (specifier.precision == null && !isNaN(precision = precisionRound(step, Math.max(Math.abs(start), Math.abs(stop))))) specifier.precision = precision - (specifier.type === "e");
+        break;
+      }
+      case "f":
+      case "%": {
+        if (specifier.precision == null && !isNaN(precision = precisionFixed(step))) specifier.precision = precision - (specifier.type === "%") * 2;
+        break;
+      }
+    }
+    return format(specifier);
+  }
+
+  function linearish(scale) {
+    var domain = scale.domain;
+
+    scale.ticks = function(count) {
+      var d = domain();
+      return ticks(d[0], d[d.length - 1], count == null ? 10 : count);
+    };
+
+    scale.tickFormat = function(count, specifier) {
+      var d = domain();
+      return tickFormat(d[0], d[d.length - 1], count == null ? 10 : count, specifier);
+    };
+
+    scale.nice = function(count) {
+      if (count == null) count = 10;
+
+      var d = domain();
+      var i0 = 0;
+      var i1 = d.length - 1;
+      var start = d[i0];
+      var stop = d[i1];
+      var prestep;
+      var step;
+      var maxIter = 10;
+
+      if (stop < start) {
+        step = start, start = stop, stop = step;
+        step = i0, i0 = i1, i1 = step;
+      }
+      
+      while (maxIter-- > 0) {
+        step = tickIncrement(start, stop, count);
+        if (step === prestep) {
+          d[i0] = start;
+          d[i1] = stop;
+          return domain(d);
+        } else if (step > 0) {
+          start = Math.floor(start / step) * step;
+          stop = Math.ceil(stop / step) * step;
+        } else if (step < 0) {
+          start = Math.ceil(start * step) / step;
+          stop = Math.floor(stop * step) / step;
+        } else {
+          break;
+        }
+        prestep = step;
+      }
+
+      return scale;
+    };
+
+    return scale;
+  }
+
+  function linear() {
+    var scale = continuous();
+
+    scale.copy = function() {
+      return copy$1(scale, linear());
+    };
+
+    initRange.apply(scale, arguments);
+
+    return linearish(scale);
+  }
+
+  function transformer() {
+    var x0 = 0,
+        x1 = 1,
+        t0,
+        t1,
+        k10,
+        transform,
+        interpolator = identity$1,
+        clamp = false,
+        unknown;
+
+    function scale(x) {
+      return x == null || isNaN(x = +x) ? unknown : interpolator(k10 === 0 ? 0.5 : (x = (transform(x) - t0) * k10, clamp ? Math.max(0, Math.min(1, x)) : x));
+    }
+
+    scale.domain = function(_) {
+      return arguments.length ? ([x0, x1] = _, t0 = transform(x0 = +x0), t1 = transform(x1 = +x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0), scale) : [x0, x1];
+    };
+
+    scale.clamp = function(_) {
+      return arguments.length ? (clamp = !!_, scale) : clamp;
+    };
+
+    scale.interpolator = function(_) {
+      return arguments.length ? (interpolator = _, scale) : interpolator;
+    };
+
+    function range(interpolate) {
+      return function(_) {
+        var r0, r1;
+        return arguments.length ? ([r0, r1] = _, interpolator = interpolate(r0, r1), scale) : [interpolator(0), interpolator(1)];
+      };
+    }
+
+    scale.range = range(interpolate);
+
+    scale.rangeRound = range(interpolateRound);
+
+    scale.unknown = function(_) {
+      return arguments.length ? (unknown = _, scale) : unknown;
+    };
+
+    return function(t) {
+      transform = t, t0 = t(x0), t1 = t(x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0);
+      return scale;
+    };
+  }
+
+  function copy(source, target) {
+    return target
+        .domain(source.domain())
+        .interpolator(source.interpolator())
+        .clamp(source.clamp())
+        .unknown(source.unknown());
+  }
+
+  function sequential() {
+    var scale = linearish(transformer()(identity$1));
+
+    scale.copy = function() {
+      return copy(scale, sequential());
+    };
+
+    return initInterpolator.apply(scale, arguments);
+  }
+
+  const COLOR_BASE = "#cecece";
+
+  // https://www.w3.org/TR/WCAG20/#relativeluminancedef
+  const rc = 0.2126;
+  const gc = 0.7152;
+  const bc = 0.0722;
+  // low-gamma adjust coefficient
+  const lowc = 1 / 12.92;
+  function adjustGamma(p) {
+      return Math.pow((p + 0.055) / 1.055, 2.4);
+  }
+  function relativeLuminance(o) {
+      const rsrgb = o.r / 255;
+      const gsrgb = o.g / 255;
+      const bsrgb = o.b / 255;
+      const r = rsrgb <= 0.03928 ? rsrgb * lowc : adjustGamma(rsrgb);
+      const g = gsrgb <= 0.03928 ? gsrgb * lowc : adjustGamma(gsrgb);
+      const b = bsrgb <= 0.03928 ? bsrgb * lowc : adjustGamma(bsrgb);
+      return r * rc + g * gc + b * bc;
+  }
+  const createRainbowColor = (root) => {
+      const colorParentMap = new Map();
+      colorParentMap.set(root, COLOR_BASE);
+      if (root.children != null) {
+          const colorScale = sequential([0, root.children.length], (n) => hsl(360 * n, 0.3, 0.85));
+          root.children.forEach((c, id) => {
+              colorParentMap.set(c, colorScale(id).toString());
+          });
+      }
+      const colorMap = new Map();
+      const lightScale = linear().domain([0, root.height]).range([0.9, 0.3]);
+      const getBackgroundColor = (node) => {
+          const parents = node.ancestors();
+          const colorStr = parents.length === 1
+              ? colorParentMap.get(parents[0])
+              : colorParentMap.get(parents[parents.length - 2]);
+          const hslColor = hsl(colorStr);
+          hslColor.l = lightScale(node.depth);
+          return hslColor;
+      };
+      return (node) => {
+          if (!colorMap.has(node)) {
+              const backgroundColor = getBackgroundColor(node);
+              const l = relativeLuminance(backgroundColor.rgb());
+              const fontColor = l > 0.19 ? "#000" : "#fff";
+              colorMap.set(node, {
+                  backgroundColor: backgroundColor.toString(),
+                  fontColor,
+              });
+          }
+          return colorMap.get(node);
+      };
+  };
+
+  const StaticContext = F$1({});
+  const drawChart = (parentNode, data, width, height) => {
+      const availableSizeProperties = getAvailableSizeOptions(data.options);
+      console.time("layout create");
+      const layout = treemap()
+          .size([width, height])
+          .paddingOuter(PADDING)
+          .paddingTop(TOP_PADDING)
+          .paddingInner(PADDING)
+          .round(true)
+          .tile(treemapResquarify);
+      console.timeEnd("layout create");
+      console.time("rawHierarchy create");
+      const rawHierarchy = hierarchy(data.tree);
+      console.timeEnd("rawHierarchy create");
+      const nodeSizesCache = new Map();
+      const nodeIdsCache = new Map();
+      const getModuleSize = (node, sizeKey) => { var _a, _b; return (_b = (_a = nodeSizesCache.get(node)) === null || _a === void 0 ? void 0 : _a[sizeKey]) !== null && _b !== void 0 ? _b : 0; };
+      console.time("rawHierarchy eachAfter cache");
+      rawHierarchy.eachAfter((node) => {
+          var _a;
+          const nodeData = node.data;
+          nodeIdsCache.set(nodeData, {
+              nodeUid: generateUniqueId("node"),
+              clipUid: generateUniqueId("clip"),
+          });
+          const sizes = { renderedLength: 0, gzipLength: 0, brotliLength: 0 };
+          if (isModuleTree(nodeData)) {
+              for (const sizeKey of availableSizeProperties) {
+                  sizes[sizeKey] = nodeData.children.reduce((acc, child) => getModuleSize(child, sizeKey) + acc, 0);
+              }
+          }
+          else {
+              for (const sizeKey of availableSizeProperties) {
+                  sizes[sizeKey] = (_a = data.nodeParts[nodeData.uid][sizeKey]) !== null && _a !== void 0 ? _a : 0;
+              }
+          }
+          nodeSizesCache.set(nodeData, sizes);
+      });
+      console.timeEnd("rawHierarchy eachAfter cache");
+      const getModuleIds = (node) => nodeIdsCache.get(node);
+      console.time("color");
+      const getModuleColor = createRainbowColor(rawHierarchy);
+      console.timeEnd("color");
+      q$1(u$1(StaticContext.Provider, { value: {
+              data,
+              availableSizeProperties,
+              width,
+              height,
+              getModuleSize,
+              getModuleIds,
+              getModuleColor,
+              rawHierarchy,
+              layout,
+          }, children: u$1(Main, {}) }), parentNode);
+  };
+
+  exports.StaticContext = StaticContext;
+  exports.default = drawChart;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+  return exports;
+
+})({});
+
+  /*-->*/
+  </script>
+  <script>
+    /*<!--*/
+    const data = {"version":2,"tree":{"name":"root","children":[{"name":"browser.js","children":[{"name":"node_modules/@stdlib","children":[{"name":"array-base-assert-is-complex-typed-array/lib/main.js","uid":"cc15b84d-1"},{"name":"array-base-assert-is-booleanarray/lib/main.js","uid":"cc15b84d-3"},{"name":"ndarray-base-iteration-order/lib/main.js","uid":"cc15b84d-5"},{"name":"utils-define-property/lib","children":[{"uid":"cc15b84d-7","name":"define_property.js"},{"uid":"cc15b84d-9","name":"has_define_property_support.js"},{"uid":"cc15b84d-11","name":"builtin.js"},{"uid":"cc15b84d-33","name":"polyfill.js"},{"uid":"cc15b84d-35","name":"index.js"}]},{"name":"string-base-format-interpolate/lib","children":[{"uid":"cc15b84d-13","name":"is_number.js"},{"uid":"cc15b84d-15","name":"zero_pad.js"},{"uid":"cc15b84d-17","name":"format_integer.js"},{"uid":"cc15b84d-19","name":"is_string.js"},{"uid":"cc15b84d-21","name":"format_double.js"},{"uid":"cc15b84d-23","name":"space_pad.js"},{"uid":"cc15b84d-25","name":"main.js"}]},{"name":"string-base-format-tokenize/lib/main.js","uid":"cc15b84d-27"},{"name":"string-format/lib","children":[{"uid":"cc15b84d-29","name":"is_string.js"},{"uid":"cc15b84d-31","name":"main.js"}]},{"name":"utils-define-nonenumerable-read-only-property/lib/main.js","uid":"cc15b84d-37"},{"name":"ndarray-base-minmax-view-buffer-index/lib","children":[{"uid":"cc15b84d-39","name":"main.js"},{"uid":"cc15b84d-41","name":"assign.js"},{"uid":"cc15b84d-43","name":"index.js"}]},{"name":"array-base-assert-is-accessor-array/lib/main.js","uid":"cc15b84d-45"},{"name":"array-base-accessor-getter/lib/main.js","uid":"cc15b84d-47"},{"name":"array-base-accessor-setter/lib/main.js","uid":"cc15b84d-49"},{"name":"array-base-getter/lib/main.js","uid":"cc15b84d-51"},{"name":"array-base-setter/lib/main.js","uid":"cc15b84d-53"},{"name":"ndarray-base-numel/lib/main.js","uid":"cc15b84d-55"},{"name":"ndarray-base-dtype/lib/main.js","uid":"cc15b84d-57"},{"name":"array-base-copy-indexed/lib/main.js","uid":"cc15b84d-59"},{"name":"ndarray-base-shape/lib/main.js","uid":"cc15b84d-61"},{"name":"assert-is-string/lib","children":[{"uid":"cc15b84d-63","name":"primitive.js"},{"uid":"cc15b84d-83","name":"valueof.js"},{"uid":"cc15b84d-85","name":"try2valueof.js"},{"uid":"cc15b84d-87","name":"object.js"},{"uid":"cc15b84d-89","name":"main.js"},{"uid":"cc15b84d-91","name":"index.js"}]},{"name":"assert-has-symbol-support/lib/main.js","uid":"cc15b84d-65"},{"name":"assert-has-tostringtag-support/lib/main.js","uid":"cc15b84d-67"},{"name":"utils-native-class/lib","children":[{"uid":"cc15b84d-69","name":"tostring.js"},{"uid":"cc15b84d-71","name":"main.js"},{"uid":"cc15b84d-77","name":"tostringtag.js"},{"uid":"cc15b84d-79","name":"polyfill.js"},{"uid":"cc15b84d-81","name":"index.js"}]},{"name":"assert-has-own-property/lib/main.js","uid":"cc15b84d-73"},{"name":"symbol-ctor/lib/main.js","uid":"cc15b84d-75"},{"name":"ndarray-base-assert-is-column-major-string/lib/main.js","uid":"cc15b84d-93"},{"name":"ndarray-base-shape2strides/lib","children":[{"uid":"cc15b84d-95","name":"main.js"},{"uid":"cc15b84d-97","name":"assign.js"},{"uid":"cc15b84d-99","name":"index.js"}]},{"name":"ndarray-base-strides/lib/main.js","uid":"cc15b84d-101"},{"name":"assert-is-number/lib","children":[{"uid":"cc15b84d-103","name":"primitive.js"},{"uid":"cc15b84d-107","name":"tostring.js"},{"uid":"cc15b84d-109","name":"try2serialize.js"},{"uid":"cc15b84d-111","name":"object.js"},{"uid":"cc15b84d-113","name":"main.js"},{"uid":"cc15b84d-115","name":"index.js"}]},{"name":"number-ctor/lib/main.js","uid":"cc15b84d-105"},{"name":"ndarray-base-strides2offset/lib/main.js","uid":"cc15b84d-117"},{"name":"ndarray-base-offset/lib/main.js","uid":"cc15b84d-119"},{"name":"math-base-special-abs/lib/main.js","uid":"cc15b84d-121"},{"name":"ndarray-base-strides2order/lib/main.js","uid":"cc15b84d-123"},{"name":"ndarray-base-order/lib/main.js","uid":"cc15b84d-125"},{"name":"ndarray-base-data-buffer/lib/main.js","uid":"cc15b84d-127"},{"name":"ndarray-base-ndarraylike2object/lib/main.js","uid":"cc15b84d-129"},{"name":"array-base-assert-is-complex128array/lib/main.js","uid":"cc15b84d-131"},{"name":"array-base-assert-is-complex64array/lib/main.js","uid":"cc15b84d-133"},{"name":"assert-is-float64array/lib/main.js","uid":"cc15b84d-135"},{"name":"assert-has-float64array-support/lib","children":[{"uid":"cc15b84d-137","name":"float64array.js"},{"uid":"cc15b84d-139","name":"main.js"}]},{"name":"array-float64/lib","children":[{"uid":"cc15b84d-141","name":"main.js"},{"uid":"cc15b84d-143","name":"polyfill.js"},{"uid":"cc15b84d-145","name":"index.js"}]},{"name":"strided-base-reinterpret-complex128/lib/main.js","uid":"cc15b84d-147"},{"name":"assert-is-float32array/lib/main.js","uid":"cc15b84d-149"},{"name":"constants-float64-pinf/lib/index.js","uid":"cc15b84d-151"},{"name":"assert-has-float32array-support/lib","children":[{"uid":"cc15b84d-153","name":"float32array.js"},{"uid":"cc15b84d-155","name":"main.js"}]},{"name":"array-float32/lib","children":[{"uid":"cc15b84d-157","name":"main.js"},{"uid":"cc15b84d-159","name":"polyfill.js"},{"uid":"cc15b84d-161","name":"index.js"}]},{"name":"strided-base-reinterpret-complex64/lib/main.js","uid":"cc15b84d-163"},{"name":"strided-base-reinterpret-complex/lib/main.js","uid":"cc15b84d-165"},{"name":"assert-is-uint8array/lib/main.js","uid":"cc15b84d-167"},{"name":"constants-uint8-max/lib/index.js","uid":"cc15b84d-169"},{"name":"assert-has-uint8array-support/lib","children":[{"uid":"cc15b84d-171","name":"uint8array.js"},{"uid":"cc15b84d-173","name":"main.js"}]},{"name":"array-uint8/lib","children":[{"uid":"cc15b84d-175","name":"main.js"},{"uid":"cc15b84d-177","name":"polyfill.js"},{"uid":"cc15b84d-179","name":"index.js"}]},{"name":"strided-base-reinterpret-boolean/lib/main.js","uid":"cc15b84d-181"},{"name":"strided-base-stride2offset/lib/main.js","uid":"cc15b84d-183"},{"name":"assert-is-array/lib/main.js","uid":"cc15b84d-185"},{"name":"assert-tools-array-function/lib/main.js","uid":"cc15b84d-187"},{"name":"assert-is-object-like/lib","children":[{"uid":"cc15b84d-189","name":"main.js"},{"uid":"cc15b84d-191","name":"index.js"}]},{"name":"assert-is-buffer/lib/main.js","uid":"cc15b84d-193"},{"name":"regexp-function-name/lib","children":[{"uid":"cc15b84d-195","name":"main.js"},{"uid":"cc15b84d-197","name":"regexp.js"},{"uid":"cc15b84d-199","name":"index.js"}]},{"name":"utils-constructor-name/lib/main.js","uid":"cc15b84d-201"},{"name":"array-dtype/lib","children":[{"uid":"cc15b84d-203","name":"ctor2dtype.js"},{"uid":"cc15b84d-433","name":"ctors.js"},{"uid":"cc15b84d-435","name":"dtypes.js"},{"uid":"cc15b84d-437","name":"main.js"}]},{"name":"assert-is-uint32array/lib/main.js","uid":"cc15b84d-205"},{"name":"constants-uint32-max/lib/index.js","uid":"cc15b84d-207"},{"name":"assert-has-uint32array-support/lib","children":[{"uid":"cc15b84d-209","name":"uint32array.js"},{"uid":"cc15b84d-211","name":"main.js"}]},{"name":"array-uint32/lib","children":[{"uid":"cc15b84d-213","name":"main.js"},{"uid":"cc15b84d-215","name":"polyfill.js"},{"uid":"cc15b84d-217","name":"index.js"}]},{"name":"assert-is-int32array/lib/main.js","uid":"cc15b84d-219"},{"name":"constants-int32-max/lib/index.js","uid":"cc15b84d-221"},{"name":"constants-int32-min/lib/index.js","uid":"cc15b84d-223"},{"name":"assert-has-int32array-support/lib","children":[{"uid":"cc15b84d-225","name":"int32array.js"},{"uid":"cc15b84d-227","name":"main.js"}]},{"name":"array-int32/lib","children":[{"uid":"cc15b84d-229","name":"main.js"},{"uid":"cc15b84d-231","name":"polyfill.js"},{"uid":"cc15b84d-233","name":"index.js"}]},{"name":"assert-is-uint16array/lib/main.js","uid":"cc15b84d-235"},{"name":"constants-uint16-max/lib/index.js","uid":"cc15b84d-237"},{"name":"assert-has-uint16array-support/lib","children":[{"uid":"cc15b84d-239","name":"uint16array.js"},{"uid":"cc15b84d-241","name":"main.js"}]},{"name":"array-uint16/lib","children":[{"uid":"cc15b84d-243","name":"main.js"},{"uid":"cc15b84d-245","name":"polyfill.js"},{"uid":"cc15b84d-247","name":"index.js"}]},{"name":"assert-is-int16array/lib/main.js","uid":"cc15b84d-249"},{"name":"constants-int16-max/lib/index.js","uid":"cc15b84d-251"},{"name":"constants-int16-min/lib/index.js","uid":"cc15b84d-253"},{"name":"assert-has-int16array-support/lib","children":[{"uid":"cc15b84d-255","name":"int16array.js"},{"uid":"cc15b84d-257","name":"main.js"}]},{"name":"array-int16/lib","children":[{"uid":"cc15b84d-259","name":"main.js"},{"uid":"cc15b84d-261","name":"polyfill.js"},{"uid":"cc15b84d-263","name":"index.js"}]},{"name":"assert-is-uint8clampedarray/lib/main.js","uid":"cc15b84d-265"},{"name":"assert-has-uint8clampedarray-support/lib","children":[{"uid":"cc15b84d-267","name":"uint8clampedarray.js"},{"uid":"cc15b84d-269","name":"main.js"}]},{"name":"array-uint8c/lib","children":[{"uid":"cc15b84d-271","name":"main.js"},{"uid":"cc15b84d-273","name":"polyfill.js"},{"uid":"cc15b84d-275","name":"index.js"}]},{"name":"assert-is-int8array/lib/main.js","uid":"cc15b84d-277"},{"name":"constants-int8-max/lib/index.js","uid":"cc15b84d-279"},{"name":"constants-int8-min/lib/index.js","uid":"cc15b84d-281"},{"name":"assert-has-int8array-support/lib","children":[{"uid":"cc15b84d-283","name":"int8array.js"},{"uid":"cc15b84d-285","name":"main.js"}]},{"name":"array-int8/lib","children":[{"uid":"cc15b84d-287","name":"main.js"},{"uid":"cc15b84d-289","name":"polyfill.js"},{"uid":"cc15b84d-291","name":"index.js"}]},{"name":"constants-float64-ninf/lib/index.js","uid":"cc15b84d-293"},{"name":"math-base-special-floor/lib/main.js","uid":"cc15b84d-295"},{"name":"math-base-assert-is-integer/lib/main.js","uid":"cc15b84d-297"},{"name":"assert-is-integer/lib","children":[{"uid":"cc15b84d-299","name":"integer.js"},{"uid":"cc15b84d-301","name":"primitive.js"},{"uid":"cc15b84d-303","name":"object.js"},{"uid":"cc15b84d-305","name":"main.js"},{"uid":"cc15b84d-307","name":"index.js"}]},{"name":"assert-is-nonnegative-integer/lib","children":[{"uid":"cc15b84d-309","name":"primitive.js"},{"uid":"cc15b84d-311","name":"object.js"},{"uid":"cc15b84d-313","name":"main.js"},{"uid":"cc15b84d-315","name":"index.js"}]},{"name":"constants-array-max-array-length/lib/index.js","uid":"cc15b84d-317"},{"name":"assert-is-array-like-object/lib/main.js","uid":"cc15b84d-319"},{"name":"constants-array-max-typed-array-length/lib/index.js","uid":"cc15b84d-321"},{"name":"assert-is-collection/lib/main.js","uid":"cc15b84d-323"},{"name":"assert-is-arraybuffer/lib/main.js","uid":"cc15b84d-325"},{"name":"assert-is-object/lib/main.js","uid":"cc15b84d-327"},{"name":"assert-is-string-array/lib/index.js","uid":"cc15b84d-329"},{"name":"utils-type-of/lib","children":[{"name":"fixtures","children":[{"uid":"cc15b84d-331","name":"re.js"},{"uid":"cc15b84d-357","name":"nodelist.js"},{"uid":"cc15b84d-359","name":"typedarray.js"}]},{"uid":"cc15b84d-361","name":"check.js"},{"uid":"cc15b84d-363","name":"main.js"},{"uid":"cc15b84d-365","name":"polyfill.js"},{"uid":"cc15b84d-367","name":"index.js"}]},{"name":"assert-is-boolean/lib","children":[{"uid":"cc15b84d-333","name":"primitive.js"},{"uid":"cc15b84d-337","name":"tostring.js"},{"uid":"cc15b84d-339","name":"try2serialize.js"},{"uid":"cc15b84d-341","name":"object.js"},{"uid":"cc15b84d-343","name":"main.js"},{"uid":"cc15b84d-345","name":"index.js"}]},{"name":"boolean-ctor/lib/main.js","uid":"cc15b84d-335"},{"name":"utils-global/lib","children":[{"uid":"cc15b84d-347","name":"codegen.js"},{"uid":"cc15b84d-349","name":"self.js"},{"uid":"cc15b84d-351","name":"window.js"},{"uid":"cc15b84d-353","name":"global_this.js"},{"uid":"cc15b84d-355","name":"browser.js"}]},{"name":"assert-is-function/lib/main.js","uid":"cc15b84d-369"},{"name":"utils-define-read-only-property/lib/main.js","uid":"cc15b84d-371"},{"name":"complex-float64-ctor/lib","children":[{"uid":"cc15b84d-373","name":"tostring.js"},{"uid":"cc15b84d-375","name":"tojson.js"},{"uid":"cc15b84d-377","name":"main.js"}]},{"name":"number-float64-base-to-float32/lib","children":[{"uid":"cc15b84d-379","name":"main.js"},{"uid":"cc15b84d-381","name":"polyfill.js"},{"uid":"cc15b84d-383","name":"index.js"}]},{"name":"complex-float32-ctor/lib","children":[{"uid":"cc15b84d-385","name":"tostring.js"},{"uid":"cc15b84d-387","name":"tojson.js"},{"uid":"cc15b84d-389","name":"main.js"}]},{"name":"assert-is-complex-like/lib/main.js","uid":"cc15b84d-391"},{"name":"math-base-assert-is-even/lib/main.js","uid":"cc15b84d-393"},{"name":"assert-has-iterator-symbol-support/lib/main.js","uid":"cc15b84d-395"},{"name":"symbol-iterator/lib/main.js","uid":"cc15b84d-397"},{"name":"utils-define-nonenumerable-read-only-accessor/lib/main.js","uid":"cc15b84d-399"},{"name":"complex-float32-real/lib/main.js","uid":"cc15b84d-401"},{"name":"complex-float32-imag/lib/main.js","uid":"cc15b84d-403"},{"name":"array-complex64/lib","children":[{"uid":"cc15b84d-405","name":"from_iterator.js"},{"uid":"cc15b84d-407","name":"from_iterator_map.js"},{"uid":"cc15b84d-409","name":"from_array.js"},{"uid":"cc15b84d-411","name":"main.js"}]},{"name":"complex-float64-real/lib/main.js","uid":"cc15b84d-413"},{"name":"complex-float64-imag/lib/main.js","uid":"cc15b84d-415"},{"name":"array-complex128/lib","children":[{"uid":"cc15b84d-417","name":"from_iterator.js"},{"uid":"cc15b84d-419","name":"from_iterator_map.js"},{"uid":"cc15b84d-421","name":"from_array.js"},{"uid":"cc15b84d-423","name":"main.js"}]},{"name":"array-bool/lib","children":[{"uid":"cc15b84d-425","name":"from_iterator.js"},{"uid":"cc15b84d-427","name":"from_iterator_map.js"},{"uid":"cc15b84d-429","name":"from_array.js"},{"uid":"cc15b84d-431","name":"main.js"}]},{"name":"array-base-arraylike2object/lib/main.js","uid":"cc15b84d-439"},{"name":"blas-base-gscal/lib","children":[{"uid":"cc15b84d-441","name":"accessors.js"},{"uid":"cc15b84d-443","name":"ndarray.js"},{"uid":"cc15b84d-445","name":"main.js"},{"uid":"cc15b84d-447","name":"index.js"}]},{"name":"array-base-zero-to/lib","children":[{"uid":"cc15b84d-449","name":"main.js"},{"uid":"cc15b84d-451","name":"assign.js"},{"uid":"cc15b84d-453","name":"index.js"}]},{"name":"array-base-take-indexed/lib/main.js","uid":"cc15b84d-455"},{"name":"ndarray-base-nullary-loop-interchange-order/lib","children":[{"uid":"cc15b84d-457","name":"sort2ins.js"},{"uid":"cc15b84d-459","name":"main.js"}]},{"name":"assert-is-positive-integer/lib","children":[{"uid":"cc15b84d-461","name":"primitive.js"},{"uid":"cc15b84d-463","name":"object.js"},{"uid":"cc15b84d-465","name":"main.js"},{"uid":"cc15b84d-467","name":"index.js"}]},{"name":"utils-keys/lib","children":[{"uid":"cc15b84d-469","name":"builtin.js"},{"uid":"cc15b84d-471","name":"has_arguments_bug.js"},{"uid":"cc15b84d-473","name":"has_builtin.js"},{"uid":"cc15b84d-499","name":"builtin_wrapper.js"},{"uid":"cc15b84d-503","name":"has_enumerable_prototype_bug.js"},{"uid":"cc15b84d-505","name":"has_non_enumerable_properties_bug.js"},{"uid":"cc15b84d-509","name":"is_constructor_prototype.js"},{"uid":"cc15b84d-511","name":"excluded_keys.json"},{"uid":"cc15b84d-513","name":"window.js"},{"uid":"cc15b84d-515","name":"has_automation_equality_bug.js"},{"uid":"cc15b84d-517","name":"has_window.js"},{"uid":"cc15b84d-519","name":"is_constructor_prototype_wrapper.js"},{"uid":"cc15b84d-521","name":"non_enumerable.json"},{"uid":"cc15b84d-523","name":"polyfill.js"},{"uid":"cc15b84d-525","name":"main.js"}]},{"name":"assert-is-arguments/lib","children":[{"uid":"cc15b84d-475","name":"main.js"},{"uid":"cc15b84d-477","name":"detect.js"},{"uid":"cc15b84d-495","name":"polyfill.js"},{"uid":"cc15b84d-497","name":"index.js"}]},{"name":"math-base-assert-is-nan/lib/main.js","uid":"cc15b84d-479"},{"name":"assert-is-nan/lib","children":[{"uid":"cc15b84d-481","name":"primitive.js"},{"uid":"cc15b84d-483","name":"object.js"},{"uid":"cc15b84d-485","name":"main.js"},{"uid":"cc15b84d-487","name":"index.js"}]},{"name":"assert-is-enumerable-property/lib","children":[{"uid":"cc15b84d-489","name":"native.js"},{"uid":"cc15b84d-491","name":"has_string_enumerability_bug.js"},{"uid":"cc15b84d-493","name":"main.js"}]},{"name":"utils-noop/lib/main.js","uid":"cc15b84d-501"},{"name":"utils-index-of/lib/main.js","uid":"cc15b84d-507"},{"name":"object-ctor/lib/main.js","uid":"cc15b84d-527"},{"name":"utils-get-prototype-of/lib","children":[{"uid":"cc15b84d-529","name":"native.js"},{"uid":"cc15b84d-531","name":"proto.js"},{"uid":"cc15b84d-533","name":"polyfill.js"},{"uid":"cc15b84d-535","name":"detect.js"},{"uid":"cc15b84d-537","name":"main.js"}]},{"name":"assert-is-plain-object/lib/main.js","uid":"cc15b84d-539"},{"name":"object-inverse/lib/main.js","uid":"cc15b84d-541"},{"name":"ndarray-base-dtype-enums/lib/main.js","uid":"cc15b84d-543"},{"name":"ndarray-base-dtype-enum2str/lib/main.js","uid":"cc15b84d-545"},{"name":"ndarray-base-bytes-per-element/lib","children":[{"uid":"cc15b84d-547","name":"bytes_per_element.json"},{"uid":"cc15b84d-549","name":"main.js"}]},{"name":"ndarray-base-tiling-block-size/lib","children":[{"uid":"cc15b84d-551","name":"defaults.js"},{"uid":"cc15b84d-553","name":"main.js"}]},{"name":"ndarray-base-nullary-tiling-block-size/lib/main.js","uid":"cc15b84d-555"},{"name":"ndarray-base-vind2bind/lib/main.js","uid":"cc15b84d-633"}]},{"name":"lib","children":[{"uid":"cc15b84d-557","name":"2d_blocked_accessors.js"},{"uid":"cc15b84d-559","name":"3d_blocked_accessors.js"},{"uid":"cc15b84d-561","name":"4d_blocked_accessors.js"},{"uid":"cc15b84d-563","name":"5d_blocked_accessors.js"},{"uid":"cc15b84d-565","name":"6d_blocked_accessors.js"},{"uid":"cc15b84d-567","name":"7d_blocked_accessors.js"},{"uid":"cc15b84d-569","name":"8d_blocked_accessors.js"},{"uid":"cc15b84d-571","name":"9d_blocked_accessors.js"},{"uid":"cc15b84d-573","name":"10d_blocked_accessors.js"},{"uid":"cc15b84d-575","name":"2d_blocked_complex.js"},{"uid":"cc15b84d-577","name":"3d_blocked_complex.js"},{"uid":"cc15b84d-579","name":"4d_blocked_complex.js"},{"uid":"cc15b84d-581","name":"5d_blocked_complex.js"},{"uid":"cc15b84d-583","name":"6d_blocked_complex.js"},{"uid":"cc15b84d-585","name":"7d_blocked_complex.js"},{"uid":"cc15b84d-587","name":"8d_blocked_complex.js"},{"uid":"cc15b84d-589","name":"9d_blocked_complex.js"},{"uid":"cc15b84d-591","name":"10d_blocked_complex.js"},{"uid":"cc15b84d-593","name":"2d_blocked.js"},{"uid":"cc15b84d-595","name":"3d_blocked.js"},{"uid":"cc15b84d-597","name":"4d_blocked.js"},{"uid":"cc15b84d-599","name":"5d_blocked.js"},{"uid":"cc15b84d-601","name":"6d_blocked.js"},{"uid":"cc15b84d-603","name":"7d_blocked.js"},{"uid":"cc15b84d-605","name":"8d_blocked.js"},{"uid":"cc15b84d-607","name":"9d_blocked.js"},{"uid":"cc15b84d-609","name":"10d_blocked.js"},{"uid":"cc15b84d-611","name":"0d_accessors.js"},{"uid":"cc15b84d-613","name":"1d_accessors.js"},{"uid":"cc15b84d-615","name":"2d_accessors.js"},{"uid":"cc15b84d-617","name":"3d_accessors.js"},{"uid":"cc15b84d-619","name":"4d_accessors.js"},{"uid":"cc15b84d-621","name":"5d_accessors.js"},{"uid":"cc15b84d-623","name":"6d_accessors.js"},{"uid":"cc15b84d-625","name":"7d_accessors.js"},{"uid":"cc15b84d-627","name":"8d_accessors.js"},{"uid":"cc15b84d-629","name":"9d_accessors.js"},{"uid":"cc15b84d-631","name":"10d_accessors.js"},{"uid":"cc15b84d-635","name":"nd_accessors.js"},{"uid":"cc15b84d-637","name":"0d_complex.js"},{"uid":"cc15b84d-639","name":"1d_complex.js"},{"uid":"cc15b84d-641","name":"2d_complex.js"},{"uid":"cc15b84d-643","name":"3d_complex.js"},{"uid":"cc15b84d-645","name":"4d_complex.js"},{"uid":"cc15b84d-647","name":"5d_complex.js"},{"uid":"cc15b84d-649","name":"6d_complex.js"},{"uid":"cc15b84d-651","name":"7d_complex.js"},{"uid":"cc15b84d-653","name":"8d_complex.js"},{"uid":"cc15b84d-655","name":"9d_complex.js"},{"uid":"cc15b84d-657","name":"10d_complex.js"},{"uid":"cc15b84d-659","name":"nd_complex.js"},{"uid":"cc15b84d-661","name":"0d.js"},{"uid":"cc15b84d-663","name":"1d.js"},{"uid":"cc15b84d-665","name":"2d.js"},{"uid":"cc15b84d-667","name":"3d.js"},{"uid":"cc15b84d-669","name":"4d.js"},{"uid":"cc15b84d-671","name":"5d.js"},{"uid":"cc15b84d-673","name":"6d.js"},{"uid":"cc15b84d-675","name":"7d.js"},{"uid":"cc15b84d-677","name":"8d.js"},{"uid":"cc15b84d-679","name":"9d.js"},{"uid":"cc15b84d-681","name":"10d.js"},{"uid":"cc15b84d-683","name":"nd.js"},{"uid":"cc15b84d-685","name":"main.js"},{"uid":"cc15b84d-687","name":"index.js"}]}]}],"isRoot":true},"nodeParts":{"cc15b84d-1":{"renderedLength":2016,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-0"},"cc15b84d-3":{"renderedLength":1698,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-2"},"cc15b84d-5":{"renderedLength":1657,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-4"},"cc15b84d-7":{"renderedLength":742,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-6"},"cc15b84d-9":{"renderedLength":1093,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-8"},"cc15b84d-11":{"renderedLength":2991,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-10"},"cc15b84d-13":{"renderedLength":1216,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-12"},"cc15b84d-15":{"renderedLength":1808,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-14"},"cc15b84d-17":{"renderedLength":2661,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-16"},"cc15b84d-19":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-18"},"cc15b84d-21":{"renderedLength":2809,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-20"},"cc15b84d-23":{"renderedLength":1387,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-22"},"cc15b84d-25":{"renderedLength":6765,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-24"},"cc15b84d-27":{"renderedLength":2118,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-26"},"cc15b84d-29":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-28"},"cc15b84d-31":{"renderedLength":1470,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-30"},"cc15b84d-33":{"renderedLength":4793,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-32"},"cc15b84d-35":{"renderedLength":852,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-34"},"cc15b84d-37":{"renderedLength":1231,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-36"},"cc15b84d-39":{"renderedLength":2145,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-38"},"cc15b84d-41":{"renderedLength":2655,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-40"},"cc15b84d-43":{"renderedLength":736,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-42"},"cc15b84d-45":{"renderedLength":1271,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-44"},"cc15b84d-47":{"renderedLength":2927,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-46"},"cc15b84d-49":{"renderedLength":3350,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-48"},"cc15b84d-51":{"renderedLength":6375,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-50"},"cc15b84d-53":{"renderedLength":6167,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-52"},"cc15b84d-55":{"renderedLength":1098,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-54"},"cc15b84d-57":{"renderedLength":1008,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-56"},"cc15b84d-59":{"renderedLength":1094,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-58"},"cc15b84d-61":{"renderedLength":1175,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-60"},"cc15b84d-63":{"renderedLength":1026,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-62"},"cc15b84d-65":{"renderedLength":975,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-64"},"cc15b84d-67":{"renderedLength":1035,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-66"},"cc15b84d-69":{"renderedLength":688,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-68"},"cc15b84d-71":{"renderedLength":1275,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-70"},"cc15b84d-73":{"renderedLength":1329,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-72"},"cc15b84d-75":{"renderedLength":757,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-74"},"cc15b84d-77":{"renderedLength":719,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-76"},"cc15b84d-79":{"renderedLength":1896,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-78"},"cc15b84d-81":{"renderedLength":806,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-80"},"cc15b84d-83":{"renderedLength":740,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-82"},"cc15b84d-85":{"renderedLength":978,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-84"},"cc15b84d-87":{"renderedLength":1276,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-86"},"cc15b84d-89":{"renderedLength":1037,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-88"},"cc15b84d-91":{"renderedLength":778,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-90"},"cc15b84d-93":{"renderedLength":1102,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-92"},"cc15b84d-95":{"renderedLength":2060,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-94"},"cc15b84d-97":{"renderedLength":2315,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-96"},"cc15b84d-99":{"renderedLength":720,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-98"},"cc15b84d-101":{"renderedLength":1492,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-100"},"cc15b84d-103":{"renderedLength":1087,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-102"},"cc15b84d-105":{"renderedLength":719,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-104"},"cc15b84d-107":{"renderedLength":758,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-106"},"cc15b84d-109":{"renderedLength":988,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-108"},"cc15b84d-111":{"renderedLength":1272,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-110"},"cc15b84d-113":{"renderedLength":1165,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-112"},"cc15b84d-115":{"renderedLength":778,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-114"},"cc15b84d-117":{"renderedLength":1461,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-116"},"cc15b84d-119":{"renderedLength":1274,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-118"},"cc15b84d-121":{"renderedLength":1187,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-120"},"cc15b84d-123":{"renderedLength":1709,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-122"},"cc15b84d-125":{"renderedLength":2028,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-124"},"cc15b84d-127":{"renderedLength":1039,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-126"},"cc15b84d-129":{"renderedLength":3363,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-128"},"cc15b84d-131":{"renderedLength":1765,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-130"},"cc15b84d-133":{"renderedLength":1753,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-132"},"cc15b84d-135":{"renderedLength":1367,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-134"},"cc15b84d-137":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-136"},"cc15b84d-139":{"renderedLength":1322,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-138"},"cc15b84d-141":{"renderedLength":772,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-140"},"cc15b84d-143":{"renderedLength":901,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-142"},"cc15b84d-145":{"renderedLength":800,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-144"},"cc15b84d-147":{"renderedLength":1288,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-146"},"cc15b84d-149":{"renderedLength":1367,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-148"},"cc15b84d-151":{"renderedLength":1364,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-150"},"cc15b84d-153":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-152"},"cc15b84d-155":{"renderedLength":1355,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-154"},"cc15b84d-157":{"renderedLength":772,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-156"},"cc15b84d-159":{"renderedLength":901,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-158"},"cc15b84d-161":{"renderedLength":800,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-160"},"cc15b84d-163":{"renderedLength":1283,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-162"},"cc15b84d-165":{"renderedLength":2027,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-164"},"cc15b84d-167":{"renderedLength":1341,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-166"},"cc15b84d-169":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-168"},"cc15b84d-171":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-170"},"cc15b84d-173":{"renderedLength":1468,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-172"},"cc15b84d-175":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-174"},"cc15b84d-177":{"renderedLength":885,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-176"},"cc15b84d-179":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-178"},"cc15b84d-181":{"renderedLength":1254,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-180"},"cc15b84d-183":{"renderedLength":1104,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-182"},"cc15b84d-185":{"renderedLength":1168,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-184"},"cc15b84d-187":{"renderedLength":1905,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-186"},"cc15b84d-189":{"renderedLength":1101,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-188"},"cc15b84d-191":{"renderedLength":803,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-190"},"cc15b84d-193":{"renderedLength":1592,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-192"},"cc15b84d-195":{"renderedLength":1312,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-194"},"cc15b84d-197":{"renderedLength":1319,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-196"},"cc15b84d-199":{"renderedLength":722,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-198"},"cc15b84d-201":{"renderedLength":1623,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-200"},"cc15b84d-203":{"renderedLength":1084,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-202"},"cc15b84d-205":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-204"},"cc15b84d-207":{"renderedLength":1183,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-206"},"cc15b84d-209":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-208"},"cc15b84d-211":{"renderedLength":1479,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-210"},"cc15b84d-213":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-212"},"cc15b84d-215":{"renderedLength":886,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-214"},"cc15b84d-217":{"renderedLength":798,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-216"},"cc15b84d-219":{"renderedLength":1343,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-218"},"cc15b84d-221":{"renderedLength":1198,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-220"},"cc15b84d-223":{"renderedLength":1217,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-222"},"cc15b84d-225":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-224"},"cc15b84d-227":{"renderedLength":1363,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-226"},"cc15b84d-229":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-228"},"cc15b84d-231":{"renderedLength":900,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-230"},"cc15b84d-233":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-232"},"cc15b84d-235":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-234"},"cc15b84d-237":{"renderedLength":1175,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-236"},"cc15b84d-239":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-238"},"cc15b84d-241":{"renderedLength":1479,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-240"},"cc15b84d-243":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-242"},"cc15b84d-245":{"renderedLength":886,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-244"},"cc15b84d-247":{"renderedLength":798,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-246"},"cc15b84d-249":{"renderedLength":1343,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-248"},"cc15b84d-251":{"renderedLength":1167,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-250"},"cc15b84d-253":{"renderedLength":1186,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-252"},"cc15b84d-255":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-254"},"cc15b84d-257":{"renderedLength":1363,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-256"},"cc15b84d-259":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-258"},"cc15b84d-261":{"renderedLength":900,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-260"},"cc15b84d-263":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-262"},"cc15b84d-265":{"renderedLength":1426,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-264"},"cc15b84d-267":{"renderedLength":780,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-266"},"cc15b84d-269":{"renderedLength":1514,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-268"},"cc15b84d-271":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-270"},"cc15b84d-273":{"renderedLength":902,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-272"},"cc15b84d-275":{"renderedLength":810,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-274"},"cc15b84d-277":{"renderedLength":1330,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-276"},"cc15b84d-279":{"renderedLength":1144,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-278"},"cc15b84d-281":{"renderedLength":1163,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-280"},"cc15b84d-283":{"renderedLength":764,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-282"},"cc15b84d-285":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-284"},"cc15b84d-287":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-286"},"cc15b84d-289":{"renderedLength":897,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-288"},"cc15b84d-291":{"renderedLength":784,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-290"},"cc15b84d-293":{"renderedLength":1091,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-292"},"cc15b84d-295":{"renderedLength":1133,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-294"},"cc15b84d-297":{"renderedLength":1039,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-296"},"cc15b84d-299":{"renderedLength":974,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-298"},"cc15b84d-301":{"renderedLength":1113,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-300"},"cc15b84d-303":{"renderedLength":1115,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-302"},"cc15b84d-305":{"renderedLength":1177,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-304"},"cc15b84d-307":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-306"},"cc15b84d-309":{"renderedLength":1157,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-308"},"cc15b84d-311":{"renderedLength":1161,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-310"},"cc15b84d-313":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-312"},"cc15b84d-315":{"renderedLength":826,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-314"},"cc15b84d-317":{"renderedLength":1072,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-316"},"cc15b84d-319":{"renderedLength":1300,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-318"},"cc15b84d-321":{"renderedLength":1079,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-320"},"cc15b84d-323":{"renderedLength":1189,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-322"},"cc15b84d-325":{"renderedLength":1356,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-324"},"cc15b84d-327":{"renderedLength":1064,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-326"},"cc15b84d-329":{"renderedLength":968,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-328"},"cc15b84d-331":{"renderedLength":650,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-330"},"cc15b84d-333":{"renderedLength":1147,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-332"},"cc15b84d-335":{"renderedLength":1099,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-334"},"cc15b84d-337":{"renderedLength":745,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-336"},"cc15b84d-339":{"renderedLength":988,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-338"},"cc15b84d-341":{"renderedLength":1324,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-340"},"cc15b84d-343":{"renderedLength":1292,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-342"},"cc15b84d-345":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-344"},"cc15b84d-347":{"renderedLength":890,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-346"},"cc15b84d-349":{"renderedLength":705,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-348"},"cc15b84d-351":{"renderedLength":709,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-350"},"cc15b84d-353":{"renderedLength":749,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-352"},"cc15b84d-355":{"renderedLength":1824,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-354"},"cc15b84d-357":{"renderedLength":733,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-356"},"cc15b84d-359":{"renderedLength":710,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-358"},"cc15b84d-361":{"renderedLength":1332,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-360"},"cc15b84d-363":{"renderedLength":1694,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-362"},"cc15b84d-365":{"renderedLength":849,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-364"},"cc15b84d-367":{"renderedLength":698,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-366"},"cc15b84d-369":{"renderedLength":1183,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-368"},"cc15b84d-371":{"renderedLength":1189,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-370"},"cc15b84d-373":{"renderedLength":1009,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-372"},"cc15b84d-375":{"renderedLength":911,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-374"},"cc15b84d-377":{"renderedLength":3806,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-376"},"cc15b84d-379":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-378"},"cc15b84d-381":{"renderedLength":1142,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-380"},"cc15b84d-383":{"renderedLength":856,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-382"},"cc15b84d-385":{"renderedLength":1007,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-384"},"cc15b84d-387":{"renderedLength":908,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-386"},"cc15b84d-389":{"renderedLength":3814,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-388"},"cc15b84d-391":{"renderedLength":1409,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-390"},"cc15b84d-393":{"renderedLength":1142,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-392"},"cc15b84d-395":{"renderedLength":1079,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-394"},"cc15b84d-397":{"renderedLength":1527,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-396"},"cc15b84d-399":{"renderedLength":1315,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-398"},"cc15b84d-401":{"renderedLength":1004,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-400"},"cc15b84d-403":{"renderedLength":1014,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-402"},"cc15b84d-405":{"renderedLength":1349,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-404"},"cc15b84d-407":{"renderedLength":1533,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-406"},"cc15b84d-409":{"renderedLength":1195,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-408"},"cc15b84d-411":{"renderedLength":82989,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-410"},"cc15b84d-413":{"renderedLength":1004,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-412"},"cc15b84d-415":{"renderedLength":1014,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-414"},"cc15b84d-417":{"renderedLength":1345,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-416"},"cc15b84d-419":{"renderedLength":1529,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-418"},"cc15b84d-421":{"renderedLength":1191,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-420"},"cc15b84d-423":{"renderedLength":82755,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-422"},"cc15b84d-425":{"renderedLength":968,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-424"},"cc15b84d-427":{"renderedLength":1155,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-426"},"cc15b84d-429":{"renderedLength":997,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-428"},"cc15b84d-431":{"renderedLength":63936,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-430"},"cc15b84d-433":{"renderedLength":920,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-432"},"cc15b84d-435":{"renderedLength":856,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-434"},"cc15b84d-437":{"renderedLength":1373,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-436"},"cc15b84d-439":{"renderedLength":2491,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-438"},"cc15b84d-441":{"renderedLength":2517,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-440"},"cc15b84d-443":{"renderedLength":2106,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-442"},"cc15b84d-445":{"renderedLength":1226,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-444"},"cc15b84d-447":{"renderedLength":705,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-446"},"cc15b84d-449":{"renderedLength":1094,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-448"},"cc15b84d-451":{"renderedLength":4888,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-450"},"cc15b84d-453":{"renderedLength":704,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-452"},"cc15b84d-455":{"renderedLength":1181,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-454"},"cc15b84d-457":{"renderedLength":2294,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-456"},"cc15b84d-459":{"renderedLength":1830,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-458"},"cc15b84d-461":{"renderedLength":1143,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-460"},"cc15b84d-463":{"renderedLength":1147,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-462"},"cc15b84d-465":{"renderedLength":1399,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-464"},"cc15b84d-467":{"renderedLength":814,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-466"},"cc15b84d-469":{"renderedLength":1221,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-468"},"cc15b84d-471":{"renderedLength":1328,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-470"},"cc15b84d-473":{"renderedLength":702,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-472"},"cc15b84d-475":{"renderedLength":1131,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-474"},"cc15b84d-477":{"renderedLength":1106,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-476"},"cc15b84d-479":{"renderedLength":1010,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-478"},"cc15b84d-481":{"renderedLength":1123,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-480"},"cc15b84d-483":{"renderedLength":1099,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-482"},"cc15b84d-485":{"renderedLength":1138,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-484"},"cc15b84d-487":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-486"},"cc15b84d-489":{"renderedLength":1281,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-488"},"cc15b84d-491":{"renderedLength":1084,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-490"},"cc15b84d-493":{"renderedLength":1694,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-492"},"cc15b84d-495":{"renderedLength":1373,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-494"},"cc15b84d-497":{"renderedLength":822,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-496"},"cc15b84d-499":{"renderedLength":1169,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-498"},"cc15b84d-501":{"renderedLength":755,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-500"},"cc15b84d-503":{"renderedLength":833,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-502"},"cc15b84d-505":{"renderedLength":881,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-504"},"cc15b84d-507":{"renderedLength":2990,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-506"},"cc15b84d-509":{"renderedLength":991,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-508"},"cc15b84d-511":{"renderedLength":266,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-510"},"cc15b84d-513":{"renderedLength":710,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-512"},"cc15b84d-515":{"renderedLength":1566,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-514"},"cc15b84d-517":{"renderedLength":697,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-516"},"cc15b84d-519":{"renderedLength":1217,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-518"},"cc15b84d-521":{"renderedLength":132,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-520"},"cc15b84d-523":{"renderedLength":2511,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-522"},"cc15b84d-525":{"renderedLength":1165,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-524"},"cc15b84d-527":{"renderedLength":1195,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-526"},"cc15b84d-529":{"renderedLength":689,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-528"},"cc15b84d-531":{"renderedLength":889,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-530"},"cc15b84d-533":{"renderedLength":1337,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-532"},"cc15b84d-535":{"renderedLength":825,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-534"},"cc15b84d-537":{"renderedLength":1229,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-536"},"cc15b84d-539":{"renderedLength":2759,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-538"},"cc15b84d-541":{"renderedLength":2808,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-540"},"cc15b84d-543":{"renderedLength":2308,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-542"},"cc15b84d-545":{"renderedLength":1308,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-544"},"cc15b84d-547":{"renderedLength":684,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-546"},"cc15b84d-549":{"renderedLength":1628,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-548"},"cc15b84d-551":{"renderedLength":1648,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-550"},"cc15b84d-553":{"renderedLength":1658,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-552"},"cc15b84d-555":{"renderedLength":986,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-554"},"cc15b84d-557":{"renderedLength":3774,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-556"},"cc15b84d-559":{"renderedLength":4136,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-558"},"cc15b84d-561":{"renderedLength":4541,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-560"},"cc15b84d-563":{"renderedLength":4943,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-562"},"cc15b84d-565":{"renderedLength":5403,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-564"},"cc15b84d-567":{"renderedLength":5845,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-566"},"cc15b84d-569":{"renderedLength":6307,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-568"},"cc15b84d-571":{"renderedLength":6789,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-570"},"cc15b84d-573":{"renderedLength":7317,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-572"},"cc15b84d-575":{"renderedLength":3599,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-574"},"cc15b84d-577":{"renderedLength":3960,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-576"},"cc15b84d-579":{"renderedLength":4343,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-578"},"cc15b84d-581":{"renderedLength":4745,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-580"},"cc15b84d-583":{"renderedLength":5205,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-582"},"cc15b84d-585":{"renderedLength":5647,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-584"},"cc15b84d-587":{"renderedLength":6109,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-586"},"cc15b84d-589":{"renderedLength":6591,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-588"},"cc15b84d-591":{"renderedLength":7119,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-590"},"cc15b84d-593":{"renderedLength":3523,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-592"},"cc15b84d-595":{"renderedLength":3908,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-594"},"cc15b84d-597":{"renderedLength":4314,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-596"},"cc15b84d-599":{"renderedLength":4717,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-598"},"cc15b84d-601":{"renderedLength":5178,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-600"},"cc15b84d-603":{"renderedLength":5621,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-602"},"cc15b84d-605":{"renderedLength":6084,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-604"},"cc15b84d-607":{"renderedLength":6567,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-606"},"cc15b84d-609":{"renderedLength":7096,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-608"},"cc15b84d-611":{"renderedLength":2189,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-610"},"cc15b84d-613":{"renderedLength":2898,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-612"},"cc15b84d-615":{"renderedLength":3652,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-614"},"cc15b84d-617":{"renderedLength":3853,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-616"},"cc15b84d-619":{"renderedLength":4062,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-618"},"cc15b84d-621":{"renderedLength":4269,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-620"},"cc15b84d-623":{"renderedLength":4479,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-622"},"cc15b84d-625":{"renderedLength":4692,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-624"},"cc15b84d-627":{"renderedLength":4908,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-626"},"cc15b84d-629":{"renderedLength":5127,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-628"},"cc15b84d-631":{"renderedLength":5389,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-630"},"cc15b84d-633":{"renderedLength":3175,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-632"},"cc15b84d-635":{"renderedLength":3053,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-634"},"cc15b84d-637":{"renderedLength":2043,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-636"},"cc15b84d-639":{"renderedLength":2696,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-638"},"cc15b84d-641":{"renderedLength":3457,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-640"},"cc15b84d-643":{"renderedLength":3658,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-642"},"cc15b84d-645":{"renderedLength":3862,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-644"},"cc15b84d-647":{"renderedLength":4069,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-646"},"cc15b84d-649":{"renderedLength":4279,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-648"},"cc15b84d-651":{"renderedLength":4492,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-650"},"cc15b84d-653":{"renderedLength":4708,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-652"},"cc15b84d-655":{"renderedLength":4927,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-654"},"cc15b84d-657":{"renderedLength":5189,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-656"},"cc15b84d-659":{"renderedLength":2854,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-658"},"cc15b84d-661":{"renderedLength":1982,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-660"},"cc15b84d-663":{"renderedLength":2643,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-662"},"cc15b84d-665":{"renderedLength":3399,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-664"},"cc15b84d-667":{"renderedLength":3623,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-666"},"cc15b84d-669":{"renderedLength":3833,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-668"},"cc15b84d-671":{"renderedLength":4041,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-670"},"cc15b84d-673":{"renderedLength":4252,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-672"},"cc15b84d-675":{"renderedLength":4466,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-674"},"cc15b84d-677":{"renderedLength":4683,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-676"},"cc15b84d-679":{"renderedLength":4903,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-678"},"cc15b84d-681":{"renderedLength":5166,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-680"},"cc15b84d-683":{"renderedLength":2796,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-682"},"cc15b84d-685":{"renderedLength":8336,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-684"},"cc15b84d-687":{"renderedLength":633,"gzipLength":0,"brotliLength":0,"metaUid":"cc15b84d-686"}},"nodeMetas":{"cc15b84d-0":{"id":"/node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-1"},"imported":[],"importedBy":[{"uid":"cc15b84d-688"}]},"cc15b84d-2":{"id":"/node_modules/@stdlib/array-base-assert-is-booleanarray/lib/main.js","moduleParts":{"browser.js":"cc15b84d-3"},"imported":[],"importedBy":[{"uid":"cc15b84d-689"}]},"cc15b84d-4":{"id":"/node_modules/@stdlib/ndarray-base-iteration-order/lib/main.js","moduleParts":{"browser.js":"cc15b84d-5"},"imported":[],"importedBy":[{"uid":"cc15b84d-690"}]},"cc15b84d-6":{"id":"/node_modules/@stdlib/utils-define-property/lib/define_property.js","moduleParts":{"browser.js":"cc15b84d-7"},"imported":[],"importedBy":[{"uid":"cc15b84d-8"}]},"cc15b84d-8":{"id":"/node_modules/@stdlib/utils-define-property/lib/has_define_property_support.js","moduleParts":{"browser.js":"cc15b84d-9"},"imported":[{"uid":"cc15b84d-6"}],"importedBy":[{"uid":"cc15b84d-34"}]},"cc15b84d-10":{"id":"/node_modules/@stdlib/utils-define-property/lib/builtin.js","moduleParts":{"browser.js":"cc15b84d-11"},"imported":[],"importedBy":[{"uid":"cc15b84d-34"}]},"cc15b84d-12":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/is_number.js","moduleParts":{"browser.js":"cc15b84d-13"},"imported":[],"importedBy":[{"uid":"cc15b84d-24"},{"uid":"cc15b84d-16"}]},"cc15b84d-14":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/zero_pad.js","moduleParts":{"browser.js":"cc15b84d-15"},"imported":[],"importedBy":[{"uid":"cc15b84d-24"},{"uid":"cc15b84d-16"}]},"cc15b84d-16":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/format_integer.js","moduleParts":{"browser.js":"cc15b84d-17"},"imported":[{"uid":"cc15b84d-12"},{"uid":"cc15b84d-14"}],"importedBy":[{"uid":"cc15b84d-24"}]},"cc15b84d-18":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/is_string.js","moduleParts":{"browser.js":"cc15b84d-19"},"imported":[],"importedBy":[{"uid":"cc15b84d-24"}]},"cc15b84d-20":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/format_double.js","moduleParts":{"browser.js":"cc15b84d-21"},"imported":[],"importedBy":[{"uid":"cc15b84d-24"}]},"cc15b84d-22":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/space_pad.js","moduleParts":{"browser.js":"cc15b84d-23"},"imported":[],"importedBy":[{"uid":"cc15b84d-24"}]},"cc15b84d-24":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/main.js","moduleParts":{"browser.js":"cc15b84d-25"},"imported":[{"uid":"cc15b84d-16"},{"uid":"cc15b84d-18"},{"uid":"cc15b84d-12"},{"uid":"cc15b84d-20"},{"uid":"cc15b84d-22"},{"uid":"cc15b84d-14"}],"importedBy":[{"uid":"cc15b84d-725"}]},"cc15b84d-26":{"id":"/node_modules/@stdlib/string-base-format-tokenize/lib/main.js","moduleParts":{"browser.js":"cc15b84d-27"},"imported":[],"importedBy":[{"uid":"cc15b84d-726"}]},"cc15b84d-28":{"id":"/node_modules/@stdlib/string-format/lib/is_string.js","moduleParts":{"browser.js":"cc15b84d-29"},"imported":[],"importedBy":[{"uid":"cc15b84d-30"}]},"cc15b84d-30":{"id":"/node_modules/@stdlib/string-format/lib/main.js","moduleParts":{"browser.js":"cc15b84d-31"},"imported":[{"uid":"cc15b84d-725"},{"uid":"cc15b84d-726"},{"uid":"cc15b84d-28"}],"importedBy":[{"uid":"cc15b84d-715"}]},"cc15b84d-32":{"id":"/node_modules/@stdlib/utils-define-property/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-33"},"imported":[{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-34"}]},"cc15b84d-34":{"id":"/node_modules/@stdlib/utils-define-property/lib/index.js","moduleParts":{"browser.js":"cc15b84d-35"},"imported":[{"uid":"cc15b84d-8"},{"uid":"cc15b84d-10"},{"uid":"cc15b84d-32"}],"importedBy":[{"uid":"cc15b84d-36"},{"uid":"cc15b84d-398"},{"uid":"cc15b84d-370"}]},"cc15b84d-36":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/main.js","moduleParts":{"browser.js":"cc15b84d-37"},"imported":[{"uid":"cc15b84d-34"}],"importedBy":[{"uid":"cc15b84d-694"}]},"cc15b84d-38":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/main.js","moduleParts":{"browser.js":"cc15b84d-39"},"imported":[],"importedBy":[{"uid":"cc15b84d-42"}]},"cc15b84d-40":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/assign.js","moduleParts":{"browser.js":"cc15b84d-41"},"imported":[],"importedBy":[{"uid":"cc15b84d-42"}]},"cc15b84d-42":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/index.js","moduleParts":{"browser.js":"cc15b84d-43"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-38"},{"uid":"cc15b84d-40"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-44":{"id":"/node_modules/@stdlib/array-base-assert-is-accessor-array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-45"},"imported":[],"importedBy":[{"uid":"cc15b84d-700"}]},"cc15b84d-46":{"id":"/node_modules/@stdlib/array-base-accessor-getter/lib/main.js","moduleParts":{"browser.js":"cc15b84d-47"},"imported":[],"importedBy":[{"uid":"cc15b84d-701"}]},"cc15b84d-48":{"id":"/node_modules/@stdlib/array-base-accessor-setter/lib/main.js","moduleParts":{"browser.js":"cc15b84d-49"},"imported":[],"importedBy":[{"uid":"cc15b84d-702"}]},"cc15b84d-50":{"id":"/node_modules/@stdlib/array-base-getter/lib/main.js","moduleParts":{"browser.js":"cc15b84d-51"},"imported":[],"importedBy":[{"uid":"cc15b84d-703"}]},"cc15b84d-52":{"id":"/node_modules/@stdlib/array-base-setter/lib/main.js","moduleParts":{"browser.js":"cc15b84d-53"},"imported":[],"importedBy":[{"uid":"cc15b84d-704"}]},"cc15b84d-54":{"id":"/node_modules/@stdlib/ndarray-base-numel/lib/main.js","moduleParts":{"browser.js":"cc15b84d-55"},"imported":[],"importedBy":[{"uid":"cc15b84d-698"}]},"cc15b84d-56":{"id":"/node_modules/@stdlib/ndarray-base-dtype/lib/main.js","moduleParts":{"browser.js":"cc15b84d-57"},"imported":[],"importedBy":[{"uid":"cc15b84d-705"}]},"cc15b84d-58":{"id":"/node_modules/@stdlib/array-base-copy-indexed/lib/main.js","moduleParts":{"browser.js":"cc15b84d-59"},"imported":[],"importedBy":[{"uid":"cc15b84d-719"}]},"cc15b84d-60":{"id":"/node_modules/@stdlib/ndarray-base-shape/lib/main.js","moduleParts":{"browser.js":"cc15b84d-61"},"imported":[{"uid":"cc15b84d-719"}],"importedBy":[{"uid":"cc15b84d-706"}]},"cc15b84d-62":{"id":"/node_modules/@stdlib/assert-is-string/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-63"},"imported":[],"importedBy":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-88"}]},"cc15b84d-64":{"id":"/node_modules/@stdlib/assert-has-symbol-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-65"},"imported":[],"importedBy":[{"uid":"cc15b84d-743"}]},"cc15b84d-66":{"id":"/node_modules/@stdlib/assert-has-tostringtag-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-67"},"imported":[{"uid":"cc15b84d-743"}],"importedBy":[{"uid":"cc15b84d-732"}]},"cc15b84d-68":{"id":"/node_modules/@stdlib/utils-native-class/lib/tostring.js","moduleParts":{"browser.js":"cc15b84d-69"},"imported":[],"importedBy":[{"uid":"cc15b84d-70"},{"uid":"cc15b84d-78"}]},"cc15b84d-70":{"id":"/node_modules/@stdlib/utils-native-class/lib/main.js","moduleParts":{"browser.js":"cc15b84d-71"},"imported":[{"uid":"cc15b84d-68"}],"importedBy":[{"uid":"cc15b84d-80"}]},"cc15b84d-72":{"id":"/node_modules/@stdlib/assert-has-own-property/lib/main.js","moduleParts":{"browser.js":"cc15b84d-73"},"imported":[],"importedBy":[{"uid":"cc15b84d-744"}]},"cc15b84d-74":{"id":"/node_modules/@stdlib/symbol-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-75"},"imported":[],"importedBy":[{"uid":"cc15b84d-751"}]},"cc15b84d-76":{"id":"/node_modules/@stdlib/utils-native-class/lib/tostringtag.js","moduleParts":{"browser.js":"cc15b84d-77"},"imported":[{"uid":"cc15b84d-751"}],"importedBy":[{"uid":"cc15b84d-78"}]},"cc15b84d-78":{"id":"/node_modules/@stdlib/utils-native-class/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-79"},"imported":[{"uid":"cc15b84d-744"},{"uid":"cc15b84d-76"},{"uid":"cc15b84d-68"}],"importedBy":[{"uid":"cc15b84d-80"}]},"cc15b84d-80":{"id":"/node_modules/@stdlib/utils-native-class/lib/index.js","moduleParts":{"browser.js":"cc15b84d-81"},"imported":[{"uid":"cc15b84d-732"},{"uid":"cc15b84d-70"},{"uid":"cc15b84d-78"}],"importedBy":[{"uid":"cc15b84d-86"},{"uid":"cc15b84d-110"},{"uid":"cc15b84d-166"},{"uid":"cc15b84d-184"},{"uid":"cc15b84d-200"},{"uid":"cc15b84d-134"},{"uid":"cc15b84d-148"},{"uid":"cc15b84d-324"},{"uid":"cc15b84d-340"},{"uid":"cc15b84d-204"},{"uid":"cc15b84d-218"},{"uid":"cc15b84d-234"},{"uid":"cc15b84d-248"},{"uid":"cc15b84d-264"},{"uid":"cc15b84d-276"},{"uid":"cc15b84d-538"},{"uid":"cc15b84d-474"},{"uid":"cc15b84d-532"}]},"cc15b84d-82":{"id":"/node_modules/@stdlib/assert-is-string/lib/valueof.js","moduleParts":{"browser.js":"cc15b84d-83"},"imported":[],"importedBy":[{"uid":"cc15b84d-84"}]},"cc15b84d-84":{"id":"/node_modules/@stdlib/assert-is-string/lib/try2valueof.js","moduleParts":{"browser.js":"cc15b84d-85"},"imported":[{"uid":"cc15b84d-82"}],"importedBy":[{"uid":"cc15b84d-86"}]},"cc15b84d-86":{"id":"/node_modules/@stdlib/assert-is-string/lib/object.js","moduleParts":{"browser.js":"cc15b84d-87"},"imported":[{"uid":"cc15b84d-732"},{"uid":"cc15b84d-80"},{"uid":"cc15b84d-84"}],"importedBy":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-88"}]},"cc15b84d-88":{"id":"/node_modules/@stdlib/assert-is-string/lib/main.js","moduleParts":{"browser.js":"cc15b84d-89"},"imported":[{"uid":"cc15b84d-62"},{"uid":"cc15b84d-86"}],"importedBy":[{"uid":"cc15b84d-90"}]},"cc15b84d-90":{"id":"/node_modules/@stdlib/assert-is-string/lib/index.js","moduleParts":{"browser.js":"cc15b84d-91"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-88"},{"uid":"cc15b84d-62"},{"uid":"cc15b84d-86"}],"importedBy":[{"uid":"cc15b84d-100"},{"uid":"cc15b84d-124"},{"uid":"cc15b84d-548"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-544"},{"uid":"cc15b84d-328"},{"uid":"cc15b84d-492"},{"uid":"cc15b84d-506"}]},"cc15b84d-92":{"id":"/node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/main.js","moduleParts":{"browser.js":"cc15b84d-93"},"imported":[],"importedBy":[{"uid":"cc15b84d-723"}]},"cc15b84d-94":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/main.js","moduleParts":{"browser.js":"cc15b84d-95"},"imported":[{"uid":"cc15b84d-723"}],"importedBy":[{"uid":"cc15b84d-98"}]},"cc15b84d-96":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/assign.js","moduleParts":{"browser.js":"cc15b84d-97"},"imported":[{"uid":"cc15b84d-723"}],"importedBy":[{"uid":"cc15b84d-98"}]},"cc15b84d-98":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/index.js","moduleParts":{"browser.js":"cc15b84d-99"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-94"},{"uid":"cc15b84d-96"}],"importedBy":[{"uid":"cc15b84d-100"}]},"cc15b84d-100":{"id":"/node_modules/@stdlib/ndarray-base-strides/lib/main.js","moduleParts":{"browser.js":"cc15b84d-101"},"imported":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-98"},{"uid":"cc15b84d-719"}],"importedBy":[{"uid":"cc15b84d-707"}]},"cc15b84d-102":{"id":"/node_modules/@stdlib/assert-is-number/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-103"},"imported":[],"importedBy":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-112"}]},"cc15b84d-104":{"id":"/node_modules/@stdlib/number-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-105"},"imported":[],"importedBy":[{"uid":"cc15b84d-733"}]},"cc15b84d-106":{"id":"/node_modules/@stdlib/assert-is-number/lib/tostring.js","moduleParts":{"browser.js":"cc15b84d-107"},"imported":[{"uid":"cc15b84d-733"}],"importedBy":[{"uid":"cc15b84d-108"}]},"cc15b84d-108":{"id":"/node_modules/@stdlib/assert-is-number/lib/try2serialize.js","moduleParts":{"browser.js":"cc15b84d-109"},"imported":[{"uid":"cc15b84d-106"}],"importedBy":[{"uid":"cc15b84d-110"}]},"cc15b84d-110":{"id":"/node_modules/@stdlib/assert-is-number/lib/object.js","moduleParts":{"browser.js":"cc15b84d-111"},"imported":[{"uid":"cc15b84d-732"},{"uid":"cc15b84d-80"},{"uid":"cc15b84d-733"},{"uid":"cc15b84d-108"}],"importedBy":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-112"}]},"cc15b84d-112":{"id":"/node_modules/@stdlib/assert-is-number/lib/main.js","moduleParts":{"browser.js":"cc15b84d-113"},"imported":[{"uid":"cc15b84d-102"},{"uid":"cc15b84d-110"}],"importedBy":[{"uid":"cc15b84d-114"}]},"cc15b84d-114":{"id":"/node_modules/@stdlib/assert-is-number/lib/index.js","moduleParts":{"browser.js":"cc15b84d-115"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-112"},{"uid":"cc15b84d-102"},{"uid":"cc15b84d-110"}],"importedBy":[{"uid":"cc15b84d-118"},{"uid":"cc15b84d-548"},{"uid":"cc15b84d-388"},{"uid":"cc15b84d-376"},{"uid":"cc15b84d-300"},{"uid":"cc15b84d-302"},{"uid":"cc15b84d-480"},{"uid":"cc15b84d-482"}]},"cc15b84d-116":{"id":"/node_modules/@stdlib/ndarray-base-strides2offset/lib/main.js","moduleParts":{"browser.js":"cc15b84d-117"},"imported":[],"importedBy":[{"uid":"cc15b84d-724"}]},"cc15b84d-118":{"id":"/node_modules/@stdlib/ndarray-base-offset/lib/main.js","moduleParts":{"browser.js":"cc15b84d-119"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-724"}],"importedBy":[{"uid":"cc15b84d-708"}]},"cc15b84d-120":{"id":"/node_modules/@stdlib/math-base-special-abs/lib/main.js","moduleParts":{"browser.js":"cc15b84d-121"},"imported":[],"importedBy":[{"uid":"cc15b84d-722"}]},"cc15b84d-122":{"id":"/node_modules/@stdlib/ndarray-base-strides2order/lib/main.js","moduleParts":{"browser.js":"cc15b84d-123"},"imported":[{"uid":"cc15b84d-722"}],"importedBy":[{"uid":"cc15b84d-697"}]},"cc15b84d-124":{"id":"/node_modules/@stdlib/ndarray-base-order/lib/main.js","moduleParts":{"browser.js":"cc15b84d-125"},"imported":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-709"}]},"cc15b84d-126":{"id":"/node_modules/@stdlib/ndarray-base-data-buffer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-127"},"imported":[],"importedBy":[{"uid":"cc15b84d-710"}]},"cc15b84d-128":{"id":"/node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/main.js","moduleParts":{"browser.js":"cc15b84d-129"},"imported":[{"uid":"cc15b84d-700"},{"uid":"cc15b84d-701"},{"uid":"cc15b84d-702"},{"uid":"cc15b84d-703"},{"uid":"cc15b84d-704"},{"uid":"cc15b84d-698"},{"uid":"cc15b84d-705"},{"uid":"cc15b84d-706"},{"uid":"cc15b84d-707"},{"uid":"cc15b84d-708"},{"uid":"cc15b84d-709"},{"uid":"cc15b84d-710"}],"importedBy":[{"uid":"cc15b84d-691"}]},"cc15b84d-130":{"id":"/node_modules/@stdlib/array-base-assert-is-complex128array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-131"},"imported":[],"importedBy":[{"uid":"cc15b84d-711"}]},"cc15b84d-132":{"id":"/node_modules/@stdlib/array-base-assert-is-complex64array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-133"},"imported":[],"importedBy":[{"uid":"cc15b84d-712"}]},"cc15b84d-134":{"id":"/node_modules/@stdlib/assert-is-float64array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-135"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-737"}]},"cc15b84d-136":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/float64array.js","moduleParts":{"browser.js":"cc15b84d-137"},"imported":[],"importedBy":[{"uid":"cc15b84d-138"}]},"cc15b84d-138":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-139"},"imported":[{"uid":"cc15b84d-737"},{"uid":"cc15b84d-136"}],"importedBy":[{"uid":"cc15b84d-728"}]},"cc15b84d-140":{"id":"/node_modules/@stdlib/array-float64/lib/main.js","moduleParts":{"browser.js":"cc15b84d-141"},"imported":[],"importedBy":[{"uid":"cc15b84d-144"}]},"cc15b84d-142":{"id":"/node_modules/@stdlib/array-float64/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-143"},"imported":[],"importedBy":[{"uid":"cc15b84d-144"}]},"cc15b84d-144":{"id":"/node_modules/@stdlib/array-float64/lib/index.js","moduleParts":{"browser.js":"cc15b84d-145"},"imported":[{"uid":"cc15b84d-728"},{"uid":"cc15b84d-140"},{"uid":"cc15b84d-142"}],"importedBy":[{"uid":"cc15b84d-146"},{"uid":"cc15b84d-432"},{"uid":"cc15b84d-422"}]},"cc15b84d-146":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex128/lib/main.js","moduleParts":{"browser.js":"cc15b84d-147"},"imported":[{"uid":"cc15b84d-144"}],"importedBy":[{"uid":"cc15b84d-713"}]},"cc15b84d-148":{"id":"/node_modules/@stdlib/assert-is-float32array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-149"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-738"}]},"cc15b84d-150":{"id":"/node_modules/@stdlib/constants-float64-pinf/lib/index.js","moduleParts":{"browser.js":"cc15b84d-151"},"imported":[],"importedBy":[{"uid":"cc15b84d-154"},{"uid":"cc15b84d-298"}]},"cc15b84d-152":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/float32array.js","moduleParts":{"browser.js":"cc15b84d-153"},"imported":[],"importedBy":[{"uid":"cc15b84d-154"}]},"cc15b84d-154":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-155"},"imported":[{"uid":"cc15b84d-738"},{"uid":"cc15b84d-150"},{"uid":"cc15b84d-152"}],"importedBy":[{"uid":"cc15b84d-729"}]},"cc15b84d-156":{"id":"/node_modules/@stdlib/array-float32/lib/main.js","moduleParts":{"browser.js":"cc15b84d-157"},"imported":[],"importedBy":[{"uid":"cc15b84d-160"}]},"cc15b84d-158":{"id":"/node_modules/@stdlib/array-float32/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-159"},"imported":[],"importedBy":[{"uid":"cc15b84d-160"}]},"cc15b84d-160":{"id":"/node_modules/@stdlib/array-float32/lib/index.js","moduleParts":{"browser.js":"cc15b84d-161"},"imported":[{"uid":"cc15b84d-729"},{"uid":"cc15b84d-156"},{"uid":"cc15b84d-158"}],"importedBy":[{"uid":"cc15b84d-162"},{"uid":"cc15b84d-432"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-380"}]},"cc15b84d-162":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex64/lib/main.js","moduleParts":{"browser.js":"cc15b84d-163"},"imported":[{"uid":"cc15b84d-160"}],"importedBy":[{"uid":"cc15b84d-714"}]},"cc15b84d-164":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex/lib/main.js","moduleParts":{"browser.js":"cc15b84d-165"},"imported":[{"uid":"cc15b84d-711"},{"uid":"cc15b84d-712"},{"uid":"cc15b84d-713"},{"uid":"cc15b84d-714"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-692"}]},"cc15b84d-166":{"id":"/node_modules/@stdlib/assert-is-uint8array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-167"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-730"}]},"cc15b84d-168":{"id":"/node_modules/@stdlib/constants-uint8-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-169"},"imported":[],"importedBy":[{"uid":"cc15b84d-172"}]},"cc15b84d-170":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/uint8array.js","moduleParts":{"browser.js":"cc15b84d-171"},"imported":[],"importedBy":[{"uid":"cc15b84d-172"}]},"cc15b84d-172":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-173"},"imported":[{"uid":"cc15b84d-730"},{"uid":"cc15b84d-168"},{"uid":"cc15b84d-170"}],"importedBy":[{"uid":"cc15b84d-718"}]},"cc15b84d-174":{"id":"/node_modules/@stdlib/array-uint8/lib/main.js","moduleParts":{"browser.js":"cc15b84d-175"},"imported":[],"importedBy":[{"uid":"cc15b84d-178"}]},"cc15b84d-176":{"id":"/node_modules/@stdlib/array-uint8/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-177"},"imported":[],"importedBy":[{"uid":"cc15b84d-178"}]},"cc15b84d-178":{"id":"/node_modules/@stdlib/array-uint8/lib/index.js","moduleParts":{"browser.js":"cc15b84d-179"},"imported":[{"uid":"cc15b84d-718"},{"uid":"cc15b84d-174"},{"uid":"cc15b84d-176"}],"importedBy":[{"uid":"cc15b84d-180"},{"uid":"cc15b84d-432"},{"uid":"cc15b84d-430"}]},"cc15b84d-180":{"id":"/node_modules/@stdlib/strided-base-reinterpret-boolean/lib/main.js","moduleParts":{"browser.js":"cc15b84d-181"},"imported":[{"uid":"cc15b84d-178"}],"importedBy":[{"uid":"cc15b84d-693"}]},"cc15b84d-182":{"id":"/node_modules/@stdlib/strided-base-stride2offset/lib/main.js","moduleParts":{"browser.js":"cc15b84d-183"},"imported":[],"importedBy":[{"uid":"cc15b84d-716"}]},"cc15b84d-184":{"id":"/node_modules/@stdlib/assert-is-array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-185"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-735"}]},"cc15b84d-186":{"id":"/node_modules/@stdlib/assert-tools-array-function/lib/main.js","moduleParts":{"browser.js":"cc15b84d-187"},"imported":[{"uid":"cc15b84d-735"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-752"}]},"cc15b84d-188":{"id":"/node_modules/@stdlib/assert-is-object-like/lib/main.js","moduleParts":{"browser.js":"cc15b84d-189"},"imported":[],"importedBy":[{"uid":"cc15b84d-190"}]},"cc15b84d-190":{"id":"/node_modules/@stdlib/assert-is-object-like/lib/index.js","moduleParts":{"browser.js":"cc15b84d-191"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-752"},{"uid":"cc15b84d-188"}],"importedBy":[{"uid":"cc15b84d-192"},{"uid":"cc15b84d-540"},{"uid":"cc15b84d-522"}]},"cc15b84d-192":{"id":"/node_modules/@stdlib/assert-is-buffer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-193"},"imported":[{"uid":"cc15b84d-190"}],"importedBy":[{"uid":"cc15b84d-734"}]},"cc15b84d-194":{"id":"/node_modules/@stdlib/regexp-function-name/lib/main.js","moduleParts":{"browser.js":"cc15b84d-195"},"imported":[],"importedBy":[{"uid":"cc15b84d-198"},{"uid":"cc15b84d-196"}]},"cc15b84d-196":{"id":"/node_modules/@stdlib/regexp-function-name/lib/regexp.js","moduleParts":{"browser.js":"cc15b84d-197"},"imported":[{"uid":"cc15b84d-194"}],"importedBy":[{"uid":"cc15b84d-198"}]},"cc15b84d-198":{"id":"/node_modules/@stdlib/regexp-function-name/lib/index.js","moduleParts":{"browser.js":"cc15b84d-199"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-194"},{"uid":"cc15b84d-196"}],"importedBy":[{"uid":"cc15b84d-200"}]},"cc15b84d-200":{"id":"/node_modules/@stdlib/utils-constructor-name/lib/main.js","moduleParts":{"browser.js":"cc15b84d-201"},"imported":[{"uid":"cc15b84d-80"},{"uid":"cc15b84d-198"},{"uid":"cc15b84d-734"}],"importedBy":[{"uid":"cc15b84d-736"}]},"cc15b84d-202":{"id":"/node_modules/@stdlib/array-dtype/lib/ctor2dtype.js","moduleParts":{"browser.js":"cc15b84d-203"},"imported":[],"importedBy":[{"uid":"cc15b84d-436"}]},"cc15b84d-204":{"id":"/node_modules/@stdlib/assert-is-uint32array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-205"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-774"}]},"cc15b84d-206":{"id":"/node_modules/@stdlib/constants-uint32-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-207"},"imported":[],"importedBy":[{"uid":"cc15b84d-210"},{"uid":"cc15b84d-494"}]},"cc15b84d-208":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/uint32array.js","moduleParts":{"browser.js":"cc15b84d-209"},"imported":[],"importedBy":[{"uid":"cc15b84d-210"}]},"cc15b84d-210":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-211"},"imported":[{"uid":"cc15b84d-774"},{"uid":"cc15b84d-206"},{"uid":"cc15b84d-208"}],"importedBy":[{"uid":"cc15b84d-745"}]},"cc15b84d-212":{"id":"/node_modules/@stdlib/array-uint32/lib/main.js","moduleParts":{"browser.js":"cc15b84d-213"},"imported":[],"importedBy":[{"uid":"cc15b84d-216"}]},"cc15b84d-214":{"id":"/node_modules/@stdlib/array-uint32/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-215"},"imported":[],"importedBy":[{"uid":"cc15b84d-216"}]},"cc15b84d-216":{"id":"/node_modules/@stdlib/array-uint32/lib/index.js","moduleParts":{"browser.js":"cc15b84d-217"},"imported":[{"uid":"cc15b84d-745"},{"uid":"cc15b84d-212"},{"uid":"cc15b84d-214"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-218":{"id":"/node_modules/@stdlib/assert-is-int32array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-219"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-775"}]},"cc15b84d-220":{"id":"/node_modules/@stdlib/constants-int32-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-221"},"imported":[],"importedBy":[{"uid":"cc15b84d-226"}]},"cc15b84d-222":{"id":"/node_modules/@stdlib/constants-int32-min/lib/index.js","moduleParts":{"browser.js":"cc15b84d-223"},"imported":[],"importedBy":[{"uid":"cc15b84d-226"}]},"cc15b84d-224":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/int32array.js","moduleParts":{"browser.js":"cc15b84d-225"},"imported":[],"importedBy":[{"uid":"cc15b84d-226"}]},"cc15b84d-226":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-227"},"imported":[{"uid":"cc15b84d-775"},{"uid":"cc15b84d-220"},{"uid":"cc15b84d-222"},{"uid":"cc15b84d-224"}],"importedBy":[{"uid":"cc15b84d-746"}]},"cc15b84d-228":{"id":"/node_modules/@stdlib/array-int32/lib/main.js","moduleParts":{"browser.js":"cc15b84d-229"},"imported":[],"importedBy":[{"uid":"cc15b84d-232"}]},"cc15b84d-230":{"id":"/node_modules/@stdlib/array-int32/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-231"},"imported":[],"importedBy":[{"uid":"cc15b84d-232"}]},"cc15b84d-232":{"id":"/node_modules/@stdlib/array-int32/lib/index.js","moduleParts":{"browser.js":"cc15b84d-233"},"imported":[{"uid":"cc15b84d-746"},{"uid":"cc15b84d-228"},{"uid":"cc15b84d-230"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-234":{"id":"/node_modules/@stdlib/assert-is-uint16array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-235"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-776"}]},"cc15b84d-236":{"id":"/node_modules/@stdlib/constants-uint16-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-237"},"imported":[],"importedBy":[{"uid":"cc15b84d-240"}]},"cc15b84d-238":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/uint16array.js","moduleParts":{"browser.js":"cc15b84d-239"},"imported":[],"importedBy":[{"uid":"cc15b84d-240"}]},"cc15b84d-240":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-241"},"imported":[{"uid":"cc15b84d-776"},{"uid":"cc15b84d-236"},{"uid":"cc15b84d-238"}],"importedBy":[{"uid":"cc15b84d-747"}]},"cc15b84d-242":{"id":"/node_modules/@stdlib/array-uint16/lib/main.js","moduleParts":{"browser.js":"cc15b84d-243"},"imported":[],"importedBy":[{"uid":"cc15b84d-246"}]},"cc15b84d-244":{"id":"/node_modules/@stdlib/array-uint16/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-245"},"imported":[],"importedBy":[{"uid":"cc15b84d-246"}]},"cc15b84d-246":{"id":"/node_modules/@stdlib/array-uint16/lib/index.js","moduleParts":{"browser.js":"cc15b84d-247"},"imported":[{"uid":"cc15b84d-747"},{"uid":"cc15b84d-242"},{"uid":"cc15b84d-244"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-248":{"id":"/node_modules/@stdlib/assert-is-int16array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-249"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-777"}]},"cc15b84d-250":{"id":"/node_modules/@stdlib/constants-int16-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-251"},"imported":[],"importedBy":[{"uid":"cc15b84d-256"}]},"cc15b84d-252":{"id":"/node_modules/@stdlib/constants-int16-min/lib/index.js","moduleParts":{"browser.js":"cc15b84d-253"},"imported":[],"importedBy":[{"uid":"cc15b84d-256"}]},"cc15b84d-254":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/int16array.js","moduleParts":{"browser.js":"cc15b84d-255"},"imported":[],"importedBy":[{"uid":"cc15b84d-256"}]},"cc15b84d-256":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-257"},"imported":[{"uid":"cc15b84d-777"},{"uid":"cc15b84d-250"},{"uid":"cc15b84d-252"},{"uid":"cc15b84d-254"}],"importedBy":[{"uid":"cc15b84d-748"}]},"cc15b84d-258":{"id":"/node_modules/@stdlib/array-int16/lib/main.js","moduleParts":{"browser.js":"cc15b84d-259"},"imported":[],"importedBy":[{"uid":"cc15b84d-262"}]},"cc15b84d-260":{"id":"/node_modules/@stdlib/array-int16/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-261"},"imported":[],"importedBy":[{"uid":"cc15b84d-262"}]},"cc15b84d-262":{"id":"/node_modules/@stdlib/array-int16/lib/index.js","moduleParts":{"browser.js":"cc15b84d-263"},"imported":[{"uid":"cc15b84d-748"},{"uid":"cc15b84d-258"},{"uid":"cc15b84d-260"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-264":{"id":"/node_modules/@stdlib/assert-is-uint8clampedarray/lib/main.js","moduleParts":{"browser.js":"cc15b84d-265"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-778"}]},"cc15b84d-266":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/uint8clampedarray.js","moduleParts":{"browser.js":"cc15b84d-267"},"imported":[],"importedBy":[{"uid":"cc15b84d-268"}]},"cc15b84d-268":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-269"},"imported":[{"uid":"cc15b84d-778"},{"uid":"cc15b84d-266"}],"importedBy":[{"uid":"cc15b84d-749"}]},"cc15b84d-270":{"id":"/node_modules/@stdlib/array-uint8c/lib/main.js","moduleParts":{"browser.js":"cc15b84d-271"},"imported":[],"importedBy":[{"uid":"cc15b84d-274"}]},"cc15b84d-272":{"id":"/node_modules/@stdlib/array-uint8c/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-273"},"imported":[],"importedBy":[{"uid":"cc15b84d-274"}]},"cc15b84d-274":{"id":"/node_modules/@stdlib/array-uint8c/lib/index.js","moduleParts":{"browser.js":"cc15b84d-275"},"imported":[{"uid":"cc15b84d-749"},{"uid":"cc15b84d-270"},{"uid":"cc15b84d-272"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-276":{"id":"/node_modules/@stdlib/assert-is-int8array/lib/main.js","moduleParts":{"browser.js":"cc15b84d-277"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-779"}]},"cc15b84d-278":{"id":"/node_modules/@stdlib/constants-int8-max/lib/index.js","moduleParts":{"browser.js":"cc15b84d-279"},"imported":[],"importedBy":[{"uid":"cc15b84d-284"}]},"cc15b84d-280":{"id":"/node_modules/@stdlib/constants-int8-min/lib/index.js","moduleParts":{"browser.js":"cc15b84d-281"},"imported":[],"importedBy":[{"uid":"cc15b84d-284"}]},"cc15b84d-282":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/int8array.js","moduleParts":{"browser.js":"cc15b84d-283"},"imported":[],"importedBy":[{"uid":"cc15b84d-284"}]},"cc15b84d-284":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-285"},"imported":[{"uid":"cc15b84d-779"},{"uid":"cc15b84d-278"},{"uid":"cc15b84d-280"},{"uid":"cc15b84d-282"}],"importedBy":[{"uid":"cc15b84d-750"}]},"cc15b84d-286":{"id":"/node_modules/@stdlib/array-int8/lib/main.js","moduleParts":{"browser.js":"cc15b84d-287"},"imported":[],"importedBy":[{"uid":"cc15b84d-290"}]},"cc15b84d-288":{"id":"/node_modules/@stdlib/array-int8/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-289"},"imported":[],"importedBy":[{"uid":"cc15b84d-290"}]},"cc15b84d-290":{"id":"/node_modules/@stdlib/array-int8/lib/index.js","moduleParts":{"browser.js":"cc15b84d-291"},"imported":[{"uid":"cc15b84d-750"},{"uid":"cc15b84d-286"},{"uid":"cc15b84d-288"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-292":{"id":"/node_modules/@stdlib/constants-float64-ninf/lib/index.js","moduleParts":{"browser.js":"cc15b84d-293"},"imported":[{"uid":"cc15b84d-733"}],"importedBy":[{"uid":"cc15b84d-298"}]},"cc15b84d-294":{"id":"/node_modules/@stdlib/math-base-special-floor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-295"},"imported":[],"importedBy":[{"uid":"cc15b84d-767"}]},"cc15b84d-296":{"id":"/node_modules/@stdlib/math-base-assert-is-integer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-297"},"imported":[{"uid":"cc15b84d-767"}],"importedBy":[{"uid":"cc15b84d-760"}]},"cc15b84d-298":{"id":"/node_modules/@stdlib/assert-is-integer/lib/integer.js","moduleParts":{"browser.js":"cc15b84d-299"},"imported":[{"uid":"cc15b84d-150"},{"uid":"cc15b84d-292"},{"uid":"cc15b84d-760"}],"importedBy":[{"uid":"cc15b84d-300"},{"uid":"cc15b84d-302"}]},"cc15b84d-300":{"id":"/node_modules/@stdlib/assert-is-integer/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-301"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-298"}],"importedBy":[{"uid":"cc15b84d-306"},{"uid":"cc15b84d-304"}]},"cc15b84d-302":{"id":"/node_modules/@stdlib/assert-is-integer/lib/object.js","moduleParts":{"browser.js":"cc15b84d-303"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-298"}],"importedBy":[{"uid":"cc15b84d-306"},{"uid":"cc15b84d-304"}]},"cc15b84d-304":{"id":"/node_modules/@stdlib/assert-is-integer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-305"},"imported":[{"uid":"cc15b84d-300"},{"uid":"cc15b84d-302"}],"importedBy":[{"uid":"cc15b84d-306"}]},"cc15b84d-306":{"id":"/node_modules/@stdlib/assert-is-integer/lib/index.js","moduleParts":{"browser.js":"cc15b84d-307"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-304"},{"uid":"cc15b84d-300"},{"uid":"cc15b84d-302"}],"importedBy":[{"uid":"cc15b84d-430"},{"uid":"cc15b84d-460"},{"uid":"cc15b84d-462"},{"uid":"cc15b84d-308"},{"uid":"cc15b84d-310"},{"uid":"cc15b84d-492"},{"uid":"cc15b84d-506"}]},"cc15b84d-308":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-309"},"imported":[{"uid":"cc15b84d-306"}],"importedBy":[{"uid":"cc15b84d-314"},{"uid":"cc15b84d-312"}]},"cc15b84d-310":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/object.js","moduleParts":{"browser.js":"cc15b84d-311"},"imported":[{"uid":"cc15b84d-306"}],"importedBy":[{"uid":"cc15b84d-314"},{"uid":"cc15b84d-312"}]},"cc15b84d-312":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-313"},"imported":[{"uid":"cc15b84d-308"},{"uid":"cc15b84d-310"}],"importedBy":[{"uid":"cc15b84d-314"}]},"cc15b84d-314":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/index.js","moduleParts":{"browser.js":"cc15b84d-315"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-312"},{"uid":"cc15b84d-308"},{"uid":"cc15b84d-310"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-316":{"id":"/node_modules/@stdlib/constants-array-max-array-length/lib/index.js","moduleParts":{"browser.js":"cc15b84d-317"},"imported":[],"importedBy":[{"uid":"cc15b84d-318"}]},"cc15b84d-318":{"id":"/node_modules/@stdlib/assert-is-array-like-object/lib/main.js","moduleParts":{"browser.js":"cc15b84d-319"},"imported":[{"uid":"cc15b84d-760"},{"uid":"cc15b84d-316"}],"importedBy":[{"uid":"cc15b84d-753"}]},"cc15b84d-320":{"id":"/node_modules/@stdlib/constants-array-max-typed-array-length/lib/index.js","moduleParts":{"browser.js":"cc15b84d-321"},"imported":[],"importedBy":[{"uid":"cc15b84d-322"}]},"cc15b84d-322":{"id":"/node_modules/@stdlib/assert-is-collection/lib/main.js","moduleParts":{"browser.js":"cc15b84d-323"},"imported":[{"uid":"cc15b84d-760"},{"uid":"cc15b84d-320"}],"importedBy":[{"uid":"cc15b84d-754"}]},"cc15b84d-324":{"id":"/node_modules/@stdlib/assert-is-arraybuffer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-325"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-755"}]},"cc15b84d-326":{"id":"/node_modules/@stdlib/assert-is-object/lib/main.js","moduleParts":{"browser.js":"cc15b84d-327"},"imported":[{"uid":"cc15b84d-735"}],"importedBy":[{"uid":"cc15b84d-756"}]},"cc15b84d-328":{"id":"/node_modules/@stdlib/assert-is-string-array/lib/index.js","moduleParts":{"browser.js":"cc15b84d-329"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-752"},{"uid":"cc15b84d-90"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-330":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/re.js","moduleParts":{"browser.js":"cc15b84d-331"},"imported":[],"importedBy":[{"uid":"cc15b84d-360"}]},"cc15b84d-332":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-333"},"imported":[],"importedBy":[{"uid":"cc15b84d-344"},{"uid":"cc15b84d-342"}]},"cc15b84d-334":{"id":"/node_modules/@stdlib/boolean-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-335"},"imported":[],"importedBy":[{"uid":"cc15b84d-771"}]},"cc15b84d-336":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/tostring.js","moduleParts":{"browser.js":"cc15b84d-337"},"imported":[],"importedBy":[{"uid":"cc15b84d-338"}]},"cc15b84d-338":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/try2serialize.js","moduleParts":{"browser.js":"cc15b84d-339"},"imported":[{"uid":"cc15b84d-336"}],"importedBy":[{"uid":"cc15b84d-340"}]},"cc15b84d-340":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/object.js","moduleParts":{"browser.js":"cc15b84d-341"},"imported":[{"uid":"cc15b84d-732"},{"uid":"cc15b84d-80"},{"uid":"cc15b84d-771"},{"uid":"cc15b84d-338"}],"importedBy":[{"uid":"cc15b84d-344"},{"uid":"cc15b84d-342"}]},"cc15b84d-342":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/main.js","moduleParts":{"browser.js":"cc15b84d-343"},"imported":[{"uid":"cc15b84d-332"},{"uid":"cc15b84d-340"}],"importedBy":[{"uid":"cc15b84d-344"}]},"cc15b84d-344":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/index.js","moduleParts":{"browser.js":"cc15b84d-345"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-342"},{"uid":"cc15b84d-332"},{"uid":"cc15b84d-340"}],"importedBy":[{"uid":"cc15b84d-430"},{"uid":"cc15b84d-540"},{"uid":"cc15b84d-354"}]},"cc15b84d-346":{"id":"/node_modules/@stdlib/utils-global/lib/codegen.js","moduleParts":{"browser.js":"cc15b84d-347"},"imported":[],"importedBy":[{"uid":"cc15b84d-354"}]},"cc15b84d-348":{"id":"/node_modules/@stdlib/utils-global/lib/self.js","moduleParts":{"browser.js":"cc15b84d-349"},"imported":[],"importedBy":[{"uid":"cc15b84d-354"}]},"cc15b84d-350":{"id":"/node_modules/@stdlib/utils-global/lib/window.js","moduleParts":{"browser.js":"cc15b84d-351"},"imported":[],"importedBy":[{"uid":"cc15b84d-354"}]},"cc15b84d-352":{"id":"/node_modules/@stdlib/utils-global/lib/global_this.js","moduleParts":{"browser.js":"cc15b84d-353"},"imported":[],"importedBy":[{"uid":"cc15b84d-354"}]},"cc15b84d-354":{"id":"/node_modules/@stdlib/utils-global/lib/browser.js","moduleParts":{"browser.js":"cc15b84d-355"},"imported":[{"uid":"cc15b84d-344"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-346"},{"uid":"cc15b84d-348"},{"uid":"cc15b84d-350"},{"uid":"cc15b84d-352"}],"importedBy":[{"uid":"cc15b84d-356"}]},"cc15b84d-356":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/nodelist.js","moduleParts":{"browser.js":"cc15b84d-357"},"imported":[{"uid":"cc15b84d-354"}],"importedBy":[{"uid":"cc15b84d-360"}]},"cc15b84d-358":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js","moduleParts":{"browser.js":"cc15b84d-359"},"imported":[],"importedBy":[{"uid":"cc15b84d-360"}]},"cc15b84d-360":{"id":"/node_modules/@stdlib/utils-type-of/lib/check.js","moduleParts":{"browser.js":"cc15b84d-361"},"imported":[{"uid":"cc15b84d-330"},{"uid":"cc15b84d-356"},{"uid":"cc15b84d-358"}],"importedBy":[{"uid":"cc15b84d-366"}]},"cc15b84d-362":{"id":"/node_modules/@stdlib/utils-type-of/lib/main.js","moduleParts":{"browser.js":"cc15b84d-363"},"imported":[{"uid":"cc15b84d-736"}],"importedBy":[{"uid":"cc15b84d-366"}]},"cc15b84d-364":{"id":"/node_modules/@stdlib/utils-type-of/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-365"},"imported":[{"uid":"cc15b84d-736"}],"importedBy":[{"uid":"cc15b84d-366"}]},"cc15b84d-366":{"id":"/node_modules/@stdlib/utils-type-of/lib/index.js","moduleParts":{"browser.js":"cc15b84d-367"},"imported":[{"uid":"cc15b84d-360"},{"uid":"cc15b84d-362"},{"uid":"cc15b84d-364"}],"importedBy":[{"uid":"cc15b84d-368"},{"uid":"cc15b84d-514"}]},"cc15b84d-368":{"id":"/node_modules/@stdlib/assert-is-function/lib/main.js","moduleParts":{"browser.js":"cc15b84d-369"},"imported":[{"uid":"cc15b84d-366"}],"importedBy":[{"uid":"cc15b84d-757"}]},"cc15b84d-370":{"id":"/node_modules/@stdlib/utils-define-read-only-property/lib/main.js","moduleParts":{"browser.js":"cc15b84d-371"},"imported":[{"uid":"cc15b84d-34"}],"importedBy":[{"uid":"cc15b84d-780"}]},"cc15b84d-372":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/tostring.js","moduleParts":{"browser.js":"cc15b84d-373"},"imported":[],"importedBy":[{"uid":"cc15b84d-376"}]},"cc15b84d-374":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/tojson.js","moduleParts":{"browser.js":"cc15b84d-375"},"imported":[],"importedBy":[{"uid":"cc15b84d-376"}]},"cc15b84d-376":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-377"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-780"},{"uid":"cc15b84d-694"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-372"},{"uid":"cc15b84d-374"}],"importedBy":[{"uid":"cc15b84d-768"}]},"cc15b84d-378":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/main.js","moduleParts":{"browser.js":"cc15b84d-379"},"imported":[],"importedBy":[{"uid":"cc15b84d-382"}]},"cc15b84d-380":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-381"},"imported":[{"uid":"cc15b84d-160"}],"importedBy":[{"uid":"cc15b84d-382"}]},"cc15b84d-382":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/index.js","moduleParts":{"browser.js":"cc15b84d-383"},"imported":[{"uid":"cc15b84d-378"},{"uid":"cc15b84d-380"}],"importedBy":[{"uid":"cc15b84d-388"}]},"cc15b84d-384":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/tostring.js","moduleParts":{"browser.js":"cc15b84d-385"},"imported":[],"importedBy":[{"uid":"cc15b84d-388"}]},"cc15b84d-386":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/tojson.js","moduleParts":{"browser.js":"cc15b84d-387"},"imported":[],"importedBy":[{"uid":"cc15b84d-388"}]},"cc15b84d-388":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-389"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-780"},{"uid":"cc15b84d-694"},{"uid":"cc15b84d-382"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-384"},{"uid":"cc15b84d-386"}],"importedBy":[{"uid":"cc15b84d-764"}]},"cc15b84d-390":{"id":"/node_modules/@stdlib/assert-is-complex-like/lib/main.js","moduleParts":{"browser.js":"cc15b84d-391"},"imported":[{"uid":"cc15b84d-768"},{"uid":"cc15b84d-764"}],"importedBy":[{"uid":"cc15b84d-758"}]},"cc15b84d-392":{"id":"/node_modules/@stdlib/math-base-assert-is-even/lib/main.js","moduleParts":{"browser.js":"cc15b84d-393"},"imported":[{"uid":"cc15b84d-760"}],"importedBy":[{"uid":"cc15b84d-759"}]},"cc15b84d-394":{"id":"/node_modules/@stdlib/assert-has-iterator-symbol-support/lib/main.js","moduleParts":{"browser.js":"cc15b84d-395"},"imported":[{"uid":"cc15b84d-744"},{"uid":"cc15b84d-751"}],"importedBy":[{"uid":"cc15b84d-761"}]},"cc15b84d-396":{"id":"/node_modules/@stdlib/symbol-iterator/lib/main.js","moduleParts":{"browser.js":"cc15b84d-397"},"imported":[{"uid":"cc15b84d-761"}],"importedBy":[{"uid":"cc15b84d-762"}]},"cc15b84d-398":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-399"},"imported":[{"uid":"cc15b84d-34"}],"importedBy":[{"uid":"cc15b84d-763"}]},"cc15b84d-400":{"id":"/node_modules/@stdlib/complex-float32-real/lib/main.js","moduleParts":{"browser.js":"cc15b84d-401"},"imported":[],"importedBy":[{"uid":"cc15b84d-765"}]},"cc15b84d-402":{"id":"/node_modules/@stdlib/complex-float32-imag/lib/main.js","moduleParts":{"browser.js":"cc15b84d-403"},"imported":[],"importedBy":[{"uid":"cc15b84d-766"}]},"cc15b84d-404":{"id":"/node_modules/@stdlib/array-complex64/lib/from_iterator.js","moduleParts":{"browser.js":"cc15b84d-405"},"imported":[{"uid":"cc15b84d-753"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-765"},{"uid":"cc15b84d-766"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-410"}]},"cc15b84d-406":{"id":"/node_modules/@stdlib/array-complex64/lib/from_iterator_map.js","moduleParts":{"browser.js":"cc15b84d-407"},"imported":[{"uid":"cc15b84d-753"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-765"},{"uid":"cc15b84d-766"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-410"}]},"cc15b84d-408":{"id":"/node_modules/@stdlib/array-complex64/lib/from_array.js","moduleParts":{"browser.js":"cc15b84d-409"},"imported":[{"uid":"cc15b84d-758"},{"uid":"cc15b84d-765"},{"uid":"cc15b84d-766"}],"importedBy":[{"uid":"cc15b84d-410"}]},"cc15b84d-410":{"id":"/node_modules/@stdlib/array-complex64/lib/main.js","moduleParts":{"browser.js":"cc15b84d-411"},"imported":[{"uid":"cc15b84d-314"},{"uid":"cc15b84d-753"},{"uid":"cc15b84d-754"},{"uid":"cc15b84d-755"},{"uid":"cc15b84d-756"},{"uid":"cc15b84d-735"},{"uid":"cc15b84d-328"},{"uid":"cc15b84d-90"},{"uid":"cc15b84d-757"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-759"},{"uid":"cc15b84d-760"},{"uid":"cc15b84d-712"},{"uid":"cc15b84d-711"},{"uid":"cc15b84d-761"},{"uid":"cc15b84d-762"},{"uid":"cc15b84d-694"},{"uid":"cc15b84d-763"},{"uid":"cc15b84d-160"},{"uid":"cc15b84d-764"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-765"},{"uid":"cc15b84d-766"},{"uid":"cc15b84d-767"},{"uid":"cc15b84d-714"},{"uid":"cc15b84d-713"},{"uid":"cc15b84d-703"},{"uid":"cc15b84d-701"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-408"}],"importedBy":[{"uid":"cc15b84d-739"}]},"cc15b84d-412":{"id":"/node_modules/@stdlib/complex-float64-real/lib/main.js","moduleParts":{"browser.js":"cc15b84d-413"},"imported":[],"importedBy":[{"uid":"cc15b84d-769"}]},"cc15b84d-414":{"id":"/node_modules/@stdlib/complex-float64-imag/lib/main.js","moduleParts":{"browser.js":"cc15b84d-415"},"imported":[],"importedBy":[{"uid":"cc15b84d-770"}]},"cc15b84d-416":{"id":"/node_modules/@stdlib/array-complex128/lib/from_iterator.js","moduleParts":{"browser.js":"cc15b84d-417"},"imported":[{"uid":"cc15b84d-753"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-769"},{"uid":"cc15b84d-770"}],"importedBy":[{"uid":"cc15b84d-422"}]},"cc15b84d-418":{"id":"/node_modules/@stdlib/array-complex128/lib/from_iterator_map.js","moduleParts":{"browser.js":"cc15b84d-419"},"imported":[{"uid":"cc15b84d-753"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-769"},{"uid":"cc15b84d-770"}],"importedBy":[{"uid":"cc15b84d-422"}]},"cc15b84d-420":{"id":"/node_modules/@stdlib/array-complex128/lib/from_array.js","moduleParts":{"browser.js":"cc15b84d-421"},"imported":[{"uid":"cc15b84d-758"},{"uid":"cc15b84d-769"},{"uid":"cc15b84d-770"}],"importedBy":[{"uid":"cc15b84d-422"}]},"cc15b84d-422":{"id":"/node_modules/@stdlib/array-complex128/lib/main.js","moduleParts":{"browser.js":"cc15b84d-423"},"imported":[{"uid":"cc15b84d-314"},{"uid":"cc15b84d-753"},{"uid":"cc15b84d-754"},{"uid":"cc15b84d-755"},{"uid":"cc15b84d-756"},{"uid":"cc15b84d-735"},{"uid":"cc15b84d-328"},{"uid":"cc15b84d-90"},{"uid":"cc15b84d-757"},{"uid":"cc15b84d-758"},{"uid":"cc15b84d-759"},{"uid":"cc15b84d-760"},{"uid":"cc15b84d-712"},{"uid":"cc15b84d-711"},{"uid":"cc15b84d-761"},{"uid":"cc15b84d-762"},{"uid":"cc15b84d-694"},{"uid":"cc15b84d-763"},{"uid":"cc15b84d-144"},{"uid":"cc15b84d-768"},{"uid":"cc15b84d-769"},{"uid":"cc15b84d-770"},{"uid":"cc15b84d-767"},{"uid":"cc15b84d-714"},{"uid":"cc15b84d-713"},{"uid":"cc15b84d-703"},{"uid":"cc15b84d-701"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"},{"uid":"cc15b84d-420"}],"importedBy":[{"uid":"cc15b84d-740"}]},"cc15b84d-424":{"id":"/node_modules/@stdlib/array-bool/lib/from_iterator.js","moduleParts":{"browser.js":"cc15b84d-425"},"imported":[{"uid":"cc15b84d-771"}],"importedBy":[{"uid":"cc15b84d-430"}]},"cc15b84d-426":{"id":"/node_modules/@stdlib/array-bool/lib/from_iterator_map.js","moduleParts":{"browser.js":"cc15b84d-427"},"imported":[{"uid":"cc15b84d-771"}],"importedBy":[{"uid":"cc15b84d-430"}]},"cc15b84d-428":{"id":"/node_modules/@stdlib/array-bool/lib/from_array.js","moduleParts":{"browser.js":"cc15b84d-429"},"imported":[{"uid":"cc15b84d-771"}],"importedBy":[{"uid":"cc15b84d-430"}]},"cc15b84d-430":{"id":"/node_modules/@stdlib/array-bool/lib/main.js","moduleParts":{"browser.js":"cc15b84d-431"},"imported":[{"uid":"cc15b84d-314"},{"uid":"cc15b84d-754"},{"uid":"cc15b84d-755"},{"uid":"cc15b84d-756"},{"uid":"cc15b84d-757"},{"uid":"cc15b84d-344"},{"uid":"cc15b84d-306"},{"uid":"cc15b84d-90"},{"uid":"cc15b84d-328"},{"uid":"cc15b84d-761"},{"uid":"cc15b84d-762"},{"uid":"cc15b84d-694"},{"uid":"cc15b84d-763"},{"uid":"cc15b84d-178"},{"uid":"cc15b84d-771"},{"uid":"cc15b84d-703"},{"uid":"cc15b84d-767"},{"uid":"cc15b84d-701"},{"uid":"cc15b84d-715"},{"uid":"cc15b84d-424"},{"uid":"cc15b84d-426"},{"uid":"cc15b84d-428"}],"importedBy":[{"uid":"cc15b84d-741"}]},"cc15b84d-432":{"id":"/node_modules/@stdlib/array-dtype/lib/ctors.js","moduleParts":{"browser.js":"cc15b84d-433"},"imported":[{"uid":"cc15b84d-144"},{"uid":"cc15b84d-160"},{"uid":"cc15b84d-216"},{"uid":"cc15b84d-232"},{"uid":"cc15b84d-246"},{"uid":"cc15b84d-262"},{"uid":"cc15b84d-178"},{"uid":"cc15b84d-274"},{"uid":"cc15b84d-290"},{"uid":"cc15b84d-739"},{"uid":"cc15b84d-740"},{"uid":"cc15b84d-741"}],"importedBy":[{"uid":"cc15b84d-436"}]},"cc15b84d-434":{"id":"/node_modules/@stdlib/array-dtype/lib/dtypes.js","moduleParts":{"browser.js":"cc15b84d-435"},"imported":[],"importedBy":[{"uid":"cc15b84d-436"}]},"cc15b84d-436":{"id":"/node_modules/@stdlib/array-dtype/lib/main.js","moduleParts":{"browser.js":"cc15b84d-437"},"imported":[{"uid":"cc15b84d-734"},{"uid":"cc15b84d-735"},{"uid":"cc15b84d-736"},{"uid":"cc15b84d-202"},{"uid":"cc15b84d-432"},{"uid":"cc15b84d-434"}],"importedBy":[{"uid":"cc15b84d-727"}]},"cc15b84d-438":{"id":"/node_modules/@stdlib/array-base-arraylike2object/lib/main.js","moduleParts":{"browser.js":"cc15b84d-439"},"imported":[{"uid":"cc15b84d-700"},{"uid":"cc15b84d-703"},{"uid":"cc15b84d-704"},{"uid":"cc15b84d-701"},{"uid":"cc15b84d-702"},{"uid":"cc15b84d-727"}],"importedBy":[{"uid":"cc15b84d-717"}]},"cc15b84d-440":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/accessors.js","moduleParts":{"browser.js":"cc15b84d-441"},"imported":[],"importedBy":[{"uid":"cc15b84d-442"}]},"cc15b84d-442":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/ndarray.js","moduleParts":{"browser.js":"cc15b84d-443"},"imported":[{"uid":"cc15b84d-717"},{"uid":"cc15b84d-440"}],"importedBy":[{"uid":"cc15b84d-446"},{"uid":"cc15b84d-444"}]},"cc15b84d-444":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/main.js","moduleParts":{"browser.js":"cc15b84d-445"},"imported":[{"uid":"cc15b84d-716"},{"uid":"cc15b84d-442"}],"importedBy":[{"uid":"cc15b84d-446"}]},"cc15b84d-446":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/index.js","moduleParts":{"browser.js":"cc15b84d-447"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-444"},{"uid":"cc15b84d-442"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-448":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/main.js","moduleParts":{"browser.js":"cc15b84d-449"},"imported":[],"importedBy":[{"uid":"cc15b84d-452"}]},"cc15b84d-450":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/assign.js","moduleParts":{"browser.js":"cc15b84d-451"},"imported":[{"uid":"cc15b84d-717"},{"uid":"cc15b84d-713"},{"uid":"cc15b84d-714"}],"importedBy":[{"uid":"cc15b84d-452"}]},"cc15b84d-452":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/index.js","moduleParts":{"browser.js":"cc15b84d-453"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-448"},{"uid":"cc15b84d-450"}],"importedBy":[{"uid":"cc15b84d-458"}]},"cc15b84d-454":{"id":"/node_modules/@stdlib/array-base-take-indexed/lib/main.js","moduleParts":{"browser.js":"cc15b84d-455"},"imported":[],"importedBy":[{"uid":"cc15b84d-720"}]},"cc15b84d-456":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/sort2ins.js","moduleParts":{"browser.js":"cc15b84d-457"},"imported":[],"importedBy":[{"uid":"cc15b84d-458"}]},"cc15b84d-458":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/main.js","moduleParts":{"browser.js":"cc15b84d-459"},"imported":[{"uid":"cc15b84d-452"},{"uid":"cc15b84d-719"},{"uid":"cc15b84d-720"},{"uid":"cc15b84d-456"}],"importedBy":[{"uid":"cc15b84d-695"}]},"cc15b84d-460":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-461"},"imported":[{"uid":"cc15b84d-306"}],"importedBy":[{"uid":"cc15b84d-466"},{"uid":"cc15b84d-464"}]},"cc15b84d-462":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/object.js","moduleParts":{"browser.js":"cc15b84d-463"},"imported":[{"uid":"cc15b84d-306"}],"importedBy":[{"uid":"cc15b84d-466"},{"uid":"cc15b84d-464"}]},"cc15b84d-464":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/main.js","moduleParts":{"browser.js":"cc15b84d-465"},"imported":[{"uid":"cc15b84d-460"},{"uid":"cc15b84d-462"}],"importedBy":[{"uid":"cc15b84d-466"}]},"cc15b84d-466":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/index.js","moduleParts":{"browser.js":"cc15b84d-467"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-464"},{"uid":"cc15b84d-460"},{"uid":"cc15b84d-462"}],"importedBy":[{"uid":"cc15b84d-548"}]},"cc15b84d-468":{"id":"/node_modules/@stdlib/utils-keys/lib/builtin.js","moduleParts":{"browser.js":"cc15b84d-469"},"imported":[],"importedBy":[{"uid":"cc15b84d-524"},{"uid":"cc15b84d-470"},{"uid":"cc15b84d-498"}]},"cc15b84d-470":{"id":"/node_modules/@stdlib/utils-keys/lib/has_arguments_bug.js","moduleParts":{"browser.js":"cc15b84d-471"},"imported":[{"uid":"cc15b84d-468"}],"importedBy":[{"uid":"cc15b84d-524"}]},"cc15b84d-472":{"id":"/node_modules/@stdlib/utils-keys/lib/has_builtin.js","moduleParts":{"browser.js":"cc15b84d-473"},"imported":[],"importedBy":[{"uid":"cc15b84d-524"}]},"cc15b84d-474":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/main.js","moduleParts":{"browser.js":"cc15b84d-475"},"imported":[{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-496"},{"uid":"cc15b84d-476"}]},"cc15b84d-476":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/detect.js","moduleParts":{"browser.js":"cc15b84d-477"},"imported":[{"uid":"cc15b84d-474"}],"importedBy":[{"uid":"cc15b84d-496"}]},"cc15b84d-478":{"id":"/node_modules/@stdlib/math-base-assert-is-nan/lib/main.js","moduleParts":{"browser.js":"cc15b84d-479"},"imported":[],"importedBy":[{"uid":"cc15b84d-788"}]},"cc15b84d-480":{"id":"/node_modules/@stdlib/assert-is-nan/lib/primitive.js","moduleParts":{"browser.js":"cc15b84d-481"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-788"}],"importedBy":[{"uid":"cc15b84d-486"},{"uid":"cc15b84d-484"}]},"cc15b84d-482":{"id":"/node_modules/@stdlib/assert-is-nan/lib/object.js","moduleParts":{"browser.js":"cc15b84d-483"},"imported":[{"uid":"cc15b84d-114"},{"uid":"cc15b84d-788"}],"importedBy":[{"uid":"cc15b84d-486"},{"uid":"cc15b84d-484"}]},"cc15b84d-484":{"id":"/node_modules/@stdlib/assert-is-nan/lib/main.js","moduleParts":{"browser.js":"cc15b84d-485"},"imported":[{"uid":"cc15b84d-480"},{"uid":"cc15b84d-482"}],"importedBy":[{"uid":"cc15b84d-486"}]},"cc15b84d-486":{"id":"/node_modules/@stdlib/assert-is-nan/lib/index.js","moduleParts":{"browser.js":"cc15b84d-487"},"imported":[{"uid":"cc15b84d-694"},{"uid":"cc15b84d-484"},{"uid":"cc15b84d-480"},{"uid":"cc15b84d-482"}],"importedBy":[{"uid":"cc15b84d-492"},{"uid":"cc15b84d-506"}]},"cc15b84d-488":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/native.js","moduleParts":{"browser.js":"cc15b84d-489"},"imported":[],"importedBy":[{"uid":"cc15b84d-492"},{"uid":"cc15b84d-490"}]},"cc15b84d-490":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/has_string_enumerability_bug.js","moduleParts":{"browser.js":"cc15b84d-491"},"imported":[{"uid":"cc15b84d-488"}],"importedBy":[{"uid":"cc15b84d-492"}]},"cc15b84d-492":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/main.js","moduleParts":{"browser.js":"cc15b84d-493"},"imported":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-486"},{"uid":"cc15b84d-306"},{"uid":"cc15b84d-488"},{"uid":"cc15b84d-490"}],"importedBy":[{"uid":"cc15b84d-784"}]},"cc15b84d-494":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-495"},"imported":[{"uid":"cc15b84d-744"},{"uid":"cc15b84d-784"},{"uid":"cc15b84d-735"},{"uid":"cc15b84d-760"},{"uid":"cc15b84d-206"}],"importedBy":[{"uid":"cc15b84d-496"}]},"cc15b84d-496":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/index.js","moduleParts":{"browser.js":"cc15b84d-497"},"imported":[{"uid":"cc15b84d-476"},{"uid":"cc15b84d-474"},{"uid":"cc15b84d-494"}],"importedBy":[{"uid":"cc15b84d-498"},{"uid":"cc15b84d-522"}]},"cc15b84d-498":{"id":"/node_modules/@stdlib/utils-keys/lib/builtin_wrapper.js","moduleParts":{"browser.js":"cc15b84d-499"},"imported":[{"uid":"cc15b84d-496"},{"uid":"cc15b84d-468"}],"importedBy":[{"uid":"cc15b84d-524"}]},"cc15b84d-500":{"id":"/node_modules/@stdlib/utils-noop/lib/main.js","moduleParts":{"browser.js":"cc15b84d-501"},"imported":[],"importedBy":[{"uid":"cc15b84d-785"}]},"cc15b84d-502":{"id":"/node_modules/@stdlib/utils-keys/lib/has_enumerable_prototype_bug.js","moduleParts":{"browser.js":"cc15b84d-503"},"imported":[{"uid":"cc15b84d-784"},{"uid":"cc15b84d-785"}],"importedBy":[{"uid":"cc15b84d-522"}]},"cc15b84d-504":{"id":"/node_modules/@stdlib/utils-keys/lib/has_non_enumerable_properties_bug.js","moduleParts":{"browser.js":"cc15b84d-505"},"imported":[{"uid":"cc15b84d-784"}],"importedBy":[{"uid":"cc15b84d-522"}]},"cc15b84d-506":{"id":"/node_modules/@stdlib/utils-index-of/lib/main.js","moduleParts":{"browser.js":"cc15b84d-507"},"imported":[{"uid":"cc15b84d-486"},{"uid":"cc15b84d-754"},{"uid":"cc15b84d-90"},{"uid":"cc15b84d-306"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-787"}]},"cc15b84d-508":{"id":"/node_modules/@stdlib/utils-keys/lib/is_constructor_prototype.js","moduleParts":{"browser.js":"cc15b84d-509"},"imported":[],"importedBy":[{"uid":"cc15b84d-518"},{"uid":"cc15b84d-514"}]},"cc15b84d-510":{"id":"/node_modules/@stdlib/utils-keys/lib/excluded_keys.json","moduleParts":{"browser.js":"cc15b84d-511"},"imported":[],"importedBy":[{"uid":"cc15b84d-514"}]},"cc15b84d-512":{"id":"/node_modules/@stdlib/utils-keys/lib/window.js","moduleParts":{"browser.js":"cc15b84d-513"},"imported":[],"importedBy":[{"uid":"cc15b84d-514"}]},"cc15b84d-514":{"id":"/node_modules/@stdlib/utils-keys/lib/has_automation_equality_bug.js","moduleParts":{"browser.js":"cc15b84d-515"},"imported":[{"uid":"cc15b84d-744"},{"uid":"cc15b84d-787"},{"uid":"cc15b84d-366"},{"uid":"cc15b84d-508"},{"uid":"cc15b84d-510"},{"uid":"cc15b84d-512"}],"importedBy":[{"uid":"cc15b84d-518"}]},"cc15b84d-516":{"id":"/node_modules/@stdlib/utils-keys/lib/has_window.js","moduleParts":{"browser.js":"cc15b84d-517"},"imported":[],"importedBy":[{"uid":"cc15b84d-518"}]},"cc15b84d-518":{"id":"/node_modules/@stdlib/utils-keys/lib/is_constructor_prototype_wrapper.js","moduleParts":{"browser.js":"cc15b84d-519"},"imported":[{"uid":"cc15b84d-514"},{"uid":"cc15b84d-508"},{"uid":"cc15b84d-516"}],"importedBy":[{"uid":"cc15b84d-522"}]},"cc15b84d-520":{"id":"/node_modules/@stdlib/utils-keys/lib/non_enumerable.json","moduleParts":{"browser.js":"cc15b84d-521"},"imported":[],"importedBy":[{"uid":"cc15b84d-522"}]},"cc15b84d-522":{"id":"/node_modules/@stdlib/utils-keys/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-523"},"imported":[{"uid":"cc15b84d-190"},{"uid":"cc15b84d-744"},{"uid":"cc15b84d-496"},{"uid":"cc15b84d-502"},{"uid":"cc15b84d-504"},{"uid":"cc15b84d-518"},{"uid":"cc15b84d-520"}],"importedBy":[{"uid":"cc15b84d-524"}]},"cc15b84d-524":{"id":"/node_modules/@stdlib/utils-keys/lib/main.js","moduleParts":{"browser.js":"cc15b84d-525"},"imported":[{"uid":"cc15b84d-470"},{"uid":"cc15b84d-472"},{"uid":"cc15b84d-468"},{"uid":"cc15b84d-498"},{"uid":"cc15b84d-522"}],"importedBy":[{"uid":"cc15b84d-781"}]},"cc15b84d-526":{"id":"/node_modules/@stdlib/object-ctor/lib/main.js","moduleParts":{"browser.js":"cc15b84d-527"},"imported":[],"importedBy":[{"uid":"cc15b84d-786"}]},"cc15b84d-528":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/native.js","moduleParts":{"browser.js":"cc15b84d-529"},"imported":[],"importedBy":[{"uid":"cc15b84d-534"}]},"cc15b84d-530":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/proto.js","moduleParts":{"browser.js":"cc15b84d-531"},"imported":[],"importedBy":[{"uid":"cc15b84d-532"}]},"cc15b84d-532":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/polyfill.js","moduleParts":{"browser.js":"cc15b84d-533"},"imported":[{"uid":"cc15b84d-80"},{"uid":"cc15b84d-786"},{"uid":"cc15b84d-530"}],"importedBy":[{"uid":"cc15b84d-534"}]},"cc15b84d-534":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/detect.js","moduleParts":{"browser.js":"cc15b84d-535"},"imported":[{"uid":"cc15b84d-757"},{"uid":"cc15b84d-528"},{"uid":"cc15b84d-532"}],"importedBy":[{"uid":"cc15b84d-536"}]},"cc15b84d-536":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/main.js","moduleParts":{"browser.js":"cc15b84d-537"},"imported":[{"uid":"cc15b84d-786"},{"uid":"cc15b84d-534"}],"importedBy":[{"uid":"cc15b84d-783"}]},"cc15b84d-538":{"id":"/node_modules/@stdlib/assert-is-plain-object/lib/main.js","moduleParts":{"browser.js":"cc15b84d-539"},"imported":[{"uid":"cc15b84d-756"},{"uid":"cc15b84d-757"},{"uid":"cc15b84d-783"},{"uid":"cc15b84d-744"},{"uid":"cc15b84d-80"}],"importedBy":[{"uid":"cc15b84d-782"}]},"cc15b84d-540":{"id":"/node_modules/@stdlib/object-inverse/lib/main.js","moduleParts":{"browser.js":"cc15b84d-541"},"imported":[{"uid":"cc15b84d-781"},{"uid":"cc15b84d-735"},{"uid":"cc15b84d-782"},{"uid":"cc15b84d-190"},{"uid":"cc15b84d-344"},{"uid":"cc15b84d-744"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-772"}]},"cc15b84d-542":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enums/lib/main.js","moduleParts":{"browser.js":"cc15b84d-543"},"imported":[],"importedBy":[{"uid":"cc15b84d-773"}]},"cc15b84d-544":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/main.js","moduleParts":{"browser.js":"cc15b84d-545"},"imported":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-772"},{"uid":"cc15b84d-773"}],"importedBy":[{"uid":"cc15b84d-742"}]},"cc15b84d-546":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/bytes_per_element.json","moduleParts":{"browser.js":"cc15b84d-547"},"imported":[],"importedBy":[{"uid":"cc15b84d-548"}]},"cc15b84d-548":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/main.js","moduleParts":{"browser.js":"cc15b84d-549"},"imported":[{"uid":"cc15b84d-90"},{"uid":"cc15b84d-114"},{"uid":"cc15b84d-466"},{"uid":"cc15b84d-742"},{"uid":"cc15b84d-546"}],"importedBy":[{"uid":"cc15b84d-731"}]},"cc15b84d-550":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/defaults.js","moduleParts":{"browser.js":"cc15b84d-551"},"imported":[],"importedBy":[{"uid":"cc15b84d-552"}]},"cc15b84d-552":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/main.js","moduleParts":{"browser.js":"cc15b84d-553"},"imported":[{"uid":"cc15b84d-731"},{"uid":"cc15b84d-550"}],"importedBy":[{"uid":"cc15b84d-721"}]},"cc15b84d-554":{"id":"/node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/main.js","moduleParts":{"browser.js":"cc15b84d-555"},"imported":[{"uid":"cc15b84d-721"}],"importedBy":[{"uid":"cc15b84d-696"}]},"cc15b84d-556":{"id":"/lib/2d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-557"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-558":{"id":"/lib/3d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-559"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-560":{"id":"/lib/4d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-561"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-562":{"id":"/lib/5d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-563"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-564":{"id":"/lib/6d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-565"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-566":{"id":"/lib/7d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-567"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-568":{"id":"/lib/8d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-569"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-570":{"id":"/lib/9d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-571"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-572":{"id":"/lib/10d_blocked_accessors.js","moduleParts":{"browser.js":"cc15b84d-573"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-574":{"id":"/lib/2d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-575"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-576":{"id":"/lib/3d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-577"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-578":{"id":"/lib/4d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-579"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-580":{"id":"/lib/5d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-581"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-582":{"id":"/lib/6d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-583"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-584":{"id":"/lib/7d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-585"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-586":{"id":"/lib/8d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-587"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-588":{"id":"/lib/9d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-589"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-590":{"id":"/lib/10d_blocked_complex.js","moduleParts":{"browser.js":"cc15b84d-591"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-592":{"id":"/lib/2d_blocked.js","moduleParts":{"browser.js":"cc15b84d-593"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-594":{"id":"/lib/3d_blocked.js","moduleParts":{"browser.js":"cc15b84d-595"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-596":{"id":"/lib/4d_blocked.js","moduleParts":{"browser.js":"cc15b84d-597"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-598":{"id":"/lib/5d_blocked.js","moduleParts":{"browser.js":"cc15b84d-599"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-600":{"id":"/lib/6d_blocked.js","moduleParts":{"browser.js":"cc15b84d-601"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-602":{"id":"/lib/7d_blocked.js","moduleParts":{"browser.js":"cc15b84d-603"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-604":{"id":"/lib/8d_blocked.js","moduleParts":{"browser.js":"cc15b84d-605"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-606":{"id":"/lib/9d_blocked.js","moduleParts":{"browser.js":"cc15b84d-607"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-608":{"id":"/lib/10d_blocked.js","moduleParts":{"browser.js":"cc15b84d-609"},"imported":[{"uid":"cc15b84d-695"},{"uid":"cc15b84d-696"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-610":{"id":"/lib/0d_accessors.js","moduleParts":{"browser.js":"cc15b84d-611"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-612":{"id":"/lib/1d_accessors.js","moduleParts":{"browser.js":"cc15b84d-613"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-614":{"id":"/lib/2d_accessors.js","moduleParts":{"browser.js":"cc15b84d-615"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-616":{"id":"/lib/3d_accessors.js","moduleParts":{"browser.js":"cc15b84d-617"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-618":{"id":"/lib/4d_accessors.js","moduleParts":{"browser.js":"cc15b84d-619"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-620":{"id":"/lib/5d_accessors.js","moduleParts":{"browser.js":"cc15b84d-621"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-622":{"id":"/lib/6d_accessors.js","moduleParts":{"browser.js":"cc15b84d-623"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-624":{"id":"/lib/7d_accessors.js","moduleParts":{"browser.js":"cc15b84d-625"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-626":{"id":"/lib/8d_accessors.js","moduleParts":{"browser.js":"cc15b84d-627"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-628":{"id":"/lib/9d_accessors.js","moduleParts":{"browser.js":"cc15b84d-629"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-630":{"id":"/lib/10d_accessors.js","moduleParts":{"browser.js":"cc15b84d-631"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-632":{"id":"/node_modules/@stdlib/ndarray-base-vind2bind/lib/main.js","moduleParts":{"browser.js":"cc15b84d-633"},"imported":[{"uid":"cc15b84d-723"},{"uid":"cc15b84d-715"}],"importedBy":[{"uid":"cc15b84d-699"}]},"cc15b84d-634":{"id":"/lib/nd_accessors.js","moduleParts":{"browser.js":"cc15b84d-635"},"imported":[{"uid":"cc15b84d-698"},{"uid":"cc15b84d-699"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-636":{"id":"/lib/0d_complex.js","moduleParts":{"browser.js":"cc15b84d-637"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-638":{"id":"/lib/1d_complex.js","moduleParts":{"browser.js":"cc15b84d-639"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-640":{"id":"/lib/2d_complex.js","moduleParts":{"browser.js":"cc15b84d-641"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-642":{"id":"/lib/3d_complex.js","moduleParts":{"browser.js":"cc15b84d-643"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-644":{"id":"/lib/4d_complex.js","moduleParts":{"browser.js":"cc15b84d-645"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-646":{"id":"/lib/5d_complex.js","moduleParts":{"browser.js":"cc15b84d-647"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-648":{"id":"/lib/6d_complex.js","moduleParts":{"browser.js":"cc15b84d-649"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-650":{"id":"/lib/7d_complex.js","moduleParts":{"browser.js":"cc15b84d-651"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-652":{"id":"/lib/8d_complex.js","moduleParts":{"browser.js":"cc15b84d-653"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-654":{"id":"/lib/9d_complex.js","moduleParts":{"browser.js":"cc15b84d-655"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-656":{"id":"/lib/10d_complex.js","moduleParts":{"browser.js":"cc15b84d-657"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-658":{"id":"/lib/nd_complex.js","moduleParts":{"browser.js":"cc15b84d-659"},"imported":[{"uid":"cc15b84d-698"},{"uid":"cc15b84d-699"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-660":{"id":"/lib/0d.js","moduleParts":{"browser.js":"cc15b84d-661"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-662":{"id":"/lib/1d.js","moduleParts":{"browser.js":"cc15b84d-663"},"imported":[],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-664":{"id":"/lib/2d.js","moduleParts":{"browser.js":"cc15b84d-665"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-666":{"id":"/lib/3d.js","moduleParts":{"browser.js":"cc15b84d-667"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-668":{"id":"/lib/4d.js","moduleParts":{"browser.js":"cc15b84d-669"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-670":{"id":"/lib/5d.js","moduleParts":{"browser.js":"cc15b84d-671"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-672":{"id":"/lib/6d.js","moduleParts":{"browser.js":"cc15b84d-673"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-674":{"id":"/lib/7d.js","moduleParts":{"browser.js":"cc15b84d-675"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-676":{"id":"/lib/8d.js","moduleParts":{"browser.js":"cc15b84d-677"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-678":{"id":"/lib/9d.js","moduleParts":{"browser.js":"cc15b84d-679"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-680":{"id":"/lib/10d.js","moduleParts":{"browser.js":"cc15b84d-681"},"imported":[{"uid":"cc15b84d-697"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-682":{"id":"/lib/nd.js","moduleParts":{"browser.js":"cc15b84d-683"},"imported":[{"uid":"cc15b84d-698"},{"uid":"cc15b84d-699"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-684":{"id":"/lib/main.js","moduleParts":{"browser.js":"cc15b84d-685"},"imported":[{"uid":"cc15b84d-688"},{"uid":"cc15b84d-689"},{"uid":"cc15b84d-690"},{"uid":"cc15b84d-42"},{"uid":"cc15b84d-691"},{"uid":"cc15b84d-692"},{"uid":"cc15b84d-693"},{"uid":"cc15b84d-446"},{"uid":"cc15b84d-556"},{"uid":"cc15b84d-558"},{"uid":"cc15b84d-560"},{"uid":"cc15b84d-562"},{"uid":"cc15b84d-564"},{"uid":"cc15b84d-566"},{"uid":"cc15b84d-568"},{"uid":"cc15b84d-570"},{"uid":"cc15b84d-572"},{"uid":"cc15b84d-574"},{"uid":"cc15b84d-576"},{"uid":"cc15b84d-578"},{"uid":"cc15b84d-580"},{"uid":"cc15b84d-582"},{"uid":"cc15b84d-584"},{"uid":"cc15b84d-586"},{"uid":"cc15b84d-588"},{"uid":"cc15b84d-590"},{"uid":"cc15b84d-592"},{"uid":"cc15b84d-594"},{"uid":"cc15b84d-596"},{"uid":"cc15b84d-598"},{"uid":"cc15b84d-600"},{"uid":"cc15b84d-602"},{"uid":"cc15b84d-604"},{"uid":"cc15b84d-606"},{"uid":"cc15b84d-608"},{"uid":"cc15b84d-610"},{"uid":"cc15b84d-612"},{"uid":"cc15b84d-614"},{"uid":"cc15b84d-616"},{"uid":"cc15b84d-618"},{"uid":"cc15b84d-620"},{"uid":"cc15b84d-622"},{"uid":"cc15b84d-624"},{"uid":"cc15b84d-626"},{"uid":"cc15b84d-628"},{"uid":"cc15b84d-630"},{"uid":"cc15b84d-634"},{"uid":"cc15b84d-636"},{"uid":"cc15b84d-638"},{"uid":"cc15b84d-640"},{"uid":"cc15b84d-642"},{"uid":"cc15b84d-644"},{"uid":"cc15b84d-646"},{"uid":"cc15b84d-648"},{"uid":"cc15b84d-650"},{"uid":"cc15b84d-652"},{"uid":"cc15b84d-654"},{"uid":"cc15b84d-656"},{"uid":"cc15b84d-658"},{"uid":"cc15b84d-660"},{"uid":"cc15b84d-662"},{"uid":"cc15b84d-664"},{"uid":"cc15b84d-666"},{"uid":"cc15b84d-668"},{"uid":"cc15b84d-670"},{"uid":"cc15b84d-672"},{"uid":"cc15b84d-674"},{"uid":"cc15b84d-676"},{"uid":"cc15b84d-678"},{"uid":"cc15b84d-680"},{"uid":"cc15b84d-682"}],"importedBy":[{"uid":"cc15b84d-686"}]},"cc15b84d-686":{"id":"/lib/index.js","moduleParts":{"browser.js":"cc15b84d-687"},"imported":[{"uid":"cc15b84d-684"}],"importedBy":[],"isEntry":true},"cc15b84d-688":{"id":"/node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-0"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-689":{"id":"/node_modules/@stdlib/array-base-assert-is-booleanarray/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-2"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-690":{"id":"/node_modules/@stdlib/ndarray-base-iteration-order/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-4"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-691":{"id":"/node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-128"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-692":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-164"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-693":{"id":"/node_modules/@stdlib/strided-base-reinterpret-boolean/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-180"}],"importedBy":[{"uid":"cc15b84d-684"}]},"cc15b84d-694":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-36"}],"importedBy":[{"uid":"cc15b84d-42"},{"uid":"cc15b84d-446"},{"uid":"cc15b84d-452"},{"uid":"cc15b84d-90"},{"uid":"cc15b84d-98"},{"uid":"cc15b84d-114"},{"uid":"cc15b84d-466"},{"uid":"cc15b84d-190"},{"uid":"cc15b84d-198"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-314"},{"uid":"cc15b84d-328"},{"uid":"cc15b84d-344"},{"uid":"cc15b84d-306"},{"uid":"cc15b84d-388"},{"uid":"cc15b84d-376"},{"uid":"cc15b84d-486"}]},"cc15b84d-695":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-458"}],"importedBy":[{"uid":"cc15b84d-556"},{"uid":"cc15b84d-558"},{"uid":"cc15b84d-560"},{"uid":"cc15b84d-562"},{"uid":"cc15b84d-564"},{"uid":"cc15b84d-566"},{"uid":"cc15b84d-568"},{"uid":"cc15b84d-570"},{"uid":"cc15b84d-572"},{"uid":"cc15b84d-574"},{"uid":"cc15b84d-576"},{"uid":"cc15b84d-578"},{"uid":"cc15b84d-580"},{"uid":"cc15b84d-582"},{"uid":"cc15b84d-584"},{"uid":"cc15b84d-586"},{"uid":"cc15b84d-588"},{"uid":"cc15b84d-590"},{"uid":"cc15b84d-592"},{"uid":"cc15b84d-594"},{"uid":"cc15b84d-596"},{"uid":"cc15b84d-598"},{"uid":"cc15b84d-600"},{"uid":"cc15b84d-602"},{"uid":"cc15b84d-604"},{"uid":"cc15b84d-606"},{"uid":"cc15b84d-608"}]},"cc15b84d-696":{"id":"/node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-554"}],"importedBy":[{"uid":"cc15b84d-556"},{"uid":"cc15b84d-558"},{"uid":"cc15b84d-560"},{"uid":"cc15b84d-562"},{"uid":"cc15b84d-564"},{"uid":"cc15b84d-566"},{"uid":"cc15b84d-568"},{"uid":"cc15b84d-570"},{"uid":"cc15b84d-572"},{"uid":"cc15b84d-574"},{"uid":"cc15b84d-576"},{"uid":"cc15b84d-578"},{"uid":"cc15b84d-580"},{"uid":"cc15b84d-582"},{"uid":"cc15b84d-584"},{"uid":"cc15b84d-586"},{"uid":"cc15b84d-588"},{"uid":"cc15b84d-590"},{"uid":"cc15b84d-592"},{"uid":"cc15b84d-594"},{"uid":"cc15b84d-596"},{"uid":"cc15b84d-598"},{"uid":"cc15b84d-600"},{"uid":"cc15b84d-602"},{"uid":"cc15b84d-604"},{"uid":"cc15b84d-606"},{"uid":"cc15b84d-608"}]},"cc15b84d-697":{"id":"/node_modules/@stdlib/ndarray-base-strides2order/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-122"}],"importedBy":[{"uid":"cc15b84d-614"},{"uid":"cc15b84d-616"},{"uid":"cc15b84d-618"},{"uid":"cc15b84d-620"},{"uid":"cc15b84d-622"},{"uid":"cc15b84d-624"},{"uid":"cc15b84d-626"},{"uid":"cc15b84d-628"},{"uid":"cc15b84d-630"},{"uid":"cc15b84d-640"},{"uid":"cc15b84d-642"},{"uid":"cc15b84d-644"},{"uid":"cc15b84d-646"},{"uid":"cc15b84d-648"},{"uid":"cc15b84d-650"},{"uid":"cc15b84d-652"},{"uid":"cc15b84d-654"},{"uid":"cc15b84d-656"},{"uid":"cc15b84d-664"},{"uid":"cc15b84d-666"},{"uid":"cc15b84d-668"},{"uid":"cc15b84d-670"},{"uid":"cc15b84d-672"},{"uid":"cc15b84d-674"},{"uid":"cc15b84d-676"},{"uid":"cc15b84d-678"},{"uid":"cc15b84d-680"},{"uid":"cc15b84d-124"}]},"cc15b84d-698":{"id":"/node_modules/@stdlib/ndarray-base-numel/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-54"}],"importedBy":[{"uid":"cc15b84d-634"},{"uid":"cc15b84d-658"},{"uid":"cc15b84d-682"},{"uid":"cc15b84d-128"}]},"cc15b84d-699":{"id":"/node_modules/@stdlib/ndarray-base-vind2bind/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-632"}],"importedBy":[{"uid":"cc15b84d-634"},{"uid":"cc15b84d-658"},{"uid":"cc15b84d-682"}]},"cc15b84d-700":{"id":"/node_modules/@stdlib/array-base-assert-is-accessor-array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-44"}],"importedBy":[{"uid":"cc15b84d-128"},{"uid":"cc15b84d-438"}]},"cc15b84d-701":{"id":"/node_modules/@stdlib/array-base-accessor-getter/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-46"}],"importedBy":[{"uid":"cc15b84d-128"},{"uid":"cc15b84d-438"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-702":{"id":"/node_modules/@stdlib/array-base-accessor-setter/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-48"}],"importedBy":[{"uid":"cc15b84d-128"},{"uid":"cc15b84d-438"}]},"cc15b84d-703":{"id":"/node_modules/@stdlib/array-base-getter/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-50"}],"importedBy":[{"uid":"cc15b84d-128"},{"uid":"cc15b84d-438"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-704":{"id":"/node_modules/@stdlib/array-base-setter/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-52"}],"importedBy":[{"uid":"cc15b84d-128"},{"uid":"cc15b84d-438"}]},"cc15b84d-705":{"id":"/node_modules/@stdlib/ndarray-base-dtype/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-56"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-706":{"id":"/node_modules/@stdlib/ndarray-base-shape/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-60"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-707":{"id":"/node_modules/@stdlib/ndarray-base-strides/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-100"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-708":{"id":"/node_modules/@stdlib/ndarray-base-offset/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-118"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-709":{"id":"/node_modules/@stdlib/ndarray-base-order/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-124"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-710":{"id":"/node_modules/@stdlib/ndarray-base-data-buffer/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-126"}],"importedBy":[{"uid":"cc15b84d-128"}]},"cc15b84d-711":{"id":"/node_modules/@stdlib/array-base-assert-is-complex128array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-130"}],"importedBy":[{"uid":"cc15b84d-164"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"}]},"cc15b84d-712":{"id":"/node_modules/@stdlib/array-base-assert-is-complex64array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-132"}],"importedBy":[{"uid":"cc15b84d-164"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"}]},"cc15b84d-713":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex128/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-146"}],"importedBy":[{"uid":"cc15b84d-164"},{"uid":"cc15b84d-450"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"}]},"cc15b84d-714":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex64/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-162"}],"importedBy":[{"uid":"cc15b84d-164"},{"uid":"cc15b84d-450"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"}]},"cc15b84d-715":{"id":"/node_modules/@stdlib/string-format/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-30"}],"importedBy":[{"uid":"cc15b84d-164"},{"uid":"cc15b84d-632"},{"uid":"cc15b84d-32"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"},{"uid":"cc15b84d-186"},{"uid":"cc15b84d-388"},{"uid":"cc15b84d-376"},{"uid":"cc15b84d-540"},{"uid":"cc15b84d-354"},{"uid":"cc15b84d-506"}]},"cc15b84d-716":{"id":"/node_modules/@stdlib/strided-base-stride2offset/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-182"}],"importedBy":[{"uid":"cc15b84d-444"}]},"cc15b84d-717":{"id":"/node_modules/@stdlib/array-base-arraylike2object/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-438"}],"importedBy":[{"uid":"cc15b84d-442"},{"uid":"cc15b84d-450"}]},"cc15b84d-718":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-172"}],"importedBy":[{"uid":"cc15b84d-178"}]},"cc15b84d-719":{"id":"/node_modules/@stdlib/array-base-copy-indexed/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-58"}],"importedBy":[{"uid":"cc15b84d-458"},{"uid":"cc15b84d-60"},{"uid":"cc15b84d-100"}]},"cc15b84d-720":{"id":"/node_modules/@stdlib/array-base-take-indexed/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-454"}],"importedBy":[{"uid":"cc15b84d-458"}]},"cc15b84d-721":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-552"}],"importedBy":[{"uid":"cc15b84d-554"}]},"cc15b84d-722":{"id":"/node_modules/@stdlib/math-base-special-abs/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-120"}],"importedBy":[{"uid":"cc15b84d-122"}]},"cc15b84d-723":{"id":"/node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-92"}],"importedBy":[{"uid":"cc15b84d-632"},{"uid":"cc15b84d-94"},{"uid":"cc15b84d-96"}]},"cc15b84d-724":{"id":"/node_modules/@stdlib/ndarray-base-strides2offset/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-116"}],"importedBy":[{"uid":"cc15b84d-118"}]},"cc15b84d-725":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-24"}],"importedBy":[{"uid":"cc15b84d-30"}]},"cc15b84d-726":{"id":"/node_modules/@stdlib/string-base-format-tokenize/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-26"}],"importedBy":[{"uid":"cc15b84d-30"}]},"cc15b84d-727":{"id":"/node_modules/@stdlib/array-dtype/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-436"}],"importedBy":[{"uid":"cc15b84d-438"}]},"cc15b84d-728":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-138"}],"importedBy":[{"uid":"cc15b84d-144"}]},"cc15b84d-729":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-154"}],"importedBy":[{"uid":"cc15b84d-160"}]},"cc15b84d-730":{"id":"/node_modules/@stdlib/assert-is-uint8array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-166"}],"importedBy":[{"uid":"cc15b84d-172"}]},"cc15b84d-731":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-548"}],"importedBy":[{"uid":"cc15b84d-552"}]},"cc15b84d-732":{"id":"/node_modules/@stdlib/assert-has-tostringtag-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-66"}],"importedBy":[{"uid":"cc15b84d-86"},{"uid":"cc15b84d-110"},{"uid":"cc15b84d-80"},{"uid":"cc15b84d-340"}]},"cc15b84d-733":{"id":"/node_modules/@stdlib/number-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-104"}],"importedBy":[{"uid":"cc15b84d-110"},{"uid":"cc15b84d-106"},{"uid":"cc15b84d-292"}]},"cc15b84d-734":{"id":"/node_modules/@stdlib/assert-is-buffer/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-192"}],"importedBy":[{"uid":"cc15b84d-436"},{"uid":"cc15b84d-200"}]},"cc15b84d-735":{"id":"/node_modules/@stdlib/assert-is-array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-184"}],"importedBy":[{"uid":"cc15b84d-436"},{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-186"},{"uid":"cc15b84d-326"},{"uid":"cc15b84d-540"},{"uid":"cc15b84d-494"}]},"cc15b84d-736":{"id":"/node_modules/@stdlib/utils-constructor-name/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-200"}],"importedBy":[{"uid":"cc15b84d-436"},{"uid":"cc15b84d-362"},{"uid":"cc15b84d-364"}]},"cc15b84d-737":{"id":"/node_modules/@stdlib/assert-is-float64array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-134"}],"importedBy":[{"uid":"cc15b84d-138"}]},"cc15b84d-738":{"id":"/node_modules/@stdlib/assert-is-float32array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-148"}],"importedBy":[{"uid":"cc15b84d-154"}]},"cc15b84d-739":{"id":"/node_modules/@stdlib/array-complex64/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-410"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-740":{"id":"/node_modules/@stdlib/array-complex128/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-422"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-741":{"id":"/node_modules/@stdlib/array-bool/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-430"}],"importedBy":[{"uid":"cc15b84d-432"}]},"cc15b84d-742":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-544"}],"importedBy":[{"uid":"cc15b84d-548"}]},"cc15b84d-743":{"id":"/node_modules/@stdlib/assert-has-symbol-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-64"}],"importedBy":[{"uid":"cc15b84d-66"}]},"cc15b84d-744":{"id":"/node_modules/@stdlib/assert-has-own-property/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-72"}],"importedBy":[{"uid":"cc15b84d-78"},{"uid":"cc15b84d-394"},{"uid":"cc15b84d-540"},{"uid":"cc15b84d-538"},{"uid":"cc15b84d-522"},{"uid":"cc15b84d-494"},{"uid":"cc15b84d-514"}]},"cc15b84d-745":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-210"}],"importedBy":[{"uid":"cc15b84d-216"}]},"cc15b84d-746":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-226"}],"importedBy":[{"uid":"cc15b84d-232"}]},"cc15b84d-747":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-240"}],"importedBy":[{"uid":"cc15b84d-246"}]},"cc15b84d-748":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-256"}],"importedBy":[{"uid":"cc15b84d-262"}]},"cc15b84d-749":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-268"}],"importedBy":[{"uid":"cc15b84d-274"}]},"cc15b84d-750":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-284"}],"importedBy":[{"uid":"cc15b84d-290"}]},"cc15b84d-751":{"id":"/node_modules/@stdlib/symbol-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-74"}],"importedBy":[{"uid":"cc15b84d-76"},{"uid":"cc15b84d-394"}]},"cc15b84d-752":{"id":"/node_modules/@stdlib/assert-tools-array-function/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-186"}],"importedBy":[{"uid":"cc15b84d-190"},{"uid":"cc15b84d-328"}]},"cc15b84d-753":{"id":"/node_modules/@stdlib/assert-is-array-like-object/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-318"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"}]},"cc15b84d-754":{"id":"/node_modules/@stdlib/assert-is-collection/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-322"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-506"}]},"cc15b84d-755":{"id":"/node_modules/@stdlib/assert-is-arraybuffer/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-324"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-756":{"id":"/node_modules/@stdlib/assert-is-object/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-326"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-538"}]},"cc15b84d-757":{"id":"/node_modules/@stdlib/assert-is-function/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-368"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-538"},{"uid":"cc15b84d-534"}]},"cc15b84d-758":{"id":"/node_modules/@stdlib/assert-is-complex-like/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-390"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-408"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"},{"uid":"cc15b84d-420"}]},"cc15b84d-759":{"id":"/node_modules/@stdlib/math-base-assert-is-even/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-392"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"}]},"cc15b84d-760":{"id":"/node_modules/@stdlib/math-base-assert-is-integer/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-296"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-318"},{"uid":"cc15b84d-322"},{"uid":"cc15b84d-392"},{"uid":"cc15b84d-298"},{"uid":"cc15b84d-494"}]},"cc15b84d-761":{"id":"/node_modules/@stdlib/assert-has-iterator-symbol-support/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-394"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-396"}]},"cc15b84d-762":{"id":"/node_modules/@stdlib/symbol-iterator/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-396"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-763":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-398"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"}]},"cc15b84d-764":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-388"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-390"}]},"cc15b84d-765":{"id":"/node_modules/@stdlib/complex-float32-real/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-400"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-408"}]},"cc15b84d-766":{"id":"/node_modules/@stdlib/complex-float32-imag/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-402"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-404"},{"uid":"cc15b84d-406"},{"uid":"cc15b84d-408"}]},"cc15b84d-767":{"id":"/node_modules/@stdlib/math-base-special-floor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-294"}],"importedBy":[{"uid":"cc15b84d-410"},{"uid":"cc15b84d-422"},{"uid":"cc15b84d-430"},{"uid":"cc15b84d-296"}]},"cc15b84d-768":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-376"}],"importedBy":[{"uid":"cc15b84d-422"},{"uid":"cc15b84d-390"}]},"cc15b84d-769":{"id":"/node_modules/@stdlib/complex-float64-real/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-412"}],"importedBy":[{"uid":"cc15b84d-422"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"},{"uid":"cc15b84d-420"}]},"cc15b84d-770":{"id":"/node_modules/@stdlib/complex-float64-imag/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-414"}],"importedBy":[{"uid":"cc15b84d-422"},{"uid":"cc15b84d-416"},{"uid":"cc15b84d-418"},{"uid":"cc15b84d-420"}]},"cc15b84d-771":{"id":"/node_modules/@stdlib/boolean-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-334"}],"importedBy":[{"uid":"cc15b84d-430"},{"uid":"cc15b84d-424"},{"uid":"cc15b84d-426"},{"uid":"cc15b84d-428"},{"uid":"cc15b84d-340"}]},"cc15b84d-772":{"id":"/node_modules/@stdlib/object-inverse/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-540"}],"importedBy":[{"uid":"cc15b84d-544"}]},"cc15b84d-773":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enums/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-542"}],"importedBy":[{"uid":"cc15b84d-544"}]},"cc15b84d-774":{"id":"/node_modules/@stdlib/assert-is-uint32array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-204"}],"importedBy":[{"uid":"cc15b84d-210"}]},"cc15b84d-775":{"id":"/node_modules/@stdlib/assert-is-int32array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-218"}],"importedBy":[{"uid":"cc15b84d-226"}]},"cc15b84d-776":{"id":"/node_modules/@stdlib/assert-is-uint16array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-234"}],"importedBy":[{"uid":"cc15b84d-240"}]},"cc15b84d-777":{"id":"/node_modules/@stdlib/assert-is-int16array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-248"}],"importedBy":[{"uid":"cc15b84d-256"}]},"cc15b84d-778":{"id":"/node_modules/@stdlib/assert-is-uint8clampedarray/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-264"}],"importedBy":[{"uid":"cc15b84d-268"}]},"cc15b84d-779":{"id":"/node_modules/@stdlib/assert-is-int8array/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-276"}],"importedBy":[{"uid":"cc15b84d-284"}]},"cc15b84d-780":{"id":"/node_modules/@stdlib/utils-define-read-only-property/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-370"}],"importedBy":[{"uid":"cc15b84d-388"},{"uid":"cc15b84d-376"}]},"cc15b84d-781":{"id":"/node_modules/@stdlib/utils-keys/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-524"}],"importedBy":[{"uid":"cc15b84d-540"}]},"cc15b84d-782":{"id":"/node_modules/@stdlib/assert-is-plain-object/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-538"}],"importedBy":[{"uid":"cc15b84d-540"}]},"cc15b84d-783":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-536"}],"importedBy":[{"uid":"cc15b84d-538"}]},"cc15b84d-784":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-492"}],"importedBy":[{"uid":"cc15b84d-502"},{"uid":"cc15b84d-504"},{"uid":"cc15b84d-494"}]},"cc15b84d-785":{"id":"/node_modules/@stdlib/utils-noop/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-500"}],"importedBy":[{"uid":"cc15b84d-502"}]},"cc15b84d-786":{"id":"/node_modules/@stdlib/object-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-526"}],"importedBy":[{"uid":"cc15b84d-536"},{"uid":"cc15b84d-532"}]},"cc15b84d-787":{"id":"/node_modules/@stdlib/utils-index-of/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-506"}],"importedBy":[{"uid":"cc15b84d-514"}]},"cc15b84d-788":{"id":"/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js","moduleParts":{},"imported":[{"uid":"cc15b84d-478"}],"importedBy":[{"uid":"cc15b84d-480"},{"uid":"cc15b84d-482"}]}},"env":{"rollup":"4.11.0"},"options":{"gzip":false,"brotli":false,"sourcemap":false}};
+
+    const run = () => {
+      const width = window.innerWidth;
+      const height = window.innerHeight;
+
+      const chartNode = document.querySelector("main");
+      drawChart.default(chartNode, data, width, height);
+    };
+
+    window.addEventListener('resize', run);
+
+    document.addEventListener('DOMContentLoaded', run);
+    /*-->*/
+  </script>
+</body>
+</html>
+
diff --git a/stats_node.html b/stats_node.html
new file mode 100644
index 0000000..c883008
--- /dev/null
+++ b/stats_node.html
@@ -0,0 +1,4842 @@
+
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8" />
+  <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+  <meta http-equiv="X-UA-Compatible" content="ie=edge" />
+  <title>Rollup Visualizer</title>
+  <style>
+:root {
+  --font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, "Helvetica Neue", Arial, "Noto Sans", sans-serif,
+    "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol", "Noto Color Emoji";
+  --background-color: #2b2d42;
+  --text-color: #edf2f4;
+}
+
+html {
+  box-sizing: border-box;
+}
+
+*,
+*:before,
+*:after {
+  box-sizing: inherit;
+}
+
+html {
+  background-color: var(--background-color);
+  color: var(--text-color);
+  font-family: var(--font-family);
+}
+
+body {
+  padding: 0;
+  margin: 0;
+}
+
+html,
+body {
+  height: 100%;
+  width: 100%;
+  overflow: hidden;
+}
+
+body {
+  display: flex;
+  flex-direction: column;
+}
+
+svg {
+  vertical-align: middle;
+  width: 100%;
+  height: 100%;
+  max-height: 100vh;
+}
+
+main {
+  flex-grow: 1;
+  height: 100vh;
+  padding: 20px;
+}
+
+.tooltip {
+  position: absolute;
+  z-index: 1070;
+  border: 2px solid;
+  border-radius: 5px;
+  padding: 5px;
+  white-space: nowrap;
+  font-size: 0.875rem;
+  background-color: var(--background-color);
+  color: var(--text-color);
+}
+
+.tooltip-hidden {
+  visibility: hidden;
+  opacity: 0;
+}
+
+.sidebar {
+  position: fixed;
+  top: 0;
+  left: 0;
+  right: 0;
+  display: flex;
+  flex-direction: row;
+  font-size: 0.7rem;
+  align-items: center;
+  margin: 0 50px;
+  height: 20px;
+}
+
+.size-selectors {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+}
+
+.size-selector {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+  justify-content: center;
+  margin-right: 1rem;
+}
+.size-selector input {
+  margin: 0 0.3rem 0 0;
+}
+
+.filters {
+  flex: 1;
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+}
+
+.module-filters {
+  display: flex;
+  flex-grow: 1;
+}
+
+.module-filter {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+  justify-content: center;
+  flex: 1;
+}
+.module-filter input {
+  flex: 1;
+  height: 1rem;
+  padding: 0.01rem;
+  font-size: 0.7rem;
+  margin-left: 0.3rem;
+}
+.module-filter + .module-filter {
+  margin-left: 0.5rem;
+}
+
+.node {
+  cursor: pointer;
+}
+  </style>
+</head>
+<body>
+  <main></main>
+  <script>
+  /*<!--*/
+var drawChart = (function (exports) {
+  'use strict';
+
+  var n,l$1,u$2,i$1,o$1,r$1,f$2,e$1,c$1={},s$1=[],a$1=/acit|ex(?:s|g|n|p|$)|rph|grid|ows|mnc|ntw|ine[ch]|zoo|^ord|itera/i,h$1=Array.isArray;function v$1(n,l){for(var u in l)n[u]=l[u];return n}function p$1(n){var l=n.parentNode;l&&l.removeChild(n);}function y$1(l,u,t){var i,o,r,f={};for(r in u)"key"==r?i=u[r]:"ref"==r?o=u[r]:f[r]=u[r];if(arguments.length>2&&(f.children=arguments.length>3?n.call(arguments,2):t),"function"==typeof l&&null!=l.defaultProps)for(r in l.defaultProps)void 0===f[r]&&(f[r]=l.defaultProps[r]);return d$1(l,f,i,o,null)}function d$1(n,t,i,o,r){var f={type:n,props:t,key:i,ref:o,__k:null,__:null,__b:0,__e:null,__d:void 0,__c:null,constructor:void 0,__v:null==r?++u$2:r,__i:-1,__u:0};return null==r&&null!=l$1.vnode&&l$1.vnode(f),f}function g$1(n){return n.children}function b$1(n,l){this.props=n,this.context=l;}function m$1(n,l){if(null==l)return n.__?m$1(n.__,n.__i+1):null;for(var u;l<n.__k.length;l++)if(null!=(u=n.__k[l])&&null!=u.__e)return u.__e;return "function"==typeof n.type?m$1(n):null}function k$1(n){var l,u;if(null!=(n=n.__)&&null!=n.__c){for(n.__e=n.__c.base=null,l=0;l<n.__k.length;l++)if(null!=(u=n.__k[l])&&null!=u.__e){n.__e=n.__c.base=u.__e;break}return k$1(n)}}function w$1(n){(!n.__d&&(n.__d=!0)&&i$1.push(n)&&!x.__r++||o$1!==l$1.debounceRendering)&&((o$1=l$1.debounceRendering)||r$1)(x);}function x(){var n,u,t,o,r,e,c,s,a;for(i$1.sort(f$2);n=i$1.shift();)n.__d&&(u=i$1.length,o=void 0,e=(r=(t=n).__v).__e,s=[],a=[],(c=t.__P)&&((o=v$1({},r)).__v=r.__v+1,l$1.vnode&&l$1.vnode(o),L(c,o,r,t.__n,void 0!==c.ownerSVGElement,32&r.__u?[e]:null,s,null==e?m$1(r):e,!!(32&r.__u),a),o.__.__k[o.__i]=o,M(s,o,a),o.__e!=e&&k$1(o)),i$1.length>u&&i$1.sort(f$2));x.__r=0;}function C(n,l,u,t,i,o,r,f,e,a,h){var v,p,y,d,_,g=t&&t.__k||s$1,b=l.length;for(u.__d=e,P(u,l,g),e=u.__d,v=0;v<b;v++)null!=(y=u.__k[v])&&"boolean"!=typeof y&&"function"!=typeof y&&(p=-1===y.__i?c$1:g[y.__i]||c$1,y.__i=v,L(n,y,p,i,o,r,f,e,a,h),d=y.__e,y.ref&&p.ref!=y.ref&&(p.ref&&z$1(p.ref,null,y),h.push(y.ref,y.__c||d,y)),null==_&&null!=d&&(_=d),65536&y.__u||p.__k===y.__k?e=S(y,e,n):"function"==typeof y.type&&void 0!==y.__d?e=y.__d:d&&(e=d.nextSibling),y.__d=void 0,y.__u&=-196609);u.__d=e,u.__e=_;}function P(n,l,u){var t,i,o,r,f,e=l.length,c=u.length,s=c,a=0;for(n.__k=[],t=0;t<e;t++)null!=(i=n.__k[t]=null==(i=l[t])||"boolean"==typeof i||"function"==typeof i?null:"string"==typeof i||"number"==typeof i||"bigint"==typeof i||i.constructor==String?d$1(null,i,null,null,i):h$1(i)?d$1(g$1,{children:i},null,null,null):void 0===i.constructor&&i.__b>0?d$1(i.type,i.props,i.key,i.ref?i.ref:null,i.__v):i)?(i.__=n,i.__b=n.__b+1,f=H(i,u,r=t+a,s),i.__i=f,o=null,-1!==f&&(s--,(o=u[f])&&(o.__u|=131072)),null==o||null===o.__v?(-1==f&&a--,"function"!=typeof i.type&&(i.__u|=65536)):f!==r&&(f===r+1?a++:f>r?s>e-r?a+=f-r:a--:a=f<r&&f==r-1?f-r:0,f!==t+a&&(i.__u|=65536))):(o=u[t])&&null==o.key&&o.__e&&(o.__e==n.__d&&(n.__d=m$1(o)),N(o,o,!1),u[t]=null,s--);if(s)for(t=0;t<c;t++)null!=(o=u[t])&&0==(131072&o.__u)&&(o.__e==n.__d&&(n.__d=m$1(o)),N(o,o));}function S(n,l,u){var t,i;if("function"==typeof n.type){for(t=n.__k,i=0;t&&i<t.length;i++)t[i]&&(t[i].__=n,l=S(t[i],l,u));return l}return n.__e!=l&&(u.insertBefore(n.__e,l||null),l=n.__e),l&&l.nextSibling}function H(n,l,u,t){var i=n.key,o=n.type,r=u-1,f=u+1,e=l[u];if(null===e||e&&i==e.key&&o===e.type)return u;if(t>(null!=e&&0==(131072&e.__u)?1:0))for(;r>=0||f<l.length;){if(r>=0){if((e=l[r])&&0==(131072&e.__u)&&i==e.key&&o===e.type)return r;r--;}if(f<l.length){if((e=l[f])&&0==(131072&e.__u)&&i==e.key&&o===e.type)return f;f++;}}return -1}function I(n,l,u){"-"===l[0]?n.setProperty(l,null==u?"":u):n[l]=null==u?"":"number"!=typeof u||a$1.test(l)?u:u+"px";}function T$1(n,l,u,t,i){var o;n:if("style"===l)if("string"==typeof u)n.style.cssText=u;else {if("string"==typeof t&&(n.style.cssText=t=""),t)for(l in t)u&&l in u||I(n.style,l,"");if(u)for(l in u)t&&u[l]===t[l]||I(n.style,l,u[l]);}else if("o"===l[0]&&"n"===l[1])o=l!==(l=l.replace(/(PointerCapture)$|Capture$/,"$1")),l=l.toLowerCase()in n?l.toLowerCase().slice(2):l.slice(2),n.l||(n.l={}),n.l[l+o]=u,u?t?u.u=t.u:(u.u=Date.now(),n.addEventListener(l,o?D:A,o)):n.removeEventListener(l,o?D:A,o);else {if(i)l=l.replace(/xlink(H|:h)/,"h").replace(/sName$/,"s");else if("width"!==l&&"height"!==l&&"href"!==l&&"list"!==l&&"form"!==l&&"tabIndex"!==l&&"download"!==l&&"rowSpan"!==l&&"colSpan"!==l&&"role"!==l&&l in n)try{n[l]=null==u?"":u;break n}catch(n){}"function"==typeof u||(null==u||!1===u&&"-"!==l[4]?n.removeAttribute(l):n.setAttribute(l,u));}}function A(n){var u=this.l[n.type+!1];if(n.t){if(n.t<=u.u)return}else n.t=Date.now();return u(l$1.event?l$1.event(n):n)}function D(n){return this.l[n.type+!0](l$1.event?l$1.event(n):n)}function L(n,u,t,i,o,r,f,e,c,s){var a,p,y,d,_,m,k,w,x,P,S,$,H,I,T,A=u.type;if(void 0!==u.constructor)return null;128&t.__u&&(c=!!(32&t.__u),r=[e=u.__e=t.__e]),(a=l$1.__b)&&a(u);n:if("function"==typeof A)try{if(w=u.props,x=(a=A.contextType)&&i[a.__c],P=a?x?x.props.value:a.__:i,t.__c?k=(p=u.__c=t.__c).__=p.__E:("prototype"in A&&A.prototype.render?u.__c=p=new A(w,P):(u.__c=p=new b$1(w,P),p.constructor=A,p.render=O),x&&x.sub(p),p.props=w,p.state||(p.state={}),p.context=P,p.__n=i,y=p.__d=!0,p.__h=[],p._sb=[]),null==p.__s&&(p.__s=p.state),null!=A.getDerivedStateFromProps&&(p.__s==p.state&&(p.__s=v$1({},p.__s)),v$1(p.__s,A.getDerivedStateFromProps(w,p.__s))),d=p.props,_=p.state,p.__v=u,y)null==A.getDerivedStateFromProps&&null!=p.componentWillMount&&p.componentWillMount(),null!=p.componentDidMount&&p.__h.push(p.componentDidMount);else {if(null==A.getDerivedStateFromProps&&w!==d&&null!=p.componentWillReceiveProps&&p.componentWillReceiveProps(w,P),!p.__e&&(null!=p.shouldComponentUpdate&&!1===p.shouldComponentUpdate(w,p.__s,P)||u.__v===t.__v)){for(u.__v!==t.__v&&(p.props=w,p.state=p.__s,p.__d=!1),u.__e=t.__e,u.__k=t.__k,u.__k.forEach(function(n){n&&(n.__=u);}),S=0;S<p._sb.length;S++)p.__h.push(p._sb[S]);p._sb=[],p.__h.length&&f.push(p);break n}null!=p.componentWillUpdate&&p.componentWillUpdate(w,p.__s,P),null!=p.componentDidUpdate&&p.__h.push(function(){p.componentDidUpdate(d,_,m);});}if(p.context=P,p.props=w,p.__P=n,p.__e=!1,$=l$1.__r,H=0,"prototype"in A&&A.prototype.render){for(p.state=p.__s,p.__d=!1,$&&$(u),a=p.render(p.props,p.state,p.context),I=0;I<p._sb.length;I++)p.__h.push(p._sb[I]);p._sb=[];}else do{p.__d=!1,$&&$(u),a=p.render(p.props,p.state,p.context),p.state=p.__s;}while(p.__d&&++H<25);p.state=p.__s,null!=p.getChildContext&&(i=v$1(v$1({},i),p.getChildContext())),y||null==p.getSnapshotBeforeUpdate||(m=p.getSnapshotBeforeUpdate(d,_)),C(n,h$1(T=null!=a&&a.type===g$1&&null==a.key?a.props.children:a)?T:[T],u,t,i,o,r,f,e,c,s),p.base=u.__e,u.__u&=-161,p.__h.length&&f.push(p),k&&(p.__E=p.__=null);}catch(n){u.__v=null,c||null!=r?(u.__e=e,u.__u|=c?160:32,r[r.indexOf(e)]=null):(u.__e=t.__e,u.__k=t.__k),l$1.__e(n,u,t);}else null==r&&u.__v===t.__v?(u.__k=t.__k,u.__e=t.__e):u.__e=j$1(t.__e,u,t,i,o,r,f,c,s);(a=l$1.diffed)&&a(u);}function M(n,u,t){u.__d=void 0;for(var i=0;i<t.length;i++)z$1(t[i],t[++i],t[++i]);l$1.__c&&l$1.__c(u,n),n.some(function(u){try{n=u.__h,u.__h=[],n.some(function(n){n.call(u);});}catch(n){l$1.__e(n,u.__v);}});}function j$1(l,u,t,i,o,r,f,e,s){var a,v,y,d,_,g,b,k=t.props,w=u.props,x=u.type;if("svg"===x&&(o=!0),null!=r)for(a=0;a<r.length;a++)if((_=r[a])&&"setAttribute"in _==!!x&&(x?_.localName===x:3===_.nodeType)){l=_,r[a]=null;break}if(null==l){if(null===x)return document.createTextNode(w);l=o?document.createElementNS("http://www.w3.org/2000/svg",x):document.createElement(x,w.is&&w),r=null,e=!1;}if(null===x)k===w||e&&l.data===w||(l.data=w);else {if(r=r&&n.call(l.childNodes),k=t.props||c$1,!e&&null!=r)for(k={},a=0;a<l.attributes.length;a++)k[(_=l.attributes[a]).name]=_.value;for(a in k)_=k[a],"children"==a||("dangerouslySetInnerHTML"==a?y=_:"key"===a||a in w||T$1(l,a,null,_,o));for(a in w)_=w[a],"children"==a?d=_:"dangerouslySetInnerHTML"==a?v=_:"value"==a?g=_:"checked"==a?b=_:"key"===a||e&&"function"!=typeof _||k[a]===_||T$1(l,a,_,k[a],o);if(v)e||y&&(v.__html===y.__html||v.__html===l.innerHTML)||(l.innerHTML=v.__html),u.__k=[];else if(y&&(l.innerHTML=""),C(l,h$1(d)?d:[d],u,t,i,o&&"foreignObject"!==x,r,f,r?r[0]:t.__k&&m$1(t,0),e,s),null!=r)for(a=r.length;a--;)null!=r[a]&&p$1(r[a]);e||(a="value",void 0!==g&&(g!==l[a]||"progress"===x&&!g||"option"===x&&g!==k[a])&&T$1(l,a,g,k[a],!1),a="checked",void 0!==b&&b!==l[a]&&T$1(l,a,b,k[a],!1));}return l}function z$1(n,u,t){try{"function"==typeof n?n(u):n.current=u;}catch(n){l$1.__e(n,t);}}function N(n,u,t){var i,o;if(l$1.unmount&&l$1.unmount(n),(i=n.ref)&&(i.current&&i.current!==n.__e||z$1(i,null,u)),null!=(i=n.__c)){if(i.componentWillUnmount)try{i.componentWillUnmount();}catch(n){l$1.__e(n,u);}i.base=i.__P=null,n.__c=void 0;}if(i=n.__k)for(o=0;o<i.length;o++)i[o]&&N(i[o],u,t||"function"!=typeof n.type);t||null==n.__e||p$1(n.__e),n.__=n.__e=n.__d=void 0;}function O(n,l,u){return this.constructor(n,u)}function q$1(u,t,i){var o,r,f,e;l$1.__&&l$1.__(u,t),r=(o="function"==typeof i)?null:i&&i.__k||t.__k,f=[],e=[],L(t,u=(!o&&i||t).__k=y$1(g$1,null,[u]),r||c$1,c$1,void 0!==t.ownerSVGElement,!o&&i?[i]:r?null:t.firstChild?n.call(t.childNodes):null,f,!o&&i?i:r?r.__e:t.firstChild,o,e),M(f,u,e);}function F$1(n,l){var u={__c:l="__cC"+e$1++,__:n,Consumer:function(n,l){return n.children(l)},Provider:function(n){var u,t;return this.getChildContext||(u=[],(t={})[l]=this,this.getChildContext=function(){return t},this.shouldComponentUpdate=function(n){this.props.value!==n.value&&u.some(function(n){n.__e=!0,w$1(n);});},this.sub=function(n){u.push(n);var l=n.componentWillUnmount;n.componentWillUnmount=function(){u.splice(u.indexOf(n),1),l&&l.call(n);};}),n.children}};return u.Provider.__=u.Consumer.contextType=u}n=s$1.slice,l$1={__e:function(n,l,u,t){for(var i,o,r;l=l.__;)if((i=l.__c)&&!i.__)try{if((o=i.constructor)&&null!=o.getDerivedStateFromError&&(i.setState(o.getDerivedStateFromError(n)),r=i.__d),null!=i.componentDidCatch&&(i.componentDidCatch(n,t||{}),r=i.__d),r)return i.__E=i}catch(l){n=l;}throw n}},u$2=0,b$1.prototype.setState=function(n,l){var u;u=null!=this.__s&&this.__s!==this.state?this.__s:this.__s=v$1({},this.state),"function"==typeof n&&(n=n(v$1({},u),this.props)),n&&v$1(u,n),null!=n&&this.__v&&(l&&this._sb.push(l),w$1(this));},b$1.prototype.forceUpdate=function(n){this.__v&&(this.__e=!0,n&&this.__h.push(n),w$1(this));},b$1.prototype.render=g$1,i$1=[],r$1="function"==typeof Promise?Promise.prototype.then.bind(Promise.resolve()):setTimeout,f$2=function(n,l){return n.__v.__b-l.__v.__b},x.__r=0,e$1=0;
+
+  var f$1=0;function u$1(e,t,n,o,i,u){var a,c,p={};for(c in t)"ref"==c?a=t[c]:p[c]=t[c];var l={type:e,props:p,key:n,ref:a,__k:null,__:null,__b:0,__e:null,__d:void 0,__c:null,constructor:void 0,__v:--f$1,__i:-1,__u:0,__source:i,__self:u};if("function"==typeof e&&(a=e.defaultProps))for(c in a)void 0===p[c]&&(p[c]=a[c]);return l$1.vnode&&l$1.vnode(l),l}
+
+  function count$1(node) {
+    var sum = 0,
+        children = node.children,
+        i = children && children.length;
+    if (!i) sum = 1;
+    else while (--i >= 0) sum += children[i].value;
+    node.value = sum;
+  }
+
+  function node_count() {
+    return this.eachAfter(count$1);
+  }
+
+  function node_each(callback, that) {
+    let index = -1;
+    for (const node of this) {
+      callback.call(that, node, ++index, this);
+    }
+    return this;
+  }
+
+  function node_eachBefore(callback, that) {
+    var node = this, nodes = [node], children, i, index = -1;
+    while (node = nodes.pop()) {
+      callback.call(that, node, ++index, this);
+      if (children = node.children) {
+        for (i = children.length - 1; i >= 0; --i) {
+          nodes.push(children[i]);
+        }
+      }
+    }
+    return this;
+  }
+
+  function node_eachAfter(callback, that) {
+    var node = this, nodes = [node], next = [], children, i, n, index = -1;
+    while (node = nodes.pop()) {
+      next.push(node);
+      if (children = node.children) {
+        for (i = 0, n = children.length; i < n; ++i) {
+          nodes.push(children[i]);
+        }
+      }
+    }
+    while (node = next.pop()) {
+      callback.call(that, node, ++index, this);
+    }
+    return this;
+  }
+
+  function node_find(callback, that) {
+    let index = -1;
+    for (const node of this) {
+      if (callback.call(that, node, ++index, this)) {
+        return node;
+      }
+    }
+  }
+
+  function node_sum(value) {
+    return this.eachAfter(function(node) {
+      var sum = +value(node.data) || 0,
+          children = node.children,
+          i = children && children.length;
+      while (--i >= 0) sum += children[i].value;
+      node.value = sum;
+    });
+  }
+
+  function node_sort(compare) {
+    return this.eachBefore(function(node) {
+      if (node.children) {
+        node.children.sort(compare);
+      }
+    });
+  }
+
+  function node_path(end) {
+    var start = this,
+        ancestor = leastCommonAncestor(start, end),
+        nodes = [start];
+    while (start !== ancestor) {
+      start = start.parent;
+      nodes.push(start);
+    }
+    var k = nodes.length;
+    while (end !== ancestor) {
+      nodes.splice(k, 0, end);
+      end = end.parent;
+    }
+    return nodes;
+  }
+
+  function leastCommonAncestor(a, b) {
+    if (a === b) return a;
+    var aNodes = a.ancestors(),
+        bNodes = b.ancestors(),
+        c = null;
+    a = aNodes.pop();
+    b = bNodes.pop();
+    while (a === b) {
+      c = a;
+      a = aNodes.pop();
+      b = bNodes.pop();
+    }
+    return c;
+  }
+
+  function node_ancestors() {
+    var node = this, nodes = [node];
+    while (node = node.parent) {
+      nodes.push(node);
+    }
+    return nodes;
+  }
+
+  function node_descendants() {
+    return Array.from(this);
+  }
+
+  function node_leaves() {
+    var leaves = [];
+    this.eachBefore(function(node) {
+      if (!node.children) {
+        leaves.push(node);
+      }
+    });
+    return leaves;
+  }
+
+  function node_links() {
+    var root = this, links = [];
+    root.each(function(node) {
+      if (node !== root) { // Don’t include the root’s parent, if any.
+        links.push({source: node.parent, target: node});
+      }
+    });
+    return links;
+  }
+
+  function* node_iterator() {
+    var node = this, current, next = [node], children, i, n;
+    do {
+      current = next.reverse(), next = [];
+      while (node = current.pop()) {
+        yield node;
+        if (children = node.children) {
+          for (i = 0, n = children.length; i < n; ++i) {
+            next.push(children[i]);
+          }
+        }
+      }
+    } while (next.length);
+  }
+
+  function hierarchy(data, children) {
+    if (data instanceof Map) {
+      data = [undefined, data];
+      if (children === undefined) children = mapChildren;
+    } else if (children === undefined) {
+      children = objectChildren;
+    }
+
+    var root = new Node$1(data),
+        node,
+        nodes = [root],
+        child,
+        childs,
+        i,
+        n;
+
+    while (node = nodes.pop()) {
+      if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {
+        node.children = childs;
+        for (i = n - 1; i >= 0; --i) {
+          nodes.push(child = childs[i] = new Node$1(childs[i]));
+          child.parent = node;
+          child.depth = node.depth + 1;
+        }
+      }
+    }
+
+    return root.eachBefore(computeHeight);
+  }
+
+  function node_copy() {
+    return hierarchy(this).eachBefore(copyData);
+  }
+
+  function objectChildren(d) {
+    return d.children;
+  }
+
+  function mapChildren(d) {
+    return Array.isArray(d) ? d[1] : null;
+  }
+
+  function copyData(node) {
+    if (node.data.value !== undefined) node.value = node.data.value;
+    node.data = node.data.data;
+  }
+
+  function computeHeight(node) {
+    var height = 0;
+    do node.height = height;
+    while ((node = node.parent) && (node.height < ++height));
+  }
+
+  function Node$1(data) {
+    this.data = data;
+    this.depth =
+    this.height = 0;
+    this.parent = null;
+  }
+
+  Node$1.prototype = hierarchy.prototype = {
+    constructor: Node$1,
+    count: node_count,
+    each: node_each,
+    eachAfter: node_eachAfter,
+    eachBefore: node_eachBefore,
+    find: node_find,
+    sum: node_sum,
+    sort: node_sort,
+    path: node_path,
+    ancestors: node_ancestors,
+    descendants: node_descendants,
+    leaves: node_leaves,
+    links: node_links,
+    copy: node_copy,
+    [Symbol.iterator]: node_iterator
+  };
+
+  function required(f) {
+    if (typeof f !== "function") throw new Error;
+    return f;
+  }
+
+  function constantZero() {
+    return 0;
+  }
+
+  function constant$1(x) {
+    return function() {
+      return x;
+    };
+  }
+
+  function roundNode(node) {
+    node.x0 = Math.round(node.x0);
+    node.y0 = Math.round(node.y0);
+    node.x1 = Math.round(node.x1);
+    node.y1 = Math.round(node.y1);
+  }
+
+  function treemapDice(parent, x0, y0, x1, y1) {
+    var nodes = parent.children,
+        node,
+        i = -1,
+        n = nodes.length,
+        k = parent.value && (x1 - x0) / parent.value;
+
+    while (++i < n) {
+      node = nodes[i], node.y0 = y0, node.y1 = y1;
+      node.x0 = x0, node.x1 = x0 += node.value * k;
+    }
+  }
+
+  function treemapSlice(parent, x0, y0, x1, y1) {
+    var nodes = parent.children,
+        node,
+        i = -1,
+        n = nodes.length,
+        k = parent.value && (y1 - y0) / parent.value;
+
+    while (++i < n) {
+      node = nodes[i], node.x0 = x0, node.x1 = x1;
+      node.y0 = y0, node.y1 = y0 += node.value * k;
+    }
+  }
+
+  var phi = (1 + Math.sqrt(5)) / 2;
+
+  function squarifyRatio(ratio, parent, x0, y0, x1, y1) {
+    var rows = [],
+        nodes = parent.children,
+        row,
+        nodeValue,
+        i0 = 0,
+        i1 = 0,
+        n = nodes.length,
+        dx, dy,
+        value = parent.value,
+        sumValue,
+        minValue,
+        maxValue,
+        newRatio,
+        minRatio,
+        alpha,
+        beta;
+
+    while (i0 < n) {
+      dx = x1 - x0, dy = y1 - y0;
+
+      // Find the next non-empty node.
+      do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);
+      minValue = maxValue = sumValue;
+      alpha = Math.max(dy / dx, dx / dy) / (value * ratio);
+      beta = sumValue * sumValue * alpha;
+      minRatio = Math.max(maxValue / beta, beta / minValue);
+
+      // Keep adding nodes while the aspect ratio maintains or improves.
+      for (; i1 < n; ++i1) {
+        sumValue += nodeValue = nodes[i1].value;
+        if (nodeValue < minValue) minValue = nodeValue;
+        if (nodeValue > maxValue) maxValue = nodeValue;
+        beta = sumValue * sumValue * alpha;
+        newRatio = Math.max(maxValue / beta, beta / minValue);
+        if (newRatio > minRatio) { sumValue -= nodeValue; break; }
+        minRatio = newRatio;
+      }
+
+      // Position and record the row orientation.
+      rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});
+      if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);
+      else treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);
+      value -= sumValue, i0 = i1;
+    }
+
+    return rows;
+  }
+
+  var squarify = (function custom(ratio) {
+
+    function squarify(parent, x0, y0, x1, y1) {
+      squarifyRatio(ratio, parent, x0, y0, x1, y1);
+    }
+
+    squarify.ratio = function(x) {
+      return custom((x = +x) > 1 ? x : 1);
+    };
+
+    return squarify;
+  })(phi);
+
+  function treemap() {
+    var tile = squarify,
+        round = false,
+        dx = 1,
+        dy = 1,
+        paddingStack = [0],
+        paddingInner = constantZero,
+        paddingTop = constantZero,
+        paddingRight = constantZero,
+        paddingBottom = constantZero,
+        paddingLeft = constantZero;
+
+    function treemap(root) {
+      root.x0 =
+      root.y0 = 0;
+      root.x1 = dx;
+      root.y1 = dy;
+      root.eachBefore(positionNode);
+      paddingStack = [0];
+      if (round) root.eachBefore(roundNode);
+      return root;
+    }
+
+    function positionNode(node) {
+      var p = paddingStack[node.depth],
+          x0 = node.x0 + p,
+          y0 = node.y0 + p,
+          x1 = node.x1 - p,
+          y1 = node.y1 - p;
+      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
+      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
+      node.x0 = x0;
+      node.y0 = y0;
+      node.x1 = x1;
+      node.y1 = y1;
+      if (node.children) {
+        p = paddingStack[node.depth + 1] = paddingInner(node) / 2;
+        x0 += paddingLeft(node) - p;
+        y0 += paddingTop(node) - p;
+        x1 -= paddingRight(node) - p;
+        y1 -= paddingBottom(node) - p;
+        if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
+        if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
+        tile(node, x0, y0, x1, y1);
+      }
+    }
+
+    treemap.round = function(x) {
+      return arguments.length ? (round = !!x, treemap) : round;
+    };
+
+    treemap.size = function(x) {
+      return arguments.length ? (dx = +x[0], dy = +x[1], treemap) : [dx, dy];
+    };
+
+    treemap.tile = function(x) {
+      return arguments.length ? (tile = required(x), treemap) : tile;
+    };
+
+    treemap.padding = function(x) {
+      return arguments.length ? treemap.paddingInner(x).paddingOuter(x) : treemap.paddingInner();
+    };
+
+    treemap.paddingInner = function(x) {
+      return arguments.length ? (paddingInner = typeof x === "function" ? x : constant$1(+x), treemap) : paddingInner;
+    };
+
+    treemap.paddingOuter = function(x) {
+      return arguments.length ? treemap.paddingTop(x).paddingRight(x).paddingBottom(x).paddingLeft(x) : treemap.paddingTop();
+    };
+
+    treemap.paddingTop = function(x) {
+      return arguments.length ? (paddingTop = typeof x === "function" ? x : constant$1(+x), treemap) : paddingTop;
+    };
+
+    treemap.paddingRight = function(x) {
+      return arguments.length ? (paddingRight = typeof x === "function" ? x : constant$1(+x), treemap) : paddingRight;
+    };
+
+    treemap.paddingBottom = function(x) {
+      return arguments.length ? (paddingBottom = typeof x === "function" ? x : constant$1(+x), treemap) : paddingBottom;
+    };
+
+    treemap.paddingLeft = function(x) {
+      return arguments.length ? (paddingLeft = typeof x === "function" ? x : constant$1(+x), treemap) : paddingLeft;
+    };
+
+    return treemap;
+  }
+
+  var treemapResquarify = (function custom(ratio) {
+
+    function resquarify(parent, x0, y0, x1, y1) {
+      if ((rows = parent._squarify) && (rows.ratio === ratio)) {
+        var rows,
+            row,
+            nodes,
+            i,
+            j = -1,
+            n,
+            m = rows.length,
+            value = parent.value;
+
+        while (++j < m) {
+          row = rows[j], nodes = row.children;
+          for (i = row.value = 0, n = nodes.length; i < n; ++i) row.value += nodes[i].value;
+          if (row.dice) treemapDice(row, x0, y0, x1, value ? y0 += (y1 - y0) * row.value / value : y1);
+          else treemapSlice(row, x0, y0, value ? x0 += (x1 - x0) * row.value / value : x1, y1);
+          value -= row.value;
+        }
+      } else {
+        parent._squarify = rows = squarifyRatio(ratio, parent, x0, y0, x1, y1);
+        rows.ratio = ratio;
+      }
+    }
+
+    resquarify.ratio = function(x) {
+      return custom((x = +x) > 1 ? x : 1);
+    };
+
+    return resquarify;
+  })(phi);
+
+  const isModuleTree = (mod) => "children" in mod;
+
+  let count = 0;
+  class Id {
+      constructor(id) {
+          this._id = id;
+          const url = new URL(window.location.href);
+          url.hash = id;
+          this._href = url.toString();
+      }
+      get id() {
+          return this._id;
+      }
+      get href() {
+          return this._href;
+      }
+      toString() {
+          return `url(${this.href})`;
+      }
+  }
+  function generateUniqueId(name) {
+      count += 1;
+      const id = ["O", name, count].filter(Boolean).join("-");
+      return new Id(id);
+  }
+
+  const LABELS = {
+      renderedLength: "Rendered",
+      gzipLength: "Gzip",
+      brotliLength: "Brotli",
+  };
+  const getAvailableSizeOptions = (options) => {
+      const availableSizeProperties = ["renderedLength"];
+      if (options.gzip) {
+          availableSizeProperties.push("gzipLength");
+      }
+      if (options.brotli) {
+          availableSizeProperties.push("brotliLength");
+      }
+      return availableSizeProperties;
+  };
+
+  var t,r,u,i,o=0,f=[],c=[],e=l$1.__b,a=l$1.__r,v=l$1.diffed,l=l$1.__c,m=l$1.unmount;function d(t,u){l$1.__h&&l$1.__h(r,t,o||u),o=0;var i=r.__H||(r.__H={__:[],__h:[]});return t>=i.__.length&&i.__.push({__V:c}),i.__[t]}function h(n){return o=1,s(B,n)}function s(n,u,i){var o=d(t++,2);if(o.t=n,!o.__c&&(o.__=[i?i(u):B(void 0,u),function(n){var t=o.__N?o.__N[0]:o.__[0],r=o.t(t,n);t!==r&&(o.__N=[r,o.__[1]],o.__c.setState({}));}],o.__c=r,!r.u)){var f=function(n,t,r){if(!o.__c.__H)return !0;var u=o.__c.__H.__.filter(function(n){return n.__c});if(u.every(function(n){return !n.__N}))return !c||c.call(this,n,t,r);var i=!1;return u.forEach(function(n){if(n.__N){var t=n.__[0];n.__=n.__N,n.__N=void 0,t!==n.__[0]&&(i=!0);}}),!(!i&&o.__c.props===n)&&(!c||c.call(this,n,t,r))};r.u=!0;var c=r.shouldComponentUpdate,e=r.componentWillUpdate;r.componentWillUpdate=function(n,t,r){if(this.__e){var u=c;c=void 0,f(n,t,r),c=u;}e&&e.call(this,n,t,r);},r.shouldComponentUpdate=f;}return o.__N||o.__}function p(u,i){var o=d(t++,3);!l$1.__s&&z(o.__H,i)&&(o.__=u,o.i=i,r.__H.__h.push(o));}function y(u,i){var o=d(t++,4);!l$1.__s&&z(o.__H,i)&&(o.__=u,o.i=i,r.__h.push(o));}function _(n){return o=5,F(function(){return {current:n}},[])}function F(n,r){var u=d(t++,7);return z(u.__H,r)?(u.__V=n(),u.i=r,u.__h=n,u.__V):u.__}function T(n,t){return o=8,F(function(){return n},t)}function q(n){var u=r.context[n.__c],i=d(t++,9);return i.c=n,u?(null==i.__&&(i.__=!0,u.sub(r)),u.props.value):n.__}function b(){for(var t;t=f.shift();)if(t.__P&&t.__H)try{t.__H.__h.forEach(k),t.__H.__h.forEach(w),t.__H.__h=[];}catch(r){t.__H.__h=[],l$1.__e(r,t.__v);}}l$1.__b=function(n){r=null,e&&e(n);},l$1.__r=function(n){a&&a(n),t=0;var i=(r=n.__c).__H;i&&(u===r?(i.__h=[],r.__h=[],i.__.forEach(function(n){n.__N&&(n.__=n.__N),n.__V=c,n.__N=n.i=void 0;})):(i.__h.forEach(k),i.__h.forEach(w),i.__h=[],t=0)),u=r;},l$1.diffed=function(t){v&&v(t);var o=t.__c;o&&o.__H&&(o.__H.__h.length&&(1!==f.push(o)&&i===l$1.requestAnimationFrame||((i=l$1.requestAnimationFrame)||j)(b)),o.__H.__.forEach(function(n){n.i&&(n.__H=n.i),n.__V!==c&&(n.__=n.__V),n.i=void 0,n.__V=c;})),u=r=null;},l$1.__c=function(t,r){r.some(function(t){try{t.__h.forEach(k),t.__h=t.__h.filter(function(n){return !n.__||w(n)});}catch(u){r.some(function(n){n.__h&&(n.__h=[]);}),r=[],l$1.__e(u,t.__v);}}),l&&l(t,r);},l$1.unmount=function(t){m&&m(t);var r,u=t.__c;u&&u.__H&&(u.__H.__.forEach(function(n){try{k(n);}catch(n){r=n;}}),u.__H=void 0,r&&l$1.__e(r,u.__v));};var g="function"==typeof requestAnimationFrame;function j(n){var t,r=function(){clearTimeout(u),g&&cancelAnimationFrame(t),setTimeout(n);},u=setTimeout(r,100);g&&(t=requestAnimationFrame(r));}function k(n){var t=r,u=n.__c;"function"==typeof u&&(n.__c=void 0,u()),r=t;}function w(n){var t=r;n.__c=n.__(),r=t;}function z(n,t){return !n||n.length!==t.length||t.some(function(t,r){return t!==n[r]})}function B(n,t){return "function"==typeof t?t(n):t}
+
+  const PLACEHOLDER = "*/**/file.js";
+  const SideBar = ({ availableSizeProperties, sizeProperty, setSizeProperty, onExcludeChange, onIncludeChange, }) => {
+      const [includeValue, setIncludeValue] = h("");
+      const [excludeValue, setExcludeValue] = h("");
+      const handleSizePropertyChange = (sizeProp) => () => {
+          if (sizeProp !== sizeProperty) {
+              setSizeProperty(sizeProp);
+          }
+      };
+      const handleIncludeChange = (event) => {
+          const value = event.currentTarget.value;
+          setIncludeValue(value);
+          onIncludeChange(value);
+      };
+      const handleExcludeChange = (event) => {
+          const value = event.currentTarget.value;
+          setExcludeValue(value);
+          onExcludeChange(value);
+      };
+      return (u$1("aside", { className: "sidebar", children: [u$1("div", { className: "size-selectors", children: availableSizeProperties.length > 1 &&
+                      availableSizeProperties.map((sizeProp) => {
+                          const id = `selector-${sizeProp}`;
+                          return (u$1("div", { className: "size-selector", children: [u$1("input", { type: "radio", id: id, checked: sizeProp === sizeProperty, onChange: handleSizePropertyChange(sizeProp) }), u$1("label", { htmlFor: id, children: LABELS[sizeProp] })] }, sizeProp));
+                      }) }), u$1("div", { className: "module-filters", children: [u$1("div", { className: "module-filter", children: [u$1("label", { htmlFor: "module-filter-exclude", children: "Exclude" }), u$1("input", { type: "text", id: "module-filter-exclude", value: excludeValue, onInput: handleExcludeChange, placeholder: PLACEHOLDER })] }), u$1("div", { className: "module-filter", children: [u$1("label", { htmlFor: "module-filter-include", children: "Include" }), u$1("input", { type: "text", id: "module-filter-include", value: includeValue, onInput: handleIncludeChange, placeholder: PLACEHOLDER })] })] })] }));
+  };
+
+  function getDefaultExportFromCjs (x) {
+  	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+  }
+
+  var utils$3 = {};
+
+  const WIN_SLASH = '\\\\/';
+  const WIN_NO_SLASH = `[^${WIN_SLASH}]`;
+
+  /**
+   * Posix glob regex
+   */
+
+  const DOT_LITERAL = '\\.';
+  const PLUS_LITERAL = '\\+';
+  const QMARK_LITERAL = '\\?';
+  const SLASH_LITERAL = '\\/';
+  const ONE_CHAR = '(?=.)';
+  const QMARK = '[^/]';
+  const END_ANCHOR = `(?:${SLASH_LITERAL}|$)`;
+  const START_ANCHOR = `(?:^|${SLASH_LITERAL})`;
+  const DOTS_SLASH = `${DOT_LITERAL}{1,2}${END_ANCHOR}`;
+  const NO_DOT = `(?!${DOT_LITERAL})`;
+  const NO_DOTS = `(?!${START_ANCHOR}${DOTS_SLASH})`;
+  const NO_DOT_SLASH = `(?!${DOT_LITERAL}{0,1}${END_ANCHOR})`;
+  const NO_DOTS_SLASH = `(?!${DOTS_SLASH})`;
+  const QMARK_NO_DOT = `[^.${SLASH_LITERAL}]`;
+  const STAR = `${QMARK}*?`;
+  const SEP = '/';
+
+  const POSIX_CHARS = {
+    DOT_LITERAL,
+    PLUS_LITERAL,
+    QMARK_LITERAL,
+    SLASH_LITERAL,
+    ONE_CHAR,
+    QMARK,
+    END_ANCHOR,
+    DOTS_SLASH,
+    NO_DOT,
+    NO_DOTS,
+    NO_DOT_SLASH,
+    NO_DOTS_SLASH,
+    QMARK_NO_DOT,
+    STAR,
+    START_ANCHOR,
+    SEP
+  };
+
+  /**
+   * Windows glob regex
+   */
+
+  const WINDOWS_CHARS = {
+    ...POSIX_CHARS,
+
+    SLASH_LITERAL: `[${WIN_SLASH}]`,
+    QMARK: WIN_NO_SLASH,
+    STAR: `${WIN_NO_SLASH}*?`,
+    DOTS_SLASH: `${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$)`,
+    NO_DOT: `(?!${DOT_LITERAL})`,
+    NO_DOTS: `(?!(?:^|[${WIN_SLASH}])${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$))`,
+    NO_DOT_SLASH: `(?!${DOT_LITERAL}{0,1}(?:[${WIN_SLASH}]|$))`,
+    NO_DOTS_SLASH: `(?!${DOT_LITERAL}{1,2}(?:[${WIN_SLASH}]|$))`,
+    QMARK_NO_DOT: `[^.${WIN_SLASH}]`,
+    START_ANCHOR: `(?:^|[${WIN_SLASH}])`,
+    END_ANCHOR: `(?:[${WIN_SLASH}]|$)`,
+    SEP: '\\'
+  };
+
+  /**
+   * POSIX Bracket Regex
+   */
+
+  const POSIX_REGEX_SOURCE$1 = {
+    alnum: 'a-zA-Z0-9',
+    alpha: 'a-zA-Z',
+    ascii: '\\x00-\\x7F',
+    blank: ' \\t',
+    cntrl: '\\x00-\\x1F\\x7F',
+    digit: '0-9',
+    graph: '\\x21-\\x7E',
+    lower: 'a-z',
+    print: '\\x20-\\x7E ',
+    punct: '\\-!"#$%&\'()\\*+,./:;<=>?@[\\]^_`{|}~',
+    space: ' \\t\\r\\n\\v\\f',
+    upper: 'A-Z',
+    word: 'A-Za-z0-9_',
+    xdigit: 'A-Fa-f0-9'
+  };
+
+  var constants$3 = {
+    MAX_LENGTH: 1024 * 64,
+    POSIX_REGEX_SOURCE: POSIX_REGEX_SOURCE$1,
+
+    // regular expressions
+    REGEX_BACKSLASH: /\\(?![*+?^${}(|)[\]])/g,
+    REGEX_NON_SPECIAL_CHARS: /^[^@![\].,$*+?^{}()|\\/]+/,
+    REGEX_SPECIAL_CHARS: /[-*+?.^${}(|)[\]]/,
+    REGEX_SPECIAL_CHARS_BACKREF: /(\\?)((\W)(\3*))/g,
+    REGEX_SPECIAL_CHARS_GLOBAL: /([-*+?.^${}(|)[\]])/g,
+    REGEX_REMOVE_BACKSLASH: /(?:\[.*?[^\\]\]|\\(?=.))/g,
+
+    // Replace globs with equivalent patterns to reduce parsing time.
+    REPLACEMENTS: {
+      '***': '*',
+      '**/**': '**',
+      '**/**/**': '**'
+    },
+
+    // Digits
+    CHAR_0: 48, /* 0 */
+    CHAR_9: 57, /* 9 */
+
+    // Alphabet chars.
+    CHAR_UPPERCASE_A: 65, /* A */
+    CHAR_LOWERCASE_A: 97, /* a */
+    CHAR_UPPERCASE_Z: 90, /* Z */
+    CHAR_LOWERCASE_Z: 122, /* z */
+
+    CHAR_LEFT_PARENTHESES: 40, /* ( */
+    CHAR_RIGHT_PARENTHESES: 41, /* ) */
+
+    CHAR_ASTERISK: 42, /* * */
+
+    // Non-alphabetic chars.
+    CHAR_AMPERSAND: 38, /* & */
+    CHAR_AT: 64, /* @ */
+    CHAR_BACKWARD_SLASH: 92, /* \ */
+    CHAR_CARRIAGE_RETURN: 13, /* \r */
+    CHAR_CIRCUMFLEX_ACCENT: 94, /* ^ */
+    CHAR_COLON: 58, /* : */
+    CHAR_COMMA: 44, /* , */
+    CHAR_DOT: 46, /* . */
+    CHAR_DOUBLE_QUOTE: 34, /* " */
+    CHAR_EQUAL: 61, /* = */
+    CHAR_EXCLAMATION_MARK: 33, /* ! */
+    CHAR_FORM_FEED: 12, /* \f */
+    CHAR_FORWARD_SLASH: 47, /* / */
+    CHAR_GRAVE_ACCENT: 96, /* ` */
+    CHAR_HASH: 35, /* # */
+    CHAR_HYPHEN_MINUS: 45, /* - */
+    CHAR_LEFT_ANGLE_BRACKET: 60, /* < */
+    CHAR_LEFT_CURLY_BRACE: 123, /* { */
+    CHAR_LEFT_SQUARE_BRACKET: 91, /* [ */
+    CHAR_LINE_FEED: 10, /* \n */
+    CHAR_NO_BREAK_SPACE: 160, /* \u00A0 */
+    CHAR_PERCENT: 37, /* % */
+    CHAR_PLUS: 43, /* + */
+    CHAR_QUESTION_MARK: 63, /* ? */
+    CHAR_RIGHT_ANGLE_BRACKET: 62, /* > */
+    CHAR_RIGHT_CURLY_BRACE: 125, /* } */
+    CHAR_RIGHT_SQUARE_BRACKET: 93, /* ] */
+    CHAR_SEMICOLON: 59, /* ; */
+    CHAR_SINGLE_QUOTE: 39, /* ' */
+    CHAR_SPACE: 32, /*   */
+    CHAR_TAB: 9, /* \t */
+    CHAR_UNDERSCORE: 95, /* _ */
+    CHAR_VERTICAL_LINE: 124, /* | */
+    CHAR_ZERO_WIDTH_NOBREAK_SPACE: 65279, /* \uFEFF */
+
+    /**
+     * Create EXTGLOB_CHARS
+     */
+
+    extglobChars(chars) {
+      return {
+        '!': { type: 'negate', open: '(?:(?!(?:', close: `))${chars.STAR})` },
+        '?': { type: 'qmark', open: '(?:', close: ')?' },
+        '+': { type: 'plus', open: '(?:', close: ')+' },
+        '*': { type: 'star', open: '(?:', close: ')*' },
+        '@': { type: 'at', open: '(?:', close: ')' }
+      };
+    },
+
+    /**
+     * Create GLOB_CHARS
+     */
+
+    globChars(win32) {
+      return win32 === true ? WINDOWS_CHARS : POSIX_CHARS;
+    }
+  };
+
+  (function (exports) {
+
+  	const {
+  	  REGEX_BACKSLASH,
+  	  REGEX_REMOVE_BACKSLASH,
+  	  REGEX_SPECIAL_CHARS,
+  	  REGEX_SPECIAL_CHARS_GLOBAL
+  	} = constants$3;
+
+  	exports.isObject = val => val !== null && typeof val === 'object' && !Array.isArray(val);
+  	exports.hasRegexChars = str => REGEX_SPECIAL_CHARS.test(str);
+  	exports.isRegexChar = str => str.length === 1 && exports.hasRegexChars(str);
+  	exports.escapeRegex = str => str.replace(REGEX_SPECIAL_CHARS_GLOBAL, '\\$1');
+  	exports.toPosixSlashes = str => str.replace(REGEX_BACKSLASH, '/');
+
+  	exports.removeBackslashes = str => {
+  	  return str.replace(REGEX_REMOVE_BACKSLASH, match => {
+  	    return match === '\\' ? '' : match;
+  	  });
+  	};
+
+  	exports.supportsLookbehinds = () => {
+  	  const segs = process.version.slice(1).split('.').map(Number);
+  	  if (segs.length === 3 && segs[0] >= 9 || (segs[0] === 8 && segs[1] >= 10)) {
+  	    return true;
+  	  }
+  	  return false;
+  	};
+
+  	exports.escapeLast = (input, char, lastIdx) => {
+  	  const idx = input.lastIndexOf(char, lastIdx);
+  	  if (idx === -1) return input;
+  	  if (input[idx - 1] === '\\') return exports.escapeLast(input, char, idx - 1);
+  	  return `${input.slice(0, idx)}\\${input.slice(idx)}`;
+  	};
+
+  	exports.removePrefix = (input, state = {}) => {
+  	  let output = input;
+  	  if (output.startsWith('./')) {
+  	    output = output.slice(2);
+  	    state.prefix = './';
+  	  }
+  	  return output;
+  	};
+
+  	exports.wrapOutput = (input, state = {}, options = {}) => {
+  	  const prepend = options.contains ? '' : '^';
+  	  const append = options.contains ? '' : '$';
+
+  	  let output = `${prepend}(?:${input})${append}`;
+  	  if (state.negated === true) {
+  	    output = `(?:^(?!${output}).*$)`;
+  	  }
+  	  return output;
+  	};
+
+  	exports.basename = (path, { windows } = {}) => {
+  	  if (windows) {
+  	    return path.replace(/[\\/]$/, '').replace(/.*[\\/]/, '');
+  	  } else {
+  	    return path.replace(/\/$/, '').replace(/.*\//, '');
+  	  }
+  	}; 
+  } (utils$3));
+
+  const utils$2 = utils$3;
+  const {
+    CHAR_ASTERISK,             /* * */
+    CHAR_AT,                   /* @ */
+    CHAR_BACKWARD_SLASH,       /* \ */
+    CHAR_COMMA,                /* , */
+    CHAR_DOT,                  /* . */
+    CHAR_EXCLAMATION_MARK,     /* ! */
+    CHAR_FORWARD_SLASH,        /* / */
+    CHAR_LEFT_CURLY_BRACE,     /* { */
+    CHAR_LEFT_PARENTHESES,     /* ( */
+    CHAR_LEFT_SQUARE_BRACKET,  /* [ */
+    CHAR_PLUS,                 /* + */
+    CHAR_QUESTION_MARK,        /* ? */
+    CHAR_RIGHT_CURLY_BRACE,    /* } */
+    CHAR_RIGHT_PARENTHESES,    /* ) */
+    CHAR_RIGHT_SQUARE_BRACKET  /* ] */
+  } = constants$3;
+
+  const isPathSeparator = code => {
+    return code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;
+  };
+
+  const depth = token => {
+    if (token.isPrefix !== true) {
+      token.depth = token.isGlobstar ? Infinity : 1;
+    }
+  };
+
+  /**
+   * Quickly scans a glob pattern and returns an object with a handful of
+   * useful properties, like `isGlob`, `path` (the leading non-glob, if it exists),
+   * `glob` (the actual pattern), and `negated` (true if the path starts with `!`).
+   *
+   * ```js
+   * const pm = require('picomatch');
+   * console.log(pm.scan('foo/bar/*.js'));
+   * { isGlob: true, input: 'foo/bar/*.js', base: 'foo/bar', glob: '*.js' }
+   * ```
+   * @param {String} `str`
+   * @param {Object} `options`
+   * @return {Object} Returns an object with tokens and regex source string.
+   * @api public
+   */
+
+  const scan$1 = (input, options) => {
+    const opts = options || {};
+
+    const length = input.length - 1;
+    const scanToEnd = opts.parts === true || opts.scanToEnd === true;
+    const slashes = [];
+    const tokens = [];
+    const parts = [];
+
+    let str = input;
+    let index = -1;
+    let start = 0;
+    let lastIndex = 0;
+    let isBrace = false;
+    let isBracket = false;
+    let isGlob = false;
+    let isExtglob = false;
+    let isGlobstar = false;
+    let braceEscaped = false;
+    let backslashes = false;
+    let negated = false;
+    let finished = false;
+    let braces = 0;
+    let prev;
+    let code;
+    let token = { value: '', depth: 0, isGlob: false };
+
+    const eos = () => index >= length;
+    const peek = () => str.charCodeAt(index + 1);
+    const advance = () => {
+      prev = code;
+      return str.charCodeAt(++index);
+    };
+
+    while (index < length) {
+      code = advance();
+      let next;
+
+      if (code === CHAR_BACKWARD_SLASH) {
+        backslashes = token.backslashes = true;
+        code = advance();
+
+        if (code === CHAR_LEFT_CURLY_BRACE) {
+          braceEscaped = true;
+        }
+        continue;
+      }
+
+      if (braceEscaped === true || code === CHAR_LEFT_CURLY_BRACE) {
+        braces++;
+
+        while (eos() !== true && (code = advance())) {
+          if (code === CHAR_BACKWARD_SLASH) {
+            backslashes = token.backslashes = true;
+            advance();
+            continue;
+          }
+
+          if (code === CHAR_LEFT_CURLY_BRACE) {
+            braces++;
+            continue;
+          }
+
+          if (braceEscaped !== true && code === CHAR_DOT && (code = advance()) === CHAR_DOT) {
+            isBrace = token.isBrace = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+
+            break;
+          }
+
+          if (braceEscaped !== true && code === CHAR_COMMA) {
+            isBrace = token.isBrace = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+
+            break;
+          }
+
+          if (code === CHAR_RIGHT_CURLY_BRACE) {
+            braces--;
+
+            if (braces === 0) {
+              braceEscaped = false;
+              isBrace = token.isBrace = true;
+              finished = true;
+              break;
+            }
+          }
+        }
+
+        if (scanToEnd === true) {
+          continue;
+        }
+
+        break;
+      }
+
+      if (code === CHAR_FORWARD_SLASH) {
+        slashes.push(index);
+        tokens.push(token);
+        token = { value: '', depth: 0, isGlob: false };
+
+        if (finished === true) continue;
+        if (prev === CHAR_DOT && index === (start + 1)) {
+          start += 2;
+          continue;
+        }
+
+        lastIndex = index + 1;
+        continue;
+      }
+
+      if (opts.noext !== true) {
+        const isExtglobChar = code === CHAR_PLUS
+          || code === CHAR_AT
+          || code === CHAR_ASTERISK
+          || code === CHAR_QUESTION_MARK
+          || code === CHAR_EXCLAMATION_MARK;
+
+        if (isExtglobChar === true && peek() === CHAR_LEFT_PARENTHESES) {
+          isGlob = token.isGlob = true;
+          isExtglob = token.isExtglob = true;
+          finished = true;
+
+          if (scanToEnd === true) {
+            while (eos() !== true && (code = advance())) {
+              if (code === CHAR_BACKWARD_SLASH) {
+                backslashes = token.backslashes = true;
+                code = advance();
+                continue;
+              }
+
+              if (code === CHAR_RIGHT_PARENTHESES) {
+                isGlob = token.isGlob = true;
+                finished = true;
+                break;
+              }
+            }
+            continue;
+          }
+          break;
+        }
+      }
+
+      if (code === CHAR_ASTERISK) {
+        if (prev === CHAR_ASTERISK) isGlobstar = token.isGlobstar = true;
+        isGlob = token.isGlob = true;
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+        break;
+      }
+
+      if (code === CHAR_QUESTION_MARK) {
+        isGlob = token.isGlob = true;
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+        break;
+      }
+
+      if (code === CHAR_LEFT_SQUARE_BRACKET) {
+        while (eos() !== true && (next = advance())) {
+          if (next === CHAR_BACKWARD_SLASH) {
+            backslashes = token.backslashes = true;
+            advance();
+            continue;
+          }
+
+          if (next === CHAR_RIGHT_SQUARE_BRACKET) {
+            isBracket = token.isBracket = true;
+            isGlob = token.isGlob = true;
+            finished = true;
+
+            if (scanToEnd === true) {
+              continue;
+            }
+            break;
+          }
+        }
+      }
+
+      if (opts.nonegate !== true && code === CHAR_EXCLAMATION_MARK && index === start) {
+        negated = token.negated = true;
+        start++;
+        continue;
+      }
+
+      if (opts.noparen !== true && code === CHAR_LEFT_PARENTHESES) {
+        isGlob = token.isGlob = true;
+
+        if (scanToEnd === true) {
+          while (eos() !== true && (code = advance())) {
+            if (code === CHAR_LEFT_PARENTHESES) {
+              backslashes = token.backslashes = true;
+              code = advance();
+              continue;
+            }
+
+            if (code === CHAR_RIGHT_PARENTHESES) {
+              finished = true;
+              break;
+            }
+          }
+          continue;
+        }
+        break;
+      }
+
+      if (isGlob === true) {
+        finished = true;
+
+        if (scanToEnd === true) {
+          continue;
+        }
+
+        break;
+      }
+    }
+
+    if (opts.noext === true) {
+      isExtglob = false;
+      isGlob = false;
+    }
+
+    let base = str;
+    let prefix = '';
+    let glob = '';
+
+    if (start > 0) {
+      prefix = str.slice(0, start);
+      str = str.slice(start);
+      lastIndex -= start;
+    }
+
+    if (base && isGlob === true && lastIndex > 0) {
+      base = str.slice(0, lastIndex);
+      glob = str.slice(lastIndex);
+    } else if (isGlob === true) {
+      base = '';
+      glob = str;
+    } else {
+      base = str;
+    }
+
+    if (base && base !== '' && base !== '/' && base !== str) {
+      if (isPathSeparator(base.charCodeAt(base.length - 1))) {
+        base = base.slice(0, -1);
+      }
+    }
+
+    if (opts.unescape === true) {
+      if (glob) glob = utils$2.removeBackslashes(glob);
+
+      if (base && backslashes === true) {
+        base = utils$2.removeBackslashes(base);
+      }
+    }
+
+    const state = {
+      prefix,
+      input,
+      start,
+      base,
+      glob,
+      isBrace,
+      isBracket,
+      isGlob,
+      isExtglob,
+      isGlobstar,
+      negated
+    };
+
+    if (opts.tokens === true) {
+      state.maxDepth = 0;
+      if (!isPathSeparator(code)) {
+        tokens.push(token);
+      }
+      state.tokens = tokens;
+    }
+
+    if (opts.parts === true || opts.tokens === true) {
+      let prevIndex;
+
+      for (let idx = 0; idx < slashes.length; idx++) {
+        const n = prevIndex ? prevIndex + 1 : start;
+        const i = slashes[idx];
+        const value = input.slice(n, i);
+        if (opts.tokens) {
+          if (idx === 0 && start !== 0) {
+            tokens[idx].isPrefix = true;
+            tokens[idx].value = prefix;
+          } else {
+            tokens[idx].value = value;
+          }
+          depth(tokens[idx]);
+          state.maxDepth += tokens[idx].depth;
+        }
+        if (idx !== 0 || value !== '') {
+          parts.push(value);
+        }
+        prevIndex = i;
+      }
+
+      if (prevIndex && prevIndex + 1 < input.length) {
+        const value = input.slice(prevIndex + 1);
+        parts.push(value);
+
+        if (opts.tokens) {
+          tokens[tokens.length - 1].value = value;
+          depth(tokens[tokens.length - 1]);
+          state.maxDepth += tokens[tokens.length - 1].depth;
+        }
+      }
+
+      state.slashes = slashes;
+      state.parts = parts;
+    }
+
+    return state;
+  };
+
+  var scan_1 = scan$1;
+
+  const constants$2 = constants$3;
+  const utils$1 = utils$3;
+
+  /**
+   * Constants
+   */
+
+  const {
+    MAX_LENGTH,
+    POSIX_REGEX_SOURCE,
+    REGEX_NON_SPECIAL_CHARS,
+    REGEX_SPECIAL_CHARS_BACKREF,
+    REPLACEMENTS
+  } = constants$2;
+
+  /**
+   * Helpers
+   */
+
+  const expandRange = (args, options) => {
+    if (typeof options.expandRange === 'function') {
+      return options.expandRange(...args, options);
+    }
+
+    args.sort();
+    const value = `[${args.join('-')}]`;
+
+    try {
+      /* eslint-disable-next-line no-new */
+      new RegExp(value);
+    } catch (ex) {
+      return args.map(v => utils$1.escapeRegex(v)).join('..');
+    }
+
+    return value;
+  };
+
+  /**
+   * Create the message for a syntax error
+   */
+
+  const syntaxError = (type, char) => {
+    return `Missing ${type}: "${char}" - use "\\\\${char}" to match literal characters`;
+  };
+
+  /**
+   * Parse the given input string.
+   * @param {String} input
+   * @param {Object} options
+   * @return {Object}
+   */
+
+  const parse$2 = (input, options) => {
+    if (typeof input !== 'string') {
+      throw new TypeError('Expected a string');
+    }
+
+    input = REPLACEMENTS[input] || input;
+
+    const opts = { ...options };
+    const max = typeof opts.maxLength === 'number' ? Math.min(MAX_LENGTH, opts.maxLength) : MAX_LENGTH;
+
+    let len = input.length;
+    if (len > max) {
+      throw new SyntaxError(`Input length: ${len}, exceeds maximum allowed length: ${max}`);
+    }
+
+    const bos = { type: 'bos', value: '', output: opts.prepend || '' };
+    const tokens = [bos];
+
+    const capture = opts.capture ? '' : '?:';
+
+    // create constants based on platform, for windows or posix
+    const PLATFORM_CHARS = constants$2.globChars(opts.windows);
+    const EXTGLOB_CHARS = constants$2.extglobChars(PLATFORM_CHARS);
+
+    const {
+      DOT_LITERAL,
+      PLUS_LITERAL,
+      SLASH_LITERAL,
+      ONE_CHAR,
+      DOTS_SLASH,
+      NO_DOT,
+      NO_DOT_SLASH,
+      NO_DOTS_SLASH,
+      QMARK,
+      QMARK_NO_DOT,
+      STAR,
+      START_ANCHOR
+    } = PLATFORM_CHARS;
+
+    const globstar = (opts) => {
+      return `(${capture}(?:(?!${START_ANCHOR}${opts.dot ? DOTS_SLASH : DOT_LITERAL}).)*?)`;
+    };
+
+    const nodot = opts.dot ? '' : NO_DOT;
+    const qmarkNoDot = opts.dot ? QMARK : QMARK_NO_DOT;
+    let star = opts.bash === true ? globstar(opts) : STAR;
+
+    if (opts.capture) {
+      star = `(${star})`;
+    }
+
+    // minimatch options support
+    if (typeof opts.noext === 'boolean') {
+      opts.noextglob = opts.noext;
+    }
+
+    const state = {
+      input,
+      index: -1,
+      start: 0,
+      dot: opts.dot === true,
+      consumed: '',
+      output: '',
+      prefix: '',
+      backtrack: false,
+      negated: false,
+      brackets: 0,
+      braces: 0,
+      parens: 0,
+      quotes: 0,
+      globstar: false,
+      tokens
+    };
+
+    input = utils$1.removePrefix(input, state);
+    len = input.length;
+
+    const extglobs = [];
+    const braces = [];
+    const stack = [];
+    let prev = bos;
+    let value;
+
+    /**
+     * Tokenizing helpers
+     */
+
+    const eos = () => state.index === len - 1;
+    const peek = state.peek = (n = 1) => input[state.index + n];
+    const advance = state.advance = () => input[++state.index];
+    const remaining = () => input.slice(state.index + 1);
+    const consume = (value = '', num = 0) => {
+      state.consumed += value;
+      state.index += num;
+    };
+    const append = token => {
+      state.output += token.output != null ? token.output : token.value;
+      consume(token.value);
+    };
+
+    const negate = () => {
+      let count = 1;
+
+      while (peek() === '!' && (peek(2) !== '(' || peek(3) === '?')) {
+        advance();
+        state.start++;
+        count++;
+      }
+
+      if (count % 2 === 0) {
+        return false;
+      }
+
+      state.negated = true;
+      state.start++;
+      return true;
+    };
+
+    const increment = type => {
+      state[type]++;
+      stack.push(type);
+    };
+
+    const decrement = type => {
+      state[type]--;
+      stack.pop();
+    };
+
+    /**
+     * Push tokens onto the tokens array. This helper speeds up
+     * tokenizing by 1) helping us avoid backtracking as much as possible,
+     * and 2) helping us avoid creating extra tokens when consecutive
+     * characters are plain text. This improves performance and simplifies
+     * lookbehinds.
+     */
+
+    const push = tok => {
+      if (prev.type === 'globstar') {
+        const isBrace = state.braces > 0 && (tok.type === 'comma' || tok.type === 'brace');
+        const isExtglob = tok.extglob === true || (extglobs.length && (tok.type === 'pipe' || tok.type === 'paren'));
+
+        if (tok.type !== 'slash' && tok.type !== 'paren' && !isBrace && !isExtglob) {
+          state.output = state.output.slice(0, -prev.output.length);
+          prev.type = 'star';
+          prev.value = '*';
+          prev.output = star;
+          state.output += prev.output;
+        }
+      }
+
+      if (extglobs.length && tok.type !== 'paren' && !EXTGLOB_CHARS[tok.value]) {
+        extglobs[extglobs.length - 1].inner += tok.value;
+      }
+
+      if (tok.value || tok.output) append(tok);
+      if (prev && prev.type === 'text' && tok.type === 'text') {
+        prev.value += tok.value;
+        prev.output = (prev.output || '') + tok.value;
+        return;
+      }
+
+      tok.prev = prev;
+      tokens.push(tok);
+      prev = tok;
+    };
+
+    const extglobOpen = (type, value) => {
+      const token = { ...EXTGLOB_CHARS[value], conditions: 1, inner: '' };
+
+      token.prev = prev;
+      token.parens = state.parens;
+      token.output = state.output;
+      const output = (opts.capture ? '(' : '') + token.open;
+
+      increment('parens');
+      push({ type, value, output: state.output ? '' : ONE_CHAR });
+      push({ type: 'paren', extglob: true, value: advance(), output });
+      extglobs.push(token);
+    };
+
+    const extglobClose = token => {
+      let output = token.close + (opts.capture ? ')' : '');
+
+      if (token.type === 'negate') {
+        let extglobStar = star;
+
+        if (token.inner && token.inner.length > 1 && token.inner.includes('/')) {
+          extglobStar = globstar(opts);
+        }
+
+        if (extglobStar !== star || eos() || /^\)+$/.test(remaining())) {
+          output = token.close = `)$))${extglobStar}`;
+        }
+
+        if (token.prev.type === 'bos' && eos()) {
+          state.negatedExtglob = true;
+        }
+      }
+
+      push({ type: 'paren', extglob: true, value, output });
+      decrement('parens');
+    };
+
+    /**
+     * Fast paths
+     */
+
+    if (opts.fastpaths !== false && !/(^[*!]|[/()[\]{}"])/.test(input)) {
+      let backslashes = false;
+
+      let output = input.replace(REGEX_SPECIAL_CHARS_BACKREF, (m, esc, chars, first, rest, index) => {
+        if (first === '\\') {
+          backslashes = true;
+          return m;
+        }
+
+        if (first === '?') {
+          if (esc) {
+            return esc + first + (rest ? QMARK.repeat(rest.length) : '');
+          }
+          if (index === 0) {
+            return qmarkNoDot + (rest ? QMARK.repeat(rest.length) : '');
+          }
+          return QMARK.repeat(chars.length);
+        }
+
+        if (first === '.') {
+          return DOT_LITERAL.repeat(chars.length);
+        }
+
+        if (first === '*') {
+          if (esc) {
+            return esc + first + (rest ? star : '');
+          }
+          return star;
+        }
+        return esc ? m : `\\${m}`;
+      });
+
+      if (backslashes === true) {
+        if (opts.unescape === true) {
+          output = output.replace(/\\/g, '');
+        } else {
+          output = output.replace(/\\+/g, m => {
+            return m.length % 2 === 0 ? '\\\\' : (m ? '\\' : '');
+          });
+        }
+      }
+
+      if (output === input && opts.contains === true) {
+        state.output = input;
+        return state;
+      }
+
+      state.output = utils$1.wrapOutput(output, state, options);
+      return state;
+    }
+
+    /**
+     * Tokenize input until we reach end-of-string
+     */
+
+    while (!eos()) {
+      value = advance();
+
+      if (value === '\u0000') {
+        continue;
+      }
+
+      /**
+       * Escaped characters
+       */
+
+      if (value === '\\') {
+        const next = peek();
+
+        if (next === '/' && opts.bash !== true) {
+          continue;
+        }
+
+        if (next === '.' || next === ';') {
+          continue;
+        }
+
+        if (!next) {
+          value += '\\';
+          push({ type: 'text', value });
+          continue;
+        }
+
+        // collapse slashes to reduce potential for exploits
+        const match = /^\\+/.exec(remaining());
+        let slashes = 0;
+
+        if (match && match[0].length > 2) {
+          slashes = match[0].length;
+          state.index += slashes;
+          if (slashes % 2 !== 0) {
+            value += '\\';
+          }
+        }
+
+        if (opts.unescape === true) {
+          value = advance() || '';
+        } else {
+          value += advance() || '';
+        }
+
+        if (state.brackets === 0) {
+          push({ type: 'text', value });
+          continue;
+        }
+      }
+
+      /**
+       * If we're inside a regex character class, continue
+       * until we reach the closing bracket.
+       */
+
+      if (state.brackets > 0 && (value !== ']' || prev.value === '[' || prev.value === '[^')) {
+        if (opts.posix !== false && value === ':') {
+          const inner = prev.value.slice(1);
+          if (inner.includes('[')) {
+            prev.posix = true;
+
+            if (inner.includes(':')) {
+              const idx = prev.value.lastIndexOf('[');
+              const pre = prev.value.slice(0, idx);
+              const rest = prev.value.slice(idx + 2);
+              const posix = POSIX_REGEX_SOURCE[rest];
+              if (posix) {
+                prev.value = pre + posix;
+                state.backtrack = true;
+                advance();
+
+                if (!bos.output && tokens.indexOf(prev) === 1) {
+                  bos.output = ONE_CHAR;
+                }
+                continue;
+              }
+            }
+          }
+        }
+
+        if ((value === '[' && peek() !== ':') || (value === '-' && peek() === ']')) {
+          value = `\\${value}`;
+        }
+
+        if (value === ']' && (prev.value === '[' || prev.value === '[^')) {
+          value = `\\${value}`;
+        }
+
+        if (opts.posix === true && value === '!' && prev.value === '[') {
+          value = '^';
+        }
+
+        prev.value += value;
+        append({ value });
+        continue;
+      }
+
+      /**
+       * If we're inside a quoted string, continue
+       * until we reach the closing double quote.
+       */
+
+      if (state.quotes === 1 && value !== '"') {
+        value = utils$1.escapeRegex(value);
+        prev.value += value;
+        append({ value });
+        continue;
+      }
+
+      /**
+       * Double quotes
+       */
+
+      if (value === '"') {
+        state.quotes = state.quotes === 1 ? 0 : 1;
+        if (opts.keepQuotes === true) {
+          push({ type: 'text', value });
+        }
+        continue;
+      }
+
+      /**
+       * Parentheses
+       */
+
+      if (value === '(') {
+        increment('parens');
+        push({ type: 'paren', value });
+        continue;
+      }
+
+      if (value === ')') {
+        if (state.parens === 0 && opts.strictBrackets === true) {
+          throw new SyntaxError(syntaxError('opening', '('));
+        }
+
+        const extglob = extglobs[extglobs.length - 1];
+        if (extglob && state.parens === extglob.parens + 1) {
+          extglobClose(extglobs.pop());
+          continue;
+        }
+
+        push({ type: 'paren', value, output: state.parens ? ')' : '\\)' });
+        decrement('parens');
+        continue;
+      }
+
+      /**
+       * Square brackets
+       */
+
+      if (value === '[') {
+        if (opts.nobracket === true || !remaining().includes(']')) {
+          if (opts.nobracket !== true && opts.strictBrackets === true) {
+            throw new SyntaxError(syntaxError('closing', ']'));
+          }
+
+          value = `\\${value}`;
+        } else {
+          increment('brackets');
+        }
+
+        push({ type: 'bracket', value });
+        continue;
+      }
+
+      if (value === ']') {
+        if (opts.nobracket === true || (prev && prev.type === 'bracket' && prev.value.length === 1)) {
+          push({ type: 'text', value, output: `\\${value}` });
+          continue;
+        }
+
+        if (state.brackets === 0) {
+          if (opts.strictBrackets === true) {
+            throw new SyntaxError(syntaxError('opening', '['));
+          }
+
+          push({ type: 'text', value, output: `\\${value}` });
+          continue;
+        }
+
+        decrement('brackets');
+
+        const prevValue = prev.value.slice(1);
+        if (prev.posix !== true && prevValue[0] === '^' && !prevValue.includes('/')) {
+          value = `/${value}`;
+        }
+
+        prev.value += value;
+        append({ value });
+
+        // when literal brackets are explicitly disabled
+        // assume we should match with a regex character class
+        if (opts.literalBrackets === false || utils$1.hasRegexChars(prevValue)) {
+          continue;
+        }
+
+        const escaped = utils$1.escapeRegex(prev.value);
+        state.output = state.output.slice(0, -prev.value.length);
+
+        // when literal brackets are explicitly enabled
+        // assume we should escape the brackets to match literal characters
+        if (opts.literalBrackets === true) {
+          state.output += escaped;
+          prev.value = escaped;
+          continue;
+        }
+
+        // when the user specifies nothing, try to match both
+        prev.value = `(${capture}${escaped}|${prev.value})`;
+        state.output += prev.value;
+        continue;
+      }
+
+      /**
+       * Braces
+       */
+
+      if (value === '{' && opts.nobrace !== true) {
+        increment('braces');
+
+        const open = {
+          type: 'brace',
+          value,
+          output: '(',
+          outputIndex: state.output.length,
+          tokensIndex: state.tokens.length
+        };
+
+        braces.push(open);
+        push(open);
+        continue;
+      }
+
+      if (value === '}') {
+        const brace = braces[braces.length - 1];
+
+        if (opts.nobrace === true || !brace) {
+          push({ type: 'text', value, output: value });
+          continue;
+        }
+
+        let output = ')';
+
+        if (brace.dots === true) {
+          const arr = tokens.slice();
+          const range = [];
+
+          for (let i = arr.length - 1; i >= 0; i--) {
+            tokens.pop();
+            if (arr[i].type === 'brace') {
+              break;
+            }
+            if (arr[i].type !== 'dots') {
+              range.unshift(arr[i].value);
+            }
+          }
+
+          output = expandRange(range, opts);
+          state.backtrack = true;
+        }
+
+        if (brace.comma !== true && brace.dots !== true) {
+          const out = state.output.slice(0, brace.outputIndex);
+          const toks = state.tokens.slice(brace.tokensIndex);
+          brace.value = brace.output = '\\{';
+          value = output = '\\}';
+          state.output = out;
+          for (const t of toks) {
+            state.output += (t.output || t.value);
+          }
+        }
+
+        push({ type: 'brace', value, output });
+        decrement('braces');
+        braces.pop();
+        continue;
+      }
+
+      /**
+       * Pipes
+       */
+
+      if (value === '|') {
+        if (extglobs.length > 0) {
+          extglobs[extglobs.length - 1].conditions++;
+        }
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Commas
+       */
+
+      if (value === ',') {
+        let output = value;
+
+        const brace = braces[braces.length - 1];
+        if (brace && stack[stack.length - 1] === 'braces') {
+          brace.comma = true;
+          output = '|';
+        }
+
+        push({ type: 'comma', value, output });
+        continue;
+      }
+
+      /**
+       * Slashes
+       */
+
+      if (value === '/') {
+        // if the beginning of the glob is "./", advance the start
+        // to the current index, and don't add the "./" characters
+        // to the state. This greatly simplifies lookbehinds when
+        // checking for BOS characters like "!" and "." (not "./")
+        if (prev.type === 'dot' && state.index === state.start + 1) {
+          state.start = state.index + 1;
+          state.consumed = '';
+          state.output = '';
+          tokens.pop();
+          prev = bos; // reset "prev" to the first token
+          continue;
+        }
+
+        push({ type: 'slash', value, output: SLASH_LITERAL });
+        continue;
+      }
+
+      /**
+       * Dots
+       */
+
+      if (value === '.') {
+        if (state.braces > 0 && prev.type === 'dot') {
+          if (prev.value === '.') prev.output = DOT_LITERAL;
+          const brace = braces[braces.length - 1];
+          prev.type = 'dots';
+          prev.output += value;
+          prev.value += value;
+          brace.dots = true;
+          continue;
+        }
+
+        if ((state.braces + state.parens) === 0 && prev.type !== 'bos' && prev.type !== 'slash') {
+          push({ type: 'text', value, output: DOT_LITERAL });
+          continue;
+        }
+
+        push({ type: 'dot', value, output: DOT_LITERAL });
+        continue;
+      }
+
+      /**
+       * Question marks
+       */
+
+      if (value === '?') {
+        const isGroup = prev && prev.value === '(';
+        if (!isGroup && opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          extglobOpen('qmark', value);
+          continue;
+        }
+
+        if (prev && prev.type === 'paren') {
+          const next = peek();
+          let output = value;
+
+          if (next === '<' && !utils$1.supportsLookbehinds()) {
+            throw new Error('Node.js v10 or higher is required for regex lookbehinds');
+          }
+
+          if ((prev.value === '(' && !/[!=<:]/.test(next)) || (next === '<' && !/<([!=]|\w+>)/.test(remaining()))) {
+            output = `\\${value}`;
+          }
+
+          push({ type: 'text', value, output });
+          continue;
+        }
+
+        if (opts.dot !== true && (prev.type === 'slash' || prev.type === 'bos')) {
+          push({ type: 'qmark', value, output: QMARK_NO_DOT });
+          continue;
+        }
+
+        push({ type: 'qmark', value, output: QMARK });
+        continue;
+      }
+
+      /**
+       * Exclamation
+       */
+
+      if (value === '!') {
+        if (opts.noextglob !== true && peek() === '(') {
+          if (peek(2) !== '?' || !/[!=<:]/.test(peek(3))) {
+            extglobOpen('negate', value);
+            continue;
+          }
+        }
+
+        if (opts.nonegate !== true && state.index === 0) {
+          negate();
+          continue;
+        }
+      }
+
+      /**
+       * Plus
+       */
+
+      if (value === '+') {
+        if (opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          extglobOpen('plus', value);
+          continue;
+        }
+
+        if ((prev && prev.value === '(') || opts.regex === false) {
+          push({ type: 'plus', value, output: PLUS_LITERAL });
+          continue;
+        }
+
+        if ((prev && (prev.type === 'bracket' || prev.type === 'paren' || prev.type === 'brace')) || state.parens > 0) {
+          push({ type: 'plus', value });
+          continue;
+        }
+
+        push({ type: 'plus', value: PLUS_LITERAL });
+        continue;
+      }
+
+      /**
+       * Plain text
+       */
+
+      if (value === '@') {
+        if (opts.noextglob !== true && peek() === '(' && peek(2) !== '?') {
+          push({ type: 'at', extglob: true, value, output: '' });
+          continue;
+        }
+
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Plain text
+       */
+
+      if (value !== '*') {
+        if (value === '$' || value === '^') {
+          value = `\\${value}`;
+        }
+
+        const match = REGEX_NON_SPECIAL_CHARS.exec(remaining());
+        if (match) {
+          value += match[0];
+          state.index += match[0].length;
+        }
+
+        push({ type: 'text', value });
+        continue;
+      }
+
+      /**
+       * Stars
+       */
+
+      if (prev && (prev.type === 'globstar' || prev.star === true)) {
+        prev.type = 'star';
+        prev.star = true;
+        prev.value += value;
+        prev.output = star;
+        state.backtrack = true;
+        state.globstar = true;
+        consume(value);
+        continue;
+      }
+
+      let rest = remaining();
+      if (opts.noextglob !== true && /^\([^?]/.test(rest)) {
+        extglobOpen('star', value);
+        continue;
+      }
+
+      if (prev.type === 'star') {
+        if (opts.noglobstar === true) {
+          consume(value);
+          continue;
+        }
+
+        const prior = prev.prev;
+        const before = prior.prev;
+        const isStart = prior.type === 'slash' || prior.type === 'bos';
+        const afterStar = before && (before.type === 'star' || before.type === 'globstar');
+
+        if (opts.bash === true && (!isStart || (rest[0] && rest[0] !== '/'))) {
+          push({ type: 'star', value, output: '' });
+          continue;
+        }
+
+        const isBrace = state.braces > 0 && (prior.type === 'comma' || prior.type === 'brace');
+        const isExtglob = extglobs.length && (prior.type === 'pipe' || prior.type === 'paren');
+        if (!isStart && prior.type !== 'paren' && !isBrace && !isExtglob) {
+          push({ type: 'star', value, output: '' });
+          continue;
+        }
+
+        // strip consecutive `/**/`
+        while (rest.slice(0, 3) === '/**') {
+          const after = input[state.index + 4];
+          if (after && after !== '/') {
+            break;
+          }
+          rest = rest.slice(3);
+          consume('/**', 3);
+        }
+
+        if (prior.type === 'bos' && eos()) {
+          prev.type = 'globstar';
+          prev.value += value;
+          prev.output = globstar(opts);
+          state.output = prev.output;
+          state.globstar = true;
+          consume(value);
+          continue;
+        }
+
+        if (prior.type === 'slash' && prior.prev.type !== 'bos' && !afterStar && eos()) {
+          state.output = state.output.slice(0, -(prior.output + prev.output).length);
+          prior.output = `(?:${prior.output}`;
+
+          prev.type = 'globstar';
+          prev.output = globstar(opts) + (opts.strictSlashes ? ')' : '|$)');
+          prev.value += value;
+          state.globstar = true;
+          state.output += prior.output + prev.output;
+          consume(value);
+          continue;
+        }
+
+        if (prior.type === 'slash' && prior.prev.type !== 'bos' && rest[0] === '/') {
+          const end = rest[1] !== void 0 ? '|$' : '';
+
+          state.output = state.output.slice(0, -(prior.output + prev.output).length);
+          prior.output = `(?:${prior.output}`;
+
+          prev.type = 'globstar';
+          prev.output = `${globstar(opts)}${SLASH_LITERAL}|${SLASH_LITERAL}${end})`;
+          prev.value += value;
+
+          state.output += prior.output + prev.output;
+          state.globstar = true;
+
+          consume(value + advance());
+
+          push({ type: 'slash', value: '/', output: '' });
+          continue;
+        }
+
+        if (prior.type === 'bos' && rest[0] === '/') {
+          prev.type = 'globstar';
+          prev.value += value;
+          prev.output = `(?:^|${SLASH_LITERAL}|${globstar(opts)}${SLASH_LITERAL})`;
+          state.output = prev.output;
+          state.globstar = true;
+          consume(value + advance());
+          push({ type: 'slash', value: '/', output: '' });
+          continue;
+        }
+
+        // remove single star from output
+        state.output = state.output.slice(0, -prev.output.length);
+
+        // reset previous token to globstar
+        prev.type = 'globstar';
+        prev.output = globstar(opts);
+        prev.value += value;
+
+        // reset output with globstar
+        state.output += prev.output;
+        state.globstar = true;
+        consume(value);
+        continue;
+      }
+
+      const token = { type: 'star', value, output: star };
+
+      if (opts.bash === true) {
+        token.output = '.*?';
+        if (prev.type === 'bos' || prev.type === 'slash') {
+          token.output = nodot + token.output;
+        }
+        push(token);
+        continue;
+      }
+
+      if (prev && (prev.type === 'bracket' || prev.type === 'paren') && opts.regex === true) {
+        token.output = value;
+        push(token);
+        continue;
+      }
+
+      if (state.index === state.start || prev.type === 'slash' || prev.type === 'dot') {
+        if (prev.type === 'dot') {
+          state.output += NO_DOT_SLASH;
+          prev.output += NO_DOT_SLASH;
+
+        } else if (opts.dot === true) {
+          state.output += NO_DOTS_SLASH;
+          prev.output += NO_DOTS_SLASH;
+
+        } else {
+          state.output += nodot;
+          prev.output += nodot;
+        }
+
+        if (peek() !== '*') {
+          state.output += ONE_CHAR;
+          prev.output += ONE_CHAR;
+        }
+      }
+
+      push(token);
+    }
+
+    while (state.brackets > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', ']'));
+      state.output = utils$1.escapeLast(state.output, '[');
+      decrement('brackets');
+    }
+
+    while (state.parens > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', ')'));
+      state.output = utils$1.escapeLast(state.output, '(');
+      decrement('parens');
+    }
+
+    while (state.braces > 0) {
+      if (opts.strictBrackets === true) throw new SyntaxError(syntaxError('closing', '}'));
+      state.output = utils$1.escapeLast(state.output, '{');
+      decrement('braces');
+    }
+
+    if (opts.strictSlashes !== true && (prev.type === 'star' || prev.type === 'bracket')) {
+      push({ type: 'maybe_slash', value: '', output: `${SLASH_LITERAL}?` });
+    }
+
+    // rebuild the output if we had to backtrack at any point
+    if (state.backtrack === true) {
+      state.output = '';
+
+      for (const token of state.tokens) {
+        state.output += token.output != null ? token.output : token.value;
+
+        if (token.suffix) {
+          state.output += token.suffix;
+        }
+      }
+    }
+
+    return state;
+  };
+
+  /**
+   * Fast paths for creating regular expressions for common glob patterns.
+   * This can significantly speed up processing and has very little downside
+   * impact when none of the fast paths match.
+   */
+
+  parse$2.fastpaths = (input, options) => {
+    const opts = { ...options };
+    const max = typeof opts.maxLength === 'number' ? Math.min(MAX_LENGTH, opts.maxLength) : MAX_LENGTH;
+    const len = input.length;
+    if (len > max) {
+      throw new SyntaxError(`Input length: ${len}, exceeds maximum allowed length: ${max}`);
+    }
+
+    input = REPLACEMENTS[input] || input;
+
+    // create constants based on platform, for windows or posix
+    const {
+      DOT_LITERAL,
+      SLASH_LITERAL,
+      ONE_CHAR,
+      DOTS_SLASH,
+      NO_DOT,
+      NO_DOTS,
+      NO_DOTS_SLASH,
+      STAR,
+      START_ANCHOR
+    } = constants$2.globChars(opts.windows);
+
+    const nodot = opts.dot ? NO_DOTS : NO_DOT;
+    const slashDot = opts.dot ? NO_DOTS_SLASH : NO_DOT;
+    const capture = opts.capture ? '' : '?:';
+    const state = { negated: false, prefix: '' };
+    let star = opts.bash === true ? '.*?' : STAR;
+
+    if (opts.capture) {
+      star = `(${star})`;
+    }
+
+    const globstar = (opts) => {
+      if (opts.noglobstar === true) return star;
+      return `(${capture}(?:(?!${START_ANCHOR}${opts.dot ? DOTS_SLASH : DOT_LITERAL}).)*?)`;
+    };
+
+    const create = str => {
+      switch (str) {
+        case '*':
+          return `${nodot}${ONE_CHAR}${star}`;
+
+        case '.*':
+          return `${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '*.*':
+          return `${nodot}${star}${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '*/*':
+          return `${nodot}${star}${SLASH_LITERAL}${ONE_CHAR}${slashDot}${star}`;
+
+        case '**':
+          return nodot + globstar(opts);
+
+        case '**/*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${slashDot}${ONE_CHAR}${star}`;
+
+        case '**/*.*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${slashDot}${star}${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        case '**/.*':
+          return `(?:${nodot}${globstar(opts)}${SLASH_LITERAL})?${DOT_LITERAL}${ONE_CHAR}${star}`;
+
+        default: {
+          const match = /^(.*?)\.(\w+)$/.exec(str);
+          if (!match) return;
+
+          const source = create(match[1]);
+          if (!source) return;
+
+          return source + DOT_LITERAL + match[2];
+        }
+      }
+    };
+
+    const output = utils$1.removePrefix(input, state);
+    let source = create(output);
+
+    if (source && opts.strictSlashes !== true) {
+      source += `${SLASH_LITERAL}?`;
+    }
+
+    return source;
+  };
+
+  var parse_1 = parse$2;
+
+  const scan = scan_1;
+  const parse$1 = parse_1;
+  const utils = utils$3;
+  const constants$1 = constants$3;
+  const isObject = val => val && typeof val === 'object' && !Array.isArray(val);
+
+  /**
+   * Creates a matcher function from one or more glob patterns. The
+   * returned function takes a string to match as its first argument,
+   * and returns true if the string is a match. The returned matcher
+   * function also takes a boolean as the second argument that, when true,
+   * returns an object with additional information.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch(glob[, options]);
+   *
+   * const isMatch = picomatch('*.!(*a)');
+   * console.log(isMatch('a.a')); //=> false
+   * console.log(isMatch('a.b')); //=> true
+   * ```
+   * @name picomatch
+   * @param {String|Array} `globs` One or more glob patterns.
+   * @param {Object=} `options`
+   * @return {Function=} Returns a matcher function.
+   * @api public
+   */
+
+  const picomatch = (glob, options, returnState = false) => {
+    if (Array.isArray(glob)) {
+      const fns = glob.map(input => picomatch(input, options, returnState));
+      const arrayMatcher = str => {
+        for (const isMatch of fns) {
+          const state = isMatch(str);
+          if (state) return state;
+        }
+        return false;
+      };
+      return arrayMatcher;
+    }
+
+    const isState = isObject(glob) && glob.tokens && glob.input;
+
+    if (glob === '' || (typeof glob !== 'string' && !isState)) {
+      throw new TypeError('Expected pattern to be a non-empty string');
+    }
+
+    const opts = options || {};
+    const posix = opts.windows;
+    const regex = isState
+      ? picomatch.compileRe(glob, options)
+      : picomatch.makeRe(glob, options, false, true);
+
+    const state = regex.state;
+    delete regex.state;
+
+    let isIgnored = () => false;
+    if (opts.ignore) {
+      const ignoreOpts = { ...options, ignore: null, onMatch: null, onResult: null };
+      isIgnored = picomatch(opts.ignore, ignoreOpts, returnState);
+    }
+
+    const matcher = (input, returnObject = false) => {
+      const { isMatch, match, output } = picomatch.test(input, regex, options, { glob, posix });
+      const result = { glob, state, regex, posix, input, output, match, isMatch };
+
+      if (typeof opts.onResult === 'function') {
+        opts.onResult(result);
+      }
+
+      if (isMatch === false) {
+        result.isMatch = false;
+        return returnObject ? result : false;
+      }
+
+      if (isIgnored(input)) {
+        if (typeof opts.onIgnore === 'function') {
+          opts.onIgnore(result);
+        }
+        result.isMatch = false;
+        return returnObject ? result : false;
+      }
+
+      if (typeof opts.onMatch === 'function') {
+        opts.onMatch(result);
+      }
+      return returnObject ? result : true;
+    };
+
+    if (returnState) {
+      matcher.state = state;
+    }
+
+    return matcher;
+  };
+
+  /**
+   * Test `input` with the given `regex`. This is used by the main
+   * `picomatch()` function to test the input string.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.test(input, regex[, options]);
+   *
+   * console.log(picomatch.test('foo/bar', /^(?:([^/]*?)\/([^/]*?))$/));
+   * // { isMatch: true, match: [ 'foo/', 'foo', 'bar' ], output: 'foo/bar' }
+   * ```
+   * @param {String} `input` String to test.
+   * @param {RegExp} `regex`
+   * @return {Object} Returns an object with matching info.
+   * @api public
+   */
+
+  picomatch.test = (input, regex, options, { glob, posix } = {}) => {
+    if (typeof input !== 'string') {
+      throw new TypeError('Expected input to be a string');
+    }
+
+    if (input === '') {
+      return { isMatch: false, output: '' };
+    }
+
+    const opts = options || {};
+    const format = opts.format || (posix ? utils.toPosixSlashes : null);
+    let match = input === glob;
+    let output = (match && format) ? format(input) : input;
+
+    if (match === false) {
+      output = format ? format(input) : input;
+      match = output === glob;
+    }
+
+    if (match === false || opts.capture === true) {
+      if (opts.matchBase === true || opts.basename === true) {
+        match = picomatch.matchBase(input, regex, options, posix);
+      } else {
+        match = regex.exec(output);
+      }
+    }
+
+    return { isMatch: Boolean(match), match, output };
+  };
+
+  /**
+   * Match the basename of a filepath.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.matchBase(input, glob[, options]);
+   * console.log(picomatch.matchBase('foo/bar.js', '*.js'); // true
+   * ```
+   * @param {String} `input` String to test.
+   * @param {RegExp|String} `glob` Glob pattern or regex created by [.makeRe](#makeRe).
+   * @return {Boolean}
+   * @api public
+   */
+
+  picomatch.matchBase = (input, glob, options) => {
+    const regex = glob instanceof RegExp ? glob : picomatch.makeRe(glob, options);
+    return regex.test(utils.basename(input));
+  };
+
+  /**
+   * Returns true if **any** of the given glob `patterns` match the specified `string`.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.isMatch(string, patterns[, options]);
+   *
+   * console.log(picomatch.isMatch('a.a', ['b.*', '*.a'])); //=> true
+   * console.log(picomatch.isMatch('a.a', 'b.*')); //=> false
+   * ```
+   * @param {String|Array} str The string to test.
+   * @param {String|Array} patterns One or more glob patterns to use for matching.
+   * @param {Object} [options] See available [options](#options).
+   * @return {Boolean} Returns true if any patterns match `str`
+   * @api public
+   */
+
+  picomatch.isMatch = (str, patterns, options) => picomatch(patterns, options)(str);
+
+  /**
+   * Parse a glob pattern to create the source string for a regular
+   * expression.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * const result = picomatch.parse(pattern[, options]);
+   * ```
+   * @param {String} `pattern`
+   * @param {Object} `options`
+   * @return {Object} Returns an object with useful properties and output to be used as a regex source string.
+   * @api public
+   */
+
+  picomatch.parse = (pattern, options) => {
+    if (Array.isArray(pattern)) return pattern.map(p => picomatch.parse(p, options));
+    return parse$1(pattern, { ...options, fastpaths: false });
+  };
+
+  /**
+   * Scan a glob pattern to separate the pattern into segments.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.scan(input[, options]);
+   *
+   * const result = picomatch.scan('!./foo/*.js');
+   * console.log(result);
+   * { prefix: '!./',
+   *   input: '!./foo/*.js',
+   *   start: 3,
+   *   base: 'foo',
+   *   glob: '*.js',
+   *   isBrace: false,
+   *   isBracket: false,
+   *   isGlob: true,
+   *   isExtglob: false,
+   *   isGlobstar: false,
+   *   negated: true }
+   * ```
+   * @param {String} `input` Glob pattern to scan.
+   * @param {Object} `options`
+   * @return {Object} Returns an object with
+   * @api public
+   */
+
+  picomatch.scan = (input, options) => scan(input, options);
+
+  /**
+   * Create a regular expression from a parsed glob pattern.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * const state = picomatch.parse('*.js');
+   * // picomatch.compileRe(state[, options]);
+   *
+   * console.log(picomatch.compileRe(state));
+   * //=> /^(?:(?!\.)(?=.)[^/]*?\.js)$/
+   * ```
+   * @param {String} `state` The object returned from the `.parse` method.
+   * @param {Object} `options`
+   * @return {RegExp} Returns a regex created from the given pattern.
+   * @api public
+   */
+
+  picomatch.compileRe = (parsed, options, returnOutput = false, returnState = false) => {
+    if (returnOutput === true) {
+      return parsed.output;
+    }
+
+    const opts = options || {};
+    const prepend = opts.contains ? '' : '^';
+    const append = opts.contains ? '' : '$';
+
+    let source = `${prepend}(?:${parsed.output})${append}`;
+    if (parsed && parsed.negated === true) {
+      source = `^(?!${source}).*$`;
+    }
+
+    const regex = picomatch.toRegex(source, options);
+    if (returnState === true) {
+      regex.state = parsed;
+    }
+
+    return regex;
+  };
+
+  picomatch.makeRe = (input, options, returnOutput = false, returnState = false) => {
+    if (!input || typeof input !== 'string') {
+      throw new TypeError('Expected a non-empty string');
+    }
+
+    const opts = options || {};
+    let parsed = { negated: false, fastpaths: true };
+    let prefix = '';
+    let output;
+
+    if (input.startsWith('./')) {
+      input = input.slice(2);
+      prefix = parsed.prefix = './';
+    }
+
+    if (opts.fastpaths !== false && (input[0] === '.' || input[0] === '*')) {
+      output = parse$1.fastpaths(input, options);
+    }
+
+    if (output === undefined) {
+      parsed = parse$1(input, options);
+      parsed.prefix = prefix + (parsed.prefix || '');
+    } else {
+      parsed.output = output;
+    }
+
+    return picomatch.compileRe(parsed, options, returnOutput, returnState);
+  };
+
+  /**
+   * Create a regular expression from the given regex source string.
+   *
+   * ```js
+   * const picomatch = require('picomatch');
+   * // picomatch.toRegex(source[, options]);
+   *
+   * const { output } = picomatch.parse('*.js');
+   * console.log(picomatch.toRegex(output));
+   * //=> /^(?:(?!\.)(?=.)[^/]*?\.js)$/
+   * ```
+   * @param {String} `source` Regular expression source string.
+   * @param {Object} `options`
+   * @return {RegExp}
+   * @api public
+   */
+
+  picomatch.toRegex = (source, options) => {
+    try {
+      const opts = options || {};
+      return new RegExp(source, opts.flags || (opts.nocase ? 'i' : ''));
+    } catch (err) {
+      if (options && options.debug === true) throw err;
+      return /$^/;
+    }
+  };
+
+  /**
+   * Picomatch constants.
+   * @return {Object}
+   */
+
+  picomatch.constants = constants$1;
+
+  /**
+   * Expose "picomatch"
+   */
+
+  var picomatch_1 = picomatch;
+
+  var picomatchBrowser = picomatch_1;
+
+  var pm = /*@__PURE__*/getDefaultExportFromCjs(picomatchBrowser);
+
+  function isArray(arg) {
+      return Array.isArray(arg);
+  }
+  function ensureArray(thing) {
+      if (isArray(thing))
+          return thing;
+      if (thing == null)
+          return [];
+      return [thing];
+  }
+  const globToTest = (glob) => {
+      const pattern = glob;
+      const fn = pm(pattern, { dot: true });
+      return {
+          test: (what) => {
+              const result = fn(what);
+              return result;
+          },
+      };
+  };
+  const testTrue = {
+      test: () => true,
+  };
+  const getMatcher = (filter) => {
+      const bundleTest = "bundle" in filter && filter.bundle != null ? globToTest(filter.bundle) : testTrue;
+      const fileTest = "file" in filter && filter.file != null ? globToTest(filter.file) : testTrue;
+      return { bundleTest, fileTest };
+  };
+  const createFilter = (include, exclude) => {
+      const includeMatchers = ensureArray(include).map(getMatcher);
+      const excludeMatchers = ensureArray(exclude).map(getMatcher);
+      return (bundleId, id) => {
+          for (let i = 0; i < excludeMatchers.length; ++i) {
+              const { bundleTest, fileTest } = excludeMatchers[i];
+              if (bundleTest.test(bundleId) && fileTest.test(id))
+                  return false;
+          }
+          for (let i = 0; i < includeMatchers.length; ++i) {
+              const { bundleTest, fileTest } = includeMatchers[i];
+              if (bundleTest.test(bundleId) && fileTest.test(id))
+                  return true;
+          }
+          return !includeMatchers.length;
+      };
+  };
+
+  const throttleFilter = (callback, limit) => {
+      let waiting = false;
+      return (val) => {
+          if (!waiting) {
+              callback(val);
+              waiting = true;
+              setTimeout(() => {
+                  waiting = false;
+              }, limit);
+          }
+      };
+  };
+  const prepareFilter = (filt) => {
+      if (filt === "")
+          return [];
+      return (filt
+          .split(",")
+          // remove spaces before and after
+          .map((entry) => entry.trim())
+          // unquote "
+          .map((entry) => entry.startsWith('"') && entry.endsWith('"') ? entry.substring(1, entry.length - 1) : entry)
+          // unquote '
+          .map((entry) => entry.startsWith("'") && entry.endsWith("'") ? entry.substring(1, entry.length - 1) : entry)
+          // remove empty strings
+          .filter((entry) => entry)
+          // parse bundle:file
+          .map((entry) => entry.split(":"))
+          // normalize entry just in case
+          .flatMap((entry) => {
+          if (entry.length === 0)
+              return [];
+          let bundle = null;
+          let file = null;
+          if (entry.length === 1 && entry[0]) {
+              file = entry[0];
+              return [{ file, bundle }];
+          }
+          bundle = entry[0] || null;
+          file = entry.slice(1).join(":") || null;
+          return [{ bundle, file }];
+      }));
+  };
+  const useFilter = () => {
+      const [includeFilter, setIncludeFilter] = h("");
+      const [excludeFilter, setExcludeFilter] = h("");
+      const setIncludeFilterTrottled = F(() => throttleFilter(setIncludeFilter, 200), []);
+      const setExcludeFilterTrottled = F(() => throttleFilter(setExcludeFilter, 200), []);
+      const isIncluded = F(() => createFilter(prepareFilter(includeFilter), prepareFilter(excludeFilter)), [includeFilter, excludeFilter]);
+      const getModuleFilterMultiplier = T((bundleId, data) => {
+          return isIncluded(bundleId, data.id) ? 1 : 0;
+      }, [isIncluded]);
+      return {
+          getModuleFilterMultiplier,
+          includeFilter,
+          excludeFilter,
+          setExcludeFilter: setExcludeFilterTrottled,
+          setIncludeFilter: setIncludeFilterTrottled,
+      };
+  };
+
+  function ascending(a, b) {
+    return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
+  }
+
+  function descending(a, b) {
+    return a == null || b == null ? NaN
+      : b < a ? -1
+      : b > a ? 1
+      : b >= a ? 0
+      : NaN;
+  }
+
+  function bisector(f) {
+    let compare1, compare2, delta;
+
+    // If an accessor is specified, promote it to a comparator. In this case we
+    // can test whether the search value is (self-) comparable. We can’t do this
+    // for a comparator (except for specific, known comparators) because we can’t
+    // tell if the comparator is symmetric, and an asymmetric comparator can’t be
+    // used to test whether a single value is comparable.
+    if (f.length !== 2) {
+      compare1 = ascending;
+      compare2 = (d, x) => ascending(f(d), x);
+      delta = (d, x) => f(d) - x;
+    } else {
+      compare1 = f === ascending || f === descending ? f : zero$1;
+      compare2 = f;
+      delta = f;
+    }
+
+    function left(a, x, lo = 0, hi = a.length) {
+      if (lo < hi) {
+        if (compare1(x, x) !== 0) return hi;
+        do {
+          const mid = (lo + hi) >>> 1;
+          if (compare2(a[mid], x) < 0) lo = mid + 1;
+          else hi = mid;
+        } while (lo < hi);
+      }
+      return lo;
+    }
+
+    function right(a, x, lo = 0, hi = a.length) {
+      if (lo < hi) {
+        if (compare1(x, x) !== 0) return hi;
+        do {
+          const mid = (lo + hi) >>> 1;
+          if (compare2(a[mid], x) <= 0) lo = mid + 1;
+          else hi = mid;
+        } while (lo < hi);
+      }
+      return lo;
+    }
+
+    function center(a, x, lo = 0, hi = a.length) {
+      const i = left(a, x, lo, hi - 1);
+      return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;
+    }
+
+    return {left, center, right};
+  }
+
+  function zero$1() {
+    return 0;
+  }
+
+  function number$1(x) {
+    return x === null ? NaN : +x;
+  }
+
+  const ascendingBisect = bisector(ascending);
+  const bisectRight = ascendingBisect.right;
+  bisector(number$1).center;
+  var bisect = bisectRight;
+
+  class InternMap extends Map {
+    constructor(entries, key = keyof) {
+      super();
+      Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});
+      if (entries != null) for (const [key, value] of entries) this.set(key, value);
+    }
+    get(key) {
+      return super.get(intern_get(this, key));
+    }
+    has(key) {
+      return super.has(intern_get(this, key));
+    }
+    set(key, value) {
+      return super.set(intern_set(this, key), value);
+    }
+    delete(key) {
+      return super.delete(intern_delete(this, key));
+    }
+  }
+
+  function intern_get({_intern, _key}, value) {
+    const key = _key(value);
+    return _intern.has(key) ? _intern.get(key) : value;
+  }
+
+  function intern_set({_intern, _key}, value) {
+    const key = _key(value);
+    if (_intern.has(key)) return _intern.get(key);
+    _intern.set(key, value);
+    return value;
+  }
+
+  function intern_delete({_intern, _key}, value) {
+    const key = _key(value);
+    if (_intern.has(key)) {
+      value = _intern.get(key);
+      _intern.delete(key);
+    }
+    return value;
+  }
+
+  function keyof(value) {
+    return value !== null && typeof value === "object" ? value.valueOf() : value;
+  }
+
+  function identity$2(x) {
+    return x;
+  }
+
+  function group(values, ...keys) {
+    return nest(values, identity$2, identity$2, keys);
+  }
+
+  function nest(values, map, reduce, keys) {
+    return (function regroup(values, i) {
+      if (i >= keys.length) return reduce(values);
+      const groups = new InternMap();
+      const keyof = keys[i++];
+      let index = -1;
+      for (const value of values) {
+        const key = keyof(value, ++index, values);
+        const group = groups.get(key);
+        if (group) group.push(value);
+        else groups.set(key, [value]);
+      }
+      for (const [key, values] of groups) {
+        groups.set(key, regroup(values, i));
+      }
+      return map(groups);
+    })(values, 0);
+  }
+
+  const e10 = Math.sqrt(50),
+      e5 = Math.sqrt(10),
+      e2 = Math.sqrt(2);
+
+  function tickSpec(start, stop, count) {
+    const step = (stop - start) / Math.max(0, count),
+        power = Math.floor(Math.log10(step)),
+        error = step / Math.pow(10, power),
+        factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;
+    let i1, i2, inc;
+    if (power < 0) {
+      inc = Math.pow(10, -power) / factor;
+      i1 = Math.round(start * inc);
+      i2 = Math.round(stop * inc);
+      if (i1 / inc < start) ++i1;
+      if (i2 / inc > stop) --i2;
+      inc = -inc;
+    } else {
+      inc = Math.pow(10, power) * factor;
+      i1 = Math.round(start / inc);
+      i2 = Math.round(stop / inc);
+      if (i1 * inc < start) ++i1;
+      if (i2 * inc > stop) --i2;
+    }
+    if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);
+    return [i1, i2, inc];
+  }
+
+  function ticks(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    if (!(count > 0)) return [];
+    if (start === stop) return [start];
+    const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);
+    if (!(i2 >= i1)) return [];
+    const n = i2 - i1 + 1, ticks = new Array(n);
+    if (reverse) {
+      if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;
+      else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;
+    } else {
+      if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;
+      else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;
+    }
+    return ticks;
+  }
+
+  function tickIncrement(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    return tickSpec(start, stop, count)[2];
+  }
+
+  function tickStep(start, stop, count) {
+    stop = +stop, start = +start, count = +count;
+    const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);
+    return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);
+  }
+
+  const TOP_PADDING = 20;
+  const PADDING = 2;
+
+  const Node = ({ node, onMouseOver, onClick, selected }) => {
+      const { getModuleColor } = q(StaticContext);
+      const { backgroundColor, fontColor } = getModuleColor(node);
+      const { x0, x1, y1, y0, data, children = null } = node;
+      const textRef = _(null);
+      const textRectRef = _();
+      const width = x1 - x0;
+      const height = y1 - y0;
+      const textProps = {
+          "font-size": "0.7em",
+          "dominant-baseline": "middle",
+          "text-anchor": "middle",
+          x: width / 2,
+      };
+      if (children != null) {
+          textProps.y = (TOP_PADDING + PADDING) / 2;
+      }
+      else {
+          textProps.y = height / 2;
+      }
+      y(() => {
+          if (width == 0 || height == 0 || !textRef.current) {
+              return;
+          }
+          if (textRectRef.current == null) {
+              textRectRef.current = textRef.current.getBoundingClientRect();
+          }
+          let scale = 1;
+          if (children != null) {
+              scale = Math.min((width * 0.9) / textRectRef.current.width, Math.min(height, TOP_PADDING + PADDING) / textRectRef.current.height);
+              scale = Math.min(1, scale);
+              textRef.current.setAttribute("y", String(Math.min(TOP_PADDING + PADDING, height) / 2 / scale));
+              textRef.current.setAttribute("x", String(width / 2 / scale));
+          }
+          else {
+              scale = Math.min((width * 0.9) / textRectRef.current.width, (height * 0.9) / textRectRef.current.height);
+              scale = Math.min(1, scale);
+              textRef.current.setAttribute("y", String(height / 2 / scale));
+              textRef.current.setAttribute("x", String(width / 2 / scale));
+          }
+          textRef.current.setAttribute("transform", `scale(${scale.toFixed(2)})`);
+      }, [children, height, width]);
+      if (width == 0 || height == 0) {
+          return null;
+      }
+      return (u$1("g", { className: "node", transform: `translate(${x0},${y0})`, onClick: (event) => {
+              event.stopPropagation();
+              onClick(node);
+          }, onMouseOver: (event) => {
+              event.stopPropagation();
+              onMouseOver(node);
+          }, children: [u$1("rect", { fill: backgroundColor, rx: 2, ry: 2, width: x1 - x0, height: y1 - y0, stroke: selected ? "#fff" : undefined, "stroke-width": selected ? 2 : undefined }), u$1("text", Object.assign({ ref: textRef, fill: fontColor, onClick: (event) => {
+                      var _a;
+                      if (((_a = window.getSelection()) === null || _a === void 0 ? void 0 : _a.toString()) !== "") {
+                          event.stopPropagation();
+                      }
+                  } }, textProps, { children: data.name }))] }));
+  };
+
+  const TreeMap = ({ root, onNodeHover, selectedNode, onNodeClick, }) => {
+      const { width, height, getModuleIds } = q(StaticContext);
+      console.time("layering");
+      // this will make groups by height
+      const nestedData = F(() => {
+          const nestedDataMap = group(root.descendants(), (d) => d.height);
+          const nestedData = Array.from(nestedDataMap, ([key, values]) => ({
+              key,
+              values,
+          }));
+          nestedData.sort((a, b) => b.key - a.key);
+          return nestedData;
+      }, [root]);
+      console.timeEnd("layering");
+      return (u$1("svg", { xmlns: "http://www.w3.org/2000/svg", viewBox: `0 0 ${width} ${height}`, children: nestedData.map(({ key, values }) => {
+              return (u$1("g", { className: "layer", children: values.map((node) => {
+                      return (u$1(Node, { node: node, onMouseOver: onNodeHover, selected: selectedNode === node, onClick: onNodeClick }, getModuleIds(node.data).nodeUid.id));
+                  }) }, key));
+          }) }));
+  };
+
+  var bytes$1 = {exports: {}};
+
+  /*!
+   * bytes
+   * Copyright(c) 2012-2014 TJ Holowaychuk
+   * Copyright(c) 2015 Jed Watson
+   * MIT Licensed
+   */
+
+  /**
+   * Module exports.
+   * @public
+   */
+
+  bytes$1.exports = bytes;
+  var format_1 = bytes$1.exports.format = format$1;
+  bytes$1.exports.parse = parse;
+
+  /**
+   * Module variables.
+   * @private
+   */
+
+  var formatThousandsRegExp = /\B(?=(\d{3})+(?!\d))/g;
+
+  var formatDecimalsRegExp = /(?:\.0*|(\.[^0]+)0+)$/;
+
+  var map$1 = {
+    b:  1,
+    kb: 1 << 10,
+    mb: 1 << 20,
+    gb: 1 << 30,
+    tb: Math.pow(1024, 4),
+    pb: Math.pow(1024, 5),
+  };
+
+  var parseRegExp = /^((-|\+)?(\d+(?:\.\d+)?)) *(kb|mb|gb|tb|pb)$/i;
+
+  /**
+   * Convert the given value in bytes into a string or parse to string to an integer in bytes.
+   *
+   * @param {string|number} value
+   * @param {{
+   *  case: [string],
+   *  decimalPlaces: [number]
+   *  fixedDecimals: [boolean]
+   *  thousandsSeparator: [string]
+   *  unitSeparator: [string]
+   *  }} [options] bytes options.
+   *
+   * @returns {string|number|null}
+   */
+
+  function bytes(value, options) {
+    if (typeof value === 'string') {
+      return parse(value);
+    }
+
+    if (typeof value === 'number') {
+      return format$1(value, options);
+    }
+
+    return null;
+  }
+
+  /**
+   * Format the given value in bytes into a string.
+   *
+   * If the value is negative, it is kept as such. If it is a float,
+   * it is rounded.
+   *
+   * @param {number} value
+   * @param {object} [options]
+   * @param {number} [options.decimalPlaces=2]
+   * @param {number} [options.fixedDecimals=false]
+   * @param {string} [options.thousandsSeparator=]
+   * @param {string} [options.unit=]
+   * @param {string} [options.unitSeparator=]
+   *
+   * @returns {string|null}
+   * @public
+   */
+
+  function format$1(value, options) {
+    if (!Number.isFinite(value)) {
+      return null;
+    }
+
+    var mag = Math.abs(value);
+    var thousandsSeparator = (options && options.thousandsSeparator) || '';
+    var unitSeparator = (options && options.unitSeparator) || '';
+    var decimalPlaces = (options && options.decimalPlaces !== undefined) ? options.decimalPlaces : 2;
+    var fixedDecimals = Boolean(options && options.fixedDecimals);
+    var unit = (options && options.unit) || '';
+
+    if (!unit || !map$1[unit.toLowerCase()]) {
+      if (mag >= map$1.pb) {
+        unit = 'PB';
+      } else if (mag >= map$1.tb) {
+        unit = 'TB';
+      } else if (mag >= map$1.gb) {
+        unit = 'GB';
+      } else if (mag >= map$1.mb) {
+        unit = 'MB';
+      } else if (mag >= map$1.kb) {
+        unit = 'KB';
+      } else {
+        unit = 'B';
+      }
+    }
+
+    var val = value / map$1[unit.toLowerCase()];
+    var str = val.toFixed(decimalPlaces);
+
+    if (!fixedDecimals) {
+      str = str.replace(formatDecimalsRegExp, '$1');
+    }
+
+    if (thousandsSeparator) {
+      str = str.split('.').map(function (s, i) {
+        return i === 0
+          ? s.replace(formatThousandsRegExp, thousandsSeparator)
+          : s
+      }).join('.');
+    }
+
+    return str + unitSeparator + unit;
+  }
+
+  /**
+   * Parse the string value into an integer in bytes.
+   *
+   * If no unit is given, it is assumed the value is in bytes.
+   *
+   * @param {number|string} val
+   *
+   * @returns {number|null}
+   * @public
+   */
+
+  function parse(val) {
+    if (typeof val === 'number' && !isNaN(val)) {
+      return val;
+    }
+
+    if (typeof val !== 'string') {
+      return null;
+    }
+
+    // Test if the string passed is valid
+    var results = parseRegExp.exec(val);
+    var floatValue;
+    var unit = 'b';
+
+    if (!results) {
+      // Nothing could be extracted from the given string
+      floatValue = parseInt(val, 10);
+      unit = 'b';
+    } else {
+      // Retrieve the value and the unit
+      floatValue = parseFloat(results[1]);
+      unit = results[4].toLowerCase();
+    }
+
+    if (isNaN(floatValue)) {
+      return null;
+    }
+
+    return Math.floor(map$1[unit] * floatValue);
+  }
+
+  const Tooltip_marginX = 10;
+  const Tooltip_marginY = 30;
+  const SOURCEMAP_RENDERED = (u$1("span", { children: [" ", u$1("b", { children: LABELS.renderedLength }), " is a number of characters in the file after individual and ", u$1("br", {}), " ", "whole bundle transformations according to sourcemap."] }));
+  const RENDRED = (u$1("span", { children: [u$1("b", { children: LABELS.renderedLength }), " is a byte size of individual file after transformations and treeshake."] }));
+  const COMPRESSED = (u$1("span", { children: [u$1("b", { children: LABELS.gzipLength }), " and ", u$1("b", { children: LABELS.brotliLength }), " is a byte size of individual file after individual transformations,", u$1("br", {}), " treeshake and compression."] }));
+  const Tooltip = ({ node, visible, root, sizeProperty, }) => {
+      const { availableSizeProperties, getModuleSize, data } = q(StaticContext);
+      const ref = _(null);
+      const [style, setStyle] = h({});
+      const content = F(() => {
+          if (!node)
+              return null;
+          const mainSize = getModuleSize(node.data, sizeProperty);
+          const percentageNum = (100 * mainSize) / getModuleSize(root.data, sizeProperty);
+          const percentage = percentageNum.toFixed(2);
+          const percentageString = percentage + "%";
+          const path = node
+              .ancestors()
+              .reverse()
+              .map((d) => d.data.name)
+              .join("/");
+          let dataNode = null;
+          if (!isModuleTree(node.data)) {
+              const mainUid = data.nodeParts[node.data.uid].metaUid;
+              dataNode = data.nodeMetas[mainUid];
+          }
+          return (u$1(g$1, { children: [u$1("div", { children: path }), availableSizeProperties.map((sizeProp) => {
+                      if (sizeProp === sizeProperty) {
+                          return (u$1("div", { children: [u$1("b", { children: [LABELS[sizeProp], ": ", format_1(mainSize)] }), " ", "(", percentageString, ")"] }, sizeProp));
+                      }
+                      else {
+                          return (u$1("div", { children: [LABELS[sizeProp], ": ", format_1(getModuleSize(node.data, sizeProp))] }, sizeProp));
+                      }
+                  }), u$1("br", {}), dataNode && dataNode.importedBy.length > 0 && (u$1("div", { children: [u$1("div", { children: [u$1("b", { children: "Imported By" }), ":"] }), dataNode.importedBy.map(({ uid }) => {
+                              const id = data.nodeMetas[uid].id;
+                              return u$1("div", { children: id }, id);
+                          })] })), u$1("br", {}), u$1("small", { children: data.options.sourcemap ? SOURCEMAP_RENDERED : RENDRED }), (data.options.gzip || data.options.brotli) && (u$1(g$1, { children: [u$1("br", {}), u$1("small", { children: COMPRESSED })] }))] }));
+      }, [availableSizeProperties, data, getModuleSize, node, root.data, sizeProperty]);
+      const updatePosition = (mouseCoords) => {
+          if (!ref.current)
+              return;
+          const pos = {
+              left: mouseCoords.x + Tooltip_marginX,
+              top: mouseCoords.y + Tooltip_marginY,
+          };
+          const boundingRect = ref.current.getBoundingClientRect();
+          if (pos.left + boundingRect.width > window.innerWidth) {
+              // Shifting horizontally
+              pos.left = window.innerWidth - boundingRect.width;
+          }
+          if (pos.top + boundingRect.height > window.innerHeight) {
+              // Flipping vertically
+              pos.top = mouseCoords.y - Tooltip_marginY - boundingRect.height;
+          }
+          setStyle(pos);
+      };
+      p(() => {
+          const handleMouseMove = (event) => {
+              updatePosition({
+                  x: event.pageX,
+                  y: event.pageY,
+              });
+          };
+          document.addEventListener("mousemove", handleMouseMove, true);
+          return () => {
+              document.removeEventListener("mousemove", handleMouseMove, true);
+          };
+      }, []);
+      return (u$1("div", { className: `tooltip ${visible ? "" : "tooltip-hidden"}`, ref: ref, style: style, children: content }));
+  };
+
+  const Chart = ({ root, sizeProperty, selectedNode, setSelectedNode, }) => {
+      const [showTooltip, setShowTooltip] = h(false);
+      const [tooltipNode, setTooltipNode] = h(undefined);
+      p(() => {
+          const handleMouseOut = () => {
+              setShowTooltip(false);
+          };
+          document.addEventListener("mouseover", handleMouseOut);
+          return () => {
+              document.removeEventListener("mouseover", handleMouseOut);
+          };
+      }, []);
+      return (u$1(g$1, { children: [u$1(TreeMap, { root: root, onNodeHover: (node) => {
+                      setTooltipNode(node);
+                      setShowTooltip(true);
+                  }, selectedNode: selectedNode, onNodeClick: (node) => {
+                      setSelectedNode(selectedNode === node ? undefined : node);
+                  } }), u$1(Tooltip, { visible: showTooltip, node: tooltipNode, root: root, sizeProperty: sizeProperty })] }));
+  };
+
+  const Main = () => {
+      const { availableSizeProperties, rawHierarchy, getModuleSize, layout, data } = q(StaticContext);
+      const [sizeProperty, setSizeProperty] = h(availableSizeProperties[0]);
+      const [selectedNode, setSelectedNode] = h(undefined);
+      const { getModuleFilterMultiplier, setExcludeFilter, setIncludeFilter } = useFilter();
+      console.time("getNodeSizeMultiplier");
+      const getNodeSizeMultiplier = F(() => {
+          const selectedMultiplier = 1; // selectedSize < rootSize * increaseFactor ? (rootSize * increaseFactor) / selectedSize : rootSize / selectedSize;
+          const nonSelectedMultiplier = 0; // 1 / selectedMultiplier
+          if (selectedNode === undefined) {
+              return () => 1;
+          }
+          else if (isModuleTree(selectedNode.data)) {
+              const leaves = new Set(selectedNode.leaves().map((d) => d.data));
+              return (node) => {
+                  if (leaves.has(node)) {
+                      return selectedMultiplier;
+                  }
+                  return nonSelectedMultiplier;
+              };
+          }
+          else {
+              return (node) => {
+                  if (node === selectedNode.data) {
+                      return selectedMultiplier;
+                  }
+                  return nonSelectedMultiplier;
+              };
+          }
+      }, [getModuleSize, rawHierarchy.data, selectedNode, sizeProperty]);
+      console.timeEnd("getNodeSizeMultiplier");
+      console.time("root hierarchy compute");
+      // root here always be the same as rawHierarchy even after layouting
+      const root = F(() => {
+          const rootWithSizesAndSorted = rawHierarchy
+              .sum((node) => {
+              var _a;
+              if (isModuleTree(node))
+                  return 0;
+              const meta = data.nodeMetas[data.nodeParts[node.uid].metaUid];
+              const bundleId = (_a = Object.entries(meta.moduleParts).find(([bundleId, uid]) => uid == node.uid)) === null || _a === void 0 ? void 0 : _a[0];
+              const ownSize = getModuleSize(node, sizeProperty);
+              const zoomMultiplier = getNodeSizeMultiplier(node);
+              const filterMultiplier = getModuleFilterMultiplier(bundleId, meta);
+              return ownSize * zoomMultiplier * filterMultiplier;
+          })
+              .sort((a, b) => getModuleSize(a.data, sizeProperty) - getModuleSize(b.data, sizeProperty));
+          return layout(rootWithSizesAndSorted);
+      }, [
+          data,
+          getModuleFilterMultiplier,
+          getModuleSize,
+          getNodeSizeMultiplier,
+          layout,
+          rawHierarchy,
+          sizeProperty,
+      ]);
+      console.timeEnd("root hierarchy compute");
+      return (u$1(g$1, { children: [u$1(SideBar, { sizeProperty: sizeProperty, availableSizeProperties: availableSizeProperties, setSizeProperty: setSizeProperty, onExcludeChange: setExcludeFilter, onIncludeChange: setIncludeFilter }), u$1(Chart, { root: root, sizeProperty: sizeProperty, selectedNode: selectedNode, setSelectedNode: setSelectedNode })] }));
+  };
+
+  function initRange(domain, range) {
+    switch (arguments.length) {
+      case 0: break;
+      case 1: this.range(domain); break;
+      default: this.range(range).domain(domain); break;
+    }
+    return this;
+  }
+
+  function initInterpolator(domain, interpolator) {
+    switch (arguments.length) {
+      case 0: break;
+      case 1: {
+        if (typeof domain === "function") this.interpolator(domain);
+        else this.range(domain);
+        break;
+      }
+      default: {
+        this.domain(domain);
+        if (typeof interpolator === "function") this.interpolator(interpolator);
+        else this.range(interpolator);
+        break;
+      }
+    }
+    return this;
+  }
+
+  function define(constructor, factory, prototype) {
+    constructor.prototype = factory.prototype = prototype;
+    prototype.constructor = constructor;
+  }
+
+  function extend(parent, definition) {
+    var prototype = Object.create(parent.prototype);
+    for (var key in definition) prototype[key] = definition[key];
+    return prototype;
+  }
+
+  function Color() {}
+
+  var darker = 0.7;
+  var brighter = 1 / darker;
+
+  var reI = "\\s*([+-]?\\d+)\\s*",
+      reN = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)\\s*",
+      reP = "\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)%\\s*",
+      reHex = /^#([0-9a-f]{3,8})$/,
+      reRgbInteger = new RegExp(`^rgb\\(${reI},${reI},${reI}\\)$`),
+      reRgbPercent = new RegExp(`^rgb\\(${reP},${reP},${reP}\\)$`),
+      reRgbaInteger = new RegExp(`^rgba\\(${reI},${reI},${reI},${reN}\\)$`),
+      reRgbaPercent = new RegExp(`^rgba\\(${reP},${reP},${reP},${reN}\\)$`),
+      reHslPercent = new RegExp(`^hsl\\(${reN},${reP},${reP}\\)$`),
+      reHslaPercent = new RegExp(`^hsla\\(${reN},${reP},${reP},${reN}\\)$`);
+
+  var named = {
+    aliceblue: 0xf0f8ff,
+    antiquewhite: 0xfaebd7,
+    aqua: 0x00ffff,
+    aquamarine: 0x7fffd4,
+    azure: 0xf0ffff,
+    beige: 0xf5f5dc,
+    bisque: 0xffe4c4,
+    black: 0x000000,
+    blanchedalmond: 0xffebcd,
+    blue: 0x0000ff,
+    blueviolet: 0x8a2be2,
+    brown: 0xa52a2a,
+    burlywood: 0xdeb887,
+    cadetblue: 0x5f9ea0,
+    chartreuse: 0x7fff00,
+    chocolate: 0xd2691e,
+    coral: 0xff7f50,
+    cornflowerblue: 0x6495ed,
+    cornsilk: 0xfff8dc,
+    crimson: 0xdc143c,
+    cyan: 0x00ffff,
+    darkblue: 0x00008b,
+    darkcyan: 0x008b8b,
+    darkgoldenrod: 0xb8860b,
+    darkgray: 0xa9a9a9,
+    darkgreen: 0x006400,
+    darkgrey: 0xa9a9a9,
+    darkkhaki: 0xbdb76b,
+    darkmagenta: 0x8b008b,
+    darkolivegreen: 0x556b2f,
+    darkorange: 0xff8c00,
+    darkorchid: 0x9932cc,
+    darkred: 0x8b0000,
+    darksalmon: 0xe9967a,
+    darkseagreen: 0x8fbc8f,
+    darkslateblue: 0x483d8b,
+    darkslategray: 0x2f4f4f,
+    darkslategrey: 0x2f4f4f,
+    darkturquoise: 0x00ced1,
+    darkviolet: 0x9400d3,
+    deeppink: 0xff1493,
+    deepskyblue: 0x00bfff,
+    dimgray: 0x696969,
+    dimgrey: 0x696969,
+    dodgerblue: 0x1e90ff,
+    firebrick: 0xb22222,
+    floralwhite: 0xfffaf0,
+    forestgreen: 0x228b22,
+    fuchsia: 0xff00ff,
+    gainsboro: 0xdcdcdc,
+    ghostwhite: 0xf8f8ff,
+    gold: 0xffd700,
+    goldenrod: 0xdaa520,
+    gray: 0x808080,
+    green: 0x008000,
+    greenyellow: 0xadff2f,
+    grey: 0x808080,
+    honeydew: 0xf0fff0,
+    hotpink: 0xff69b4,
+    indianred: 0xcd5c5c,
+    indigo: 0x4b0082,
+    ivory: 0xfffff0,
+    khaki: 0xf0e68c,
+    lavender: 0xe6e6fa,
+    lavenderblush: 0xfff0f5,
+    lawngreen: 0x7cfc00,
+    lemonchiffon: 0xfffacd,
+    lightblue: 0xadd8e6,
+    lightcoral: 0xf08080,
+    lightcyan: 0xe0ffff,
+    lightgoldenrodyellow: 0xfafad2,
+    lightgray: 0xd3d3d3,
+    lightgreen: 0x90ee90,
+    lightgrey: 0xd3d3d3,
+    lightpink: 0xffb6c1,
+    lightsalmon: 0xffa07a,
+    lightseagreen: 0x20b2aa,
+    lightskyblue: 0x87cefa,
+    lightslategray: 0x778899,
+    lightslategrey: 0x778899,
+    lightsteelblue: 0xb0c4de,
+    lightyellow: 0xffffe0,
+    lime: 0x00ff00,
+    limegreen: 0x32cd32,
+    linen: 0xfaf0e6,
+    magenta: 0xff00ff,
+    maroon: 0x800000,
+    mediumaquamarine: 0x66cdaa,
+    mediumblue: 0x0000cd,
+    mediumorchid: 0xba55d3,
+    mediumpurple: 0x9370db,
+    mediumseagreen: 0x3cb371,
+    mediumslateblue: 0x7b68ee,
+    mediumspringgreen: 0x00fa9a,
+    mediumturquoise: 0x48d1cc,
+    mediumvioletred: 0xc71585,
+    midnightblue: 0x191970,
+    mintcream: 0xf5fffa,
+    mistyrose: 0xffe4e1,
+    moccasin: 0xffe4b5,
+    navajowhite: 0xffdead,
+    navy: 0x000080,
+    oldlace: 0xfdf5e6,
+    olive: 0x808000,
+    olivedrab: 0x6b8e23,
+    orange: 0xffa500,
+    orangered: 0xff4500,
+    orchid: 0xda70d6,
+    palegoldenrod: 0xeee8aa,
+    palegreen: 0x98fb98,
+    paleturquoise: 0xafeeee,
+    palevioletred: 0xdb7093,
+    papayawhip: 0xffefd5,
+    peachpuff: 0xffdab9,
+    peru: 0xcd853f,
+    pink: 0xffc0cb,
+    plum: 0xdda0dd,
+    powderblue: 0xb0e0e6,
+    purple: 0x800080,
+    rebeccapurple: 0x663399,
+    red: 0xff0000,
+    rosybrown: 0xbc8f8f,
+    royalblue: 0x4169e1,
+    saddlebrown: 0x8b4513,
+    salmon: 0xfa8072,
+    sandybrown: 0xf4a460,
+    seagreen: 0x2e8b57,
+    seashell: 0xfff5ee,
+    sienna: 0xa0522d,
+    silver: 0xc0c0c0,
+    skyblue: 0x87ceeb,
+    slateblue: 0x6a5acd,
+    slategray: 0x708090,
+    slategrey: 0x708090,
+    snow: 0xfffafa,
+    springgreen: 0x00ff7f,
+    steelblue: 0x4682b4,
+    tan: 0xd2b48c,
+    teal: 0x008080,
+    thistle: 0xd8bfd8,
+    tomato: 0xff6347,
+    turquoise: 0x40e0d0,
+    violet: 0xee82ee,
+    wheat: 0xf5deb3,
+    white: 0xffffff,
+    whitesmoke: 0xf5f5f5,
+    yellow: 0xffff00,
+    yellowgreen: 0x9acd32
+  };
+
+  define(Color, color, {
+    copy(channels) {
+      return Object.assign(new this.constructor, this, channels);
+    },
+    displayable() {
+      return this.rgb().displayable();
+    },
+    hex: color_formatHex, // Deprecated! Use color.formatHex.
+    formatHex: color_formatHex,
+    formatHex8: color_formatHex8,
+    formatHsl: color_formatHsl,
+    formatRgb: color_formatRgb,
+    toString: color_formatRgb
+  });
+
+  function color_formatHex() {
+    return this.rgb().formatHex();
+  }
+
+  function color_formatHex8() {
+    return this.rgb().formatHex8();
+  }
+
+  function color_formatHsl() {
+    return hslConvert(this).formatHsl();
+  }
+
+  function color_formatRgb() {
+    return this.rgb().formatRgb();
+  }
+
+  function color(format) {
+    var m, l;
+    format = (format + "").trim().toLowerCase();
+    return (m = reHex.exec(format)) ? (l = m[1].length, m = parseInt(m[1], 16), l === 6 ? rgbn(m) // #ff0000
+        : l === 3 ? new Rgb((m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), ((m & 0xf) << 4) | (m & 0xf), 1) // #f00
+        : l === 8 ? rgba(m >> 24 & 0xff, m >> 16 & 0xff, m >> 8 & 0xff, (m & 0xff) / 0xff) // #ff000000
+        : l === 4 ? rgba((m >> 12 & 0xf) | (m >> 8 & 0xf0), (m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), (((m & 0xf) << 4) | (m & 0xf)) / 0xff) // #f000
+        : null) // invalid hex
+        : (m = reRgbInteger.exec(format)) ? new Rgb(m[1], m[2], m[3], 1) // rgb(255, 0, 0)
+        : (m = reRgbPercent.exec(format)) ? new Rgb(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, 1) // rgb(100%, 0%, 0%)
+        : (m = reRgbaInteger.exec(format)) ? rgba(m[1], m[2], m[3], m[4]) // rgba(255, 0, 0, 1)
+        : (m = reRgbaPercent.exec(format)) ? rgba(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, m[4]) // rgb(100%, 0%, 0%, 1)
+        : (m = reHslPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, 1) // hsl(120, 50%, 50%)
+        : (m = reHslaPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, m[4]) // hsla(120, 50%, 50%, 1)
+        : named.hasOwnProperty(format) ? rgbn(named[format]) // eslint-disable-line no-prototype-builtins
+        : format === "transparent" ? new Rgb(NaN, NaN, NaN, 0)
+        : null;
+  }
+
+  function rgbn(n) {
+    return new Rgb(n >> 16 & 0xff, n >> 8 & 0xff, n & 0xff, 1);
+  }
+
+  function rgba(r, g, b, a) {
+    if (a <= 0) r = g = b = NaN;
+    return new Rgb(r, g, b, a);
+  }
+
+  function rgbConvert(o) {
+    if (!(o instanceof Color)) o = color(o);
+    if (!o) return new Rgb;
+    o = o.rgb();
+    return new Rgb(o.r, o.g, o.b, o.opacity);
+  }
+
+  function rgb$1(r, g, b, opacity) {
+    return arguments.length === 1 ? rgbConvert(r) : new Rgb(r, g, b, opacity == null ? 1 : opacity);
+  }
+
+  function Rgb(r, g, b, opacity) {
+    this.r = +r;
+    this.g = +g;
+    this.b = +b;
+    this.opacity = +opacity;
+  }
+
+  define(Rgb, rgb$1, extend(Color, {
+    brighter(k) {
+      k = k == null ? brighter : Math.pow(brighter, k);
+      return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+    },
+    darker(k) {
+      k = k == null ? darker : Math.pow(darker, k);
+      return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);
+    },
+    rgb() {
+      return this;
+    },
+    clamp() {
+      return new Rgb(clampi(this.r), clampi(this.g), clampi(this.b), clampa(this.opacity));
+    },
+    displayable() {
+      return (-0.5 <= this.r && this.r < 255.5)
+          && (-0.5 <= this.g && this.g < 255.5)
+          && (-0.5 <= this.b && this.b < 255.5)
+          && (0 <= this.opacity && this.opacity <= 1);
+    },
+    hex: rgb_formatHex, // Deprecated! Use color.formatHex.
+    formatHex: rgb_formatHex,
+    formatHex8: rgb_formatHex8,
+    formatRgb: rgb_formatRgb,
+    toString: rgb_formatRgb
+  }));
+
+  function rgb_formatHex() {
+    return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}`;
+  }
+
+  function rgb_formatHex8() {
+    return `#${hex(this.r)}${hex(this.g)}${hex(this.b)}${hex((isNaN(this.opacity) ? 1 : this.opacity) * 255)}`;
+  }
+
+  function rgb_formatRgb() {
+    const a = clampa(this.opacity);
+    return `${a === 1 ? "rgb(" : "rgba("}${clampi(this.r)}, ${clampi(this.g)}, ${clampi(this.b)}${a === 1 ? ")" : `, ${a})`}`;
+  }
+
+  function clampa(opacity) {
+    return isNaN(opacity) ? 1 : Math.max(0, Math.min(1, opacity));
+  }
+
+  function clampi(value) {
+    return Math.max(0, Math.min(255, Math.round(value) || 0));
+  }
+
+  function hex(value) {
+    value = clampi(value);
+    return (value < 16 ? "0" : "") + value.toString(16);
+  }
+
+  function hsla(h, s, l, a) {
+    if (a <= 0) h = s = l = NaN;
+    else if (l <= 0 || l >= 1) h = s = NaN;
+    else if (s <= 0) h = NaN;
+    return new Hsl(h, s, l, a);
+  }
+
+  function hslConvert(o) {
+    if (o instanceof Hsl) return new Hsl(o.h, o.s, o.l, o.opacity);
+    if (!(o instanceof Color)) o = color(o);
+    if (!o) return new Hsl;
+    if (o instanceof Hsl) return o;
+    o = o.rgb();
+    var r = o.r / 255,
+        g = o.g / 255,
+        b = o.b / 255,
+        min = Math.min(r, g, b),
+        max = Math.max(r, g, b),
+        h = NaN,
+        s = max - min,
+        l = (max + min) / 2;
+    if (s) {
+      if (r === max) h = (g - b) / s + (g < b) * 6;
+      else if (g === max) h = (b - r) / s + 2;
+      else h = (r - g) / s + 4;
+      s /= l < 0.5 ? max + min : 2 - max - min;
+      h *= 60;
+    } else {
+      s = l > 0 && l < 1 ? 0 : h;
+    }
+    return new Hsl(h, s, l, o.opacity);
+  }
+
+  function hsl(h, s, l, opacity) {
+    return arguments.length === 1 ? hslConvert(h) : new Hsl(h, s, l, opacity == null ? 1 : opacity);
+  }
+
+  function Hsl(h, s, l, opacity) {
+    this.h = +h;
+    this.s = +s;
+    this.l = +l;
+    this.opacity = +opacity;
+  }
+
+  define(Hsl, hsl, extend(Color, {
+    brighter(k) {
+      k = k == null ? brighter : Math.pow(brighter, k);
+      return new Hsl(this.h, this.s, this.l * k, this.opacity);
+    },
+    darker(k) {
+      k = k == null ? darker : Math.pow(darker, k);
+      return new Hsl(this.h, this.s, this.l * k, this.opacity);
+    },
+    rgb() {
+      var h = this.h % 360 + (this.h < 0) * 360,
+          s = isNaN(h) || isNaN(this.s) ? 0 : this.s,
+          l = this.l,
+          m2 = l + (l < 0.5 ? l : 1 - l) * s,
+          m1 = 2 * l - m2;
+      return new Rgb(
+        hsl2rgb(h >= 240 ? h - 240 : h + 120, m1, m2),
+        hsl2rgb(h, m1, m2),
+        hsl2rgb(h < 120 ? h + 240 : h - 120, m1, m2),
+        this.opacity
+      );
+    },
+    clamp() {
+      return new Hsl(clamph(this.h), clampt(this.s), clampt(this.l), clampa(this.opacity));
+    },
+    displayable() {
+      return (0 <= this.s && this.s <= 1 || isNaN(this.s))
+          && (0 <= this.l && this.l <= 1)
+          && (0 <= this.opacity && this.opacity <= 1);
+    },
+    formatHsl() {
+      const a = clampa(this.opacity);
+      return `${a === 1 ? "hsl(" : "hsla("}${clamph(this.h)}, ${clampt(this.s) * 100}%, ${clampt(this.l) * 100}%${a === 1 ? ")" : `, ${a})`}`;
+    }
+  }));
+
+  function clamph(value) {
+    value = (value || 0) % 360;
+    return value < 0 ? value + 360 : value;
+  }
+
+  function clampt(value) {
+    return Math.max(0, Math.min(1, value || 0));
+  }
+
+  /* From FvD 13.37, CSS Color Module Level 3 */
+  function hsl2rgb(h, m1, m2) {
+    return (h < 60 ? m1 + (m2 - m1) * h / 60
+        : h < 180 ? m2
+        : h < 240 ? m1 + (m2 - m1) * (240 - h) / 60
+        : m1) * 255;
+  }
+
+  var constant = x => () => x;
+
+  function linear$1(a, d) {
+    return function(t) {
+      return a + t * d;
+    };
+  }
+
+  function exponential(a, b, y) {
+    return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {
+      return Math.pow(a + t * b, y);
+    };
+  }
+
+  function gamma(y) {
+    return (y = +y) === 1 ? nogamma : function(a, b) {
+      return b - a ? exponential(a, b, y) : constant(isNaN(a) ? b : a);
+    };
+  }
+
+  function nogamma(a, b) {
+    var d = b - a;
+    return d ? linear$1(a, d) : constant(isNaN(a) ? b : a);
+  }
+
+  var rgb = (function rgbGamma(y) {
+    var color = gamma(y);
+
+    function rgb(start, end) {
+      var r = color((start = rgb$1(start)).r, (end = rgb$1(end)).r),
+          g = color(start.g, end.g),
+          b = color(start.b, end.b),
+          opacity = nogamma(start.opacity, end.opacity);
+      return function(t) {
+        start.r = r(t);
+        start.g = g(t);
+        start.b = b(t);
+        start.opacity = opacity(t);
+        return start + "";
+      };
+    }
+
+    rgb.gamma = rgbGamma;
+
+    return rgb;
+  })(1);
+
+  function numberArray(a, b) {
+    if (!b) b = [];
+    var n = a ? Math.min(b.length, a.length) : 0,
+        c = b.slice(),
+        i;
+    return function(t) {
+      for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;
+      return c;
+    };
+  }
+
+  function isNumberArray(x) {
+    return ArrayBuffer.isView(x) && !(x instanceof DataView);
+  }
+
+  function genericArray(a, b) {
+    var nb = b ? b.length : 0,
+        na = a ? Math.min(nb, a.length) : 0,
+        x = new Array(na),
+        c = new Array(nb),
+        i;
+
+    for (i = 0; i < na; ++i) x[i] = interpolate(a[i], b[i]);
+    for (; i < nb; ++i) c[i] = b[i];
+
+    return function(t) {
+      for (i = 0; i < na; ++i) c[i] = x[i](t);
+      return c;
+    };
+  }
+
+  function date(a, b) {
+    var d = new Date;
+    return a = +a, b = +b, function(t) {
+      return d.setTime(a * (1 - t) + b * t), d;
+    };
+  }
+
+  function interpolateNumber(a, b) {
+    return a = +a, b = +b, function(t) {
+      return a * (1 - t) + b * t;
+    };
+  }
+
+  function object(a, b) {
+    var i = {},
+        c = {},
+        k;
+
+    if (a === null || typeof a !== "object") a = {};
+    if (b === null || typeof b !== "object") b = {};
+
+    for (k in b) {
+      if (k in a) {
+        i[k] = interpolate(a[k], b[k]);
+      } else {
+        c[k] = b[k];
+      }
+    }
+
+    return function(t) {
+      for (k in i) c[k] = i[k](t);
+      return c;
+    };
+  }
+
+  var reA = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,
+      reB = new RegExp(reA.source, "g");
+
+  function zero(b) {
+    return function() {
+      return b;
+    };
+  }
+
+  function one(b) {
+    return function(t) {
+      return b(t) + "";
+    };
+  }
+
+  function string(a, b) {
+    var bi = reA.lastIndex = reB.lastIndex = 0, // scan index for next number in b
+        am, // current match in a
+        bm, // current match in b
+        bs, // string preceding current number in b, if any
+        i = -1, // index in s
+        s = [], // string constants and placeholders
+        q = []; // number interpolators
+
+    // Coerce inputs to strings.
+    a = a + "", b = b + "";
+
+    // Interpolate pairs of numbers in a & b.
+    while ((am = reA.exec(a))
+        && (bm = reB.exec(b))) {
+      if ((bs = bm.index) > bi) { // a string precedes the next number in b
+        bs = b.slice(bi, bs);
+        if (s[i]) s[i] += bs; // coalesce with previous string
+        else s[++i] = bs;
+      }
+      if ((am = am[0]) === (bm = bm[0])) { // numbers in a & b match
+        if (s[i]) s[i] += bm; // coalesce with previous string
+        else s[++i] = bm;
+      } else { // interpolate non-matching numbers
+        s[++i] = null;
+        q.push({i: i, x: interpolateNumber(am, bm)});
+      }
+      bi = reB.lastIndex;
+    }
+
+    // Add remains of b.
+    if (bi < b.length) {
+      bs = b.slice(bi);
+      if (s[i]) s[i] += bs; // coalesce with previous string
+      else s[++i] = bs;
+    }
+
+    // Special optimization for only a single match.
+    // Otherwise, interpolate each of the numbers and rejoin the string.
+    return s.length < 2 ? (q[0]
+        ? one(q[0].x)
+        : zero(b))
+        : (b = q.length, function(t) {
+            for (var i = 0, o; i < b; ++i) s[(o = q[i]).i] = o.x(t);
+            return s.join("");
+          });
+  }
+
+  function interpolate(a, b) {
+    var t = typeof b, c;
+    return b == null || t === "boolean" ? constant(b)
+        : (t === "number" ? interpolateNumber
+        : t === "string" ? ((c = color(b)) ? (b = c, rgb) : string)
+        : b instanceof color ? rgb
+        : b instanceof Date ? date
+        : isNumberArray(b) ? numberArray
+        : Array.isArray(b) ? genericArray
+        : typeof b.valueOf !== "function" && typeof b.toString !== "function" || isNaN(b) ? object
+        : interpolateNumber)(a, b);
+  }
+
+  function interpolateRound(a, b) {
+    return a = +a, b = +b, function(t) {
+      return Math.round(a * (1 - t) + b * t);
+    };
+  }
+
+  function constants(x) {
+    return function() {
+      return x;
+    };
+  }
+
+  function number(x) {
+    return +x;
+  }
+
+  var unit = [0, 1];
+
+  function identity$1(x) {
+    return x;
+  }
+
+  function normalize(a, b) {
+    return (b -= (a = +a))
+        ? function(x) { return (x - a) / b; }
+        : constants(isNaN(b) ? NaN : 0.5);
+  }
+
+  function clamper(a, b) {
+    var t;
+    if (a > b) t = a, a = b, b = t;
+    return function(x) { return Math.max(a, Math.min(b, x)); };
+  }
+
+  // normalize(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1].
+  // interpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding range value x in [a,b].
+  function bimap(domain, range, interpolate) {
+    var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];
+    if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);
+    else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);
+    return function(x) { return r0(d0(x)); };
+  }
+
+  function polymap(domain, range, interpolate) {
+    var j = Math.min(domain.length, range.length) - 1,
+        d = new Array(j),
+        r = new Array(j),
+        i = -1;
+
+    // Reverse descending domains.
+    if (domain[j] < domain[0]) {
+      domain = domain.slice().reverse();
+      range = range.slice().reverse();
+    }
+
+    while (++i < j) {
+      d[i] = normalize(domain[i], domain[i + 1]);
+      r[i] = interpolate(range[i], range[i + 1]);
+    }
+
+    return function(x) {
+      var i = bisect(domain, x, 1, j) - 1;
+      return r[i](d[i](x));
+    };
+  }
+
+  function copy$1(source, target) {
+    return target
+        .domain(source.domain())
+        .range(source.range())
+        .interpolate(source.interpolate())
+        .clamp(source.clamp())
+        .unknown(source.unknown());
+  }
+
+  function transformer$1() {
+    var domain = unit,
+        range = unit,
+        interpolate$1 = interpolate,
+        transform,
+        untransform,
+        unknown,
+        clamp = identity$1,
+        piecewise,
+        output,
+        input;
+
+    function rescale() {
+      var n = Math.min(domain.length, range.length);
+      if (clamp !== identity$1) clamp = clamper(domain[0], domain[n - 1]);
+      piecewise = n > 2 ? polymap : bimap;
+      output = input = null;
+      return scale;
+    }
+
+    function scale(x) {
+      return x == null || isNaN(x = +x) ? unknown : (output || (output = piecewise(domain.map(transform), range, interpolate$1)))(transform(clamp(x)));
+    }
+
+    scale.invert = function(y) {
+      return clamp(untransform((input || (input = piecewise(range, domain.map(transform), interpolateNumber)))(y)));
+    };
+
+    scale.domain = function(_) {
+      return arguments.length ? (domain = Array.from(_, number), rescale()) : domain.slice();
+    };
+
+    scale.range = function(_) {
+      return arguments.length ? (range = Array.from(_), rescale()) : range.slice();
+    };
+
+    scale.rangeRound = function(_) {
+      return range = Array.from(_), interpolate$1 = interpolateRound, rescale();
+    };
+
+    scale.clamp = function(_) {
+      return arguments.length ? (clamp = _ ? true : identity$1, rescale()) : clamp !== identity$1;
+    };
+
+    scale.interpolate = function(_) {
+      return arguments.length ? (interpolate$1 = _, rescale()) : interpolate$1;
+    };
+
+    scale.unknown = function(_) {
+      return arguments.length ? (unknown = _, scale) : unknown;
+    };
+
+    return function(t, u) {
+      transform = t, untransform = u;
+      return rescale();
+    };
+  }
+
+  function continuous() {
+    return transformer$1()(identity$1, identity$1);
+  }
+
+  function formatDecimal(x) {
+    return Math.abs(x = Math.round(x)) >= 1e21
+        ? x.toLocaleString("en").replace(/,/g, "")
+        : x.toString(10);
+  }
+
+  // Computes the decimal coefficient and exponent of the specified number x with
+  // significant digits p, where x is positive and p is in [1, 21] or undefined.
+  // For example, formatDecimalParts(1.23) returns ["123", 0].
+  function formatDecimalParts(x, p) {
+    if ((i = (x = p ? x.toExponential(p - 1) : x.toExponential()).indexOf("e")) < 0) return null; // NaN, ±Infinity
+    var i, coefficient = x.slice(0, i);
+
+    // The string returned by toExponential either has the form \d\.\d+e[-+]\d+
+    // (e.g., 1.2e+3) or the form \de[-+]\d+ (e.g., 1e+3).
+    return [
+      coefficient.length > 1 ? coefficient[0] + coefficient.slice(2) : coefficient,
+      +x.slice(i + 1)
+    ];
+  }
+
+  function exponent(x) {
+    return x = formatDecimalParts(Math.abs(x)), x ? x[1] : NaN;
+  }
+
+  function formatGroup(grouping, thousands) {
+    return function(value, width) {
+      var i = value.length,
+          t = [],
+          j = 0,
+          g = grouping[0],
+          length = 0;
+
+      while (i > 0 && g > 0) {
+        if (length + g + 1 > width) g = Math.max(1, width - length);
+        t.push(value.substring(i -= g, i + g));
+        if ((length += g + 1) > width) break;
+        g = grouping[j = (j + 1) % grouping.length];
+      }
+
+      return t.reverse().join(thousands);
+    };
+  }
+
+  function formatNumerals(numerals) {
+    return function(value) {
+      return value.replace(/[0-9]/g, function(i) {
+        return numerals[+i];
+      });
+    };
+  }
+
+  // [[fill]align][sign][symbol][0][width][,][.precision][~][type]
+  var re = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+
+  function formatSpecifier(specifier) {
+    if (!(match = re.exec(specifier))) throw new Error("invalid format: " + specifier);
+    var match;
+    return new FormatSpecifier({
+      fill: match[1],
+      align: match[2],
+      sign: match[3],
+      symbol: match[4],
+      zero: match[5],
+      width: match[6],
+      comma: match[7],
+      precision: match[8] && match[8].slice(1),
+      trim: match[9],
+      type: match[10]
+    });
+  }
+
+  formatSpecifier.prototype = FormatSpecifier.prototype; // instanceof
+
+  function FormatSpecifier(specifier) {
+    this.fill = specifier.fill === undefined ? " " : specifier.fill + "";
+    this.align = specifier.align === undefined ? ">" : specifier.align + "";
+    this.sign = specifier.sign === undefined ? "-" : specifier.sign + "";
+    this.symbol = specifier.symbol === undefined ? "" : specifier.symbol + "";
+    this.zero = !!specifier.zero;
+    this.width = specifier.width === undefined ? undefined : +specifier.width;
+    this.comma = !!specifier.comma;
+    this.precision = specifier.precision === undefined ? undefined : +specifier.precision;
+    this.trim = !!specifier.trim;
+    this.type = specifier.type === undefined ? "" : specifier.type + "";
+  }
+
+  FormatSpecifier.prototype.toString = function() {
+    return this.fill
+        + this.align
+        + this.sign
+        + this.symbol
+        + (this.zero ? "0" : "")
+        + (this.width === undefined ? "" : Math.max(1, this.width | 0))
+        + (this.comma ? "," : "")
+        + (this.precision === undefined ? "" : "." + Math.max(0, this.precision | 0))
+        + (this.trim ? "~" : "")
+        + this.type;
+  };
+
+  // Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.
+  function formatTrim(s) {
+    out: for (var n = s.length, i = 1, i0 = -1, i1; i < n; ++i) {
+      switch (s[i]) {
+        case ".": i0 = i1 = i; break;
+        case "0": if (i0 === 0) i0 = i; i1 = i; break;
+        default: if (!+s[i]) break out; if (i0 > 0) i0 = 0; break;
+      }
+    }
+    return i0 > 0 ? s.slice(0, i0) + s.slice(i1 + 1) : s;
+  }
+
+  var prefixExponent;
+
+  function formatPrefixAuto(x, p) {
+    var d = formatDecimalParts(x, p);
+    if (!d) return x + "";
+    var coefficient = d[0],
+        exponent = d[1],
+        i = exponent - (prefixExponent = Math.max(-8, Math.min(8, Math.floor(exponent / 3))) * 3) + 1,
+        n = coefficient.length;
+    return i === n ? coefficient
+        : i > n ? coefficient + new Array(i - n + 1).join("0")
+        : i > 0 ? coefficient.slice(0, i) + "." + coefficient.slice(i)
+        : "0." + new Array(1 - i).join("0") + formatDecimalParts(x, Math.max(0, p + i - 1))[0]; // less than 1y!
+  }
+
+  function formatRounded(x, p) {
+    var d = formatDecimalParts(x, p);
+    if (!d) return x + "";
+    var coefficient = d[0],
+        exponent = d[1];
+    return exponent < 0 ? "0." + new Array(-exponent).join("0") + coefficient
+        : coefficient.length > exponent + 1 ? coefficient.slice(0, exponent + 1) + "." + coefficient.slice(exponent + 1)
+        : coefficient + new Array(exponent - coefficient.length + 2).join("0");
+  }
+
+  var formatTypes = {
+    "%": (x, p) => (x * 100).toFixed(p),
+    "b": (x) => Math.round(x).toString(2),
+    "c": (x) => x + "",
+    "d": formatDecimal,
+    "e": (x, p) => x.toExponential(p),
+    "f": (x, p) => x.toFixed(p),
+    "g": (x, p) => x.toPrecision(p),
+    "o": (x) => Math.round(x).toString(8),
+    "p": (x, p) => formatRounded(x * 100, p),
+    "r": formatRounded,
+    "s": formatPrefixAuto,
+    "X": (x) => Math.round(x).toString(16).toUpperCase(),
+    "x": (x) => Math.round(x).toString(16)
+  };
+
+  function identity(x) {
+    return x;
+  }
+
+  var map = Array.prototype.map,
+      prefixes = ["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"];
+
+  function formatLocale(locale) {
+    var group = locale.grouping === undefined || locale.thousands === undefined ? identity : formatGroup(map.call(locale.grouping, Number), locale.thousands + ""),
+        currencyPrefix = locale.currency === undefined ? "" : locale.currency[0] + "",
+        currencySuffix = locale.currency === undefined ? "" : locale.currency[1] + "",
+        decimal = locale.decimal === undefined ? "." : locale.decimal + "",
+        numerals = locale.numerals === undefined ? identity : formatNumerals(map.call(locale.numerals, String)),
+        percent = locale.percent === undefined ? "%" : locale.percent + "",
+        minus = locale.minus === undefined ? "−" : locale.minus + "",
+        nan = locale.nan === undefined ? "NaN" : locale.nan + "";
+
+    function newFormat(specifier) {
+      specifier = formatSpecifier(specifier);
+
+      var fill = specifier.fill,
+          align = specifier.align,
+          sign = specifier.sign,
+          symbol = specifier.symbol,
+          zero = specifier.zero,
+          width = specifier.width,
+          comma = specifier.comma,
+          precision = specifier.precision,
+          trim = specifier.trim,
+          type = specifier.type;
+
+      // The "n" type is an alias for ",g".
+      if (type === "n") comma = true, type = "g";
+
+      // The "" type, and any invalid type, is an alias for ".12~g".
+      else if (!formatTypes[type]) precision === undefined && (precision = 12), trim = true, type = "g";
+
+      // If zero fill is specified, padding goes after sign and before digits.
+      if (zero || (fill === "0" && align === "=")) zero = true, fill = "0", align = "=";
+
+      // Compute the prefix and suffix.
+      // For SI-prefix, the suffix is lazily computed.
+      var prefix = symbol === "$" ? currencyPrefix : symbol === "#" && /[boxX]/.test(type) ? "0" + type.toLowerCase() : "",
+          suffix = symbol === "$" ? currencySuffix : /[%p]/.test(type) ? percent : "";
+
+      // What format function should we use?
+      // Is this an integer type?
+      // Can this type generate exponential notation?
+      var formatType = formatTypes[type],
+          maybeSuffix = /[defgprs%]/.test(type);
+
+      // Set the default precision if not specified,
+      // or clamp the specified precision to the supported range.
+      // For significant precision, it must be in [1, 21].
+      // For fixed precision, it must be in [0, 20].
+      precision = precision === undefined ? 6
+          : /[gprs]/.test(type) ? Math.max(1, Math.min(21, precision))
+          : Math.max(0, Math.min(20, precision));
+
+      function format(value) {
+        var valuePrefix = prefix,
+            valueSuffix = suffix,
+            i, n, c;
+
+        if (type === "c") {
+          valueSuffix = formatType(value) + valueSuffix;
+          value = "";
+        } else {
+          value = +value;
+
+          // Determine the sign. -0 is not less than 0, but 1 / -0 is!
+          var valueNegative = value < 0 || 1 / value < 0;
+
+          // Perform the initial formatting.
+          value = isNaN(value) ? nan : formatType(Math.abs(value), precision);
+
+          // Trim insignificant zeros.
+          if (trim) value = formatTrim(value);
+
+          // If a negative value rounds to zero after formatting, and no explicit positive sign is requested, hide the sign.
+          if (valueNegative && +value === 0 && sign !== "+") valueNegative = false;
+
+          // Compute the prefix and suffix.
+          valuePrefix = (valueNegative ? (sign === "(" ? sign : minus) : sign === "-" || sign === "(" ? "" : sign) + valuePrefix;
+          valueSuffix = (type === "s" ? prefixes[8 + prefixExponent / 3] : "") + valueSuffix + (valueNegative && sign === "(" ? ")" : "");
+
+          // Break the formatted value into the integer “value” part that can be
+          // grouped, and fractional or exponential “suffix” part that is not.
+          if (maybeSuffix) {
+            i = -1, n = value.length;
+            while (++i < n) {
+              if (c = value.charCodeAt(i), 48 > c || c > 57) {
+                valueSuffix = (c === 46 ? decimal + value.slice(i + 1) : value.slice(i)) + valueSuffix;
+                value = value.slice(0, i);
+                break;
+              }
+            }
+          }
+        }
+
+        // If the fill character is not "0", grouping is applied before padding.
+        if (comma && !zero) value = group(value, Infinity);
+
+        // Compute the padding.
+        var length = valuePrefix.length + value.length + valueSuffix.length,
+            padding = length < width ? new Array(width - length + 1).join(fill) : "";
+
+        // If the fill character is "0", grouping is applied after padding.
+        if (comma && zero) value = group(padding + value, padding.length ? width - valueSuffix.length : Infinity), padding = "";
+
+        // Reconstruct the final output based on the desired alignment.
+        switch (align) {
+          case "<": value = valuePrefix + value + valueSuffix + padding; break;
+          case "=": value = valuePrefix + padding + value + valueSuffix; break;
+          case "^": value = padding.slice(0, length = padding.length >> 1) + valuePrefix + value + valueSuffix + padding.slice(length); break;
+          default: value = padding + valuePrefix + value + valueSuffix; break;
+        }
+
+        return numerals(value);
+      }
+
+      format.toString = function() {
+        return specifier + "";
+      };
+
+      return format;
+    }
+
+    function formatPrefix(specifier, value) {
+      var f = newFormat((specifier = formatSpecifier(specifier), specifier.type = "f", specifier)),
+          e = Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3,
+          k = Math.pow(10, -e),
+          prefix = prefixes[8 + e / 3];
+      return function(value) {
+        return f(k * value) + prefix;
+      };
+    }
+
+    return {
+      format: newFormat,
+      formatPrefix: formatPrefix
+    };
+  }
+
+  var locale;
+  var format;
+  var formatPrefix;
+
+  defaultLocale({
+    thousands: ",",
+    grouping: [3],
+    currency: ["$", ""]
+  });
+
+  function defaultLocale(definition) {
+    locale = formatLocale(definition);
+    format = locale.format;
+    formatPrefix = locale.formatPrefix;
+    return locale;
+  }
+
+  function precisionFixed(step) {
+    return Math.max(0, -exponent(Math.abs(step)));
+  }
+
+  function precisionPrefix(step, value) {
+    return Math.max(0, Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3 - exponent(Math.abs(step)));
+  }
+
+  function precisionRound(step, max) {
+    step = Math.abs(step), max = Math.abs(max) - step;
+    return Math.max(0, exponent(max) - exponent(step)) + 1;
+  }
+
+  function tickFormat(start, stop, count, specifier) {
+    var step = tickStep(start, stop, count),
+        precision;
+    specifier = formatSpecifier(specifier == null ? ",f" : specifier);
+    switch (specifier.type) {
+      case "s": {
+        var value = Math.max(Math.abs(start), Math.abs(stop));
+        if (specifier.precision == null && !isNaN(precision = precisionPrefix(step, value))) specifier.precision = precision;
+        return formatPrefix(specifier, value);
+      }
+      case "":
+      case "e":
+      case "g":
+      case "p":
+      case "r": {
+        if (specifier.precision == null && !isNaN(precision = precisionRound(step, Math.max(Math.abs(start), Math.abs(stop))))) specifier.precision = precision - (specifier.type === "e");
+        break;
+      }
+      case "f":
+      case "%": {
+        if (specifier.precision == null && !isNaN(precision = precisionFixed(step))) specifier.precision = precision - (specifier.type === "%") * 2;
+        break;
+      }
+    }
+    return format(specifier);
+  }
+
+  function linearish(scale) {
+    var domain = scale.domain;
+
+    scale.ticks = function(count) {
+      var d = domain();
+      return ticks(d[0], d[d.length - 1], count == null ? 10 : count);
+    };
+
+    scale.tickFormat = function(count, specifier) {
+      var d = domain();
+      return tickFormat(d[0], d[d.length - 1], count == null ? 10 : count, specifier);
+    };
+
+    scale.nice = function(count) {
+      if (count == null) count = 10;
+
+      var d = domain();
+      var i0 = 0;
+      var i1 = d.length - 1;
+      var start = d[i0];
+      var stop = d[i1];
+      var prestep;
+      var step;
+      var maxIter = 10;
+
+      if (stop < start) {
+        step = start, start = stop, stop = step;
+        step = i0, i0 = i1, i1 = step;
+      }
+      
+      while (maxIter-- > 0) {
+        step = tickIncrement(start, stop, count);
+        if (step === prestep) {
+          d[i0] = start;
+          d[i1] = stop;
+          return domain(d);
+        } else if (step > 0) {
+          start = Math.floor(start / step) * step;
+          stop = Math.ceil(stop / step) * step;
+        } else if (step < 0) {
+          start = Math.ceil(start * step) / step;
+          stop = Math.floor(stop * step) / step;
+        } else {
+          break;
+        }
+        prestep = step;
+      }
+
+      return scale;
+    };
+
+    return scale;
+  }
+
+  function linear() {
+    var scale = continuous();
+
+    scale.copy = function() {
+      return copy$1(scale, linear());
+    };
+
+    initRange.apply(scale, arguments);
+
+    return linearish(scale);
+  }
+
+  function transformer() {
+    var x0 = 0,
+        x1 = 1,
+        t0,
+        t1,
+        k10,
+        transform,
+        interpolator = identity$1,
+        clamp = false,
+        unknown;
+
+    function scale(x) {
+      return x == null || isNaN(x = +x) ? unknown : interpolator(k10 === 0 ? 0.5 : (x = (transform(x) - t0) * k10, clamp ? Math.max(0, Math.min(1, x)) : x));
+    }
+
+    scale.domain = function(_) {
+      return arguments.length ? ([x0, x1] = _, t0 = transform(x0 = +x0), t1 = transform(x1 = +x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0), scale) : [x0, x1];
+    };
+
+    scale.clamp = function(_) {
+      return arguments.length ? (clamp = !!_, scale) : clamp;
+    };
+
+    scale.interpolator = function(_) {
+      return arguments.length ? (interpolator = _, scale) : interpolator;
+    };
+
+    function range(interpolate) {
+      return function(_) {
+        var r0, r1;
+        return arguments.length ? ([r0, r1] = _, interpolator = interpolate(r0, r1), scale) : [interpolator(0), interpolator(1)];
+      };
+    }
+
+    scale.range = range(interpolate);
+
+    scale.rangeRound = range(interpolateRound);
+
+    scale.unknown = function(_) {
+      return arguments.length ? (unknown = _, scale) : unknown;
+    };
+
+    return function(t) {
+      transform = t, t0 = t(x0), t1 = t(x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0);
+      return scale;
+    };
+  }
+
+  function copy(source, target) {
+    return target
+        .domain(source.domain())
+        .interpolator(source.interpolator())
+        .clamp(source.clamp())
+        .unknown(source.unknown());
+  }
+
+  function sequential() {
+    var scale = linearish(transformer()(identity$1));
+
+    scale.copy = function() {
+      return copy(scale, sequential());
+    };
+
+    return initInterpolator.apply(scale, arguments);
+  }
+
+  const COLOR_BASE = "#cecece";
+
+  // https://www.w3.org/TR/WCAG20/#relativeluminancedef
+  const rc = 0.2126;
+  const gc = 0.7152;
+  const bc = 0.0722;
+  // low-gamma adjust coefficient
+  const lowc = 1 / 12.92;
+  function adjustGamma(p) {
+      return Math.pow((p + 0.055) / 1.055, 2.4);
+  }
+  function relativeLuminance(o) {
+      const rsrgb = o.r / 255;
+      const gsrgb = o.g / 255;
+      const bsrgb = o.b / 255;
+      const r = rsrgb <= 0.03928 ? rsrgb * lowc : adjustGamma(rsrgb);
+      const g = gsrgb <= 0.03928 ? gsrgb * lowc : adjustGamma(gsrgb);
+      const b = bsrgb <= 0.03928 ? bsrgb * lowc : adjustGamma(bsrgb);
+      return r * rc + g * gc + b * bc;
+  }
+  const createRainbowColor = (root) => {
+      const colorParentMap = new Map();
+      colorParentMap.set(root, COLOR_BASE);
+      if (root.children != null) {
+          const colorScale = sequential([0, root.children.length], (n) => hsl(360 * n, 0.3, 0.85));
+          root.children.forEach((c, id) => {
+              colorParentMap.set(c, colorScale(id).toString());
+          });
+      }
+      const colorMap = new Map();
+      const lightScale = linear().domain([0, root.height]).range([0.9, 0.3]);
+      const getBackgroundColor = (node) => {
+          const parents = node.ancestors();
+          const colorStr = parents.length === 1
+              ? colorParentMap.get(parents[0])
+              : colorParentMap.get(parents[parents.length - 2]);
+          const hslColor = hsl(colorStr);
+          hslColor.l = lightScale(node.depth);
+          return hslColor;
+      };
+      return (node) => {
+          if (!colorMap.has(node)) {
+              const backgroundColor = getBackgroundColor(node);
+              const l = relativeLuminance(backgroundColor.rgb());
+              const fontColor = l > 0.19 ? "#000" : "#fff";
+              colorMap.set(node, {
+                  backgroundColor: backgroundColor.toString(),
+                  fontColor,
+              });
+          }
+          return colorMap.get(node);
+      };
+  };
+
+  const StaticContext = F$1({});
+  const drawChart = (parentNode, data, width, height) => {
+      const availableSizeProperties = getAvailableSizeOptions(data.options);
+      console.time("layout create");
+      const layout = treemap()
+          .size([width, height])
+          .paddingOuter(PADDING)
+          .paddingTop(TOP_PADDING)
+          .paddingInner(PADDING)
+          .round(true)
+          .tile(treemapResquarify);
+      console.timeEnd("layout create");
+      console.time("rawHierarchy create");
+      const rawHierarchy = hierarchy(data.tree);
+      console.timeEnd("rawHierarchy create");
+      const nodeSizesCache = new Map();
+      const nodeIdsCache = new Map();
+      const getModuleSize = (node, sizeKey) => { var _a, _b; return (_b = (_a = nodeSizesCache.get(node)) === null || _a === void 0 ? void 0 : _a[sizeKey]) !== null && _b !== void 0 ? _b : 0; };
+      console.time("rawHierarchy eachAfter cache");
+      rawHierarchy.eachAfter((node) => {
+          var _a;
+          const nodeData = node.data;
+          nodeIdsCache.set(nodeData, {
+              nodeUid: generateUniqueId("node"),
+              clipUid: generateUniqueId("clip"),
+          });
+          const sizes = { renderedLength: 0, gzipLength: 0, brotliLength: 0 };
+          if (isModuleTree(nodeData)) {
+              for (const sizeKey of availableSizeProperties) {
+                  sizes[sizeKey] = nodeData.children.reduce((acc, child) => getModuleSize(child, sizeKey) + acc, 0);
+              }
+          }
+          else {
+              for (const sizeKey of availableSizeProperties) {
+                  sizes[sizeKey] = (_a = data.nodeParts[nodeData.uid][sizeKey]) !== null && _a !== void 0 ? _a : 0;
+              }
+          }
+          nodeSizesCache.set(nodeData, sizes);
+      });
+      console.timeEnd("rawHierarchy eachAfter cache");
+      const getModuleIds = (node) => nodeIdsCache.get(node);
+      console.time("color");
+      const getModuleColor = createRainbowColor(rawHierarchy);
+      console.timeEnd("color");
+      q$1(u$1(StaticContext.Provider, { value: {
+              data,
+              availableSizeProperties,
+              width,
+              height,
+              getModuleSize,
+              getModuleIds,
+              getModuleColor,
+              rawHierarchy,
+              layout,
+          }, children: u$1(Main, {}) }), parentNode);
+  };
+
+  exports.StaticContext = StaticContext;
+  exports.default = drawChart;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+  return exports;
+
+})({});
+
+  /*-->*/
+  </script>
+  <script>
+    /*<!--*/
+    const data = {"version":2,"tree":{"name":"root","children":[{"name":"index.js","children":[{"name":"node_modules/@stdlib","children":[{"name":"array-base-assert-is-complex-typed-array/lib/main.js","uid":"422539e1-1"},{"name":"array-base-assert-is-booleanarray/lib/main.js","uid":"422539e1-3"},{"name":"ndarray-base-iteration-order/lib/main.js","uid":"422539e1-5"},{"name":"utils-define-property/lib","children":[{"uid":"422539e1-7","name":"define_property.js"},{"uid":"422539e1-9","name":"has_define_property_support.js"},{"uid":"422539e1-11","name":"builtin.js"},{"uid":"422539e1-33","name":"polyfill.js"},{"uid":"422539e1-35","name":"index.js"}]},{"name":"string-base-format-interpolate/lib","children":[{"uid":"422539e1-13","name":"is_number.js"},{"uid":"422539e1-15","name":"zero_pad.js"},{"uid":"422539e1-17","name":"format_integer.js"},{"uid":"422539e1-19","name":"is_string.js"},{"uid":"422539e1-21","name":"format_double.js"},{"uid":"422539e1-23","name":"space_pad.js"},{"uid":"422539e1-25","name":"main.js"}]},{"name":"string-base-format-tokenize/lib/main.js","uid":"422539e1-27"},{"name":"string-format/lib","children":[{"uid":"422539e1-29","name":"is_string.js"},{"uid":"422539e1-31","name":"main.js"}]},{"name":"utils-define-nonenumerable-read-only-property/lib/main.js","uid":"422539e1-37"},{"name":"ndarray-base-minmax-view-buffer-index/lib","children":[{"uid":"422539e1-39","name":"main.js"},{"uid":"422539e1-41","name":"assign.js"},{"uid":"422539e1-43","name":"index.js"}]},{"name":"array-base-assert-is-accessor-array/lib/main.js","uid":"422539e1-45"},{"name":"array-base-accessor-getter/lib/main.js","uid":"422539e1-47"},{"name":"array-base-accessor-setter/lib/main.js","uid":"422539e1-49"},{"name":"array-base-getter/lib/main.js","uid":"422539e1-51"},{"name":"array-base-setter/lib/main.js","uid":"422539e1-53"},{"name":"ndarray-base-numel/lib/main.js","uid":"422539e1-55"},{"name":"ndarray-base-dtype/lib/main.js","uid":"422539e1-57"},{"name":"array-base-copy-indexed/lib/main.js","uid":"422539e1-59"},{"name":"ndarray-base-shape/lib/main.js","uid":"422539e1-61"},{"name":"assert-is-string/lib","children":[{"uid":"422539e1-63","name":"primitive.js"},{"uid":"422539e1-83","name":"valueof.js"},{"uid":"422539e1-85","name":"try2valueof.js"},{"uid":"422539e1-87","name":"object.js"},{"uid":"422539e1-89","name":"main.js"},{"uid":"422539e1-91","name":"index.js"}]},{"name":"assert-has-symbol-support/lib/main.js","uid":"422539e1-65"},{"name":"assert-has-tostringtag-support/lib/main.js","uid":"422539e1-67"},{"name":"utils-native-class/lib","children":[{"uid":"422539e1-69","name":"tostring.js"},{"uid":"422539e1-71","name":"main.js"},{"uid":"422539e1-77","name":"tostringtag.js"},{"uid":"422539e1-79","name":"polyfill.js"},{"uid":"422539e1-81","name":"index.js"}]},{"name":"assert-has-own-property/lib/main.js","uid":"422539e1-73"},{"name":"symbol-ctor/lib/main.js","uid":"422539e1-75"},{"name":"ndarray-base-assert-is-column-major-string/lib/main.js","uid":"422539e1-93"},{"name":"ndarray-base-shape2strides/lib","children":[{"uid":"422539e1-95","name":"main.js"},{"uid":"422539e1-97","name":"assign.js"},{"uid":"422539e1-99","name":"index.js"}]},{"name":"ndarray-base-strides/lib/main.js","uid":"422539e1-101"},{"name":"assert-is-number/lib","children":[{"uid":"422539e1-103","name":"primitive.js"},{"uid":"422539e1-107","name":"tostring.js"},{"uid":"422539e1-109","name":"try2serialize.js"},{"uid":"422539e1-111","name":"object.js"},{"uid":"422539e1-113","name":"main.js"},{"uid":"422539e1-115","name":"index.js"}]},{"name":"number-ctor/lib/main.js","uid":"422539e1-105"},{"name":"ndarray-base-strides2offset/lib/main.js","uid":"422539e1-117"},{"name":"ndarray-base-offset/lib/main.js","uid":"422539e1-119"},{"name":"math-base-special-abs/lib/main.js","uid":"422539e1-121"},{"name":"ndarray-base-strides2order/lib/main.js","uid":"422539e1-123"},{"name":"ndarray-base-order/lib/main.js","uid":"422539e1-125"},{"name":"ndarray-base-data-buffer/lib/main.js","uid":"422539e1-127"},{"name":"ndarray-base-ndarraylike2object/lib/main.js","uid":"422539e1-129"},{"name":"array-base-assert-is-complex128array/lib/main.js","uid":"422539e1-131"},{"name":"array-base-assert-is-complex64array/lib/main.js","uid":"422539e1-133"},{"name":"assert-is-float64array/lib/main.js","uid":"422539e1-135"},{"name":"assert-has-float64array-support/lib","children":[{"uid":"422539e1-137","name":"float64array.js"},{"uid":"422539e1-139","name":"main.js"}]},{"name":"array-float64/lib","children":[{"uid":"422539e1-141","name":"main.js"},{"uid":"422539e1-143","name":"polyfill.js"},{"uid":"422539e1-145","name":"index.js"}]},{"name":"strided-base-reinterpret-complex128/lib/main.js","uid":"422539e1-147"},{"name":"assert-is-float32array/lib/main.js","uid":"422539e1-149"},{"name":"constants-float64-pinf/lib/index.js","uid":"422539e1-151"},{"name":"assert-has-float32array-support/lib","children":[{"uid":"422539e1-153","name":"float32array.js"},{"uid":"422539e1-155","name":"main.js"}]},{"name":"array-float32/lib","children":[{"uid":"422539e1-157","name":"main.js"},{"uid":"422539e1-159","name":"polyfill.js"},{"uid":"422539e1-161","name":"index.js"}]},{"name":"strided-base-reinterpret-complex64/lib/main.js","uid":"422539e1-163"},{"name":"strided-base-reinterpret-complex/lib/main.js","uid":"422539e1-165"},{"name":"assert-is-uint8array/lib/main.js","uid":"422539e1-167"},{"name":"constants-uint8-max/lib/index.js","uid":"422539e1-169"},{"name":"assert-has-uint8array-support/lib","children":[{"uid":"422539e1-171","name":"uint8array.js"},{"uid":"422539e1-173","name":"main.js"}]},{"name":"array-uint8/lib","children":[{"uid":"422539e1-175","name":"main.js"},{"uid":"422539e1-177","name":"polyfill.js"},{"uid":"422539e1-179","name":"index.js"}]},{"name":"strided-base-reinterpret-boolean/lib/main.js","uid":"422539e1-181"},{"name":"strided-base-stride2offset/lib/main.js","uid":"422539e1-183"},{"name":"assert-is-array/lib/main.js","uid":"422539e1-185"},{"name":"assert-tools-array-function/lib/main.js","uid":"422539e1-187"},{"name":"assert-is-object-like/lib","children":[{"uid":"422539e1-189","name":"main.js"},{"uid":"422539e1-191","name":"index.js"}]},{"name":"assert-is-buffer/lib/main.js","uid":"422539e1-193"},{"name":"regexp-function-name/lib","children":[{"uid":"422539e1-195","name":"main.js"},{"uid":"422539e1-197","name":"regexp.js"},{"uid":"422539e1-199","name":"index.js"}]},{"name":"utils-constructor-name/lib/main.js","uid":"422539e1-201"},{"name":"array-dtype/lib","children":[{"uid":"422539e1-203","name":"ctor2dtype.js"},{"uid":"422539e1-435","name":"ctors.js"},{"uid":"422539e1-437","name":"dtypes.js"},{"uid":"422539e1-439","name":"main.js"}]},{"name":"assert-is-uint32array/lib/main.js","uid":"422539e1-205"},{"name":"constants-uint32-max/lib/index.js","uid":"422539e1-207"},{"name":"assert-has-uint32array-support/lib","children":[{"uid":"422539e1-209","name":"uint32array.js"},{"uid":"422539e1-211","name":"main.js"}]},{"name":"array-uint32/lib","children":[{"uid":"422539e1-213","name":"main.js"},{"uid":"422539e1-215","name":"polyfill.js"},{"uid":"422539e1-217","name":"index.js"}]},{"name":"assert-is-int32array/lib/main.js","uid":"422539e1-219"},{"name":"constants-int32-max/lib/index.js","uid":"422539e1-221"},{"name":"constants-int32-min/lib/index.js","uid":"422539e1-223"},{"name":"assert-has-int32array-support/lib","children":[{"uid":"422539e1-225","name":"int32array.js"},{"uid":"422539e1-227","name":"main.js"}]},{"name":"array-int32/lib","children":[{"uid":"422539e1-229","name":"main.js"},{"uid":"422539e1-231","name":"polyfill.js"},{"uid":"422539e1-233","name":"index.js"}]},{"name":"assert-is-uint16array/lib/main.js","uid":"422539e1-235"},{"name":"constants-uint16-max/lib/index.js","uid":"422539e1-237"},{"name":"assert-has-uint16array-support/lib","children":[{"uid":"422539e1-239","name":"uint16array.js"},{"uid":"422539e1-241","name":"main.js"}]},{"name":"array-uint16/lib","children":[{"uid":"422539e1-243","name":"main.js"},{"uid":"422539e1-245","name":"polyfill.js"},{"uid":"422539e1-247","name":"index.js"}]},{"name":"assert-is-int16array/lib/main.js","uid":"422539e1-249"},{"name":"constants-int16-max/lib/index.js","uid":"422539e1-251"},{"name":"constants-int16-min/lib/index.js","uid":"422539e1-253"},{"name":"assert-has-int16array-support/lib","children":[{"uid":"422539e1-255","name":"int16array.js"},{"uid":"422539e1-257","name":"main.js"}]},{"name":"array-int16/lib","children":[{"uid":"422539e1-259","name":"main.js"},{"uid":"422539e1-261","name":"polyfill.js"},{"uid":"422539e1-263","name":"index.js"}]},{"name":"assert-is-uint8clampedarray/lib/main.js","uid":"422539e1-265"},{"name":"assert-has-uint8clampedarray-support/lib","children":[{"uid":"422539e1-267","name":"uint8clampedarray.js"},{"uid":"422539e1-269","name":"main.js"}]},{"name":"array-uint8c/lib","children":[{"uid":"422539e1-271","name":"main.js"},{"uid":"422539e1-273","name":"polyfill.js"},{"uid":"422539e1-275","name":"index.js"}]},{"name":"assert-is-int8array/lib/main.js","uid":"422539e1-277"},{"name":"constants-int8-max/lib/index.js","uid":"422539e1-279"},{"name":"constants-int8-min/lib/index.js","uid":"422539e1-281"},{"name":"assert-has-int8array-support/lib","children":[{"uid":"422539e1-283","name":"int8array.js"},{"uid":"422539e1-285","name":"main.js"}]},{"name":"array-int8/lib","children":[{"uid":"422539e1-287","name":"main.js"},{"uid":"422539e1-289","name":"polyfill.js"},{"uid":"422539e1-291","name":"index.js"}]},{"name":"constants-float64-ninf/lib/index.js","uid":"422539e1-293"},{"name":"math-base-special-floor/lib/main.js","uid":"422539e1-295"},{"name":"math-base-assert-is-integer/lib/main.js","uid":"422539e1-297"},{"name":"assert-is-integer/lib","children":[{"uid":"422539e1-299","name":"integer.js"},{"uid":"422539e1-301","name":"primitive.js"},{"uid":"422539e1-303","name":"object.js"},{"uid":"422539e1-305","name":"main.js"},{"uid":"422539e1-307","name":"index.js"}]},{"name":"assert-is-nonnegative-integer/lib","children":[{"uid":"422539e1-309","name":"primitive.js"},{"uid":"422539e1-311","name":"object.js"},{"uid":"422539e1-313","name":"main.js"},{"uid":"422539e1-315","name":"index.js"}]},{"name":"constants-array-max-array-length/lib/index.js","uid":"422539e1-317"},{"name":"assert-is-array-like-object/lib/main.js","uid":"422539e1-319"},{"name":"constants-array-max-typed-array-length/lib/index.js","uid":"422539e1-321"},{"name":"assert-is-collection/lib/main.js","uid":"422539e1-323"},{"name":"assert-is-arraybuffer/lib/main.js","uid":"422539e1-325"},{"name":"assert-is-object/lib/main.js","uid":"422539e1-327"},{"name":"assert-is-string-array/lib/index.js","uid":"422539e1-329"},{"name":"utils-type-of/lib","children":[{"name":"fixtures","children":[{"uid":"422539e1-331","name":"re.js"},{"uid":"422539e1-359","name":"nodelist.js"},{"uid":"422539e1-361","name":"typedarray.js"}]},{"uid":"422539e1-363","name":"check.js"},{"uid":"422539e1-365","name":"main.js"},{"uid":"422539e1-367","name":"polyfill.js"},{"uid":"422539e1-369","name":"index.js"}]},{"name":"assert-is-boolean/lib","children":[{"uid":"422539e1-333","name":"primitive.js"},{"uid":"422539e1-337","name":"tostring.js"},{"uid":"422539e1-339","name":"try2serialize.js"},{"uid":"422539e1-341","name":"object.js"},{"uid":"422539e1-343","name":"main.js"},{"uid":"422539e1-345","name":"index.js"}]},{"name":"boolean-ctor/lib/main.js","uid":"422539e1-335"},{"name":"utils-global/lib","children":[{"uid":"422539e1-347","name":"codegen.js"},{"uid":"422539e1-349","name":"self.js"},{"uid":"422539e1-351","name":"window.js"},{"uid":"422539e1-353","name":"global.js"},{"uid":"422539e1-355","name":"global_this.js"},{"uid":"422539e1-357","name":"main.js"}]},{"name":"assert-is-function/lib/main.js","uid":"422539e1-371"},{"name":"utils-define-read-only-property/lib/main.js","uid":"422539e1-373"},{"name":"complex-float64-ctor/lib","children":[{"uid":"422539e1-375","name":"tostring.js"},{"uid":"422539e1-377","name":"tojson.js"},{"uid":"422539e1-379","name":"main.js"}]},{"name":"number-float64-base-to-float32/lib","children":[{"uid":"422539e1-381","name":"main.js"},{"uid":"422539e1-383","name":"polyfill.js"},{"uid":"422539e1-385","name":"index.js"}]},{"name":"complex-float32-ctor/lib","children":[{"uid":"422539e1-387","name":"tostring.js"},{"uid":"422539e1-389","name":"tojson.js"},{"uid":"422539e1-391","name":"main.js"}]},{"name":"assert-is-complex-like/lib/main.js","uid":"422539e1-393"},{"name":"math-base-assert-is-even/lib/main.js","uid":"422539e1-395"},{"name":"assert-has-iterator-symbol-support/lib/main.js","uid":"422539e1-397"},{"name":"symbol-iterator/lib/main.js","uid":"422539e1-399"},{"name":"utils-define-nonenumerable-read-only-accessor/lib/main.js","uid":"422539e1-401"},{"name":"complex-float32-real/lib/main.js","uid":"422539e1-403"},{"name":"complex-float32-imag/lib/main.js","uid":"422539e1-405"},{"name":"array-complex64/lib","children":[{"uid":"422539e1-407","name":"from_iterator.js"},{"uid":"422539e1-409","name":"from_iterator_map.js"},{"uid":"422539e1-411","name":"from_array.js"},{"uid":"422539e1-413","name":"main.js"}]},{"name":"complex-float64-real/lib/main.js","uid":"422539e1-415"},{"name":"complex-float64-imag/lib/main.js","uid":"422539e1-417"},{"name":"array-complex128/lib","children":[{"uid":"422539e1-419","name":"from_iterator.js"},{"uid":"422539e1-421","name":"from_iterator_map.js"},{"uid":"422539e1-423","name":"from_array.js"},{"uid":"422539e1-425","name":"main.js"}]},{"name":"array-bool/lib","children":[{"uid":"422539e1-427","name":"from_iterator.js"},{"uid":"422539e1-429","name":"from_iterator_map.js"},{"uid":"422539e1-431","name":"from_array.js"},{"uid":"422539e1-433","name":"main.js"}]},{"name":"array-base-arraylike2object/lib/main.js","uid":"422539e1-441"},{"name":"blas-base-gscal/lib","children":[{"uid":"422539e1-443","name":"accessors.js"},{"uid":"422539e1-445","name":"ndarray.js"},{"uid":"422539e1-447","name":"main.js"},{"uid":"422539e1-449","name":"index.js"}]},{"name":"array-base-zero-to/lib","children":[{"uid":"422539e1-451","name":"main.js"},{"uid":"422539e1-453","name":"assign.js"},{"uid":"422539e1-455","name":"index.js"}]},{"name":"array-base-take-indexed/lib/main.js","uid":"422539e1-457"},{"name":"ndarray-base-nullary-loop-interchange-order/lib","children":[{"uid":"422539e1-459","name":"sort2ins.js"},{"uid":"422539e1-461","name":"main.js"}]},{"name":"assert-is-positive-integer/lib","children":[{"uid":"422539e1-463","name":"primitive.js"},{"uid":"422539e1-465","name":"object.js"},{"uid":"422539e1-467","name":"main.js"},{"uid":"422539e1-469","name":"index.js"}]},{"name":"utils-keys/lib","children":[{"uid":"422539e1-471","name":"builtin.js"},{"uid":"422539e1-473","name":"has_arguments_bug.js"},{"uid":"422539e1-475","name":"has_builtin.js"},{"uid":"422539e1-501","name":"builtin_wrapper.js"},{"uid":"422539e1-505","name":"has_enumerable_prototype_bug.js"},{"uid":"422539e1-507","name":"has_non_enumerable_properties_bug.js"},{"uid":"422539e1-511","name":"is_constructor_prototype.js"},{"uid":"422539e1-513","name":"excluded_keys.json"},{"uid":"422539e1-515","name":"window.js"},{"uid":"422539e1-517","name":"has_automation_equality_bug.js"},{"uid":"422539e1-519","name":"has_window.js"},{"uid":"422539e1-521","name":"is_constructor_prototype_wrapper.js"},{"uid":"422539e1-523","name":"non_enumerable.json"},{"uid":"422539e1-525","name":"polyfill.js"},{"uid":"422539e1-527","name":"main.js"}]},{"name":"assert-is-arguments/lib","children":[{"uid":"422539e1-477","name":"main.js"},{"uid":"422539e1-479","name":"detect.js"},{"uid":"422539e1-497","name":"polyfill.js"},{"uid":"422539e1-499","name":"index.js"}]},{"name":"math-base-assert-is-nan/lib/main.js","uid":"422539e1-481"},{"name":"assert-is-nan/lib","children":[{"uid":"422539e1-483","name":"primitive.js"},{"uid":"422539e1-485","name":"object.js"},{"uid":"422539e1-487","name":"main.js"},{"uid":"422539e1-489","name":"index.js"}]},{"name":"assert-is-enumerable-property/lib","children":[{"uid":"422539e1-491","name":"native.js"},{"uid":"422539e1-493","name":"has_string_enumerability_bug.js"},{"uid":"422539e1-495","name":"main.js"}]},{"name":"utils-noop/lib/main.js","uid":"422539e1-503"},{"name":"utils-index-of/lib/main.js","uid":"422539e1-509"},{"name":"object-ctor/lib/main.js","uid":"422539e1-529"},{"name":"utils-get-prototype-of/lib","children":[{"uid":"422539e1-531","name":"native.js"},{"uid":"422539e1-533","name":"proto.js"},{"uid":"422539e1-535","name":"polyfill.js"},{"uid":"422539e1-537","name":"detect.js"},{"uid":"422539e1-539","name":"main.js"}]},{"name":"assert-is-plain-object/lib/main.js","uid":"422539e1-541"},{"name":"object-inverse/lib/main.js","uid":"422539e1-543"},{"name":"ndarray-base-dtype-enums/lib/main.js","uid":"422539e1-545"},{"name":"ndarray-base-dtype-enum2str/lib/main.js","uid":"422539e1-547"},{"name":"ndarray-base-bytes-per-element/lib","children":[{"uid":"422539e1-549","name":"bytes_per_element.json"},{"uid":"422539e1-551","name":"main.js"}]},{"name":"ndarray-base-tiling-block-size/lib","children":[{"uid":"422539e1-553","name":"defaults.js"},{"uid":"422539e1-555","name":"main.js"}]},{"name":"ndarray-base-nullary-tiling-block-size/lib/main.js","uid":"422539e1-557"},{"name":"ndarray-base-vind2bind/lib/main.js","uid":"422539e1-635"}]},{"name":"lib","children":[{"uid":"422539e1-559","name":"2d_blocked_accessors.js"},{"uid":"422539e1-561","name":"3d_blocked_accessors.js"},{"uid":"422539e1-563","name":"4d_blocked_accessors.js"},{"uid":"422539e1-565","name":"5d_blocked_accessors.js"},{"uid":"422539e1-567","name":"6d_blocked_accessors.js"},{"uid":"422539e1-569","name":"7d_blocked_accessors.js"},{"uid":"422539e1-571","name":"8d_blocked_accessors.js"},{"uid":"422539e1-573","name":"9d_blocked_accessors.js"},{"uid":"422539e1-575","name":"10d_blocked_accessors.js"},{"uid":"422539e1-577","name":"2d_blocked_complex.js"},{"uid":"422539e1-579","name":"3d_blocked_complex.js"},{"uid":"422539e1-581","name":"4d_blocked_complex.js"},{"uid":"422539e1-583","name":"5d_blocked_complex.js"},{"uid":"422539e1-585","name":"6d_blocked_complex.js"},{"uid":"422539e1-587","name":"7d_blocked_complex.js"},{"uid":"422539e1-589","name":"8d_blocked_complex.js"},{"uid":"422539e1-591","name":"9d_blocked_complex.js"},{"uid":"422539e1-593","name":"10d_blocked_complex.js"},{"uid":"422539e1-595","name":"2d_blocked.js"},{"uid":"422539e1-597","name":"3d_blocked.js"},{"uid":"422539e1-599","name":"4d_blocked.js"},{"uid":"422539e1-601","name":"5d_blocked.js"},{"uid":"422539e1-603","name":"6d_blocked.js"},{"uid":"422539e1-605","name":"7d_blocked.js"},{"uid":"422539e1-607","name":"8d_blocked.js"},{"uid":"422539e1-609","name":"9d_blocked.js"},{"uid":"422539e1-611","name":"10d_blocked.js"},{"uid":"422539e1-613","name":"0d_accessors.js"},{"uid":"422539e1-615","name":"1d_accessors.js"},{"uid":"422539e1-617","name":"2d_accessors.js"},{"uid":"422539e1-619","name":"3d_accessors.js"},{"uid":"422539e1-621","name":"4d_accessors.js"},{"uid":"422539e1-623","name":"5d_accessors.js"},{"uid":"422539e1-625","name":"6d_accessors.js"},{"uid":"422539e1-627","name":"7d_accessors.js"},{"uid":"422539e1-629","name":"8d_accessors.js"},{"uid":"422539e1-631","name":"9d_accessors.js"},{"uid":"422539e1-633","name":"10d_accessors.js"},{"uid":"422539e1-637","name":"nd_accessors.js"},{"uid":"422539e1-639","name":"0d_complex.js"},{"uid":"422539e1-641","name":"1d_complex.js"},{"uid":"422539e1-643","name":"2d_complex.js"},{"uid":"422539e1-645","name":"3d_complex.js"},{"uid":"422539e1-647","name":"4d_complex.js"},{"uid":"422539e1-649","name":"5d_complex.js"},{"uid":"422539e1-651","name":"6d_complex.js"},{"uid":"422539e1-653","name":"7d_complex.js"},{"uid":"422539e1-655","name":"8d_complex.js"},{"uid":"422539e1-657","name":"9d_complex.js"},{"uid":"422539e1-659","name":"10d_complex.js"},{"uid":"422539e1-661","name":"nd_complex.js"},{"uid":"422539e1-663","name":"0d.js"},{"uid":"422539e1-665","name":"1d.js"},{"uid":"422539e1-667","name":"2d.js"},{"uid":"422539e1-669","name":"3d.js"},{"uid":"422539e1-671","name":"4d.js"},{"uid":"422539e1-673","name":"5d.js"},{"uid":"422539e1-675","name":"6d.js"},{"uid":"422539e1-677","name":"7d.js"},{"uid":"422539e1-679","name":"8d.js"},{"uid":"422539e1-681","name":"9d.js"},{"uid":"422539e1-683","name":"10d.js"},{"uid":"422539e1-685","name":"nd.js"},{"uid":"422539e1-687","name":"main.js"},{"uid":"422539e1-689","name":"index.js"}]}]}],"isRoot":true},"nodeParts":{"422539e1-1":{"renderedLength":2016,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-0"},"422539e1-3":{"renderedLength":1698,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-2"},"422539e1-5":{"renderedLength":1657,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-4"},"422539e1-7":{"renderedLength":742,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-6"},"422539e1-9":{"renderedLength":1093,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-8"},"422539e1-11":{"renderedLength":2991,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-10"},"422539e1-13":{"renderedLength":1216,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-12"},"422539e1-15":{"renderedLength":1808,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-14"},"422539e1-17":{"renderedLength":2661,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-16"},"422539e1-19":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-18"},"422539e1-21":{"renderedLength":2809,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-20"},"422539e1-23":{"renderedLength":1387,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-22"},"422539e1-25":{"renderedLength":6765,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-24"},"422539e1-27":{"renderedLength":2118,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-26"},"422539e1-29":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-28"},"422539e1-31":{"renderedLength":1470,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-30"},"422539e1-33":{"renderedLength":4793,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-32"},"422539e1-35":{"renderedLength":852,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-34"},"422539e1-37":{"renderedLength":1231,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-36"},"422539e1-39":{"renderedLength":2145,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-38"},"422539e1-41":{"renderedLength":2655,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-40"},"422539e1-43":{"renderedLength":736,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-42"},"422539e1-45":{"renderedLength":1271,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-44"},"422539e1-47":{"renderedLength":2927,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-46"},"422539e1-49":{"renderedLength":3350,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-48"},"422539e1-51":{"renderedLength":6375,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-50"},"422539e1-53":{"renderedLength":6167,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-52"},"422539e1-55":{"renderedLength":1098,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-54"},"422539e1-57":{"renderedLength":1008,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-56"},"422539e1-59":{"renderedLength":1094,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-58"},"422539e1-61":{"renderedLength":1175,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-60"},"422539e1-63":{"renderedLength":1026,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-62"},"422539e1-65":{"renderedLength":975,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-64"},"422539e1-67":{"renderedLength":1035,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-66"},"422539e1-69":{"renderedLength":688,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-68"},"422539e1-71":{"renderedLength":1275,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-70"},"422539e1-73":{"renderedLength":1329,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-72"},"422539e1-75":{"renderedLength":757,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-74"},"422539e1-77":{"renderedLength":719,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-76"},"422539e1-79":{"renderedLength":1896,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-78"},"422539e1-81":{"renderedLength":806,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-80"},"422539e1-83":{"renderedLength":740,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-82"},"422539e1-85":{"renderedLength":978,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-84"},"422539e1-87":{"renderedLength":1276,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-86"},"422539e1-89":{"renderedLength":1037,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-88"},"422539e1-91":{"renderedLength":778,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-90"},"422539e1-93":{"renderedLength":1102,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-92"},"422539e1-95":{"renderedLength":2060,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-94"},"422539e1-97":{"renderedLength":2315,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-96"},"422539e1-99":{"renderedLength":720,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-98"},"422539e1-101":{"renderedLength":1492,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-100"},"422539e1-103":{"renderedLength":1087,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-102"},"422539e1-105":{"renderedLength":719,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-104"},"422539e1-107":{"renderedLength":758,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-106"},"422539e1-109":{"renderedLength":988,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-108"},"422539e1-111":{"renderedLength":1272,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-110"},"422539e1-113":{"renderedLength":1165,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-112"},"422539e1-115":{"renderedLength":778,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-114"},"422539e1-117":{"renderedLength":1461,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-116"},"422539e1-119":{"renderedLength":1274,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-118"},"422539e1-121":{"renderedLength":1187,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-120"},"422539e1-123":{"renderedLength":1709,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-122"},"422539e1-125":{"renderedLength":2028,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-124"},"422539e1-127":{"renderedLength":1039,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-126"},"422539e1-129":{"renderedLength":3363,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-128"},"422539e1-131":{"renderedLength":1765,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-130"},"422539e1-133":{"renderedLength":1753,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-132"},"422539e1-135":{"renderedLength":1367,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-134"},"422539e1-137":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-136"},"422539e1-139":{"renderedLength":1322,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-138"},"422539e1-141":{"renderedLength":772,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-140"},"422539e1-143":{"renderedLength":901,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-142"},"422539e1-145":{"renderedLength":800,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-144"},"422539e1-147":{"renderedLength":1288,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-146"},"422539e1-149":{"renderedLength":1367,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-148"},"422539e1-151":{"renderedLength":1364,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-150"},"422539e1-153":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-152"},"422539e1-155":{"renderedLength":1355,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-154"},"422539e1-157":{"renderedLength":772,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-156"},"422539e1-159":{"renderedLength":901,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-158"},"422539e1-161":{"renderedLength":800,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-160"},"422539e1-163":{"renderedLength":1283,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-162"},"422539e1-165":{"renderedLength":2027,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-164"},"422539e1-167":{"renderedLength":1341,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-166"},"422539e1-169":{"renderedLength":1154,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-168"},"422539e1-171":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-170"},"422539e1-173":{"renderedLength":1468,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-172"},"422539e1-175":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-174"},"422539e1-177":{"renderedLength":885,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-176"},"422539e1-179":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-178"},"422539e1-181":{"renderedLength":1254,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-180"},"422539e1-183":{"renderedLength":1104,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-182"},"422539e1-185":{"renderedLength":1168,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-184"},"422539e1-187":{"renderedLength":1905,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-186"},"422539e1-189":{"renderedLength":1101,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-188"},"422539e1-191":{"renderedLength":803,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-190"},"422539e1-193":{"renderedLength":1592,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-192"},"422539e1-195":{"renderedLength":1312,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-194"},"422539e1-197":{"renderedLength":1319,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-196"},"422539e1-199":{"renderedLength":722,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-198"},"422539e1-201":{"renderedLength":1623,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-200"},"422539e1-203":{"renderedLength":1084,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-202"},"422539e1-205":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-204"},"422539e1-207":{"renderedLength":1183,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-206"},"422539e1-209":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-208"},"422539e1-211":{"renderedLength":1479,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-210"},"422539e1-213":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-212"},"422539e1-215":{"renderedLength":886,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-214"},"422539e1-217":{"renderedLength":798,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-216"},"422539e1-219":{"renderedLength":1343,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-218"},"422539e1-221":{"renderedLength":1198,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-220"},"422539e1-223":{"renderedLength":1217,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-222"},"422539e1-225":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-224"},"422539e1-227":{"renderedLength":1363,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-226"},"422539e1-229":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-228"},"422539e1-231":{"renderedLength":900,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-230"},"422539e1-233":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-232"},"422539e1-235":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-234"},"422539e1-237":{"renderedLength":1175,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-236"},"422539e1-239":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-238"},"422539e1-241":{"renderedLength":1479,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-240"},"422539e1-243":{"renderedLength":770,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-242"},"422539e1-245":{"renderedLength":886,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-244"},"422539e1-247":{"renderedLength":798,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-246"},"422539e1-249":{"renderedLength":1343,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-248"},"422539e1-251":{"renderedLength":1167,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-250"},"422539e1-253":{"renderedLength":1186,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-252"},"422539e1-255":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-254"},"422539e1-257":{"renderedLength":1363,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-256"},"422539e1-259":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-258"},"422539e1-261":{"renderedLength":900,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-260"},"422539e1-263":{"renderedLength":796,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-262"},"422539e1-265":{"renderedLength":1426,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-264"},"422539e1-267":{"renderedLength":780,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-266"},"422539e1-269":{"renderedLength":1514,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-268"},"422539e1-271":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-270"},"422539e1-273":{"renderedLength":902,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-272"},"422539e1-275":{"renderedLength":810,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-274"},"422539e1-277":{"renderedLength":1330,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-276"},"422539e1-279":{"renderedLength":1144,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-278"},"422539e1-281":{"renderedLength":1163,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-280"},"422539e1-283":{"renderedLength":764,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-282"},"422539e1-285":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-284"},"422539e1-287":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-286"},"422539e1-289":{"renderedLength":897,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-288"},"422539e1-291":{"renderedLength":784,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-290"},"422539e1-293":{"renderedLength":1091,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-292"},"422539e1-295":{"renderedLength":1133,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-294"},"422539e1-297":{"renderedLength":1039,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-296"},"422539e1-299":{"renderedLength":974,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-298"},"422539e1-301":{"renderedLength":1113,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-300"},"422539e1-303":{"renderedLength":1115,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-302"},"422539e1-305":{"renderedLength":1177,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-304"},"422539e1-307":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-306"},"422539e1-309":{"renderedLength":1157,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-308"},"422539e1-311":{"renderedLength":1161,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-310"},"422539e1-313":{"renderedLength":1354,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-312"},"422539e1-315":{"renderedLength":826,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-314"},"422539e1-317":{"renderedLength":1072,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-316"},"422539e1-319":{"renderedLength":1300,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-318"},"422539e1-321":{"renderedLength":1079,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-320"},"422539e1-323":{"renderedLength":1189,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-322"},"422539e1-325":{"renderedLength":1356,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-324"},"422539e1-327":{"renderedLength":1064,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-326"},"422539e1-329":{"renderedLength":968,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-328"},"422539e1-331":{"renderedLength":650,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-330"},"422539e1-333":{"renderedLength":1147,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-332"},"422539e1-335":{"renderedLength":1099,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-334"},"422539e1-337":{"renderedLength":745,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-336"},"422539e1-339":{"renderedLength":988,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-338"},"422539e1-341":{"renderedLength":1324,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-340"},"422539e1-343":{"renderedLength":1292,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-342"},"422539e1-345":{"renderedLength":782,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-344"},"422539e1-347":{"renderedLength":890,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-346"},"422539e1-349":{"renderedLength":705,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-348"},"422539e1-351":{"renderedLength":709,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-350"},"422539e1-353":{"renderedLength":709,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-352"},"422539e1-355":{"renderedLength":749,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-354"},"422539e1-357":{"renderedLength":1869,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-356"},"422539e1-359":{"renderedLength":733,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-358"},"422539e1-361":{"renderedLength":710,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-360"},"422539e1-363":{"renderedLength":1332,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-362"},"422539e1-365":{"renderedLength":1694,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-364"},"422539e1-367":{"renderedLength":849,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-366"},"422539e1-369":{"renderedLength":698,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-368"},"422539e1-371":{"renderedLength":1183,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-370"},"422539e1-373":{"renderedLength":1189,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-372"},"422539e1-375":{"renderedLength":1009,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-374"},"422539e1-377":{"renderedLength":911,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-376"},"422539e1-379":{"renderedLength":3806,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-378"},"422539e1-381":{"renderedLength":768,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-380"},"422539e1-383":{"renderedLength":1142,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-382"},"422539e1-385":{"renderedLength":856,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-384"},"422539e1-387":{"renderedLength":1007,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-386"},"422539e1-389":{"renderedLength":908,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-388"},"422539e1-391":{"renderedLength":3814,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-390"},"422539e1-393":{"renderedLength":1409,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-392"},"422539e1-395":{"renderedLength":1142,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-394"},"422539e1-397":{"renderedLength":1079,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-396"},"422539e1-399":{"renderedLength":1527,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-398"},"422539e1-401":{"renderedLength":1315,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-400"},"422539e1-403":{"renderedLength":1004,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-402"},"422539e1-405":{"renderedLength":1014,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-404"},"422539e1-407":{"renderedLength":1349,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-406"},"422539e1-409":{"renderedLength":1533,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-408"},"422539e1-411":{"renderedLength":1195,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-410"},"422539e1-413":{"renderedLength":82989,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-412"},"422539e1-415":{"renderedLength":1004,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-414"},"422539e1-417":{"renderedLength":1014,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-416"},"422539e1-419":{"renderedLength":1345,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-418"},"422539e1-421":{"renderedLength":1529,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-420"},"422539e1-423":{"renderedLength":1191,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-422"},"422539e1-425":{"renderedLength":82755,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-424"},"422539e1-427":{"renderedLength":968,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-426"},"422539e1-429":{"renderedLength":1155,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-428"},"422539e1-431":{"renderedLength":997,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-430"},"422539e1-433":{"renderedLength":63936,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-432"},"422539e1-435":{"renderedLength":920,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-434"},"422539e1-437":{"renderedLength":856,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-436"},"422539e1-439":{"renderedLength":1373,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-438"},"422539e1-441":{"renderedLength":2491,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-440"},"422539e1-443":{"renderedLength":2517,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-442"},"422539e1-445":{"renderedLength":2106,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-444"},"422539e1-447":{"renderedLength":1226,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-446"},"422539e1-449":{"renderedLength":705,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-448"},"422539e1-451":{"renderedLength":1094,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-450"},"422539e1-453":{"renderedLength":4888,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-452"},"422539e1-455":{"renderedLength":704,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-454"},"422539e1-457":{"renderedLength":1181,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-456"},"422539e1-459":{"renderedLength":2294,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-458"},"422539e1-461":{"renderedLength":1830,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-460"},"422539e1-463":{"renderedLength":1143,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-462"},"422539e1-465":{"renderedLength":1147,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-464"},"422539e1-467":{"renderedLength":1399,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-466"},"422539e1-469":{"renderedLength":814,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-468"},"422539e1-471":{"renderedLength":1221,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-470"},"422539e1-473":{"renderedLength":1328,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-472"},"422539e1-475":{"renderedLength":702,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-474"},"422539e1-477":{"renderedLength":1131,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-476"},"422539e1-479":{"renderedLength":1106,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-478"},"422539e1-481":{"renderedLength":1010,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-480"},"422539e1-483":{"renderedLength":1123,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-482"},"422539e1-485":{"renderedLength":1099,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-484"},"422539e1-487":{"renderedLength":1138,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-486"},"422539e1-489":{"renderedLength":766,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-488"},"422539e1-491":{"renderedLength":1281,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-490"},"422539e1-493":{"renderedLength":1084,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-492"},"422539e1-495":{"renderedLength":1694,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-494"},"422539e1-497":{"renderedLength":1373,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-496"},"422539e1-499":{"renderedLength":822,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-498"},"422539e1-501":{"renderedLength":1169,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-500"},"422539e1-503":{"renderedLength":755,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-502"},"422539e1-505":{"renderedLength":833,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-504"},"422539e1-507":{"renderedLength":881,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-506"},"422539e1-509":{"renderedLength":2990,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-508"},"422539e1-511":{"renderedLength":991,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-510"},"422539e1-513":{"renderedLength":266,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-512"},"422539e1-515":{"renderedLength":710,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-514"},"422539e1-517":{"renderedLength":1566,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-516"},"422539e1-519":{"renderedLength":697,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-518"},"422539e1-521":{"renderedLength":1217,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-520"},"422539e1-523":{"renderedLength":132,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-522"},"422539e1-525":{"renderedLength":2511,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-524"},"422539e1-527":{"renderedLength":1165,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-526"},"422539e1-529":{"renderedLength":1195,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-528"},"422539e1-531":{"renderedLength":689,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-530"},"422539e1-533":{"renderedLength":889,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-532"},"422539e1-535":{"renderedLength":1337,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-534"},"422539e1-537":{"renderedLength":825,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-536"},"422539e1-539":{"renderedLength":1229,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-538"},"422539e1-541":{"renderedLength":2759,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-540"},"422539e1-543":{"renderedLength":2808,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-542"},"422539e1-545":{"renderedLength":2308,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-544"},"422539e1-547":{"renderedLength":1308,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-546"},"422539e1-549":{"renderedLength":684,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-548"},"422539e1-551":{"renderedLength":1628,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-550"},"422539e1-553":{"renderedLength":1648,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-552"},"422539e1-555":{"renderedLength":1658,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-554"},"422539e1-557":{"renderedLength":986,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-556"},"422539e1-559":{"renderedLength":3774,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-558"},"422539e1-561":{"renderedLength":4136,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-560"},"422539e1-563":{"renderedLength":4541,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-562"},"422539e1-565":{"renderedLength":4943,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-564"},"422539e1-567":{"renderedLength":5403,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-566"},"422539e1-569":{"renderedLength":5845,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-568"},"422539e1-571":{"renderedLength":6307,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-570"},"422539e1-573":{"renderedLength":6789,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-572"},"422539e1-575":{"renderedLength":7317,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-574"},"422539e1-577":{"renderedLength":3599,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-576"},"422539e1-579":{"renderedLength":3960,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-578"},"422539e1-581":{"renderedLength":4343,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-580"},"422539e1-583":{"renderedLength":4745,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-582"},"422539e1-585":{"renderedLength":5205,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-584"},"422539e1-587":{"renderedLength":5647,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-586"},"422539e1-589":{"renderedLength":6109,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-588"},"422539e1-591":{"renderedLength":6591,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-590"},"422539e1-593":{"renderedLength":7119,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-592"},"422539e1-595":{"renderedLength":3523,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-594"},"422539e1-597":{"renderedLength":3908,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-596"},"422539e1-599":{"renderedLength":4314,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-598"},"422539e1-601":{"renderedLength":4717,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-600"},"422539e1-603":{"renderedLength":5178,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-602"},"422539e1-605":{"renderedLength":5621,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-604"},"422539e1-607":{"renderedLength":6084,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-606"},"422539e1-609":{"renderedLength":6567,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-608"},"422539e1-611":{"renderedLength":7096,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-610"},"422539e1-613":{"renderedLength":2189,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-612"},"422539e1-615":{"renderedLength":2898,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-614"},"422539e1-617":{"renderedLength":3652,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-616"},"422539e1-619":{"renderedLength":3853,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-618"},"422539e1-621":{"renderedLength":4062,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-620"},"422539e1-623":{"renderedLength":4269,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-622"},"422539e1-625":{"renderedLength":4479,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-624"},"422539e1-627":{"renderedLength":4692,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-626"},"422539e1-629":{"renderedLength":4908,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-628"},"422539e1-631":{"renderedLength":5127,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-630"},"422539e1-633":{"renderedLength":5389,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-632"},"422539e1-635":{"renderedLength":3175,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-634"},"422539e1-637":{"renderedLength":3053,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-636"},"422539e1-639":{"renderedLength":2043,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-638"},"422539e1-641":{"renderedLength":2696,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-640"},"422539e1-643":{"renderedLength":3457,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-642"},"422539e1-645":{"renderedLength":3658,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-644"},"422539e1-647":{"renderedLength":3862,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-646"},"422539e1-649":{"renderedLength":4069,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-648"},"422539e1-651":{"renderedLength":4279,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-650"},"422539e1-653":{"renderedLength":4492,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-652"},"422539e1-655":{"renderedLength":4708,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-654"},"422539e1-657":{"renderedLength":4927,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-656"},"422539e1-659":{"renderedLength":5189,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-658"},"422539e1-661":{"renderedLength":2854,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-660"},"422539e1-663":{"renderedLength":1982,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-662"},"422539e1-665":{"renderedLength":2643,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-664"},"422539e1-667":{"renderedLength":3399,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-666"},"422539e1-669":{"renderedLength":3623,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-668"},"422539e1-671":{"renderedLength":3833,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-670"},"422539e1-673":{"renderedLength":4041,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-672"},"422539e1-675":{"renderedLength":4252,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-674"},"422539e1-677":{"renderedLength":4466,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-676"},"422539e1-679":{"renderedLength":4683,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-678"},"422539e1-681":{"renderedLength":4903,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-680"},"422539e1-683":{"renderedLength":5166,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-682"},"422539e1-685":{"renderedLength":2796,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-684"},"422539e1-687":{"renderedLength":8336,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-686"},"422539e1-689":{"renderedLength":633,"gzipLength":0,"brotliLength":0,"metaUid":"422539e1-688"}},"nodeMetas":{"422539e1-0":{"id":"/node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/main.js","moduleParts":{"index.js":"422539e1-1"},"imported":[],"importedBy":[{"uid":"422539e1-690"}]},"422539e1-2":{"id":"/node_modules/@stdlib/array-base-assert-is-booleanarray/lib/main.js","moduleParts":{"index.js":"422539e1-3"},"imported":[],"importedBy":[{"uid":"422539e1-691"}]},"422539e1-4":{"id":"/node_modules/@stdlib/ndarray-base-iteration-order/lib/main.js","moduleParts":{"index.js":"422539e1-5"},"imported":[],"importedBy":[{"uid":"422539e1-692"}]},"422539e1-6":{"id":"/node_modules/@stdlib/utils-define-property/lib/define_property.js","moduleParts":{"index.js":"422539e1-7"},"imported":[],"importedBy":[{"uid":"422539e1-8"}]},"422539e1-8":{"id":"/node_modules/@stdlib/utils-define-property/lib/has_define_property_support.js","moduleParts":{"index.js":"422539e1-9"},"imported":[{"uid":"422539e1-6"}],"importedBy":[{"uid":"422539e1-34"}]},"422539e1-10":{"id":"/node_modules/@stdlib/utils-define-property/lib/builtin.js","moduleParts":{"index.js":"422539e1-11"},"imported":[],"importedBy":[{"uid":"422539e1-34"}]},"422539e1-12":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/is_number.js","moduleParts":{"index.js":"422539e1-13"},"imported":[],"importedBy":[{"uid":"422539e1-24"},{"uid":"422539e1-16"}]},"422539e1-14":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/zero_pad.js","moduleParts":{"index.js":"422539e1-15"},"imported":[],"importedBy":[{"uid":"422539e1-24"},{"uid":"422539e1-16"}]},"422539e1-16":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/format_integer.js","moduleParts":{"index.js":"422539e1-17"},"imported":[{"uid":"422539e1-12"},{"uid":"422539e1-14"}],"importedBy":[{"uid":"422539e1-24"}]},"422539e1-18":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/is_string.js","moduleParts":{"index.js":"422539e1-19"},"imported":[],"importedBy":[{"uid":"422539e1-24"}]},"422539e1-20":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/format_double.js","moduleParts":{"index.js":"422539e1-21"},"imported":[],"importedBy":[{"uid":"422539e1-24"}]},"422539e1-22":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/space_pad.js","moduleParts":{"index.js":"422539e1-23"},"imported":[],"importedBy":[{"uid":"422539e1-24"}]},"422539e1-24":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/main.js","moduleParts":{"index.js":"422539e1-25"},"imported":[{"uid":"422539e1-16"},{"uid":"422539e1-18"},{"uid":"422539e1-12"},{"uid":"422539e1-20"},{"uid":"422539e1-22"},{"uid":"422539e1-14"}],"importedBy":[{"uid":"422539e1-727"}]},"422539e1-26":{"id":"/node_modules/@stdlib/string-base-format-tokenize/lib/main.js","moduleParts":{"index.js":"422539e1-27"},"imported":[],"importedBy":[{"uid":"422539e1-728"}]},"422539e1-28":{"id":"/node_modules/@stdlib/string-format/lib/is_string.js","moduleParts":{"index.js":"422539e1-29"},"imported":[],"importedBy":[{"uid":"422539e1-30"}]},"422539e1-30":{"id":"/node_modules/@stdlib/string-format/lib/main.js","moduleParts":{"index.js":"422539e1-31"},"imported":[{"uid":"422539e1-727"},{"uid":"422539e1-728"},{"uid":"422539e1-28"}],"importedBy":[{"uid":"422539e1-717"}]},"422539e1-32":{"id":"/node_modules/@stdlib/utils-define-property/lib/polyfill.js","moduleParts":{"index.js":"422539e1-33"},"imported":[{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-34"}]},"422539e1-34":{"id":"/node_modules/@stdlib/utils-define-property/lib/index.js","moduleParts":{"index.js":"422539e1-35"},"imported":[{"uid":"422539e1-8"},{"uid":"422539e1-10"},{"uid":"422539e1-32"}],"importedBy":[{"uid":"422539e1-36"},{"uid":"422539e1-400"},{"uid":"422539e1-372"}]},"422539e1-36":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/main.js","moduleParts":{"index.js":"422539e1-37"},"imported":[{"uid":"422539e1-34"}],"importedBy":[{"uid":"422539e1-696"}]},"422539e1-38":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/main.js","moduleParts":{"index.js":"422539e1-39"},"imported":[],"importedBy":[{"uid":"422539e1-42"}]},"422539e1-40":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/assign.js","moduleParts":{"index.js":"422539e1-41"},"imported":[],"importedBy":[{"uid":"422539e1-42"}]},"422539e1-42":{"id":"/node_modules/@stdlib/ndarray-base-minmax-view-buffer-index/lib/index.js","moduleParts":{"index.js":"422539e1-43"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-38"},{"uid":"422539e1-40"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-44":{"id":"/node_modules/@stdlib/array-base-assert-is-accessor-array/lib/main.js","moduleParts":{"index.js":"422539e1-45"},"imported":[],"importedBy":[{"uid":"422539e1-702"}]},"422539e1-46":{"id":"/node_modules/@stdlib/array-base-accessor-getter/lib/main.js","moduleParts":{"index.js":"422539e1-47"},"imported":[],"importedBy":[{"uid":"422539e1-703"}]},"422539e1-48":{"id":"/node_modules/@stdlib/array-base-accessor-setter/lib/main.js","moduleParts":{"index.js":"422539e1-49"},"imported":[],"importedBy":[{"uid":"422539e1-704"}]},"422539e1-50":{"id":"/node_modules/@stdlib/array-base-getter/lib/main.js","moduleParts":{"index.js":"422539e1-51"},"imported":[],"importedBy":[{"uid":"422539e1-705"}]},"422539e1-52":{"id":"/node_modules/@stdlib/array-base-setter/lib/main.js","moduleParts":{"index.js":"422539e1-53"},"imported":[],"importedBy":[{"uid":"422539e1-706"}]},"422539e1-54":{"id":"/node_modules/@stdlib/ndarray-base-numel/lib/main.js","moduleParts":{"index.js":"422539e1-55"},"imported":[],"importedBy":[{"uid":"422539e1-700"}]},"422539e1-56":{"id":"/node_modules/@stdlib/ndarray-base-dtype/lib/main.js","moduleParts":{"index.js":"422539e1-57"},"imported":[],"importedBy":[{"uid":"422539e1-707"}]},"422539e1-58":{"id":"/node_modules/@stdlib/array-base-copy-indexed/lib/main.js","moduleParts":{"index.js":"422539e1-59"},"imported":[],"importedBy":[{"uid":"422539e1-721"}]},"422539e1-60":{"id":"/node_modules/@stdlib/ndarray-base-shape/lib/main.js","moduleParts":{"index.js":"422539e1-61"},"imported":[{"uid":"422539e1-721"}],"importedBy":[{"uid":"422539e1-708"}]},"422539e1-62":{"id":"/node_modules/@stdlib/assert-is-string/lib/primitive.js","moduleParts":{"index.js":"422539e1-63"},"imported":[],"importedBy":[{"uid":"422539e1-90"},{"uid":"422539e1-88"}]},"422539e1-64":{"id":"/node_modules/@stdlib/assert-has-symbol-support/lib/main.js","moduleParts":{"index.js":"422539e1-65"},"imported":[],"importedBy":[{"uid":"422539e1-745"}]},"422539e1-66":{"id":"/node_modules/@stdlib/assert-has-tostringtag-support/lib/main.js","moduleParts":{"index.js":"422539e1-67"},"imported":[{"uid":"422539e1-745"}],"importedBy":[{"uid":"422539e1-734"}]},"422539e1-68":{"id":"/node_modules/@stdlib/utils-native-class/lib/tostring.js","moduleParts":{"index.js":"422539e1-69"},"imported":[],"importedBy":[{"uid":"422539e1-70"},{"uid":"422539e1-78"}]},"422539e1-70":{"id":"/node_modules/@stdlib/utils-native-class/lib/main.js","moduleParts":{"index.js":"422539e1-71"},"imported":[{"uid":"422539e1-68"}],"importedBy":[{"uid":"422539e1-80"}]},"422539e1-72":{"id":"/node_modules/@stdlib/assert-has-own-property/lib/main.js","moduleParts":{"index.js":"422539e1-73"},"imported":[],"importedBy":[{"uid":"422539e1-746"}]},"422539e1-74":{"id":"/node_modules/@stdlib/symbol-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-75"},"imported":[],"importedBy":[{"uid":"422539e1-753"}]},"422539e1-76":{"id":"/node_modules/@stdlib/utils-native-class/lib/tostringtag.js","moduleParts":{"index.js":"422539e1-77"},"imported":[{"uid":"422539e1-753"}],"importedBy":[{"uid":"422539e1-78"}]},"422539e1-78":{"id":"/node_modules/@stdlib/utils-native-class/lib/polyfill.js","moduleParts":{"index.js":"422539e1-79"},"imported":[{"uid":"422539e1-746"},{"uid":"422539e1-76"},{"uid":"422539e1-68"}],"importedBy":[{"uid":"422539e1-80"}]},"422539e1-80":{"id":"/node_modules/@stdlib/utils-native-class/lib/index.js","moduleParts":{"index.js":"422539e1-81"},"imported":[{"uid":"422539e1-734"},{"uid":"422539e1-70"},{"uid":"422539e1-78"}],"importedBy":[{"uid":"422539e1-86"},{"uid":"422539e1-110"},{"uid":"422539e1-166"},{"uid":"422539e1-184"},{"uid":"422539e1-200"},{"uid":"422539e1-134"},{"uid":"422539e1-148"},{"uid":"422539e1-324"},{"uid":"422539e1-340"},{"uid":"422539e1-204"},{"uid":"422539e1-218"},{"uid":"422539e1-234"},{"uid":"422539e1-248"},{"uid":"422539e1-264"},{"uid":"422539e1-276"},{"uid":"422539e1-540"},{"uid":"422539e1-476"},{"uid":"422539e1-534"}]},"422539e1-82":{"id":"/node_modules/@stdlib/assert-is-string/lib/valueof.js","moduleParts":{"index.js":"422539e1-83"},"imported":[],"importedBy":[{"uid":"422539e1-84"}]},"422539e1-84":{"id":"/node_modules/@stdlib/assert-is-string/lib/try2valueof.js","moduleParts":{"index.js":"422539e1-85"},"imported":[{"uid":"422539e1-82"}],"importedBy":[{"uid":"422539e1-86"}]},"422539e1-86":{"id":"/node_modules/@stdlib/assert-is-string/lib/object.js","moduleParts":{"index.js":"422539e1-87"},"imported":[{"uid":"422539e1-734"},{"uid":"422539e1-80"},{"uid":"422539e1-84"}],"importedBy":[{"uid":"422539e1-90"},{"uid":"422539e1-88"}]},"422539e1-88":{"id":"/node_modules/@stdlib/assert-is-string/lib/main.js","moduleParts":{"index.js":"422539e1-89"},"imported":[{"uid":"422539e1-62"},{"uid":"422539e1-86"}],"importedBy":[{"uid":"422539e1-90"}]},"422539e1-90":{"id":"/node_modules/@stdlib/assert-is-string/lib/index.js","moduleParts":{"index.js":"422539e1-91"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-88"},{"uid":"422539e1-62"},{"uid":"422539e1-86"}],"importedBy":[{"uid":"422539e1-100"},{"uid":"422539e1-124"},{"uid":"422539e1-550"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-546"},{"uid":"422539e1-328"},{"uid":"422539e1-494"},{"uid":"422539e1-508"}]},"422539e1-92":{"id":"/node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/main.js","moduleParts":{"index.js":"422539e1-93"},"imported":[],"importedBy":[{"uid":"422539e1-725"}]},"422539e1-94":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/main.js","moduleParts":{"index.js":"422539e1-95"},"imported":[{"uid":"422539e1-725"}],"importedBy":[{"uid":"422539e1-98"}]},"422539e1-96":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/assign.js","moduleParts":{"index.js":"422539e1-97"},"imported":[{"uid":"422539e1-725"}],"importedBy":[{"uid":"422539e1-98"}]},"422539e1-98":{"id":"/node_modules/@stdlib/ndarray-base-shape2strides/lib/index.js","moduleParts":{"index.js":"422539e1-99"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-94"},{"uid":"422539e1-96"}],"importedBy":[{"uid":"422539e1-100"}]},"422539e1-100":{"id":"/node_modules/@stdlib/ndarray-base-strides/lib/main.js","moduleParts":{"index.js":"422539e1-101"},"imported":[{"uid":"422539e1-90"},{"uid":"422539e1-98"},{"uid":"422539e1-721"}],"importedBy":[{"uid":"422539e1-709"}]},"422539e1-102":{"id":"/node_modules/@stdlib/assert-is-number/lib/primitive.js","moduleParts":{"index.js":"422539e1-103"},"imported":[],"importedBy":[{"uid":"422539e1-114"},{"uid":"422539e1-112"}]},"422539e1-104":{"id":"/node_modules/@stdlib/number-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-105"},"imported":[],"importedBy":[{"uid":"422539e1-735"}]},"422539e1-106":{"id":"/node_modules/@stdlib/assert-is-number/lib/tostring.js","moduleParts":{"index.js":"422539e1-107"},"imported":[{"uid":"422539e1-735"}],"importedBy":[{"uid":"422539e1-108"}]},"422539e1-108":{"id":"/node_modules/@stdlib/assert-is-number/lib/try2serialize.js","moduleParts":{"index.js":"422539e1-109"},"imported":[{"uid":"422539e1-106"}],"importedBy":[{"uid":"422539e1-110"}]},"422539e1-110":{"id":"/node_modules/@stdlib/assert-is-number/lib/object.js","moduleParts":{"index.js":"422539e1-111"},"imported":[{"uid":"422539e1-734"},{"uid":"422539e1-80"},{"uid":"422539e1-735"},{"uid":"422539e1-108"}],"importedBy":[{"uid":"422539e1-114"},{"uid":"422539e1-112"}]},"422539e1-112":{"id":"/node_modules/@stdlib/assert-is-number/lib/main.js","moduleParts":{"index.js":"422539e1-113"},"imported":[{"uid":"422539e1-102"},{"uid":"422539e1-110"}],"importedBy":[{"uid":"422539e1-114"}]},"422539e1-114":{"id":"/node_modules/@stdlib/assert-is-number/lib/index.js","moduleParts":{"index.js":"422539e1-115"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-112"},{"uid":"422539e1-102"},{"uid":"422539e1-110"}],"importedBy":[{"uid":"422539e1-118"},{"uid":"422539e1-550"},{"uid":"422539e1-390"},{"uid":"422539e1-378"},{"uid":"422539e1-300"},{"uid":"422539e1-302"},{"uid":"422539e1-482"},{"uid":"422539e1-484"}]},"422539e1-116":{"id":"/node_modules/@stdlib/ndarray-base-strides2offset/lib/main.js","moduleParts":{"index.js":"422539e1-117"},"imported":[],"importedBy":[{"uid":"422539e1-726"}]},"422539e1-118":{"id":"/node_modules/@stdlib/ndarray-base-offset/lib/main.js","moduleParts":{"index.js":"422539e1-119"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-726"}],"importedBy":[{"uid":"422539e1-710"}]},"422539e1-120":{"id":"/node_modules/@stdlib/math-base-special-abs/lib/main.js","moduleParts":{"index.js":"422539e1-121"},"imported":[],"importedBy":[{"uid":"422539e1-724"}]},"422539e1-122":{"id":"/node_modules/@stdlib/ndarray-base-strides2order/lib/main.js","moduleParts":{"index.js":"422539e1-123"},"imported":[{"uid":"422539e1-724"}],"importedBy":[{"uid":"422539e1-699"}]},"422539e1-124":{"id":"/node_modules/@stdlib/ndarray-base-order/lib/main.js","moduleParts":{"index.js":"422539e1-125"},"imported":[{"uid":"422539e1-90"},{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-711"}]},"422539e1-126":{"id":"/node_modules/@stdlib/ndarray-base-data-buffer/lib/main.js","moduleParts":{"index.js":"422539e1-127"},"imported":[],"importedBy":[{"uid":"422539e1-712"}]},"422539e1-128":{"id":"/node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/main.js","moduleParts":{"index.js":"422539e1-129"},"imported":[{"uid":"422539e1-702"},{"uid":"422539e1-703"},{"uid":"422539e1-704"},{"uid":"422539e1-705"},{"uid":"422539e1-706"},{"uid":"422539e1-700"},{"uid":"422539e1-707"},{"uid":"422539e1-708"},{"uid":"422539e1-709"},{"uid":"422539e1-710"},{"uid":"422539e1-711"},{"uid":"422539e1-712"}],"importedBy":[{"uid":"422539e1-693"}]},"422539e1-130":{"id":"/node_modules/@stdlib/array-base-assert-is-complex128array/lib/main.js","moduleParts":{"index.js":"422539e1-131"},"imported":[],"importedBy":[{"uid":"422539e1-713"}]},"422539e1-132":{"id":"/node_modules/@stdlib/array-base-assert-is-complex64array/lib/main.js","moduleParts":{"index.js":"422539e1-133"},"imported":[],"importedBy":[{"uid":"422539e1-714"}]},"422539e1-134":{"id":"/node_modules/@stdlib/assert-is-float64array/lib/main.js","moduleParts":{"index.js":"422539e1-135"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-739"}]},"422539e1-136":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/float64array.js","moduleParts":{"index.js":"422539e1-137"},"imported":[],"importedBy":[{"uid":"422539e1-138"}]},"422539e1-138":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/main.js","moduleParts":{"index.js":"422539e1-139"},"imported":[{"uid":"422539e1-739"},{"uid":"422539e1-136"}],"importedBy":[{"uid":"422539e1-730"}]},"422539e1-140":{"id":"/node_modules/@stdlib/array-float64/lib/main.js","moduleParts":{"index.js":"422539e1-141"},"imported":[],"importedBy":[{"uid":"422539e1-144"}]},"422539e1-142":{"id":"/node_modules/@stdlib/array-float64/lib/polyfill.js","moduleParts":{"index.js":"422539e1-143"},"imported":[],"importedBy":[{"uid":"422539e1-144"}]},"422539e1-144":{"id":"/node_modules/@stdlib/array-float64/lib/index.js","moduleParts":{"index.js":"422539e1-145"},"imported":[{"uid":"422539e1-730"},{"uid":"422539e1-140"},{"uid":"422539e1-142"}],"importedBy":[{"uid":"422539e1-146"},{"uid":"422539e1-434"},{"uid":"422539e1-424"}]},"422539e1-146":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex128/lib/main.js","moduleParts":{"index.js":"422539e1-147"},"imported":[{"uid":"422539e1-144"}],"importedBy":[{"uid":"422539e1-715"}]},"422539e1-148":{"id":"/node_modules/@stdlib/assert-is-float32array/lib/main.js","moduleParts":{"index.js":"422539e1-149"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-740"}]},"422539e1-150":{"id":"/node_modules/@stdlib/constants-float64-pinf/lib/index.js","moduleParts":{"index.js":"422539e1-151"},"imported":[],"importedBy":[{"uid":"422539e1-154"},{"uid":"422539e1-298"}]},"422539e1-152":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/float32array.js","moduleParts":{"index.js":"422539e1-153"},"imported":[],"importedBy":[{"uid":"422539e1-154"}]},"422539e1-154":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/main.js","moduleParts":{"index.js":"422539e1-155"},"imported":[{"uid":"422539e1-740"},{"uid":"422539e1-150"},{"uid":"422539e1-152"}],"importedBy":[{"uid":"422539e1-731"}]},"422539e1-156":{"id":"/node_modules/@stdlib/array-float32/lib/main.js","moduleParts":{"index.js":"422539e1-157"},"imported":[],"importedBy":[{"uid":"422539e1-160"}]},"422539e1-158":{"id":"/node_modules/@stdlib/array-float32/lib/polyfill.js","moduleParts":{"index.js":"422539e1-159"},"imported":[],"importedBy":[{"uid":"422539e1-160"}]},"422539e1-160":{"id":"/node_modules/@stdlib/array-float32/lib/index.js","moduleParts":{"index.js":"422539e1-161"},"imported":[{"uid":"422539e1-731"},{"uid":"422539e1-156"},{"uid":"422539e1-158"}],"importedBy":[{"uid":"422539e1-162"},{"uid":"422539e1-434"},{"uid":"422539e1-412"},{"uid":"422539e1-382"}]},"422539e1-162":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex64/lib/main.js","moduleParts":{"index.js":"422539e1-163"},"imported":[{"uid":"422539e1-160"}],"importedBy":[{"uid":"422539e1-716"}]},"422539e1-164":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex/lib/main.js","moduleParts":{"index.js":"422539e1-165"},"imported":[{"uid":"422539e1-713"},{"uid":"422539e1-714"},{"uid":"422539e1-715"},{"uid":"422539e1-716"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-694"}]},"422539e1-166":{"id":"/node_modules/@stdlib/assert-is-uint8array/lib/main.js","moduleParts":{"index.js":"422539e1-167"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-732"}]},"422539e1-168":{"id":"/node_modules/@stdlib/constants-uint8-max/lib/index.js","moduleParts":{"index.js":"422539e1-169"},"imported":[],"importedBy":[{"uid":"422539e1-172"}]},"422539e1-170":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/uint8array.js","moduleParts":{"index.js":"422539e1-171"},"imported":[],"importedBy":[{"uid":"422539e1-172"}]},"422539e1-172":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/main.js","moduleParts":{"index.js":"422539e1-173"},"imported":[{"uid":"422539e1-732"},{"uid":"422539e1-168"},{"uid":"422539e1-170"}],"importedBy":[{"uid":"422539e1-720"}]},"422539e1-174":{"id":"/node_modules/@stdlib/array-uint8/lib/main.js","moduleParts":{"index.js":"422539e1-175"},"imported":[],"importedBy":[{"uid":"422539e1-178"}]},"422539e1-176":{"id":"/node_modules/@stdlib/array-uint8/lib/polyfill.js","moduleParts":{"index.js":"422539e1-177"},"imported":[],"importedBy":[{"uid":"422539e1-178"}]},"422539e1-178":{"id":"/node_modules/@stdlib/array-uint8/lib/index.js","moduleParts":{"index.js":"422539e1-179"},"imported":[{"uid":"422539e1-720"},{"uid":"422539e1-174"},{"uid":"422539e1-176"}],"importedBy":[{"uid":"422539e1-180"},{"uid":"422539e1-434"},{"uid":"422539e1-432"}]},"422539e1-180":{"id":"/node_modules/@stdlib/strided-base-reinterpret-boolean/lib/main.js","moduleParts":{"index.js":"422539e1-181"},"imported":[{"uid":"422539e1-178"}],"importedBy":[{"uid":"422539e1-695"}]},"422539e1-182":{"id":"/node_modules/@stdlib/strided-base-stride2offset/lib/main.js","moduleParts":{"index.js":"422539e1-183"},"imported":[],"importedBy":[{"uid":"422539e1-718"}]},"422539e1-184":{"id":"/node_modules/@stdlib/assert-is-array/lib/main.js","moduleParts":{"index.js":"422539e1-185"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-737"}]},"422539e1-186":{"id":"/node_modules/@stdlib/assert-tools-array-function/lib/main.js","moduleParts":{"index.js":"422539e1-187"},"imported":[{"uid":"422539e1-737"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-754"}]},"422539e1-188":{"id":"/node_modules/@stdlib/assert-is-object-like/lib/main.js","moduleParts":{"index.js":"422539e1-189"},"imported":[],"importedBy":[{"uid":"422539e1-190"}]},"422539e1-190":{"id":"/node_modules/@stdlib/assert-is-object-like/lib/index.js","moduleParts":{"index.js":"422539e1-191"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-754"},{"uid":"422539e1-188"}],"importedBy":[{"uid":"422539e1-192"},{"uid":"422539e1-542"},{"uid":"422539e1-524"}]},"422539e1-192":{"id":"/node_modules/@stdlib/assert-is-buffer/lib/main.js","moduleParts":{"index.js":"422539e1-193"},"imported":[{"uid":"422539e1-190"}],"importedBy":[{"uid":"422539e1-736"}]},"422539e1-194":{"id":"/node_modules/@stdlib/regexp-function-name/lib/main.js","moduleParts":{"index.js":"422539e1-195"},"imported":[],"importedBy":[{"uid":"422539e1-198"},{"uid":"422539e1-196"}]},"422539e1-196":{"id":"/node_modules/@stdlib/regexp-function-name/lib/regexp.js","moduleParts":{"index.js":"422539e1-197"},"imported":[{"uid":"422539e1-194"}],"importedBy":[{"uid":"422539e1-198"}]},"422539e1-198":{"id":"/node_modules/@stdlib/regexp-function-name/lib/index.js","moduleParts":{"index.js":"422539e1-199"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-194"},{"uid":"422539e1-196"}],"importedBy":[{"uid":"422539e1-200"}]},"422539e1-200":{"id":"/node_modules/@stdlib/utils-constructor-name/lib/main.js","moduleParts":{"index.js":"422539e1-201"},"imported":[{"uid":"422539e1-80"},{"uid":"422539e1-198"},{"uid":"422539e1-736"}],"importedBy":[{"uid":"422539e1-738"}]},"422539e1-202":{"id":"/node_modules/@stdlib/array-dtype/lib/ctor2dtype.js","moduleParts":{"index.js":"422539e1-203"},"imported":[],"importedBy":[{"uid":"422539e1-438"}]},"422539e1-204":{"id":"/node_modules/@stdlib/assert-is-uint32array/lib/main.js","moduleParts":{"index.js":"422539e1-205"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-776"}]},"422539e1-206":{"id":"/node_modules/@stdlib/constants-uint32-max/lib/index.js","moduleParts":{"index.js":"422539e1-207"},"imported":[],"importedBy":[{"uid":"422539e1-210"},{"uid":"422539e1-496"}]},"422539e1-208":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/uint32array.js","moduleParts":{"index.js":"422539e1-209"},"imported":[],"importedBy":[{"uid":"422539e1-210"}]},"422539e1-210":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/main.js","moduleParts":{"index.js":"422539e1-211"},"imported":[{"uid":"422539e1-776"},{"uid":"422539e1-206"},{"uid":"422539e1-208"}],"importedBy":[{"uid":"422539e1-747"}]},"422539e1-212":{"id":"/node_modules/@stdlib/array-uint32/lib/main.js","moduleParts":{"index.js":"422539e1-213"},"imported":[],"importedBy":[{"uid":"422539e1-216"}]},"422539e1-214":{"id":"/node_modules/@stdlib/array-uint32/lib/polyfill.js","moduleParts":{"index.js":"422539e1-215"},"imported":[],"importedBy":[{"uid":"422539e1-216"}]},"422539e1-216":{"id":"/node_modules/@stdlib/array-uint32/lib/index.js","moduleParts":{"index.js":"422539e1-217"},"imported":[{"uid":"422539e1-747"},{"uid":"422539e1-212"},{"uid":"422539e1-214"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-218":{"id":"/node_modules/@stdlib/assert-is-int32array/lib/main.js","moduleParts":{"index.js":"422539e1-219"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-777"}]},"422539e1-220":{"id":"/node_modules/@stdlib/constants-int32-max/lib/index.js","moduleParts":{"index.js":"422539e1-221"},"imported":[],"importedBy":[{"uid":"422539e1-226"}]},"422539e1-222":{"id":"/node_modules/@stdlib/constants-int32-min/lib/index.js","moduleParts":{"index.js":"422539e1-223"},"imported":[],"importedBy":[{"uid":"422539e1-226"}]},"422539e1-224":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/int32array.js","moduleParts":{"index.js":"422539e1-225"},"imported":[],"importedBy":[{"uid":"422539e1-226"}]},"422539e1-226":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/main.js","moduleParts":{"index.js":"422539e1-227"},"imported":[{"uid":"422539e1-777"},{"uid":"422539e1-220"},{"uid":"422539e1-222"},{"uid":"422539e1-224"}],"importedBy":[{"uid":"422539e1-748"}]},"422539e1-228":{"id":"/node_modules/@stdlib/array-int32/lib/main.js","moduleParts":{"index.js":"422539e1-229"},"imported":[],"importedBy":[{"uid":"422539e1-232"}]},"422539e1-230":{"id":"/node_modules/@stdlib/array-int32/lib/polyfill.js","moduleParts":{"index.js":"422539e1-231"},"imported":[],"importedBy":[{"uid":"422539e1-232"}]},"422539e1-232":{"id":"/node_modules/@stdlib/array-int32/lib/index.js","moduleParts":{"index.js":"422539e1-233"},"imported":[{"uid":"422539e1-748"},{"uid":"422539e1-228"},{"uid":"422539e1-230"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-234":{"id":"/node_modules/@stdlib/assert-is-uint16array/lib/main.js","moduleParts":{"index.js":"422539e1-235"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-778"}]},"422539e1-236":{"id":"/node_modules/@stdlib/constants-uint16-max/lib/index.js","moduleParts":{"index.js":"422539e1-237"},"imported":[],"importedBy":[{"uid":"422539e1-240"}]},"422539e1-238":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/uint16array.js","moduleParts":{"index.js":"422539e1-239"},"imported":[],"importedBy":[{"uid":"422539e1-240"}]},"422539e1-240":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/main.js","moduleParts":{"index.js":"422539e1-241"},"imported":[{"uid":"422539e1-778"},{"uid":"422539e1-236"},{"uid":"422539e1-238"}],"importedBy":[{"uid":"422539e1-749"}]},"422539e1-242":{"id":"/node_modules/@stdlib/array-uint16/lib/main.js","moduleParts":{"index.js":"422539e1-243"},"imported":[],"importedBy":[{"uid":"422539e1-246"}]},"422539e1-244":{"id":"/node_modules/@stdlib/array-uint16/lib/polyfill.js","moduleParts":{"index.js":"422539e1-245"},"imported":[],"importedBy":[{"uid":"422539e1-246"}]},"422539e1-246":{"id":"/node_modules/@stdlib/array-uint16/lib/index.js","moduleParts":{"index.js":"422539e1-247"},"imported":[{"uid":"422539e1-749"},{"uid":"422539e1-242"},{"uid":"422539e1-244"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-248":{"id":"/node_modules/@stdlib/assert-is-int16array/lib/main.js","moduleParts":{"index.js":"422539e1-249"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-779"}]},"422539e1-250":{"id":"/node_modules/@stdlib/constants-int16-max/lib/index.js","moduleParts":{"index.js":"422539e1-251"},"imported":[],"importedBy":[{"uid":"422539e1-256"}]},"422539e1-252":{"id":"/node_modules/@stdlib/constants-int16-min/lib/index.js","moduleParts":{"index.js":"422539e1-253"},"imported":[],"importedBy":[{"uid":"422539e1-256"}]},"422539e1-254":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/int16array.js","moduleParts":{"index.js":"422539e1-255"},"imported":[],"importedBy":[{"uid":"422539e1-256"}]},"422539e1-256":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/main.js","moduleParts":{"index.js":"422539e1-257"},"imported":[{"uid":"422539e1-779"},{"uid":"422539e1-250"},{"uid":"422539e1-252"},{"uid":"422539e1-254"}],"importedBy":[{"uid":"422539e1-750"}]},"422539e1-258":{"id":"/node_modules/@stdlib/array-int16/lib/main.js","moduleParts":{"index.js":"422539e1-259"},"imported":[],"importedBy":[{"uid":"422539e1-262"}]},"422539e1-260":{"id":"/node_modules/@stdlib/array-int16/lib/polyfill.js","moduleParts":{"index.js":"422539e1-261"},"imported":[],"importedBy":[{"uid":"422539e1-262"}]},"422539e1-262":{"id":"/node_modules/@stdlib/array-int16/lib/index.js","moduleParts":{"index.js":"422539e1-263"},"imported":[{"uid":"422539e1-750"},{"uid":"422539e1-258"},{"uid":"422539e1-260"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-264":{"id":"/node_modules/@stdlib/assert-is-uint8clampedarray/lib/main.js","moduleParts":{"index.js":"422539e1-265"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-780"}]},"422539e1-266":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/uint8clampedarray.js","moduleParts":{"index.js":"422539e1-267"},"imported":[],"importedBy":[{"uid":"422539e1-268"}]},"422539e1-268":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/main.js","moduleParts":{"index.js":"422539e1-269"},"imported":[{"uid":"422539e1-780"},{"uid":"422539e1-266"}],"importedBy":[{"uid":"422539e1-751"}]},"422539e1-270":{"id":"/node_modules/@stdlib/array-uint8c/lib/main.js","moduleParts":{"index.js":"422539e1-271"},"imported":[],"importedBy":[{"uid":"422539e1-274"}]},"422539e1-272":{"id":"/node_modules/@stdlib/array-uint8c/lib/polyfill.js","moduleParts":{"index.js":"422539e1-273"},"imported":[],"importedBy":[{"uid":"422539e1-274"}]},"422539e1-274":{"id":"/node_modules/@stdlib/array-uint8c/lib/index.js","moduleParts":{"index.js":"422539e1-275"},"imported":[{"uid":"422539e1-751"},{"uid":"422539e1-270"},{"uid":"422539e1-272"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-276":{"id":"/node_modules/@stdlib/assert-is-int8array/lib/main.js","moduleParts":{"index.js":"422539e1-277"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-781"}]},"422539e1-278":{"id":"/node_modules/@stdlib/constants-int8-max/lib/index.js","moduleParts":{"index.js":"422539e1-279"},"imported":[],"importedBy":[{"uid":"422539e1-284"}]},"422539e1-280":{"id":"/node_modules/@stdlib/constants-int8-min/lib/index.js","moduleParts":{"index.js":"422539e1-281"},"imported":[],"importedBy":[{"uid":"422539e1-284"}]},"422539e1-282":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/int8array.js","moduleParts":{"index.js":"422539e1-283"},"imported":[],"importedBy":[{"uid":"422539e1-284"}]},"422539e1-284":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/main.js","moduleParts":{"index.js":"422539e1-285"},"imported":[{"uid":"422539e1-781"},{"uid":"422539e1-278"},{"uid":"422539e1-280"},{"uid":"422539e1-282"}],"importedBy":[{"uid":"422539e1-752"}]},"422539e1-286":{"id":"/node_modules/@stdlib/array-int8/lib/main.js","moduleParts":{"index.js":"422539e1-287"},"imported":[],"importedBy":[{"uid":"422539e1-290"}]},"422539e1-288":{"id":"/node_modules/@stdlib/array-int8/lib/polyfill.js","moduleParts":{"index.js":"422539e1-289"},"imported":[],"importedBy":[{"uid":"422539e1-290"}]},"422539e1-290":{"id":"/node_modules/@stdlib/array-int8/lib/index.js","moduleParts":{"index.js":"422539e1-291"},"imported":[{"uid":"422539e1-752"},{"uid":"422539e1-286"},{"uid":"422539e1-288"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-292":{"id":"/node_modules/@stdlib/constants-float64-ninf/lib/index.js","moduleParts":{"index.js":"422539e1-293"},"imported":[{"uid":"422539e1-735"}],"importedBy":[{"uid":"422539e1-298"}]},"422539e1-294":{"id":"/node_modules/@stdlib/math-base-special-floor/lib/main.js","moduleParts":{"index.js":"422539e1-295"},"imported":[],"importedBy":[{"uid":"422539e1-769"}]},"422539e1-296":{"id":"/node_modules/@stdlib/math-base-assert-is-integer/lib/main.js","moduleParts":{"index.js":"422539e1-297"},"imported":[{"uid":"422539e1-769"}],"importedBy":[{"uid":"422539e1-762"}]},"422539e1-298":{"id":"/node_modules/@stdlib/assert-is-integer/lib/integer.js","moduleParts":{"index.js":"422539e1-299"},"imported":[{"uid":"422539e1-150"},{"uid":"422539e1-292"},{"uid":"422539e1-762"}],"importedBy":[{"uid":"422539e1-300"},{"uid":"422539e1-302"}]},"422539e1-300":{"id":"/node_modules/@stdlib/assert-is-integer/lib/primitive.js","moduleParts":{"index.js":"422539e1-301"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-298"}],"importedBy":[{"uid":"422539e1-306"},{"uid":"422539e1-304"}]},"422539e1-302":{"id":"/node_modules/@stdlib/assert-is-integer/lib/object.js","moduleParts":{"index.js":"422539e1-303"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-298"}],"importedBy":[{"uid":"422539e1-306"},{"uid":"422539e1-304"}]},"422539e1-304":{"id":"/node_modules/@stdlib/assert-is-integer/lib/main.js","moduleParts":{"index.js":"422539e1-305"},"imported":[{"uid":"422539e1-300"},{"uid":"422539e1-302"}],"importedBy":[{"uid":"422539e1-306"}]},"422539e1-306":{"id":"/node_modules/@stdlib/assert-is-integer/lib/index.js","moduleParts":{"index.js":"422539e1-307"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-304"},{"uid":"422539e1-300"},{"uid":"422539e1-302"}],"importedBy":[{"uid":"422539e1-432"},{"uid":"422539e1-462"},{"uid":"422539e1-464"},{"uid":"422539e1-308"},{"uid":"422539e1-310"},{"uid":"422539e1-494"},{"uid":"422539e1-508"}]},"422539e1-308":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/primitive.js","moduleParts":{"index.js":"422539e1-309"},"imported":[{"uid":"422539e1-306"}],"importedBy":[{"uid":"422539e1-314"},{"uid":"422539e1-312"}]},"422539e1-310":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/object.js","moduleParts":{"index.js":"422539e1-311"},"imported":[{"uid":"422539e1-306"}],"importedBy":[{"uid":"422539e1-314"},{"uid":"422539e1-312"}]},"422539e1-312":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/main.js","moduleParts":{"index.js":"422539e1-313"},"imported":[{"uid":"422539e1-308"},{"uid":"422539e1-310"}],"importedBy":[{"uid":"422539e1-314"}]},"422539e1-314":{"id":"/node_modules/@stdlib/assert-is-nonnegative-integer/lib/index.js","moduleParts":{"index.js":"422539e1-315"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-312"},{"uid":"422539e1-308"},{"uid":"422539e1-310"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-316":{"id":"/node_modules/@stdlib/constants-array-max-array-length/lib/index.js","moduleParts":{"index.js":"422539e1-317"},"imported":[],"importedBy":[{"uid":"422539e1-318"}]},"422539e1-318":{"id":"/node_modules/@stdlib/assert-is-array-like-object/lib/main.js","moduleParts":{"index.js":"422539e1-319"},"imported":[{"uid":"422539e1-762"},{"uid":"422539e1-316"}],"importedBy":[{"uid":"422539e1-755"}]},"422539e1-320":{"id":"/node_modules/@stdlib/constants-array-max-typed-array-length/lib/index.js","moduleParts":{"index.js":"422539e1-321"},"imported":[],"importedBy":[{"uid":"422539e1-322"}]},"422539e1-322":{"id":"/node_modules/@stdlib/assert-is-collection/lib/main.js","moduleParts":{"index.js":"422539e1-323"},"imported":[{"uid":"422539e1-762"},{"uid":"422539e1-320"}],"importedBy":[{"uid":"422539e1-756"}]},"422539e1-324":{"id":"/node_modules/@stdlib/assert-is-arraybuffer/lib/main.js","moduleParts":{"index.js":"422539e1-325"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-757"}]},"422539e1-326":{"id":"/node_modules/@stdlib/assert-is-object/lib/main.js","moduleParts":{"index.js":"422539e1-327"},"imported":[{"uid":"422539e1-737"}],"importedBy":[{"uid":"422539e1-758"}]},"422539e1-328":{"id":"/node_modules/@stdlib/assert-is-string-array/lib/index.js","moduleParts":{"index.js":"422539e1-329"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-754"},{"uid":"422539e1-90"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-330":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/re.js","moduleParts":{"index.js":"422539e1-331"},"imported":[],"importedBy":[{"uid":"422539e1-362"}]},"422539e1-332":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/primitive.js","moduleParts":{"index.js":"422539e1-333"},"imported":[],"importedBy":[{"uid":"422539e1-344"},{"uid":"422539e1-342"}]},"422539e1-334":{"id":"/node_modules/@stdlib/boolean-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-335"},"imported":[],"importedBy":[{"uid":"422539e1-773"}]},"422539e1-336":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/tostring.js","moduleParts":{"index.js":"422539e1-337"},"imported":[],"importedBy":[{"uid":"422539e1-338"}]},"422539e1-338":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/try2serialize.js","moduleParts":{"index.js":"422539e1-339"},"imported":[{"uid":"422539e1-336"}],"importedBy":[{"uid":"422539e1-340"}]},"422539e1-340":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/object.js","moduleParts":{"index.js":"422539e1-341"},"imported":[{"uid":"422539e1-734"},{"uid":"422539e1-80"},{"uid":"422539e1-773"},{"uid":"422539e1-338"}],"importedBy":[{"uid":"422539e1-344"},{"uid":"422539e1-342"}]},"422539e1-342":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/main.js","moduleParts":{"index.js":"422539e1-343"},"imported":[{"uid":"422539e1-332"},{"uid":"422539e1-340"}],"importedBy":[{"uid":"422539e1-344"}]},"422539e1-344":{"id":"/node_modules/@stdlib/assert-is-boolean/lib/index.js","moduleParts":{"index.js":"422539e1-345"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-342"},{"uid":"422539e1-332"},{"uid":"422539e1-340"}],"importedBy":[{"uid":"422539e1-432"},{"uid":"422539e1-542"},{"uid":"422539e1-356"}]},"422539e1-346":{"id":"/node_modules/@stdlib/utils-global/lib/codegen.js","moduleParts":{"index.js":"422539e1-347"},"imported":[],"importedBy":[{"uid":"422539e1-356"}]},"422539e1-348":{"id":"/node_modules/@stdlib/utils-global/lib/self.js","moduleParts":{"index.js":"422539e1-349"},"imported":[],"importedBy":[{"uid":"422539e1-356"}]},"422539e1-350":{"id":"/node_modules/@stdlib/utils-global/lib/window.js","moduleParts":{"index.js":"422539e1-351"},"imported":[],"importedBy":[{"uid":"422539e1-356"}]},"422539e1-352":{"id":"/node_modules/@stdlib/utils-global/lib/global.js","moduleParts":{"index.js":"422539e1-353"},"imported":[],"importedBy":[{"uid":"422539e1-356"}]},"422539e1-354":{"id":"/node_modules/@stdlib/utils-global/lib/global_this.js","moduleParts":{"index.js":"422539e1-355"},"imported":[],"importedBy":[{"uid":"422539e1-356"}]},"422539e1-356":{"id":"/node_modules/@stdlib/utils-global/lib/main.js","moduleParts":{"index.js":"422539e1-357"},"imported":[{"uid":"422539e1-344"},{"uid":"422539e1-717"},{"uid":"422539e1-346"},{"uid":"422539e1-348"},{"uid":"422539e1-350"},{"uid":"422539e1-352"},{"uid":"422539e1-354"}],"importedBy":[{"uid":"422539e1-786"}]},"422539e1-358":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/nodelist.js","moduleParts":{"index.js":"422539e1-359"},"imported":[{"uid":"422539e1-786"}],"importedBy":[{"uid":"422539e1-362"}]},"422539e1-360":{"id":"/node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js","moduleParts":{"index.js":"422539e1-361"},"imported":[],"importedBy":[{"uid":"422539e1-362"}]},"422539e1-362":{"id":"/node_modules/@stdlib/utils-type-of/lib/check.js","moduleParts":{"index.js":"422539e1-363"},"imported":[{"uid":"422539e1-330"},{"uid":"422539e1-358"},{"uid":"422539e1-360"}],"importedBy":[{"uid":"422539e1-368"}]},"422539e1-364":{"id":"/node_modules/@stdlib/utils-type-of/lib/main.js","moduleParts":{"index.js":"422539e1-365"},"imported":[{"uid":"422539e1-738"}],"importedBy":[{"uid":"422539e1-368"}]},"422539e1-366":{"id":"/node_modules/@stdlib/utils-type-of/lib/polyfill.js","moduleParts":{"index.js":"422539e1-367"},"imported":[{"uid":"422539e1-738"}],"importedBy":[{"uid":"422539e1-368"}]},"422539e1-368":{"id":"/node_modules/@stdlib/utils-type-of/lib/index.js","moduleParts":{"index.js":"422539e1-369"},"imported":[{"uid":"422539e1-362"},{"uid":"422539e1-364"},{"uid":"422539e1-366"}],"importedBy":[{"uid":"422539e1-370"},{"uid":"422539e1-516"}]},"422539e1-370":{"id":"/node_modules/@stdlib/assert-is-function/lib/main.js","moduleParts":{"index.js":"422539e1-371"},"imported":[{"uid":"422539e1-368"}],"importedBy":[{"uid":"422539e1-759"}]},"422539e1-372":{"id":"/node_modules/@stdlib/utils-define-read-only-property/lib/main.js","moduleParts":{"index.js":"422539e1-373"},"imported":[{"uid":"422539e1-34"}],"importedBy":[{"uid":"422539e1-782"}]},"422539e1-374":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/tostring.js","moduleParts":{"index.js":"422539e1-375"},"imported":[],"importedBy":[{"uid":"422539e1-378"}]},"422539e1-376":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/tojson.js","moduleParts":{"index.js":"422539e1-377"},"imported":[],"importedBy":[{"uid":"422539e1-378"}]},"422539e1-378":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-379"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-782"},{"uid":"422539e1-696"},{"uid":"422539e1-717"},{"uid":"422539e1-374"},{"uid":"422539e1-376"}],"importedBy":[{"uid":"422539e1-770"}]},"422539e1-380":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/main.js","moduleParts":{"index.js":"422539e1-381"},"imported":[],"importedBy":[{"uid":"422539e1-384"}]},"422539e1-382":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/polyfill.js","moduleParts":{"index.js":"422539e1-383"},"imported":[{"uid":"422539e1-160"}],"importedBy":[{"uid":"422539e1-384"}]},"422539e1-384":{"id":"/node_modules/@stdlib/number-float64-base-to-float32/lib/index.js","moduleParts":{"index.js":"422539e1-385"},"imported":[{"uid":"422539e1-380"},{"uid":"422539e1-382"}],"importedBy":[{"uid":"422539e1-390"}]},"422539e1-386":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/tostring.js","moduleParts":{"index.js":"422539e1-387"},"imported":[],"importedBy":[{"uid":"422539e1-390"}]},"422539e1-388":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/tojson.js","moduleParts":{"index.js":"422539e1-389"},"imported":[],"importedBy":[{"uid":"422539e1-390"}]},"422539e1-390":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-391"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-782"},{"uid":"422539e1-696"},{"uid":"422539e1-384"},{"uid":"422539e1-717"},{"uid":"422539e1-386"},{"uid":"422539e1-388"}],"importedBy":[{"uid":"422539e1-766"}]},"422539e1-392":{"id":"/node_modules/@stdlib/assert-is-complex-like/lib/main.js","moduleParts":{"index.js":"422539e1-393"},"imported":[{"uid":"422539e1-770"},{"uid":"422539e1-766"}],"importedBy":[{"uid":"422539e1-760"}]},"422539e1-394":{"id":"/node_modules/@stdlib/math-base-assert-is-even/lib/main.js","moduleParts":{"index.js":"422539e1-395"},"imported":[{"uid":"422539e1-762"}],"importedBy":[{"uid":"422539e1-761"}]},"422539e1-396":{"id":"/node_modules/@stdlib/assert-has-iterator-symbol-support/lib/main.js","moduleParts":{"index.js":"422539e1-397"},"imported":[{"uid":"422539e1-746"},{"uid":"422539e1-753"}],"importedBy":[{"uid":"422539e1-763"}]},"422539e1-398":{"id":"/node_modules/@stdlib/symbol-iterator/lib/main.js","moduleParts":{"index.js":"422539e1-399"},"imported":[{"uid":"422539e1-763"}],"importedBy":[{"uid":"422539e1-764"}]},"422539e1-400":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/main.js","moduleParts":{"index.js":"422539e1-401"},"imported":[{"uid":"422539e1-34"}],"importedBy":[{"uid":"422539e1-765"}]},"422539e1-402":{"id":"/node_modules/@stdlib/complex-float32-real/lib/main.js","moduleParts":{"index.js":"422539e1-403"},"imported":[],"importedBy":[{"uid":"422539e1-767"}]},"422539e1-404":{"id":"/node_modules/@stdlib/complex-float32-imag/lib/main.js","moduleParts":{"index.js":"422539e1-405"},"imported":[],"importedBy":[{"uid":"422539e1-768"}]},"422539e1-406":{"id":"/node_modules/@stdlib/array-complex64/lib/from_iterator.js","moduleParts":{"index.js":"422539e1-407"},"imported":[{"uid":"422539e1-755"},{"uid":"422539e1-760"},{"uid":"422539e1-767"},{"uid":"422539e1-768"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-412"}]},"422539e1-408":{"id":"/node_modules/@stdlib/array-complex64/lib/from_iterator_map.js","moduleParts":{"index.js":"422539e1-409"},"imported":[{"uid":"422539e1-755"},{"uid":"422539e1-760"},{"uid":"422539e1-767"},{"uid":"422539e1-768"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-412"}]},"422539e1-410":{"id":"/node_modules/@stdlib/array-complex64/lib/from_array.js","moduleParts":{"index.js":"422539e1-411"},"imported":[{"uid":"422539e1-760"},{"uid":"422539e1-767"},{"uid":"422539e1-768"}],"importedBy":[{"uid":"422539e1-412"}]},"422539e1-412":{"id":"/node_modules/@stdlib/array-complex64/lib/main.js","moduleParts":{"index.js":"422539e1-413"},"imported":[{"uid":"422539e1-314"},{"uid":"422539e1-755"},{"uid":"422539e1-756"},{"uid":"422539e1-757"},{"uid":"422539e1-758"},{"uid":"422539e1-737"},{"uid":"422539e1-328"},{"uid":"422539e1-90"},{"uid":"422539e1-759"},{"uid":"422539e1-760"},{"uid":"422539e1-761"},{"uid":"422539e1-762"},{"uid":"422539e1-714"},{"uid":"422539e1-713"},{"uid":"422539e1-763"},{"uid":"422539e1-764"},{"uid":"422539e1-696"},{"uid":"422539e1-765"},{"uid":"422539e1-160"},{"uid":"422539e1-766"},{"uid":"422539e1-717"},{"uid":"422539e1-767"},{"uid":"422539e1-768"},{"uid":"422539e1-769"},{"uid":"422539e1-716"},{"uid":"422539e1-715"},{"uid":"422539e1-705"},{"uid":"422539e1-703"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-410"}],"importedBy":[{"uid":"422539e1-741"}]},"422539e1-414":{"id":"/node_modules/@stdlib/complex-float64-real/lib/main.js","moduleParts":{"index.js":"422539e1-415"},"imported":[],"importedBy":[{"uid":"422539e1-771"}]},"422539e1-416":{"id":"/node_modules/@stdlib/complex-float64-imag/lib/main.js","moduleParts":{"index.js":"422539e1-417"},"imported":[],"importedBy":[{"uid":"422539e1-772"}]},"422539e1-418":{"id":"/node_modules/@stdlib/array-complex128/lib/from_iterator.js","moduleParts":{"index.js":"422539e1-419"},"imported":[{"uid":"422539e1-755"},{"uid":"422539e1-760"},{"uid":"422539e1-717"},{"uid":"422539e1-771"},{"uid":"422539e1-772"}],"importedBy":[{"uid":"422539e1-424"}]},"422539e1-420":{"id":"/node_modules/@stdlib/array-complex128/lib/from_iterator_map.js","moduleParts":{"index.js":"422539e1-421"},"imported":[{"uid":"422539e1-755"},{"uid":"422539e1-760"},{"uid":"422539e1-717"},{"uid":"422539e1-771"},{"uid":"422539e1-772"}],"importedBy":[{"uid":"422539e1-424"}]},"422539e1-422":{"id":"/node_modules/@stdlib/array-complex128/lib/from_array.js","moduleParts":{"index.js":"422539e1-423"},"imported":[{"uid":"422539e1-760"},{"uid":"422539e1-771"},{"uid":"422539e1-772"}],"importedBy":[{"uid":"422539e1-424"}]},"422539e1-424":{"id":"/node_modules/@stdlib/array-complex128/lib/main.js","moduleParts":{"index.js":"422539e1-425"},"imported":[{"uid":"422539e1-314"},{"uid":"422539e1-755"},{"uid":"422539e1-756"},{"uid":"422539e1-757"},{"uid":"422539e1-758"},{"uid":"422539e1-737"},{"uid":"422539e1-328"},{"uid":"422539e1-90"},{"uid":"422539e1-759"},{"uid":"422539e1-760"},{"uid":"422539e1-761"},{"uid":"422539e1-762"},{"uid":"422539e1-714"},{"uid":"422539e1-713"},{"uid":"422539e1-763"},{"uid":"422539e1-764"},{"uid":"422539e1-696"},{"uid":"422539e1-765"},{"uid":"422539e1-144"},{"uid":"422539e1-770"},{"uid":"422539e1-771"},{"uid":"422539e1-772"},{"uid":"422539e1-769"},{"uid":"422539e1-716"},{"uid":"422539e1-715"},{"uid":"422539e1-705"},{"uid":"422539e1-703"},{"uid":"422539e1-717"},{"uid":"422539e1-418"},{"uid":"422539e1-420"},{"uid":"422539e1-422"}],"importedBy":[{"uid":"422539e1-742"}]},"422539e1-426":{"id":"/node_modules/@stdlib/array-bool/lib/from_iterator.js","moduleParts":{"index.js":"422539e1-427"},"imported":[{"uid":"422539e1-773"}],"importedBy":[{"uid":"422539e1-432"}]},"422539e1-428":{"id":"/node_modules/@stdlib/array-bool/lib/from_iterator_map.js","moduleParts":{"index.js":"422539e1-429"},"imported":[{"uid":"422539e1-773"}],"importedBy":[{"uid":"422539e1-432"}]},"422539e1-430":{"id":"/node_modules/@stdlib/array-bool/lib/from_array.js","moduleParts":{"index.js":"422539e1-431"},"imported":[{"uid":"422539e1-773"}],"importedBy":[{"uid":"422539e1-432"}]},"422539e1-432":{"id":"/node_modules/@stdlib/array-bool/lib/main.js","moduleParts":{"index.js":"422539e1-433"},"imported":[{"uid":"422539e1-314"},{"uid":"422539e1-756"},{"uid":"422539e1-757"},{"uid":"422539e1-758"},{"uid":"422539e1-759"},{"uid":"422539e1-344"},{"uid":"422539e1-306"},{"uid":"422539e1-90"},{"uid":"422539e1-328"},{"uid":"422539e1-763"},{"uid":"422539e1-764"},{"uid":"422539e1-696"},{"uid":"422539e1-765"},{"uid":"422539e1-178"},{"uid":"422539e1-773"},{"uid":"422539e1-705"},{"uid":"422539e1-769"},{"uid":"422539e1-703"},{"uid":"422539e1-717"},{"uid":"422539e1-426"},{"uid":"422539e1-428"},{"uid":"422539e1-430"}],"importedBy":[{"uid":"422539e1-743"}]},"422539e1-434":{"id":"/node_modules/@stdlib/array-dtype/lib/ctors.js","moduleParts":{"index.js":"422539e1-435"},"imported":[{"uid":"422539e1-144"},{"uid":"422539e1-160"},{"uid":"422539e1-216"},{"uid":"422539e1-232"},{"uid":"422539e1-246"},{"uid":"422539e1-262"},{"uid":"422539e1-178"},{"uid":"422539e1-274"},{"uid":"422539e1-290"},{"uid":"422539e1-741"},{"uid":"422539e1-742"},{"uid":"422539e1-743"}],"importedBy":[{"uid":"422539e1-438"}]},"422539e1-436":{"id":"/node_modules/@stdlib/array-dtype/lib/dtypes.js","moduleParts":{"index.js":"422539e1-437"},"imported":[],"importedBy":[{"uid":"422539e1-438"}]},"422539e1-438":{"id":"/node_modules/@stdlib/array-dtype/lib/main.js","moduleParts":{"index.js":"422539e1-439"},"imported":[{"uid":"422539e1-736"},{"uid":"422539e1-737"},{"uid":"422539e1-738"},{"uid":"422539e1-202"},{"uid":"422539e1-434"},{"uid":"422539e1-436"}],"importedBy":[{"uid":"422539e1-729"}]},"422539e1-440":{"id":"/node_modules/@stdlib/array-base-arraylike2object/lib/main.js","moduleParts":{"index.js":"422539e1-441"},"imported":[{"uid":"422539e1-702"},{"uid":"422539e1-705"},{"uid":"422539e1-706"},{"uid":"422539e1-703"},{"uid":"422539e1-704"},{"uid":"422539e1-729"}],"importedBy":[{"uid":"422539e1-719"}]},"422539e1-442":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/accessors.js","moduleParts":{"index.js":"422539e1-443"},"imported":[],"importedBy":[{"uid":"422539e1-444"}]},"422539e1-444":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/ndarray.js","moduleParts":{"index.js":"422539e1-445"},"imported":[{"uid":"422539e1-719"},{"uid":"422539e1-442"}],"importedBy":[{"uid":"422539e1-448"},{"uid":"422539e1-446"}]},"422539e1-446":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/main.js","moduleParts":{"index.js":"422539e1-447"},"imported":[{"uid":"422539e1-718"},{"uid":"422539e1-444"}],"importedBy":[{"uid":"422539e1-448"}]},"422539e1-448":{"id":"/node_modules/@stdlib/blas-base-gscal/lib/index.js","moduleParts":{"index.js":"422539e1-449"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-446"},{"uid":"422539e1-444"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-450":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/main.js","moduleParts":{"index.js":"422539e1-451"},"imported":[],"importedBy":[{"uid":"422539e1-454"}]},"422539e1-452":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/assign.js","moduleParts":{"index.js":"422539e1-453"},"imported":[{"uid":"422539e1-719"},{"uid":"422539e1-715"},{"uid":"422539e1-716"}],"importedBy":[{"uid":"422539e1-454"}]},"422539e1-454":{"id":"/node_modules/@stdlib/array-base-zero-to/lib/index.js","moduleParts":{"index.js":"422539e1-455"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-450"},{"uid":"422539e1-452"}],"importedBy":[{"uid":"422539e1-460"}]},"422539e1-456":{"id":"/node_modules/@stdlib/array-base-take-indexed/lib/main.js","moduleParts":{"index.js":"422539e1-457"},"imported":[],"importedBy":[{"uid":"422539e1-722"}]},"422539e1-458":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/sort2ins.js","moduleParts":{"index.js":"422539e1-459"},"imported":[],"importedBy":[{"uid":"422539e1-460"}]},"422539e1-460":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/main.js","moduleParts":{"index.js":"422539e1-461"},"imported":[{"uid":"422539e1-454"},{"uid":"422539e1-721"},{"uid":"422539e1-722"},{"uid":"422539e1-458"}],"importedBy":[{"uid":"422539e1-697"}]},"422539e1-462":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/primitive.js","moduleParts":{"index.js":"422539e1-463"},"imported":[{"uid":"422539e1-306"}],"importedBy":[{"uid":"422539e1-468"},{"uid":"422539e1-466"}]},"422539e1-464":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/object.js","moduleParts":{"index.js":"422539e1-465"},"imported":[{"uid":"422539e1-306"}],"importedBy":[{"uid":"422539e1-468"},{"uid":"422539e1-466"}]},"422539e1-466":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/main.js","moduleParts":{"index.js":"422539e1-467"},"imported":[{"uid":"422539e1-462"},{"uid":"422539e1-464"}],"importedBy":[{"uid":"422539e1-468"}]},"422539e1-468":{"id":"/node_modules/@stdlib/assert-is-positive-integer/lib/index.js","moduleParts":{"index.js":"422539e1-469"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-466"},{"uid":"422539e1-462"},{"uid":"422539e1-464"}],"importedBy":[{"uid":"422539e1-550"}]},"422539e1-470":{"id":"/node_modules/@stdlib/utils-keys/lib/builtin.js","moduleParts":{"index.js":"422539e1-471"},"imported":[],"importedBy":[{"uid":"422539e1-526"},{"uid":"422539e1-472"},{"uid":"422539e1-500"}]},"422539e1-472":{"id":"/node_modules/@stdlib/utils-keys/lib/has_arguments_bug.js","moduleParts":{"index.js":"422539e1-473"},"imported":[{"uid":"422539e1-470"}],"importedBy":[{"uid":"422539e1-526"}]},"422539e1-474":{"id":"/node_modules/@stdlib/utils-keys/lib/has_builtin.js","moduleParts":{"index.js":"422539e1-475"},"imported":[],"importedBy":[{"uid":"422539e1-526"}]},"422539e1-476":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/main.js","moduleParts":{"index.js":"422539e1-477"},"imported":[{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-498"},{"uid":"422539e1-478"}]},"422539e1-478":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/detect.js","moduleParts":{"index.js":"422539e1-479"},"imported":[{"uid":"422539e1-476"}],"importedBy":[{"uid":"422539e1-498"}]},"422539e1-480":{"id":"/node_modules/@stdlib/math-base-assert-is-nan/lib/main.js","moduleParts":{"index.js":"422539e1-481"},"imported":[],"importedBy":[{"uid":"422539e1-791"}]},"422539e1-482":{"id":"/node_modules/@stdlib/assert-is-nan/lib/primitive.js","moduleParts":{"index.js":"422539e1-483"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-791"}],"importedBy":[{"uid":"422539e1-488"},{"uid":"422539e1-486"}]},"422539e1-484":{"id":"/node_modules/@stdlib/assert-is-nan/lib/object.js","moduleParts":{"index.js":"422539e1-485"},"imported":[{"uid":"422539e1-114"},{"uid":"422539e1-791"}],"importedBy":[{"uid":"422539e1-488"},{"uid":"422539e1-486"}]},"422539e1-486":{"id":"/node_modules/@stdlib/assert-is-nan/lib/main.js","moduleParts":{"index.js":"422539e1-487"},"imported":[{"uid":"422539e1-482"},{"uid":"422539e1-484"}],"importedBy":[{"uid":"422539e1-488"}]},"422539e1-488":{"id":"/node_modules/@stdlib/assert-is-nan/lib/index.js","moduleParts":{"index.js":"422539e1-489"},"imported":[{"uid":"422539e1-696"},{"uid":"422539e1-486"},{"uid":"422539e1-482"},{"uid":"422539e1-484"}],"importedBy":[{"uid":"422539e1-494"},{"uid":"422539e1-508"}]},"422539e1-490":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/native.js","moduleParts":{"index.js":"422539e1-491"},"imported":[],"importedBy":[{"uid":"422539e1-494"},{"uid":"422539e1-492"}]},"422539e1-492":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/has_string_enumerability_bug.js","moduleParts":{"index.js":"422539e1-493"},"imported":[{"uid":"422539e1-490"}],"importedBy":[{"uid":"422539e1-494"}]},"422539e1-494":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/main.js","moduleParts":{"index.js":"422539e1-495"},"imported":[{"uid":"422539e1-90"},{"uid":"422539e1-488"},{"uid":"422539e1-306"},{"uid":"422539e1-490"},{"uid":"422539e1-492"}],"importedBy":[{"uid":"422539e1-787"}]},"422539e1-496":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/polyfill.js","moduleParts":{"index.js":"422539e1-497"},"imported":[{"uid":"422539e1-746"},{"uid":"422539e1-787"},{"uid":"422539e1-737"},{"uid":"422539e1-762"},{"uid":"422539e1-206"}],"importedBy":[{"uid":"422539e1-498"}]},"422539e1-498":{"id":"/node_modules/@stdlib/assert-is-arguments/lib/index.js","moduleParts":{"index.js":"422539e1-499"},"imported":[{"uid":"422539e1-478"},{"uid":"422539e1-476"},{"uid":"422539e1-496"}],"importedBy":[{"uid":"422539e1-500"},{"uid":"422539e1-524"}]},"422539e1-500":{"id":"/node_modules/@stdlib/utils-keys/lib/builtin_wrapper.js","moduleParts":{"index.js":"422539e1-501"},"imported":[{"uid":"422539e1-498"},{"uid":"422539e1-470"}],"importedBy":[{"uid":"422539e1-526"}]},"422539e1-502":{"id":"/node_modules/@stdlib/utils-noop/lib/main.js","moduleParts":{"index.js":"422539e1-503"},"imported":[],"importedBy":[{"uid":"422539e1-788"}]},"422539e1-504":{"id":"/node_modules/@stdlib/utils-keys/lib/has_enumerable_prototype_bug.js","moduleParts":{"index.js":"422539e1-505"},"imported":[{"uid":"422539e1-787"},{"uid":"422539e1-788"}],"importedBy":[{"uid":"422539e1-524"}]},"422539e1-506":{"id":"/node_modules/@stdlib/utils-keys/lib/has_non_enumerable_properties_bug.js","moduleParts":{"index.js":"422539e1-507"},"imported":[{"uid":"422539e1-787"}],"importedBy":[{"uid":"422539e1-524"}]},"422539e1-508":{"id":"/node_modules/@stdlib/utils-index-of/lib/main.js","moduleParts":{"index.js":"422539e1-509"},"imported":[{"uid":"422539e1-488"},{"uid":"422539e1-756"},{"uid":"422539e1-90"},{"uid":"422539e1-306"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-790"}]},"422539e1-510":{"id":"/node_modules/@stdlib/utils-keys/lib/is_constructor_prototype.js","moduleParts":{"index.js":"422539e1-511"},"imported":[],"importedBy":[{"uid":"422539e1-520"},{"uid":"422539e1-516"}]},"422539e1-512":{"id":"/node_modules/@stdlib/utils-keys/lib/excluded_keys.json","moduleParts":{"index.js":"422539e1-513"},"imported":[],"importedBy":[{"uid":"422539e1-516"}]},"422539e1-514":{"id":"/node_modules/@stdlib/utils-keys/lib/window.js","moduleParts":{"index.js":"422539e1-515"},"imported":[],"importedBy":[{"uid":"422539e1-516"}]},"422539e1-516":{"id":"/node_modules/@stdlib/utils-keys/lib/has_automation_equality_bug.js","moduleParts":{"index.js":"422539e1-517"},"imported":[{"uid":"422539e1-746"},{"uid":"422539e1-790"},{"uid":"422539e1-368"},{"uid":"422539e1-510"},{"uid":"422539e1-512"},{"uid":"422539e1-514"}],"importedBy":[{"uid":"422539e1-520"}]},"422539e1-518":{"id":"/node_modules/@stdlib/utils-keys/lib/has_window.js","moduleParts":{"index.js":"422539e1-519"},"imported":[],"importedBy":[{"uid":"422539e1-520"}]},"422539e1-520":{"id":"/node_modules/@stdlib/utils-keys/lib/is_constructor_prototype_wrapper.js","moduleParts":{"index.js":"422539e1-521"},"imported":[{"uid":"422539e1-516"},{"uid":"422539e1-510"},{"uid":"422539e1-518"}],"importedBy":[{"uid":"422539e1-524"}]},"422539e1-522":{"id":"/node_modules/@stdlib/utils-keys/lib/non_enumerable.json","moduleParts":{"index.js":"422539e1-523"},"imported":[],"importedBy":[{"uid":"422539e1-524"}]},"422539e1-524":{"id":"/node_modules/@stdlib/utils-keys/lib/polyfill.js","moduleParts":{"index.js":"422539e1-525"},"imported":[{"uid":"422539e1-190"},{"uid":"422539e1-746"},{"uid":"422539e1-498"},{"uid":"422539e1-504"},{"uid":"422539e1-506"},{"uid":"422539e1-520"},{"uid":"422539e1-522"}],"importedBy":[{"uid":"422539e1-526"}]},"422539e1-526":{"id":"/node_modules/@stdlib/utils-keys/lib/main.js","moduleParts":{"index.js":"422539e1-527"},"imported":[{"uid":"422539e1-472"},{"uid":"422539e1-474"},{"uid":"422539e1-470"},{"uid":"422539e1-500"},{"uid":"422539e1-524"}],"importedBy":[{"uid":"422539e1-783"}]},"422539e1-528":{"id":"/node_modules/@stdlib/object-ctor/lib/main.js","moduleParts":{"index.js":"422539e1-529"},"imported":[],"importedBy":[{"uid":"422539e1-789"}]},"422539e1-530":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/native.js","moduleParts":{"index.js":"422539e1-531"},"imported":[],"importedBy":[{"uid":"422539e1-536"}]},"422539e1-532":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/proto.js","moduleParts":{"index.js":"422539e1-533"},"imported":[],"importedBy":[{"uid":"422539e1-534"}]},"422539e1-534":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/polyfill.js","moduleParts":{"index.js":"422539e1-535"},"imported":[{"uid":"422539e1-80"},{"uid":"422539e1-789"},{"uid":"422539e1-532"}],"importedBy":[{"uid":"422539e1-536"}]},"422539e1-536":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/detect.js","moduleParts":{"index.js":"422539e1-537"},"imported":[{"uid":"422539e1-759"},{"uid":"422539e1-530"},{"uid":"422539e1-534"}],"importedBy":[{"uid":"422539e1-538"}]},"422539e1-538":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/main.js","moduleParts":{"index.js":"422539e1-539"},"imported":[{"uid":"422539e1-789"},{"uid":"422539e1-536"}],"importedBy":[{"uid":"422539e1-785"}]},"422539e1-540":{"id":"/node_modules/@stdlib/assert-is-plain-object/lib/main.js","moduleParts":{"index.js":"422539e1-541"},"imported":[{"uid":"422539e1-758"},{"uid":"422539e1-759"},{"uid":"422539e1-785"},{"uid":"422539e1-746"},{"uid":"422539e1-80"}],"importedBy":[{"uid":"422539e1-784"}]},"422539e1-542":{"id":"/node_modules/@stdlib/object-inverse/lib/main.js","moduleParts":{"index.js":"422539e1-543"},"imported":[{"uid":"422539e1-783"},{"uid":"422539e1-737"},{"uid":"422539e1-784"},{"uid":"422539e1-190"},{"uid":"422539e1-344"},{"uid":"422539e1-746"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-774"}]},"422539e1-544":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enums/lib/main.js","moduleParts":{"index.js":"422539e1-545"},"imported":[],"importedBy":[{"uid":"422539e1-775"}]},"422539e1-546":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/main.js","moduleParts":{"index.js":"422539e1-547"},"imported":[{"uid":"422539e1-90"},{"uid":"422539e1-774"},{"uid":"422539e1-775"}],"importedBy":[{"uid":"422539e1-744"}]},"422539e1-548":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/bytes_per_element.json","moduleParts":{"index.js":"422539e1-549"},"imported":[],"importedBy":[{"uid":"422539e1-550"}]},"422539e1-550":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/main.js","moduleParts":{"index.js":"422539e1-551"},"imported":[{"uid":"422539e1-90"},{"uid":"422539e1-114"},{"uid":"422539e1-468"},{"uid":"422539e1-744"},{"uid":"422539e1-548"}],"importedBy":[{"uid":"422539e1-733"}]},"422539e1-552":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/defaults.js","moduleParts":{"index.js":"422539e1-553"},"imported":[],"importedBy":[{"uid":"422539e1-554"}]},"422539e1-554":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/main.js","moduleParts":{"index.js":"422539e1-555"},"imported":[{"uid":"422539e1-733"},{"uid":"422539e1-552"}],"importedBy":[{"uid":"422539e1-723"}]},"422539e1-556":{"id":"/node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/main.js","moduleParts":{"index.js":"422539e1-557"},"imported":[{"uid":"422539e1-723"}],"importedBy":[{"uid":"422539e1-698"}]},"422539e1-558":{"id":"/lib/2d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-559"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-560":{"id":"/lib/3d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-561"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-562":{"id":"/lib/4d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-563"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-564":{"id":"/lib/5d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-565"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-566":{"id":"/lib/6d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-567"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-568":{"id":"/lib/7d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-569"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-570":{"id":"/lib/8d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-571"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-572":{"id":"/lib/9d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-573"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-574":{"id":"/lib/10d_blocked_accessors.js","moduleParts":{"index.js":"422539e1-575"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-576":{"id":"/lib/2d_blocked_complex.js","moduleParts":{"index.js":"422539e1-577"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-578":{"id":"/lib/3d_blocked_complex.js","moduleParts":{"index.js":"422539e1-579"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-580":{"id":"/lib/4d_blocked_complex.js","moduleParts":{"index.js":"422539e1-581"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-582":{"id":"/lib/5d_blocked_complex.js","moduleParts":{"index.js":"422539e1-583"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-584":{"id":"/lib/6d_blocked_complex.js","moduleParts":{"index.js":"422539e1-585"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-586":{"id":"/lib/7d_blocked_complex.js","moduleParts":{"index.js":"422539e1-587"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-588":{"id":"/lib/8d_blocked_complex.js","moduleParts":{"index.js":"422539e1-589"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-590":{"id":"/lib/9d_blocked_complex.js","moduleParts":{"index.js":"422539e1-591"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-592":{"id":"/lib/10d_blocked_complex.js","moduleParts":{"index.js":"422539e1-593"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-594":{"id":"/lib/2d_blocked.js","moduleParts":{"index.js":"422539e1-595"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-596":{"id":"/lib/3d_blocked.js","moduleParts":{"index.js":"422539e1-597"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-598":{"id":"/lib/4d_blocked.js","moduleParts":{"index.js":"422539e1-599"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-600":{"id":"/lib/5d_blocked.js","moduleParts":{"index.js":"422539e1-601"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-602":{"id":"/lib/6d_blocked.js","moduleParts":{"index.js":"422539e1-603"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-604":{"id":"/lib/7d_blocked.js","moduleParts":{"index.js":"422539e1-605"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-606":{"id":"/lib/8d_blocked.js","moduleParts":{"index.js":"422539e1-607"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-608":{"id":"/lib/9d_blocked.js","moduleParts":{"index.js":"422539e1-609"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-610":{"id":"/lib/10d_blocked.js","moduleParts":{"index.js":"422539e1-611"},"imported":[{"uid":"422539e1-697"},{"uid":"422539e1-698"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-612":{"id":"/lib/0d_accessors.js","moduleParts":{"index.js":"422539e1-613"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-614":{"id":"/lib/1d_accessors.js","moduleParts":{"index.js":"422539e1-615"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-616":{"id":"/lib/2d_accessors.js","moduleParts":{"index.js":"422539e1-617"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-618":{"id":"/lib/3d_accessors.js","moduleParts":{"index.js":"422539e1-619"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-620":{"id":"/lib/4d_accessors.js","moduleParts":{"index.js":"422539e1-621"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-622":{"id":"/lib/5d_accessors.js","moduleParts":{"index.js":"422539e1-623"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-624":{"id":"/lib/6d_accessors.js","moduleParts":{"index.js":"422539e1-625"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-626":{"id":"/lib/7d_accessors.js","moduleParts":{"index.js":"422539e1-627"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-628":{"id":"/lib/8d_accessors.js","moduleParts":{"index.js":"422539e1-629"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-630":{"id":"/lib/9d_accessors.js","moduleParts":{"index.js":"422539e1-631"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-632":{"id":"/lib/10d_accessors.js","moduleParts":{"index.js":"422539e1-633"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-634":{"id":"/node_modules/@stdlib/ndarray-base-vind2bind/lib/main.js","moduleParts":{"index.js":"422539e1-635"},"imported":[{"uid":"422539e1-725"},{"uid":"422539e1-717"}],"importedBy":[{"uid":"422539e1-701"}]},"422539e1-636":{"id":"/lib/nd_accessors.js","moduleParts":{"index.js":"422539e1-637"},"imported":[{"uid":"422539e1-700"},{"uid":"422539e1-701"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-638":{"id":"/lib/0d_complex.js","moduleParts":{"index.js":"422539e1-639"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-640":{"id":"/lib/1d_complex.js","moduleParts":{"index.js":"422539e1-641"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-642":{"id":"/lib/2d_complex.js","moduleParts":{"index.js":"422539e1-643"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-644":{"id":"/lib/3d_complex.js","moduleParts":{"index.js":"422539e1-645"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-646":{"id":"/lib/4d_complex.js","moduleParts":{"index.js":"422539e1-647"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-648":{"id":"/lib/5d_complex.js","moduleParts":{"index.js":"422539e1-649"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-650":{"id":"/lib/6d_complex.js","moduleParts":{"index.js":"422539e1-651"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-652":{"id":"/lib/7d_complex.js","moduleParts":{"index.js":"422539e1-653"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-654":{"id":"/lib/8d_complex.js","moduleParts":{"index.js":"422539e1-655"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-656":{"id":"/lib/9d_complex.js","moduleParts":{"index.js":"422539e1-657"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-658":{"id":"/lib/10d_complex.js","moduleParts":{"index.js":"422539e1-659"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-660":{"id":"/lib/nd_complex.js","moduleParts":{"index.js":"422539e1-661"},"imported":[{"uid":"422539e1-700"},{"uid":"422539e1-701"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-662":{"id":"/lib/0d.js","moduleParts":{"index.js":"422539e1-663"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-664":{"id":"/lib/1d.js","moduleParts":{"index.js":"422539e1-665"},"imported":[],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-666":{"id":"/lib/2d.js","moduleParts":{"index.js":"422539e1-667"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-668":{"id":"/lib/3d.js","moduleParts":{"index.js":"422539e1-669"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-670":{"id":"/lib/4d.js","moduleParts":{"index.js":"422539e1-671"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-672":{"id":"/lib/5d.js","moduleParts":{"index.js":"422539e1-673"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-674":{"id":"/lib/6d.js","moduleParts":{"index.js":"422539e1-675"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-676":{"id":"/lib/7d.js","moduleParts":{"index.js":"422539e1-677"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-678":{"id":"/lib/8d.js","moduleParts":{"index.js":"422539e1-679"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-680":{"id":"/lib/9d.js","moduleParts":{"index.js":"422539e1-681"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-682":{"id":"/lib/10d.js","moduleParts":{"index.js":"422539e1-683"},"imported":[{"uid":"422539e1-699"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-684":{"id":"/lib/nd.js","moduleParts":{"index.js":"422539e1-685"},"imported":[{"uid":"422539e1-700"},{"uid":"422539e1-701"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-686":{"id":"/lib/main.js","moduleParts":{"index.js":"422539e1-687"},"imported":[{"uid":"422539e1-690"},{"uid":"422539e1-691"},{"uid":"422539e1-692"},{"uid":"422539e1-42"},{"uid":"422539e1-693"},{"uid":"422539e1-694"},{"uid":"422539e1-695"},{"uid":"422539e1-448"},{"uid":"422539e1-558"},{"uid":"422539e1-560"},{"uid":"422539e1-562"},{"uid":"422539e1-564"},{"uid":"422539e1-566"},{"uid":"422539e1-568"},{"uid":"422539e1-570"},{"uid":"422539e1-572"},{"uid":"422539e1-574"},{"uid":"422539e1-576"},{"uid":"422539e1-578"},{"uid":"422539e1-580"},{"uid":"422539e1-582"},{"uid":"422539e1-584"},{"uid":"422539e1-586"},{"uid":"422539e1-588"},{"uid":"422539e1-590"},{"uid":"422539e1-592"},{"uid":"422539e1-594"},{"uid":"422539e1-596"},{"uid":"422539e1-598"},{"uid":"422539e1-600"},{"uid":"422539e1-602"},{"uid":"422539e1-604"},{"uid":"422539e1-606"},{"uid":"422539e1-608"},{"uid":"422539e1-610"},{"uid":"422539e1-612"},{"uid":"422539e1-614"},{"uid":"422539e1-616"},{"uid":"422539e1-618"},{"uid":"422539e1-620"},{"uid":"422539e1-622"},{"uid":"422539e1-624"},{"uid":"422539e1-626"},{"uid":"422539e1-628"},{"uid":"422539e1-630"},{"uid":"422539e1-632"},{"uid":"422539e1-636"},{"uid":"422539e1-638"},{"uid":"422539e1-640"},{"uid":"422539e1-642"},{"uid":"422539e1-644"},{"uid":"422539e1-646"},{"uid":"422539e1-648"},{"uid":"422539e1-650"},{"uid":"422539e1-652"},{"uid":"422539e1-654"},{"uid":"422539e1-656"},{"uid":"422539e1-658"},{"uid":"422539e1-660"},{"uid":"422539e1-662"},{"uid":"422539e1-664"},{"uid":"422539e1-666"},{"uid":"422539e1-668"},{"uid":"422539e1-670"},{"uid":"422539e1-672"},{"uid":"422539e1-674"},{"uid":"422539e1-676"},{"uid":"422539e1-678"},{"uid":"422539e1-680"},{"uid":"422539e1-682"},{"uid":"422539e1-684"}],"importedBy":[{"uid":"422539e1-688"}]},"422539e1-688":{"id":"/lib/index.js","moduleParts":{"index.js":"422539e1-689"},"imported":[{"uid":"422539e1-686"}],"importedBy":[],"isEntry":true},"422539e1-690":{"id":"/node_modules/@stdlib/array-base-assert-is-complex-typed-array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-0"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-691":{"id":"/node_modules/@stdlib/array-base-assert-is-booleanarray/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-2"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-692":{"id":"/node_modules/@stdlib/ndarray-base-iteration-order/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-4"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-693":{"id":"/node_modules/@stdlib/ndarray-base-ndarraylike2object/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-128"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-694":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-164"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-695":{"id":"/node_modules/@stdlib/strided-base-reinterpret-boolean/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-180"}],"importedBy":[{"uid":"422539e1-686"}]},"422539e1-696":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-36"}],"importedBy":[{"uid":"422539e1-42"},{"uid":"422539e1-448"},{"uid":"422539e1-454"},{"uid":"422539e1-90"},{"uid":"422539e1-98"},{"uid":"422539e1-114"},{"uid":"422539e1-468"},{"uid":"422539e1-190"},{"uid":"422539e1-198"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-314"},{"uid":"422539e1-328"},{"uid":"422539e1-344"},{"uid":"422539e1-306"},{"uid":"422539e1-390"},{"uid":"422539e1-378"},{"uid":"422539e1-488"}]},"422539e1-697":{"id":"/node_modules/@stdlib/ndarray-base-nullary-loop-interchange-order/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-460"}],"importedBy":[{"uid":"422539e1-558"},{"uid":"422539e1-560"},{"uid":"422539e1-562"},{"uid":"422539e1-564"},{"uid":"422539e1-566"},{"uid":"422539e1-568"},{"uid":"422539e1-570"},{"uid":"422539e1-572"},{"uid":"422539e1-574"},{"uid":"422539e1-576"},{"uid":"422539e1-578"},{"uid":"422539e1-580"},{"uid":"422539e1-582"},{"uid":"422539e1-584"},{"uid":"422539e1-586"},{"uid":"422539e1-588"},{"uid":"422539e1-590"},{"uid":"422539e1-592"},{"uid":"422539e1-594"},{"uid":"422539e1-596"},{"uid":"422539e1-598"},{"uid":"422539e1-600"},{"uid":"422539e1-602"},{"uid":"422539e1-604"},{"uid":"422539e1-606"},{"uid":"422539e1-608"},{"uid":"422539e1-610"}]},"422539e1-698":{"id":"/node_modules/@stdlib/ndarray-base-nullary-tiling-block-size/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-556"}],"importedBy":[{"uid":"422539e1-558"},{"uid":"422539e1-560"},{"uid":"422539e1-562"},{"uid":"422539e1-564"},{"uid":"422539e1-566"},{"uid":"422539e1-568"},{"uid":"422539e1-570"},{"uid":"422539e1-572"},{"uid":"422539e1-574"},{"uid":"422539e1-576"},{"uid":"422539e1-578"},{"uid":"422539e1-580"},{"uid":"422539e1-582"},{"uid":"422539e1-584"},{"uid":"422539e1-586"},{"uid":"422539e1-588"},{"uid":"422539e1-590"},{"uid":"422539e1-592"},{"uid":"422539e1-594"},{"uid":"422539e1-596"},{"uid":"422539e1-598"},{"uid":"422539e1-600"},{"uid":"422539e1-602"},{"uid":"422539e1-604"},{"uid":"422539e1-606"},{"uid":"422539e1-608"},{"uid":"422539e1-610"}]},"422539e1-699":{"id":"/node_modules/@stdlib/ndarray-base-strides2order/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-122"}],"importedBy":[{"uid":"422539e1-616"},{"uid":"422539e1-618"},{"uid":"422539e1-620"},{"uid":"422539e1-622"},{"uid":"422539e1-624"},{"uid":"422539e1-626"},{"uid":"422539e1-628"},{"uid":"422539e1-630"},{"uid":"422539e1-632"},{"uid":"422539e1-642"},{"uid":"422539e1-644"},{"uid":"422539e1-646"},{"uid":"422539e1-648"},{"uid":"422539e1-650"},{"uid":"422539e1-652"},{"uid":"422539e1-654"},{"uid":"422539e1-656"},{"uid":"422539e1-658"},{"uid":"422539e1-666"},{"uid":"422539e1-668"},{"uid":"422539e1-670"},{"uid":"422539e1-672"},{"uid":"422539e1-674"},{"uid":"422539e1-676"},{"uid":"422539e1-678"},{"uid":"422539e1-680"},{"uid":"422539e1-682"},{"uid":"422539e1-124"}]},"422539e1-700":{"id":"/node_modules/@stdlib/ndarray-base-numel/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-54"}],"importedBy":[{"uid":"422539e1-636"},{"uid":"422539e1-660"},{"uid":"422539e1-684"},{"uid":"422539e1-128"}]},"422539e1-701":{"id":"/node_modules/@stdlib/ndarray-base-vind2bind/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-634"}],"importedBy":[{"uid":"422539e1-636"},{"uid":"422539e1-660"},{"uid":"422539e1-684"}]},"422539e1-702":{"id":"/node_modules/@stdlib/array-base-assert-is-accessor-array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-44"}],"importedBy":[{"uid":"422539e1-128"},{"uid":"422539e1-440"}]},"422539e1-703":{"id":"/node_modules/@stdlib/array-base-accessor-getter/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-46"}],"importedBy":[{"uid":"422539e1-128"},{"uid":"422539e1-440"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-704":{"id":"/node_modules/@stdlib/array-base-accessor-setter/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-48"}],"importedBy":[{"uid":"422539e1-128"},{"uid":"422539e1-440"}]},"422539e1-705":{"id":"/node_modules/@stdlib/array-base-getter/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-50"}],"importedBy":[{"uid":"422539e1-128"},{"uid":"422539e1-440"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-706":{"id":"/node_modules/@stdlib/array-base-setter/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-52"}],"importedBy":[{"uid":"422539e1-128"},{"uid":"422539e1-440"}]},"422539e1-707":{"id":"/node_modules/@stdlib/ndarray-base-dtype/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-56"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-708":{"id":"/node_modules/@stdlib/ndarray-base-shape/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-60"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-709":{"id":"/node_modules/@stdlib/ndarray-base-strides/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-100"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-710":{"id":"/node_modules/@stdlib/ndarray-base-offset/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-118"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-711":{"id":"/node_modules/@stdlib/ndarray-base-order/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-124"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-712":{"id":"/node_modules/@stdlib/ndarray-base-data-buffer/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-126"}],"importedBy":[{"uid":"422539e1-128"}]},"422539e1-713":{"id":"/node_modules/@stdlib/array-base-assert-is-complex128array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-130"}],"importedBy":[{"uid":"422539e1-164"},{"uid":"422539e1-412"},{"uid":"422539e1-424"}]},"422539e1-714":{"id":"/node_modules/@stdlib/array-base-assert-is-complex64array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-132"}],"importedBy":[{"uid":"422539e1-164"},{"uid":"422539e1-412"},{"uid":"422539e1-424"}]},"422539e1-715":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex128/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-146"}],"importedBy":[{"uid":"422539e1-164"},{"uid":"422539e1-452"},{"uid":"422539e1-412"},{"uid":"422539e1-424"}]},"422539e1-716":{"id":"/node_modules/@stdlib/strided-base-reinterpret-complex64/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-162"}],"importedBy":[{"uid":"422539e1-164"},{"uid":"422539e1-452"},{"uid":"422539e1-412"},{"uid":"422539e1-424"}]},"422539e1-717":{"id":"/node_modules/@stdlib/string-format/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-30"}],"importedBy":[{"uid":"422539e1-164"},{"uid":"422539e1-634"},{"uid":"422539e1-32"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-418"},{"uid":"422539e1-420"},{"uid":"422539e1-186"},{"uid":"422539e1-390"},{"uid":"422539e1-378"},{"uid":"422539e1-542"},{"uid":"422539e1-356"},{"uid":"422539e1-508"}]},"422539e1-718":{"id":"/node_modules/@stdlib/strided-base-stride2offset/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-182"}],"importedBy":[{"uid":"422539e1-446"}]},"422539e1-719":{"id":"/node_modules/@stdlib/array-base-arraylike2object/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-440"}],"importedBy":[{"uid":"422539e1-444"},{"uid":"422539e1-452"}]},"422539e1-720":{"id":"/node_modules/@stdlib/assert-has-uint8array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-172"}],"importedBy":[{"uid":"422539e1-178"}]},"422539e1-721":{"id":"/node_modules/@stdlib/array-base-copy-indexed/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-58"}],"importedBy":[{"uid":"422539e1-460"},{"uid":"422539e1-60"},{"uid":"422539e1-100"}]},"422539e1-722":{"id":"/node_modules/@stdlib/array-base-take-indexed/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-456"}],"importedBy":[{"uid":"422539e1-460"}]},"422539e1-723":{"id":"/node_modules/@stdlib/ndarray-base-tiling-block-size/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-554"}],"importedBy":[{"uid":"422539e1-556"}]},"422539e1-724":{"id":"/node_modules/@stdlib/math-base-special-abs/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-120"}],"importedBy":[{"uid":"422539e1-122"}]},"422539e1-725":{"id":"/node_modules/@stdlib/ndarray-base-assert-is-column-major-string/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-92"}],"importedBy":[{"uid":"422539e1-634"},{"uid":"422539e1-94"},{"uid":"422539e1-96"}]},"422539e1-726":{"id":"/node_modules/@stdlib/ndarray-base-strides2offset/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-116"}],"importedBy":[{"uid":"422539e1-118"}]},"422539e1-727":{"id":"/node_modules/@stdlib/string-base-format-interpolate/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-24"}],"importedBy":[{"uid":"422539e1-30"}]},"422539e1-728":{"id":"/node_modules/@stdlib/string-base-format-tokenize/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-26"}],"importedBy":[{"uid":"422539e1-30"}]},"422539e1-729":{"id":"/node_modules/@stdlib/array-dtype/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-438"}],"importedBy":[{"uid":"422539e1-440"}]},"422539e1-730":{"id":"/node_modules/@stdlib/assert-has-float64array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-138"}],"importedBy":[{"uid":"422539e1-144"}]},"422539e1-731":{"id":"/node_modules/@stdlib/assert-has-float32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-154"}],"importedBy":[{"uid":"422539e1-160"}]},"422539e1-732":{"id":"/node_modules/@stdlib/assert-is-uint8array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-166"}],"importedBy":[{"uid":"422539e1-172"}]},"422539e1-733":{"id":"/node_modules/@stdlib/ndarray-base-bytes-per-element/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-550"}],"importedBy":[{"uid":"422539e1-554"}]},"422539e1-734":{"id":"/node_modules/@stdlib/assert-has-tostringtag-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-66"}],"importedBy":[{"uid":"422539e1-86"},{"uid":"422539e1-110"},{"uid":"422539e1-80"},{"uid":"422539e1-340"}]},"422539e1-735":{"id":"/node_modules/@stdlib/number-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-104"}],"importedBy":[{"uid":"422539e1-110"},{"uid":"422539e1-106"},{"uid":"422539e1-292"}]},"422539e1-736":{"id":"/node_modules/@stdlib/assert-is-buffer/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-192"}],"importedBy":[{"uid":"422539e1-438"},{"uid":"422539e1-200"}]},"422539e1-737":{"id":"/node_modules/@stdlib/assert-is-array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-184"}],"importedBy":[{"uid":"422539e1-438"},{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-186"},{"uid":"422539e1-326"},{"uid":"422539e1-542"},{"uid":"422539e1-496"}]},"422539e1-738":{"id":"/node_modules/@stdlib/utils-constructor-name/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-200"}],"importedBy":[{"uid":"422539e1-438"},{"uid":"422539e1-364"},{"uid":"422539e1-366"}]},"422539e1-739":{"id":"/node_modules/@stdlib/assert-is-float64array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-134"}],"importedBy":[{"uid":"422539e1-138"}]},"422539e1-740":{"id":"/node_modules/@stdlib/assert-is-float32array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-148"}],"importedBy":[{"uid":"422539e1-154"}]},"422539e1-741":{"id":"/node_modules/@stdlib/array-complex64/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-412"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-742":{"id":"/node_modules/@stdlib/array-complex128/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-424"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-743":{"id":"/node_modules/@stdlib/array-bool/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-432"}],"importedBy":[{"uid":"422539e1-434"}]},"422539e1-744":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enum2str/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-546"}],"importedBy":[{"uid":"422539e1-550"}]},"422539e1-745":{"id":"/node_modules/@stdlib/assert-has-symbol-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-64"}],"importedBy":[{"uid":"422539e1-66"}]},"422539e1-746":{"id":"/node_modules/@stdlib/assert-has-own-property/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-72"}],"importedBy":[{"uid":"422539e1-78"},{"uid":"422539e1-396"},{"uid":"422539e1-542"},{"uid":"422539e1-540"},{"uid":"422539e1-524"},{"uid":"422539e1-496"},{"uid":"422539e1-516"}]},"422539e1-747":{"id":"/node_modules/@stdlib/assert-has-uint32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-210"}],"importedBy":[{"uid":"422539e1-216"}]},"422539e1-748":{"id":"/node_modules/@stdlib/assert-has-int32array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-226"}],"importedBy":[{"uid":"422539e1-232"}]},"422539e1-749":{"id":"/node_modules/@stdlib/assert-has-uint16array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-240"}],"importedBy":[{"uid":"422539e1-246"}]},"422539e1-750":{"id":"/node_modules/@stdlib/assert-has-int16array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-256"}],"importedBy":[{"uid":"422539e1-262"}]},"422539e1-751":{"id":"/node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-268"}],"importedBy":[{"uid":"422539e1-274"}]},"422539e1-752":{"id":"/node_modules/@stdlib/assert-has-int8array-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-284"}],"importedBy":[{"uid":"422539e1-290"}]},"422539e1-753":{"id":"/node_modules/@stdlib/symbol-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-74"}],"importedBy":[{"uid":"422539e1-76"},{"uid":"422539e1-396"}]},"422539e1-754":{"id":"/node_modules/@stdlib/assert-tools-array-function/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-186"}],"importedBy":[{"uid":"422539e1-190"},{"uid":"422539e1-328"}]},"422539e1-755":{"id":"/node_modules/@stdlib/assert-is-array-like-object/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-318"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-418"},{"uid":"422539e1-420"}]},"422539e1-756":{"id":"/node_modules/@stdlib/assert-is-collection/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-322"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-508"}]},"422539e1-757":{"id":"/node_modules/@stdlib/assert-is-arraybuffer/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-324"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-758":{"id":"/node_modules/@stdlib/assert-is-object/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-326"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-540"}]},"422539e1-759":{"id":"/node_modules/@stdlib/assert-is-function/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-370"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-540"},{"uid":"422539e1-536"}]},"422539e1-760":{"id":"/node_modules/@stdlib/assert-is-complex-like/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-392"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-410"},{"uid":"422539e1-418"},{"uid":"422539e1-420"},{"uid":"422539e1-422"}]},"422539e1-761":{"id":"/node_modules/@stdlib/math-base-assert-is-even/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-394"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"}]},"422539e1-762":{"id":"/node_modules/@stdlib/math-base-assert-is-integer/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-296"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-318"},{"uid":"422539e1-322"},{"uid":"422539e1-394"},{"uid":"422539e1-298"},{"uid":"422539e1-496"}]},"422539e1-763":{"id":"/node_modules/@stdlib/assert-has-iterator-symbol-support/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-396"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-398"}]},"422539e1-764":{"id":"/node_modules/@stdlib/symbol-iterator/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-398"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-765":{"id":"/node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-400"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"}]},"422539e1-766":{"id":"/node_modules/@stdlib/complex-float32-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-390"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-392"}]},"422539e1-767":{"id":"/node_modules/@stdlib/complex-float32-real/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-402"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-410"}]},"422539e1-768":{"id":"/node_modules/@stdlib/complex-float32-imag/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-404"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-406"},{"uid":"422539e1-408"},{"uid":"422539e1-410"}]},"422539e1-769":{"id":"/node_modules/@stdlib/math-base-special-floor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-294"}],"importedBy":[{"uid":"422539e1-412"},{"uid":"422539e1-424"},{"uid":"422539e1-432"},{"uid":"422539e1-296"}]},"422539e1-770":{"id":"/node_modules/@stdlib/complex-float64-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-378"}],"importedBy":[{"uid":"422539e1-424"},{"uid":"422539e1-392"}]},"422539e1-771":{"id":"/node_modules/@stdlib/complex-float64-real/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-414"}],"importedBy":[{"uid":"422539e1-424"},{"uid":"422539e1-418"},{"uid":"422539e1-420"},{"uid":"422539e1-422"}]},"422539e1-772":{"id":"/node_modules/@stdlib/complex-float64-imag/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-416"}],"importedBy":[{"uid":"422539e1-424"},{"uid":"422539e1-418"},{"uid":"422539e1-420"},{"uid":"422539e1-422"}]},"422539e1-773":{"id":"/node_modules/@stdlib/boolean-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-334"}],"importedBy":[{"uid":"422539e1-432"},{"uid":"422539e1-426"},{"uid":"422539e1-428"},{"uid":"422539e1-430"},{"uid":"422539e1-340"}]},"422539e1-774":{"id":"/node_modules/@stdlib/object-inverse/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-542"}],"importedBy":[{"uid":"422539e1-546"}]},"422539e1-775":{"id":"/node_modules/@stdlib/ndarray-base-dtype-enums/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-544"}],"importedBy":[{"uid":"422539e1-546"}]},"422539e1-776":{"id":"/node_modules/@stdlib/assert-is-uint32array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-204"}],"importedBy":[{"uid":"422539e1-210"}]},"422539e1-777":{"id":"/node_modules/@stdlib/assert-is-int32array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-218"}],"importedBy":[{"uid":"422539e1-226"}]},"422539e1-778":{"id":"/node_modules/@stdlib/assert-is-uint16array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-234"}],"importedBy":[{"uid":"422539e1-240"}]},"422539e1-779":{"id":"/node_modules/@stdlib/assert-is-int16array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-248"}],"importedBy":[{"uid":"422539e1-256"}]},"422539e1-780":{"id":"/node_modules/@stdlib/assert-is-uint8clampedarray/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-264"}],"importedBy":[{"uid":"422539e1-268"}]},"422539e1-781":{"id":"/node_modules/@stdlib/assert-is-int8array/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-276"}],"importedBy":[{"uid":"422539e1-284"}]},"422539e1-782":{"id":"/node_modules/@stdlib/utils-define-read-only-property/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-372"}],"importedBy":[{"uid":"422539e1-390"},{"uid":"422539e1-378"}]},"422539e1-783":{"id":"/node_modules/@stdlib/utils-keys/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-526"}],"importedBy":[{"uid":"422539e1-542"}]},"422539e1-784":{"id":"/node_modules/@stdlib/assert-is-plain-object/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-540"}],"importedBy":[{"uid":"422539e1-542"}]},"422539e1-785":{"id":"/node_modules/@stdlib/utils-get-prototype-of/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-538"}],"importedBy":[{"uid":"422539e1-540"}]},"422539e1-786":{"id":"/node_modules/@stdlib/utils-global/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-356"}],"importedBy":[{"uid":"422539e1-358"}]},"422539e1-787":{"id":"/node_modules/@stdlib/assert-is-enumerable-property/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-494"}],"importedBy":[{"uid":"422539e1-504"},{"uid":"422539e1-506"},{"uid":"422539e1-496"}]},"422539e1-788":{"id":"/node_modules/@stdlib/utils-noop/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-502"}],"importedBy":[{"uid":"422539e1-504"}]},"422539e1-789":{"id":"/node_modules/@stdlib/object-ctor/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-528"}],"importedBy":[{"uid":"422539e1-538"},{"uid":"422539e1-534"}]},"422539e1-790":{"id":"/node_modules/@stdlib/utils-index-of/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-508"}],"importedBy":[{"uid":"422539e1-516"}]},"422539e1-791":{"id":"/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js","moduleParts":{},"imported":[{"uid":"422539e1-480"}],"importedBy":[{"uid":"422539e1-482"},{"uid":"422539e1-484"}]}},"env":{"rollup":"4.11.0"},"options":{"gzip":false,"brotli":false,"sourcemap":false}};
+
+    const run = () => {
+      const width = window.innerWidth;
+      const height = window.innerHeight;
+
+      const chartNode = document.querySelector("main");
+      drawChart.default(chartNode, data, width, height);
+    };
+
+    window.addEventListener('resize', run);
+
+    document.addEventListener('DOMContentLoaded', run);
+    /*-->*/
+  </script>
+</body>
+</html>
+
diff --git a/test/dist/test.js b/test/dist/test.js
deleted file mode 100644
index a8a9c60..0000000
--- a/test/dist/test.js
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2023 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MODULES //
-
-var tape = require( 'tape' );
-var main = require( './../../dist' );
-
-
-// TESTS //
-
-tape( 'main export is defined', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( main !== void 0, true, 'main export is defined' );
-	t.end();
-});
diff --git a/test/test.0d.js b/test/test.0d.js
deleted file mode 100644
index 9b19c86..0000000
--- a/test/test.0d.js
+++ /dev/null
@@ -1,105 +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 Complex128 = require( '@stdlib/complex-float64-ctor' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 0-dimensional ndarray are truthy', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	x = scalar2ndarray( 0.0, {
-		'dtype': 'float64'
-	});
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = scalar2ndarray( 1.0, {
-		'dtype': 'float64'
-	});
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 0-dimensional ndarray are truthy (complex)', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	x = scalar2ndarray( new Complex128( 0.0, 0.0 ), {
-		'dtype': 'complex128'
-	});
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = scalar2ndarray( new Complex128( 1.0, 1.0 ), {
-		'dtype': 'complex128'
-	});
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 0-dimensional ndarray are truthy (accessors)', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	x = ndarray( 'generic', toAccessorArray( [ 0.0 ] ), [], [ 0 ], 0, 'row-major' );
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( 'generic', toAccessorArray( [ 1.0 ] ), [], [ 0 ], 0, 'row-major' );
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.10d.js b/test/test.10d.js
deleted file mode 100644
index b41f83d..0000000
--- a/test/test.10d.js
+++ /dev/null
@@ -1,3302 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, -8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*16,
-		-8,
-		4,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		-bsize*16,
-		8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [
-		bsize*32,
-		bsize*32,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, -16, 16, -8, -4, -2, 1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*16,
-		-8,
-		4,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		-bsize*16,
-		8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [
-		bsize*32,
-		bsize*32,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ 32, 16, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, 32, 16, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*32, 16, -8, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, bsize*64, bsize*32, -16, 8, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*16, 8, 4, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ bsize*32, bsize*32, bsize*32, -bsize*32, bsize*16, 8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*16,
-		-8,
-		4,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		-bsize*16,
-		8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		bsize*64,
-		bsize*64,
-		bsize*32,
-		-bsize*32,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [
-		bsize*32,
-		bsize*32,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -1, -1, -1, -1, -1, -1, -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		-bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = [ -1, -1, -1, -1, -1, -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, -2, 2, -2, 2, 2, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		-bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = [ -1, -1, -1, -1, -1, -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, -2, 2, -2, 2, 2, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 1, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		-bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		4,
-		8,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*64,
-		bsize*64,
-		bsize*64
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 2, bsize*2, 2, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 32, bsize*64, bsize*128 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 10-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 16, -16, 16, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.1d.js b/test/test.1d.js
deleted file mode 100644
index 16fae28..0000000
--- a/test/test.1d.js
+++ /dev/null
@@ -1,128 +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 ones = require( '@stdlib/array-ones' );
-var zeros = require( '@stdlib/array-zeros' );
-var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var Complex128Array = require( '@stdlib/array-complex128' );
-var BooleanArray = require( '@stdlib/array-bool' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	x = ndarray( 'float64', zeros( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( 'float64', ones( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy (complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var x;
-	var n;
-
-	xbuf = zeros( 6*2, 'float64' );
-	x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 6*2, 'float64' );
-	x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy (accessors)', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	x = ndarray( 'generic', toAccessorArray( zeros( 8, 'generic' ) ), [ 4 ], [ 2 ], 1, 'row-major' );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( 'generic', toAccessorArray( ones( 8, 'generic' ) ), [ 4 ], [ 2 ], 1, 'row-major' );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 1-dimensional ndarray are truthy (bool)', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	x = ndarray( 'bool', new BooleanArray( 8 ), [ 4 ], [ 2 ], 1, 'row-major' );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( 'bool', new BooleanArray( 8 ), [ 4 ], [ 2 ], 1, 'row-major' );
-	x.set( 3, true );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.2d.js b/test/test.2d.js
deleted file mode 100644
index 3bd96db..0000000
--- a/test/test.2d.js
+++ /dev/null
@@ -1,1507 +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 zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var Complex128Array = require( '@stdlib/array-complex128' );
-var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 4, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ bsize*4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 2 ];
-	st = [ 4, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ -4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ -4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ bsize*4, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ bsize*4, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -1, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ 2, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -2, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ 2, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ -2, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -1, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -1, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ 2, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ 2, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -2, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2 ];
-	st = [ -2, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ -2, bsize*2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2 ];
-	st = [ -2, bsize*2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ 2, -4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 2-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2 ];
-	st = [ 2, -4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( numel( sh ), {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.3d.js b/test/test.3d.js
deleted file mode 100644
index 48dcab4..0000000
--- a/test/test.3d.js
+++ /dev/null
@@ -1,1729 +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 zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var Complex128Array = require( '@stdlib/array-complex128' );
-var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 4, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ bsize*4, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ bsize*4, -bsize*4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ bsize*4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ bsize*4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ bsize*4, -bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ bsize*4, -bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -1, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ 2, -bsize*4, bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ -2, 4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ -2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -1, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -1, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ 2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2 ];
-	st = [ -2, 4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( 8, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ -2, bsize*4, bsize*4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2 ];
-	st = [ -2, bsize*4, bsize*4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ 2, -4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1 ];
-	st = [ 2, -4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ 2, -4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 3-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2 ];
-	st = [ 2, -4, 4 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.4d.js b/test/test.4d.js
deleted file mode 100644
index 9d5e491..0000000
--- a/test/test.4d.js
+++ /dev/null
@@ -1,1778 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ -2, -2, -1, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, 4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, -4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1 ];
-	st = [ -4, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, bsize*2, 2, 1 ];
-	st = [ -bsize*8, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, bsize*2, 1 ];
-	st = [ bsize*8, bsize*4, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, 1, bsize*2 ];
-	st = [ bsize*8, bsize*4, -bsize*4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 2, 1, 2 ];
-	st = [ -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, 4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, -4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1 ];
-	st = [ -4, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, bsize*2, 2, 1 ];
-	st = [ -bsize*8, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, bsize*2, 1 ];
-	st = [ -bsize*4, -bsize*4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2 ];
-	st = [ -bsize*4, -bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 2, 1, 2 ];
-	st = [ -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, 4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 4, -4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1 ];
-	st = [ -4, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, bsize*2, 2, 1 ];
-	st = [ -bsize*8, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1 ];
-	st = [ bsize*4, bsize*4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2 ];
-	st = [ bsize*4, bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2 ];
-	st = [ -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, 4, 4, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, -4, -4, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, 1, bsize*2 ];
-	st = [ 2, 2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, bsize*2, 1 ];
-	st = [ 2, -2, -4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, bsize*2, 1, 2 ];
-	st = [ 2, 2, -bsize*4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 1, 2 ];
-	st = [ 2, -bsize*4, bsize*4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2 ];
-	st = [ -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, 4, 4, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, 4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 8, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1 ];
-	st = [ 2, -bsize*4, -bsize*4, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1 ];
-	st = [ 1, 2, -bsize*4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1 ];
-	st = [ 2, 4, -4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*4 ];
-	st = [ 2, 4, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2 ];
-	st = [ -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, 4, 4, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1 ];
-	st = [ 2, -4, -4, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 8, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 8, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, 1, bsize*2 ];
-	st = [ 2, 2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, bsize*2, 1 ];
-	st = [ 2, 2, -4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, bsize*2, 1, 2 ];
-	st = [ 2, 2, -bsize*4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 4-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 1, 2 ];
-	st = [ 2, -bsize*4, bsize*4, -bsize*4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.5d.js b/test/test.5d.js
deleted file mode 100644
index 598a39b..0000000
--- a/test/test.5d.js
+++ /dev/null
@@ -1,1988 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 2, 1, 2, 2 ];
-	st = [ -8, -4, -4, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ 8, -8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2 ];
-	st = [ bsize*8, -4, 4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1 ];
-	st = [ bsize*8, bsize*8, -bsize*4, -2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, -4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ 8, -8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2 ];
-	st = [ -bsize*8, -4, 4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 8, 8, -4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ 8, -8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2 ];
-	st = [ -bsize*8, -4, 4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2, 2 ];
-	st = [ -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, -4, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2 ];
-	st = [ -2, 4, -bsize*8, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ -2, 4, -4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2 ];
-	st = [ -2, 4, -4, 4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ -2, 4, -4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ -1, -2, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, 4, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1 ];
-	st = [ -2, 4, -bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ -2, 4, -4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2 ];
-	st = [ -2, -4, -4, 4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ 2, 4, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ -1, -2, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2 ];
-	st = [ 2, -4, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2 ];
-	st = [ -2, bsize*4, -bsize*4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1 ];
-	st = [ -2, 4, -bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2 ];
-	st = [ -2, 4, -4, bsize*8, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2 ];
-	st = [ -2, -4, -4, 4, bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 5-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2 ];
-	st = [ 2, 4, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.6d.js b/test/test.6d.js
deleted file mode 100644
index 47ca531..0000000
--- a/test/test.6d.js
+++ /dev/null
@@ -1,2198 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, -16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ 8, -8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ bsize*8, -4, -4, 4, 4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, bsize*8, -bsize*8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, -16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ 8, -8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ -bsize*8, -4, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 8, -4, -4, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ 8, -8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ -bsize*8, -4, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ bsize*8, bsize*8, -4, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ bsize*8, -bsize*8, -bsize*8, -bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ bsize*8, -bsize*8, -bsize*4, -bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -1, -1, -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, -2, 2, -4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, bsize*4, bsize*4, -bsize*4, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
-	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ 2, 4, 4, -8, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -1, -1, -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
-	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ 2, 4, 4, -8, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ -1, -1, -1, -2, -4, -4 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2 ];
-	st = [ 2, 4, bsize*8, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 1, 2 ];
-	st = [ 2, 4, 4, -bsize*8, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2 ];
-	st = [ 2, 4, 4, -4, bsize*8, -bsize*8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 1 ];
-	st = [ 2, 4, 4, -4, 8, -bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 6-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2 ];
-	st = [ 2, 4, 4, -8, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.7d.js b/test/test.7d.js
deleted file mode 100644
index 08017ba..0000000
--- a/test/test.7d.js
+++ /dev/null
@@ -1,2408 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, -16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, -16, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*16, -8, 8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ bsize*16, -bsize*16, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
-	st = [ bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
-	st = [ -8, -8, -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -16, 16, -16, -8, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, -16, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ bsize*16, -8, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ bsize*16, bsize*16, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
-	st = [ bsize*16, -bsize*16, -bsize*8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, 1, bsize*2, 2 ];
-	st = [ bsize*16, -bsize*16, -bsize*16, -bsize*8, bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
-	st = [ -8, -8, -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -16, 16, -16, 8, -4, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, -16, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ -bsize*16, -8, 8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ bsize*16, -bsize*16, -8, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 1, 2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ bsize*16, -bsize*16, -bsize*8, -bsize*8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, 1, bsize*2, 2 ];
-	st = [ bsize*16, -bsize*16, bsize*16, bsize*8, -bsize*8, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ bsize*16, -bsize*16, bsize*8, bsize*8, -bsize*4, bsize*4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, -2, 2, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 2, 1, 2, 1 ];
-	st = [ 2, -4, bsize*8, -bsize*8, bsize*16, -bsize*16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, -4, -4, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2, 1, 2 ];
-	st = [ 2, -4, -4, 4, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
-	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ 2, -4, -4, 8, 8, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, -2, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, -bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, 4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, -4, 4, -bsize*8, bsize*8, -bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2, 2 ];
-	st = [ 2, -4, -4, 4, bsize*8, bsize*8, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
-	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ 2, -4, -4, 8, 8, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 2 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, -4, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 2, 1, 2 ];
-	st = [ 2, -bsize*4, -bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, -4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, -4, -4, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 1, 2, 2 ];
-	st = [ 2, -4, -4, 4, bsize*8, bsize*8, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 1, 2 ];
-	st = [ 2, -4, -4, 8, 8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2 ];
-	st = [ 2, -4, -4, 8, 8, 8, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 7-dimensional ndarray is truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, bsize*2 ];
-	st = [ 2, -4, -4, 8, 8, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.8d.js b/test/test.8d.js
deleted file mode 100644
index 20fc2d4..0000000
--- a/test/test.8d.js
+++ /dev/null
@@ -1,2645 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, -16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
-	st = [ 32, -16, 8, -8, -8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
-	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
-	st = [ -bsize*32, -bsize*32, 16, -8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
-	st = [ -bsize*32, -bsize*32, bsize*32, -16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
-	st = [ -bsize*32, -bsize*32, bsize*16, -bsize*16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
-	st = [ -bsize*32, -bsize*32, -bsize*16, -bsize*16, -bsize*16, 8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ -bsize*16, -bsize*16, -bsize*8, bsize*8, bsize*8, bsize*8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
-	st = [
-		-bsize*16,
-		-bsize*16,
-		-bsize*8,
-		bsize*8,
-		bsize*8,
-		bsize*4,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, -16, 16, -16, -8, -4, 2, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
-	st = [ 32, 16, 8, -8, -8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
-	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
-	st = [ bsize*32, bsize*32, 16, 8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
-	st = [ bsize*32, -bsize*32, -bsize*32, -16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
-	st = [ bsize*32, -bsize*32, bsize*16, -bsize*16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
-	st = [ bsize*32, -bsize*32, -bsize*16, -bsize*16, bsize*16, 8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ -bsize*16, -bsize*16, bsize*8, -bsize*8, -bsize*8, bsize*8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
-	st = [
-		-bsize*16,
-		-bsize*16,
-		bsize*8,
-		-bsize*8,
-		-bsize*8,
-		bsize*4,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, -16, 16, -16, 8, -4, -2, -2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 2 ];
-	st = [ 32, 16, 8, -8, -8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 2 ];
-	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, bsize*2, 2, 1, 2, 1, 2 ];
-	st = [ -bsize*32, -bsize*32, 16, -8, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, bsize*2, 2, 2, 1, 2 ];
-	st = [ -bsize*32, bsize*32, -bsize*32, -16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, bsize*2, 2, 1, 2 ];
-	st = [ -bsize*32, -bsize*32, -bsize*16, -bsize*16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, bsize*2, 2, 2 ];
-	st = [ -bsize*32, -bsize*32, bsize*16, bsize*16, -bsize*16, 8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 2 ];
-	st = [ -bsize*16, -bsize*16, bsize*8, bsize*8, -bsize*8, bsize*8, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 1, bsize*2 ];
-	st = [
-		-bsize*16,
-		-bsize*16,
-		bsize*8,
-		bsize*8,
-		-bsize*8,
-		bsize*4,
-		-bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, -2, 2, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
-	st = [ 2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
-	st = [ 2, -4, bsize*8, -bsize*8, bsize*8, bsize*8, -bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, 4, 8, bsize*16, bsize*16, bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 8, 16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
-	st = [ 2, -4, -4, 8, 8, 16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -2, 2, -2, 2, 2, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
-	st = [ 2, bsize*4, bsize*4, -bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
-	st = [ 2, -4, -bsize*8, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, 4, 8, -bsize*16, bsize*16, -bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 8, 16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = [ -1, -1, -1, -1, -2, -4, -4, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 1, 2, 1, 1, 2, 1, 2 ];
-	st = [ 2, -bsize*4, -bsize*4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 1, 1, 1, 2, 1, 2 ];
-	st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 1, 1, 2, 1, 2 ];
-	st = [ 2, -4, -8, bsize*16, bsize*16, bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 1, 2, 1, 2 ];
-	st = [ 2, -4, -4, 8, bsize*16, bsize*16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 1, 1, 2 ];
-	st = [ 2, -4, -4, 8, 16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 1, 2 ];
-	st = [ 2, -4, -4, 8, 8, 16, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, -4, -4, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an 8-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.9d.js b/test/test.9d.js
deleted file mode 100644
index e5fc1d1..0000000
--- a/test/test.9d.js
+++ /dev/null
@@ -1,2978 +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 toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var blockSize = require( '@stdlib/ndarray-base-nullary-tiling-block-size' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, -16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ 32, -16, 8, -8, -8, 4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ -bsize*32, -16, 8, -8, -8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 1, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ -bsize*64, -bsize*32, 16, -8, -8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ -bsize*64, -bsize*64, bsize*32, -bsize*16, -8, 4, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ -bsize*64, -bsize*64, -bsize*32, -bsize*32, -bsize*16, 8, -4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		-bsize*64,
-		-bsize*64,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		bsize*16,
-		8,
-		-4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ 32, -16, -8, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ bsize*32, -16, -8, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*32, -16, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, bsize*16, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, bsize*32, bsize*16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		bsize*64,
-		-bsize*64,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		-bsize*16,
-		8,
-		-4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, -16, 16, -8, -4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ 32, -16, -8, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [ bsize*32, -16, -8, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*32, -16, 8, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, 16, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, bsize*16, 8, -4, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ bsize*64, -bsize*64, -bsize*32, bsize*32, bsize*16, -8, 4, -4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [
-		bsize*64,
-		-bsize*64,
-		-bsize*32,
-		bsize*32,
-		bsize*32,
-		-bsize*16,
-		8,
-		-4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*16,
-		-bsize*16,
-		bsize*8,
-		4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (row-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 2, bsize*2 ];
-	st = [
-		-bsize*32,
-		-bsize*32,
-		-bsize*16,
-		bsize*16,
-		bsize*8,
-		-bsize*8,
-		bsize*8,
-		bsize*4,
-		2
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
-	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 2, 2, 1, 2, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, -2, 2, -2, 2, 1, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( 16, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( 16, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
-	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, complex)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 2, 1, 2, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -4, -4, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh ), dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, 2, 4, 8, 8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 2, 2, 2, 2, 2, -2, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( 16, dt ) ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( 16, dt ) ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ bsize*2, 2, 2, 1, 1, 2, 1, 1, 2 ];
-	st = [
-		2,
-		bsize*4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*32,
-		bsize*32,
-		bsize*32
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, bsize*2, 2, 1, 1, 1, 1, 1, 2 ];
-	st = [
-		2,
-		4,
-		bsize*8,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16,
-		bsize*16
-	];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 2, bsize*2, 2, 1, 1, 1, 1, 2 ];
-	st = [ 2, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32, bsize*32 ]; // eslint-disable-line max-len
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, bsize*2, 2, 1, 1, 1, 2 ];
-	st = [ 2, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 1, 2, bsize*2, 2, 1, 1, 2 ];
-	st = [ 2, 4, 4, 4, 8, bsize*16, bsize*32, bsize*32, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 2, bsize*2, 2, 1, 2 ];
-	st = [ 2, 4, 4, 8, 8, 16, bsize*32, bsize*64, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 2, bsize*2, 2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 16, bsize*32, bsize*64 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, bsize*2, 2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, bsize*32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in a 9-dimensional ndarray are truthy (column-major, non-contiguous, large arrays, accessors)', function test( t ) {
-	var actual;
-	var bsize;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-
-	bsize = blockSize( dt );
-	sh = [ 2, 1, 2, 1, 1, 1, 2, 2, bsize*2 ];
-	st = [ 2, 4, 4, 8, 8, 8, 8, 16, 32 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, toAccessorArray( zeros( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, toAccessorArray( ones( numel( sh )*2, dt ) ), sh, st, o, ord ); // eslint-disable-line max-len
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.js b/test/test.js
deleted file mode 100644
index 5209e24..0000000
--- a/test/test.js
+++ /dev/null
@@ -1,52 +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 ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function' );
-	t.end();
-});
-
-tape( 'the function returns `false` if provided an empty input ndarray', function test( t ) {
-	var actual;
-	var x;
-	var n;
-
-	x = ndarray( 'float64', ones( 8, 'float64' ), [ 0 ], [ 1 ], 0, 'row-major' );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	t.end();
-});
diff --git a/test/test.nd.js b/test/test.nd.js
deleted file mode 100644
index 0a2c314..0000000
--- a/test/test.nd.js
+++ /dev/null
@@ -1,1062 +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 zeros = require( '@stdlib/array-zeros' );
-var ones = require( '@stdlib/array-ones' );
-var scalar2ndarray = require( '@stdlib/ndarray-from-scalar' );
-var Complex128Array = require( '@stdlib/array-complex128' );
-var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );
-var numel = require( '@stdlib/ndarray-base-numel' );
-var shape2strides = require( '@stdlib/ndarray-base-shape2strides' );
-var strides2offset = require( '@stdlib/ndarray-base-strides2offset' );
-var ndarray = require( '@stdlib/ndarray-ctor' );
-var some = require( './../lib' );
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( typeof some, 'function', 'main export is a function');
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 16, 16, -8, -4, -2, 1 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ -8, -8, -8, -8, -8, -8, -4, -4, -2, -2, -1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, 8, 8, 4, 4, 2 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, -16, 16, -8, -4, -2, 1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'row-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 16, 16, 16, 16, 16, 16, -16, 16, -8, -4, -2, 1 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, singleton dimensions)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, singleton dimensions, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, singleton dimensions, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, negative strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides)', function test( t ) {
-	var actual;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'float64';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 1, 1, 1, 1, 1, 1, 1, 1, -1, -4, 8, -8 ];
-	o = strides2offset( sh, st );
-
-	x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = shape2strides( sh, ord );
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, negative strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, contiguous, negative strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ -1, -2, -2, -4, -4, -8, -8, -8, -8, -8, -8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh ), 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, same sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1 ];
-	st = [ 2, 4, 4, 8, 8, 16, 16, 16, 16, 16, 16 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, complex)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'complex128';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 1, 1, 1, 1, -1, 1, -1, 1, 1, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*4, 'float64' );
-	x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});
-
-tape( 'the function tests whether at least `n` elements in an n-dimensional ndarray are truthy (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) {
-	var actual;
-	var xbuf;
-	var ord;
-	var sh;
-	var st;
-	var dt;
-	var o;
-	var x;
-	var n;
-
-	dt = 'generic';
-	ord = 'column-major';
-	sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2 ];
-	st = [ 1, 1, 1, 1, -1, 1, -1, 1, 1, -4, -8, 8 ];
-	o = strides2offset( sh, st );
-
-	xbuf = zeros( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-	n = scalar2ndarray( 1, {
-		'dtype': 'generic'
-	});
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, false, 'returns expected value' );
-
-	xbuf = ones( numel( sh )*2, 'generic' );
-	x = ndarray( dt, toAccessorArray( xbuf ), sh, st, o, ord );
-
-	actual = some( [ x, n ] );
-	t.strictEqual( actual, true, 'returns expected value' );
-
-	t.end();
-});