@stdlib/blas-ext-base-gnansumpw 0.0.3 → 0.0.7
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/NOTICE +1 -1
- package/README.md +57 -6
- package/lib/index.js +9 -2
- package/lib/main.js +57 -4
- package/package.json +2 -2
- package/CHANGELOG.md +0 -5
- package/lib/gnansumpw.js +0 -88
package/NOTICE
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
Copyright (c) 2016-
|
|
1
|
+
Copyright (c) 2016-2022 The Stdlib Authors.
|
package/README.md
CHANGED
|
@@ -20,7 +20,7 @@ limitations under the License.
|
|
|
20
20
|
|
|
21
21
|
# gnansumpw
|
|
22
22
|
|
|
23
|
-
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] [![dependencies][dependencies-image]][dependencies-url]
|
|
23
|
+
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
|
|
24
24
|
|
|
25
25
|
> Calculate the sum of strided array elements, ignoring `NaN` values and using pairwise summation.
|
|
26
26
|
|
|
@@ -184,6 +184,27 @@ console.log( v );
|
|
|
184
184
|
|
|
185
185
|
<!-- /.references -->
|
|
186
186
|
|
|
187
|
+
<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
|
|
188
|
+
|
|
189
|
+
<section class="related">
|
|
190
|
+
|
|
191
|
+
* * *
|
|
192
|
+
|
|
193
|
+
## See Also
|
|
194
|
+
|
|
195
|
+
- <span class="package-name">[`@stdlib/blas/ext/base/dnansumpw`][@stdlib/blas/ext/base/dnansumpw]</span><span class="delimiter">: </span><span class="description">calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using pairwise summation.</span>
|
|
196
|
+
- <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>
|
|
197
|
+
- <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>
|
|
198
|
+
- <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>
|
|
199
|
+
- <span class="package-name">[`@stdlib/blas/ext/base/gsumpw`][@stdlib/blas/ext/base/gsumpw]</span><span class="delimiter">: </span><span class="description">calculate the sum of strided array elements using pairwise summation.</span>
|
|
200
|
+
- <span class="package-name">[`@stdlib/blas/ext/base/snansumpw`][@stdlib/blas/ext/base/snansumpw]</span><span class="delimiter">: </span><span class="description">calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using pairwise summation.</span>
|
|
201
|
+
|
|
202
|
+
</section>
|
|
203
|
+
|
|
204
|
+
<!-- /.related -->
|
|
205
|
+
|
|
206
|
+
<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
|
|
207
|
+
|
|
187
208
|
|
|
188
209
|
<section class="main-repo" >
|
|
189
210
|
|
|
@@ -195,6 +216,10 @@ This package is part of [stdlib][stdlib], a standard library for JavaScript and
|
|
|
195
216
|
|
|
196
217
|
For more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].
|
|
197
218
|
|
|
219
|
+
#### Community
|
|
220
|
+
|
|
221
|
+
[![Chat][chat-image]][chat-url]
|
|
222
|
+
|
|
198
223
|
---
|
|
199
224
|
|
|
200
225
|
## License
|
|
@@ -204,7 +229,7 @@ See [LICENSE][stdlib-license].
|
|
|
204
229
|
|
|
205
230
|
## Copyright
|
|
206
231
|
|
|
207
|
-
Copyright © 2016-
|
|
232
|
+
Copyright © 2016-2022. The Stdlib [Authors][stdlib-authors].
|
|
208
233
|
|
|
209
234
|
</section>
|
|
210
235
|
|
|
@@ -223,9 +248,23 @@ Copyright © 2016-2021. The Stdlib [Authors][stdlib-authors].
|
|
|
223
248
|
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-gnansumpw/main.svg
|
|
224
249
|
[coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-gnansumpw?branch=main
|
|
225
250
|
|
|
226
|
-
|
|
251
|
+
<!--
|
|
252
|
+
|
|
253
|
+
[dependencies-image]: https://img.shields.io/david/stdlib-js/blas-ext-base-gnansumpw.svg
|
|
227
254
|
[dependencies-url]: https://david-dm.org/stdlib-js/blas-ext-base-gnansumpw/main
|
|
228
255
|
|
|
256
|
+
-->
|
|
257
|
+
|
|
258
|
+
[umd]: https://github.com/umdjs/umd
|
|
259
|
+
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
|
|
260
|
+
|
|
261
|
+
[deno-url]: https://github.com/stdlib-js/blas-ext-base-gnansumpw/tree/deno
|
|
262
|
+
[umd-url]: https://github.com/stdlib-js/blas-ext-base-gnansumpw/tree/umd
|
|
263
|
+
[esm-url]: https://github.com/stdlib-js/blas-ext-base-gnansumpw/tree/esm
|
|
264
|
+
|
|
265
|
+
[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
|
|
266
|
+
[chat-url]: https://gitter.im/stdlib-js/stdlib/
|
|
267
|
+
|
|
229
268
|
[stdlib]: https://github.com/stdlib-js/stdlib
|
|
230
269
|
|
|
231
270
|
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
|
|
@@ -236,11 +275,23 @@ Copyright © 2016-2021. The Stdlib [Authors][stdlib-authors].
|
|
|
236
275
|
|
|
237
276
|
[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
|
|
238
277
|
|
|
239
|
-
[@
|
|
278
|
+
[@higham:1993a]: https://doi.org/10.1137/0914050
|
|
279
|
+
|
|
280
|
+
<!-- <related-links> -->
|
|
240
281
|
|
|
241
|
-
[@stdlib/blas/ext/base/
|
|
282
|
+
[@stdlib/blas/ext/base/dnansumpw]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dnansumpw
|
|
242
283
|
|
|
243
|
-
[@
|
|
284
|
+
[@stdlib/blas/ext/base/gnansum]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gnansum
|
|
285
|
+
|
|
286
|
+
[@stdlib/blas/ext/base/gnansumkbn2]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gnansumkbn2
|
|
287
|
+
|
|
288
|
+
[@stdlib/blas/ext/base/gnansumors]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gnansumors
|
|
289
|
+
|
|
290
|
+
[@stdlib/blas/ext/base/gsumpw]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gsumpw
|
|
291
|
+
|
|
292
|
+
[@stdlib/blas/ext/base/snansumpw]: https://www.npmjs.com/package/@stdlib/blas-ext-base-snansumpw
|
|
293
|
+
|
|
294
|
+
<!-- </related-links> -->
|
|
244
295
|
|
|
245
296
|
</section>
|
|
246
297
|
|
package/lib/index.js
CHANGED
|
@@ -45,9 +45,16 @@
|
|
|
45
45
|
|
|
46
46
|
// MODULES //
|
|
47
47
|
|
|
48
|
-
var
|
|
48
|
+
var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );
|
|
49
|
+
var main = require( './main.js' );
|
|
50
|
+
var ndarray = require( './ndarray.js' );
|
|
51
|
+
|
|
52
|
+
|
|
53
|
+
// MAIN //
|
|
54
|
+
|
|
55
|
+
setReadOnly( main, 'ndarray', ndarray );
|
|
49
56
|
|
|
50
57
|
|
|
51
58
|
// EXPORTS //
|
|
52
59
|
|
|
53
|
-
module.exports =
|
|
60
|
+
module.exports = main;
|
package/lib/main.js
CHANGED
|
@@ -20,14 +20,67 @@
|
|
|
20
20
|
|
|
21
21
|
// MODULES //
|
|
22
22
|
|
|
23
|
-
var
|
|
24
|
-
var
|
|
25
|
-
var ndarray = require( './ndarray.js' );
|
|
23
|
+
var isnan = require( '@stdlib/math-base-assert-is-nan' );
|
|
24
|
+
var sum = require( './ndarray.js' );
|
|
26
25
|
|
|
27
26
|
|
|
28
27
|
// MAIN //
|
|
29
28
|
|
|
30
|
-
|
|
29
|
+
/**
|
|
30
|
+
* Computes the sum of strided array elements, ignoring `NaN` values and using pairwise summation.
|
|
31
|
+
*
|
|
32
|
+
* ## Method
|
|
33
|
+
*
|
|
34
|
+
* - This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.
|
|
35
|
+
*
|
|
36
|
+
* ## References
|
|
37
|
+
*
|
|
38
|
+
* - Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).
|
|
39
|
+
*
|
|
40
|
+
* @param {PositiveInteger} N - number of indexed elements
|
|
41
|
+
* @param {NumericArray} x - input array
|
|
42
|
+
* @param {integer} stride - stride length
|
|
43
|
+
* @returns {number} sum
|
|
44
|
+
*
|
|
45
|
+
* @example
|
|
46
|
+
* var x = [ 1.0, -2.0, NaN, 2.0 ];
|
|
47
|
+
* var N = x.length;
|
|
48
|
+
*
|
|
49
|
+
* var v = gnansumpw( N, x, 1 );
|
|
50
|
+
* // returns 1.0
|
|
51
|
+
*/
|
|
52
|
+
function gnansumpw( N, x, stride ) {
|
|
53
|
+
var ix;
|
|
54
|
+
var s;
|
|
55
|
+
var i;
|
|
56
|
+
|
|
57
|
+
if ( N <= 0 ) {
|
|
58
|
+
return 0.0;
|
|
59
|
+
}
|
|
60
|
+
if ( N === 1 || stride === 0 ) {
|
|
61
|
+
if ( isnan( x[ 0 ] ) ) {
|
|
62
|
+
return 0.0;
|
|
63
|
+
}
|
|
64
|
+
return x[ 0 ];
|
|
65
|
+
}
|
|
66
|
+
if ( stride < 0 ) {
|
|
67
|
+
ix = (1-N) * stride;
|
|
68
|
+
} else {
|
|
69
|
+
ix = 0;
|
|
70
|
+
}
|
|
71
|
+
if ( N < 8 ) {
|
|
72
|
+
// Use simple summation...
|
|
73
|
+
s = 0.0;
|
|
74
|
+
for ( i = 0; i < N; i++ ) {
|
|
75
|
+
if ( isnan( x[ ix ] ) === false ) {
|
|
76
|
+
s += x[ ix ];
|
|
77
|
+
}
|
|
78
|
+
ix += stride;
|
|
79
|
+
}
|
|
80
|
+
return s;
|
|
81
|
+
}
|
|
82
|
+
return sum( N, x, stride, ix );
|
|
83
|
+
}
|
|
31
84
|
|
|
32
85
|
|
|
33
86
|
// EXPORTS //
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@stdlib/blas-ext-base-gnansumpw",
|
|
3
|
-
"version": "0.0.
|
|
3
|
+
"version": "0.0.7",
|
|
4
4
|
"description": "Calculate the sum of strided array elements, ignoring NaN values and using pairwise summation.",
|
|
5
5
|
"license": "Apache-2.0",
|
|
6
6
|
"author": {
|
|
@@ -28,7 +28,7 @@
|
|
|
28
28
|
"examples": "make examples",
|
|
29
29
|
"benchmark": "make benchmark"
|
|
30
30
|
},
|
|
31
|
-
"homepage": "https://
|
|
31
|
+
"homepage": "https://stdlib.io",
|
|
32
32
|
"repository": {
|
|
33
33
|
"type": "git",
|
|
34
34
|
"url": "git://github.com/stdlib-js/blas-ext-base-gnansumpw.git"
|
package/CHANGELOG.md
DELETED
package/lib/gnansumpw.js
DELETED
|
@@ -1,88 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* @license Apache-2.0
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) 2020 The Stdlib Authors.
|
|
5
|
-
*
|
|
6
|
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
7
|
-
* you may not use this file except in compliance with the License.
|
|
8
|
-
* You may obtain a copy of the License at
|
|
9
|
-
*
|
|
10
|
-
* http://www.apache.org/licenses/LICENSE-2.0
|
|
11
|
-
*
|
|
12
|
-
* Unless required by applicable law or agreed to in writing, software
|
|
13
|
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
14
|
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
15
|
-
* See the License for the specific language governing permissions and
|
|
16
|
-
* limitations under the License.
|
|
17
|
-
*/
|
|
18
|
-
|
|
19
|
-
'use strict';
|
|
20
|
-
|
|
21
|
-
// MODULES //
|
|
22
|
-
|
|
23
|
-
var isnan = require( '@stdlib/math-base-assert-is-nan' );
|
|
24
|
-
var sum = require( './ndarray.js' );
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
// MAIN //
|
|
28
|
-
|
|
29
|
-
/**
|
|
30
|
-
* Computes the sum of strided array elements, ignoring `NaN` values and using pairwise summation.
|
|
31
|
-
*
|
|
32
|
-
* ## Method
|
|
33
|
-
*
|
|
34
|
-
* - This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.
|
|
35
|
-
*
|
|
36
|
-
* ## References
|
|
37
|
-
*
|
|
38
|
-
* - Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).
|
|
39
|
-
*
|
|
40
|
-
* @param {PositiveInteger} N - number of indexed elements
|
|
41
|
-
* @param {NumericArray} x - input array
|
|
42
|
-
* @param {integer} stride - stride length
|
|
43
|
-
* @returns {number} sum
|
|
44
|
-
*
|
|
45
|
-
* @example
|
|
46
|
-
* var x = [ 1.0, -2.0, NaN, 2.0 ];
|
|
47
|
-
* var N = x.length;
|
|
48
|
-
*
|
|
49
|
-
* var v = gnansumpw( N, x, 1 );
|
|
50
|
-
* // returns 1.0
|
|
51
|
-
*/
|
|
52
|
-
function gnansumpw( N, x, stride ) {
|
|
53
|
-
var ix;
|
|
54
|
-
var s;
|
|
55
|
-
var i;
|
|
56
|
-
|
|
57
|
-
if ( N <= 0 ) {
|
|
58
|
-
return 0.0;
|
|
59
|
-
}
|
|
60
|
-
if ( N === 1 || stride === 0 ) {
|
|
61
|
-
if ( isnan( x[ 0 ] ) ) {
|
|
62
|
-
return 0.0;
|
|
63
|
-
}
|
|
64
|
-
return x[ 0 ];
|
|
65
|
-
}
|
|
66
|
-
if ( stride < 0 ) {
|
|
67
|
-
ix = (1-N) * stride;
|
|
68
|
-
} else {
|
|
69
|
-
ix = 0;
|
|
70
|
-
}
|
|
71
|
-
if ( N < 8 ) {
|
|
72
|
-
// Use simple summation...
|
|
73
|
-
s = 0.0;
|
|
74
|
-
for ( i = 0; i < N; i++ ) {
|
|
75
|
-
if ( isnan( x[ ix ] ) === false ) {
|
|
76
|
-
s += x[ ix ];
|
|
77
|
-
}
|
|
78
|
-
ix += stride;
|
|
79
|
-
}
|
|
80
|
-
return s;
|
|
81
|
-
}
|
|
82
|
-
return sum( N, x, stride, ix );
|
|
83
|
-
}
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
// EXPORTS //
|
|
87
|
-
|
|
88
|
-
module.exports = gnansumpw;
|