Skip to content

bench: chore: address commit comments (commit 28b78a0) #5137

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

Merged
merged 1 commit into from
Feb 9, 2025
Merged

bench: chore: address commit comments (commit 28b78a0) #5137

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
38 changes: 19 additions & 19 deletions lib/node_modules/@stdlib/stats/base/dists/poisson/ctor/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -38,7 +38,7 @@ bench( pkg+'::instantiation', function benchmark( b ) {
var len;
var i;

len=100;
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 10.0 ));
Expand Down Expand Up @@ -90,7 +90,7 @@ bench( pkg+'::set:lambda', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
y = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
y[ i ] = uniform( EPS, 10.0 );
Expand Down Expand Up @@ -120,7 +120,7 @@ bench( pkg+':entropy', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( EPS, 10.0 );
Expand Down Expand Up @@ -151,7 +151,7 @@ bench( pkg+':kurtosis', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( EPS + 1.0, 11.0 );
Expand Down Expand Up @@ -182,7 +182,7 @@ bench( pkg+':mean', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( EPS, 10.0 );
Expand Down Expand Up @@ -213,7 +213,7 @@ bench( pkg+':median', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( EPS, 10.0 );
Expand Down Expand Up @@ -244,7 +244,7 @@ bench( pkg+':mode', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 1.0 + EPS, 11.0 );
Expand Down Expand Up @@ -275,7 +275,7 @@ bench( pkg+':skewness', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 1.0 + EPS, 11.0 );
Expand Down Expand Up @@ -306,7 +306,7 @@ bench( pkg+':stdev', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 1.0 + EPS, 11.0 );
Expand Down Expand Up @@ -337,7 +337,7 @@ bench( pkg+':variance', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 1.0 + EPS, 11.0 );
Expand Down Expand Up @@ -368,7 +368,7 @@ bench( pkg+':cdf', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 0.0, 60.0 );
Expand Down Expand Up @@ -398,14 +398,14 @@ bench( pkg+':logpmf', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= discreteUniform( 0.0, 6.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
y = dist.logpmf( x[ i % len] );
y = dist.logpmf( x[ i % len ] );
if ( isnan( y ) ) {
b.fail( 'should not return NaN' );
}
Expand All @@ -428,14 +428,14 @@ bench( pkg+':mgf', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 0.0, 1.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
y = dist.mgf( x[ i % len] );
y = dist.mgf( x[ i % len ] );
if ( isnan( y ) ) {
b.fail( 'should not return NaN' );
}
Expand All @@ -458,14 +458,14 @@ bench( pkg+':pmf', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= discreteUniform( 0.0, 8.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
y = dist.pmf( x[ i % len] );
y = dist.pmf( x[ i % len ] );
if ( isnan( y ) ) {
b.fail( 'should not return NaN' );
}
Expand All @@ -488,14 +488,14 @@ bench( pkg+':quantile', function benchmark( b ) {

lambda = 5.54;
dist = new Poisson( lambda );
len=100;
len = 100;
x = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
x[ i ]= uniform( 0.0, 1.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
y = dist.quantile( x[ i % len] );
y = dist.quantile( x[ i % len ] );
if ( isnan( y ) ) {
b.fail( 'should not return NaN' );
}
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/entropy/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 20.0 ));
lambda[ i ] = uniform( EPS, 20.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/kurtosis/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 20.0 ));
lambda[ i ] = uniform( EPS, 20.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/mode/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 20.0 ));
lambda[ i ] = uniform( EPS, 20.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/quantile/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,7 +76,7 @@ bench( pkg+':factory', function benchmark( b ) {
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
y = myquantile( p[ i % len] );
y = myquantile( p[ i % len ] );
if ( isnan( y ) ) {
b.fail( 'should not return NaN' );
}
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/skewness/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 20.0 ));
lambda[ i ] = uniform( EPS, 20.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/poisson/stdev/benchmark/benchmark.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@ bench( pkg, function benchmark( b ) {
len = 100;
lambda = new Float64Array( len );
for ( i = 0; i < len; i++ ) {
lambda[ i ] = ( uniform( EPS, 20.0 ));
lambda[ i ] = uniform( EPS, 20.0 );
}
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
Expand Down