@stdlib/stats
Version:
Standard library statistical functions.
78 lines (67 loc) • 1.73 kB
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.
*/
;
// MODULES //
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var abs = require( '@stdlib/math/base/special/abs' );
// MAIN //
/**
* Computes the maximum absolute value of a sorted single-precision floating-point strided array.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Float32Array} x - sorted input array
* @param {integer} stride - stride length
* @returns {number} maximum absolute value
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ -1.0, -2.0, -3.0 ] );
* var N = x.length;
*
* var v = smaxabssorted( N, x, 1 );
* // returns 3.0
*/
function smaxabssorted( N, x, stride ) {
var v1;
var v2;
if ( N <= 0 ) {
return NaN;
}
if ( N === 1 || stride === 0 ) {
return x[ 0 ];
}
if ( stride < 0 ) {
v1 = x[ (1-N) * stride ];
v2 = x[ 0 ];
} else {
v1 = x[ 0 ];
v2 = x[ (N-1) * stride ];
}
if ( isnanf( v1 ) || isnanf( v2 ) ) {
return NaN;
}
v1 = abs( v1 );
v2 = abs( v2 );
if ( v1 > v2 ) {
return v1;
}
return v2;
}
// EXPORTS //
module.exports = smaxabssorted;