Apply suggestions from code review

Signed-off-by: Athan <[email protected]>

Author: kgryte

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

@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
-	FN = zeros( 76 );
+	FN = zeros( 79 );
 	for ( i = 3; i < 79; i++ ) {
 		FN[ i ] = fibonacci( i );
 	}

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

@@ -46,7 +46,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
-	FN = zeros( 76 );
+	FN = zeros( 79 );
 	for ( i = 3; i < 79; i++ ) {
 		FN[ i ] = fibonacci( i );
 	}

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

@@ -45,7 +45,7 @@ bench( pkg, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -71,7 +71,7 @@ bench( pkg+'::analytic', function benchmark( b ) {
 		return round( pow( PHI, n ) / SQRT_5 );
 	}
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -93,7 +93,7 @@ bench( pkg+'::table', function benchmark( b ) {
 	var y;
 	var i;
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -196,7 +196,7 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 		return arr[ n ];
 	}
 
-	x = discreteUniform( 100, 0, 79 ); // limit upper bound
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -234,7 +234,7 @@ bench( pkg+'::iterative', function benchmark( b ) {
 		return b;
 	}
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -275,7 +275,7 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 		return arr[ n ];
 	}
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -322,7 +322,7 @@ bench( pkg+'::iterative_doubling', function benchmark( b ) {
 		return a + b;
 	}
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
@@ -386,7 +386,7 @@ bench( pkg+'::iterative_doubling_memoized', function benchmark( b ) {
 		return a + b;
 	}
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {

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

@@ -43,7 +43,7 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var y;
 	var i;
 
-	x = discreteUniform( 100, 0, 79 );
+	x = discreteUniform( 100, 0, 78 );
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {