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 | 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 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 11x 2x 2x 2x 9x 9x 10x 9x 9x 10x 25x 25x 25x 25x 7x 25x 8x 8x 25x 9x 11x 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' );
// MAIN //
/**
* Computes the range of a strided array using accessors.
*
* @private
* @param {PositiveInteger} N - number of indexed elements
* @param {Object} obj - input array object
* @param {integer} strideX - strideX length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {number} range
*/
function range( N, obj, strideX, offsetX ) {
var xbuf;
var xget;
var min;
var max;
var ix;
var v;
var i;
// Cache references to array data:
xbuf = obj.data;
// Cache references to element accessors:
xget = obj.accessors[ 0 ];
if ( N === 1 || strideX === 0 ) {
v = xget( xbuf, offsetX );
return ( isnan( v ) ) ? NaN : 0.0;
}
ix = offsetX;
v = xget( xbuf, ix );
if ( isnan( v ) ) {
return NaN;
}
min = v;
max = v;
for ( i = 1; i < N; i++ ) {
ix += strideX;
v = xget( xbuf, ix );
if ( isnan( v ) ) {
return NaN;
}
if ( v < min ) {
min = v;
} else if ( v > max ) {
max = v;
}
}
return max - min;
}
// EXPORTS //
module.exports = range;
|