chore: clean-up

lib/node_modules/@stdlib/_tools/github/workflow-runs/lib/validate.js

@@ -106,7 +106,7 @@ function validate( opts, options ) {
 			!contains( STATUS_VALUES, opts.status ) &&
 			!contains( CONCLUSION_VALUES, opts.status )
 		) {
-			return new TypeError( format( 'invalid option. `%s` option must be one of the following: "%s" or "%s". Option: `%s`.', 'status', STATUS_VALUES.join( '", "' ), CONCLUSION_VALUES.join( '", "'), opts.status ) );
+			return new TypeError( format( 'invalid option. `%s` option must be one of the following: "%s" or "%s". Option: `%s`.', 'status', STATUS_VALUES.join( '", "' ), CONCLUSION_VALUES.join( '", "' ), opts.status ) );
 		}
 	}
 	return null;

lib/node_modules/@stdlib/array/struct-factory/lib/main.js

@@ -140,7 +140,7 @@
 	var FIELDS;
 	var Struct;
 
 	// FIXME: add option support for strict input object validation (e.g., throw whenever non-struct properties are included on an object passed to `set`)
 
 	if ( isCollection( arg ) ) {
 		Struct = structFactory( arg ); // NOTE: delegate to `structFactory` to perform input validation
@@ -150,7 +150,7 @@
 		throw new TypeError( format( 'invalid argument. First argument must be either a struct constructor or struct schema. Value: `%s`.', arg ) );
 	}
 	BYTES_PER_ELEMENT = Struct.byteLength;
 	LAYOUT = Struct.layout; // TODO: consider whether to lazily materialize the struct layout, as this could potentially be a long string (hence increased memory consumption) depending on the complexity of the struct
 	FIELDS = Struct.fields;
 
 	/**
@@ -178,7 +178,7 @@
 		var tmp;
 
 		nargs = arguments.length;
-		if ( !( this instanceof StructArray) ) {
+		if ( !( this instanceof StructArray ) ) {
 			if ( nargs === 0 ) {
 				return new StructArray();
 			}
@@ -492,7 +492,7 @@
 					sbuf.byteOffset+sbuf.byteLength > j
 				)
 			) {
 				// FIXME: add optimization when `value` is a StructArray sharing the same buffer and having the same layout; in which case, we can simply copy `src` bytes to a temporary array and then copy those bytes into the target array, without needing to intermediate struct instance materialization
 
 				// We need to copy source values...
 				tmp = [];

lib/node_modules/@stdlib/blas/base/cgemv/src/cgemv_ndarray.c

@@ -139,7 +139,7 @@ void API_SUFFIX(c_cgemv_ndarray)( const CBLAS_TRANSPOSE trans, const CBLAS_INT M
 		if ( trans != CblasConjTrans ) {
 			for ( i1 = 0; i1 < xlen; i1++ ) {
 				tmp = stdlib_base_complex64_mul( alpha, xp[ ix ] );
-				if ( stdlib_base_complex64_is_equal( tmp, zero )) {
+				if ( stdlib_base_complex64_is_equal( tmp, zero ) ) {
 					ia += da0 * ylen;
 				} else {
 					iy = offsetY;
@@ -157,7 +157,7 @@ void API_SUFFIX(c_cgemv_ndarray)( const CBLAS_TRANSPOSE trans, const CBLAS_INT M
 		}
 		for ( i1 = 0; i1 < xlen; i1++ ) {
 			tmp = stdlib_base_complex64_mul( alpha, xp[ ix ] );
-			if ( stdlib_base_complex64_is_equal( tmp, zero )) {
+			if ( stdlib_base_complex64_is_equal( tmp, zero ) ) {
 				ia += da0 * ylen;
 			} else {
 				iy = offsetY;

lib/node_modules/@stdlib/blas/ext/base/cfill/examples/c/example.c

@@ -20,7 +20,7 @@
 #include "stdlib/blas/ext/base/cfill.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	// Create a strided array of interleaved real and imaginary components:
 	float x[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f, 7.0f, 8.0f };
 

lib/node_modules/@stdlib/blas/ext/base/dsorthp/src/main.c

@@ -39,7 +39,7 @@
 * @param X        input array
 * @param strideX  stride length
 */
-void API_SUFFIX(stdlib_strided_dsorthp)( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX) {
+void API_SUFFIX(stdlib_strided_dsorthp)( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX ) {
 	CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX );
 	API_SUFFIX(stdlib_strided_dsorthp_ndarray)( N, order, X, strideX, ox );
 }

