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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 214x 214x 20x 20x 20x 244x 20x 20x 20x 20x 20x 20x 212x 212x 212x 212x 2x 2x 212x 212x 212x 212x 214x 214x 212x 212x 214x 214x 212x 212x 20x 20x 1x 1x 1x 1x 1x | /**
* @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';
// MAIN //
/**
* Computes the ranks of values in an array, handling ties by averaging.
*
* @private
* @param {NumericArray} x - input data array
* @returns {Array<number>} array of ranks
*
* @example
* var x = [ 3.0, 1.0, 2.0, 2.0 ];
* var r = rankData( x );
* // returns [ 4.0, 1.0, 2.5, 2.5 ]
*/
function rankData( x ) {
var sorted;
var ranks;
var sum;
var cnt;
var n;
var i;
var j;
n = x.length;
// Create an array of [value, originalIndex] pairs:
sorted = [];
for ( i = 0; i < n; i++ ) {
sorted.push( [ x[ i ], i ] );
}
// Sort by value:
sorted.sort( function compare( a, b ) {
return a[ 0 ] - b[ 0 ];
});
// Assign ranks, averaging tied values:
ranks = [];
i = 0;
while ( i < n ) {
j = i;
// Find the group of tied values:
while ( j < n - 1 && sorted[ j ][ 0 ] === sorted[ j + 1 ][ 0 ] ) {
j += 1;
}
// Compute the average rank for the tied group:
cnt = j - i + 1;
sum = 0;
for ( j = i; j < i + cnt; j++ ) {
sum += j + 1; // Ranks are 1-based
}
// Assign the average rank to each tied element:
for ( j = i; j < i + cnt; j++ ) {
ranks[ sorted[ j ][ 1 ] ] = sum / cnt;
}
i += cnt;
}
return ranks;
}
// EXPORTS //
module.exports = rankData;
|