chore: minor clean up

Author: Neerajpathak07

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

@@ -22,6 +22,7 @@
 
 var bench = require( '@stdlib/bench' );
 var randu = require( '@stdlib/random/base/randu' );
+var Int32Array = require( '@stdlib/array/int32' );
 var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
 var floorf = require( '@stdlib/math/base/special/floorf' );
 var roundf = require( '@stdlib/math/base/special/roundf' );
@@ -143,7 +144,7 @@ bench( pkg+'::recursion_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 37 );
+	arr = new Int32Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;
@@ -182,7 +183,7 @@ bench( pkg+'::naive_iterative', function benchmark( b ) {
 		var arr;
 		var i;
 
-		arr = new Array( n+1 );
+		arr = new Int32Array( n+1 );
 		arr[ 0 ] = 0;
 		arr[ 1 ] = 1;
 		arr[ 2 ] = 1;
@@ -252,7 +253,7 @@ bench( pkg+'::iterative_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 37 );
+	arr = new Int32Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;
@@ -338,7 +339,7 @@ bench( pkg+'::iterative_doubling_memoized', function benchmark( b ) {
 	var y;
 	var i;
 
-	arr = new Array( 37 );
+	arr = new Int32Array( 37 );
 	arr[ 0 ] = 0;
 	arr[ 1 ] = 1;
 	arr[ 2 ] = 1;

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

@@ -80,7 +80,7 @@ tape( 'the function returns the nth Fibonacci number', function test( t ) {
 	t.end();
 });
 
-tape( 'if provided nonnegative integers greater than `78`, the function returns `NaN`', function test( t ) {
+tape( 'if provided nonnegative integers greater than `36`, the function returns `NaN`', function test( t ) {
 	var i;
 	var v;
 	for ( i = 37; i < 500; i++ ) {