chore: clean up

Author: Neerajpathak07

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

@@ -212,15 +212,20 @@ double stdlib_base_dists_bernoulli_quantile( const double r, 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 r;
     double y;
     int i;
 
-    for ( i = 0; i < 25; i++ ) {
-        r = ( (double)rand() / (double)RAND_MAX );
-        p = ( (double)rand() / (double)RAND_MAX );
+    for ( i = 0; i < 10; i++ ) {
+        r = random_uniform( 0.1, 10.0 );
+        p = random_uniform( 0.1, 10.0 );
         y = stdlib_base_dists_bernoulli_quantile( r, p );
         printf( "r: %lf , p: %lf , Q(r;p): %lf\n", r , p , y );
     }
@@ -251,4 +256,4 @@ int main( void ) {
 
 </section>
 
-<!-- /.links -->
+<!-- /.links -->    

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

@@ -93,17 +93,22 @@ static double random_uniform( const double min, const double max ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-    double r;
-	double p;
+    double r[ 100 ];
+	double p[ 100 ];
 	double y;
 	double t;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		r[ i ] = random_uniform( 0.1, 10.0 );
+	}
+	for ( i = 0; i < 100; i++ ) {
+		p[ i ] = random_uniform( 0.1, 10.0 );
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-        r = ( (double)rand() / (double)RAND_MAX ) ;
-		p = ( (double)rand() / (double)RAND_MAX ) ;
-		y = stdlib_base_dists_bernoulli_quantile( r, p );
+		y = stdlib_base_dists_bernoulli_quantile( r[ i%100 ], p[ i%100 ] );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;

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

@@ -20,15 +20,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 r;
 	double y;
 	int i;
 
 	for ( i = 0; i < 10; i++ ) {
-        r = ( (double)rand() / (double)RAND_MAX );
-		p = ( (double)rand() / (double)RAND_MAX );
+        r = random_uniform( 0.1, 10.0 );
+		p = random_uniform( 0.1, 10.0 );
 		y = stdlib_base_dists_bernoulli_quantile( r, p );
 		printf( "r: %lf , p: %lf , Q(r;p): %lf\n", r , p , y );
 	}

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

@@ -27,7 +27,7 @@ extern "C" {
 #endif
 
 /**
-* Evaluates the quantile function for a Bernoulli distribution with success probability `p` at a probability `r`.
+* Evaluates the quantile function for a Bernoulli distribution with success probability `p` at a value `r`.
 */
 double stdlib_base_dists_bernoulli_quantile( const double r, const double p );
 

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

@@ -45,6 +45,10 @@ var addon = require( './../src/addon.node' );
 * // returns 0
 *
 * @example
+* var y = quantile( NaN, 1.0 );
+* // returns 1
+*
+* @example
 * var y = quantile( -0.2, 0.1 );
 * // returns NaN
 *