Update nanminabs.js

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

Author: Kaushikgtm

lib/node_modules/@stdlib/stats/base/nanminabs/lib/nanminabs.js

@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2020 The Stdlib Authors.
+* 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.
@@ -22,6 +22,8 @@
 
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var abs = require( '@stdlib/math/base/special/abs' );
+var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+var accessors = require( './accessors.js' );
 
 
 // MAIN //
@@ -31,7 +33,8 @@ var abs = require( '@stdlib/math/base/special/abs' );
 *
 * @param {PositiveInteger} N - number of indexed elements
 * @param {NumericArray} x - input array
-* @param {integer} stride - stride length
+* @param {integer} strideX - stride length
+* @param {NonNegativeInteger} offsetX - starting index for `x`
 * @returns {number} minimum absolute value
 *
 * @example
@@ -41,20 +44,26 @@ var abs = require( '@stdlib/math/base/special/abs' );
 * var v = nanminabs( N, x, 1 );
 * // returns 1.0
 */
-function nanminabs( N, x, stride ) {
+function nanminabs( N, x, strideX, offsetX ) {
 	var min;
+	var o;
 	var ix;
 	var v;
 	var i;
 
 	if ( N <= 0 ) {
 		return NaN;
 	}
-	if ( N === 1 || stride === 0 ) {
-		return abs( x[ 0 ] );
+      o = arraylike2object( x );
+	if ( o.accessorProtocol ) {
+		return accessors( N, o, strideX, offsetX );
 	}
-	if ( stride < 0 ) {
-		ix = (1-N) * stride;
+
+	if ( N === 1 || strideX === 0 ) {
+		return x[ offsetX ];
+	}
+	if ( strideX < 0 ) {
+		ix = (1-N) * strideX;
 	} else {
 		ix = 0;
 	}
@@ -63,15 +72,15 @@ function nanminabs( N, x, stride ) {
 		if ( v === v ) {
 			break;
 		}
-		ix += stride;
+		ix += strideX;
 	}
 	if ( i === N ) {
 		return NaN;
 	}
 	min = abs( v );
 	i += 1;
 	for ( i; i < N; i++ ) {
-		ix += stride;
+		ix += strideX;
 		v = abs( x[ ix ] );
 		if ( isnan( v ) ) {
 			continue;