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 | 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 38x 38x 38x 38x 38x 38x 38x 38x 6x 6x 32x 38x 15x 15x 15x 32x 32x 32x 32x 32x 38x 15x 15x 15x 15x 208x 157x 157x 157x 208x 6x 6x 6x 45x 45x 45x 45x 45x 45x 45x 15x 15x 17x 17x 17x 38x 215x 155x 155x 155x 215x 12x 12x 12x 48x 48x 48x 48x 48x 48x 48x 17x 38x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2025 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 isnan = require( '@stdlib/math/base/assert/is-nan' );
// MAIN //
/**
* Partitions a double-precision floating-point strided array by moving all NaNs either to the beginning or the end of the array.
*
* ## Notes
*
* - The algorithm is not stable, meaning that the relative order of non-NaN elements is not guaranteed to be preserved.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} order - NaN placement order
* @param {Float64Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {Float64Array} input array
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 1.0, -2.0, NaN, 3.0, -4.0, NaN ] );
*
* dsortnans( x.length, 1.0, x, 1, 0 );
* // x => <Float64Array>[ 1.0, -2.0, -4.0, 3.0, NaN, NaN ]
*/
function dsortnans( N, order, x, strideX, offsetX ) {
var tmp;
var ix;
var jx;
var fx;
var lx;
if ( N <= 0 || order === 0.0 ) {
return x;
}
// For a positive stride, placing NaNs at the beginning is equivalent to providing a negative stride and placing NaNs at the end, and, for a negative stride, placing NaNs at the end is equivalent to providing a positive stride and placing NaNs at the beginning...
if ( order < 0.0 ) {
strideX *= -1;
offsetX -= ( N-1 ) * strideX;
}
fx = offsetX; // first index
lx = fx + ((N-1)*strideX); // last index
ix = fx;
jx = lx;
if ( strideX < 0 ) {
// Traverse the strided array from right-to-left...
// Partition array by moving NaNs to the beginning...
while ( ix >= jx ) {
if ( !isnan( x[ ix ] ) ) {
ix += strideX;
continue;
}
if ( isnan( x[ jx ] ) ) {
jx -= strideX;
continue;
}
// Swap NaN on the right with non-NaN on the left and continue partitioning...
tmp = x[ ix ];
x[ ix ] = x[ jx ];
x[ jx ] = tmp;
ix += strideX;
jx -= strideX;
}
return x;
}
// Traverse the strided array from left-to-right...
// Partition array by moving NaNs to the end...
while ( ix <= jx ) {
if ( !isnan( x[ ix ] ) ) {
ix += strideX;
continue;
}
if ( isnan( x[ jx ] ) ) {
jx -= strideX;
continue;
}
// Swap NaN on the left with non-NaN on the right and continue partitioning...
tmp = x[ ix ];
x[ ix ] = x[ jx ];
x[ jx ] = tmp;
ix += strideX;
jx -= strideX;
}
return x;
}
// EXPORTS //
module.exports = dsortnans;
|