From 08d9c59e35fe56952aa8d0ab087f131ebad875ed Mon Sep 17 00:00:00 2001 From: stdlib-bot <82920195+stdlib-bot@users.noreply.github.com> Date: Sat, 23 Mar 2024 02:10:37 +0000 Subject: [PATCH] Update artifacts --- blas/ext/base/scusumkbn2/coverage.ndjson | 1 + blas/ext/base/scusumkbn2/index.html | 206 +++++++++ blas/ext/base/scusumkbn2/index.js.html | 304 +++++++++++++ blas/ext/base/scusumkbn2/main.js.html | 190 ++++++++ blas/ext/base/scusumkbn2/native.js.html | 190 ++++++++ blas/ext/base/scusumkbn2/ndarray.js.html | 409 +++++++++++++++++ .../base/scusumkbn2/ndarray.native.js.html | 292 ++++++++++++ blas/ext/base/scusumkbn2/scusumkbn2.js.html | 421 ++++++++++++++++++ .../base/scusumkbn2/scusumkbn2.native.js.html | 256 +++++++++++ 9 files changed, 2269 insertions(+) create mode 100644 blas/ext/base/scusumkbn2/coverage.ndjson create mode 100644 blas/ext/base/scusumkbn2/index.html create mode 100644 blas/ext/base/scusumkbn2/index.js.html create mode 100644 blas/ext/base/scusumkbn2/main.js.html create mode 100644 blas/ext/base/scusumkbn2/native.js.html create mode 100644 blas/ext/base/scusumkbn2/ndarray.js.html create mode 100644 blas/ext/base/scusumkbn2/ndarray.native.js.html create mode 100644 blas/ext/base/scusumkbn2/scusumkbn2.js.html create mode 100644 blas/ext/base/scusumkbn2/scusumkbn2.native.js.html diff --git a/blas/ext/base/scusumkbn2/coverage.ndjson b/blas/ext/base/scusumkbn2/coverage.ndjson new file mode 100644 index 000000000..316bd1bcf --- /dev/null +++ b/blas/ext/base/scusumkbn2/coverage.ndjson @@ -0,0 +1 @@ +[489,489,100,35,35,100,4,4,100,489,489,100,"743fd055452a87d9e6d610534d9e40022d0e8235","2024-03-22 22:08:36 -0400"] diff --git a/blas/ext/base/scusumkbn2/index.html b/blas/ext/base/scusumkbn2/index.html new file mode 100644 index 000000000..4c96c43e9 --- /dev/null +++ b/blas/ext/base/scusumkbn2/index.html @@ -0,0 +1,206 @@ + + + + +
++ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +File | ++ | Statements | ++ | Branches | ++ | Functions | ++ | Lines | ++ |
---|---|---|---|---|---|---|---|---|---|
index.js | +
+
+ |
+ 100% | +73/73 | +100% | +3/3 | +100% | +0/0 | +100% | +73/73 | +
main.js | +
+
+ |
+ 100% | +35/35 | +100% | +1/1 | +100% | +0/0 | +100% | +35/35 | +
native.js | +
+
+ |
+ 100% | +35/35 | +100% | +1/1 | +100% | +0/0 | +100% | +35/35 | +
ndarray.js | +
+
+ |
+ 100% | +108/108 | +100% | +10/10 | +100% | +1/1 | +100% | +108/108 | +
ndarray.native.js | +
+
+ |
+ 100% | +69/69 | +100% | +2/2 | +100% | +1/1 | +100% | +69/69 | +
scusumkbn2.js | +
+
+ |
+ 100% | +112/112 | +100% | +16/16 | +100% | +1/1 | +100% | +112/112 | +
scusumkbn2.native.js | +
+
+ |
+ 100% | +57/57 | +100% | +2/2 | +100% | +1/1 | +100% | +57/57 | +
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 | 3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +1x +3x +2x +2x +3x +3x +3x +3x +3x +3x +3x + | /** +* @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. +*/ + +'use strict'; + +/** +* Compute the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. +* +* @module @stdlib/blas/ext/base/scusumkbn2 +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var scusumkbn2 = require( '@stdlib/blas/ext/base/scusumkbn2' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* var y = new Float32Array( x.length ); +* var N = x.length; +* +* scusumkbn2( N, 0.0, x, 1, y, 1 ); +* // y => <Float32Array>[ 1.0, -1.0, 1.0 ] +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var floor = require( '@stdlib/math/base/special/floor' ); +* var scusumkbn2 = require( '@stdlib/blas/ext/base/scusumkbn2' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* var y = new Float32Array( x.length ); +* var N = floor( x.length / 2 ); +* +* scusumkbn2.ndarray( N, 0.0, x, 2, 1, y, 1, 0 ); +* // y => <Float32Array>[ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ] +*/ + +// MODULES // + +var join = require( 'path' ).join; +var tryRequire = require( '@stdlib/utils/try-require' ); +var isError = require( '@stdlib/assert/is-error' ); +var main = require( './main.js' ); + + +// MAIN // + +var scusumkbn2; +var tmp = tryRequire( join( __dirname, './native.js' ) ); +if ( isError( tmp ) ) { + scusumkbn2 = main; +} else { + scusumkbn2 = tmp; +} + + +// EXPORTS // + +module.exports = scusumkbn2; + +// exports: { "ndarray": "scusumkbn2.ndarray" } + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' ); +var scusumkbn2 = require( './scusumkbn2.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( scusumkbn2, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = scusumkbn2; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' ); +var scusumkbn2 = require( './scusumkbn2.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( scusumkbn2, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = scusumkbn2; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 +95 +96 +97 +98 +99 +100 +101 +102 +103 +104 +105 +106 +107 +108 +109 | 2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +16x +16x +16x +16x +16x +16x +16x +16x +16x +16x +16x +16x +2x +2x +14x +14x +14x +14x +14x +16x +2045x +2045x +2045x +2016x +2045x +29x +29x +2045x +2045x +2045x +2039x +2045x +6x +6x +2045x +2045x +2045x +2045x +2045x +2045x +2045x +14x +16x +2x +2x +2x +2x +2x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' ); +var abs = require( '@stdlib/math/base/special/abs' ); + + +// MAIN // + +/** +* Computes the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. +* +* ## Method +* +* - This implementation uses a second-order iterative Kahan–Babuška algorithm, as described by Klein (2005). +* +* ## References +* +* - Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x). +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} sum - initial sum +* @param {Float32Array} x - input array +* @param {integer} strideX - `x` stride length +* @param {NonNegativeInteger} offsetX - starting index for `x` +* @param {Float32Array} y - output array +* @param {integer} strideY - `y` stride length +* @param {NonNegativeInteger} offsetY - starting index for `y` +* @returns {Float32Array} output array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var floor = require( '@stdlib/math/base/special/floor' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* var y = new Float32Array( x.length ); +* var N = floor( x.length / 2 ); +* +* var v = scusumkbn2( N, 0.0, x, 2, 1, y, 1, 0 ); +* // returns <Float32Array>[ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ] +*/ +function scusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) { + var ccs; + var ix; + var iy; + var cs; + var cc; + var v; + var t; + var c; + var i; + + if ( N <= 0 ) { + return y; + } + ix = offsetX; + iy = offsetY; + + ccs = 0.0; // second order correction term for lost low order bits + cs = 0.0; // first order correction term for lost low order bits + for ( i = 0; i < N; i++ ) { + v = x[ ix ]; + t = float64ToFloat32( sum+v ); + if ( abs( sum ) >= abs( v ) ) { + c = float64ToFloat32( float64ToFloat32( sum-t ) + v ); + } else { + c = float64ToFloat32( float64ToFloat32( v-t ) + sum ); + } + sum = t; + t = float64ToFloat32( cs+c ); + if ( abs( cs ) >= abs( c ) ) { + cc = float64ToFloat32( float64ToFloat32( cs-t ) + c ); + } else { + cc = float64ToFloat32( float64ToFloat32( c-t ) + cs ); + } + cs = t; + ccs = float64ToFloat32( ccs+cc ); + + y[ iy ] = float64ToFloat32( sum + float64ToFloat32( cs+ccs ) ); + ix += strideX; + iy += strideY; + } + return y; +} + + +// EXPORTS // + +module.exports = scusumkbn2; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 | 2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +16x +16x +16x +16x +16x +16x +16x +16x +16x +16x +16x +2x +2x +2x +2x +2x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var minViewBufferIndex = require( '@stdlib/strided/base/min-view-buffer-index' ); +var offsetView = require( '@stdlib/strided/base/offset-view' ); +var addon = require( './scusumkbn2.native.js' ); + + +// MAIN // + +/** +* Computes the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} sum - initial sum +* @param {Float32Array} x - input array +* @param {integer} strideX - `x` stride length +* @param {NonNegativeInteger} offsetX - starting index for `x` +* @param {Float32Array} y - output array +* @param {integer} strideY - `y` stride length +* @param {NonNegativeInteger} offsetY - starting index for `y` +* @returns {Float32Array} output array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var floor = require( '@stdlib/math/base/special/floor' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* var y = new Float32Array( x.length ); +* var N = floor( x.length / 2 ); +* +* var v = scusumkbn2( N, 0.0, x, 2, 1, y, 1, 0 ); +* // returns <Float32Array>[ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ] +*/ +function scusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) { + var viewX; + var viewY; + offsetX = minViewBufferIndex( N, strideX, offsetX ); + offsetY = minViewBufferIndex( N, strideY, offsetY ); + + viewX = offsetView( x, offsetX ); + viewY = offsetView( y, offsetY ); + addon( N, sum, viewX, strideX, viewY, strideY ); + return y; +} + + +// EXPORTS // + +module.exports = scusumkbn2; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 +95 +96 +97 +98 +99 +100 +101 +102 +103 +104 +105 +106 +107 +108 +109 +110 +111 +112 +113 | 2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +15x +15x +15x +15x +15x +15x +15x +15x +15x +15x +15x +15x +2x +2x +15x +3x +15x +10x +10x +15x +3x +15x +10x +10x +13x +13x +15x +2040x +2040x +2040x +2015x +2040x +25x +25x +2040x +2040x +2040x +2034x +2040x +6x +6x +2040x +2040x +2040x +2040x +2040x +2040x +2040x +13x +15x +2x +2x +2x +2x +2x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' ); +var abs = require( '@stdlib/math/base/special/abs' ); + + +// MAIN // + +/** +* Computes the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. +* +* ## Method +* +* - This implementation uses a second-order iterative Kahan–Babuška algorithm, as described by Klein (2005). +* +* ## References +* +* - Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x). +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} sum - initial sum +* @param {Float32Array} x - input array +* @param {integer} strideX - `x` stride length +* @param {Float32Array} y - output array +* @param {integer} strideY - `y` stride length +* @returns {Float32Array} output array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* var y = new Float32Array( x.length ); +* var N = x.length; +* +* var v = scusumkbn2( N, 0.0, x, 1, y, 1 ); +* // returns <Float32Array>[ 1.0, -1.0, 1.0 ] +*/ +function scusumkbn2( N, sum, x, strideX, y, strideY ) { + var ccs; + var ix; + var iy; + var cs; + var cc; + var v; + var t; + var c; + var i; + + if ( N <= 0 ) { + return y; + } + if ( strideX < 0 ) { + ix = (1-N) * strideX; + } else { + ix = 0; + } + if ( strideY < 0 ) { + iy = (1-N) * strideY; + } else { + iy = 0; + } + ccs = 0.0; // second order correction term for lost low order bits + cs = 0.0; // first order correction term for lost low order bits + for ( i = 0; i < N; i++ ) { + v = x[ ix ]; + t = float64ToFloat32( sum+v ); + if ( abs( sum ) >= abs( v ) ) { + c = float64ToFloat32( float64ToFloat32( sum-t ) + v ); + } else { + c = float64ToFloat32( float64ToFloat32( v-t ) + sum ); + } + sum = t; + t = float64ToFloat32( cs+c ); + if ( abs( cs ) >= abs( c ) ) { + cc = float64ToFloat32( float64ToFloat32( cs-t ) + c ); + } else { + cc = float64ToFloat32( float64ToFloat32( c-t ) + cs ); + } + cs = t; + ccs = float64ToFloat32( ccs+cc ); + + y[ iy ] = float64ToFloat32( sum + float64ToFloat32( cs+ccs ) ); + ix += strideX; + iy += strideY; + } + return y; +} + + +// EXPORTS // + +module.exports = scusumkbn2; + |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 | 3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +31x +31x +31x +31x +3x +3x +3x +3x +3x + | /** +* @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. +*/ + +'use strict'; + +// MODULES // + +var addon = require( './../src/addon.node' ); + + +// MAIN // + +/** +* Computes the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} sum - initial sum +* @param {Float32Array} x - input array +* @param {integer} strideX - `x` stride length +* @param {Float32Array} y - output array +* @param {integer} strideY - `y` stride length +* @returns {Float32Array} output array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* var y = new Float32Array( x.length ); +* var N = x.length; +* +* var v = scusumkbn2( N, 0.0, x, 1, y, 1 ); +* // returns <Float32Array>[ 1.0, -1.0, 1.0 ] +*/ +function scusumkbn2( N, sum, x, strideX, y, strideY ) { + addon( N, sum, x, strideX, y, strideY ); + return y; +} + + +// EXPORTS // + +module.exports = scusumkbn2; + |