diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/README.md b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/README.md
index d91a5a5af5e2..009d0ae8e67d 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/README.md
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/README.md
@@ -128,6 +128,7 @@ gcusumkbn2.ndarray( 4, 0.0, x, 2, 1, y, -1, y.length-1 );
## Notes
- If `N <= 0`, both functions return `y` unchanged.
+- Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array/base/accessor`][@stdlib/array/base/accessor])
- Depending on the environment, the typed versions ([`dcusumkbn2`][@stdlib/blas/ext/base/dcusumkbn2], [`scusumkbn2`][@stdlib/blas/ext/base/scusumkbn2], etc.) are likely to be significantly more performant.
@@ -197,6 +198,8 @@ console.log( y );
[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
+[@stdlib/array/base/accessor]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/base/accessor
+
[@klein:2005a]: https://doi.org/10.1007/s00607-005-0139-x
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/index.d.ts
index d295706b2420..8559982f60da 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/index.d.ts
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/index.d.ts
@@ -20,7 +20,17 @@
///
-import { NumericArray } from '@stdlib/types/array';
+import { NumericArray, Collection, AccessorArrayLike } from '@stdlib/types/array';
+
+/**
+* Input array.
+*/
+type InputArray = NumericArray | Collection | AccessorArrayLike;
+
+/**
+* Output array.
+*/
+type OutputArray = NumericArray | Collection | AccessorArrayLike;
/**
* Interface describing `gcusumkbn2`.
@@ -44,7 +54,7 @@ interface Routine {
* gcusumkbn2( x.length, 0.0, x, 1, y, 1 );
* // y => [ 1.0, -1.0, 1.0 ]
*/
- ( N: number, sum: number, x: NumericArray, strideX: number, y: NumericArray, strideY: number ): NumericArray;
+ ( N: number, sum: number, x: InputArray, strideX: number, y: T, strideY: number ): T;
/**
* Computes the cumulative sum of strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
@@ -66,7 +76,7 @@ interface Routine {
* gcusumkbn2.ndarray( x.length, 0.0, x, 1, 0, y, 1, 0 );
* // y => [ 1.0, -1.0, 1.0 ]
*/
- ndarray( N: number, sum: number, x: NumericArray, strideX: number, offsetX: number, y: NumericArray, strideY: number, offsetY: number ): NumericArray;
+ ndarray( N: number, sum: number, x: InputArray, strideX: number, offsetX: number, y: T, strideY: number, offsetY: number ): T;
}
/**
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/test.ts b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/test.ts
index 4419b2d0814c..1fa93d7f054a 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/test.ts
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/docs/types/test.ts
@@ -16,6 +16,7 @@
* limitations under the License.
*/
+import AccessorArray = require( '@stdlib/array/base/accessor' );
import gcusumkbn2 = require( './index' );
@@ -26,7 +27,8 @@ import gcusumkbn2 = require( './index' );
const x = new Float64Array( 10 );
const y = new Float64Array( 10 );
- gcusumkbn2( x.length, 0.0, x, 1, y, 1 ); // $ExpectType NumericArray
+ gcusumkbn2( x.length, 0.0, x, 1, y, 1 ); // $ExpectType Float64Array
+ gcusumkbn2( x.length, 0.0, new AccessorArray( x ), 1, new AccessorArray( y ), 1 ); // $ExpectType AccessorArray
}
// The compiler throws an error if the function is provided a first argument which is not a number...
@@ -139,7 +141,8 @@ import gcusumkbn2 = require( './index' );
const x = new Float64Array( 10 );
const y = new Float64Array( 10 );
- gcusumkbn2.ndarray( x.length, 0.0, x, 1, 0, y, 1, 0 ); // $ExpectType NumericArray
+ gcusumkbn2.ndarray( x.length, 0.0, x, 1, 0, y, 1, 0 ); // $ExpectType Float64Array
+ gcusumkbn2.ndarray( x.length, 0.0, new AccessorArray( x ), 1, 0, new AccessorArray( y ), 1, 0 ); // $ExpectType AccessorArray
}
// The compiler throws an error if the `ndarray` method is provided a first argument which is not a number...
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/accessors.js b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/accessors.js
new file mode 100644
index 000000000000..6e9d177cce57
--- /dev/null
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/accessors.js
@@ -0,0 +1,119 @@
+/**
+* @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.
+*/
+
+'use strict';
+
+// MODULES //
+
+var abs = require( '@stdlib/math/base/special/abs' );
+
+
+// MAIN //
+
+/**
+* Computes the cumulative sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.
+*
+* ## Method
+*
+* - This implementation uses a second-order iterative Kahan–Babuška algorithm, as described by Klein (2005).
+*
+* ## References
+*
+* - Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
+*
+* @private
+* @param {PositiveInteger} N - number of indexed elements
+* @param {number} sum - initial sum
+* @param {Object} x - input array object
+* @param {Collection} x.data - input array data
+* @param {Array} x.accessors - array element accessors
+* @param {integer} strideX - stride length for `x`
+* @param {NonNegativeInteger} offsetX - starting index for `x`
+* @param {Object} y - output array object
+* @param {Collection} y.data - output array data
+* @param {Array} y.accessors - array element accessors
+* @param {integer} strideY - stride length for `y`
+* @param {NonNegativeInteger} offsetY - starting index for `y`
+* @returns {Object} output array object
+*
+* @example
+* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
+* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+*
+* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
+* var y = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
+*
+* gcusumkbn2( 4, 0.0, arraylike2object( toAccessorArray( x ) ), 2, 1, arraylike2object( toAccessorArray( y ) ), 1, 0 );
+* // y => [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ]
+*/
+function gcusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) {
+ var xbuf;
+ var ybuf;
+ var xget;
+ var yset;
+ var ccs;
+ var ix;
+ var iy;
+ var cs;
+ var cc;
+ var v;
+ var t;
+ var c;
+ var i;
+
+ // Cache reference to array data:
+ xbuf = x.data;
+ ybuf = y.data;
+
+ // Cache reference to the element accessors:
+ xget = x.accessors[ 0 ];
+ yset = y.accessors[ 1 ];
+
+ ix = offsetX;
+ iy = offsetY;
+ 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 = xget( xbuf, 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;
+
+ yset( ybuf, iy, sum + cs + ccs );
+ ix += strideX;
+ iy += strideY;
+ }
+ return y;
+}
+
+
+// EXPORTS //
+
+module.exports = gcusumkbn2;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/ndarray.js
index 762d2127c58b..8ede952bef69 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/lib/ndarray.js
@@ -20,7 +20,9 @@
// MODULES //
+var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var abs = require( '@stdlib/math/base/special/abs' );
+var accessors = require( './accessors.js' );
// MAIN //
@@ -57,6 +59,8 @@ function gcusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) {
var ccs;
var ix;
var iy;
+ var ox;
+ var oy;
var cs;
var cc;
var v;
@@ -67,6 +71,12 @@ function gcusumkbn2( N, sum, x, strideX, offsetX, y, strideY, offsetY ) {
if ( N <= 0 ) {
return y;
}
+ ox = arraylike2object( x );
+ oy = arraylike2object( y );
+ if ( ox.accessorProtocol || oy.accessorProtocol ) {
+ accessors( N, sum, ox, strideX, offsetX, oy, strideY, offsetY );
+ return y;
+ }
ix = offsetX;
iy = offsetY;
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.main.js
index 04f73956e706..edcb3ed4a4bb 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.main.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.main.js
@@ -21,8 +21,8 @@
// MODULES //
var tape = require( 'tape' );
-var floor = require( '@stdlib/math/base/special/floor' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
var Float64Array = require( '@stdlib/array/float64' );
var gcusumkbn2 = require( './../lib' );
@@ -128,6 +128,94 @@ tape( 'the function computes the cumulative sum', function test( t ) {
t.end();
});
+tape( 'the function computes the cumulative sum (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+ var i;
+
+ x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];
+ y = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+ expected = [
+ 1.0,
+ 3.0,
+ 6.0,
+ 10.0,
+ 15.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];
+ y = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ gcusumkbn2( x.length, 10.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+ expected = [
+ 11.0,
+ 13.0,
+ 16.0,
+ 20.0,
+ 25.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [ NaN, NaN ];
+ y = [ 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+
+ for ( i = 0; i < y.length; i++ ) {
+ t.strictEqual( isnan( y[ i ] ), true, 'returns expected value. i: ' + i );
+ }
+
+ x = [ 1.0, NaN, 3.0, NaN ];
+ y = [ 0.0, 0.0, 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+
+ expected = [
+ 1.0,
+ NaN,
+ NaN,
+ NaN
+ ];
+ for ( i = 0; i < y.length; i++ ) {
+ if ( isnan( expected[ i ] ) ) {
+ t.strictEqual( isnan( y[ i ] ), true, 'returns expected value. i: ' + i );
+ } else {
+ t.strictEqual( y[ i ], expected[ i ], true, 'returns expected value. i: ' + i );
+ }
+ }
+
+ x = [ 1.0, 1.0e100, 1.0, -1.0e100 ];
+ y = [ 0.0, 0.0, 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+
+ expected = [
+ 1.0,
+ 1.0e100,
+ 1.0e100,
+ 2.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [];
+ y = [];
+ expected = [];
+ for ( i = 0; i < 1e3; i++ ) {
+ x.push( i+1 );
+ y.push( 0.0 );
+ if ( i === 0 ) {
+ expected.push( x[ i ] );
+ } else {
+ expected.push( expected[ i-1 ] + x[ i ] );
+ }
+ }
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 1 );
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ t.end();
+});
+
tape( 'the function returns a reference to the output array', function test( t ) {
var out;
var x;
@@ -142,6 +230,20 @@ tape( 'the function returns a reference to the output array', function test( t )
t.end();
});
+tape( 'the function returns a reference to the output array (accessors)', function test( t ) {
+ var out;
+ var x;
+ var y;
+
+ x = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
+ y = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0 ] );
+
+ out = gcusumkbn2( x.length, 0.0, x, 1, y, 1 );
+
+ t.strictEqual( out, y, 'same reference' );
+ t.end();
+});
+
tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `y` unchanged', function test( t ) {
var expected;
var x;
@@ -165,7 +267,6 @@ tape( 'the function supports an `x` stride', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -181,9 +282,36 @@ tape( 'the function supports an `x` stride', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 2, y, 1 );
+ gcusumkbn2( 3, 0.0, x, 2, y, 1 );
+
+ expected = [ 1.0, 4.0, 9.0, 0.0, 0.0 ];
+
+ t.deepEqual( y, expected, 'deep equal' );
+ t.end();
+});
+
+tape( 'the function supports an `x` stride (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 0
+ 2.0,
+ 3.0, // 1
+ 4.0,
+ 5.0 // 2
+ ];
+ y = [
+ 0.0, // 0
+ 0.0, // 1
+ 0.0, // 2
+ 0.0,
+ 0.0
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), 2, toAccessorArray( y ), 1 );
expected = [ 1.0, 4.0, 9.0, 0.0, 0.0 ];
@@ -195,7 +323,6 @@ tape( 'the function supports a `y` stride', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -211,9 +338,36 @@ tape( 'the function supports a `y` stride', function test( t ) {
0.0,
0.0 // 2
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 1, y, 2 );
+ gcusumkbn2( 3, 0.0, x, 1, y, 2 );
+
+ expected = [ 1.0, 0.0, 3.0, 0.0, 6.0 ];
+
+ t.deepEqual( y, expected, 'deep equal' );
+ t.end();
+});
+
+tape( 'the function supports a `y` stride (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 0
+ 2.0, // 1
+ 3.0, // 2
+ 4.0,
+ 5.0
+ ];
+ y = [
+ 0.0, // 0
+ 0.0,
+ 0.0, // 1
+ 0.0,
+ 0.0 // 2
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), 1, toAccessorArray( y ), 2 );
expected = [ 1.0, 0.0, 3.0, 0.0, 6.0 ];
@@ -225,7 +379,6 @@ tape( 'the function supports negative strides', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 2
@@ -241,9 +394,36 @@ tape( 'the function supports negative strides', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, -2, y, -1 );
+ gcusumkbn2( 3, 0.0, x, -2, y, -1 );
+
+ expected = [ 9.0, 8.0, 5.0, 0.0, 0.0 ];
+
+ t.deepEqual( y, expected, 'deep equal' );
+ t.end();
+});
+
+tape( 'the function supports negative strides (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 2
+ 2.0,
+ 3.0, // 1
+ 4.0,
+ 5.0 // 0
+ ];
+ y = [
+ 0.0, // 2
+ 0.0, // 1
+ 0.0, // 0
+ 0.0,
+ 0.0
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), -2, toAccessorArray( y ), -1 );
expected = [ 9.0, 8.0, 5.0, 0.0, 0.0 ];
@@ -255,7 +435,6 @@ tape( 'the function supports complex access patterns', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -273,9 +452,8 @@ tape( 'the function supports complex access patterns', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 2, y, -1 );
+ gcusumkbn2( 3, 0.0, x, 2, y, -1 );
expected = [ 9.0, 4.0, 1.0, 0.0, 0.0, 0.0 ];
@@ -289,7 +467,6 @@ tape( 'the function supports view offsets', function test( t ) {
var y0;
var x1;
var y1;
- var N;
// Initial arrays...
x0 = new Float64Array([
@@ -313,9 +490,7 @@ tape( 'the function supports view offsets', function test( t ) {
x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // begin at 2nd element
y1 = new Float64Array( y0.buffer, y0.BYTES_PER_ELEMENT*3 ); // begin at the 4th element
- N = floor( x0.length / 2 );
-
- gcusumkbn2( N, 0.0, x1, -2, y1, 1 );
+ gcusumkbn2( 3, 0.0, x1, -2, y1, 1 );
expected = new Float64Array( [ 0.0, 0.0, 0.0, 6.0, 10.0, 12.0 ] );
t.deepEqual( y0, expected, 'deep equal' );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.ndarray.js
index 3b194d7478e7..8e889042ce50 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/gcusumkbn2/test/test.ndarray.js
@@ -21,8 +21,8 @@
// MODULES //
var tape = require( 'tape' );
-var floor = require( '@stdlib/math/base/special/floor' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
var gcusumkbn2 = require( './../lib/ndarray.js' );
@@ -126,6 +126,93 @@ tape( 'the function calculates the cumulative sum', function test( t ) {
t.end();
});
+tape( 'the function calculates the cumulative sum (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+ var i;
+
+ x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];
+ y = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+ expected = [
+ 1.0,
+ 3.0,
+ 6.0,
+ 10.0,
+ 15.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];
+ y = [ 0.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ gcusumkbn2( x.length, 10.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+ expected = [
+ 11.0,
+ 13.0,
+ 16.0,
+ 20.0,
+ 25.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [ NaN, NaN ];
+ y = [ 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+
+ for ( i = 0; i < y.length; i++ ) {
+ t.strictEqual( isnan( y[ i ] ), true, 'returns expected value. i: ' + i );
+ }
+
+ x = [ 1.0, NaN, 3.0, NaN ];
+ y = [ 0.0, 0.0, 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+
+ expected = [
+ 1.0,
+ NaN,
+ NaN,
+ NaN
+ ];
+ for ( i = 0; i < y.length; i++ ) {
+ if ( isnan( expected[ i ] ) ) {
+ t.strictEqual( isnan( y[ i ] ), true, 'returns expected value. i: ' + i );
+ } else {
+ t.strictEqual( y[ i ], expected[ i ], true, 'returns expected value. i: ' + i );
+ }
+ }
+
+ x = [ 1.0, 1.0e100, 1.0, -1.0e100 ];
+ y = [ 0.0, 0.0, 0.0, 0.0 ];
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+
+ expected = [
+ 1.0,
+ 1.0e100,
+ 1.0e100,
+ 2.0
+ ];
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ x = [];
+ y = [];
+ expected = [];
+ for ( i = 0; i < 1e3; i++ ) {
+ x.push( i+1 );
+ if ( i === 0 ) {
+ expected.push( x[ i ] );
+ } else {
+ expected.push( expected[ i-1 ] + x[ i ] );
+ }
+ }
+ gcusumkbn2( x.length, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 1, 0 );
+ t.deepEqual( y, expected, 'returns expected value' );
+
+ t.end();
+});
+
tape( 'the function returns a reference to the output array', function test( t ) {
var out;
var x;
@@ -140,6 +227,20 @@ tape( 'the function returns a reference to the output array', function test( t )
t.end();
});
+tape( 'the function returns a reference to the output array (accessors)', function test( t ) {
+ var out;
+ var x;
+ var y;
+
+ x = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
+ y = toAccessorArray( [ 0.0, 0.0, 0.0, 0.0, 0.0 ] );
+
+ out = gcusumkbn2( x.length, 0.0, x, 1, 0, y, 1, 0 );
+
+ t.strictEqual( out, y, 'same reference' );
+ t.end();
+});
+
tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `y` unchanged', function test( t ) {
var expected;
var x;
@@ -163,7 +264,6 @@ tape( 'the function supports an `x` stride', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -179,9 +279,36 @@ tape( 'the function supports an `x` stride', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 2, 0, y, 1, 0 );
+ gcusumkbn2( 3, 0.0, x, 2, 0, y, 1, 0 );
+
+ expected = [ 1.0, 4.0, 9.0, 0.0, 0.0 ];
+
+ t.deepEqual( y, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an `x` stride (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 0
+ 2.0,
+ 3.0, // 1
+ 4.0,
+ 5.0 // 2
+ ];
+ y = [
+ 0.0, // 0
+ 0.0, // 1
+ 0.0, // 2
+ 0.0,
+ 0.0
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), 2, 0, toAccessorArray( y ), 1, 0 );
expected = [ 1.0, 4.0, 9.0, 0.0, 0.0 ];
@@ -193,7 +320,6 @@ tape( 'the function supports a `y` stride', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -209,9 +335,36 @@ tape( 'the function supports a `y` stride', function test( t ) {
0.0,
0.0 // 2
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 1, 0, y, 2, 0 );
+ gcusumkbn2( 3, 0.0, x, 1, 0, y, 2, 0 );
+
+ expected = [ 1.0, 0.0, 3.0, 0.0, 6.0 ];
+
+ t.deepEqual( y, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a `y` stride (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 0
+ 2.0, // 1
+ 3.0, // 2
+ 4.0,
+ 5.0
+ ];
+ y = [
+ 0.0, // 0
+ 0.0,
+ 0.0, // 1
+ 0.0,
+ 0.0 // 2
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 2, 0 );
expected = [ 1.0, 0.0, 3.0, 0.0, 6.0 ];
@@ -223,7 +376,6 @@ tape( 'the function supports negative strides', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 2
@@ -239,9 +391,36 @@ tape( 'the function supports negative strides', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, -2, x.length-1, y, -1, 2 );
+ gcusumkbn2( 3, 0.0, x, -2, x.length-1, y, -1, 2 );
+
+ expected = [ 9.0, 8.0, 5.0, 0.0, 0.0 ];
+
+ t.deepEqual( y, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports negative strides (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 1.0, // 2
+ 2.0,
+ 3.0, // 1
+ 4.0,
+ 5.0 // 0
+ ];
+ y = [
+ 0.0, // 2
+ 0.0, // 1
+ 0.0, // 0
+ 0.0,
+ 0.0
+ ];
+
+ gcusumkbn2( 3, 0.0, toAccessorArray( x ), -2, x.length-1, toAccessorArray( y ), -1, 2 );
expected = [ 9.0, 8.0, 5.0, 0.0, 0.0 ];
@@ -251,7 +430,6 @@ tape( 'the function supports negative strides', function test( t ) {
tape( 'the function supports an `x` offset', function test( t ) {
var expected;
- var N;
var x;
var y;
@@ -275,9 +453,42 @@ tape( 'the function supports an `x` offset', function test( t ) {
0.0,
0.0
];
- N = floor( x.length / 2 );
- gcusumkbn2( N, 0.0, x, 2, 1, y, 1, 0 );
+ gcusumkbn2( 4, 0.0, x, 2, 1, y, 1, 0 );
+
+ expected = [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ];
+
+ t.deepEqual( y, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports an `x` offset (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 2.0,
+ 1.0, // 0
+ 2.0,
+ -2.0, // 1
+ -2.0,
+ 2.0, // 2
+ 3.0,
+ 4.0 // 3
+ ];
+ y = [
+ 0.0, // 0
+ 0.0, // 1
+ 0.0, // 2
+ 0.0, // 3
+ 0.0,
+ 0.0,
+ 0.0,
+ 0.0
+ ];
+
+ gcusumkbn2( 4, 0.0, toAccessorArray( x ), 2, 1, toAccessorArray( y ), 1, 0 );
expected = [ 1.0, -1.0, 1.0, 5.0, 0.0, 0.0, 0.0, 0.0 ];
@@ -287,7 +498,6 @@ tape( 'the function supports an `x` offset', function test( t ) {
tape( 'the function supports a `y` offset', function test( t ) {
var expected;
- var N;
var x;
var y;
@@ -311,9 +521,42 @@ tape( 'the function supports a `y` offset', function test( t ) {
0.0,
0.0 // 3
];
- N = floor( x.length / 2 );
- gcusumkbn2( N, 0.0, x, 1, 0, y, 2, 1 );
+ gcusumkbn2( 4, 0.0, x, 1, 0, y, 2, 1 );
+
+ expected = [ 0.0, 2.0, 0.0, 3.0, 0.0, 5.0, 0.0, 3.0 ];
+
+ t.deepEqual( y, expected, 'returns expected value' );
+ t.end();
+});
+
+tape( 'the function supports a `y` offset (accessors)', function test( t ) {
+ var expected;
+ var x;
+ var y;
+
+ x = [
+ 2.0, // 0
+ 1.0, // 1
+ 2.0, // 2
+ -2.0, // 3
+ -2.0,
+ 2.0,
+ 3.0,
+ 4.0
+ ];
+ y = [
+ 0.0,
+ 0.0, // 0
+ 0.0,
+ 0.0, // 1
+ 0.0,
+ 0.0, // 2
+ 0.0,
+ 0.0 // 3
+ ];
+
+ gcusumkbn2( 4, 0.0, toAccessorArray( x ), 1, 0, toAccessorArray( y ), 2, 1 );
expected = [ 0.0, 2.0, 0.0, 3.0, 0.0, 5.0, 0.0, 3.0 ];
@@ -325,7 +568,6 @@ tape( 'the function supports complex access patterns', function test( t ) {
var expected;
var x;
var y;
- var N;
x = [
1.0, // 0
@@ -343,9 +585,8 @@ tape( 'the function supports complex access patterns', function test( t ) {
0.0,
0.0
];
- N = 3;
- gcusumkbn2( N, 0.0, x, 2, 0, y, -1, 2 );
+ gcusumkbn2( 3, 0.0, x, 2, 0, y, -1, 2 );
expected = [ 9.0, 4.0, 1.0, 0.0, 0.0, 0.0 ];