chore: refactoring benchmarks

Author: Neerajpathak07

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

@@ -30,7 +30,7 @@ var pow = require( '@stdlib/math/base/special/pow' );
 var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var PHI = require( '@stdlib/constants/float32/phi' );
 var pkg = require( './../package.json' ).name;
-var FIBONACCI = require( './../lib/fibonacci.json' );
+var FIBONACCIF = require( './../lib/fibonaccif.json' );
 var fibonaccif = require( './../lib' );
 
 
@@ -80,7 +80,7 @@ bench( pkg+'::analytic', function benchmark( b ) {
 		}
 	}
 	b.toc();
-	if ( isnan( y ) ) {
+	if ( isnanf( y ) ) {
 		b.fail( 'should not return NaN' );
 	}
 	b.pass( 'benchmark finished' );
@@ -95,13 +95,13 @@ bench( pkg+'::table', function benchmark( b ) {
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
 		x = floorf( randu()*37.0 );
-		y = FIBONACCI[ x ];
+		y = FIBONACCIF[ x ];
 		if ( isnanf( y ) ) {
 			b.fail( 'should not return NaN' );
 		}
 	}
 	b.toc();
-	if ( isnan( y ) ) {
+	if ( isnanf( y ) ) {
 		b.fail( 'should not return NaN' );
 	}
 	b.pass( 'benchmark finished' );
@@ -129,13 +129,13 @@ bench( pkg+'::naive_recursion', function benchmark( b ) {
 		}
 	}
 	b.toc();
-	if ( isnan( y ) ) {
+	if ( isnanf( y ) ) {
 		b.fail( 'should not return NaN' );
 	}
 	b.pass( 'benchmark finished' );
 	b.end();
 });
-f
+
 bench( pkg+'::recursion_memoized', function benchmark( b ) {
 	var arr;
 	var N;

lib/node_modules/@stdlib/math/base/special/fibonaccif/docs/repl.txt

@@ -1,10 +1,11 @@
 
 {{alias}}( n )
-    Computes the nth Fibonacci number as a single-precision floating-point number.
+    Computes the nth Fibonacci number as a single-precision
+    floating-point number.
 
     Fibonacci numbers follow the recurrence relation
 
-      F_n = F_{n-1} + F_{n-2}
+    F_n = F_{n-1} + F_{n-2}
 
     with seed values F_0 = 0 and F_1 = 1.