time-to-botec

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

snanrange.c (1723B)


      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/stats/base/snanrange.h"
     20 #include "stdlib/math/base/assert/is_nanf.h"
     21 #include <stdint.h>
     22 
     23 /**
     24 * Computes the range of a single-precision floating-point strided array, ignoring `NaN` values.
     25 *
     26 * @param N       number of indexed elements
     27 * @param X       input array
     28 * @param stride  stride length
     29 * @return        output value
     30 */
     31 float stdlib_strided_snanrange( const int64_t N, const float *X, const int64_t stride ) {
     32 	int64_t ix;
     33 	int64_t i;
     34 	float max;
     35 	float min;
     36 	float v;
     37 
     38 	if ( N <= 0 ) {
     39 		return 0.0f / 0.0f; // NaN
     40 	}
     41 	if ( N == 1 || stride == 0 ) {
     42 		if ( stdlib_base_is_nanf( X[ 0 ] ) ) {
     43 			return X[ 0 ];
     44 		}
     45 		return 0.0f;
     46 	}
     47 	if ( stride < 0 ) {
     48 		ix = (1-N) * stride;
     49 	} else {
     50 		ix = 0;
     51 	}
     52 	for ( i = 0; i < N; i++ ) {
     53 		v = X[ ix ];
     54 		if ( v == v ) {
     55 			break;
     56 		}
     57 		ix += stride;
     58 	}
     59 	if ( i == N ) {
     60 		return 0.0f / 0.0f; // NaN
     61 	}
     62 	min = v;
     63 	max = min;
     64 	i += 1;
     65 	for (; i < N; i++ ) {
     66 		ix += stride;
     67 		v = X[ ix ];
     68 		if ( stdlib_base_is_nanf( v ) ) {
     69 			continue;
     70 		}
     71 		if ( v < min ) {
     72 			min = v;
     73 		} else if ( v > max ) {
     74 			max = v;
     75 		}
     76 	}
     77 	return max -  min;
     78 }