style: add missing spaces

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: passed
  - task: lint_javascript_tests
    status: passed
  - task: lint_javascript_benchmarks
    status: passed
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: passed
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: passed
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: passed
  - task: run_c_examples
    status: passed
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: failed
---

lib/node_modules/@stdlib/_tools/changelog/recommend-version-bump/lib/main.js

@@ -49,7 +49,7 @@ function recommendVersionBump( commits ) {
 	if ( hasFeature ) {
 		return 'minor';
 	}
-	if ( hasFix) {
+	if ( hasFix ) {
 		return 'patch';
 	}
 	return null;

lib/node_modules/@stdlib/_tools/eslint/rules/no-empty-comments/lib/main.js

@@ -31,7 +31,7 @@ var rule;
 * @param {Object} context - ESLint context
 * @returns {Object} validators
 */
-function main(context) {
+function main( context ) {
 	var comments;
 	var visited;
 	var source;
@@ -45,7 +45,7 @@ function main(context) {
 	* @private
 	* @param {Object} comment - comment node
 	*/
-	function report(comment) {
+	function report( comment ) {
 		context.report({
 			'node': null,
 			'message': 'Empty comments are not allowed',

lib/node_modules/@stdlib/_tools/eslint/rules/require-globals/test/fixtures/invalid.js

@@ -134,7 +134,7 @@ test = {
 		'	var z;',
 		'',
 		'	z = new Float64Array( m * m );',
-		'	for ( i = 0; i < m; i++) {',
+		'	for ( i = 0; i < m; i++ ) {',
 		'		for ( j = 0; j < m; j++ ) {',
 		'			s = 0;',
 		'			for ( k = 0; k < m; k++ ) {',

lib/node_modules/@stdlib/_tools/scripts/create_namespace_types.js

@@ -235,7 +235,7 @@ function create( fullPath ) {
 		RE = new RegExp( 'setReadOnly\\( '+nsIdentifier+', \'([a-z0-9_]+)\', require\\( \'([^\']+)\' \\) \\)', 'ig' );
 		match = RE.exec( indexFile );
 	}
-	while ( match !== null) {
+	while ( match !== null ) {
 		name = match[ 1 ];
 		pkgPath = match[ 2 ];
 

lib/node_modules/@stdlib/array/base/cuevery-by/lib/assign.js

@@ -61,7 +61,7 @@ function indexed( x, out, stride, offset, predicate, thisArg ) {
 			io += stride;
 			continue;
 		}
-		if ( !predicate.call( thisArg, x[ i ], i, x )) {
+		if ( !predicate.call( thisArg, x[ i ], i, x ) ) {
 			flg = false;
 		}
 		out[ io ] = flg;

lib/node_modules/@stdlib/array/base/take-map/lib/assign.js

@@ -47,8 +47,8 @@ var ind = require( '@stdlib/ndarray/base/ind' ).factory;
 * var out = [ 0, 0, 0, 0 ];
 *
 * function clbk( val ){
-	return val;
-}
+*     return val;
+* }
 *
 * var arr = takeMapIndexed( x, indices, 'throw', out, 1, 0, clbk );
 * // returns [ 4, 2, 3, 1 ]
@@ -73,7 +73,7 @@ function takeMapIndexed( x, indices, mode, out, stride, offset, clbk ) {
 		out[ io ] = x[ j ];
 		io += stride;
 	}
-	for (i = 0; i<out.length; i++) {
+	for ( i = 0; i < out.length; i++ ) {
 		// eslint-disable-next-line no-useless-call
 		out[i] = clbk.call( null, out[i], i );
 	}
@@ -137,7 +137,7 @@ function accessorsMap( x, indices, mode, out, stride, offset, clbk ) {
 
 	// Extract each desired element from the provided array...
 	io = offset;
-	for (i = 0; i < idata.length; i++) {
+	for ( i = 0; i < idata.length; i++ ) {
 		j = getIndex( iget( idata, i ), max );
 
 		// eslint-disable-next-line no-useless-call

lib/node_modules/@stdlib/array/fixed-endian-factory/lib/main.js

@@ -610,7 +610,7 @@ function factory( dtype ) { // eslint-disable-line max-lines-per-function, stdli
 		}
 		buf = this._buffer;
 		out = [];
-		for ( i = 0; i < this._length; i++) {
+		for ( i = 0; i < this._length; i++ ) {
 			v = buf[ GETTER ]( i*BYTES_PER_ELEMENT, this._isLE );
 			if ( predicate.call( thisArg, v, i, this ) ) {
 				out.push( v );

lib/node_modules/@stdlib/assert/is-well-formed-string/lib/iswellformed.js

@@ -40,7 +40,7 @@ var RE_UTF16_HIGH_SURROGATE = /[\uD800-\uDBFF]/;
 * var bool = isWellFormed( new String( '\uDC00' ) );
 * // returns false
 */
-function isWellFormed(str) {
+function isWellFormed( str ) {
 	var i;
 	for ( i = 0; i < str.length; i++ ) {
 		// Checking if a low surrogate is present at the beginning

lib/node_modules/@stdlib/bench/harness/test/test.bench.js

@@ -456,7 +456,7 @@ tape( 'the function runs benchmarks (sync)', function test( t ) {
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -466,7 +466,7 @@ tape( 'the function runs benchmarks (sync)', function test( t ) {
 	function boop( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.equal( true, true, 'is equal' );
 		}
 		b.toc();
@@ -591,7 +591,7 @@ tape( 'the function runs benchmarks (sync and async)', function test( t ) {
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -662,7 +662,7 @@ tape( 'if the `iterations` option is `null`, the function supports automatically
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -745,7 +745,7 @@ tape( 'by default, the `iterations` option is `null` and the number of repeats i
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -847,7 +847,7 @@ tape( 'if the `skip` option is `true`, the function skips a benchmark', function
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -994,7 +994,7 @@ tape( 'if `createStream` is called before providing adding one or more benchmark
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -1004,7 +1004,7 @@ tape( 'if `createStream` is called before providing adding one or more benchmark
 	function boop( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.equal( true, true, 'is equal' );
 		}
 		b.toc();

lib/node_modules/@stdlib/bench/harness/test/test.harness.js

@@ -161,7 +161,7 @@ tape( 'the function returns a function (no arguments)', function test( t ) {
 });
 
 tape( 'the function returns a function (options)', function test( t ) {
-	var harness = createHarness( {} );
+	var harness = createHarness({} );
 	t.strictEqual( typeof harness, 'function', 'returns a function' );
 	t.end();
 });
@@ -173,7 +173,7 @@ tape( 'the function returns a function (callback)', function test( t ) {
 });
 
 tape( 'the function returns a function (more than 1 argument)', function test( t ) {
-	var harness = createHarness( {}, noop );
+	var harness = createHarness({}, noop );
 	t.strictEqual( typeof harness, 'function', 'returns a function' );
 	t.end();
 });
@@ -379,7 +379,7 @@ tape( 'the returned function runs benchmarks (sync)', function test( t ) {
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -389,7 +389,7 @@ tape( 'the returned function runs benchmarks (sync)', function test( t ) {
 	function boop( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.equal( true, true, 'is equal' );
 		}
 		b.toc();
@@ -505,7 +505,7 @@ tape( 'the returned function runs benchmarks (sync and async)', function test( t
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -571,7 +571,7 @@ tape( 'if the `iterations` option is `null`, the returned function supports auto
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -646,7 +646,7 @@ tape( 'by default, the `iterations` option is `null` and the number of repeats i
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -735,7 +735,7 @@ tape( 'if the `skip` option is `true`, the returned function skips a benchmark',
 		t.strictEqual( b.iterations >= 1, true, 'iteration number is >= 1' );
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 || y > 1.0 ) {
@@ -852,7 +852,7 @@ tape( 'the `createStream` method supports returning an object mode stream', func
 	function beep( b ) {
 		var i;
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			b.ok( true, 'is okay' );
 		}
 		b.toc();
@@ -917,7 +917,7 @@ tape( 'if all benchmarks succeed, the harness exit code is `0`', function test(
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {
@@ -984,7 +984,7 @@ tape( 'if a benchmark fails, the harness exit code is `1`', function test( t ) {
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y >= -1.0 && y <= 1.0 ) {
@@ -1057,7 +1057,7 @@ tape( 'the function supports automatically closing a benchmark harness', functio
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {
@@ -1145,7 +1145,7 @@ tape( 'the function supports manually closing a benchmark harness', function tes
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {
@@ -1254,7 +1254,7 @@ tape( 'the function supports forcefully exiting a benchmark harness (while runni
 			harness.exit();
 		}
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {
@@ -1309,7 +1309,7 @@ tape( 'the function supports forcefully exiting a benchmark harness (after runni
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {
@@ -1386,7 +1386,7 @@ tape( 'attempting to exit a harness after the harness has closed is a no-op', fu
 		var i;
 
 		b.tic();
-		for ( i = 0; i < b.iterations; i++) {
+		for ( i = 0; i < b.iterations; i++ ) {
 			x = (randu()*100.0) - 50.0;
 			y = cos( x );
 			if ( y < -1.0 && y > 1.0 ) {

lib/node_modules/@stdlib/blas/base/drotg/test/test.assign.js

@@ -89,7 +89,7 @@ tape( 'the function computes a Givens plane rotation', function test( t ) {
 	t.end();
 });
 
-tape( 'the function returns an array of NaNs if provided a rotation elimination parameter equal to NaN', function test(t) {
+tape( 'the function returns an array of NaNs if provided a rotation elimination parameter equal to NaN', function test( t ) {
 	var actual;
 	var i;
 
@@ -110,7 +110,7 @@ tape( 'the function returns an array of NaNs if provided a rotation elimination
 	t.end();
 });
 
-tape( 'the function supports providing a positive stride', function test(t) {
+tape( 'the function supports providing a positive stride', function test( t ) {
 	var expected;
 	var actual;
 	var delta;
@@ -135,7 +135,7 @@ tape( 'the function supports providing a positive stride', function test(t) {
 	t.end();
 });
 
-tape( 'the function supports providing a negative stride', function test(t) {
+tape( 'the function supports providing a negative stride', function test( t ) {
 	var expected;
 	var actual;
 	var delta;
@@ -160,7 +160,7 @@ tape( 'the function supports providing a negative stride', function test(t) {
 	t.end();
 });
 
-tape( 'the function supports providing a positive offset', function test(t) {
+tape( 'the function supports providing a positive offset', function test( t ) {
 	var expected;
 	var actual;
 	var delta;
@@ -185,7 +185,7 @@ tape( 'the function supports providing a positive offset', function test(t) {
 	t.end();
 });
 
-tape( 'the function supports providing both a stride and offset', function test(t) {
+tape( 'the function supports providing both a stride and offset', function test( t ) {
 	var expected;
 	var actual;
 	var delta;