+ Press n or j to go to the next uncovered block, b, p or k for the previous block. +
+ +| File | ++ | Statements | ++ | Branches | ++ | Functions | ++ | Lines | ++ |
|---|---|---|---|---|---|---|---|---|---|
| index.js | +
+
+ |
+ 100% | +80/80 | +100% | +3/3 | +100% | +0/0 | +100% | +80/80 | +
| main.js | +
+
+ |
+ 100% | +35/35 | +100% | +1/1 | +100% | +0/0 | +100% | +35/35 | +
| native.js | +
+
+ |
+ 100% | +35/35 | +100% | +1/1 | +100% | +0/0 | +100% | +35/35 | +
| ndarray.js | +
+
+ |
+ 100% | +166/166 | +100% | +25/25 | +100% | +1/1 | +100% | +166/166 | +
| ndarray.native.js | +
+
+ |
+ 100% | +80/80 | +100% | +4/4 | +100% | +1/1 | +100% | +80/80 | +
| ssort2hp.js | +
+
+ |
+ 100% | +174/174 | +100% | +31/31 | +100% | +1/1 | +100% | +174/174 | +
| ssort2hp.native.js | +
+
+ |
+ 100% | +61/61 | +100% | +2/2 | +100% | +1/1 | +100% | +61/61 | +
+ 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 | 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 +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +3x +1x +3x +2x +2x +3x +3x +3x +3x +3x +3x +3x + | /**
+* @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';
+
+/**
+* Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
+*
+* @module @stdlib/blas/ext/base/ssort2hp
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+* var ssort2hp = require( '@stdlib/blas/ext/base/ssort2hp' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, y, 1 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+* var ssort2hp = require( '@stdlib/blas/ext/base/ssort2hp' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*/
+
+// MODULES //
+
+var join = require( 'path' ).join;
+var tryRequire = require( '@stdlib/utils/try-require' );
+var isError = require( '@stdlib/assert/is-error' );
+var main = require( './main.js' );
+
+
+// MAIN //
+
+var ssort2hp;
+var tmp = tryRequire( join( __dirname, './native.js' ) );
+if ( isError( tmp ) ) {
+ ssort2hp = main;
+} else {
+ ssort2hp = tmp;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2hp;
+
+// exports: { "ndarray": "ssort2hp.ndarray" }
+ |
+ 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 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x + | /** +* @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 setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' ); +var ssort2hp = require( './ssort2hp.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( ssort2hp, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort2hp; + |
+ 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 | 1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x +1x + | /** +* @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 setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' ); +var ssort2hp = require( './ssort2hp.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( ssort2hp, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort2hp; + |
+ 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 | 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 +2x +2x +2x +2x +2x +2x +2x +2x +2x +2x +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 +24x +151x +46x +46x +46x +46x +151x +105x +105x +105x +105x +105x +21x +21x +84x +84x +84x +84x +84x +84x +84x +84x +84x +84x +130x +130x +130x +130x +130x +130x +130x +130x +151x +146x +146x +146x +103x +103x +103x +103x +103x +41x +41x +103x +146x +146x +146x +101x +101x +101x +101x +101x +101x +101x +101x +101x +146x +45x +45x +45x +146x +130x +130x +130x +130x +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 isPositiveZerof = require( '@stdlib/math/base/assert/is-positive-zerof' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var floor = require( '@stdlib/math/base/special/floor' );
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
+*
+* ## Notes
+*
+* - This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
+* ## References
+*
+* - Williams, John William Joseph. 1964. "Algorithm 232: Heapsort." _Communications of the ACM_ 7 (6). New York, NY, USA: Association for Computing Machinery: 347–49. doi:[10.1145/512274.512284](https://doi.org/10.1145/512274.512284).
+* - Floyd, Robert W. 1964. "Algorithm 245: Treesort." _Communications of the ACM_ 7 (12). New York, NY, USA: Association for Computing Machinery: 701. doi:[10.1145/355588.365103](https://doi.org/10.1145/355588.365103).
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} order - sort order
+* @param {Float32Array} x - first input array
+* @param {integer} strideX - `x` index increment
+* @param {NonNegativeInteger} offsetX - `x` starting index
+* @param {Float32Array} y - second input array
+* @param {integer} strideY - `y` index increment
+* @param {NonNegativeInteger} offsetY - `y` starting index
+* @returns {Float32Array} `x`
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*/
+function ssort2hp( N, order, x, strideX, offsetX, y, strideY, offsetY ) {
+ var parent;
+ var child;
+ var v1;
+ var v2;
+ var tx;
+ var ty;
+ var ix;
+ var iy;
+ var n;
+ var j;
+ var k;
+
+ 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;
+ }
+ // Set the initial heap size:
+ n = N;
+
+ // Specify an initial "parent" index for building the heap:
+ parent = floor( N / 2 );
+
+ // Continue looping until the array is sorted...
+ while ( true ) {
+ if ( parent > 0 ) {
+ // We need to build the heap...
+ parent -= 1;
+ tx = x[ offsetX+(parent*strideX) ];
+ ty = y[ offsetY+(parent*strideY) ];
+ } else {
+ // Reduce the heap size:
+ n -= 1;
+
+ // Check if the heap is empty, and, if so, we are finished sorting...
+ if ( n === 0 ) {
+ return x;
+ }
+ // Store the last heap value in a temporary variable in order to make room for the heap root being placed into its sorted position:
+ ix = offsetX + (n*strideX);
+ tx = x[ ix ];
+ iy = offsetY + (n*strideY);
+ ty = y[ iy ];
+
+ // Move the heap root to its sorted position:
+ x[ ix ] = x[ offsetX ];
+ y[ iy ] = y[ offsetY ];
+ }
+ // We need to "sift down", pushing `t` down the heap to in order to replace the parent and satisfy the heap property...
+
+ // Start at the parent index:
+ j = parent;
+
+ // Get the "left" child index:
+ child = (j*2) + 1;
+
+ while ( child < n ) {
+ // Find the largest child...
+ k = child + 1;
+ if ( k < n ) {
+ v1 = x[ offsetX+(k*strideX) ];
+ v2 = x[ offsetX+(child*strideX) ];
+
+ // Check if a "right" child exists and is "bigger"...
+ if ( v1 > v2 || isnanf( v1 ) || (v1 === v2 && isPositiveZerof( v1 ) ) ) { // eslint-disable-line max-len
+ child += 1;
+ }
+ }
+ // Check if the largest child is bigger than `t`...
+ v1 = x[ offsetX+(child*strideX) ];
+ if ( v1 > tx || isnanf( v1 ) || ( v1 === tx && isPositiveZerof( v1 ) ) ) { // eslint-disable-line max-len
+ // Insert the larger child value:
+ x[ offsetX+(j*strideX) ] = v1;
+ y[ offsetY+(j*strideY) ] = y[ offsetY+(child*strideY) ];
+
+ // Update `j` to point to the child index:
+ j = child;
+
+ // Get the "left" child index and repeat...
+ child = (j*2) + 1;
+ } else {
+ // We've found `t`'s place in the heap...
+ break;
+ }
+ }
+ // Insert `t` into the heap:
+ x[ offsetX+(j*strideX) ] = tx;
+ y[ offsetY+(j*strideY) ] = ty;
+ }
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2hp;
+ |
+ 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 | 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 +4x +4x +4x +4x +4x +24x +2x +2x +24x +24x +24x +24x +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 Float32Array = require( '@stdlib/array/float32' );
+var addon = require( './ssort2hp.native.js' );
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} order - sort order
+* @param {Float32Array} x - first input array
+* @param {integer} strideX - `x` index increment
+* @param {NonNegativeInteger} offsetX - `x` starting index
+* @param {Float32Array} y - second input array
+* @param {integer} strideY - `y` index increment
+* @param {NonNegativeInteger} offsetY - `y` starting index
+* @returns {Float32Array} `x`
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*/
+function ssort2hp( N, order, x, strideX, offsetX, y, strideY, offsetY ) {
+ var viewX;
+ var viewY;
+ var flg;
+
+ flg = 1.0;
+ if ( strideX < 0 ) {
+ flg *= -1.0; // reversing order
+ order *= -1.0;
+ strideX *= -1;
+ offsetX -= (N-1) * strideX;
+ }
+ if ( strideY < 0 ) {
+ offsetY += (N-1) * strideY;
+ }
+ viewX = new Float32Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offsetX), x.length-offsetX ); // eslint-disable-line max-len
+ viewY = new Float32Array( y.buffer, y.byteOffset+(y.BYTES_PER_ELEMENT*offsetY), y.length-offsetY ); // eslint-disable-line max-len
+ addon( N, order, viewX, strideX, viewY, flg*strideY );
+ return x;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2hp;
+ |
+ 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 | 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 +2x +2x +2x +2x +2x +2x +2x +2x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +22x +3x +3x +19x +22x +9x +9x +9x +22x +9x +22x +10x +10x +22x +9x +22x +10x +10x +19x +19x +19x +19x +19x +19x +19x +22x +143x +44x +44x +44x +44x +143x +99x +99x +99x +99x +99x +19x +19x +80x +80x +80x +80x +80x +80x +80x +80x +80x +80x +124x +124x +124x +124x +124x +124x +124x +124x +143x +142x +142x +142x +101x +101x +101x +101x +101x +41x +41x +101x +142x +142x +142x +99x +99x +99x +99x +99x +99x +99x +99x +99x +142x +43x +43x +43x +142x +124x +124x +124x +124x +22x +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 isPositiveZerof = require( '@stdlib/math/base/assert/is-positive-zerof' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var floor = require( '@stdlib/math/base/special/floor' );
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
+*
+* ## Notes
+*
+* - This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
+* ## References
+*
+* - Williams, John William Joseph. 1964. "Algorithm 232: Heapsort." _Communications of the ACM_ 7 (6). New York, NY, USA: Association for Computing Machinery: 347–49. doi:[10.1145/512274.512284](https://doi.org/10.1145/512274.512284).
+* - Floyd, Robert W. 1964. "Algorithm 245: Treesort." _Communications of the ACM_ 7 (12). New York, NY, USA: Association for Computing Machinery: 701. doi:[10.1145/355588.365103](https://doi.org/10.1145/355588.365103).
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} order - sort order
+* @param {Float32Array} x - first input array
+* @param {integer} strideX - `x` index increment
+* @param {Float32Array} y - second input array
+* @param {integer} strideY - `y` index increment
+* @returns {Float32Array} `x`
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, y, 1 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*/
+function ssort2hp( N, order, x, strideX, y, strideY ) {
+ var offsetX;
+ var offsetY;
+ var parent;
+ var child;
+ var v1;
+ var v2;
+ var tx;
+ var ty;
+ var ix;
+ var iy;
+ var n;
+ var j;
+ var k;
+
+ 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;
+ }
+ if ( strideX < 0 ) {
+ offsetX = (1-N) * strideX;
+ } else {
+ offsetX = 0;
+ }
+ if ( strideY < 0 ) {
+ offsetY = (1-N) * strideY;
+ } else {
+ offsetY = 0;
+ }
+ // Set the initial heap size:
+ n = N;
+
+ // Specify an initial "parent" index for building the heap:
+ parent = floor( N / 2 );
+
+ // Continue looping until the array is sorted...
+ while ( true ) {
+ if ( parent > 0 ) {
+ // We need to build the heap...
+ parent -= 1;
+ tx = x[ offsetX+(parent*strideX) ];
+ ty = y[ offsetY+(parent*strideY) ];
+ } else {
+ // Reduce the heap size:
+ n -= 1;
+
+ // Check if the heap is empty, and, if so, we are finished sorting...
+ if ( n === 0 ) {
+ return x;
+ }
+ // Store the last heap value in a temporary variable in order to make room for the heap root being placed into its sorted position:
+ ix = offsetX + (n*strideX);
+ tx = x[ ix ];
+ iy = offsetY + (n*strideY);
+ ty = y[ iy ];
+
+ // Move the heap root to its sorted position:
+ x[ ix ] = x[ offsetX ];
+ y[ iy ] = y[ offsetY ];
+ }
+ // We need to "sift down", pushing `t` down the heap to in order to replace the parent and satisfy the heap property...
+
+ // Start at the parent index:
+ j = parent;
+
+ // Get the "left" child index:
+ child = (j*2) + 1;
+
+ while ( child < n ) {
+ // Find the largest child...
+ k = child + 1;
+ if ( k < n ) {
+ v1 = x[ offsetX+(k*strideX) ];
+ v2 = x[ offsetX+(child*strideX) ];
+
+ // Check if a "right" child exists and is "bigger"...
+ if ( v1 > v2 || isnanf( v1 ) || (v1 === v2 && isPositiveZerof( v1 ) ) ) { // eslint-disable-line max-len
+ child += 1;
+ }
+ }
+ // Check if the largest child is bigger than `t`...
+ v1 = x[ offsetX+(child*strideX) ];
+ if ( v1 > tx || isnanf( v1 ) || ( v1 === tx && isPositiveZerof( v1 ) ) ) { // eslint-disable-line max-len
+ // Insert the larger child value:
+ x[ offsetX+(j*strideX) ] = v1;
+ y[ offsetY+(j*strideY) ] = y[ offsetY+(child*strideY) ];
+
+ // Update `j` to point to the child index:
+ j = child;
+
+ // Get the "left" child index and repeat...
+ child = (j*2) + 1;
+ } else {
+ // We've found `t`'s place in the heap...
+ break;
+ }
+ }
+ // Insert `t` into the heap:
+ x[ offsetX+(j*strideX) ] = tx;
+ y[ offsetY+(j*strideY) ] = ty;
+ }
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2hp;
+ |
+ 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 | 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 +46x +46x +46x +46x +3x +3x +3x +3x +3x + | /**
+* @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 addon = require( './../src/addon.node' );
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
+*
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} order - sort order
+* @param {Float32Array} x - first input array
+* @param {integer} strideX - `x` index increment
+* @param {Float32Array} y - second input array
+* @param {integer} strideY - `y` index increment
+* @returns {Float32Array} `x`
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2hp( x.length, 1.0, x, 1, y, 1 );
+*
+* console.log( x );
+* // => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
+*
+* console.log( y );
+* // => <Float32Array>[ 3.0, 1.0, 0.0, 2.0 ]
+*/
+function ssort2hp( N, order, x, strideX, y, strideY ) {
+ addon( N, order, x, strideX, y, strideY );
+ return x;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2hp;
+ |