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 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 | 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 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 2x 2x 4x 4x 4x 4x 4x 6x 6x 2x 2x 4x 4x 4x 4x 4x 4x 2x 2x 12x 14x 47x 47x 47x 47x 47x 89x 89x 34x 34x 55x 55x 55x 47x 47x 47x 12x 14x 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';
// MAIN //
/**
* Sorts a strided array using insertion sort according to a provided callback function.
*
* @private
* @param {PositiveInteger} N - number of indexed elements
* @param {Object} x - input array object
* @param {Collection} x.data - input array data
* @param {Array<Function>} x.accessors - array element accessors
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @param {Callback} clbk - callback function
* @param {*} [thisArg] - execution context
* @returns {Object} `x`
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* var x = [ 1.0, -2.0, 3.0, -4.0 ];
*
* function clbk( a, b ) {
* if ( a < b ) {
* return -1;
* }
* if ( a > b ) {
* return 1;
* }
* return 0;
* }
*
* gsortinsBy( x.length, arraylike2object( toAccessorArray( x ) ), 1, 0, clbk );
*
* console.log( x );
* // => [ -4.0, -2.0, 1.0, 3.0 ]
*/
function gsortinsBy( N, x, strideX, offsetX, clbk, thisArg ) {
var xbuf;
var xget;
var xset;
var ix;
var jx;
var fx;
var v;
var u;
var i;
// Cache reference to array data:
xbuf = x.data;
// Cache references to element accessors:
xget = x.accessors[ 0 ];
xset = x.accessors[ 1 ];
fx = offsetX; // first index
ix = fx + strideX;
if ( strideX < 0 ) {
// Traverse the strided array from right-to-left...
for ( i = 1; i < N; i++ ) {
v = xget( xbuf, ix );
jx = ix - strideX;
// Shift all larger values to the right of the current element to the left...
while ( jx <= fx ) {
u = xget( xbuf, jx );
if ( clbk.call( thisArg, u, v, x ) <= 0 ) {
break;
}
xset( xbuf, jx+strideX, u );
jx -= strideX;
}
xset( xbuf, jx+strideX, v );
ix += strideX;
}
return x;
}
// Traverse the strided array from left-to-right...
for ( i = 1; i < N; i++ ) {
v = xget( xbuf, ix );
jx = ix - strideX;
// Shift all larger values to the left of the current element to the right...
while ( jx >= fx ) {
u = xget( xbuf, jx );
if ( clbk.call( thisArg, u, v, x ) <= 0 ) {
break;
}
xset( xbuf, jx+strideX, u );
jx -= strideX;
}
xset( xbuf, jx+strideX, v );
ix += strideX;
}
return x;
}
// EXPORTS //
module.exports = gsortinsBy;
|