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 89 90 91 92 93 94 95 96 97 98 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 17x 17x 17x 17x 17x 17x 17x 2x 2x 17x 5x 5x 2x 2x 3x 3x 17x 1x 17x 9x 9x 17x 17x 17x 8x 8x 9x 9x 17x 2x 2x 8x 17x 31x 31x 31x 10x 10x 31x 7x 7x 31x 8x 17x 2x 2x 2x 2x 2x | /**
* @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 isnan = require( '@stdlib/math/base/assert/is-nan' );
var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
// MAIN //
/**
* Calculates the minimum value of a strided array via a callback function, ignoring `NaN` values.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Collection} x - input array/collection
* @param {integer} stride - index increment
* @param {Callback} clbk - callback
* @param {*} [thisArg] - execution context
* @returns {number} minimum value
*
* @example
* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, NaN, 0.0, -1.0, -3.0 ];
*
* function accessor( v ) {
* return v * 2.0;
* }
*
* var v = nanminBy( x.length, x, 1, accessor );
* // returns -10.0
*/
function nanminBy( N, x, stride, clbk, thisArg ) {
var min;
var ix;
var v;
var i;
if ( N <= 0 ) {
return NaN;
}
if ( N === 1 || stride === 0 ) {
v = clbk.call( thisArg, x[ 0 ], 0, 0, x );
if ( v === void 0 ) {
return NaN;
}
return v;
}
if ( stride < 0 ) {
ix = (1-N) * stride;
} else {
ix = 0;
}
for ( i = 0; i < N; i++ ) {
min = clbk.call( thisArg, x[ ix ], i, ix, x );
if ( min === min && min !== void 0 ) {
break;
}
ix += stride;
}
if ( i === N ) {
return NaN;
}
i += 1;
for ( i; i < N; i++ ) {
ix += stride;
v = clbk.call( thisArg, x[ ix ], i, ix, x );
if ( v === void 0 || isnan( v ) ) {
continue;
}
if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
min = v;
}
}
return min;
}
// EXPORTS //
module.exports = nanminBy;
|