From 3a5d54f9cb8f03c1f08108b2f0e26b8aa010d010 Mon Sep 17 00:00:00 2001 From: headlessNode Date: Sun, 11 Jan 2026 21:23:29 +0500 Subject: [PATCH] feat: add blas/ext/base/ssort --- .../@stdlib/blas/ext/base/ssort/README.md | 300 +++++++++ .../benchmark/benchmark.unsorted_random.js | 122 ++++ .../benchmark.unsorted_random.native.js | 132 ++++ .../benchmark.unsorted_random.ndarray.js | 122 ++++ ...enchmark.unsorted_random.ndarray.native.js | 132 ++++ .../benchmark/c/unsorted-random/Makefile | 146 ++++ .../c/unsorted-random/benchmark.length.c | 195 ++++++ .../@stdlib/blas/ext/base/ssort/binding.gyp | 170 +++++ .../@stdlib/blas/ext/base/ssort/docs/repl.txt | 113 ++++ .../blas/ext/base/ssort/docs/types/index.d.ts | 95 +++ .../blas/ext/base/ssort/docs/types/test.ts | 187 ++++++ .../blas/ext/base/ssort/examples/c/Makefile | 146 ++++ .../blas/ext/base/ssort/examples/c/example.c | 39 ++ .../blas/ext/base/ssort/examples/index.js | 30 + .../@stdlib/blas/ext/base/ssort/include.gypi | 53 ++ .../include/stdlib/blas/ext/base/ssort.h | 45 ++ .../@stdlib/blas/ext/base/ssort/lib/index.js | 68 ++ .../@stdlib/blas/ext/base/ssort/lib/main.js | 35 + .../@stdlib/blas/ext/base/ssort/lib/native.js | 35 + .../blas/ext/base/ssort/lib/ndarray.js | 53 ++ .../blas/ext/base/ssort/lib/ndarray.native.js | 53 ++ .../@stdlib/blas/ext/base/ssort/lib/ssort.js | 53 ++ .../blas/ext/base/ssort/lib/ssort.native.js | 53 ++ .../@stdlib/blas/ext/base/ssort/manifest.json | 82 +++ .../@stdlib/blas/ext/base/ssort/package.json | 74 ++ .../@stdlib/blas/ext/base/ssort/src/Makefile | 70 ++ .../@stdlib/blas/ext/base/ssort/src/addon.c | 62 ++ .../@stdlib/blas/ext/base/ssort/src/main.c | 48 ++ .../ext/base/ssort/test/fixtures/ascending.js | 75 +++ .../ext/base/ssort/test/fixtures/num2str.js | 45 ++ .../@stdlib/blas/ext/base/ssort/test/test.js | 82 +++ .../blas/ext/base/ssort/test/test.ndarray.js | 622 +++++++++++++++++ .../base/ssort/test/test.ndarray.native.js | 631 ++++++++++++++++++ .../blas/ext/base/ssort/test/test.ssort.js | 576 ++++++++++++++++ .../ext/base/ssort/test/test.ssort.native.js | 585 ++++++++++++++++ 35 files changed, 5329 insertions(+) create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/README.md create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/Makefile create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/benchmark.length.c create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/binding.gyp create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/docs/repl.txt create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/index.d.ts create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/test.ts create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/Makefile create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/example.c create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/examples/index.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/include.gypi create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/include/stdlib/blas/ext/base/ssort.h create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/index.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/main.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/manifest.json create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/package.json create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/src/Makefile create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/src/addon.c create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/src/main.c create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/ascending.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/num2str.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.native.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.js create mode 100644 lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.native.js diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/README.md b/lib/node_modules/@stdlib/blas/ext/base/ssort/README.md new file mode 100644 index 000000000000..e2e819bda55d --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/README.md @@ -0,0 +1,300 @@ + + +# ssort + +> Sort a single-precision floating-point strided array. + +
+ +## Usage + +```javascript +var ssort = require( '@stdlib/blas/ext/base/ssort' ); +``` + +#### ssort( N, order, x, strideX ) + +Sorts a single-precision floating-point strided array. + +```javascript +var Float32Array = require( '@stdlib/array/float32' ); + +var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); + +ssort( x.length, 1.0, x, 1 ); +// x => [ -4.0, -2.0, 1.0, 3.0 ] +``` + +The function has the following parameters: + +- **N**: number of indexed elements. +- **order**: sort order. If `order < 0.0`, the input strided array is sorted in **decreasing** order. If `order > 0.0`, the input strided array is sorted in **increasing** order. If `order == 0.0`, the input strided array is left unchanged. +- **x**: input [`Float32Array`][@stdlib/array/float32]. +- **strideX**: stride length. + +The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to sort every other element: + +```javascript +var Float32Array = require( '@stdlib/array/float32' ); + +var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); + +ssort( 2, -1.0, x, 2 ); +// x => [ 3.0, -2.0, 1.0, -4.0 ] +``` + +Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views. + +```javascript +var Float32Array = require( '@stdlib/array/float32' ); + +// Initial array... +var x0 = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + +// Create an offset view... +var x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element + +// Sort every other element... +ssort( 2, -1.0, x1, 2 ); +// x0 => [ 1.0, 4.0, 3.0, 2.0 ] +``` + +#### ssort.ndarray( N, order, x, strideX, offsetX ) + +Sorts a single-precision floating-point strided array using alternative indexing semantics. + +```javascript +var Float32Array = require( '@stdlib/array/float32' ); + +var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); + +ssort.ndarray( x.length, 1.0, x, 1, 0 ); +// x => [ -4.0, -2.0, 1.0, 3.0 ] +``` + +The function has the following additional parameters: + +- **offsetX**: starting index. + +While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to access only the last three elements: + +```javascript +var Float32Array = require( '@stdlib/array/float32' ); + +var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ] ); + +ssort.ndarray( 3, 1.0, x, 1, 3 ); +// x => [ 1.0, -2.0, 3.0, -6.0, -4.0, 5.0 ] +``` + +
+ + + +
+ +## Notes + +- If `N <= 0` or `order == 0.0`, both functions return `x` 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 input strided array is sorted **in-place** (i.e., the input strided array is **mutated**). + +
+ + + +
+ +## Examples + + + +```javascript +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); +var ssort = require( '@stdlib/blas/ext/base/ssort' ); + +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float32' +}); +console.log( x ); + +ssort( x.length, 1.0, x, 1 ); +console.log( x ); +``` + +
+ + + + + +* * * + +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/blas/ext/base/ssort.h" +``` + +#### stdlib_strided_ssort( N, order, \*X, strideX ) + +Sorts a single-precision floating-point strided array. + +```c +const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f }; + +stdlib_strided_ssort( 4, 1.0f, x, 1 ); +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **order**: `[in] float` sort order. If `order < 0.0`, the input strided array is sorted in **decreasing** order. If `order > 0.0`, the input strided array is sorted in **increasing** order. If `order == 0.0`, the input strided array is left unchanged. +- **X**: `[inout] float*` input array. +- **strideX**: `[in] CBLAS_INT` stride length. + +```c +void stdlib_strided_ssort( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX ); +``` + + + +#### stdlib_strided_ssort_ndarray( N, order, \*X, strideX, offsetX ) + + + +Sorts a single-precision floating-point strided array using alternative indexing semantics. + +```c +const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f }; + +stdlib_strided_ssort_ndarray( 4, 1.0f, x, 1, 0 ); +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **order**: `[in] float` sort order. If `order < 0.0`, the input strided array is sorted in **decreasing** order. If `order > 0.0`, the input strided array is sorted in **increasing** order. If `order == 0.0`, the input strided array is left unchanged. +- **X**: `[inout] float*` input array. +- **strideX**: `[in] CBLAS_INT` stride length. +- **offsetX**: `[in] CBLAS_INT` starting index. + +```c +void stdlib_strided_ssort_ndarray( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/blas/ext/base/ssort.h" +#include + +int main( void ) { + // Create a strided array: + float x[] = { 1.0f, -2.0f, 3.0f, -4.0f, 5.0f, -6.0f, 7.0f, -8.0f }; + + // Specify the number of elements: + const int N = 8; + + // Specify the stride length: + const int strideX = 1; + + // Sort the array: + stdlib_strided_ssort( N, 1.0f, x, strideX ); + + // Print the result: + for ( int i = 0; i < 8; i++ ) { + printf( "x[ %i ] = %f\n", i, x[ i ] ); + } +} +``` + +
+ + + +
+ + + +
+ +
+ + + + + +
+ +
+ + + + + +
+ +[@stdlib/array/float32]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/float32 + +[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray + + + + + +
+ + diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.js new file mode 100644 index 000000000000..a8bf6495470f --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.js @@ -0,0 +1,122 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 uniform = require( '@stdlib/random/array/uniform' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var pow = require( '@stdlib/math/base/special/pow' ); +var floor = require( '@stdlib/math/base/special/floor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var format = require( '@stdlib/string/format' ); +var pkg = require( './../package.json' ).name; +var ssort = require( './../lib/ssort.js' ); + + +// FUNCTIONS // + +/** +* Create a benchmark function. +* +* @private +* @param {PositiveInteger} iter - number of iterations +* @param {PositiveInteger} len - array length +* @returns {Function} benchmark function +*/ +function createBenchmark( iter, len ) { + var tmp; + var x; + var i; + + x = []; + for ( i = 0; i < iter; i++ ) { + tmp = uniform( len, -100.0, 100.0, { + 'dtype': 'float32' + }); + x.push( tmp ); + } + return benchmark; + + /** + * Benchmark function. + * + * @private + * @param {Benchmark} b - benchmark instance + */ + function benchmark( b ) { + var xc; + var y; + var i; + + xc = x.slice(); + for ( i = 0; i < iter; i++ ) { + xc[ i ] = scopy( len, x[ i ], 1, new Float32Array( len ), 1 ); + } + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + y = ssort( len, 1, xc[ i ], 1 ); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + } + b.toc(); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + b.pass( 'benchmark finished' ); + b.end(); + } +} + + +// MAIN // + +/** +* Main execution sequence. +* +* @private +*/ +function main() { + var opts; + var iter; + var len; + var min; + var max; + var f; + var i; + + iter = 1e6; + min = 1; // 10^min + max = 4; // 10^max + + for ( i = min; i <= max; i++ ) { + len = pow( 10, i ); + f = createBenchmark( iter, len ); + opts = { + 'iterations': iter + }; + bench( format( '%s::unsorted,random:len=%d', pkg, len ), opts, f ); + iter = floor( pow( iter, 3.0/4.0 ) ); + } +} + +main(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.native.js new file mode 100644 index 000000000000..d737398ab3c6 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.native.js @@ -0,0 +1,132 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 resolve = require( 'path' ).resolve; +var bench = require( '@stdlib/bench' ); +var uniform = require( '@stdlib/random/array/uniform' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var pow = require( '@stdlib/math/base/special/pow' ); +var floor = require( '@stdlib/math/base/special/floor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var format = require( '@stdlib/string/format' ); +var pkg = require( './../package.json' ).name; + + +// VARIABLES // + +var ssort = tryRequire( resolve( __dirname, './../lib/ssort.native.js' ) ); +var opts = { + 'skip': ( ssort instanceof Error ) +}; + + +// FUNCTIONS // + +/** +* Create a benchmark function. +* +* @private +* @param {PositiveInteger} iter - number of iterations +* @param {PositiveInteger} len - array length +* @returns {Function} benchmark function +*/ +function createBenchmark( iter, len ) { + var tmp; + var x; + var i; + + x = []; + for ( i = 0; i < iter; i++ ) { + tmp = uniform( len, -100.0, 100.0, { + 'dtype': 'float32' + }); + x.push( tmp ); + } + return benchmark; + + /** + * Benchmark function. + * + * @private + * @param {Benchmark} b - benchmark instance + */ + function benchmark( b ) { + var xc; + var y; + var i; + + xc = x.slice(); + for ( i = 0; i < iter; i++ ) { + xc[ i ] = scopy( len, x[ i ], 1, new Float32Array( len ), 1 ); + } + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + y = ssort( len, 1, xc[ i ], 1 ); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + } + b.toc(); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + b.pass( 'benchmark finished' ); + b.end(); + } +} + + +// MAIN // + +/** +* Main execution sequence. +* +* @private +*/ +function main() { + var bopts; + var iter; + var len; + var min; + var max; + var f; + var i; + + iter = 1e6; + min = 1; // 10^min + max = 4; // 10^max + + for ( i = min; i <= max; i++ ) { + len = pow( 10, i ); + f = createBenchmark( iter, len ); + bopts = { + 'skip': opts.skip, + 'iterations': iter + }; + bench( format( '%s::native,unsorted,random:len=%d', pkg, len ), bopts, f ); + iter = floor( pow( iter, 3.0/4.0 ) ); + } +} + +main(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.js new file mode 100644 index 000000000000..c415d689264a --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.js @@ -0,0 +1,122 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 uniform = require( '@stdlib/random/array/uniform' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var pow = require( '@stdlib/math/base/special/pow' ); +var floor = require( '@stdlib/math/base/special/floor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var format = require( '@stdlib/string/format' ); +var pkg = require( './../package.json' ).name; +var ssort = require( './../lib/ndarray.js' ); + + +// FUNCTIONS // + +/** +* Create a benchmark function. +* +* @private +* @param {PositiveInteger} iter - number of iterations +* @param {PositiveInteger} len - array length +* @returns {Function} benchmark function +*/ +function createBenchmark( iter, len ) { + var tmp; + var x; + var i; + + x = []; + for ( i = 0; i < iter; i++ ) { + tmp = uniform( len, -100.0, 100.0, { + 'dtype': 'float32' + }); + x.push( tmp ); + } + return benchmark; + + /** + * Benchmark function. + * + * @private + * @param {Benchmark} b - benchmark instance + */ + function benchmark( b ) { + var xc; + var y; + var i; + + xc = x.slice(); + for ( i = 0; i < iter; i++ ) { + xc[ i ] = scopy( len, x[ i ], 1, new Float32Array( len ), 1 ); + } + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + y = ssort( len, 1, xc[ i ], 1, 0 ); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + } + b.toc(); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + b.pass( 'benchmark finished' ); + b.end(); + } +} + + +// MAIN // + +/** +* Main execution sequence. +* +* @private +*/ +function main() { + var opts; + var iter; + var len; + var min; + var max; + var f; + var i; + + iter = 1e6; + min = 1; // 10^min + max = 4; // 10^max + + for ( i = min; i <= max; i++ ) { + len = pow( 10, i ); + f = createBenchmark( iter, len ); + opts = { + 'iterations': iter + }; + bench( format( '%s::unsorted,random:ndarray:len=%d', pkg, len ), opts, f ); + iter = floor( pow( iter, 3.0/4.0 ) ); + } +} + +main(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.native.js new file mode 100644 index 000000000000..ff225ba6e533 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/benchmark.unsorted_random.ndarray.native.js @@ -0,0 +1,132 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 resolve = require( 'path' ).resolve; +var bench = require( '@stdlib/bench' ); +var uniform = require( '@stdlib/random/array/uniform' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var pow = require( '@stdlib/math/base/special/pow' ); +var floor = require( '@stdlib/math/base/special/floor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var format = require( '@stdlib/string/format' ); +var pkg = require( './../package.json' ).name; + + +// VARIABLES // + +var ssort = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) ); +var opts = { + 'skip': ( ssort instanceof Error ) +}; + + +// FUNCTIONS // + +/** +* Create a benchmark function. +* +* @private +* @param {PositiveInteger} iter - number of iterations +* @param {PositiveInteger} len - array length +* @returns {Function} benchmark function +*/ +function createBenchmark( iter, len ) { + var tmp; + var x; + var i; + + x = []; + for ( i = 0; i < iter; i++ ) { + tmp = uniform( len, -100.0, 100.0, { + 'dtype': 'float32' + }); + x.push( tmp ); + } + return benchmark; + + /** + * Benchmark function. + * + * @private + * @param {Benchmark} b - benchmark instance + */ + function benchmark( b ) { + var xc; + var y; + var i; + + xc = x.slice(); + for ( i = 0; i < iter; i++ ) { + xc[ i ] = scopy( len, x[ i ], 1, new Float32Array( len ), 1 ); + } + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + y = ssort( len, 1, xc[ i ], 1, 0 ); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + } + b.toc(); + if ( isnan( y[ i%len ] ) ) { + b.fail( 'should not return NaN' ); + } + b.pass( 'benchmark finished' ); + b.end(); + } +} + + +// MAIN // + +/** +* Main execution sequence. +* +* @private +*/ +function main() { + var bopts; + var iter; + var len; + var min; + var max; + var f; + var i; + + iter = 1e6; + min = 1; // 10^min + max = 4; // 10^max + + for ( i = min; i <= max; i++ ) { + len = pow( 10, i ); + f = createBenchmark( iter, len ); + bopts = { + 'skip': opts.skip, + 'iterations': iter + }; + bench( format( '%s::native,unsorted,random:ndarray:len=%d', pkg, len ), bopts, f ); + iter = floor( pow( iter, 3.0/4.0 ) ); + } +} + +main(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/Makefile new file mode 100644 index 000000000000..0756dc7da20a --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/Makefile @@ -0,0 +1,146 @@ +#/ +# @license Apache-2.0 +# +# Copyright (c) 2026 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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + +# Define the program used for compiling C source files: +ifdef C_COMPILER + CC := $(C_COMPILER) +else + CC := gcc +endif + +# Define the command-line options when compiling C files: +CFLAGS ?= \ + -std=c99 \ + -O3 \ + -Wall \ + -pedantic + +# Determine whether to generate position independent code ([1][1], [2][2]). +# +# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options +# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option +ifeq ($(OS), WINNT) + fPIC ?= +else + fPIC ?= -fPIC +endif + +# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`): +INCLUDE ?= + +# List of source files: +SOURCE_FILES ?= + +# List of libraries (e.g., `-lopenblas -lpthread`): +LIBRARIES ?= + +# List of library paths (e.g., `-L /foo/bar -L /beep/boop`): +LIBPATH ?= + +# List of C targets: +c_targets := benchmark.length.out + + +# RULES # + +#/ +# Compiles source files. +# +# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`) +# @param {string} [CFLAGS] - C compiler options +# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`) +# @param {string} [SOURCE_FILES] - list of source files +# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`) +# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`) +# +# @example +# make +# +# @example +# make all +#/ +all: $(c_targets) + +.PHONY: all + +#/ +# Compiles C source files. +# +# @private +# @param {string} CC - C compiler (e.g., `gcc`) +# @param {string} CFLAGS - C compiler options +# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`) +# @param {string} SOURCE_FILES - list of source files +# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`) +# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`) +#/ +$(c_targets): %.out: %.c + $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES) + +#/ +# Runs compiled benchmarks. +# +# @example +# make run +#/ +run: $(c_targets) + $(QUIET) ./$< + +.PHONY: run + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: + $(QUIET) -rm -f *.o *.out + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/benchmark.length.c new file mode 100644 index 000000000000..dbae83ec61ac --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/benchmark.length.c @@ -0,0 +1,195 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +#include "stdlib/blas/ext/base/ssort.h" +#include +#include +#include +#include +#include + +#define NAME "dsort" +#define ITERATIONS 10000000 +#define REPEATS 3 +#define MIN 1 +#define MAX 6 + +/** +* Prints the TAP version. +*/ +static void print_version( void ) { + printf( "TAP version 13\n" ); +} + +/** +* Prints the TAP summary. +* +* @param total total number of tests +* @param passing total number of passing tests +*/ +static void print_summary( int total, int passing ) { + printf( "#\n" ); + printf( "1..%d\n", total ); // TAP plan + printf( "# total %d\n", total ); + printf( "# pass %d\n", passing ); + printf( "#\n" ); + printf( "# ok\n" ); +} + +/** +* Prints benchmarks results. +* +* @param iterations number of iterations +* @param elapsed elapsed time in seconds +*/ +static void print_results( int iterations, double elapsed ) { + double rate = (double)iterations / elapsed; + printf( " ---\n" ); + printf( " iterations: %d\n", iterations ); + printf( " elapsed: %0.9f\n", elapsed ); + printf( " rate: %0.9f\n", rate ); + printf( " ...\n" ); +} + +/** +* Returns a clock time. +* +* @return clock time +*/ +static double tic( void ) { + struct timeval now; + gettimeofday( &now, NULL ); + return (double)now.tv_sec + (double)now.tv_usec/1.0e6; +} + +/** +* Generates a random number on the interval [0,1). +* +* @return random number +*/ +static float rand_float( void ) { + int r = rand(); + return (float)r / ( (float)RAND_MAX + 1.0 ); +} + +/** +* Runs a benchmark. +* +* @param iterations number of iterations +* @param len array length +* @return elapsed time in seconds +*/ +static double benchmark1( int iterations, int len ) { + double elapsed; + float *x; + double t; + int i; + + x = (float *) malloc( len * sizeof( float ) ); + for ( i = 0; i < len; i++ ) { + x[ i ] = ( rand_float()*20.0 ) - 10.0; + } + t = tic(); + for ( i = 0; i < iterations; i++ ) { + stdlib_strided_ssort( len, 1.0f, x, 1 ); + if ( x[ 0 ] != x[ 0 ] ) { + printf( "should not return NaN\n" ); + break; + } + } + elapsed = tic() - t; + if ( x[ 0 ] != x[ 0 ] ) { + printf( "should not return NaN\n" ); + } + free( x ); + return elapsed; +} + +/** +* Runs a benchmark. +* +* @param iterations number of iterations +* @param len array length +* @return elapsed time in seconds +*/ +static double benchmark2( int iterations, int len ) { + double elapsed; + float *x; + double t; + int i; + + x = (float *) malloc( len * sizeof( float ) ); + for ( i = 0; i < len; i++ ) { + x[ i ] = ( rand_float()*20.0 ) - 10.0; + } + t = tic(); + for ( i = 0; i < iterations; i++ ) { + stdlib_strided_ssort_ndarray( len, 1.0f, x, 1, 0 ); + if ( x[ 0 ] != x[ 0 ] ) { + printf( "should not return NaN\n" ); + break; + } + } + elapsed = tic() - t; + if ( x[ 0 ] != x[ 0 ] ) { + printf( "should not return NaN\n" ); + } + free( x ); + return elapsed; +} + +/** +* Main execution sequence. +*/ +int main( void ) { + double elapsed; + int count; + int iter; + int len; + int i; + int j; + + // Use the current time to seed the random number generator: + srand( time( NULL ) ); + + print_version(); + count = 0; + for ( i = MIN; i <= MAX; i++ ) { + len = pow( 10, i ); + iter = ITERATIONS / pow( 10, i-1 ); + for ( j = 0; j < REPEATS; j++ ) { + count += 1; + printf( "# c::%s:unsorted,random:len=%d\n", NAME, len ); + elapsed = benchmark1( iter, len ); + print_results( iter, elapsed ); + printf( "ok %d benchmark finished\n", count ); + } + } + for ( i = MIN; i <= MAX; i++ ) { + len = pow( 10, i ); + iter = ITERATIONS / pow( 10, i-1 ); + for ( j = 0; j < REPEATS; j++ ) { + count += 1; + printf( "# c::%s:ndarray:unsorted,random:len=%d\n", NAME, len ); + elapsed = benchmark2( iter, len ); + print_results( iter, elapsed ); + printf( "ok %d benchmark finished\n", count ); + } + } + print_summary( count, count ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/binding.gyp b/lib/node_modules/@stdlib/blas/ext/base/ssort/binding.gyp new file mode 100644 index 000000000000..0d6508a12e99 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/binding.gyp @@ -0,0 +1,170 @@ +# @license Apache-2.0 +# +# Copyright (c) 2026 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. + +# A `.gyp` file for building a Node.js native add-on. +# +# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md +# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md +{ + # List of files to include in this file: + 'includes': [ + './include.gypi', + ], + + # Define variables to be used throughout the configuration for all targets: + 'variables': { + # Target name should match the add-on export name: + 'addon_target_name%': 'addon', + + # Set variables based on the host OS: + 'conditions': [ + [ + 'OS=="win"', + { + # Define the object file suffix: + 'obj': 'obj', + }, + { + # Define the object file suffix: + 'obj': 'o', + } + ], # end condition (OS=="win") + ], # end conditions + }, # end variables + + # Define compile targets: + 'targets': [ + + # Target to generate an add-on: + { + # The target name should match the add-on export name: + 'target_name': '<(addon_target_name)', + + # Define dependencies: + 'dependencies': [], + + # Define directories which contain relevant include headers: + 'include_dirs': [ + # Local include directory: + '<@(include_dirs)', + ], + + # List of source files: + 'sources': [ + '<@(src_files)', + ], + + # Settings which should be applied when a target's object files are used as linker input: + 'link_settings': { + # Define libraries: + 'libraries': [ + '<@(libraries)', + ], + + # Define library directories: + 'library_dirs': [ + '<@(library_dirs)', + ], + }, + + # C/C++ compiler flags: + 'cflags': [ + # Enable commonly used warning options: + '-Wall', + + # Aggressive optimization: + '-O3', + ], + + # C specific compiler flags: + 'cflags_c': [ + # Specify the C standard to which a program is expected to conform: + '-std=c99', + ], + + # C++ specific compiler flags: + 'cflags_cpp': [ + # Specify the C++ standard to which a program is expected to conform: + '-std=c++11', + ], + + # Linker flags: + 'ldflags': [], + + # Apply conditions based on the host OS: + 'conditions': [ + [ + 'OS=="mac"', + { + # Linker flags: + 'ldflags': [ + '-undefined dynamic_lookup', + '-Wl,-no-pie', + '-Wl,-search_paths_first', + ], + }, + ], # end condition (OS=="mac") + [ + 'OS!="win"', + { + # C/C++ flags: + 'cflags': [ + # Generate platform-independent code: + '-fPIC', + ], + }, + ], # end condition (OS!="win") + ], # end conditions + }, # end target <(addon_target_name) + + # Target to copy a generated add-on to a standard location: + { + 'target_name': 'copy_addon', + + # Declare that the output of this target is not linked: + 'type': 'none', + + # Define dependencies: + 'dependencies': [ + # Require that the add-on be generated before building this target: + '<(addon_target_name)', + ], + + # Define a list of actions: + 'actions': [ + { + 'action_name': 'copy_addon', + 'message': 'Copying addon...', + + # Explicitly list the inputs in the command-line invocation below: + 'inputs': [], + + # Declare the expected outputs: + 'outputs': [ + '<(addon_output_dir)/<(addon_target_name).node', + ], + + # Define the command-line invocation: + 'action': [ + 'cp', + '<(PRODUCT_DIR)/<(addon_target_name).node', + '<(addon_output_dir)/<(addon_target_name).node', + ], + }, + ], # end actions + }, # end target copy_addon + ], # end targets +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/repl.txt new file mode 100644 index 000000000000..7434b5ef0109 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/repl.txt @@ -0,0 +1,113 @@ + +{{alias}}( N, order, x, strideX ) + Sorts a single-precision floating-point strided array. + + The `N` and stride parameters determine which elements in the strided array + are accessed at runtime. + + Indexing is relative to the first index. To introduce an offset, use typed + array views. + + If `N <= 0` or `order == 0`, the function returns `x` 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 input strided array is sorted *in-place* (i.e., the input strided array + is *mutated*). + + Parameters + ---------- + N: integer + Number of indexed elements. + + order: number + Sort order. If `order < 0`, the function sorts `x` in decreasing order. + If `order > 0`, the function sorts `x` in increasing order. + + x: Float32Array + Input array. + + strideX: integer + Stride length. + + Returns + ------- + x: Float32Array + Input array. + + Examples + -------- + // Standard Usage: + > var x = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, -4.0 ] ); + > {{alias}}( x.length, 1.0, x, 1 ); + > x + [ -4.0, -2.0, 1.0, 3.0 ] + + // Using `N` and stride parameters: + > x = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, -4.0 ] ); + > {{alias}}( 2, -1.0, x, 2 ); + > x + [ 3.0, -2.0, 1.0, -4.0 ] + + // Using view offsets: + > var x0 = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, -4.0 ] ); + > var x1 = new {{alias:@stdlib/array/float32}}( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); + > {{alias}}( 2, 1.0, x1, 2 ); + > x0 + [ 1.0, -4.0, 3.0, -2.0 ] + + +{{alias}}.ndarray( N, order, x, strideX, offsetX ) + Sorts a double-precision floating-point strided array using alternative + indexing semantics. + + While typed array views mandate a view offset based on the underlying + buffer, the offset parameter supports indexing semantics based on a starting + index. + + Parameters + ---------- + N: integer + Number of indexed elements. + + order: number + Sort order. If `order < 0`, the function sorts `x` in decreasing order. + If `order > 0`, the function sorts `x` in increasing order. + + x: Float32Array + Input array. + + strideX: integer + Stride length. + + offsetX: integer + Starting index. + + Returns + ------- + x: Float32Array + Input array. + + Examples + -------- + // Standard Usage: + > var x = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, -4.0 ] ); + > {{alias}}.ndarray( x.length, 1.0, x, 1, 0 ); + > x + [ -4.0, -2.0, 1.0, 3.0 ] + + // Using an index offset: + > x = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ] ); + > {{alias}}.ndarray( 3, 1.0, x, 1, 3 ); + > x + [ 1.0, -2.0, 3.0, -6.0, -4.0, 5.0 ] + + See Also + -------- + diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/index.d.ts new file mode 100644 index 000000000000..17b1d891682b --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/index.d.ts @@ -0,0 +1,95 @@ +/* +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +// TypeScript Version: 4.1 + +/** +* Interface describing `ssort`. +*/ +interface Routine { + /** + * Sorts a single-precision floating-point strided array. + * + * @param N - number of indexed elements + * @param order - sort order + * @param x - input array + * @param strideX - stride length + * @returns input array + * + * @example + * var Float32Array = require( '@stdlib/array/float32' ); + * + * var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); + * + * ssort( x.length, 1.0, x, 1 ); + * // x => [ -4.0, -2.0, 1.0, 3.0 ] + */ + ( N: number, order: number, x: Float32Array, strideX: number ): Float32Array; + + /** + * Sorts a single-precision floating-point strided array using alternative indexing semantics. + * + * @param N - number of indexed elements + * @param order - sort order + * @param x - input array + * @param strideX - stride length + * @param offsetX - starting index + * @returns input array + * + * @example + * var Float32Array = require( '@stdlib/array/float32' ); + * + * var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); + * + * ssort.ndarray( x.length, 1.0, x, 1, 0 ); + * // x => [ -4.0, -2.0, 1.0, 3.0 ] + */ + ndarray( N: number, order: number, x: Float32Array, strideX: number, offsetX: number ): Float32Array; +} + +/** +* Sorts a single-precision floating-point strided array. +* +* @param N - number of indexed elements +* @param order - sort order +* @param x - input array +* @param strideX - stride length +* @returns input array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort( x.length, 1.0, x, 1 ); +* // x => [ -4.0, -2.0, 1.0, 3.0 ] +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort.ndarray( x.length, 1.0, x, 1, 0 ); +* // x => [ -4.0, -2.0, 1.0, 3.0 ] +*/ +declare var ssort: Routine; + + +// EXPORTS // + +export = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/test.ts b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/test.ts new file mode 100644 index 000000000000..cfcf9a821a42 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/docs/types/test.ts @@ -0,0 +1,187 @@ +/* +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +import ssort = require( './index' ); + + +// TESTS // + +// The function returns a Float32Array... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort( x.length, 1.0, x, 1 ); // $ExpectType Float32Array +} + +// The compiler throws an error if the function is provided a first argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort( '10', 1.0, x, 1 ); // $ExpectError + ssort( true, 1.0, x, 1 ); // $ExpectError + ssort( false, 1.0, x, 1 ); // $ExpectError + ssort( null, 1.0, x, 1 ); // $ExpectError + ssort( undefined, 1.0, x, 1 ); // $ExpectError + ssort( [], 1.0, x, 1 ); // $ExpectError + ssort( {}, 1.0, x, 1 ); // $ExpectError + ssort( ( x: number ): number => x, 1.0, x, 1 ); // $ExpectError +} + +// The compiler throws an error if the function is provided a second argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort( x.length, '10', x, 1 ); // $ExpectError + ssort( x.length, true, x, 1 ); // $ExpectError + ssort( x.length, false, x, 1 ); // $ExpectError + ssort( x.length, null, x, 1 ); // $ExpectError + ssort( x.length, undefined, x, 1 ); // $ExpectError + ssort( x.length, [], x, 1 ); // $ExpectError + ssort( x.length, {}, x, 1 ); // $ExpectError + ssort( x.length, ( x: number ): number => x, x, 1 ); // $ExpectError +} + +// The compiler throws an error if the function is provided a third argument which is not a Float32Array... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort( x.length, 1.0, '10', 1 ); // $ExpectError + ssort( x.length, 1.0, 10, 1 ); // $ExpectError + ssort( x.length, 1.0, true, 1 ); // $ExpectError + ssort( x.length, 1.0, false, 1 ); // $ExpectError + ssort( x.length, 1.0, null, 1 ); // $ExpectError + ssort( x.length, 1.0, undefined, 1 ); // $ExpectError + ssort( x.length, 1.0, [], 1 ); // $ExpectError + ssort( x.length, 1.0, {}, 1 ); // $ExpectError + ssort( x.length, 1.0, ( x: number ): number => x, 1 ); // $ExpectError +} + +// The compiler throws an error if the function is provided a fourth argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort( x.length, 1.0, x, '10' ); // $ExpectError + ssort( x.length, 1.0, x, true ); // $ExpectError + ssort( x.length, 1.0, x, false ); // $ExpectError + ssort( x.length, 1.0, x, null ); // $ExpectError + ssort( x.length, 1.0, x, undefined ); // $ExpectError + ssort( x.length, 1.0, x, [] ); // $ExpectError + ssort( x.length, 1.0, x, {} ); // $ExpectError + ssort( x.length, 1.0, x, ( x: number ): number => x ); // $ExpectError +} + +// The compiler throws an error if the function is provided an unsupported number of arguments... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort(); // $ExpectError + ssort( x.length ); // $ExpectError + ssort( x.length, 1.0 ); // $ExpectError + ssort( x.length, 1.0, x ); // $ExpectError + ssort( x.length, 1.0, x, 1, {} ); // $ExpectError +} + +// Attached to main export is an `ndarray` method which returns a Float32Array... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( x.length, 1.0, x, 1, 0 ); // $ExpectType Float32Array +} + +// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( '10', 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( true, 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( false, 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( null, 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( undefined, 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( [], 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( {}, 1.0, x, 1, 0 ); // $ExpectError + ssort.ndarray( ( x: number ): number => x, 1.0, x, 1, 0 ); // $ExpectError +} + +// The compiler throws an error if the `ndarray` method is provided a second argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( x.length, '10', x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, true, x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, false, x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, null, x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, undefined, x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, [], x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, {}, x, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, ( x: number ): number => x, x, 1, 0 ); // $ExpectError +} + +// The compiler throws an error if the `ndarray` method is provided a third argument which is not a Float32Array... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( x.length, 1.0, '10', 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, 10, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, true, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, false, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, null, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, undefined, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, [], 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, {}, 1, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, ( x: number ): number => x, 1, 0 ); // $ExpectError +} + +// The compiler throws an error if the `ndarray` method is provided a fourth argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( x.length, 1.0, x, '10', 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, true, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, false, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, null, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, undefined, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, [], 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, {}, 0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, ( x: number ): number => x, 0 ); // $ExpectError +} + +// The compiler throws an error if the `ndarray` method is provided a fifth argument which is not a number... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray( x.length, 1.0, x, 1, '10' ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, true ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, false ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, null ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, undefined ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, [] ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, {} ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, ( x: number ): number => x ); // $ExpectError +} + +// The compiler throws an error if the `ndarray` method is provided an unsupported number of arguments... +{ + const x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0 ] ); + + ssort.ndarray(); // $ExpectError + ssort.ndarray( x.length ); // $ExpectError + ssort.ndarray( x.length, 1.0 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1 ); // $ExpectError + ssort.ndarray( x.length, 1.0, x, 1, 0, {} ); // $ExpectError +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/Makefile new file mode 100644 index 000000000000..c8f8e9a1517b --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/Makefile @@ -0,0 +1,146 @@ +#/ +# @license Apache-2.0 +# +# Copyright (c) 2026 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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + +# Define the program used for compiling C source files: +ifdef C_COMPILER + CC := $(C_COMPILER) +else + CC := gcc +endif + +# Define the command-line options when compiling C files: +CFLAGS ?= \ + -std=c99 \ + -O3 \ + -Wall \ + -pedantic + +# Determine whether to generate position independent code ([1][1], [2][2]). +# +# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options +# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option +ifeq ($(OS), WINNT) + fPIC ?= +else + fPIC ?= -fPIC +endif + +# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`): +INCLUDE ?= + +# List of source files: +SOURCE_FILES ?= + +# List of libraries (e.g., `-lopenblas -lpthread`): +LIBRARIES ?= + +# List of library paths (e.g., `-L /foo/bar -L /beep/boop`): +LIBPATH ?= + +# List of C targets: +c_targets := example.out + + +# RULES # + +#/ +# Compiles source files. +# +# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`) +# @param {string} [CFLAGS] - C compiler options +# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`) +# @param {string} [SOURCE_FILES] - list of source files +# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`) +# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`) +# +# @example +# make +# +# @example +# make all +#/ +all: $(c_targets) + +.PHONY: all + +#/ +# Compiles C source files. +# +# @private +# @param {string} CC - C compiler (e.g., `gcc`) +# @param {string} CFLAGS - C compiler options +# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`) +# @param {string} SOURCE_FILES - list of source files +# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`) +# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`) +#/ +$(c_targets): %.out: %.c + $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES) + +#/ +# Runs compiled examples. +# +# @example +# make run +#/ +run: $(c_targets) + $(QUIET) ./$< + +.PHONY: run + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: + $(QUIET) -rm -f *.o *.out + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/example.c new file mode 100644 index 000000000000..0c6f0a97ab77 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/example.c @@ -0,0 +1,39 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +#include "stdlib/blas/ext/base/ssort.h" +#include + +int main( void ) { + // Create a strided array: + float x[] = { 1.0f, -2.0f, 3.0f, -4.0f, 5.0f, -6.0f, 7.0f, -8.0f }; + + // Specify the number of elements: + int N = 8; + + // Specify a stride: + int strideX = 1; + + // Sort the array: + stdlib_strided_dsort( N, 1.0f, x, strideX ); + + // Print the result: + for ( int i = 0; i < 8; i++ ) { + printf( "x[ %i ] = %f\n", i, x[ i ] ); + } +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/index.js new file mode 100644 index 000000000000..8930f5a86f8b --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/examples/index.js @@ -0,0 +1,30 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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'; + +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); +var ssort = require( './../lib' ); + +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float32' +}); +console.log( x ); + +ssort( x.length, 1.0, x, 1 ); +console.log( x ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/include.gypi b/lib/node_modules/@stdlib/blas/ext/base/ssort/include.gypi new file mode 100644 index 000000000000..bee8d41a2caf --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/include.gypi @@ -0,0 +1,53 @@ +# @license Apache-2.0 +# +# Copyright (c) 2026 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. + +# A GYP include file for building a Node.js native add-on. +# +# Main documentation: +# +# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md +# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md +{ + # Define variables to be used throughout the configuration for all targets: + 'variables': { + # Source directory: + 'src_dir': './src', + + # Include directories: + 'include_dirs': [ + ' [ -4.0, -2.0, 1.0, 3.0 ] +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* var ssort = require( '@stdlib/blas/ext/base/ssort' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort.ndarray( x.length, 1.0, x, 1, 0 ); +* // x => [ -4.0, -2.0, 1.0, 3.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 ssort; +var tmp = tryRequire( join( __dirname, './native.js' ) ); +if ( isError( tmp ) ) { + ssort = main; +} else { + ssort = tmp; +} + + +// EXPORTS // + +module.exports = ssort; + +// exports: { "ndarray": "ssort.ndarray" } diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/main.js new file mode 100644 index 000000000000..34243a645db2 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/main.js @@ -0,0 +1,35 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 ssort = require( './ssort.js' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +setReadOnly( ssort, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/native.js new file mode 100644 index 000000000000..2db6e93302d2 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/native.js @@ -0,0 +1,35 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 ssort = require( './ssort.native.js' ); +var ndarray = require( './ndarray.native.js' ); + + +// MAIN // + +setReadOnly( ssort, 'ndarray', ndarray ); + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.js new file mode 100644 index 000000000000..239ecde6ca33 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.js @@ -0,0 +1,53 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 ssorthp = require( '@stdlib/blas/ext/base/ssorthp' ).ndarray; + + +// MAIN // + +/** +* Sorts a single-precision floating-point strided array. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} order - sort order +* @param {Float32Array} x - input array +* @param {integer} strideX - stride length +* @param {NonNegativeInteger} offsetX - starting index +* @returns {Float32Array} input array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort( x.length, 1.0, x, 1, 0 ); +* // x => [ -4.0, -2.0, 1.0, 3.0 ] +*/ +function ssort( N, order, x, strideX, offsetX ) { + return ssorthp( N, order, x, strideX, offsetX ); +} + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.native.js new file mode 100644 index 000000000000..4dc85a66de6f --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ndarray.native.js @@ -0,0 +1,53 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 // + +/** +* Sorts a single-precision floating-point strided array. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} order - sort order +* @param {Float32Array} x - input array +* @param {integer} strideX - stride length +* @param {NonNegativeInteger} offsetX - starting index +* @returns {Float32Array} input array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort( x.length, 1.0, x, 1, 0 ); +*/ +function ssort( N, order, x, strideX, offsetX ) { + addon.ndarray( N, order, x, strideX, offsetX ); + return x; +} + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.js new file mode 100644 index 000000000000..9c9aaaacc730 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.js @@ -0,0 +1,53 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 stride2offset = require( '@stdlib/strided/base/stride2offset' ); +var ndarray = require( './ndarray.js' ); + + +// MAIN // + +/** +* Sorts a single-precision floating-point strided array. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} order - sort order +* @param {Float32Array} x - input array +* @param {integer} strideX - stride length +* @returns {Float32Array} input array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort( x.length, 1.0, x, 1 ); +* // x => [ -4.0, -2.0, 1.0, 3.0 ] +*/ +function ssort( N, order, x, strideX ) { + return ndarray( N, order, x, strideX, stride2offset( N, strideX ) ); +} + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.native.js new file mode 100644 index 000000000000..37b6db60fd1f --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/lib/ssort.native.js @@ -0,0 +1,53 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 // + +/** +* Sorts a single-precision floating-point strided array. +* +* @param {PositiveInteger} N - number of indexed elements +* @param {number} order - sort order +* @param {Float32Array} x - input array +* @param {integer} strideX - stride length +* @returns {Float32Array} input array +* +* @example +* var Float32Array = require( '@stdlib/array/float32' ); +* +* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] ); +* +* ssort( x.length, 1.0, x, 1 ); +* // x => [ -4.0, -2.0, 1.0, 3.0 ] +*/ +function ssort( N, order, x, strideX ) { + addon( N, order, x, strideX ); + return x; +} + + +// EXPORTS // + +module.exports = ssort; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/ssort/manifest.json new file mode 100644 index 000000000000..864f65d4a1f2 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/manifest.json @@ -0,0 +1,82 @@ +{ + "options": { + "task": "build" + }, + "fields": [ + { + "field": "src", + "resolve": true, + "relative": true + }, + { + "field": "include", + "resolve": true, + "relative": true + }, + { + "field": "libraries", + "resolve": false, + "relative": false + }, + { + "field": "libpath", + "resolve": true, + "relative": false + } + ], + "confs": [ + { + "task": "build", + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/napi/export", + "@stdlib/napi/argv", + "@stdlib/napi/argv-int64", + "@stdlib/napi/argv-float", + "@stdlib/napi/argv-strided-float32array", + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/ssorthp" + ] + }, + { + "task": "benchmark", + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/ssorthp" + ] + }, + { + "task": "examples", + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/ssorthp" + ] + } + ] +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/package.json b/lib/node_modules/@stdlib/blas/ext/base/ssort/package.json new file mode 100644 index 000000000000..069f1226fab9 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/package.json @@ -0,0 +1,74 @@ +{ + "name": "@stdlib/blas/ext/base/ssort", + "version": "0.0.0", + "description": "Sort a single-precision floating-point strided array.", + "license": "Apache-2.0", + "author": { + "name": "The Stdlib Authors", + "url": "https://github.com/stdlib-js/stdlib/graphs/contributors" + }, + "contributors": [ + { + "name": "The Stdlib Authors", + "url": "https://github.com/stdlib-js/stdlib/graphs/contributors" + } + ], + "main": "./lib", + "browser": "./lib/main.js", + "gypfile": true, + "directories": { + "benchmark": "./benchmark", + "doc": "./docs", + "example": "./examples", + "include": "./include", + "lib": "./lib", + "src": "./src", + "test": "./test" + }, + "types": "./docs/types", + "scripts": {}, + "homepage": "https://github.com/stdlib-js/stdlib", + "repository": { + "type": "git", + "url": "git://github.com/stdlib-js/stdlib.git" + }, + "bugs": { + "url": "https://github.com/stdlib-js/stdlib/issues" + }, + "dependencies": {}, + "devDependencies": {}, + "engines": { + "node": ">=0.10.0", + "npm": ">2.7.0" + }, + "os": [ + "aix", + "darwin", + "freebsd", + "linux", + "macos", + "openbsd", + "sunos", + "win32", + "windows" + ], + "keywords": [ + "stdlib", + "stdmath", + "mathematics", + "math", + "blas", + "extended", + "sort", + "order", + "arrange", + "permute", + "strided", + "array", + "ndarray", + "float32", + "single", + "float32array" + ], + "__stdlib__": {} +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/src/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/Makefile new file mode 100644 index 000000000000..2caf905cedbe --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/Makefile @@ -0,0 +1,70 @@ +#/ +# @license Apache-2.0 +# +# Copyright (c) 2026 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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + + +# RULES # + +#/ +# Removes generated files for building an add-on. +# +# @example +# make clean-addon +#/ +clean-addon: + $(QUIET) -rm -f *.o *.node + +.PHONY: clean-addon + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: clean-addon + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/addon.c new file mode 100644 index 000000000000..61abafd41118 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/addon.c @@ -0,0 +1,62 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +#include "stdlib/blas/ext/base/ssort.h" +#include "stdlib/napi/export.h" +#include "stdlib/napi/argv.h" +#include "stdlib/napi/argv_float.h" +#include "stdlib/napi/argv_int64.h" +#include "stdlib/napi/argv_strided_float32array.h" +#include + +/** +* Receives JavaScript callback invocation data. +* +* @param env environment under which the function is invoked +* @param info callback data +* @return Node-API value +*/ +static napi_value addon( napi_env env, napi_callback_info info ) { + STDLIB_NAPI_ARGV( env, info, argv, argc, 4 ); + STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 ); + STDLIB_NAPI_ARGV_FLOAT( env, order, argv, 1 ); + STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 ); + API_SUFFIX(stdlib_strided_ssort)( N, order, X, strideX ); + return NULL; +} + +/** +* Receives JavaScript callback invocation data. +* +* @param env environment under which the function is invoked +* @param info callback data +* @return Node-API value +*/ +static napi_value addon_method( napi_env env, napi_callback_info info ) { + STDLIB_NAPI_ARGV( env, info, argv, argc, 5 ); + STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 ); + STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 ); + STDLIB_NAPI_ARGV_INT64( env, offsetX, argv, 4 ); + STDLIB_NAPI_ARGV_FLOAT( env, order, argv, 1 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 ); + API_SUFFIX(stdlib_strided_ssort_ndarray)( N, order, X, strideX, offsetX ); + return NULL; +} + +STDLIB_NAPI_MODULE_EXPORT_FCN_WITH_METHOD( addon, "ndarray", addon_method ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/main.c new file mode 100644 index 000000000000..1e6f08a03fa3 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/src/main.c @@ -0,0 +1,48 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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. +*/ + +#include "stdlib/blas/ext/base/ssort.h" +#include "stdlib/blas/ext/base/ssorthp.h" +#include "stdlib/blas/base/shared.h" +#include "stdlib/strided/base/stride2offset.h" + +/** +* Sorts a single-precision floating-point strided array. +* +* @param N number of indexed elements +* @param order sort order +* @param X input array +* @param strideX stride length +*/ +void API_SUFFIX(stdlib_strided_ssort)( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX ) { + CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX ); + API_SUFFIX(stdlib_strided_ssort_ndarray)( N, order, X, strideX, ox ); +} + +/** +* Sorts a single-precision floating-point strided array using alternative indexing semantics. +* +* @param N number of indexed elements +* @param order sort order +* @param X input array +* @param strideX stride length +* @param offsetX starting index +*/ +void API_SUFFIX(stdlib_strided_ssort_ndarray)( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ) { + API_SUFFIX(stdlib_strided_ssorthp_ndarray)( N, order, X, strideX, offsetX ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/ascending.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/ascending.js new file mode 100644 index 000000000000..d67b3f475d99 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/ascending.js @@ -0,0 +1,75 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 isnan = require( '@stdlib/math/base/assert/is-nan' ); +var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); + + +// MAIN // + +/** +* Determines sort order by comparing two values. +* +* ## Notes +* +* - Return values are as follows: +* +* - `-1`: sort `a` to a lower index than `b` (i.e., `a` comes first) +* - `1`: sort `b` to a lower index than `a` (i.e., `b` comes first) +* - `0`: leave the order of `a` and `b` unchanged with respect to one another +* +* @private +* @param {number} a - first value +* @param {number} b - second value +* @returns {integer} value indicating sort order +*/ +function ascending( a, b ) { + // Sort NaNs to the end... + if ( isnan( a ) ) { + return 1; + } + if ( isnan( b ) ) { + return -1; + } + // Sort negative 0s to the left... + if ( a === b && a === 0 ) { + if ( isNegativeZero( a ) ) { + return -1; + } + if ( isNegativeZero( b ) ) { + return 1; + } + return 0; + } + if ( a > b ) { + return 1; + } + if ( a < b ) { + return -1; + } + return 0; +} + + +// EXPORTS // + +module.exports = ascending; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/num2str.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/num2str.js new file mode 100644 index 000000000000..d4bce1cee666 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/fixtures/num2str.js @@ -0,0 +1,45 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); + + +// MAIN // + +/** +* Converts a number to a string. +* +* @private +* @param {number} value - input value +* @returns {string} string representation +*/ +function num2str( value ) { + if ( isNegativeZero( value ) ) { + return '-0'; + } + return value.toString(); +} + + +// EXPORTS // + +module.exports = num2str; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.js new file mode 100644 index 000000000000..304bebb45900 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.js @@ -0,0 +1,82 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 proxyquire = require( 'proxyquire' ); +var IS_BROWSER = require( '@stdlib/assert/is-browser' ); +var ssort = require( './../lib' ); + + +// VARIABLES // + +var opts = { + 'skip': IS_BROWSER +}; + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof ssort, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'attached to the main export is a method providing an ndarray interface', function test( t ) { + t.strictEqual( typeof ssort.ndarray, 'function', 'method is a function' ); + t.end(); +}); + +tape( 'if a native implementation is available, the main export is the native implementation', opts, function test( t ) { + var ssort = proxyquire( './../lib', { + '@stdlib/utils/try-require': tryRequire + }); + + t.strictEqual( ssort, mock, 'returns native implementation' ); + t.end(); + + function tryRequire() { + return mock; + } + + function mock() { + // Mock... + } +}); + +tape( 'if a native implementation is not available, the main export is a JavaScript implementation', opts, function test( t ) { + var ssort; + var main; + + main = require( './../lib/ssort.js' ); + + ssort = proxyquire( './../lib', { + '@stdlib/utils/try-require': tryRequire + }); + + t.strictEqual( ssort, main, 'returns JavaScript implementation' ); + t.end(); + + function tryRequire() { + return new Error( 'Cannot find module' ); + } +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.js new file mode 100644 index 000000000000..0409200add62 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.js @@ -0,0 +1,622 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 isnan = require( '@stdlib/math/base/assert/is-nan' ); +var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' ); +var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); +var randu = require( '@stdlib/random/base/randu' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var ascending = require( './fixtures/ascending.js' ); +var num2str = require( './fixtures/num2str.js' ); +var ssort = require( './../lib/ndarray.js' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof ssort, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 5', function test( t ) { + t.strictEqual( ssort.length, 5, 'has expected arity' ); + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order)', function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order)', function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (increasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (decreasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (increasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (decreasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order; special cases)', function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order; special cases)', function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function returns a reference to the input array', function test( t ) { + var out; + var x; + + x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); + out = ssort( x.length, 1.0, x, 1, 0 ); + + t.strictEqual( out, x, 'same reference' ); + t.end(); +}); + +tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `x` unchanged', function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + + ssort( 0, 1.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + ssort( -4, 1.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'if `order` equals `0`, the function returns `x` unchanged', function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + + ssort( x.length, 0.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports specifying a stride (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + -5.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 2 + ]); + + ssort( 3, 1.0, x, 2, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a stride (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + 6.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 2 + ]); + + ssort( 3, -1.0, x, 2, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + 6.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 0 + ]); + + ssort( 3, 1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + -5.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 0 + ]); + + ssort( 3, -1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying an offset (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + + ssort( 3, 1.0, x, 2, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying an offset (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + + ssort( 3, -1.0, x, 2, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports complex access patterns (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -4.0, // 2 + 3.0, + -2.0, // 1 + 5.0, + -6.0 // 0 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 0 + ]); + + ssort( 3, 1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports complex access patterns (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -2.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 0 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 0 + ]); + + ssort( 3, -1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.native.js new file mode 100644 index 000000000000..c5db38366442 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ndarray.native.js @@ -0,0 +1,631 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 resolve = require( 'path' ).resolve; +var tape = require( 'tape' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' ); +var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); +var randu = require( '@stdlib/random/base/randu' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var ascending = require( './fixtures/ascending.js' ); +var num2str = require( './fixtures/num2str.js' ); + + +// VARIABLES // + +var ssort = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) ); +var opts = { + 'skip': ( ssort instanceof Error ) +}; + + +// TESTS // + +tape( 'main export is a function', opts, function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof ssort, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 5', opts, function test( t ) { + t.strictEqual( ssort.length, 5, 'has expected arity' ); + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order)', opts, function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order)', opts, function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (increasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (decreasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (increasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (decreasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order; special cases)', opts, function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order; special cases)', opts, function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1, 0 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function returns a reference to the input array', opts, function test( t ) { + var out; + var x; + + x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); + out = ssort( x.length, 1.0, x, 1, 0 ); + + t.strictEqual( out, x, 'same reference' ); + t.end(); +}); + +tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `x` unchanged', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + + ssort( 0, 1.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + ssort( -4, 1.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'if `order` equals `0`, the function returns `x` unchanged', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + + ssort( x.length, 0.0, x, 1, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports specifying a stride (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + -5.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 2 + ]); + + ssort( 3, 1.0, x, 2, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a stride (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + 6.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 2 + ]); + + ssort( 3, -1.0, x, 2, 0 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + 6.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 0 + ]); + + ssort( 3, 1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + -5.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 0 + ]); + + ssort( 3, -1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying an offset (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + + ssort( 3, 1.0, x, 2, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying an offset (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + + ssort( 3, -1.0, x, 2, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports complex access patterns (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -4.0, // 2 + 3.0, + -2.0, // 1 + 5.0, + -6.0 // 0 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 0 + ]); + + ssort( 3, 1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports complex access patterns (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 1.0, + -2.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 0 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 2 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 0 + ]); + + ssort( 3, -1.0, x, -2, x.length-1 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.js new file mode 100644 index 000000000000..dc2b6649daf3 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.js @@ -0,0 +1,576 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 isnan = require( '@stdlib/math/base/assert/is-nan' ); +var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' ); +var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); +var randu = require( '@stdlib/random/base/randu' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var ascending = require( './fixtures/ascending.js' ); +var num2str = require( './fixtures/num2str.js' ); +var ssort = require( './../lib/ssort.js' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof ssort, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 4', function test( t ) { + t.strictEqual( ssort.length, 4, 'has expected arity' ); + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order)', function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order)', function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (increasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (decreasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (increasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (decreasing order)', function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order; special cases)', function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order; special cases)', function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function returns a reference to the input array', function test( t ) { + var out; + var x; + + x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); + out = ssort( x.length, 1.0, x, 1 ); + + t.strictEqual( out, x, 'same reference' ); + t.end(); +}); + +tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `x` unchanged', function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + + ssort( 0, 1.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + ssort( -4, 1.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'if `order` equals `0`, the function returns `x` unchanged', function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + + ssort( x.length, 0.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports specifying a stride (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + -5.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 2 + ]); + + ssort( 3, 1.0, x, 2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a stride (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + 6.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 2 + ]); + + ssort( 3, -1.0, x, 2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (increasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + 6.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 0 + ]); + + ssort( 3, 1.0, x, -2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (decreasing order)', function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + -5.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 0 + ]); + + ssort( 3, -1.0, x, -2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports view offsets (increasing order)', function test( t ) { + var expected; + var x0; + var x1; + + x0 = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + + x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); + + ssort( 3, 1.0, x1, 2 ); + t.deepEqual( x0, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports view offsets (decreasing order)', function test( t ) { + var expected; + var x0; + var x1; + + x0 = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + + x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); + + ssort( 3, -1.0, x1, 2 ); + t.deepEqual( x0, expected, 'returns expected value' ); + t.end(); +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.native.js new file mode 100644 index 000000000000..bc74814b7c23 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ssort/test/test.ssort.native.js @@ -0,0 +1,585 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2026 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 resolve = require( 'path' ).resolve; +var tape = require( 'tape' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' ); +var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' ); +var randu = require( '@stdlib/random/base/randu' ); +var Float32Array = require( '@stdlib/array/float32' ); +var scopy = require( '@stdlib/blas/base/scopy' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var ascending = require( './fixtures/ascending.js' ); +var num2str = require( './fixtures/num2str.js' ); + + +// VARIABLES // + +var ssort = tryRequire( resolve( __dirname, './../lib/ssort.native.js' ) ); +var opts = { + 'skip': ( ssort instanceof Error ) +}; + + +// TESTS // + +tape( 'main export is a function', opts, function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof ssort, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 4', opts, function test( t ) { + t.strictEqual( ssort.length, 4, 'has expected arity' ); + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order)', opts, function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order)', opts, function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + x[ i ] = (randu()*20.0) - 10.0; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (increasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes NaNs (decreasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.2 ) { + v = NaN; + } else { + v = (randu()*20.0) - 10.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (increasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array which includes positive and negative zeros (decreasing order)', opts, function test( t ) { + var expected; + var x; + var v; + var i; + var j; + + x = new Float32Array( 1e2 ); + for ( i = 0; i < x.length; i++ ) { + if ( randu() < 0.5 ) { + v = -0.0; + } else { + v = 0.0; + } + x[ i ] = v; + } + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (increasing order; special cases)', opts, function test( t ) { + var expected; + var x; + var i; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, 1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + if ( isnan( expected[ i ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } else if ( isNegativeZero( expected[ i ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[i] )+'.' ); + } else if ( isPositiveZero( expected[ i ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[i]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ i ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[i]+'.' ); + } + } + t.end(); +}); + +tape( 'the function sorts a strided array (decreasing order; special cases)', opts, function test( t ) { + var expected; + var x; + var i; + var j; + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0 ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + + x = new Float32Array( [ NaN, 1.0, -1.0, 2.0, 2.0, NaN ] ); + + // Note: we assume that the built-in sort returns a correctly sorted result + expected = scopy( x.length, x, 1, new Float32Array( x.length ), 1 ); + expected.sort( ascending ); + + ssort( x.length, -1.0, x, 1 ); + for ( i = 0; i < expected.length; i++ ) { + j = expected.length - i - 1; + if ( isnan( expected[ j ] ) ) { + t.strictEqual( isnan( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } else if ( isNegativeZero( expected[ j ] ) ) { + t.strictEqual( isNegativeZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+num2str( expected[j] )+'.' ); + } else if ( isPositiveZero( expected[ j ] ) ) { + t.strictEqual( isPositiveZero( x[ i ] ), true, 'returns expected value. index: '+i+'. actual: '+num2str( x[i] )+'. expected: '+expected[j]+'.' ); + } else { + t.strictEqual( x[ i ], expected[ j ], 'returns expected value. index: '+i+' actual: '+x[i]+'. expected: '+expected[j]+'.' ); + } + } + t.end(); +}); + +tape( 'the function returns a reference to the input array', opts, function test( t ) { + var out; + var x; + + x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); + out = ssort( x.length, 1.0, x, 1 ); + + t.strictEqual( out, x, 'same reference' ); + t.end(); +}); + +tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `x` unchanged', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0 ] ); + + ssort( 0, 1.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + ssort( -4, 1.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'if `order` equals `0`, the function returns `x` unchanged', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + expected = new Float32Array( [ 3.0, -4.0, 1.0, 15.0, 4.0, 3.0 ] ); + + ssort( x.length, 0.0, x, 1 ); + t.deepEqual( x, expected, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports specifying a stride (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + -5.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 2 + ]); + + ssort( 3, 1.0, x, 2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a stride (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 0 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 2 + ]); + expected = new Float32Array([ + 6.0, // 0 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 2 + ]); + + ssort( 3, -1.0, x, 2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (increasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + 6.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + -5.0 // 0 + ]); + + ssort( 3, 1.0, x, -2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports specifying a negative stride (decreasing order)', opts, function test( t ) { + var expected; + var x; + + x = new Float32Array([ + 2.0, // 2 + -3.0, + -5.0, // 1 + 7.0, + 6.0 // 0 + ]); + expected = new Float32Array([ + -5.0, // 2 + -3.0, + 2.0, // 1 + 7.0, + 6.0 // 0 + ]); + + ssort( 3, -1.0, x, -2 ); + t.deepEqual( x, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports view offsets (increasing order)', opts, function test( t ) { + var expected; + var x0; + var x1; + + x0 = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + + x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); + + ssort( 3, 1.0, x1, 2 ); + t.deepEqual( x0, expected, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports view offsets (decreasing order)', opts, function test( t ) { + var expected; + var x0; + var x1; + + x0 = new Float32Array([ + 1.0, + -6.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -2.0 // 2 + ]); + expected = new Float32Array([ + 1.0, + -2.0, // 0 + 3.0, + -4.0, // 1 + 5.0, + -6.0 // 2 + ]); + + x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); + + ssort( 3, -1.0, x1, 2 ); + t.deepEqual( x0, expected, 'returns expected value' ); + t.end(); +});