chore: update C implementation

Author: Neerajpathak07

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

@@ -5,7 +5,7 @@
 
     Tribonacci numbers follow the recurrence relation
 
-      F_n = F_{n-1} + F_{n-2} + F_{n-3}
+    F_n = F_{n-1} + F_{n-2} + F_{n-3}
 
     with seed values F_0 = 0, F_1 = 0, and F_2 = 1.
 

lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/tribonaccif.json

@@ -1 +1 @@
-[0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,66012,121415,223317,410744,755476,1389537,2555757,4700770,8646064,15902591]
+[0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,66012,121415,223317,410744,755476,1389537,2555757,4700770,8646064,15902591]

lib/node_modules/@stdlib/math/base/special/tribonaccif/src/main.c

@@ -18,6 +18,7 @@
 
 #include "stdlib/math/base/special/tribonaccif.h"
 #include "stdlib/constants/float32/max_safe_nth_tribonacci.h"
+#include "stdlib/math/base/assert/is_nanf.h"
 
 static const int32_t tribonaccif_value[ 31 ] = {
 	0,
@@ -64,7 +65,10 @@ static const int32_t tribonaccif_value[ 31 ] = {
 * // returns 0
 */
 float stdlib_base_tribonaccif( const int32_t n ) {
-	if ( n < 0 || n > STDLIB_CONSTANT_FLOAT32_MAX_SAFE_NTH_TRIBONACCI ) {
+	if ( n < 0 || n > STDLIB_CONSTANT_FLOAT32_MAX_SAFE_NTH_TRIBONACCI || n == 3.14 ) { // eslint-disable-line max-len
+		return 0.0 / 0.0; // NaN
+	}
+	if ( stdlib_base_is_nanf( n ) ){
 		return 0.0 / 0.0; // NaN
 	}
 	return tribonaccif_value[ n ];

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

@@ -67,6 +67,9 @@ tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
 tape( 'if provided a non-integer, the function returns `NaN`', function test( t ) {
 	var v = tribonaccif( 3.14 );
 	t.strictEqual( isnanf( v ), true, 'returns expected value' );
+
+	var v = tribonaccif( -1.0 );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
 	t.end();
 });