@stdlib/blas-ext-base-dsort2ins 0.0.9 → 0.1.0

package/CITATION.cff

@@ -0,0 +1,30 @@
+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

package/NOTICE

@@ -1 +1 @@
-Copyright (c) 2016-2022 The Stdlib Authors.
+Copyright (c) 2016-2023 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>
+
 # dsort2ins
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -226,9 +237,9 @@ console.log( y );
 
 ## See Also
 
--   <span class="package-name">[`@stdlib/blas/ext/base/dsortins`][@stdlib/blas/ext/base/dsortins]</span><span class="delimiter">: </span><span class="description">sort a double-precision floating-point strided array using insertion sort.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gsort2ins`][@stdlib/blas/ext/base/gsort2ins]</span><span class="delimiter">: </span><span class="description">simultaneously sort two strided arrays based on the sort order of the first array using insertion sort.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/ssort2ins`][@stdlib/blas/ext/base/ssort2ins]</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 insertion sort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/dsortins`][@stdlib/blas/ext/base/dsortins]</span><span class="delimiter">: </span><span class="description">sort a double-precision floating-point strided array using insertion sort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gsort2ins`][@stdlib/blas/ext/base/gsort2ins]</span><span class="delimiter">: </span><span class="description">simultaneously sort two strided arrays based on the sort order of the first array using insertion sort.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/ssort2ins`][@stdlib/blas/ext/base/ssort2ins]</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 insertion sort.</span>
 
 </section>
 
@@ -260,7 +271,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2023. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -273,8 +284,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-dsort2ins.svg
 [npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-dsort2ins
 
-[test-image]: https://github.com/stdlib-js/blas-ext-base-dsort2ins/actions/workflows/test.yml/badge.svg?branch=v0.0.9
-[test-url]: https://github.com/stdlib-js/blas-ext-base-dsort2ins/actions/workflows/test.yml?query=branch:v0.0.9
+[test-image]: https://github.com/stdlib-js/blas-ext-base-dsort2ins/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/blas-ext-base-dsort2ins/actions/workflows/test.yml?query=branch:v0.1.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-dsort2ins/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-dsort2ins?branch=main
@@ -287,7 +298,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
 

package/dist/index.d.ts

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

package/dist/index.js

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

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/dsort2ins.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 isNegativeZero = require( '@stdlib/math-base-assert-is-negative-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\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 insertion sort.\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* dsort2ins( 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 dsort2ins( N, order, x, strideX, y, strideY ) {\n\tvar flg;\n\tvar ix;\n\tvar jx;\n\tvar fx;\n\tvar lx;\n\tvar iy;\n\tvar jy;\n\tvar fy;\n\tvar ly;\n\tvar vx;\n\tvar vy;\n\tvar ux;\n\tvar i;\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 ( strideY < 0 ) {\n\t\tfy = (1-N) * strideY;\n\t\tly = 0;\n\t} else {\n\t\tfy = 0;\n\t\tly = (N-1) * strideY;\n\t}\n\tiy = fy + strideY;\n\n\tif ( strideX < 0 ) {\n\t\t// Traverse the strided array from right-to-left...\n\t\tfx = (1-N) * strideX; // first index\n\t\tlx = 0;               // last index\n\t\tix = fx + strideX;\n\n\t\t// Sort in increasing order...\n\t\tfor ( i = 1; i < N; i++ ) {\n\t\t\tvx = x[ ix ];\n\t\t\tvy = y[ iy ];\n\n\t\t\t// Sort `NaN` values to the end (i.e., the left)...\n\t\t\tif ( isnan( vx ) ) {\n\t\t\t\tjx = ix;\n\t\t\t\tjy = iy;\n\n\t\t\t\t// Shift all values (including NaNs) to the left of the current element to the right...\n\t\t\t\twhile ( jx > lx ) {\n\t\t\t\t\tx[ jx ] = x[ jx+strideX ];\n\t\t\t\t\ty[ jy ] = y[ jy+strideY ];\n\t\t\t\t\tjx += strideX;\n\t\t\t\t\tjy += strideY;\n\t\t\t\t}\n\t\t\t\tx[ lx ] = vx;\n\t\t\t\ty[ ly ] = vy;\n\t\t\t} else {\n\t\t\t\tflg = isNegativeZero( vx );\n\t\t\t\tjx = ix - strideX;\n\t\t\t\tjy = iy - strideY;\n\n\t\t\t\t// Shift all larger values to the right of the current element to the left...\n\t\t\t\twhile ( jx <= fx ) {\n\t\t\t\t\tux = x[ jx ];\n\t\t\t\t\tif ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len\n\t\t\t\t\t\t// Note: positive zeros (and NaNs (e.g., when last element is NaN)) are sorted to the left\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tx[ jx+strideX ] = ux;\n\t\t\t\t\ty[ jy+strideY ] = y[ jy ];\n\t\t\t\t\tjx -= strideX;\n\t\t\t\t\tjy -= strideY;\n\t\t\t\t}\n\t\t\t\tx[ jx+strideX ] = vx;\n\t\t\t\ty[ jy+strideY ] = vy;\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\treturn x;\n\t}\n\t// Traverse the strided array from left-to-right...\n\tfx = 0;              // first index\n\tlx = (N-1) * strideX; // last index\n\tix = fx + strideX;\n\n\t// Sort in increasing order...\n\tfor ( i = 1; i < N; i++ ) {\n\t\tvx = x[ ix ];\n\t\tvy = y[ iy ];\n\n\t\t// Sort `NaN` values to the end...\n\t\tif ( isnan( vx ) ) {\n\t\t\tjx = ix;\n\t\t\tjy = iy;\n\n\t\t\t// Shift all values (including NaNs) to the right of the current element to the left...\n\t\t\twhile ( jx < lx ) {\n\t\t\t\tx[ jx ] = x[ jx+strideX ];\n\t\t\t\ty[ jy ] = y[ jy+strideY ];\n\t\t\t\tjx += strideX;\n\t\t\t\tjy += strideY;\n\t\t\t}\n\t\t\tx[ lx ] = vx;\n\t\t\ty[ ly ] = vy;\n\t\t} else {\n\t\t\tflg = isNegativeZero( vx );\n\t\t\tjx = ix - strideX;\n\t\t\tjy = iy - strideY;\n\n\t\t\t// Shift all larger values to the left of the current element to the right...\n\t\t\twhile ( jx >= fx ) {\n\t\t\t\tux = x[ jx ];\n\t\t\t\tif ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len\n\t\t\t\t\t// Note: positive zeros (and NaNs (e.g., when first element is NaN)) are sorted to the right\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx[ jx+strideX ] = ux;\n\t\t\t\ty[ jy+strideY ] = y[ jy ];\n\t\t\t\tjx -= strideX;\n\t\t\t\tjy -= strideY;\n\t\t\t}\n\t\t\tx[ jx+strideX ] = vx;\n\t\t\ty[ jy+strideY ] = vy;\n\t\t\tix += strideX;\n\t\t\tiy += strideY;\n\t\t}\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2ins;\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 isNegativeZero = require( '@stdlib/math-base-assert-is-negative-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\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 insertion sort.\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* dsort2ins( 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 dsort2ins( N, order, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar flg;\n\tvar ix;\n\tvar jx;\n\tvar fx;\n\tvar lx;\n\tvar iy;\n\tvar jy;\n\tvar fy;\n\tvar ly;\n\tvar vx;\n\tvar vy;\n\tvar ux;\n\tvar i;\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\tfx = offsetX;              // first index\n\tlx = fx + ((N-1)*strideX); // last index\n\tix = fx + strideX;\n\n\tfy = offsetY;              // first index\n\tly = fy + ((N-1)*strideY); // last index\n\tiy = fy + strideY;\n\n\tif ( strideX < 0 ) {\n\t\t// Traverse the strided array from right-to-left...\n\n\t\t// Sort in increasing order...\n\t\tfor ( i = 1; i < N; i++ ) {\n\t\t\tvx = x[ ix ];\n\t\t\tvy = y[ iy ];\n\n\t\t\t// Sort `NaN` values to the end (i.e., the left)...\n\t\t\tif ( isnan( vx ) ) {\n\t\t\t\tjx = ix;\n\t\t\t\tjy = iy;\n\n\t\t\t\t// Shift all values (including NaNs) to the left of the current element to the right...\n\t\t\t\twhile ( jx > lx ) {\n\t\t\t\t\tx[ jx ] = x[ jx+strideX ];\n\t\t\t\t\ty[ jy ] = y[ jy+strideY ];\n\t\t\t\t\tjx += strideX;\n\t\t\t\t\tjy += strideY;\n\t\t\t\t}\n\t\t\t\tx[ lx ] = vx;\n\t\t\t\ty[ ly ] = vy;\n\t\t\t} else {\n\t\t\t\tflg = isNegativeZero( vx );\n\t\t\t\tjx = ix - strideX;\n\t\t\t\tjy = iy - strideY;\n\n\t\t\t\t// Shift all larger values to the right of the current element to the left...\n\t\t\t\twhile ( jx <= fx ) {\n\t\t\t\t\tux = x[ jx ];\n\t\t\t\t\tif ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len\n\t\t\t\t\t\t// Note: positive zeros (and NaNs (e.g., when last element is NaN)) are sorted to the left\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tx[ jx+strideX ] = ux;\n\t\t\t\t\ty[ jy+strideY ] = y[ jy ];\n\t\t\t\t\tjx -= strideX;\n\t\t\t\t\tjy -= strideY;\n\t\t\t\t}\n\t\t\t\tx[ jx+strideX ] = vx;\n\t\t\t\ty[ jy+strideY ] = vy;\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\treturn x;\n\t}\n\t// Traverse the strided array from left-to-right...\n\n\t// Sort in increasing order...\n\tfor ( i = 1; i < N; i++ ) {\n\t\tvx = x[ ix ];\n\t\tvy = y[ iy ];\n\n\t\t// Sort `NaN` values to the end...\n\t\tif ( isnan( vx ) ) {\n\t\t\tjx = ix;\n\t\t\tjy = iy;\n\n\t\t\t// Shift all values (including NaNs) to the right of the current element to the left...\n\t\t\twhile ( jx < lx ) {\n\t\t\t\tx[ jx ] = x[ jx+strideX ];\n\t\t\t\ty[ jy ] = y[ jy+strideY ];\n\t\t\t\tjx += strideX;\n\t\t\t\tjy += strideY;\n\t\t\t}\n\t\t\tx[ lx ] = vx;\n\t\t\ty[ ly ] = vy;\n\t\t} else {\n\t\t\tflg = isNegativeZero( vx );\n\t\t\tjx = ix - strideX;\n\t\t\tjy = iy - strideY;\n\n\t\t\t// Shift all larger values to the left of the current element to the right...\n\t\t\twhile ( jx >= fx ) {\n\t\t\t\tux = x[ jx ];\n\t\t\t\tif ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len\n\t\t\t\t\t// Note: positive zeros (and NaNs (e.g., when first element is NaN)) are sorted to the right\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tx[ jx+strideX ] = ux;\n\t\t\t\ty[ jy+strideY ] = y[ jy ];\n\t\t\t\tjx -= strideX;\n\t\t\t\tjy -= strideY;\n\t\t\t}\n\t\t\tx[ jx+strideX ] = vx;\n\t\t\ty[ jy+strideY ] = vy;\n\t\t\tix += strideX;\n\t\t\tiy += strideY;\n\t\t}\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2ins;\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 dsort2ins = require( './dsort2ins.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( dsort2ins, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = dsort2ins;\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 insertion sort.\n*\n* @module @stdlib/blas-ext-base-dsort2ins\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dsort2ins = require( '@stdlib/blas-ext-base-dsort2ins' );\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* dsort2ins( 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 dsort2ins = require( '@stdlib/blas-ext-base-dsort2ins' );\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* dsort2ins( 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 dsort2ins;\nvar tmp = tryRequire( join( __dirname, './native.js' ) );\nif ( isError( tmp ) ) {\n\tdsort2ins = main;\n} else {\n\tdsort2ins = tmp;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dsort2ins;\n\n// exports: { \"ndarray\": \"dsort2ins.ndarray\" }\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EA8BvD,SAASC,EAAWC,EAAGC,EAAOC,EAAGC,EAASC,EAAGC,EAAU,CACtD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKlB,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAgBR,GAbKD,EAAQ,IACZE,GAAW,GACXE,GAAW,IAEPA,EAAU,GACdQ,GAAM,EAAEb,GAAKK,EACbS,EAAK,IAELD,EAAK,EACLC,GAAMd,EAAE,GAAKK,GAEdM,EAAKE,EAAKR,EAELF,EAAU,EAAI,CAOlB,IALAM,GAAM,EAAET,GAAKG,EACbO,EAAK,EACLH,EAAKE,EAAKN,EAGJe,EAAI,EAAGA,EAAIlB,EAAGkB,IAKnB,GAJAH,EAAKb,EAAGK,CAAG,EACXS,EAAKZ,EAAGO,CAAG,EAGNb,EAAOiB,CAAG,EAAI,CAKlB,IAJAP,EAAKD,EACLK,EAAKD,EAGGH,EAAKE,GACZR,EAAGM,CAAG,EAAIN,EAAGM,EAAGL,CAAQ,EACxBC,EAAGQ,CAAG,EAAIR,EAAGQ,EAAGP,CAAQ,EACxBG,GAAML,EACNS,GAAMP,EAEPH,EAAGQ,CAAG,EAAIK,EACVX,EAAGU,CAAG,EAAIE,CACX,KAAO,CAMN,IALAV,EAAMT,EAAgBkB,CAAG,EACzBP,EAAKD,EAAKJ,EACVS,EAAKD,EAAKN,EAGFG,GAAMC,IACbQ,EAAKf,EAAGM,CAAG,EACN,EAAAS,GAAMF,GAAM,EAAET,GAAOW,IAAOF,GAAMlB,EAAgBoB,CAAG,IAAM,OAIhEf,EAAGM,EAAGL,CAAQ,EAAIc,EAClBb,EAAGQ,EAAGP,CAAQ,EAAID,EAAGQ,CAAG,EACxBJ,GAAML,EACNS,GAAMP,EAEPH,EAAGM,EAAGL,CAAQ,EAAIY,EAClBX,EAAGQ,EAAGP,CAAQ,EAAIW,EAClBT,GAAMJ,EACNQ,GAAMN,CACP,CAED,OAAOH,CACR,CAOA,IALAO,EAAK,EACLC,GAAMV,EAAE,GAAKG,EACbI,EAAKE,EAAKN,EAGJe,EAAI,EAAGA,EAAIlB,EAAGkB,IAKnB,GAJAH,EAAKb,EAAGK,CAAG,EACXS,EAAKZ,EAAGO,CAAG,EAGNb,EAAOiB,CAAG,EAAI,CAKlB,IAJAP,EAAKD,EACLK,EAAKD,EAGGH,EAAKE,GACZR,EAAGM,CAAG,EAAIN,EAAGM,EAAGL,CAAQ,EACxBC,EAAGQ,CAAG,EAAIR,EAAGQ,EAAGP,CAAQ,EACxBG,GAAML,EACNS,GAAMP,EAEPH,EAAGQ,CAAG,EAAIK,EACVX,EAAGU,CAAG,EAAIE,CACX,KAAO,CAMN,IALAV,EAAMT,EAAgBkB,CAAG,EACzBP,EAAKD,EAAKJ,EACVS,EAAKD,EAAKN,EAGFG,GAAMC,IACbQ,EAAKf,EAAGM,CAAG,EACN,EAAAS,GAAMF,GAAM,EAAET,GAAOW,IAAOF,GAAMlB,EAAgBoB,CAAG,IAAM,OAIhEf,EAAGM,EAAGL,CAAQ,EAAIc,EAClBb,EAAGQ,EAAGP,CAAQ,EAAID,EAAGQ,CAAG,EACxBJ,GAAML,EACNS,GAAMP,EAEPH,EAAGM,EAAGL,CAAQ,EAAIY,EAClBX,EAAGQ,EAAGP,CAAQ,EAAIW,EAClBT,GAAMJ,EACNQ,GAAMN,CACP,CAED,OAAOH,CACR,CAKAN,EAAO,QAAUG,IC5LjB,IAAAoB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EAgCvD,SAASC,EAAWC,EAAGC,EAAOC,EAAGC,EAASC,EAASC,EAAGC,EAASC,EAAU,CACxE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKpB,GAAK,GAAKC,IAAU,EACxB,OAAOC,EAiBR,GAdKD,EAAQ,IACZE,GAAW,GACXG,GAAW,GACXF,IAAYJ,EAAE,GAAKG,EACnBI,IAAYP,EAAE,GAAKM,GAEpBK,EAAKP,EACLQ,EAAKD,GAAOX,EAAE,GAAGG,EACjBM,EAAKE,EAAKR,EAEVY,EAAKR,EACLS,EAAKD,GAAOf,EAAE,GAAGM,EACjBO,EAAKE,EAAKT,EAELH,EAAU,EAAI,CAIlB,IAAMiB,EAAI,EAAGA,EAAIpB,EAAGoB,IAKnB,GAJAH,EAAKf,EAAGO,CAAG,EACXS,EAAKb,EAAGQ,CAAG,EAGNf,EAAOmB,CAAG,EAAI,CAKlB,IAJAP,EAAKD,EACLK,EAAKD,EAGGH,EAAKE,GACZV,EAAGQ,CAAG,EAAIR,EAAGQ,EAAGP,CAAQ,EACxBE,EAAGS,CAAG,EAAIT,EAAGS,EAAGR,CAAQ,EACxBI,GAAMP,EACNW,GAAMR,EAEPJ,EAAGU,CAAG,EAAIK,EACVZ,EAAGW,CAAG,EAAIE,CACX,KAAO,CAMN,IALAV,EAAMX,EAAgBoB,CAAG,EACzBP,EAAKD,EAAKN,EACVW,EAAKD,EAAKP,EAGFI,GAAMC,IACbQ,EAAKjB,EAAGQ,CAAG,EACN,EAAAS,GAAMF,GAAM,EAAET,GAAOW,IAAOF,GAAMpB,EAAgBsB,CAAG,IAAM,OAIhEjB,EAAGQ,EAAGP,CAAQ,EAAIgB,EAClBd,EAAGS,EAAGR,CAAQ,EAAID,EAAGS,CAAG,EACxBJ,GAAMP,EACNW,GAAMR,EAEPJ,EAAGQ,EAAGP,CAAQ,EAAIc,EAClBZ,EAAGS,EAAGR,CAAQ,EAAIY,EAClBT,GAAMN,EACNU,GAAMP,CACP,CAED,OAAOJ,CACR,CAIA,IAAMkB,EAAI,EAAGA,EAAIpB,EAAGoB,IAKnB,GAJAH,EAAKf,EAAGO,CAAG,EACXS,EAAKb,EAAGQ,CAAG,EAGNf,EAAOmB,CAAG,EAAI,CAKlB,IAJAP,EAAKD,EACLK,EAAKD,EAGGH,EAAKE,GACZV,EAAGQ,CAAG,EAAIR,EAAGQ,EAAGP,CAAQ,EACxBE,EAAGS,CAAG,EAAIT,EAAGS,EAAGR,CAAQ,EACxBI,GAAMP,EACNW,GAAMR,EAEPJ,EAAGU,CAAG,EAAIK,EACVZ,EAAGW,CAAG,EAAIE,CACX,KAAO,CAMN,IALAV,EAAMX,EAAgBoB,CAAG,EACzBP,EAAKD,EAAKN,EACVW,EAAKD,EAAKP,EAGFI,GAAMC,IACbQ,EAAKjB,EAAGQ,CAAG,EACN,EAAAS,GAAMF,GAAM,EAAET,GAAOW,IAAOF,GAAMpB,EAAgBsB,CAAG,IAAM,OAIhEjB,EAAGQ,EAAGP,CAAQ,EAAIgB,EAClBd,EAAGS,EAAGR,CAAQ,EAAID,EAAGS,CAAG,EACxBJ,GAAMP,EACNW,GAAMR,EAEPJ,EAAGQ,EAAGP,CAAQ,EAAIc,EAClBZ,EAAGS,EAAGR,CAAQ,EAAIY,EAClBT,GAAMN,EACNU,GAAMP,CACP,CAED,OAAOJ,CACR,CAKAN,EAAO,QAAUG,ICzLjB,IAAAsB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAc,QAAS,uDAAwD,EAC/EC,EAAY,IACZC,EAAU,IAKdF,EAAaC,EAAW,UAAWC,CAAQ,EAK3CH,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,EAAYD,EAEZC,EAAYC,EAMb,OAAO,QAAUD",
+  "names": ["require_dsort2ins", "__commonJSMin", "exports", "module", "isNegativeZero", "isnan", "dsort2ins", "N", "order", "x", "strideX", "y", "strideY", "flg", "ix", "jx", "fx", "lx", "iy", "jy", "fy", "ly", "vx", "vy", "ux", "i", "require_ndarray", "__commonJSMin", "exports", "module", "isNegativeZero", "isnan", "dsort2ins", "N", "order", "x", "strideX", "offsetX", "y", "strideY", "offsetY", "flg", "ix", "jx", "fx", "lx", "iy", "jy", "fy", "ly", "vx", "vy", "ux", "i", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "dsort2ins", "ndarray", "join", "tryRequire", "isError", "main", "dsort2ins", "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 `dsort2ins`.

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 dsort2ins;
 var tmp = tryRequire( join( __dirname, './native.js' ) );
-if ( tmp instanceof Error ) {
+if ( isError( tmp ) ) {
 	dsort2ins = main;
 } else {
 	dsort2ins = tmp;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/blas-ext-base-dsort2ins",
-  "version": "0.0.9",
+  "version": "0.1.0",
   "description": "Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.",
   "license": "Apache-2.0",
   "author": {
@@ -41,29 +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-negative-zero": "^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.1.0",
+    "@stdlib/math-base-assert-is-nan": "^0.1.0",
+    "@stdlib/math-base-assert-is-negative-zero": "^0.1.0",
+    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.1.0",
+    "@stdlib/utils-library-manifest": "^0.1.0",
+    "@stdlib/utils-try-require": "^0.1.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-positive-zero": "^0.0.x",
-    "@stdlib/math-base-special-floor": "^0.0.x",
-    "@stdlib/math-base-special-pow": "^0.0.x",
-    "@stdlib/math-base-special-round": "^0.0.x",
-    "@stdlib/math-base-special-sqrt": "^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.0.6",
+    "@stdlib/assert-is-browser": "^0.1.0",
+    "@stdlib/bench": "^0.1.0",
+    "@stdlib/blas-base-dcopy": "^0.0.10",
+    "@stdlib/math-base-assert-is-positive-zero": "^0.1.0",
+    "@stdlib/math-base-special-floor": "^0.0.8",
+    "@stdlib/math-base-special-pow": "^0.0.7",
+    "@stdlib/math-base-special-round": "^0.1.0",
+    "@stdlib/math-base-special-sqrt": "^0.0.8",
+    "@stdlib/random-base-discrete-uniform": "^0.0.6",
+    "@stdlib/random-base-randu": "^0.0.8",
+    "@stdlib/random-base-uniform": "^0.0.6",
     "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"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -101,7 +102,7 @@
   ],
   "__stdlib__": {},
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt

@@ -1,156 +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 insertion sort.
-
-    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 worst case time complexity
-    O(N^2).
-
-    The algorithm is efficient for *small* strided arrays (typically N <= 20)
-    and is particularly efficient for sorting strided arrays which are already
-    substantially sorted.
-
-    The algorithm is *stable*, meaning that the algorithm does *not* 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 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
-        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 insertion sort 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 dsort2ins = require( './index' );
-
-
-// TESTS //
-
-// The function returns a Float64Array...
-{
-	const x = new Float64Array( 10 );
-	const y = new Float64Array( 10 );
-
-	dsort2ins( 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 );
-
-	dsort2ins( '10', 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( true, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( false, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( null, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( undefined, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( [], 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( {}, 1, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( ( 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 );
-
-	dsort2ins( x.length, '10', x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, true, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, false, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, null, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, undefined, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, [], x, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, {}, x, 1, y, 1 ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins( x.length, 1, 10, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, '10', 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, true, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, false, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, null, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, undefined, 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, [], 1, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, {}, 1, y, 1 ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins( x.length, 1, x, '10', y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, true, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, false, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, null, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, undefined, y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, [], y, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, {}, y, 1 ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins( x.length, 1, x, 1, 10, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, '10', 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, true, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, false, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, null, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, undefined, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, [], 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, {}, 1 ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins( x.length, 1, x, 1, y, '10' ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, true ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, false ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, null ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, undefined ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, [] ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y, {} ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins(); // $ExpectError
-	dsort2ins( x.length ); // $ExpectError
-	dsort2ins( x.length, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1 ); // $ExpectError
-	dsort2ins( x.length, 1, x, 1, y ); // $ExpectError
-	dsort2ins( 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 );
-
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( '10', 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( true, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( false, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( null, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( undefined, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( [], 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( {}, 1, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, '10', x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, true, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, false, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, null, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, undefined, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, [], x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, {}, x, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, 10, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, '10', 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, true, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, false, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, null, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, undefined, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, [], 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, {}, 1, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, x, '10', 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, true, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, false, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, null, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, undefined, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, [], 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, {}, 0, y, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, x, 1, '10', y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, true, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, false, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, null, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, undefined, y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, [], y, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, {}, y, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, 10, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, '10', 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, true, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, false, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, null, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, undefined, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, [], 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, {}, 1, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, '10', 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, true, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, false, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, null, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, undefined, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, [], 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, {}, 0 ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, '10' ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, true ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, false ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, null ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, undefined ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, [] ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, {} ); // $ExpectError
-	dsort2ins.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 );
-
-	dsort2ins.ndarray(); // $ExpectError
-	dsort2ins.ndarray( x.length ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1 ); // $ExpectError
-	dsort2ins.ndarray( x.length, 1, x, 1, 0, y, 1, 0, 10 ); // $ExpectError
-}