fix: updates uniform to discrete-uniform

Author: hrshya

lib/node_modules/@stdlib/math/base/special/fibonacci-index/benchmark/benchmark.js

@@ -21,8 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/array/uniform' );
-var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var zeros = require( '@stdlib/array/base/zeros' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var fibonacci = require( '@stdlib/math/base/special/fibonacci' );
@@ -43,7 +42,7 @@ bench( pkg, function benchmark( b ) {
 		FN[ i ] = fibonacci( i );
 	}
 
-	x = floor( uniform( 100, 3.0, 78.0 ) );
+	x = discreteUniform( 100, 3, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

lib/node_modules/@stdlib/math/base/special/fibonacci-index/benchmark/benchmark.native.js

@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/array/uniform' );
-var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var zeros = require( '@stdlib/array/base/zeros' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var fibonacci = require( '@stdlib/math/base/special/fibonacci' );
@@ -52,7 +51,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 		FN[ i ] = fibonacci( i );
 	}
 
-	x = floor( uniform( 100, 3.0, 78.0 ) );
+	x = discreteUniform( 100, 3, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

lib/node_modules/@stdlib/math/base/special/fibonacci-index/test/test.js

@@ -37,7 +37,7 @@ tape( 'main export is a function', function test( t ) {
 
 tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
 	var n = fibonacciIndex( NaN );
-	t.strictEqual( isnan( n ), true, 'returns expected value when provided a NaN' );
+	t.strictEqual( isnan( n ), true, 'returns expected value' );
 	t.end();
 });
 

lib/node_modules/@stdlib/math/base/special/fibonacci-index/test/test.native.js

@@ -46,7 +46,7 @@ tape( 'main export is a function', opts, function test( t ) {
 
 tape( 'if provided `NaN`, the function returns `NaN`', opts, function test( t ) {
 	var n = fibonacciIndex( NaN );
-	t.strictEqual( isnan( n ), true, 'returns expected value when provided a NaN' );
+	t.strictEqual( isnan( n ), true, 'returns expected value' );
 	t.end();
 });
 

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

@@ -21,8 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/array/uniform' );
-var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var round = require( '@stdlib/math/base/special/round' );
 var sqrt = require( '@stdlib/math/base/special/sqrt' );
 var pow = require( '@stdlib/math/base/special/pow' );
@@ -46,7 +45,7 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -72,7 +71,7 @@ bench( pkg+'::analytic', function benchmark( b ) {
 		return round( pow( PHI, n ) / SQRT_5 );
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -94,7 +93,7 @@ bench( pkg+'::table', function benchmark( b ) {
 	var y;
 	var i;
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -123,7 +122,7 @@ bench( pkg+'::naive_recursion', function benchmark( b ) {
 		return fibonacci( n-1 ) + fibonacci( n-2 );
 	}
 
-	x = floor( uniform( 100, 0.0, 40.0 ) ); // limit upper bound
+	x = discreteUniform( 100, 0, 40 ); // limit upper bound
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -161,7 +160,7 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 		return arr[ n ];
 	}
 
-	x = floor( uniform( 100, 0.0, 40.0 ) ); // limit upper bound
+	x = discreteUniform( 100, 0, 40 ); // limit upper bound
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -197,7 +196,7 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 		return arr[ n ];
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) ); // limit upper bound
+	x = discreteUniform( 100, 0, 79 ); // limit upper bound
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -235,7 +234,7 @@ bench( pkg+'::iterative', function benchmark( b ) {
 		return b;
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -276,7 +275,7 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 		return arr[ n ];
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -323,7 +322,7 @@ bench( pkg+'::iterative_doubling', function benchmark( b ) {
 		return a + b;
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -387,7 +386,7 @@ bench( pkg+'::iterative_doubling_memoized', function benchmark( b ) {
 		return a + b;
 	}
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

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

@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/array/uniform' );
-var floor = require( '@stdlib/math/base/special/floor' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
@@ -44,7 +43,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = floor( uniform( 100, 0.0, 79.0 ) );
+	x = discreteUniform( 100, 0, 79 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

lib/node_modules/@stdlib/math/base/special/fibonacci/test/test.js

@@ -54,13 +54,13 @@ tape( 'if provided a negative number, the function returns `NaN`', function test
 
 tape( 'if provided positive infinity, the function returns `NaN`', function test( t ) {
 	var v = fibonacci( PINF );
-	t.strictEqual( isnan( v ), true, 'returns expected value when provided +infinity' );
+	t.strictEqual( isnan( v ), true, 'returns expected value' );
 	t.end();
 });
 
 tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
 	var v = fibonacci( NaN );
-	t.strictEqual( isnan( v ), true, 'returns expected value when provided a NaN' );
+	t.strictEqual( isnan( v ), true, 'returns expected value' );
 	t.end();
 });