From 39d03272aca42366767c8df6afbb2ba7768c519c Mon Sep 17 00:00:00 2001 From: Aman Bhansali <92033532+aman-095@users.noreply.github.com> Date: Fri, 15 Mar 2024 15:19:18 +0530 Subject: [PATCH] feat: add C implementation for `math/base/assert/is-prime` PR-URL: https://github.com/stdlib-js/stdlib/pull/1866 Co-authored-by: Athan Reines Reviewed-by: Athan Reines Signed-off-by: Athan Reines --- .../math/base/assert/is-prime/README.md | 91 ++++++++++ .../is-prime/benchmark/benchmark.native.js | 57 ++++++ .../is-prime/benchmark/c/native/Makefile | 146 +++++++++++++++ .../is-prime/benchmark/c/native/benchmark.c | 137 ++++++++++++++ .../math/base/assert/is-prime/binding.gyp | 170 ++++++++++++++++++ .../base/assert/is-prime/examples/c/Makefile | 146 +++++++++++++++ .../base/assert/is-prime/examples/c/example.c | 32 ++++ .../math/base/assert/is-prime/include.gypi | 53 ++++++ .../stdlib/math/base/assert/is_prime.h | 40 +++++ .../math/base/assert/is-prime/lib/native.js | 51 ++++++ .../math/base/assert/is-prime/manifest.json | 42 +++++ .../math/base/assert/is-prime/src/Makefile | 70 ++++++++ .../math/base/assert/is-prime/src/addon.c | 91 ++++++++++ .../math/base/assert/is-prime/src/main.c | 139 ++++++++++++++ .../base/assert/is-prime/test/test.native.js | 137 ++++++++++++++ 15 files changed, 1402 insertions(+) create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/benchmark.native.js create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/Makefile create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/benchmark.c create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/binding.gyp create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/examples/c/Makefile create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/examples/c/example.c create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/include.gypi create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/include/stdlib/math/base/assert/is_prime.h create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/lib/native.js create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/manifest.json create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/src/Makefile create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/src/addon.c create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/src/main.c create mode 100644 lib/node_modules/@stdlib/math/base/assert/is-prime/test/test.native.js diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/README.md b/lib/node_modules/@stdlib/math/base/assert/is-prime/README.md index 518c4a34647..c6de58a6fdd 100644 --- a/lib/node_modules/@stdlib/math/base/assert/is-prime/README.md +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/README.md @@ -80,6 +80,97 @@ bool = isPrime( NaN ); + + +* * * + +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/math/base/assert/is_prime.h" +``` + +#### stdlib_base_is_prime( x ) + +Tests if a finite double-precision floating-point number is a prime number. + +```c +#include + +bool out = stdlib_base_is_prime( 11.0 ); +// returns true + +out = stdlib_base_is_prime( 3.14 ); +// returns false +``` + +The function accepts the following arguments: + +- **x**: `[in] double` input value. + +```c +bool stdlib_base_is_prime( const double x ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/math/base/assert/is_prime.h" +#include +#include + +int main( void ) { + const double x[] = { 5.0, -5.0, 3.14, -3.14, -2.0, 2.0, 0.0, 0.0/0.0 }; + + bool b; + int i; + for ( i = 0; i < 6; i++ ) { + b = stdlib_base_is_prime( x[ i ] ); + printf( "Value: %lf. Is Prime? %s.\n", x[ i ], ( b ) ? "True" : "False" ); + } +} +``` + +
+ + + +
+ + +
diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/benchmark.native.js new file mode 100644 index 00000000000..b12735ae65d --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/benchmark.native.js @@ -0,0 +1,57 @@ +/** +* @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 isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive; +var tryRequire = require( '@stdlib/utils/try-require' ); +var pkg = require( './../package.json' ).name; + + +// VARIABLES // + +var isPrime = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( isPrime instanceof Error ) +}; + + +// MAIN // + +bench( pkg+'::native', opts, function benchmark( b ) { + var bool; + var i; + + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + bool = isPrime( i+1 ); + if ( typeof bool !== 'boolean' ) { + b.fail( 'should return a boolean' ); + } + } + b.toc(); + if ( !isBoolean( bool ) ) { + b.fail( 'should return a boolean' ); + } + b.pass( 'benchmark finished' ); + b.end(); +}); diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/Makefile b/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/Makefile new file mode 100644 index 00000000000..f69e9da2b4d --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/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/assert/is-prime/benchmark/c/native/benchmark.c b/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/benchmark.c new file mode 100644 index 00000000000..3d9cf31be00 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/benchmark/c/native/benchmark.c @@ -0,0 +1,137 @@ +/** +* @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. +*/ + +/** +* Benchmark `is-prime`. +*/ +#include "stdlib/math/base/assert/is_prime.h" +#include +#include +#include +#include +#include +#include + +#define NAME "is-prime" +#define ITERATIONS 1000000 +#define REPEATS 3 + +/** +* Prints the TAP version. +*/ +void print_version() { + printf( "TAP version 13\n" ); +} + +/** +* Prints the TAP summary. +* +* @param total total number of tests +* @param passing total number of passing tests +*/ +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 +*/ +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 +*/ +double tic() { + 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 +*/ +double rand_double() { + int r = rand(); + return (double)r / ( (double)RAND_MAX + 1.0 ); +} + +/** +* Runs a benchmark. +* +* @return elapsed time in seconds +*/ +double benchmark() { + double elapsed; + double x; + double t; + bool b; + int i; + + t = tic(); + for ( i = 0; i < ITERATIONS; i++ ) { + x = ( rand_double() * 200.0 ); + b = stdlib_base_is_prime( x ); + if ( b != true && b != false ) { + printf( "should return either true or false\n" ); + break; + } + } + elapsed = tic() - t; + if ( b != true && b != false ) { + printf( "should return either true or false\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/assert/is-prime/binding.gyp b/lib/node_modules/@stdlib/math/base/assert/is-prime/binding.gyp new file mode 100644 index 00000000000..ec399223344 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/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/assert/is-prime/examples/c/Makefile b/lib/node_modules/@stdlib/math/base/assert/is-prime/examples/c/Makefile new file mode 100644 index 00000000000..6aed70daf16 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/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/assert/is-prime/examples/c/example.c b/lib/node_modules/@stdlib/math/base/assert/is-prime/examples/c/example.c new file mode 100644 index 00000000000..417e6850e1a --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/examples/c/example.c @@ -0,0 +1,32 @@ +/** +* @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/assert/is_prime.h" +#include +#include + +int main( void ) { + const double x[] = { 5.0, -5.0, 3.14, -3.14, 2.0, -2.0, 0.0, 0.0/0.0 }; + + bool b; + int i; + for ( i = 0; i < 6; i++ ) { + b = stdlib_base_is_prime( x[ i ] ); + printf( "Value: %lf. Is Prime? %s.\n", x[ i ], ( b ) ? "True" : "False" ); + } +} diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/include.gypi b/lib/node_modules/@stdlib/math/base/assert/is-prime/include.gypi new file mode 100644 index 00000000000..575cb043c0b --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/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': [ + ' + +/* +* 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 + +/** +* Tests if a finite double-precision floating-point number is a prime number. +*/ +bool stdlib_base_is_prime( const double x ); + +#ifdef __cplusplus +} +#endif + +#endif // !STDLIB_MATH_BASE_ASSERT_IS_PRIME_H diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/lib/native.js b/lib/node_modules/@stdlib/math/base/assert/is-prime/lib/native.js new file mode 100644 index 00000000000..b5390e7a1c5 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/lib/native.js @@ -0,0 +1,51 @@ +/** +* @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 Boolean = require( '@stdlib/boolean/ctor' ); +var addon = require( './../src/addon.node' ); + + +// MAIN // + +/** +* Tests if a finite double-precision floating-point number is a prime number. +* +* @private +* @param {number} x - value to test +* @returns {boolean} boolean indicating whether the number is prime +* +* @example +* var bool = isPrime( 2.0 ); +* // returns true +* +* @example +* var bool = isPrime( -5.2 ); +* // returns false +*/ +function isPrime( x ) { + return Boolean( addon( x ) ); +} + + +// EXPORTS // + +module.exports = isPrime; diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/manifest.json b/lib/node_modules/@stdlib/math/base/assert/is-prime/manifest.json new file mode 100644 index 00000000000..dcced9794c4 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/manifest.json @@ -0,0 +1,42 @@ +{ + "options": {}, + "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": [ + { + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/math/base/special/sqrt", + "@stdlib/math/base/special/floor", + "@stdlib/constants/float64/max-safe-integer" + ] + } + ] +} diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/src/Makefile b/lib/node_modules/@stdlib/math/base/assert/is-prime/src/Makefile new file mode 100644 index 00000000000..bcf18aa4665 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/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/assert/is-prime/src/addon.c b/lib/node_modules/@stdlib/math/base/assert/is-prime/src/addon.c new file mode 100644 index 00000000000..fb04b2b35b6 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/src/addon.c @@ -0,0 +1,91 @@ +/** +* @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/assert/is_prime.h" +#include +#include +#include +#include + +/** +* Receives JavaScript callback invocation data. +* +* @private +* @param env environment under which the function is invoked +* @param info callback data +* @return Node-API value +*/ +static napi_value addon( napi_env env, napi_callback_info info ) { + napi_status status; + + // Get callback arguments: + size_t argc = 1; + napi_value argv[ 1 ]; + status = napi_get_cb_info( env, info, &argc, argv, NULL, NULL ); + assert( status == napi_ok ); + + // Check whether we were provided the correct number of arguments: + if ( argc < 1 ) { + status = napi_throw_error( env, NULL, "invalid invocation. Insufficient arguments." ); + assert( status == napi_ok ); + return NULL; + } + if ( argc > 1 ) { + status = napi_throw_error( env, NULL, "invalid invocation. Too many arguments." ); + assert( status == napi_ok ); + return NULL; + } + + napi_valuetype vtype0; + status = napi_typeof( env, argv[ 0 ], &vtype0 ); + assert( status == napi_ok ); + if ( vtype0 != napi_number ) { + status = napi_throw_type_error( env, NULL, "invalid argument. First argument must be a number." ); + assert( status == napi_ok ); + return NULL; + } + + double x; + status = napi_get_value_double( env, argv[ 0 ], &x ); + assert( status == napi_ok ); + + bool result = stdlib_base_is_prime( x ); + + napi_value v; + status = napi_create_int32( env, (int32_t)result, &v ); + assert( status == napi_ok ); + + return v; +} + +/** +* Initializes a Node-API module. +* +* @private +* @param env environment under which the function is invoked +* @param exports exports object +* @return main export +*/ +static napi_value init( napi_env env, napi_value exports ) { + napi_value fcn; + napi_status status = napi_create_function( env, "exports", NAPI_AUTO_LENGTH, addon, NULL, &fcn ); + assert( status == napi_ok ); + return fcn; +} + +NAPI_MODULE( NODE_GYP_MODULE_NAME, init ) diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/src/main.c b/lib/node_modules/@stdlib/math/base/assert/is-prime/src/main.c new file mode 100644 index 00000000000..a49293f0e43 --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/src/main.c @@ -0,0 +1,139 @@ +/** +* @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/assert/is_prime.h" +#include "stdlib/math/base/special/sqrt.h" +#include "stdlib/math/base/special/floor.h" +#include "stdlib/constants/float64/max_safe_integer.h" +#include +#include + +static const double WHEEL_PRIMES[45] = { + 11.0, 13.0, 17.0, 19.0, 23.0, 29.0, 31.0, 37.0, 41.0, 43.0, 47.0, 53.0, 59.0, 61.0, 67.0, 71.0, 73.0, 79.0, 83.0, 89.0, 97.0, + 101.0, 103.0, 107.0, 109.0, 113.0, 127.0, 131.0, 137.0, 139.0, 149.0, 151.0, 157.0, 163.0, 167.0, 173.0, 179.0, 181.0, + 191.0, 193.0, 197.0, 199.0, 211.0 +}; + +/** +* Tests if a finite double-precision floating-point number is a prime number. +* +* @param x input value +* @return output value +* +* @example +* #include +* +* bool out = stdlib_base_is_prime( 3.0 ); +* // returns true +*/ +bool stdlib_base_is_prime( const double x ) { + int32_t i; + double N; + + // Check whether the number is an integer... + if ( stdlib_base_floor( x ) != x ) { + return false; + } + // Check whether the number is positive... + if ( x <= 3.0 ) { + return ( x > 1.0 ); // primes: 2.0, 3.0 + } + // Check whether the number is even... + if ( x > STDLIB_CONSTANT_FLOAT64_MAX_SAFE_INTEGER || ( fmod( x, 2.0 ) ) == 0.0 ) { + return false; + } + // Check for small primes... + if ( x < 9.0 ) { + return true; // primes: 5.0, 7.0 + } + // Check whether the number is evenly divisible by `3`... + if ( fmod( x, 3.0 ) == 0.0 ) { // TODO: replace fmod usage once we have a stdlib equivalent + return false; + } + // Check whether the number is evenly divisible by `5`... + if ( fmod( x, 5.0 ) == 0.0 ) { + return false; + } + // Check whether the number is evenly divisible by `7`... + if ( fmod( x, 7.0 ) == 0.0 ) { + return false; + } + // Check whether the number is a prime number in the wheel... + for ( i = 0; i < 45; i++ ) { + if ( WHEEL_PRIMES[ i ] == x ) { + return true; + } + } + // Use trial division (with wheel factorization; see https://en.wikipedia.org/wiki/Wheel_factorization) to detect composite numbers, leveraging the fact that all primes greater than `210` are of the form `210k±1`... + N = stdlib_base_floor( stdlib_base_sqrt( x ) ); + for ( i = 11; i <= N; i += 210 ) { + if ( + fmod( x, i ) == 0.0 || // 11 + fmod( x, ( i + 2 ) ) == 0.0 || // 13 + fmod( x, ( i + 6 ) ) == 0.0 || // 17 + fmod( x, ( i + 8 ) ) == 0.0 || // 19 + fmod( x, ( i + 12 ) ) == 0.0 || // 23 + fmod( x, ( i + 18 ) ) == 0.0 || // 29 + fmod( x, ( i + 20 ) ) == 0.0 || // 31 + fmod( x, ( i + 26 ) ) == 0.0 || // 37 + fmod( x, ( i + 30 ) ) == 0.0 || // 41 + fmod( x, ( i + 32 ) ) == 0.0 || // 43 + fmod( x, ( i + 36 ) ) == 0.0 || // 47 + fmod( x, ( i + 42 ) ) == 0.0 || // 53 + fmod( x, ( i + 48 ) ) == 0.0 || // 59 + fmod( x, ( i + 50 ) ) == 0.0 || // 61 + fmod( x, ( i + 56 ) ) == 0.0 || // 67 + fmod( x, ( i + 60 ) ) == 0.0 || // 71 + fmod( x, ( i + 62 ) ) == 0.0 || // 73 + fmod( x, ( i + 68 ) ) == 0.0 || // 79 + fmod( x, ( i + 72 ) ) == 0.0 || // 83 + fmod( x, ( i + 78 ) ) == 0.0 || // 89 + fmod( x, ( i + 86 ) ) == 0.0 || // 97 + fmod( x, ( i + 90 ) ) == 0.0 || // 101 + fmod( x, ( i + 92 ) ) == 0.0 || // 103 + fmod( x, ( i + 96 ) ) == 0.0 || // 107 + fmod( x, ( i + 98 ) ) == 0.0 || // 109 + fmod( x, ( i + 102 ) ) == 0.0 || // 113 + fmod( x, ( i + 110 ) ) == 0.0 || // 121 (relatively prime) + fmod( x, ( i + 116 ) ) == 0.0 || // 127 + fmod( x, ( i + 120 ) ) == 0.0 || // 131 + fmod( x, ( i + 126 ) ) == 0.0 || // 137 + fmod( x, ( i + 128 ) ) == 0.0 || // 139 + fmod( x, ( i + 132 ) ) == 0.0 || // 143 (relatively prime) + fmod( x, ( i + 138 ) ) == 0.0 || // 149 + fmod( x, ( i + 140 ) ) == 0.0 || // 151 + fmod( x, ( i + 146 ) ) == 0.0 || // 157 + fmod( x, ( i + 152 ) ) == 0.0 || // 163 + fmod( x, ( i + 156 ) ) == 0.0 || // 167 + fmod( x, ( i + 158 ) ) == 0.0 || // 169 (relatively prime) + fmod( x, ( i + 162 ) ) == 0.0 || // 173 + fmod( x, ( i + 168 ) ) == 0.0 || // 179 + fmod( x, ( i + 170 ) ) == 0.0 || // 181 + fmod( x, ( i + 176 ) ) == 0.0 || // 187 (relatively prime) + fmod( x, ( i + 180 ) ) == 0.0 || // 191 + fmod( x, ( i + 182 ) ) == 0.0 || // 193 + fmod( x, ( i + 186 ) ) == 0.0 || // 197 + fmod( x, ( i + 188 ) ) == 0.0 || // 199 + fmod( x, ( i + 198 ) ) == 0.0 || // 209 (relatively prime) + fmod( x, ( i + 200 ) ) == 0.0 // 211 + ) { + return false; + } + } + return true; +} diff --git a/lib/node_modules/@stdlib/math/base/assert/is-prime/test/test.native.js b/lib/node_modules/@stdlib/math/base/assert/is-prime/test/test.native.js new file mode 100644 index 00000000000..07ac725e76c --- /dev/null +++ b/lib/node_modules/@stdlib/math/base/assert/is-prime/test/test.native.js @@ -0,0 +1,137 @@ +/** +* @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 trunc = require( '@stdlib/math/base/special/trunc' ); +var randu = require( '@stdlib/random/base/randu' ); +var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ); +var PINF = require( '@stdlib/constants/float64/pinf' ); +var NINF = require( '@stdlib/constants/float64/ninf' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var PRIMES = require( './fixtures/primes.js' ); + + +// VARIABLES // + +var isPrime = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( isPrime instanceof Error ) +}; + + +// TESTS // + +tape( 'main export is a function', opts, function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof isPrime, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function returns `true` if provided a prime number', opts, function test( t ) { + var N; + var M; + var v; + var i; + var j; + + // Test the first `M` prime numbers... + M = 2e4; + for ( i = 0; i < M; i++ ) { + v = PRIMES[ i ]; + t.equal( isPrime( v ), true, 'returns true when provided '+v ); + } + // Randomly test prime numbers chosen from the remainder of the list of known prime numbers... + N = PRIMES.length - 1; + for ( i = 0; i < 1e3; i++ ) { + j = discreteUniform( M, N ); + v = PRIMES[ j ]; + t.equal( isPrime( v ), true, 'returns true when provided '+v ); + } + t.end(); +}); + +tape( 'the function returns `false` if provided a composite number', opts, function test( t ) { + var hash; + var MAX; + var M; + var N; + var i; + var j; + + N = PRIMES.length; + hash = {}; + for ( i = 0; i < N; i++ ) { + hash[ PRIMES[i] ] = true; + } + // Only test odd integers, as even integers are trivially composite... + M = 2e5; + for ( i = 3; i < M; i += 2 ) { + if ( hash[ i ] ) { + continue; + } + t.equal( isPrime( i ), false, 'returns false when provided '+i ); + } + // Generate random composite integers... + MAX = PRIMES[ N-1 ]; + for ( i = 0; i < 1e3; i++ ) { + // Generate an odd integer... + j = discreteUniform( trunc( M/2 ), trunc( MAX/2 ) ); + j = (2*j) + 1; + + // Check if the generated integer is a known prime number... + if ( hash[ j ] ) { + // Repeat iteration... + i -= 1; + continue; + } + t.equal( isPrime( j ), false, 'returns false when provided '+j ); + } + t.end(); +}); + +tape( 'the function returns `false` if not provided a positive integer', opts, function test( t ) { + var v; + var i; + for ( i = 0; i < 100; i++ ) { + v = ( randu()*100.0 ) - 50.0; + if ( trunc(v) !== v ) { + t.equal( isPrime( v ), false, 'returns false when provided '+v ); + } + } + t.end(); +}); + +tape( 'the function returns `false` if provided `NaN`', opts, function test( t ) { + t.equal( isPrime( NaN ), false, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns `false` if provided `+infinity`', opts, function test( t ) { + t.equal( isPrime( PINF ), false, 'returns expected value' ); + t.end(); +}); + +tape( 'the function returns `false` if provided `-infinity`', opts, function test( t ) { + t.equal( isPrime( NINF ), false, 'returns expected value' ); + t.end(); +});