diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/README.md b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/README.md
index 338f4039dab5..a5f2afe608b6 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/README.md
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/README.md
@@ -115,7 +115,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 the strided input array starting from the second value and to store in the last `N` elements of the strided output array 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 the strided input array starting from the second value and to store in the last `N` elements of the strided output array starting from the last element
```javascript
var Float64Array = require( '@stdlib/array/float64' );
@@ -148,12 +148,13 @@ dcusumkbn.ndarray( 4, 0.0, x, 2, 1, y, -1, y.length-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 Float64Array = require( '@stdlib/array/float64' );
var dcusumkbn = require( '@stdlib/blas/ext/base/dcusumkbn' );
-var x = filledarrayBy( 10, 'float64', discreteUniform( 0, 100 ) );
+var x = discreteUniform( 10, -100, 100, {
+ 'dtype': 'float64'
+});
var y = new Float64Array( x.length );
console.log( x );
@@ -167,8 +168,138 @@ console.log( y );
+
+
* * *
+
+
+## C APIs
+
+
+
+
+
+
+
+
+
+
+
+### Usage
+
+```c
+#include "stdlib/blas/ext/base/dcusumkbn.h"
+```
+
+#### stdlib_strided_dcusumkbn( N, sum, \*X, strideX, \*Y, strideY )
+
+Computes the cumulative sum of double-precision floating-point strided array elements using an improved 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_dcusumkbn( 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_dcusumkbn( const CBLAS_INT N, const CBLAS_INT sum, const double *X, const CBLAS_INT strideX, double *Y, const CBLAS_INT strideY );
+```
+
+
+
+#### stdlib_strided_dcusumkbn_ndarray( N, sum, \*X, strideX, offsetX, \*Y, strideY, offsetY )
+
+
+
+Computes the cumulative sum of double-precision floating-point strided array elements using an improved 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_dcusumkbn_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_dcusumkbn_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/dcusumkbn.h"
+#include
+
+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_dcusumkbn( N, 0.0, x, strideX, y, strideY );
+
+ // Print the result:
+ for ( int i = 0; i < 8; i++ ) {
+ printf( "y[ %"PRId64" ] = %lf\n", i, y[ i ] );
+ }
+}
+```
+
+
+
+
+
+
+
+
+
## References
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.js
index 0329d65fb689..b632c465242e 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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 Float64Array = require( '@stdlib/array/float64' );
@@ -32,7 +31,9 @@ var dcusumkbn = require( './../lib/dcusumkbn.js' );
// VARIABLES //
-var rand = uniform( -10.0, 10.0 );
+var options = {
+ 'dtype': 'float64'
+};
// FUNCTIONS //
@@ -45,7 +46,7 @@ var rand = uniform( -10.0, 10.0 );
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
- var x = filledarrayBy( len, 'float64', rand );
+ var x = uniform( len, -100, 100, options );
var y = new Float64Array( len );
return benchmark;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.native.js
index 8322c189a258..1e03254b17be 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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 Float64Array = require( '@stdlib/array/float64' );
@@ -33,7 +32,9 @@ var pkg = require( './../package.json' ).name;
// VARIABLES //
-var rand = uniform( -10.0, 10.0 );
+var options = {
+ 'dtype': 'float64'
+};
var dcusumkbn = tryRequire( resolve( __dirname, './../lib/dcusumkbn.native.js' ) );
var opts = {
'skip': ( dcusumkbn instanceof Error )
@@ -50,7 +51,7 @@ var opts = {
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
- var x = filledarrayBy( len, 'float64', rand );
+ var x = uniform( len, -100, 100, options );
var y = new Float64Array( len );
return benchmark;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.js
index e1b43d887d50..6fcdf736db28 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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 Float64Array = require( '@stdlib/array/float64' );
@@ -32,7 +31,9 @@ var dcusumkbn = require( './../lib/ndarray.js' );
// VARIABLES //
-var rand = uniform( -10.0, 10.0 );
+var options = {
+ 'dtype': 'float64'
+};
// FUNCTIONS //
@@ -45,7 +46,7 @@ var rand = uniform( -10.0, 10.0 );
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
- var x = filledarrayBy( len, 'float64', rand );
+ var x = uniform( len, -100, 100, options );
var y = new Float64Array( len );
return benchmark;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.native.js
index 91e60b28cb52..04bd4dd2f07b 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/benchmark.ndarray.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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 Float64Array = require( '@stdlib/array/float64' );
@@ -33,7 +32,9 @@ var pkg = require( './../package.json' ).name;
// VARIABLES //
-var rand = uniform( -10.0, 10.0 );
+var options = {
+ 'dtype': 'float64'
+};
var dcusumkbn = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' ) );
var opts = {
'skip': ( dcusumkbn instanceof Error )
@@ -50,7 +51,7 @@ var opts = {
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
- var x = filledarrayBy( len, 'float64', rand );
+ var x = uniform( len, -100, 100, options );
var y = new Float64Array( len );
return benchmark;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/c/benchmark.length.c
index cc19a3a3b93a..bd95a22ce10f 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/benchmark/c/benchmark.length.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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_dcusumkbn_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/dcusumkbn/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/docs/repl.txt
index 2561887aeef4..8d417e2f6795 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/docs/repl.txt
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/docs/repl.txt
@@ -3,7 +3,7 @@
Computes the cumulative sum of double-precision floating-point strided array
elements using an improved Kahan–Babuška algorithm.
- The `N` and `stride` parameters determine which elements in the strided
+ The `N` and stride parameters determine which elements in the strided
arrays are accessed at runtime.
Indexing is relative to the first index. To introduce an offset, use a typed
@@ -67,7 +67,7 @@
semantics.
While typed array views mandate a view offset based on the underlying
- buffer, the `offset` parameter supports indexing semantics based on a
+ buffer, the offset parameter supports indexing semantics based on a
starting index.
Parameters
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/c/example.c
index 2c14eb21dfb2..8fc05771629d 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/c/example.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/c/example.c
@@ -27,17 +27,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_dcusumkbn( N, 0.0, x, strideX, y, strideY );
// Print the result:
- for ( int64_t i = 0; i < 8; i++ ) {
+ for ( int i = 0; i < 8; i++ ) {
printf( "y[ %"PRId64" ] = %lf\n", i, y[ i ] );
}
}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/index.js
index b7094f8b7506..1a6d7eae190d 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/index.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/examples/index.js
@@ -18,12 +18,13 @@
'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 dcusumkbn = require( './../lib' );
-var x = filledarrayBy( 10, 'float64', discreteUniform( 0, 100 ) );
+var x = discreteUniform( 10, -100, 100, {
+ 'dtype': 'float64'
+});
var y = new Float64Array( x.length );
console.log( x );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/include/stdlib/blas/ext/base/dcusumkbn.h b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/include/stdlib/blas/ext/base/dcusumkbn.h
index 5aeb16ff8195..c2563c22eb0e 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/include/stdlib/blas/ext/base/dcusumkbn.h
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/include/stdlib/blas/ext/base/dcusumkbn.h
@@ -19,7 +19,7 @@
#ifndef STDLIB_BLAS_EXT_BASE_DCUSUMKBN_H
#define STDLIB_BLAS_EXT_BASE_DCUSUMKBN_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,13 @@ extern "C" {
/**
* Computes the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
*/
-void stdlib_strided_dcusumkbn( 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_dcusumkbn)( 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 an improved Kahan–Babuška algorithm and alternative indexing semantics.
+*/
+void API_SUFFIX(stdlib_strided_dcusumkbn_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/dcusumkbn/lib/dcusumkbn.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/lib/dcusumkbn.js
index a7787a9f836c..c55fc3d3584c 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/lib/dcusumkbn.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/lib/dcusumkbn.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 //
@@ -54,42 +55,7 @@ var abs = require( '@stdlib/math/base/special/abs' );
* // returns [ 1.0, -1.0, 1.0 ]
*/
function dcusumkbn( N, sum, x, strideX, y, strideY ) {
- var ix;
- var iy;
- var s;
- 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;
- }
- s = sum;
- c = 0.0;
- for ( i = 0; i < N; i++ ) {
- v = x[ ix ];
- t = s + v;
- if ( abs( s ) >= abs( v ) ) {
- c += (s-t) + v;
- } else {
- c += (v-t) + s;
- }
- s = t;
- y[ iy ] = s + c;
- 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/dcusumkbn/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/lib/ndarray.native.js
index 969cf12c1562..bfcf3fbdbb9c 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/lib/ndarray.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/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( './dcusumkbn.native.js' );
+var addon = require( './../src/addon.node' );
// MAIN //
@@ -50,14 +48,7 @@ var addon = require( './dcusumkbn.native.js' );
* // returns [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ]
*/
function dcusumkbn( 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/dcusumkbn/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/manifest.json
index 4aeff52b32f7..8cd1c39a4492 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/manifest.json
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/manifest.json
@@ -28,16 +28,17 @@
{
"task": "build",
"src": [
- "./src/dcusumkbn.c"
+ "./src/main.c"
],
"include": [
"./include"
],
- "libraries": [
- "-lm"
- ],
+ "libraries": [],
"libpath": [],
"dependencies": [
+ "@stdlib/math/base/special/abs",
+ "@stdlib/blas/base/shared",
+ "@stdlib/strided/base/stride2offset",
"@stdlib/napi/argv",
"@stdlib/napi/argv-int64",
"@stdlib/napi/argv-double",
@@ -48,30 +49,34 @@
{
"task": "benchmark",
"src": [
- "./src/dcusumkbn.c"
+ "./src/main.c"
],
"include": [
"./include"
],
- "libraries": [
- "-lm"
- ],
+ "libraries": [],
"libpath": [],
- "dependencies": []
+ "dependencies": [
+ "@stdlib/math/base/special/abs",
+ "@stdlib/blas/base/shared",
+ "@stdlib/strided/base/stride2offset"
+ ]
},
{
"task": "examples",
"src": [
- "./src/dcusumkbn.c"
+ "./src/main.c"
],
"include": [
"./include"
],
- "libraries": [
- "-lm"
- ],
+ "libraries": [],
"libpath": [],
- "dependencies": []
+ "dependencies": [
+ "@stdlib/math/base/special/abs",
+ "@stdlib/blas/base/shared",
+ "@stdlib/strided/base/stride2offset"
+ ]
}
]
}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/addon.c
index cb677e971932..9e2c666c4c48 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/addon.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/addon.c
@@ -17,11 +17,13 @@
*/
#include "stdlib/blas/ext/base/dcusumkbn.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_double.h"
#include "stdlib/napi/argv_strided_float64array.h"
-#include "stdlib/napi/export.h"
+#include
/**
* Receives JavaScript callback invocation data.
@@ -38,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_dcusumkbn( N, sum, X, strideX, Y, strideY );
+ API_SUFFIX(stdlib_strided_dcusumkbn)( N, sum, X, strideX, Y, strideY );
+ return NULL;
+}
+
+/**
+* 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_dcusumkbn_ndarray)( N, sum, X, strideX, offsetX, Y, strideY, offsetY );
return NULL;
}
- // Register a Node-API module:
-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/dcusumkbn/src/dcusumkbn.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/dcusumkbn.c
deleted file mode 100644
index 4a7209f79bfd..000000000000
--- a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/dcusumkbn.c
+++ /dev/null
@@ -1,79 +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/dcusumkbn.h"
-#include
-#include
-
-/**
-* Computes the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
-*
-* ## 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 stride length
-* @param Y output array
-* @param strideY Y stride length
-*/
-void stdlib_strided_dcusumkbn( const int64_t N, const double sum, const double *X, const int64_t strideX, double *Y, const int64_t strideY ) {
- int64_t ix;
- int64_t iy;
- int64_t i;
- double s;
- double v;
- double t;
- double c;
-
- if ( N <= 0 ) {
- return;
- }
- if ( strideX < 0 ) {
- ix = (1-N) * strideX;
- } else {
- ix = 0;
- }
- if ( strideY < 0 ) {
- iy = (1-N) * strideY;
- } else {
- iy = 0;
- }
- s = sum;
- c = 0.0;
- for ( i = 0; i < N; i++ ) {
- v = X[ ix ];
- t = s + v;
- if ( fabs( s ) >= fabs( v ) ) {
- c += (s-t) + v;
- } else {
- c += (v-t) + s;
- }
- s = t;
- Y[ iy ] = s + c;
- ix += strideX;
- iy += strideY;
- }
- return;
-}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/main.c
new file mode 100644
index 000000000000..6815943a78b7
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/dcusumkbn/src/main.c
@@ -0,0 +1,98 @@
+/**
+* @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/dcusumkbn.h"
+#include "stdlib/strided/base/stride2offset.h"
+#include "stdlib/blas/base/shared.h"
+#include "stdlib/math/base/special/abs.h"
+
+/**
+* Computes the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
+*
+* ## 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 stride length
+* @param Y output array
+* @param strideY Y stride length
+*/
+void API_SUFFIX(stdlib_strided_dcusumkbn)( 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_dcusumkbn_ndarray)( N, sum, X, strideX, ox, Y, strideY, oy );
+}
+
+/**
+* Computes the cumulative sum of double-precision floating-point strided array elements using an improved 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_dcusumkbn_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 ) {
+ CBLAS_INT ix;
+ CBLAS_INT iy;
+ CBLAS_INT i;
+ double s;
+ double v;
+ double t;
+ double c;
+
+ if ( N <= 0 ) {
+ return;
+ }
+ ix = offsetX;
+ iy = offsetY;
+ s = sum;
+ c = 0.0;
+ for ( i = 0; i < N; i++ ) {
+ v = X[ ix ];
+ t = s + v;
+ if ( stdlib_base_abs( s ) >= stdlib_base_abs( v ) ) {
+ c += (s-t) + v;
+ } else {
+ c += (v-t) + s;
+ }
+ s = t;
+ Y[ iy ] = s + c;
+ ix += strideX;
+ iy += strideY;
+ }
+ return;
+}