diff --git a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/cindex_of_column.native.js b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/cindex_of_column.native.js index af98c32dcc41..9e3681d579b8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/cindex_of_column.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/cindex_of_column.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a single-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/ndarray.native.js index 37c62577f3f6..df937ec6919b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-column/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a single-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/cindex_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/cindex_of_row.native.js index 5d1e743c5812..9bb434a1e9f0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/cindex_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/cindex_of_row.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a single-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/ndarray.native.js index bffadd1ceaf7..58119cef40d6 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/cindex-of-row/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a single-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/clast_index_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/clast_index_of_row.native.js index bb3439c03d76..789123b13519 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/clast_index_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/clast_index_of_row.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a single-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/ndarray.native.js index b1a5c0246d5c..e6caa0516753 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/clast-index-of-row/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a single-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/c/benchmark.length.c index 243f3abe3171..304a837e3d9a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-power/benchmark/c/benchmark.length.c @@ -192,14 +192,14 @@ int main( void ) { iter = ITERATIONS / (int)pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-product/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-product/benchmark/c/benchmark.length.c index 1a812ee99225..30e494e0edee 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-product/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-product/benchmark/c/benchmark.length.c @@ -189,14 +189,14 @@ int main( void ) { iter = ITERATIONS / (int) pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/benchmark/c/benchmark.length.c index e9af9e289406..b7b51ace2247 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/benchmark/c/benchmark.length.c @@ -181,14 +181,14 @@ int main( void ) { iter = ITERATIONS / (int)pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/lib/ndarray.native.js index 27bc641e2898..de5941e902dc 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/lib/ndarray.native.js @@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' ); /** * Computes the Cartesian square for a double-precision floating-point strided array using alternative indexing semantics. * +* ## Notes +* +* - Pairs are stored as rows in the output matrix, where the first column contains the first element of each pair and the second column contains the second element. +* * @param {NonNegativeInteger} N - number of indexed elements * @param {Float64Array} x - input array * @param {integer} strideX - stride length for `x` diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcircshift/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcircshift/lib/ndarray.native.js index db6a8e132082..d46be5dffce7 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcircshift/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcircshift/lib/ndarray.native.js @@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' ); /** * Circularly shifts the elements of a double-precision floating-point strided array by a specified number of positions using alternative indexing semantics. * +* ## Notes +* +* - This implementation is based on the "trinity rotation" (a.k.a., conjoined triple reversal) algorithm introduced in , by Igor van den Hoven. +* * @param {PositiveInteger} N - number of indexed elements * @param {integer} k - number of positions to shift * @param {Float64Array} x - input array diff --git a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/dindex_of_column.native.js b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/dindex_of_column.native.js index 628a42750e90..36ab6c8caa9f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/dindex_of_column.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/dindex_of_column.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a double-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/ndarray.native.js index 06aff14b8c08..5247becb2eca 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-column/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a double-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/dindex_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/dindex_of_row.native.js index 0756ffd1f1ad..2903b2055bcd 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/dindex_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/dindex_of_row.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a double-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/ndarray.native.js index 9008d06424b3..7a11ef64c024 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dindex-of-row/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a double-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/dlast_index_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/dlast_index_of_row.native.js index 8af80bc45279..ed0de8cc5d5b 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/dlast_index_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/dlast_index_of_row.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a double-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/ndarray.native.js index 63985910fab5..5c68cb6d1168 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dlast-index-of-row/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a double-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float64Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/dminheap_sift_down.native.js b/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/dminheap_sift_down.native.js index 32004bfb08ef..3a2f7f7fbec0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/dminheap_sift_down.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/dminheap_sift_down.native.js @@ -28,6 +28,11 @@ var addon = require( './../src/addon.node' ); /** * Sifts a value down from a specified index in a double-precision floating-point strided min-heap until the heap property is restored. * +* ## Notes +* +* - The function assumes that the subtrees rooted at the children of `index` already satisfy the min-heap property and only the value being sifted may violate the min-heap invariant. +* - The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable. +* * @param {PositiveInteger} N - number of indexed elements * @param {NonNegativeInteger} index - logical index at which to begin sifting * @param {number} value - value to place into the heap diff --git a/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/ndarray.native.js index f8315f456b59..9c3e29b25489 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dminheap-sift-down/lib/ndarray.native.js @@ -28,6 +28,11 @@ var addon = require( './../src/addon.node' ); /** * Sifts a value down from a specified index in a double-precision floating-point strided min-heap until the heap property is restored using alternative indexing semantics. * +* ## Notes +* +* - The function assumes that the subtrees rooted at the children of `index` already satisfy the min-heap property and only the value being sifted may violate the min-heap invariant. +* - The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable. +* * @param {PositiveInteger} N - number of indexed elements * @param {NonNegativeInteger} index - logical index at which to begin sifting * @param {number} value - value to place into the heap diff --git a/lib/node_modules/@stdlib/blas/ext/base/dvander/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dvander/benchmark/c/benchmark.length.c index 25963eb13925..3012adb9e016 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dvander/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dvander/benchmark/c/benchmark.length.c @@ -183,7 +183,7 @@ int main( void ) { iter = ITERATIONS / pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); @@ -194,7 +194,7 @@ int main( void ) { iter = ITERATIONS / pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/scartesian-power/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/scartesian-power/benchmark/c/benchmark.length.c index cf64d7f14e6c..5a219297cb11 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/scartesian-power/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/scartesian-power/benchmark/c/benchmark.length.c @@ -192,14 +192,14 @@ int main( void ) { iter = ITERATIONS / (int)pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/scartesian-product/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/scartesian-product/benchmark/c/benchmark.length.c index 1b52a772525a..1d6cac484e3f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/scartesian-product/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/scartesian-product/benchmark/c/benchmark.length.c @@ -189,14 +189,14 @@ int main( void ) { iter = ITERATIONS / (int) pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/benchmark/c/benchmark.length.c index d821884ffb30..f81e0b02e236 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/benchmark/c/benchmark.length.c @@ -181,14 +181,14 @@ int main( void ) { iter = ITERATIONS / (int)pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/lib/ndarray.native.js index da1a73ebe4d8..dec778d8e24e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/scartesian-square/lib/ndarray.native.js @@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' ); /** * Computes the Cartesian square for a single-precision floating-point strided array using alternative indexing semantics. * +* ## Notes +* +* - Pairs are stored as rows in the output matrix, where the first column contains the first element of each pair and the second column contains the second element. +* * @param {NonNegativeInteger} N - number of indexed elements * @param {Float32Array} x - input array * @param {integer} strideX - stride length for `x` diff --git a/lib/node_modules/@stdlib/blas/ext/base/scircshift/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/scircshift/lib/ndarray.native.js index 3c7fc06483ff..5470962156d8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/scircshift/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/scircshift/lib/ndarray.native.js @@ -28,6 +28,10 @@ var addon = require( './../src/addon.node' ); /** * Circularly shifts the elements of a single-precision floating-point strided array by a specified number of positions using alternative indexing semantics. * +* ## Notes +* +* - This implementation is based on the "trinity rotation" (a.k.a., conjoined triple reversal) algorithm introduced in , by Igor van den Hoven. +* * @param {PositiveInteger} N - number of indexed elements * @param {integer} k - number of positions to shift * @param {Float32Array} x - input array diff --git a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/ndarray.native.js index ea77ad4c6a26..11bdef09bf23 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a single-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float32Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/sindex_of_column.native.js b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/sindex_of_column.native.js index 15977c5ab7ea..cb9b6c17231d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/sindex_of_column.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-column/lib/sindex_of_column.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a single-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/ndarray.native.js index 318f64df3a11..15ddd0ed497c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a single-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float32Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/sindex_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/sindex_of_row.native.js index 50b665e58304..04b76dd1188c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/sindex_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sindex-of-row/lib/sindex_of_row.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a single-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/ndarray.native.js index 1e0bbb8fe8dc..f60a644499fa 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/ndarray.native.js @@ -30,6 +30,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a single-precision floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Float32Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/slast_index_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/slast_index_of_row.native.js index d86e13939442..56279f9ff36f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/slast_index_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/slast-index-of-row/lib/slast_index_of_row.native.js @@ -33,6 +33,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a single-precision floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/ndarray.native.js index e8ebd9d8a34a..b9f4fd7a2027 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/ndarray.native.js @@ -28,6 +28,11 @@ var addon = require( './../src/addon.node' ); /** * Sifts a value down from a specified index in a single-precision floating-point strided min-heap until the heap property is restored using alternative indexing semantics. * +* ## Notes +* +* - The function assumes that the subtrees rooted at the children of `index` already satisfy the min-heap property and only the value being sifted may violate the min-heap invariant. +* - The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable. +* * @param {PositiveInteger} N - number of indexed elements * @param {NonNegativeInteger} index - logical index at which to begin sifting * @param {number} value - value to place into the heap diff --git a/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/sminheap_sift_down.native.js b/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/sminheap_sift_down.native.js index 21a3cf942b5b..150b8af3e528 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/sminheap_sift_down.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sminheap-sift-down/lib/sminheap_sift_down.native.js @@ -28,6 +28,11 @@ var addon = require( './../src/addon.node' ); /** * Sifts a value down from a specified index in a single-precision floating-point strided min-heap until the heap property is restored. * +* ## Notes +* +* - The function assumes that the subtrees rooted at the children of `index` already satisfy the min-heap property and only the value being sifted may violate the min-heap invariant. +* - The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable. +* * @param {PositiveInteger} N - number of indexed elements * @param {NonNegativeInteger} index - logical index at which to begin sifting * @param {number} value - value to place into the heap diff --git a/lib/node_modules/@stdlib/blas/ext/base/svander/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/svander/benchmark/c/benchmark.length.c index 535ef0186675..f7ed041433d5 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/svander/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/svander/benchmark/c/benchmark.length.c @@ -183,7 +183,7 @@ int main( void ) { iter = ITERATIONS / pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); @@ -194,7 +194,7 @@ int main( void ) { iter = ITERATIONS / pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/benchmark/c/benchmark.length.c index b4b112f88b30..6ae51d8151cb 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-product/benchmark/c/benchmark.length.c @@ -190,14 +190,14 @@ int main( void ) { iter = ITERATIONS / (int) pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/benchmark/c/benchmark.length.c index de7d2dddca56..e710bfb5ad7c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/benchmark/c/benchmark.length.c @@ -192,14 +192,14 @@ int main( void ) { iter = ITERATIONS / (int)pow( 10, i-1 ); for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:len=%d\n", NAME, len ); + printf( "# c::%s:len=%d\n", NAME, len ); elapsed = benchmark1( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); } for ( j = 0; j < REPEATS; j++ ) { count += 1; - printf( "# c::native::%s:ndarray:len=%d\n", NAME, len ); + printf( "# c::%s:ndarray:len=%d\n", NAME, len ); elapsed = benchmark2( iter, len ); print_results( iter, elapsed ); printf( "ok %d benchmark finished\n", count ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/lib/ndarray.native.js index d12c540de727..73b2e5bba3fa 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zcartesian-square/lib/ndarray.native.js @@ -29,6 +29,10 @@ var addon = require( './../src/addon.node' ); /** * Computes the Cartesian square for a double-precision complex floating-point strided array using alternative indexing semantics. * +* ## Notes +* +* - Pairs are stored as rows in the output matrix, where the first column contains the first element of each pair and the second column contains the second element. +* * @param {NonNegativeInteger} N - number of indexed elements * @param {Complex128Array} x - input array * @param {integer} strideX - stride length for `x` diff --git a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/ndarray.native.js index 31b283dd0d2a..6ca46496abca 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a double-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex128Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/zindex_of_column.native.js b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/zindex_of_column.native.js index 3ef6eb57f36d..794ef0dc3bbf 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/zindex_of_column.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-column/lib/zindex_of_column.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first column in a double-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching column, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in row-major order. When the matrix is stored in column-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/ndarray.native.js index 0c7c869e307f..779bf37b1f1d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a double-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex128Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/zindex_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/zindex_of_row.native.js index 5d8e7c05fea0..a32c234148f8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/zindex_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zindex-of-row/lib/zindex_of_row.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the first row in a double-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` diff --git a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/ndarray.native.js index 2b3e929b8653..df0b6d291dec 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/ndarray.native.js @@ -31,6 +31,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a double-precision complex floating-point input matrix which has the same elements as a provided search vector using alternative indexing semantics. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` * @param {Complex128Array} A - input matrix diff --git a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/zlast_index_of_row.native.js b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/zlast_index_of_row.native.js index 58c13246725d..264839a58d3f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/zlast_index_of_row.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/zlast-index-of-row/lib/zlast_index_of_row.native.js @@ -34,6 +34,11 @@ var addon = require( './../src/addon.node' ); /** * Returns the index of the last row in a double-precision complex floating-point input matrix which has the same elements as a provided search vector. * +* ## Notes +* +* - If the function is provided an empty matrix or if the function is unable to find a matching row, the function returns `-1` (i.e., an invalid index). +* - The `workspace` array is only applicable when an input matrix is stored in column-major order. When the matrix is stored in row-major order, the workspace array is ignored. +* * @param {string} order - storage layout * @param {PositiveInteger} M - number of rows in `A` * @param {PositiveInteger} N - number of columns in `A` 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 8ea1141eb8ed..f9cde0cd91d5 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 @@ -77,13 +77,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static float rand_float( void ) { - int r = rand(); - return (float)r / ( (float)RAND_MAX + 1.0f ); +static float random_uniform( const float min, const float max ) { + float v = (float)rand() / ( (float)RAND_MAX + 1.0f ); + return min + ( v*( max-min ) ); } /** @@ -94,14 +96,17 @@ static float rand_float( void ) { static double benchmark( void ) { double elapsed; double t; - float x; + float *x; bool out; int i; + x = (float *) malloc( 100 * sizeof( float ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0f, 1500.0f ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0f*rand_float() ) + 500.0f; - out = stdlib_base_float32_is_same_value_zero( x, x ); + out = stdlib_base_float32_is_same_value_zero( x[ i%100 ], x[ i%100 ] ); if ( out != true ) { printf( "unexpected result\n" ); break; @@ -111,6 +116,7 @@ static double benchmark( void ) { if ( out != true ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 2c37eab592c0..3cde27324b92 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 @@ -77,13 +77,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static float rand_float( void ) { - int r = rand(); - return (float)r / ( (float)RAND_MAX + 1.0f ); +static float random_uniform( const float min, const float max ) { + float v = (float)rand() / ( (float)RAND_MAX + 1.0f ); + return min + ( v*( max-min ) ); } /** @@ -94,14 +96,17 @@ static float rand_float( void ) { static double benchmark( void ) { double elapsed; double t; - float x; + float *x; bool out; int i; + x = (float *) malloc( 100 * sizeof( float ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0f, 1500.0f ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0f*rand_float() ) + 500.0f; - out = stdlib_base_float32_is_same_value( x, x ); + out = stdlib_base_float32_is_same_value( x[ i%100 ], x[ i%100 ] ); if ( out != true ) { printf( "unexpected result\n" ); break; @@ -111,6 +116,7 @@ static double benchmark( void ) { if ( out != true ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 3987ee18fcd3..8f55a3402a07 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 @@ -76,13 +76,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static float rand_float( void ) { - int r = rand(); - return (float)r / ( (float)RAND_MAX + 1.0f ); +static float random_uniform( const float min, const float max ) { + float v = (float)rand() / ( (float)RAND_MAX + 1.0f ); + return min + ( v*( max-min ) ); } /** @@ -94,13 +96,16 @@ static double benchmark( void ) { double elapsed; uint32_t w; double t; - float x; + float *x; int i; + x = (float *) malloc( 100 * sizeof( float ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( -500.0f, 500.0f ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0f*rand_float() ) - 500.0f; - stdlib_base_float32_to_word( x, &w ); + stdlib_base_float32_to_word( x[ i%100 ], &w ); if ( w == 1 ) { // Note: should not generate the smallest subnormal printf( "unexpected result\n" ); break; @@ -110,6 +115,7 @@ static double benchmark( void ) { if ( w == 1 ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 66ae19a7d90e..3a671ea8e958 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 @@ -77,13 +77,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -93,15 +95,18 @@ static double rand_double( void ) { */ static double benchmark( void ) { double elapsed; - double x; + double *x; double t; bool out; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0, 1500.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0*rand_double() ) + 500.0; - out = stdlib_base_float64_is_same_value_zero( x, x ); + out = stdlib_base_float64_is_same_value_zero( x[ i%100 ], x[ i%100 ] ); if ( out != true ) { printf( "unexpected result\n" ); break; @@ -111,6 +116,7 @@ static double benchmark( void ) { if ( out != true ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 0097e61287e1..7a106426ce57 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 @@ -77,13 +77,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -93,15 +95,18 @@ static double rand_double( void ) { */ static double benchmark( void ) { double elapsed; - double x; + double *x; double t; bool out; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0, 1500.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0*rand_double() ) + 500.0; - out = stdlib_base_float64_is_same_value( x, x ); + out = stdlib_base_float64_is_same_value( x[ i%100 ], x[ i%100 ] ); if ( out != true ) { printf( "unexpected result\n" ); break; @@ -111,6 +116,7 @@ static double benchmark( void ) { if ( out != true ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 6fb1f6a19b10..9f2f28efbe8e 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 @@ -76,13 +76,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -93,14 +95,17 @@ static double rand_double( void ) { static double benchmark( void ) { double elapsed; uint32_t h; - double x; + double *x; double t; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0, 1500.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0*rand_double() ) + 500.0; - stdlib_base_float64_get_high_word( x, &h ); + stdlib_base_float64_get_high_word( x[ i%100 ], &h ); if ( h == 0 ) { printf( "unexpected result\n" ); break; @@ -110,6 +115,7 @@ static double benchmark( void ) { if ( h == 0 ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 d69d4ecd3dca..ddfa0d782bfd 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 @@ -76,13 +76,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -93,14 +95,17 @@ static double rand_double( void ) { static double benchmark( void ) { double elapsed; uint32_t l; - double x; + double *x; double t; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( 500.0, 1500.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0*rand_double() ) + 500.0; - stdlib_base_float64_get_low_word( x, &l ); + stdlib_base_float64_get_low_word( x[ i%100 ], &l ); if ( l == 0 ) { printf( "unexpected result\n" ); break; @@ -110,6 +115,7 @@ static double benchmark( void ) { if ( l == 0 ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 6870ee3ad21d..06c156a65d51 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 @@ -76,13 +76,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -93,14 +95,17 @@ static double rand_double( void ) { static double benchmark( void ) { double elapsed; int8_t out; - double x; + double *x; double t; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( -100.0, 100.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( rand_double()*200.0 ) - 100.0; - out = stdlib_base_float64_signbit( x ); + out = stdlib_base_float64_signbit( x[ i%100 ] ); if ( out != 0 && out != 1 ) { printf( "unexpected result\n" ); break; @@ -110,6 +115,7 @@ static double benchmark( void ) { if ( out != 0 && out != 1 ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } 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 db05a3e69c03..3a5f1796e8dc 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 @@ -76,13 +76,15 @@ static double tic( void ) { } /** -* Generates a random number on the interval [0,1). +* Generates a random number on the interval [min,max). * -* @return random number +* @param min minimum value (inclusive) +* @param max maximum value (exclusive) +* @return random number */ -static double rand_double( void ) { - int r = rand(); - return (double)r / ( (double)RAND_MAX + 1.0 ); +static double random_uniform( const double min, const double max ) { + double v = (double)rand() / ( (double)RAND_MAX + 1.0 ); + return min + ( v*( max-min ) ); } /** @@ -94,14 +96,17 @@ static double benchmark( void ) { double elapsed; uint32_t h; uint32_t l; - double x; + double *x; double t; int i; + x = (double *) malloc( 100 * sizeof( double ) ); + for ( i = 0; i < 100; i++ ) { + x[ i ] = random_uniform( -500.0, 500.0 ); + } t = tic(); for ( i = 0; i < ITERATIONS; i++ ) { - x = ( 1000.0*rand_double() ) - 500.0; - stdlib_base_float64_to_words( x, &h, &l ); + stdlib_base_float64_to_words( x[ i%100 ], &h, &l ); if ( h != 0 && h == l ) { printf( "unexpected result\n" ); break; @@ -111,6 +116,7 @@ static double benchmark( void ) { if ( h != 0 && h == l ) { printf( "unexpected result\n" ); } + free( x ); return elapsed; } diff --git a/lib/node_modules/@stdlib/strided/base/cmap/README.md b/lib/node_modules/@stdlib/strided/base/cmap/README.md index 3d319fdc4a48..a707afe6d36a 100644 --- a/lib/node_modules/@stdlib/strided/base/cmap/README.md +++ b/lib/node_modules/@stdlib/strided/base/cmap/README.md @@ -210,10 +210,10 @@ static float complex scale( const float complex x ) { return ( re+10.0f ) + ( im+10.0f )*I; } -float complex X[] = { 1.0f+1.0f*I, 2.0f+2.0f*I, 3.0f+3.0f*I, 4.0f+4.0f*I, 5.0f+5.0f*I, 6.0f+6.0f*I }; +const float complex X[] = { 1.0f+1.0f*I, 2.0f+2.0f*I, 3.0f+3.0f*I, 4.0f+4.0f*I, 5.0f+5.0f*I, 6.0f+6.0f*I }; float complex Y[] = { 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f }; -int64_t N = 6; +const int64_t N = 6; stdlib_strided_cmap( N, X, 1, Y, 1, scale ); ``` @@ -265,17 +265,17 @@ static float complex scale( const float complex x ) { int main( void ) { // Create an input strided array: - float complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; + const float complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; // Create an output strided array: float complex Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_cmap( N, X, strideX, Y, strideY, scale ); diff --git a/lib/node_modules/@stdlib/strided/base/cmap/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/cmap/examples/c/example.c index 6789ca8092a5..c11aef89f30d 100644 --- a/lib/node_modules/@stdlib/strided/base/cmap/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/cmap/examples/c/example.c @@ -37,11 +37,11 @@ int main( void ) { float complex Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_cmap( N, X, strideX, Y, strideY, scale ); diff --git a/lib/node_modules/@stdlib/strided/base/dmap2/README.md b/lib/node_modules/@stdlib/strided/base/dmap2/README.md index 9f878100fe9f..16ebba0872c5 100644 --- a/lib/node_modules/@stdlib/strided/base/dmap2/README.md +++ b/lib/node_modules/@stdlib/strided/base/dmap2/README.md @@ -212,11 +212,11 @@ static double add( const double x, const double y ) { return x + y; } -double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; -double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; +const double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; +const double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; double Z[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; -int64_t N = 6; +const int64_t N = 6; stdlib_strided_dmap2( N, X, 1, Y, 1, Z, 1, add ); ``` @@ -267,19 +267,19 @@ static double add( const double x, const double y ) { int main( void ) { // Create input strided arrays: - double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; - double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; + const double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; + const double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; // Create an output strided array: double Z[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; - int64_t strideZ = 1; + const int64_t strideX = 1; + const int64_t strideY = -1; + const int64_t strideZ = 1; // Apply the callback: stdlib_strided_dmap2( N, X, strideX, Y, strideY, Z, strideZ, add ); diff --git a/lib/node_modules/@stdlib/strided/base/dmap2/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/dmap2/examples/c/example.c index af138c8f30dd..73ebf5bddd8c 100644 --- a/lib/node_modules/@stdlib/strided/base/dmap2/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/dmap2/examples/c/example.c @@ -28,19 +28,19 @@ static double add( const double x, const double y ) { int main( void ) { // Create input strided arrays: - double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; - double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; + const double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; + const double Y[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; // Create an output strided array: double Z[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; - int64_t strideZ = 1; + const int64_t strideX = 1; + const int64_t strideY = -1; + const int64_t strideZ = 1; // Apply the callback: stdlib_strided_dmap2( N, X, strideX, Y, strideY, Z, strideZ, add ); diff --git a/lib/node_modules/@stdlib/strided/base/dmskmap/README.md b/lib/node_modules/@stdlib/strided/base/dmskmap/README.md index 4bf580a5343f..373cbefbac5f 100644 --- a/lib/node_modules/@stdlib/strided/base/dmskmap/README.md +++ b/lib/node_modules/@stdlib/strided/base/dmskmap/README.md @@ -226,11 +226,11 @@ static double scale( const double x ) { return x * 10.0; } -double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; -uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; +const double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; +const uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; double Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; -int64_t N = 6; +const int64_t N = 6; stdlib_strided_dmskmap( N, X, 1, M, 1, Y, 1, scale ); ``` @@ -281,21 +281,21 @@ static double scale( const double x ) { int main( void ) { // Create an input strided array: - double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; + const double X[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 }; // Create a mask strided array: - uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; + const uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; // Create an output strided array: double Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideM = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideM = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_dmskmap( N, X, strideX, M, strideM, Y, strideY, scale ); diff --git a/lib/node_modules/@stdlib/strided/base/dmskmap/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/dmskmap/examples/c/example.c index e91615871552..4e1d2140bcd9 100644 --- a/lib/node_modules/@stdlib/strided/base/dmskmap/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/dmskmap/examples/c/example.c @@ -37,12 +37,12 @@ int main( void ) { double Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideM = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideM = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_dmskmap( N, X, strideX, M, strideM, Y, strideY, scale ); diff --git a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/README.md b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/README.md index 0bdd2f59a9d4..5e3b2390ffe6 100644 --- a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/README.md +++ b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/README.md @@ -168,13 +168,13 @@ int64_t stdlib_strided_max_view_buffer_index( const int64_t N, const int64_t str int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = 2; + const int64_t stride = 2; // Define an offset: - int64_t offset = 100; + const int64_t offset = 100; // Compute the maximum accessible index: int64_t idx = stdlib_strided_max_view_buffer_index( N, stride, offset ); diff --git a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/examples/c/example.c index c9780deecc8a..d6bde32ec560 100644 --- a/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/max-view-buffer-index/examples/c/example.c @@ -23,13 +23,13 @@ int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = 2; + const int64_t stride = 2; // Define an offset: - int64_t offset = 100; + const int64_t offset = 100; // Compute the maximum accessible index: int64_t idx = stdlib_strided_max_view_buffer_index( N, stride, offset ); diff --git a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/README.md b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/README.md index 86c6ae8287f2..3c4a1d6c7af6 100644 --- a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/README.md +++ b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/README.md @@ -168,13 +168,13 @@ int64_t stdlib_strided_min_view_buffer_index( const int64_t N, const int64_t str int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = -2; + const int64_t stride = -2; // Define an offset: - int64_t offset = 100; + const int64_t offset = 100; // Compute the minimum accessible index: int64_t idx = stdlib_strided_min_view_buffer_index( N, stride, offset ); diff --git a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/examples/c/example.c index 56b05257b445..60d2e811181d 100644 --- a/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/min-view-buffer-index/examples/c/example.c @@ -23,13 +23,13 @@ int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = -2; + const int64_t stride = -2; // Define an offset: - int64_t offset = 100; + const int64_t offset = 100; // Compute the minimum accessible index: int64_t idx = stdlib_strided_min_view_buffer_index( N, stride, offset ); diff --git a/lib/node_modules/@stdlib/strided/base/smskmap2/README.md b/lib/node_modules/@stdlib/strided/base/smskmap2/README.md index ed3a358a2ca3..f67bf1c48e74 100644 --- a/lib/node_modules/@stdlib/strided/base/smskmap2/README.md +++ b/lib/node_modules/@stdlib/strided/base/smskmap2/README.md @@ -232,12 +232,12 @@ static float addf( const float x, const float y ) { return x + y; } -float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; -float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; +const float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; +const float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; float Z[] = { 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f }; -uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; +const uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; -int64_t N = 6; +const int64_t N = 6; stdlib_strided_smskmap2( N, X, 1, Y, 1, M, 1, Z, 1, addf ); ``` @@ -290,23 +290,23 @@ static float addf( const float x, const float y ) { int main( void ) { // Create input strided arrays: - float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; - float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; + const float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; + const float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; // Create a mask strided array: - uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; + const uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; // Create an output strided array: float Z[] = { 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; - int64_t strideZ = 1; - int64_t strideM = 1; + const int64_t strideX = 1; + const int64_t strideY = -1; + const int64_t strideZ = 1; + const int64_t strideM = 1; // Apply the callback: stdlib_strided_smskmap2( N, X, strideX, Y, strideY, M, strideM, Z, strideZ, addf ); diff --git a/lib/node_modules/@stdlib/strided/base/smskmap2/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/smskmap2/examples/c/example.c index 03ab49a8c56b..b1dc76962195 100644 --- a/lib/node_modules/@stdlib/strided/base/smskmap2/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/smskmap2/examples/c/example.c @@ -28,23 +28,23 @@ static float addf( const float x, const float y ) { int main( void ) { // Create input strided arrays: - float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; - float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; + const float X[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; + const float Y[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f }; // Create a mask strided array: - uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; + const uint8_t M[] = { 0, 0, 1, 0, 0, 1 }; // Create an output strided array: float Z[] = { 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; - int64_t strideZ = 1; - int64_t strideM = 1; + const int64_t strideX = 1; + const int64_t strideY = -1; + const int64_t strideZ = 1; + const int64_t strideM = 1; // Apply the callback: stdlib_strided_smskmap2( N, X, strideX, Y, strideY, M, strideM, Z, strideZ, addf ); diff --git a/lib/node_modules/@stdlib/strided/base/stride2offset/README.md b/lib/node_modules/@stdlib/strided/base/stride2offset/README.md index c6205c0d92bd..5974c2175b6a 100644 --- a/lib/node_modules/@stdlib/strided/base/stride2offset/README.md +++ b/lib/node_modules/@stdlib/strided/base/stride2offset/README.md @@ -176,10 +176,10 @@ int64_t stdlib_strided_stride2offset( int64_t N, int64_t stride ); int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = -2; + const int64_t stride = -2; // Compute the offset: int64_t offset = stdlib_strided_stride2offset( N, stride ); diff --git a/lib/node_modules/@stdlib/strided/base/stride2offset/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/stride2offset/examples/c/example.c index 566608959470..9bd4ce440e3a 100644 --- a/lib/node_modules/@stdlib/strided/base/stride2offset/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/stride2offset/examples/c/example.c @@ -23,10 +23,10 @@ int main( void ) { // Specify the number of indexed elements: - int64_t N = 6; + const int64_t N = 6; // Define a stride: - int64_t stride = -2; + const int64_t stride = -2; // Compute the offset: int64_t offset = stdlib_strided_stride2offset( N, stride ); diff --git a/lib/node_modules/@stdlib/strided/base/zmap/README.md b/lib/node_modules/@stdlib/strided/base/zmap/README.md index 171d8b47b35f..31f2db4d0547 100644 --- a/lib/node_modules/@stdlib/strided/base/zmap/README.md +++ b/lib/node_modules/@stdlib/strided/base/zmap/README.md @@ -210,10 +210,10 @@ static double complex scale( const double complex x ) { return ( re+10.0 ) + ( im+10.0 )*I; } -double complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; +const double complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; double complex Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; -int64_t N = 6; +const int64_t N = 6; stdlib_strided_zmap( N, X, 1, Y, 1, scale ); ``` @@ -265,17 +265,17 @@ static double complex scale( const double complex x ) { int main( void ) { // Create an input strided array: - double complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; + const double complex X[] = { 1.0+1.0*I, 2.0+2.0*I, 3.0+3.0*I, 4.0+4.0*I, 5.0+5.0*I, 6.0+6.0*I }; // Create an output strided array: double complex Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_zmap( N, X, strideX, Y, strideY, scale ); diff --git a/lib/node_modules/@stdlib/strided/base/zmap/examples/c/example.c b/lib/node_modules/@stdlib/strided/base/zmap/examples/c/example.c index 8469bd357c74..ffef74bc86ef 100644 --- a/lib/node_modules/@stdlib/strided/base/zmap/examples/c/example.c +++ b/lib/node_modules/@stdlib/strided/base/zmap/examples/c/example.c @@ -37,11 +37,11 @@ int main( void ) { double complex Y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - int64_t N = 6; + const int64_t N = 6; // Define the strides: - int64_t strideX = 1; - int64_t strideY = -1; + const int64_t strideX = 1; + const int64_t strideY = -1; // Apply the callback: stdlib_strided_zmap( N, X, strideX, Y, strideY, scale );