time-to-botec

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

snanmskmax.c (2008B)

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