refactor: benchmark files as per project conventions

Author: gururaj1512

lib/node_modules/@stdlib/math/base/special/bernoullif/benchmark/benchmark.js

@@ -21,8 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
-var floorf = require( '@stdlib/math/base/special/floorf' );
+var randu = require( '@stdlib/random/array/discrete-uniform' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var pkg = require( './../package.json' ).name;
 var bernoullif = require( './../lib' );
@@ -35,10 +34,11 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, 0, 500 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = floorf( randu() * 500.0 );
-		y = bernoullif( x );
+		y = bernoullif( x[ i % x.length ] );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/bernoullif/benchmark/benchmark.native.js

@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
-var floorf = require( '@stdlib/math/base/special/floorf' );
+var randu = require( '@stdlib/random/array/discrete-uniform' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
@@ -44,10 +43,11 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
+	x = randu( 100, 0, 500 );
+
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		x = floorf( randu() * 500.0 );
-		y = bernoullif( x );
+		y = bernoullif( x[ i % x.length ] );
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/math/base/special/bernoullif/benchmark/c/native/benchmark.c

@@ -91,15 +91,18 @@ static float rand_float( void ) {
 */
 static double benchmark( void ) {
 	double elapsed;
+	float x[ 100 ];
 	double t;
-	float x;
 	float y;
 	int i;
 
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = ( 500.0 * rand_float() );
+	}
+
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		x = ( 500.0 * rand_float() );
-		y = stdlib_base_bernoullif( x );
+		y = stdlib_base_bernoullif( (int)( x[ i % 100 ] ) );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;