diff --git a/lib/node_modules/@stdlib/blas/base/cscal/test/test.cscal.js b/lib/node_modules/@stdlib/blas/base/cscal/test/test.cscal.js
index 235156fe755e..0d05499876ae 100644
--- a/lib/node_modules/@stdlib/blas/base/cscal/test/test.cscal.js
+++ b/lib/node_modules/@stdlib/blas/base/cscal/test/test.cscal.js
@@ -79,8 +79,7 @@ tape( 'the function scales elements from `cx` by `ca`', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -134,8 +133,7 @@ tape( 'the function supports a `cx` stride', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -241,8 +239,7 @@ tape( 'the function supports complex access patterns', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -297,8 +294,7 @@ tape( 'the function supports view offsets', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
diff --git a/lib/node_modules/@stdlib/blas/base/cscal/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/base/cscal/test/test.ndarray.js
index 127337536e2f..d6f1662de4be 100644
--- a/lib/node_modules/@stdlib/blas/base/cscal/test/test.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/base/cscal/test/test.ndarray.js
@@ -87,8 +87,7 @@ tape( 'the function scales elements from `cx` by `ca`', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -142,8 +141,7 @@ tape( 'the function supports a `cx` stride', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 1.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -197,8 +195,7 @@ tape( 'the function supports a `cx` offset', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 5.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
@@ -312,8 +309,7 @@ tape( 'the function supports complex access patterns', function test( t ) {
 	for ( k = 0; k < expected.length; k++ ) {
 		if ( viewX[ k ] === expected[ k ] ) {
 			t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
-		}
-		else {
+		} else {
 			delta = abs( viewX[ k ] - expected[ k ] );
 			tol = 5.0 * EPS * abs( expected[ k ] );
 			t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );