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 | 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 34x 34x 34x 34x 34x 34x 34x 34x 4x 4x 34x 6x 6x 24x 24x 34x 6x 6x 34x 14x 14x 14x 6x 6x 8x 8x 4x 34x 23x 23x 11x 11x 23x 4x 34x 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 abs = require( '@stdlib/math/base/special/abs' );
// MAIN //
/**
* Computes the minimum absolute value of a sorted double-precision floating-point strided array.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Float64Array} x - sorted input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {number} minimum absolute value
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ -4.0, -3.0, -2.0, -1.0, 2.0, 3.0, 4.0, 5.0 ] );
*
* var v = dminabssorted( 4, x, 2, 1 );
* // returns 1.0
*/
function dminabssorted( N, x, strideX, offsetX ) {
var minAbs;
var val;
var v1;
var v2;
var i;
if ( N <= 0 ) {
return NaN;
}
if ( N === 1 || strideX === 0 ) {
return abs( x[ offsetX ] );
}
v1 = x[ offsetX ];
v2 = x[ offsetX + ( ( N - 1 ) * strideX ) ];
if ( isnan( v1 ) || isnan( v2 ) ) {
return NaN;
}
if ( ( v1 <= 0 && v2 <= 0 ) || ( v1 >= 0 && v2 >= 0 ) ) {
v1 = abs( v1 );
v2 = abs( v2 );
if ( v1 < v2 ) {
return v1;
}
return v2;
}
minAbs = abs( v1 );
for ( i = 1; i < N; i++ ) {
val = abs( x[ offsetX + ( i * strideX ) ] );
if ( val < minAbs ) {
minAbs = val;
}
}
return minAbs;
}
// EXPORTS //
module.exports = dminabssorted;
|