From b294b54ad99650496fa272dd43f3fd02285ba83a Mon Sep 17 00:00:00 2001
From: Arya Rizky <arya.rizky@example.com>
Date: Thu, 21 May 2026 11:16:21 +0700
Subject: [PATCH] chore: fix JavaScript lint errors (issue #12222)

---
 .../blas/base/gasum/test/test.ndarray.js      | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/lib/node_modules/@stdlib/blas/base/gasum/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/base/gasum/test/test.ndarray.js
index 8a0223524c71..57fb79d36311 100644
--- a/lib/node_modules/@stdlib/blas/base/gasum/test/test.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/base/gasum/test/test.ndarray.js
@@ -198,15 +198,15 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
 	var y;
 	var i;
 
-	x = new Array( 100 );
-	for ( i = 0; i < x.length; i++ ) {
+	x = [];
+	for ( i = 0; i < 100; i++ ) {
 		sign = randu();
 		if ( sign < 0.5 ) {
 			sign = -1.0;
 		} else {
 			sign = 1.0;
 		}
-		x[ i ] = sign * (i+1);
+		x.push( sign * (i+1) );
 	}
 
 	y = gasum( x.length, x, 1, 0 );
@@ -214,15 +214,15 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
 	// Compare to closed-form formula:
 	t.strictEqual( y, x.length*(x.length+1)/2, 'returns expected value' );
 
-	x = new Array( 240 );
-	for ( i = 0; i < x.length; i++ ) {
+	x = [];
+	for ( i = 0; i < 240; i++ ) {
 		sign = randu();
 		if ( sign < 0.5 ) {
 			sign = -1.0;
 		} else {
 			sign = 1.0;
 		}
-		x[ i ] = sign * (i-5);
+		x.push( sign * (i-5) );
 	}
 
 	N = x.length - 6;
@@ -241,15 +241,15 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
 	var y;
 	var i;
 
-	x = new Array( 100 );
-	for ( i = 0; i < x.length; i++ ) {
+	x = [];
+	for ( i = 0; i < 100; i++ ) {
 		sign = randu();
 		if ( sign < 0.5 ) {
 			sign = -1.0;
 		} else {
 			sign = 1.0;
 		}
-		x[ i ] = sign * (i+1);
+		x.push( sign * (i+1) );
 	}
 
 	y = gasum( x.length, toAccessorArray( x ), 1, 0 );
@@ -257,15 +257,15 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
 	// Compare to closed-form formula:
 	t.strictEqual( y, x.length*(x.length+1)/2, 'returns expected value' );
 
-	x = new Array( 240 );
-	for ( i = 0; i < x.length; i++ ) {
+	x = [];
+	for ( i = 0; i < 240; i++ ) {
 		sign = randu();
 		if ( sign < 0.5 ) {
 			sign = -1.0;
 		} else {
 			sign = 1.0;
 		}
-		x[ i ] = sign * (i-5);
+		x.push( sign * (i-5) );
 	}
 
 	N = x.length - 6;