chore: clean-up

lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/dsort2hp.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/ndarray.native.js

@@ -29,6 +29,10 @@ var addon = require( './dsort2hp.native.js' );
 /**
 * Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/dsort2sh.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/ndarray.native.js

@@ -29,6 +29,10 @@ var addon = require( './dsort2sh.native.js' );
 /**
 * Simultaneously sorts two double-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/dsorthp.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a double-precision floating-point strided array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/ndarray.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a double-precision floating-point strided array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/dsortsh.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a double-precision floating-point strided array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/ndarray.native.js

@@ -29,6 +29,10 @@ var addon = require( './dsortsh.native.js' );
 /**
 * Sorts a double-precision floating-point strided array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float64Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ndarray.native.js

@@ -29,6 +29,10 @@ var addon = require( './ssort2hp.native.js' );
 /**
 * Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ssort2hp.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ndarray.native.js

@@ -29,6 +29,10 @@ var addon = require( './ssort2sh.native.js' );
 /**
 * Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ssort2sh.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Simultaneously sorts two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - first input array

lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ndarray.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a single-precision floating-point strided array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ssorthp.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a single-precision floating-point strided array using heapsort.
 *
+* ## Notes
+*
+* -   This implementation uses an in-place algorithm derived from the work of Floyd (1964).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ndarray.native.js

@@ -30,6 +30,10 @@ var addon = require( './ssortsh.native.js' );
 /**
 * Sorts a single-precision floating-point strided array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ssortsh.native.js

@@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' );
 /**
 * Sorts a single-precision floating-point strided array using Shellsort.
 *
+* ## Notes
+*
+* -   This implementation uses the gap sequence proposed by Ciura (2001).
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {number} order - sort order
 * @param {Float32Array} x - input array

lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/ndarray.native.js

@@ -29,6 +29,12 @@ var addon = require( './../src/addon.node' );
 /**
 * Returns the index of the last falsy element in a double-precision complex floating-point strided array using alternative indexing semantics.
 *
+* ## Notes
+*
+* -   A complex number is falsy when both its real and imaginary components are falsy.
+* -   If unable to find a falsy element, the function returns `-1`.
+* -   The function explicitly treats `NaN` values as falsy.
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {Complex128Array} x - input array
 * @param {integer} strideX - stride length

lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/zlast_index_of_falsy.native.js

@@ -29,6 +29,12 @@ var addon = require( './../src/addon.node' );
 /**
 * Returns the index of the last falsy element in a double-precision complex floating-point strided array.
 *
+* ## Notes
+*
+* -   A complex number is falsy when both its real and imaginary components are falsy.
+* -   If unable to find a falsy element, the function returns `-1`.
+* -   The function explicitly treats `NaN` values as falsy.
+*
 * @param {PositiveInteger} N - number of indexed elements
 * @param {Complex128Array} x - input array
 * @param {integer} strideX - stride length

lib/node_modules/@stdlib/complex/float32/reim/benchmark/c/benchmark.c

@@ -129,7 +129,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/complex/float64/reim/benchmark/c/benchmark.c

@@ -129,7 +129,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/math/base/special/cceil/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/math/base/special/hyp2f1/benchmark/c/benchmark.c

@@ -133,7 +133,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-allowed-data-type-cast/benchmark/c/benchmark.c

@@ -125,7 +125,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c

@@ -127,7 +127,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c

@@ -127,7 +127,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-mostly-safe-data-type-cast/benchmark/c/benchmark.c

@@ -124,7 +124,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c

@@ -127,7 +127,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-safe-data-type-cast/benchmark/c/benchmark.c

@@ -124,7 +124,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-same-kind-data-type-cast/benchmark/c/benchmark.c

@@ -124,7 +124,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );

lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/benchmark/c/benchmark.c

@@ -130,7 +130,7 @@ int main( void ) {
 
 	print_version();
 	for ( i = 0; i < REPEATS; i++ ) {
-		printf( "# c::native::%s\n", NAME );
+		printf( "# c::%s\n", NAME );
 		elapsed = benchmark();
 		print_results( elapsed );
 		printf( "ok %d benchmark finished\n", i+1 );