refactor: apply suggestions from previous PRs

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: passed
  - task: lint_package_json
    status: passed
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: missing_dependencies
  - task: lint_c_examples
    status: missing_dependencies
  - task: lint_c_benchmarks
    status: missing_dependencies
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

---
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: passed
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: passed
  - task: run_c_benchmarks
    status: passed
  - 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: anandkaranubc

lib/node_modules/@stdlib/stats/base/dists/hypergeometric/variance/README.md

@@ -175,7 +175,7 @@ for ( i = 0; i < 10; i++ ) {
 
 #### stdlib_base_dists_hypergeometric_variance( N, K, n )
 
-Returns the variance of a hypergeometric distribution.
+Returns the [variance][variance] of a [hypergeometric][hypergeometric-distribution] distribution with parameters `N` (population size), `K` (subpopulation size), and `n` (number of draws).
 
 ```c
 double out = stdlib_base_dists_hypergeometric_variance( 16, 11, 4 );
@@ -211,12 +211,14 @@ double stdlib_base_dists_hypergeometric_variance( const double N, const double K
 ### Examples
 
 ```c
+#include "stdlib/math/base/special/round.h"
 #include "stdlib/stats/base/dists/hypergeometric/variance.h"
-#include <stdlib.h>
 #include <stdio.h>
+#include <stdlib.h>
 
-static int random_integer( const int min, const int max ) {
-    return min + rand() % ( max - min + 1 );
+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 ) {
@@ -227,15 +229,12 @@ int main( void ) {
     int i;
 
     for ( i = 0; i < 10; i++ ) {
-        N = random_integer( 10, 100 );
-        K = random_integer( 1, N );
-        n = random_integer( 1, N );
+        N = stdlib_base_round( random_uniform( 0.0, 20.0 ) );
+        K = stdlib_base_round( random_uniform( 0.0, N ) );
+        n = stdlib_base_round( random_uniform( 0.0, K ) );
         v = stdlib_base_dists_hypergeometric_variance( N, K, n );
-
-        printf( "N: %lf, K: %lf, n: %lf, Variance: %lf\n", N, K, n, v );
+        printf( "N: %lf, K: %lf, n: %lf, Var(X;N,K,n): %lf\n", N, K, n, v );
     }
-
-    return 0;
 }
 ```
 

lib/node_modules/@stdlib/stats/base/dists/hypergeometric/variance/benchmark/c/benchmark.c

@@ -1,25 +1,25 @@
 /**
- * @license Apache-2.0
- *
- * Copyright (c) 2025 The Stdlib Authors.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *    http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
+* @license Apache-2.0
+*
+* Copyright (c) 2025 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
 
 #include "stdlib/stats/base/dists/hypergeometric/variance.h"
-#include <stdlib.h>
-#include <stdio.h>
 #include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
 #include <time.h>
 #include <sys/time.h>
 
@@ -28,114 +28,114 @@
 #define REPEATS 3
 
 /**
- * Prints the TAP version.
- */
+* Prints the TAP version.
+*/
 static void print_version( void ) {
-    printf( "TAP version 13\n" );
+	printf( "TAP version 13\n" );
 }
 
 /**
- * Prints the TAP summary.
- *
- * @param total     total number of tests
- * @param passing   total number of passing tests
- */
+* 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" );
+	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
- */
+* 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" );
+	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
- */
+* 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;
+	struct timeval now;
+	gettimeofday( &now, NULL );
+	return (double)now.tv_sec + (double)now.tv_usec / 1.0e6;
 }
 
 /**
- * Generates a random integer on the interval [min,max].
- *
- * @param min    minimum value (inclusive)
- * @param max    maximum value (inclusive)
- * @return       random integer
- */
+* Generates a random integer on the interval [min,max].
+*
+* @param min    minimum value (inclusive)
+* @param max    maximum value (inclusive)
+* @return       random integer
+*/
 static int random_integer( const int min, const int max ) {
-    return min + rand() % ( max - min + 1 );
+	return min + rand() % ( max - min + 1 );
 }
 
 /**
- * Runs a benchmark.
- *
- * @return elapsed time in seconds
- */
+* Runs a benchmark.
+*
+* @return elapsed time in seconds
+*/
 static double benchmark( void ) {
-    double elapsed;
-    double N[ 100 ];
-    double K[ 100 ];
-    double n[ 100 ];
-    double v;
-    double t;
-    int i;
+	double elapsed;
+	double N[ 100 ];
+	double K[ 100 ];
+	double n[ 100 ];
+	double v;
+	double t;
+	int i;
 
-    for ( i = 0; i < 100; i++ ) {
-        N[ i ] = (double)random_integer( 10, 100 );
-        K[ i ] = (double)random_integer( 1, (int)N[ i ] );
-        n[ i ] = (double)random_integer( 1, (int)N[ i ] );
-    }
+	for ( i = 0; i < 100; i++ ) {
+		N[ i ] = (double)random_integer( 10, 100 );
+		K[ i ] = (double)random_integer( 1, (int)N[ i ] );
+		n[ i ] = (double)random_integer( 1, (int)N[ i ] );
+	}
 
-    t = tic();
-    for ( i = 0; i < ITERATIONS; i++ ) {
-        v = stdlib_base_dists_hypergeometric_variance( N[ i % 100 ], K[ i % 100 ], n[ i % 100 ] );
-        if ( v != v ) {
-            printf( "should not return NaN\n" );
-            break;
-        }
-    }
-    elapsed = tic() - t;
-    if ( v != v ) {
-        printf( "should not return NaN\n" );
-    }
-    return elapsed;
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		v = stdlib_base_dists_hypergeometric_variance( N[ i % 100 ], K[ i % 100 ], n[ i % 100 ] );
+		if ( v != v ) {
+			printf( "should not return NaN\n" );
+			break;
+		}
+	}
+	elapsed = tic() - t;
+	if ( v != v ) {
+		printf( "should not return NaN\n" );
+	}
+	return elapsed;
 }
 
 /**
- * Main execution sequence.
- */
+* Main execution sequence.
+*/
 int main( void ) {
-    double elapsed;
-    int i;
+	double elapsed;
+	int i;
 
-    // Use the current time to seed the random number generator:
-    srand( time( NULL ) );
+	// 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 );
+	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 );
 }