85 lines
1.9 KiB
JavaScript
85 lines
1.9 KiB
JavaScript
|
/**
|
||
|
|
* @license Apache-2.0
|
||
|
|
*
|
||
|
|
* Copyright (c) 2020 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 isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' );
|
||
|
|
var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
|
||
|
|
var isnan = require( '@stdlib/math/base/assert/is-nan' );
|
||
|
|
|
||
|
|
|
||
|
|
// MAIN //
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Computes the mid-range of a double-precision floating-point strided array.
|
||
|
|
*
|
||
|
|
* @param {PositiveInteger} N - number of indexed elements
|
||
|
|
* @param {Float64Array} x - input array
|
||
|
|
* @param {integer} stride - stride length
|
||
|
|
* @returns {number} mid-range
|
||
|
|
*
|
||
|
|
* @example
|
||
|
|
* var Float64Array = require( '@stdlib/array/float64' );
|
||
|
|
*
|
||
|
|
* var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
|
||
|
|
*
|
||
|
|
* var v = dmidrange( x.length, x, 1 );
|
||
|
|
* // returns 0.0
|
||
|
|
*/
|
||
|
|
function dmidrange( N, x, stride ) {
|
||
|
|
var max;
|
||
|
|
var min;
|
||
|
|
var ix;
|
||
|
|
var v;
|
||
|
|
var i;
|
||
|
|
|
||
|
|
if ( N <= 0 ) {
|
||
|
|
return NaN;
|
||
|
|
}
|
||
|
|
if ( N === 1 || stride === 0 ) {
|
||
|
|
return x[ 0 ];
|
||
|
|
}
|
||
|
|
if ( stride < 0 ) {
|
||
|
|
ix = (1-N) * stride;
|
||
|
|
} else {
|
||
|
|
ix = 0;
|
||
|
|
}
|
||
|
|
min = x[ ix ];
|
||
|
|
max = min;
|
||
|
|
for ( i = 1; i < N; i++ ) {
|
||
|
|
ix += stride;
|
||
|
|
v = x[ ix ];
|
||
|
|
if ( isnan( v ) ) {
|
||
|
|
return v;
|
||
|
|
}
|
||
|
|
if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
|
||
|
|
min = v;
|
||
|
|
} else if ( v > max || ( v === max && isPositiveZero( v ) ) ) {
|
||
|
|
max = v;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return ( max+min ) / 2.0;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
// EXPORTS //
|
||
|
|
|
||
|
|
module.exports = dmidrange;
|