diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/dsort2hp.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/dsort2hp.native.js index 50ee3ab4572f..ef0880b5142c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/dsort2hp.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/ndarray.native.js index b679af1b89ed..9e116ab99213 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2hp/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/dsort2sh.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/dsort2sh.native.js index 0a34b608ee7a..ed39f781d16c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/dsort2sh.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/ndarray.native.js index 3ff32081d74d..f55ed11d477f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsort2sh/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/dsorthp.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/dsorthp.native.js index 52214a499466..ada46b964c24 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/dsorthp.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/ndarray.native.js index 931368fe1a98..eb32389c1160 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsorthp/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/dsortsh.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/dsortsh.native.js index 70b36372020e..1cb37af76263 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/dsortsh.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/ndarray.native.js index 04a4826ca225..4726a04f8404 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dsortsh/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ndarray.native.js index cf5bf52935d8..09ae84cf2b5e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ssort2hp.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ssort2hp.native.js index f89104b21228..ac5c06c00c38 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssort2hp/lib/ssort2hp.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ndarray.native.js index edef90289cae..914bcd2494f2 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ssort2sh.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ssort2sh.native.js index e51f2ca82336..4daa96aeb032 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssort2sh/lib/ssort2sh.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ndarray.native.js index c7e19218d27b..f4edc51c9bf0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ssorthp.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ssorthp.native.js index 8319808d9079..4f299208a45c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssorthp/lib/ssorthp.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ndarray.native.js index 6f7b57fea00f..4cde8fbda20b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ssortsh.native.js b/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ssortsh.native.js index 4fd7fac1cc0d..0b1f69fa94ca 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ssortsh/lib/ssortsh.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/ndarray.native.js index 2e56fdd55861..5e4674f14fb3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/ndarray.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/zlast_index_of_falsy.native.js b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/zlast_index_of_falsy.native.js index fe2e4dfc7228..e270fb957ef8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-falsy/lib/zlast_index_of_falsy.native.js +++ b/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 diff --git a/lib/node_modules/@stdlib/complex/float32/reim/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/complex/float32/reim/benchmark/c/benchmark.c index 475dabbbe0d1..d25c99f7a05b 100644 --- a/lib/node_modules/@stdlib/complex/float32/reim/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/complex/float64/reim/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/complex/float64/reim/benchmark/c/benchmark.c index 3beb9f119254..5cb6d0c5a789 100644 --- a/lib/node_modules/@stdlib/complex/float64/reim/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/math/base/special/cceil/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/math/base/special/cceil/benchmark/c/benchmark.c index 6ae60323ad6a..359ca2eabdd8 100644 --- a/lib/node_modules/@stdlib/math/base/special/cceil/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/math/base/special/hyp2f1/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/math/base/special/hyp2f1/benchmark/c/benchmark.c index 270274422145..d07e94dd63bc 100644 --- a/lib/node_modules/@stdlib/math/base/special/hyp2f1/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-allowed-data-type-cast/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-allowed-data-type-cast/benchmark/c/benchmark.c index cf0351a589c3..42479ade3367 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-allowed-data-type-cast/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c index 8dc87f32f35d..1ded8c6e268d 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible-shape/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c index 023463e534de..ad6a89116fdc 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-buffer-length-compatible/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c index 13ac19882061..7c4c48544ca7 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major-contiguous/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c index 5a2d6fd3379d..322b24b6b5dd 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-column-major/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c index b1431d03d351..2bd70f40ead7 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-contiguous/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-mostly-safe-data-type-cast/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-mostly-safe-data-type-cast/benchmark/c/benchmark.c index 5ce6bbea47b7..6195d0b5ea71 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-mostly-safe-data-type-cast/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c index d647a4611e44..62c1482d2789 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major-contiguous/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c index 0c7b631161f3..51d02fe7bdb8 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-row-major/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-safe-data-type-cast/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-safe-data-type-cast/benchmark/c/benchmark.c index 7576c2c36be3..dc0dcebfcfc4 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-safe-data-type-cast/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-same-kind-data-type-cast/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-same-kind-data-type-cast/benchmark/c/benchmark.c index b2d9e100eda4..b3157db83fe6 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-same-kind-data-type-cast/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/benchmark/c/benchmark.c index 16d798a67c2d..d84935e5edeb 100644 --- a/lib/node_modules/@stdlib/ndarray/base/assert/is-single-segment-compatible/benchmark/c/benchmark.c +++ b/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/bind2vind/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/bind2vind/benchmark/c/benchmark.c index a1b9c39b721d..3507585af745 100644 --- a/lib/node_modules/@stdlib/ndarray/base/bind2vind/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/bind2vind/benchmark/c/benchmark.c @@ -647,112 +647,112 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major\n", NAME ); + printf( "# c::%s:mode=error,order=row-major\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major\n", NAME ); + printf( "# c::%s:mode=error,order=column-major\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=row-major,offset=0\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=column-major,offset=0\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major\n", NAME ); elapsed = benchmark5(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major\n", NAME ); elapsed = benchmark6(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major,offset=0\n", NAME ); elapsed = benchmark7(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major,offset=0\n", NAME ); elapsed = benchmark8(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major\n", NAME ); elapsed = benchmark9(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major\n", NAME ); elapsed = benchmark10(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major,offset=0\n", NAME ); elapsed = benchmark11(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major,offset=0\n", NAME ); elapsed = benchmark12(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major\n", NAME ); elapsed = benchmark13(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major\n", NAME ); elapsed = benchmark14(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major,offset=0\n", NAME ); elapsed = benchmark15(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major,offset=0\n", NAME ); elapsed = benchmark16(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/broadcast-shapes/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/broadcast-shapes/benchmark/c/benchmark.c index 82d2be578b3f..7281cdbfad9e 100644 --- a/lib/node_modules/@stdlib/ndarray/base/broadcast-shapes/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/broadcast-shapes/benchmark/c/benchmark.c @@ -140,7 +140,7 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { - printf( "# c::native::%s::two_arrays\n", NAME ); + printf( "# c::%s::two_arrays\n", NAME ); elapsed = benchmark(); print_results( elapsed ); printf( "ok %d benchmark finished\n", i+1 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/bytes-per-element/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/bytes-per-element/benchmark/c/benchmark.c index 370018a3e270..0e40f7e554e0 100644 --- a/lib/node_modules/@stdlib/ndarray/base/bytes-per-element/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/bytes-per-element/benchmark/c/benchmark.c @@ -137,7 +137,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/clamp-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/clamp-index/benchmark/c/benchmark.c index acbd94e10741..03332128dddb 100644 --- a/lib/node_modules/@stdlib/ndarray/base/clamp-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/clamp-index/benchmark/c/benchmark.c @@ -126,7 +126,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/dtype-alignment/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/dtype-alignment/benchmark/c/benchmark.c index 8f3a399b2060..ddfe585eb365 100644 --- a/lib/node_modules/@stdlib/ndarray/base/dtype-alignment/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/dtype-alignment/benchmark/c/benchmark.c @@ -137,7 +137,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/dtype-char/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/dtype-char/benchmark/c/benchmark.c index af8a87bf7fbd..a34800890a3a 100644 --- a/lib/node_modules/@stdlib/ndarray/base/dtype-char/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/dtype-char/benchmark/c/benchmark.c @@ -137,7 +137,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/flatten-shape-from/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/flatten-shape-from/benchmark/c/benchmark.c index f73d6004b8f7..ff5aed9c74d2 100644 --- a/lib/node_modules/@stdlib/ndarray/base/flatten-shape-from/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/flatten-shape-from/benchmark/c/benchmark.c @@ -131,7 +131,7 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s\n", NAME ); + printf( "# c::%s\n", NAME ); elapsed = benchmark(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/flatten-shape/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/flatten-shape/benchmark/c/benchmark.c index c593d07592c7..fc3c7cc0b0a3 100644 --- a/lib/node_modules/@stdlib/ndarray/base/flatten-shape/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/flatten-shape/benchmark/c/benchmark.c @@ -131,7 +131,7 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s\n", NAME ); + printf( "# c::%s\n", NAME ); elapsed = benchmark(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/ind/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/ind/benchmark/c/benchmark.c index fe4ed59afd5e..5511323061f1 100644 --- a/lib/node_modules/@stdlib/ndarray/base/ind/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/ind/benchmark/c/benchmark.c @@ -210,28 +210,28 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error\n", NAME ); + printf( "# c::%s:mode=error\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp\n", NAME ); + printf( "# c::%s:mode=clamp\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap\n", NAME ); + printf( "# c::%s:mode=wrap\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize\n", NAME ); + printf( "# c::%s:mode=normalize\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/ind2sub/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/ind2sub/benchmark/c/benchmark.c index 9cb87704fa70..8ff029d7ead9 100644 --- a/lib/node_modules/@stdlib/ndarray/base/ind2sub/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/ind2sub/benchmark/c/benchmark.c @@ -679,112 +679,112 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major\n", NAME ); + printf( "# c::%s:mode=error,order=row-major\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major\n", NAME ); + printf( "# c::%s:mode=error,order=column-major\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=row-major,offset=0\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=column-major,offset=0\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major\n", NAME ); elapsed = benchmark5(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major\n", NAME ); elapsed = benchmark6(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major,offset=0\n", NAME ); elapsed = benchmark7(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major,offset=0\n", NAME ); elapsed = benchmark8(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major\n", NAME ); elapsed = benchmark9(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major\n", NAME ); elapsed = benchmark10(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major,offset=0\n", NAME ); elapsed = benchmark11(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major,offset=0\n", NAME ); elapsed = benchmark12(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major\n", NAME ); elapsed = benchmark13(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major\n", NAME ); elapsed = benchmark14(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major,offset=0\n", NAME ); elapsed = benchmark15(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major,offset=0\n", NAME ); elapsed = benchmark16(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/iteration-order/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/iteration-order/benchmark/c/benchmark.c index 34aef358c517..b71781e1949e 100644 --- a/lib/node_modules/@stdlib/ndarray/base/iteration-order/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/iteration-order/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/benchmark/c/benchmark.c index 2d95d20e97f4..5d6d676140e8 100644 --- a/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/max-view-buffer-index/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/benchmark/c/benchmark.c index cc6e9848bf9f..bff4fa7465a7 100644 --- a/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/min-view-buffer-index/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/minmax-view-buffer-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/minmax-view-buffer-index/benchmark/c/benchmark.c index 1587e759a7be..8eb1a2943c54 100644 --- a/lib/node_modules/@stdlib/ndarray/base/minmax-view-buffer-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/minmax-view-buffer-index/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/nonsingleton-dimensions/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/nonsingleton-dimensions/benchmark/c/benchmark.c index aea058104858..4b58fdd91aea 100644 --- a/lib/node_modules/@stdlib/ndarray/base/nonsingleton-dimensions/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/nonsingleton-dimensions/benchmark/c/benchmark.c @@ -131,7 +131,7 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s\n", NAME ); + printf( "# c::%s\n", NAME ); elapsed = benchmark(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/normalize-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/normalize-index/benchmark/c/benchmark.c index c93641248cc8..e6d13c3af03f 100644 --- a/lib/node_modules/@stdlib/ndarray/base/normalize-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/normalize-index/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/numel/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/numel/benchmark/c/benchmark.c index 379a0ef98a01..aa8c7a38f11f 100644 --- a/lib/node_modules/@stdlib/ndarray/base/numel/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/numel/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/c/benchmark.c index e7fc86fec639..af061ef14ba4 100644 --- a/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/shape2strides/benchmark/c/benchmark.c @@ -162,14 +162,14 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:order=row-major\n", NAME ); + printf( "# c::%s:order=row-major\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:order=column-major\n", NAME ); + printf( "# c::%s:order=column-major\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/singleton-dimensions/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/singleton-dimensions/benchmark/c/benchmark.c index 989ccbfa1af5..875571f0a0b3 100644 --- a/lib/node_modules/@stdlib/ndarray/base/singleton-dimensions/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/singleton-dimensions/benchmark/c/benchmark.c @@ -131,7 +131,7 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s\n", NAME ); + printf( "# c::%s\n", NAME ); elapsed = benchmark(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/c/benchmark.c index ea3938571399..17011e90cf9d 100644 --- a/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/strides2offset/benchmark/c/benchmark.c @@ -128,7 +128,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/strides2order/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/strides2order/benchmark/c/benchmark.c index f9e5feffef20..947cdcbc08ef 100644 --- a/lib/node_modules/@stdlib/ndarray/base/strides2order/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/strides2order/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 ); diff --git a/lib/node_modules/@stdlib/ndarray/base/vind2bind/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/vind2bind/benchmark/c/benchmark.c index adf6a0134636..f65ac63e0711 100644 --- a/lib/node_modules/@stdlib/ndarray/base/vind2bind/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/vind2bind/benchmark/c/benchmark.c @@ -647,112 +647,112 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major\n", NAME ); + printf( "# c::%s:mode=error,order=row-major\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major\n", NAME ); + printf( "# c::%s:mode=error,order=column-major\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=row-major,offset=0\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=error,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=error,order=column-major,offset=0\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major\n", NAME ); elapsed = benchmark5(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major\n", NAME ); elapsed = benchmark6(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=row-major,offset=0\n", NAME ); elapsed = benchmark7(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=wrap,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=wrap,order=column-major,offset=0\n", NAME ); elapsed = benchmark8(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major\n", NAME ); elapsed = benchmark9(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major\n", NAME ); elapsed = benchmark10(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=row-major,offset=0\n", NAME ); elapsed = benchmark11(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=clamp,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=clamp,order=column-major,offset=0\n", NAME ); elapsed = benchmark12(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major\n", NAME ); elapsed = benchmark13(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major\n", NAME ); elapsed = benchmark14(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=row-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=row-major,offset=0\n", NAME ); elapsed = benchmark15(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s:mode=normalize,order=column-major,offset=0\n", NAME ); + printf( "# c::%s:mode=normalize,order=column-major,offset=0\n", NAME ); elapsed = benchmark16(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/ndarray/base/wrap-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/base/wrap-index/benchmark/c/benchmark.c index 8b0b5fb54af1..c59f4a84e7cb 100644 --- a/lib/node_modules/@stdlib/ndarray/base/wrap-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/base/wrap-index/benchmark/c/benchmark.c @@ -126,7 +126,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 ); diff --git a/lib/node_modules/@stdlib/ndarray/ctor/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/ndarray/ctor/benchmark/c/benchmark.c index ebc928b0721f..b96d089d84b0 100644 --- a/lib/node_modules/@stdlib/ndarray/ctor/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/ndarray/ctor/benchmark/c/benchmark.c @@ -3322,469 +3322,469 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::instantiation\n", NAME ); + printf( "# c::%s::instantiation\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:byteLength\n", NAME ); + printf( "# c::%s::get:byteLength\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:data\n", NAME ); + printf( "# c::%s::get:data\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:dtype\n", NAME ); + printf( "# c::%s::get:dtype\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:flags\n", NAME ); + printf( "# c::%s::get:flags\n", NAME ); elapsed = benchmark5(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:length\n", NAME ); + printf( "# c::%s::get:length\n", NAME ); elapsed = benchmark6(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:ndims\n", NAME ); + printf( "# c::%s::get:ndims\n", NAME ); elapsed = benchmark7(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:offset\n", NAME ); + printf( "# c::%s::get:offset\n", NAME ); elapsed = benchmark8(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:order\n", NAME ); + printf( "# c::%s::get:order\n", NAME ); elapsed = benchmark9(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:shape\n", NAME ); + printf( "# c::%s::get:shape\n", NAME ); elapsed = benchmark10(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:strides\n", NAME ); + printf( "# c::%s::get:strides\n", NAME ); elapsed = benchmark11(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:get:mode=error\n", NAME ); + printf( "# c::%s::1d:get:mode=error\n", NAME ); elapsed = benchmark12(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:get:mode=wrap\n", NAME ); + printf( "# c::%s::1d:get:mode=wrap\n", NAME ); elapsed = benchmark13(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:get:mode=clamp\n", NAME ); + printf( "# c::%s::1d:get:mode=clamp\n", NAME ); elapsed = benchmark14(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:get:mode=error\n", NAME ); + printf( "# c::%s::2d:get:mode=error\n", NAME ); elapsed = benchmark15(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:get:mode=wrap\n", NAME ); + printf( "# c::%s::2d:get:mode=wrap\n", NAME ); elapsed = benchmark16(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:get:mode=clamp\n", NAME ); + printf( "# c::%s::2d:get:mode=clamp\n", NAME ); elapsed = benchmark17(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:get:mode=error\n", NAME ); + printf( "# c::%s::3d:get:mode=error\n", NAME ); elapsed = benchmark18(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:get:mode=wrap\n", NAME ); + printf( "# c::%s::3d:get:mode=wrap\n", NAME ); elapsed = benchmark19(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:get:mode=clamp\n", NAME ); + printf( "# c::%s::3d:get:mode=clamp\n", NAME ); elapsed = benchmark20(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:get:mode=error\n", NAME ); + printf( "# c::%s::4d:get:mode=error\n", NAME ); elapsed = benchmark21(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:get:mode=wrap\n", NAME ); + printf( "# c::%s::4d:get:mode=wrap\n", NAME ); elapsed = benchmark22(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:get:mode=clamp\n", NAME ); + printf( "# c::%s::4d:get:mode=clamp\n", NAME ); elapsed = benchmark23(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:get:mode=error\n", NAME ); + printf( "# c::%s::5d:get:mode=error\n", NAME ); elapsed = benchmark24(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:get:mode=wrap\n", NAME ); + printf( "# c::%s::5d:get:mode=wrap\n", NAME ); elapsed = benchmark25(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:get:mode=clamp\n", NAME ); + printf( "# c::%s::5d:get:mode=clamp\n", NAME ); elapsed = benchmark26(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iget:mode=error\n", NAME ); + printf( "# c::%s::1d:iget:mode=error\n", NAME ); elapsed = benchmark27(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iget:mode=wrap\n", NAME ); + printf( "# c::%s::1d:iget:mode=wrap\n", NAME ); elapsed = benchmark28(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iget:mode=clamp\n", NAME ); + printf( "# c::%s::1d:iget:mode=clamp\n", NAME ); elapsed = benchmark29(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_positive_strides:iget:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,all_positive_strides:iget:mode=error,order=row-major\n", NAME ); elapsed = benchmark30(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_positive_strides:iget:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,all_positive_strides:iget:mode=error,order=column-major\n", NAME ); elapsed = benchmark31(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_negative_strides:iget:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,all_negative_strides:iget:mode=error,order=row-major\n", NAME ); elapsed = benchmark32(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_negative_strides:iget:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,all_negative_strides:iget:mode=error,order=column-major\n", NAME ); elapsed = benchmark33(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,mixed_sign_strides:iget:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,mixed_sign_strides:iget:mode=error,order=row-major\n", NAME ); elapsed = benchmark34(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,mixed_sign_strides:iget:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,mixed_sign_strides:iget:mode=error,order=column-major\n", NAME ); elapsed = benchmark35(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:set:mode=error\n", NAME ); + printf( "# c::%s::1d:set:mode=error\n", NAME ); elapsed = benchmark36(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:set:mode=wrap\n", NAME ); + printf( "# c::%s::1d:set:mode=wrap\n", NAME ); elapsed = benchmark37(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:set:mode=clamp\n", NAME ); + printf( "# c::%s::1d:set:mode=clamp\n", NAME ); elapsed = benchmark38(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:set:mode=error\n", NAME ); + printf( "# c::%s::2d:set:mode=error\n", NAME ); elapsed = benchmark39(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:set:mode=wrap\n", NAME ); + printf( "# c::%s::2d:set:mode=wrap\n", NAME ); elapsed = benchmark40(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d:set:mode=clamp\n", NAME ); + printf( "# c::%s::2d:set:mode=clamp\n", NAME ); elapsed = benchmark41(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:set:mode=error\n", NAME ); + printf( "# c::%s::3d:set:mode=error\n", NAME ); elapsed = benchmark42(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:set:mode=wrap\n", NAME ); + printf( "# c::%s::3d:set:mode=wrap\n", NAME ); elapsed = benchmark43(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::3d:set:mode=clamp\n", NAME ); + printf( "# c::%s::3d:set:mode=clamp\n", NAME ); elapsed = benchmark44(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:set:mode=error\n", NAME ); + printf( "# c::%s::4d:set:mode=error\n", NAME ); elapsed = benchmark45(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:set:mode=wrap\n", NAME ); + printf( "# c::%s::4d:set:mode=wrap\n", NAME ); elapsed = benchmark46(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::4d:set:mode=clamp\n", NAME ); + printf( "# c::%s::4d:set:mode=clamp\n", NAME ); elapsed = benchmark47(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:set:mode=error\n", NAME ); + printf( "# c::%s::5d:set:mode=error\n", NAME ); elapsed = benchmark48(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:set:mode=wrap\n", NAME ); + printf( "# c::%s::5d:set:mode=wrap\n", NAME ); elapsed = benchmark49(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::5d:set:mode=clamp\n", NAME ); + printf( "# c::%s::5d:set:mode=clamp\n", NAME ); elapsed = benchmark50(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iset:mode=error\n", NAME ); + printf( "# c::%s::1d:iset:mode=error\n", NAME ); elapsed = benchmark51(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iset:mode=wrap\n", NAME ); + printf( "# c::%s::1d:iset:mode=wrap\n", NAME ); elapsed = benchmark52(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::1d:iset:mode=clamp\n", NAME ); + printf( "# c::%s::1d:iset:mode=clamp\n", NAME ); elapsed = benchmark53(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_positive_strides:iset:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,all_positive_strides:iset:mode=error,order=row-major\n", NAME ); elapsed = benchmark54(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_positive_strides:iset:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,all_positive_strides:iset:mode=error,order=column-major\n", NAME ); elapsed = benchmark55(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_negative_strides:iset:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,all_negative_strides:iset:mode=error,order=row-major\n", NAME ); elapsed = benchmark56(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,all_negative_strides:iset:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,all_negative_strides:iset:mode=error,order=column-major\n", NAME ); elapsed = benchmark57(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,mixed_sign_strides:iset:mode=error,order=row-major\n", NAME ); + printf( "# c::%s::2d,mixed_sign_strides:iset:mode=error,order=row-major\n", NAME ); elapsed = benchmark58(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::2d,mixed_sign_strides:iset:mode=error,order=column-major\n", NAME ); + printf( "# c::%s::2d,mixed_sign_strides:iset:mode=error,order=column-major\n", NAME ); elapsed = benchmark59(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:dimension\n", NAME ); + printf( "# c::%s::get:dimension\n", NAME ); elapsed = benchmark60(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:stride\n", NAME ); + printf( "# c::%s::get:stride\n", NAME ); elapsed = benchmark61(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:index_mode\n", NAME ); + printf( "# c::%s::get:index_mode\n", NAME ); elapsed = benchmark62(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:submodes\n", NAME ); + printf( "# c::%s::get:submodes\n", NAME ); elapsed = benchmark63(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:submode\n", NAME ); + printf( "# c::%s::get:submode\n", NAME ); elapsed = benchmark64(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:byte_length_per_element\n", NAME ); + printf( "# c::%s::get:byte_length_per_element\n", NAME ); elapsed = benchmark65(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:stride_elements\n", NAME ); + printf( "# c::%s::get:stride_elements\n", NAME ); elapsed = benchmark66(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::get:offset_elements\n", NAME ); + printf( "# c::%s::get:offset_elements\n", NAME ); elapsed = benchmark67(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/number/float16/base/exponent/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/exponent/benchmark/c/benchmark.c index 178253e57554..8e22d48bccca 100644 --- a/lib/node_modules/@stdlib/number/float16/base/exponent/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/exponent/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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/from-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/from-word/benchmark/c/benchmark.c index 33b42462a276..ee60755b0c42 100644 --- a/lib/node_modules/@stdlib/number/float16/base/from-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/from-word/benchmark/c/benchmark.c @@ -114,7 +114,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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/signbit/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/signbit/benchmark/c/benchmark.c index 412b0139711f..b221dd155329 100644 --- a/lib/node_modules/@stdlib/number/float16/base/signbit/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/signbit/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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/significand/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/significand/benchmark/c/benchmark.c index a7038b1c859e..8b484cba8ec1 100644 --- a/lib/node_modules/@stdlib/number/float16/base/significand/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/significand/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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/to-float32/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/to-float32/benchmark/c/benchmark.c index ff89d2845bea..f7951e55836b 100644 --- a/lib/node_modules/@stdlib/number/float16/base/to-float32/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/to-float32/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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/to-float64/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/to-float64/benchmark/c/benchmark.c index 0a77cbf0105c..cfa802ebb288 100644 --- a/lib/node_modules/@stdlib/number/float16/base/to-float64/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/to-float64/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 ); diff --git a/lib/node_modules/@stdlib/number/float16/base/to-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float16/base/to-word/benchmark/c/benchmark.c index 56a804cd9131..33ea6043ffcc 100644 --- a/lib/node_modules/@stdlib/number/float16/base/to-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float16/base/to-word/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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value-zero/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value-zero/benchmark/c/benchmark.c index f9cde0cd91d5..73db4f3c09c6 100644 --- a/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value-zero/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value-zero/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value/benchmark/c/benchmark.c index 3cde27324b92..3811a8894fee 100644 --- a/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/assert/is-same-value/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/exponent/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/exponent/benchmark/c/benchmark.c index f807b5a8a28c..b81cb95d0fd4 100644 --- a/lib/node_modules/@stdlib/number/float32/base/exponent/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/exponent/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/from-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/from-word/benchmark/c/benchmark.c index 867d3482e61d..f73e78f22cac 100644 --- a/lib/node_modules/@stdlib/number/float32/base/from-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/from-word/benchmark/c/benchmark.c @@ -123,7 +123,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/normalize/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/normalize/benchmark/c/benchmark.c index 4a7da20d1969..de4d16b966df 100644 --- a/lib/node_modules/@stdlib/number/float32/base/normalize/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/normalize/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/signbit/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/signbit/benchmark/c/benchmark.c index ad22586fe207..dba48a5ffc2f 100644 --- a/lib/node_modules/@stdlib/number/float32/base/signbit/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/signbit/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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/significand/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/significand/benchmark/c/benchmark.c index 1101afd026a5..3ed747ba75f4 100644 --- a/lib/node_modules/@stdlib/number/float32/base/significand/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/significand/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/to-float16/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/to-float16/benchmark/c/benchmark.c index aa7a6067c838..9ef003fa02a9 100644 --- a/lib/node_modules/@stdlib/number/float32/base/to-float16/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/to-float16/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 ); diff --git a/lib/node_modules/@stdlib/number/float32/base/to-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float32/base/to-word/benchmark/c/benchmark.c index 8f55a3402a07..7d605ac65f6f 100644 --- a/lib/node_modules/@stdlib/number/float32/base/to-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float32/base/to-word/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value-zero/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value-zero/benchmark/c/benchmark.c index 3a671ea8e958..226716b1a72b 100644 --- a/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value-zero/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value-zero/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value/benchmark/c/benchmark.c index 7a106426ce57..53ee41c3cdca 100644 --- a/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/assert/is-same-value/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/exponent/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/exponent/benchmark/c/benchmark.c index 56dc1c033530..ec13c1bd20a0 100644 --- a/lib/node_modules/@stdlib/number/float64/base/exponent/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/exponent/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/from-words/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/from-words/benchmark/c/benchmark.c index 6f1ed1139cbd..e809e53a5691 100644 --- a/lib/node_modules/@stdlib/number/float64/base/from-words/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/from-words/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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/get-high-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/get-high-word/benchmark/c/benchmark.c index 9f2f28efbe8e..b344ac2ac1fe 100644 --- a/lib/node_modules/@stdlib/number/float64/base/get-high-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/get-high-word/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/get-low-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/get-low-word/benchmark/c/benchmark.c index ddfa0d782bfd..e4de096e6d7d 100644 --- a/lib/node_modules/@stdlib/number/float64/base/get-low-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/get-low-word/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/normalize/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/normalize/benchmark/c/benchmark.c index 376399db2349..243a6004b880 100644 --- a/lib/node_modules/@stdlib/number/float64/base/normalize/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/normalize/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/set-high-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/set-high-word/benchmark/c/benchmark.c index 76980fee4153..ab9dd986818a 100644 --- a/lib/node_modules/@stdlib/number/float64/base/set-high-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/set-high-word/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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/set-low-word/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/set-low-word/benchmark/c/benchmark.c index e7f6043797a8..cde32bfc27fb 100644 --- a/lib/node_modules/@stdlib/number/float64/base/set-low-word/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/set-low-word/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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/signbit/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/signbit/benchmark/c/benchmark.c index 06c156a65d51..27cfda0d0d8f 100644 --- a/lib/node_modules/@stdlib/number/float64/base/signbit/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/signbit/benchmark/c/benchmark.c @@ -131,7 +131,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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/to-float16/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/to-float16/benchmark/c/benchmark.c index 6934a5d03e97..61af76ac74b8 100644 --- a/lib/node_modules/@stdlib/number/float64/base/to-float16/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/to-float16/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 ); diff --git a/lib/node_modules/@stdlib/number/float64/base/to-words/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/number/float64/base/to-words/benchmark/c/benchmark.c index 3a5f1796e8dc..8ff013b630fe 100644 --- a/lib/node_modules/@stdlib/number/float64/base/to-words/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/number/float64/base/to-words/benchmark/c/benchmark.c @@ -132,7 +132,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 ); diff --git a/lib/node_modules/@stdlib/random/base/shared/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/random/base/shared/benchmark/c/benchmark.c index 152eec0f3d34..8fd7ccd06f2e 100644 --- a/lib/node_modules/@stdlib/random/base/shared/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/random/base/shared/benchmark/c/benchmark.c @@ -564,70 +564,70 @@ int main( void ) { print_version(); for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::next\n", NAME ); + printf( "# c::%s::next\n", NAME ); elapsed = benchmark1(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::normalized\n", NAME ); + printf( "# c::%s::normalized\n", NAME ); elapsed = benchmark2(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::min\n", NAME ); + printf( "# c::%s::min\n", NAME ); elapsed = benchmark3(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::max\n", NAME ); + printf( "# c::%s::max\n", NAME ); elapsed = benchmark4(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::normalized_min\n", NAME ); + printf( "# c::%s::normalized_min\n", NAME ); elapsed = benchmark5(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::normalized_max\n", NAME ); + printf( "# c::%s::normalized_max\n", NAME ); elapsed = benchmark6(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::state_size\n", NAME ); + printf( "# c::%s::state_size\n", NAME ); elapsed = benchmark7(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::copy\n", NAME ); + printf( "# c::%s::copy\n", NAME ); elapsed = benchmark8(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::copy_state\n", NAME ); + printf( "# c::%s::copy_state\n", NAME ); elapsed = benchmark9(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( i = 0; i < REPEATS; i++ ) { count += 1; - printf( "# c::native::%s::set\n", NAME ); + printf( "# c::%s::set\n", NAME ); elapsed = benchmark10(); print_results( elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/stats/base/dists/chi/cdf/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/stats/base/dists/chi/cdf/benchmark/c/benchmark.c index e69e5305d268..b5bb905a33c3 100644 --- a/lib/node_modules/@stdlib/stats/base/dists/chi/cdf/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/stats/base/dists/chi/cdf/benchmark/c/benchmark.c @@ -139,7 +139,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(); printf( "ok %d benchmark finished\n", i+1 ); print_results( elapsed ); diff --git a/lib/node_modules/@stdlib/stats/base/dists/gamma/logcdf/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/stats/base/dists/gamma/logcdf/benchmark/c/benchmark.c index bfba3c446a30..0c2012b405ec 100644 --- a/lib/node_modules/@stdlib/stats/base/dists/gamma/logcdf/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/stats/base/dists/gamma/logcdf/benchmark/c/benchmark.c @@ -141,7 +141,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(); printf( "ok %d benchmark finished\n", i+1 ); print_results( elapsed ); diff --git a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/benchmark/c/benchmark.c index c995741b9644..093944b1167b 100644 --- a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/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 ); diff --git a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/benchmark/c/benchmark.c index af4b0211a444..8fe70e2d9027 100644 --- a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/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 ); diff --git a/lib/node_modules/@stdlib/strided/base/stride2offset/benchmark/c/benchmark.c b/lib/node_modules/@stdlib/strided/base/stride2offset/benchmark/c/benchmark.c index 8fb3311b4600..91f8e71d849f 100644 --- a/lib/node_modules/@stdlib/strided/base/stride2offset/benchmark/c/benchmark.c +++ b/lib/node_modules/@stdlib/strided/base/stride2offset/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 );