chore: apply review changes

Author: headlessNode

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/README.md

@@ -45,7 +45,7 @@ var Float64Array = require( '@stdlib/array/float64' );
 
 var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
 
-var v = dnansumkbn( 4, x, 1 );
+var v = dnansumkbn( x.length, x, 1 );
 // returns 1.0
 ```
 
@@ -89,15 +89,15 @@ var Float64Array = require( '@stdlib/array/float64' );
 
 var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
 
-var v = dnansumkbn.ndarray( 4, x, 1, 0 );
+var v = dnansumkbn.ndarray( x.length, x, 1, 0 );
 // returns 1.0
 ```
 
 The function has the following additional parameters:
 
 -   **offsetX**: starting index for `x`.
 
-While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other value in `x` starting from the second value:
+While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other element starting from the second element:
 
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/benchmark/benchmark.js

@@ -32,6 +32,19 @@ var dnansumkbn = require( './../lib/dnansumkbn.js' );
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) > 0 ) {
+		return uniform( -10.0, 10.0 );
+	}
+	return NaN;
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -40,16 +53,9 @@ var dnansumkbn = require( './../lib/dnansumkbn.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float64', clbk );
+	var x = filledarrayBy( len, 'float64', rand );
 	return benchmark;
 
-	function clbk() {
-		if ( bernoulli( 0.7 ) > 0 ) {
-			return uniform( -10.0, 10.0 );
-		}
-		return NaN;
-	}
-
 	function benchmark( b ) {
 		var v;
 		var i;

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/benchmark/benchmark.native.js

@@ -41,6 +41,19 @@ var opts = {
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) > 0 ) {
+		return uniform( -10.0, 10.0 );
+	}
+	return NaN;
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -49,16 +62,9 @@ var opts = {
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float64', clbk );
+	var x = filledarrayBy( len, 'float64', rand );
 	return benchmark;
 
-	function clbk() {
-		if ( bernoulli( 0.7 ) > 0 ) {
-			return uniform( -10.0, 10.0 );
-		}
-		return NaN;
-	}
-
 	function benchmark( b ) {
 		var v;
 		var i;

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/benchmark/benchmark.ndarray.js

@@ -32,6 +32,19 @@ var dnansumkbn = require( './../lib/ndarray.js' );
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) > 0 ) {
+		return uniform( -10.0, 10.0 );
+	}
+	return NaN;
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -40,16 +53,9 @@ var dnansumkbn = require( './../lib/ndarray.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float64', clbk );
+	var x = filledarrayBy( len, 'float64', rand );
 	return benchmark;
 
-	function clbk() {
-		if ( bernoulli( 0.7 ) > 0 ) {
-			return uniform( -10.0, 10.0 );
-		}
-		return NaN;
-	}
-
 	function benchmark( b ) {
 		var v;
 		var i;

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/benchmark/benchmark.ndarray.native.js

@@ -41,6 +41,19 @@ var opts = {
 
 // FUNCTIONS //
 
+/**
+* Returns a random number.
+*
+* @private
+* @returns {number} random number
+*/
+function rand() {
+	if ( bernoulli( 0.8 ) > 0 ) {
+		return uniform( -10.0, 10.0 );
+	}
+	return NaN;
+}
+
 /**
 * Creates a benchmark function.
 *
@@ -49,16 +62,9 @@ var opts = {
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float64', clbk );
+	var x = filledarrayBy( len, 'float64', rand );
 	return benchmark;
 
-	function clbk() {
-		if ( bernoulli( 0.7 ) > 0 ) {
-			return uniform( -10.0, 10.0 );
-		}
-		return NaN;
-	}
-
 	function benchmark( b ) {
 		var v;
 		var i;

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/docs/repl.txt

@@ -34,7 +34,7 @@
     > {{alias}}( x.length, x, 1 )
     1.0
 
-    // Using `N` and `stride` parameters:
+    // Using `N` and stride parameters:
     > x = new {{alias:@stdlib/array/float64}}( [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0, NaN, NaN ] );
     > {{alias}}( 4, x, 2 )
     1.0

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/lib/dnansumkbn.js

@@ -46,9 +46,8 @@ var ndarray = require( './ndarray.js' );
 * var Float64Array = require( '@stdlib/array/float64' );
 *
 * var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
-* var N = x.length;
 *
-* var v = dnansumkbn( N, x, 1 );
+* var v = dnansumkbn( x.length, x, 1 );
 * // returns 1.0
 */
 function dnansumkbn( N, x, strideX ) {

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/lib/dnansumkbn.native.js

@@ -37,9 +37,8 @@ var addon = require( './../src/addon.node' );
 * var Float64Array = require( '@stdlib/array/float64' );
 *
 * var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
-* var N = x.length;
 *
-* var v = dnansumkbn( N, x, 1 );
+* var v = dnansumkbn( x.length, x, 1 );
 * // returns 1.0
 */
 function dnansumkbn( N, x, strideX ) {

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/lib/index.js

@@ -38,7 +38,7 @@
 *
 * var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ] );
 *
-* var v = dnansumkbn.ndarray( 5, x, 2, 1 );
+* var v = dnansumkbn.ndarray( x.length, x, 2, 1 );
 * // returns 5.0
 */
 

lib/node_modules/@stdlib/blas/ext/base/dnansumkbn/lib/ndarray.js

@@ -68,8 +68,7 @@ function dnansumkbn( N, x, strideX, offsetX ) {
 		if ( isnan( x[ ix ] ) ) {
 			return sum;
 		}
-		sum = x[ ix ] * N;
-		return sum;
+		return x[ ix ] * N;
 	}
 	c = 0.0;
 	for ( i = 0; i < N; i++ ) {