Done Reviewed Changes

Author: MeKaustubh07

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsort2hp/README.md

@@ -59,6 +59,9 @@ var order = scalar2ndarray( 1.0, {
 var out = dsort2hp( [ x, y, order ] );
 // returns <ndarray>
 
+var bool = ( out === x );
+// returns true
+
 var arrX = ndarray2array( out );
 // returns [ -4.0, -2.0, 1.0, 3.0 ]
 
@@ -80,7 +83,8 @@ The function has the following parameters:
 
 -   Both input ndarrays are sorted **in-place** (i.e., the input ndarrays are **mutated**).
 -   Both ndarrays must have the same length.
--   When the sort order is less than zero, the input ndarrays are sorted in **decreasing** order. When the sort order is greater than zero, the input ndarrays are sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged.
+-   If the input ndarrays have zero elements or the sort order is equal to zero, the function leaves both input ndarrays unchanged.
+-   When the sort order is less than zero, the first input ndarray is sorted in **decreasing** order. When the sort order is greater than zero, the first input ndarray is sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged. The second input ndarray is reordered based on the sort order of the first input ndarray.
 -   The algorithm distinguishes between `-0` and `+0`. When sorted in increasing order, `-0` is sorted before `+0`. When sorted in decreasing order, `-0` is sorted after `+0`.
 -   The algorithm sorts `NaN` values to the end. When sorted in increasing order, `NaN` values are sorted last. When sorted in decreasing order, `NaN` values are sorted first.
 -   The algorithm has space complexity `O(1)` and time complexity `O(N log2 N)`.

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsort2hp/benchmark/benchmark.js

@@ -23,6 +23,7 @@
 var bench = require( '@stdlib/bench' );
 var uniform = require( '@stdlib/random/array/uniform' );
 var pow = require( '@stdlib/math/base/special/pow' );
+var format = require( '@stdlib/string/format' );
 var ndarray = require( '@stdlib/ndarray/base/ctor' );
 var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
 var pkg = require( './../package.json' ).name;
@@ -103,7 +104,7 @@ function main() {
 	for ( i = min; i <= max; i++ ) {
 		len = pow( 10, i );
 		f = createBenchmark( len );
-		bench( pkg+':len='+len, f );
+		bench( format( '%s::len=%d', pkg, len ), f );
 	}
 }
 

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsort2hp/docs/repl.txt

@@ -3,11 +3,27 @@
     Simultaneously sorts two one-dimensional double-precision floating-point
     ndarrays based on the sort order of the first array using heapsort.
 
-    When the sort order is less than zero, the input ndarrays are sorted in
-    decreasing order. When the sort order is greater than zero, the input
-    ndarrays are sorted in increasing order. When the sort order is equal to
+    When the sort order is less than zero, the first input ndarray is sorted in
+    decreasing order. When the sort order is greater than zero, the first input
+    ndarray is sorted in increasing order. When the sort order is equal to
     zero, the input ndarrays are left unchanged.
 
+    If the input ndarrays have zero elements or the sort order is equal to
+    zero, the function leaves both input ndarrays unchanged.
+
+    The algorithm distinguishes between `-0` and `+0`. When sorted in increasing
+    order, `-0` is sorted before `+0`. When sorted in decreasing order, `-0` is
+    sorted after `+0`.
+
+    The algorithm sorts `NaN` values to the end. When sorted in increasing
+    order, `NaN` values are sorted last. When sorted in decreasing order, `NaN`
+    values are sorted first.
+
+    The algorithm has space complexity O(1) and time complexity O(N log2 N).
+
+    The algorithm is *unstable*, meaning that the algorithm may change the order
+    of ndarray elements which are equal or equivalent (e.g., `NaN` values).
+
     Both input ndarrays are sorted *in-place* (i.e., the input ndarrays are
     *mutated*).
 

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsort2hp/docs/types/index.d.ts

@@ -27,7 +27,7 @@ import { typedndarray, float64ndarray } from '@stdlib/types/ndarray';
 *
 * ## Notes
 *
-* -   When the sort order is less than zero, the input ndarrays are sorted in **decreasing** order. When the sort order is greater than zero, the input ndarrays are sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged.
+* -   When the sort order is less than zero, the first input ndarray is sorted in **decreasing** order. When the sort order is greater than zero, the first input ndarray is sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged. The second input ndarray is reordered based on the sort order of the first input ndarray.
 *
 * @param arrays - array-like object containing two one-dimensional input ndarrays and a zero-dimensional ndarray specifying the sort order
 * @returns first input ndarray

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsort2hp/lib/main.js

@@ -35,10 +35,10 @@ var strided = require( '@stdlib/blas/ext/base/dsort2hp' ).ndarray;
 *
 * ## Notes
 *
-* -   When the sort order is less than zero, the input ndarrays are sorted in **decreasing** order. When the sort order is greater than zero, the input ndarrays are sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged.
+* -   When the sort order is less than zero, the first input ndarray is sorted in **decreasing** order. When the sort order is greater than zero, the first input ndarray is sorted in **increasing** order. When the sort order is equal to zero, the input ndarrays are left unchanged. The second input ndarray is reordered based on the sort order of the first input ndarray.
 *
 * @param {ArrayLikeObject<Object>} arrays - array-like object containing two one-dimensional input ndarrays and a zero-dimensional ndarray specifying the sort order
-* @returns {ndarray} first input ndarray
+* @returns {Object} first input ndarray
 *
 * @example
 * var Float64Array = require( '@stdlib/array/float64' );

lib/node_modules/@stdlib/blas/ext/base/ndarray/dsortsh/README.md

@@ -0,0 +1,133 @@
+<!--
+
+@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.
+
+-->
+
+# dsortsh
+
+> Sort a one-dimensional double-precision floating-point ndarray using Shellsort.
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var dsortsh = require( '@stdlib/blas/ext/base/ndarray/dsortsh' );
+```
+
+#### dsortsh( arrays )
+
+Sorts a one-dimensional double-precision floating-point ndarray using Shellsort.
+
+```javascript
+var Float64Array = require( '@stdlib/array/float64' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray2array = require( '@stdlib/ndarray/to-array' );
+var ndarray = require( '@stdlib/ndarray/base/ctor' );
+
+var xbuf = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
+var x = new ndarray( 'float64', xbuf, [ 4 ], [ 1 ], 0, 'row-major' );
+
+var order = scalar2ndarray( 1.0, {
+    'dtype': 'generic'
+});
+
+var out = dsortsh( [ x, order ] );
+// returns <ndarray>
+
+var arr = ndarray2array( out );
+// returns [ -4.0, -2.0, 1.0, 3.0 ]
+```
+
+The function has the following parameters:
+
+-   **arrays**: array-like object containing a one-dimensional input ndarray and a zero-dimensional ndarray specifying the sort order.
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+## Notes
+
+-   The input ndarray is sorted **in-place** (i.e., the input ndarray is **mutated**).
+-   When the sort order is less than zero, the input ndarray is sorted in **decreasing** order. When the sort order is greater than zero, the input ndarray is sorted in **increasing** order. When the sort order is equal to zero, the input ndarray is left unchanged.
+-   The algorithm distinguishes between `-0` and `+0`. When sorted in increasing order, `-0` is sorted before `+0`. When sorted in decreasing order, `-0` is sorted after `+0`.
+-   The algorithm sorts `NaN` values to the end. When sorted in increasing order, `NaN` values are sorted last. When sorted in decreasing order, `NaN` values are sorted first.
+-   The algorithm has space complexity `O(1)` and worst case time complexity `O(N^(4/3))`.
+-   The algorithm is efficient for **shorter** ndarrays (typically `N <= 50`).
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var ndarray = require( '@stdlib/ndarray/base/ctor' );
+var scalar2ndarray = require( '@stdlib/ndarray/from-scalar' );
+var ndarray2array = require( '@stdlib/ndarray/to-array' );
+var ndarraylike2scalar = require( '@stdlib/ndarray/base/ndarraylike2scalar' );
+var dsortsh = require( '@stdlib/blas/ext/base/ndarray/dsortsh' );
+
+var xbuf = discreteUniform( 10, -100, 100, {
+    'dtype': 'float64'
+});
+var x = new ndarray( 'float64', xbuf, [ xbuf.length ], [ 1 ], 0, 'row-major' );
+console.log( ndarray2array( x ) );
+
+var order = scalar2ndarray( 1.0, {
+    'dtype': 'generic'
+});
+console.log( 'Order:', ndarraylike2scalar( order ) );
+
+dsortsh( [ x, order ] );
+console.log( ndarray2array( x ) );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+</section>
+
+<!-- /.links -->