From b7443dee6b050b304505009eef365cf5a6e38b62 Mon Sep 17 00:00:00 2001
From: GUNJ JOSHI <gunjjoshi8372@gmail.com>
Date: Sun, 11 Aug 2024 09:37:56 +0530
Subject: [PATCH 1/5] feat: add C implementation for math/base/special/besselj0

---
 .../math/base/special/besselj0/README.md      |  88 +++++
 .../besselj0/benchmark/benchmark.native.js    |  60 +++
 .../besselj0/benchmark/c/native/Makefile      | 146 ++++++++
 .../besselj0/benchmark/c/native/benchmark.c   | 133 +++++++
 .../math/base/special/besselj0/binding.gyp    | 170 +++++++++
 .../base/special/besselj0/examples/c/Makefile | 146 ++++++++
 .../special/besselj0/examples/c/example.c     |  31 ++
 .../math/base/special/besselj0/include.gypi   |  53 +++
 .../include/stdlib/math/base/special/j0.h     |  38 ++
 .../math/base/special/besselj0/lib/native.js  |  58 +++
 .../special/besselj0/lib/rational_p1q1.js     |   4 +-
 .../special/besselj0/lib/rational_p2q2.js     |   4 +-
 .../special/besselj0/lib/rational_pcqc.js     |   4 +-
 .../special/besselj0/lib/rational_psqs.js     |   4 +-
 .../math/base/special/besselj0/manifest.json  |  78 ++++
 .../special/besselj0/scripts/evalrational.js  |  60 +++
 .../math/base/special/besselj0/src/Makefile   |  70 ++++
 .../math/base/special/besselj0/src/addon.c    |  22 ++
 .../math/base/special/besselj0/src/main.c     | 274 ++++++++++++++
 .../math/base/special/besselj0/test/test.js   |   4 +-
 .../base/special/besselj0/test/test.native.js | 345 ++++++++++++++++++
 21 files changed, 1782 insertions(+), 10 deletions(-)
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/benchmark.native.js
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/Makefile
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/binding.gyp
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/Makefile
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/include.gypi
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/lib/native.js
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/manifest.json
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/src/Makefile
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
 create mode 100644 lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js

diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/README.md b/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
index 0442cd886482..0ce521175f3f 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
@@ -99,6 +99,94 @@ for ( i = 0; i < 100; i++ ) {
 
 <!-- /.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/j0.h"
+```
+
+#### stdlib_base_j0( x )
+
+Computes the [Bessel function of the first kind][bessel-first-kind] of order zero at `x`.
+
+```c
+double out = stdlib_base_j0( 0.0 );
+// returns 1.0
+
+out = stdlib_base_j0( 1.0 );
+// returns ~0.765
+```
+
+The function accepts the following arguments:
+
+-   **x**: `[in] double` input value.
+
+```c
+double stdlib_base_j0( const double x );
+```
+
+</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/j0.h"
+#include <stdio.h>
+
+int main( void ) {
+    const double x[] = { 0.0, 1.0, 2.0, 3.0, 4.0 };
+
+    double y;
+    int i;
+    for ( i = 0; i < 5; i++ ) {
+        y = stdlib_base_j0( x[ i ] );
+        printf( "besselj0(%lf) = %lf\n", x[ i ], y );
+    }
+}
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
 <!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
 
 <section class="related">
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/benchmark.native.js
new file mode 100644
index 000000000000..8e98bee0f578
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/benchmark.native.js
@@ -0,0 +1,60 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 randu = require( '@stdlib/random/base/randu' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var j0 = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var opts = {
+	'skip': ( j0 instanceof Error )
+};
+
+
+// MAIN //
+
+bench( pkg+'::native', opts, function benchmark( b ) {
+	var x;
+	var y;
+	var i;
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		x = ( randu() * 100000.0 ) - 0.0;
+		y = j0( x );
+		if ( isnan( y ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnan( y ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/Makefile b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/Makefile
new file mode 100644
index 000000000000..f69e9da2b4d3
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2024 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/besselj0/benchmark/c/native/benchmark.c b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
new file mode 100644
index 000000000000..5d72cc10fa21
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
@@ -0,0 +1,133 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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/j0.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include <time.h>
+#include <sys/time.h>
+
+#define NAME "besselj0"
+#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 double rand_double( void ) {
+	int r = rand();
+	return (double)r / ( (double)RAND_MAX + 1.0 );
+}
+
+/**
+* Runs a benchmark.
+*
+* @return elapsed time in seconds
+*/
+static double benchmark( void ) {
+	double elapsed;
+	double x;
+	double y;
+	double t;
+	int i;
+
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		x = ( 100000.0 * rand_double() ) - 0.0;
+		y = stdlib_base_j0( x );
+		if ( y != y ) {
+			printf( "should not return NaN\n" );
+			break;
+		}
+	}
+	elapsed = tic() - t;
+	if ( y != y ) {
+		printf( "should not return NaN\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/besselj0/binding.gyp b/lib/node_modules/@stdlib/math/base/special/besselj0/binding.gyp
new file mode 100644
index 000000000000..ec3992233442
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/binding.gyp
@@ -0,0 +1,170 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2024 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/besselj0/examples/c/Makefile b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/Makefile
new file mode 100644
index 000000000000..6aed70daf167
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/Makefile
@@ -0,0 +1,146 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2024 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/besselj0/examples/c/example.c b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
new file mode 100644
index 000000000000..1a6b51ede913
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
@@ -0,0 +1,31 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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/j0.h"
+#include <stdio.h>
+
+int main( void ) {
+	const double x[] = { 0.0, 1.0, 2.0, 3.0, 4.0 };
+
+	double y;
+	int i;
+	for ( i = 0; i < 5; i++ ) {
+		y = stdlib_base_j0( x[ i ] );
+		printf( "besselj0(%lf) = %lf\n", x[ i ], y );
+	}
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/include.gypi b/lib/node_modules/@stdlib/math/base/special/besselj0/include.gypi
new file mode 100644
index 000000000000..575cb043c0bf
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/include.gypi
@@ -0,0 +1,53 @@
+# @license Apache-2.0
+#
+# Copyright (c) 2024 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/besselj0/include/stdlib/math/base/special/j0.h b/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h
new file mode 100644
index 000000000000..cb3d10c2ae4a
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h
@@ -0,0 +1,38 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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_J0_H
+#define STDLIB_MATH_BASE_SPECIAL_J0_H
+
+/*
+* If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
+*/
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+* Computes the Bessel function of the first kind of order zero.
+*/
+double stdlib_base_j0( const double x );
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // !STDLIB_MATH_BASE_SPECIAL_J0_H
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/native.js b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/native.js
new file mode 100644
index 000000000000..d6d3ec2dc362
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/native.js
@@ -0,0 +1,58 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 Bessel function of the first kind of order zero.
+*
+* @private
+* @param {number} x - input value
+* @returns {number} evaluated Bessel function
+*
+* @example
+* var v = j0( 0.0 );
+* // returns 1.0
+*
+* v = j0( 1.0 );
+* // returns ~0.765
+*
+* v = j0( Infinity );
+* // returns 0.0
+*
+* v = j0( -Infinity );
+* // returns 0.0
+*
+* v = j0( NaN );
+* // returns NaN
+*/
+function j0( x ) {
+	return addon( x );
+}
+
+
+// EXPORTS //
+
+module.exports = j0;
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p1q1.js b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p1q1.js
index f898dec164a1..00d3e6f4a7b3 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p1q1.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p1q1.js
@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2022 The Stdlib Authors.
+* Copyright (c) 2024 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.
@@ -22,7 +22,7 @@
 // MAIN //
 
 /**
-* Evaluates a rational function, i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\).
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
 *
 * ## Notes
 *
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p2q2.js b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p2q2.js
index 458b298548b9..771589384831 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p2q2.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_p2q2.js
@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2022 The Stdlib Authors.
+* Copyright (c) 2024 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.
@@ -22,7 +22,7 @@
 // MAIN //
 
 /**
-* Evaluates a rational function, i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\).
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
 *
 * ## Notes
 *
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_pcqc.js b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_pcqc.js
index cea35c74fe59..23ccaabdee07 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_pcqc.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_pcqc.js
@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2022 The Stdlib Authors.
+* Copyright (c) 2024 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.
@@ -22,7 +22,7 @@
 // MAIN //
 
 /**
-* Evaluates a rational function, i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\).
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
 *
 * ## Notes
 *
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_psqs.js b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_psqs.js
index 419695f3606a..1e329a58c4b9 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_psqs.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/lib/rational_psqs.js
@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2022 The Stdlib Authors.
+* Copyright (c) 2024 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.
@@ -22,7 +22,7 @@
 // MAIN //
 
 /**
-* Evaluates a rational function, i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\).
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
 *
 * ## Notes
 *
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/manifest.json b/lib/node_modules/@stdlib/math/base/special/besselj0/manifest.json
new file mode 100644
index 000000000000..8c198997bb6b
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/manifest.json
@@ -0,0 +1,78 @@
+{
+  "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/math/base/special/sqrt",
+        "@stdlib/math/base/special/sincos",
+        "@stdlib/constants/float64/pinf"
+      ]
+    },
+    {
+      "task": "benchmark",
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/math/base/special/sqrt",
+        "@stdlib/math/base/special/sincos",
+        "@stdlib/constants/float64/pinf"
+      ]
+    },
+    {
+      "task": "examples",
+      "src": [
+        "./src/main.c"
+      ],
+      "include": [
+        "./include"
+      ],
+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/math/base/special/sqrt",
+        "@stdlib/math/base/special/sincos",
+        "@stdlib/constants/float64/pinf"
+      ]
+    }
+  ]
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/scripts/evalrational.js b/lib/node_modules/@stdlib/math/base/special/besselj0/scripts/evalrational.js
index 0d3797221a04..2739c1a7a9d3 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/scripts/evalrational.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/scripts/evalrational.js
@@ -24,10 +24,15 @@
 // MODULES //
 
 var resolve = require( 'path' ).resolve;
+var readFileSync = require( '@stdlib/fs/read-file' ).sync;
 var writeFileSync = require( '@stdlib/fs/write-file' ).sync;
 var currentYear = require( '@stdlib/time/current-year' );
 var licenseHeader = require( '@stdlib/_tools/licenses/header' );
 var compile = require( '@stdlib/math/base/tools/evalrational-compile' );
+var compileC = require( '@stdlib/math/base/tools/evalrational-compile-c' );
+var substringBefore = require( '@stdlib/string/substring-before' );
+var substringAfter = require( '@stdlib/string/substring-after' );
+var format = require( '@stdlib/string/format' );
 
 
 // VARIABLES //
@@ -119,6 +124,33 @@ var header = licenseHeader( 'Apache-2.0', 'js', {
 header += '\n/* This is a generated file. Do not edit directly. */\n';
 
 
+// FUNCTIONS //
+
+/**
+* Inserts a compiled function into file content.
+*
+* @private
+* @param {string} text - source content
+* @param {string} id - function identifier
+* @param {string} str - function string
+* @returns {string} updated content
+*/
+function insert( text, id, str ) {
+	var before;
+	var after;
+	var begin;
+	var end;
+
+	begin = '// BEGIN: '+id;
+	end = '// END: '+id;
+
+	before = substringBefore( text, begin );
+	after = substringAfter( text, end );
+
+	return format( '%s// BEGIN: %s\n\n%s\n%s%s', before, id, str, end, after );
+}
+
+
 // MAIN //
 
 /**
@@ -128,7 +160,9 @@ header += '\n/* This is a generated file. Do not edit directly. */\n';
 */
 function main() {
 	var fpath;
+	var copts;
 	var opts;
+	var file;
 	var str;
 
 	opts = {
@@ -150,6 +184,32 @@ function main() {
 	fpath = resolve( __dirname, '..', 'lib', 'rational_psqs.js' );
 	str = header + compile( PS, QS );
 	writeFileSync( fpath, str, opts );
+
+	copts = {
+		'dtype': 'double',
+		'name': ''
+	};
+
+	fpath = resolve( __dirname, '..', 'src', 'main.c' );
+	file = readFileSync( fpath, opts );
+
+	copts.name = 'rational_p1q1';
+	str = compileC( P1, Q1, copts );
+	file = insert( file, copts.name, str );
+
+	copts.name = 'rational_p2q2';
+	str = compileC( P2, Q2, copts );
+	file = insert( file, copts.name, str );
+
+	copts.name = 'rational_pcqc';
+	str = compileC( PC, QC, copts );
+	file = insert( file, copts.name, str );
+
+	copts.name = 'rational_psqs';
+	str = compileC( PS, QS, copts );
+	file = insert( file, copts.name, str );
+
+	writeFileSync( fpath, file, opts );
 }
 
 main();
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/src/Makefile b/lib/node_modules/@stdlib/math/base/special/besselj0/src/Makefile
new file mode 100644
index 000000000000..bcf18aa46655
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/Makefile
@@ -0,0 +1,70 @@
+#/
+# @license Apache-2.0
+#
+# Copyright (c) 2024 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/besselj0/src/addon.c b/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
new file mode 100644
index 000000000000..f0a212c2b444
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
@@ -0,0 +1,22 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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/j0.h"
+#include "stdlib/math/base/napi/unary.h"
+
+STDLIB_MATH_BASE_NAPI_MODULE_D_D( stdlib_base_j0 )
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
new file mode 100644
index 000000000000..cccd9ad1c705
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
@@ -0,0 +1,274 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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.
+*
+*
+* ## Notice
+*
+* The original C++ code and copyright notice are from the [Boost library]{@link https://github.com/boostorg/math/blob/develop/include/boost/math/special_functions/detail/bessel_j0.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright Xiaogang Zhang, 2006.
+*
+* Use, modification and distribution are subject to the
+* Boost Software License, Version 1.0. (See accompanying file
+* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
+* ```
+*/
+
+#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/sqrt.h"
+#include "stdlib/math/base/special/sincos.h"
+#include "stdlib/constants/float64/pinf.h"
+
+static const double ONE_DIV_SQRT_PI = 0.5641895835477563;
+static const double x1 = 2.4048255576957727686e+00;
+static const double x2 = 5.5200781102863106496e+00;
+static const double x11 = 6.160e+02;
+static const double x12 = -1.42444230422723137837e-03;
+static const double x21 = 1.4130e+03;
+static const double x22 = 5.46860286310649596604e-04;
+
+/* Begin auto-generated functions. The following functions are auto-generated. Do not edit directly. */
+
+// BEGIN: rational_p1q1
+
+/**
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
+*
+* ## Notes
+*
+* -   Coefficients should be sorted in ascending degree.
+* -   The implementation uses [Horner's rule][horners-method] for efficient computation.
+*
+* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method
+*
+* @param x    value at which to evaluate the rational function
+* @return     evaluated rational function
+*/
+static double rational_p1q1( const double x ) {
+	double ax;
+	double ix;
+	double s1;
+	double s2;
+	if ( x == 0.0 ) {
+		return -0.17291506903064494;
+	}
+	if ( x < 0.0 ) {
+		ax = -x;
+	} else {
+		ax = x;
+	}
+	if ( ax <= 1.0 ) {
+		s1 = -412986685009.9087 + (x * (27282507878.60594 + (x * (-621407004.2354012 + (x * (6630299.79048338 + (x * (-36629.81465510709 + (x * (103.44222815443189 + (x * -0.12117036164593528)))))))))));
+		s2 = 2388378799633.229 + (x * (26328198300.85965 + (x * (139850973.72263435 + (x * (456126.9622421994 + (x * (936.1402239233771 + (x * (1.0 + (x * 0.0)))))))))));
+	} else {
+		ix = 1.0 / x;
+		s1 = -0.12117036164593528 + (ix * (103.44222815443189 + (ix * (-36629.81465510709 + (ix * (6630299.79048338 + (ix * (-621407004.2354012 + (ix * (27282507878.60594 + (ix * -412986685009.9087)))))))))));
+		s2 = 0.0 + (ix * (1.0 + (ix * (936.1402239233771 + (ix * (456126.9622421994 + (ix * (139850973.72263435 + (ix * (26328198300.85965 + (ix * 2388378799633.229)))))))))));
+	}
+	return s1 / s2;
+}
+
+// END: rational_p1q1
+
+// BEGIN: rational_p2q2
+
+/**
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
+*
+* ## Notes
+*
+* -   Coefficients should be sorted in ascending degree.
+* -   The implementation uses [Horner's rule][horners-method] for efficient computation.
+*
+* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method
+*
+* @param x    value at which to evaluate the rational function
+* @return     evaluated rational function
+*/
+static double rational_p2q2( const double x ) {
+	double ax;
+	double ix;
+	double s1;
+	double s2;
+	if ( x == 0.0 ) {
+		return 0.005119512965174424;
+	}
+	if ( x < 0.0 ) {
+		ax = -x;
+	} else {
+		ax = x;
+	}
+	if ( ax <= 1.0 ) {
+		s1 = -1831.9397969392085 + (x * (-12254.07816137899 + (x * (-7287.970246446462 + (x * (10341.910641583727 + (x * (11725.046279757104 + (x * (4417.670702532509 + (x * (743.2119668062425 + (x * 48.5917033559165)))))))))))));
+		s2 = -357834.78026152303 + (x * (245991.0226258631 + (x * (-84055.06259116957 + (x * (18680.99000835919 + (x * (-2945.876654550934 + (x * (333.07310774649073 + (x * (-25.258076240801554 + (x * 1.0)))))))))))));
+	} else {
+		ix = 1.0 / x;
+		s1 = 48.5917033559165 + (ix * (743.2119668062425 + (ix * (4417.670702532509 + (ix * (11725.046279757104 + (ix * (10341.910641583727 + (ix * (-7287.970246446462 + (ix * (-12254.07816137899 + (ix * -1831.9397969392085)))))))))))));
+		s2 = 1.0 + (ix * (-25.258076240801554 + (ix * (333.07310774649073 + (ix * (-2945.876654550934 + (ix * (18680.99000835919 + (ix * (-84055.06259116957 + (ix * (245991.0226258631 + (ix * -357834.78026152303)))))))))))));
+	}
+	return s1 / s2;
+}
+
+// END: rational_p2q2
+
+// BEGIN: rational_pcqc
+
+/**
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
+*
+* ## Notes
+*
+* -   Coefficients should be sorted in ascending degree.
+* -   The implementation uses [Horner's rule][horners-method] for efficient computation.
+*
+* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method
+*
+* @param x    value at which to evaluate the rational function
+* @return     evaluated rational function
+*/
+static double rational_pcqc( const double x ) {
+	double ax;
+	double ix;
+	double s1;
+	double s2;
+	if ( x == 0.0 ) {
+		return 1.0;
+	}
+	if ( x < 0.0 ) {
+		ax = -x;
+	} else {
+		ax = x;
+	}
+	if ( ax <= 1.0 ) {
+		s1 = 22779.090197304686 + (x * (41345.38663958076 + (x * (21170.523380864943 + (x * (3480.648644324927 + (x * (153.76201909008356 + (x * 0.8896154842421046)))))))));
+		s2 = 22779.090197304686 + (x * (41370.41249551042 + (x * (21215.350561880117 + (x * (3502.8735138235606 + (x * (157.11159858080893 + (x * 1.0)))))))));
+	} else {
+		ix = 1.0 / x;
+		s1 = 0.8896154842421046 + (ix * (153.76201909008356 + (ix * (3480.648644324927 + (ix * (21170.523380864943 + (ix * (41345.38663958076 + (ix * 22779.090197304686)))))))));
+		s2 = 1.0 + (ix * (157.11159858080893 + (ix * (3502.8735138235606 + (ix * (21215.350561880117 + (ix * (41370.41249551042 + (ix * 22779.090197304686)))))))));
+	}
+	return s1 / s2;
+}
+
+// END: rational_pcqc
+
+// BEGIN: rational_psqs
+
+/**
+* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\(P\\) and \\(Q\\)).
+*
+* ## Notes
+*
+* -   Coefficients should be sorted in ascending degree.
+* -   The implementation uses [Horner's rule][horners-method] for efficient computation.
+*
+* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method
+*
+* @param x    value at which to evaluate the rational function
+* @return     evaluated rational function
+*/
+static double rational_psqs( const double x ) {
+	double ax;
+	double ix;
+	double s1;
+	double s2;
+	if ( x == 0.0 ) {
+		return -0.015625;
+	}
+	if ( x < 0.0 ) {
+		ax = -x;
+	} else {
+		ax = x;
+	}
+	if ( ax <= 1.0 ) {
+		s1 = -89.22660020080009 + (x * (-185.91953644342993 + (x * (-111.83429920482737 + (x * (-22.300261666214197 + (x * (-1.244102674583564 + (x * -0.008803330304868075)))))))));
+		s2 = 5710.502412851206 + (x * (11951.131543434614 + (x * (7264.278016921102 + (x * (1488.7231232283757 + (x * (90.59376959499312 + (x * 1.0)))))))));
+	} else {
+		ix = 1.0 / x;
+		s1 = -0.008803330304868075 + (ix * (-1.244102674583564 + (ix * (-22.300261666214197 + (ix * (-111.83429920482737 + (ix * (-185.91953644342993 + (ix * -89.22660020080009)))))))));
+		s2 = 1.0 + (ix * (90.59376959499312 + (ix * (1488.7231232283757 + (ix * (7264.278016921102 + (ix * (11951.131543434614 + (ix * 5710.502412851206)))))))));
+	}
+	return s1 / s2;
+}
+
+// END: rational_psqs
+
+/* End auto-generated functions. */
+
+/**
+* Computes the Bessel function of the first kind of order zero.
+*
+* @param x    input value
+* @return     evaluated Bessel function
+*
+* @example
+* double y = stdlib_base_j0( 0.0 );
+* // returns 1.0
+*/
+double stdlib_base_j0( const double x ) {
+	double rc;
+	double rs;
+	double y2;
+	double xc;
+	double r;
+	double y;
+	double f;
+	double s;
+	double c;
+
+	xc = x;
+	if ( xc < 0 ) {
+		xc = -xc;
+	}
+	if ( xc == STDLIB_CONSTANT_FLOAT64_PINF ) {
+		return 0.0;
+	}
+	if ( xc == 0.0 ) {
+		return 1.0;
+	}
+	if ( xc <= 4.0 ) {
+		y = xc * xc;
+		r = rational_p1q1( y );
+		f = ( xc + x1 ) * ( ( xc - ( x11 / 256.0 ) ) - x12 );
+		return f * r;
+	}
+	if ( xc <= 8.0 ) {
+		y = 1.0 - ( ( xc * xc ) / 64.0 );
+		r = rational_p2q2( y );
+		f = ( xc + x2 ) * ( ( xc - ( x21 / 256.0 ) ) - x22 );
+		return f * r;
+	}
+	y = 8.0 / xc;
+	y2 = y * y;
+	rc = rational_pcqc( y2 );
+	rs = rational_psqs( y2 );
+	f = ONE_DIV_SQRT_PI / stdlib_base_sqrt( xc );
+
+	/*
+	* What follows is really just:
+	*
+	* ```
+	* var z = x - pi/4;
+	* return f * (rc * cos(z) - y * rs * sin(z));
+	* ```
+	*
+	* But using the addition formulae for sin and cos, plus the special values for sin/cos of `π/4`.
+	*/
+	stdlib_base_sincos( xc, &s, &c );
+	return f * ( ( rc * ( c + s ) ) - ( ( y * rs ) * ( s - c ) ) );
+}
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
index 5ce97679d8e0..d847a5da09f1 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
@@ -138,7 +138,7 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
-			tol = 130.0 * EPS * abs( expected[i] );
+			tol = 131.4 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}
 	}
