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 | 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 3x 3x 21x 24x 10x 10x 10x 21x 21x 21x 21x 24x 10x 10x 10x 10x 318x 318x 318x 318x 19x 19x 19x 19x 883x 883x 883x 19x 318x 299x 299x 299x 299x 299x 5572x 5572x 283x 283x 283x 5289x 5289x 5289x 299x 299x 299x 318x 10x 10x 11x 11x 11x 24x 322x 322x 322x 322x 23x 23x 23x 23x 1078x 1078x 1078x 23x 322x 299x 299x 299x 299x 299x 5525x 5525x 274x 274x 274x 5251x 5251x 5251x 299x 299x 299x 322x 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 isNegativeZerof = require( '@stdlib/math/base/assert/is-negative-zerof' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
// MAIN //
/**
* Sorts a single-precision floating-point strided array using insertion sort.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} order - sort order
* @param {Float32Array} x - input array
* @param {integer} stride - index increment
* @param {NonNegativeInteger} offset - starting index
* @returns {Float32Array} input array
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
*
* ssortins( x.length, 1.0, x, 1, 0 );
* // x => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
*/
function ssortins( N, order, x, stride, offset ) {
var flg;
var ix;
var jx;
var fx;
var lx;
var v;
var u;
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 ) {
stride *= -1;
offset -= (N-1) * stride;
}
fx = offset; // first index
lx = fx + ((N-1)*stride); // last index
ix = fx + stride;
if ( stride < 0 ) {
// Traverse the strided array from right-to-left...
// Sort in increasing order...
for ( i = 1; i < N; i++ ) {
v = x[ ix ];
// Sort `NaN` values to the end (i.e., the left)...
if ( isnanf( v ) ) {
jx = ix;
// Shift all values (including NaNs) to the left of the current element to the right...
while ( jx > lx ) {
x[ jx ] = x[ jx+stride ];
jx += stride;
}
x[ lx ] = v;
} else {
flg = isNegativeZerof( v );
jx = ix - stride;
// Shift all larger values to the right of the current element to the left...
while ( jx <= fx ) {
u = x[ jx ];
if ( u <= v && !(flg && u === v && isNegativeZerof( u ) === 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+stride ] = u;
jx -= stride;
}
x[ jx+stride ] = v;
ix += stride;
}
}
return x;
}
// Traverse the strided array from left-to-right...
// Sort in increasing order...
for ( i = 1; i < N; i++ ) {
v = x[ ix ];
// Sort `NaN` values to the end...
if ( isnanf( v ) ) {
jx = ix;
// Shift all values (including NaNs) to the right of the current element to the left...
while ( jx < lx ) {
x[ jx ] = x[ jx+stride ];
jx += stride;
}
x[ lx ] = v;
} else {
flg = isNegativeZerof( v );
jx = ix - stride;
// Shift all larger values to the left of the current element to the right...
while ( jx >= fx ) {
u = x[ jx ];
if ( u <= v && !(flg && u === v && isNegativeZerof( u ) === 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+stride ] = u;
jx -= stride;
}
x[ jx+stride ] = v;
ix += stride;
}
}
return x;
}
// EXPORTS //
module.exports = ssortins;
|