diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/README.md b/lib/node_modules/@stdlib/math/base/special/tribonaccif/README.md
new file mode 100644
index 000000000000..54bbb289bd9e
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/README.md
@@ -0,0 +1,246 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2025 The Stdlib Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+
+-->
+
+# Tribonaccif
+
+> Compute the nth [Tribonacci number][tribonacci-number] as a [single-precision floating-point number][ieee754].
+
+<section class="intro">
+
+The [Tribonacci numbers][tribonacci-number] are the integer sequence
+
+<!-- <equation class="equation" label="eq:tribonacci_sequence" align="center" raw="0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, 927, 1705, \ldots" alt="Tribonacci sequence"> -->
+
+```math
+0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, 927, 1705, \ldots
+```
+
+<!-- </equation> -->
+
+The sequence is defined by the recurrence relation
+
+<!-- <equation class="equation" label="eq:tribonacci_recurrence_relation" align="center" raw="F_n = F_{n-1} + F_{n-2} + F_{n-3}" alt="Tribonacci sequence recurrence relation"> -->
+
+```math
+F_n = F_{n-1} + F_{n-2} + F_{n-3}
+```
+
+<!-- </equation> -->
+
+with seed values `F_0 = 0`, `F_1 = 0`, and `F_2 = 1`.
+
+</section>
+
+<!-- /.intro -->
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var tribonaccif = require( '@stdlib/math/base/special/tribonaccif' );
+```
+
+#### tribonaccif( n )
+
+Computes the nth [Tribonacci number][tribonacci-number] as a [single-precision floating-point number][ieee754].
+
+```javascript
+var v = tribonaccif( 0 );
+// returns 0
+
+v = tribonaccif( 1 );
+// returns 0
+
+v = tribonaccif( 2 );
+// returns 1
+
+v = tribonaccif( 3 );
+// returns 1
+
+v = tribonaccif( 30 );
+// returns 15902591
+```
+
+If `n > 30`, the function returns `NaN`, as larger [Tribonacci numbers][tribonacci-number] cannot be safely represented in [single-precision floating-point format][ieee754].
+
+```javascript
+var v = tribonaccif( 31 );
+// returns NaN
+```
+
+If not provided a nonnegative integer value, the function returns `NaN`.
+
+```javascript
+var v = tribonaccif( 3.14 );
+// returns NaN
+
+v = tribonaccif( -1 );
+// returns NaN
+```
+
+If provided `NaN`, the function returns `NaN`.
+
+```javascript
+var v = tribonaccif( NaN );
+// returns NaN
+```
+
+</section>
+
+<!-- /.usage -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var logEachMap = require( '@stdlib/console/log-each-map' );
+var linspace = require( '@stdlib/array/base/linspace' );
+var tribonaccif = require( '@stdlib/math/base/special/tribonaccif' );
+
+var v = linspace( 0, 30, 31 );
+
+logEachMap( 'tribonaccif(%d) = %0.4f', v, tribonaccif );
+```
+
+</section>
+
+<!-- /.examples -->
+
+<!-- C interface documentation. -->
+
+* * *
+
+<section class="c">
+
+## C APIs
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- C usage documentation. -->
+
+<section class="usage">
+
+### Usage
+
+```c
+#include "stdlib/math/base/special/tribonaccif.h"
+```
+
+#### stdlib_base_tribonaccif( n )
+
+Computes the nth [Tribonacci number][tribonacci-number] as a [single-precision floating-point number][ieee754].
+
+```c
+float out = stdlib_base_tribonaccif( 0 );
+// returns 0.0f
+
+out = stdlib_base_tribonaccif( 4 );
+// returns 2.0f
+```
+
+The function accepts the following arguments:
+
+-   **n**: `[in] int32_t` input value.
+
+```c
+float stdlib_base_tribonaccif( const int32_t n );
+```
+
+</section>
+
+<!-- /.usage -->
+
+<!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<!-- C API usage examples. -->
+
+<section class="examples">
+
+### Examples
+
+```c
+#include "stdlib/math/base/special/tribonaccif.h"
+#include <stdio.h>
+#include <stdint.h>
+
+int main( void ) {
+    int32_t i;
+    float v;
+
+    for ( i = 0; i < 31; i++ ) {
+        v = stdlib_base_tribonaccif( i );
+        printf( "tribonaccif(%d) = %f\n", i, v );
+    }
+}
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[tribonacci-number]: https://en.wikipedia.org/wiki/Generalizations_of_Fibonacci_numbers#Tribonacci_numbers
+
+[ieee754]: https://en.wikipedia.org/wiki/IEEE_754-1985
+
+<!-- <related-links> -->
+
+<!-- </related-links> -->
+
+</section>
+
+<!-- /.links -->
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.js
new file mode 100644
index 000000000000..0ff729c4ed25
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.js
@@ -0,0 +1,264 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var Int32Array = require( '@stdlib/array/int32' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var pkg = require( './../package.json' ).name;
+var TRIBONACCIF = require( './../lib/tribonaccif.json' );
+var tribonaccif = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg, function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::table', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = TRIBONACCIF[ x[ i%x.length ] ];
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::naive_recursion', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	function tribonaccif( n ) {
+		if ( n < 2 ) {
+			return 0;
+		}
+		if ( n === 2 ) {
+			return 1;
+		}
+		return tribonaccif( n-1 ) + tribonaccif( n-2 ) + tribonaccif( n-3 );
+	}
+
+	x = discreteUniform( 100, 0, 10 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::recursion_memoized', function benchmark( b ) {
+	var arr;
+	var N;
+	var x;
+	var y;
+	var i;
+
+	arr = new Int32Array( 32 );
+	arr[ 0 ] = 0;
+	arr[ 1 ] = 0;
+	arr[ 2 ] = 1;
+	N = 2;
+
+	function tribonaccif( n ) {
+		if ( n <= N ) {
+			return arr[ n ];
+		}
+		arr[ n ] = tribonaccif( n-1 ) + tribonaccif( n-2 ) + tribonaccif( n-3 );
+		return arr[ n ];
+	}
+
+	x = discreteUniform( 100, 0, 10 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::naive_iterative', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	function tribonaccif( n ) {
+		var arr;
+		var i;
+
+		arr = new Int32Array( n+1 );
+		arr[ 0 ] = 0;
+		arr[ 1 ] = 0;
+		arr[ 2 ] = 1;
+		for ( i = 3; i <= n; i++ ) {
+			arr[ i ] = arr[ i-1 ] + arr[ i-2 ] + arr[ i-3 ];
+		}
+		return arr[ n ];
+	}
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::iterative', function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	function tribonaccif( n ) {
+		var a;
+		var b;
+		var c;
+		var d;
+		var i;
+
+		a = 0;
+		b = 0;
+		c = 1;
+		for ( i = 4; i <= n; i++ ) {
+			d = a + b + c;
+			a = b;
+			b = c;
+			c = d;
+		}
+		return c;
+	}
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+bench( pkg+'::iterative_memoized', function benchmark( b ) {
+	var arr;
+	var N;
+	var x;
+	var y;
+	var i;
+
+	arr = new Int32Array( 31 );
+	arr[ 0 ] = 0;
+	arr[ 1 ] = 0;
+	arr[ 2 ] = 1;
+	N = 2;
+
+	function tribonaccif( n ) {
+		var i;
+		if ( n > N ) {
+			for ( i = N+1; i <= n; i++ ) {
+				arr[ i ] = arr[ i-1 ] + arr[ i-2 ] + arr[ i-3 ];
+			}
+			N = n;
+		}
+		return arr[ n ];
+	}
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.native.js
new file mode 100644
index 000000000000..5ddce1900bbc
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/benchmark.native.js
@@ -0,0 +1,61 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var resolve = require( 'path' ).resolve;
+var bench = require( '@stdlib/bench' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var tribonaccif = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var opts = {
+	'skip': ( tribonaccif instanceof Error )
+};
+
+
+// MAIN //
+
+bench( pkg+'::native', opts, function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	x = discreteUniform( 100, 0, 30 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = tribonaccif( x[ i%x.length ] );
+		if ( isnanf( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/Makefile b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/Makefile
new file mode 100644
index 000000000000..635d877081d5
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/Makefile
@@ -0,0 +1,126 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+	QUIET := @
+else
+	QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+	OS := WINNT
+endif
+endif
+endif
+endif
+
+# Define the program used for compiling C source files:
+ifdef C_COMPILER
+	CC := $(C_COMPILER)
+else
+	CC := gcc
+endif
+
+# Define the command-line options when compiling C files:
+CFLAGS ?= \
+	-std=c99 \
+	-O3 \
+	-Wall \
+	-pedantic
+
+# Determine whether to generate position independent code ([1][1], [2][2]).
+#
+# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options
+# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option
+ifeq ($(OS), WINNT)
+	fPIC ?=
+else
+	fPIC ?= -fPIC
+endif
+
+# List of C targets:
+c_targets := benchmark.out
+
+
+# RULES #
+
+#/
+# Compiles C source files.
+#
+# @param {string} [C_COMPILER] - C compiler
+# @param {string} [CFLAGS] - C compiler flags
+# @param {(string|void)} [fPIC] - compiler flag indicating whether to generate position independent code
+#
+# @example
+# make
+#
+# @example
+# make all
+#/
+all: $(c_targets)
+
+.PHONY: all
+
+#/
+# Compiles C source files.
+#
+# @private
+# @param {string} CC - C compiler
+# @param {string} CFLAGS - C compiler flags
+# @param {(string|void)} fPIC - compiler flag indicating whether to generate position independent code
+#/
+$(c_targets): %.out: %.c
+	$(QUIET) $(CC) $(CFLAGS) $(fPIC) -o $@ $< -lm
+
+#/
+# Runs compiled benchmarks.
+#
+# @example
+# make run
+#/
+run: $(c_targets)
+	$(QUIET) ./$<
+
+.PHONY: run
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean:
+	$(QUIET) -rm -f *.o *.out
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/benchmark.c
new file mode 100644
index 000000000000..5e40dccde976
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/benchmark.c
@@ -0,0 +1,160 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include <time.h>
+#include <sys/time.h>
+
+#define NAME "tribonaccif::iterative"
+#define ITERATIONS 1000000
+#define REPEATS 3
+
+/**
+* Prints the TAP version.
+*/
+static void print_version( void ) {
+	printf( "TAP version 13\n" );
+}
+
+/**
+* Prints the TAP summary.
+*
+* @param total     total number of tests
+* @param passing   total number of passing tests
+*/
+static void print_summary( int total, int passing ) {
+	printf( "#\n" );
+	printf( "1..%d\n", total ); // TAP plan
+	printf( "# total %d\n", total );
+	printf( "# pass  %d\n", passing );
+	printf( "#\n" );
+	printf( "# ok\n" );
+}
+
+/**
+* Prints benchmarks results.
+*
+* @param elapsed   elapsed time in seconds
+*/
+static void print_results( double elapsed ) {
+	double rate = (double)ITERATIONS / elapsed;
+	printf( "  ---\n" );
+	printf( "  iterations: %d\n", ITERATIONS );
+	printf( "  elapsed: %0.9f\n", elapsed );
+	printf( "  rate: %0.9f\n", rate );
+	printf( "  ...\n" );
+}
+
+/**
+* Returns a clock time.
+*
+* @return clock time
+*/
+static double tic( void ) {
+	struct timeval now;
+	gettimeofday( &now, NULL );
+	return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
+}
+
+/**
+* Generates a random number on the interval [0,1).
+*
+* @return random number
+*/
+static float rand_float( void ) {
+	int r = rand();
+	return (float)r / ( (float)RAND_MAX + 1.0f );
+}
+
+/**
+* Computes the nth Tribonacci number.
+*
+* @param n   Tribonacci number to compute
+* @return    Tribonacci number
+*/
+int tribonaccif( int n ) {
+	int a;
+	int b;
+	int c;
+	int d;
+	int i;
+
+	a = 0;
+	b = 0;
+	c = 1;
+	for ( i = 4; i <= n; i++ ) {
+		d = a + b + c;
+		a = b;
+		b = c;
+		c = d;
+	}
+	return c;
+}
+
+/**
+* Runs a benchmark.
+*
+* @return elapsed time in seconds
+*/
+static double benchmark( void ) {
+	double elapsed;
+	int x[ 100 ];
+	double t;
+	int y;
+	int i;
+
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = (int)floorf( 31.0f*rand_float() );
+	}
+
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		y = tribonaccif( x[ i%100 ] );
+		if ( y < 0 ) {
+			printf( "should return a nonnegative integer\n" );
+			break;
+		}
+	}
+	elapsed = tic() - t;
+	if ( y < 0 ) {
+		printf( "should return a nonnegative integer\n" );
+	}
+	return elapsed;
+}
+
+/**
+* Main execution sequence.
+*/
+int main( void ) {
+	double elapsed;
+	int i;
+
+	// Use the current time to seed the random number generator:
+	srand( time( NULL ) );
+
+	print_version();
+	for ( i = 0; i < REPEATS; i++ ) {
+		printf( "# c::%s\n", NAME );
+		elapsed = benchmark();
+		print_results( elapsed );
+		printf( "ok %d benchmark finished\n", i+1 );
+	}
+	print_summary( REPEATS, REPEATS );
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/Makefile b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/Makefile
new file mode 100644
index 000000000000..a4bd7b38fd74
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+	QUIET := @
+else
+	QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+	OS := WINNT
+endif
+endif
+endif
+endif
+
+# Define the program used for compiling C source files:
+ifdef C_COMPILER
+	CC := $(C_COMPILER)
+else
+	CC := gcc
+endif
+
+# Define the command-line options when compiling C files:
+CFLAGS ?= \
+	-std=c99 \
+	-O3 \
+	-Wall \
+	-pedantic
+
+# Determine whether to generate position independent code ([1][1], [2][2]).
+#
+# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options
+# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option
+ifeq ($(OS), WINNT)
+	fPIC ?=
+else
+	fPIC ?= -fPIC
+endif
+
+# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`):
+INCLUDE ?=
+
+# List of source files:
+SOURCE_FILES ?=
+
+# List of libraries (e.g., `-lopenblas -lpthread`):
+LIBRARIES ?=
+
+# List of library paths (e.g., `-L /foo/bar -L /beep/boop`):
+LIBPATH ?=
+
+# List of C targets:
+c_targets := benchmark.out
+
+
+# RULES #
+
+#/
+# Compiles source files.
+#
+# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`)
+# @param {string} [CFLAGS] - C compiler options
+# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`)
+# @param {string} [SOURCE_FILES] - list of source files
+# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`)
+# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`)
+#
+# @example
+# make
+#
+# @example
+# make all
+#/
+all: $(c_targets)
+
+.PHONY: all
+
+#/
+# Compiles C source files.
+#
+# @private
+# @param {string} CC - C compiler (e.g., `gcc`)
+# @param {string} CFLAGS - C compiler options
+# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`)
+# @param {string} SOURCE_FILES - list of source files
+# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`)
+# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`)
+#/
+$(c_targets): %.out: %.c
+	$(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES)
+
+#/
+# Runs compiled benchmarks.
+#
+# @example
+# make run
+#/
+run: $(c_targets)
+	$(QUIET) ./$<
+
+.PHONY: run
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean:
+	$(QUIET) -rm -f *.o *.out
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/benchmark.c b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/benchmark.c
new file mode 100644
index 000000000000..8442ba8d07cd
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/benchmark/c/native/benchmark.c
@@ -0,0 +1,137 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#include "stdlib/math/base/special/tribonaccif.h"
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <math.h>
+#include <time.h>
+#include <sys/time.h>
+
+#define NAME "tribonaccif"
+#define ITERATIONS 100
+#define REPEATS 3
+
+/**
+* Prints the TAP version.
+*/
+static void print_version( void ) {
+	printf( "TAP version 13\n" );
+}
+
+/**
+* Prints the TAP summary.
+*
+* @param total     total number of tests
+* @param passing   total number of passing tests
+*/
+static void print_summary( int total, int passing ) {
+	printf( "#\n" );
+	printf( "1..%d\n", total ); // TAP plan
+	printf( "# total %d\n", total );
+	printf( "# pass  %d\n", passing );
+	printf( "#\n" );
+	printf( "# ok\n" );
+}
+
+/**
+* Prints benchmarks results.
+*
+* @param elapsed   elapsed time in seconds
+*/
+static void print_results( double elapsed ) {
+	double rate = (double)ITERATIONS / elapsed;
+	printf( "  ---\n" );
+	printf( "  iterations: %d\n", ITERATIONS );
+	printf( "  elapsed: %0.9f\n", elapsed );
+	printf( "  rate: %0.9f\n", rate );
+	printf( "  ...\n" );
+}
+
+/**
+* Returns a clock time.
+*
+* @return clock time
+*/
+static double tic( void ) {
+	struct timeval now;
+	gettimeofday( &now, NULL );
+	return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
+}
+
+/**
+* Generates a random number on the interval [0,1).
+*
+* @return random number
+*/
+static float rand_float( void ) {
+	int r = rand();
+	return (float)r / ( (float)RAND_MAX + 1.0f );
+}
+
+/**
+* Runs a benchmark.
+*
+* @return elapsed time in seconds
+*/
+static double benchmark( void ) {
+	int32_t x[ 100 ];
+	double elapsed;
+	double t;
+	float y;
+	int i;
+
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = (int32_t)floorf( 40.0f*rand_float() );
+	}
+
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		y = stdlib_base_tribonaccif( x[ i%100 ] );
+		if ( y < 0 ) {
+			printf( "should return a nonnegative integer\n" );
+			break;
+		}
+	}
+	elapsed = tic() - t;
+	if ( y < 0 ) {
+		printf( "should return a nonnegative integer\n" );
+	}
+	return elapsed;
+}
+
+/**
+* Main execution sequence.
+*/
+int main( void ) {
+	double elapsed;
+	int i;
+
+	// Use the current time to seed the random number generator:
+	srand( time( NULL ) );
+
+	print_version();
+	for ( i = 0; i < REPEATS; i++ ) {
+		printf( "# c::native::%s\n", NAME );
+		elapsed = benchmark();
+		print_results( elapsed );
+		printf( "ok %d benchmark finished\n", i+1 );
+	}
+	print_summary( REPEATS, REPEATS );
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/binding.gyp b/lib/node_modules/@stdlib/math/base/special/tribonaccif/binding.gyp
new file mode 100644
index 000000000000..68a1ca11d160
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/binding.gyp
@@ -0,0 +1,170 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+# A `.gyp` file for building a Node.js native add-on.
+#
+# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md
+# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md
+{
+  # List of files to include in this file:
+  'includes': [
+    './include.gypi',
+  ],
+
+  # Define variables to be used throughout the configuration for all targets:
+  'variables': {
+    # Target name should match the add-on export name:
+    'addon_target_name%': 'addon',
+
+    # Set variables based on the host OS:
+    'conditions': [
+      [
+        'OS=="win"',
+        {
+          # Define the object file suffix:
+          'obj': 'obj',
+        },
+        {
+          # Define the object file suffix:
+          'obj': 'o',
+        }
+      ], # end condition (OS=="win")
+    ], # end conditions
+  }, # end variables
+
+  # Define compile targets:
+  'targets': [
+
+    # Target to generate an add-on:
+    {
+      # The target name should match the add-on export name:
+      'target_name': '<(addon_target_name)',
+
+      # Define dependencies:
+      'dependencies': [],
+
+      # Define directories which contain relevant include headers:
+      'include_dirs': [
+        # Local include directory:
+        '<@(include_dirs)',
+      ],
+
+      # List of source files:
+      'sources': [
+        '<@(src_files)',
+      ],
+
+      # Settings which should be applied when a target's object files are used as linker input:
+      'link_settings': {
+        # Define libraries:
+        'libraries': [
+          '<@(libraries)',
+        ],
+
+        # Define library directories:
+        'library_dirs': [
+          '<@(library_dirs)',
+        ],
+      },
+
+      # C/C++ compiler flags:
+      'cflags': [
+        # Enable commonly used warning options:
+        '-Wall',
+
+        # Aggressive optimization:
+        '-O3',
+      ],
+
+      # C specific compiler flags:
+      'cflags_c': [
+        # Specify the C standard to which a program is expected to conform:
+        '-std=c99',
+      ],
+
+      # C++ specific compiler flags:
+      'cflags_cpp': [
+        # Specify the C++ standard to which a program is expected to conform:
+        '-std=c++11',
+      ],
+
+      # Linker flags:
+      'ldflags': [],
+
+      # Apply conditions based on the host OS:
+      'conditions': [
+        [
+          'OS=="mac"',
+          {
+            # Linker flags:
+            'ldflags': [
+              '-undefined dynamic_lookup',
+              '-Wl,-no-pie',
+              '-Wl,-search_paths_first',
+            ],
+          },
+        ], # end condition (OS=="mac")
+        [
+          'OS!="win"',
+          {
+            # C/C++ flags:
+            'cflags': [
+              # Generate platform-independent code:
+              '-fPIC',
+            ],
+          },
+        ], # end condition (OS!="win")
+      ], # end conditions
+    }, # end target <(addon_target_name)
+
+    # Target to copy a generated add-on to a standard location:
+    {
+      'target_name': 'copy_addon',
+
+      # Declare that the output of this target is not linked:
+      'type': 'none',
+
+      # Define dependencies:
+      'dependencies': [
+        # Require that the add-on be generated before building this target:
+        '<(addon_target_name)',
+      ],
+
+      # Define a list of actions:
+      'actions': [
+        {
+          'action_name': 'copy_addon',
+          'message': 'Copying addon...',
+
+          # Explicitly list the inputs in the command-line invocation below:
+          'inputs': [],
+
+          # Declare the expected outputs:
+          'outputs': [
+            '<(addon_output_dir)/<(addon_target_name).node',
+          ],
+
+          # Define the command-line invocation:
+          'action': [
+            'cp',
+            '<(PRODUCT_DIR)/<(addon_target_name).node',
+            '<(addon_output_dir)/<(addon_target_name).node',
+          ],
+        },
+      ], # end actions
+    }, # end target copy_addon
+  ], # end targets
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/repl.txt b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/repl.txt
new file mode 100644
index 000000000000..7fcb95e093f1
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/repl.txt
@@ -0,0 +1,49 @@
+
+{{alias}}( n )
+    Computes the nth Tribonacci number as a single-precision floating-point
+    number.
+
+    Tribonacci numbers follow the recurrence relation
+
+    F_n = F_{n-1} + F_{n-2} + F_{n-3}
+
+    with seed values F_0 = 0, F_1 = 0, and F_2 = 1.
+
+    If `n` is greater than `30`, the function returns `NaN`, as larger
+    Tribonacci numbers cannot be accurately represented due to limitations of
+    single-precision floating-point format.
+
+    If not provided a nonnegative integer value, the function returns `NaN`.
+
+    If provided `NaN`, the function returns `NaN`.
+
+    Parameters
+    ----------
+    n: integer
+        Input value.
+
+    Returns
+    -------
+    y: integer
+        Tribonacci number.
+
+    Examples
+    --------
+    > var y = {{alias}}( 0 )
+    0
+    > y = {{alias}}( 1 )
+    0
+    > y = {{alias}}( 2 )
+    1
+    > y = {{alias}}( 3 )
+    1
+    > y = {{alias}}( 4 )
+    2
+    > y = {{alias}}( 31 )
+    NaN
+    > y = {{alias}}( NaN )
+    NaN
+
+    See Also
+    --------
+
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/index.d.ts b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/index.d.ts
new file mode 100644
index 000000000000..0943311653b7
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/index.d.ts
@@ -0,0 +1,77 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+// TypeScript Version: 4.1
+
+/**
+* Computes the nth Tribonacci number as a single-precision floating-point number.
+*
+* ## Notes
+*
+* -   If `n` is greater than `30`, the function returns `NaN`, as larger Tribonacci numbers cannot be accurately represented due to limitations of single-precision floating-point format.
+* -   If not provided a nonnegative integer value, the function returns `NaN`.
+*
+* @param n - the Tribonacci number to compute
+* @returns Tribonacci number
+*
+* @example
+* var y = tribonaccif( 0 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 1 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 2 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 3 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 4 );
+* // returns 2
+*
+* @example
+* var y = tribonaccif( 5 );
+* // returns 4
+*
+* @example
+* var y = tribonaccif( 6 );
+* // returns 7
+*
+* @example
+* var y = tribonaccif( NaN );
+* // returns NaN
+*
+* @example
+* var y = tribonaccif( 3.14 );
+* // returns NaN
+*
+* @example
+* var y = tribonaccif( -1.0 );
+* // returns NaN
+*/
+declare function tribonaccif( n: number ): number;
+
+
+// EXPORTS //
+
+export = tribonaccif;
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/test.ts b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/test.ts
new file mode 100644
index 000000000000..ac42c50067db
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/docs/types/test.ts
@@ -0,0 +1,44 @@
+/*
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+import tribonaccif = require( './index' );
+
+
+// TESTS //
+
+// The function returns a number...
+{
+	tribonaccif( 7 ); // $ExpectType number
+}
+
+// The compiler throws an error if the function is provided a value other than a number...
+{
+	tribonaccif( true ); // $ExpectError
+	tribonaccif( false ); // $ExpectError
+	tribonaccif( null ); // $ExpectError
+	tribonaccif( undefined ); // $ExpectError
+	tribonaccif( '5' ); // $ExpectError
+	tribonaccif( [] ); // $ExpectError
+	tribonaccif( {} ); // $ExpectError
+	tribonaccif( ( x: number ): number => x ); // $ExpectError
+}
+
+// The compiler throws an error if the function is provided insufficient arguments...
+{
+	tribonaccif(); // $ExpectError
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/Makefile b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/Makefile
new file mode 100644
index 000000000000..25ced822f96a
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+	QUIET := @
+else
+	QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+	OS := WINNT
+endif
+endif
+endif
+endif
+
+# Define the program used for compiling C source files:
+ifdef C_COMPILER
+	CC := $(C_COMPILER)
+else
+	CC := gcc
+endif
+
+# Define the command-line options when compiling C files:
+CFLAGS ?= \
+	-std=c99 \
+	-O3 \
+	-Wall \
+	-pedantic
+
+# Determine whether to generate position independent code ([1][1], [2][2]).
+#
+# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options
+# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option
+ifeq ($(OS), WINNT)
+	fPIC ?=
+else
+	fPIC ?= -fPIC
+endif
+
+# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`):
+INCLUDE ?=
+
+# List of source files:
+SOURCE_FILES ?=
+
+# List of libraries (e.g., `-lopenblas -lpthread`):
+LIBRARIES ?=
+
+# List of library paths (e.g., `-L /foo/bar -L /beep/boop`):
+LIBPATH ?=
+
+# List of C targets:
+c_targets := example.out
+
+
+# RULES #
+
+#/
+# Compiles source files.
+#
+# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`)
+# @param {string} [CFLAGS] - C compiler options
+# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`)
+# @param {string} [SOURCE_FILES] - list of source files
+# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`)
+# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`)
+#
+# @example
+# make
+#
+# @example
+# make all
+#/
+all: $(c_targets)
+
+.PHONY: all
+
+#/
+# Compiles C source files.
+#
+# @private
+# @param {string} CC - C compiler (e.g., `gcc`)
+# @param {string} CFLAGS - C compiler options
+# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`)
+# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`)
+# @param {string} SOURCE_FILES - list of source files
+# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`)
+# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`)
+#/
+$(c_targets): %.out: %.c
+	$(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES)
+
+#/
+# Runs compiled examples.
+#
+# @example
+# make run
+#/
+run: $(c_targets)
+	$(QUIET) ./$<
+
+.PHONY: run
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean:
+	$(QUIET) -rm -f *.o *.out
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/example.c b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/example.c
new file mode 100644
index 000000000000..0ab99e9a07cb
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/c/example.c
@@ -0,0 +1,31 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#include "stdlib/math/base/special/tribonaccif.h"
+#include <stdio.h>
+#include <stdint.h>
+
+int main( void ) {
+	int32_t i;
+	float v;
+
+	for ( i = 0; i < 31; i++ ) {
+		v = stdlib_base_tribonaccif( i );
+		printf( "tribonaccif(%d) = %f\n", i, v );
+	}
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/index.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/index.js
new file mode 100644
index 000000000000..f99ba2994fe0
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/examples/index.js
@@ -0,0 +1,27 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+var logEachMap = require( '@stdlib/console/log-each-map' );
+var linspace = require( '@stdlib/array/base/linspace' );
+var tribonaccif = require( './../lib' );
+
+var v = linspace( 0, 30, 31 );
+
+logEachMap( 'tribonaccif(%d) = %0.4f', v, tribonaccif );
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/include.gypi b/lib/node_modules/@stdlib/math/base/special/tribonaccif/include.gypi
new file mode 100644
index 000000000000..ecfaf82a3279
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/include.gypi
@@ -0,0 +1,53 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+# A GYP include file for building a Node.js native add-on.
+#
+# Main documentation:
+#
+# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md
+# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md
+{
+  # Define variables to be used throughout the configuration for all targets:
+  'variables': {
+    # Source directory:
+    'src_dir': './src',
+
+    # Include directories:
+    'include_dirs': [
+      '<!@(node -e "var arr = require(\'@stdlib/utils/library-manifest\')(\'./manifest.json\',{},{\'basedir\':process.cwd(),\'paths\':\'posix\'}).include; for ( var i = 0; i < arr.length; i++ ) { console.log( arr[ i ] ); }")',
+    ],
+
+    # Add-on destination directory:
+    'addon_output_dir': './src',
+
+    # Source files:
+    'src_files': [
+      '<(src_dir)/addon.c',
+      '<!@(node -e "var arr = require(\'@stdlib/utils/library-manifest\')(\'./manifest.json\',{},{\'basedir\':process.cwd(),\'paths\':\'posix\'}).src; for ( var i = 0; i < arr.length; i++ ) { console.log( arr[ i ] ); }")',
+    ],
+
+    # Library dependencies:
+    'libraries': [
+      '<!@(node -e "var arr = require(\'@stdlib/utils/library-manifest\')(\'./manifest.json\',{},{\'basedir\':process.cwd(),\'paths\':\'posix\'}).libraries; for ( var i = 0; i < arr.length; i++ ) { console.log( arr[ i ] ); }")',
+    ],
+
+    # Library directories:
+    'library_dirs': [
+      '<!@(node -e "var arr = require(\'@stdlib/utils/library-manifest\')(\'./manifest.json\',{},{\'basedir\':process.cwd(),\'paths\':\'posix\'}).libpath; for ( var i = 0; i < arr.length; i++ ) { console.log( arr[ i ] ); }")',
+    ],
+  }, # end variables
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/include/stdlib/math/base/special/tribonaccif.h b/lib/node_modules/@stdlib/math/base/special/tribonaccif/include/stdlib/math/base/special/tribonaccif.h
new file mode 100644
index 000000000000..86ca89817fd5
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/include/stdlib/math/base/special/tribonaccif.h
@@ -0,0 +1,37 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#ifndef STDLIB_MATH_BASE_SPECIAL_TRIBONACCIF_H
+#define STDLIB_MATH_BASE_SPECIAL_TRIBONACCIF_H
+
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+* Computes the nth Tribonacci number as a single-precision floating-point number.
+*/
+float stdlib_base_tribonaccif( const int32_t n );
+
+#ifdef __cplusplus
+};
+#endif
+
+#endif // !STDLIB_MATH_BASE_SPECIAL_TRIBONACCIF_H
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/index.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/index.js
new file mode 100644
index 000000000000..4635515b231e
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/index.js
@@ -0,0 +1,58 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+/**
+* Compute the nth Tribonacci number as a single-precision floating-point number.
+*
+* @module @stdlib/math/base/special/tribonaccif
+*
+* @example
+* var tribonaccif = require( '@stdlib/math/base/special/tribonaccif' );
+*
+* var y = tribonaccif( 0 );
+* // returns 0
+*
+* y = tribonaccif( 1 );
+* // returns 0
+*
+* y = tribonaccif( 2 );
+* // returns 1
+*
+* y = tribonaccif( 3 );
+* // returns 1
+*
+* y = tribonaccif( 4 );
+* // returns 2
+*
+* y = tribonaccif( 5 );
+* // returns 4
+*
+* y = tribonaccif( 6 );
+* // returns 7
+*/
+
+// MODULES //
+
+var main = require( './main.js' );
+
+
+// EXPORTS //
+
+module.exports = main;
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/main.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/main.js
new file mode 100644
index 000000000000..3a2451c410ec
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/main.js
@@ -0,0 +1,92 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var isIntegerf = require( '@stdlib/math/base/assert/is-integerf' );
+var FLOAT32_MAX_SAFE_NTH_TRIBONACCI = require( '@stdlib/constants/float32/max-safe-nth-tribonacci' ); // eslint-disable-line id-length
+var TRIBONACCIF = require( './tribonaccif.json' );
+
+
+// MAIN //
+
+/**
+* Computes the nth Tribonacci number as a single-precision floating-point number.
+*
+* @param {NonNegativeInteger} n - the Tribonacci number to compute
+* @returns {NonNegativeInteger} Tribonacci number
+*
+* @example
+* var y = tribonaccif( 0 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 1 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 2 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 3 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 4 );
+* // returns 2
+*
+* @example
+* var y = tribonaccif( 5 );
+* // returns 4
+*
+* @example
+* var y = tribonaccif( 6 );
+* // returns 7
+*
+* @example
+* var y = tribonaccif( NaN );
+* // returns NaN
+*
+* @example
+* var y = tribonaccif( 3.14 );
+* // returns NaN
+*
+* @example
+* var y = tribonaccif( -1.0 );
+* // returns NaN
+*/
+function tribonaccif( n ) {
+	if (
+		isnanf( n ) ||
+		isIntegerf( n ) === false ||
+		n < 0 ||
+		n > FLOAT32_MAX_SAFE_NTH_TRIBONACCI
+	) {
+		return NaN;
+	}
+	return TRIBONACCIF[ n ];
+}
+
+
+// EXPORTS //
+
+module.exports = tribonaccif;
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/native.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/native.js
new file mode 100644
index 000000000000..a3a381d023c2
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/native.js
@@ -0,0 +1,74 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var addon = require( './../src/addon.node' );
+
+
+// MAIN //
+
+/**
+* Computes the nth Tribonacci number as a single-precision floating-point number.
+*
+* @private
+* @param {NonNegativeInteger} n - the Tribonacci number to compute
+* @returns {NonNegativeInteger} Tribonacci number
+*
+* @example
+* var y = tribonaccif( 0 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 1 );
+* // returns 0
+*
+* @example
+* var y = tribonaccif( 2 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 3 );
+* // returns 1
+*
+* @example
+* var y = tribonaccif( 4 );
+* // returns 2
+*
+* @example
+* var y = tribonaccif( 5 );
+* // returns 4
+*
+* @example
+* var y = tribonaccif( 6 );
+* // returns 7
+*
+* @example
+* var y = tribonaccif( -1 );
+* // returns NaN
+*/
+function tribonaccif( n ) {
+	return addon( n );
+}
+
+
+// EXPORTS //
+
+module.exports = tribonaccif;
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/tribonaccif.json b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/tribonaccif.json
new file mode 100644
index 000000000000..a7c166ed09f2
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/lib/tribonaccif.json
@@ -0,0 +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]
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/manifest.json b/lib/node_modules/@stdlib/math/base/special/tribonaccif/manifest.json
new file mode 100644
index 000000000000..f7bfb3df1185
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/manifest.json
@@ -0,0 +1,72 @@
+{
+  "options": {
+    "task": "build"
+  },
+  "fields": [
+    {
+      "field": "src",
+      "resolve": true,
+      "relative": true
+    },
+    {
+      "field": "include",
+      "resolve": true,
+      "relative": true
+    },
+    {
+      "field": "libraries",
+      "resolve": false,
+      "relative": false
+    },
+    {
+      "field": "libpath",
+      "resolve": true,
+      "relative": false
+    }
+  ],
+  "confs": [
+    {
+      "task": "build",
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/math/base/napi/unary",
+        "@stdlib/constants/float32/max-safe-nth-tribonacci"
+      ]
+    },
+    {
+      "task": "benchmark",
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/constants/float32/max-safe-nth-tribonacci"
+      ]
+    },
+    {
+      "task": "examples",
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/constants/float32/max-safe-nth-tribonacci"
+      ]
+    }
+  ]
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/package.json b/lib/node_modules/@stdlib/math/base/special/tribonaccif/package.json
new file mode 100644
index 000000000000..f249de1b0862
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/package.json
@@ -0,0 +1,66 @@
+{
+  "name": "@stdlib/math/base/special/tribonaccif",
+  "version": "0.0.0",
+  "description": "Compute the nth Tribonacci number as a single-precision floating-point number.",
+  "license": "Apache-2.0",
+  "author": {
+    "name": "The Stdlib Authors",
+    "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+  },
+  "contributors": [
+    {
+      "name": "The Stdlib Authors",
+      "url": "https://github.com/stdlib-js/stdlib/graphs/contributors"
+    }
+  ],
+  "main": "./lib",
+  "gypfile": true,
+  "directories": {
+    "benchmark": "./benchmark",
+    "doc": "./docs",
+    "example": "./examples",
+    "include": "./include",
+    "lib": "./lib",
+    "src": "./src",
+    "test": "./test"
+  },
+  "types": "./docs/types",
+  "scripts": {},
+  "homepage": "https://github.com/stdlib-js/stdlib",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/stdlib-js/stdlib.git"
+  },
+  "bugs": {
+    "url": "https://github.com/stdlib-js/stdlib/issues"
+  },
+  "dependencies": {},
+  "devDependencies": {},
+  "engines": {
+    "node": ">=0.10.0",
+    "npm": ">2.7.0"
+  },
+  "os": [
+    "aix",
+    "darwin",
+    "freebsd",
+    "linux",
+    "macos",
+    "openbsd",
+    "sunos",
+    "win32",
+    "windows"
+  ],
+  "keywords": [
+    "stdlib",
+    "stdmath",
+    "mathematics",
+    "math",
+    "special",
+    "function",
+    "fibonacci",
+    "tribonacci",
+    "tribonaccif",
+    "number"
+  ]
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/Makefile b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/Makefile
new file mode 100644
index 000000000000..7733b6180cb4
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/Makefile
@@ -0,0 +1,70 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2025 The Stdlib Authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#    http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#/
+
+# VARIABLES #
+
+ifndef VERBOSE
+	QUIET := @
+else
+	QUIET :=
+endif
+
+# Determine the OS ([1][1], [2][2]).
+#
+# [1]: https://en.wikipedia.org/wiki/Uname#Examples
+# [2]: http://stackoverflow.com/a/27776822/2225624
+OS ?= $(shell uname)
+ifneq (, $(findstring MINGW,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring MSYS,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring CYGWIN,$(OS)))
+	OS := WINNT
+else
+ifneq (, $(findstring Windows_NT,$(OS)))
+	OS := WINNT
+endif
+endif
+endif
+endif
+
+
+# RULES #
+
+#/
+# Removes generated files for building an add-on.
+#
+# @example
+# make clean-addon
+#/
+clean-addon:
+	$(QUIET) -rm -f *.o *.node
+
+.PHONY: clean-addon
+
+#/
+# Removes generated files.
+#
+# @example
+# make clean
+#/
+clean: clean-addon
+
+.PHONY: clean
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/addon.c b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/addon.c
new file mode 100644
index 000000000000..a142096492cb
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/addon.c
@@ -0,0 +1,22 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#include "stdlib/math/base/special/tribonaccif.h"
+#include "stdlib/math/base/napi/unary.h"
+
+STDLIB_MATH_BASE_NAPI_MODULE_I_F( stdlib_base_tribonaccif )
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/main.c b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/main.c
new file mode 100644
index 000000000000..6b9d512e7430
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/src/main.c
@@ -0,0 +1,72 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+#include "stdlib/math/base/special/tribonaccif.h"
+#include "stdlib/constants/float32/max_safe_nth_tribonacci.h"
+#include <stdint.h>
+
+static const int32_t tribonaccif_value[ 31 ] = {
+	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
+};
+
+/**
+* Computes the nth Tribonacci number as a single-precision floating-point number.
+*
+* @param n     input value
+* @return      output value
+*
+* @example
+* float out = stdlib_base_tribonaccif( 1 );
+* // returns 0.0f
+*/
+float stdlib_base_tribonaccif( const int32_t n ) {
+	if ( n < 0 || n > STDLIB_CONSTANT_FLOAT32_MAX_SAFE_NTH_TRIBONACCI ) {
+		return 0.0f / 0.0f; // NaN
+	}
+	return tribonaccif_value[ n ];
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.js
new file mode 100644
index 000000000000..bf9cf313945b
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.js
@@ -0,0 +1,91 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var tape = require( 'tape' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var PINF = require( '@stdlib/constants/float32/pinf' );
+var tribonaccif = require( './../lib' );
+
+
+// FIXTURES //
+
+var TRIBONACCIF = require( './../lib/tribonaccif.json' );
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof tribonaccif, 'function', 'main export is a function' );
+	t.end();
+});
+
+tape( 'if provided a negative number, the function returns `NaN`', function test( t ) {
+	var v;
+	var i;
+
+	t.strictEqual( isnanf( tribonaccif( -3.14 ) ), true, 'returns expected value' );
+
+	for ( i = -1; i > -100; i-- ) {
+		v = tribonaccif( i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	}
+	t.end();
+});
+
+tape( 'if provided positive infinity, the function returns `NaN`', function test( t ) {
+	var v = tribonaccif( PINF );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'if provided `NaN`, the function returns `NaN`', function test( t ) {
+	var v = tribonaccif( NaN );
+	t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	t.end();
+});
+
+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' );
+	t.end();
+});
+
+tape( 'the function returns the nth Tribonacci number', function test( t ) {
+	var v;
+	var i;
+	for ( i = 0; i < 31; i++ ) {
+		v = tribonaccif( i );
+		t.strictEqual( v, TRIBONACCIF[ i ], 'returns expected value' );
+	}
+	t.end();
+});
+
+tape( 'if provided nonnegative integers greater than `30`, the function returns `NaN`', function test( t ) {
+	var i;
+	var v;
+	for ( i = 31; i < 100; i++ ) {
+		v = tribonaccif( i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	}
+	t.end();
+});
diff --git a/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.native.js b/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.native.js
new file mode 100644
index 000000000000..5d421ac28be1
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/tribonaccif/test/test.native.js
@@ -0,0 +1,79 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var resolve = require( 'path' ).resolve;
+var tape = require( 'tape' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+
+
+// FIXTURES //
+
+var TRIBONACCIF = require( './../lib/tribonaccif.json' );
+
+
+// VARIABLES //
+
+var tribonaccif = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var opts = {
+	'skip': ( tribonaccif instanceof Error )
+};
+
+
+// TESTS //
+
+tape( 'main export is a function', opts, function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof tribonaccif, 'function', 'main export is a function' );
+	t.end();
+});
+
+tape( 'if provided a negative number, the function returns `NaN`', opts, function test( t ) {
+	var v;
+	var i;
+
+	for ( i = -1; i > -100; i-- ) {
+		v = tribonaccif( i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	}
+	t.end();
+});
+
+tape( 'the function returns the nth Tribonacci number', opts, function test( t ) {
+	var v;
+	var i;
+	for ( i = 0; i < 31; i++ ) {
+		v = tribonaccif( i );
+		t.strictEqual( v, TRIBONACCIF[ i ], 'returns expected value' );
+	}
+	t.end();
+});
+
+tape( 'if provided nonnegative integers greater than `30`, the function returns `NaN`', opts, function test( t ) {
+	var i;
+	var v;
+	for ( i = 31; i < 100; i++ ) {
+		v = tribonaccif( i );
+		t.strictEqual( isnanf( v ), true, 'returns expected value' );
+	}
+	t.end();
+});