Spaces:
Running
Running
File size: 3,112 Bytes
a28eca3 |
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 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 |
// Hybrid radix sort from
// - https://gist.github.com/sciecode/93ed864dd77c5c8803c6a86698d68dab
// - https://github.com/mrdoob/three.js/pull/27202#issuecomment-1817640271
//
// expects unsigned 32b integer values
const POWER = 3;
const BIT_MAX = 32;
const BIN_BITS = 1 << POWER;
const BIN_SIZE = 1 << BIN_BITS;
const BIN_MAX = BIN_SIZE - 1;
const ITERATIONS = BIT_MAX / BIN_BITS;
const bins = new Array( ITERATIONS );
const bins_buffer = new ArrayBuffer( ( ITERATIONS + 1 ) * BIN_SIZE * 4 );
let c = 0;
for ( let i = 0; i < ( ITERATIONS + 1 ); i ++ ) {
bins[ i ] = new Uint32Array( bins_buffer, c, BIN_SIZE );
c += BIN_SIZE * 4;
}
const defaultGet = ( el ) => el;
export const radixSort = ( arr, opt ) => {
const len = arr.length;
const options = opt || {};
const aux = options.aux || new arr.constructor( len );
const get = options.get || defaultGet;
const data = [ arr, aux ];
let compare, accumulate, recurse;
if ( options.reversed ) {
compare = ( a, b ) => a < b;
accumulate = ( bin ) => {
for ( let j = BIN_SIZE - 2; j >= 0; j -- )
bin[ j ] += bin[ j + 1 ];
};
recurse = ( cache, depth, start ) => {
let prev = 0;
for ( let j = BIN_MAX; j >= 0; j -- ) {
const cur = cache[ j ], diff = cur - prev;
if ( diff != 0 ) {
if ( diff > 32 )
radixSortBlock( depth + 1, start + prev, diff );
else
insertionSortBlock( depth + 1, start + prev, diff );
prev = cur;
}
}
};
} else {
compare = ( a, b ) => a > b;
accumulate = ( bin ) => {
for ( let j = 1; j < BIN_SIZE; j ++ )
bin[ j ] += bin[ j - 1 ];
};
recurse = ( cache, depth, start ) => {
let prev = 0;
for ( let j = 0; j < BIN_SIZE; j ++ ) {
const cur = cache[ j ], diff = cur - prev;
if ( diff != 0 ) {
if ( diff > 32 )
radixSortBlock( depth + 1, start + prev, diff );
else
insertionSortBlock( depth + 1, start + prev, diff );
prev = cur;
}
}
};
}
const insertionSortBlock = ( depth, start, len ) => {
const a = data[ depth & 1 ];
const b = data[ ( depth + 1 ) & 1 ];
for ( let j = start + 1; j < start + len; j ++ ) {
const p = a[ j ], t = get( p ) >>> 0;
let i = j;
while ( i > start ) {
if ( compare( get( a[ i - 1 ] ) >>> 0, t ) )
a[ i ] = a[ -- i ];
else
break;
}
a[ i ] = p;
}
if ( ( depth & 1 ) == 1 ) {
for ( let i = start; i < start + len; i ++ )
b[ i ] = a[ i ];
}
};
const radixSortBlock = ( depth, start, len ) => {
const a = data[ depth & 1 ];
const b = data[ ( depth + 1 ) & 1 ];
const shift = ( 3 - depth ) << POWER;
const end = start + len;
const cache = bins[ depth ];
const bin = bins[ depth + 1 ];
bin.fill( 0 );
for ( let j = start; j < end; j ++ )
bin[ ( get( a[ j ] ) >>> shift ) & BIN_MAX ] ++;
accumulate( bin );
cache.set( bin );
for ( let j = end - 1; j >= start; j -- )
b[ start + -- bin[ ( get( a[ j ] ) >>> shift ) & BIN_MAX ] ] = a[ j ];
if ( depth == ITERATIONS - 1 ) return;
recurse( cache, depth, start );
};
radixSortBlock( 0, 0, len );
};
|