diff --git a/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/README.md b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/README.md index c241e333d64b..1de196874297 100644 --- a/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/README.md +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/README.md @@ -148,6 +148,103 @@ logEachMap( 'x: %0.4f, n: %0.4f, p: %0.4f, P(X = x;n,p): %0.4f', x, n, p, pmf ); + + +* * * + +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/stats/base/dists/binomial/pmf.h" +``` + +#### stdlib_base_dists_binomial_pmf( x, n, p ) + +Evaluates the probability mass function (PMF) for a binomial distribution with number of trials `n` and success probability `p` at a value `x`. + +```c +double out = stdlib_base_dists_binomial_pmf( 3.0, 20, 0.2 ); +// returns ~0.205 +``` + +The function accepts the following arguments: + +- **x**: `[in] double` input value. +- **n**: `[in] double` number of trials. +- **p**: `[in] double` success probability. + +```c +double stdlib_base_dists_binomial_pmf( const double x, const double n, const double p ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/stats/base/dists/invgamma/variance.h" +#include +#include + +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*(max-min) ); +} + +int main( void ) { + double x; + double n; + double p; + double y; + int i; + for ( i = 0; i < 25; i++ ) { + x = random_uniform( 0.0, 20.0 ); + n = random_uniform( 0.0, 20.0 ); + n = random_uniform( 0.0, 1.0 ); + y = stdlib_base_dists_binomial_pmf( x, n, p ); + printf( "x: %lf, n: %lf, p: %lf pmf(x, n, p): %lf\n", x, n, p, y ); + } +} +``` + +
+ + + +
+ + +
diff --git a/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/benchmark.native.js new file mode 100644 index 000000000000..00c06b73c601 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/benchmark.native.js @@ -0,0 +1,78 @@ +/** +* @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 Float64Array = require( '@stdlib/array/float64' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var ceil = require( '@stdlib/math/base/special/ceil' ); +var randu = require( '@stdlib/random/base/randu' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var pkg = require( './../package.json' ).name; + + +// VARIABLES // + +var pmf = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( pmf instanceof Error ) +}; + + +// MAIN // + +bench( pkg+'::native', opts, function benchmark( b ) { + var len; + var n; + var p; + var x; + var y; + var i; + + len = 100; + x = new Float64Array( len ); + n = new Float64Array( len ); + p = new Float64Array( len ); + for ( i = 0; i < len; i++ ) { + x[ i ] = ceil( randu()*50.0 ); + y[ i ] = ceil( randu()*50.0 ); + p[ i ] = randu(); + } + + b.tic(); + for ( i = 0; i < b.iterations; i++ ) { + y = pmf( x[ i % len ], n[ i % len ], p[ i % len ] ); + 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/stats/base/dists/binomial/pmf/benchmark/c/Makefile b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/c/Makefile new file mode 100644 index 000000000000..bcf18aa46655 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/c/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/stats/base/dists/binomial/pmf/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/c/benchmark.c new file mode 100644 index 000000000000..038af13f4e82 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/benchmark/c/benchmark.c @@ -0,0 +1,142 @@ +/** +* @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/stats/base/dists/invgamma/pmf.h" +#include +#include +#include +#include +#include + +#define NAME "pmf" +#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 [min,max). +* +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number +*/ +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*(max-min) ); +} + +/** +* Runs a benchmark. +* +* @return elapsed time in seconds +*/ +static double benchmark( void ) { + double elapsed; + double n[ 100 ]; + double p[ 100 ]; + double x[ 100 ]; + double y; + double t; + int i; + + for ( i = 0; i < 100; i++ ) { + n[ i ] = random_uniform( 0.0, 20.0 ); + p[ i ] = random_uniform( 0.0, 1.0 ); + x[ i ] = random_uniform( 0.0, 20.0 ); + } + + t = tic(); + for ( i = 0; i < ITERATIONS; i++ ) { + y = stdlib_base_dists_binomial_pmf( x[ i % 100 ], n[ i % 100 ], p[ i % 100 ] ); + 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::%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/stats/base/dists/binomial/pmf/binding.gyp b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/binding.gyp new file mode 100644 index 000000000000..ec3992233442 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/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/stats/base/dists/binomial/pmf/examples/c/Makefile b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/examples/c/Makefile new file mode 100644 index 000000000000..bcf18aa46655 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/examples/c/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/stats/base/dists/binomial/pmf/examples/c/example.c b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/examples/c/example.c new file mode 100644 index 000000000000..bf5845671aa1 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/examples/c/example.c @@ -0,0 +1,42 @@ +/** +* @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/stats/base/dists/invgamma/pmf.h" +#include +#include + +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*(max-min) ); +} + +int main( void ) { + double n; + double p; + double x; + double y; + int i; + + for ( i = 0; i < 25; i++ ) { + n = random_uniform( 0.0, 20.0 ); + x = random_uniform( 0.0, 20.0 ); + p = random_uniform( 0.0, 1.0 ); + y = stdlib_base_dists_binomial_pmf( x, n, p ); + printf( "x: %lf, n: %lf, p: %lf pmf( x, n, p ): %lf\n", x, n, p, y ); + } +} diff --git a/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/include.gypi b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/include.gypi new file mode 100644 index 000000000000..575cb043c0bf --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/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': [ + ' +#include +#include + +/** +* +* @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 = 3; + napi_value argv[ 3 ]; + 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 < 3 ) { + status = napi_throw_error( env, NULL, "invalid invocation. Insufficient arguments." ); + assert( status == napi_ok ); + return NULL; + } + if ( argc > 3 ) { + 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 ( vtype1 != napi_number ) { + status = napi_throw_type_error( env, NULL, "invalid argument. First argument must be a number." ); + assert( status == napi_ok ); + return NULL; + } + napi_valuetype vtype1; + status = napi_typeof( env, argv[ 1 ], &vtype1 ); + assert( status == napi_ok ); + if ( vtype1 != napi_number ) { + status = napi_throw_type_error( env, NULL, "invalid argument. Second argument must be a number." ); + assert( status == napi_ok ); + return NULL; + } + napi_valuetype vtype2; + status = napi_typeof( env, argv[ 2 ], &vtype2 ); + assert( status == napi_ok ); + if ( vtype2 != napi_number ) { + status = napi_throw_type_error( env, NULL, "invalid argument. Third argument must be a number." ); + assert( status == napi_ok ); + return NULL; + } + + double value0; + status = napi_get_value_double( env, argv[ 0 ], &value0); + assert( status == napi_ok ); + + double value1; + status = napi_get_value_double( env, argv[ 1 ], &value1 ); + assert( status == napi_ok ); + + double value2; + status = napi_get_value_double( env, argv[ 2 ], &value2 ); + assert( status == napi_ok ); + + stdlib_base_minmax( value0, value1, value2 ); + + return NULL; +} + +/** +* 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/stats/base/dists/binomial/pmf/src/main.c b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/src/main.c new file mode 100644 index 000000000000..b0be15ed2782 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/src/main.c @@ -0,0 +1,66 @@ +/** +* @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/stats/base/dists/invgamma/pmf.h" +#include "stdlib/math/base/assert/is_nan.h" +#include "stdlib/math/base/assert/is_nonnegative_integer.h" +#include "stdlib/math/base/special/binomcoefln.h" +#include "stdlib/math/base/special/ln.h" +#include "stdlib/math/base/special/log1p.h" +#include "stdlib/math/base/special/exp.h" + +/** +* Evaluates the probability mass function (PMF) for a binomial distribution with number of trials `n` and success probability `p` at a value `x`. +* +* @param x input value +* @param n number of trials +* @param p success probability +* @return evaluated PMF +* +* @example +* double y = stdlib_base_binomial_pmf( 3.0, 20, 0.2 ); +* // returns ~0.205 +*/ +double stdlib_base_dists_binomial_pmf( const double x, const double n, const double p ) { + double lnl; + if ( + stdlib_base_is_nan( x ) || + stdlib_base_is_nan( n ) || + stdlib_base_is_nan( p ) || + p < 0.0 || + p > 1.0 || + stdlib_base_is_nonnegative_integer( n ) + ) { + return 0.0 / 0.0; // NaN + } + if ( stdlib_base_is_nonnegative_integer( x ) ) { + if ( x > n ) { + return 0.0; + } + if ( p === 0.0 ) { + return ( x === 0 ) ? 1.0 : 0.0; + } + if ( p === 0.0 ) { + return ( x === n ) ? 1.0 : 0.0; + } + lnl = stdlib_base_binomcoefln( n, x ); + lnl += ( x * stdlib_base_ln( p ) ) + ( ( n - x ) * stdlib_base_log1p( -p ) ); + return stdlib_base_exp( lnl ); + } + return 0.0; +} diff --git a/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/test/test.native.js b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/test/test.native.js new file mode 100644 index 000000000000..48a418e72c13 --- /dev/null +++ b/lib/node_modules/@stdlib/stats/base/dists/binomial/pmf/test/test.native.js @@ -0,0 +1,300 @@ +/** +* @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 tryRequire = require( '@stdlib/utils/try-require' ); +var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var abs = require( '@stdlib/math/base/special/abs' ); +var PINF = require( '@stdlib/constants/float64/pinf' ); +var NINF = require( '@stdlib/constants/float64/ninf' ); +var EPS = require( '@stdlib/constants/float64/eps' ); + + +// VARIABLES // + +var pmf = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( pmf instanceof Error ) +}; + + +// FIXTURES // + +var smallSmall = require( './fixtures/julia/small_small.json' ); +var smallHigh = require( './fixtures/julia/small_high.json' ); +var highSmall = require( './fixtures/julia/high_small.json' ); +var highHigh = require( './fixtures/julia/high_high.json' ); + + +// TESTS // + +tape( 'main export is a function', opts, function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof pmf, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'if provided `NaN` for any parameter, the function returns `NaN`', opts, function test( t ) { + var y = pmf( NaN, 20, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + y = pmf( 0.0, NaN, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + y = pmf( 0.0, 20, NaN ); + t.equal( isnan( y ), true, 'returns NaN' ); + t.end(); +}); + +tape( 'if provided a negative integer for `x` and a valid `n` and `p`, the function returns `0`', opts, function test( t ) { + var y = pmf( NINF, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( -20.0, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( -100.0, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( -1.0, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + t.end(); +}); + +tape( 'if provided a non-integer for `x` and a valid `n` and `p`, the function returns `0`', opts, function test( t ) { + var y = pmf( -1.5, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( -0.5, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( 1.5, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( 2.5, 20, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + t.end(); +}); + +tape( 'if provided `n` which is not a nonnegative integer, the function returns `NaN`', opts, function test( t ) { + var y; + + y = pmf( 2.0, 1.5, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 0.0, -1.0, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 2.0, NINF, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 2.0, PINF, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + t.end(); +}); + +tape( 'if provided a success probability `p` outside of `[0,1]`, the function returns `NaN`', opts, function test( t ) { + var y; + + y = pmf( 2.0, 20, -1.0 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 0.0, 20, 1.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 2.0, 20, NINF ); + t.equal( isnan( y ), true, 'returns NaN' ); + + y = pmf( 2.0, 20, PINF ); + t.equal( isnan( y ), true, 'returns NaN' ); + + t.end(); +}); + +tape( 'if `p` or `n` equals `0`, the function evaluates a degenerate distribution centered at `0.0`', opts, function test( t ) { + var y; + + // Case: n = 8, p = 0.0 + y = pmf( 0.0, 8, 0.0 ); + t.equal( y, 1.0, 'returns 1 for x equal to 0' ); + + y = pmf( 1.0, 8, 0.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( PINF, 8, 0.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NINF, 8, 0.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NaN, 8, 0.0 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + // Case: n = 0, p = 0.5 + y = pmf( 0.0, 0, 0.5 ); + t.equal( y, 1.0, 'returns 1 for x equal to 0' ); + + y = pmf( 1.0, 0, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( PINF, 0, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NINF, 0, 0.5 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NaN, 0, 0.5 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + t.end(); +}); + +tape( 'if `p` equals `1.0`, the function evaluates a degenerate distribution centered at `n`', opts, function test( t ) { + var y; + + y = pmf( 8.0, 8, 1.0 ); + t.equal( y, 1.0, 'returns 1 for x equal to 8' ); + + y = pmf( 1.0, 8, 1.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( PINF, 8, 1.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NINF, 8, 1.0 ); + t.equal( y, 0.0, 'returns 0' ); + + y = pmf( NaN, 8, 1.0 ); + t.equal( isnan( y ), true, 'returns NaN' ); + + t.end(); +}); + +tape( 'the function evaluates the pmf for `x` given large `n` and `p`', opts, function test( t ) { + var expected; + var delta; + var tol; + var i; + var n; + var p; + var x; + var y; + + expected = highHigh.expected; + x = highHigh.x; + n = highHigh.n; + p = highHigh.p; + for ( i = 0; i < x.length; i++ ) { + y = pmf( x[ i ], n[ i ], p[ i ] ); + if ( y === expected[ i ] ) { + t.equal( y, expected[ i ], 'x: ' + x[ i ] + ', n: ' + n[ i ] + ', p: ' + p[ i ] + ', y: ' + y + ', expected: ' + expected[ i ] ); + } else { + delta = abs( y - expected[ i ] ); + tol = 260.0 * EPS * abs( expected[ i ] ); + t.strictEqual( delta <= tol, true, 'within tolerance. x: ' + x[ i ] + '. n: ' + n[ i ] + '. p: ' + p[ i ] + '. y: ' + y + '. Expected: ' + expected[ i ] + '. tol: ' + tol + '. delta: ' + delta + '.' ); + } + } + t.end(); +}); + +tape( 'the function evaluates the pmf for `x` given large `n` and small `p`', opts, function test( t ) { + var expected; + var delta; + var tol; + var n; + var p; + var i; + var x; + var y; + + expected = highSmall.expected; + x = highSmall.x; + n = highSmall.n; + p = highSmall.p; + for ( i = 0; i < x.length; i++ ) { + y = pmf( x[ i ], n[ i ], p[ i ] ); + if ( y === expected[ i ] ) { + t.equal( y, expected[ i ], 'x: ' + x[ i ] + ', n: ' + n[ i ] + ', p: ' + p[ i ] + ', y: ' + y + ', expected: ' + expected[ i ] ); + } else { + delta = abs( y - expected[ i ] ); + tol = 270.0 * EPS * abs( expected[ i ] ); + t.strictEqual( delta <= tol, true, 'within tolerance. x: ' + x[ i ] + '. n: ' + n[ i ] + '. p: ' + p[ i ] + '. y: ' + y + '. Expected: ' + expected[ i ] + '. tol: ' + tol + '. delta: ' + delta + '.' ); + } + } + t.end(); +}); + +tape( 'the function evaluates the pmf for `x` given small `n` and large `p`', opts, function test( t ) { + var expected; + var delta; + var tol; + var i; + var n; + var p; + var x; + var y; + + expected = smallHigh.expected; + x = smallHigh.x; + n = smallHigh.n; + p = smallHigh.p; + for ( i = 0; i < x.length; i++ ) { + y = pmf( x[ i ], n[ i ], p[ i ] ); + if ( y === expected[ i ] ) { + t.equal( y, expected[ i ], 'x: ' + x[ i ] + ', n: ' + n[ i ] + ', p: ' + p[ i ] + ', y: ' + y + ', expected: ' + expected[ i ] ); + } else { + delta = abs( y - expected[ i ] ); + tol = 80.0 * EPS * abs( expected[ i ] ); + t.strictEqual( delta <= tol, true, 'within tolerance. x: ' + x[ i ] + '. n: ' + n[ i ] + '. p: ' + p[ i ] + '. y: ' + y + '. Expected: ' + expected[ i ] + '. tol: ' + tol + '. delta: ' + delta + '.' ); + } + } + t.end(); +}); + +tape( 'the function evaluates the pmf for `x` given small `n` and `p`', opts, function test( t ) { + var expected; + var delta; + var tol; + var i; + var n; + var p; + var x; + var y; + + expected = smallSmall.expected; + x = smallSmall.x; + n = smallSmall.n; + p = smallSmall.p; + for ( i = 0; i < x.length; i++ ) { + y = pmf( x[ i ], n[ i ], p[ i ] ); + if ( y === expected[ i ] ) { + t.equal( y, expected[ i ], 'x: ' + x[ i ] + ', n: ' + n[ i ] + ', p: ' + p[ i ] + ', y: ' + y + ', expected: ' + expected[ i ] ); + } else { + delta = abs( y - expected[ i ] ); + tol = 100.0 * EPS * abs( expected[ i ] ); + t.strictEqual( delta <= tol, true, 'within tolerance. x: ' + x[ i ] + '. n: ' + n[ i ] + '. p: ' + p[ i ] + '. y: ' + y + '. Expected: ' + expected[ i ] + '. tol: ' + tol + '. delta: ' + delta + '.' ); + } + } + t.end(); +});