Update accessors.js

Signed-off-by: Kaushikgtm <[email protected]>

Author: Kaushikgtm

lib/node_modules/@stdlib/stats/base/nanmskmin/lib/accessors.js

@@ -20,14 +20,13 @@
 
 // MODULES //
 
-var isnan = require( '@stdlib/math/base/assert/is-nan' );
-var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
-
+var isnan = require('@stdlib/math/base/assert/is-nan');
+var isNegativeZero = require('@stdlib/math/base/assert/is-negative-zero');
 
 // MAIN //
 
 /**
-* Computes the minimum value of a strided array according to a mask
+* Computes the minimum value of a strided array according to a mask.
 *
 * @private
 * @param {PositiveInteger} N - number of indexed elements
@@ -41,17 +40,16 @@ var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
 * @param {Array<Function>} mask.accessors - mask element accessors
 * @param {integer} strideMask - stride length for `mask`
 * @param {NonNegativeInteger} offsetMask - starting index for `mask`
-* @returns {Object} output minimum value
-/*
-* @example 
-
-* var floor = require( '@stdlib/math/base/special/floor' );
+* @returns {number} Minimum value according to mask.
+*
+* @example
+* var floor = require('@stdlib/math/base/special/floor');
 *
 * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, -5.0, -6.0 ];
 * var mask = [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1 ];
-* var N = floor( x.length / 2 );
+* var N = floor(x.length / 2);
 *
-* var v = mskmax( 5, arraylike2object( toAccessorArray( x ) ), 2, 1, arraylike2object( toAccessorArray( mask ) ), 2, 1 );
+* var v = nanmskmin(5, arraylike2object(toAccessorArray(x)), 2, 1, arraylike2object(toAccessorArray(mask)), 2, 1);
 * // returns -2.0
 */
 function nanmskmin( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
@@ -66,65 +64,59 @@ function nanmskmin( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
 	var i;
 
 	// Cache references to array data:
-
 	xbuf = x.data;
 	mbuf = mask.data;
 
 	// Cache references to element accessors:
-
 	xget = x.accessors[ 0 ];
 	mget = mask.accessors[ 0 ];
 
 	if ( N <= 0 ) {
 		return NaN;
 	}
-	
+
 	ix = offsetX;
 	im = offsetMask;
-	for (i = 0; i < N; i++) {
-		if( mget( mbuf, im ) === 0){
+
+	for ( i = 0; i < N; i++ ) {
+		if ( mget(mbuf, im) === 0 ) {
 			break;
 		}
-		
 		ix += strideX;
 		im += strideMask;
-	}       
-		if ( i === N ) {
-			return NaN
+	}
+
+	if ( i === N ) {
+		return NaN;
+	}
+
+	min = xget(xbuf, ix);
+
+	if ( isnan(min) ) {
+		return NaN;
+	}
+
+	for ( i = i + 1; i < N; i++ ) {
+		ix += strideX;
+		im += strideMask;
+
+		if ( mget(mbuf, im) !== 0 ) {
+			continue;
 		}
-	
-		min = xget( xbuf, ix );
-	
-		if ( isnan( min ) ) {
-			return NaN;
+
+		v = xget(xbuf, ix);
+
+		if ( isnan(v) ) {
+			return v;
 		}
-	
-		i+1;
-	
-		for ( i; i<N; i++ ) {
-			ix += strideX;
-			im += strideMask;
-			if ( mget( mbuf, im ) !==0 ){
-				continue;
-			}
-			
-			v = xget( xbuf, ix );
-			
-			if ( isnan( v ) ) {
-				
-				return v;
-			}
-			
-			if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
-				
-				min = v;
-			}
-			
+
+		if ( v < min || ( v === min && isNegativeZero(v) ) ) {
+			min = v;
 		}
-		return min;
+	}
+	return min;
 }
 
-//Exports
-
+// EXPORTS //
 
 module.exports = nanmskmin;