Refactor use of Array constructor

kgryte · kgryte · commit 3bf38fed027b · 2021-03-11T16:47:03.000-08:00
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/README.md
@@ -46,6 +46,8 @@ var isBufferLengthCompatibleShape = require( '@stdlib/ndarray/base/assert/is-buf
 
 Returns a `boolean` indicating if a buffer `length` is compatible with a provided `shape` array.
 
+<!-- eslint-disable id-length -->
+
 ```javascript
 var shape = [ 2, 2 ];
 
@@ -89,7 +91,7 @@ var i;
 
 len = 500; // buffer length
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
     shape[ 0 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/examples/index.js
@@ -28,7 +28,7 @@ var i;
 
 len = 500; // buffer length
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
 	shape[ 0 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/README.md
@@ -92,7 +92,7 @@ var i;
 var j;
 
 len = 500; // buffer length
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/examples/index.js
@@ -33,7 +33,7 @@ var i;
 var j;
 
 len = 500; // buffer length
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/README.md
@@ -96,7 +96,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/examples/index.js
@@ -31,7 +31,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/README.md
@@ -96,7 +96,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/examples/index.js
@@ -31,7 +31,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/README.md
@@ -96,7 +96,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/examples/index.js
@@ -31,7 +31,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/README.md b/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/README.md
@@ -96,7 +96,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/examples/index.js
@@ -31,7 +31,7 @@ var bool;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/iteration-order/README.md b/lib/node_modules/@stdlib/ndarray/base/iteration-order/README.md
@@ -93,7 +93,7 @@ var out;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 shape[ 0 ] = discreteUniform( 1, 10 );
 shape[ 1 ] = discreteUniform( 1, 10 );
 shape[ 2 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/iteration-order/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/iteration-order/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/iteration-order/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/iteration-order/examples/index.js
@@ -29,7 +29,7 @@ var out;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 shape[ 0 ] = discreteUniform( 1, 10 );
 shape[ 1 ] = discreteUniform( 1, 10 );
 shape[ 2 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/README.md b/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/README.md
@@ -92,7 +92,7 @@ var idx;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/examples/index.js
@@ -31,7 +31,7 @@ var idx;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/README.md b/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/README.md
@@ -92,7 +92,7 @@ var idx;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
     // Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/examples/index.js
@@ -31,7 +31,7 @@ var idx;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 
 for ( i = 0; i < 100; i++ ) {
 	// Generate a random array shape:
diff --git a/lib/node_modules/@stdlib/ndarray/base/numel/README.md b/lib/node_modules/@stdlib/ndarray/base/numel/README.md
@@ -77,7 +77,7 @@ var shape;
 var n;
 var i;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
     // Generate random NxMxL dimensions:
     shape[ 0 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/numel/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/numel/benchmark/benchmark.js
@@ -34,7 +34,7 @@ bench( pkg, function benchmark( b ) {
 	var n;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	for ( i = 0; i < shape.length; i++ ) {
 		shape[ i ] = floor( randu()*10.0 ) + 10.0;
 	}
diff --git a/lib/node_modules/@stdlib/ndarray/base/numel/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/numel/examples/index.js
@@ -25,7 +25,7 @@ var shape;
 var n;
 var i;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
 	// Generate random NxMxL dimensions:
 	shape[ 0 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/shape2strides/README.md b/lib/node_modules/@stdlib/ndarray/base/shape2strides/README.md
@@ -99,7 +99,7 @@ var strides;
 var shape;
 var i;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
     shape[ 0 ] = discreteUniform( 1, 10 );
     shape[ 1 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/benchmark.js
@@ -36,7 +36,7 @@ bench( pkg+':order=row-major', function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
@@ -62,7 +62,7 @@ bench( pkg+':order=column-major', function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = floor( randu()*10 );
 	shape[ 1 ] = floor( randu()*10 );
 	shape[ 2 ] = floor( randu()*10 );
@@ -88,7 +88,7 @@ bench( pkg+':assign:order=row-major', function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = floor( randu()*10 );
 	shape[ 1 ] = floor( randu()*10 );
 	shape[ 2 ] = floor( randu()*10 );
@@ -116,7 +116,7 @@ bench( pkg+':assign:order=column-major', function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = floor( randu()*10 );
 	shape[ 1 ] = floor( randu()*10 );
 	shape[ 2 ] = floor( randu()*10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/shape2strides/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/shape2strides/examples/index.js
@@ -25,7 +25,7 @@ var strides;
 var shape;
 var i;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 for ( i = 0; i < 100; i++ ) {
 	shape[ 0 ] = discreteUniform( 1, 10 );
 	shape[ 1 ] = discreteUniform( 1, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/strides2offset/README.md b/lib/node_modules/@stdlib/ndarray/base/strides2offset/README.md
@@ -87,17 +87,17 @@ var arr;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 shape[ 0 ] = discreteUniform( 1, 10 );
 shape[ 1 ] = discreteUniform( 1, 10 );
 shape[ 2 ] = discreteUniform( 1, 10 );
 
 strides = shape2strides( shape, 'row-major' );
 len = numel( shape );
 
-arr = new Array( len );
+arr = [];
 for ( i = 0; i < len; i++ ) {
-    arr[ i ] = i;
+    arr.push( i );
 }
 for ( i = 0; i < 100; i++ ) {
     j = discreteUniform( 0, shape.length-1 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/benchmark.js
@@ -37,7 +37,7 @@ bench( pkg, function benchmark( b ) {
 	var out;
 	var i;
 
-	shape = new Array( 3 );
+	shape = [ 0, 0, 0 ];
 	shape[ 0 ] = discreteUniform( 0, 10 );
 	shape[ 1 ] = discreteUniform( 0, 10 );
 	shape[ 2 ] = discreteUniform( 0, 10 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/strides2offset/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/strides2offset/examples/index.js
@@ -32,17 +32,17 @@ var arr;
 var i;
 var j;
 
-shape = new Array( 3 );
+shape = [ 0, 0, 0 ];
 shape[ 0 ] = discreteUniform( 1, 10 );
 shape[ 1 ] = discreteUniform( 1, 10 );
 shape[ 2 ] = discreteUniform( 1, 10 );
 
 strides = shape2strides( shape, 'row-major' );
 len = numel( shape );
 
-arr = new Array( len );
+arr = [];
 for ( i = 0; i < len; i++ ) {
-	arr[ i ] = i;
+	arr.push( i );
 }
 for ( i = 0; i < 100; i++ ) {
 	j = discreteUniform( 0, shape.length-1 );
diff --git a/lib/node_modules/@stdlib/ndarray/base/sub2ind/README.md b/lib/node_modules/@stdlib/ndarray/base/sub2ind/README.md
@@ -190,10 +190,10 @@ var strides = shape2strides( shape, 'row-major' );
 var mode = [ 'throw' ];
 var len = numel( shape );
 
-var arr = new Array( len );
+var arr = [];
 var i;
 for ( i = 0; i < len; i++ ) {
-    arr[ i ] = i;
+    arr.push( i );
 }
 
 var offset;
diff --git a/lib/node_modules/@stdlib/ndarray/base/sub2ind/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/sub2ind/examples/index.js
@@ -30,10 +30,10 @@ var strides = shape2strides( shape, 'row-major' );
 var mode = 'throw';
 var len = numel( shape );
 
-var arr = new Array( len );
+var arr = [];
 var i;
 for ( i = 0; i < len; i++ ) {
-	arr[ i ] = i;
+	arr.push( i );
 }
 
 var offset;
diff --git a/lib/node_modules/@stdlib/ndarray/base/to-array/README.md b/lib/node_modules/@stdlib/ndarray/base/to-array/README.md
@@ -108,11 +108,10 @@ var dicreteUniform = require( '@stdlib/random/base/discrete-uniform' );
 var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
 
 // Create a data buffer:
-var buffer = new Array( 27 );
-var len = buffer.length;
+var buffer = [];
 var i;
-for ( i = 0; i < len; i++ ) {
-    buffer[ i ] = i;
+for ( i = 0; i < 27; i++ ) {
+    buffer.push( i );
 }
 
 // Specify array meta data:
diff --git a/lib/node_modules/@stdlib/ndarray/base/to-array/benchmark/benchmark.js b/lib/node_modules/@stdlib/ndarray/base/to-array/benchmark/benchmark.js
diff --git a/lib/node_modules/@stdlib/ndarray/base/to-array/examples/index.js b/lib/node_modules/@stdlib/ndarray/base/to-array/examples/index.js
