+ 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% | +122/122 | +100% | +18/18 | +100% | +1/1 | +100% | +122/122 | +
| ndarray.native.js | +
+
+ |
+ 100% | +80/80 | +100% | +4/4 | +100% | +1/1 | +100% | +80/80 | +
| ssort2sh.js | +
+
+ |
+ 100% | +130/130 | +100% | +24/24 | +100% | +1/1 | +100% | +130/130 | +
| ssort2sh.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 Shellsort.
+*
+* @module @stdlib/blas/ext/base/ssort2sh
+*
+* @example
+* var Float32Array = require( '@stdlib/array/float32' );
+* var ssort2sh = require( '@stdlib/blas/ext/base/ssort2sh' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2sh( 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 ssort2sh = require( '@stdlib/blas/ext/base/ssort2sh' );
+*
+* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+* var y = new Float32Array( [ 0.0, 1.0, 2.0, 3.0 ] );
+*
+* ssort2sh( 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 ssort2sh;
+var tmp = tryRequire( join( __dirname, './native.js' ) );
+if ( isError( tmp ) ) {
+ ssort2sh = main;
+} else {
+ ssort2sh = tmp;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2sh;
+
+// exports: { "ndarray": "ssort2sh.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 ssort2sh = require( './ssort2sh.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( ssort2sh, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort2sh; + |
+ 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 ssort2sh = require( './ssort2sh.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( ssort2sh, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort2sh; + |
+ 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 | 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 +2x +2x +2x +2x +2x +24x +24x +24x +24x +24x +24x +24x +24x +24x +24x +24x +3x +3x +21x +24x +10x +10x +10x +10x +10x +24x +168x +168x +113x +113x +113x +113x +18x +18x +95x +95x +95x +95x +113x +150x +150x +59x +59x +91x +91x +91x +95x +95x +95x +168x +21x +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' );
+var GAPS = require( './gaps.json' );
+
+
+// VARIABLES //
+
+var NGAPS = GAPS.length;
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
+*
+* ## Notes
+*
+* - This implementation uses the gap sequence proposed by Ciura (2001).
+*
+* ## References
+*
+* - Shell, Donald L. 1959. "A High-Speed Sorting Procedure." _Communications of the ACM_ 2 (7). Association for Computing Machinery: 30–32. doi:[10.1145/368370.368387](https://doi.org/10.1145/368370.368387).
+* - Ciura, Marcin. 2001. "Best Increments for the Average Case of Shellsort." In _Fundamentals of Computation Theory_, 106–17. Springer Berlin Heidelberg. doi:[10.1007/3-540-44669-9\_12](https://doi.org/10.1007/3-540-44669-9_12).
+*
+* @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 ] );
+*
+* ssort2sh( 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 ssort2sh( N, order, x, strideX, offsetX, y, strideY, offsetY ) {
+ var flg;
+ var gap;
+ var vx;
+ var vy;
+ var ux;
+ var i;
+ 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;
+ }
+ for ( i = 0; i < NGAPS; i++ ) {
+ gap = GAPS[ i ];
+ for ( j = gap; j < N; j++ ) {
+ vx = x[ offsetX+(j*strideX) ];
+
+ // If `NaN`, the current value is already sorted to its place...
+ if ( isnanf( vx ) ) {
+ continue;
+ }
+ vy = y[ offsetY+(j*strideY) ];
+
+ // Perform insertion sort on the "gapped" subarray...
+ flg = isNegativeZerof( vx );
+ for ( k = j; k >= gap; k -= gap ) {
+ ux = x[ offsetX+((k-gap)*strideX) ];
+ if ( ux <= vx && !(flg && ux === vx) ) {
+ break;
+ }
+ x[ offsetX+(k*strideX) ] = ux;
+ y[ offsetY+(k*strideY) ] = y[ offsetY+((k-gap)*strideY) ];
+ }
+ x[ offsetX+(k*strideX) ] = vx;
+ y[ offsetY+(k*strideY) ] = vy;
+ }
+ }
+ return x;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2sh;
+ |
+ 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( './ssort2sh.native.js' );
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
+*
+* @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 ] );
+*
+* ssort2sh( 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 ssort2sh( 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 = ssort2sh;
+ |
+ 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 | 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 +2x +2x +2x +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 +22x +152x +152x +109x +109x +109x +109x +18x +18x +91x +91x +91x +91x +109x +144x +144x +57x +57x +87x +87x +87x +91x +91x +91x +152x +19x +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 isNegativeZerof = require( '@stdlib/math/base/assert/is-negative-zerof' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var GAPS = require( './gaps.json' );
+
+
+// VARIABLES //
+
+var NGAPS = GAPS.length;
+
+
+// MAIN //
+
+/**
+* Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
+*
+* ## Notes
+*
+* - This implementation uses the gap sequence proposed by Ciura (2001).
+*
+* ## References
+*
+* - Shell, Donald L. 1959. "A High-Speed Sorting Procedure." _Communications of the ACM_ 2 (7). Association for Computing Machinery: 30–32. doi:[10.1145/368370.368387](https://doi.org/10.1145/368370.368387).
+* - Ciura, Marcin. 2001. "Best Increments for the Average Case of Shellsort." In _Fundamentals of Computation Theory_, 106–17. Springer Berlin Heidelberg. doi:[10.1007/3-540-44669-9\_12](https://doi.org/10.1007/3-540-44669-9_12).
+*
+* @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 ] );
+*
+* ssort2sh( 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 ssort2sh( N, order, x, strideX, y, strideY ) {
+ var offsetX;
+ var offsetY;
+ var flg;
+ var gap;
+ var vx;
+ var vy;
+ var ux;
+ var i;
+ 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;
+ }
+ for ( i = 0; i < NGAPS; i++ ) {
+ gap = GAPS[ i ];
+ for ( j = gap; j < N; j++ ) {
+ vx = x[ offsetX+(j*strideX) ];
+
+ // If `NaN`, the current value is already sorted to its place...
+ if ( isnanf( vx ) ) {
+ continue;
+ }
+ vy = y[ offsetY+(j*strideY) ];
+
+ // Perform insertion sort on the "gapped" subarray...
+ flg = isNegativeZerof( vx );
+ for ( k = j; k >= gap; k -= gap ) {
+ ux = x[ offsetX+((k-gap)*strideX) ];
+ if ( ux <= vx && !(flg && ux === vx) ) {
+ break;
+ }
+ x[ offsetX+(k*strideX) ] = ux;
+ y[ offsetY+(k*strideY) ] = y[ offsetY+((k-gap)*strideY) ];
+ }
+ x[ offsetX+(k*strideX) ] = vx;
+ y[ offsetY+(k*strideY) ] = vy;
+ }
+ }
+ return x;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2sh;
+ |
+ 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 Shellsort.
+*
+* @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 ] );
+*
+* ssort2sh( 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 ssort2sh( N, order, x, strideX, y, strideY ) {
+ addon( N, order, x, strideX, y, strideY );
+ return x;
+}
+
+
+// EXPORTS //
+
+module.exports = ssort2sh;
+ |