@stdlib/blas-ext-base-dsorthp 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>
+
 # dsorthp
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -199,9 +210,9 @@ console.log( x );
 
 ## See Also
 
--   <span class="package-name">[`@stdlib/blas/ext/base/dsort2hp`][@stdlib/blas/ext/base/dsort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two double-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/gsorthp`][@stdlib/blas/ext/base/gsorthp]</span><span class="delimiter">: </span><span class="description">sort a strided array using heapsort.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/ssorthp`][@stdlib/blas/ext/base/ssorthp]</span><span class="delimiter">: </span><span class="description">sort a single-precision floating-point strided array using heapsort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/dsort2hp`][@stdlib/blas/ext/base/dsort2hp]</span><span class="delimiter">: </span><span class="description">simultaneously sort two double-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/gsorthp`][@stdlib/blas/ext/base/gsorthp]</span><span class="delimiter">: </span><span class="description">sort a strided array using heapsort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/ssorthp`][@stdlib/blas/ext/base/ssorthp]</span><span class="delimiter">: </span><span class="description">sort a single-precision floating-point strided array using heapsort.</span>
 
 </section>
 
@@ -233,7 +244,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>
 
@@ -246,8 +257,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-dsorthp.svg
 [npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-dsorthp
 
-[test-image]: https://github.com/stdlib-js/blas-ext-base-dsorthp/actions/workflows/test.yml/badge.svg?branch=v0.0.10
-[test-url]: https://github.com/stdlib-js/blas-ext-base-dsorthp/actions/workflows/test.yml?query=branch:v0.0.10
+[test-image]: https://github.com/stdlib-js/blas-ext-base-dsorthp/actions/workflows/test.yml/badge.svg?branch=v0.2.0
+[test-url]: https://github.com/stdlib-js/blas-ext-base-dsorthp/actions/workflows/test.yml?query=branch:v0.2.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-dsorthp/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-dsorthp?branch=main
@@ -260,7 +271,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
 
@@ -270,8 +281,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-dsorthp/tree/deno
+[deno-readme]: https://github.com/stdlib-js/blas-ext-base-dsorthp/blob/deno/README.md
 [umd-url]: https://github.com/stdlib-js/blas-ext-base-dsorthp/tree/umd
+[umd-readme]: https://github.com/stdlib-js/blas-ext-base-dsorthp/blob/umd/README.md
 [esm-url]: https://github.com/stdlib-js/blas-ext-base-dsorthp/tree/esm
+[esm-readme]: https://github.com/stdlib-js/blas-ext-base-dsorthp/blob/esm/README.md
 [branches-url]: https://github.com/stdlib-js/blas-ext-base-dsorthp/blob/main/branches.md
 
 [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-dsorthp/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 dsorthp from '../docs/types/index';
+export = dsorthp;

package/dist/index.js

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

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/dsorthp.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* Sorts a double-precision floating-point strided 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 - input array\n* @param {integer} stride - index increment\n* @returns {Float64Array} input array\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*\n* dsorthp( x.length, 1.0, x, 1 );\n* // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*/\nfunction dsorthp( N, order, x, stride ) {\n\tvar offset;\n\tvar parent;\n\tvar child;\n\tvar v1;\n\tvar v2;\n\tvar n;\n\tvar t;\n\tvar i;\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\tstride *= -1;\n\t}\n\tif ( stride < 0 ) {\n\t\toffset = (1-N) * stride;\n\t} else {\n\t\toffset = 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\tt = x[ offset+(parent*stride) ];\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\ti = offset + (n*stride);\n\t\t\tt = x[ i ];\n\n\t\t\t// Move the heap root to its sorted position:\n\t\t\tx[ i ] = x[ offset ];\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[ offset+(k*stride) ];\n\t\t\t\tv2 = x[ offset+(child*stride) ];\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[ offset+(child*stride) ];\n\t\t\tif ( v1 > t || isnan( v1 ) || ( v1 === t && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t// Insert the larger child value:\n\t\t\t\tx[ offset+(j*stride) ] = v1;\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[ offset+(j*stride) ] = t;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsorthp;\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* Sorts a double-precision floating-point strided 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 - input array\n* @param {integer} stride - index increment\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float64Array} input array\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*\n* dsorthp( x.length, 1.0, x, 1, 0 );\n* // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*/\nfunction dsorthp( N, order, x, stride, offset ) {\n\tvar parent;\n\tvar child;\n\tvar v1;\n\tvar v2;\n\tvar n;\n\tvar t;\n\tvar i;\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\tstride *= -1;\n\t\toffset -= (N-1) * stride;\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\tt = x[ offset+(parent*stride) ];\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\ti = offset + (n*stride);\n\t\t\tt = x[ i ];\n\n\t\t\t// Move the heap root to its sorted position:\n\t\t\tx[ i ] = x[ offset ];\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[ offset+(k*stride) ];\n\t\t\t\tv2 = x[ offset+(child*stride) ];\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[ offset+(child*stride) ];\n\t\t\tif ( v1 > t || isnan( v1 ) || ( v1 === t && isPositiveZero( v1 ) ) ) { // eslint-disable-line max-len\n\t\t\t\t// Insert the larger child value:\n\t\t\t\tx[ offset+(j*stride) ] = v1;\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[ offset+(j*stride) ] = t;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsorthp;\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 dsorthp = require( './dsorthp.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( dsorthp, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = dsorthp;\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* Sort a double-precision floating-point strided array using heapsort.\n*\n* @module @stdlib/blas-ext-base-dsorthp\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dsorthp = require( '@stdlib/blas-ext-base-dsorthp' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n*\n* dsorthp( x.length, 1.0, x, 1 );\n* // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dsorthp = require( '@stdlib/blas-ext-base-dsorthp' );\n*\n* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );\n*\n* dsorthp.ndarray( x.length, 1.0, x, 1, 0 );\n* // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.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 dsorthp;\nvar tmp = tryRequire( join( __dirname, './native.js' ) );\nif ( isError( tmp ) ) {\n\tdsorthp = main;\n} else {\n\tdsorthp = tmp;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsorthp;\n\n// exports: { \"ndarray\": \"dsorthp.ndarray\" }\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EACnDC,EAAQ,QAAS,iCAAkC,EA+BvD,SAASC,EAASC,EAAGC,EAAOC,EAAGC,EAAS,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKb,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAkBR,IAfKD,EAAQ,IACZE,GAAU,IAENA,EAAS,EACbC,GAAU,EAAEJ,GAAKG,EAEjBC,EAAS,EAGVK,EAAIT,EAGJK,EAASP,EAAOE,EAAI,CAAE,IAGP,CACd,GAAKK,EAAS,EAEbA,GAAU,EACVK,EAAIR,EAAGE,EAAQC,EAAOF,CAAQ,MACxB,CAKN,GAHAM,GAAK,EAGAA,IAAM,EACV,OAAOP,EAGRS,EAAIP,EAAUK,EAAEN,EAChBO,EAAIR,EAAGS,CAAE,EAGTT,EAAGS,CAAE,EAAIT,EAAGE,CAAO,CACpB,CASA,IALAQ,EAAIP,EAGJC,EAASM,EAAE,EAAK,EAERN,EAAQG,IAEfI,EAAIP,EAAQ,EACPO,EAAIJ,IACRF,EAAKL,EAAGE,EAAQS,EAAEV,CAAQ,EAC1BK,EAAKN,EAAGE,EAAQE,EAAMH,CAAQ,GAGzBI,EAAKC,GAAMX,EAAOU,CAAG,GAAMA,IAAOC,GAAMZ,EAAgBW,CAAG,KAC/DD,GAAS,IAIXC,EAAKL,EAAGE,EAAQE,EAAMH,CAAQ,EACzBI,EAAKG,GAAKb,EAAOU,CAAG,GAAOA,IAAOG,GAAKd,EAAgBW,CAAG,IAE9DL,EAAGE,EAAQQ,EAAET,CAAQ,EAAII,EAGzBK,EAAIN,EAGJA,EAASM,EAAE,EAAK,EAOlBV,EAAGE,EAAQQ,EAAET,CAAQ,EAAIO,CAC1B,CACD,CAKAf,EAAO,QAAUI,ICtJjB,IAAAe,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EACnDC,EAAQ,QAAS,iCAAkC,EAgCvD,SAASC,EAASC,EAAGC,EAAOC,EAAGC,EAAQC,EAAS,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKb,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAcR,IAXKD,EAAQ,IACZE,GAAU,GACVC,IAAWJ,EAAE,GAAKG,GAGnBM,EAAIT,EAGJK,EAASP,EAAOE,EAAI,CAAE,IAGP,CACd,GAAKK,EAAS,EAEbA,GAAU,EACVK,EAAIR,EAAGE,EAAQC,EAAOF,CAAQ,MACxB,CAKN,GAHAM,GAAK,EAGAA,IAAM,EACV,OAAOP,EAGRS,EAAIP,EAAUK,EAAEN,EAChBO,EAAIR,EAAGS,CAAE,EAGTT,EAAGS,CAAE,EAAIT,EAAGE,CAAO,CACpB,CASA,IALAQ,EAAIP,EAGJC,EAASM,EAAE,EAAK,EAERN,EAAQG,IAEfI,EAAIP,EAAQ,EACPO,EAAIJ,IACRF,EAAKL,EAAGE,EAAQS,EAAEV,CAAQ,EAC1BK,EAAKN,EAAGE,EAAQE,EAAMH,CAAQ,GAGzBI,EAAKC,GAAMX,EAAOU,CAAG,GAAMA,IAAOC,GAAMZ,EAAgBW,CAAG,KAC/DD,GAAS,IAIXC,EAAKL,EAAGE,EAAQE,EAAMH,CAAQ,EACzBI,EAAKG,GAAKb,EAAOU,CAAG,GAAOA,IAAOG,GAAKd,EAAgBW,CAAG,IAE9DL,EAAGE,EAAQQ,EAAET,CAAQ,EAAII,EAGzBK,EAAIN,EAGJA,EAASM,EAAE,EAAK,EAOlBV,EAAGE,EAAQQ,EAAET,CAAQ,EAAIO,CAC1B,CACD,CAKAf,EAAO,QAAUI,IClJjB,IAAAe,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAc,QAAS,uDAAwD,EAC/EC,EAAU,IACVC,EAAU,IAKdF,EAAaC,EAAS,UAAWC,CAAQ,EAKzCH,EAAO,QAAUE,ICYjB,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,EAAUD,EAEVC,EAAUC,EAMX,OAAO,QAAUD",
+  "names": ["require_dsorthp", "__commonJSMin", "exports", "module", "isPositiveZero", "isnan", "floor", "dsorthp", "N", "order", "x", "stride", "offset", "parent", "child", "v1", "v2", "n", "t", "i", "j", "k", "require_ndarray", "__commonJSMin", "exports", "module", "isPositiveZero", "isnan", "floor", "dsorthp", "N", "order", "x", "stride", "offset", "parent", "child", "v1", "v2", "n", "t", "i", "j", "k", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "dsorthp", "ndarray", "join", "tryRequire", "isError", "main", "dsorthp", "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 `dsorthp`.
@@ -32,7 +32,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 ] );
 	*
@@ -52,14 +52,14 @@ 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 ] );
 	*
 	* dsorthp.ndarray( x.length, 1, x, 1, 0 );
 	* // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
 	*/
-	ndarray( N: number, order: number, x: Float64Array, stride: number, offset: number ): Float64Array; // tslint:disable-line:max-line-length
+	ndarray( N: number, order: number, x: Float64Array, stride: number, offset: number ): Float64Array;
 }
 
 /**
@@ -72,7 +72,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 ] );
 *
@@ -80,7 +80,7 @@ interface Routine {
 * // x => <Float64Array>[ -4.0, -2.0, 1.0, 3.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 ] );
 *

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/blas-ext-base-dsorthp",
-  "version": "0.0.10",
+  "version": "0.2.0",
   "description": "Sort a double-precision floating-point strided array using heapsort.",
   "license": "Apache-2.0",
   "author": {
@@ -41,29 +41,30 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/assert-is-error": "^0.0.x",
-    "@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",
@@ -102,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,118 +0,0 @@
-
-{{alias}}( N, order, x, stride )
-    Sorts a double-precision floating-point strided array using heapsort.
-
-    The `N` and `stride` parameters determine which elements in `x` 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 returns `x` 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 array is sorted *in-place* (i.e., the input strided array
-    is *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
-        Input array.
-
-    stride: integer
-        Index increment for `x`.
-
-    Returns
-    -------
-    x: Float64Array
-        Input array `x`.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > {{alias}}( x.length, 1, x, 1 )
-    <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
-
-    // Using `N` and `stride` parameters:
-    > x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > {{alias}}( N, -1, x, 2 )
-    <Float64Array>[ 3.0, -2.0, 1.0, -4.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 );
-    > N = {{alias:@stdlib/math/base/special/floor}}( x0.length / 2 );
-    > {{alias}}( N, 1, x1, 2 )
-    <Float64Array>[ -4.0, 3.0, -2.0 ]
-    > x0
-    <Float64Array>[ 1.0, -4.0, 3.0, -2.0 ]
-
-{{alias}}.ndarray( N, order, x, stride, offset )
-    Sorts a double-precision floating-point strided 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
-        Input array.
-
-    stride: integer
-        Index increment for `x`.
-
-    offset: integer
-        Starting index of `x`.
-
-    Returns
-    -------
-    x: Float64Array
-        Input array `x`.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > {{alias}}.ndarray( x.length, 1, x, 1, 0 )
-    <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
-
-    // Using an index offset:
-    > x = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, -4.0 ] );
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > {{alias}}.ndarray( N, 1, x, 2, 1 )
-    <Float64Array>[ 1.0, -4.0, 3.0, -2.0 ]
-
-    See Also
-    --------
-

package/docs/types/test.ts

@@ -1,187 +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 dsorthp = require( './index' );
-
-
-// TESTS //
-
-// The function returns a Float64Array...
-{
-	const x = new Float64Array( 10 );
-
-	dsorthp( x.length, 1, x, 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 );
-
-	dsorthp( '10', 1, x, 1 ); // $ExpectError
-	dsorthp( true, 1, x, 1 ); // $ExpectError
-	dsorthp( false, 1, x, 1 ); // $ExpectError
-	dsorthp( null, 1, x, 1 ); // $ExpectError
-	dsorthp( undefined, 1, x, 1 ); // $ExpectError
-	dsorthp( [], 1, x, 1 ); // $ExpectError
-	dsorthp( {}, 1, x, 1 ); // $ExpectError
-	dsorthp( ( x: number ): number => x, 1, x, 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 );
-
-	dsorthp( x.length, '10', x, 1 ); // $ExpectError
-	dsorthp( x.length, true, x, 1 ); // $ExpectError
-	dsorthp( x.length, false, x, 1 ); // $ExpectError
-	dsorthp( x.length, null, x, 1 ); // $ExpectError
-	dsorthp( x.length, undefined, x, 1 ); // $ExpectError
-	dsorthp( x.length, [], x, 1 ); // $ExpectError
-	dsorthp( x.length, {}, x, 1 ); // $ExpectError
-	dsorthp( x.length, ( x: number ): number => x, x, 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 );
-
-	dsorthp( x.length, 1, 10, 1 ); // $ExpectError
-	dsorthp( x.length, 1, '10', 1 ); // $ExpectError
-	dsorthp( x.length, 1, true, 1 ); // $ExpectError
-	dsorthp( x.length, 1, false, 1 ); // $ExpectError
-	dsorthp( x.length, 1, null, 1 ); // $ExpectError
-	dsorthp( x.length, 1, undefined, 1 ); // $ExpectError
-	dsorthp( x.length, 1, [], 1 ); // $ExpectError
-	dsorthp( x.length, 1, {}, 1 ); // $ExpectError
-	dsorthp( x.length, 1, ( x: number ): number => x, 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 );
-
-	dsorthp( x.length, 1, x, '10' ); // $ExpectError
-	dsorthp( x.length, 1, x, true ); // $ExpectError
-	dsorthp( x.length, 1, x, false ); // $ExpectError
-	dsorthp( x.length, 1, x, null ); // $ExpectError
-	dsorthp( x.length, 1, x, undefined ); // $ExpectError
-	dsorthp( x.length, 1, x, [] ); // $ExpectError
-	dsorthp( x.length, 1, x, {} ); // $ExpectError
-	dsorthp( x.length, 1, x, ( 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 );
-
-	dsorthp(); // $ExpectError
-	dsorthp( x.length ); // $ExpectError
-	dsorthp( x.length, 1 ); // $ExpectError
-	dsorthp( x.length, 1, x ); // $ExpectError
-	dsorthp( x.length, 1, x, 1, 10 ); // $ExpectError
-}
-
-// Attached to main export is an `ndarray` method which returns a Float64Array...
-{
-	const x = new Float64Array( 10 );
-
-	dsorthp.ndarray( x.length, 1, x, 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 );
-
-	dsorthp.ndarray( '10', 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( true, 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( false, 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( null, 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( undefined, 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( [], 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( {}, 1, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( ( x: number ): number => x, 1, x, 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 );
-
-	dsorthp.ndarray( x.length, '10', x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, true, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, false, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, null, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, undefined, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, [], x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, {}, x, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, ( x: number ): number => x, x, 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 );
-
-	dsorthp.ndarray( x.length, 1, 10, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, '10', 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, true, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, false, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, null, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, undefined, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, [], 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, {}, 1, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, ( x: number ): number => x, 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 );
-
-	dsorthp.ndarray( x.length, 1, x, '10', 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, true, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, false, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, null, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, undefined, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, [], 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, {}, 0 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, ( x: number ): number => x, 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 );
-
-	dsorthp.ndarray( x.length, 1, x, 1, '10' ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, true ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, false ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, null ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, undefined ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, [] ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, {} ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 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 );
-
-	dsorthp.ndarray(); // $ExpectError
-	dsorthp.ndarray( x.length ); // $ExpectError
-	dsorthp.ndarray( x.length, 1 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1 ); // $ExpectError
-	dsorthp.ndarray( x.length, 1, x, 1, 0, 10 ); // $ExpectError
-}