From e308d1f9c9358ca5f9ac2f118a1e7483021ef7f9 Mon Sep 17 00:00:00 2001 From: JoyBoy <144602492+0PrashantYadav0@users.noreply.github.com> Date: Tue, 11 Feb 2025 00:12:00 +0530 Subject: [PATCH] chore: clean up unused code and improve code readability --- type: pre_commit_static_analysis_report description: Results of running static analysis checks when committing changes. report: - task: lint_filenames status: passed - task: lint_editorconfig status: passed - task: lint_markdown status: na - task: lint_package_json status: na - task: lint_repl_help status: na - task: lint_javascript_src status: na - task: lint_javascript_cli status: na - task: lint_javascript_examples status: na - task: lint_javascript_tests status: passed - task: lint_javascript_benchmarks status: passed - task: lint_python status: na - task: lint_r status: na - task: lint_c_src status: na - task: lint_c_examples status: na - task: lint_c_benchmarks status: na - task: lint_c_tests_fixtures status: na - task: lint_shell status: na - task: lint_typescript_declarations status: na - task: lint_typescript_tests status: na - task: lint_license_headers status: passed --- --- type: pre_push_report description: Results of running various checks prior to pushing changes. report: - task: run_javascript_examples status: na - task: run_c_examples status: na - task: run_cpp_examples status: na - task: run_javascript_readme_examples status: na - task: run_c_benchmarks status: na - task: run_cpp_benchmarks status: na - task: run_fortran_benchmarks status: na - task: run_javascript_benchmarks status: na - task: run_julia_benchmarks status: na - task: run_python_benchmarks status: na - task: run_r_benchmarks status: na - task: run_javascript_tests status: na --- --- .../benchmark.mostly_sorted_few_uniques.js | 15 ++++++------- ...chmark.mostly_sorted_few_uniques.native.js | 15 ++++++------- ...hmark.mostly_sorted_few_uniques.ndarray.js | 15 ++++++------- ...ostly_sorted_few_uniques.ndarray.native.js | 15 ++++++------- .../benchmark.mostly_sorted_random.js | 11 +++++----- .../benchmark.mostly_sorted_random.native.js | 11 +++++----- .../benchmark.mostly_sorted_random.ndarray.js | 11 +++++----- ...ark.mostly_sorted_random.ndarray.native.js | 11 +++++----- ...benchmark.rev_mostly_sorted_few_uniques.js | 15 ++++++------- ...rk.rev_mostly_sorted_few_uniques.native.js | 15 ++++++------- ...k.rev_mostly_sorted_few_uniques.ndarray.js | 15 ++++++------- ...ostly_sorted_few_uniques.ndarray.native.js | 15 ++++++------- .../benchmark.rev_mostly_sorted_random.js | 11 +++++----- ...nchmark.rev_mostly_sorted_random.native.js | 11 +++++----- ...chmark.rev_mostly_sorted_random.ndarray.js | 11 +++++----- ...rev_mostly_sorted_random.ndarray.native.js | 11 +++++----- .../benchmark.rev_sorted_few_uniques.js | 21 +++++++++++-------- ...benchmark.rev_sorted_few_uniques.native.js | 21 +++++++++++-------- ...enchmark.rev_sorted_few_uniques.ndarray.js | 21 +++++++++++-------- ...k.rev_sorted_few_uniques.ndarray.native.js | 21 +++++++++++-------- .../benchmark/benchmark.rev_sorted_random.js | 11 +++++----- .../benchmark.rev_sorted_random.native.js | 11 +++++----- .../benchmark.rev_sorted_random.ndarray.js | 11 +++++----- ...chmark.rev_sorted_random.ndarray.native.js | 11 +++++----- .../benchmark/benchmark.sorted_few_uniques.js | 19 +++++++++-------- .../benchmark.sorted_few_uniques.native.js | 19 +++++++++-------- .../benchmark.sorted_few_uniques.ndarray.js | 19 +++++++++-------- ...hmark.sorted_few_uniques.ndarray.native.js | 19 +++++++++-------- .../benchmark/benchmark.sorted_random.js | 11 +++++----- .../benchmark.sorted_random.native.js | 11 +++++----- .../benchmark.sorted_random.ndarray.js | 11 +++++----- .../benchmark.sorted_random.ndarray.native.js | 11 +++++----- .../benchmark.unsorted_few_uniques.js | 10 ++------- .../benchmark.unsorted_few_uniques.native.js | 10 ++------- .../benchmark.unsorted_few_uniques.ndarray.js | 10 ++------- ...ark.unsorted_few_uniques.ndarray.native.js | 10 ++------- .../benchmark/benchmark.unsorted_random.js | 9 +++----- .../benchmark.unsorted_random.native.js | 9 +++----- .../benchmark.unsorted_random.ndarray.js | 9 +++----- ...enchmark.unsorted_random.ndarray.native.js | 9 +++----- .../ext/base/ssortsh/test/test.ndarray.js | 4 ++-- .../base/ssortsh/test/test.ndarray.native.js | 4 ++-- .../ext/base/ssortsh/test/test.ssortsh.js | 4 ++-- .../base/ssortsh/test/test.ssortsh.native.js | 4 ++-- 44 files changed, 276 insertions(+), 272 deletions(-) diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.js index 081d566a7c9a..f1db5f06f8e3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,23 +50,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = 1.0; b = 10.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sa = (b-a) * (j/len); - sb = sa / 2.0; - tmp[ j ] = floor( uniform( a+sa, b+sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sa = (b-a) * (index/len); + sb = sa / 2.0; + return floor( uniform( a+sa, b+sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.native.js index a55128f31a11..ad9de11cbf99 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,23 +59,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = 1.0; b = 10.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sa = (b-a) * (j/len); - sb = sa / 2.0; - tmp[ j ] = floor( uniform( a+sa, b+sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sa = (b-a) * (index/len); + sb = sa / 2.0; + return floor( uniform( a+sa, b+sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js index 7f9fd94e084f..ac371b088852 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,23 +50,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = 1.0; b = 10.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sa = (b-a) * (j/len); - sb = sa / 2.0; - tmp[ j ] = floor( uniform( a+sa, b+sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sa = (b-a) * (index/len); + sb = sa / 2.0; + return floor( uniform( a+sa, b+sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js index 118f3cbeee7a..9c8e7fa5d821 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,23 +59,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = 1.0; b = 10.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sa = (b-a) * (j/len); - sb = sa / 2.0; - tmp[ j ] = floor( uniform( a+sa, b+sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sa = (b-a) * (index/len); + sb = sa / 2.0; + return floor( uniform( a+sa, b+sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.js index bb03605463bb..8ae0c3e59f0e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.native.js index cb414aca9866..c4b9f1843b08 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.js index 75216e4732e2..65cabe1f057d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.native.js index 5847b62a0e37..8c9905b08b2f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.mostly_sorted_random.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.js index d77931d8c491..9f2cffe27305 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,23 +50,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = -10.0; b = -1.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sb = (b-a) * (j/len); - sa = sb / 2.0; - tmp[ j ] = floor( uniform( a-sa, b-sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sb = (b-a) * (index/len); + sa = sb / 2.0; + return floor( uniform( a-sa, b-sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js index 831db0a85c52..1b3b5c05f675 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,23 +59,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = -10.0; b = -1.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sb = (b-a) * (j/len); - sa = sb / 2.0; - tmp[ j ] = floor( uniform( a-sa, b-sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sb = (b-a) * (index/len); + sa = sb / 2.0; + return floor( uniform( a-sa, b-sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js index 97082e85a43e..149770ba6a03 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,23 +50,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = -10.0; b = -1.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sb = (b-a) * (j/len); - sa = sb / 2.0; - tmp[ j ] = floor( uniform( a-sa, b-sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sb = (b-a) * (index/len); + sa = sb / 2.0; + return floor( uniform( a-sa, b-sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js index e8db0ebf4c90..db8c5853e31f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var uniform = require( '@stdlib/random/base/uniform' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,23 +59,23 @@ function createBenchmark( iter, len ) { var b; var x; var i; - var j; a = -10.0; b = -1.0; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - sb = (b-a) * (j/len); - sa = sb / 2.0; - tmp[ j ] = floor( uniform( a-sa, b-sb ) ); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + sb = (b-a) * (index/len); + sa = sb / 2.0; + return floor( uniform( a-sa, b-sb ) ); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.js index fe21da18559d..7b3aee0b66ff 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return -1.0 * randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.native.js index fcf0eea35471..e8871166b803 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return -1.0 * randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js index 9469a5120e7a..ca1ae3733040 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return -1.0 * randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js index 4a0a6ffcc3b8..5716f44c5d20 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return -1.0 * randu() * index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.js index 702a19a9d31f..09f6b3098d4e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -48,25 +49,27 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } return benchmark; + function generator( i ) { + v = randi(); + if ( i % M === 0 ) { + v -= randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.native.js index 11332a4a8873..96e6040a16e3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -57,25 +58,27 @@ function createBenchmark( iter, len ) { var v; var M; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } return benchmark; + function generator( i ) { + v = randi(); + if ( i % M === 0 ) { + v -= randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js index 1a34403f129d..656926b66f3c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -48,25 +49,27 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } return benchmark; + function generator( i ) { + v = randi(); + if ( i % M === 0 ) { + v -= randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js index e2469ff79f1d..92b21161a5d8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -57,25 +58,27 @@ function createBenchmark( iter, len ) { var v; var M; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } return benchmark; + function generator( i ) { + v = randi(); + if ( i % M === 0 ) { + v -= randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.js index b3d782b857a1..51f9344dc79c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return iter - index - randu(); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.native.js index b9945912e06c..2030f624455a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return iter - index - randu(); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.js index 1e2f769f6f11..8b3c56e88374 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -45,18 +46,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return iter - index - randu(); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.native.js index ed68baf40f1b..7bfa60bc8e75 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.rev_sorted_random.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -54,18 +55,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return iter - index - randu(); + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.js index 9fe355bb2059..36145361c2b7 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -48,25 +49,25 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + v = randi(); + if ( index % M === 0 ) { + v += randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.native.js index c3d66e67d700..20d52810350a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -57,25 +58,25 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + v = randi(); + if ( index % M === 0 ) { + v += randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.js index 51fd6797c083..21ca9566b735 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -48,25 +49,25 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + v = randi(); + if ( index % M === 0 ) { + v += randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.native.js index 6aabd25ce4a3..84e77ebb16ef 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_few_uniques.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -57,25 +58,25 @@ function createBenchmark( iter, len ) { var x; var v; var i; - var j; randi = discreteUniform( 1, 10 ); M = floor( len*0.333 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + v = randi(); + if ( index % M === 0 ) { + v += randi(); + } + return v; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.js index d6e996ef2b7d..39c0bd053b4b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float32Array = require( '@stdlib/array/float32' ); @@ -44,18 +45,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() + index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.native.js index 8930edaceaa8..992b353e2218 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float32Array = require( '@stdlib/array/float32' ); @@ -53,18 +54,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() + index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.js index 54a7600a4c8d..83911b4ee66d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float32Array = require( '@stdlib/array/float32' ); @@ -44,18 +45,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() + index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.native.js index 6f2df8b87b58..f40cdc66944a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.sorted_random.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float32Array = require( '@stdlib/array/float32' ); @@ -53,18 +54,18 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float32', generator); x.push( tmp ); } return benchmark; + function generator( index ) { + return randu() + index; + } + function benchmark( b ) { var xc; var y; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.js index 69f5a0417024..a63e42aafb10 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -42,20 +43,13 @@ var ssortsh = require( './../lib/ssortsh.js' ); * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float32', discreteUniform( 1, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.native.js index 1a3478fb3a6b..a9a6a4636702 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -51,20 +52,13 @@ var opts = { * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float32', discreteUniform( 1, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.js index 65e5a81dbaac..bdb0f3e15cf4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.js @@ -22,6 +22,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -42,20 +43,13 @@ var ssortsh = require( './../lib/ndarray.js' ); * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float32', discreteUniform( 1, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js index a122a4ffa9ab..b7ae3e66e4da 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js @@ -23,6 +23,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -51,20 +52,13 @@ var opts = { * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float32', discreteUniform( 1, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.js index db2177383d85..4c960fa429ad 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.js @@ -21,12 +21,13 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); 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 discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; var ssortsh = require( './../lib/ssortsh.js' ); @@ -45,14 +46,10 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float32', discreteUniform( -10, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.native.js index 9b33ec26a532..c9e4495c23f8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.native.js @@ -22,12 +22,13 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); 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 discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var tryRequire = require( '@stdlib/utils/try-require' ); var pkg = require( './../package.json' ).name; @@ -54,14 +55,10 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float32', discreteUniform( -10, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.js index 24313dc73e9b..711c7f5ecf9c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.js @@ -21,12 +21,13 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); 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 discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; var ssortsh = require( './../lib/ndarray.js' ); @@ -45,14 +46,10 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float32', discreteUniform( -10, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.native.js index eea95477a212..3b1dfb0d9b7c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/benchmark/benchmark.unsorted_random.ndarray.native.js @@ -22,12 +22,13 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); 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 discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var tryRequire = require( '@stdlib/utils/try-require' ); var pkg = require( './../package.json' ).name; @@ -54,14 +55,10 @@ function createBenchmark( iter, len ) { var tmp; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float32Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float32', discreteUniform( -10, 10 ) ); x.push( tmp ); } return benchmark; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.js index fb6908c9fe61..7be31986fad0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.js @@ -41,7 +41,7 @@ tape( 'main export is a function', function test( t ) { }); tape( 'the function has an arity of 5', function test( t ) { - t.strictEqual( ssortsh.length, 5, 'has expected arity' ); + t.strictEqual( ssortsh.length, 5, 'returns expected value' ); t.end(); }); @@ -388,7 +388,7 @@ tape( 'the function returns a reference to the input array', function test( t ) x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); out = ssortsh( x.length, 1.0, x, 1, 0 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.native.js index 7b90bb0f4ef6..9c9332ce0122 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ndarray.native.js @@ -50,7 +50,7 @@ tape( 'main export is a function', opts, function test( t ) { }); tape( 'the function has an arity of 5', opts, function test( t ) { - t.strictEqual( ssortsh.length, 5, 'has expected arity' ); + t.strictEqual( ssortsh.length, 5, 'returns expected value' ); t.end(); }); @@ -397,7 +397,7 @@ tape( 'the function returns a reference to the input array', opts, function test x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); out = ssortsh( x.length, 1.0, x, 1, 0 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.js index 6cf43a4628de..2a260f4921b8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.js @@ -41,7 +41,7 @@ tape( 'main export is a function', function test( t ) { }); tape( 'the function has an arity of 4', function test( t ) { - t.strictEqual( ssortsh.length, 4, 'has expected arity' ); + t.strictEqual( ssortsh.length, 4, 'returns expected value' ); t.end(); }); @@ -388,7 +388,7 @@ tape( 'the function returns a reference to the input array', function test( t ) x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); out = ssortsh( x.length, 1.0, x, 1 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.native.js index e4803de9f761..ecfc196c38b2 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/test/test.ssortsh.native.js @@ -50,7 +50,7 @@ tape( 'main export is a function', opts, function test( t ) { }); tape( 'the function has an arity of 4', opts, function test( t ) { - t.strictEqual( ssortsh.length, 4, 'has expected arity' ); + t.strictEqual( ssortsh.length, 4, 'returns expected value' ); t.end(); }); @@ -397,7 +397,7 @@ tape( 'the function returns a reference to the input array', opts, function test x = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] ); out = ssortsh( x.length, 1.0, x, 1 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.end(); });