fix: correct critical parameter type issues in binomial/mgf

CRITICAL FIXES:
- Fix C function signature: n parameter from double to int32_t
- Fix C header declaration to match implementation
- Fix NAPI macro from DDD_D to DID_D for correct type binding
- Fix README C API documentation (parameter types and signatures)
- Fix C examples and benchmarks to use int32_t for n parameter
- Add missing stdint.h includes

RATIONALE:
- The number of trials (n) in binomial distribution must be integer
- This matches other stdlib binomial implementations
- Fixes parameter validation and type consistency
- Prevents accepting invalid non-integer trial counts

All C code now correctly uses int32_t for discrete count parameter.

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: na
  - task: run_c_examples
    status: na
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: na
  - task: run_c_benchmarks
    status: na
  - task: run_cpp_benchmarks
    status: na
  - task: run_fortran_benchmarks
    status: na
  - task: run_javascript_benchmarks
    status: na
  - task: run_julia_benchmarks
    status: na
  - task: run_python_benchmarks
    status: na
  - task: run_r_benchmarks
    status: na
  - task: run_javascript_tests
    status: na
---

Author: Planeshifter

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/README.md

@@ -194,12 +194,12 @@ double out = stdlib_base_dists_binomial_mgf( 0.5, 20, 0.2 );
 
 The function accepts the following arguments:
 
--   **t**: `[in] int` input value.
--   **n**: `[in] int` number of trials.
+-   **t**: `[in] double` input value.
+-   **n**: `[in] int32_t` number of trials.
 -   **p**: `[in] double` success probability.
 
 ```c
-double stdlib_base_dists_binomial_mgf( const double t, const double n, const double p );
+double stdlib_base_dists_binomial_mgf( const double t, const int32_t n, const double p );
 ```
 
 </section>
@@ -232,18 +232,18 @@ static double random_uniform( const double min, const double max ) {
 }
 
 int main( void ) {
-    double n;
+    int32_t n;
     double p;
     double t;
     double y;
     int i;
 
     for ( i = 0; i < 25; i++ ) {
-        n = stdlib_base_ceil( random_uniform( 0, 100 ) );
+        n = (int32_t)stdlib_base_ceil( random_uniform( 0, 100 ) );
         p = random_uniform( 0, 1 );
         t = random_uniform( 0, 5 );
         y = stdlib_base_dists_binomial_mgf( t, n, p );
-        printf( "t: %lf, n: %lf, p: %lf, M_X(t;n,p): %lf\n", t, n, p, y );
+        printf( "t: %lf, n: %d, p: %lf, M_X(t;n,p): %lf\n", t, n, p, y );
     }
 
     return 0;

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/benchmark/c/benchmark.c

@@ -23,6 +23,7 @@
 #include <math.h>
 #include <time.h>
 #include <sys/time.h>
+#include <stdint.h>
 
 #define NAME "binomial-mgf"
 #define ITERATIONS 1000000
@@ -94,15 +95,15 @@ static double random_uniform( const double min, const double max ) {
 */
 static double benchmark( void ) {
 	double elapsed;
-	double n[ 100 ];
+	int32_t n[ 100 ];
 	double p[ 100 ];
 	double t[ 100 ];
 	double y;
 	double tc;
 	int i;
 
 	for ( i = 0; i < 100; i++ ) {
-		n[ i ] = stdlib_base_ceil( random_uniform( 0.0, 100.0 ) );
+		n[ i ] = (int32_t)stdlib_base_ceil( random_uniform( 0.0, 100.0 ) );
 		p[ i ] = random_uniform( 0.0, 1.0 );
 		t[ i ] = random_uniform( 0.0, 5.0);
 	}

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/examples/c/example.c

@@ -20,25 +20,26 @@
 #include "stdlib/math/base/special/ceil.h"
 #include <stdlib.h>
 #include <stdio.h>
+#include <stdint.h>
 
 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;
+	int32_t n;
 	double p;
 	double t;
 	double y;
 	int i;
 
 	for ( i = 0; i < 25; i++ ) {
-		n = stdlib_base_ceil( random_uniform( 0.0, 100.0 ) );
+		n = (int32_t)stdlib_base_ceil( random_uniform( 0.0, 100.0 ) );
 		p = random_uniform( 0.0, 1.0 );
 		t = random_uniform( 0.0, 5.0 );
 		y = stdlib_base_dists_binomial_mgf( t, n, p );
-		printf( "t: %lf, n: %lf, p: %lf, M_X(t;n,p): %lf\n", t, n, p, y );
+		printf( "t: %lf, n: %d, p: %lf, M_X(t;n,p): %lf\n", t, n, p, y );
 	}
 
 	return 0;

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/include/stdlib/stats/base/dists/binomial/mgf.h

@@ -19,6 +19,8 @@
 #ifndef STDLIB_STATS_BASE_DISTS_BINOMIAL_MGF_H
 #define STDLIB_STATS_BASE_DISTS_BINOMIAL_MGF_H
 
+#include <stdint.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,7 +31,7 @@ extern "C" {
 /**
 * Returns the moment-generating function (MGF) of a binomial distribution.
 */
-double stdlib_base_dists_binomial_mgf( const double t, const double n, const double p );
+double stdlib_base_dists_binomial_mgf( const double t, const int32_t n, const double p );
 
 #ifdef __cplusplus
 }

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/src/addon.c

@@ -20,4 +20,4 @@
 #include "stdlib/math/base/napi/ternary.h"
 
 // cppcheck-suppress shadowFunction
-STDLIB_MATH_BASE_NAPI_MODULE_DDD_D( stdlib_base_dists_binomial_mgf );
+STDLIB_MATH_BASE_NAPI_MODULE_DID_D( stdlib_base_dists_binomial_mgf );

lib/node_modules/@stdlib/stats/base/dists/binomial/mgf/src/main.c

@@ -19,9 +19,9 @@
 #include "stdlib/stats/base/dists/binomial/mgf.h"
 #include "stdlib/math/base/assert/is_nan.h"
 #include "stdlib/constants/float64/pinf.h"
-#include "stdlib/math/base/assert/is_nonnegative_integer.h"
 #include "stdlib/math/base/special/pow.h"
 #include "stdlib/math/base/special/exp.h"
+#include <stdint.h>
 
 /**
 * Returns the moment-generating function (MGF) of a binomial distribution.
@@ -35,18 +35,15 @@
 * double y = stdlib_base_dists_binomial_mgf( 0.5, 20, 0.2 );
 * // returns ~11.471
 */
-double stdlib_base_dists_binomial_mgf( const double t, const double n, const double p ) {
+double stdlib_base_dists_binomial_mgf( const double t, const int32_t n, const double p ) {
 	if (
 		stdlib_base_is_nan( t ) ||
-		stdlib_base_is_nan( n ) ||
 		stdlib_base_is_nan( p ) ||
-		n < 0.0 ||
+		n < 0 ||
 		p < 0.0 ||
-		p > 1.0 ||
-		!stdlib_base_is_nonnegative_integer( n ) ||
-		n == STDLIB_CONSTANT_FLOAT64_PINF
+		p > 1.0
 	) {
 		return 0.0 / 0.0;
 	}
-	return stdlib_base_pow( ( 1.0 - p + ( p*stdlib_base_exp( t ) ) ), n );
+	return stdlib_base_pow( ( 1.0 - p + ( p*stdlib_base_exp( t ) ) ), (double)n );
 }