lib/node_modules/@stdlib/blas/ext/base/dwaxpb/docs/repl.txt

@@ -135,3 +135,4 @@
 
     See Also
     --------
+

lib/node_modules/@stdlib/blas/ext/base/swaxpb/docs/repl.txt

@@ -135,3 +135,4 @@
 
     See Also
     --------
+

lib/node_modules/@stdlib/blas/ext/base/zfill/README.md

@@ -255,7 +255,7 @@ void stdlib_strided_zfill_ndarray( const CBLAS_INT N, const stdlib_complex128_t
 #include "stdlib/blas/ext/base/zfill.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
     // Create a strided array of interleaved real and imaginary components:
     double x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
 

lib/node_modules/@stdlib/blas/ext/base/zfill/examples/c/example.c

@@ -20,7 +20,7 @@
 #include "stdlib/blas/ext/base/zfill.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	// Create a strided array of interleaved real and imaginary components:
 	double x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
 

lib/node_modules/@stdlib/math/base/special/cceiln/README.md

@@ -217,7 +217,7 @@ stdlib_complex128_t stdlib_base_cceiln( const stdlib_complex128_t z, int32_t n )
 #include "stdlib/complex/float64/reim.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
     const stdlib_complex128_t x[] = {
         stdlib_complex128( 3.14, 1.5 ),
         stdlib_complex128( -3.14, -1.5 ),

lib/node_modules/@stdlib/math/base/special/cceiln/examples/c/example.c

@@ -21,7 +21,7 @@
 #include "stdlib/complex/float64/reim.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	const stdlib_complex128_t x[] = {
 		stdlib_complex128( 3.14, 1.5 ),
 		stdlib_complex128( -3.14, -1.5 ),

lib/node_modules/@stdlib/math/base/special/ceiln/README.md

@@ -192,7 +192,7 @@ double stdlib_base_ceiln( const double x, const int32_t n );
 #include "stdlib/math/base/special/ceiln.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
     const double x[] = { 3.14, -3.14, 0.0, 0.0/0.0 };
 
     double y;

lib/node_modules/@stdlib/math/base/special/cfloorn/README.md

@@ -206,7 +206,7 @@ stdlib_complex128_t stdlib_base_cfloorn( const stdlib_complex128_t z, const int3
 #include "stdlib/complex/float64/reim.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
     const stdlib_complex128_t x[] = {
         stdlib_complex128( 3.14, 1.5 ),
         stdlib_complex128( -3.14, -1.5 ),

lib/node_modules/@stdlib/math/base/special/cfloorn/examples/c/example.c

@@ -21,7 +21,7 @@
 #include "stdlib/complex/float64/reim.h"
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	const stdlib_complex128_t x[] = {
 		stdlib_complex128( 3.14, 1.5 ),
 		stdlib_complex128( -3.14, -1.5 ),

lib/node_modules/@stdlib/math/base/special/erfinv/examples/c/example.c

@@ -20,7 +20,7 @@
 #include <stdlib.h>
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	const double x[] = { -1.0, -0.78, -0.56, -0.33, -0.11, 0.11, 0.33, 0.56, 0.78, 1.0 };
 	double v;
 	int i;

lib/node_modules/@stdlib/math/base/special/log10/examples/c/example.c

@@ -20,7 +20,7 @@
 #include <stdlib.h>
 #include <stdio.h>
 
-int main() {
+int main( void ) {
 	double x;
 	double v;
 	int i;

lib/node_modules/@stdlib/math/base/special/rempio2/src/main.c

@@ -615,7 +615,7 @@ int32_t stdlib_base_rempio2( const double x, double *rem1, double *rem2 ) {
 		// Skip zero term...
 		nx--;
 	}
-	n = rempio2Kernel( TX, TY, e0, nx);
+	n = rempio2Kernel( TX, TY, e0, nx );
 	if ( hx < 0 ) {
 		*rem1 = -TY[ 0 ];
 		*rem2 = -TY[ 1 ];

lib/node_modules/@stdlib/ndarray/base/count-if/lib/1d_accessors.js

@@ -102,7 +102,7 @@ function countIf1d( x, predicate, thisArg ) {
 
 	// Iterate over the ndarray dimensions...
 	for ( i0 = 0; i0 < S0; i0++ ) {
-		if ( predicate.call( thisArg, get( xbuf, ix ), [ i0 ], x.ref) ) {
+		if ( predicate.call( thisArg, get( xbuf, ix ), [ i0 ], x.ref ) ) {
 			count += 1;
 		}
 		ix += dx0;

lib/node_modules/@stdlib/ndarray/base/every-by/lib/1d_accessors.js

@@ -98,7 +98,7 @@ function every1d( x, predicate, thisArg ) {
 
 	// Iterate over the ndarray dimensions...
 	for ( i0 = 0; i0 < S0; i0++ ) {
-		if ( !predicate.call( thisArg, get( xbuf, ix ), [ i0 ], x.ref) ) {
+		if ( !predicate.call( thisArg, get( xbuf, ix ), [ i0 ], x.ref ) ) {
 			return false;
 		}
 		ix += dx0;

lib/node_modules/@stdlib/random/base/mt19937/src/main.c

@@ -267,7 +267,7 @@ static inline int8_t normalized( struct BasePRNGObject *obj, double *out ) {
 	if ( obj == NULL || obj->prng != &mt19937_prng ) {
 		return -1;
 	}
-	next( obj, &x);
+	next( obj, &x );
 	x >>= 5;
 
 	next( obj, &y );

lib/node_modules/@stdlib/repl/presentation/lib/main.js

@@ -23,7 +23,7 @@
 // MODULES //
 
 var resolve = require( 'path' ).resolve;
 var watchFile = require( 'fs' ).watch; // TODO: replace with stdlib pkg
 var EventEmitter = require( 'events' ).EventEmitter;
 var logger = require( 'debug' );
 var isFunction = require( '@stdlib/assert/is-function' );
@@ -49,7 +49,7 @@
 var blankLine = require( './blank_line.js' );
 var commands = require( './commands.js' );
 var setCommands = require( './set_commands.js' );
 var DOCS = require( './docs.js' );
 
 
 // VARIABLES //
@@ -118,7 +118,7 @@
 	var i;
 
 	nargs = arguments.length;
-	if ( !( this instanceof Presentation) ) {
+	if ( !( this instanceof Presentation ) ) {
 		if ( nargs === 0 ) {
 			throw new Error( 'invalid invocation. Insufficient arguments. Must provide a REPL instance.' );
 		}
@@ -930,7 +930,7 @@
 	if ( this._source === '' ) {
 		throw new Error( 'invalid operation. No presentation to reload. Use the `load()` method to load a presentation.' );
 	}
 	debug( 'Attempting to reload presentation.' );
 	try {
 		this.load( this._source );
 	} catch ( err ) {
@@ -1176,7 +1176,7 @@
 setNonEnumerableReadOnly( Presentation.prototype, 'show', function show() {
 	var str = this.render();
 	if ( str ) {
 		// FIXME: should only use ANSI escape codes when output stream is a TTY
 
 		/*
 		* [ANSI escape sequences][1]:

lib/node_modules/@stdlib/stats/strided/dcovmatmtk/lib/base.js

@@ -214,7 +214,7 @@ function dcovmatmtk( orient, uplo, M, N, correction, means, strideM, offsetM, A,
 	isrmb = isRowMajor( [ strideB1, strideB2 ] );
 
 	// Determine the outer and inner loop strides when writing to the upper or lower triangular part of `B`...
-	if ( uplo === 'upper') {
+	if ( uplo === 'upper' ) {
 		// Writing to the upper triangular part is cache optimal for a row-major `B`, but not for a column-major `B`...
 		sb0 = strideB2;
 		sb1 = strideB1;

lib/node_modules/@stdlib/stats/strided/sstdevwd/src/addon.c

@@ -38,7 +38,7 @@ static napi_value addon( napi_env env, napi_callback_info info ) {
 	STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 );
 	STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 );
 	STDLIB_NAPI_ARGV_FLOAT( env, correction, argv, 1 );
-	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2);
+	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 );
 	STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_sstdevwd)( N, correction, X, strideX ), v );
 	return v;
 }

lib/node_modules/@stdlib/stats/strided/svariance/src/addon.c

@@ -38,7 +38,7 @@ static napi_value addon( napi_env env, napi_callback_info info ) {
 	STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 );
 	STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 );
 	STDLIB_NAPI_ARGV_FLOAT( env, correction, argv, 1 );
-	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2)
+	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 )
 	STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_svariance)( N, correction, X, strideX ), v );
 	return v;
 }