style: resolve lint errors

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

Author: kgryte

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

@@ -21,8 +21,7 @@
 // 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 isArray = require( '@stdlib/assert/is-array' );
 var format = require( '@stdlib/string/format' );
 var pkg = require( './../package.json' ).name;
@@ -37,24 +36,19 @@ bench( pkg, function benchmark( b ) {
 	var len;
 	var o;
 	var i;
-	var j;
 
 	function predicate( v ) {
 		return v[ 0 ] === 'b';
 	}
 
 	vals = [ 'beep', 'boop', 'foo', 'bar', 'woot' ];
 
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
+	arr = discreteUniform( 100, 0, vals.length-1, {
+		'dtype': 'generic'
+	});
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ 0 ] = vals[ j ];
+		arr[ 0 ] = vals[ i%vals.length ];
 		o = bifurcateBy( arr, predicate );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
@@ -75,7 +69,6 @@ bench( format( '%s::values', pkg ), function benchmark( b ) {
 	var len;
 	var o;
 	var i;
-	var j;
 
 	function predicate( v ) {
 		return v[ 0 ] === 'b';
@@ -86,16 +79,12 @@ bench( format( '%s::values', pkg ), function benchmark( b ) {
 	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 ];
-	}
+	arr = discreteUniform( 100, 0, vals.length-1, {
+		'dtype': 'generic'
+	});
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ 0 ] = vals[ j ];
+		arr[ 0 ] = vals[ i%vals.length ];
 		o = bifurcateBy( arr, opts, predicate );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
@@ -116,7 +105,6 @@ bench( format( '%s::indices', pkg ), function benchmark( b ) {
 	var len;
 	var o;
 	var i;
-	var j;
 
 	function predicate( v ) {
 		return v[ 0 ] === 'b';
@@ -127,16 +115,12 @@ bench( format( '%s::indices', pkg ), function benchmark( b ) {
 	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 ];
-	}
+	arr = discreteUniform( 100, 0, vals.length-1, {
+		'dtype': 'generic'
+	});
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ 0 ] = vals[ j ];
+		arr[ 0 ] = vals[ i%vals.length ];
 		o = bifurcateBy( arr, opts, predicate );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
@@ -157,7 +141,6 @@ bench( format( '%s::pairs', pkg ), function benchmark( b ) {
 	var len;
 	var o;
 	var i;
-	var j;
 
 	function predicate( v ) {
 		return v[ 0 ] === 'b';
@@ -168,16 +151,12 @@ bench( format( '%s::pairs', pkg ), function benchmark( b ) {
 	opts = {
 		'returns': '*'
 	};
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
+	arr = discreteUniform( 100, 0, vals.length-1, {
+		'dtype': 'generic'
+	});
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ 0 ] = vals[ j ];
+		arr[ 0 ] = vals[ i%vals.length ];
 		o = bifurcateBy( arr, opts, predicate );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );
@@ -198,7 +177,6 @@ bench( format( '%s::this_context', pkg ), function benchmark( b ) {
 	var len;
 	var o;
 	var i;
-	var j;
 
 	function predicate( v ) {
 		return v[ 0 ] === 'b';
@@ -209,16 +187,12 @@ bench( format( '%s::this_context', pkg ), function benchmark( b ) {
 	opts = {
 		'thisArg': {}
 	};
-	arr = new Array( 100 );
-	len = arr.length;
-	for ( i = 0; i < len; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ i ] = vals[ j ];
-	}
+	arr = discreteUniform( 100, 0, vals.length-1, {
+		'dtype': 'generic'
+	});
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		j = floor( randu()*vals.length );
-		arr[ 0 ] = vals[ j ];
+		arr[ 0 ] = vals[ i%vals.length ];
 		o = bifurcateBy( arr, opts, predicate );
 		if ( typeof o !== 'object' ) {
 			b.fail( 'should return an array' );