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 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 | 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 3x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 23x 32x 19x 19x 13x 13x 13x 23x 23x 4x 4x 19x 19x 19x 23x 8x 8x 11x 23x 48x 48x 48x 48x 19x 19x 29x 29x 29x 48x 2x 2x 27x 48x 11x 11x 48x 9x 23x 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 isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
// MAIN //
/**
* Computes the minimum value of a strided array according to a mask.
*
* @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 for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Object} mask - mask array object
* @param {Collection} mask.data - mask array data
* @param {Array<Function>} mask.accessors - mask element accessors
* @param {integer} strideMask - stride length for `mask`
* @param {NonNegativeInteger} offsetMask - starting index for `mask`
* @returns {number} Minimum value according to mask.
*
* @example
* var floor = require( '@stdlib/math/base/special/floor' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, -5.0, -6.0 ];
* var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];
* var N = floor( x.length / 2 );
*
* var v = nanmskmin( 5, arraylike2object( toAccessorArray( x ) ), 2, 1, arraylike2object( toAccessorArray( mask ) ), 2, 1 );
* // returns -2.0
*/
function nanmskmin( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
var xbuf;
var mbuf;
var xget;
var mget;
var min;
var ix;
var im;
var v;
var i;
// Cache references to array data:
xbuf = x.data;
mbuf = mask.data;
// Cache references to element accessors:
xget = x.accessors[ 0 ];
mget = mask.accessors[ 0 ];
if ( N <= 0 ) {
return NaN;
}
ix = offsetX;
im = offsetMask;
for ( i = 0; i < N; i++ ) {
if ( mget(mbuf, im) === 0 ) {
break;
}
ix += strideX;
im += strideMask;
}
if ( i === N ) {
return NaN;
}
min = xget(xbuf, ix);
if ( isnan(min) ) {
return NaN;
}
for ( i += 1; i < N; i++ ) {
ix += strideX;
im += strideMask;
if ( mget(mbuf, im) !== 0 ) {
continue;
}
v = xget(xbuf, ix);
if ( isnan(v) ) {
return v;
}
if ( v < min || ( v === min && isNegativeZero(v) ) ) {
min = v;
}
}
return min;
}
// EXPORTS //
module.exports = nanmskmin;
|