bench: refactor random number generation in stats/base/dists/negative-binomial

Author: gkbishnoi07

lib/node_modules/@stdlib/stats/base/dists/negative-binomial/cdf/benchmark/benchmark.js

@@ -47,7 +47,7 @@ bench( pkg, function benchmark( b ) {
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = uniform( 0.0, 100.0 );
 		r[ i ] = discreteUniform( 1, 100 );
-		p[ i ] = uniform( EPS, 1.0);
+		p[ i ] = uniform( EPS, 1.0 );
 	}
 
 	b.tic();
@@ -96,4 +96,4 @@ bench( pkg+':factory', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
-});
+});

lib/node_modules/@stdlib/stats/base/dists/negative-binomial/ctor/benchmark/benchmark.js

@@ -193,7 +193,7 @@ bench( pkg+':kurtosis', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
@@ -227,7 +227,7 @@ bench( pkg+':mean', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
@@ -261,7 +261,7 @@ bench( pkg+':mode', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
@@ -295,12 +295,12 @@ bench( pkg+':skewness', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		dist.r = x[i % len];
+		dist.r = x[ i % len ];
 		y = dist.skewness;
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
@@ -329,12 +329,12 @@ bench( pkg+':stdev', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		dist.r = x[i % len];
+		dist.r = x[ i % len ];
 		y = dist.stdev;
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
@@ -363,12 +363,12 @@ bench( pkg+':variance', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 1.0, 100.0 );
+		x[ i ] = discreteUniform( 1, 100 );
 	}
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		dist.r = x[ i % len];
+		dist.r = x[ i % len ];
 		y = dist.variance;
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
@@ -402,7 +402,7 @@ bench( pkg+':cdf', function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		y = dist.cdf( x[i % len] );
+		y = dist.cdf( x[ i % len ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}
@@ -430,12 +430,12 @@ bench( pkg+':logpmf', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 0.0, r );
+		x[ i ] = discreteUniform( 0, r );
 	}
 
 	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' );
 		}
@@ -463,12 +463,12 @@ bench( pkg+':pmf', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = discreteUniform( 0.0, r );
+		x[ i ] = discreteUniform( 0, r );
 	}
 
 	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' );
 		}
@@ -501,7 +501,7 @@ bench( pkg+':quantile', function benchmark( b ) {
 
 	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' );
 		}

lib/node_modules/@stdlib/stats/base/dists/negative-binomial/logpmf/benchmark/benchmark.js

@@ -80,7 +80,7 @@ bench( pkg+':factory', function benchmark( b ) {
 	len = 100;
 	x = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		x[ i ] = uniform( 0, 80 );
+		x[ i ] = uniform( 0.0, 80.0 );
 	}
 
 	b.tic();
@@ -96,4 +96,4 @@ bench( pkg+':factory', function benchmark( b ) {
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
-});
+});

lib/node_modules/@stdlib/stats/base/dists/negative-binomial/mgf/benchmark/benchmark.js

@@ -48,9 +48,6 @@ bench( pkg, function benchmark( b ) {
 
 	for ( i = 0; i < len; i++ ) {
 		p[ i ] = uniform( EPS, 1.0 );
-	}
-
-	for ( i = 0; i < len; i++ ) {
 		t[ i ] = uniform( 0.0, 1.0 ) * -ln( p[i] );
 		r[ i ] = discreteUniform( 1, 100 );
 	}
@@ -85,7 +82,7 @@ bench( pkg+':factory', function benchmark( b ) {
 	len = 100;
 	t = new Float64Array( len );
 	for ( i = 0; i < len; i++ ) {
-		t[i] = uniform(0.0, 1.0) * -ln(p);
+		t[ i ] = uniform( 0.0, -ln( p ) );
 	}
 
 	b.tic();

lib/node_modules/@stdlib/stats/base/dists/negative-binomial/pmf/benchmark/benchmark.js

@@ -52,7 +52,7 @@ bench( pkg, function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		y = pmf( x[i % len], r[i % len], p[i % len] );
+		y = pmf( x[ i % len ], r[ i % len ], p[ i % len ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}