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 99 100 101 102 103 104 105 106 | 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 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 30x 10x 10x 6x 6x 4x 4x 20x 30x 34x 34x 16x 16x 18x 18x 30x 4x 4x 16x 30x 61x 61x 61x 20x 20x 61x 19x 19x 61x 16x 30x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2025 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 isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' );
// MAIN //
/**
* Computes the maximum value of a strided array via a callback function, ignoring `NaN` values.
*
* @private
* @param {PositiveInteger} N - number of indexed elements
* @param {Object} x - input array object
* @param {Collection} x.data - input array data
* @param {Array<Function>} x.accessors - array element accessors
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @param {Callback} clbk - callback
* @param {*} [thisArg] - execution context
* @returns {number} maximum value
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* var x = toAccessorArray( [ -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 = nanmaxBy( x.length, arraylike2object( x ), 1, 0, accessor );
* // returns 8.0
*/
function nanmaxBy( N, x, strideX, offsetX, clbk, thisArg ) {
var xbuf;
var get;
var max;
var ix;
var v;
var i;
// Cache reference to array data:
xbuf = x.data;
// Cache a reference to the element accessor:
get = x.accessors[0];
if ( N === 1 || strideX === 0 ) {
v = clbk.call( thisArg, get( xbuf, offsetX ), 0, offsetX, xbuf );
if ( v === void 0 || isnan( v ) ) {
return NaN;
}
return v;
}
ix = offsetX;
for ( i = 0; i < N; i++ ) {
max = clbk.call( thisArg, get( xbuf, ix ), i, ix, xbuf );
if ( max === max && max !== void 0 ) {
break;
}
ix += strideX;
}
if ( i === N ) {
return NaN;
}
i += 1;
for ( i; i < N; i++ ) {
ix += strideX;
v = clbk.call( thisArg, get( xbuf, ix ), i, ix, xbuf );
if ( v === void 0 || isnan( v ) ) {
continue;
}
if ( v > max || ( v === max && isPositiveZero( v ) ) ) {
max = v;
}
}
return max;
}
// EXPORTS //
module.exports = nanmaxBy;
|