From 5561498912ae2b813a7e41038c04c60f1a0b2283 Mon Sep 17 00:00:00 2001 From: stdlib-bot <82920195+stdlib-bot@users.noreply.github.com> Date: Fri, 22 Mar 2024 21:41:21 +0000 Subject: [PATCH] Update artifacts --- blas/ext/base/sapxsumkbn/coverage.ndjson | 1 + blas/ext/base/sapxsumkbn/index.html | 206 ++++++++++ blas/ext/base/sapxsumkbn/index.js.html | 289 ++++++++++++++ blas/ext/base/sapxsumkbn/main.js.html | 190 +++++++++ blas/ext/base/sapxsumkbn/native.js.html | 190 +++++++++ blas/ext/base/sapxsumkbn/ndarray.js.html | 352 +++++++++++++++++ .../base/sapxsumkbn/ndarray.native.js.html | 265 +++++++++++++ blas/ext/base/sapxsumkbn/sapxsumkbn.js.html | 361 ++++++++++++++++++ .../base/sapxsumkbn/sapxsumkbn.native.js.html | 241 ++++++++++++ 9 files changed, 2095 insertions(+) create mode 100644 blas/ext/base/sapxsumkbn/coverage.ndjson create mode 100644 blas/ext/base/sapxsumkbn/index.html create mode 100644 blas/ext/base/sapxsumkbn/index.js.html create mode 100644 blas/ext/base/sapxsumkbn/main.js.html create mode 100644 blas/ext/base/sapxsumkbn/native.js.html create mode 100644 blas/ext/base/sapxsumkbn/ndarray.js.html create mode 100644 blas/ext/base/sapxsumkbn/ndarray.native.js.html create mode 100644 blas/ext/base/sapxsumkbn/sapxsumkbn.js.html create mode 100644 blas/ext/base/sapxsumkbn/sapxsumkbn.native.js.html diff --git a/blas/ext/base/sapxsumkbn/coverage.ndjson b/blas/ext/base/sapxsumkbn/coverage.ndjson new file mode 100644 index 000000000..b1d0dc4f0 --- /dev/null +++ b/blas/ext/base/sapxsumkbn/coverage.ndjson @@ -0,0 +1 @@ +[431,431,100,34,34,100,4,4,100,431,431,100,"f2b3fbce785af74072804639f615612560475202","2024-03-22 14:39:19 -0700"] diff --git a/blas/ext/base/sapxsumkbn/index.html b/blas/ext/base/sapxsumkbn/index.html new file mode 100644 index 000000000..0015f0d79 --- /dev/null +++ b/blas/ext/base/sapxsumkbn/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% | +68/68 | +100% | +3/3 | +100% | +0/0 | +100% | +68/68 | +
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% | +89/89 | +100% | +11/11 | +100% | +1/1 | +100% | +89/89 | +
ndarray.native.js | +
+
+ |
+ 100% | +60/60 | +100% | +2/2 | +100% | +1/1 | +100% | +60/60 | +
sapxsumkbn.js | +
+
+ |
+ 100% | +92/92 | +100% | +14/14 | +100% | +1/1 | +100% | +92/92 | +
sapxsumkbn.native.js | +
+
+ |
+ 100% | +52/52 | +100% | +2/2 | +100% | +1/1 | +100% | +52/52 | +
+ 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 | 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'; + +/** +* Add a constant to each single-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm. +* +* @module @stdlib/blas/ext/base/sapxsumkbn +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var sapxsumkbn = require( '@stdlib/blas/ext/base/sapxsumkbn' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* +* var v = sapxsumkbn( 3, 5.0, x, 1 ); +* // returns 16.0 +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var sapxsumkbn = require( '@stdlib/blas/ext/base/sapxsumkbn' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* +* var v = sapxsumkbn.ndarray( 4, 5.0, x, 2, 1 ); +* // returns 25.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 sapxsumkbn; +var tmp = tryRequire( join( __dirname, './native.js' ) ); +if ( isError( tmp ) ) { + sapxsumkbn = main; +} else { + sapxsumkbn = tmp; +} + + +// EXPORTS // + +module.exports = sapxsumkbn; + +// exports: { "ndarray": "sapxsumkbn.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 sapxsumkbn = require( './sapxsumkbn.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( sapxsumkbn, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = sapxsumkbn; + |
+ 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 sapxsumkbn = require( './sapxsumkbn.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( sapxsumkbn, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = sapxsumkbn; + |
+ 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 | 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 +12x +12x +12x +12x +12x +12x +12x +12x +12x +2x +2x +12x +2x +2x +8x +8x +8x +12x +35x +35x +35x +24x +35x +11x +11x +35x +35x +35x +8x +12x +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 // + +/** +* Adds a constant to each single-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm. +* +* ## Method +* +* - This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974). +* +* ## References +* +* - Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106). +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} alpha - constant +* @param {Float32Array} x - input array +* @param {integer} stride - stride length +* @param {NonNegativeInteger} offset - starting index +* @returns {number} sum +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* +* var v = sapxsumkbn( 4, 5.0, x, 2, 1 ); +* // returns 25.0 +*/ +function sapxsumkbn( N, alpha, x, stride, offset ) { + var sum; + var ix; + var v; + var t; + var c; + var i; + + if ( N <= 0 ) { + return 0.0; + } + if ( N === 1 || stride === 0 ) { + return float64ToFloat32( alpha + x[ offset ] ); + } + ix = offset; + sum = 0.0; + c = 0.0; + for ( i = 0; i < N; i++ ) { + v = float64ToFloat32( alpha + x[ ix ] ); + t = float64ToFloat32( sum + v ); + if ( abs( sum ) >= abs( v ) ) { + c = float64ToFloat32( c + float64ToFloat32( float64ToFloat32( sum-t ) + v ) ); // eslint-disable-line max-len + } else { + c = float64ToFloat32( c + float64ToFloat32( float64ToFloat32( v-t ) + sum ) ); // eslint-disable-line max-len + } + sum = t; + ix += stride; + } + return float64ToFloat32( sum + c ); +} + + +// EXPORTS // + +module.exports = sapxsumkbn; + |
+ 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 | 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 +12x +12x +12x +12x +12x +12x +12x +12x +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( './sapxsumkbn.native.js' ); + + +// MAIN // + +/** +* Adds a constant to each single-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} alpha - constant +* @param {Float32Array} x - input array +* @param {integer} stride - stride length +* @param {NonNegativeInteger} offset - starting index +* @returns {number} sum +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); +* +* var v = sapxsumkbn( 4, 5.0, x, 2, 1 ); +* // returns 25.0 +*/ +function sapxsumkbn( N, alpha, x, stride, offset ) { + var view; + + offset = minViewBufferIndex( N, stride, offset ); + view = offsetView( x, offset ); + + return addon( N, alpha, view, stride ); +} + + +// EXPORTS // + +module.exports = sapxsumkbn; + |
+ 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 | 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 +12x +12x +12x +12x +12x +12x +12x +12x +12x +2x +2x +12x +2x +2x +12x +1x +12x +7x +7x +8x +8x +12x +35x +35x +35x +24x +35x +11x +11x +35x +35x +35x +8x +12x +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 // + +/** +* Adds a constant to each single-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm. +* +* ## Method +* +* - This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974). +* +* ## References +* +* - Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106). +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} alpha - constant +* @param {Float32Array} x - input array +* @param {integer} stride - stride length +* @returns {number} sum +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* +* var v = sapxsumkbn( 3, 5.0, x, 1 ); +* // returns 16.0 +*/ +function sapxsumkbn( N, alpha, x, stride ) { + var sum; + var ix; + var v; + var t; + var c; + var i; + + if ( N <= 0 ) { + return 0.0; + } + if ( N === 1 || stride === 0 ) { + return float64ToFloat32( alpha + x[ 0 ] ); + } + if ( stride < 0 ) { + ix = (1-N) * stride; + } else { + ix = 0; + } + sum = 0.0; + c = 0.0; + for ( i = 0; i < N; i++ ) { + v = float64ToFloat32( alpha + x[ ix ] ); + t = float64ToFloat32( sum + v ); + if ( abs( sum ) >= abs( v ) ) { + c = float64ToFloat32( c + float64ToFloat32( float64ToFloat32( sum-t ) + v ) ); // eslint-disable-line max-len + } else { + c = float64ToFloat32( c + float64ToFloat32( float64ToFloat32( v-t ) + sum ) ); // eslint-disable-line max-len + } + sum = t; + ix += stride; + } + return float64ToFloat32( sum + c ); +} + + +// EXPORTS // + +module.exports = sapxsumkbn; + |
+ 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 | 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 +57x +57x +57x +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 // + +/** +* Adds a constant to each single-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} alpha - constant +* @param {Float32Array} x - input array +* @param {integer} stride - stride length +* @returns {number} sum +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); +* +* var v = sapxsumkbn( 3, 5.0, x, 1 ); +* // returns 16.0 +*/ +function sapxsumkbn( N, alpha, x, stride ) { + return addon( N, alpha, x, stride ); +} + + +// EXPORTS // + +module.exports = sapxsumkbn; + |