diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/README.md b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/README.md index 5839506794d0..946ef9e829e3 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/README.md @@ -20,7 +20,7 @@ limitations under the License. # gapxsumkbn2 -> Add a constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm. +> Add a scalar constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
@@ -36,15 +36,14 @@ limitations under the License. var gapxsumkbn2 = require( '@stdlib/blas/ext/base/gapxsumkbn2' ); ``` -#### gapxsumkbn2( N, alpha, x, stride ) +#### gapxsumkbn2( N, alpha, x, strideX ) -Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. +Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. ```javascript var x = [ 1.0, -2.0, 2.0 ]; -var N = x.length; -var v = gapxsumkbn2( N, 5.0, x, 1 ); +var v = gapxsumkbn2( x.length, 5.0, x, 1 ); // returns 16.0 ``` @@ -52,17 +51,14 @@ The function has the following parameters: - **N**: number of indexed elements. - **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array]. -- **stride**: index increment for `x`. +- **strideX**: stride length. -The `N` and `stride` parameters determine which elements in `x` are accessed at runtime. For example, to access every other element in `x`, +The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to access every other element: ```javascript -var floor = require( '@stdlib/math/base/special/floor' ); - var x = [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ]; -var N = floor( x.length / 2 ); -var v = gapxsumkbn2( N, 5.0, x, 2 ); +var v = gapxsumkbn2( 4, 5.0, x, 2 ); // returns 25.0 ``` @@ -72,42 +68,35 @@ Note that indexing is relative to the first index. To introduce an offset, use [ ```javascript var Float64Array = require( '@stdlib/array/float64' ); -var floor = require( '@stdlib/math/base/special/floor' ); var x0 = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element -var N = floor( x0.length / 2 ); - -var v = gapxsumkbn2( N, 5.0, x1, 2 ); +var v = gapxsumkbn2( 4, 5.0, x1, 2 ); // returns 25.0 ``` -#### gapxsumkbn2.ndarray( N, alpha, x, stride, offset ) +#### gapxsumkbn2.ndarray( N, alpha, x, strideX, offsetX ) -Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. +Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. ```javascript var x = [ 1.0, -2.0, 2.0 ]; -var N = x.length; -var v = gapxsumkbn2.ndarray( N, 5.0, x, 1, 0 ); +var v = gapxsumkbn2.ndarray( x.length, 5.0, x, 1, 0 ); // returns 16.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 access 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 access every other element starting from the second element: ```javascript -var floor = require( '@stdlib/math/base/special/floor' ); - var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ]; -var N = floor( x.length / 2 ); -var v = gapxsumkbn2.ndarray( N, 5.0, x, 2, 1 ); +var v = gapxsumkbn2.ndarray( 4, 5.0, x, 2, 1 ); // returns 25.0 ``` @@ -133,18 +122,12 @@ var v = gapxsumkbn2.ndarray( N, 5.0, x, 2, 1 ); ```javascript -var randu = require( '@stdlib/random/base/randu' ); -var round = require( '@stdlib/math/base/special/round' ); -var Float64Array = require( '@stdlib/array/float64' ); +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var gapxsumkbn2 = require( '@stdlib/blas/ext/base/gapxsumkbn2' ); -var x; -var i; - -x = new Float64Array( 10 ); -for ( i = 0; i < x.length; i++ ) { - x[ i ] = round( randu()*100.0 ); -} +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float64' +}); console.log( x ); var v = gapxsumkbn2( x.length, 5.0, x, 1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.js index 55e82cac6478..ef371725254c 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.js @@ -21,13 +21,20 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +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; var gapxsumkbn2 = require( './../lib/main.js' ); +// VARIABLES // + +var options = { + 'dtype': 'generic' +}; + + // FUNCTIONS // /** @@ -38,13 +45,7 @@ var gapxsumkbn2 = require( './../lib/main.js' ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x; - var i; - - x = []; - for ( i = 0; i < len; i++ ) { - x.push( ( randu()*20.0 ) - 10.0 ); - } + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.ndarray.js index 9c6070fbb786..8a4159d23f1a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/benchmark/benchmark.ndarray.js @@ -21,13 +21,20 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +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; var gapxsumkbn2 = require( './../lib/ndarray.js' ); +// VARIABLES // + +var options = { + 'dtype': 'generic' +}; + + // FUNCTIONS // /** @@ -38,13 +45,7 @@ var gapxsumkbn2 = require( './../lib/ndarray.js' ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x; - var i; - - x = []; - for ( i = 0; i < len; i++ ) { - x.push( ( randu()*20.0 ) - 10.0 ); - } + var x = uniform( len, -100, 100, options ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/repl.txt index f69626a2c3f7..5daecc930a59 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/repl.txt +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/repl.txt @@ -1,10 +1,10 @@ -{{alias}}( N, alpha, x, stride ) - Adds a constant to each strided array element and computes the sum using a - second-order iterative Kahan–Babuška algorithm. +{{alias}}( N, alpha, x, strideX ) + Adds a scalar constant to each strided array element and computes the sum + using a second-order iterative Kahan–Babuška algorithm. - The `N` and `stride` parameters determine which elements in `x` are accessed - at runtime. + The `N` and stride parameters determine which elements in the strided array + are accessed at runtime. Indexing is relative to the first index. To introduce an offset, use a typed array view. @@ -17,13 +17,13 @@ Number of indexed elements. alpha: number - Constant. + Scalar constant. x: Array|TypedArray Input array. - stride: integer - Index increment. + strideX: integer + Stride length. Returns ------- @@ -37,28 +37,25 @@ > {{alias}}( x.length, 5.0, x, 1 ) 16.0 - // Using `N` and `stride` parameters: + // Using `N` and stride parameters: > x = [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0 ]; - > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 ); - > var stride = 2; - > {{alias}}( N, 5.0, x, stride ) + > {{alias}}( 3, 5.0, x, 2 ) 16.0 // Using view offsets: > var x0 = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0 ] ); > var x1 = new {{alias:@stdlib/array/float64}}( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); - > N = {{alias:@stdlib/math/base/special/floor}}( x0.length / 2 ); - > stride = 2; - > {{alias}}( N, 5.0, x1, stride ) + > {{alias}}( 3, 5.0, x1, 2 ) 14.0 -{{alias}}.ndarray( N, alpha, x, stride, offset ) - Adds a constant to each strided array element and computes the sum using a - second-order iterative Kahan–Babuška algorithm and alternative indexing - semantics. + +{{alias}}.ndarray( N, alpha, x, strideX, offsetX ) + Adds a scalar constant to each strided array element and computes the sum + using a second-order iterative Kahan–Babuška algorithm 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 + buffer, the offset parameter supports indexing semantics based on a starting index. Parameters @@ -67,15 +64,15 @@ Number of indexed elements. alpha: number - Constant. + Scalar constant. x: Array|TypedArray Input array. - stride: integer - Index increment. + strideX: integer + Stride length. - offset: integer + offsetX: integer Starting index. Returns @@ -92,8 +89,7 @@ // Using offset parameter: > var x = [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0 ]; - > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 ); - > {{alias}}.ndarray( N, 5.0, x, 2, 1 ) + > {{alias}}.ndarray( 3, 5.0, x, 2, 1 ) 14.0 See Also diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/types/index.d.ts index cad9b6abc9e4..e17d4a7be343 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/types/index.d.ts +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/docs/types/index.d.ts @@ -27,12 +27,12 @@ import { NumericArray } from '@stdlib/types/array'; */ interface Routine { /** - * Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. + * Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. * * @param N - number of indexed elements - * @param alpha - constant + * @param alpha - scalar constant * @param x - input array - * @param stride - stride length + * @param strideX - stride length * @returns sum * * @example @@ -41,16 +41,16 @@ interface Routine { * var v = gapxsumkbn2( x.length, 5.0, x, 1 ); * // returns 16.0 */ - ( N: number, alpha: number, x: NumericArray, stride: number ): number; + ( N: number, alpha: number, x: NumericArray, strideX: number ): number; /** - * Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. + * Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. * * @param N - number of indexed elements - * @param alpha - constant + * @param alpha - scalar constant * @param x - input array - * @param stride - stride length - * @param offset - starting index + * @param strideX - stride length + * @param offsetX - starting index * @returns sum * * @example @@ -59,16 +59,16 @@ interface Routine { * var v = gapxsumkbn2.ndarray( x.length, 5.0, x, 1, 0 ); * // returns 16.0 */ - ndarray( N: number, alpha: number, x: NumericArray, stride: number, offset: number ): number; + ndarray( N: number, alpha: number, x: NumericArray, strideX: number, offsetX: number ): number; } /** -* Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. +* Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. * * @param N - number of indexed elements -* @param alpha - constant +* @param alpha - scalar constant * @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/gapxsumkbn2/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/examples/index.js index 56408527a658..f754cf87be9f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/examples/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/examples/index.js @@ -18,18 +18,12 @@ 'use strict'; -var randu = require( '@stdlib/random/base/randu' ); -var round = require( '@stdlib/math/base/special/round' ); -var Float64Array = require( '@stdlib/array/float64' ); +var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var gapxsumkbn2 = require( './../lib' ); -var x; -var i; - -x = new Float64Array( 10 ); -for ( i = 0; i < x.length; i++ ) { - x[ i ] = round( randu()*100.0 ); -} +var x = discreteUniform( 10, -100, 100, { + 'dtype': 'float64' +}); console.log( x ); var v = gapxsumkbn2( x.length, 5.0, x, 1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/index.js index e47ed0666fa1..3dd2b20a0ef7 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/index.js @@ -19,7 +19,7 @@ 'use strict'; /** -* Add a constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm. +* Add a scalar constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm. * * @module @stdlib/blas/ext/base/gapxsumkbn2 * @@ -27,19 +27,16 @@ * var gapxsumkbn2 = require( '@stdlib/blas/ext/base/gapxsumkbn2' ); * * var x = [ 1.0, -2.0, 2.0 ]; -* var N = x.length; * -* var v = gapxsumkbn2( N, 5.0, x, 1 ); +* var v = gapxsumkbn2( x.length, 5.0, x, 1 ); * // returns 16.0 * * @example -* var floor = require( '@stdlib/math/base/special/floor' ); * var gapxsumkbn2 = require( '@stdlib/blas/ext/base/gapxsumkbn2' ); * * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ]; -* var N = floor( x.length / 2 ); * -* var v = gapxsumkbn2.ndarray( N, 5.0, x, 2, 1 ); +* var v = gapxsumkbn2.ndarray( 4, 5.0, x, 2, 1 ); * // returns 25.0 */ diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/main.js index e4523d252596..60ac0e7c0777 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/main.js @@ -20,13 +20,14 @@ // MODULES // -var abs = require( '@stdlib/math/base/special/abs' ); +var stride2offset = require( '@stdlib/strided/base/stride2offset' ); +var ndarray = require( './ndarray.js' ); // MAIN // /** -* Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. +* Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. * * ## Method * @@ -37,63 +38,19 @@ var abs = require( '@stdlib/math/base/special/abs' ); * - 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). * * @param {PositiveInteger} N - number of indexed elements -* @param {number} alpha - constant +* @param {number} alpha - scalar constant * @param {NumericArray} x - input array -* @param {integer} stride - stride length +* @param {integer} strideX - stride length * @returns {number} sum * * @example * var x = [ 1.0, -2.0, 2.0 ]; -* var N = x.length; * -* var v = gapxsumkbn2( N, 5.0, x, 1 ); +* var v = gapxsumkbn2( x.length, 5.0, x, 1 ); * // returns 16.0 */ -function gapxsumkbn2( N, alpha, x, stride ) { - var sum; - var ccs; - var ix; - var cs; - var cc; - var v; - var t; - var c; - var i; - - if ( N <= 0 ) { - return 0.0; - } - if ( N === 1 || stride === 0 ) { - return alpha + x[ 0 ]; - } - if ( stride < 0 ) { - ix = (1-N) * stride; - } else { - ix = 0; - } - sum = 0.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 = alpha + 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; - ix += stride; - } - return sum + cs + ccs; +function gapxsumkbn2( N, alpha, x, strideX ) { + return ndarray( N, alpha, x, strideX, stride2offset( N, strideX ) ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/ndarray.js index 8b6947efd432..045c6ad7dc92 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/lib/ndarray.js @@ -26,7 +26,7 @@ var abs = require( '@stdlib/math/base/special/abs' ); // MAIN // /** -* Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. +* Adds a scalar constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm. * * ## Method * @@ -37,22 +37,19 @@ var abs = require( '@stdlib/math/base/special/abs' ); * - 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). * * @param {PositiveInteger} N - number of indexed elements -* @param {number} alpha - constant +* @param {number} alpha - scalar constant * @param {NumericArray} 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 -* var floor = require( '@stdlib/math/base/special/floor' ); -* * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ]; -* var N = floor( x.length / 2 ); * -* var v = gapxsumkbn2( N, 5.0, x, 2, 1 ); +* var v = gapxsumkbn2( 4, 5.0, x, 2, 1 ); * // returns 25.0 */ -function gapxsumkbn2( N, alpha, x, stride, offset ) { +function gapxsumkbn2( N, alpha, x, strideX, offsetX ) { var sum; var ccs; var ix; @@ -66,10 +63,10 @@ function gapxsumkbn2( N, alpha, x, stride, offset ) { if ( N <= 0 ) { return 0.0; } - if ( N === 1 || stride === 0 ) { - return alpha + x[ 0 ]; + ix = offsetX; + if ( strideX === 0 ) { + return N * ( alpha + x[ ix ] ); } - ix = offset; sum = 0.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 @@ -90,7 +87,7 @@ function gapxsumkbn2( N, alpha, x, stride, offset ) { } cs = t; ccs += cc; - ix += stride; + ix += strideX; } return sum + cs + ccs; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/package.json b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/package.json index dd38caa15a5b..0a9dfd7023eb 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/package.json +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/package.json @@ -1,7 +1,7 @@ { "name": "@stdlib/blas/ext/base/gapxsumkbn2", "version": "0.0.0", - "description": "Add a constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.", + "description": "Add a scalar constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.", "license": "Apache-2.0", "author": { "name": "The Stdlib Authors", diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.main.js index aca949c5845e..9eb4802bc36e 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.main.js @@ -140,14 +140,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 plus a constant', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant repeated N times', function test( t ) { var x; var v; x = [ 1.0, -2.0, -4.0, 5.0, 3.0 ]; v = gapxsumkbn2( x.length, 5.0, x, 0 ); - t.strictEqual( v, 6.0, 'returns expected value' ); + t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' ); t.end(); }); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.ndarray.js index 6c1e0eaf6b88..1f7bf25a6f4d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gapxsumkbn2/test/test.ndarray.js @@ -139,14 +139,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 plus a constant', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant repeated N times', function test( t ) { var x; var v; x = [ 1.0, -2.0, -4.0, 5.0, 3.0 ]; v = gapxsumkbn2( x.length, 5.0, x, 0, 0 ); - t.strictEqual( v, 6.0, 'returns expected value' ); + t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' ); t.end(); });