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 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 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 24x 3x 3x 21x 24x 10x 10x 10x 10x 10x 21x 21x 21x 21x 21x 21x 21x 21x 24x 10x 10x 10x 10x 40x 40x 40x 40x 40x 4x 4x 4x 4x 4x 12x 12x 12x 12x 12x 4x 4x 40x 36x 36x 36x 36x 36x 36x 78x 78x 27x 27x 27x 51x 51x 51x 51x 51x 36x 36x 36x 36x 36x 40x 10x 10x 11x 11x 11x 24x 44x 44x 44x 44x 44x 4x 4x 4x 4x 4x 8x 8x 8x 8x 8x 4x 4x 44x 40x 40x 40x 40x 40x 40x 74x 74x 22x 22x 22x 52x 52x 52x 52x 52x 40x 40x 40x 40x 40x 44x 11x 24x 2x 2x 2x 2x 2x | /**
* @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.
*/
'use strict';
// MODULES //
var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
// MAIN //
/**
* Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} order - sort order
* @param {Float64Array} x - first input array
* @param {integer} strideX - `x` index increment
* @param {NonNegativeInteger} offsetX - `x` starting index
* @param {Float64Array} y - second input array
* @param {integer} strideY - `y` index increment
* @param {NonNegativeInteger} offsetY - `y` starting index
* @returns {Float64Array} `x`
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
* var y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
*
* dsort2ins( x.length, 1.0, x, 1, 0, y, 1, 0 );
*
* console.log( x );
* // => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]
*
* console.log( y );
* // => <Float64Array>[ 3.0, 1.0, 0.0, 2.0 ]
*/
function dsort2ins( N, order, x, strideX, offsetX, y, strideY, offsetY ) {
var flg;
var ix;
var jx;
var fx;
var lx;
var iy;
var jy;
var fy;
var ly;
var vx;
var vy;
var ux;
var i;
if ( N <= 0 || order === 0.0 ) {
return x;
}
// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...
if ( order < 0.0 ) {
strideX *= -1;
strideY *= -1;
offsetX -= (N-1) * strideX;
offsetY -= (N-1) * strideY;
}
fx = offsetX; // first index
lx = fx + ((N-1)*strideX); // last index
ix = fx + strideX;
fy = offsetY; // first index
ly = fy + ((N-1)*strideY); // last index
iy = fy + strideY;
if ( strideX < 0 ) {
// Traverse the strided array from right-to-left...
// Sort in increasing order...
for ( i = 1; i < N; i++ ) {
vx = x[ ix ];
vy = y[ iy ];
// Sort `NaN` values to the end (i.e., the left)...
if ( isnan( vx ) ) {
jx = ix;
jy = iy;
// Shift all values (including NaNs) to the left of the current element to the right...
while ( jx > lx ) {
x[ jx ] = x[ jx+strideX ];
y[ jy ] = y[ jy+strideY ];
jx += strideX;
jy += strideY;
}
x[ lx ] = vx;
y[ ly ] = vy;
} else {
flg = isNegativeZero( vx );
jx = ix - strideX;
jy = iy - strideY;
// Shift all larger values to the right of the current element to the left...
while ( jx <= fx ) {
ux = x[ jx ];
if ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len
// Note: positive zeros (and NaNs (e.g., when last element is NaN)) are sorted to the left
break;
}
x[ jx+strideX ] = ux;
y[ jy+strideY ] = y[ jy ];
jx -= strideX;
jy -= strideY;
}
x[ jx+strideX ] = vx;
y[ jy+strideY ] = vy;
ix += strideX;
iy += strideY;
}
}
return x;
}
// Traverse the strided array from left-to-right...
// Sort in increasing order...
for ( i = 1; i < N; i++ ) {
vx = x[ ix ];
vy = y[ iy ];
// Sort `NaN` values to the end...
if ( isnan( vx ) ) {
jx = ix;
jy = iy;
// Shift all values (including NaNs) to the right of the current element to the left...
while ( jx < lx ) {
x[ jx ] = x[ jx+strideX ];
y[ jy ] = y[ jy+strideY ];
jx += strideX;
jy += strideY;
}
x[ lx ] = vx;
y[ ly ] = vy;
} else {
flg = isNegativeZero( vx );
jx = ix - strideX;
jy = iy - strideY;
// Shift all larger values to the left of the current element to the right...
while ( jx >= fx ) {
ux = x[ jx ];
if ( ux <= vx && !(flg && ux === vx && isNegativeZero( ux ) === false) ) { // eslint-disable-line max-len
// Note: positive zeros (and NaNs (e.g., when first element is NaN)) are sorted to the right
break;
}
x[ jx+strideX ] = ux;
y[ jy+strideY ] = y[ jy ];
jx -= strideX;
jy -= strideY;
}
x[ jx+strideX ] = vx;
y[ jy+strideY ] = vy;
ix += strideX;
iy += strideY;
}
}
return x;
}
// EXPORTS //
module.exports = dsort2ins;
|