@@ -161,7 +161,7 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
-			tol = 130.0 * EPS * abs( expected[i] );
+			tol = 131.4 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}
 	}
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js
new file mode 100644
index 000000000000..20681a0fe683
--- /dev/null
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js
@@ -0,0 +1,345 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 isnan = require( '@stdlib/math/base/assert/is-nan' );
+var randu = require( '@stdlib/random/base/randu' );
+var PINF = require( '@stdlib/constants/float64/pinf' );
+var NINF = require( '@stdlib/constants/float64/ninf' );
+var EPS = require( '@stdlib/constants/float64/eps' );
+var abs = require( '@stdlib/math/base/special/abs' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+
+
+// VARIABLES //
+
+var j0 = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var opts = {
+	'skip': ( j0 instanceof Error )
+};
+
+
+// FIXTURES //
+
+var hugePositive = require( './fixtures/julia/huge_positive.json' );
+var veryLargePositive = require( './fixtures/julia/very_large_positive.json' );
+var largePositive = require( './fixtures/julia/large_positive.json' );
+var mediumPositive = require( './fixtures/julia/medium_positive.json' );
+var smallPositive = require( './fixtures/julia/small_positive.json' );
+var smallNegative = require( './fixtures/julia/small_negative.json' );
+var positiveGamut = require( './fixtures/julia/positive_gamut.json' );
+var negativeGamut = require( './fixtures/julia/negative_gamut.json' );
+var smaller = require( './fixtures/julia/smaller.json' );
+var tinyPositive = require( './fixtures/julia/tiny_positive.json' );
+var subnormal = require( './fixtures/julia/subnormal.json' );
+
+
+// TESTS //
+
+tape( 'main export is a function', opts, function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof j0, 'function', 'main export is a function' );
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (very large positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = veryLargePositive.expected;
+	x = veryLargePositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 800.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (large positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = largePositive.expected;
+	x = largePositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 1450.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (medium positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = mediumPositive.expected;
+	x = mediumPositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 500.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (small positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = smallPositive.expected;
+	x = smallPositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 131.4 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (small negative values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = smallNegative.expected;
+	x = smallNegative.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 131.4 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates Bessel function of the first kind of zero order (J_0) (smaller values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = smaller.expected;
+	x = smaller.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 2.5 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (tiny positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = tinyPositive.expected;
+	x = tinyPositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (subnormal values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = subnormal.expected;
+	x = subnormal.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of zero order (J_0) (huge positive values)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = hugePositive.expected;
+	x = hugePositive.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 900.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of order zero (J_0) (positive values over a wide range of magnitudes)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = positiveGamut.expected;
+	x = positiveGamut.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 16.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function evaluates the Bessel function of the first kind of order zero (J_0) (negative values over a wide range of magnitudes)', opts, function test( t ) {
+	var expected;
+	var delta;
+	var tol;
+	var x;
+	var y;
+	var i;
+
+	expected = negativeGamut.expected;
+	x = negativeGamut.x;
+	for ( i = 0; i < x.length; i++ ) {
+		y = j0( x[i] );
+		if ( y === expected[i] ) {
+			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
+		} else {
+			delta = abs( y - expected[i] );
+			tol = 16.0 * EPS * abs( expected[i] );
+			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
+		}
+	}
+	t.end();
+});
+
+tape( 'the function is an even function (f(x) = f(-x))', opts, function test( t ) {
+	var x;
+	var i;
+
+	for ( i = 0; i < 1000; i++ ) {
+		x = randu() * 100.0;
+		t.strictEqual( j0( x ), j0( -x ), 'returns same value for +-'+x );
+	}
+	t.end();
+});
+
+tape( 'the function returns `NaN` if provided `NaN`', opts, function test( t ) {
+	var v = j0( NaN );
+	t.equal( isnan( v ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'the function returns `0.0` if provided `+infinity`', opts, function test( t ) {
+	var v = j0( NINF );
+	t.equal( v, 0.0, 'returns 0.0' );
+	t.end();
+});
+
+tape( 'the function returns `0.0` if provided `-infinity`', opts, function test( t ) {
+	var v = j0( PINF );
+	t.equal( v, 0.0, 'returns 0.0' );
+	t.end();
+});

From 8970665be3c5263ff59863b105bab0d3983c0e1d Mon Sep 17 00:00:00 2001
From: Gunj Joshi <gunjjoshi8372@gmail.com>
Date: Sun, 11 Aug 2024 11:04:49 +0530
Subject: [PATCH 2/5] revert changes in test.js tolerance levels

Signed-off-by: Gunj Joshi <gunjjoshi8372@gmail.com>
---
 .../@stdlib/math/base/special/besselj0/test/test.js           | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
index d847a5da09f1..5ce97679d8e0 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.js
@@ -138,7 +138,7 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
-			tol = 131.4 * EPS * abs( expected[i] );
+			tol = 130.0 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}
 	}
@@ -161,7 +161,7 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
-			tol = 131.4 * EPS * abs( expected[i] );
+			tol = 130.0 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}
 	}

From d494f0b21fca9369df736f7fc7513dccbc772e40 Mon Sep 17 00:00:00 2001
From: Gunj Joshi <gunjjoshi8372@gmail.com>
Date: Sun, 11 Aug 2024 11:07:55 +0530
Subject: [PATCH 3/5] docs: add comment for different tolerance levels in
 test.native.js

Signed-off-by: Gunj Joshi <gunjjoshi8372@gmail.com>
---
 .../@stdlib/math/base/special/besselj0/test/test.native.js    | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js
index 20681a0fe683..b9a9f5327f35 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/test/test.native.js
@@ -147,6 +147,8 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
+
+			// NOTE: the tolerance here is larger than for the JavaScript implementation due to compiler optimizations which may be performed resulting in result divergence. For discussion, see https://github.com/stdlib-js/stdlib/pull/2774#discussion_r1712904184
 			tol = 131.4 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}
@@ -170,6 +172,8 @@ tape( 'the function evaluates the Bessel function of the first kind of zero orde
 			t.equal( y, expected[i], 'x: '+x[i]+', y: '+y+', expected: '+expected[i] );
 		} else {
 			delta = abs( y - expected[i] );
+
+			// NOTE: the tolerance here is larger than for the JavaScript implementation due to compiler optimizations which may be performed resulting in result divergence. For discussion, see https://github.com/stdlib-js/stdlib/pull/2774#discussion_r1712904184
 			tol = 131.4 * EPS * abs( expected[i] );
 			t.equal( delta <= tol, true, 'within tolerance. x: '+x[i]+'. y: '+y+'. E: '+expected[i]+'. Δ: '+delta+'. tol: '+tol+'.' );
 		}

From 6d951c2915e7296624692a9e7132253750a83b45 Mon Sep 17 00:00:00 2001
From: GUNJ JOSHI <gunjjoshi8372@gmail.com>
Date: Sun, 11 Aug 2024 16:19:05 +0530
Subject: [PATCH 4/5] docs: update function name for C implementation from j0
 to besselj0

---
 .../@stdlib/math/base/special/besselj0/README.md   | 14 +++++++-------
 .../besselj0/benchmark/c/native/benchmark.c        |  4 ++--
 .../base/special/besselj0/examples/c/example.c     |  4 ++--
 .../stdlib/math/base/special/{j0.h => besselj0.h}  |  8 ++++----
 .../@stdlib/math/base/special/besselj0/src/addon.c |  4 ++--
 .../@stdlib/math/base/special/besselj0/src/main.c  |  6 +++---
 6 files changed, 20 insertions(+), 20 deletions(-)
 rename lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/{j0.h => besselj0.h} (83%)

diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/README.md b/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
index 0ce521175f3f..0355c576eb03 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/README.md
@@ -122,18 +122,18 @@ for ( i = 0; i < 100; i++ ) {
 ### Usage
 
 ```c
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 ```
 
-#### stdlib_base_j0( x )
+#### stdlib_base_besselj0( x )
 
 Computes the [Bessel function of the first kind][bessel-first-kind] of order zero at `x`.
 
 ```c
-double out = stdlib_base_j0( 0.0 );
+double out = stdlib_base_besselj0( 0.0 );
 // returns 1.0
 
-out = stdlib_base_j0( 1.0 );
+out = stdlib_base_besselj0( 1.0 );
 // returns ~0.765
 ```
 
@@ -142,7 +142,7 @@ The function accepts the following arguments:
 -   **x**: `[in] double` input value.
 
 ```c
-double stdlib_base_j0( const double x );
+double stdlib_base_besselj0( const double x );
 ```
 
 </section>
@@ -164,7 +164,7 @@ double stdlib_base_j0( const double x );
 ### Examples
 
 ```c
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 #include <stdio.h>
 
 int main( void ) {
@@ -173,7 +173,7 @@ int main( void ) {
     double y;
     int i;
     for ( i = 0; i < 5; i++ ) {
-        y = stdlib_base_j0( x[ i ] );
+        y = stdlib_base_besselj0( x[ i ] );
         printf( "besselj0(%lf) = %lf\n", x[ i ], y );
     }
 }
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
index 5d72cc10fa21..fb6e255fb836 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/benchmark/c/native/benchmark.c
@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 #include <stdlib.h>
 #include <stdio.h>
 #include <math.h>
@@ -99,7 +99,7 @@ static double benchmark( void ) {
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
 		x = ( 100000.0 * rand_double() ) - 0.0;
-		y = stdlib_base_j0( x );
+		y = stdlib_base_besselj0( x );
 		if ( y != y ) {
 			printf( "should not return NaN\n" );
 			break;
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
index 1a6b51ede913..988b822009e8 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/examples/c/example.c
@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 #include <stdio.h>
 
 int main( void ) {
@@ -25,7 +25,7 @@ int main( void ) {
 	double y;
 	int i;
 	for ( i = 0; i < 5; i++ ) {
-		y = stdlib_base_j0( x[ i ] );
+		y = stdlib_base_besselj0( x[ i ] );
 		printf( "besselj0(%lf) = %lf\n", x[ i ], y );
 	}
 }
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h b/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/besselj0.h
similarity index 83%
rename from lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h
rename to lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/besselj0.h
index cb3d10c2ae4a..5ef7121b6f8c 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/j0.h
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/include/stdlib/math/base/special/besselj0.h
@@ -16,8 +16,8 @@
 * limitations under the License.
 */
 
-#ifndef STDLIB_MATH_BASE_SPECIAL_J0_H
-#define STDLIB_MATH_BASE_SPECIAL_J0_H
+#ifndef STDLIB_MATH_BASE_SPECIAL_BESSELJ0_H
+#define STDLIB_MATH_BASE_SPECIAL_BESSELJ0_H
 
 /*
 * If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
@@ -29,10 +29,10 @@ extern "C" {
 /**
 * Computes the Bessel function of the first kind of order zero.
 */
-double stdlib_base_j0( const double x );
+double stdlib_base_besselj0( const double x );
 
 #ifdef __cplusplus
 }
 #endif
 
-#endif // !STDLIB_MATH_BASE_SPECIAL_J0_H
+#endif // !STDLIB_MATH_BASE_SPECIAL_BESSELJ0_H
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c b/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
index f0a212c2b444..d3dbba1c2074 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/addon.c
@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 #include "stdlib/math/base/napi/unary.h"
 
-STDLIB_MATH_BASE_NAPI_MODULE_D_D( stdlib_base_j0 )
+STDLIB_MATH_BASE_NAPI_MODULE_D_D( stdlib_base_besselj0 )
diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
index cccd9ad1c705..cda3e152cb78 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
@@ -29,7 +29,7 @@
 * ```
 */
 
-#include "stdlib/math/base/special/j0.h"
+#include "stdlib/math/base/special/besselj0.h"
 #include "stdlib/math/base/special/sqrt.h"
 #include "stdlib/math/base/special/sincos.h"
 #include "stdlib/constants/float64/pinf.h"
@@ -217,10 +217,10 @@ static double rational_psqs( const double x ) {
 * @return     evaluated Bessel function
 *
 * @example
-* double y = stdlib_base_j0( 0.0 );
+* double y = stdlib_base_besselj0( 0.0 );
 * // returns 1.0
 */
-double stdlib_base_j0( const double x ) {
+double stdlib_base_besselj0( const double x ) {
 	double rc;
 	double rs;
 	double y2;

From c6ddc03400d4f267c0b0df66d643c5fd69d7f45a Mon Sep 17 00:00:00 2001
From: Gunj Joshi <gunjjoshi8372@gmail.com>
Date: Sun, 11 Aug 2024 21:14:46 +0530
Subject: [PATCH 5/5] Update
 lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c

Co-authored-by: Philipp Burckhardt <pburckhardt@outlook.com>
Signed-off-by: Gunj Joshi <gunjjoshi8372@gmail.com>
---
 lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
index cda3e152cb78..47ddf5b87227 100644
--- a/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
+++ b/lib/node_modules/@stdlib/math/base/special/besselj0/src/main.c
@@ -18,7 +18,7 @@
 *
 * ## Notice
 *
-* The original C++ code and copyright notice are from the [Boost library]{@link https://github.com/boostorg/math/blob/develop/include/boost/math/special_functions/detail/bessel_j0.hpp}. The implementation has been modified for JavaScript.
+* The original C++ code and copyright notice are from the [Boost library]{@link https://www.boost.org/doc/libs/1_85_0/boost/math/special_functions/detail/bessel_j0.hpp}. The implementation has been modified for use in stdlib.
 *
 * ```text
 * Copyright Xiaogang Zhang, 2006.