All files snannsumkbn.js

100% Statements 60/60
100% Branches 2/2
100% Functions 1/1
100% Lines 60/60

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 612x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 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 2x 2x 2x 2x 2x  
/**
* @license Apache-2.0
*
* Copyright (c) 2026 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 stride2offset = require( '@stdlib/strided/base/stride2offset' );
var ndarray = require( './ndarray.js' );
 
 
// MAIN //
 
/**
* Computes the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using an improved Kahan–Babuška algorithm, and returning the number of non-`NaN` elements.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Float32Array} x - input array
* @param {integer} strideX - stride length for `x`
* @param {Float32Array} sum - output array for storing the sum
* @param {Int64Array} count - output array for storing the number of non-NaN elements
* @returns {Float32Array} `sum`
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
* var Int64Array = require( '@stdlib/array/int64' );
*
* var x = new Float32Array( [ 1.0, -2.0, NaN, 2.0 ] );
* var sum = new Float32Array( 1 );
* var count = new Int64Array( 1 );
*
* var v = snannsumkbn( x.length, x, 1, sum, count );
* // returns <Float32Array>[ 1.0 ]
*
* var n = count.get( 0 );
* // returns <Int64>[ 3n ]
*/
function snannsumkbn( N, x, strideX, sum, count ) {
	return ndarray( N, x, strideX, stride2offset( N, strideX ), sum, 0, count, 0 );
}
 
 
// EXPORTS //
 
module.exports = snannsumkbn;