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 | 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 23x 23x 23x 23x 23x 23x 4x 4x 23x 2x 2x 17x 17x 23x 6x 23x 11x 11x 17x 23x 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 floor = require( '@stdlib/math/base/special/floor' );
var dmediansorted = require( '@stdlib/stats/strided/dmediansorted' );
// MAIN //
/**
* Computes the interquartile range 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} interquartile range
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
*
* var v = diqrsorted( 5, x, 1, 0 );
* // returns 3.0
*/
function diqrsorted( N, x, strideX, offsetX ) {
var q1;
var q3;
var k;
if ( N <= 0 ) {
return NaN;
}
if ( N === 1 ) {
return 0.0;
}
k = floor( N / 2 );
q1 = dmediansorted.ndarray( k, x, strideX, offsetX );
if ( N % 2 === 0 ) {
q3 = dmediansorted.ndarray( k, x, strideX, offsetX + (k * strideX) );
} else {
q3 = dmediansorted.ndarray( k, x, strideX, offsetX + ((k + 1) * strideX) );
}
return q3 - q1;
}
// EXPORTS //
module.exports = diqrsorted;
|