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 | 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 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 4x 4x 20x 20x 24x 8x 8x 12x 12x 12x 12x 24x 58x 58x 46x 26x 26x 46x 58x 58x 58x 58x 12x 24x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 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' );
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Computes the cumulative minimum of a strided array, ignoring `NaN` values.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {NumericArray} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @param {NumericArray} y - output array
* @param {integer} strideY - stride length
* @param {NonNegativeInteger} offsetY - starting index
* @returns {NumericArray} output array
*
* @example
* var x = [ 2.0, 1.0, 2.0, -2.0, NaN, -4.0 ];
* var y = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* var v = nancumin( 6, x, 1, 0, y, 1, 0 );
* // returns [ 2.0, 1.0, 1.0, -2.0, -2.0, -4.0 ]
*/
function nancumin( N, x, strideX, offsetX, y, strideY, offsetY ) {
var min;
var ix;
var iy;
var ox;
var oy;
var v;
var i;
if ( N <= 0 ) {
return y;
}
ox = arraylike2object( x );
oy = arraylike2object( y );
if ( ox.accessorProtocol || oy.accessorProtocol ) {
return accessors( N, ox, strideX, offsetX, oy, strideY, offsetY );
}
ix = offsetX;
iy = offsetY;
min = Infinity;
for ( i = 0; i < N; i++ ) {
v = x[ ix ];
if ( isnan( v ) === false ) {
if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
min = v;
}
}
y[ iy ] = min;
ix += strideX;
iy += strideY;
}
return y;
}
// EXPORTS //
module.exports = nancumin;
|