@stdlib/blas-ext-base-dsort2hp 0.0.10 → 0.2.0

package/NOTICE

@@ -1 +1 @@
-Copyright (c) 2016-2022 The Stdlib Authors.
+Copyright (c) 2016-2024 The Stdlib Authors.

package/README.md

@@ -18,6 +18,17 @@ limitations under the License.
 
 -->
 
+
+<details>
+  <summary>
+    About stdlib...
+  </summary>
+  <p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
+  <p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
+  <p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
+  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
+</details>
+
 # dsort2hp
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -238,9 +249,9 @@ console.log( y );
 
 ## See Also
 
--   <span class="package-name">[`@stdlib/blas/ext/base/dsorthp`][@stdlib/blas/ext/base/dsorthp]</span><span class="delimiter">: </span><span class="description">sort a double-precision floating-point strided array using heapsort.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gsort2hp`][@stdlib/blas/ext/base/gsort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two strided arrays based on the sort order of the first array using heapsort.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/ssort2hp`][@stdlib/blas/ext/base/ssort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/dsorthp`][@stdlib/blas/ext/base/dsorthp]</span><span class="delimiter">: </span><span class="description">sort a double-precision floating-point strided array using heapsort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gsort2hp`][@stdlib/blas/ext/base/gsort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two strided arrays based on the sort order of the first array using heapsort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/ssort2hp`][@stdlib/blas/ext/base/ssort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.</span>
 
 </section>
 
@@ -272,7 +283,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -285,8 +296,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-dsort2hp.svg
 [npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-dsort2hp
 
-[test-image]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/actions/workflows/test.yml/badge.svg?branch=v0.0.10
-[test-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/actions/workflows/test.yml?query=branch:v0.0.10
+[test-image]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/actions/workflows/test.yml/badge.svg?branch=v0.2.0
+[test-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/actions/workflows/test.yml?query=branch:v0.2.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-dsort2hp/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-dsort2hp?branch=main
@@ -299,7 +310,7 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 -->
 
 [chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
-[chat-url]: https://gitter.im/stdlib-js/stdlib/
+[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im
 
 [stdlib]: https://github.com/stdlib-js/stdlib
 
@@ -309,8 +320,11 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
 
 [deno-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/tree/deno
+[deno-readme]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/blob/deno/README.md
 [umd-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/tree/umd
+[umd-readme]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/blob/umd/README.md
 [esm-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/tree/esm
+[esm-readme]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/blob/esm/README.md
 [branches-url]: https://github.com/stdlib-js/blas-ext-base-dsort2hp/blob/main/branches.md
 
 [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-dsort2hp/main/LICENSE

package/SECURITY.md

@@ -0,0 +1,5 @@
+# Security
+
+> Policy for reporting security vulnerabilities.
+
+See the security policy [in the main project repository](https://github.com/stdlib-js/stdlib/security).

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+/// <reference path="../docs/types/index.d.ts" />
+import dsort2hp from '../docs/types/index';
+export = dsort2hp;

package/dist/index.js

@@ -0,0 +1,9 @@
+"use strict";var R=function(h,j){return function(){return j||h((j={exports:{}}).exports,j),j.exports}};var g=R(function($,O){
+var _=require('@stdlib/math-base-assert-is-positive-zero/dist'),E=require('@stdlib/math-base-assert-is-nan/dist'),I=require('@stdlib/math-base-special-floor/dist');function J(h,j,r,v,u,l){var e,q,c,i,a,k,o,w,m,b,p,n,P;if(h<=0||j===0)return r;for(j<0&&(v*=-1,l*=-1),v<0?e=(1-h)*v:e=0,l<0?q=(1-h)*l:q=0,p=h,c=I(h/2);;){if(c>0)c-=1,o=r[e+c*v],w=u[q+c*l];else{if(p-=1,p===0)return r;m=e+p*v,o=r[m],b=q+p*l,w=u[b],r[m]=r[e],u[b]=u[q]}for(n=c,i=n*2+1;i<p&&(P=i+1,P<p&&(a=r[e+P*v],k=r[e+i*v],(a>k||E(a)||a===k&&_(a))&&(i+=1)),a=r[e+i*v],a>o||E(a)||a===o&&_(a));)r[e+n*v]=a,u[q+n*l]=u[q+i*l],n=i,i=n*2+1;r[e+n*v]=o,u[q+n*l]=w}}O.exports=J
+});var C=R(function(f,B){
+var z=require('@stdlib/math-base-assert-is-positive-zero/dist'),A=require('@stdlib/math-base-assert-is-nan/dist'),K=require('@stdlib/math-base-special-floor/dist');function L(h,j,r,v,u,l,e,q){var c,i,a,k,o,w,m,b,p,n,P;if(h<=0||j===0)return r;for(j<0&&(v*=-1,e*=-1,u-=(h-1)*v,q-=(h-1)*e),p=h,c=K(h/2);;){if(c>0)c-=1,o=r[u+c*v],w=l[q+c*e];else{if(p-=1,p===0)return r;m=u+p*v,o=r[m],b=q+p*e,w=l[b],r[m]=r[u],l[b]=l[q]}for(n=c,i=n*2+1;i<p&&(P=i+1,P<p&&(a=r[u+P*v],k=r[u+i*v],(a>k||A(a)||a===k&&z(a))&&(i+=1)),a=r[u+i*v],a>o||A(a)||a===o&&z(a));)r[u+n*v]=a,l[q+n*e]=l[q+i*e],n=i,i=n*2+1;r[u+n*v]=o,l[q+n*e]=w}}B.exports=L
+});var G=R(function(y,F){
+var M=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),D=g(),Q=C();M(D,"ndarray",Q);F.exports=D
+});var S=require("path").join,T=require('@stdlib/utils-try-require/dist'),U=require('@stdlib/assert-is-error/dist'),V=G(),Z,H=T(S(__dirname,"./native.js"));U(H)?Z=V:Z=H;module.exports=Z;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/dsort2hp.js", "../lib/ndarray.js", "../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar floor = require( '@stdlib/math-base-special-floor' );\n\n\n// MAIN //\n\n/**\n* Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.\n*\n* ## Notes\n*\n* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).\n*\n* ## References\n*\n* -   Williams, John William Joseph. 1964. \"Algorithm 232: Heapsort.\" _Communications of the ACM_ 7 (6). New York, NY, USA: Association for Computing Machinery: 347\u201349. doi:[10.1145/512274.512284](https://doi.org/10.1145/512274.512284).\n* -   Floyd, Robert W. 1964. \"Algorithm 245: Treesort.\" _Communications of the ACM_ 7 (12). New York, NY, USA: Association for Computing Machinery: 701. doi:[10.1145/355588.365103](https://doi.org/10.1145/355588.365103).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} order - sort order\n* @param {Float64Array} x - first input array\n* @param {integer} strideX - `x` index increment\n* @param {Float64Array} y - second input array\n* @param {integer} strideY - `y` index increment\n* @returns {Float64Array} `x`\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );\n*\n* dsort2hp( x.length, 1.0, x, 1, y, 1 );\n*\n* console.log( x );\n* // => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*\n* console.log( y );\n* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]\n*/\nfunction dsort2hp( N, order, x, strideX, y, strideY ) {\n\tvar offsetX;\n\tvar offsetY;\n\tvar parent;\n\tvar child;\n\tvar v1;\n\tvar v2;\n\tvar tx;\n\tvar ty;\n\tvar ix;\n\tvar iy;\n\tvar n;\n\tvar j;\n\tvar k;\n\n\tif ( N <= 0 || order === 0.0 ) {\n\t\treturn x;\n\t}\n\t// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...\n\tif ( order < 0.0 ) {\n\t\tstrideX *= -1;\n\t\tstrideY *= -1;\n\t}\n\tif ( strideX < 0 ) {\n\t\toffsetX = (1-N) * strideX;\n\t} else {\n\t\toffsetX = 0;\n\t}\n\tif ( strideY < 0 ) {\n\t\toffsetY = (1-N) * strideY;\n\t} else {\n\t\toffsetY = 0;\n\t}\n\t// Set the initial heap size:\n\tn = N;\n\n\t// Specify an initial \"parent\" index for building the heap:\n\tparent = floor( N / 2 );\n\n\t// Continue looping until the array is sorted...\n\twhile ( true ) {\n\t\tif ( parent > 0 ) {\n\t\t\t// We need to build the heap...\n\t\t\tparent -= 1;\n\t\t\ttx = x[ offsetX+(parent*strideX) ];\n\t\t\tty = y[ offsetY+(parent*strideY) ];\n\t\t} else {\n\t\t\t// Reduce the heap size:\n\t\t\tn -= 1;\n\n\t\t\t// Check if the heap is empty, and, if so, we are finished sorting...\n\t\t\tif ( n === 0 ) {\n\t\t\t\treturn x;\n\t\t\t}\n\t\t\t// Store the last heap value in a temporary variable in order to make room for the heap root being placed into its sorted position:\n\t\t\tix = offsetX + (n*strideX);\n\t\t\ttx = x[ ix ];\n\t\t\tiy = offsetY + (n*strideY);\n\t\t\tty = y[ iy ];\n\n\t\t\t// Move the heap root to its sorted position:\n\t\t\tx[ ix ] = x[ offsetX ];\n\t\t\ty[ iy ] = y[ offsetY ];\n\t\t}\n\t\t// We need to \"sift down\", pushing `t` down the heap to in order to replace the parent and satisfy the heap property...\n\n\t\t// Start at the parent index:\n\t\tj = parent;\n\n\t\t// Get the \"left\" child index:\n\t\tchild = (j*2) + 1;\n\n\t\twhile ( child < n ) {\n\t\t\t// Find the largest child...\n\t\t\tk = child + 1;\n\t\t\tif ( k < n ) {\n\t\t\t\tv1 = x[ offsetX+(k*strideX) ];\n\t\t\t\tv2 = x[ offsetX+(child*strideX) ];\n\n\t\t\t\t// Check if a \"right\" child exists and is \"bigger\"...\n\t\t\t\tif ( v1 > v2 || isnan( v1 ) || (v1 === v2 && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t\tchild += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Check if the largest child is bigger than `t`...\n\t\t\tv1 = x[ offsetX+(child*strideX) ];\n\t\t\tif ( v1 > tx || isnan( v1 ) || ( v1 === tx && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t// Insert the larger child value:\n\t\t\t\tx[ offsetX+(j*strideX) ] = v1;\n\t\t\t\ty[ offsetY+(j*strideY) ] = y[ offsetY+(child*strideY) ];\n\n\t\t\t\t// Update `j` to point to the child index:\n\t\t\t\tj = child;\n\n\t\t\t\t// Get the \"left\" child index and repeat...\n\t\t\t\tchild = (j*2) + 1;\n\t\t\t} else {\n\t\t\t\t// We've found `t`'s place in the heap...\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Insert `t` into the heap:\n\t\tx[ offsetX+(j*strideX) ] = tx;\n\t\ty[ offsetY+(j*strideY) ] = ty;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2hp;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar floor = require( '@stdlib/math-base-special-floor' );\n\n\n// MAIN //\n\n/**\n* Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.\n*\n* ## Notes\n*\n* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).\n*\n* ## References\n*\n* -   Williams, John William Joseph. 1964. \"Algorithm 232: Heapsort.\" _Communications of the ACM_ 7 (6). New York, NY, USA: Association for Computing Machinery: 347\u201349. doi:[10.1145/512274.512284](https://doi.org/10.1145/512274.512284).\n* -   Floyd, Robert W. 1964. \"Algorithm 245: Treesort.\" _Communications of the ACM_ 7 (12). New York, NY, USA: Association for Computing Machinery: 701. doi:[10.1145/355588.365103](https://doi.org/10.1145/355588.365103).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} order - sort order\n* @param {Float64Array} x - first input array\n* @param {integer} strideX - `x` index increment\n* @param {NonNegativeInteger} offsetX - `x` starting index\n* @param {Float64Array} y - second input array\n* @param {integer} strideY - `y` index increment\n* @param {NonNegativeInteger} offsetY - `y` starting index\n* @returns {Float64Array} `x`\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );\n*\n* dsort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 );\n*\n* console.log( x );\n* // => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*\n* console.log( y );\n* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]\n*/\nfunction dsort2hp( N, order, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar parent;\n\tvar child;\n\tvar v1;\n\tvar v2;\n\tvar tx;\n\tvar ty;\n\tvar ix;\n\tvar iy;\n\tvar n;\n\tvar j;\n\tvar k;\n\n\tif ( N <= 0 || order === 0.0 ) {\n\t\treturn x;\n\t}\n\t// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...\n\tif ( order < 0.0 ) {\n\t\tstrideX *= -1;\n\t\tstrideY *= -1;\n\t\toffsetX -= (N-1) * strideX;\n\t\toffsetY -= (N-1) * strideY;\n\t}\n\t// Set the initial heap size:\n\tn = N;\n\n\t// Specify an initial \"parent\" index for building the heap:\n\tparent = floor( N / 2 );\n\n\t// Continue looping until the array is sorted...\n\twhile ( true ) {\n\t\tif ( parent > 0 ) {\n\t\t\t// We need to build the heap...\n\t\t\tparent -= 1;\n\t\t\ttx = x[ offsetX+(parent*strideX) ];\n\t\t\tty = y[ offsetY+(parent*strideY) ];\n\t\t} else {\n\t\t\t// Reduce the heap size:\n\t\t\tn -= 1;\n\n\t\t\t// Check if the heap is empty, and, if so, we are finished sorting...\n\t\t\tif ( n === 0 ) {\n\t\t\t\treturn x;\n\t\t\t}\n\t\t\t// Store the last heap value in a temporary variable in order to make room for the heap root being placed into its sorted position:\n\t\t\tix = offsetX + (n*strideX);\n\t\t\ttx = x[ ix ];\n\t\t\tiy = offsetY + (n*strideY);\n\t\t\tty = y[ iy ];\n\n\t\t\t// Move the heap root to its sorted position:\n\t\t\tx[ ix ] = x[ offsetX ];\n\t\t\ty[ iy ] = y[ offsetY ];\n\t\t}\n\t\t// We need to \"sift down\", pushing `t` down the heap to in order to replace the parent and satisfy the heap property...\n\n\t\t// Start at the parent index:\n\t\tj = parent;\n\n\t\t// Get the \"left\" child index:\n\t\tchild = (j*2) + 1;\n\n\t\twhile ( child < n ) {\n\t\t\t// Find the largest child...\n\t\t\tk = child + 1;\n\t\t\tif ( k < n ) {\n\t\t\t\tv1 = x[ offsetX+(k*strideX) ];\n\t\t\t\tv2 = x[ offsetX+(child*strideX) ];\n\n\t\t\t\t// Check if a \"right\" child exists and is \"bigger\"...\n\t\t\t\tif ( v1 > v2 || isnan( v1 ) || (v1 === v2 && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t\tchild += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Check if the largest child is bigger than `t`...\n\t\t\tv1 = x[ offsetX+(child*strideX) ];\n\t\t\tif ( v1 > tx || isnan( v1 ) || ( v1 === tx && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t// Insert the larger child value:\n\t\t\t\tx[ offsetX+(j*strideX) ] = v1;\n\t\t\t\ty[ offsetY+(j*strideY) ] = y[ offsetY+(child*strideY) ];\n\n\t\t\t\t// Update `j` to point to the child index:\n\t\t\t\tj = child;\n\n\t\t\t\t// Get the \"left\" child index and repeat...\n\t\t\t\tchild = (j*2) + 1;\n\t\t\t} else {\n\t\t\t\t// We've found `t`'s place in the heap...\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Insert `t` into the heap:\n\t\tx[ offsetX+(j*strideX) ] = tx;\n\t\ty[ offsetY+(j*strideY) ] = ty;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2hp;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar dsort2hp = require( './dsort2hp.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( dsort2hp, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = dsort2hp;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.\n*\n* @module @stdlib/blas-ext-base-dsort2hp\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dsort2hp = require( '@stdlib/blas-ext-base-dsort2hp' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );\n*\n* dsort2hp( x.length, 1.0, x, 1, y, 1 );\n*\n* console.log( x );\n* // => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*\n* console.log( y );\n* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dsort2hp = require( '@stdlib/blas-ext-base-dsort2hp' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );\n*\n* dsort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 );\n*\n* console.log( x );\n* // => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*\n* console.log( y );\n* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]\n*/\n\n// MODULES //\n\nvar join = require( 'path' ).join;\nvar tryRequire = require( '@stdlib/utils-try-require' );\nvar isError = require( '@stdlib/assert-is-error' );\nvar main = require( './main.js' );\n\n\n// MAIN //\n\nvar dsort2hp;\nvar tmp = tryRequire( join( __dirname, './native.js' ) );\nif ( isError( tmp ) ) {\n\tdsort2hp = main;\n} else {\n\tdsort2hp = tmp;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2hp;\n\n// exports: { \"ndarray\": \"dsort2hp.ndarray\" }\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EACnDC,EAAQ,QAAS,iCAAkC,EAuCvD,SAASC,EAAUC,EAAGC,EAAOC,EAAGC,EAASC,EAAGC,EAAU,CACrD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKlB,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAwBR,IArBKD,EAAQ,IACZE,GAAW,GACXE,GAAW,IAEPF,EAAU,EACdG,GAAW,EAAEN,GAAKG,EAElBG,EAAU,EAEND,EAAU,EACdE,GAAW,EAAEP,GAAKK,EAElBE,EAAU,EAGXS,EAAIhB,EAGJQ,EAASV,EAAOE,EAAI,CAAE,IAGP,CACd,GAAKQ,EAAS,EAEbA,GAAU,EACVI,EAAKV,EAAGI,EAASE,EAAOL,CAAS,EACjCU,EAAKT,EAAGG,EAASC,EAAOH,CAAS,MAC3B,CAKN,GAHAW,GAAK,EAGAA,IAAM,EACV,OAAOd,EAGRY,EAAKR,EAAWU,EAAEb,EAClBS,EAAKV,EAAGY,CAAG,EACXC,EAAKR,EAAWS,EAAEX,EAClBQ,EAAKT,EAAGW,CAAG,EAGXb,EAAGY,CAAG,EAAIZ,EAAGI,CAAQ,EACrBF,EAAGW,CAAG,EAAIX,EAAGG,CAAQ,CACtB,CASA,IALAU,EAAIT,EAGJC,EAASQ,EAAE,EAAK,EAERR,EAAQO,IAEfE,EAAIT,EAAQ,EACPS,EAAIF,IACRN,EAAKR,EAAGI,EAASY,EAAEf,CAAS,EAC5BQ,EAAKT,EAAGI,EAASG,EAAMN,CAAS,GAG3BO,EAAKC,GAAMd,EAAOa,CAAG,GAAMA,IAAOC,GAAMf,EAAgBc,CAAG,KAC/DD,GAAS,IAIXC,EAAKR,EAAGI,EAASG,EAAMN,CAAS,EAC3BO,EAAKE,GAAMf,EAAOa,CAAG,GAAOA,IAAOE,GAAMhB,EAAgBc,CAAG,IAEhER,EAAGI,EAASW,EAAEd,CAAS,EAAIO,EAC3BN,EAAGG,EAASU,EAAEZ,CAAS,EAAID,EAAGG,EAASE,EAAMJ,CAAS,EAGtDY,EAAIR,EAGJA,EAASQ,EAAE,EAAK,EAOlBf,EAAGI,EAASW,EAAEd,CAAS,EAAIS,EAC3BR,EAAGG,EAASU,EAAEZ,CAAS,EAAIQ,CAC5B,CACD,CAKAlB,EAAO,QAAUI,IC7KjB,IAAAoB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EACnDC,EAAQ,QAAS,iCAAkC,EAyCvD,SAASC,EAAUC,EAAGC,EAAOC,EAAGC,EAASC,EAASC,EAAGC,EAASC,EAAU,CACvE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKlB,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAgBR,IAbKD,EAAQ,IACZE,GAAW,GACXG,GAAW,GACXF,IAAYJ,EAAE,GAAKG,EACnBI,IAAYP,EAAE,GAAKM,GAGpBU,EAAIhB,EAGJQ,EAASV,EAAOE,EAAI,CAAE,IAGP,CACd,GAAKQ,EAAS,EAEbA,GAAU,EACVI,EAAKV,EAAGE,EAASI,EAAOL,CAAS,EACjCU,EAAKR,EAAGE,EAASC,EAAOF,CAAS,MAC3B,CAKN,GAHAU,GAAK,EAGAA,IAAM,EACV,OAAOd,EAGRY,EAAKV,EAAWY,EAAEb,EAClBS,EAAKV,EAAGY,CAAG,EACXC,EAAKR,EAAWS,EAAEV,EAClBO,EAAKR,EAAGU,CAAG,EAGXb,EAAGY,CAAG,EAAIZ,EAAGE,CAAQ,EACrBC,EAAGU,CAAG,EAAIV,EAAGE,CAAQ,CACtB,CASA,IALAU,EAAIT,EAGJC,EAASQ,EAAE,EAAK,EAERR,EAAQO,IAEfE,EAAIT,EAAQ,EACPS,EAAIF,IACRN,EAAKR,EAAGE,EAASc,EAAEf,CAAS,EAC5BQ,EAAKT,EAAGE,EAASK,EAAMN,CAAS,GAG3BO,EAAKC,GAAMd,EAAOa,CAAG,GAAMA,IAAOC,GAAMf,EAAgBc,CAAG,KAC/DD,GAAS,IAIXC,EAAKR,EAAGE,EAASK,EAAMN,CAAS,EAC3BO,EAAKE,GAAMf,EAAOa,CAAG,GAAOA,IAAOE,GAAMhB,EAAgBc,CAAG,IAEhER,EAAGE,EAASa,EAAEd,CAAS,EAAIO,EAC3BL,EAAGE,EAASU,EAAEX,CAAS,EAAID,EAAGE,EAASE,EAAMH,CAAS,EAGtDW,EAAIR,EAGJA,EAASQ,EAAE,EAAK,EAOlBf,EAAGE,EAASa,EAAEd,CAAS,EAAIS,EAC3BP,EAAGE,EAASU,EAAEX,CAAS,EAAIO,CAC5B,CACD,CAKAlB,EAAO,QAAUI,ICrKjB,IAAAoB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAc,QAAS,uDAAwD,EAC/EC,EAAW,IACXC,EAAU,IAKdF,EAAaC,EAAU,UAAWC,CAAQ,EAK1CH,EAAO,QAAUE,ICwBjB,IAAIE,EAAO,QAAS,MAAO,EAAE,KACzBC,EAAa,QAAS,2BAA4B,EAClDC,EAAU,QAAS,yBAA0B,EAC7CC,EAAO,IAKPC,EACAC,EAAMJ,EAAYD,EAAM,UAAW,aAAc,CAAE,EAClDE,EAASG,CAAI,EACjBD,EAAWD,EAEXC,EAAWC,EAMZ,OAAO,QAAUD",
+  "names": ["require_dsort2hp", "__commonJSMin", "exports", "module", "isPositiveZero", "isnan", "floor", "dsort2hp", "N", "order", "x", "strideX", "y", "strideY", "offsetX", "offsetY", "parent", "child", "v1", "v2", "tx", "ty", "ix", "iy", "n", "j", "k", "require_ndarray", "__commonJSMin", "exports", "module", "isPositiveZero", "isnan", "floor", "dsort2hp", "N", "order", "x", "strideX", "offsetX", "y", "strideY", "offsetY", "parent", "child", "v1", "v2", "tx", "ty", "ix", "iy", "n", "j", "k", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "dsort2hp", "ndarray", "join", "tryRequire", "isError", "main", "dsort2hp", "tmp"]
+}

package/docs/types/index.d.ts

@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 
 /**
 * Interface describing `dsort2hp`.
@@ -34,7 +34,7 @@ interface Routine {
 	* @returns `x`
 	*
 	* @example
-	* var Float64Array = require( `@stdlib/array/float64` );
+	* var Float64Array = require( '@stdlib/array-float64' );
 	*
 	* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
 	* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
@@ -47,7 +47,7 @@ interface Routine {
 	* console.log( y );
 	* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
 	*/
-	( N: number, order: number, x: Float64Array, strideX: number, y: Float64Array, strideY: number ): Float64Array; // tslint:disable-line:max-line-length
+	( N: number, order: number, x: Float64Array, strideX: number, y: Float64Array, strideY: number ): Float64Array;
 
 	/**
 	* Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using heapsort and alternative indexing semantics.
@@ -63,7 +63,7 @@ interface Routine {
 	* @returns `x`
 	*
 	* @example
-	* var Float64Array = require( `@stdlib/array/float64` );
+	* var Float64Array = require( '@stdlib/array-float64' );
 	*
 	* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
 	* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
@@ -76,7 +76,7 @@ interface Routine {
 	* console.log( y );
 	* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
 	*/
-	ndarray( N: number, order: number, x: Float64Array, strideX: number, offsetX: number, y: Float64Array, strideY: number, offsetY: number ): Float64Array; // tslint:disable-line:max-line-length
+	ndarray( N: number, order: number, x: Float64Array, strideX: number, offsetX: number, y: Float64Array, strideY: number, offsetY: number ): Float64Array;
 }
 
 /**
@@ -91,7 +91,7 @@ interface Routine {
 * @returns `x`
 *
 * @example
-* var Float64Array = require( `@stdlib/array/float64` );
+* var Float64Array = require( '@stdlib/array-float64' );
 *
 * var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
 * var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
@@ -105,7 +105,7 @@ interface Routine {
 * // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
 *
 * @example
-* var Float64Array = require( `@stdlib/array/float64` );
+* var Float64Array = require( '@stdlib/array-float64' );
 *
 * var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
 * var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );

package/lib/index.js

@@ -58,6 +58,7 @@
 
 var join = require( 'path' ).join;
 var tryRequire = require( '@stdlib/utils-try-require' );
+var isError = require( '@stdlib/assert-is-error' );
 var main = require( './main.js' );
 
 
@@ -65,7 +66,7 @@ var main = require( './main.js' );
 
 var dsort2hp;
 var tmp = tryRequire( join( __dirname, './native.js' ) );
-if ( tmp instanceof Error ) {
+if ( isError( tmp ) ) {
 	dsort2hp = main;
 } else {
 	dsort2hp = tmp;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/blas-ext-base-dsort2hp",
-  "version": "0.0.10",
+  "version": "0.2.0",
   "description": "Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.",
   "license": "Apache-2.0",
   "author": {
@@ -41,28 +41,30 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/math-base-assert-is-nan": "^0.0.x",
-    "@stdlib/math-base-assert-is-positive-zero": "^0.0.x",
-    "@stdlib/math-base-special-floor": "^0.0.x",
-    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.0.x",
-    "@stdlib/utils-library-manifest": "^0.0.x",
-    "@stdlib/utils-try-require": "^0.0.x"
+    "@stdlib/assert-is-error": "^0.2.0",
+    "@stdlib/math-base-assert-is-nan": "^0.2.0",
+    "@stdlib/math-base-assert-is-positive-zero": "^0.2.0",
+    "@stdlib/math-base-special-floor": "^0.2.0",
+    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.0",
+    "@stdlib/utils-library-manifest": "^0.2.0",
+    "@stdlib/utils-try-require": "^0.2.0"
   },
   "devDependencies": {
-    "@stdlib/array-float64": "^0.0.x",
-    "@stdlib/assert-is-browser": "^0.0.x",
-    "@stdlib/bench": "^0.0.x",
-    "@stdlib/blas-base-dcopy": "^0.0.x",
-    "@stdlib/math-base-assert-is-negative-zero": "^0.0.x",
-    "@stdlib/math-base-special-pow": "^0.0.x",
-    "@stdlib/math-base-special-round": "^0.0.x",
-    "@stdlib/random-base-discrete-uniform": "^0.0.x",
-    "@stdlib/random-base-randu": "^0.0.x",
-    "@stdlib/random-base-uniform": "^0.0.x",
+    "@stdlib/array-float64": "^0.1.1",
+    "@stdlib/assert-is-browser": "^0.1.1",
+    "@stdlib/blas-base-dcopy": "^0.1.1",
+    "@stdlib/math-base-assert-is-negative-zero": "^0.1.1",
+    "@stdlib/math-base-special-pow": "^0.1.0",
+    "@stdlib/math-base-special-round": "^0.1.1",
+    "@stdlib/random-base-discrete-uniform": "^0.1.0",
+    "@stdlib/random-base-randu": "^0.1.0",
+    "@stdlib/random-base-uniform": "^0.1.0",
     "proxyquire": "^2.0.0",
     "tape": "git+https://github.com/kgryte/tape.git#fix/globby",
     "istanbul": "^0.4.1",
-    "tap-spec": "5.x.x"
+    "tap-min": "git+https://github.com/Planeshifter/tap-min.git",
+    "@stdlib/bench-harness": "^0.2.0",
+    "@stdlib/bench": "^0.3.1"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -101,7 +103,7 @@
   ],
   "__stdlib__": {},
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt

@@ -1,151 +0,0 @@
-
-{{alias}}( N, order, x, strideX, y, strideY )
-    Simultaneously sorts two double-precision floating-point strided arrays
-    based on the sort order of the first array using heapsort.
-
-    The `N` and `stride` parameters determine which elements in `x` and `y` are
-    accessed at runtime.
-
-    Indexing is relative to the first index. To introduce an offset, use typed
-    array views.
-
-    If `N <= 0` or `order == 0`, the function leaves `x` and `y` unchanged.
-
-    The algorithm distinguishes between `-0` and `+0`. When sorted in increasing
-    order, `-0` is sorted before `+0`. When sorted in decreasing order, `-0` is
-    sorted after `+0`.
-
-    The algorithm sorts `NaN` values to the end. When sorted in increasing
-    order, `NaN` values are sorted last. When sorted in decreasing order, `NaN`
-    values are sorted first.
-
-    The algorithm has space complexity O(1) and time complexity O(N log2 N).
-
-    The algorithm is *unstable*, meaning that the algorithm may change the order
-    of strided array elements which are equal or equivalent (e.g., `NaN`
-    values).
-
-    The input strided arrays are sorted *in-place* (i.e., the input strided
-    arrays are *mutated*).
-
-    Parameters
-    ----------
-    N: integer
-        Number of indexed elements.
-
-    order: number
-        Sort order. If `order < 0`, the function sorts `x` in decreasing order.
-        If `order > 0`, the function sorts `x` in increasing order.
-
-    x: Float64Array
-        First input array.
-
-    strideX: integer
-        Index increment for `x`.
-
-    y: Float64Array
-        Second input array.
-
-    strideY: integer
-        Index increment for `y`.
-
-    Returns
-    -------
-    x: Float64Array
-        Input array `x`.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > var y = new {{alias:@stdlib/array/float64}}( [ 0.0, 1.0, 2.0, 3.0 ] );
-    > {{alias}}( x.length, 1, x, 1, y, 1 )
-    <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
-    > y
-    <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
-
-    // Using `N` and `stride` parameters:
-    > x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > y = new {{alias:@stdlib/array/float64}}( [ 0.0, 1.0, 2.0, 3.0 ] );
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > {{alias}}( N, -1, x, 2, y, 2 )
-    <Float64Array>[ 3.0, -2.0, 1.0, -4.0 ]
-    > y
-    <Float64Array>[ 2.0, 1.0, 0.0, 3.0 ]
-
-    // Using view offsets:
-    > var x0 = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > var x1 = new {{alias:@stdlib/array/float64}}( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
-    > var y0 = new {{alias:@stdlib/array/float64}}( [ 0.0, 1.0, 2.0, 3.0 ] );
-    > var y1 = new {{alias:@stdlib/array/float64}}( y0.buffer, y0.BYTES_PER_ELEMENT*1 );
-    > N = {{alias:@stdlib/math/base/special/floor}}( x0.length / 2 );
-    > {{alias}}( N, 1, x1, 2, y1, 2 )
-    <Float64Array>[ -4.0, 3.0, -2.0 ]
-    > x0
-    <Float64Array>[ 1.0, -4.0, 3.0, -2.0 ]
-    > y0
-    <Float64Array>[ 0.0, 3.0, 2.0, 1.0 ]
-
-{{alias}}.ndarray( N, order, x, strideX, offsetX, y, strideY, offsetY )
-    Simultaneously sorts two double-precision floating-point strided arrays
-    based on the sort order of the first array using heapsort and alternative
-    indexing semantics.
-
-    While typed array views mandate a view offset based on the underlying
-    buffer, the `offset` parameter supports indexing semantics based on a
-    starting index.
-
-    Parameters
-    ----------
-    N: integer
-        Number of indexed elements.
-
-    order: number
-        Sort order. If `order < 0`, the function sorts `x` in decreasing order.
-        If `order > 0`, the function sorts `x` in increasing order.
-
-    x: Float64Array
-        First input array.
-
-    strideX: integer
-        Index increment for `x`.
-
-    offsetX: integer
-        Starting index of `x`.
-
-    y: Float64Array
-        Second input array.
-
-    strideY: integer
-        Index increment for `y`.
-
-    offsetY: integer
-        Starting index of `y`.
-
-    Returns
-    -------
-    x: Float64Array
-        Input array `x`.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > var y = new {{alias:@stdlib/array/float64}}( [ 0.0, 1.0, 2.0, 3.0 ] );
-    > {{alias}}.ndarray( x.length, 1, x, 1, 0, y, 1, 0 )
-    <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
-    > y
-    <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
-
-    // Using an index offset:
-    > x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > y = new {{alias:@stdlib/array/float64}}( [ 0.0, 1.0, 2.0, 3.0 ] );
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > {{alias}}.ndarray( N, 1, x, 2, 1, y, 2, 1 )
-    <Float64Array>[ 1.0, -4.0, 3.0, -2.0 ]
-    > y
-    <Float64Array>[ 0.0, 3.0, 2.0, 1.0 ]
-
-    See Also
-    --------
-

package/docs/types/test.ts

@@ -1,280 +0,0 @@
-/*
-* @license Apache-2.0
-*
-* Copyright (c) 2020 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-import dsort2hp = require( './index' );
-
-
-// TESTS //
-
-// The function returns a Float64Array...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( x.length, 1, x, 1, y, 1 ); // $ExpectType Float64Array
-}
-
-// The compiler throws an error if the function is provided a first argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( '10', 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( true, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( false, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( null, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( undefined, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( [], 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( {}, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( ( x: number ): number => x, 1, x, 1, y, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a second argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( x.length, '10', x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, true, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, false, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, null, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, undefined, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, [], x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, {}, x, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, ( x: number ): number => x, x, 1, y, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a third argument which is not a Float64Array...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( x.length, 1, 10, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, '10', 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, true, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, false, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, null, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, undefined, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, [], 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, {}, 1, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, ( x: number ): number => x, 1, y, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a fourth argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( x.length, 1, x, '10', y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, true, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, false, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, null, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, undefined, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, [], y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, {}, y, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, ( x: number ): number => x, y, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a fifth argument which is not a Float64Array...
-{
-	const x = new Float64Array( 10 );
-
-	dsort2hp( x.length, 1, x, 1, 10, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, '10', 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, true, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, false, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, null, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, undefined, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, [], 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, {}, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, ( x: number ): number => x, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a sixth argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp( x.length, 1, x, 1, y, '10' ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, true ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, false ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, null ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, undefined ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, [] ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, {} ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided an unsupported number of arguments...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp(); // $ExpectError
-	dsort2hp( x.length ); // $ExpectError
-	dsort2hp( x.length, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1 ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y ); // $ExpectError
-	dsort2hp( x.length, 1, x, 1, y, 1, 10 ); // $ExpectError
-}
-
-// Attached to main export is an `ndarray` method which returns a Float64Array...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, 0 ); // $ExpectType Float64Array
-}
-
-// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( '10', 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( true, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( false, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( null, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( undefined, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( [], 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( {}, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( ( x: number ): number => x, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a second argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, '10', x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, true, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, false, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, null, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, undefined, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, [], x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, {}, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, ( x: number ): number => x, x, 1, 0, y, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a third argument which is not a Float64Array...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, 10, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, '10', 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, true, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, false, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, null, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, undefined, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, [], 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, {}, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, ( x: number ): number => x, 1, 0, y, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a fourth argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, '10', 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, true, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, false, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, null, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, undefined, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, [], 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, {}, 0, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, ( x: number ): number => x, 0, y, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a fifth argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, 1, '10', y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, true, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, false, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, null, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, undefined, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, [], y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, {}, y, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, ( x: number ): number => x, y, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a sixth argument which is not a Float64Array...
-{
-	const x = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, 10, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, '10', 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, true, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, false, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, null, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, undefined, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, [], 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, {}, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, ( x: number ): number => x, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a seventh argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, '10', 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, true, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, false, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, null, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, undefined, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, [], 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, {}, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, ( x: number ): number => x, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided an eighth argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, '10' ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, true ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, false ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, null ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, undefined ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, [] ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, {} ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided an unsupported number of arguments...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2hp.ndarray(); // $ExpectError
-	dsort2hp.ndarray( x.length ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1 ); // $ExpectError
-	dsort2hp.ndarray( x.length, 1, x, 1, 0, y, 1, 0, 10 ); // $ExpectError
-}