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 | 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 34x 34x 34x 34x 34x 34x 34x 4x 4x 30x 34x 5x 3x 3x 2x 2x 25x 34x 29x 29x 21x 21x 8x 8x 34x 4x 4x 21x 21x 21x 34x 69x 56x 56x 69x 69x 21x 34x 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 isnan = require( '@stdlib/math/base/assert/is-nan' );
// MAIN //
/**
* Computes the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using ordinary recursive summation.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Float64Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - 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, NaN, NaN ] );
*
* var v = dnansumors( 5, x, 2, 1 );
* // returns 5.0
*/
function dnansumors( N, x, strideX, offsetX ) {
var sum;
var ix;
var v;
var i;
if ( N <= 0 ) {
return 0.0;
}
ix = offsetX;
if ( strideX === 0 ) {
if ( isnan( x[ ix ] ) ) {
return 0.0;
}
return x[ ix ] * N;
}
// Find the first non-NaN element...
for ( i = 0; i < N; i++ ) {
v = x[ ix ];
if ( isnan( v ) === false ) {
break;
}
ix += strideX;
}
if ( i === N ) {
return 0.0;
}
sum = v;
ix += strideX;
i += 1;
for ( ; i < N; i++ ) {
if ( isnan( x[ ix ] ) === false ) {
sum += x[ ix ];
}
ix += strideX;
}
return sum;
}
// EXPORTS //
module.exports = dnansumors;
|