time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

dsnannsumors.js (2286B)


      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2020 The Stdlib Authors.
      5 *
      6 * Licensed under the Apache License, Version 2.0 (the "License");
      7 * you may not use this file except in compliance with the License.
      8 * You may obtain a copy of the License at
      9 *
     10 *    http://www.apache.org/licenses/LICENSE-2.0
     11 *
     12 * Unless required by applicable law or agreed to in writing, software
     13 * distributed under the License is distributed on an "AS IS" BASIS,
     14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     15 * See the License for the specific language governing permissions and
     16 * limitations under the License.
     17 */
     18 
     19 'use strict';
     20 
     21 // MODULES //
     22 
     23 var isnan = require( '@stdlib/math/base/assert/is-nan' );
     24 
     25 
     26 // MAIN //
     27 
     28 /**
     29 * Computes the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using ordinary recursive summation with extended accumulation, and returning an extended precision result.
     30 *
     31 * @param {PositiveInteger} N - number of indexed elements
     32 * @param {Float32Array} x - input array
     33 * @param {integer} strideX - `x` stride length
     34 * @param {Float64Array} out - output array
     35 * @param {integer} strideOut - `out` stride length
     36 * @returns {Float64Array} output array
     37 *
     38 * @example
     39 * var Float32Array = require( '@stdlib/array/float32' );
     40 * var Float64Array = require( '@stdlib/array/float64' );
     41 *
     42 * var x = new Float32Array( [ 1.0, -2.0, NaN, 2.0 ] );
     43 * var out = new Float64Array( 2 );
     44 *
     45 * var v = dsnannsumors( x.length, x, 1, out, 1 );
     46 * // returns <Float64Array>[ 1.0, 3 ]
     47 */
     48 function dsnannsumors( N, x, strideX, out, strideOut ) {
     49 	var sum;
     50 	var ix;
     51 	var io;
     52 	var n;
     53 	var i;
     54 
     55 	if ( strideX < 0 ) {
     56 		ix = (1-N) * strideX;
     57 	} else {
     58 		ix = 0;
     59 	}
     60 	if ( strideOut < 0 ) {
     61 		io = -strideOut;
     62 	} else {
     63 		io = 0;
     64 	}
     65 	sum = 0.0;
     66 	if ( N <= 0 ) {
     67 		out[ io ] = sum;
     68 		out[ io+strideOut ] = 0;
     69 		return out;
     70 	}
     71 	if ( N === 1 || strideX === 0 ) {
     72 		if ( isnan( x[ ix ] ) ) {
     73 			out[ io ] = sum;
     74 			out[ io+strideOut ] = 0;
     75 			return out;
     76 		}
     77 		out[ io ] = x[ ix ];
     78 		out[ io+strideOut ] = 1;
     79 		return out;
     80 	}
     81 	n = 0;
     82 	for ( i = 0; i < N; i++ ) {
     83 		if ( isnan( x[ ix ] ) === false ) {
     84 			sum += x[ ix ];
     85 			n += 1;
     86 		}
     87 		ix += strideX;
     88 	}
     89 	out[ io ] = sum;
     90 	out[ io+strideOut ] = n;
     91 	return out;
     92 }
     93 
     94 
     95 // EXPORTS //
     96 
     97 module.exports = dsnannsumors;