chore: minor clean up

Author: Neerajpathak07

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/README.md

@@ -161,30 +161,11 @@ for ( i = 0; i < 10; i++ ) {
 
 #### stdlib_base_dists_bernoulli_pmf( x, p )
 
-Evaluates the probability mass function (PMF) for an bernoulli distribution.
+Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 
 ```c
 double y = stdlib_base_dists_bernoulli_pmf( 0.5, 0.5 );
 // returns ~0.5
-
-y = stdlib_base_dists_bernoulli_pmf( 2.0, 0.1 );
-// returns ~1.0
-
-y = stdlib_base_dists_bernoulli_pmf( -1.0, 0.3 );
-// returns ~0.0
-
-y = stdlib_base_dists_bernoulli_pmf( NaN, 0.5 );
-// returns NaN
-
-y = stdlib_base_dists_bernoulli_pmf( 0.0, NaN );
-// returns NaN
-
-y = stdlib_base_dists_bernoulli_pmf( 0.0, NaN );
-// returns NaN
-
-// Invalid probability
-y = stdlib_base_dists_bernoulli_pmf( 0.5, 1.4 );
-// returns NaN
 ```
 
 The function accepts the following arguments:
@@ -220,17 +201,22 @@ double stdlib_base_dists_bernoulli_pmf( const double x, const double p );
 #include <stdlib.h>
 #include <stdio.h>
 
+static double random_uniform( const double min, const double max ) {
+    double v = (double)rand() / ( (double)RAND_MAX + 1.0 );
+    return min + ( v*(max-min) );
+}
+
 int main( void ) {
     double p;
     double x;
     double y;
     int i;
 
-    for ( i = 0; i < 25; i++ ) {
-        x = stdlib_base_round( (double)rand() / (double)RAND_MAX ) * 2.0;
-        p = ( (double)rand() / (double)RAND_MAX ) ;
+    for ( i = 0; i < 10; i++ ) {
+        x = stdlib_base_round( random_uniform( 0.0, 2.0 ) );
+        p = random_uniform( 0.0, 1.0 );
         y = stdlib_base_dists_bernoulli_pmf( x, p );
-        printf( "x: %lf , p: %1f, P( X = x; p ): %lf\n", x, p , y );
+        printf( "x: %lf , p: %1f, P( X = x; p ): %lf\n", x, p, y );
     }
 }
 ```

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/benchmark/benchmark.js

@@ -22,6 +22,8 @@
 
 var bench = require( '@stdlib/bench' );
 var randu = require( '@stdlib/random/base/randu' );
+var uniform = require( '@stdlib/random/base/uniform' );
+var Float64Array = require( '@stdlib/array/float64' );
 var round = require( '@stdlib/math/base/special/round' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pkg = require( './../package.json' ).name;
@@ -31,16 +33,25 @@ var pmf = require( './../lib' );
 // MAIN //
 
 bench( pkg, function benchmark( b ) {
+	var len;
 	var p;
 	var x;
 	var y;
 	var i;
 
+	len = 100;
+	x = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		x[ i ] = round( uniform( 0.0, 3.0 ) );
+	}
+	p = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		p[ i ] = uniform( 0.0, 1.0 );
+	}
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = round( randu()*3.0 );
-		p = randu();
-		y = pmf( x, p );
+		y = pmf( x[ i%100 ], p[ i%100 ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/benchmark/benchmark.native.js

@@ -22,7 +22,8 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
+var uniform = require( '@stdlib/random/base/uniform' );
+var Float64Array = require( '@stdlib/array/float64' );
 var round = require( '@stdlib/math/base/special/round' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var tryRequire = require( '@stdlib/utils/try-require' );
@@ -40,42 +41,25 @@ var opts = {
 // MAIN //
 
 bench( pkg+'::native', opts, function benchmark( b ) {
+	var len;
 	var p;
 	var x;
 	var y;
 	var i;
 
-	b.tic();
-	for ( i = 0; i < b.iterations; i++ ) {
-		x = round( randu()*3.0 );
-		p = randu();
-		y = pmf( x, p );
-		if ( isnan( y ) ) {
-			b.fail( 'should not return NaN' );
-		}
+	len = 100;
+	x = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		x[ i ] = round( uniform( 0.0, 3.0 ) );
 	}
-	b.toc();
-	if ( isnan( y ) ) {
-		b.fail( 'should not return NaN' );
+	p = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		p[ i ] = uniform( 0.0, 1.0 );
 	}
-	b.pass( 'benchmark finished' );
-	b.end();
-});
-
-bench( pkg+':factory', opts, function benchmark( b ) {
-	var mypmf;
-	var p;
-	var x;
-	var y;
-	var i;
-
-	p = 0.3;
-	mypmf = pmf.factory( p );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = randu() * 3.0;
-		y = mypmf( x );
+		y = pmf( x[ i%100 ], p[ i%100 ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/benchmark/c/benchmark.c

@@ -76,13 +76,15 @@ static double tic( void ) {
 }
 
 /**
-* Generates a random number on the interval [0,1).
+* Generates a random number on the interval [min,max).
 *
-* @return random number
+* @param min    minimum value (inclusive)
+* @param max    maximum value (exclusive)
+* @return       random number
 */
-static double rand_double( void ) {
-	int r = rand();
-	return (double)r / ( (double)RAND_MAX + 1.0 );
+static double random_uniform( const double min, const double max ) {
+	double v = (double)rand() / ( (double)RAND_MAX + 1.0 );
+	return min + ( v*(max-min) );
 }
 
 /**
@@ -92,17 +94,22 @@ static double rand_double( void ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-	double p;
-    double x;
+	double p[ 100 ];
+	double x[ 100 ];
 	double y;
 	double t;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		p[ i ] = stdlib_base_round( random_uniform( 0.0, 3.0 ) );
+	}
+	for ( i = 0; i < 100; i++ ) {
+		p[ i ] = random_uniform( 0.0, 1.0 );
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-        x = stdlib_base_round( (double)rand() / (double)RAND_MAX )*3.0;
-		p = ( (double)rand() / (double)RAND_MAX ) ;
-		y = stdlib_base_dists_bernoulli_pmf( x, p );
+		y = stdlib_base_dists_bernoulli_pmf( x[ i%100 ], p[ i%100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;
@@ -133,4 +140,4 @@ int main( void ) {
 		printf( "ok %d benchmark finished\n", i+1 );
 	}
 	print_summary( REPEATS, REPEATS );
-}
+}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/docs/repl.txt

@@ -1,7 +1,7 @@
 
 {{alias}}( x, p )
     Evaluates the probability mass function (PMF) for a Bernoulli distribution
-    with success probability `p` at a value `x`.
+    with success probability `0 <= p <= 1`.
 
     If provided `NaN` as any argument, the function returns `NaN`.
 

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/docs/types/index.d.ts

@@ -31,7 +31,7 @@ type Unary = ( x: number ) => number;
 */
 interface PMF {
 	/**
-	* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `p` at a value `x`.
+	* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 	*
 	* ## Notes
 	*

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/examples/c/example.c

@@ -21,15 +21,20 @@
 #include <stdlib.h>
 #include <stdio.h>
 
+static double random_uniform( const double min, const double max ) {
+	double v = (double)rand() / ( (double)RAND_MAX + 1.0 );
+	return min + ( v*(max-min) );
+}
+
 int main( void ) {
 	double p;
-    double x;
+	double x;
 	double y;
 	int i;
 
 	for ( i = 0; i < 10; i++ ) {
-        x = stdlib_base_round( (double)rand() / (double)RAND_MAX )* 2.0 ;
-		p = ( (double)rand() / (double)RAND_MAX ) ;
+		x = stdlib_base_round( random_uniform( 0.0, 2.0 ) );
+		p = random_uniform( 0.0, 1.0 );
 		y = stdlib_base_dists_bernoulli_pmf( x, p );
 		printf( "x: %lf , p: %1f, P( X = x; p ): %lf\n", x, p, y );
 	}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/include/stdlib/stats/base/dists/bernoulli/pmf.h

@@ -27,12 +27,12 @@ extern "C" {
 #endif
 
 /**
-Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `p` at a value `x`.
+Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 */
 double stdlib_base_dists_bernoulli_pmf( const double x, const double p );
 
 #ifdef __cplusplus
 }
 #endif
 
-#endif // !STDLIB_STATS_BASE_DISTS_BERNOULLI_PMF_H
+#endif // !STDLIB_STATS_BASE_DISTS_BERNOULLI_PMF_H

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/lib/main.js

@@ -26,7 +26,7 @@ var isnan = require( '@stdlib/math/base/assert/is-nan' );
 // MAIN //
 
 /**
-* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `p` at a value `x`.
+* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 *
 * @param {number} x - input value
 * @param {Probability} p - success probability

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/lib/native.js

@@ -26,7 +26,7 @@ var addon = require( './../src/addon.node' );
 // MAIN //
 
 /**
-* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `p` at a value `x`.
+* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 *
 * @param {number} x - input value
 * @param {Probability} p - success probability

lib/node_modules/@stdlib/stats/base/dists/bernoulli/pmf/src/main.c

@@ -20,7 +20,7 @@
 #include "stdlib/math/base/assert/is_nan.h"
 
 /**
-* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `p` at a value `x`.
+* Evaluates the probability mass function (PMF) for a Bernoulli distribution with success probability `0 <= p <= 1`.
 *
 * @param x    input value
 * @param p    success probability