+ 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 | 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 +12x +12x +12x +2x +2x +12x +2x +2x +12x +1x +12x +7x +7x +8x +8x +8x +12x +35x +35x +35x +24x +35x +11x +11x +35x +35x +35x +32x +35x +3x +3x +35x +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 abs = require( '@stdlib/math/base/special/abs' );
+
+
+// MAIN //
+
+/**
+* Adds a constant to each double-precision floating-point strided array element and computes the sum 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} alpha - constant
+* @param {Float64Array} x - input array
+* @param {integer} stride - stride length
+* @returns {number} sum
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
+* var N = x.length;
+*
+* var v = dapxsumkbn2( N, 5.0, x, 1 );
+* // returns 16.0
+*/
+function dapxsumkbn2( N, alpha, x, stride ) {
+ var sum;
+ var ccs;
+ var ix;
+ var cs;
+ var cc;
+ var v;
+ var t;
+ var c;
+ var i;
+
+ if ( N <= 0 ) {
+ return 0.0;
+ }
+ if ( N === 1 || stride === 0 ) {
+ return alpha + x[ 0 ];
+ }
+ if ( stride < 0 ) {
+ ix = (1-N) * stride;
+ } else {
+ ix = 0;
+ }
+ sum = 0.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 = alpha + x[ ix ];
+ t = sum + v;
+ if ( abs( sum ) >= abs( v ) ) {
+ c = (sum-t) + v;
+ } else {
+ c = (v-t) + sum;
+ }
+ sum = t;
+ t = cs + c;
+ if ( abs( cs ) >= abs( c ) ) {
+ cc = (cs-t) + c;
+ } else {
+ cc = (c-t) + cs;
+ }
+ cs = t;
+ ccs += cc;
+ ix += stride;
+ }
+ return sum + cs + ccs;
+}
+
+
+// EXPORTS //
+
+module.exports = dapxsumkbn2;
+ |
+ 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 | 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 +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 double-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} alpha - constant
+* @param {Float64Array} x - input array
+* @param {integer} stride - stride length
+* @returns {number} sum
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
+* var N = x.length;
+*
+* var v = dapxsumkbn2( N, 5.0, x, 1 );
+* // returns 16.0
+*/
+function dapxsumkbn2( N, alpha, x, stride ) {
+ return addon( N, alpha, x, stride );
+}
+
+
+// EXPORTS //
+
+module.exports = dapxsumkbn2;
+ |
+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +| File | ++ | Statements | ++ | Branches | ++ | Functions | ++ | Lines | ++ |
|---|---|---|---|---|---|---|---|---|---|
| dapxsumkbn2.js | +
+
+ |
+ 100% | +104/104 | +100% | +16/16 | +100% | +1/1 | +100% | +104/104 | +
| dapxsumkbn2.native.js | +
+
+ |
+ 100% | +53/53 | +100% | +2/2 | +100% | +1/1 | +100% | +53/53 | +
| 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% | +100/100 | +100% | +13/13 | +100% | +1/1 | +100% | +100/100 | +
| ndarray.native.js | +
+
+ |
+ 100% | +61/61 | +100% | +2/2 | +100% | +1/1 | +100% | +61/61 | +
+ 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 double-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
+*
+* @module @stdlib/blas/ext/base/dapxsumkbn2
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var dapxsumkbn2 = require( '@stdlib/blas/ext/base/dapxsumkbn2' );
+*
+* var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
+*
+* var v = dapxsumkbn2( 3, 5.0, x, 1 );
+* // returns 16.0
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+* var dapxsumkbn2 = require( '@stdlib/blas/ext/base/dapxsumkbn2' );
+*
+* var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
+*
+* var v = dapxsumkbn2.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 dapxsumkbn2;
+var tmp = tryRequire( join( __dirname, './native.js' ) );
+if ( isError( tmp ) ) {
+ dapxsumkbn2 = main;
+} else {
+ dapxsumkbn2 = tmp;
+}
+
+
+// EXPORTS //
+
+module.exports = dapxsumkbn2;
+
+// exports: { "ndarray": "dapxsumkbn2.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 dapxsumkbn2 = require( './dapxsumkbn2.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( dapxsumkbn2, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = dapxsumkbn2; + |
+ 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 dapxsumkbn2 = require( './dapxsumkbn2.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( dapxsumkbn2, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = dapxsumkbn2; + |
+ 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 | 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 +12x +12x +12x +2x +2x +12x +2x +2x +8x +8x +8x +8x +12x +35x +35x +35x +24x +35x +11x +11x +35x +35x +35x +32x +35x +3x +3x +35x +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 abs = require( '@stdlib/math/base/special/abs' );
+
+
+// MAIN //
+
+/**
+* Adds a constant to each double-precision floating-point strided array element and computes the sum 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} alpha - constant
+* @param {Float64Array} x - input array
+* @param {integer} stride - stride length
+* @param {NonNegativeInteger} offset - starting index
+* @returns {number} sum
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
+*
+* var v = dapxsumkbn2( 4, 5.0, x, 2, 1 );
+* // returns 25.0
+*/
+function dapxsumkbn2( N, alpha, x, stride, offset ) {
+ var sum;
+ var ccs;
+ var ix;
+ var cs;
+ var cc;
+ var v;
+ var t;
+ var c;
+ var i;
+
+ if ( N <= 0 ) {
+ return 0.0;
+ }
+ if ( N === 1 || stride === 0 ) {
+ return alpha + x[ 0 ];
+ }
+ ix = offset;
+ sum = 0.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 = alpha + x[ ix ];
+ t = sum + v;
+ if ( abs( sum ) >= abs( v ) ) {
+ c = (sum-t) + v;
+ } else {
+ c = (v-t) + sum;
+ }
+ sum = t;
+ t = cs + c;
+ if ( abs( cs ) >= abs( c ) ) {
+ cc = (cs-t) + c;
+ } else {
+ cc = (c-t) + cs;
+ }
+ cs = t;
+ ccs += cc;
+ ix += stride;
+ }
+ return sum + cs + ccs;
+}
+
+
+// EXPORTS //
+
+module.exports = dapxsumkbn2;
+ |
+ 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 | 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 +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( './dapxsumkbn2.native.js' );
+
+
+// MAIN //
+
+/**
+* Adds a constant to each double-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} alpha - constant
+* @param {Float64Array} x - input array
+* @param {integer} stride - stride length
+* @param {NonNegativeInteger} offset - starting index
+* @returns {number} sum
+*
+* @example
+* var Float64Array = require( '@stdlib/array/float64' );
+*
+* var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
+*
+* var v = dapxsumkbn2( 4, 5.0, x, 2, 1 );
+* // returns 25.0
+*/
+function dapxsumkbn2( 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 = dapxsumkbn2;
+ |