diff --git a/.editorconfig b/.editorconfig
deleted file mode 100644
index dab5d2a..0000000
--- a/.editorconfig
+++ /dev/null
@@ -1,180 +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
-
-# 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 1c88e69..0000000
--- a/.gitattributes
+++ /dev/null
@@ -1,66 +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
diff --git a/.github/.keepalive b/.github/.keepalive
deleted file mode 100644
index 5802f34..0000000
--- a/.github/.keepalive
+++ /dev/null
@@ -1 +0,0 @@
-2025-03-24T01:02:15.303Z
diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md
deleted file mode 100644
index 2f3e921..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/ctor) 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 2858986..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/ctor) 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 6ae02b8..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: '42 6 * * 0'
-
- # Allow the workflow to be manually run:
- workflow_dispatch:
-
-# Workflow jobs:
-jobs:
-
- # Define a job for retrieving npm download counts...
- npm_downloads:
-
- # Define display name:
- name: 'Retrieve npm download counts'
-
- # Define the type of virtual host machine on which to run the job:
- runs-on: ubuntu-latest
-
- # Define the sequence of job steps...
- steps:
- # Checkout the repository:
- - name: 'Checkout repository'
- # Pin action to full length commit SHA
- uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608 # v4.1.0
- timeout-minutes: 10
-
- # Install Node.js:
- - name: 'Install Node.js'
- # Pin action to full length commit SHA
- uses: actions/setup-node@b39b52d1213e96004bfcb1c61a8a6fa8ab84f3e8 # v4.0.1
- with:
- node-version: 20
- timeout-minutes: 5
-
- # Resolve package name:
- - name: 'Resolve package name'
- id: package_name
- run: |
- name=`node -e 'console.log(require("./package.json").name)' | tr -d '\n'`
- echo "package_name=$name" >> $GITHUB_OUTPUT
- timeout-minutes: 5
-
- # Fetch download data:
- - name: 'Fetch data'
- id: download_data
- run: |
- url="https://api.npmjs.org/downloads/range/$(date --date='1 year ago' '+%Y-%m-%d'):$(date '+%Y-%m-%d')/${{ steps.package_name.outputs.package_name }}"
- echo "$url"
- data=$(curl "$url")
- mkdir ./tmp
- echo "$data" > ./tmp/npm_downloads.json
- echo "data=$data" >> $GITHUB_OUTPUT
- timeout-minutes: 5
-
- # Print summary of download data:
- - name: 'Print summary'
- run: |
- echo "| Date | Downloads |" >> $GITHUB_STEP_SUMMARY
- echo "|------|------------|" >> $GITHUB_STEP_SUMMARY
- cat ./tmp/npm_downloads.json | jq -r ".downloads | .[-14:] | to_entries | map(\"| \(.value.day) | \(.value.downloads) |\") |.[]" >> $GITHUB_STEP_SUMMARY
-
- # Upload the download data:
- - name: 'Upload data'
- # Pin action to full length commit SHA
- uses: actions/upload-artifact@5d5d22a31266ced268874388b861e4b58bb5c2f3 # v4.3.1
- with:
- # Define a name for the uploaded artifact (ensuring a unique name for each job):
- name: npm_downloads
-
- # Specify the path to the file to upload:
- path: ./tmp/npm_downloads.json
-
- # Specify the number of days to retain the artifact (default is 90 days):
- retention-days: 90
- timeout-minutes: 10
- if: success()
-
- # Send data to events server:
- - name: 'Post data'
- # Pin action to full length commit SHA
- uses: distributhor/workflow-webhook@48a40b380ce4593b6a6676528cd005986ae56629 # v3.0.3
- env:
- webhook_url: ${{ secrets.STDLIB_NPM_DOWNLOADS_URL }}
- webhook_secret: ${{ secrets.STDLIB_WEBHOOK_SECRET }}
- data: '{ "downloads": ${{ steps.download_data.outputs.data }} }'
- timeout-minutes: 5
- if: success()
diff --git a/.github/workflows/productionize.yml b/.github/workflows/productionize.yml
deleted file mode 100644
index f4575e9..0000000
--- a/.github/workflows/productionize.yml
+++ /dev/null
@@ -1,794 +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 status to Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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 status to Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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 status to Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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 2888b88..0000000
--- a/.github/workflows/publish.yml
+++ /dev/null
@@ -1,252 +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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
- 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 status to Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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 519a729..0000000
--- a/.github/workflows/test.yml
+++ /dev/null
@@ -1,99 +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: '42 6 * * 0'
-
- # 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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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
-
- # 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
-
- # Run tests:
- - name: 'Run tests'
- id: tests
- run: |
- npm test || npm test || npm test
-
- # Send status to Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
diff --git a/.github/workflows/test_bundles.yml b/.github/workflows/test_bundles.yml
deleted file mode 100644
index 5b5879a..0000000
--- a/.github/workflows/test_bundles.yml
+++ /dev/null
@@ -1,186 +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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack channel if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
diff --git a/.github/workflows/test_coverage.yml b/.github/workflows/test_coverage.yml
deleted file mode 100644
index 2bcf0cd..0000000
--- a/.github/workflows/test_coverage.yml
+++ /dev/null
@@ -1,133 +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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack notification if job fails:
- - name: 'Send status to Slack channel in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
-
- # 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 77285f9..0000000
--- a/.github/workflows/test_install.yml
+++ /dev/null
@@ -1,85 +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: '42 6 * * 0'
-
- # 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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack notification if job fails:
- - name: 'Send notification to Slack in case of failure'
- # Pin action to full length commit SHA
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
diff --git a/.github/workflows/test_published_package.yml b/.github/workflows/test_published_package.yml
deleted file mode 100644
index 43891b4..0000000
--- a/.github/workflows/test_published_package.yml
+++ /dev/null
@@ -1,105 +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: '42 6 * * 0'
-
- # 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:
- SLACK_WEBHOOK_URL: ${{ secrets.SLACK_WEBHOOK_URL }}
-
- # 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 Slack notification if job fails:
- - name: 'Send notification to Slack in case of failure'
- uses: 8398a7/action-slack@28ba43ae48961b90635b50953d216767a6bea486 # v3.16.2
- with:
- status: ${{ job.status }}
- channel: '#npm-ci'
- if: failure()
diff --git a/.gitignore b/.gitignore
deleted file mode 100644
index 16b03f7..0000000
--- a/.gitignore
+++ /dev/null
@@ -1,194 +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/
-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
-
-# Visual Studio #
-#################
-.vscode/
-jsconfig.json
-
-# Sublime Text #
-################
-*.sublime-workspace
-*.sublime-project
-
-# Other editor files #
-######################
-.idea/
-
-# Cursor #
-##########
-.cursorignore
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 58dbd10..0000000
--- a/.npmrc
+++ /dev/null
@@ -1,31 +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
diff --git a/CHANGELOG.md b/CHANGELOG.md
deleted file mode 100644
index e09bca3..0000000
--- a/CHANGELOG.md
+++ /dev/null
@@ -1,248 +0,0 @@
-# CHANGELOG
-
-> Package changelog.
-
-<section class="release" id="unreleased">
-
-## Unreleased (2025-03-24)
-
-<section class="bug-fixes">
-
-### Bug Fixes
-
-- [`5e2bbef`](https://github.com/stdlib-js/stdlib/commit/5e2bbef14efd5937e23047c01af0e740e6cbd4f6) - add missing boolean array support
-- [`aea44c9`](https://github.com/stdlib-js/stdlib/commit/aea44c9c8699a4d748c0db70d4a60801bfc03c40) - update loop limit
-
-</section>
-
-<!-- /.bug-fixes -->
-
-<section class="commits">
-
-### Commits
-
-<details>
-
-- [`5e2bbef`](https://github.com/stdlib-js/stdlib/commit/5e2bbef14efd5937e23047c01af0e740e6cbd4f6) - **fix:** add missing boolean array support _(by Athan Reines)_
-- [`aea44c9`](https://github.com/stdlib-js/stdlib/commit/aea44c9c8699a4d748c0db70d4a60801bfc03c40) - **fix:** update loop limit _(by Athan Reines)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 1 person contributed to this release. Thank you to this contributor:
-
-- Athan Reines
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.2.2">
-
-## 0.2.2 (2024-07-28)
-
-<section class="commits">
-
-### Commits
-
-<details>
-
-- [`32bbcb3`](https://github.com/stdlib-js/stdlib/commit/32bbcb3b3dae1f028fd18166ee7875a93d44d0ee) - **refactor:** update paths _(by Athan Reines)_
-- [`ed9c0a5`](https://github.com/stdlib-js/stdlib/commit/ed9c0a5e55ff09af3dd6af8c38615480e2c1828e) - **refactor:** update paths _(by Athan Reines)_
-- [`75d4f83`](https://github.com/stdlib-js/stdlib/commit/75d4f83cb85610d23a04dc21a03f8075f6d3665f) - **refactor:** update require and include paths _(by Athan Reines)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 1 person contributed to this release. Thank you to this contributor:
-
-- Athan Reines
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.2.1">
-
-## 0.2.1 (2024-02-24)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.2.0">
-
-## 0.2.0 (2024-02-14)
-
-<section class="commits">
-
-### Commits
-
-<details>
-
-- [`b496b72`](https://github.com/stdlib-js/stdlib/commit/b496b72595355b5a794c940bd7f81ea5223b91bd) - **build:** replace tslint directive with eslint equivalent _(by Philipp Burckhardt)_
-- [`453dd85`](https://github.com/stdlib-js/stdlib/commit/453dd85b5dd186d2b4d458256fe84906e1503fe2) - **build:** remove tslint directives _(by Philipp Burckhardt)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 1 person contributed to this release. Thank you to this contributor:
-
-- Philipp Burckhardt
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.1.0">
-
-## 0.1.0 (2023-09-24)
-
-<section class="features">
-
-### Features
-
-- [`7ae5741`](https://github.com/stdlib-js/stdlib/commit/7ae574143c9716c82cea6cbf839a20b70a9cdfe0) - update minimum TypeScript version
-
-</section>
-
-<!-- /.features -->
-
-<section class="breaking-changes">
-
-### BREAKING CHANGES
-
-- [`7ae5741`](https://github.com/stdlib-js/stdlib/commit/7ae574143c9716c82cea6cbf839a20b70a9cdfe0): update minimum TypeScript version to 4.1
-
- - To migrate, users should upgrade their TypeScript version to at least version 4.1.
-
-</section>
-
-<!-- /.breaking-changes -->
-
-<section class="commits">
-
-### Commits
-
-<details>
-
-- [`7ae5741`](https://github.com/stdlib-js/stdlib/commit/7ae574143c9716c82cea6cbf839a20b70a9cdfe0) - **feat:** update minimum TypeScript version _(by Philipp Burckhardt)_
-- [`ab5d324`](https://github.com/stdlib-js/stdlib/commit/ab5d324b547870938b21ebdeecc1f7fda132f321) - **chore:** resolve lint errors _(by Philipp Burckhardt)_
-
-</details>
-
-</section>
-
-<!-- /.commits -->
-
-<section class="contributors">
-
-### Contributors
-
-A total of 1 person contributed to this release. Thank you to this contributor:
-
-- Philipp Burckhardt
-
-</section>
-
-<!-- /.contributors -->
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.6">
-
-## 0.0.6 (2022-02-16)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.5">
-
-## 0.0.5 (2021-08-22)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.4">
-
-## 0.0.4 (2021-07-07)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.3">
-
-## 0.0.3 (2021-06-27)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.2">
-
-## 0.0.2 (2021-06-16)
-
-No changes reported for this release.
-
-</section>
-
-<!-- /.release -->
-
-<section class="release" id="v0.0.1">
-
-## 0.0.1 (2021-06-15)
-
-No changes reported for this release.
-
-</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 b4ffd7d..5e2eabd 100644
--- a/README.md
+++ b/README.md
@@ -45,32 +45,14 @@ limitations under the License.
<!-- Package usage documentation. -->
-<section class="installation">
-## Installation
-
-```bash
-npm install @stdlib/ndarray-base-ctor
-```
-
-Alternatively,
-
-- 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]).
-
-The [branches.md][branches-url] file summarizes the available branches and displays a diagram illustrating their relationships.
-
-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.
-
-</section>
<section class="usage">
## Usage
```javascript
-var ndarray = require( '@stdlib/ndarray-base-ctor' );
+import ndarray from 'https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-ctor@esm/index.mjs';
```
<a name="main"></a>
@@ -137,7 +119,7 @@ var str = ndarray.name;
Size (in bytes) of the array (if known).
```javascript
-var Float64Array = require( '@stdlib/array-float64' );
+import Float64Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-float64@esm/index.mjs';
// Specify the array configuration:
var buffer = new Float64Array( [ 1, 2, 3, 4 ] );
@@ -179,7 +161,7 @@ var nbytes = arr.byteLength;
Size (in bytes) of each array element (if known).
```javascript
-var Float32Array = require( '@stdlib/array-float32' );
+import Float32Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-float32@esm/index.mjs';
// Specify the array configuration:
var buffer = new Float32Array( [ 1, 2, 3, 4 ] );
@@ -221,7 +203,7 @@ var nbytes = arr.BYTES_PER_ELEMENT;
A reference to the underlying data buffer.
```javascript
-var Int8Array = require( '@stdlib/array-int8' );
+import Int8Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-int8@esm/index.mjs';
// Specify the array configuration:
var buffer = new Int8Array( [ 1, 2, 3, 4 ] );
@@ -248,7 +230,7 @@ var bool = ( d === buffer );
Underlying [data type][@stdlib/ndarray/dtypes].
```javascript
-var Uint8Array = require( '@stdlib/array-uint8' );
+import Uint8Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-uint8@esm/index.mjs';
// Specify the array configuration:
var buffer = new Uint8Array( [ 1, 2, 3, 4 ] );
@@ -278,7 +260,7 @@ Meta information, such as information concerning the memory layout of the array.
An array is contiguous if (1) an array is compatible with being stored in a single memory segment and (2) each array element is adjacent to the next array element. Note that an array can be both row-major contiguous and column-major contiguous at the same time (e.g., if an array is a 1-dimensional ndarray with `strides = [1]`).
```javascript
-var Int32Array = require( '@stdlib/array-int32' );
+import Int32Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-int32@esm/index.mjs';
// Specify the array configuration:
var buffer = new Int32Array( [ 1, 2, 3, 4 ] );
@@ -302,7 +284,7 @@ var flg = arr.flags;
Number of array elements.
```javascript
-var Uint16Array = require( '@stdlib/array-uint16' );
+import Uint16Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-uint16@esm/index.mjs';
// Specify the array configuration:
var buffer = new Uint16Array( [ 1, 2, 3, 4 ] );
@@ -326,7 +308,7 @@ var len = arr.length;
Number of dimensions.
```javascript
-var Uint8ClampedArray = require( '@stdlib/array-uint8c' );
+import Uint8ClampedArray from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-uint8c@esm/index.mjs';
// Specify the array configuration:
var buffer = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );
@@ -350,7 +332,7 @@ var ndims = arr.ndims;
Index offset which specifies the `buffer` index at which to start iterating over array elements.
```javascript
-var Int16Array = require( '@stdlib/array-int16' );
+import Int16Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-int16@esm/index.mjs';
// Specify the array configuration:
var buffer = new Int16Array( [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 ] );
@@ -374,7 +356,7 @@ var o = arr.offset;
Array order. The array order is either row-major (C-style) or column-major (Fortran-style).
```javascript
-var Uint32Array = require( '@stdlib/array-uint32' );
+import Uint32Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-uint32@esm/index.mjs';
// Specify the array configuration:
var buffer = new Uint32Array( [ 1, 2, 3, 4 ] );
@@ -619,9 +601,14 @@ The method does **not** serialize data outside of the buffer region defined by t
<!-- eslint no-undef: "error" -->
-```javascript
-var Float32Array = require( '@stdlib/array-float32' );
-var ndarray = require( '@stdlib/ndarray-base-ctor' );
+```html
+<!DOCTYPE html>
+<html lang="en">
+<body>
+<script type="module">
+
+import Float32Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-float32@esm/index.mjs';
+import ndarray from 'https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-ctor@esm/index.mjs';
// Create a data buffer:
var buffer = new Float32Array( (3*3*3*3) + 100 );
@@ -659,6 +646,10 @@ var str = arr.toString();
// Serialize the array as JSON:
str = JSON.stringify( arr.toJSON() );
// e.g., returns '{"type":"ndarray","dtype":"float32","flags":{"READONLY":false},"order":"row-major","shape":[3,3,3,3],"strides":[27,9,3,1],"data":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]}'
+
+</script>
+</body>
+</html>
```
</section>
@@ -697,7 +688,7 @@ str = JSON.stringify( arr.toJSON() );
## Notice
-This package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
+This package is part of [stdlib][stdlib], a standard library with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
For more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].
@@ -762,17 +753,17 @@ Copyright © 2016-2025. The Stdlib [Authors][stdlib-authors].
[json]: http://www.json.org/
-[@stdlib/ndarray/dtypes]: https://github.com/stdlib-js/ndarray-dtypes
+[@stdlib/ndarray/dtypes]: https://github.com/stdlib-js/ndarray-dtypes/tree/esm
-[@stdlib/array/complex64]: https://github.com/stdlib-js/array-complex64
+[@stdlib/array/complex64]: https://github.com/stdlib-js/array-complex64/tree/esm
-[@stdlib/array/complex128]: https://github.com/stdlib-js/array-complex128
+[@stdlib/array/complex128]: https://github.com/stdlib-js/array-complex128/tree/esm
<!-- <related-links> -->
-[@stdlib/ndarray/array]: https://github.com/stdlib-js/ndarray-array
+[@stdlib/ndarray/array]: https://github.com/stdlib-js/ndarray-array/tree/esm
-[@stdlib/ndarray/ctor]: https://github.com/stdlib-js/ndarray-ctor
+[@stdlib/ndarray/ctor]: https://github.com/stdlib-js/ndarray-ctor/tree/esm
<!-- </related-links> -->
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.js b/benchmark/benchmark.js
deleted file mode 100644
index 1828b4b..0000000
--- a/benchmark/benchmark.js
+++ /dev/null
@@ -1,1277 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 randu = require( '@stdlib/random-base-randu' );
-var floor = require( '@stdlib/math-base-special-floor' );
-var pkg = require( './../package.json' ).name;
-var ndarray = require( './../lib' );
-
-
-// MAIN //
-
-bench( pkg+'::instantiation', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 0 ] = randu();
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
- if ( out.length === 0 ) {
- b.fail( 'should have a length greater than 0' );
- }
- }
- b.toc();
- if ( out.length === 0 ) {
- b.fail( 'should have a length greater than 0' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::instantiation,new', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 0 ] = randu();
- out = new ndarray( 'generic', buffer, shape, strides, offset, order );
- if ( out.length === 0 ) {
- b.fail( 'should have a length greater than 0' );
- }
- }
- b.toc();
- if ( out.length === 0 ) {
- b.fail( 'should have a length greater than 0' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:byteLength', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.byteLength;
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- }
- b.toc();
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_byteLength', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._byteLength; // eslint-disable-line no-underscore-dangle
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- }
- b.toc();
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:BYTES_PER_ELEMENT', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.BYTES_PER_ELEMENT;
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- }
- b.toc();
- if ( v !== null ) {
- b.fail( 'should return null' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:data', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.data;
- if ( v.length !== 6 ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== 6 ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_buffer', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._buffer; // eslint-disable-line no-underscore-dangle
- if ( v.length !== 6 ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== 6 ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:dtype', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.dtype;
- if ( v !== 'generic' ) {
- b.fail( 'should return expected data type' );
- }
- }
- b.toc();
- if ( v !== 'generic' ) {
- b.fail( 'should return expected data type' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:flags', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.flags;
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- }
- b.toc();
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_flags', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._flags; // eslint-disable-line no-underscore-dangle
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- }
- b.toc();
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:length', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.length;
- if ( v !== buffer.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v !== buffer.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_length', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._length; // eslint-disable-line no-underscore-dangle
- if ( v !== buffer.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v !== buffer.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:ndims', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.ndims;
- if ( v !== shape.length ) {
- b.fail( 'should return expected number of dimensions' );
- }
- }
- b.toc();
- if ( v !== shape.length ) {
- b.fail( 'should return expected number of dimensions' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:offset', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.offset;
- if ( v !== offset ) {
- b.fail( 'should return expected offset' );
- }
- }
- b.toc();
- if ( v !== offset ) {
- b.fail( 'should return expected offset' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_offset', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._offset; // eslint-disable-line no-underscore-dangle
- if ( v !== offset ) {
- b.fail( 'should return expected offset' );
- }
- }
- b.toc();
- if ( v !== offset ) {
- b.fail( 'should return expected offset' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:order', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.order;
- if ( v !== order ) {
- b.fail( 'should return expected order' );
- }
- }
- b.toc();
- if ( v !== order ) {
- b.fail( 'should return expected order' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_order', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._order; // eslint-disable-line no-underscore-dangle
- if ( v !== order ) {
- b.fail( 'should return expected order' );
- }
- }
- b.toc();
- if ( v !== order ) {
- b.fail( 'should return expected order' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:shape', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.shape;
- if ( v.length !== shape.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== shape.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_shape', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._shape; // eslint-disable-line no-underscore-dangle
- if ( v.length !== shape.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== shape.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:strides', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out.strides;
- if ( v.length !== strides.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== strides.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::get:_strides', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = out._strides; // eslint-disable-line no-underscore-dangle
- if ( v.length !== strides.length ) {
- b.fail( 'should return expected length' );
- }
- }
- b.toc();
- if ( v.length !== strides.length ) {
- b.fail( 'should return expected length' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+':get', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.get( floor( randu()*3.0 ), 1 );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_positive_strides:iget:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_positive_strides:iget:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_negative_strides:iget:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, -1 ];
- offset = 3;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_negative_strides:iget:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, -1 ];
- offset = 3;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::mixed_sign_strides:iget:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, 1 ];
- offset = 2;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::mixed_sign_strides:iget:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, 1 ];
- offset = 2;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.iget( floor( randu()*4.0 ) );
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- }
- b.toc();
- if ( v !== v ) {
- b.fail( 'should not return NaN' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+':set', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*3.0 );
- out.set( j, 1, v );
- if ( buffer[ (2*j) + (1*1) ] !== v ) {
- b.fail( 'should set value' );
- }
- }
- b.toc();
- if ( buffer[ (2*j) + 1 ] !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_positive_strides:iset:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ j ] !== v ) {
- b.fail( 'should set value' );
- }
- }
- b.toc();
- if ( buffer[ j ] !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_positive_strides:iset:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ j ] !== v ) {
- b.fail( 'should set value' );
- }
- }
- b.toc();
- if ( buffer[ j ] !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_negative_strides:iset:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, -1 ];
- offset = 3;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ 3-j ] !== v ) {
- b.fail( 'should set value' );
- }
- }
- b.toc();
- if ( buffer[ 3-j ] !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::all_negative_strides:iset:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, -1 ];
- offset = 3;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ 3-j ] !== v ) {
- b.fail( 'should set value' );
- }
- }
- b.toc();
- if ( buffer[ 3-j ] !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::mixed_sign_strides:iset:order=row-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, 1 ];
- offset = 2;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ 0 ] !== buffer[ 0 ] ) {
- b.fail( 'should not be NaN' );
- }
- }
- b.toc();
- if ( out.iget( j ) !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+'::mixed_sign_strides:iset:order=column-major', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
- var j;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ -2, 1 ];
- offset = 2;
- order = 'column-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- v = randu();
- j = floor( randu()*4.0 );
- out.iset( j, v );
- if ( buffer[ 0 ] !== buffer[ 0 ] ) {
- b.fail( 'should not be NaN' );
- }
- }
- b.toc();
- if ( out.iget( j ) !== v ) {
- b.fail( 'should set value' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+':toJSON', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.toJSON();
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- }
- b.toc();
- if ( typeof v !== 'object' ) {
- b.fail( 'should return an object' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
-
-bench( pkg+':toString', function benchmark( b ) {
- var strides;
- var buffer;
- var offset;
- var shape;
- var order;
- var out;
- var v;
- var i;
-
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
- shape = [ 3, 2 ];
- strides = [ 2, 1 ];
- offset = 0;
- order = 'row-major';
-
- out = ndarray( 'generic', buffer, shape, strides, offset, order );
-
- b.tic();
- for ( i = 0; i < b.iterations; i++ ) {
- buffer[ 1 ] = randu();
- v = out.toString();
- if ( typeof v !== 'string' ) {
- b.fail( 'should return a string' );
- }
- }
- b.toc();
- if ( typeof v !== 'string' ) {
- b.fail( 'should return a string' );
- }
- b.pass( 'benchmark finished' );
- b.end();
-});
diff --git a/benchmark/python/numpy/benchmark.py b/benchmark/python/numpy/benchmark.py
deleted file mode 100644
index 07b8b37..0000000
--- a/benchmark/python/numpy/benchmark.py
+++ /dev/null
@@ -1,193 +0,0 @@
-#!/usr/bin/env python
-#
-# @license Apache-2.0
-#
-# Copyright (c) 2018 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.
-
-"""Benchmark numpy.ndarray."""
-
-from __future__ import print_function
-import timeit
-
-REPEATS = 3
-COUNT = [0] # use a list to allow modification within nested scopes
-
-
-def print_version():
- """Print the TAP version."""
- print("TAP version 13")
-
-
-def print_summary(total, passing):
- """Print the benchmark summary.
-
- # Arguments
-
- * `total`: total number of tests
- * `passing`: number of passing tests
-
- """
- print("#")
- print("1.." + str(total)) # TAP plan
- print("# total " + str(total))
- print("# pass " + str(passing))
- print("#")
- print("# ok")
-
-
-def print_results(iterations, elapsed):
- """Print benchmark results.
-
- # Arguments
-
- * `iterations`: number of iterations
- * `elapsed`: elapsed time (in seconds)
-
- # Examples
-
- ``` python
- python> print_results(100000, 0.131009101868)
- ```
- """
- rate = iterations / elapsed
-
- print(" ---")
- print(" iterations: " + str(iterations))
- print(" elapsed: " + str(elapsed))
- print(" rate: " + str(rate))
- print(" ...")
-
-
-def benchmark(name, setup, stmt, iterations):
- """Run a benchmark and print benchmark results.
-
- # Arguments
-
- * `name`: benchmark name (suffix)
- * `setup`: benchmark setup
- * `stmt`: statement to benchmark
- * `iterations`: number of iterations
-
- # Examples
-
- ``` python
- python> benchmark("::random", "from random import random;", "y = random()", 1000000)
- ```
- """
- t = timeit.Timer(stmt, setup=setup)
-
- i = 0
- while i < REPEATS:
- print("# python::numpy" + name)
- COUNT[0] += 1
- elapsed = t.timeit(number=iterations)
- print_results(iterations, elapsed)
- print("ok " + str(COUNT[0]) + " benchmark finished")
- i += 1
-
-
-def main():
- """Run the benchmarks."""
- print_version()
-
- name = "::instantiation"
- setup = "import numpy as np; x = np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0], dtype='float64'); shape = [3, 2]; strides = [2, 1]; offset = 0; order = 'C';"
- stmt = "y = np.ndarray(buffer=x, shape=shape, strides=strides, offset=offset, order=order)"
- iterations = 100000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:data"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.data"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:dtype"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.dtype"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:flags"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.flags"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:length"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.size"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:BYTES_PER_ELEMENT"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.itemsize"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:byteLength"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.nbytes"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:ndims"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.ndim"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:shape"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.shape"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = "::get:strides"
- setup = "import numpy as np; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape);"
- stmt = "z = y.strides"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = ":get"
- setup = "import numpy as np; from math import floor; from random import random; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape, dtype='float64');"
- stmt = "z = y[int(floor(random()*3.0)), 1]"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = ":set"
- setup = "import numpy as np; from math import floor; from random import random; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape, dtype='float64');"
- stmt = "y[int(floor(random()*3.0)), 1] = random()"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = ":iget"
- setup = "import numpy as np; from math import floor; from random import random; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape, dtype='float64');"
- stmt = "z = y.item(int(floor(random()*4.0)))"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- name = ":iset"
- setup = "import numpy as np; from math import floor; from random import random; shape = [3, 2]; y = np.ndarray(buffer=np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0]), shape=shape, dtype='float64');"
- stmt = "y.itemset(int(floor(random()*4.0)), random())"
- iterations = 1000000
- benchmark(name, setup, stmt, iterations)
-
- print_summary(COUNT[0], COUNT[0])
-
-
-if __name__ == "__main__":
- main()
diff --git a/branches.md b/branches.md
deleted file mode 100644
index be11e2c..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/ctor"
-%% click B href "https://github.com/stdlib-js/ndarray-base-ctor/tree/main"
-%% click C href "https://github.com/stdlib-js/ndarray-base-ctor/tree/production"
-%% click D href "https://github.com/stdlib-js/ndarray-base-ctor/tree/esm"
-%% click E href "https://github.com/stdlib-js/ndarray-base-ctor/tree/deno"
-%% click F href "https://github.com/stdlib-js/ndarray-base-ctor/tree/umd"
-```
-
-[stdlib-url]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/ndarray/base/ctor
-[production-url]: https://github.com/stdlib-js/ndarray-base-ctor/tree/production
-[deno-url]: https://github.com/stdlib-js/ndarray-base-ctor/tree/deno
-[deno-readme]: https://github.com/stdlib-js/ndarray-base-ctor/blob/deno/README.md
-[umd-url]: https://github.com/stdlib-js/ndarray-base-ctor/tree/umd
-[umd-readme]: https://github.com/stdlib-js/ndarray-base-ctor/blob/umd/README.md
-[esm-url]: https://github.com/stdlib-js/ndarray-base-ctor/tree/esm
-[esm-readme]: https://github.com/stdlib-js/ndarray-base-ctor/blob/esm/README.md
\ No newline at end of file
diff --git a/dist/index.d.ts b/dist/index.d.ts
deleted file mode 100644
index 0b44231..0000000
--- a/dist/index.d.ts
+++ /dev/null
@@ -1,3 +0,0 @@
-/// <reference path="../docs/types/index.d.ts" />
-import ctor from '../docs/types/index';
-export = ctor;
\ No newline at end of file
diff --git a/dist/index.js b/dist/index.js
deleted file mode 100644
index cce881f..0000000
--- a/dist/index.js
+++ /dev/null
@@ -1,30 +0,0 @@
-"use strict";var l=function(t,r){return function(){return r||t((r={exports:{}}).exports,r),r.exports}};var A=l(function(Qt,w){
-function $(t,r){return r&&(t===2||t===3)}w.exports=$
-});var R=l(function(Xt,N){
-function tt(t,r){return r&&(t===1||t===3)}N.exports=tt
-});var S=l(function(Zt,U){
-var et=require('@stdlib/ndarray-base-minmax-view-buffer-index/dist');function rt(t,r,n,s,o){var a;return t===0||o===0?!1:(a=et(r,n,s),t===a[1]-a[0]+1)}U.exports=rt
-});var M=l(function($t,C){
-function st(t){return{ROW_MAJOR_CONTIGUOUS:t.ROW_MAJOR_CONTIGUOUS,COLUMN_MAJOR_CONTIGUOUS:t.COLUMN_MAJOR_CONTIGUOUS,READONLY:t.READONLY}}C.exports=st
-});var T=l(function(te,L){
-function it(t){var r,n,s,o,a,e;if(s=this._ndims,s===0)return this._accessors?this._buffer.get(this._offset):this._buffer[this._offset];if(this._flags.ROW_MAJOR_CONTIGUOUS||this._flags.COLUMN_MAJOR_CONTIGUOUS){if(this._iterationOrder===1)return this._accessors?this._buffer.get(this._offset+t):this._buffer[this._offset+t];if(this._iterationOrder===-1)return this._accessors?this._buffer.get(this.offset-t):this._buffer[this._offset-t]}if(n=this._shape,r=this._strides,o=this._offset,this._order==="column-major"){for(e=0;e<s;e++)a=t%n[e],t-=a,t/=n[e],o+=a*r[e];return this._accessors?this._buffer.get(o):this._buffer[o]}for(e=s-1;e>=0;e--)a=t%n[e],t-=a,t/=n[e],o+=a*r[e];return this._accessors?this._buffer.get(o):this._buffer[o]}L.exports=it
-});var D=l(function(ee,B){
-function at(t,r){var n,s,o,a,e,i;if(o=this._ndims,o===0)return this._accessors?this._buffer.set(t,this._offset):this._buffer[this._offset]=t,this;if(this._flags.ROW_MAJOR_CONTIGUOUS||this._flags.COLUMN_MAJOR_CONTIGUOUS){if(this._iterationOrder===1)return this._accessors?this._buffer.set(r,this._offset+t):this._buffer[this._offset+t]=r,this;if(this._iterationOrder===-1)return this._accessors?this._buffer.set(r,this._offset-t):this._buffer[this._offset-t]=r,this}if(s=this._shape,n=this._strides,a=this._offset,this._order==="column-major"){for(i=0;i<o;i++)e=t%s[i],t-=e,t/=s[i],a+=e*n[i];return this._accessors?this._buffer.set(r,a):this._buffer[a]=r,this}for(i=o-1;i>=0;i--)e=t%s[i],t-=e,t/=s[i],a+=e*n[i];return this._accessors?this._buffer.set(r,a):this._buffer[a]=r,this}B.exports=at
-});var Y=l(function(re,J){
-function nt(){var t,r;for(t=this._offset,r=0;r<arguments.length-1;r++)t+=this._strides[r]*arguments[r];return this._accessors?this._buffer.set(arguments[r],t):this._buffer[t]=arguments[r],this}J.exports=nt
-});var x=l(function(se,P){
-function ot(){var t,r;for(t=this._offset,r=0;r<arguments.length;r++)t+=this._strides[r]*arguments[r];return this._accessors?this._buffer.get(t):this._buffer[t]}P.exports=ot
-});var j=l(function(ie,G){
-var ft=require('@stdlib/complex-float64-real/dist'),ht=require('@stdlib/complex-float64-imag/dist');function ut(){var t,r,n,s;for(r=this._length,t={},t.type="ndarray",t.dtype=this.dtype,t.flags={READONLY:this._flags.READONLY},t.order=this._order,t.shape=this._shape.slice(),t.strides=this._strides.slice(),s=0;s<t.strides.length;s++)t.strides[s]<0&&(t.strides[s]*=-1);if(t.data=[],t.dtype==="complex64"||t.dtype==="complex128")for(s=0;s<r;s++)n=this.iget(s),t.data.push(ft(n),ht(n));else for(s=0;s<r;s++)t.data.push(this.iget(s));return t}G.exports=ut
-});var W=l(function(ae,V){
-var _t=require('@stdlib/string-replace/dist'),q=require('@stdlib/complex-float64-real/dist'),I=require('@stdlib/complex-float64-imag/dist'),vt={int8:"new Int8Array( [ {{data}} ] )",uint8:"new Uint8Array( [ {{data}} ] )",uint8c:"new Uint8ClampedArray( [ {{data}} ] )",int16:"new Int16Array( [ {{data}} ] )",uint16:"new Uint16Array( [ {{data}} ] )",int32:"new Int32Array( [ {{data}} ] )",uint32:"new Uint32Array( [ {{data}} ] )",float32:"new Float32Array( [ {{data}} ] )",float64:"new Float64Array( [ {{data}} ] )",generic:"[ {{data}} ]",binary:"new Buffer( [ {{data}} ] )",complex64:"new Complex64Array( [ {{data}} ] )",complex128:"new Complex128Array( [ {{data}} ] )",bool:"new BooleanArray( [ {{data}} ] )"};function lt(){var t,r,n,s,o,a,e;if(r=this._shape.length,o=this._dtype,s="ndarray( '"+o+"', ",t="",this._length<=100)if(o==="complex64"||o==="complex128")for(e=0;e<this._length;e++)a=this.iget(e),t+=q(a)+", "+I(a),e<this._length-1&&(t+=", ");else for(e=0;e<this._length;e++)t+=this.iget(e),e<this._length-1&&(t+=", ");else{if(o==="complex64"||o==="complex128")for(e=0;e<3;e++)a=this.iget(e),t+=q(a)+", "+I(a),e<2&&(t+=", ");else for(e=0;e<3;e++)t+=this.iget(e),e<2&&(t+=", ");if(t+=", ..., ",o==="complex64"||o==="complex128")for(e=2;e>=0;e--)a=this.iget(this._length-1-e),t+=q(a)+", "+I(a),e>0&&(t+=", ");else for(e=2;e>=0;e--)t+=this.iget(this._length-1-e),e>0&&(t+=", ")}if(n=vt[this.dtype],s+=_t(n,"{{data}}",t),s+=", ",r===0?s+="[]":s+="[ "+this._shape.join(", ")+" ]",s+=", ",s+="[ ",r===0)s+="0";else for(e=0;e<r;e++)this._strides[e]<0?s+=-this._strides[e]:s+=this._strides[e],e<r-1&&(s+=", ");return s+=" ]",s+=", ",s+="0",s+=", ",s+="'"+this._order+"'",s+=" )",s}V.exports=lt
-});var z=l(function(ne,k){
-var m=require('@stdlib/assert-is-little-endian/dist'),gt=require('@stdlib/array-buffer/dist'),ct=require('@stdlib/array-dataview/dist'),O=require('@stdlib/bigint-ctor/dist'),pt=require('@stdlib/ndarray-dtypes/dist').enum,dt=require('@stdlib/ndarray-orders/dist').enum,mt=require('@stdlib/ndarray-index-modes/dist').enum,yt=pt(),Ot=dt(),F=mt();function bt(){var t,r,n,s,o,a,e,i,u,f,h,p,c,v;if(u=this._mode||"throw",e=this._submode||[u],p=this._ndims,c=e.length,n=33+p*16+c,i=this.__meta_dataview__,i&&i.byteLength===n)return i;for(i=new ct(new gt(n)),o=this._shape,a=this._strides,s=this._dtype,t=this._bytesPerElement,f=0,i.setInt8(f,m?1:0),f+=1,i.setInt16(f,yt[s],m),f+=2,i.setBigInt64(f,O(p),m),h=p*8,f+=8,v=0;v<p;v++)i.setBigInt64(f,O(o[v]),m),i.setBigInt64(f+h,O(a[v]*t),m),f+=8;for(f+=h,i.setBigInt64(f,O(this._offset*t),m),f+=8,i.setInt8(f,Ot[this._order]),f+=1,i.setInt8(f,F[u]),f+=1,i.setBigInt64(f,O(c),m),f+=8,v=0;v<c;v++)i.setInt8(f,F[e[v]]),f+=1;return r=0,r|=this._flags.READONLY?4:0,i.setInt32(f,r,m),this.__meta_dataview__=i,i}k.exports=bt
-});var Q=l(function(oe,K){
-var E=require('@stdlib/assert-is-little-endian/dist'),qt=require('@stdlib/array-buffer/dist'),It=require('@stdlib/array-dataview/dist'),Et=require('@stdlib/array-uint8/dist'),wt=require('@stdlib/ndarray-dtypes/dist').enum,At=require('@stdlib/ndarray-orders/dist').enum,Nt=require('@stdlib/ndarray-index-modes/dist').enum,b=require('@stdlib/number-float64-base-to-int64-bytes/dist').assign,Rt=wt(),Ut=At(),H=Nt();function St(){var t,r,n,s,o,a,e,i,u,f,h,p,c,v,d;if(f=this._mode||"throw",i=this._submode||[f],c=this._ndims,v=i.length,s=33+c*16+v,u=this.__meta_dataview__,u&&u.byteLength===s)return u;for(u=new It(new qt(s)),r=new Et(u.buffer),a=this._shape,e=this._strides,o=this._dtype,t=this._bytesPerElement,h=0,u.setInt8(h,E?1:0),h+=1,u.setInt16(h,Rt[o],E),h+=2,b(c,r,1,h),p=c*8,h+=8,d=0;d<c;d++)b(a[d],r,1,h),b(e[d]*t,r,1,h+p),h+=8;for(h+=p,b(this._offset*t,r,1,h),h+=8,u.setInt8(h,Ut[this._order]),h+=1,u.setInt8(h,H[f]),h+=1,b(v,r,1,h),h+=8,d=0;d<v;d++)u.setInt8(h,H[i[d]]),h+=1;return n=0,n|=this._flags.READONLY?4:0,u.setInt32(h,n,E),this.__meta_dataview__=u,u}K.exports=St
-});var Z=l(function(fe,X){
-var Ct=require('@stdlib/assert-has-bigint-support/dist'),y=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),g=require('@stdlib/utils-define-nonenumerable-read-only-accessor/dist'),Mt=require('@stdlib/ndarray-base-bytes-per-element/dist'),Lt=require('@stdlib/ndarray-base-iteration-order/dist'),Tt=require('@stdlib/ndarray-base-strides2order/dist'),Bt=require('@stdlib/boolean-ctor/dist'),Dt=A(),Jt=R(),Yt=S(),Pt=M(),xt=T(),Gt=D(),jt=Y(),Vt=x(),Wt=j(),Ft=W(),kt=z(),zt=Q();function _(t,r,n,s,o,a){var e,i,u,f,h;if(!(this instanceof _))return new _(t,r,n,s,o,a);for(f=1,h=0;h<n.length;h++)f*=n[h];return r.BYTES_PER_ELEMENT?i=r.BYTES_PER_ELEMENT*f:i=null,this._byteLength=i,this._bytesPerElement=Mt(t),this._buffer=r,this._dtype=t,this._length=f,this._ndims=n.length,this._offset=o,this._order=a,this._shape=n,this._strides=s,this._accessors=Bt(r.get&&r.set),this._iterationOrder=Lt(s),e=Yt(f,n,s,o,this._iterationOrder),u=Tt(s),this._flags={ROW_MAJOR_CONTIGUOUS:Jt(u,e),COLUMN_MAJOR_CONTIGUOUS:Dt(u,e),READONLY:!1},this.__meta_dataview__=null,this}y(_,"name","ndarray");g(_.prototype,"byteLength",function(){return this._byteLength});g(_.prototype,"BYTES_PER_ELEMENT",function(){return this._bytesPerElement});g(_.prototype,"data",function(){return this._buffer});g(_.prototype,"dtype",function(){return this._dtype});g(_.prototype,"flags",function(){return Pt(this._flags)});g(_.prototype,"length",function(){return this._length});g(_.prototype,"ndims",function(){return this._ndims});g(_.prototype,"offset",function(){return this._offset});g(_.prototype,"order",function(){return this._order});g(_.prototype,"shape",function(){return this._shape.slice()});g(_.prototype,"strides",function(){return this._strides.slice()});y(_.prototype,"get",Vt);y(_.prototype,"iget",xt);y(_.prototype,"set",jt);y(_.prototype,"iset",Gt);y(_.prototype,"toString",Ft);y(_.prototype,"toJSON",Wt);y(_.prototype,"__array_meta_dataview__",Ct()?kt:zt);X.exports=_
-});var Ht=Z();module.exports=Ht;
-/** @license Apache-2.0 */
-/** @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 1d69e12..0000000
--- a/dist/index.js.map
+++ /dev/null
@@ -1,7 +0,0 @@
-{
- "version": 3,
- "sources": ["../lib/is_column_major_contiguous.js", "../lib/is_row_major_contiguous.js", "../lib/is_contiguous.js", "../lib/copy_flags.js", "../lib/iget.js", "../lib/iset.js", "../lib/set.js", "../lib/get.js", "../lib/tojson.js", "../lib/tostring.js", "../lib/meta2dataview.js", "../lib/meta2dataview.polyfill.js", "../lib/main.js", "../lib/index.js"],
- "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Determines if an array is column-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is column-major contiguous\n*/\nfunction isColumnMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 2 || order === 3 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isColumnMajorContiguous;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Determines if an array is row-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is row-major contiguous\n*/\nfunction isRowMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 1 || order === 3 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isRowMajorContiguous;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' );\n\n\n// MAIN //\n\n/**\n* Determines if an array is contiguous.\n*\n* @private\n* @param {NonNegativeInteger} len - array length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {integer} iterationOrder - iteration order\n* @returns {boolean} boolean indicating if an array is contiguous\n*/\nfunction isContiguous( len, shape, strides, offset, iterationOrder ) {\n\tvar buf;\n\n\t// If an array does not contain any elements, then no data to store, and, if the array is unordered, adjacent array elements are not guaranteed to be stored next to each other.\n\tif ( len === 0 || iterationOrder === 0 ) {\n\t\treturn false;\n\t}\n\t// Ensure that the array is compatible with a single memory segment:\n\tbuf = minmaxViewBufferIndex( shape, strides, offset );\n\treturn ( len === ( buf[1]-buf[0]+1 ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isContiguous;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies ndarray flags.\n*\n* @private\n* @param {Object} flags - flags\n* @returns {Object} copy of input object\n*/\nfunction copyFlags( flags ) {\n\treturn {\n\t\t'ROW_MAJOR_CONTIGUOUS': flags.ROW_MAJOR_CONTIGUOUS,\n\t\t'COLUMN_MAJOR_CONTIGUOUS': flags.COLUMN_MAJOR_CONTIGUOUS,\n\t\t'READONLY': flags.READONLY\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = copyFlags;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( this._offset );\n\t\t}\n\t\treturn this._buffer[ this._offset ];\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this._offset+idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset+idx ];\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this.offset-idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset-idx ];\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( this._order === 'column-major' ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( ind );\n\t\t}\n\t\treturn this._buffer[ ind ];\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( ind );\n\t}\n\treturn this._buffer[ ind ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = iget;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Sets an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( idx, this._offset );\n\t\t} else {\n\t\t\tthis._buffer[ this._offset ] = idx;\n\t\t}\n\t\treturn this;\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset+idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset+idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset-idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset-idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( this._order === 'column-major' ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( v, ind );\n\t\t} else {\n\t\t\tthis._buffer[ ind ] = v;\n\t\t}\n\t\treturn this;\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( v, ind );\n\t} else {\n\t\tthis._buffer[ ind ] = v;\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nmodule.exports = iset;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nmodule.exports = set;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} idx - indices\n* @returns {*} array element\n*/\nfunction get() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = get;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar real = require( '@stdlib/complex-float64-real' );\nvar imag = require( '@stdlib/complex-float64-imag' );\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tlen = this._length;\n\n\t// Build an object containing all ndarray properties needed to revive a serialized ndarray...\n\tout = {};\n\tout.type = 'ndarray';\n\tout.dtype = this.dtype;\n\tout.flags = {\n\t\t'READONLY': this._flags.READONLY\n\t};\n\tout.order = this._order;\n\tout.shape = this._shape.slice();\n\tout.strides = this._strides.slice();\n\n\t// Flip the signs of negative strides:\n\tfor ( i = 0; i < out.strides.length; i++ ) {\n\t\tif ( out.strides[ i ] < 0 ) {\n\t\t\tout.strides[ i ] *= -1;\n\t\t}\n\t}\n\t// Cast data to generic array...\n\tout.data = [];\n\tif ( out.dtype === 'complex64' || out.dtype === 'complex128' ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tv = this.iget( i );\n\t\t\tout.data.push( real( v ), imag( v ) );\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tout.data.push( this.iget( i ) );\n\t\t}\n\t}\n\treturn out;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nmodule.exports = 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\nvar replace = require( '@stdlib/string-replace' );\nvar real = require( '@stdlib/complex-float64-real' );\nvar imag = require( '@stdlib/complex-float64-imag' );\n\n\n// VARIABLES //\n\nvar CTORS = {\n\t'int8': 'new Int8Array( [ {{data}} ] )',\n\t'uint8': 'new Uint8Array( [ {{data}} ] )',\n\t'uint8c': 'new Uint8ClampedArray( [ {{data}} ] )',\n\t'int16': 'new Int16Array( [ {{data}} ] )',\n\t'uint16': 'new Uint16Array( [ {{data}} ] )',\n\t'int32': 'new Int32Array( [ {{data}} ] )',\n\t'uint32': 'new Uint32Array( [ {{data}} ] )',\n\t'float32': 'new Float32Array( [ {{data}} ] )',\n\t'float64': 'new Float64Array( [ {{data}} ] )',\n\t'generic': '[ {{data}} ]',\n\t'binary': 'new Buffer( [ {{data}} ] )',\n\t'complex64': 'new Complex64Array( [ {{data}} ] )',\n\t'complex128': 'new Complex128Array( [ {{data}} ] )',\n\t'bool': 'new BooleanArray( [ {{data}} ] )'\n};\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {string} string representation\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar buffer;\n\tvar ndims;\n\tvar ctor;\n\tvar str;\n\tvar dt;\n\tvar v;\n\tvar i;\n\n\tndims = this._shape.length;\n\tdt = this._dtype;\n\n\t// Function to invoke to create an ndarray:\n\tstr = 'ndarray( \\''+dt+'\\', ';\n\n\t// Data buffer parameter...\n\tbuffer = '';\n\tif ( this._length <= 100 ) {\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// First three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuffer += ', ..., ';\n\n\t\t// Last three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tv = this.iget( this._length-1-i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tbuffer += this.iget( this._length-1-i );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tctor = CTORS[ this.dtype ];\n\tstr += replace( ctor, '{{data}}', buffer );\n\tstr += ', ';\n\n\t// Array shape...\n\tif ( ndims === 0 ) {\n\t\tstr += '[]';\n\t} else {\n\t\tstr += '[ ' + this._shape.join( ', ' ) + ' ]';\n\t}\n\tstr += ', ';\n\n\t// Stride array...\n\tstr += '[ ';\n\tif ( ndims === 0 ) {\n\t\tstr += '0';\n\t} else {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( this._strides[ i ] < 0 ) {\n\t\t\t\tstr += -this._strides[ i ];\n\t\t\t} else {\n\t\t\t\tstr += this._strides[ i ];\n\t\t\t}\n\t\t\tif ( i < ndims-1 ) {\n\t\t\t\tstr += ', ';\n\t\t\t}\n\t\t}\n\t}\n\tstr += ' ]';\n\tstr += ', ';\n\n\t// Buffer offset:\n\tstr += '0';\n\tstr += ', ';\n\n\t// Order:\n\tstr += '\\'' + this._order + '\\'';\n\n\t// Close the function call:\n\tstr += ' )';\n\treturn str;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nmodule.exports = toString;\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\nvar IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );\nvar ArrayBuffer = require( '@stdlib/array-buffer' );\nvar DataView = require( '@stdlib/array-dataview' );\nvar BigInt = require( '@stdlib/bigint-ctor' );\nvar dtypes = require( '@stdlib/ndarray-dtypes' ).enum;\nvar orders = require( '@stdlib/ndarray-orders' ).enum;\nvar modes = require( '@stdlib/ndarray-index-modes' ).enum;\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* <endianness>[int8],\n* <dtype>[int16],\n* <ndims>[int64],\n* <shape>[ndims*int64],\n* <strides>[ndims*int64],\n* <offset>[int64],\n* <order>[int8],\n* <mode>[int8],\n* <nsubmodes>[int64],\n* <submodes>[nsubmodes*int8],\n* <flags>[int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create a view for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tv.setBigInt64( o, BigInt( N ), IS_LITTLE_ENDIAN );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv.setBigInt64( o, BigInt( sh[i] ), IS_LITTLE_ENDIAN );\n\t\tv.setBigInt64( o+s, BigInt( st[i]*nbytes ), IS_LITTLE_ENDIAN );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tv.setBigInt64( o, BigInt( this._offset*nbytes ), IS_LITTLE_ENDIAN );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tv.setBigInt64( o, BigInt( M ), IS_LITTLE_ENDIAN );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nmodule.exports = meta2dataview;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );\nvar ArrayBuffer = require( '@stdlib/array-buffer' );\nvar DataView = require( '@stdlib/array-dataview' );\nvar Uint8Array = require( '@stdlib/array-uint8' );\nvar dtypes = require( '@stdlib/ndarray-dtypes' ).enum;\nvar orders = require( '@stdlib/ndarray-orders' ).enum;\nvar modes = require( '@stdlib/ndarray-index-modes' ).enum;\nvar float64ToInt64Bytes = require( '@stdlib/number-float64-base-to-int64-bytes' ).assign;\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* <endianness>[int8],\n* <dtype>[int16],\n* <ndims>[int64],\n* <shape>[ndims*int64],\n* <strides>[ndims*int64],\n* <offset>[int64],\n* <order>[int8],\n* <mode>[int8],\n* <nsubmodes>[int64],\n* <submodes>[nsubmodes*int8],\n* <flags>[int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar bytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create views for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\tbytes = new Uint8Array( v.buffer );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tfloat64ToInt64Bytes( N, bytes, 1, o );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tfloat64ToInt64Bytes( sh[i], bytes, 1, o );\n\t\tfloat64ToInt64Bytes( st[i]*nbytes, bytes, 1, o+s );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tfloat64ToInt64Bytes( this._offset*nbytes, bytes, 1, o );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tfloat64ToInt64Bytes( M, bytes, 1, o );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nmodule.exports = meta2dataview;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nvar hasBigIntSupport = require( '@stdlib/assert-has-bigint-support' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar bytesPerElement = require( '@stdlib/ndarray-base-bytes-per-element' );\nvar iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\nvar Boolean = require( '@stdlib/boolean-ctor' );\nvar isColumnMajorContiguous = require( './is_column_major_contiguous.js' );\nvar isRowMajorContiguous = require( './is_row_major_contiguous.js' );\nvar isContiguous = require( './is_contiguous.js' );\nvar copyFlags = require( './copy_flags.js' );\nvar igetValue = require( './iget.js' );\nvar isetValue = require( './iset.js' );\nvar setValue = require( './set.js' );\nvar getValue = require( './get.js' );\nvar toJSON = require( './tojson.js' );\nvar toString = require( './tostring.js' ); // eslint-disable-line stdlib/no-redeclare\nvar meta2dataview = require( './meta2dataview.js' );\nvar meta2dataviewPolyfill = require( './meta2dataview.polyfill.js' );\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* ## Notes\n*\n* - To create a zero-dimensional array,\n*\n* ```javascript\n* var buffer = [ 1 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n* ```\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {(ArrayLikeObject|TypedArray|Buffer)} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order ) {\n\tvar contiguous;\n\tvar nbytes;\n\tvar ord;\n\tvar len;\n\tvar i;\n\tif ( !(this instanceof ndarray) ) {\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t}\n\t// Compute the number of elements...\n\tlen = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tlen *= shape[ i ];\n\t}\n\t// Compute the number of bytes...\n\tif ( buffer.BYTES_PER_ELEMENT ) {\n\t\tnbytes = buffer.BYTES_PER_ELEMENT * len;\n\t} else {\n\t\tnbytes = null;\n\t}\n\t// Set private properties...\n\tthis._byteLength = nbytes;\n\tthis._bytesPerElement = bytesPerElement( dtype );\n\tthis._buffer = buffer;\n\tthis._dtype = dtype;\n\tthis._length = len;\n\tthis._ndims = shape.length;\n\tthis._offset = offset;\n\tthis._order = order;\n\tthis._shape = shape;\n\tthis._strides = strides;\n\tthis._accessors = Boolean( buffer.get && buffer.set );\n\n\tthis._iterationOrder = iterationOrder( strides );\n\n\t// Determine if the array can be stored contiguously:\n\tcontiguous = isContiguous( len, shape, strides, offset, this._iterationOrder ); // eslint-disable-line max-len\n\n\t// Infer the array \"order\" from the stride array (this is supplementary to the `order` parameter):\n\tord = strides2order( strides );\n\n\tthis._flags = {\n\t\t'ROW_MAJOR_CONTIGUOUS': isRowMajorContiguous( ord, contiguous ),\n\t\t'COLUMN_MAJOR_CONTIGUOUS': isColumnMajorContiguous( ord, contiguous ),\n\t\t'READONLY': false\n\t};\n\n\t// Initialize a property for caching serialized meta data:\n\tthis.__meta_dataview__ = null;\n\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Size (in bytes) of the array (if known).\n*\n* @name byteLength\n* @memberof ndarray.prototype\n* @type {(NonNegativeInteger|null)}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var byteLength = x.byteLength;\n* // returns 48\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Size (in bytes) of each array element (if known).\n*\n* @name BYTES_PER_ELEMENT\n* @memberof ndarray.prototype\n* @type {(PositiveInteger|null)}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var nbytes = x.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'BYTES_PER_ELEMENT', function get() {\n\treturn this._bytesPerElement;\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name data\n* @memberof ndarray.prototype\n* @type {(Array|TypedArray|Buffer)}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var data = x.data;\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'data', function get() {\n\treturn this._buffer;\n});\n\n/**\n* Underlying data type.\n*\n* @name dtype\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dtype = x.dtype;\n* // returns 'generic'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'dtype', function get() {\n\treturn this._dtype;\n});\n\n/**\n* Meta information, such as information concerning the memory layout of the array.\n*\n* @name flags\n* @memberof ndarray.prototype\n* @type {Object}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var flgs = x.flags;\n* // returns <Object>\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'flags', function get() {\n\treturn copyFlags( this._flags );\n});\n\n/**\n* Length of the array.\n*\n* @name length\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var len = x.length;\n* // returns 6\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Number of dimensions.\n*\n* @name ndims\n* @memberof ndarray.prototype\n* @type {PositiveInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var ndims = x.ndims;\n* // returns 2\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'ndims', function get() {\n\treturn this._ndims;\n});\n\n/**\n* Index offset which specifies the buffer index at which to start iterating over array elements.\n*\n* @name offset\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.offset;\n* // returns 0\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'offset', function get() {\n\treturn this._offset;\n});\n\n/**\n* Array order.\n*\n* ## Notes\n*\n* - The array order is either row-major (C-style) or column-major (Fortran-style).\n*\n* @name order\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var order = x.order;\n* // returns 'row-major'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'order', function get() {\n\treturn this._order;\n});\n\n/**\n* Shape of the array.\n*\n* @name shape\n* @memberof ndarray.prototype\n* @type {NonNegativeIntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.shape;\n* // returns [ 3, 2 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'shape', function get() {\n\treturn this._shape.slice();\n});\n\n/**\n* Index strides which specify how to access data along corresponding array dimensions.\n*\n* @name strides\n* @memberof ndarray.prototype\n* @type {IntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.strides;\n* // returns [ 2, 1 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'strides', function get() {\n\treturn this._strides.slice();\n});\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', getValue );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', igetValue );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', setValue );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', isetValue );\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toString\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {string} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var str = x.toString();\n* // returns \"ndarray( 'generic', [ 3, 4, 5, 6, 7, 8 ], [ 3, 2 ], [ 2, 1 ], 0, 'row-major' )\"\n*/\nsetReadOnly( ndarray.prototype, 'toString', toString );\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying an `ndarray` instance.\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toJSON\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {Object} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.toJSON();\n* // e.g., returns { 'type': 'ndarray', 'dtype': 'generic', 'flags': {...}, 'offset': 0, 'order': 'row-major', 'shape': [ 3, 2 ], 'strides': [ 2, 1 ], 'data': [ 3, 4, 5, 6, 7, 8 ] }\n*/\nsetReadOnly( ndarray.prototype, 'toJSON', toJSON );\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - Meta data format:\n*\n* ```text\n* | <endianness> (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Consumers of this method should treat the returned `DataView` as **immutable**. Otherwise, mutation can invalidate meta data and potentially affect other consumers.\n*\n* @private\n* @name __array_meta_dataview__\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {DataView} serialized meta data\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dv = x.__array_meta_dataview__();\n* // returns <DataView>\n*/\nsetReadOnly( ndarray.prototype, '__array_meta_dataview__', ( hasBigIntSupport() ) ? meta2dataview : meta2dataviewPolyfill );\n\n\n// EXPORTS //\n\nmodule.exports = ndarray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Multidimensional array constructor.\n*\n* @module @stdlib/ndarray-base-ctor\n*\n* @example\n* var ndarray = require( '@stdlib/ndarray-base-ctor' );\n*\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
- "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cA8BA,SAASC,EAAyBC,EAAOC,EAAa,CACrD,OAAOA,IAAgBD,IAAU,GAAKA,IAAU,EACjD,CAKAF,EAAO,QAAUC,ICrCjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cA8BA,SAASC,GAAsBC,EAAOC,EAAa,CAClD,OAAOA,IAAgBD,IAAU,GAAKA,IAAU,EACjD,CAKAF,EAAO,QAAUC,KCrCjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,GAAwB,QAAS,+CAAgD,EAgBrF,SAASC,GAAcC,EAAKC,EAAOC,EAASC,EAAQC,EAAiB,CACpE,IAAIC,EAGJ,OAAKL,IAAQ,GAAKI,IAAmB,EAC7B,IAGRC,EAAMP,GAAuBG,EAAOC,EAASC,CAAO,EAC3CH,IAAUK,EAAI,CAAC,EAAEA,EAAI,CAAC,EAAE,EAClC,CAKAR,EAAO,QAAUE,KCrDjB,IAAAO,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cA6BA,SAASC,GAAWC,EAAQ,CAC3B,MAAO,CACN,qBAAwBA,EAAM,qBAC9B,wBAA2BA,EAAM,wBACjC,SAAYA,EAAM,QACnB,CACD,CAKAF,EAAO,QAAUC,KCxCjB,IAAAE,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAiCA,SAASC,GAAMC,EAAM,CAEpB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAH,EAAQ,KAAK,OACRA,IAAU,EACd,OAAK,KAAK,WACF,KAAK,QAAQ,IAAK,KAAK,OAAQ,EAEhC,KAAK,QAAS,KAAK,OAAQ,EAEnC,GAAK,KAAK,OAAO,sBAAwB,KAAK,OAAO,wBAA0B,CAE9E,GAAK,KAAK,kBAAoB,EAC7B,OAAK,KAAK,WACF,KAAK,QAAQ,IAAK,KAAK,QAAQH,CAAI,EAEpC,KAAK,QAAS,KAAK,QAAQA,CAAI,EAGvC,GAAK,KAAK,kBAAoB,GAC7B,OAAK,KAAK,WACF,KAAK,QAAQ,IAAK,KAAK,OAAOA,CAAI,EAEnC,KAAK,QAAS,KAAK,QAAQA,CAAI,CAExC,CAKA,GAHAE,EAAQ,KAAK,OACbD,EAAU,KAAK,SACfG,EAAM,KAAK,QACN,KAAK,SAAW,eAAiB,CACrC,IAAME,EAAI,EAAGA,EAAIH,EAAOG,IACvBD,EAAIL,EAAME,EAAOI,CAAE,EACnBN,GAAOK,EACPL,GAAOE,EAAOI,CAAE,EAChBF,GAAOC,EAAIJ,EAASK,CAAE,EAEvB,OAAK,KAAK,WACF,KAAK,QAAQ,IAAKF,CAAI,EAEvB,KAAK,QAASA,CAAI,CAC1B,CAEA,IAAME,EAAIH,EAAM,EAAGG,GAAK,EAAGA,IAC1BD,EAAIL,EAAME,EAAOI,CAAE,EACnBN,GAAOK,EACPL,GAAOE,EAAOI,CAAE,EAChBF,GAAOC,EAAIJ,EAASK,CAAE,EAEvB,OAAK,KAAK,WACF,KAAK,QAAQ,IAAKF,CAAI,EAEvB,KAAK,QAASA,CAAI,CAC1B,CAKAN,EAAO,QAAUC,KCjGjB,IAAAQ,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAkCA,SAASC,GAAMC,EAAKC,EAAI,CAEvB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACA,EAGJ,GADAF,EAAQ,KAAK,OACRA,IAAU,EACd,OAAK,KAAK,WACT,KAAK,QAAQ,IAAKJ,EAAK,KAAK,OAAQ,EAEpC,KAAK,QAAS,KAAK,OAAQ,EAAIA,EAEzB,KAER,GAAK,KAAK,OAAO,sBAAwB,KAAK,OAAO,wBAA0B,CAE9E,GAAK,KAAK,kBAAoB,EAC7B,OAAK,KAAK,WACT,KAAK,QAAQ,IAAKC,EAAG,KAAK,QAAQD,CAAI,EAEtC,KAAK,QAAS,KAAK,QAAQA,CAAI,EAAIC,EAE7B,KAGR,GAAK,KAAK,kBAAoB,GAC7B,OAAK,KAAK,WACT,KAAK,QAAQ,IAAKA,EAAG,KAAK,QAAQD,CAAI,EAEtC,KAAK,QAAS,KAAK,QAAQA,CAAI,EAAIC,EAE7B,IAET,CAKA,GAHAE,EAAQ,KAAK,OACbD,EAAU,KAAK,SACfG,EAAM,KAAK,QACN,KAAK,SAAW,eAAiB,CACrC,IAAM,EAAI,EAAG,EAAID,EAAO,IACvBE,EAAIN,EAAMG,EAAO,CAAE,EACnBH,GAAOM,EACPN,GAAOG,EAAO,CAAE,EAChBE,GAAOC,EAAIJ,EAAS,CAAE,EAEvB,OAAK,KAAK,WACT,KAAK,QAAQ,IAAKD,EAAGI,CAAI,EAEzB,KAAK,QAASA,CAAI,EAAIJ,EAEhB,IACR,CAEA,IAAM,EAAIG,EAAM,EAAG,GAAK,EAAG,IAC1BE,EAAIN,EAAMG,EAAO,CAAE,EACnBH,GAAOM,EACPN,GAAOG,EAAO,CAAE,EAChBE,GAAOC,EAAIJ,EAAS,CAAE,EAEvB,OAAK,KAAK,WACT,KAAK,QAAQ,IAAKD,EAAGI,CAAI,EAEzB,KAAK,QAASA,CAAI,EAAIJ,EAEhB,IACR,CAKAH,EAAO,QAAUC,KC5GjB,IAAAQ,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAkCA,SAASC,IAAM,CAEd,IAAIC,EACAC,EAGJ,IADAD,EAAM,KAAK,QACLC,EAAI,EAAGA,EAAI,UAAU,OAAO,EAAGA,IACpCD,GAAO,KAAK,SAAUC,CAAE,EAAI,UAAWA,CAAE,EAE1C,OAAK,KAAK,WACT,KAAK,QAAQ,IAAK,UAAWA,CAAE,EAAGD,CAAI,EAEtC,KAAK,QAASA,CAAI,EAAI,UAAWC,CAAE,EAE7B,IACR,CAKAH,EAAO,QAAUC,KCtDjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAiCA,SAASC,IAAM,CAEd,IAAIC,EACAC,EAGJ,IADAD,EAAM,KAAK,QACLC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAClCD,GAAO,KAAK,SAAUC,CAAE,EAAI,UAAWA,CAAE,EAE1C,OAAK,KAAK,WACF,KAAK,QAAQ,IAAKD,CAAI,EAEvB,KAAK,QAASA,CAAI,CAC1B,CAKAF,EAAO,QAAUC,KCnDjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,GAAO,QAAS,8BAA+B,EAC/CC,GAAO,QAAS,8BAA+B,EAenD,SAASC,IAAS,CAEjB,IAAIC,EACAC,EACAC,EACAC,EAgBJ,IAdAF,EAAM,KAAK,QAGXD,EAAM,CAAC,EACPA,EAAI,KAAO,UACXA,EAAI,MAAQ,KAAK,MACjBA,EAAI,MAAQ,CACX,SAAY,KAAK,OAAO,QACzB,EACAA,EAAI,MAAQ,KAAK,OACjBA,EAAI,MAAQ,KAAK,OAAO,MAAM,EAC9BA,EAAI,QAAU,KAAK,SAAS,MAAM,EAG5BG,EAAI,EAAGA,EAAIH,EAAI,QAAQ,OAAQG,IAC/BH,EAAI,QAASG,CAAE,EAAI,IACvBH,EAAI,QAASG,CAAE,GAAK,IAKtB,GADAH,EAAI,KAAO,CAAC,EACPA,EAAI,QAAU,aAAeA,EAAI,QAAU,aAC/C,IAAMG,EAAI,EAAGA,EAAIF,EAAKE,IACrBD,EAAI,KAAK,KAAMC,CAAE,EACjBH,EAAI,KAAK,KAAMH,GAAMK,CAAE,EAAGJ,GAAMI,CAAE,CAAE,MAGrC,KAAMC,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAI,KAAK,KAAM,KAAK,KAAMG,CAAE,CAAE,EAGhC,OAAOH,CAGR,CAKAJ,EAAO,QAAUG,KCpFjB,IAAAK,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,GAAU,QAAS,wBAAyB,EAC5CC,EAAO,QAAS,8BAA+B,EAC/CC,EAAO,QAAS,8BAA+B,EAK/CC,GAAQ,CACX,KAAQ,gCACR,MAAS,iCACT,OAAU,wCACV,MAAS,iCACT,OAAU,kCACV,MAAS,iCACT,OAAU,kCACV,QAAW,mCACX,QAAW,mCACX,QAAW,eACX,OAAU,6BACV,UAAa,qCACb,WAAc,sCACd,KAAQ,kCACT,EAeA,SAASC,IAAW,CAEnB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,GARAL,EAAQ,KAAK,OAAO,OACpBG,EAAK,KAAK,OAGVD,EAAM,aAAcC,EAAG,MAGvBJ,EAAS,GACJ,KAAK,SAAW,IACpB,GAAKI,IAAO,aAAeA,IAAO,aACjC,IAAME,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BD,EAAI,KAAK,KAAMC,CAAE,EACjBN,GAAUJ,EAAMS,CAAE,EAAI,KAAOR,EAAMQ,CAAE,EAChCC,EAAI,KAAK,QAAQ,IACrBN,GAAU,UAIZ,KAAMM,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BN,GAAU,KAAK,KAAMM,CAAE,EAClBA,EAAI,KAAK,QAAQ,IACrBN,GAAU,UAIP,CAEN,GAAKI,IAAO,aAAeA,IAAO,aACjC,IAAME,EAAI,EAAGA,EAAI,EAAGA,IACnBD,EAAI,KAAK,KAAMC,CAAE,EACjBN,GAAUJ,EAAMS,CAAE,EAAI,KAAOR,EAAMQ,CAAE,EAChCC,EAAI,IACRN,GAAU,UAIZ,KAAMM,EAAI,EAAGA,EAAI,EAAGA,IACnBN,GAAU,KAAK,KAAMM,CAAE,EAClBA,EAAI,IACRN,GAAU,MAOb,GAHAA,GAAU,UAGLI,IAAO,aAAeA,IAAO,aACjC,IAAME,EAAI,EAAGA,GAAK,EAAGA,IACpBD,EAAI,KAAK,KAAM,KAAK,QAAQ,EAAEC,CAAE,EAChCN,GAAUJ,EAAMS,CAAE,EAAI,KAAOR,EAAMQ,CAAE,EAChCC,EAAI,IACRN,GAAU,UAIZ,KAAMM,EAAI,EAAGA,GAAK,EAAGA,IACpBN,GAAU,KAAK,KAAM,KAAK,QAAQ,EAAEM,CAAE,EACjCA,EAAI,IACRN,GAAU,KAId,CAeA,GAdAE,EAAOJ,GAAO,KAAK,KAAM,EACzBK,GAAOR,GAASO,EAAM,WAAYF,CAAO,EACzCG,GAAO,KAGFF,IAAU,EACdE,GAAO,KAEPA,GAAO,KAAO,KAAK,OAAO,KAAM,IAAK,EAAI,KAE1CA,GAAO,KAGPA,GAAO,KACFF,IAAU,EACdE,GAAO,QAEP,KAAMG,EAAI,EAAGA,EAAIL,EAAOK,IAClB,KAAK,SAAUA,CAAE,EAAI,EACzBH,GAAO,CAAC,KAAK,SAAUG,CAAE,EAEzBH,GAAO,KAAK,SAAUG,CAAE,EAEpBA,EAAIL,EAAM,IACdE,GAAO,MAIV,OAAAA,GAAO,KACPA,GAAO,KAGPA,GAAO,IACPA,GAAO,KAGPA,GAAO,IAAO,KAAK,OAAS,IAG5BA,GAAO,KACAA,CAGR,CAKAT,EAAO,QAAUK,KCpLjB,IAAAQ,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAmB,QAAS,iCAAkC,EAC9DC,GAAc,QAAS,sBAAuB,EAC9CC,GAAW,QAAS,wBAAyB,EAC7CC,EAAS,QAAS,qBAAsB,EACxCC,GAAS,QAAS,wBAAyB,EAAE,KAC7CC,GAAS,QAAS,wBAAyB,EAAE,KAC7CC,GAAQ,QAAS,6BAA8B,EAAE,KAKjDC,GAASH,GAAO,EAChBI,GAASH,GAAO,EAChBI,EAAQH,GAAM,EAyElB,SAASI,IAAgB,CAExB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAYJ,GAVAL,EAAI,KAAK,OAAS,QAClBF,EAAK,KAAK,UAAY,CAAEE,CAAE,EAC1BG,EAAI,KAAK,OACTC,EAAIN,EAAG,OAGPJ,EAAM,GAAMS,EAAE,GAAMC,EAGpBL,EAAI,KAAK,kBACJA,GAAKA,EAAE,aAAeL,EAC1B,OAAOK,EA0BR,IAvBAA,EAAI,IAAIhB,GAAU,IAAID,GAAaY,CAAI,CAAE,EAGzCE,EAAK,KAAK,OACVC,EAAK,KAAK,SACVF,EAAK,KAAK,OACVH,EAAS,KAAK,iBAGdS,EAAI,EACJF,EAAE,QAASE,EAAKpB,EAAqB,EAAI,CAAE,EAG3CoB,GAAK,EACLF,EAAE,SAAUE,EAAGb,GAAQO,CAAG,EAAGd,CAAiB,EAG9CoB,GAAK,EACLF,EAAE,YAAaE,EAAGjB,EAAQmB,CAAE,EAAGtB,CAAiB,EAGhDqB,EAAIC,EAAI,EACRF,GAAK,EACCI,EAAI,EAAGA,EAAIF,EAAGE,IACnBN,EAAE,YAAaE,EAAGjB,EAAQY,EAAGS,CAAC,CAAE,EAAGxB,CAAiB,EACpDkB,EAAE,YAAaE,EAAEC,EAAGlB,EAAQa,EAAGQ,CAAC,EAAEb,CAAO,EAAGX,CAAiB,EAC7DoB,GAAK,EAoBN,IAjBAA,GAAKC,EACLH,EAAE,YAAaE,EAAGjB,EAAQ,KAAK,QAAQQ,CAAO,EAAGX,CAAiB,EAGlEoB,GAAK,EACLF,EAAE,QAASE,EAAGZ,GAAQ,KAAK,MAAO,CAAE,EAGpCY,GAAK,EACLF,EAAE,QAASE,EAAGX,EAAOU,CAAE,CAAE,EAGzBC,GAAK,EACLF,EAAE,YAAaE,EAAGjB,EAAQoB,CAAE,EAAGvB,CAAiB,EAGhDoB,GAAK,EACCI,EAAI,EAAGA,EAAID,EAAGC,IACnBN,EAAE,QAASE,EAAGX,EAAOQ,EAAGO,CAAC,CAAE,CAAE,EAC7BJ,GAAK,EAGN,OAAAR,EAAO,EACPA,GAAU,KAAK,OAAO,SAAa,EAAI,EACvCM,EAAE,SAAUE,EAAGR,EAAMZ,CAAiB,EAGtC,KAAK,kBAAoBkB,EAElBA,CAGR,CAKAnB,EAAO,QAAUW,KC7MjB,IAAAe,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAmB,QAAS,iCAAkC,EAC9DC,GAAc,QAAS,sBAAuB,EAC9CC,GAAW,QAAS,wBAAyB,EAC7CC,GAAa,QAAS,qBAAsB,EAC5CC,GAAS,QAAS,wBAAyB,EAAE,KAC7CC,GAAS,QAAS,wBAAyB,EAAE,KAC7CC,GAAQ,QAAS,6BAA8B,EAAE,KACjDC,EAAsB,QAAS,4CAA6C,EAAE,OAK9EC,GAASJ,GAAO,EAChBK,GAASJ,GAAO,EAChBK,EAAQJ,GAAM,EAyElB,SAASK,IAAgB,CAExB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAYJ,GAVAL,EAAI,KAAK,OAAS,QAClBF,EAAK,KAAK,UAAY,CAAEE,CAAE,EAC1BG,EAAI,KAAK,OACTC,EAAIN,EAAG,OAGPJ,EAAM,GAAMS,EAAE,GAAMC,EAGpBL,EAAI,KAAK,kBACJA,GAAKA,EAAE,aAAeL,EAC1B,OAAOK,EA2BR,IAxBAA,EAAI,IAAIlB,GAAU,IAAID,GAAac,CAAI,CAAE,EACzCF,EAAQ,IAAIV,GAAYiB,EAAE,MAAO,EAGjCH,EAAK,KAAK,OACVC,EAAK,KAAK,SACVF,EAAK,KAAK,OACVJ,EAAS,KAAK,iBAGdU,EAAI,EACJF,EAAE,QAASE,EAAKtB,EAAqB,EAAI,CAAE,EAG3CsB,GAAK,EACLF,EAAE,SAAUE,EAAGd,GAAQQ,CAAG,EAAGhB,CAAiB,EAG9CsB,GAAK,EACLf,EAAqBiB,EAAGX,EAAO,EAAGS,CAAE,EAGpCC,EAAIC,EAAI,EACRF,GAAK,EACCI,EAAI,EAAGA,EAAIF,EAAGE,IACnBnB,EAAqBU,EAAGS,CAAC,EAAGb,EAAO,EAAGS,CAAE,EACxCf,EAAqBW,EAAGQ,CAAC,EAAEd,EAAQC,EAAO,EAAGS,EAAEC,CAAE,EACjDD,GAAK,EAoBN,IAjBAA,GAAKC,EACLhB,EAAqB,KAAK,QAAQK,EAAQC,EAAO,EAAGS,CAAE,EAGtDA,GAAK,EACLF,EAAE,QAASE,EAAGb,GAAQ,KAAK,MAAO,CAAE,EAGpCa,GAAK,EACLF,EAAE,QAASE,EAAGZ,EAAOW,CAAE,CAAE,EAGzBC,GAAK,EACLf,EAAqBkB,EAAGZ,EAAO,EAAGS,CAAE,EAGpCA,GAAK,EACCI,EAAI,EAAGA,EAAID,EAAGC,IACnBN,EAAE,QAASE,EAAGZ,EAAOS,EAAGO,CAAC,CAAE,CAAE,EAC7BJ,GAAK,EAGN,OAAAR,EAAO,EACPA,GAAU,KAAK,OAAO,SAAa,EAAI,EACvCM,EAAE,SAAUE,EAAGR,EAAMd,CAAiB,EAGtC,KAAK,kBAAoBoB,EAElBA,CAGR,CAKArB,EAAO,QAAUY,KChNjB,IAAAgB,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAwBA,IAAIC,GAAmB,QAAS,mCAAoC,EAChEC,EAAc,QAAS,uDAAwD,EAC/EC,EAAsB,QAAS,uDAAwD,EACvFC,GAAkB,QAAS,wCAAyC,EACpEC,GAAiB,QAAS,sCAAuC,EACjEC,GAAgB,QAAS,oCAAqC,EAC9DC,GAAU,QAAS,sBAAuB,EAC1CC,GAA0B,IAC1BC,GAAuB,IACvBC,GAAe,IACfC,GAAY,IACZC,GAAY,IACZC,GAAY,IACZC,GAAW,IACXC,GAAW,IACXC,GAAS,IACTC,GAAW,IACXC,GAAgB,IAChBC,GAAwB,IAsC5B,SAASC,EAASC,EAAOC,EAAQC,EAAOC,EAASC,EAAQC,EAAQ,CAChE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,EAAE,gBAAgBX,GACtB,OAAO,IAAIA,EAASC,EAAOC,EAAQC,EAAOC,EAASC,EAAQC,CAAM,EAIlE,IADAI,EAAM,EACAC,EAAI,EAAGA,EAAIR,EAAM,OAAQQ,IAC9BD,GAAOP,EAAOQ,CAAE,EAGjB,OAAKT,EAAO,kBACXM,EAASN,EAAO,kBAAoBQ,EAEpCF,EAAS,KAGV,KAAK,YAAcA,EACnB,KAAK,iBAAmBxB,GAAiBiB,CAAM,EAC/C,KAAK,QAAUC,EACf,KAAK,OAASD,EACd,KAAK,QAAUS,EACf,KAAK,OAASP,EAAM,OACpB,KAAK,QAAUE,EACf,KAAK,OAASC,EACd,KAAK,OAASH,EACd,KAAK,SAAWC,EAChB,KAAK,WAAajB,GAASe,EAAO,KAAOA,EAAO,GAAI,EAEpD,KAAK,gBAAkBjB,GAAgBmB,CAAQ,EAG/CG,EAAajB,GAAcoB,EAAKP,EAAOC,EAASC,EAAQ,KAAK,eAAgB,EAG7EI,EAAMvB,GAAekB,CAAQ,EAE7B,KAAK,OAAS,CACb,qBAAwBf,GAAsBoB,EAAKF,CAAW,EAC9D,wBAA2BnB,GAAyBqB,EAAKF,CAAW,EACpE,SAAY,EACb,EAGA,KAAK,kBAAoB,KAElB,IACR,CAcAzB,EAAakB,EAAS,OAAQ,SAAU,EAsBxCjB,EAAqBiB,EAAQ,UAAW,aAAc,UAAe,CACpE,OAAO,KAAK,WACb,CAAC,EAsBDjB,EAAqBiB,EAAQ,UAAW,oBAAqB,UAAe,CAC3E,OAAO,KAAK,gBACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,OAAQ,UAAe,CAC9D,OAAO,KAAK,OACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,QAAS,UAAe,CAC/D,OAAO,KAAK,MACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,QAAS,UAAe,CAC/D,OAAOT,GAAW,KAAK,MAAO,CAC/B,CAAC,EAoBDR,EAAqBiB,EAAQ,UAAW,SAAU,UAAe,CAChE,OAAO,KAAK,OACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,QAAS,UAAe,CAC/D,OAAO,KAAK,MACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,SAAU,UAAe,CAChE,OAAO,KAAK,OACb,CAAC,EAwBDjB,EAAqBiB,EAAQ,UAAW,QAAS,UAAe,CAC/D,OAAO,KAAK,MACb,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,QAAS,UAAe,CAC/D,OAAO,KAAK,OAAO,MAAM,CAC1B,CAAC,EAoBDjB,EAAqBiB,EAAQ,UAAW,UAAW,UAAe,CACjE,OAAO,KAAK,SAAS,MAAM,CAC5B,CAAC,EA0BDlB,EAAakB,EAAQ,UAAW,MAAOL,EAAS,EA0BhDb,EAAakB,EAAQ,UAAW,OAAQR,EAAU,EAmClDV,EAAakB,EAAQ,UAAW,MAAON,EAAS,EAmChDZ,EAAakB,EAAQ,UAAW,OAAQP,EAAU,EAyBlDX,EAAakB,EAAQ,UAAW,WAAYH,EAAS,EA0BrDf,EAAakB,EAAQ,UAAW,SAAUJ,EAAO,EAsCjDd,EAAakB,EAAQ,UAAW,0BAA6BnB,GAAiB,EAAMiB,GAAgBC,EAAsB,EAK1HnB,EAAO,QAAUoB,IC7jBjB,IAAIY,GAAO,IAKX,OAAO,QAAUA",
- "names": ["require_is_column_major_contiguous", "__commonJSMin", "exports", "module", "isColumnMajorContiguous", "order", "contiguous", "require_is_row_major_contiguous", "__commonJSMin", "exports", "module", "isRowMajorContiguous", "order", "contiguous", "require_is_contiguous", "__commonJSMin", "exports", "module", "minmaxViewBufferIndex", "isContiguous", "len", "shape", "strides", "offset", "iterationOrder", "buf", "require_copy_flags", "__commonJSMin", "exports", "module", "copyFlags", "flags", "require_iget", "__commonJSMin", "exports", "module", "iget", "idx", "strides", "shape", "ndims", "ind", "s", "i", "require_iset", "__commonJSMin", "exports", "module", "iset", "idx", "v", "strides", "shape", "ndims", "ind", "s", "require_set", "__commonJSMin", "exports", "module", "set", "idx", "i", "require_get", "__commonJSMin", "exports", "module", "get", "idx", "i", "require_tojson", "__commonJSMin", "exports", "module", "real", "imag", "toJSON", "out", "len", "v", "i", "require_tostring", "__commonJSMin", "exports", "module", "replace", "real", "imag", "CTORS", "toString", "buffer", "ndims", "ctor", "str", "dt", "v", "i", "require_meta2dataview", "__commonJSMin", "exports", "module", "IS_LITTLE_ENDIAN", "ArrayBuffer", "DataView", "BigInt", "dtypes", "orders", "modes", "DTYPES", "ORDERS", "MODES", "meta2dataview", "nbytes", "flgs", "len", "dt", "sh", "st", "sm", "v", "m", "o", "s", "N", "M", "i", "require_meta2dataview_polyfill", "__commonJSMin", "exports", "module", "IS_LITTLE_ENDIAN", "ArrayBuffer", "DataView", "Uint8Array", "dtypes", "orders", "modes", "float64ToInt64Bytes", "DTYPES", "ORDERS", "MODES", "meta2dataview", "nbytes", "bytes", "flgs", "len", "dt", "sh", "st", "sm", "v", "m", "o", "s", "N", "M", "i", "require_main", "__commonJSMin", "exports", "module", "hasBigIntSupport", "setReadOnly", "setReadOnlyAccessor", "bytesPerElement", "iterationOrder", "strides2order", "Boolean", "isColumnMajorContiguous", "isRowMajorContiguous", "isContiguous", "copyFlags", "igetValue", "isetValue", "setValue", "getValue", "toJSON", "toString", "meta2dataview", "meta2dataviewPolyfill", "ndarray", "dtype", "buffer", "shape", "strides", "offset", "order", "contiguous", "nbytes", "ord", "len", "i", "main"]
-}
diff --git a/docs/repl.txt b/docs/repl.txt
deleted file mode 100644
index ba02ec0..0000000
--- a/docs/repl.txt
+++ /dev/null
@@ -1,445 +0,0 @@
-
-{{alias}}( dtype, buffer, shape, strides, offset, order )
- Returns an ndarray.
-
- Parameters
- ----------
- dtype: string
- Underlying data type.
-
- buffer: ArrayLikeObject|TypedArray|Buffer
- Data buffer. A data buffer must be an array-like object (i.e., have a
- `length` property). For data buffers which are not indexed collections
- (i.e., collections which cannot support direct index access, such as
- `buffer[ index ]`; e.g., Complex64Array, Complex128Array, etc), a data
- buffer should provide `#.get( idx )` and `#.set( v[, idx] )` methods.
- Note that, for `set` methods, the value to set should be the first
- argument, followed by the linear index, similar to the native typed
- array `set` method.
-
- shape: ArrayLikeObject<integer>
- Array shape.
-
- strides: ArrayLikeObject<integer>
- Array strides.
-
- offset: integer
- Index offset.
-
- order: string
- Specifies whether an array is row-major (C-style) or column-major
- (Fortran-style).
-
- Returns
- -------
- ndarray: ndarray
- ndarray instance.
-
- Examples
- --------
- // Create a new instance...
- > var b = [ 1, 2, 3, 4 ]; // underlying data buffer
- > var d = [ 2, 2 ]; // shape
- > var s = [ 2, 1 ]; // strides
- > var o = 0; // index offset
- > var arr = {{alias}}( 'generic', b, d, s, o, 'row-major' )
- <ndarray>
-
- // Get an element using subscripts:
- > var v = arr.get( 1, 1 )
- 4
-
- // Get an element using a linear index:
- > v = arr.iget( 3 )
- 4
-
- // Set an element using subscripts:
- > arr.set( 1, 1, 40 );
- > arr.get( 1, 1 )
- 40
-
- // Set an element using a linear index:
- > arr.iset( 3, 99 );
- > arr.get( 1, 1 )
- 99
-
-
-{{alias}}.prototype.byteLength
- Size (in bytes) of the array (if known).
-
- Returns
- -------
- size: integer|null
- Size (in bytes) of the array.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var sz = arr.byteLength
- 32
-
-
-{{alias}}.prototype.BYTES_PER_ELEMENT
- Size (in bytes) of each array element (if known).
-
- Returns
- -------
- size: integer|null
- Size (in bytes) of each array element.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var sz = arr.BYTES_PER_ELEMENT
- 8
-
-
-{{alias}}.prototype.data
- Pointer to the underlying data buffer.
-
- Returns
- -------
- buf: ArrayLikeObject|TypedArray|Buffer
- Underlying data buffer.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var buf = arr.data
- <Float64Array>[ 1.0, 2.0, 3.0, 4.0 ]
-
-
-{{alias}}.prototype.dtype
- Underlying data type.
-
- Returns
- -------
- dtype: string
- Underlying data type.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var dt = arr.dtype
- 'float64'
-
-
-{{alias}}.prototype.flags
- Meta information, such as information concerning the memory layout of the
- array.
-
- Returns
- -------
- flags: Object
- Info object.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var fl = arr.flags
- {...}
-
-
-{{alias}}.prototype.length
- Length of the array (i.e., number of elements).
-
- Returns
- -------
- len: integer
- Array length.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var len = arr.length
- 4
-
-
-{{alias}}.prototype.ndims
- Number of dimensions.
-
- Returns
- -------
- ndims: integer
- Number of dimensions.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var n = arr.ndims
- 2
-
-
-{{alias}}.prototype.offset
- Index offset which specifies the buffer index at which to start iterating
- over array elements.
-
- Returns
- -------
- offset: integer
- Index offset.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var v = arr.offset
- 0
-
-
-{{alias}}.prototype.order: string
- Array order.
-
- The array order is either row-major (C-style) or column-major (Fortran-
- style).
-
- Returns
- -------
- order: string
- Array order.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var ord = arr.order
- 'row-major'
-
-
-{{alias}}.prototype.shape
- Array shape.
-
- Returns
- -------
- shape: Array
- Array shape.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var sh = arr.shape
- [ 2, 2 ]
-
-
-{{alias}}.prototype.strides
- Index strides which specify how to access data along corresponding array
- dimensions.
-
- Returns
- -------
- strides: Array
- Index strides.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var st = arr.strides
- [ 2, 1 ]
-
-
-{{alias}}.prototype.get( ...idx )
- Returns an array element specified according to provided subscripts.
-
- The number of provided subscripts should equal the number of dimensions.
-
- For zero-dimensional arrays, no indices should be provided.
-
- Parameters
- ----------
- idx: ...integer
- Subscripts.
-
- Returns
- -------
- out: any
- Array element.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var v = arr.get( 1, 1 )
- 4.0
-
-
-{{alias}}.prototype.iget( idx )
- Returns an array element located at a specified linear index.
-
- For zero-dimensional arrays, the input argument is ignored and, for clarity,
- should not be provided.
-
- Parameters
- ----------
- idx: integer
- Linear index.
-
- Returns
- -------
- out: any
- Array element.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > var v = arr.iget( 3 )
- 4.0
-
-
-{{alias}}.prototype.set( ...idx, v )
- Sets an array element specified according to provided subscripts.
-
- The number of provided subscripts should equal the number of dimensions.
-
- For zero-dimensional arrays, no indices should be provided.
-
- Parameters
- ----------
- idx: ...integer
- Subscripts.
-
- v: any
- Value to set.
-
- Returns
- -------
- out: ndarray
- ndarray instance.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > arr.set( 1, 1, -4.0 );
- > arr.get( 1, 1 )
- -4.0
-
-
-{{alias}}.prototype.iset( idx, v )
- Sets an array element located at a specified linear index.
-
- For zero-dimensional arrays, the first, and only, argument should be the
- value to set.
-
- Parameters
- ----------
- idx: integer
- Linear index.
-
- v: any
- Value to set.
-
- Returns
- -------
- out: ndarray
- ndarray instance.
-
- Examples
- --------
- > var b = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'float64', b, d, s, o, 'row-major' );
- > arr.iset( 3, -4.0 );
- > arr.iget( 3 )
- -4.0
-
-
-{{alias}}.prototype.toString()
- Serializes an ndarray as a string.
-
- This method does **not** serialize data outside of the buffer region defined
- by the array configuration.
-
- Returns
- -------
- str: string
- Serialized ndarray string.
-
- Examples
- --------
- > var b = [ 1, 2, 3, 4 ];
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'generic', b, d, s, o, 'row-major' );
- > arr.toString()
- '...'
-
-
-{{alias}}.prototype.toJSON()
- Serializes an ndarray as a JSON object.
-
- This method does **not** serialize data outside of the buffer region defined
- by the array configuration.
-
- Returns
- -------
- obj: Object
- JSON object.
-
- Examples
- --------
- > var b = [ 1, 2, 3, 4 ];
- > var d = [ 2, 2 ];
- > var s = [ 2, 1 ];
- > var o = 0;
- > var arr = {{alias}}( 'generic', b, d, s, o, 'row-major' );
- > arr.toJSON()
- {...}
-
- See Also
- --------
-
diff --git a/docs/types/test.ts b/docs/types/test.ts
deleted file mode 100644
index 1f2b6f4..0000000
--- a/docs/types/test.ts
+++ /dev/null
@@ -1,141 +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.
-*/
-
-/* eslint-disable @typescript-eslint/no-unused-expressions */
-
-import ndarray = require( './index' );
-
-
-// TESTS //
-
-// The function returns an ndarray...
-{
- ndarray( 'float64', [ 1, 2, 3, 4 ], [ 2, 2 ], [ 2, 1 ], 0, 'row-major' ); // $ExpectType ndarray
- new ndarray( 'float64', [ 1, 2, 3, 4 ], [ 2, 2 ], [ 2, 1 ], 0, 'row-major' ); // $ExpectType ndarray
-
- const buffer = new Int32Array( [ 1, 2, 3 ] );
- ndarray( 'int32', buffer, [ 2, 2 ], [ 2, 1 ], 0, 'column-major' ); // $ExpectType ndarray
- new ndarray( 'int32', buffer, [ 2, 2 ], [ 2, 1 ], 0, 'column-major' ); // $ExpectType ndarray
-}
-
-// The compiler throws an error if the function is provided a first argument which is not a recognized data type...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const shape = [ 2, 2 ];
- const strides = [ 2, 1 ];
- const offset = 0;
- const order = 'row-major';
-
- ndarray( 'abc', buffer, shape, strides, offset, order ); // $ExpectError
- ndarray( 123, buffer, shape, strides, offset, order ); // $ExpectError
- ndarray( true, buffer, shape, strides, offset, order ); // $ExpectError
- ndarray( false, buffer, shape, strides, offset, order ); // $ExpectError
- ndarray( null, buffer, shape, strides, offset, order ); // $ExpectError
- ndarray( undefined, buffer, shape, strides, offset, order ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a second argument which is not an array-like object or buffer...
-{
- const shape = [ 2, 2 ];
- const strides = [ 2, 1 ];
- const offset = 0;
- const order = 'row-major';
- ndarray( 'float64', 123, shape, strides, offset, order ); // $ExpectError
- ndarray( 'float64', true, shape, strides, offset, order ); // $ExpectError
- ndarray( 'float64', false, shape, strides, offset, order ); // $ExpectError
- ndarray( 'float64', null, shape, strides, offset, order ); // $ExpectError
- ndarray( 'float64', undefined, shape, strides, offset, order ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a third argument which is not an array-like object containing numbers...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const strides = [ 2, 1 ];
- const offset = 0;
- const order = 'row-major';
- ndarray( 'float64', buffer, true, strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, false, strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, null, strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, undefined, strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, '5', strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, [ '1', '2' ], strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, {}, strides, offset, order ); // $ExpectError
- ndarray( 'float64', buffer, ( x: number ): number => x, strides, offset, order ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a fourth argument which is not an array-like object containing numbers...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const shape = [ 2, 2 ];
- const offset = 0;
- const order = 'row-major';
- ndarray( 'float32', buffer, shape, true, offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, false, offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, null, offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, undefined, offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, '5', offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, [ '1', '2' ], offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, {}, offset, order ); // $ExpectError
- ndarray( 'float32', buffer, shape, ( x: number ): number => x, offset, order ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a fifth argument which is not a number...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const shape = [ 2, 2 ];
- const strides = [ 2, 1 ];
- const order = 'row-major';
- ndarray( 'int32', buffer, shape, strides, true, order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, false, order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, null, order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, undefined, order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, '5', order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, [ '1', '2' ], order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, {}, order ); // $ExpectError
- ndarray( 'int32', buffer, shape, strides, ( x: number ): number => x, order ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a sixth argument which is not a known array order...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const shape = [ 2, 2 ];
- const strides = [ 2, 1 ];
- const offset = 0;
- ndarray( 'int8', buffer, shape, strides, offset, true ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, false ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, null ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, undefined ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, '5' ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, [ '1', '2' ] ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, {} ); // $ExpectError
- ndarray( 'int8', buffer, shape, strides, offset, ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided insufficient arguments...
-{
- const buffer = [ 1, 2, 3, 4 ];
- const shape = [ 2, 2 ];
- const strides = [ 2, 1 ];
- const offset = 0;
- ndarray(); // $ExpectError
- ndarray( 'uint32' ); // $ExpectError
- ndarray( 'int8', buffer ); // $ExpectError
- ndarray( 'uint8c', buffer, shape ); // $ExpectError
- ndarray( 'uint8', buffer, shape, strides ); // $ExpectError
- ndarray( 'uint16', buffer, shape, strides, offset ); // $ExpectError
-}
diff --git a/examples/index.js b/examples/index.js
deleted file mode 100644
index afbf4fd..0000000
--- a/examples/index.js
+++ /dev/null
@@ -1,61 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 Float32Array = require( '@stdlib/array-float32' );
-var ndarray = require( './../lib' );
-
-// Create a data buffer:
-var buffer = new Float32Array( (3*3*3*3) + 100 );
-
-// Specify the array shape:
-var shape = [ 3, 3, 3, 3 ];
-
-// Specify the array strides:
-var strides = [ 27, 9, 3, 1 ];
-
-// Specify the index offset:
-var offset = 4;
-
-// Specify the order:
-var order = 'row-major'; // C-style
-
-// Create a new ndarray:
-var arr = ndarray( 'float32', buffer, shape, strides, offset, order );
-
-// Retrieve an array value:
-var v = arr.get( 1, 2, 1, 2 );
-console.log( v );
-// => 0.0
-
-// Set an array value:
-arr.set( 1, 2, 1, 2, 10.0 );
-
-// Retrieve the array value:
-v = arr.get( 1, 2, 1, 2 );
-console.log( v );
-// => 10.0
-
-// Serialize the array as a string:
-console.log( arr.toString() );
-// => "ndarray( 'float32', new Float32Array( [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] ), [ 3, 3, 3, 3 ], [ 27, 9, 3, 1 ], 0, 'row-major' )"
-
-// Serialize the array as JSON:
-console.log( JSON.stringify( arr.toJSON() ) );
-// e.g., => '{"type":"ndarray","dtype":"float32","flags":{"READONLY":false},"order":"row-major","shape":[3,3,3,3],"strides":[27,9,3,1],"data":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]}'
diff --git a/docs/types/index.d.ts b/index.d.ts
similarity index 97%
rename from docs/types/index.d.ts
rename to index.d.ts
index 02934fb..ea30ce8 100644
--- a/docs/types/index.d.ts
+++ b/index.d.ts
@@ -18,7 +18,7 @@
// TypeScript Version: 4.1
-/// <reference types="@stdlib/types"/>
+/// <reference types="https://cdn.jsdelivr.net/gh/stdlib-js/types@esm/index.d.ts"/>
import { ArrayLike } from '@stdlib/types/array';
import { ndarray, DataType, Order, Shape, Strides } from '@stdlib/types/ndarray';
diff --git a/index.mjs b/index.mjs
new file mode 100644
index 0000000..f739b30
--- /dev/null
+++ b/index.mjs
@@ -0,0 +1,4 @@
+// Copyright (c) 2025 The Stdlib Authors. License is Apache-2.0: http://www.apache.org/licenses/LICENSE-2.0
+/// <reference types="./index.d.ts" />
+import t from"https://cdn.jsdelivr.net/gh/stdlib-js/assert-has-bigint-support@v0.2.2-esm/index.mjs";import s from"https://cdn.jsdelivr.net/gh/stdlib-js/utils-define-nonenumerable-read-only-property@v0.2.1-esm/index.mjs";import e from"https://cdn.jsdelivr.net/gh/stdlib-js/utils-define-nonenumerable-read-only-accessor@v0.2.2-esm/index.mjs";import i from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-bytes-per-element@v0.2.2-esm/index.mjs";import r from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-iteration-order@v0.2.2-esm/index.mjs";import n from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-strides2order@v0.2.2-esm/index.mjs";import h from"https://cdn.jsdelivr.net/gh/stdlib-js/boolean-ctor@v0.2.2-esm/index.mjs";import o from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-minmax-view-buffer-index@v0.2.2-esm/index.mjs";import f from"https://cdn.jsdelivr.net/gh/stdlib-js/complex-float64-real@v0.1.1-esm/index.mjs";import a from"https://cdn.jsdelivr.net/gh/stdlib-js/complex-float64-imag@v0.1.1-esm/index.mjs";import _ from"https://cdn.jsdelivr.net/gh/stdlib-js/string-replace@v0.2.2-esm/index.mjs";import d from"https://cdn.jsdelivr.net/gh/stdlib-js/assert-is-little-endian@v0.2.2-esm/index.mjs";import m from"https://cdn.jsdelivr.net/gh/stdlib-js/array-buffer@v0.2.2-esm/index.mjs";import l from"https://cdn.jsdelivr.net/gh/stdlib-js/array-dataview@v0.2.2-esm/index.mjs";import p from"https://cdn.jsdelivr.net/gh/stdlib-js/bigint-ctor@v0.2.2-esm/index.mjs";import{enum as u}from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-dtypes@v0.3.0-esm/index.mjs";import{enum as c}from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-orders@v0.2.2-esm/index.mjs";import{enum as g}from"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-index-modes@v0.2.2-esm/index.mjs";import b from"https://cdn.jsdelivr.net/gh/stdlib-js/array-uint8@v0.2.2-esm/index.mjs";import{assign as y}from"https://cdn.jsdelivr.net/gh/stdlib-js/number-float64-base-to-int64-bytes@v0.2.2-esm/index.mjs";function j(t,s){return s&&(2===t||3===t)}function v(t,s){return s&&(1===t||3===t)}var O={int8:"new Int8Array( [ {{data}} ] )",uint8:"new Uint8Array( [ {{data}} ] )",uint8c:"new Uint8ClampedArray( [ {{data}} ] )",int16:"new Int16Array( [ {{data}} ] )",uint16:"new Uint16Array( [ {{data}} ] )",int32:"new Int32Array( [ {{data}} ] )",uint32:"new Uint32Array( [ {{data}} ] )",float32:"new Float32Array( [ {{data}} ] )",float64:"new Float64Array( [ {{data}} ] )",generic:"[ {{data}} ]",binary:"new Buffer( [ {{data}} ] )",complex64:"new Complex64Array( [ {{data}} ] )",complex128:"new Complex128Array( [ {{data}} ] )",bool:"new BooleanArray( [ {{data}} ] )"};var x=u(),I=c(),w=g();var A=u(),U=c(),E=g();function N(t,s,e,f,a,_){var d,m,l,p,u;if(!(this instanceof N))return new N(t,s,e,f,a,_);for(p=1,u=0;u<e.length;u++)p*=e[u];return m=s.BYTES_PER_ELEMENT?s.BYTES_PER_ELEMENT*p:null,this._byteLength=m,this._bytesPerElement=i(t),this._buffer=s,this._dtype=t,this._length=p,this._ndims=e.length,this._offset=a,this._order=_,this._shape=e,this._strides=f,this._accessors=h(s.get&&s.set),this._iterationOrder=r(f),d=function(t,s,e,i,r){var n;return 0!==t&&0!==r&&t===(n=o(s,e,i))[1]-n[0]+1}(p,e,f,a,this._iterationOrder),l=n(f),this._flags={ROW_MAJOR_CONTIGUOUS:v(l,d),COLUMN_MAJOR_CONTIGUOUS:j(l,d),READONLY:!1},this.__meta_dataview__=null,this}s(N,"name","ndarray"),e(N.prototype,"byteLength",(function(){return this._byteLength})),e(N.prototype,"BYTES_PER_ELEMENT",(function(){return this._bytesPerElement})),e(N.prototype,"data",(function(){return this._buffer})),e(N.prototype,"dtype",(function(){return this._dtype})),e(N.prototype,"flags",(function(){return{ROW_MAJOR_CONTIGUOUS:(t=this._flags).ROW_MAJOR_CONTIGUOUS,COLUMN_MAJOR_CONTIGUOUS:t.COLUMN_MAJOR_CONTIGUOUS,READONLY:t.READONLY};var t})),e(N.prototype,"length",(function(){return this._length})),e(N.prototype,"ndims",(function(){return this._ndims})),e(N.prototype,"offset",(function(){return this._offset})),e(N.prototype,"order",(function(){return this._order})),e(N.prototype,"shape",(function(){return this._shape.slice()})),e(N.prototype,"strides",(function(){return this._strides.slice()})),s(N.prototype,"get",(function(){var t,s;for(t=this._offset,s=0;s<arguments.length;s++)t+=this._strides[s]*arguments[s];return this._accessors?this._buffer.get(t):this._buffer[t]})),s(N.prototype,"iget",(function(t){var s,e,i,r,n,h;if(0===(i=this._ndims))return this._accessors?this._buffer.get(this._offset):this._buffer[this._offset];if(this._flags.ROW_MAJOR_CONTIGUOUS||this._flags.COLUMN_MAJOR_CONTIGUOUS){if(1===this._iterationOrder)return this._accessors?this._buffer.get(this._offset+t):this._buffer[this._offset+t];if(-1===this._iterationOrder)return this._accessors?this._buffer.get(this.offset-t):this._buffer[this._offset-t]}if(e=this._shape,s=this._strides,r=this._offset,"column-major"===this._order){for(h=0;h<i;h++)t-=n=t%e[h],t/=e[h],r+=n*s[h];return this._accessors?this._buffer.get(r):this._buffer[r]}for(h=i-1;h>=0;h--)t-=n=t%e[h],t/=e[h],r+=n*s[h];return this._accessors?this._buffer.get(r):this._buffer[r]})),s(N.prototype,"set",(function(){var t,s;for(t=this._offset,s=0;s<arguments.length-1;s++)t+=this._strides[s]*arguments[s];return this._accessors?this._buffer.set(arguments[s],t):this._buffer[t]=arguments[s],this})),s(N.prototype,"iset",(function(t,s){var e,i,r,n,h,o;if(0===(r=this._ndims))return this._accessors?this._buffer.set(t,this._offset):this._buffer[this._offset]=t,this;if(this._flags.ROW_MAJOR_CONTIGUOUS||this._flags.COLUMN_MAJOR_CONTIGUOUS){if(1===this._iterationOrder)return this._accessors?this._buffer.set(s,this._offset+t):this._buffer[this._offset+t]=s,this;if(-1===this._iterationOrder)return this._accessors?this._buffer.set(s,this._offset-t):this._buffer[this._offset-t]=s,this}if(i=this._shape,e=this._strides,n=this._offset,"column-major"===this._order){for(o=0;o<r;o++)t-=h=t%i[o],t/=i[o],n+=h*e[o];return this._accessors?this._buffer.set(s,n):this._buffer[n]=s,this}for(o=r-1;o>=0;o--)t-=h=t%i[o],t/=i[o],n+=h*e[o];return this._accessors?this._buffer.set(s,n):this._buffer[n]=s,this})),s(N.prototype,"toString",(function(){var t,s,e,i,r,n,h;if(s=this._shape.length,i="ndarray( '"+(r=this._dtype)+"', ",t="",this._length<=100)if("complex64"===r||"complex128"===r)for(h=0;h<this._length;h++)n=this.iget(h),t+=f(n)+", "+a(n),h<this._length-1&&(t+=", ");else for(h=0;h<this._length;h++)t+=this.iget(h),h<this._length-1&&(t+=", ");else{if("complex64"===r||"complex128"===r)for(h=0;h<3;h++)n=this.iget(h),t+=f(n)+", "+a(n),h<2&&(t+=", ");else for(h=0;h<3;h++)t+=this.iget(h),h<2&&(t+=", ");if(t+=", ..., ","complex64"===r||"complex128"===r)for(h=2;h>=0;h--)n=this.iget(this._length-1-h),t+=f(n)+", "+a(n),h>0&&(t+=", ");else for(h=2;h>=0;h--)t+=this.iget(this._length-1-h),h>0&&(t+=", ")}if(e=O[this.dtype],i+=_(e,"{{data}}",t),i+=", ",i+=0===s?"[]":"[ "+this._shape.join(", ")+" ]",i+=", ",i+="[ ",0===s)i+="0";else for(h=0;h<s;h++)this._strides[h]<0?i+=-this._strides[h]:i+=this._strides[h],h<s-1&&(i+=", ");return i+=" ]",i+=", ",i+="0",i+=", ",i+="'"+this._order+"'",i+=" )"})),s(N.prototype,"toJSON",(function(){var t,s,e,i;for(s=this._length,(t={}).type="ndarray",t.dtype=this.dtype,t.flags={READONLY:this._flags.READONLY},t.order=this._order,t.shape=this._shape.slice(),t.strides=this._strides.slice(),i=0;i<t.strides.length;i++)t.strides[i]<0&&(t.strides[i]*=-1);if(t.data=[],"complex64"===t.dtype||"complex128"===t.dtype)for(i=0;i<s;i++)e=this.iget(i),t.data.push(f(e),a(e));else for(i=0;i<s;i++)t.data.push(this.iget(i));return t})),s(N.prototype,"__array_meta_dataview__",t()?function(){var t,s,e,i,r,n,h,o,f,a,_,u,c,g;if(f=this._mode||"throw",h=this._submode||[f],e=33+16*(u=this._ndims)+(c=h.length),(o=this.__meta_dataview__)&&o.byteLength===e)return o;for(o=new l(new m(e)),r=this._shape,n=this._strides,i=this._dtype,t=this._bytesPerElement,a=0,o.setInt8(a,d?1:0),a+=1,o.setInt16(a,x[i],d),a+=2,o.setBigInt64(a,p(u),d),_=8*u,a+=8,g=0;g<u;g++)o.setBigInt64(a,p(r[g]),d),o.setBigInt64(a+_,p(n[g]*t),d),a+=8;for(a+=_,o.setBigInt64(a,p(this._offset*t),d),a+=8,o.setInt8(a,I[this._order]),a+=1,o.setInt8(a,w[f]),a+=1,o.setBigInt64(a,p(c),d),a+=8,g=0;g<c;g++)o.setInt8(a,w[h[g]]),a+=1;return s=0,s|=this._flags.READONLY?4:0,o.setInt32(a,s,d),this.__meta_dataview__=o,o}:function(){var t,s,e,i,r,n,h,o,f,a,_,p,u,c,g;if(a=this._mode||"throw",o=this._submode||[a],i=33+16*(u=this._ndims)+(c=o.length),(f=this.__meta_dataview__)&&f.byteLength===i)return f;for(f=new l(new m(i)),s=new b(f.buffer),n=this._shape,h=this._strides,r=this._dtype,t=this._bytesPerElement,_=0,f.setInt8(_,d?1:0),_+=1,f.setInt16(_,A[r],d),y(u,s,1,_+=2),p=8*u,_+=8,g=0;g<u;g++)y(n[g],s,1,_),y(h[g]*t,s,1,_+p),_+=8;for(_+=p,y(this._offset*t,s,1,_),_+=8,f.setInt8(_,U[this._order]),_+=1,f.setInt8(_,E[a]),y(c,s,1,_+=1),_+=8,g=0;g<c;g++)f.setInt8(_,E[o[g]]),_+=1;return e=0,e|=this._flags.READONLY?4:0,f.setInt32(_,e,d),this.__meta_dataview__=f,f});export{N as default};
+//# sourceMappingURL=index.mjs.map
diff --git a/index.mjs.map b/index.mjs.map
new file mode 100644
index 0000000..ba9f7ed
--- /dev/null
+++ b/index.mjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","sources":["../lib/is_column_major_contiguous.js","../lib/is_row_major_contiguous.js","../lib/tostring.js","../lib/meta2dataview.js","../lib/meta2dataview.polyfill.js","../lib/main.js","../lib/is_contiguous.js","../lib/copy_flags.js","../lib/get.js","../lib/iget.js","../lib/set.js","../lib/iset.js","../lib/tojson.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Determines if an array is column-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is column-major contiguous\n*/\nfunction isColumnMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 2 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isColumnMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Determines if an array is row-major contiguous.\n*\n* @private\n* @param {integer} order - **inferred** array order\n* @param {boolean} contiguous - boolean indicating is an array is contiguous\n* @returns {boolean} boolean indicating if an array is row-major contiguous\n*/\nfunction isRowMajorContiguous( order, contiguous ) {\n\treturn contiguous && ( order === 1 || order === 3 );\n}\n\n\n// EXPORTS //\n\nexport default isRowMajorContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport replace from '@stdlib/string-replace';\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// VARIABLES //\n\nvar CTORS = {\n\t'int8': 'new Int8Array( [ {{data}} ] )',\n\t'uint8': 'new Uint8Array( [ {{data}} ] )',\n\t'uint8c': 'new Uint8ClampedArray( [ {{data}} ] )',\n\t'int16': 'new Int16Array( [ {{data}} ] )',\n\t'uint16': 'new Uint16Array( [ {{data}} ] )',\n\t'int32': 'new Int32Array( [ {{data}} ] )',\n\t'uint32': 'new Uint32Array( [ {{data}} ] )',\n\t'float32': 'new Float32Array( [ {{data}} ] )',\n\t'float64': 'new Float64Array( [ {{data}} ] )',\n\t'generic': '[ {{data}} ]',\n\t'binary': 'new Buffer( [ {{data}} ] )',\n\t'complex64': 'new Complex64Array( [ {{data}} ] )',\n\t'complex128': 'new Complex128Array( [ {{data}} ] )',\n\t'bool': 'new BooleanArray( [ {{data}} ] )'\n};\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {string} string representation\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar buffer;\n\tvar ndims;\n\tvar ctor;\n\tvar str;\n\tvar dt;\n\tvar v;\n\tvar i;\n\n\tndims = this._shape.length;\n\tdt = this._dtype;\n\n\t// Function to invoke to create an ndarray:\n\tstr = 'ndarray( \\''+dt+'\\', ';\n\n\t// Data buffer parameter...\n\tbuffer = '';\n\tif ( this._length <= 100 ) {\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < this._length; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < this._length-1 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// First three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tv = this.iget( i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < 3; i++ ) {\n\t\t\t\tbuffer += this.iget( i );\n\t\t\t\tif ( i < 2 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuffer += ', ..., ';\n\n\t\t// Last three values...\n\t\tif ( dt === 'complex64' || dt === 'complex128' ) {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tv = this.iget( this._length-1-i );\n\t\t\t\tbuffer += real( v ) + ', ' + imag( v );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 2; i >= 0; i-- ) {\n\t\t\t\tbuffer += this.iget( this._length-1-i );\n\t\t\t\tif ( i > 0 ) {\n\t\t\t\t\tbuffer += ', ';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tctor = CTORS[ this.dtype ];\n\tstr += replace( ctor, '{{data}}', buffer );\n\tstr += ', ';\n\n\t// Array shape...\n\tif ( ndims === 0 ) {\n\t\tstr += '[]';\n\t} else {\n\t\tstr += '[ ' + this._shape.join( ', ' ) + ' ]';\n\t}\n\tstr += ', ';\n\n\t// Stride array...\n\tstr += '[ ';\n\tif ( ndims === 0 ) {\n\t\tstr += '0';\n\t} else {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( this._strides[ i ] < 0 ) {\n\t\t\t\tstr += -this._strides[ i ];\n\t\t\t} else {\n\t\t\t\tstr += this._strides[ i ];\n\t\t\t}\n\t\t\tif ( i < ndims-1 ) {\n\t\t\t\tstr += ', ';\n\t\t\t}\n\t\t}\n\t}\n\tstr += ' ]';\n\tstr += ', ';\n\n\t// Buffer offset:\n\tstr += '0';\n\tstr += ', ';\n\n\t// Order:\n\tstr += '\\'' + this._order + '\\'';\n\n\t// Close the function call:\n\tstr += ' )';\n\treturn str;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport BigInt from '@stdlib/bigint-ctor';\nimport { enum as dtypes } from '@stdlib/ndarray-dtypes';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* <endianness>[int8],\n* <dtype>[int16],\n* <ndims>[int64],\n* <shape>[ndims*int64],\n* <strides>[ndims*int64],\n* <offset>[int64],\n* <order>[int8],\n* <mode>[int8],\n* <nsubmodes>[int64],\n* <submodes>[nsubmodes*int8],\n* <flags>[int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create a view for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tv.setBigInt64( o, BigInt( N ), IS_LITTLE_ENDIAN );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv.setBigInt64( o, BigInt( sh[i] ), IS_LITTLE_ENDIAN );\n\t\tv.setBigInt64( o+s, BigInt( st[i]*nbytes ), IS_LITTLE_ENDIAN );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tv.setBigInt64( o, BigInt( this._offset*nbytes ), IS_LITTLE_ENDIAN );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tv.setBigInt64( o, BigInt( M ), IS_LITTLE_ENDIAN );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport IS_LITTLE_ENDIAN from '@stdlib/assert-is-little-endian';\nimport ArrayBuffer from '@stdlib/array-buffer';\nimport DataView from '@stdlib/array-dataview';\nimport Uint8Array from '@stdlib/array-uint8';\nimport { enum as dtypes } from '@stdlib/ndarray-dtypes';\nimport { enum as orders } from '@stdlib/ndarray-orders';\nimport { enum as modes } from '@stdlib/ndarray-index-modes';\nimport { assign as float64ToInt64Bytes } from '@stdlib/number-float64-base-to-int64-bytes';\n\n\n// VARIABLES //\n\nvar DTYPES = dtypes();\nvar ORDERS = orders();\nvar MODES = modes();\n\n\n// FUNCTIONS //\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - This function takes into account ndarray-like objects which may support index modes.\n*\n* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Meta data format:\n*\n* ```text\n* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* which translates to the following `ArrayBuffer` layout:\n*\n* ```text\n* ArrayBuffer[\n* <endianness>[int8],\n* <dtype>[int16],\n* <ndims>[int64],\n* <shape>[ndims*int64],\n* <strides>[ndims*int64],\n* <offset>[int64],\n* <order>[int8],\n* <mode>[int8],\n* <nsubmodes>[int64],\n* <submodes>[nsubmodes*int8],\n* <flags>[int32]\n* ]\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Buffer length:\n*\n* ```text\n* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes\n* ```\n*\n* For example, consider a three-dimensional ndarray with one subscript index mode (submode):\n*\n* ```text\n* 33 + (3*16) + 1 = 82 bytes\n* ```\n*\n* - Views:\n*\n* - endianness: `Int8Array( buf, 0, 1 )`\n* - dtype: `Int16Array( buf, 1, 1 )`\n* - ndims: `Int64Array( buf, 3, 1 )`\n* - shape: `Int64Array( buf, 11, ndims )`\n* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`\n* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`\n* - order: `Int8Array( buf, 19+(ndims*16), 1 )`\n* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`\n* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`\n* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`\n* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`\n*\n* @private\n* @returns {DataView} serialized meta data\n*/\nfunction meta2dataview() {\n\t/* eslint-disable no-invalid-this */\n\tvar nbytes;\n\tvar bytes;\n\tvar flgs;\n\tvar len;\n\tvar dt;\n\tvar sh;\n\tvar st;\n\tvar sm;\n\tvar v;\n\tvar m;\n\tvar o;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar i;\n\n\tm = this._mode || 'throw';\n\tsm = this._submode || [ m ];\n\tN = this._ndims;\n\tM = sm.length;\n\n\t// Compute the amount of memory we need to allocate for storing meta data:\n\tlen = 33 + (N*16) + M;\n\n\t// Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...\n\tv = this.__meta_dataview__;\n\tif ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be \"stale\" (e.g., shape and/or strides may have changed)\n\t\treturn v;\n\t}\n\t// Allocate raw memory and create views for interfacing with the allocated memory:\n\tv = new DataView( new ArrayBuffer( len ) );\n\tbytes = new Uint8Array( v.buffer );\n\n\t// Retrieve ndarray meta data:\n\tsh = this._shape;\n\tst = this._strides;\n\tdt = this._dtype;\n\tnbytes = this._bytesPerElement;\n\n\t// Endianness: (byteoffset: 0; bytelength: 1)\n\to = 0;\n\tv.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );\n\n\t// Data type: (byteoffset: 1; bytelength: 2)\n\to += 1;\n\tv.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );\n\n\t// Number of dimensions: (byteoffset: 3; bytelength: 8)\n\to += 2;\n\tfloat64ToInt64Bytes( N, bytes, 1, o );\n\n\t// Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)\n\ts = N * 8; // stride length between a dimension (shape[i]) and its associated stride\n\to += 8;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tfloat64ToInt64Bytes( sh[i], bytes, 1, o );\n\t\tfloat64ToInt64Bytes( st[i]*nbytes, bytes, 1, o+s );\n\t\to += 8;\n\t}\n\t// Offset: (byteoffset: 11+(ndims*16); bytelength: 8)\n\to += s;\n\tfloat64ToInt64Bytes( this._offset*nbytes, bytes, 1, o );\n\n\t// Order: (byteoffset: 19+(ndims*16); bytelength: 1)\n\to += 8;\n\tv.setInt8( o, ORDERS[ this._order ] );\n\n\t// Mode: (byteoffset: 20+(ndims*16); bytelength: 1)\n\to += 1;\n\tv.setInt8( o, MODES[ m ] );\n\n\t// Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)\n\to += 1;\n\tfloat64ToInt64Bytes( M, bytes, 1, o );\n\n\t// Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)\n\to += 8;\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv.setInt8( o, MODES[ sm[i] ] );\n\t\to += 1;\n\t}\n\t// Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)\n\tflgs = 0|0;\n\tflgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100\n\tv.setInt32( o, flgs, IS_LITTLE_ENDIAN );\n\n\t// Cache the serialized meta data:\n\tthis.__meta_dataview__ = v;\n\n\treturn v;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default meta2dataview;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nimport hasBigIntSupport from '@stdlib/assert-has-bigint-support';\nimport setReadOnly from '@stdlib/utils-define-nonenumerable-read-only-property';\nimport setReadOnlyAccessor from '@stdlib/utils-define-nonenumerable-read-only-accessor';\nimport bytesPerElement from '@stdlib/ndarray-base-bytes-per-element';\nimport iterationOrder from '@stdlib/ndarray-base-iteration-order';\nimport strides2order from '@stdlib/ndarray-base-strides2order';\nimport Boolean from '@stdlib/boolean-ctor';\nimport isColumnMajorContiguous from './is_column_major_contiguous.js';\nimport isRowMajorContiguous from './is_row_major_contiguous.js';\nimport isContiguous from './is_contiguous.js';\nimport copyFlags from './copy_flags.js';\nimport igetValue from './iget.js';\nimport isetValue from './iset.js';\nimport setValue from './set.js';\nimport getValue from './get.js';\nimport toJSON from './tojson.js';\nimport toString from './tostring.js'; // eslint-disable-line stdlib/no-redeclare\nimport meta2dataview from './meta2dataview.js';\nimport meta2dataviewPolyfill from './meta2dataview.polyfill.js';\n\n\n// MAIN //\n\n/**\n* ndarray constructor.\n*\n* ## Notes\n*\n* - To create a zero-dimensional array,\n*\n* ```javascript\n* var buffer = [ 1 ];\n* var shape = [];\n* var strides = [ 0 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n* ```\n*\n* @constructor\n* @param {string} dtype - data type\n* @param {(ArrayLikeObject|TypedArray|Buffer)} buffer - data buffer\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - array strides\n* @param {NonNegativeInteger} offset - index offset\n* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*/\nfunction ndarray( dtype, buffer, shape, strides, offset, order ) {\n\tvar contiguous;\n\tvar nbytes;\n\tvar ord;\n\tvar len;\n\tvar i;\n\tif ( !(this instanceof ndarray) ) {\n\t\treturn new ndarray( dtype, buffer, shape, strides, offset, order );\n\t}\n\t// Compute the number of elements...\n\tlen = 1;\n\tfor ( i = 0; i < shape.length; i++ ) {\n\t\tlen *= shape[ i ];\n\t}\n\t// Compute the number of bytes...\n\tif ( buffer.BYTES_PER_ELEMENT ) {\n\t\tnbytes = buffer.BYTES_PER_ELEMENT * len;\n\t} else {\n\t\tnbytes = null;\n\t}\n\t// Set private properties...\n\tthis._byteLength = nbytes;\n\tthis._bytesPerElement = bytesPerElement( dtype );\n\tthis._buffer = buffer;\n\tthis._dtype = dtype;\n\tthis._length = len;\n\tthis._ndims = shape.length;\n\tthis._offset = offset;\n\tthis._order = order;\n\tthis._shape = shape;\n\tthis._strides = strides;\n\tthis._accessors = Boolean( buffer.get && buffer.set );\n\n\tthis._iterationOrder = iterationOrder( strides );\n\n\t// Determine if the array can be stored contiguously:\n\tcontiguous = isContiguous( len, shape, strides, offset, this._iterationOrder ); // eslint-disable-line max-len\n\n\t// Infer the array \"order\" from the stride array (this is supplementary to the `order` parameter):\n\tord = strides2order( strides );\n\n\tthis._flags = {\n\t\t'ROW_MAJOR_CONTIGUOUS': isRowMajorContiguous( ord, contiguous ),\n\t\t'COLUMN_MAJOR_CONTIGUOUS': isColumnMajorContiguous( ord, contiguous ),\n\t\t'READONLY': false\n\t};\n\n\t// Initialize a property for caching serialized meta data:\n\tthis.__meta_dataview__ = null;\n\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof ndarray\n* @type {string}\n* @default 'ndarray'\n*\n* @example\n* var str = ndarray.name;\n* // returns 'ndarray'\n*/\nsetReadOnly( ndarray, 'name', 'ndarray' );\n\n/**\n* Size (in bytes) of the array (if known).\n*\n* @name byteLength\n* @memberof ndarray.prototype\n* @type {(NonNegativeInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var byteLength = x.byteLength;\n* // returns 48\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'byteLength', function get() {\n\treturn this._byteLength;\n});\n\n/**\n* Size (in bytes) of each array element (if known).\n*\n* @name BYTES_PER_ELEMENT\n* @memberof ndarray.prototype\n* @type {(PositiveInteger|null)}\n*\n* @example\n* import Float64Array from '@stdlib/array-float64';\n*\n* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );\n*\n* var nbytes = x.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'BYTES_PER_ELEMENT', function get() {\n\treturn this._bytesPerElement;\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name data\n* @memberof ndarray.prototype\n* @type {(Array|TypedArray|Buffer)}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var data = x.data;\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'data', function get() {\n\treturn this._buffer;\n});\n\n/**\n* Underlying data type.\n*\n* @name dtype\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dtype = x.dtype;\n* // returns 'generic'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'dtype', function get() {\n\treturn this._dtype;\n});\n\n/**\n* Meta information, such as information concerning the memory layout of the array.\n*\n* @name flags\n* @memberof ndarray.prototype\n* @type {Object}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var flgs = x.flags;\n* // returns <Object>\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'flags', function get() {\n\treturn copyFlags( this._flags );\n});\n\n/**\n* Length of the array.\n*\n* @name length\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var len = x.length;\n* // returns 6\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Number of dimensions.\n*\n* @name ndims\n* @memberof ndarray.prototype\n* @type {PositiveInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var ndims = x.ndims;\n* // returns 2\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'ndims', function get() {\n\treturn this._ndims;\n});\n\n/**\n* Index offset which specifies the buffer index at which to start iterating over array elements.\n*\n* @name offset\n* @memberof ndarray.prototype\n* @type {NonNegativeInteger}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.offset;\n* // returns 0\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'offset', function get() {\n\treturn this._offset;\n});\n\n/**\n* Array order.\n*\n* ## Notes\n*\n* - The array order is either row-major (C-style) or column-major (Fortran-style).\n*\n* @name order\n* @memberof ndarray.prototype\n* @type {string}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var order = x.order;\n* // returns 'row-major'\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'order', function get() {\n\treturn this._order;\n});\n\n/**\n* Shape of the array.\n*\n* @name shape\n* @memberof ndarray.prototype\n* @type {NonNegativeIntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.shape;\n* // returns [ 3, 2 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'shape', function get() {\n\treturn this._shape.slice();\n});\n\n/**\n* Index strides which specify how to access data along corresponding array dimensions.\n*\n* @name strides\n* @memberof ndarray.prototype\n* @type {IntegerArray}\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var s = x.strides;\n* // returns [ 2, 1 ]\n*/\nsetReadOnlyAccessor( ndarray.prototype, 'strides', function get() {\n\treturn this._strides.slice();\n});\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name get\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'get', getValue );\n\n/**\n* Returns an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @name iget\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @returns {*} array element\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*/\nsetReadOnly( ndarray.prototype, 'iget', igetValue );\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @name set\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.get( 1, 1 );\n* // returns 4\n*\n* x.set( 1, 1, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.get( 1, 1 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'set', setValue );\n\n/**\n* Sets an array element located at a specified linear index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @name iset\n* @memberof ndarray.prototype\n* @type {Function}\n* @param {integer} [idx] - linear index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var v = x.iget( 3 );\n* // returns 4\n*\n* x.iset( 3, 10 );\n*\n* var b = x.data;\n* // returns [ 1, 2, 3, 10, 5, 6 ]\n*\n* v = x.iget( 3 );\n* // returns 10\n*/\nsetReadOnly( ndarray.prototype, 'iset', isetValue );\n\n/**\n* Serializes an ndarray as a string.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toString\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {string} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var str = x.toString();\n* // returns \"ndarray( 'generic', [ 3, 4, 5, 6, 7, 8 ], [ 3, 2 ], [ 2, 1 ], 0, 'row-major' )\"\n*/\nsetReadOnly( ndarray.prototype, 'toString', toString );\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying an `ndarray` instance.\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @name toJSON\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {Object} serialized ndarray\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var o = x.toJSON();\n* // e.g., returns { 'type': 'ndarray', 'dtype': 'generic', 'flags': {...}, 'offset': 0, 'order': 'row-major', 'shape': [ 3, 2 ], 'strides': [ 2, 1 ], 'data': [ 3, 4, 5, 6, 7, 8 ] }\n*/\nsetReadOnly( ndarray.prototype, 'toJSON', toJSON );\n\n/**\n* Serializes ndarray meta data to a `DataView`.\n*\n* ## Notes\n*\n* - Meta data format:\n*\n* ```text\n* | <endianness> (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |\n* ```\n*\n* where `strides` and `offset` are in units of bytes.\n*\n* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.\n*\n* - Serialization is performed according to host byte order (endianness).\n*\n* - Consumers of this method should treat the returned `DataView` as **immutable**. Otherwise, mutation can invalidate meta data and potentially affect other consumers.\n*\n* @private\n* @name __array_meta_dataview__\n* @memberof ndarray.prototype\n* @type {Function}\n* @returns {DataView} serialized meta data\n*\n* @example\n* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n* var shape = [ 3, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 2;\n*\n* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );\n*\n* var dv = x.__array_meta_dataview__();\n* // returns <DataView>\n*/\nsetReadOnly( ndarray.prototype, '__array_meta_dataview__', ( hasBigIntSupport() ) ? meta2dataview : meta2dataviewPolyfill );\n\n\n// EXPORTS //\n\nexport default ndarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport minmaxViewBufferIndex from '@stdlib/ndarray-base-minmax-view-buffer-index';\n\n\n// MAIN //\n\n/**\n* Determines if an array is contiguous.\n*\n* @private\n* @param {NonNegativeInteger} len - array length\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - stride array\n* @param {NonNegativeInteger} offset - index offset\n* @param {integer} iterationOrder - iteration order\n* @returns {boolean} boolean indicating if an array is contiguous\n*/\nfunction isContiguous( len, shape, strides, offset, iterationOrder ) {\n\tvar buf;\n\n\t// If an array does not contain any elements, then no data to store, and, if the array is unordered, adjacent array elements are not guaranteed to be stored next to each other.\n\tif ( len === 0 || iterationOrder === 0 ) {\n\t\treturn false;\n\t}\n\t// Ensure that the array is compatible with a single memory segment:\n\tbuf = minmaxViewBufferIndex( shape, strides, offset );\n\treturn ( len === ( buf[1]-buf[0]+1 ) );\n}\n\n\n// EXPORTS //\n\nexport default isContiguous;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies ndarray flags.\n*\n* @private\n* @param {Object} flags - flags\n* @returns {Object} copy of input object\n*/\nfunction copyFlags( flags ) {\n\treturn {\n\t\t'ROW_MAJOR_CONTIGUOUS': flags.ROW_MAJOR_CONTIGUOUS,\n\t\t'COLUMN_MAJOR_CONTIGUOUS': flags.COLUMN_MAJOR_CONTIGUOUS,\n\t\t'READONLY': flags.READONLY\n\t};\n}\n\n\n// EXPORTS //\n\nexport default copyFlags;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} idx - indices\n* @returns {*} array element\n*/\nfunction get() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( idx );\n\t}\n\treturn this._buffer[ idx ];\n}\n\n\n// EXPORTS //\n\nexport default get;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @returns {*} array element\n*/\nfunction iget( idx ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( this._offset );\n\t\t}\n\t\treturn this._buffer[ this._offset ];\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this._offset+idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset+idx ];\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\treturn this._buffer.get( this.offset-idx );\n\t\t\t}\n\t\t\treturn this._buffer[ this._offset-idx ];\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( this._order === 'column-major' ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\tif ( this._accessors ) {\n\t\t\treturn this._buffer.get( ind );\n\t\t}\n\t\treturn this._buffer[ ind ];\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\treturn this._buffer.get( ind );\n\t}\n\treturn this._buffer[ ind ];\n}\n\n\n// EXPORTS //\n\nexport default iget;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.\n*\n* @private\n* @param {...integer} [idx] - indices\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction set() {\n\t/* eslint-disable no-invalid-this */\n\tvar idx;\n\tvar i;\n\n\tidx = this._offset;\n\tfor ( i = 0; i < arguments.length-1; i++ ) {\n\t\tidx += this._strides[ i ] * arguments[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( arguments[ i ], idx );\n\t} else {\n\t\tthis._buffer[ idx ] = arguments[ i ];\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default set;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Sets an array element located a specified linear view index.\n*\n* ## Notes\n*\n* - For zero-dimensional arrays, the first, and only, argument should be the value to set.\n*\n* @private\n* @param {integer} [idx] - linear view index\n* @param {*} v - value to set\n* @returns {ndarray} ndarray instance\n*/\nfunction iset( idx, v ) {\n\t/* eslint-disable no-invalid-this */\n\tvar strides;\n\tvar shape;\n\tvar ndims;\n\tvar ind;\n\tvar s;\n\tvar i;\n\n\tndims = this._ndims;\n\tif ( ndims === 0 ) {\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( idx, this._offset );\n\t\t} else {\n\t\t\tthis._buffer[ this._offset ] = idx;\n\t\t}\n\t\treturn this;\n\t}\n\tif ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len\n\t\t// Trivial case where we have all positive strides...\n\t\tif ( this._iterationOrder === 1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset+idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset+idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t\t// Trivial case where we have all negative strides...\n\t\tif ( this._iterationOrder === -1 ) {\n\t\t\tif ( this._accessors ) {\n\t\t\t\tthis._buffer.set( v, this._offset-idx );\n\t\t\t} else {\n\t\t\t\tthis._buffer[ this._offset-idx ] = v;\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t}\n\t// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying data buffer...\n\tshape = this._shape;\n\tstrides = this._strides;\n\tind = this._offset;\n\tif ( this._order === 'column-major' ) {\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\ts = idx % shape[ i ];\n\t\t\tidx -= s;\n\t\t\tidx /= shape[ i ];\n\t\t\tind += s * strides[ i ];\n\t\t}\n\t\tif ( this._accessors ) {\n\t\t\tthis._buffer.set( v, ind );\n\t\t} else {\n\t\t\tthis._buffer[ ind ] = v;\n\t\t}\n\t\treturn this;\n\t}\n\t// Case: row-major\n\tfor ( i = ndims-1; i >= 0; i-- ) {\n\t\ts = idx % shape[ i ];\n\t\tidx -= s;\n\t\tidx /= shape[ i ];\n\t\tind += s * strides[ i ];\n\t}\n\tif ( this._accessors ) {\n\t\tthis._buffer.set( v, ind );\n\t} else {\n\t\tthis._buffer[ ind ] = v;\n\t}\n\treturn this;\n}\n\n\n// EXPORTS //\n\nexport default iset;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nimport real from '@stdlib/complex-float64-real';\nimport imag from '@stdlib/complex-float64-imag';\n\n\n// MAIN //\n\n/**\n* Serializes an ndarray as a JSON object.\n*\n* ## Notes\n*\n* - The method does **not** serialize data outside of the buffer region defined by the array configuration.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tlen = this._length;\n\n\t// Build an object containing all ndarray properties needed to revive a serialized ndarray...\n\tout = {};\n\tout.type = 'ndarray';\n\tout.dtype = this.dtype;\n\tout.flags = {\n\t\t'READONLY': this._flags.READONLY\n\t};\n\tout.order = this._order;\n\tout.shape = this._shape.slice();\n\tout.strides = this._strides.slice();\n\n\t// Flip the signs of negative strides:\n\tfor ( i = 0; i < out.strides.length; i++ ) {\n\t\tif ( out.strides[ i ] < 0 ) {\n\t\t\tout.strides[ i ] *= -1;\n\t\t}\n\t}\n\t// Cast data to generic array...\n\tout.data = [];\n\tif ( out.dtype === 'complex64' || out.dtype === 'complex128' ) {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tv = this.iget( i );\n\t\t\tout.data.push( real( v ), imag( v ) );\n\t\t}\n\t} else {\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tout.data.push( this.iget( i ) );\n\t\t}\n\t}\n\treturn out;\n\n\t/* eslint-enable no-invalid-this */\n}\n\n\n// EXPORTS //\n\nexport default toJSON;\n"],"names":["isColumnMajorContiguous","order","contiguous","isRowMajorContiguous","CTORS","int8","uint8","uint8c","int16","uint16","int32","uint32","float32","float64","generic","binary","complex64","complex128","bool","DTYPES","dtypes","ORDERS","orders","MODES","modes","ndarray","dtype","buffer","shape","strides","offset","nbytes","ord","len","i","this","length","BYTES_PER_ELEMENT","_byteLength","_bytesPerElement","bytesPerElement","_buffer","_dtype","_length","_ndims","_offset","_order","_shape","_strides","_accessors","Boolean","get","set","_iterationOrder","iterationOrder","buf","minmaxViewBufferIndex","isContiguous","strides2order","_flags","ROW_MAJOR_CONTIGUOUS","COLUMN_MAJOR_CONTIGUOUS","READONLY","__meta_dataview__","setReadOnly","setReadOnlyAccessor","prototype","flags","slice","idx","arguments","ndims","ind","s","v","ctor","str","dt","iget","real","imag","replace","join","out","type","data","push","hasBigIntSupport","flgs","sh","st","sm","m","o","N","M","_mode","_submode","byteLength","DataView","ArrayBuffer","setInt8","setInt16","IS_LITTLE_ENDIAN","setBigInt64","BigInt","setInt32","bytes","Uint8Array","float64ToInt64Bytes"],"mappings":";;o8DA8BA,SAASA,EAAyBC,EAAOC,GACxC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CCFA,SAASE,EAAsBF,EAAOC,GACrC,OAAOA,IAA0B,IAAVD,GAAyB,IAAVA,EACvC,CCHA,IAAIG,EAAQ,CACXC,KAAQ,gCACRC,MAAS,iCACTC,OAAU,wCACVC,MAAS,iCACTC,OAAU,kCACVC,MAAS,iCACTC,OAAU,kCACVC,QAAW,mCACXC,QAAW,mCACXC,QAAW,eACXC,OAAU,6BACVC,UAAa,qCACbC,WAAc,sCACdC,KAAQ,oCCVT,IAAIC,EAASC,IACTC,EAASC,IACTC,EAAQC,ICDZ,IAAIL,EAASC,IACTC,EAASC,IACTC,EAAQC,IC4CZ,SAASC,EAASC,EAAOC,EAAQC,EAAOC,EAASC,EAAQ7B,GACxD,IAAIC,EACA6B,EACAC,EACAC,EACAC,EACJ,KAAOC,gBAAgBV,GACtB,OAAO,IAAIA,EAASC,EAAOC,EAAQC,EAAOC,EAASC,EAAQ7B,GAI5D,IADAgC,EAAM,EACAC,EAAI,EAAGA,EAAIN,EAAMQ,OAAQF,IAC9BD,GAAOL,EAAOM,GAsCf,OAlCCH,EADIJ,EAAOU,kBACFV,EAAOU,kBAAoBJ,EAE3B,KAGVE,KAAKG,YAAcP,EACnBI,KAAKI,iBAAmBC,EAAiBd,GACzCS,KAAKM,QAAUd,EACfQ,KAAKO,OAAShB,EACdS,KAAKQ,QAAUV,EACfE,KAAKS,OAAShB,EAAMQ,OACpBD,KAAKU,QAAUf,EACfK,KAAKW,OAAS7C,EACdkC,KAAKY,OAASnB,EACdO,KAAKa,SAAWnB,EAChBM,KAAKc,WAAaC,EAASvB,EAAOwB,KAAOxB,EAAOyB,KAEhDjB,KAAKkB,gBAAkBC,EAAgBzB,GAGvC3B,EC9ED,SAAuB+B,EAAKL,EAAOC,EAASC,EAAQwB,GACnD,IAAIC,EAGJ,OAAa,IAARtB,GAAgC,IAAnBqB,GAKTrB,KADTsB,EAAMC,EAAuB5B,EAAOC,EAASC,IACtB,GAAGyB,EAAI,GAAG,CAClC,CDoEcE,CAAcxB,EAAKL,EAAOC,EAASC,EAAQK,KAAKkB,iBAG7DrB,EAAM0B,EAAe7B,GAErBM,KAAKwB,OAAS,CACbC,qBAAwBzD,EAAsB6B,EAAK9B,GACnD2D,wBAA2B7D,EAAyBgC,EAAK9B,GACzD4D,UAAY,GAIb3B,KAAK4B,kBAAoB,KAElB5B,IACR,CAcA6B,EAAavC,EAAS,OAAQ,WAsB9BwC,EAAqBxC,EAAQyC,UAAW,cAAc,WACrD,OAAO/B,KAAKG,WACb,IAsBA2B,EAAqBxC,EAAQyC,UAAW,qBAAqB,WAC5D,OAAO/B,KAAKI,gBACb,IAoBA0B,EAAqBxC,EAAQyC,UAAW,QAAQ,WAC/C,OAAO/B,KAAKM,OACb,IAoBAwB,EAAqBxC,EAAQyC,UAAW,SAAS,WAChD,OAAO/B,KAAKO,MACb,IAoBAuB,EAAqBxC,EAAQyC,UAAW,SAAS,WAChD,MEpOO,CACNN,sBAFkBO,EFqODhC,KAAKwB,QEnOQC,qBAC9BC,wBAA2BM,EAAMN,wBACjCC,SAAYK,EAAML,UAJpB,IAAoBK,CFsOpB,IAoBAF,EAAqBxC,EAAQyC,UAAW,UAAU,WACjD,OAAO/B,KAAKQ,OACb,IAoBAsB,EAAqBxC,EAAQyC,UAAW,SAAS,WAChD,OAAO/B,KAAKS,MACb,IAoBAqB,EAAqBxC,EAAQyC,UAAW,UAAU,WACjD,OAAO/B,KAAKU,OACb,IAwBAoB,EAAqBxC,EAAQyC,UAAW,SAAS,WAChD,OAAO/B,KAAKW,MACb,IAoBAmB,EAAqBxC,EAAQyC,UAAW,SAAS,WAChD,OAAO/B,KAAKY,OAAOqB,OACpB,IAoBAH,EAAqBxC,EAAQyC,UAAW,WAAW,WAClD,OAAO/B,KAAKa,SAASoB,OACtB,IA0BAJ,EAAavC,EAAQyC,UAAW,OGpYhC,WAEC,IAAIG,EACAnC,EAGJ,IADAmC,EAAMlC,KAAKU,QACLX,EAAI,EAAGA,EAAIoC,UAAUlC,OAAQF,IAClCmC,GAAOlC,KAAKa,SAAUd,GAAMoC,UAAWpC,GAExC,OAAKC,KAAKc,WACFd,KAAKM,QAAQU,IAAKkB,GAEnBlC,KAAKM,QAAS4B,EACtB,IHiZAL,EAAavC,EAAQyC,UAAW,QI9ZhC,SAAeG,GAEd,IAAIxC,EACAD,EACA2C,EACAC,EACAC,EACAvC,EAGJ,GAAe,KADfqC,EAAQpC,KAAKS,QAEZ,OAAKT,KAAKc,WACFd,KAAKM,QAAQU,IAAKhB,KAAKU,SAExBV,KAAKM,QAASN,KAAKU,SAE3B,GAAKV,KAAKwB,OAAOC,sBAAwBzB,KAAKwB,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzB1B,KAAKkB,gBACT,OAAKlB,KAAKc,WACFd,KAAKM,QAAQU,IAAKhB,KAAKU,QAAQwB,GAEhClC,KAAKM,QAASN,KAAKU,QAAQwB,GAGnC,IAA+B,IAA1BlC,KAAKkB,gBACT,OAAKlB,KAAKc,WACFd,KAAKM,QAAQU,IAAKhB,KAAKL,OAAOuC,GAE/BlC,KAAKM,QAASN,KAAKU,QAAQwB,EAEnC,CAKD,GAHAzC,EAAQO,KAAKY,OACblB,EAAUM,KAAKa,SACfwB,EAAMrC,KAAKU,QACU,iBAAhBV,KAAKW,OAA4B,CACrC,IAAMZ,EAAI,EAAGA,EAAIqC,EAAOrC,IAEvBmC,GADAI,EAAIJ,EAAMzC,EAAOM,GAEjBmC,GAAOzC,EAAOM,GACdsC,GAAOC,EAAI5C,EAASK,GAErB,OAAKC,KAAKc,WACFd,KAAKM,QAAQU,IAAKqB,GAEnBrC,KAAKM,QAAS+B,EACrB,CAED,IAAMtC,EAAIqC,EAAM,EAAGrC,GAAK,EAAGA,IAE1BmC,GADAI,EAAIJ,EAAMzC,EAAOM,GAEjBmC,GAAOzC,EAAOM,GACdsC,GAAOC,EAAI5C,EAASK,GAErB,OAAKC,KAAKc,WACFd,KAAKM,QAAQU,IAAKqB,GAEnBrC,KAAKM,QAAS+B,EACtB,IJsYAR,EAAavC,EAAQyC,UAAW,OKhchC,WAEC,IAAIG,EACAnC,EAGJ,IADAmC,EAAMlC,KAAKU,QACLX,EAAI,EAAGA,EAAIoC,UAAUlC,OAAO,EAAGF,IACpCmC,GAAOlC,KAAKa,SAAUd,GAAMoC,UAAWpC,GAOxC,OALKC,KAAKc,WACTd,KAAKM,QAAQW,IAAKkB,UAAWpC,GAAKmC,GAElClC,KAAKM,QAAS4B,GAAQC,UAAWpC,GAE3BC,IACR,ILodA6B,EAAavC,EAAQyC,UAAW,QMnehC,SAAeG,EAAKK,GAEnB,IAAI7C,EACAD,EACA2C,EACAC,EACAC,EACAvC,EAGJ,GAAe,KADfqC,EAAQpC,KAAKS,QAOZ,OALKT,KAAKc,WACTd,KAAKM,QAAQW,IAAKiB,EAAKlC,KAAKU,SAE5BV,KAAKM,QAASN,KAAKU,SAAYwB,EAEzBlC,KAER,GAAKA,KAAKwB,OAAOC,sBAAwBzB,KAAKwB,OAAOE,wBAA0B,CAE9E,GAA8B,IAAzB1B,KAAKkB,gBAMT,OALKlB,KAAKc,WACTd,KAAKM,QAAQW,IAAKsB,EAAGvC,KAAKU,QAAQwB,GAElClC,KAAKM,QAASN,KAAKU,QAAQwB,GAAQK,EAE7BvC,KAGR,IAA+B,IAA1BA,KAAKkB,gBAMT,OALKlB,KAAKc,WACTd,KAAKM,QAAQW,IAAKsB,EAAGvC,KAAKU,QAAQwB,GAElClC,KAAKM,QAASN,KAAKU,QAAQwB,GAAQK,EAE7BvC,IAER,CAKD,GAHAP,EAAQO,KAAKY,OACblB,EAAUM,KAAKa,SACfwB,EAAMrC,KAAKU,QACU,iBAAhBV,KAAKW,OAA4B,CACrC,IAAMZ,EAAI,EAAGA,EAAIqC,EAAOrC,IAEvBmC,GADAI,EAAIJ,EAAMzC,EAAOM,GAEjBmC,GAAOzC,EAAOM,GACdsC,GAAOC,EAAI5C,EAASK,GAOrB,OALKC,KAAKc,WACTd,KAAKM,QAAQW,IAAKsB,EAAGF,GAErBrC,KAAKM,QAAS+B,GAAQE,EAEhBvC,IACP,CAED,IAAMD,EAAIqC,EAAM,EAAGrC,GAAK,EAAGA,IAE1BmC,GADAI,EAAIJ,EAAMzC,EAAOM,GAEjBmC,GAAOzC,EAAOM,GACdsC,GAAOC,EAAI5C,EAASK,GAOrB,OALKC,KAAKc,WACTd,KAAKM,QAAQW,IAAKsB,EAAGF,GAErBrC,KAAKM,QAAS+B,GAAQE,EAEhBvC,IACR,INubA6B,EAAavC,EAAQyC,UAAW,YHnehC,WAEC,IAAIvC,EACA4C,EACAI,EACAC,EACAC,EACAH,EACAxC,EAUJ,GARAqC,EAAQpC,KAAKY,OAAOX,OAIpBwC,EAAM,cAHNC,EAAK1C,KAAKO,QAGa,MAGvBf,EAAS,GACJQ,KAAKQ,SAAW,IACpB,GAAY,cAAPkC,GAA6B,eAAPA,EAC1B,IAAM3C,EAAI,EAAGA,EAAIC,KAAKQ,QAAST,IAC9BwC,EAAIvC,KAAK2C,KAAM5C,GACfP,GAAUoD,EAAML,GAAM,KAAOM,EAAMN,GAC9BxC,EAAIC,KAAKQ,QAAQ,IACrBhB,GAAU,WAIZ,IAAMO,EAAI,EAAGA,EAAIC,KAAKQ,QAAST,IAC9BP,GAAUQ,KAAK2C,KAAM5C,GAChBA,EAAIC,KAAKQ,QAAQ,IACrBhB,GAAU,UAIP,CAEN,GAAY,cAAPkD,GAA6B,eAAPA,EAC1B,IAAM3C,EAAI,EAAGA,EAAI,EAAGA,IACnBwC,EAAIvC,KAAK2C,KAAM5C,GACfP,GAAUoD,EAAML,GAAM,KAAOM,EAAMN,GAC9BxC,EAAI,IACRP,GAAU,WAIZ,IAAMO,EAAI,EAAGA,EAAI,EAAGA,IACnBP,GAAUQ,KAAK2C,KAAM5C,GAChBA,EAAI,IACRP,GAAU,MAOb,GAHAA,GAAU,UAGE,cAAPkD,GAA6B,eAAPA,EAC1B,IAAM3C,EAAI,EAAGA,GAAK,EAAGA,IACpBwC,EAAIvC,KAAK2C,KAAM3C,KAAKQ,QAAQ,EAAET,GAC9BP,GAAUoD,EAAML,GAAM,KAAOM,EAAMN,GAC9BxC,EAAI,IACRP,GAAU,WAIZ,IAAMO,EAAI,EAAGA,GAAK,EAAGA,IACpBP,GAAUQ,KAAK2C,KAAM3C,KAAKQ,QAAQ,EAAET,GAC/BA,EAAI,IACRP,GAAU,KAIb,CAeD,GAdAgD,EAAOvE,EAAO+B,KAAKT,OACnBkD,GAAOK,EAASN,EAAM,WAAYhD,GAClCiD,GAAO,KAINA,GADc,IAAVL,EACG,KAEA,KAAOpC,KAAKY,OAAOmC,KAAM,MAAS,KAE1CN,GAAO,KAGPA,GAAO,KACQ,IAAVL,EACJK,GAAO,SAEP,IAAM1C,EAAI,EAAGA,EAAIqC,EAAOrC,IAClBC,KAAKa,SAAUd,GAAM,EACzB0C,IAAQzC,KAAKa,SAAUd,GAEvB0C,GAAOzC,KAAKa,SAAUd,GAElBA,EAAIqC,EAAM,IACdK,GAAO,MAgBV,OAZAA,GAAO,KACPA,GAAO,KAGPA,GAAO,IACPA,GAAO,KAGPA,GAAO,IAAOzC,KAAKW,OAAS,IAG5B8B,GAAO,IAIR,IGyYAZ,EAAavC,EAAQyC,UAAW,UOlhBhC,WAEC,IAAIiB,EACAlD,EACAyC,EACAxC,EAgBJ,IAdAD,EAAME,KAAKQ,SAGXwC,EAAM,CAAA,GACFC,KAAO,UACXD,EAAIzD,MAAQS,KAAKT,MACjByD,EAAIhB,MAAQ,CACXL,SAAY3B,KAAKwB,OAAOG,UAEzBqB,EAAIlF,MAAQkC,KAAKW,OACjBqC,EAAIvD,MAAQO,KAAKY,OAAOqB,QACxBe,EAAItD,QAAUM,KAAKa,SAASoB,QAGtBlC,EAAI,EAAGA,EAAIiD,EAAItD,QAAQO,OAAQF,IAC/BiD,EAAItD,QAASK,GAAM,IACvBiD,EAAItD,QAASK,KAAQ,GAKvB,GADAiD,EAAIE,KAAO,GACQ,cAAdF,EAAIzD,OAAuC,eAAdyD,EAAIzD,MACrC,IAAMQ,EAAI,EAAGA,EAAID,EAAKC,IACrBwC,EAAIvC,KAAK2C,KAAM5C,GACfiD,EAAIE,KAAKC,KAAMP,EAAML,GAAKM,EAAMN,SAGjC,IAAMxC,EAAI,EAAGA,EAAID,EAAKC,IACrBiD,EAAIE,KAAKC,KAAMnD,KAAK2C,KAAM5C,IAG5B,OAAOiD,CAGR,IP+gBAnB,EAAavC,EAAQyC,UAAW,0BAA6BqB,IFlf7D,WAEC,IAAIxD,EACAyD,EACAvD,EACA4C,EACAY,EACAC,EACAC,EACAjB,EACAkB,EACAC,EACApB,EACAqB,EACAC,EACA7D,EAYJ,GAVA0D,EAAIzD,KAAK6D,OAAS,QAClBL,EAAKxD,KAAK8D,UAAY,CAAEL,GAKxB3D,EAAM,GAAQ,IAJd6D,EAAI3D,KAAKS,SACTmD,EAAIJ,EAAGvD,SAMPsC,EAAIvC,KAAK4B,oBACCW,EAAEwB,aAAejE,EAC1B,OAAOyC,EA0BR,IAvBAA,EAAI,IAAIyB,EAAU,IAAIC,EAAanE,IAGnCwD,EAAKtD,KAAKY,OACV2C,EAAKvD,KAAKa,SACV6B,EAAK1C,KAAKO,OACVX,EAASI,KAAKI,iBAGdsD,EAAI,EACJnB,EAAE2B,QAASR,EAAG,EAAuB,EAAI,GAGzCA,GAAK,EACLnB,EAAE4B,SAAUT,EAAG1E,EAAQ0D,GAAM0B,GAG7BV,GAAK,EACLnB,EAAE8B,YAAaX,EAAGY,EAAQX,GAAKS,GAG/B9B,EAAQ,EAAJqB,EACJD,GAAK,EACC3D,EAAI,EAAGA,EAAI4D,EAAG5D,IACnBwC,EAAE8B,YAAaX,EAAGY,EAAQhB,EAAGvD,IAAMqE,GACnC7B,EAAE8B,YAAaX,EAAEpB,EAAGgC,EAAQf,EAAGxD,GAAGH,GAAUwE,GAC5CV,GAAK,EAoBN,IAjBAA,GAAKpB,EACLC,EAAE8B,YAAaX,EAAGY,EAAQtE,KAAKU,QAAQd,GAAUwE,GAGjDV,GAAK,EACLnB,EAAE2B,QAASR,EAAGxE,EAAQc,KAAKW,SAG3B+C,GAAK,EACLnB,EAAE2B,QAASR,EAAGtE,EAAOqE,IAGrBC,GAAK,EACLnB,EAAE8B,YAAaX,EAAGY,EAAQV,GAAKQ,GAG/BV,GAAK,EACC3D,EAAI,EAAGA,EAAI6D,EAAG7D,IACnBwC,EAAE2B,QAASR,EAAGtE,EAAOoE,EAAGzD,KACxB2D,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAUrD,KAAKwB,OAAoB,SAAA,EAAI,EACvCe,EAAEgC,SAAUb,EAAGL,EAAMe,GAGrBpE,KAAK4B,kBAAoBW,EAElBA,CAGR,EC3FA,WAEC,IAAI3C,EACA4E,EACAnB,EACAvD,EACA4C,EACAY,EACAC,EACAC,EACAjB,EACAkB,EACAC,EACApB,EACAqB,EACAC,EACA7D,EAYJ,GAVA0D,EAAIzD,KAAK6D,OAAS,QAClBL,EAAKxD,KAAK8D,UAAY,CAAEL,GAKxB3D,EAAM,GAAQ,IAJd6D,EAAI3D,KAAKS,SACTmD,EAAIJ,EAAGvD,SAMPsC,EAAIvC,KAAK4B,oBACCW,EAAEwB,aAAejE,EAC1B,OAAOyC,EA2BR,IAxBAA,EAAI,IAAIyB,EAAU,IAAIC,EAAanE,IACnC0E,EAAQ,IAAIC,EAAYlC,EAAE/C,QAG1B8D,EAAKtD,KAAKY,OACV2C,EAAKvD,KAAKa,SACV6B,EAAK1C,KAAKO,OACVX,EAASI,KAAKI,iBAGdsD,EAAI,EACJnB,EAAE2B,QAASR,EAAG,EAAuB,EAAI,GAGzCA,GAAK,EACLnB,EAAE4B,SAAUT,EAAG1E,EAAQ0D,GAAM0B,GAI7BM,EAAqBf,EAAGa,EAAO,EAD/Bd,GAAK,GAILpB,EAAQ,EAAJqB,EACJD,GAAK,EACC3D,EAAI,EAAGA,EAAI4D,EAAG5D,IACnB2E,EAAqBpB,EAAGvD,GAAIyE,EAAO,EAAGd,GACtCgB,EAAqBnB,EAAGxD,GAAGH,EAAQ4E,EAAO,EAAGd,EAAEpB,GAC/CoB,GAAK,EAoBN,IAjBAA,GAAKpB,EACLoC,EAAqB1E,KAAKU,QAAQd,EAAQ4E,EAAO,EAAGd,GAGpDA,GAAK,EACLnB,EAAE2B,QAASR,EAAGxE,EAAQc,KAAKW,SAG3B+C,GAAK,EACLnB,EAAE2B,QAASR,EAAGtE,EAAOqE,IAIrBiB,EAAqBd,EAAGY,EAAO,EAD/Bd,GAAK,GAILA,GAAK,EACC3D,EAAI,EAAGA,EAAI6D,EAAG7D,IACnBwC,EAAE2B,QAASR,EAAGtE,EAAOoE,EAAGzD,KACxB2D,GAAK,EAUN,OAPAL,EAAO,EACPA,GAAUrD,KAAKwB,OAAoB,SAAA,EAAI,EACvCe,EAAEgC,SAAUb,EAAGL,EAAMe,GAGrBpE,KAAK4B,kBAAoBW,EAElBA,CAGR"}
\ No newline at end of file
diff --git a/lib/copy_flags.js b/lib/copy_flags.js
deleted file mode 100644
index 6ac6234..0000000
--- a/lib/copy_flags.js
+++ /dev/null
@@ -1,41 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Copies ndarray flags.
-*
-* @private
-* @param {Object} flags - flags
-* @returns {Object} copy of input object
-*/
-function copyFlags( flags ) {
- return {
- 'ROW_MAJOR_CONTIGUOUS': flags.ROW_MAJOR_CONTIGUOUS,
- 'COLUMN_MAJOR_CONTIGUOUS': flags.COLUMN_MAJOR_CONTIGUOUS,
- 'READONLY': flags.READONLY
- };
-}
-
-
-// EXPORTS //
-
-module.exports = copyFlags;
diff --git a/lib/get.js b/lib/get.js
deleted file mode 100644
index 07dc7e7..0000000
--- a/lib/get.js
+++ /dev/null
@@ -1,52 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Returns an array element.
-*
-* ## Notes
-*
-* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.
-*
-* @private
-* @param {...integer} idx - indices
-* @returns {*} array element
-*/
-function get() {
- /* eslint-disable no-invalid-this */
- var idx;
- var i;
-
- idx = this._offset;
- for ( i = 0; i < arguments.length; i++ ) {
- idx += this._strides[ i ] * arguments[ i ];
- }
- if ( this._accessors ) {
- return this._buffer.get( idx );
- }
- return this._buffer[ idx ];
-}
-
-
-// EXPORTS //
-
-module.exports = get;
diff --git a/lib/iget.js b/lib/iget.js
deleted file mode 100644
index 75700be..0000000
--- a/lib/iget.js
+++ /dev/null
@@ -1,98 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Returns an array element located a specified linear view index.
-*
-* ## Notes
-*
-* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.
-*
-* @private
-* @param {integer} [idx] - linear view index
-* @returns {*} array element
-*/
-function iget( idx ) {
- /* eslint-disable no-invalid-this */
- var strides;
- var shape;
- var ndims;
- var ind;
- var s;
- var i;
-
- ndims = this._ndims;
- if ( ndims === 0 ) {
- if ( this._accessors ) {
- return this._buffer.get( this._offset );
- }
- return this._buffer[ this._offset ];
- }
- if ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len
- // Trivial case where we have all positive strides...
- if ( this._iterationOrder === 1 ) {
- if ( this._accessors ) {
- return this._buffer.get( this._offset+idx );
- }
- return this._buffer[ this._offset+idx ];
- }
- // Trivial case where we have all negative strides...
- if ( this._iterationOrder === -1 ) {
- if ( this._accessors ) {
- return this._buffer.get( this.offset-idx );
- }
- return this._buffer[ this._offset-idx ];
- }
- }
- // 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...
- shape = this._shape;
- strides = this._strides;
- ind = this._offset;
- if ( this._order === 'column-major' ) {
- for ( i = 0; i < ndims; i++ ) {
- s = idx % shape[ i ];
- idx -= s;
- idx /= shape[ i ];
- ind += s * strides[ i ];
- }
- if ( this._accessors ) {
- return this._buffer.get( ind );
- }
- return this._buffer[ ind ];
- }
- // Case: row-major
- for ( i = ndims-1; i >= 0; i-- ) {
- s = idx % shape[ i ];
- idx -= s;
- idx /= shape[ i ];
- ind += s * strides[ i ];
- }
- if ( this._accessors ) {
- return this._buffer.get( ind );
- }
- return this._buffer[ ind ];
-}
-
-
-// EXPORTS //
-
-module.exports = iget;
diff --git a/lib/index.js b/lib/index.js
deleted file mode 100644
index 59dc413..0000000
--- a/lib/index.js
+++ /dev/null
@@ -1,44 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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';
-
-/**
-* Multidimensional array constructor.
-*
-* @module @stdlib/ndarray-base-ctor
-*
-* @example
-* var ndarray = require( '@stdlib/ndarray-base-ctor' );
-*
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var out = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );
-*/
-
-// MODULES //
-
-var main = require( './main.js' );
-
-
-// EXPORTS //
-
-module.exports = main;
diff --git a/lib/is_column_major_contiguous.js b/lib/is_column_major_contiguous.js
deleted file mode 100644
index b313361..0000000
--- a/lib/is_column_major_contiguous.js
+++ /dev/null
@@ -1,38 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Determines if an array is column-major contiguous.
-*
-* @private
-* @param {integer} order - **inferred** array order
-* @param {boolean} contiguous - boolean indicating is an array is contiguous
-* @returns {boolean} boolean indicating if an array is column-major contiguous
-*/
-function isColumnMajorContiguous( order, contiguous ) {
- return contiguous && ( order === 2 || order === 3 );
-}
-
-
-// EXPORTS //
-
-module.exports = isColumnMajorContiguous;
diff --git a/lib/is_contiguous.js b/lib/is_contiguous.js
deleted file mode 100644
index 430f3aa..0000000
--- a/lib/is_contiguous.js
+++ /dev/null
@@ -1,54 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' );
-
-
-// MAIN //
-
-/**
-* Determines if an array is contiguous.
-*
-* @private
-* @param {NonNegativeInteger} len - array length
-* @param {NonNegativeIntegerArray} shape - array shape
-* @param {IntegerArray} strides - stride array
-* @param {NonNegativeInteger} offset - index offset
-* @param {integer} iterationOrder - iteration order
-* @returns {boolean} boolean indicating if an array is contiguous
-*/
-function isContiguous( len, shape, strides, offset, iterationOrder ) {
- var buf;
-
- // If an array does not contain any elements, then no data to store, and, if the array is unordered, adjacent array elements are not guaranteed to be stored next to each other.
- if ( len === 0 || iterationOrder === 0 ) {
- return false;
- }
- // Ensure that the array is compatible with a single memory segment:
- buf = minmaxViewBufferIndex( shape, strides, offset );
- return ( len === ( buf[1]-buf[0]+1 ) );
-}
-
-
-// EXPORTS //
-
-module.exports = isContiguous;
diff --git a/lib/is_row_major_contiguous.js b/lib/is_row_major_contiguous.js
deleted file mode 100644
index 2455b6a..0000000
--- a/lib/is_row_major_contiguous.js
+++ /dev/null
@@ -1,38 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Determines if an array is row-major contiguous.
-*
-* @private
-* @param {integer} order - **inferred** array order
-* @param {boolean} contiguous - boolean indicating is an array is contiguous
-* @returns {boolean} boolean indicating if an array is row-major contiguous
-*/
-function isRowMajorContiguous( order, contiguous ) {
- return contiguous && ( order === 1 || order === 3 );
-}
-
-
-// EXPORTS //
-
-module.exports = isRowMajorContiguous;
diff --git a/lib/iset.js b/lib/iset.js
deleted file mode 100644
index ad2167a..0000000
--- a/lib/iset.js
+++ /dev/null
@@ -1,109 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Sets an array element located a specified linear view index.
-*
-* ## Notes
-*
-* - For zero-dimensional arrays, the first, and only, argument should be the value to set.
-*
-* @private
-* @param {integer} [idx] - linear view index
-* @param {*} v - value to set
-* @returns {ndarray} ndarray instance
-*/
-function iset( idx, v ) {
- /* eslint-disable no-invalid-this */
- var strides;
- var shape;
- var ndims;
- var ind;
- var s;
- var i;
-
- ndims = this._ndims;
- if ( ndims === 0 ) {
- if ( this._accessors ) {
- this._buffer.set( idx, this._offset );
- } else {
- this._buffer[ this._offset ] = idx;
- }
- return this;
- }
- if ( this._flags.ROW_MAJOR_CONTIGUOUS || this._flags.COLUMN_MAJOR_CONTIGUOUS ) { // eslint-disable-line max-len
- // Trivial case where we have all positive strides...
- if ( this._iterationOrder === 1 ) {
- if ( this._accessors ) {
- this._buffer.set( v, this._offset+idx );
- } else {
- this._buffer[ this._offset+idx ] = v;
- }
- return this;
- }
- // Trivial case where we have all negative strides...
- if ( this._iterationOrder === -1 ) {
- if ( this._accessors ) {
- this._buffer.set( v, this._offset-idx );
- } else {
- this._buffer[ this._offset-idx ] = v;
- }
- return this;
- }
- }
- // 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...
- shape = this._shape;
- strides = this._strides;
- ind = this._offset;
- if ( this._order === 'column-major' ) {
- for ( i = 0; i < ndims; i++ ) {
- s = idx % shape[ i ];
- idx -= s;
- idx /= shape[ i ];
- ind += s * strides[ i ];
- }
- if ( this._accessors ) {
- this._buffer.set( v, ind );
- } else {
- this._buffer[ ind ] = v;
- }
- return this;
- }
- // Case: row-major
- for ( i = ndims-1; i >= 0; i-- ) {
- s = idx % shape[ i ];
- idx -= s;
- idx /= shape[ i ];
- ind += s * strides[ i ];
- }
- if ( this._accessors ) {
- this._buffer.set( v, ind );
- } else {
- this._buffer[ ind ] = v;
- }
- return this;
-}
-
-
-// EXPORTS //
-
-module.exports = iset;
diff --git a/lib/main.js b/lib/main.js
deleted file mode 100644
index 5048832..0000000
--- a/lib/main.js
+++ /dev/null
@@ -1,612 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-* http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-/* eslint-disable no-restricted-syntax, no-invalid-this */
-
-'use strict';
-
-// MODULES //
-
-var hasBigIntSupport = require( '@stdlib/assert-has-bigint-support' );
-var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );
-var setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );
-var bytesPerElement = require( '@stdlib/ndarray-base-bytes-per-element' );
-var iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );
-var strides2order = require( '@stdlib/ndarray-base-strides2order' );
-var Boolean = require( '@stdlib/boolean-ctor' );
-var isColumnMajorContiguous = require( './is_column_major_contiguous.js' );
-var isRowMajorContiguous = require( './is_row_major_contiguous.js' );
-var isContiguous = require( './is_contiguous.js' );
-var copyFlags = require( './copy_flags.js' );
-var igetValue = require( './iget.js' );
-var isetValue = require( './iset.js' );
-var setValue = require( './set.js' );
-var getValue = require( './get.js' );
-var toJSON = require( './tojson.js' );
-var toString = require( './tostring.js' ); // eslint-disable-line stdlib/no-redeclare
-var meta2dataview = require( './meta2dataview.js' );
-var meta2dataviewPolyfill = require( './meta2dataview.polyfill.js' );
-
-
-// MAIN //
-
-/**
-* ndarray constructor.
-*
-* ## Notes
-*
-* - To create a zero-dimensional array,
-*
-* ```javascript
-* var buffer = [ 1 ];
-* var shape = [];
-* var strides = [ 0 ];
-* var offset = 0;
-*
-* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-* ```
-*
-* @constructor
-* @param {string} dtype - data type
-* @param {(ArrayLikeObject|TypedArray|Buffer)} buffer - data buffer
-* @param {NonNegativeIntegerArray} shape - array shape
-* @param {IntegerArray} strides - array strides
-* @param {NonNegativeInteger} offset - index offset
-* @param {string} order - specifies whether an array is row-major (C-style) or column-major (Fortran-style)
-* @returns {ndarray} ndarray instance
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var out = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*/
-function ndarray( dtype, buffer, shape, strides, offset, order ) {
- var contiguous;
- var nbytes;
- var ord;
- var len;
- var i;
- if ( !(this instanceof ndarray) ) {
- return new ndarray( dtype, buffer, shape, strides, offset, order );
- }
- // Compute the number of elements...
- len = 1;
- for ( i = 0; i < shape.length; i++ ) {
- len *= shape[ i ];
- }
- // Compute the number of bytes...
- if ( buffer.BYTES_PER_ELEMENT ) {
- nbytes = buffer.BYTES_PER_ELEMENT * len;
- } else {
- nbytes = null;
- }
- // Set private properties...
- this._byteLength = nbytes;
- this._bytesPerElement = bytesPerElement( dtype );
- this._buffer = buffer;
- this._dtype = dtype;
- this._length = len;
- this._ndims = shape.length;
- this._offset = offset;
- this._order = order;
- this._shape = shape;
- this._strides = strides;
- this._accessors = Boolean( buffer.get && buffer.set );
-
- this._iterationOrder = iterationOrder( strides );
-
- // Determine if the array can be stored contiguously:
- contiguous = isContiguous( len, shape, strides, offset, this._iterationOrder ); // eslint-disable-line max-len
-
- // Infer the array "order" from the stride array (this is supplementary to the `order` parameter):
- ord = strides2order( strides );
-
- this._flags = {
- 'ROW_MAJOR_CONTIGUOUS': isRowMajorContiguous( ord, contiguous ),
- 'COLUMN_MAJOR_CONTIGUOUS': isColumnMajorContiguous( ord, contiguous ),
- 'READONLY': false
- };
-
- // Initialize a property for caching serialized meta data:
- this.__meta_dataview__ = null;
-
- return this;
-}
-
-/**
-* Constructor name.
-*
-* @name name
-* @memberof ndarray
-* @type {string}
-* @default 'ndarray'
-*
-* @example
-* var str = ndarray.name;
-* // returns 'ndarray'
-*/
-setReadOnly( ndarray, 'name', 'ndarray' );
-
-/**
-* Size (in bytes) of the array (if known).
-*
-* @name byteLength
-* @memberof ndarray.prototype
-* @type {(NonNegativeInteger|null)}
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );
-*
-* var byteLength = x.byteLength;
-* // returns 48
-*/
-setReadOnlyAccessor( ndarray.prototype, 'byteLength', function get() {
- return this._byteLength;
-});
-
-/**
-* Size (in bytes) of each array element (if known).
-*
-* @name BYTES_PER_ELEMENT
-* @memberof ndarray.prototype
-* @type {(PositiveInteger|null)}
-*
-* @example
-* var Float64Array = require( '@stdlib/array-float64' );
-*
-* var buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6 ] );
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'float64', buffer, shape, strides, offset, 'row-major' );
-*
-* var nbytes = x.BYTES_PER_ELEMENT;
-* // returns 8
-*/
-setReadOnlyAccessor( ndarray.prototype, 'BYTES_PER_ELEMENT', function get() {
- return this._bytesPerElement;
-});
-
-/**
-* Pointer to the underlying data buffer.
-*
-* @name data
-* @memberof ndarray.prototype
-* @type {(Array|TypedArray|Buffer)}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var data = x.data;
-* // returns [ 1, 2, 3, 4, 5, 6 ]
-*/
-setReadOnlyAccessor( ndarray.prototype, 'data', function get() {
- return this._buffer;
-});
-
-/**
-* Underlying data type.
-*
-* @name dtype
-* @memberof ndarray.prototype
-* @type {string}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var dtype = x.dtype;
-* // returns 'generic'
-*/
-setReadOnlyAccessor( ndarray.prototype, 'dtype', function get() {
- return this._dtype;
-});
-
-/**
-* Meta information, such as information concerning the memory layout of the array.
-*
-* @name flags
-* @memberof ndarray.prototype
-* @type {Object}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var flgs = x.flags;
-* // returns <Object>
-*/
-setReadOnlyAccessor( ndarray.prototype, 'flags', function get() {
- return copyFlags( this._flags );
-});
-
-/**
-* Length of the array.
-*
-* @name length
-* @memberof ndarray.prototype
-* @type {NonNegativeInteger}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var len = x.length;
-* // returns 6
-*/
-setReadOnlyAccessor( ndarray.prototype, 'length', function get() {
- return this._length;
-});
-
-/**
-* Number of dimensions.
-*
-* @name ndims
-* @memberof ndarray.prototype
-* @type {PositiveInteger}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var ndims = x.ndims;
-* // returns 2
-*/
-setReadOnlyAccessor( ndarray.prototype, 'ndims', function get() {
- return this._ndims;
-});
-
-/**
-* Index offset which specifies the buffer index at which to start iterating over array elements.
-*
-* @name offset
-* @memberof ndarray.prototype
-* @type {NonNegativeInteger}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var o = x.offset;
-* // returns 0
-*/
-setReadOnlyAccessor( ndarray.prototype, 'offset', function get() {
- return this._offset;
-});
-
-/**
-* Array order.
-*
-* ## Notes
-*
-* - The array order is either row-major (C-style) or column-major (Fortran-style).
-*
-* @name order
-* @memberof ndarray.prototype
-* @type {string}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var order = x.order;
-* // returns 'row-major'
-*/
-setReadOnlyAccessor( ndarray.prototype, 'order', function get() {
- return this._order;
-});
-
-/**
-* Shape of the array.
-*
-* @name shape
-* @memberof ndarray.prototype
-* @type {NonNegativeIntegerArray}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var s = x.shape;
-* // returns [ 3, 2 ]
-*/
-setReadOnlyAccessor( ndarray.prototype, 'shape', function get() {
- return this._shape.slice();
-});
-
-/**
-* Index strides which specify how to access data along corresponding array dimensions.
-*
-* @name strides
-* @memberof ndarray.prototype
-* @type {IntegerArray}
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var s = x.strides;
-* // returns [ 2, 1 ]
-*/
-setReadOnlyAccessor( ndarray.prototype, 'strides', function get() {
- return this._strides.slice();
-});
-
-/**
-* Returns an array element.
-*
-* ## Notes
-*
-* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.
-*
-* @name get
-* @memberof ndarray.prototype
-* @type {Function}
-* @param {...integer} [idx] - indices
-* @returns {*} array element
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var v = x.get( 1, 1 );
-* // returns 4
-*/
-setReadOnly( ndarray.prototype, 'get', getValue );
-
-/**
-* Returns an array element located at a specified linear index.
-*
-* ## Notes
-*
-* - For zero-dimensional arrays, the input argument is ignored and, for clarity, should not be provided.
-*
-* @name iget
-* @memberof ndarray.prototype
-* @type {Function}
-* @param {integer} [idx] - linear index
-* @returns {*} array element
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var v = x.iget( 3 );
-* // returns 4
-*/
-setReadOnly( ndarray.prototype, 'iget', igetValue );
-
-/**
-* Sets an array element.
-*
-* ## Notes
-*
-* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.
-*
-* @name set
-* @memberof ndarray.prototype
-* @type {Function}
-* @param {...integer} [idx] - indices
-* @param {*} v - value to set
-* @returns {ndarray} ndarray instance
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var v = x.get( 1, 1 );
-* // returns 4
-*
-* x.set( 1, 1, 10 );
-*
-* var b = x.data;
-* // returns [ 1, 2, 3, 10, 5, 6 ]
-*
-* v = x.get( 1, 1 );
-* // returns 10
-*/
-setReadOnly( ndarray.prototype, 'set', setValue );
-
-/**
-* Sets an array element located at a specified linear index.
-*
-* ## Notes
-*
-* - For zero-dimensional arrays, the first, and only, argument should be the value to set.
-*
-* @name iset
-* @memberof ndarray.prototype
-* @type {Function}
-* @param {integer} [idx] - linear index
-* @param {*} v - value to set
-* @returns {ndarray} ndarray instance
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 0;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var v = x.iget( 3 );
-* // returns 4
-*
-* x.iset( 3, 10 );
-*
-* var b = x.data;
-* // returns [ 1, 2, 3, 10, 5, 6 ]
-*
-* v = x.iget( 3 );
-* // returns 10
-*/
-setReadOnly( ndarray.prototype, 'iset', isetValue );
-
-/**
-* Serializes an ndarray as a string.
-*
-* ## Notes
-*
-* - The method does **not** serialize data outside of the buffer region defined by the array configuration.
-*
-* @name toString
-* @memberof ndarray.prototype
-* @type {Function}
-* @returns {string} serialized ndarray
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 2;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var str = x.toString();
-* // returns "ndarray( 'generic', [ 3, 4, 5, 6, 7, 8 ], [ 3, 2 ], [ 2, 1 ], 0, 'row-major' )"
-*/
-setReadOnly( ndarray.prototype, 'toString', toString );
-
-/**
-* Serializes an ndarray as a JSON object.
-*
-* ## Notes
-*
-* - `JSON.stringify()` implicitly calls this method when stringifying an `ndarray` instance.
-* - The method does **not** serialize data outside of the buffer region defined by the array configuration.
-*
-* @name toJSON
-* @memberof ndarray.prototype
-* @type {Function}
-* @returns {Object} serialized ndarray
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 2;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var o = x.toJSON();
-* // e.g., returns { 'type': 'ndarray', 'dtype': 'generic', 'flags': {...}, 'offset': 0, 'order': 'row-major', 'shape': [ 3, 2 ], 'strides': [ 2, 1 ], 'data': [ 3, 4, 5, 6, 7, 8 ] }
-*/
-setReadOnly( ndarray.prototype, 'toJSON', toJSON );
-
-/**
-* Serializes ndarray meta data to a `DataView`.
-*
-* ## Notes
-*
-* - Meta data format:
-*
-* ```text
-* | <endianness> (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |
-* ```
-*
-* where `strides` and `offset` are in units of bytes.
-*
-* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.
-*
-* - Serialization is performed according to host byte order (endianness).
-*
-* - Consumers of this method should treat the returned `DataView` as **immutable**. Otherwise, mutation can invalidate meta data and potentially affect other consumers.
-*
-* @private
-* @name __array_meta_dataview__
-* @memberof ndarray.prototype
-* @type {Function}
-* @returns {DataView} serialized meta data
-*
-* @example
-* var buffer = [ 1, 2, 3, 4, 5, 6, 7, 8 ];
-* var shape = [ 3, 2 ];
-* var strides = [ 2, 1 ];
-* var offset = 2;
-*
-* var x = ndarray( 'generic', buffer, shape, strides, offset, 'row-major' );
-*
-* var dv = x.__array_meta_dataview__();
-* // returns <DataView>
-*/
-setReadOnly( ndarray.prototype, '__array_meta_dataview__', ( hasBigIntSupport() ) ? meta2dataview : meta2dataviewPolyfill );
-
-
-// EXPORTS //
-
-module.exports = ndarray;
diff --git a/lib/meta2dataview.js b/lib/meta2dataview.js
deleted file mode 100644
index 8f2504a..0000000
--- a/lib/meta2dataview.js
+++ /dev/null
@@ -1,206 +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.
-*/
-
-'use strict';
-
-// MODULES //
-
-var IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );
-var ArrayBuffer = require( '@stdlib/array-buffer' );
-var DataView = require( '@stdlib/array-dataview' );
-var BigInt = require( '@stdlib/bigint-ctor' );
-var dtypes = require( '@stdlib/ndarray-dtypes' ).enum;
-var orders = require( '@stdlib/ndarray-orders' ).enum;
-var modes = require( '@stdlib/ndarray-index-modes' ).enum;
-
-
-// VARIABLES //
-
-var DTYPES = dtypes();
-var ORDERS = orders();
-var MODES = modes();
-
-
-// FUNCTIONS //
-
-/**
-* Serializes ndarray meta data to a `DataView`.
-*
-* ## Notes
-*
-* - This function takes into account ndarray-like objects which may support index modes.
-*
-* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.
-*
-* - Serialization is performed according to host byte order (endianness).
-*
-* - Meta data format:
-*
-* ```text
-* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |
-* ```
-*
-* which translates to the following `ArrayBuffer` layout:
-*
-* ```text
-* ArrayBuffer[
-* <endianness>[int8],
-* <dtype>[int16],
-* <ndims>[int64],
-* <shape>[ndims*int64],
-* <strides>[ndims*int64],
-* <offset>[int64],
-* <order>[int8],
-* <mode>[int8],
-* <nsubmodes>[int64],
-* <submodes>[nsubmodes*int8],
-* <flags>[int32]
-* ]
-* ```
-*
-* where `strides` and `offset` are in units of bytes.
-*
-* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.
-*
-* - Buffer length:
-*
-* ```text
-* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes
-* ```
-*
-* For example, consider a three-dimensional ndarray with one subscript index mode (submode):
-*
-* ```text
-* 33 + (3*16) + 1 = 82 bytes
-* ```
-*
-* - Views:
-*
-* - endianness: `Int8Array( buf, 0, 1 )`
-* - dtype: `Int16Array( buf, 1, 1 )`
-* - ndims: `Int64Array( buf, 3, 1 )`
-* - shape: `Int64Array( buf, 11, ndims )`
-* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`
-* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`
-* - order: `Int8Array( buf, 19+(ndims*16), 1 )`
-* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`
-* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`
-* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`
-* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`
-*
-* @private
-* @returns {DataView} serialized meta data
-*/
-function meta2dataview() {
- /* eslint-disable no-invalid-this */
- var nbytes;
- var flgs;
- var len;
- var dt;
- var sh;
- var st;
- var sm;
- var v;
- var m;
- var o;
- var s;
- var N;
- var M;
- var i;
-
- m = this._mode || 'throw';
- sm = this._submode || [ m ];
- N = this._ndims;
- M = sm.length;
-
- // Compute the amount of memory we need to allocate for storing meta data:
- len = 33 + (N*16) + M;
-
- // Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...
- v = this.__meta_dataview__;
- if ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be "stale" (e.g., shape and/or strides may have changed)
- return v;
- }
- // Allocate raw memory and create a view for interfacing with the allocated memory:
- v = new DataView( new ArrayBuffer( len ) );
-
- // Retrieve ndarray meta data:
- sh = this._shape;
- st = this._strides;
- dt = this._dtype;
- nbytes = this._bytesPerElement;
-
- // Endianness: (byteoffset: 0; bytelength: 1)
- o = 0;
- v.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );
-
- // Data type: (byteoffset: 1; bytelength: 2)
- o += 1;
- v.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );
-
- // Number of dimensions: (byteoffset: 3; bytelength: 8)
- o += 2;
- v.setBigInt64( o, BigInt( N ), IS_LITTLE_ENDIAN );
-
- // Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)
- s = N * 8; // stride length between a dimension (shape[i]) and its associated stride
- o += 8;
- for ( i = 0; i < N; i++ ) {
- v.setBigInt64( o, BigInt( sh[i] ), IS_LITTLE_ENDIAN );
- v.setBigInt64( o+s, BigInt( st[i]*nbytes ), IS_LITTLE_ENDIAN );
- o += 8;
- }
- // Offset: (byteoffset: 11+(ndims*16); bytelength: 8)
- o += s;
- v.setBigInt64( o, BigInt( this._offset*nbytes ), IS_LITTLE_ENDIAN );
-
- // Order: (byteoffset: 19+(ndims*16); bytelength: 1)
- o += 8;
- v.setInt8( o, ORDERS[ this._order ] );
-
- // Mode: (byteoffset: 20+(ndims*16); bytelength: 1)
- o += 1;
- v.setInt8( o, MODES[ m ] );
-
- // Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)
- o += 1;
- v.setBigInt64( o, BigInt( M ), IS_LITTLE_ENDIAN );
-
- // Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)
- o += 8;
- for ( i = 0; i < M; i++ ) {
- v.setInt8( o, MODES[ sm[i] ] );
- o += 1;
- }
- // Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)
- flgs = 0|0;
- flgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100
- v.setInt32( o, flgs, IS_LITTLE_ENDIAN );
-
- // Cache the serialized meta data:
- this.__meta_dataview__ = v;
-
- return v;
-
- /* eslint-enable no-invalid-this */
-}
-
-
-// EXPORTS //
-
-module.exports = meta2dataview;
diff --git a/lib/meta2dataview.polyfill.js b/lib/meta2dataview.polyfill.js
deleted file mode 100644
index 31fa593..0000000
--- a/lib/meta2dataview.polyfill.js
+++ /dev/null
@@ -1,209 +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.
-*/
-
-'use strict';
-
-// MODULES //
-
-var IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );
-var ArrayBuffer = require( '@stdlib/array-buffer' );
-var DataView = require( '@stdlib/array-dataview' );
-var Uint8Array = require( '@stdlib/array-uint8' );
-var dtypes = require( '@stdlib/ndarray-dtypes' ).enum;
-var orders = require( '@stdlib/ndarray-orders' ).enum;
-var modes = require( '@stdlib/ndarray-index-modes' ).enum;
-var float64ToInt64Bytes = require( '@stdlib/number-float64-base-to-int64-bytes' ).assign;
-
-
-// VARIABLES //
-
-var DTYPES = dtypes();
-var ORDERS = orders();
-var MODES = modes();
-
-
-// FUNCTIONS //
-
-/**
-* Serializes ndarray meta data to a `DataView`.
-*
-* ## Notes
-*
-* - This function takes into account ndarray-like objects which may support index modes.
-*
-* - This function defaults to returning cached serialized meta data. To force serialization, set the private `__meta_dataview__` property to `null`.
-*
-* - Serialization is performed according to host byte order (endianness).
-*
-* - Meta data format:
-*
-* ```text
-* | endianness (1 byte) | <dtype> (2 bytes) | <ndims> (8 bytes) | <shape> (ndims*8 bytes) | <strides> (ndims*8 bytes) | <offset> (8 bytes) | <order> (1 byte) | <mode> (1 byte) | <nsubmodes> (8 bytes) | <submodes> (nsubmodes*1 bytes) | <flags> (4 bytes) |
-* ```
-*
-* which translates to the following `ArrayBuffer` layout:
-*
-* ```text
-* ArrayBuffer[
-* <endianness>[int8],
-* <dtype>[int16],
-* <ndims>[int64],
-* <shape>[ndims*int64],
-* <strides>[ndims*int64],
-* <offset>[int64],
-* <order>[int8],
-* <mode>[int8],
-* <nsubmodes>[int64],
-* <submodes>[nsubmodes*int8],
-* <flags>[int32]
-* ]
-* ```
-*
-* where `strides` and `offset` are in units of bytes.
-*
-* - If the endianness is `1`, the byte order is little endian. If the endianness is `0`, the byte order is big endian.
-*
-* - Buffer length:
-*
-* ```text
-* 1 + 2 + 8 + (ndims*8) + (ndims*8) + 8 + 1 + 1 + 8 + (nsubmodes*1) + 4 = 33 + (ndims*16) + nsubmodes
-* ```
-*
-* For example, consider a three-dimensional ndarray with one subscript index mode (submode):
-*
-* ```text
-* 33 + (3*16) + 1 = 82 bytes
-* ```
-*
-* - Views:
-*
-* - endianness: `Int8Array( buf, 0, 1 )`
-* - dtype: `Int16Array( buf, 1, 1 )`
-* - ndims: `Int64Array( buf, 3, 1 )`
-* - shape: `Int64Array( buf, 11, ndims )`
-* - strides: `Int64Array( buf, 11+(ndims*8), ndims )`
-* - offset: `Int64Array( buf, 11+(ndims*16), 1 )`
-* - order: `Int8Array( buf, 19+(ndims*16), 1 )`
-* - mode: `Int8Array( buf, 20+(ndims*16), 1 )`
-* - nsubmodes: `Int64Array( buf, 21+(ndims*16), 1 )`
-* - submodes: `Int8Array( buf, 29+(ndims*16), nsubmodes )`
-* - flags: `Int32Array( buf, 29+(ndims*16)+nsubmodes, 1 )`
-*
-* @private
-* @returns {DataView} serialized meta data
-*/
-function meta2dataview() {
- /* eslint-disable no-invalid-this */
- var nbytes;
- var bytes;
- var flgs;
- var len;
- var dt;
- var sh;
- var st;
- var sm;
- var v;
- var m;
- var o;
- var s;
- var N;
- var M;
- var i;
-
- m = this._mode || 'throw';
- sm = this._submode || [ m ];
- N = this._ndims;
- M = sm.length;
-
- // Compute the amount of memory we need to allocate for storing meta data:
- len = 33 + (N*16) + M;
-
- // Check if we've already serialized ndarray meta data and can reuse an already allocated array buffer...
- v = this.__meta_dataview__;
- if ( v && v.byteLength === len ) { // Note: the byte length check is only a bare minimum sanity check, as cached contents may still be "stale" (e.g., shape and/or strides may have changed)
- return v;
- }
- // Allocate raw memory and create views for interfacing with the allocated memory:
- v = new DataView( new ArrayBuffer( len ) );
- bytes = new Uint8Array( v.buffer );
-
- // Retrieve ndarray meta data:
- sh = this._shape;
- st = this._strides;
- dt = this._dtype;
- nbytes = this._bytesPerElement;
-
- // Endianness: (byteoffset: 0; bytelength: 1)
- o = 0;
- v.setInt8( o, ( IS_LITTLE_ENDIAN ) ? 1 : 0 );
-
- // Data type: (byteoffset: 1; bytelength: 2)
- o += 1;
- v.setInt16( o, DTYPES[ dt ], IS_LITTLE_ENDIAN );
-
- // Number of dimensions: (byteoffset: 3; bytelength: 8)
- o += 2;
- float64ToInt64Bytes( N, bytes, 1, o );
-
- // Shape and strides: (byteoffset: 11 and 11+(ndims*8), respectively; bytelength: ndims*8 for both shape and strides, and, thus, ndims*16 total)
- s = N * 8; // stride length between a dimension (shape[i]) and its associated stride
- o += 8;
- for ( i = 0; i < N; i++ ) {
- float64ToInt64Bytes( sh[i], bytes, 1, o );
- float64ToInt64Bytes( st[i]*nbytes, bytes, 1, o+s );
- o += 8;
- }
- // Offset: (byteoffset: 11+(ndims*16); bytelength: 8)
- o += s;
- float64ToInt64Bytes( this._offset*nbytes, bytes, 1, o );
-
- // Order: (byteoffset: 19+(ndims*16); bytelength: 1)
- o += 8;
- v.setInt8( o, ORDERS[ this._order ] );
-
- // Mode: (byteoffset: 20+(ndims*16); bytelength: 1)
- o += 1;
- v.setInt8( o, MODES[ m ] );
-
- // Number of submodes: (byteoffset: 21+(ndims*16); bytelength: 8)
- o += 1;
- float64ToInt64Bytes( M, bytes, 1, o );
-
- // Submodes: (byteoffset: 29+(ndims*16); bytelength: nsubmodes*1)
- o += 8;
- for ( i = 0; i < M; i++ ) {
- v.setInt8( o, MODES[ sm[i] ] );
- o += 1;
- }
- // Flags: (byteoffset: 29+(ndims*16)+nsubmodes; bytelength: 4)
- flgs = 0|0;
- flgs |= ( this._flags.READONLY ) ? 4 : 0; // 00000000 00000000 00000000 00000100
- v.setInt32( o, flgs, IS_LITTLE_ENDIAN );
-
- // Cache the serialized meta data:
- this.__meta_dataview__ = v;
-
- return v;
-
- /* eslint-enable no-invalid-this */
-}
-
-
-// EXPORTS //
-
-module.exports = meta2dataview;
diff --git a/lib/set.js b/lib/set.js
deleted file mode 100644
index ed6f25c..0000000
--- a/lib/set.js
+++ /dev/null
@@ -1,55 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 //
-
-/**
-* Sets an array element.
-*
-* ## Notes
-*
-* - The number of indices should **equal** the number of dimensions. Accordingly, for zero-dimensional arrays, no indices should be provided.
-*
-* @private
-* @param {...integer} [idx] - indices
-* @param {*} v - value to set
-* @returns {ndarray} ndarray instance
-*/
-function set() {
- /* eslint-disable no-invalid-this */
- var idx;
- var i;
-
- idx = this._offset;
- for ( i = 0; i < arguments.length-1; i++ ) {
- idx += this._strides[ i ] * arguments[ i ];
- }
- if ( this._accessors ) {
- this._buffer.set( arguments[ i ], idx );
- } else {
- this._buffer[ idx ] = arguments[ i ];
- }
- return this;
-}
-
-
-// EXPORTS //
-
-module.exports = set;
diff --git a/lib/tojson.js b/lib/tojson.js
deleted file mode 100644
index 5b338f4..0000000
--- a/lib/tojson.js
+++ /dev/null
@@ -1,85 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 real = require( '@stdlib/complex-float64-real' );
-var imag = require( '@stdlib/complex-float64-imag' );
-
-
-// MAIN //
-
-/**
-* Serializes an ndarray as a JSON object.
-*
-* ## Notes
-*
-* - The method does **not** serialize data outside of the buffer region defined by the array configuration.
-*
-* @private
-* @returns {Object} JSON representation
-*/
-function toJSON() {
- /* eslint-disable no-invalid-this */
- var out;
- var len;
- var v;
- var i;
-
- len = this._length;
-
- // Build an object containing all ndarray properties needed to revive a serialized ndarray...
- out = {};
- out.type = 'ndarray';
- out.dtype = this.dtype;
- out.flags = {
- 'READONLY': this._flags.READONLY
- };
- out.order = this._order;
- out.shape = this._shape.slice();
- out.strides = this._strides.slice();
-
- // Flip the signs of negative strides:
- for ( i = 0; i < out.strides.length; i++ ) {
- if ( out.strides[ i ] < 0 ) {
- out.strides[ i ] *= -1;
- }
- }
- // Cast data to generic array...
- out.data = [];
- if ( out.dtype === 'complex64' || out.dtype === 'complex128' ) {
- for ( i = 0; i < len; i++ ) {
- v = this.iget( i );
- out.data.push( real( v ), imag( v ) );
- }
- } else {
- for ( i = 0; i < len; i++ ) {
- out.data.push( this.iget( i ) );
- }
- }
- return out;
-
- /* eslint-enable no-invalid-this */
-}
-
-
-// EXPORTS //
-
-module.exports = toJSON;
diff --git a/lib/tostring.js b/lib/tostring.js
deleted file mode 100644
index 582f0c6..0000000
--- a/lib/tostring.js
+++ /dev/null
@@ -1,181 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 replace = require( '@stdlib/string-replace' );
-var real = require( '@stdlib/complex-float64-real' );
-var imag = require( '@stdlib/complex-float64-imag' );
-
-
-// VARIABLES //
-
-var CTORS = {
- 'int8': 'new Int8Array( [ {{data}} ] )',
- 'uint8': 'new Uint8Array( [ {{data}} ] )',
- 'uint8c': 'new Uint8ClampedArray( [ {{data}} ] )',
- 'int16': 'new Int16Array( [ {{data}} ] )',
- 'uint16': 'new Uint16Array( [ {{data}} ] )',
- 'int32': 'new Int32Array( [ {{data}} ] )',
- 'uint32': 'new Uint32Array( [ {{data}} ] )',
- 'float32': 'new Float32Array( [ {{data}} ] )',
- 'float64': 'new Float64Array( [ {{data}} ] )',
- 'generic': '[ {{data}} ]',
- 'binary': 'new Buffer( [ {{data}} ] )',
- 'complex64': 'new Complex64Array( [ {{data}} ] )',
- 'complex128': 'new Complex128Array( [ {{data}} ] )',
- 'bool': 'new BooleanArray( [ {{data}} ] )'
-};
-
-
-// MAIN //
-
-/**
-* Serializes an ndarray as a string.
-*
-* ## Notes
-*
-* - The method does **not** serialize data outside of the buffer region defined by the array configuration.
-*
-* @private
-* @returns {string} string representation
-*/
-function toString() { // eslint-disable-line stdlib/no-redeclare
- /* eslint-disable no-invalid-this */
- var buffer;
- var ndims;
- var ctor;
- var str;
- var dt;
- var v;
- var i;
-
- ndims = this._shape.length;
- dt = this._dtype;
-
- // Function to invoke to create an ndarray:
- str = 'ndarray( \''+dt+'\', ';
-
- // Data buffer parameter...
- buffer = '';
- if ( this._length <= 100 ) {
- if ( dt === 'complex64' || dt === 'complex128' ) {
- for ( i = 0; i < this._length; i++ ) {
- v = this.iget( i );
- buffer += real( v ) + ', ' + imag( v );
- if ( i < this._length-1 ) {
- buffer += ', ';
- }
- }
- } else {
- for ( i = 0; i < this._length; i++ ) {
- buffer += this.iget( i );
- if ( i < this._length-1 ) {
- buffer += ', ';
- }
- }
- }
- } else {
- // First three values...
- if ( dt === 'complex64' || dt === 'complex128' ) {
- for ( i = 0; i < 3; i++ ) {
- v = this.iget( i );
- buffer += real( v ) + ', ' + imag( v );
- if ( i < 2 ) {
- buffer += ', ';
- }
- }
- } else {
- for ( i = 0; i < 3; i++ ) {
- buffer += this.iget( i );
- if ( i < 2 ) {
- buffer += ', ';
- }
- }
- }
- buffer += ', ..., ';
-
- // Last three values...
- if ( dt === 'complex64' || dt === 'complex128' ) {
- for ( i = 2; i >= 0; i-- ) {
- v = this.iget( this._length-1-i );
- buffer += real( v ) + ', ' + imag( v );
- if ( i > 0 ) {
- buffer += ', ';
- }
- }
- } else {
- for ( i = 2; i >= 0; i-- ) {
- buffer += this.iget( this._length-1-i );
- if ( i > 0 ) {
- buffer += ', ';
- }
- }
- }
- }
- ctor = CTORS[ this.dtype ];
- str += replace( ctor, '{{data}}', buffer );
- str += ', ';
-
- // Array shape...
- if ( ndims === 0 ) {
- str += '[]';
- } else {
- str += '[ ' + this._shape.join( ', ' ) + ' ]';
- }
- str += ', ';
-
- // Stride array...
- str += '[ ';
- if ( ndims === 0 ) {
- str += '0';
- } else {
- for ( i = 0; i < ndims; i++ ) {
- if ( this._strides[ i ] < 0 ) {
- str += -this._strides[ i ];
- } else {
- str += this._strides[ i ];
- }
- if ( i < ndims-1 ) {
- str += ', ';
- }
- }
- }
- str += ' ]';
- str += ', ';
-
- // Buffer offset:
- str += '0';
- str += ', ';
-
- // Order:
- str += '\'' + this._order + '\'';
-
- // Close the function call:
- str += ' )';
- return str;
-
- /* eslint-enable no-invalid-this */
-}
-
-
-// EXPORTS //
-
-module.exports = toString;
diff --git a/package.json b/package.json
index ddf1ec8..4854f3a 100644
--- a/package.json
+++ b/package.json
@@ -3,31 +3,8 @@
"version": "0.2.2",
"description": "Base multidimensional array.",
"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"
- },
+ "type": "module",
+ "main": "./index.mjs",
"homepage": "https://stdlib.io",
"repository": {
"type": "git",
@@ -36,68 +13,6 @@
"bugs": {
"url": "https://github.com/stdlib-js/stdlib/issues"
},
- "dependencies": {
- "@stdlib/array-buffer": "^0.2.2",
- "@stdlib/array-dataview": "^0.2.2",
- "@stdlib/array-uint8": "^0.2.2",
- "@stdlib/assert-has-bigint-support": "^0.2.2",
- "@stdlib/assert-is-little-endian": "^0.2.2",
- "@stdlib/bigint-ctor": "^0.2.2",
- "@stdlib/boolean-ctor": "^0.2.2",
- "@stdlib/complex-float64-imag": "^0.1.1",
- "@stdlib/complex-float64-real": "^0.1.1",
- "@stdlib/ndarray-base-bytes-per-element": "^0.2.2",
- "@stdlib/ndarray-base-iteration-order": "^0.2.2",
- "@stdlib/ndarray-base-minmax-view-buffer-index": "^0.2.2",
- "@stdlib/ndarray-base-strides2order": "^0.2.2",
- "@stdlib/ndarray-dtypes": "^0.3.0",
- "@stdlib/ndarray-index-modes": "^0.2.2",
- "@stdlib/ndarray-orders": "^0.2.2",
- "@stdlib/number-float64-base-to-int64-bytes": "^0.2.2",
- "@stdlib/string-replace": "^0.2.2",
- "@stdlib/types": "^0.4.3",
- "@stdlib/utils-define-nonenumerable-read-only-accessor": "^0.2.3",
- "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.2"
- },
- "devDependencies": {
- "@stdlib/array-bool": "^0.1.0",
- "@stdlib/array-complex128": "^0.3.0",
- "@stdlib/array-complex64": "^0.3.0",
- "@stdlib/array-float32": "^0.2.2",
- "@stdlib/array-float64": "^0.2.2",
- "@stdlib/assert-has-own-property": "^0.2.2",
- "@stdlib/assert-has-property": "^0.2.2",
- "@stdlib/assert-instance-of": "^0.2.2",
- "@stdlib/assert-is-dataview": "^0.2.2",
- "@stdlib/assert-is-function": "^0.2.2",
- "@stdlib/assert-is-nonnegative-integer": "^0.2.2",
- "@stdlib/assert-is-plain-object": "^0.2.2",
- "@stdlib/assert-is-positive-integer": "^0.2.2",
- "@stdlib/complex-float32-ctor": "^0.0.2",
- "@stdlib/complex-float64-ctor": "^0.0.3",
- "@stdlib/math-base-special-floor": "^0.2.3",
- "@stdlib/random-base-randu": "^0.2.1",
- "proxyquire": "^2.0.0",
- "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.2"
- },
- "engines": {
- "node": ">=0.10.0",
- "npm": ">2.7.0"
- },
- "os": [
- "aix",
- "darwin",
- "freebsd",
- "linux",
- "macos",
- "openbsd",
- "sunos",
- "win32",
- "windows"
- ],
"keywords": [
"stdlib",
"stdtypes",
@@ -118,7 +33,6 @@
"ctor",
"base"
],
- "__stdlib__": {},
"funding": {
"type": "opencollective",
"url": "https://opencollective.com/stdlib"
diff --git a/stats.html b/stats.html
new file mode 100644
index 0000000..14b9792
--- /dev/null
+++ b/stats.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.mjs","children":[{"name":"lib","children":[{"uid":"b7d4007d-1","name":"is_column_major_contiguous.js"},{"uid":"b7d4007d-3","name":"is_row_major_contiguous.js"},{"uid":"b7d4007d-5","name":"is_contiguous.js"},{"uid":"b7d4007d-7","name":"copy_flags.js"},{"uid":"b7d4007d-9","name":"iget.js"},{"uid":"b7d4007d-11","name":"iset.js"},{"uid":"b7d4007d-13","name":"set.js"},{"uid":"b7d4007d-15","name":"get.js"},{"uid":"b7d4007d-17","name":"tojson.js"},{"uid":"b7d4007d-19","name":"tostring.js"},{"uid":"b7d4007d-21","name":"meta2dataview.js"},{"uid":"b7d4007d-23","name":"meta2dataview.polyfill.js"},{"uid":"b7d4007d-25","name":"main.js"},{"uid":"b7d4007d-27","name":"index.js"}]}]}],"isRoot":true},"nodeParts":{"b7d4007d-1":{"renderedLength":1023,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-0"},"b7d4007d-3":{"renderedLength":1014,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-2"},"b7d4007d-5":{"renderedLength":1504,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-4"},"b7d4007d-7":{"renderedLength":936,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-6"},"b7d4007d-9":{"renderedLength":2530,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-8"},"b7d4007d-11":{"renderedLength":2662,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-10"},"b7d4007d-13":{"renderedLength":1268,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-12"},"b7d4007d-15":{"renderedLength":1184,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-14"},"b7d4007d-17":{"renderedLength":1789,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-16"},"b7d4007d-19":{"renderedLength":3782,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-18"},"b7d4007d-21":{"renderedLength":5687,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-20"},"b7d4007d-23":{"renderedLength":5594,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-22"},"b7d4007d-25":{"renderedLength":14233,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-24"},"b7d4007d-27":{"renderedLength":616,"gzipLength":0,"brotliLength":0,"metaUid":"b7d4007d-26"}},"nodeMetas":{"b7d4007d-0":{"id":"/lib/is_column_major_contiguous.js","moduleParts":{"index.mjs":"b7d4007d-1"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-2":{"id":"/lib/is_row_major_contiguous.js","moduleParts":{"index.mjs":"b7d4007d-3"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-4":{"id":"/lib/is_contiguous.js","moduleParts":{"index.mjs":"b7d4007d-5"},"imported":[{"uid":"b7d4007d-35"}],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-6":{"id":"/lib/copy_flags.js","moduleParts":{"index.mjs":"b7d4007d-7"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-8":{"id":"/lib/iget.js","moduleParts":{"index.mjs":"b7d4007d-9"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-10":{"id":"/lib/iset.js","moduleParts":{"index.mjs":"b7d4007d-11"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-12":{"id":"/lib/set.js","moduleParts":{"index.mjs":"b7d4007d-13"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-14":{"id":"/lib/get.js","moduleParts":{"index.mjs":"b7d4007d-15"},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-16":{"id":"/lib/tojson.js","moduleParts":{"index.mjs":"b7d4007d-17"},"imported":[{"uid":"b7d4007d-36"},{"uid":"b7d4007d-37"}],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-18":{"id":"/lib/tostring.js","moduleParts":{"index.mjs":"b7d4007d-19"},"imported":[{"uid":"b7d4007d-38"},{"uid":"b7d4007d-36"},{"uid":"b7d4007d-37"}],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-20":{"id":"/lib/meta2dataview.js","moduleParts":{"index.mjs":"b7d4007d-21"},"imported":[{"uid":"b7d4007d-39"},{"uid":"b7d4007d-40"},{"uid":"b7d4007d-41"},{"uid":"b7d4007d-42"},{"uid":"b7d4007d-43"},{"uid":"b7d4007d-44"},{"uid":"b7d4007d-45"}],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-22":{"id":"/lib/meta2dataview.polyfill.js","moduleParts":{"index.mjs":"b7d4007d-23"},"imported":[{"uid":"b7d4007d-39"},{"uid":"b7d4007d-40"},{"uid":"b7d4007d-41"},{"uid":"b7d4007d-46"},{"uid":"b7d4007d-43"},{"uid":"b7d4007d-44"},{"uid":"b7d4007d-45"},{"uid":"b7d4007d-47"}],"importedBy":[{"uid":"b7d4007d-24"}]},"b7d4007d-24":{"id":"/lib/main.js","moduleParts":{"index.mjs":"b7d4007d-25"},"imported":[{"uid":"b7d4007d-28"},{"uid":"b7d4007d-29"},{"uid":"b7d4007d-30"},{"uid":"b7d4007d-31"},{"uid":"b7d4007d-32"},{"uid":"b7d4007d-33"},{"uid":"b7d4007d-34"},{"uid":"b7d4007d-0"},{"uid":"b7d4007d-2"},{"uid":"b7d4007d-4"},{"uid":"b7d4007d-6"},{"uid":"b7d4007d-8"},{"uid":"b7d4007d-10"},{"uid":"b7d4007d-12"},{"uid":"b7d4007d-14"},{"uid":"b7d4007d-16"},{"uid":"b7d4007d-18"},{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"importedBy":[{"uid":"b7d4007d-26"}]},"b7d4007d-26":{"id":"/lib/index.js","moduleParts":{"index.mjs":"b7d4007d-27"},"imported":[{"uid":"b7d4007d-24"}],"importedBy":[],"isEntry":true},"b7d4007d-28":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/assert-has-bigint-support@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-29":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/utils-define-nonenumerable-read-only-property@v0.2.1-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-30":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/utils-define-nonenumerable-read-only-accessor@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-31":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-bytes-per-element@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-32":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-iteration-order@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-33":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-strides2order@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-34":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/boolean-ctor@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-24"}],"isExternal":true},"b7d4007d-35":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-base-minmax-view-buffer-index@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-4"}],"isExternal":true},"b7d4007d-36":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/complex-float64-real@v0.1.1-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-16"},{"uid":"b7d4007d-18"}],"isExternal":true},"b7d4007d-37":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/complex-float64-imag@v0.1.1-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-16"},{"uid":"b7d4007d-18"}],"isExternal":true},"b7d4007d-38":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/string-replace@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-18"}],"isExternal":true},"b7d4007d-39":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/assert-is-little-endian@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-40":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/array-buffer@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-41":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/array-dataview@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-42":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/bigint-ctor@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"}],"isExternal":true},"b7d4007d-43":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-dtypes@v0.3.0-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-44":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-orders@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-45":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/ndarray-index-modes@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-20"},{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-46":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/array-uint8@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-22"}],"isExternal":true},"b7d4007d-47":{"id":"https://cdn.jsdelivr.net/gh/stdlib-js/number-float64-base-to-int64-bytes@v0.2.2-esm/index.mjs","moduleParts":{},"imported":[],"importedBy":[{"uid":"b7d4007d-22"}],"isExternal":true}},"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.js b/test/test.js
deleted file mode 100644
index 8070cf6..0000000
--- a/test/test.js
+++ /dev/null
@@ -1,4064 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 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 proxyquire = require( 'proxyquire' );
-var Float64Array = require( '@stdlib/array-float64' );
-var Uint8Array = require( '@stdlib/array-uint8' );
-var Complex64Array = require( '@stdlib/array-complex64' );
-var Complex128Array = require( '@stdlib/array-complex128' );
-var BooleanArray = require( '@stdlib/array-bool' );
-var Complex64 = require( '@stdlib/complex-float32-ctor' );
-var Complex128 = require( '@stdlib/complex-float64-ctor' );
-var hasOwnProp = require( '@stdlib/assert-has-own-property' );
-var hasProp = require( '@stdlib/assert-has-property' );
-var instanceOf = require( '@stdlib/assert-instance-of' );
-var isFunction = require( '@stdlib/assert-is-function' );
-var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;
-var isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;
-var isPlainObject = require( '@stdlib/assert-is-plain-object' );
-var isDataView = require( '@stdlib/assert-is-dataview' );
-var IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );
-var real = require( '@stdlib/complex-float64-real' );
-var imag = require( '@stdlib/complex-float64-imag' );
-var dtypes = require( '@stdlib/ndarray-dtypes' ).enum;
-var modes = require( '@stdlib/ndarray-index-modes' ).enum;
-var orders = require( '@stdlib/ndarray-orders' ).enum;
-var ndarray = require( './../lib' );
-
-
-// VARIABLES //
-
-var DTYPES = dtypes();
-var MODES = modes();
-var ORDERS = orders();
-
-
-// TESTS //
-
-tape( 'main export is a function', function test( t ) {
- t.ok( true, __filename );
- t.strictEqual( typeof ndarray, 'function', 'main export is a function' );
- t.end();
-});
-
-tape( 'the function is an ndarray constructor', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = new ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( instanceOf( arr, ndarray ), true, 'returns an instance' );
- t.end();
-});
-
-tape( 'the constructor does not require the `new` keyword', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( instanceOf( arr, ndarray ), true, 'returns an instance' );
- t.end();
-});
-
-tape( 'the function supports creating zero-dimensional ndarrays', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = new ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( instanceOf( arr, ndarray ), true, 'returns an instance' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of the array (typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.byteLength ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.byteLength, 8*buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of the array (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.byteLength ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.byteLength, 8*buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of the array (typed; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.byteLength ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.byteLength, 8*buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of the array (complex typed; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.byteLength ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.byteLength, 8*buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of an array (generic)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( arr.byteLength, null, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `byteLength` property specifying the size (in bytes) of an array (generic; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'byteLength' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'byteLength' ), true, 'has property' );
- t.strictEqual( arr.byteLength, null, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( isPositiveInteger( arr.BYTES_PER_ELEMENT ), true, 'is a positive integer' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, 8, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( isPositiveInteger( arr.BYTES_PER_ELEMENT ), true, 'is a positive integer' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, 8, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (typed; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( isPositiveInteger( arr.BYTES_PER_ELEMENT ), true, 'is a positive integer' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, 8, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (complex typed; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( isPositiveInteger( arr.BYTES_PER_ELEMENT ), true, 'is a positive integer' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, 8, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (generic)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, null, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `BYTES_PER_ELEMENT` property specifying the size (in bytes) of each array element (generic; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'BYTES_PER_ELEMENT' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'BYTES_PER_ELEMENT' ), true, 'has property' );
- t.strictEqual( arr.BYTES_PER_ELEMENT, null, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `data` property pointing to the underlying data buffer', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'data' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'data' ), true, 'has property' );
- t.strictEqual( arr.data, buffer, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `data` property pointing to the underlying data buffer (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'data' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'data' ), true, 'has property' );
- t.strictEqual( arr.data, buffer, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `data` property pointing to the underlying data buffer (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'data' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'data' ), true, 'has property' );
- t.strictEqual( arr.data, buffer, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `dtype` property specifying the underlying data type', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'dtype' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'dtype' ), true, 'has property' );
- t.strictEqual( arr.dtype, dtype, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `dtype` property specifying the underlying data type (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'dtype' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'dtype' ), true, 'has property' );
- t.strictEqual( arr.dtype, dtype, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `dtype` property specifying the underlying data type (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'dtype' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'dtype' ), true, 'has property' );
- t.strictEqual( arr.dtype, dtype, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `flags` property providing meta information, such as information concerning the memory layout of the array (row-major contiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'flags' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'flags' ), true, 'has property' );
- t.strictEqual( isPlainObject( arr.flags ), true, 'is an object' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'ROW_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.ROW_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'COLUMN_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.COLUMN_MAJOR_CONTIGUOUS, false, 'has expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `flags` property providing meta information, such as information concerning the memory layout of the array (column-major contiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'flags' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'flags' ), true, 'has property' );
- t.strictEqual( isPlainObject( arr.flags ), true, 'is an object' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'ROW_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.ROW_MAJOR_CONTIGUOUS, false, 'has expected value' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'COLUMN_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.COLUMN_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `flags` property providing meta information, such as information concerning the memory layout of the array (row-major and column-major contiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 4 ];
- order = 'row-major';
- strides = [ 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'flags' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'flags' ), true, 'has property' );
- t.strictEqual( isPlainObject( arr.flags ), true, 'is an object' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'ROW_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.ROW_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'COLUMN_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.COLUMN_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `flags` property providing meta information, such as information concerning the memory layout of the array (row-major and column-major contiguous; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'flags' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'flags' ), true, 'has property' );
- t.strictEqual( isPlainObject( arr.flags ), true, 'is an object' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'ROW_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.ROW_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'COLUMN_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.COLUMN_MAJOR_CONTIGUOUS, true, 'has expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `flags` property providing meta information, such as information concerning the memory layout the array (neither row-major nor column-major contiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1, 2, 3, 4, 5, 6, 7, 8 ] );
- shape = [ 2, 2, 2 ];
- order = 'column-major';
- strides = [ 4, 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'flags' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'flags' ), true, 'has property' );
- t.strictEqual( isPlainObject( arr.flags ), true, 'is an object' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'ROW_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.ROW_MAJOR_CONTIGUOUS, false, 'has expected value' );
-
- t.strictEqual( hasOwnProp( arr.flags, 'COLUMN_MAJOR_CONTIGUOUS' ), true, 'has own property' );
- t.strictEqual( arr.flags.COLUMN_MAJOR_CONTIGUOUS, false, 'has expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `length` property specifying the number of array elements', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'length' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'length' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.length ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.length, buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `length` property specifying the number of array elements (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'length' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'length' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.length ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.length, buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `length` property specifying the number of array elements (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'length' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'length' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.length ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.length, buffer.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `ndims` property specifying the number of array dimensions', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'ndims' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'ndims' ), true, 'has property' );
- t.strictEqual( isPositiveInteger( arr.ndims ), true, 'is a positive integer' );
- t.strictEqual( arr.ndims, shape.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `ndims` property specifying the number of array dimensions (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'ndims' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'ndims' ), true, 'has property' );
- t.strictEqual( arr.ndims, shape.length, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `offset` property specifying the location of the first indexed element', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'offset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'offset' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.offset ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.offset, offset, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `offset` property specifying the location of the first indexed element (complex typed)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); // eslint-disable-line max-len
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'offset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'offset' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.offset ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.offset, offset, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `offset` property specifying the location of the first indexed element (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'offset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'offset' ), true, 'has property' );
- t.strictEqual( isNonNegativeInteger( arr.offset ), true, 'is a nonnegative integer' );
- t.strictEqual( arr.offset, offset, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `order` property specifying the array order (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'order' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'order' ), true, 'has property' );
- t.strictEqual( arr.order, order, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `order` property specifying the array order (row-major; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'order' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'order' ), true, 'has property' );
- t.strictEqual( arr.order, order, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `order` property specifying the array order (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'order' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'order' ), true, 'has property' );
- t.strictEqual( arr.order, order, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has an `order` property specifying the array order (column-major; 0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'column-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'order' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'order' ), true, 'has property' );
- t.strictEqual( arr.order, order, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `shape` property specifying the array shape (dimensions)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'shape' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'shape' ), true, 'has property' );
- t.notEqual( arr.shape, shape, 'returns a copy' );
- t.deepEqual( arr.shape, shape, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `shape` property specifying the array shape (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'column-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'shape' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'shape' ), true, 'has property' );
- t.notEqual( arr.shape, shape, 'returns a copy' );
- t.deepEqual( arr.shape, shape, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `strides` property specifying how to access array elements along corresponding dimensions', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'strides' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'strides' ), true, 'has property' );
- t.notEqual( arr.strides, strides, 'returns a copy' );
- t.deepEqual( arr.strides, strides, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `strides` property specifying how to access array elements along corresponding dimensions (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0 ] );
- shape = [];
- order = 'column-major';
- strides = [ 0 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'strides' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'strides' ), true, 'has property' );
- t.notEqual( arr.strides, strides, 'returns a copy' );
- t.deepEqual( arr.strides, strides, 'has expected value' );
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, -1 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 3.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 1.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (row-major; complex dtype)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- v = arr.get( 0, 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.get( 0, 1 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.get( 1, 0 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.get( 1, 1 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, 2 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 3.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get( 0, 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 1.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (column-major; complex dtype)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- v = arr.get( 0, 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.get( 0, 1 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.get( 1, 0 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.get( 1, 1 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `get` method for retrieving an array element using subscripts (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'get' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'get' ), true, 'has property' );
- t.strictEqual( isFunction( arr.get ), true, 'has method' );
-
- t.strictEqual( arr.get(), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, -1 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 3.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 1.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major; noncontiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2, 1 ];
- order = 'row-major';
- strides = [ 4, 1, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 6.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (row-major; noncontiguous; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); // eslint-disable-line max-len
- shape = [ 2, 2, 1 ];
- order = 'row-major';
- strides = [ 4, 1, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, 2 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 3.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 4.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 3.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 1.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major; noncontiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2, 1 ];
- order = 'column-major';
- strides = [ 1, 4, 8 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget( 0 ), 1.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 2.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 6.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 7.0, 'returns expected value' );
- t.strictEqual( imag( v ), 8.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (column-major; noncontiguous; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ); // eslint-disable-line max-len
- shape = [ 2, 2, 1 ];
- order = 'column-major';
- strides = [ 1, 4, 8 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 1.0, 'returns expected value' );
- t.strictEqual( imag( v ), 2.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 3.0, 'returns expected value' );
- t.strictEqual( imag( v ), 4.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- t.strictEqual( arr.iget(), 3.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iget` method for retrieving an array element using a linear index (0d; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iget' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iget' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iget ), true, 'has method' );
-
- v = arr.iget();
- t.strictEqual( real( v ), 5.0, 'returns expected value' );
- t.strictEqual( imag( v ), 6.0, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 5.0, 6.0, 7.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, -1 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 6.0, 5.0, 8.0, 7.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 7.0, 8.0, 5.0, 6.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 8.0, 7.0, 6.0, 5.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, new Complex64( 9.0, 10.0 ) );
- arr.set( 0, 1, new Complex64( 11.0, 12.0 ) );
- arr.set( 1, 0, new Complex64( 13.0, 14.0 ) );
- arr.set( 1, 1, new Complex64( 15.0, 16.0 ) );
-
- v = arr.get( 0, 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.get( 0, 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.get( 1, 0 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.get( 1, 1 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 5.0, 7.0, 6.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, 2 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 7.0, 5.0, 8.0, 6.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 6.0, 8.0, 5.0, 7.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, 5.0 );
- arr.set( 0, 1, 6.0 );
- arr.set( 1, 0, 7.0 );
- arr.set( 1, 1, 8.0 );
-
- t.strictEqual( arr.get( 0, 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.get( 0, 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 0 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.get( 1, 1 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 8.0, 6.0, 7.0, 5.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 0, 0, new Complex64( 9.0, 10.0 ) );
- arr.set( 0, 1, new Complex64( 11.0, 12.0 ) );
- arr.set( 1, 0, new Complex64( 13.0, 14.0 ) );
- arr.set( 1, 1, new Complex64( 15.0, 16.0 ) );
-
- v = arr.get( 0, 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.get( 0, 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.get( 1, 0 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.get( 1, 1 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 9.0, 10.0, 13.0, 14.0, 11.0, 12.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a `set` method for setting an array element using subscripts (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'set' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'set' ), true, 'has property' );
- t.strictEqual( isFunction( arr.set ), true, 'has method' );
-
- arr.set( 5.0 );
-
- t.strictEqual( arr.get(), 5.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 1.0, 2.0, 5.0, 4.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 5.0, 6.0, 7.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, -1 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 6.0, 5.0, 8.0, 7.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 7.0, 8.0, 5.0, 6.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 8.0, 7.0, 6.0, 5.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major; noncontiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ];
- shape = [ 2, 2, 1 ];
- order = 'row-major';
- strides = [ 4, 1, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, -5.0 );
- arr.iset( 1, -6.0 );
- arr.iset( 2, -7.0 );
- arr.iset( 3, -8.0 );
-
- t.strictEqual( arr.iget( 0 ), -5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), -6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), -7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), -8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ -5.0, -6.0, 3.0, 4.0, -7.0, -8.0, 7.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 13.0, 14.0, 15.0, 16.0, 9.0, 10.0, 11.0, 12.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ -2, -1 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 15.0, 16.0, 13.0, 14.0, 11.0, 12.0, 9.0, 10.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (row-major; noncontiguous; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0 ] ); // eslint-disable-line max-len
- shape = [ 2, 2, 1 ];
- order = 'row-major';
- strides = [ 4, 1, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( -9.0, -10.0 ) );
- arr.iset( 1, new Complex64( -11.0, -12.0 ) );
- arr.iset( 2, new Complex64( -13.0, -14.0 ) );
- arr.iset( 3, new Complex64( -15.0, -16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), -9.0, 'returns expected value' );
- t.strictEqual( imag( v ), -10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), -11.0, 'returns expected value' );
- t.strictEqual( imag( v ), -12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), -13.0, 'returns expected value' );
- t.strictEqual( imag( v ), -14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), -15.0, 'returns expected value' );
- t.strictEqual( imag( v ), -16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ -9.0, -10.0, 3.0, 4.0, -11.0, -12.0, 7.0, 8.0, -13.0, -14.0, 11.0, 12.0, -15.0, -16.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 5.0, 6.0, 7.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, 2 ];
- offset = 1;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 6.0, 5.0, 8.0, 7.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 7, 8, 5, 6 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, 5.0 );
- arr.iset( 1, 6.0 );
- arr.iset( 2, 7.0 );
- arr.iset( 3, 8.0 );
-
- t.strictEqual( arr.iget( 0 ), 5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), 6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), 7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), 8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 8.0, 7.0, 6.0, 5.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major; noncontiguous)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ];
- shape = [ 2, 2, 1 ];
- order = 'column-major';
- strides = [ 1, 4, 8 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, -5.0 );
- arr.iset( 1, -6.0 );
- arr.iset( 2, -7.0 );
- arr.iset( 3, -8.0 );
-
- t.strictEqual( arr.iget( 0 ), -5.0, 'returns expected value' );
- t.strictEqual( arr.iget( 1 ), -6.0, 'returns expected value' );
- t.strictEqual( arr.iget( 2 ), -7.0, 'returns expected value' );
- t.strictEqual( arr.iget( 3 ), -8.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ -5.0, -6.0, 3.0, 4.0, -7.0, -8.0, 7.0, 8.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, 2 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ 1, -2 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 13.0, 14.0, 15.0, 16.0, 9.0, 10.0, 11.0, 12.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( 9.0, 10.0 ) );
- arr.iset( 1, new Complex64( 11.0, 12.0 ) );
- arr.iset( 2, new Complex64( 13.0, 14.0 ) );
- arr.iset( 3, new Complex64( 15.0, 16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), 9.0, 'returns expected value' );
- t.strictEqual( imag( v ), 10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), 11.0, 'returns expected value' );
- t.strictEqual( imag( v ), 12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), 13.0, 'returns expected value' );
- t.strictEqual( imag( v ), 14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), 15.0, 'returns expected value' );
- t.strictEqual( imag( v ), 16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 15.0, 16.0, 13.0, 14.0, 11.0, 12.0, 9.0, 10.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (column-major; noncontiguous; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0 ] ); // eslint-disable-line max-len
- shape = [ 2, 2, 1 ];
- order = 'column-major';
- strides = [ 4, 1, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( 0, new Complex64( -9.0, -10.0 ) );
- arr.iset( 1, new Complex64( -11.0, -12.0 ) );
- arr.iset( 2, new Complex64( -13.0, -14.0 ) );
- arr.iset( 3, new Complex64( -15.0, -16.0 ) );
-
- v = arr.iget( 0 );
- t.strictEqual( real( v ), -9.0, 'returns expected value' );
- t.strictEqual( imag( v ), -10.0, 'returns expected value' );
- v = arr.iget( 1 );
- t.strictEqual( real( v ), -11.0, 'returns expected value' );
- t.strictEqual( imag( v ), -12.0, 'returns expected value' );
- v = arr.iget( 2 );
- t.strictEqual( real( v ), -13.0, 'returns expected value' );
- t.strictEqual( imag( v ), -14.0, 'returns expected value' );
- v = arr.iget( 3 );
- t.strictEqual( real( v ), -15.0, 'returns expected value' );
- t.strictEqual( imag( v ), -16.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ -9.0, -10.0, 3.0, 4.0, -11.0, -12.0, 7.0, 8.0, -13.0, -14.0, 11.0, 12.0, -15.0, -16.0, 15.0, 16.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (0d)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( -5.0 );
-
- t.strictEqual( arr.iget(), -5.0, 'returns expected value' );
-
- t.deepEqual( buffer, [ 1.0, 2.0, -5.0, 4.0 ], 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has an `iset` method for setting an array element using a linear index (0d; complex type)', function test( t ) {
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var v;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'iset' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'iset' ), true, 'has property' );
- t.strictEqual( isFunction( arr.iset ), true, 'has method' );
-
- arr.iset( new Complex64( -5.0, -6.0 ) );
-
- v = arr.iget();
- t.strictEqual( real( v ), -5.0, 'returns expected value' );
- t.strictEqual( imag( v ), -6.0, 'returns expected value' );
-
- t.deepEqual( buffer, new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, -5.0, -6.0, 7.0, 8.0 ] ), 'has expected values' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (row-major)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ];
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'generic\', [ 3, 4, 5, 6 ], [ 2, 2 ], [ 2, 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (column-major)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'generic\', [ 4, 3, 2, 1 ], [ 2, 2 ], [ 1, 2 ], 0, \'column-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (complex type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'complex64\', new Complex64Array( [ 1, 2, 3, 4, 5, 6, 7, 8 ] ), [ 2, 2 ], [ 2, 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (boolean type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'bool';
- buffer = new BooleanArray( [ true, false, true, false ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'bool\', new BooleanArray( [ true, false, true, false ] ), [ 2, 2 ], [ 2, 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (complex type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex128';
- buffer = new Complex128Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'complex128\', new Complex128Array( [ 1, 2, 3, 4, 5, 6, 7, 8 ] ), [ 2, 2 ], [ 2, 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (0d)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'generic\', [ 4 ], [], [ 0 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (large array)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = new Array( 1e4 );
- shape = [ buffer.length ];
- order = 'row-major';
- strides = [ 1 ];
- offset = 0;
-
- buffer[ 0 ] = 1.0;
- buffer[ 1 ] = 2.0;
- buffer[ 2 ] = 3.0;
- buffer[ buffer.length-3 ] = 4.0;
- buffer[ buffer.length-2 ] = 5.0;
- buffer[ buffer.length-1 ] = 6.0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'generic\', [ 1, 2, 3, ..., 4, 5, 6 ], [ 10000 ], [ 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (large array; complex type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( 1e4 );
- shape = [ buffer.length ];
- order = 'row-major';
- strides = [ 1 ];
- offset = 0;
-
- buffer.set( new Complex64( 1.0, 1.0 ), 0 );
- buffer.set( new Complex64( 2.0, 2.0 ), 1 );
- buffer.set( new Complex64( 3.0, 3.0 ), 2 );
- buffer.set( new Complex64( 4.0, 4.0 ), buffer.length-3 );
- buffer.set( new Complex64( 5.0, 5.0 ), buffer.length-2 );
- buffer.set( new Complex64( 6.0, 6.0 ), buffer.length-1 );
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'complex64\', new Complex64Array( [ 1, 1, 2, 2, 3, 3, ..., 4, 4, 5, 5, 6, 6 ] ), [ 10000 ], [ 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toString()` method (large array; complex type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex128';
- buffer = new Complex128Array( 1e4 );
- shape = [ buffer.length ];
- order = 'row-major';
- strides = [ 1 ];
- offset = 0;
-
- buffer.set( new Complex128( 1.0, 1.0 ), 0 );
- buffer.set( new Complex128( 2.0, 2.0 ), 1 );
- buffer.set( new Complex128( 3.0, 3.0 ), 2 );
- buffer.set( new Complex128( 4.0, 4.0 ), buffer.length-3 );
- buffer.set( new Complex128( 5.0, 5.0 ), buffer.length-2 );
- buffer.set( new Complex128( 6.0, 6.0 ), buffer.length-1 );
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toString' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toString' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toString ), true, 'has method' );
-
- expected = 'ndarray( \'complex128\', new Complex128Array( [ 1, 1, 2, 2, 3, 3, ..., 4, 4, 5, 5, 6, 6 ] ), [ 10000 ], [ 1 ], 0, \'row-major\' )';
- actual = arr.toString();
- t.strictEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toJSON()` method (row-major)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toJSON' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toJSON' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toJSON ), true, 'has method' );
-
- expected = {
- 'type': 'ndarray',
- 'dtype': 'float64',
- 'data': [ 3.0, 4.0, 5.0, 6.0 ],
- 'shape': [ 2, 2 ],
- 'strides': [ 2, 1 ],
- 'order': 'row-major',
- 'flags': {
- 'READONLY': false
- }
- };
- actual = arr.toJSON();
- t.deepEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toJSON()` method (column-major)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [ 2, 2 ];
- order = 'column-major';
- strides = [ -1, -2 ];
- offset = 3;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toJSON' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toJSON' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toJSON ), true, 'has method' );
-
- expected = {
- 'type': 'ndarray',
- 'dtype': 'generic',
- 'data': [ 4.0, 3.0, 2.0, 1.0 ],
- 'shape': [ 2, 2 ],
- 'strides': [ 1, 2 ],
- 'order': 'column-major',
- 'flags': {
- 'READONLY': false
- }
- };
- actual = arr.toJSON();
- t.deepEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toJSON()` method (complex type)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'complex64';
- buffer = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 0;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toJSON' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toJSON' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toJSON ), true, 'has method' );
-
- expected = {
- 'type': 'ndarray',
- 'dtype': 'complex64',
- 'data': [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ],
- 'shape': [ 2, 2 ],
- 'strides': [ 2, 1 ],
- 'order': 'row-major',
- 'flags': {
- 'READONLY': false
- }
- };
- actual = arr.toJSON();
- t.deepEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a custom `toJSON()` method (0d)', function test( t ) {
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
-
- dtype = 'generic';
- buffer = [ 1.0, 2.0, 3.0, 4.0 ];
- shape = [];
- order = 'row-major';
- strides = [ 0 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, 'toJSON' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, 'toJSON' ), true, 'has property' );
- t.strictEqual( isFunction( arr.toJSON ), true, 'has method' );
-
- expected = {
- 'type': 'ndarray',
- 'dtype': 'generic',
- 'data': [ 3.0 ],
- 'shape': [],
- 'strides': [ 0 ],
- 'order': 'row-major',
- 'flags': {
- 'READONLY': false
- }
- };
- actual = arr.toJSON();
- t.deepEqual( actual, expected, 'returns expected value' );
-
- t.end();
-});
-
-tape( 'an ndarray has a protocol method for serializing meta data to a DataView', function test( t ) {
- /* eslint-disable no-underscore-dangle */
- var expected;
- var strides;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var bytes;
- var arr;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, '__array_meta_dataview__' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, '__array_meta_dataview__' ), true, 'has property' );
- t.strictEqual( isFunction( arr.__array_meta_dataview__ ), true, 'has method' );
-
- expected = {
- 'dtype': DTYPES[ 'float64' ],
- 'ndims': shape.length,
- 'shape': shape,
- 'strides': strides,
- 'offset': offset,
- 'order': ORDERS[ 'row-major' ],
- 'mode': MODES[ 'throw' ],
- 'nsubmodes': 1,
- 'submodes': [ MODES[ 'throw' ] ],
- 'flags': 0
- };
-
- arr.__meta_dataview__ = null;
- actual = arr.__array_meta_dataview__();
- arr.__meta_dataview__ = null;
-
- t.strictEqual( isDataView( actual ), true, 'returns a DataView' );
- t.strictEqual( actual.byteLength, 1+2+8+(2*8)+(2*8)+8+1+1+8+(1*1)+4, 'returns expected byte length' );
-
- bytes = new Uint8Array( actual.buffer );
- if ( IS_LITTLE_ENDIAN ) {
- t.strictEqual( bytes[ 0 ], 1, 'returns expected endianness' );
- t.strictEqual( bytes[ 1 ], expected.dtype, 'returns expected dtype' );
- t.strictEqual( bytes[ 3 ], expected.ndims, 'returns expected ndims' );
- t.strictEqual( bytes[ 11 ], expected.shape[ 0 ], 'returns expected first dimension' );
- t.strictEqual( bytes[ 19 ], expected.shape[ 1 ], 'returns expected second dimension' );
- t.strictEqual( bytes[ 27 ], expected.strides[ 0 ]*arr.BYTES_PER_ELEMENT, 'returns expected first stride' );
- t.strictEqual( bytes[ 35 ], expected.strides[ 1 ]*arr.BYTES_PER_ELEMENT, 'returns expected second stride' );
- t.strictEqual( bytes[ 43 ], expected.offset*arr.BYTES_PER_ELEMENT, 'returns expected offset' );
- t.strictEqual( bytes[ 51 ], expected.order, 'returns expected order' );
- t.strictEqual( bytes[ 52 ], expected.mode, 'returns expected index mode' );
- t.strictEqual( bytes[ 53 ], expected.nsubmodes, 'returns expected number of subscript modes' );
- t.strictEqual( bytes[ 61 ], expected.submodes[ 0 ], 'returns expected submode' );
- t.strictEqual( bytes[ 62 ], expected.flags, 'returns expected flags' );
- } else {
- t.strictEqual( bytes[ 0 ], 0, 'returns expected endianness' );
- t.strictEqual( bytes[ 2 ], expected.dtype, 'returns expected dtype' );
- t.strictEqual( bytes[ 10 ], expected.ndims, 'returns expected ndims' );
- t.strictEqual( bytes[ 18 ], expected.shape[ 0 ], 'returns expected first dimension' );
- t.strictEqual( bytes[ 26 ], expected.shape[ 1 ], 'returns expected second dimension' );
- t.strictEqual( bytes[ 34 ], expected.strides[ 0 ]*arr.BYTES_PER_ELEMENT, 'returns expected first stride' );
- t.strictEqual( bytes[ 42 ], expected.strides[ 1 ]*arr.BYTES_PER_ELEMENT, 'returns expected second stride' );
- t.strictEqual( bytes[ 50 ], expected.offset*arr.BYTES_PER_ELEMENT, 'returns expected offset' );
- t.strictEqual( bytes[ 51 ], expected.order, 'returns expected order' );
- t.strictEqual( bytes[ 52 ], expected.mode, 'returns expected index mode' );
- t.strictEqual( bytes[ 60 ], expected.nsubmodes, 'returns expected number of subscript modes' );
- t.strictEqual( bytes[ 61 ], expected.submodes[ 0 ], 'returns expected submode' );
- t.strictEqual( bytes[ 65 ], expected.flags, 'returns expected flags' );
- }
- t.end();
-
- /* eslint-enable no-underscore-dangle */
-});
-
-tape( 'an ndarray has a protocol method for serializing meta data to a DataView (no BigInt support)', function test( t ) {
- /* eslint-disable no-underscore-dangle */
- var expected;
- var strides;
- var ndarray;
- var actual;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var bytes;
- var arr;
-
- ndarray = proxyquire( './../lib/main.js', {
- '@stdlib/assert-has-bigint-support': hasSupport
- });
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- t.strictEqual( hasOwnProp( arr, '__array_meta_dataview__' ), false, 'does not have own property' );
- t.strictEqual( hasProp( arr, '__array_meta_dataview__' ), true, 'has property' );
- t.strictEqual( isFunction( arr.__array_meta_dataview__ ), true, 'has method' );
-
- expected = {
- 'dtype': DTYPES[ 'float64' ],
- 'ndims': shape.length,
- 'shape': shape,
- 'strides': strides,
- 'offset': offset,
- 'order': ORDERS[ 'row-major' ],
- 'mode': MODES[ 'throw' ],
- 'nsubmodes': 1,
- 'submodes': [ MODES[ 'throw' ] ],
- 'flags': 0
- };
-
- arr.__meta_dataview__ = null;
- actual = arr.__array_meta_dataview__();
- arr.__meta_dataview__ = null;
-
- t.strictEqual( isDataView( actual ), true, 'returns a DataView' );
- t.strictEqual( actual.byteLength, 1+2+8+(2*8)+(2*8)+8+1+1+8+(1*1)+4, 'returns expected byte length' );
-
- bytes = new Uint8Array( actual.buffer );
- if ( IS_LITTLE_ENDIAN ) {
- t.strictEqual( bytes[ 0 ], 1, 'returns expected endianness' );
- t.strictEqual( bytes[ 1 ], expected.dtype, 'returns expected dtype' );
- t.strictEqual( bytes[ 3 ], expected.ndims, 'returns expected ndims' );
- t.strictEqual( bytes[ 11 ], expected.shape[ 0 ], 'returns expected first dimension' );
- t.strictEqual( bytes[ 19 ], expected.shape[ 1 ], 'returns expected second dimension' );
- t.strictEqual( bytes[ 27 ], expected.strides[ 0 ]*arr.BYTES_PER_ELEMENT, 'returns expected first stride' );
- t.strictEqual( bytes[ 35 ], expected.strides[ 1 ]*arr.BYTES_PER_ELEMENT, 'returns expected second stride' );
- t.strictEqual( bytes[ 43 ], expected.offset*arr.BYTES_PER_ELEMENT, 'returns expected offset' );
- t.strictEqual( bytes[ 51 ], expected.order, 'returns expected order' );
- t.strictEqual( bytes[ 52 ], expected.mode, 'returns expected index mode' );
- t.strictEqual( bytes[ 53 ], expected.nsubmodes, 'returns expected number of subscript modes' );
- t.strictEqual( bytes[ 61 ], expected.submodes[ 0 ], 'returns expected submode' );
- t.strictEqual( bytes[ 62 ], expected.flags, 'returns expected flags' );
- } else {
- t.strictEqual( bytes[ 0 ], 0, 'returns expected endianness' );
- t.strictEqual( bytes[ 2 ], expected.dtype, 'returns expected dtype' );
- t.strictEqual( bytes[ 10 ], expected.ndims, 'returns expected ndims' );
- t.strictEqual( bytes[ 18 ], expected.shape[ 0 ], 'returns expected first dimension' );
- t.strictEqual( bytes[ 26 ], expected.shape[ 1 ], 'returns expected second dimension' );
- t.strictEqual( bytes[ 34 ], expected.strides[ 0 ]*arr.BYTES_PER_ELEMENT, 'returns expected first stride' );
- t.strictEqual( bytes[ 42 ], expected.strides[ 1 ]*arr.BYTES_PER_ELEMENT, 'returns expected second stride' );
- t.strictEqual( bytes[ 50 ], expected.offset*arr.BYTES_PER_ELEMENT, 'returns expected offset' );
- t.strictEqual( bytes[ 51 ], expected.order, 'returns expected order' );
- t.strictEqual( bytes[ 52 ], expected.mode, 'returns expected index mode' );
- t.strictEqual( bytes[ 60 ], expected.nsubmodes, 'returns expected number of subscript modes' );
- t.strictEqual( bytes[ 61 ], expected.submodes[ 0 ], 'returns expected submode' );
- t.strictEqual( bytes[ 65 ], expected.flags, 'returns expected flags' );
- }
- t.end();
-
- function hasSupport() {
- return false;
- }
-
- /* eslint-enable no-underscore-dangle */
-});
-
-tape( 'an ndarray has a protocol method for serializing meta data to a DataView (cached)', function test( t ) {
- /* eslint-disable no-underscore-dangle */
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var dv1;
- var dv2;
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- arr.__meta_dataview__ = null;
- dv1 = arr.__array_meta_dataview__();
- dv2 = arr.__array_meta_dataview__();
- arr.__meta_dataview__ = null;
-
- t.strictEqual( dv1, dv2, 'returns cached meta data' );
-
- t.end();
-
- /* eslint-enable no-underscore-dangle */
-});
-
-tape( 'an ndarray has a protocol method for serializing meta data to a DataView (cached)', function test( t ) {
- /* eslint-disable no-underscore-dangle */
- var ndarray;
- var strides;
- var buffer;
- var offset;
- var dtype;
- var order;
- var shape;
- var arr;
- var dv1;
- var dv2;
-
- ndarray = proxyquire( './../lib/main.js', {
- '@stdlib/assert-has-bigint-support': hasSupport
- });
-
- dtype = 'float64';
- buffer = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
- shape = [ 2, 2 ];
- order = 'row-major';
- strides = [ 2, 1 ];
- offset = 2;
-
- arr = ndarray( dtype, buffer, shape, strides, offset, order );
-
- arr.__meta_dataview__ = null;
- dv1 = arr.__array_meta_dataview__();
- dv2 = arr.__array_meta_dataview__();
- arr.__meta_dataview__ = null;
-
- t.strictEqual( dv1, dv2, 'returns cached meta data' );
-
- t.end();
-
- function hasSupport() {
- return false;
- }
-
- /* eslint-enable no-underscore-dangle */
-});