fix: apply code suggestions

---
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: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: passed
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: passed
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: passed
  - task: lint_typescript_tests
    status: passed
  - task: lint_license_headers
    status: passed
---

Author: shubham220420

lib/node_modules/@stdlib/stats/incr/nanmprod/README.md

@@ -79,13 +79,13 @@ p = accumulator( NaN ); // [2.0] (NaN ignored)
 p = accumulator( 3.0 ); // [2.0, 3.0]
 // returns 6.0
 
-// Window begins sliding...
 p = accumulator( 5.0 ); // [2.0, 3.0, 5.0]
 // returns 30.0
 
 p = accumulator( NaN ); // [2.0, 3.0, 5.0] (NaN ignored)
 // returns 30.0
 
+// Window begins sliding...
 p = accumulator( 7.0 ); // [3.0, 5.0, 7.0]
 // returns 105.0
 
@@ -167,7 +167,8 @@ p = accumulator( z );
 <!-- eslint no-undef: "error" -->
 
 ```javascript
-var randu = require( '@stdlib/random/base/randu' );
+var uniform = require( '@stdlib/random/base/uniform' );
+var bernoulli = require( '@stdlib/random/base/bernoulli' );
 var incrnanmprod = require( '@stdlib/stats/incr/nanmprod' );
 
 // Initialize an accumulator:
@@ -176,7 +177,7 @@ var accumulator = incrnanmprod( 5 );
 // For each simulated datum, update the moving product...
 var i;
 for ( i = 0; i < 100; i++ ) {
-    accumulator( ( randu()*10.0 ) - 5.0 );
+    accumulator( ( bernoulli( 0.8 ) < 1 ) ? NaN : uniform( -30.0, 30.0 ) );
 }
 console.log( accumulator() );
 ```

lib/node_modules/@stdlib/stats/incr/nanmprod/benchmark/benchmark.js

@@ -21,7 +21,6 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/base/randu' );
 var format = require( '@stdlib/string/format' );
 var pkg = require( './../package.json' ).name;
 var incrnanmprod = require( './../lib' );
@@ -56,7 +55,7 @@ bench( format( '%s::accumulator', pkg ), function benchmark( b ) {
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		v = acc( randu() );
+		v = acc( (i%5) ? i : NaN );
 		if ( v !== v ) {
 			b.fail( 'should not return NaN' );
 		}

lib/node_modules/@stdlib/stats/incr/nanmprod/docs/types/test.ts

@@ -50,6 +50,7 @@ import incrnanmprod = require( './index' );
 
 	acc(); // $ExpectType number | null
 	acc( 3.14 ); // $ExpectType number | null
+	acc( NaN ); // $ExpectType number | null
 }
 
 // The compiler throws an error if the returned accumulator function is provided invalid arguments...

lib/node_modules/@stdlib/stats/incr/nanmprod/examples/index.js

@@ -18,7 +18,8 @@
 
 'use strict';
 
-var randu = require( '@stdlib/random/base/randu' );
+var uniform = require( '@stdlib/random/base/uniform' );
+var bernoulli = require( '@stdlib/random/base/bernoulli' );
 var incrnanmprod = require( './../lib' );
 
 var accumulator;
@@ -32,7 +33,7 @@ accumulator = incrnanmprod( 5 );
 // For each simulated datum, update the moving product...
 console.log( '\nValue\tProduct\n' );
 for ( i = 0; i < 100; i++ ) {
-	v = ( randu()*10.0 ) - 5.0;
+	v = ( bernoulli( 0.8 ) < 1 ) ? NaN : uniform( -30.0, 30.0 );
 	p = accumulator( v );
 	console.log( '%d\t%d', v.toFixed( 3 ), p.toFixed( 3 ) );
 }

lib/node_modules/@stdlib/stats/incr/nanmprod/lib/main.js

@@ -29,16 +29,6 @@ var incrmprod = require( '@stdlib/stats/incr/mprod' );
 /**
 * Returns an accumulator function which incrementally computes a moving product, ignoring `NaN` values.
 *
-* ## Method
-*
-* To avoid overflow/underflow, we store the fractional and exponent parts of intermediate results separately. By keeping a normalized fraction, we prevent underflow/overflow of the fraction. Underflow of the exponent is impossible, as IEEE 754 floating-point exponents are integer values. Overflow of the exponent is possible, but highly unlikely. In the worst case, an intermediate exponent is greater than the minimum safe integer, and adding the exponent of an incoming value does not change the intermediate result. While incorrect, such behavior does not lead to exponent overflow.
-*
-* While intermediate results are largely immune to overflow and not subject to underflow, this does not mean that returned results will never be zero or infinite. In fact, zero (underflow) and infinite (overflow) results may be transient (i.e., infinity followed by a finite number).
-*
-* ## References
-*
-* -   Ueberhuber, Christoph W. 1997. _Numerical Computation 1: Methods, Software, and Analysis_. Springer-Verlag Berlin Heidelberg. doi:[10.1007/978-3-642-59118-1](https://doi.org/10.1007/978-3-642-59118-1).
-*
 * @param {PositiveInteger} W - window size
 * @returns {Function} accumulator function
 *