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 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 24x 24x 24x 24x 24x 24x 24x 4x 4x 24x 6x 6x 14x 24x 16x 16x 12x 12x 4x 4x 24x 2x 2x 12x 12x 24x 46x 46x 46x 12x 12x 46x 14x 14x 46x 12x 24x 3x 3x 3x 3x 3x | /** * @license Apache-2.0 * * Copyright (c) 2020 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 isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var isNegativeZerof = require( '@stdlib/math/base/assert/is-negative-zerof' ); // MAIN // /** * Computes the minimum value of a single-precision floating-point strided array, ignoring `NaN` values. * * @param {PositiveInteger} N - number of indexed elements * @param {Float32Array} x - input array * @param {integer} strideX - stride length * @param {NonNegativeInteger} offsetX - starting index * @returns {number} minimum value * * @example * var Float32Array = require( '@stdlib/array/float32' ); * * var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ] ); * * var v = snanmin( 5, x, 2, 1 ); * // returns -2.0 */ function snanmin( N, x, strideX, offsetX ) { var min; var ix; var v; var i; if ( N <= 0 ) { return NaN; } if ( N === 1 || strideX === 0 ) { return x[ offsetX ]; } ix = offsetX; for ( i = 0; i < N; i++ ) { v = x[ ix ]; if ( v === v ) { break; } ix += strideX; } if ( i === N ) { return NaN; } min = v; i += 1; for ( i; i < N; i++ ) { ix += strideX; v = x[ ix ]; if ( isnanf( v ) ) { continue; } if ( v < min || ( v === min && isNegativeZerof( v ) ) ) { min = v; } } return min; } // EXPORTS // module.exports = snanmin; |