diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/README.md b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/README.md index 9a9accedca71..0cc3d5de90a8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/README.md @@ -65,7 +65,7 @@ The function has the following parameters: - **y**: output [`Float64Array`][@stdlib/array/float64]. - **strideY**: index increment for `y`. -The `N` and `stride` parameters determine which elements in `x` and `y` are accessed at runtime. For example, to compute the cumulative sum of every other element in `x`, +The `N` and stride parameters determine which elements in `x` and `y` are accessed at runtime. For example, to compute the cumulative sum of every other element in `x`, ```javascript var Float64Array = require( '@stdlib/array/float64' ); @@ -119,7 +119,7 @@ The function has the following additional parameters: - **offsetX**: starting index for `x`. - **offsetY**: starting index for `y`. -While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying `buffer`, `offsetX` and `offsetY` parameters support indexing semantics based on a starting indices. For example, to calculate the cumulative sum of every other value in `x` starting from the second value and to store in the last `N` elements of `y` starting from the last element +While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, offsetX and offsetY parameters support indexing semantics based on a starting indices. For example, to calculate the cumulative sum of every other value in `x` starting from the second value and to store in the last `N` elements of `y` starting from the last element ```javascript var Float64Array = require( '@stdlib/array/float64' ); @@ -154,20 +154,15 @@ dcusumkbn2.ndarray( N, 0.0, x, 2, 1, y, -1, y.length-1 ); ```javascript -var randu = require( '@stdlib/random/base/randu' ); -var round = require( '@stdlib/math/base/special/round' ); +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var Float64Array = require( '@stdlib/array/float64' ); var dcusumkbn2 = require( '@stdlib/blas/ext/base/dcusumkbn2' ); -var y; -var x; -var i; +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float64' +}); +var y = new Float64Array( x.length ); -x = new Float64Array( 10 ); -y = new Float64Array( x.length ); -for ( i = 0; i < x.length; i++ ) { - x[ i ] = round( randu()*100.0 ); -} console.log( x ); console.log( y ); @@ -179,8 +174,137 @@ console.log( y ); + + * * * +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/blas/ext/base/dcusumkbn2.h" +``` + +#### stdlib_strided_dcusumkbn2( N, sum, \*X, strideX, \*Y, strideY ) + +Computes the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. + +```c +const double x[] = { 1.0, 2.0, 3.0, 4.0 } +double y[] = { 0.0, 0.0, 0.0, 0.0 } + +stdlib_strided_dcusumkbn2( 4, 0.0, x, 1, y, 1 ); +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **sum**: `[in] CBLAS_INT` initial sum. +- **X**: `[in] double*` input array. +- **strideX**: `[in] CBLAS_INT` index increment for `X`. +- **Y**: `[out] double*` output array. +- **strideY**: `[in] CBLAS_INT` index increment for `Y`. + +```c +void stdlib_strided_dcusumkbn2( const CBLAS_INT N, const CBLAS_INT sum, const double *X, const CBLAS_INT strideX, double *Y, const CBLAS_INT strideY ); +``` + + + +#### stdlib_strided_dcusumkbn2_ndarray( N, sum, \*X, strideX, offsetX, \*Y, strideY, offsetY ) + + + +Computes the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. + +```c +const double x[] = { 1.0, 2.0, 3.0, 4.0 } +double y[] = { 0.0, 0.0, 0.0, 0.0 } + +stdlib_strided_dcusumkbn2_ndarray( 4, 0.0, x, 1, 0, y, 1, 0 ); +``` + +The function accepts the following arguments: + +- **N**: `[in] CBLAS_INT` number of indexed elements. +- **sum**: `[in] CBLAS_INT` initial sum. +- **X**: `[in] double*` input array. +- **strideX**: `[in] CBLAS_INT` index increment for `X`. +- **offsetX**: `[in] CBLAS_INT` starting index for `X`. +- **Y**: `[out] double*` output array. +- **strideY**: `[in] CBLAS_INT` index increment for `Y`. +- **offsetY**: `[in] CBLAS_INT` starting index for `Y`. + +```c +void stdlib_strided_dcusumkbn2_ndarray( const CBLAS_INT N, const CBLAS_INT sum, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/blas/ext/base/dcusumkbn2.h" + +int main( void ) { + // Create strided arrays: + const double x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 }; + double y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; + + // Specify the number of elements: + const int N = 4; + + // Specify stride lengths: + const int strideX = 2; + const int strideY = -2; + + // Compute the cumulative sum: + stdlib_strided_dcusumkbn2( N, 0.0, x, strideX, y, strideY ); + + // Print the result: + for ( int i = 0; i < 8; i++ ) { + printf( "y[ %d ] = %lf\n", i, y[ i ] ); + } +} +``` + +
+ + + +
+ + +
## References diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.js index 2fe281029033..837c4da9a961 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.js @@ -21,17 +21,19 @@ // 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 Float64Array = require( '@stdlib/array/float64' ); var pkg = require( './../package.json' ).name; var dcusumkbn2 = require( './../lib/dcusumkbn2.js' ); // VARIABLES // -var rand = uniform( -100.0, 100.0 ); +var options = { + 'dtype': 'float64' +}; // FUNCTIONS // @@ -44,8 +46,8 @@ var rand = uniform( -100.0, 100.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float64', rand ); - var y = filledarrayBy( len, 'float64', rand ); + var x = uniform( len, -100, 100, options ); + var y = new Float64Array( len ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.native.js index a4973abb3f3c..c77c57bd5561 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.native.js @@ -22,10 +22,10 @@ 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 Float64Array = require( '@stdlib/array/float64' ); var tryRequire = require( '@stdlib/utils/try-require' ); var pkg = require( './../package.json' ).name; @@ -36,7 +36,9 @@ var dcusumkbn2 = tryRequire( resolve( __dirname, './../lib/dcusumkbn2.native.js' var opts = { 'skip': ( dcusumkbn2 instanceof Error ) }; -var rand = uniform( -100.0, 100.0 ); +var options = { + 'dtype': 'float64' +}; // FUNCTIONS // @@ -49,8 +51,8 @@ var rand = uniform( -100.0, 100.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float64', rand ); - var y = filledarrayBy( len, 'float64', rand ); + var x = uniform( len, -100, 100, options ); + var y = new Float64Array( len ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.js index cb74b829659f..a8c1e5c2a2b9 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.js @@ -21,17 +21,19 @@ // 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 Float64Array = require( '@stdlib/array/float64' ); var pkg = require( './../package.json' ).name; var dcusumkbn2 = require( './../lib/ndarray.js' ); // VARIABLES // -var rand = uniform( -100.0, 100.0 ); +var options = { + 'dtype': 'float64' +}; // FUNCTIONS // @@ -44,8 +46,8 @@ var rand = uniform( -100.0, 100.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float64', rand ); - var y = filledarrayBy( len, 'float64', rand ); + var x = uniform( len, -100, 100, options ); + var y = new Float64Array( len ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.native.js index 36a71907f5a1..4a972b39ee8a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/benchmark.ndarray.native.js @@ -22,10 +22,10 @@ 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 Float64Array = require( '@stdlib/array/float64' ); var tryRequire = require( '@stdlib/utils/try-require' ); var pkg = require( './../package.json' ).name; @@ -36,7 +36,9 @@ var dcusumkbn2 = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) var opts = { 'skip': ( dcusumkbn2 instanceof Error ) }; -var rand = uniform( -100.0, 100.0 ); +var options = { + 'dtype': 'float64' +}; // FUNCTIONS // @@ -49,8 +51,8 @@ var rand = uniform( -100.0, 100.0 ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x = filledarrayBy( len, 'float64', rand ); - var y = filledarrayBy( len, 'float64', rand ); + var x = uniform( len, -100, 100, options ); + var y = new Float64Array( len ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/c/benchmark.length.c index 8d4d390f7e69..95aaec8f1d0f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/benchmark/c/benchmark.length.c @@ -94,7 +94,7 @@ static double rand_double( 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; double x[ len ]; double y[ len ]; @@ -121,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; + double x[ len ]; + double y[ len ]; + double t; + int i; + + for ( i = 0; i < len; i++ ) { + x[ i ] = ( rand_double() * 20000.0 ) - 10000.0; + y[ i ] = 0.0; + } + t = tic(); + for ( i = 0; i < iterations; i++ ) { + x[ 0 ] += 1.0; + stdlib_strided_dcusumkbn2_ndarray( len, 0.0, x, 1, 0, y, 1, 0 ); + if ( y[ 0 ] != y[ 0 ] ) { + printf( "should not return NaN\n" ); + break; + } + } + elapsed = tic() - t; + if ( y[ len-1 ] != y[ len-1 ] ) { + printf( "should not return NaN\n" ); + } + return elapsed; +} + /** * Main execution sequence. */ @@ -143,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/dcusumkbn2/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/c/example.c index 9e541324fe24..8cf8234a3db4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/c/example.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/c/example.c @@ -17,9 +17,7 @@ */ #include "stdlib/blas/ext/base/dcusumkbn2.h" -#include #include -#include int main( void ) { // Create strided arrays: @@ -27,17 +25,17 @@ int main( void ) { double y[] = { 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 }; // Specify the number of elements: - const int64_t N = 4; + const int N = 4; // Specify stride lengths: - const int64_t strideX = 2; - const int64_t strideY = -2; + const int strideX = 2; + const int strideY = -2; // Compute the cumulative sum: stdlib_strided_dcusumkbn2( N, 0.0, x, strideX, y, strideY ); // Print the result: - for ( int64_t i = 0; i < 8; i++ ) { - printf( "y[ %"PRId64" ] = %lf\n", i, y[ i ] ); + for ( int i = 0; i < 8; i++ ) { + printf( "y[ %d ] = %lf\n", i, y[ i ] ); } } diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/index.js index 12b9583b8866..8594cbd9e70d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/examples/index.js @@ -18,14 +18,16 @@ '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 Float64Array = require( '@stdlib/array/float64' ); var dcusumkbn2 = require( './../lib' ); -var x = filledarrayBy( 10, 'float64', discreteUniform( 0, 100 ) ); +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float64' +}); console.log( x ); -var y = filledarrayBy( x.length, 'float64', discreteUniform( 0, 10 ) ); +var y = new Float64Array( x.length ); console.log( y ); dcusumkbn2( x.length, 0.0, x, 1, y, -1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/include/stdlib/blas/ext/base/dcusumkbn2.h b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/include/stdlib/blas/ext/base/dcusumkbn2.h index 3846378b6f17..44aba469001a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/include/stdlib/blas/ext/base/dcusumkbn2.h +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/include/stdlib/blas/ext/base/dcusumkbn2.h @@ -19,7 +19,7 @@ #ifndef STDLIB_BLAS_EXT_BASE_DCUSUMKBN2_H #define STDLIB_BLAS_EXT_BASE_DCUSUMKBN2_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 cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. */ -void stdlib_strided_dcusumkbn2( const int64_t N, const double sum, const double *X, const int64_t strideX, double *Y, const int64_t strideY ); +void API_SUFFIX(stdlib_strided_dcusumkbn2)( const CBLAS_INT N, const double sum, const double *X, const CBLAS_INT strideX, double *Y, const CBLAS_INT strideY ); + +/** +* Computes the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. +*/ +void API_SUFFIX(stdlib_strided_dcusumkbn2_ndarray)( const CBLAS_INT N, const double sum, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY ); #ifdef __cplusplus } diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/dcusumkbn2.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/dcusumkbn2.js index e672167278ed..080169500ba4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/dcusumkbn2.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/dcusumkbn2.js @@ -20,7 +20,8 @@ // MODULES // -var abs = require( '@stdlib/math/base/special/abs' ); +var stride2offset = require( '@stdlib/strided/base/stride2offset' ); +var ndarray = require( './ndarray.js' ); // MAIN // @@ -55,53 +56,7 @@ var abs = require( '@stdlib/math/base/special/abs' ); * // returns [ 1.0, -1.0, 1.0 ] */ function dcusumkbn2( N, sum, x, strideX, y, strideY ) { - var ccs; - var ix; - var iy; - var cs; - var cc; - var v; - var t; - var c; - var i; - - if ( N <= 0 ) { - return y; - } - if ( strideX < 0 ) { - ix = (1-N) * strideX; - } else { - ix = 0; - } - if ( strideY < 0 ) { - iy = (1-N) * strideY; - } else { - iy = 0; - } - ccs = 0.0; // second order correction term for lost low order bits - cs = 0.0; // first order correction term for lost low order bits - for ( i = 0; i < N; i++ ) { - v = x[ ix ]; - t = sum + v; - if ( abs( sum ) >= abs( v ) ) { - c = (sum-t) + v; - } else { - c = (v-t) + sum; - } - sum = t; - t = cs + c; - if ( abs( cs ) >= abs( c ) ) { - cc = (cs-t) + c; - } else { - cc = (c-t) + cs; - } - cs = t; - ccs += cc; - - y[ iy ] = sum + cs + ccs; - ix += strideX; - iy += strideY; - } + ndarray( N, sum, x, strideX, stride2offset( N, strideX ), y, strideY, stride2offset( N, strideY ) ); // eslint-disable-line max-len return y; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/ndarray.native.js index 8189f2a9d9e0..9d96b18181c0 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/lib/ndarray.native.js +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/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( './dcusumkbn2.native.js' ); +var addon = require( './../src/addon.node' ); // MAIN // @@ -44,20 +42,13 @@ var addon = require( './dcusumkbn2.native.js' ); * var Float64Array = require( '@stdlib/array/float64' ); * var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); * var y = new Float64Array( x.length ); -* var N = 4 +* var N = 4; * * var v = dcusumkbn2( N, 0.0, x, 2, 1, y, 1, 0 ); * // returns [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ] */ function dcusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) { - var viewX; - var viewY; - offsetX = minViewBufferIndex( N, strideX, offsetX ); - offsetY = minViewBufferIndex( N, strideY, offsetY ); - - viewX = offsetView( x, offsetX ); - viewY = offsetView( y, offsetY ); - addon( N, sum, viewX, strideX, viewY, strideY ); + addon.ndarray( N, sum, x, strideX, offsetX, y, strideY, offsetY ); return y; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/manifest.json index 37116d2102b1..3f9a120a668f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/manifest.json +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/manifest.json @@ -28,7 +28,7 @@ { "task": "build", "src": [ - "./src/dcusumkbn2.c" + "./src/main.c" ], "include": [ "./include" @@ -36,6 +36,8 @@ "libraries": [], "libpath": [], "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/strided/base/stride2offset", "@stdlib/napi/export", "@stdlib/napi/argv", "@stdlib/napi/argv-double", @@ -47,7 +49,7 @@ { "task": "benchmark", "src": [ - "./src/dcusumkbn2.c" + "./src/main.c" ], "include": [ "./include" @@ -55,13 +57,15 @@ "libraries": [], "libpath": [], "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/strided/base/stride2offset", "@stdlib/math/base/special/abs" ] }, { "task": "examples", "src": [ - "./src/dcusumkbn2.c" + "./src/main.c" ], "include": [ "./include" @@ -69,6 +73,8 @@ "libraries": [], "libpath": [], "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/strided/base/stride2offset", "@stdlib/math/base/special/abs" ] } diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/addon.c index a60145c2e0e9..d905798abb0d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/addon.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/addon.c @@ -17,6 +17,7 @@ */ #include "stdlib/blas/ext/base/dcusumkbn2.h" +#include "stdlib/blas/base/shared.h" #include "stdlib/napi/export.h" #include "stdlib/napi/argv.h" #include "stdlib/napi/argv_double.h" @@ -39,9 +40,29 @@ static napi_value addon( napi_env env, napi_callback_info info ) { STDLIB_NAPI_ARGV_INT64( env, strideY, argv, 5 ); STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, X, N, strideX, argv, 2 ); STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, Y, N, strideY, argv, 4 ); - stdlib_strided_dcusumkbn2( N, sum, X, strideX, Y, strideY ); + API_SUFFIX(stdlib_strided_dcusumkbn2)( N, sum, X, strideX, Y, strideY ); return NULL; } -STDLIB_NAPI_MODULE_EXPORT_FCN( addon ) +/** +* 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, 8 ); + STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 ); + STDLIB_NAPI_ARGV_DOUBLE( env, sum, argv, 1 ); + STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 ); + STDLIB_NAPI_ARGV_INT64( env, offsetX, argv, 4 ); + STDLIB_NAPI_ARGV_INT64( env, strideY, argv, 6 ); + STDLIB_NAPI_ARGV_INT64( env, offsetY, argv, 7 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, X, N, strideX, argv, 2 ); + STDLIB_NAPI_ARGV_STRIDED_FLOAT64ARRAY( env, Y, N, strideY, argv, 5 ); + API_SUFFIX(stdlib_strided_dcusumkbn2_ndarray)( N, sum, X, strideX, offsetX, Y, strideY, offsetY ); + return NULL; +} +STDLIB_NAPI_MODULE_EXPORT_FCN_WITH_METHOD( addon, "ndarray", addon_method ) diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/dcusumkbn2.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/main.c similarity index 55% rename from lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/dcusumkbn2.c rename to lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/main.c index 751630327b77..b22bf237e8e8 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/dcusumkbn2.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn2/src/main.c @@ -17,8 +17,9 @@ */ #include "stdlib/blas/ext/base/dcusumkbn2.h" +#include "stdlib/strided/base/stride2offset.h" +#include "stdlib/blas/base/shared.h" #include "stdlib/math/base/special/abs.h" -#include /** * Computes the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm. @@ -38,11 +39,37 @@ * @param Y output array * @param strideY Y stride length */ -void stdlib_strided_dcusumkbn2( const int64_t N, const double sum, const double *X, const int64_t strideX, double *Y, const int64_t strideY ) { +void API_SUFFIX(stdlib_strided_dcusumkbn2)( const CBLAS_INT N, const double sum, const double *X, const CBLAS_INT strideX, double *Y, const CBLAS_INT strideY ) { + const CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX ); + const CBLAS_INT oy = stdlib_strided_stride2offset( N, strideY ); + API_SUFFIX(stdlib_strided_dcusumkbn2_ndarray)( N, sum, X, strideX, ox, Y, strideY, oy ); +} + +/** +* Computes the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. +* +* ## Method +* +* - This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974). +* +* ## References +* +* - Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106). +* +* @param N number of indexed elements +* @param sum initial sum +* @param X input array +* @param strideX X index increment +* @param offsetX X starting index +* @param Y output array +* @param strideY Y index increment +* @param offsetY Y starting index +*/ +void API_SUFFIX(stdlib_strided_dcusumkbn2_ndarray)( const CBLAS_INT N, const double sum, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY ) { double ccs; - int64_t ix; - int64_t iy; - int64_t i; + CBLAS_INT ix; + CBLAS_INT iy; + CBLAS_INT i; double cs; double cc; double v; @@ -53,16 +80,8 @@ void stdlib_strided_dcusumkbn2( const int64_t N, const double sum, const double if ( N <= 0 ) { return; } - if ( strideX < 0 ) { - ix = (1-N) * strideX; - } else { - ix = 0; - } - if ( strideY < 0 ) { - iy = (1-N) * strideY; - } else { - iy = 0; - } + ix = offsetX; + iy = offsetY; s = sum; ccs = 0.0; // second order correction term for lost lower order bits cs = 0.0; // first order correction term for lost low order bits