From 31a4ee0f835c65b11a69e30b41bc96a57dc8ed40 Mon Sep 17 00:00:00 2001
From: gaosiyuan <1264472267@qq.com>
Date: Thu, 25 Jun 2026 10:15:01 +0800
Subject: [PATCH] chore: fix JavaScript lint errors in chi2gof benchmark (issue
 #13114)

---
 .../stats/chi2gof/benchmark/benchmark.js      | 68 +++++++++----------
 1 file changed, 34 insertions(+), 34 deletions(-)

diff --git a/lib/node_modules/@stdlib/stats/chi2gof/benchmark/benchmark.js b/lib/node_modules/@stdlib/stats/chi2gof/benchmark/benchmark.js
index eea8413979a1..a5d018c23c6f 100644
--- a/lib/node_modules/@stdlib/stats/chi2gof/benchmark/benchmark.js
+++ b/lib/node_modules/@stdlib/stats/chi2gof/benchmark/benchmark.js
@@ -42,14 +42,14 @@ bench( format( '%s::distribution_name', pkg ), function benchmark( b ) {
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
 	// Generate frequency table:
-	freqs = new Array( 11 );
+	freqs = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
+		freqs.push( 0 );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];
@@ -82,14 +82,14 @@ bench( format( '%s::distribution_name:simulate=true', pkg ), function benchmark(
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
 	// Generate frequency table:
-	freqs = new Array( 11 );
+	freqs = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
+		freqs.push( 0 );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];
@@ -125,14 +125,14 @@ bench( format( '%s::distribution_name:simulate=true:iterations=250', pkg ), func
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
 	// Generate frequency table:
-	freqs = new Array( 11 );
+	freqs = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
+		freqs.push( 0 );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];
@@ -169,14 +169,14 @@ bench( format( '%s::distribution_name:simulate=true:iterations=100', pkg ), func
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
 	// Generate frequency table:
-	freqs = new Array( 11 );
+	freqs = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
+		freqs.push( 0 );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];
@@ -213,15 +213,15 @@ bench( format( '%s::probabilities', pkg ), function benchmark( b ) {
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
-	freqs = new Array( 11 );
-	probs = new Array( 11 );
+	freqs = [];
+	probs = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
-		probs[ i ] = pmf( i, 0, 10 );
+		freqs.push( 0 );
+		probs.push( pmf( i, 0, 10 ) );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];
@@ -254,15 +254,15 @@ bench( format( '%s::expected_counts', pkg ), function benchmark( b ) {
 	var i;
 
 	len = 100;
-	x = new Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = discreteUniform( 0, 10 );
+	x = [];
+	for ( i = 0; i < len; i++ ) {
+		x.push( discreteUniform( 0, 10 ) );
 	}
-	freqs = new Array( 11 );
-	expected = new Array( 11 );
+	freqs = [];
+	expected = [];
 	for ( i = 0; i < 11; i++ ) {
-		freqs[ i ] = 0;
-		expected[ i ] = pmf( i, 0, 10 ) * len;
+		freqs.push( 0 );
+		expected.push( pmf( i, 0, 10 ) * len );
 	}
 	for ( i = 0; i < len; i++ ) {
 		val = x[ i ];