style: resolve lint errors

Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

lib/node_modules/@stdlib/utils/bifurcate/benchmark/benchmark.js

@@ -21,8 +21,8 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
-var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var bernoulli = require( '@stdlib/random/array/bernoulli' );
 var isArray = require( '@stdlib/assert/is-array' );
 var format = require( '@stdlib/string/format' );
 var pkg = require( './../package.json' ).name;
@@ -35,27 +35,21 @@ bench( pkg, function benchmark( b ) {
 	var filter;
 	var vals;
 	var arr;
-	var len;
 	var o;
 	var i;
-	var j;
 
 	vals = [ 'a', 'b', 'c', 'd', 'e' ];
 
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
-	filter = new Array( len );
+	arr = discreteUniform( 100, 0, vals.length-1 );
+	filter = [
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 )
+	];
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		for ( j = 0; j < len; j++ ) {
-			filter[ j ] = ( randu() < 0.5 );
-		}
-		o = bifurcate( arr, filter );
+		o = bifurcate( arr, filter[ i%filter.length ] );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
 		}
@@ -73,30 +67,24 @@ bench( format( '%s::values', pkg ), function benchmark( b ) {
 	var opts;
 	var vals;
 	var arr;
-	var len;
 	var o;
 	var i;
-	var j;
 
 	vals = [ 'a', 'b', 'c', 'd', 'e' ];
 
 	opts = {
 		'returns': 'values'
 	};
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
-	filter = new Array( len );
+	arr = discreteUniform( 100, 0, vals.length-1 );
+	filter = [
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 )
+	];
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		for ( j = 0; j < len; j++ ) {
-			filter[ j ] = ( randu() < 0.5 );
-		}
-		o = bifurcate( arr, opts, filter );
+		o = bifurcate( arr, opts, filter[ i%filter.length ] );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
 		}
@@ -114,30 +102,24 @@ bench( format( '%s::indices', pkg ), function benchmark( b ) {
 	var opts;
 	var vals;
 	var arr;
-	var len;
 	var o;
 	var i;
-	var j;
 
 	vals = [ 'a', 'b', 'c', 'd', 'e' ];
 
 	opts = {
 		'returns': 'indices'
 	};
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
-	filter = new Array( len );
+	arr = discreteUniform( 100, 0, vals.length-1 );
+	filter = [
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 )
+	];
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		for ( j = 0; j < len; j++ ) {
-			filter[ j ] = ( randu() < 0.5 );
-		}
-		o = bifurcate( arr, opts, filter );
+		o = bifurcate( arr, opts, filter[ i%filter.length ] );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
 		}
@@ -155,30 +137,24 @@ bench( format( '%s::pairs', pkg ), function benchmark( b ) {
 	var opts;
 	var vals;
 	var arr;
-	var len;
 	var o;
 	var i;
-	var j;
 
 	vals = [ 'a', 'b', 'c', 'd', 'e' ];
 
 	opts = {
 		'returns': '*'
 	};
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
-	filter = new Array( len );
+	arr = discreteUniform( 100, 0, vals.length-1 );
+	filter = [
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 ),
+		bernoulli( 100, 0.5 )
+	];
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		for ( j = 0; j < len; j++ ) {
-			filter[ j ] = ( randu() < 0.5 );
-		}
-		o = bifurcate( arr, opts, filter );
+		o = bifurcate( arr, opts, filter[ i%filter.length ] );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
 		}