diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/README.md b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/README.md index 793abd441c2a..fce931e26e09 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/README.md @@ -36,7 +36,7 @@ limitations under the License. var sdssumpw = require( '@stdlib/blas/ext/base/sdssumpw' ); ``` -#### sdssumpw( N, x, stride ) +#### sdssumpw( N, x, strideX ) Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. @@ -44,9 +44,8 @@ Computes the sum of single-precision floating-point strided array elements using var Float32Array = require( '@stdlib/array/float32' ); var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); -var N = x.length; -var v = sdssumpw( N, x, 1 ); +var v = sdssumpw( x.length, x, 1 ); // returns 1.0 ``` @@ -54,9 +53,9 @@ The function has the following parameters: - **N**: number of indexed elements. - **x**: input [`Float32Array`][@stdlib/array/float32]. -- **stride**: index increment for `x`. +- **strideX**: stride length. -The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to compute the sum of every other element in `x`, +The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to compute the sum of every other element: ```javascript var Float32Array = require( '@stdlib/array/float32' ); @@ -81,7 +80,7 @@ var v = sdssumpw( 4, x1, 2 ); // returns 5.0 ``` -#### sdssumpw.ndarray( N, x, stride, offset ) +#### sdssumpw.ndarray( N, x, strideX, offsetX ) Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. @@ -96,9 +95,9 @@ var v = sdssumpw.ndarray( 3, x, 1, 0 ); The function has the following additional parameters: -- **offset**: starting index for `x`. +- **offsetX**: starting index. -While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying `buffer`, the `offset` parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other value in `x` starting from the second value +While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other element starting from the second element: ```javascript var Float32Array = require( '@stdlib/array/float32' ); @@ -131,11 +130,12 @@ var v = sdssumpw.ndarray( 4, x, 2, 1 ); ```javascript -var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var sdssumpw = require( '@stdlib/blas/ext/base/sdssumpw' ); -var x = filledarrayBy( 10, 'float32', discreteUniform( 0, 100 ) ); +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float32' +}); console.log( x ); var v = sdssumpw( x.length, x, 1 ); @@ -146,8 +146,123 @@ console.log( v ); + + * * * +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/blas/ext/base/sdssumpw.h" +``` + +#### stdlib_strided_sdssumpw( N, \*X, strideX ) + +Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. + +```c +const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f }; + +float v = stdlib_strided_sdssumpw( 4, x, 1 ); +// returns 10.0f +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **X**: `[in] float*` input array. +- **strideX**: `[in] CBLAS_INT` stride length. + +```c +float stdlib_strided_sdssumpw( const CBLAS_INT N, const float *X, const CBLAS_INT strideX ); +``` + +#### stdlib_strided_sdssumpw_ndarray( N, \*X, strideX, offsetX ) + +Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. + +```c +const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f }; + +float v = stdlib_strided_sdssumpw_ndarray( 4, x, 1, 0 ); +// returns 10.0f +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **X**: `[in] float*` input array. +- **strideX**: `[in] CBLAS_INT` stride length. +- **offsetX**: `[in] CBLAS_INT` starting index. + +```c +float stdlib_strided_sdssumpw_ndarray( const CBLAS_INT N, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/blas/ext/base/sdssumpw.h" +#include + +int main( void ) { + // Create a strided array: + const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f, 7.0f, 8.0f }; + + // Specify the number of elements: + const int N = 4; + + // Specify the stride length: + const int strideX = 2; + + // Compute the sum: + float v = stdlib_strided_sdssumpw( N, x, strideX ); + + // Print the result: + printf( "Sum: %f\n", v ); +} +``` + +
+ + + +
+ + +
## References diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.js index 18c15dfc67f6..ce2b71cca52a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.js @@ -21,8 +21,7 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var uniform = require( '@stdlib/random/base/uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var uniform = require( '@stdlib/random/array/uniform' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var pkg = require( './../package.json' ).name; @@ -31,7 +30,9 @@ var sdssumpw = require( './../lib/sdssumpw.js' ); // VARIABLES // -var rand = uniform( -10.0, 10.0 ); +var options = { + 'dtype': 'float32' +}; // FUNCTIONS // @@ -44,7 +45,7 @@ var rand = uniform( -10.0, 10.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float32', rand ); + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.native.js index 2239dd1c4233..cedcaee50836 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.native.js @@ -22,8 +22,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); -var uniform = require( '@stdlib/random/base/uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var uniform = require( '@stdlib/random/array/uniform' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var tryRequire = require( '@stdlib/utils/try-require' ); @@ -36,7 +35,9 @@ var sdssumpw = tryRequire( resolve( __dirname, './../lib/sdssumpw.native.js' ) ) var opts = { 'skip': ( sdssumpw instanceof Error ) }; -var rand = uniform( -10.0, 10.0 ); +var options = { + 'dtype': 'float32' +}; // FUNCTIONS // @@ -49,7 +50,7 @@ var rand = uniform( -10.0, 10.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float32', rand ); + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.js index 70ccc7393aba..8dce65d7cf3f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.js @@ -21,8 +21,7 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var uniform = require( '@stdlib/random/base/uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var uniform = require( '@stdlib/random/array/uniform' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var pkg = require( './../package.json' ).name; @@ -31,7 +30,9 @@ var sdssumpw = require( './../lib/ndarray.js' ); // VARIABLES // -var rand = uniform( -10.0, 10.0 ); +var options = { + 'dtype': 'float32' +}; // FUNCTIONS // @@ -44,7 +45,7 @@ var rand = uniform( -10.0, 10.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float32', rand ); + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.native.js index cc8fbd9f6af5..ac63174a2da8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/benchmark.ndarray.native.js @@ -22,8 +22,7 @@ var resolve = require( 'path' ).resolve; var bench = require( '@stdlib/bench' ); -var uniform = require( '@stdlib/random/base/uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var uniform = require( '@stdlib/random/array/uniform' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var tryRequire = require( '@stdlib/utils/try-require' ); @@ -36,7 +35,9 @@ var sdssumpw = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) ); var opts = { 'skip': ( sdssumpw instanceof Error ) }; -var rand = uniform( -10.0, 10.0 ); +var options = { + 'dtype': 'float32' +}; // FUNCTIONS // @@ -49,7 +50,7 @@ var rand = uniform( -10.0, 10.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float32', rand ); + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/c/benchmark.length.c index 76d19c81b02e..42587dfda62e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/benchmark/c/benchmark.length.c @@ -94,7 +94,7 @@ static float rand_float( void ) { * @param len array length * @return elapsed time in seconds */ -static double benchmark( int iterations, int len ) { +static double benchmark1( int iterations, int len ) { double elapsed; float x[ len ]; float v; @@ -107,6 +107,7 @@ static double benchmark( int iterations, int len ) { v = 0.0f; t = tic(); for ( i = 0; i < iterations; i++ ) { + // cppcheck-suppress uninitvar v = stdlib_strided_sdssumpw( len, x, 1 ); if ( v != v ) { printf( "should not return NaN\n" ); @@ -120,6 +121,40 @@ static double benchmark( int iterations, int len ) { return elapsed; } +/** +* Runs a benchmark. +* +* @param iterations number of iterations +* @param len array length +* @return elapsed time in seconds +*/ +static double benchmark2( int iterations, int len ) { + double elapsed; + float x[ len ]; + float v; + double t; + int i; + + for ( i = 0; i < len; i++ ) { + x[ i ] = ( rand_float()*20000.0f ) - 10000.0f; + } + v = 0.0f; + t = tic(); + for ( i = 0; i < iterations; i++ ) { + // cppcheck-suppress uninitvar + v = stdlib_strided_sdssumpw_ndarray( len, x, 1, 0 ); + if ( v != v ) { + printf( "should not return NaN\n" ); + break; + } + } + elapsed = tic() - t; + if ( v != v ) { + printf( "should not return NaN\n" ); + } + return elapsed; +} + /** * Main execution sequence. */ @@ -142,7 +177,18 @@ int main( void ) { for ( j = 0; j < REPEATS; j++ ) { count += 1; printf( "# c::%s:len=%d\n", NAME, len ); - elapsed = benchmark( iter, len ); + elapsed = benchmark1( iter, len ); + print_results( iter, elapsed ); + printf( "ok %d benchmark finished\n", count ); + } + } + for ( i = MIN; i <= MAX; i++ ) { + len = pow( 10, i ); + iter = ITERATIONS / pow( 10, i-1 ); + for ( j = 0; j < REPEATS; j++ ) { + count += 1; + 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/sdssumpw/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/repl.txt index ce9a66263ac4..bb1fde8eda3a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/repl.txt +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/repl.txt @@ -1,14 +1,13 @@ -{{alias}}( N, x, stride ) +{{alias}}( N, x, strideX ) Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. - The `N` and stride parameters determine which elements in the strided - array are accessed are accessed - at runtime. + The `N` and stride parameters determine which elements in the strided array + are accessed are accessed at runtime. - Indexing is relative to the first index. To introduce an offset, - use a typed array view. + Indexing is relative to the first index. To introduce an offset, use a typed + array view. If `N <= 0`, the function returns `0.0`. @@ -20,8 +19,8 @@ x: Float32Array Input array. - stride: integer - Index increment. + strideX: integer + Stride length. Returns ------- @@ -37,26 +36,24 @@ // Using `N` and stride parameters: > x = new {{alias:@stdlib/array/float32}}( [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0 ] ); - > var stride = 2; - > {{alias}}( 3, x, stride ) + > {{alias}}( 3, x, 2 ) 1.0 // Using view offsets: > var x0 = new {{alias:@stdlib/array/float32}}( [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0 ] ); > var x1 = new {{alias:@stdlib/array/float32}}( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); - > stride = 2; - > {{alias}}( 3, x1, stride ) + > {{alias}}( 3, x1, 2 ) -1.0 -{{alias}}.ndarray( N, x, stride, offset ) +{{alias}}.ndarray( N, x, strideX, offsetX ) Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. While typed array views mandate a view offset based on the underlying - buffer, the `offset` parameter supports indexing semantics based on a - starting index. + buffer, the offset parameter supports indexing semantics based on a starting + index. Parameters ---------- @@ -66,10 +63,10 @@ x: Float32Array Input array. - stride: integer - Index increment. + strideX: integer + Stride length. - offset: integer + offsetX: integer Starting index. Returns diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/types/index.d.ts index cb65a2fb7854..bac7d29477c1 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/types/index.d.ts +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/docs/types/index.d.ts @@ -27,7 +27,7 @@ interface Routine { * * @param N - number of indexed elements * @param x - input array - * @param stride - stride length + * @param strideX - stride length * @returns sum * * @example @@ -38,15 +38,15 @@ interface Routine { * var v = sdssumpw( x.length, x, 1 ); * // returns 1.0 */ - ( N: number, x: Float32Array, stride: number ): number; + ( N: number, x: Float32Array, strideX: number ): number; /** * Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. * * @param N - number of indexed elements * @param x - input array - * @param stride - stride length - * @param offset - starting index + * @param strideX - stride length + * @param offsetX - starting index * @returns sum * * @example @@ -57,7 +57,7 @@ interface Routine { * var v = sdssumpw.ndarray( x.length, x, 1, 0 ); * // returns 1.0 */ - ndarray( N: number, x: Float32Array, stride: number, offset: number ): number; + ndarray( N: number, x: Float32Array, strideX: number, offsetX: number ): number; } /** @@ -65,7 +65,7 @@ interface Routine { * * @param N - number of indexed elements * @param x - input array -* @param stride - stride length +* @param strideX - stride length * @returns sum * * @example diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/c/example.c index 295e00682ff5..c24751552a1f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/c/example.c +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/c/example.c @@ -17,22 +17,21 @@ */ #include "stdlib/blas/ext/base/sdssumpw.h" -#include #include int main( void ) { // Create a strided array: - const float x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 }; + const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f, 7.0f, 8.0f }; // Specify the number of elements: - const int64_t N = 4; + const int N = 4; // Specify the stride length: - const int64_t stride = 2; + const int strideX = 2; // Compute the sum: - float v = stdlib_strided_sdssumpw( N, x, stride ); + float v = stdlib_strided_sdssumpw( N, x, strideX ); // Print the result: - printf( "sum: %f\n", v ); + printf( "Sum: %f\n", v ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/index.js index 3d48df149b14..a95ad8f7a235 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/examples/index.js @@ -18,11 +18,12 @@ 'use strict'; -var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory; -var filledarrayBy = require( '@stdlib/array/filled-by' ); +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var sdssumpw = require( './../lib' ); -var x = filledarrayBy( 10, 'float32', discreteUniform( 0, 100 ) ); +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float32' +}); console.log( x ); var v = sdssumpw( x.length, x, 1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/include/stdlib/blas/ext/base/sdssumpw.h b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/include/stdlib/blas/ext/base/sdssumpw.h index 0919f44e099f..9876015ca152 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/include/stdlib/blas/ext/base/sdssumpw.h +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/include/stdlib/blas/ext/base/sdssumpw.h @@ -19,7 +19,7 @@ #ifndef STDLIB_BLAS_EXT_BASE_SDSSUMPW_H #define STDLIB_BLAS_EXT_BASE_SDSSUMPW_H -#include +#include "stdlib/blas/base/shared.h" /* * If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler. @@ -31,7 +31,12 @@ extern "C" { /** * Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. */ -float stdlib_strided_sdssumpw( const int64_t N, const float *X, const int64_t stride ); +float API_SUFFIX(stdlib_strided_sdssumpw)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX ); + +/** +* Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. +*/ +float API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ); #ifdef __cplusplus } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/index.js index e366148a3a14..01afcf88c3de 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/index.js @@ -29,7 +29,7 @@ * * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); * -* var v = sdssumpw( 4, x, 1 ); +* var v = sdssumpw( x.length, x, 1 ); * // returns 1.0 * * @example diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.js index 2bb2df4d96cb..2a24abbb6cf0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.js @@ -45,8 +45,8 @@ var BLOCKSIZE = 128; * * @param {PositiveInteger} N - number of indexed elements * @param {Float32Array} x - input array -* @param {integer} stride - stride length -* @param {NonNegativeInteger} offset - starting index +* @param {integer} strideX - stride length +* @param {NonNegativeInteger} offsetX - starting index * @returns {number} sum * * @example @@ -57,7 +57,7 @@ var BLOCKSIZE = 128; * var v = sdssumpw( 4, x, 2, 1 ); * // returns 5.0 */ -function sdssumpw( N, x, stride, offset ) { +function sdssumpw( N, x, strideX, offsetX ) { var ix; var s0; var s1; @@ -75,57 +75,57 @@ function sdssumpw( N, x, stride, offset ) { if ( N <= 0 ) { return 0.0; } - if ( N === 1 || stride === 0 ) { - return x[ offset ]; + ix = offsetX; + if ( strideX === 0 ) { + return float64ToFloat32( N * x[ ix ] ); } - ix = offset; if ( N < 8 ) { // Use simple summation... s = 0.0; for ( i = 0; i < N; i++ ) { s += x[ ix ]; - ix += stride; + ix += strideX; } return float64ToFloat32( s ); } if ( N <= BLOCKSIZE ) { // Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)... s0 = x[ ix ]; - s1 = x[ ix+stride ]; - s2 = x[ ix+(2*stride) ]; - s3 = x[ ix+(3*stride) ]; - s4 = x[ ix+(4*stride) ]; - s5 = x[ ix+(5*stride) ]; - s6 = x[ ix+(6*stride) ]; - s7 = x[ ix+(7*stride) ]; - ix += 8 * stride; + s1 = x[ ix+strideX ]; + s2 = x[ ix+(2*strideX) ]; + s3 = x[ ix+(3*strideX) ]; + s4 = x[ ix+(4*strideX) ]; + s5 = x[ ix+(5*strideX) ]; + s6 = x[ ix+(6*strideX) ]; + s7 = x[ ix+(7*strideX) ]; + ix += 8 * strideX; M = N % 8; for ( i = 8; i < N-M; i += 8 ) { s0 += x[ ix ]; - s1 += x[ ix+stride ]; - s2 += x[ ix+(2*stride) ]; - s3 += x[ ix+(3*stride) ]; - s4 += x[ ix+(4*stride) ]; - s5 += x[ ix+(5*stride) ]; - s6 += x[ ix+(6*stride) ]; - s7 += x[ ix+(7*stride) ]; - ix += 8 * stride; + s1 += x[ ix+strideX ]; + s2 += x[ ix+(2*strideX) ]; + s3 += x[ ix+(3*strideX) ]; + s4 += x[ ix+(4*strideX) ]; + s5 += x[ ix+(5*strideX) ]; + s6 += x[ ix+(6*strideX) ]; + s7 += x[ ix+(7*strideX) ]; + ix += 8 * strideX; } // Pairwise sum the accumulators: - s = ((s0+s1) + (s2+s3)) + ((s4+s5) + (s6+s7)); + s = ( (s0+s1) + (s2+s3) ) + ( (s4+s5) + (s6+s7) ); // Clean-up loop... for ( i; i < N; i++ ) { s += x[ ix ]; - ix += stride; + ix += strideX; } return float64ToFloat32( s ); } // Recurse by dividing by two, but avoiding non-multiples of unroll factor... n = floor( N/2 ); n -= n % 8; - return float64ToFloat32( sdssumpw( n, x, stride, ix ) + sdssumpw( N-n, x, stride, ix+(n*stride) ) ); // eslint-disable-line max-len + return float64ToFloat32( sdssumpw( n, x, strideX, ix ) + sdssumpw( N-n, x, strideX, ix+(n*strideX) ) ); // eslint-disable-line max-len } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.native.js index d026e91066f8..e74c9cf7b856 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/ndarray.native.js @@ -20,9 +20,7 @@ // MODULES // -var minViewBufferIndex = require( '@stdlib/strided/base/min-view-buffer-index' ); -var offsetView = require( '@stdlib/strided/base/offset-view' ); -var addon = require( './sdssumpw.native.js' ); +var addon = require( './../src/addon.node' ); // MAIN // @@ -32,8 +30,8 @@ var addon = require( './sdssumpw.native.js' ); * * @param {PositiveInteger} N - number of indexed elements * @param {Float32Array} x - input array -* @param {integer} stride - stride length -* @param {NonNegativeInteger} offset - starting index +* @param {integer} strideX - stride length +* @param {NonNegativeInteger} offsetX - starting index * @returns {number} sum * * @example @@ -44,11 +42,8 @@ var addon = require( './sdssumpw.native.js' ); * var v = sdssumpw( 4, x, 2, 1 ); * // returns 5.0 */ -function sdssumpw( N, x, stride, offset ) { - var view; - offset = minViewBufferIndex( N, stride, offset ); - view = offsetView( x, offset ); - return addon( N, view, stride ); +function sdssumpw( N, x, strideX, offsetX ) { + return addon.ndarray( N, x, strideX, offsetX ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.js index 90d3f6ab5559..16d0a0fc1ccf 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.js @@ -20,8 +20,8 @@ // MODULES // -var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' ); -var sum = require( './ndarray.js' ); +var stride2offset = require( '@stdlib/strided/base/stride2offset' ); +var ndarray = require( './ndarray.js' ); // MAIN // @@ -39,44 +39,19 @@ var sum = require( './ndarray.js' ); * * @param {PositiveInteger} N - number of indexed elements * @param {Float32Array} x - input array -* @param {integer} stride - stride length +* @param {integer} strideX - stride length * @returns {number} sum * * @example * var Float32Array = require( '@stdlib/array/float32' ); * * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); -* var N = x.length; * -* var v = sdssumpw( N, x, 1 ); +* var v = sdssumpw( x.length, x, 1 ); * // returns 1.0 */ -function sdssumpw( N, x, stride ) { - var ix; - var s; - var i; - - if ( N <= 0 ) { - return 0.0; - } - if ( N === 1 || stride === 0 ) { - return x[ 0 ]; - } - if ( stride < 0 ) { - ix = (1-N) * stride; - } else { - ix = 0; - } - if ( N < 8 ) { - // Use simple summation... - s = 0.0; - for ( i = 0; i < N; i++ ) { - s += x[ ix ]; - ix += stride; - } - return float64ToFloat32( s ); - } - return sum( N, x, stride, ix ); +function sdssumpw( N, x, strideX ) { + return ndarray( N, x, strideX, stride2offset( N, strideX ) ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.native.js index 874ecb9d545a..e3dca2b52846 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/lib/sdssumpw.native.js @@ -30,20 +30,19 @@ var addon = require( './../src/addon.node' ); * * @param {PositiveInteger} N - number of indexed elements * @param {Float32Array} x - input array -* @param {integer} stride - stride length +* @param {integer} strideX - stride length * @returns {number} sum * * @example * var Float32Array = require( '@stdlib/array/float32' ); * * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] ); -* var N = x.length; * -* var v = sdssumpw( N, x, 1 ); +* var v = sdssumpw( x.length, x, 1 ); * // returns 1.0 */ -function sdssumpw( N, x, stride ) { - return addon( N, x, stride ); +function sdssumpw( N, x, strideX ) { + return addon( N, x, strideX ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/manifest.json index b1cc0256939e..a0cd24ea60ad 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/manifest.json +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/manifest.json @@ -28,49 +28,52 @@ { "task": "build", "src": [ - "./src/sdssumpw.c" + "./src/main.c" ], "include": [ "./include" ], - "libraries": [ - "-lm" - ], + "libraries": [], "libpath": [], "dependencies": [ "@stdlib/napi/export", "@stdlib/napi/argv", "@stdlib/napi/argv-int64", - "@stdlib/napi/argv-strided-float32array" + "@stdlib/napi/argv-strided-float32array", + "@stdlib/napi/create-double", + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared" ] }, { "task": "benchmark", "src": [ - "./src/sdssumpw.c" + "./src/main.c" ], "include": [ "./include" ], - "libraries": [ - "-lm" - ], + "libraries": [], "libpath": [], - "dependencies": [] + "dependencies": [ + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared" + ] }, { "task": "examples", "src": [ - "./src/sdssumpw.c" + "./src/main.c" ], "include": [ "./include" ], - "libraries": [ - "-lm" - ], + "libraries": [], "libpath": [], - "dependencies": [] + "dependencies": [ + "@stdlib/strided/base/stride2offset", + "@stdlib/blas/base/shared" + ] } ] } diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/addon.c index 8bd493ccbbd9..ad7c2928413a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/addon.c +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/addon.c @@ -17,10 +17,12 @@ */ #include "stdlib/blas/ext/base/sdssumpw.h" +#include "stdlib/blas/base/shared.h" #include "stdlib/napi/export.h" #include "stdlib/napi/argv.h" #include "stdlib/napi/argv_int64.h" #include "stdlib/napi/argv_strided_float32array.h" +#include "stdlib/napi/create_double.h" #include /** @@ -33,14 +35,27 @@ static napi_value addon( napi_env env, napi_callback_info info ) { STDLIB_NAPI_ARGV( env, info, argv, argc, 3 ); STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 ); - STDLIB_NAPI_ARGV_INT64( env, stride, argv, 2 ); - STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, stride, argv, 1 ); - - napi_value v; - napi_status status = napi_create_double( env, stdlib_strided_sdssumpw( N, X, stride ), &v ); - assert( status == napi_ok ); + STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 2 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 1 ); + STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_sdssumpw)( N, X, strideX ), v ); + return v; +} +/** +* Receives JavaScript callback invocation data. +* +* @param env environment under which the function is invoked +* @param info callback data +* @return Node-API value +*/ +static napi_value addon_method( napi_env env, napi_callback_info info ) { + STDLIB_NAPI_ARGV( env, info, argv, argc, 4 ); + STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 ); + STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 2 ); + STDLIB_NAPI_ARGV_INT64( env, offsetX, argv, 3 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 1 ); + STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( N, X, strideX, offsetX ), v ); return v; } -STDLIB_NAPI_MODULE_EXPORT_FCN( addon ) +STDLIB_NAPI_MODULE_EXPORT_FCN_WITH_METHOD( addon, "ndarray", addon_method ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/main.c new file mode 100644 index 000000000000..70cc31662008 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/main.c @@ -0,0 +1,131 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2025 The Stdlib Authors. +* +* Licensed under the Apache License, Version 2.0 (the "License"); +* you may not use this file except in compliance with the License. +* You may obtain a copy of the License at +* +* http://www.apache.org/licenses/LICENSE-2.0 +* +* Unless required by applicable law or agreed to in writing, software +* distributed under the License is distributed on an "AS IS" BASIS, +* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +* See the License for the specific language governing permissions and +* limitations under the License. +*/ + +#include "stdlib/blas/ext/base/sdssumpw.h" +#include "stdlib/strided/base/stride2offset.h" +#include "stdlib/blas/base/shared.h" + +/** +* Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. +* +* ## Method +* +* - This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`. +* +* ## References +* +* - Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050). +* +* @param N number of indexed elements +* @param X input array +* @param strideX stride length +* @return output value +*/ +float API_SUFFIX(stdlib_strided_sdssumpw)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX ) { + CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX ); + return API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( N, X, strideX, ox ); +} + +/** +* Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and alternative indexing semantics. +* +* ## Method +* +* - This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`. +* +* ## References +* +* - Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050). +* +* @param N number of indexed elements +* @param X input array +* @param strideX stride length +* @param offsetX starting index +* @return output value +*/ +float API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( const CBLAS_INT N, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ) { + CBLAS_INT ix; + CBLAS_INT M; + CBLAS_INT n; + CBLAS_INT i; + double sum; + double s0; + double s1; + double s2; + double s3; + double s4; + double s5; + double s6; + double s7; + + if ( N <= 0 ) { + return 0.0f; + } + ix = offsetX; + if ( strideX == 0 ) { + return N * X[ ix ]; + } + if ( N < 8 ) { + // Use simple summation... + sum = 0.0; + for ( i = 0; i < N; i++ ) { + sum += X[ ix ]; + ix += strideX; + } + return sum; + } + // Blocksize for pairwise summation: 128 (NOTE: decreasing the blocksize decreases rounding error as more pairs are summed, but also decreases performance. Because the inner loop is unrolled eight times, the blocksize is effectively `16`.) + if ( N <= 128 ) { + // Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)... + s0 = X[ ix ]; + s1 = X[ ix+strideX ]; + s2 = X[ ix+(2*strideX) ]; + s3 = X[ ix+(3*strideX) ]; + s4 = X[ ix+(4*strideX) ]; + s5 = X[ ix+(5*strideX) ]; + s6 = X[ ix+(6*strideX) ]; + s7 = X[ ix+(7*strideX) ]; + ix += 8 * strideX; + + M = N % 8; + for ( i = 8; i < N-M; i += 8 ) { + s0 += X[ ix ]; + s1 += X[ ix+strideX ]; + s2 += X[ ix+(2*strideX) ]; + s3 += X[ ix+(3*strideX) ]; + s4 += X[ ix+(4*strideX) ]; + s5 += X[ ix+(5*strideX) ]; + s6 += X[ ix+(6*strideX) ]; + s7 += X[ ix+(7*strideX) ]; + ix += 8 * strideX; + } + // Pairwise sum the accumulators: + sum = ( (s0+s1) + (s2+s3) ) + ( (s4+s5) + (s6+s7) ); + + // Clean-up loop... + for (; i < N; i++ ) { + sum += X[ ix ]; + ix += strideX; + } + return sum; + } + // Recurse by dividing by two, but avoiding non-multiples of unroll factor... + n = N / 2; + n -= n % 8; + return API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( n, X, strideX, ix ) + API_SUFFIX(stdlib_strided_sdssumpw_ndarray)( N-n, X, strideX, ix+(n*strideX) ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/sdssumpw.c b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/sdssumpw.c deleted file mode 100644 index dd874329ad86..000000000000 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/src/sdssumpw.c +++ /dev/null @@ -1,121 +0,0 @@ -/** -* @license Apache-2.0 -* -* Copyright (c) 2020 The Stdlib Authors. -* -* Licensed under the Apache License, Version 2.0 (the "License"); -* you may not use this file except in compliance with the License. -* You may obtain a copy of the License at -* -* http://www.apache.org/licenses/LICENSE-2.0 -* -* Unless required by applicable law or agreed to in writing, software -* distributed under the License is distributed on an "AS IS" BASIS, -* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -* See the License for the specific language governing permissions and -* limitations under the License. -*/ - -#include "stdlib/blas/ext/base/sdssumpw.h" -#include - -/** -* Computes the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation. -* -* ## Method -* -* - This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`. -* -* ## References -* -* - Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050). -* -* @param N number of indexed elements -* @param X input array -* @param stride stride length -* @return output value -*/ -float stdlib_strided_sdssumpw( const int64_t N, const float *X, const int64_t stride ) { - float *xp1; - float *xp2; - double sum; - int64_t ix; - int64_t M; - int64_t n; - int64_t i; - double s0; - double s1; - double s2; - double s3; - double s4; - double s5; - double s6; - double s7; - - if ( N <= 0 ) { - return 0.0f; - } - if ( N == 1 || stride == 0 ) { - return X[ 0 ]; - } - if ( stride < 0 ) { - ix = (1-N) * stride; - } else { - ix = 0; - } - if ( N < 8 ) { - // Use simple summation... - sum = 0.0; - for ( i = 0; i < N; i++ ) { - sum += X[ ix ]; - ix += stride; - } - return sum; - } - // Blocksize for pairwise summation: 128 (NOTE: decreasing the blocksize decreases rounding error as more pairs are summed, but also decreases performance. Because the inner loop is unrolled eight times, the blocksize is effectively `16`.) - if ( N <= 128 ) { - // Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)... - s0 = X[ ix ]; - s1 = X[ ix+stride ]; - s2 = X[ ix+(2*stride) ]; - s3 = X[ ix+(3*stride) ]; - s4 = X[ ix+(4*stride) ]; - s5 = X[ ix+(5*stride) ]; - s6 = X[ ix+(6*stride) ]; - s7 = X[ ix+(7*stride) ]; - ix += 8 * stride; - - M = N % 8; - for ( i = 8; i < N-M; i += 8 ) { - s0 += X[ ix ]; - s1 += X[ ix+stride ]; - s2 += X[ ix+(2*stride) ]; - s3 += X[ ix+(3*stride) ]; - s4 += X[ ix+(4*stride) ]; - s5 += X[ ix+(5*stride) ]; - s6 += X[ ix+(6*stride) ]; - s7 += X[ ix+(7*stride) ]; - ix += 8 * stride; - } - // Pairwise sum the accumulators: - sum = ((s0+s1) + (s2+s3)) + ((s4+s5) + (s6+s7)); - - // Clean-up loop... - for (; i < N; i++ ) { - sum += X[ ix ]; - ix += stride; - } - return sum; - } - // Recurse by dividing by two, but avoiding non-multiples of unroll factor... - n = N / 2; - n -= n % 8; - if ( stride < 0 ) { - xp1 = (float *)X + ( (n-N)*stride ); - xp2 = (float *)X; - } else { - xp1 = (float *)X; - xp2 = (float *)X + ( n*stride ); - } - return stdlib_strided_sdssumpw( n, xp1, stride ) + stdlib_strided_sdssumpw( N-n, xp2, stride ); -} diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.js index 815fc4bf497c..e5e6f7ec7639 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.js @@ -152,14 +152,14 @@ tape( 'the function supports a negative `stride` parameter', function test( t ) t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', function test( t ) { var x; var v; x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] ); v = sdssumpw( x.length, x, 0, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.native.js index cdca245f0ee5..4db3c9956605 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.ndarray.native.js @@ -161,14 +161,14 @@ tape( 'the function supports a negative `stride` parameter', opts, function test t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element', opts, function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', opts, function test( t ) { var x; var v; x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] ); v = sdssumpw( x.length, x, 0, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.js index d99ccd39dd81..afd3c76b0880 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.js @@ -152,14 +152,14 @@ tape( 'the function supports a negative `stride` parameter', function test( t ) t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', function test( t ) { var x; var v; x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] ); v = sdssumpw( x.length, x, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.native.js b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.native.js index 6d2185783f05..54e14260c9b2 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/sdssumpw/test/test.sdssumpw.native.js @@ -243,14 +243,14 @@ tape( 'the function supports a negative `stride` parameter', opts, function test t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element', opts, function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', opts, function test( t ) { var x; var v; x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] ); v = sdssumpw( x.length, x, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); });