diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.js index 4da597d733d7..84d14dbd9e84 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -50,25 +51,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.native.js index 0fb7a65ea828..7899f359bc85 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -59,25 +60,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js index ea7a37a06865..c62651dcb1c0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -50,25 +51,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js index be7490dbbf22..18a5615c3748 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -59,25 +60,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.js index e0c39e1e7a7a..a5c9ad8a2eb6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.native.js index 099939198a1c..307fec5bed4e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.js index 3d510e2ca142..3e8c65fbb5a7 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js index 4b1a19c7900a..544c1486f90f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js index 4e37ed7f8c68..9682ff363f1f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -50,25 +51,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js index 1fcd9652218a..17166acd18e6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -59,25 +60,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js index e95c48fe29a3..2acbd6ded50f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -50,25 +51,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js index fc6a0956a20d..82ac5d21752c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -59,25 +60,25 @@ 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 Float64Array( 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, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.js index aed2cfb57639..c49bd52413c3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.native.js index fe69c8c8189a..bc251e9f8d98 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js index db8411dda734..00cbe208dafe 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js index 266e340c0eec..b7b24029e857 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_mostly_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = -1.0 * randu() * j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.js index 586a2dde9962..ea53fbf95c2b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,27 +50,29 @@ 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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.native.js index 6e04a580e340..a64faa11fd74 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,27 +59,29 @@ 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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js index 4ab9d4995dc8..6937eae8281e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,27 +50,29 @@ 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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js index 17515244e1f0..38d49a4a6095 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,27 +59,29 @@ 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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( i % M === 0 ) { - v -= randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', function generateValue( i ) { + return generator( i ); + } ); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.js index 62e48e43cac6..d1d17ec80ccb 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.native.js index 6ad3e4f93f4e..ec543bcd749b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.js index da80929192d3..929523465ad0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -46,20 +47,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.native.js index d254417af334..558315ffefff 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.rev_sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -55,20 +56,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = iter - j - randu(); - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.js index 4425d3037a0b..c77ab2aa6a6c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,27 +50,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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.native.js index d4d5a3585f62..3f0e931ea5ce 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,27 +59,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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.js index c86bbe8845aa..956d9d5ab60c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -49,27 +50,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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js index 3c1ea8729572..cc1fef4ea2d5 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -58,27 +59,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 Float64Array( len ); - v = randi(); - for ( j = 0; j < len; j++ ) { - if ( j % M === 0 ) { - v += randi(); - } - tmp[ j ] = v; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.js index fd4dcb9a0ac6..b85b73a6cffd 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float64Array = require( '@stdlib/array/float64' ); @@ -45,20 +46,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.native.js index 505b91f695db..41e436987226 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float64Array = require( '@stdlib/array/float64' ); @@ -54,20 +55,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.ndarray.js index 771873224c18..3dfef068d83a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float64Array = require( '@stdlib/array/float64' ); @@ -45,20 +46,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.sorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.ndarray.native.js index 48cdc279fce7..acb0f3849508 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.sorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var Float64Array = require( '@stdlib/array/float64' ); @@ -54,20 +55,20 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randu() + j; - } + tmp = filledarrayBy(len, 'float64', generator); x.push( tmp ); } out = new Float64Array( len ); 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/dsort2hp/benchmark/benchmark.unsorted_few_uniques.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.js index 2ee80a6d79b6..71e8f33e2355 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -42,21 +43,14 @@ var dsort2hp = require( './../lib/dsort2hp.js' ); * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var out; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float64', discreteUniform( 1, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.native.js index b201be64495d..fda1c48f0e96 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -51,21 +52,14 @@ var opts = { * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var out; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float64', discreteUniform( 1, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.js index b18d3d6fa35f..10a04f5d9045 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -42,21 +43,14 @@ var dsort2hp = require( './../lib/ndarray.js' ); * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var out; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float64', discreteUniform( 1, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js index e740cd99c10c..bc366f5a28d2 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_few_uniques.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); @@ -51,21 +52,14 @@ var opts = { * @returns {Function} benchmark function */ function createBenchmark( iter, len ) { - var randi; var tmp; var out; var x; var i; - var j; - - randi = discreteUniform( 1, 10 ); x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = randi(); - } + tmp = filledarrayBy( len, 'float64', discreteUniform( 1, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.js index 525e836bc589..38ef9b5436d3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); var Float64Array = require( '@stdlib/array/float64' ); var dcopy = require( '@stdlib/blas/base/dcopy' ); +var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; var dsort2hp = require( './../lib/dsort2hp.js' ); @@ -46,14 +47,10 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float64', discreteUniform( -10, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.native.js index 68e4b90b276e..c410a6af4055 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.native.js @@ -22,13 +22,14 @@ 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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); var Float64Array = require( '@stdlib/array/float64' ); var dcopy = require( '@stdlib/blas/base/dcopy' ); var tryRequire = require( '@stdlib/utils/try-require' ); +var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; @@ -55,14 +56,10 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float64', discreteUniform( -10, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.js index 5fda083f09a9..ce96dca4c28f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); var Float64Array = require( '@stdlib/array/float64' ); var dcopy = require( '@stdlib/blas/base/dcopy' ); +var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; var dsort2hp = require( './../lib/ndarray.js' ); @@ -46,14 +47,10 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float64', discreteUniform( -10, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.native.js index 1b567203a2d1..347f6fa2c91e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/benchmark/benchmark.unsorted_random.ndarray.native.js @@ -22,13 +22,14 @@ 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 isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var floor = require( '@stdlib/math/base/special/floor' ); var Float64Array = require( '@stdlib/array/float64' ); var dcopy = require( '@stdlib/blas/base/dcopy' ); var tryRequire = require( '@stdlib/utils/try-require' ); +var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; var pkg = require( './../package.json' ).name; @@ -55,14 +56,10 @@ function createBenchmark( iter, len ) { var out; var x; var i; - var j; x = []; for ( i = 0; i < iter; i++ ) { - tmp = new Float64Array( len ); - for ( j = 0; j < len; j++ ) { - tmp[ j ] = (randu()*20.0) - 10.0; - } + tmp = filledarrayBy( len, 'float64', discreteUniform( -10, 10 ) ); x.push( tmp ); } out = new Float64Array( len ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.js index 0873873903cf..335a649ecba1 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.js @@ -41,7 +41,7 @@ tape( 'main export is a function', function test( t ) { }); tape( 'the function has an arity of 6', function test( t ) { - t.strictEqual( dsort2hp.length, 6, 'has expected arity' ); + t.strictEqual( dsort2hp.length, 6, 'returns expected value' ); t.end(); }); @@ -538,7 +538,7 @@ tape( 'the function returns a reference to the first input array', function test y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] ); out = dsort2hp( x.length, 1.0, x, 1, y, 1 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.notEqual( out, y, 'different reference' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.native.js index 4d0f94483764..bdb6257eb92a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.dsort2hp.native.js @@ -50,7 +50,7 @@ tape( 'main export is a function', opts, function test( t ) { }); tape( 'the function has an arity of 6', opts, function test( t ) { - t.strictEqual( dsort2hp.length, 6, 'has expected arity' ); + t.strictEqual( dsort2hp.length, 6, 'returns expected value' ); t.end(); }); @@ -547,7 +547,7 @@ tape( 'the function returns a reference to the first input array', opts, functio y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] ); out = dsort2hp( x.length, 1.0, x, 1, y, 1 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.notEqual( out, y, 'different reference' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.js index ee0ffd07fa37..1f2a71b15ea9 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.js @@ -41,7 +41,7 @@ tape( 'main export is a function', function test( t ) { }); tape( 'the function has an arity of 8', function test( t ) { - t.strictEqual( dsort2hp.length, 8, 'has expected arity' ); + t.strictEqual( dsort2hp.length, 8, 'returns expected value' ); t.end(); }); @@ -538,7 +538,7 @@ tape( 'the function returns a reference to the first input array', function test y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] ); out = dsort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.notEqual( out, y, 'different reference' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.native.js index 0628c6b6f097..043ae9540c45 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/test/test.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/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 8', opts, function test( t ) { - t.strictEqual( dsort2hp.length, 8, 'has expected arity' ); + t.strictEqual( dsort2hp.length, 8, 'returns expected value' ); t.end(); }); @@ -547,7 +547,7 @@ tape( 'the function returns a reference to the first input array', opts, functio y = new Float64Array( [ 0.0, 1.0, 2.0, 3.0, 4.0 ] ); out = dsort2hp( x.length, 1.0, x, 1, 0, y, 1, 0 ); - t.strictEqual( out, x, 'same reference' ); + t.strictEqual( out, x, 'returns expected value' ); t.notEqual( out, y, 'different reference' ); t.end(); });