@stdlib/blas-ext-base-gnansumkbn 0.0.9 → 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>
+
 # gnansumkbn
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -132,7 +143,7 @@ var v = gnansumkbn.ndarray( N, x, 2, 1 );
 ## Notes
 
 -   If `N <= 0`, both functions return `0.0`.
--   Depending on the environment, the typed versions ([`dnansum`][@stdlib/blas/ext/base/dnansum], [`snansum`][@stdlib/blas/ext/base/snansum], etc.) are likely to be significantly more performant.
+-   Depending on the environment, the typed versions ([`dnansumkbn`][@stdlib/blas/ext/base/dnansumkbn], [`snansumkbn`][@stdlib/blas/ext/base/snansumkbn], etc.) are likely to be significantly more performant.
 
 </section>
 
@@ -191,13 +202,13 @@ console.log( v );
 
 ## See Also
 
--   <span class="package-name">[`@stdlib/blas/ext/base/dnansumkbn`][@stdlib/blas/ext/base/dnansumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gnansum`][@stdlib/blas/ext/base/gnansum]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gnansumkbn2`][@stdlib/blas/ext/base/gnansumkbn2]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gnansumors`][@stdlib/blas/ext/base/gnansumors]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using ordinary recursive summation.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gnansumpw`][@stdlib/blas/ext/base/gnansumpw]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using pairwise summation.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/gsumkbn`][@stdlib/blas/ext/base/gsumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements using an improved Kahan–Babuška algorithm.</span>
--   <span class="package-name">[`@stdlib/blas/ext/base/snansumkbn`][@stdlib/blas/ext/base/snansumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/dnansumkbn`][@stdlib/blas/ext/base/dnansumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gnansum`][@stdlib/blas/ext/base/gnansum]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gnansumkbn2`][@stdlib/blas/ext/base/gnansumkbn2]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gnansumors`][@stdlib/blas/ext/base/gnansumors]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using ordinary recursive summation.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gnansumpw`][@stdlib/blas/ext/base/gnansumpw]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements, ignoring NaN values and using pairwise summation.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/gsumkbn`][@stdlib/blas/ext/base/gsumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements using an improved Kahan–Babuška algorithm.</span>
+-   <span class="package-name">[`@stdlib/blas-ext/base/snansumkbn`][@stdlib/blas/ext/base/snansumkbn]</span><span class="delimiter">: </span><span class="description">calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.</span>
 
 </section>
 
@@ -229,7 +240,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>
 
@@ -242,8 +253,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-gnansumkbn.svg
 [npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-gnansumkbn
 
-[test-image]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/actions/workflows/test.yml/badge.svg?branch=v0.0.9
-[test-url]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/actions/workflows/test.yml?query=branch:v0.0.9
+[test-image]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/actions/workflows/test.yml/badge.svg?branch=v0.2.0
+[test-url]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/actions/workflows/test.yml?query=branch:v0.2.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-gnansumkbn/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-gnansumkbn?branch=main
@@ -256,7 +267,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
 
@@ -266,8 +277,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-gnansumkbn/tree/deno
+[deno-readme]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/blob/deno/README.md
 [umd-url]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/tree/umd
+[umd-readme]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/blob/umd/README.md
 [esm-url]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/tree/esm
+[esm-readme]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/blob/esm/README.md
 [branches-url]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn/blob/main/branches.md
 
 [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-gnansumkbn/main/LICENSE
@@ -278,10 +292,12 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 
 [@neumaier:1974a]: https://doi.org/10.1002/zamm.19740540106
 
-<!-- <related-links> -->
-
 [@stdlib/blas/ext/base/dnansumkbn]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dnansumkbn
 
+[@stdlib/blas/ext/base/snansumkbn]: https://www.npmjs.com/package/@stdlib/blas-ext-base-snansumkbn
+
+<!-- <related-links> -->
+
 [@stdlib/blas/ext/base/gnansum]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gnansum
 
 [@stdlib/blas/ext/base/gnansumkbn2]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gnansumkbn2
@@ -292,8 +308,6 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 
 [@stdlib/blas/ext/base/gsumkbn]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gsumkbn
 
-[@stdlib/blas/ext/base/snansumkbn]: https://www.npmjs.com/package/@stdlib/blas-ext-base-snansumkbn
-
 <!-- </related-links> -->
 
 </section>

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 gnansumkbn from '../docs/types/index';
+export = gnansumkbn;

package/dist/index.js

@@ -0,0 +1,7 @@
+"use strict";var c=function(n,r){return function(){return r||n((r={exports:{}}).exports,r),r.exports}};var o=c(function(w,m){
+var q=require('@stdlib/math-base-assert-is-nan/dist'),l=require('@stdlib/math-base-special-abs/dist');function x(n,r,t){var e,a,u,i,v,s;if(n<=0)return 0;if(n===1||t===0)return q(r[0])?0:r[0];for(t<0?a=(1-n)*t:a=0,e=0,v=0,s=0;s<n;s++)u=r[a],q(u)===!1&&(i=e+u,l(e)>=l(u)?v+=e-i+u:v+=u-i+e,e=i),a+=t;return e+v}m.exports=x
+});var g=c(function(z,y){
+var b=require('@stdlib/math-base-assert-is-nan/dist'),p=require('@stdlib/math-base-special-abs/dist');function O(n,r,t,e){var a,u,i,v,s,f;if(n<=0)return 0;if(n===1||t===0)return b(r[e])?0:r[e];for(u=e,a=0,s=0,f=0;f<n;f++)i=r[u],b(i)===!1&&(v=a+i,p(a)>=p(i)?s+=a-v+i:s+=i-v+a,a=v),u+=t;return a+s}y.exports=O
+});var R=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),k=o(),h=g();R(k,"ndarray",h);module.exports=k;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/main.js", "../lib/ndarray.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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar abs = require( '@stdlib/math-base-special-abs' );\n\n\n// MAIN //\n\n/**\n* Computes the sum of strided array elements, ignoring `NaN` values and using an improved Kahan\u2013Babu\u0161ka algorithm.\n*\n* ## Method\n*\n* -   This implementation uses an \"improved Kahan\u2013Babu\u0161ka algorithm\", as described by Neumaier (1974).\n*\n* ## References\n*\n* -   Neumaier, Arnold. 1974. \"Rounding Error Analysis of Some Methods for Summing Finite Sums.\" _Zeitschrift F\u00FCr Angewandte Mathematik Und Mechanik_ 54 (1): 39\u201351. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @returns {number} sum\n*\n* @example\n* var x = [ 1.0, -2.0, NaN, 2.0 ];\n* var N = x.length;\n*\n* var v = gnansumkbn( N, x, 1 );\n* // returns 1.0\n*/\nfunction gnansumkbn( N, x, stride ) {\n\tvar sum;\n\tvar ix;\n\tvar v;\n\tvar t;\n\tvar c;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\tif ( isnan( x[ 0 ] ) ) {\n\t\t\treturn 0.0;\n\t\t}\n\t\treturn x[ 0 ];\n\t}\n\tif ( stride < 0 ) {\n\t\tix = (1-N) * stride;\n\t} else {\n\t\tix = 0;\n\t}\n\tsum = 0.0;\n\tc = 0.0;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv = x[ ix ];\n\t\tif ( isnan( v ) === false ) {\n\t\t\tt = sum + v;\n\t\t\tif ( abs( sum ) >= abs( v ) ) {\n\t\t\t\tc += (sum-t) + v;\n\t\t\t} else {\n\t\t\t\tc += (v-t) + sum;\n\t\t\t}\n\t\t\tsum = t;\n\t\t}\n\t\tix += stride;\n\t}\n\treturn sum + c;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gnansumkbn;\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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar abs = require( '@stdlib/math-base-special-abs' );\n\n\n// MAIN //\n\n/**\n* Computes the sum of strided array elements, ignoring `NaN` values and using an improved Kahan\u2013Babu\u0161ka algorithm.\n*\n* ## Method\n*\n* -   This implementation uses an \"improved Kahan\u2013Babu\u0161ka algorithm\", as described by Neumaier (1974).\n*\n* ## References\n*\n* -   Neumaier, Arnold. 1974. \"Rounding Error Analysis of Some Methods for Summing Finite Sums.\" _Zeitschrift F\u00FCr Angewandte Mathematik Und Mechanik_ 54 (1): 39\u201351. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @returns {number} sum\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];\n* var N = floor( x.length / 2 );\n*\n* var v = gnansumkbn( N, x, 2, 1 );\n* // returns 5.0\n*/\nfunction gnansumkbn( N, x, stride, offset ) {\n\tvar sum;\n\tvar ix;\n\tvar v;\n\tvar t;\n\tvar c;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\tif ( isnan( x[ offset ] ) ) {\n\t\t\treturn 0.0;\n\t\t}\n\t\treturn x[ offset ];\n\t}\n\tix = offset;\n\tsum = 0.0;\n\tc = 0.0;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv = x[ ix ];\n\t\tif ( isnan( v ) === false ) {\n\t\t\tt = sum + v;\n\t\t\tif ( abs( sum ) >= abs( v ) ) {\n\t\t\t\tc += (sum-t) + v;\n\t\t\t} else {\n\t\t\t\tc += (v-t) + sum;\n\t\t\t}\n\t\t\tsum = t;\n\t\t}\n\t\tix += stride;\n\t}\n\treturn sum + c;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gnansumkbn;\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* Compute the sum of strided array elements, ignoring `NaN` values and using an improved Kahan\u2013Babu\u0161ka algorithm.\n*\n* @module @stdlib/blas-ext-base-gnansumkbn\n*\n* @example\n* var gnansumkbn = require( '@stdlib/blas-ext-base-gnansumkbn' );\n*\n* var x = [ 1.0, -2.0, NaN, 2.0 ];\n* var N = x.length;\n*\n* var v = gnansumkbn( N, x, 1 );\n* // returns 1.0\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n* var gnansumkbn = require( '@stdlib/blas-ext-base-gnansumkbn' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ];\n* var N = floor( x.length / 2 );\n*\n* var v = gnansumkbn.ndarray( N, x, 2, 1 );\n* // returns 5.0\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAQ,QAAS,iCAAkC,EACnDC,EAAM,QAAS,+BAAgC,EA4BnD,SAASC,EAAYC,EAAGC,EAAGC,EAAS,CACnC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKR,GAAK,EACT,MAAO,GAER,GAAKA,IAAM,GAAKE,IAAW,EAC1B,OAAKL,EAAOI,EAAG,CAAE,CAAE,EACX,EAEDA,EAAG,CAAE,EASb,IAPKC,EAAS,EACbE,GAAM,EAAEJ,GAAKE,EAEbE,EAAK,EAEND,EAAM,EACNI,EAAI,EACEC,EAAI,EAAGA,EAAIR,EAAGQ,IACnBH,EAAIJ,EAAGG,CAAG,EACLP,EAAOQ,CAAE,IAAM,KACnBC,EAAIH,EAAME,EACLP,EAAKK,CAAI,GAAKL,EAAKO,CAAE,EACzBE,GAAMJ,EAAIG,EAAKD,EAEfE,GAAMF,EAAEC,EAAKH,EAEdA,EAAMG,GAEPF,GAAMF,EAEP,OAAOC,EAAMI,CACd,CAKAX,EAAO,QAAUG,IC9FjB,IAAAU,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAQ,QAAS,iCAAkC,EACnDC,EAAM,QAAS,+BAAgC,EA+BnD,SAASC,EAAYC,EAAGC,EAAGC,EAAQC,EAAS,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKT,GAAK,EACT,MAAO,GAER,GAAKA,IAAM,GAAKE,IAAW,EAC1B,OAAKL,EAAOI,EAAGE,CAAO,CAAE,EAChB,EAEDF,EAAGE,CAAO,EAKlB,IAHAE,EAAKF,EACLC,EAAM,EACNI,EAAI,EACEC,EAAI,EAAGA,EAAIT,EAAGS,IACnBH,EAAIL,EAAGI,CAAG,EACLR,EAAOS,CAAE,IAAM,KACnBC,EAAIH,EAAME,EACLR,EAAKM,CAAI,GAAKN,EAAKQ,CAAE,EACzBE,GAAMJ,EAAIG,EAAKD,EAEfE,GAAMF,EAAEC,EAAKH,EAEdA,EAAMG,GAEPF,GAAMH,EAEP,OAAOE,EAAMI,CACd,CAKAZ,EAAO,QAAUG,IC9CjB,IAAIW,EAAc,QAAS,uDAAwD,EAC/EC,EAAO,IACPC,EAAU,IAKdF,EAAaC,EAAM,UAAWC,CAAQ,EAKtC,OAAO,QAAUD",
+  "names": ["require_main", "__commonJSMin", "exports", "module", "isnan", "abs", "gnansumkbn", "N", "x", "stride", "sum", "ix", "v", "t", "c", "i", "require_ndarray", "__commonJSMin", "exports", "module", "isnan", "abs", "gnansumkbn", "N", "x", "stride", "offset", "sum", "ix", "v", "t", "c", "i", "setReadOnly", "main", "ndarray"]
+}

package/docs/types/index.d.ts

@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 
 /// <reference types="@stdlib/types"/>
 
@@ -57,7 +57,7 @@ interface Routine {
 	* var v = gnansumkbn.ndarray( x.length, x, 1, 0 );
 	* // returns 1.0
 	*/
-	ndarray( N: number, x: NumericArray, stride: number, offset: number ): number; // tslint:disable-line:max-line-length
+	ndarray( N: number, x: NumericArray, stride: number, offset: number ): number;
 }
 
 /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/blas-ext-base-gnansumkbn",
-  "version": "0.0.9",
+  "version": "0.2.0",
   "description": "Calculate the sum of strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.",
   "license": "Apache-2.0",
   "author": {
@@ -37,21 +37,22 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/math-base-assert-is-nan": "^0.0.x",
-    "@stdlib/math-base-special-abs": "^0.0.x",
-    "@stdlib/types": "^0.0.x",
-    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.0.x"
+    "@stdlib/math-base-assert-is-nan": "^0.2.0",
+    "@stdlib/math-base-special-abs": "^0.2.0",
+    "@stdlib/types": "^0.3.1",
+    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.0"
   },
   "devDependencies": {
-    "@stdlib/array-float64": "^0.0.x",
-    "@stdlib/bench": "^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/random-base-randu": "^0.0.x",
+    "@stdlib/array-float64": "^0.1.1",
+    "@stdlib/math-base-special-floor": "^0.1.1",
+    "@stdlib/math-base-special-pow": "^0.1.0",
+    "@stdlib/math-base-special-round": "^0.1.1",
+    "@stdlib/random-base-randu": "^0.1.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",
@@ -89,7 +90,7 @@
   ],
   "__stdlib__": {},
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt

@@ -1,94 +0,0 @@
-
-{{alias}}( N, x, stride )
-    Computes the sum of strided array elements, ignoring `NaN` values and using
-    an improved Kahan–Babuška algorithm.
-
-    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 a typed
-    array view.
-
-    If `N <= 0`, the function returns `0.0`.
-
-    Parameters
-    ----------
-    N: integer
-        Number of indexed elements.
-
-    x: Array<number>|TypedArray
-        Input array.
-
-    stride: integer
-        Index increment.
-
-    Returns
-    -------
-    out: number
-        Sum.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = [ 1.0, -2.0, NaN, 2.0 ];
-    > {{alias}}( x.length, x, 1 )
-    1.0
-
-    // Using `N` and `stride` parameters:
-    > x = [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0, NaN, NaN ];
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > var stride = 2;
-    > {{alias}}( N, x, stride )
-    1.0
-
-    // Using view offsets:
-    > var x0 = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0, NaN, NaN ] );
-    > var x1 = new {{alias:@stdlib/array/float64}}( x0.buffer, x0.BYTES_PER_ELEMENT*1 );
-    > N = {{alias:@stdlib/math/base/special/floor}}( x0.length / 2 );
-    > stride = 2;
-    > {{alias}}( N, x1, stride )
-    -1.0
-
-{{alias}}.ndarray( N, x, stride, offset )
-    Computes the sum of strided array elements, ignoring `NaN` values and using
-    an improved Kahan–Babuška algorithm 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.
-
-    x: Array<number>|TypedArray
-        Input array.
-
-    stride: integer
-        Index increment.
-
-    offset: integer
-        Starting index.
-
-    Returns
-    -------
-    out: number
-        Sum.
-
-    Examples
-    --------
-    // Standard Usage:
-    > var x = [ 1.0, -2.0, NaN, 2.0 ];
-    > {{alias}}.ndarray( x.length, x, 1, 0 )
-    1.0
-
-    // Using offset parameter:
-    > var x = [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0, NaN, NaN ];
-    > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 );
-    > {{alias}}.ndarray( N, x, 2, 1 )
-    -1.0
-
-    See Also
-    --------
-

package/docs/types/test.ts

@@ -1,155 +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 gnansumkbn = require( './index' );
-
-
-// TESTS //
-
-// The function returns a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn( x.length, x, 1 ); // $ExpectType number
-}
-
-// The compiler throws an error if the function is provided a first argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn( '10', x, 1 ); // $ExpectError
-	gnansumkbn( true, x, 1 ); // $ExpectError
-	gnansumkbn( false, x, 1 ); // $ExpectError
-	gnansumkbn( null, x, 1 ); // $ExpectError
-	gnansumkbn( undefined, x, 1 ); // $ExpectError
-	gnansumkbn( [], x, 1 ); // $ExpectError
-	gnansumkbn( {}, x, 1 ); // $ExpectError
-	gnansumkbn( ( x: number ): number => x, x, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a second argument which is not a numeric array...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn( x.length, 10, 1 ); // $ExpectError
-	gnansumkbn( x.length, '10', 1 ); // $ExpectError
-	gnansumkbn( x.length, true, 1 ); // $ExpectError
-	gnansumkbn( x.length, false, 1 ); // $ExpectError
-	gnansumkbn( x.length, null, 1 ); // $ExpectError
-	gnansumkbn( x.length, undefined, 1 ); // $ExpectError
-	gnansumkbn( x.length, {}, 1 ); // $ExpectError
-	gnansumkbn( x.length, ( x: number ): number => x, 1 ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a third argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn( x.length, x, '10' ); // $ExpectError
-	gnansumkbn( x.length, x, true ); // $ExpectError
-	gnansumkbn( x.length, x, false ); // $ExpectError
-	gnansumkbn( x.length, x, null ); // $ExpectError
-	gnansumkbn( x.length, x, undefined ); // $ExpectError
-	gnansumkbn( x.length, x, [] ); // $ExpectError
-	gnansumkbn( x.length, x, {} ); // $ExpectError
-	gnansumkbn( x.length, 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 );
-
-	gnansumkbn(); // $ExpectError
-	gnansumkbn( x.length ); // $ExpectError
-	gnansumkbn( x.length, x ); // $ExpectError
-	gnansumkbn( x.length, x, 1, 10 ); // $ExpectError
-}
-
-// Attached to main export is an `ndarray` method which returns a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn.ndarray( x.length, x, 1, 0 ); // $ExpectType number
-}
-
-// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn.ndarray( '10', x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( true, x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( false, x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( null, x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( undefined, x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( [], x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( {}, x, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( ( x: number ): number => x, x, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a second argument which is not a numeric array...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn.ndarray( x.length, 10, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, '10', 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, true, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, false, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, null, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, undefined, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, {}, 1, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, ( x: number ): number => x, 1, 0 ); // $ExpectError
-}
-
-// The compiler throws an error if the `ndarray` method is provided a third argument which is not a number...
-{
-	const x = new Float64Array( 10 );
-
-	gnansumkbn.ndarray( x.length, x, '10', 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, true, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, false, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, null, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, undefined, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, [], 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, {}, 0 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, ( x: number ): number => x, 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 );
-
-	gnansumkbn.ndarray( x.length, x, 1, '10' ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, true ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, false ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, null ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, undefined ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, [] ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, {} ); // $ExpectError
-	gnansumkbn.ndarray( x.length, 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 );
-
-	gnansumkbn.ndarray(); // $ExpectError
-	gnansumkbn.ndarray( x.length ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1 ); // $ExpectError
-	gnansumkbn.ndarray( x.length, x, 1, 0, 10 ); // $ExpectError
-}