diff --git a/complex64/README.md b/complex64/README.md index f53610c4..6fe9f0ba 100644 --- a/complex64/README.md +++ b/complex64/README.md @@ -2342,6 +2342,88 @@ im = imagf( z ); // returns 1.0 ``` + + +#### Complex64Array.prototype.toSorted( compareFcn ) + +Returns a new typed array containing the elements in sorted order. + +```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.toSorted( compare ); +// returns + +var z = out.get( 0 ); +// returns + +var re = realf( z ); +// returns 1.0 + +var im = imagf( z ); +// returns -1.0 + +z = out.get( 1 ); +// returns + +re = realf( z ); +// returns 2.0 + +im = imagf( z ); +// returns -2.0 + +z = out.get( 2 ); +// returns + +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. + #### Complex64Array.prototype.toString() diff --git a/complex64/benchmark/benchmark.to_sorted.js b/complex64/benchmark/benchmark.to_sorted.js new file mode 100644 index 00000000..16e2a817 --- /dev/null +++ b/complex64/benchmark/benchmark.to_sorted.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' ); +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+':toSorted', 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.toSorted( 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(); +}); diff --git a/complex64/benchmark/benchmark.to_sorted.length.js b/complex64/benchmark/benchmark.to_sorted.length.js new file mode 100644 index 00000000..e5a9f85e --- /dev/null +++ b/complex64/benchmark/benchmark.to_sorted.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' ); +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.toSorted( 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+':toSorted:len='+len, f ); + } +} + +main(); diff --git a/complex64/docs/types/index.d.ts b/complex64/docs/types/index.d.ts index 34204fe0..6f11e3f5 100644 --- a/complex64/docs/types/index.d.ts +++ b/complex64/docs/types/index.d.ts @@ -1377,6 +1377,78 @@ declare class Complex64Array implements Complex64ArrayInterface { */ toReversed(): Complex64Array; + /** + * Returns a new typed array containing the elements in sorted order. + * + * @param compareFcn - comparison function + * @returns sorted array + * + * @example + * 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.toSorted( compare ); + * // returns + * + * var z = out.get( 0 ); + * // returns + * + * var re = realf( z ); + * // returns 1.0 + * + * var im = imagf( z ); + * // returns -1.0 + * + * z = out.get( 1 ); + * // returns + * + * re = realf( z ); + * // returns 2.0 + * + * im = imagf( z ); + * // returns -2.0 + * + * z = out.get( 2 ); + * // returns + * + * re = realf( z ); + * // returns 3.0 + * + * im = imagf( z ); + * // returns -3.0 + */ + toSorted( compareFcn: CompareFcn ): Complex64Array; + /** * Serializes an array as a string. * diff --git a/complex64/lib/main.js b/complex64/lib/main.js index 8d32e7ef..5ffbd7b5 100644 --- a/complex64/lib/main.js +++ b/complex64/lib/main.js @@ -2718,6 +2718,102 @@ setReadOnly( Complex64Array.prototype, 'toReversed', function toReversed() { return out; }); +/** +* Returns a new typed array containing the elements in sorted order. +* +* @name toSorted +* @memberof Complex64Array.prototype +* @type {Function} +* @param {Function} compareFcn - comparison function +* @throws {TypeError} `this` must be a complex number array +* @throws {TypeError} first argument must be a function +* @returns {Complex64Array} sorted array +* +* @example +* 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 +* +* var z = out.get( 0 ); +* // returns +* +* var re = realf( z ); +* // returns 1.0 +* +* var im = imagf( z ); +* // returns -1.0 +* +* z = out.get( 1 ); +* // returns +* +* re = realf( z ); +* // returns 2.0 +* +* im = imagf( z ); +* // returns -2.0 +* +* z = out.get( 2 ); +* // returns +* +* re = realf( z ); +* // returns 3.0 +* +* im = imagf( z ); +* // returns -3.0 +*/ +setReadOnly( Complex64Array.prototype, 'toSorted', function toSorted( compareFcn ) { + var tmp; + var buf; + var len; + var i; + if ( !isComplexArray( this ) ) { + throw new TypeError( 'invalid invocation. `this` is not a complex number array.' ); + } + if ( !isFunction( compareFcn ) ) { + throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) ); + } + buf = this._buffer; + len = this._length; + tmp = []; + for ( i = 0; i < len; i++ ) { + tmp.push( getComplex64( buf, i ) ); + } + tmp.sort( compareFcn ); + return new Complex64Array( tmp ); +}); + /** * Serializes an array as a string. * diff --git a/complex64/test/test.to_sorted.js b/complex64/test/test.to_sorted.js new file mode 100644 index 00000000..f2142aa8 --- /dev/null +++ b/complex64/test/test.to_sorted.js @@ -0,0 +1,180 @@ +/** +* @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 tape = require( 'tape' ); +var hasOwnProp = require( '@stdlib/assert/has-own-property' ); +var isFunction = require( '@stdlib/assert/is-function' ); +var reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' ); +var instanceOf = require( '@stdlib/assert/instance-of' ); +var realf = require( '@stdlib/complex/realf' ); +var imagf = require( '@stdlib/complex/imagf' ); +var Float32Array = require( './../../float32' ); +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; +} + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof Complex64Array, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'attached to the prototype of the main export is a `toSorted` method', function test( t ) { + t.strictEqual( hasOwnProp( Complex64Array.prototype, 'toSorted' ), true, 'has property' ); + t.strictEqual( isFunction( Complex64Array.prototype.toSorted ), true, 'has method' ); + t.end(); +}); + +tape( 'the method throws an error if invoked with a `this` context which is not a complex number array instance', function test( t ) { + var values; + var arr; + var i; + + arr = new Complex64Array( 5 ); + + values = [ + '5', + 5, + NaN, + true, + false, + null, + void 0, + {}, + [], + function noop() {} + ]; + for ( i = 0; i < values.length; i++ ) { + t.throws( badValue( values[i] ), TypeError, 'throws an error when provided '+values[i] ); + } + t.end(); + + function badValue( value ) { + return function badValue() { + return arr.toSorted.call( value, compareFcn ); + }; + } +}); + +tape( 'the method throws an error if provided a first argument which is not a function', function test( t ) { + var values; + var arr; + var i; + + arr = new Complex64Array( 10 ); + + values = [ + '5', + 3.14, + NaN, + true, + false, + null, + void 0, + {}, + [] + ]; + for ( i = 0; i < values.length; i++ ) { + t.throws( badValue( values[i] ), TypeError, 'throws an error when provided '+values[i] ); + } + t.end(); + + function badValue( value ) { + return function badValue() { + return arr.toSorted( value ); + }; + } +}); + +tape( 'the method returns an empty array if operating on an empty complex number array', function test( t ) { + var arr; + var out; + + arr = new Complex64Array(); + out = arr.toSorted( compareFcn ); + + t.strictEqual( out.length, 0, 'returns expected value' ); + t.end(); +}); + +tape( 'the method returns a new typed array containing elements in sorted order', function test( t ) { + var expected; + var arr; + var out; + + arr = new Complex64Array( [ 3.0, -3.0, 1.0, -1.0, 2.0, -2.0 ] ); + expected = new Float32Array( [ 1.0, -1.0, 2.0, -2.0, 3.0, -3.0 ] ); + out = arr.toSorted( compareFcn ); + + t.strictEqual( instanceOf( out, Complex64Array ), true, 'returns expected value' ); + t.notEqual( out, arr, 'returns a new instance' ); + t.strictEqual( out.length, expected.length/2, 'returns expected value' ); + t.deepEqual( reinterpret64( out, 0 ), expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the method does not change the array length', function test( t ) { + var arr; + var out; + + arr = new Complex64Array( [ 1.0, -1.0, 2.0, -2.0, 3.0, -3.0 ] ); + out = arr.toSorted( compareFcn ); + + t.strictEqual( out.length, arr.length, 'returns expected value' ); + t.end(); +});