time-to-botec

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

dsnannsumors.c (1689B)


      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 #include "stdlib/blas/ext/base/dsnannsumors.h"
     20 #include "stdlib/math/base/assert/is_nanf.h"
     21 #include <stdint.h>
     22 
     23 /**
     24 * 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.
     25 *
     26 * @param N       number of indexed elements
     27 * @param X       input array
     28 * @param stride  stride length
     29 * @param n       pointer for storing the number of non-NaN elements
     30 * @return        output value
     31 */
     32 double stdlib_strided_dsnannsumors( const int64_t N, const float *X, const int64_t stride, int64_t *n ) {
     33 	double sum;
     34 	int64_t ix;
     35 	int64_t i;
     36 
     37 	sum = 0.0;
     38 	*n = 0;
     39 	if ( N <= 0 ) {
     40 		return sum;
     41 	}
     42 	if ( N == 1 || stride == 0 ) {
     43 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
     44 			return sum;
     45 		}
     46 		*n += 1;
     47 		return X[ 0 ];
     48 	}
     49 	if ( stride < 0 ) {
     50 		ix = (1-N) * stride;
     51 	} else {
     52 		ix = 0;
     53 	}
     54 	for ( i = 0; i < N; i++ ) {
     55 		if ( !stdlib_base_is_nanf( X[ ix ] ) ) {
     56 			sum += (double)X[ ix ];
     57 			*n += 1;
     58 		}
     59 		ix += stride;
     60 	}
     61 	return sum;
     62 }