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 | 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 16x 16x 16x 16x 16x 16x 4x 4x 12x 12x 16x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 18x 12x 12x 16x 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 //
/**
* Sifts a value down from a specified index in a double-precision floating-point strided min-heap until the heap property is restored using alternative indexing semantics.
*
* ## Notes
*
* - The function assumes that the subtrees rooted at the children of `index` already satisfy the min-heap property and only the value being sifted may violate the min-heap invariant.
* - The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {NonNegativeInteger} index - logical index at which to begin sifting
* @param {number} value - value to place into the heap
* @param {Float64Array} x - heap storage array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {Float64Array} heap storage array
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
*
* dminheapSiftDown( 5, 0, 7.0, x, 1, 0 );
* // x => <Float64Array>[ 2.0, 4.0, 3.0, 7.0, 5.0 ]
*/
function dminheapSiftDown( N, index, value, x, strideX, offsetX ) {
var ridx;
var cidx;
var j;
if ( N <= 0 ) {
return x;
}
ridx = offsetX + ( index*strideX );
j = ( index*2 ) + 1;
while ( j < N ) {
cidx = offsetX + ( j*strideX );
// Find the smaller child...
if ( j+1 < N && x[ offsetX+((j+1)*strideX) ] < x[ cidx ] ) {
j += 1;
cidx = offsetX + ( j*strideX );
}
// Stop if the value is already smaller than (or equal to) the smaller child...
if ( x[ cidx ] >= value ) {
break;
}
// Move the child up...
x[ ridx ] = x[ cidx ];
index = j;
ridx = cidx;
j = ( index*2 ) + 1;
}
x[ ridx ] = value;
return x;
}
// EXPORTS //
module.exports = dminheapSiftDown;
|