Update ndarray.js

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

Author: Kaushikgtm

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

@@ -50,62 +50,60 @@ var accessors = require( './accessors.js' );
 * var v = nanmskmin( N, x, 2, 1, mask, 2, 1 );
 * // returns -2.0
 */
-function nanmskmin( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
+function nanmskmin(N, x, strideX, offsetX, mask, strideMask, offsetMask) {
 	var min;
 	var ix;
 	var im;
 	var ox;
 	var om;
 	var v;
 	var i;
-
-	if ( N <= 0 ) {
-		return NaN;
+  
+	if (N <= 0) {
+	    return NaN;
 	}
+  
 	ox = arraylike2object( x );
 	om = arraylike2object( mask );
-	if(ox.accessorProtocol || om.accessorProtocol ){
-		return accessors(N, ox, strideX, offsetX, om, strideMask, offsetMask)
+	
+	if (ox.accessorProtocol || om.accessorProtocol) {
+	    console.log("Using accessorProtocol:", ox.accessorProtocol, om.accessorProtocol);
+	    return accessors(N, ox, strideX, offsetX, om, strideMask, offsetMask);
 	}
+  
 	ix = offsetX;
 	im = offsetMask;
-
-	// Find the first unmasked element
 	for ( i = 0; i < N; i++ ) {
-		if ( mask[im] === 0 ) {
+		v = x[ ix ];
+		if ( v === v && mask[ im ] === 0 ) {
 			break;
 		}
 		ix += strideX;
 		im += strideMask;
 	}
-
 	if ( i === N ) {
 		return NaN;
 	}
-
-	min = x[ ix ];
-	if ( isnan( min ) ) {
-		return min;
-	}
-
-	for ( i += 1; i < N; i++ ) {
+	min = v;
+	i += 1;
+	for ( i; i < N; i++ ) {
 		ix += strideX;
 		im += strideMask;
-		if ( mask[ im ] !== 0 ) {
+		if ( mask[ im ] ) {
 			continue;
 		}
 		v = x[ ix ];
 		if ( isnan( v ) ) {
-			return v;
+			continue;
 		}
 		if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
 			min = v;
 		}
 	}
 	return min;
-}
+  }
 
 
-// EXPORTS //
+//exports
 
-module.exports = nanmskmin;
+module.exports = nanmskmin