chore: clean up

Author: Neerajpathak07

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

@@ -168,27 +168,11 @@ for ( i = 0; i < 10; i++ ) {
 
 #### stdlib_base_dists_bernoulli_mgf( t, p )
 
-Evaluates the moment-generating function (MGF) for a Bernoulli distribution.
+Evaluates the moment-generating function (MGF) for a Bernoulli distribution with success probability `p`.
 
 ```c
 double y = stdlib_base_dists_bernoulli_mgf( 0.2, 0.5 );
 // returns ~1.111
-
-y = stdlib_base_dists_bernoulli_mgf( 0.4, 0.5 );
-// returns ~1.0
-
-y = stdlib_base_dists_bernoulli_mgf( NaN, 0.0 );
-// returns NaN
-
-y = stdlib_base_dists_bernoulli_mgf( 0.0, NaN );
-// returns NaN
-
-y = stdlib_base_dists_bernoulli_mgf( -2.0, -1.0 );
-// returns NaN
-
-// Invalid probability
-y = stdlib_base_dists_bernoulli_mgf( 0.2, 2.0 );
-// returns NaN
 ```
 
 The function accepts the following arguments:
@@ -219,19 +203,24 @@ double stdlib_base_dists_bernoulli_mgf( const double t, const double p );
 ### Examples
 
 ```c
-#include "stdlib/stats/base/dists/bernoulli/cdf.h"
+#include "stdlib/stats/base/dists/bernoulli/mgf.h"
 #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 t;
     double y;
     int i;
 
     for ( i = 0; i < 10; i++ ) {
-        t = ( ( (double)rand() / (double)RAND_MAX ) * 4.0 ) - 2.0;
-        p = ( (double)rand() / (double)RAND_MAX ) ;
+        t = random_uniform( 2.0, 4.0 );
+        p = random_uniform( 0.0, 1.0 );
         y = stdlib_base_dists_bernoulli_mgf( t, p );
         printf( "t: %lf , p: %1f, M_X(t;p): %lf\n", t, p , y );
     }

lib/node_modules/@stdlib/stats/base/dists/bernoulli/mgf/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 isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pkg = require( './../package.json' ).name;
 var mgf = require( './../lib' );
@@ -30,16 +32,25 @@ var mgf = require( './../lib' );
 // MAIN //
 
 bench( pkg, function benchmark( b ) {
+	var len;
 	var p;
 	var t;
 	var y;
 	var i;
 
+	len = 100;
+	p = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		p[ i ] = uniform( 0.0, 1.0 );
+	}
+	t = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		t[ i ] = uniform( 0.0, 3.0 );
+	}
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		p = randu();
-		t = randu() * 3.0;
-		y = mgf( t, p );
+		y = mgf( t[ i%100 ], p[ i%100 ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/mgf/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 isnan = require( '@stdlib/math/base/assert/is-nan' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
@@ -39,42 +40,25 @@ var opts = {
 // MAIN //
 
 bench( pkg+'::native', opts, function benchmark( b ) {
+	var len;
 	var p;
 	var t;
 	var y;
 	var i;
 
-	b.tic();
-	for ( i = 0; i < b.iterations; i++ ) {
-		p = randu();
-		t = randu() * 3.0;
-		y = mgf( t, p );
-		if ( isnan( y ) ) {
-			b.fail( 'should not return NaN' );
-		}
+	len = 100;
+	p = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		p[ i ] = uniform( 0.0, 1.0 );
 	}
-	b.toc();
-	if ( isnan( y ) ) {
-		b.fail( 'should not return NaN' );
+	p = new Float64Array( len );
+	for ( i = 0; i < len; i++ ) {
+		t[ i ] = uniform( 0.0, 3.0 );
 	}
-	b.pass( 'benchmark finished' );
-	b.end();
-});
-
-bench( pkg+':factory', opts, function benchmark( b ) {
-	var mymgf;
-	var p;
-	var t;
-	var y;
-	var i;
-
-	p = 0.3;
-	mymgf = mgf.factory( p );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		t = randu() * 3.0;
-		y = mymgf( t );
+		y = mgf( t[ i%100 ], p[ i%100 ] );
 		if ( isnan( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/mgf/benchmark/c/Makefile

@@ -143,4 +143,4 @@ run: $(c_targets)
 clean:
 	$(QUIET) -rm -f *.o *.out
 
-.PHONY: clean
+.PHONY: clean

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

@@ -75,13 +75,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) );
 }
 
 /**
@@ -91,17 +93,22 @@ static double rand_double( void ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-	double p;
+	double p[ 100 ];
 	double y;
-    double t;
-    double x;
+	double t[ 100 ];
+	double x;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		p[ i ] = random_uniform( 0.0, 1.0 );
+	}
+	for ( i = 0; i < 100; i++ ) {
+		t[ i ] = random_uniform( 0.0, 3.0 );
+	}
+
 	x = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		p = ( (double)rand() / (double)RAND_MAX );
-        t = ( (double)rand() / (double)RAND_MAX )*3.0;
-		y = stdlib_base_dists_bernoulli_mgf( t, p );
+		y = stdlib_base_dists_bernoulli_mgf( t[ i%100 ], p[ i%100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;

lib/node_modules/@stdlib/stats/base/dists/bernoulli/mgf/binding.gyp

@@ -167,4 +167,4 @@
       ], # end actions
     }, # end target copy_addon
   ], # end targets
-}
+}

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

@@ -20,16 +20,21 @@
 #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 t;
+	double t;
 	double y;
 	int i;
 
 	for ( i = 0; i < 10; i++ ) {
-        t = ( ( (double)rand() / (double)RAND_MAX ) * 4.0 ) - 2.0;
-		p = ( (double)rand() / (double)RAND_MAX ) ;
+		t = random_uniform( 2.0, 4.0 );
+		p = random_uniform( 0.0, 1.0 );
 		y = stdlib_base_dists_bernoulli_mgf( t, p );
 		printf( "t: %lf , p: %1f, M_X(t;p): %lf\n", t, p , y );
 	}
-}
+}

lib/node_modules/@stdlib/stats/base/dists/bernoulli/mgf/include.gypi

@@ -50,4 +50,4 @@
       '<!@(node -e "var arr = require(\'@stdlib/utils/library-manifest\')(\'./manifest.json\',{},{\'basedir\':process.cwd(),\'paths\':\'posix\'}).libpath; for ( var i = 0; i < arr.length; i++ ) { console.log( arr[ i ] ); }")',
     ],
   }, # end variables
-}
+}

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

@@ -27,12 +27,12 @@ extern "C" {
 #endif
 
 /**
-Evaluates the  moment-generating function (MGF) for a Bernoulli distribution with success probability `p` at a value `t`.
+c
 */
 double stdlib_base_dists_bernoulli_mgf( const double t, const double p );
 
 #ifdef __cplusplus
 }
 #endif
 
-#endif // !STDLIB_STATS_BASE_DISTS_BERNOULLI_MGF_H
+#endif // !STDLIB_STATS_BASE_DISTS_BERNOULLI_MGF_H

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

@@ -28,7 +28,7 @@ var exp = require( '@stdlib/math/base/special/exp' );
 // MAIN //
 
 /**
-* Evaluates the moment-generating function (MGF) for a Bernoulli distribution with success probability `p` at a value `t`.
+* Evaluates the moment-generating function (MGF) for a Bernoulli distribution with success probability `p`.
 *
 * @param {number} t - input value
 * @param {Probability} p - success probability