Skip to content

refactor: update blas/ext/base/ssortins to follow project conventions #5215

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: develop
Choose a base branch
from
Open

refactor: update blas/ext/base/ssortins to follow project conventions #5215

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 8 additions & 7 deletions ...e_modules/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_few_uniques.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -50,23 +51,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;
Expand Down
15 changes: 8 additions & 7 deletions ...es/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_few_uniques.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -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;
Expand Down
15 changes: 8 additions & 7 deletions ...s/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -50,23 +51,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;
Expand Down
15 changes: 8 additions & 7 deletions ...ib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_few_uniques.ndarray.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -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;
Expand Down
11 changes: 6 additions & 5 deletions lib/node_modules/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_random.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand All @@ -46,18 +47,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;
Expand Down
11 changes: 6 additions & 5 deletions ...modules/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_random.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -55,18 +56,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;
Expand Down
11 changes: 6 additions & 5 deletions ...odules/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_random.ndarray.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand All @@ -46,18 +47,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;
Expand Down
11 changes: 6 additions & 5 deletions ...@stdlib/blas/ext/base/ssortins/benchmark/benchmark.mostly_sorted_random.ndarray.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -55,18 +56,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;
Expand Down
15 changes: 8 additions & 7 deletions ...dules/@stdlib/blas/ext/base/ssortins/benchmark/benchmark.rev_mostly_sorted_few_uniques.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -50,23 +51,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;
Expand Down
15 changes: 8 additions & 7 deletions ...stdlib/blas/ext/base/ssortins/benchmark/benchmark.rev_mostly_sorted_few_uniques.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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' );
Expand Down Expand Up @@ -59,23 +60,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;
Expand Down
Loading