Auto-generated commit

CONTRIBUTORS

@@ -27,6 +27,7 @@ Frank Kovacs <fran70kk@gmail.com>
 Golden Kumar <103646877+AuenKr@users.noreply.github.com>
 Gunj Joshi <gunjjoshi8372@gmail.com>
 Harshita Kalani <harshitakalani02@gmail.com>
+Hridyanshu <124202756+HRIDYANSHU054@users.noreply.github.com>
 Jaimin Godhani <112328542+Jai0401@users.noreply.github.com>
 James Gelok <jdgelok@gmail.com>
 Jaysukh Makvana <jaysukhmakvana2004@gmail.com>
@@ -84,6 +85,7 @@ Tudor Pagu <104032457+tudor-pagu@users.noreply.github.com>
 Utkarsh <http://utkarsh11105@gmail.com>
 Utkarsh Raj <rajutkarsh2505@gmail.com>
 Varad Gupta <varadgupta21@gmail.com>
+Xiaochuan Ye <tap91624@gmail.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz>
 naveen <stupiddint@gmail.com>
 nishant-s7 <97207366+nishant-s7@users.noreply.github.com>

README.md

@@ -2131,6 +2131,88 @@ var count = context.count;
 // returns 2
 ```
 
+<a name="method-sort"></a>
+
+#### Complex64Array.prototype.sort( compareFcn )
+
+Sorts an array in-place.
+
+```javascript
+var realf = require( '@stdlib/complex-realf' );
+var imagf = require( '@stdlib/complex-imagf' );
+
+function compare( a, b ) {
+    var re1;
+    var re2;
+    var im1;
+    var im2;
+    re1 = realf( a );
+    re2 = realf( b );
+    if ( re1 < re2 ) {
+        return -1;
+    }
+    if ( re1 > re2 ) {
+        return 1;
+    }
+    im1 = imagf( a );
+    im2 = imagf( b );
+    if ( im1 < im2 ) {
+        return -1;
+    }
+    if ( im1 > im2 ) {
+        return 1;
+    }
+    return 0;
+}
+
+var arr = new Complex64Array( 3 );
+
+arr.set( [ 3.0, -3.0 ], 0 );
+arr.set( [ 1.0, -1.0 ], 1 );
+arr.set( [ 2.0, -2.0 ], 2 );
+
+var out = arr.sort( compare );
+// returns <Complex64Array>
+
+var z = out.get( 0 );
+// returns <Complex64>
+
+var re = realf( z );
+// returns 1.0
+
+var im = imagf( z );
+// returns -1.0
+
+z = out.get( 1 );
+// returns <Complex64>
+
+re = realf( z );
+// returns 2.0
+
+im = imagf( z );
+// returns -2.0
+
+z = out.get( 2 );
+// returns <Complex64>
+
+re = realf( z );
+// returns 3.0
+
+im = imagf( z );
+// returns -3.0
+```
+
+The `compareFcn` determines the order of the elements. The function is called with the following arguments:
+
+-   **a**: the first element for comparison.
+-   **b**: the second element for comparison.
+
+The function should return a number where:
+
+-   a negative value indicates that `a` should come before `b`.
+-   a positive value indicates that `a` should come after `b`.
+-   zero or `NaN` indicates that `a` and `b` are considered equal.
+
 <a name="method-subarray"></a>
 
 #### Complex64Array.prototype.subarray( \[begin\[, end]] )

benchmark/benchmark.sort.js

@@ -0,0 +1,88 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 bench = require( '@stdlib/bench-harness' );
+var isComplex64Array = require( '@stdlib/assert-is-complex64array' );
+var realf = require( '@stdlib/complex-realf' );
+var imagf = require( '@stdlib/complex-imagf' );
+var pkg = require( './../package.json' ).name;
+var Complex64Array = require( './../lib' );
+
+
+// FUNCTIONS //
+
+/**
+* Comparison function.
+*
+* @private
+* @param {Complex64} a - first value for comparison
+* @param {Complex64} b - second value for comparison
+* @returns {number} comparison result
+*/
+function compareFcn( a, b ) {
+	var re1;
+	var re2;
+	var im1;
+	var im2;
+	re1 = realf( a );
+	re2 = realf( b );
+	if ( re1 < re2 ) {
+		return -1;
+	}
+	if ( re1 > re2 ) {
+		return 1;
+	}
+	im1 = imagf( a );
+	im2 = imagf( b );
+	if ( im1 < im2 ) {
+		return -1;
+	}
+	if ( im1 > im2 ) {
+		return 1;
+	}
+	return 0;
+}
+
+
+// MAIN //
+
+bench( pkg+':sort', function benchmark( b ) {
+	var out;
+	var arr;
+	var i;
+
+	arr = new Complex64Array( [ 1, 2, 3, 4, 5, 6 ] );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		out = arr.sort( compareFcn );
+		if ( typeof out !== 'object' ) {
+			b.fail( 'should return an object' );
+		}
+	}
+	b.toc();
+	if ( !isComplex64Array( out ) ) {
+		b.fail( 'should return a Complex64Array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});

benchmark/benchmark.sort.length.js

@@ -0,0 +1,137 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 bench = require( '@stdlib/bench-harness' );
+var isComplex64Array = require( '@stdlib/assert-is-complex64array' );
+var realf = require( '@stdlib/complex-realf' );
+var imagf = require( '@stdlib/complex-imagf' );
+var pow = require( '@stdlib/math-base-special-pow' );
+var Complex64 = require( '@stdlib/complex-float32' );
+var pkg = require( './../package.json' ).name;
+var Complex64Array = require( './../lib' );
+
+
+// FUNCTIONS //
+
+/**
+* Comparison function.
+*
+* @private
+* @param {Complex64} a - first value for comparison
+* @param {Complex64} b - second value for comparison
+* @returns {number} comparison result
+*/
+function compareFcn( a, b ) {
+	var re1;
+	var re2;
+	var im1;
+	var im2;
+	re1 = realf( a );
+	re2 = realf( b );
+	if ( re1 < re2 ) {
+		return -1;
+	}
+	if ( re1 > re2 ) {
+		return 1;
+	}
+	im1 = imagf( a );
+	im2 = imagf( b );
+	if ( im1 < im2 ) {
+		return -1;
+	}
+	if ( im1 > im2 ) {
+		return 1;
+	}
+	return 0;
+}
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var arr;
+	var i;
+
+	arr = [];
+	for ( i = 0; i < len; i++ ) {
+		arr.push( new Complex64( i, i ) );
+	}
+	arr = new Complex64Array( arr );
+
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = arr.sort( compareFcn );
+			if ( typeof out !== 'object' ) {
+				b.fail( 'should return an object' );
+			}
+		}
+		b.toc();
+		if ( !isComplex64Array( out ) ) {
+			b.fail( 'should return a Complex64Array' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var f;
+	var i;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( i = min; i <= max; i++ ) {
+		len = pow( 10, i );
+		f = createBenchmark( len );
+		bench( pkg+':sort:len='+len, f );
+	}
+}
+
+main();