diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.js index bf4ad19793fe..2d88ff9269fc 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.native.js index 6e6fd7925e54..3fdce81cbf9d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js index 4137eeb69b34..e963787f3763 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js index f36830dab324..fb0cd33feefa 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.js index 2f1e0b4d45c2..83d138fc16c4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.native.js index 0da7da2d4522..c5e5c0ae7110 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.js index bd1ef0cae1e5..297242452d61 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js index dfc0c61f04f2..f41ecca2afac 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js index 75641ce7c92c..1af68f7420b6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js index 784c38a1b53a..42cbfd44ac2b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js index 49bf27ac4fd2..cc79993b8552 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js index 5835fe554bd8..aee2ec65f68e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.js index 213326120e1c..edd970cabf6f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.native.js index 91a48e34de4c..11380625e5fb 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js index f9b3ad62f63e..88fb7ceb9e21 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js index 4586d9244001..b7d7b533c191 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.js index e8c57d344446..1a6c66c2c331 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.native.js index 3e4c50a6e8cd..8bbc7dab0648 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js index 8ad13fed5557..068310a7b852 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js index 53cb5b5b594a..bf9c40f88f0f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.js index 3f5727ec67e9..eed0c5119bb6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.native.js index 11a842c3f84b..f3953a5fe74c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.js index 1fe7e70be567..9ba61b7cacb6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.native.js index 0d125509d757..a57aab2a73bb 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.rev_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.js index bfb1c69fed56..d794573a4d5b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.native.js index 0f72d20956b5..1a4a20c1c6bd 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.js index 96e12d04ab43..0c31fa99dfd8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js index dd8d8084e5f4..e4fb93ad3c0d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.js index 4a16a300c070..fb09ca49602d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.native.js index 6bf7732f0ec6..0decae737565 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.ndarray.js index c4ef5485935d..fa897340296c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.ndarray.native.js index 1a4a96a7219a..a40fa0787745 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.unsorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.js index 2cd97b974f2f..c913ff900635 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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 ssorthp = require( './../lib/ssorthp.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/ssorthp/benchmark/benchmark.unsorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.native.js index 436ec6c71220..d792f5c72e37 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.js index 209edd050cc0..21adefb17d33 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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 ssorthp = 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/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js index 42b481009d08..3e0bb48b98f1 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.unsorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.js index 2cbd1d18fa6f..e82dd110e20b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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 ssorthp = require( './../lib/ssorthp.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/ssorthp/benchmark/benchmark.unsorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.native.js index ed3a5a9e74e6..9298985ccaff 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/benchmark/benchmark.unsorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.ndarray.js index 2e75799aaf48..c84e45aa14ff 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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 ssorthp = 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/ssorthp/benchmark/benchmark.unsorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.ndarray.native.js index b27a80fcb60b..7dbda802e8ff 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/benchmark/benchmark.unsorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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/ssorthp/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ndarray.js index d55efd5b1d16..822a2402e0ac 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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( ssorthp.length, 5, 'has expected arity' ); + t.strictEqual( ssorthp.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 = ssorthp( 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/ssorthp/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ndarray.native.js index b4477fea73c2..61e04a709b08 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/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( ssorthp.length, 5, 'has expected arity' ); + t.strictEqual( ssorthp.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 = ssorthp( 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/ssorthp/test/test.ssorthp.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.js index d8f9d0db3f64..7399ae50e2fe 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.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( ssorthp.length, 4, 'has expected arity' ); + t.strictEqual( ssorthp.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 = ssorthp( 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/ssorthp/test/test.ssorthp.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.native.js index f276d5748f85..38477dca2ec9 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/test/test.ssorthp.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( ssorthp.length, 4, 'has expected arity' ); + t.strictEqual( ssorthp.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 = ssorthp( x.length, 1.0, x, 1 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.end(); });