diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/README.md b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/README.md index 61e9bd52e8af..ce3e9ab39b06 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/README.md @@ -36,15 +36,14 @@ limitations under the License. var gnansumors = require( '@stdlib/blas/ext/base/gnansumors' ); ``` -#### gnansumors( N, x, stride ) +#### gnansumors( N, x, strideX ) Computes the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation. ```javascript var x = [ 1.0, -2.0, NaN, 2.0 ]; -var N = x.length; -var v = gnansumors( N, x, 1 ); +var v = gnansumors( x.length, x, 1 ); // returns 1.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 for `x`. -The `N` and `stride` parameters determine which elements in `x` are accessed at runtime. For example, to compute the sum of every other element in `x`, +The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to compute the sum of every other element: ```javascript -var 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, NaN, NaN ]; -var N = floor( x.length / 2 ); -var v = gnansumors( N, x, 2 ); +var v = gnansumors( 5, x, 2 ); // returns 5.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 = gnansumors( N, x1, 2 ); +var v = gnansumors( 4, x1, 2 ); // returns 5.0 ``` -#### gnansumors.ndarray( N, x, stride, offset ) +#### gnansumors.ndarray( N, x, strideX, offsetX ) Computes the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation and alternative indexing semantics. ```javascript var x = [ 1.0, -2.0, NaN, 2.0 ]; -var N = x.length; -var v = gnansumors.ndarray( N, x, 1, 0 ); +var v = gnansumors.ndarray( x.length, x, 1, 0 ); // returns 1.0 ``` The function has the following additional parameters: -- **offset**: starting index for `x`. +- **offsetX**: starting index for `x`. -While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying `buffer`, the `offset` parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other value in `x` starting from the second value +While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other element starting from the second element: ```javascript -var 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, NaN, NaN ]; -var N = floor( x.length / 2 ); -var v = gnansumors.ndarray( N, x, 2, 1 ); +var v = gnansumors.ndarray( 5, x, 2, 1 ); // returns 5.0 ``` @@ -134,22 +123,19 @@ var v = gnansumors.ndarray( N, 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/base/discrete-uniform' ); +var bernoulli = require( '@stdlib/random/base/bernoulli' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var gnansumors = require( '@stdlib/blas/ext/base/gnansumors' ); -var x; -var i; - -x = new Float64Array( 10 ); -for ( i = 0; i < x.length; i++ ) { - if ( randu() < 0.2 ) { - x[ i ] = NaN; - } else { - x[ i ] = round( randu()*100.0 ); +function rand() { + if ( bernoulli( 0.7 ) > 0 ) { + return discreteUniform( 0, 100 ); } + return NaN; } + +var x = filledarrayBy( 10, 'float64', rand ); console.log( x ); var v = gnansumors( x.length, x, 1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.js index 37f92bbb98c9..05eb87ec8e9f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.js @@ -21,7 +21,9 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var uniform = require( '@stdlib/random/base/uniform' ); +var bernoulli = require( '@stdlib/random/base/bernoulli' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var pkg = require( './../package.json' ).name; @@ -30,6 +32,19 @@ var gnansumors = require( './../lib/main.js' ); // FUNCTIONS // +/** +* Returns a random number. +* +* @private +* @returns {number} random number +*/ +function rand() { + if ( bernoulli( 0.8 ) > 0 ) { + return uniform( -10.0, 10.0 ); + } + return NaN; +} + /** * Creates a benchmark function. * @@ -38,17 +53,7 @@ var gnansumors = require( './../lib/main.js' ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x; - var i; - - x = []; - for ( i = 0; i < len; i++ ) { - if ( randu() < 0.2 ) { - x.push( NaN ); - } else { - x.push( ( randu()*10.0 ) - 20.0 ); - } - } + var x = filledarrayBy( len, 'generic', rand ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.ndarray.js index 089664e9163d..a2accc5c6ead 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/benchmark/benchmark.ndarray.js @@ -21,7 +21,9 @@ // MODULES // var bench = require( '@stdlib/bench' ); -var randu = require( '@stdlib/random/base/randu' ); +var uniform = require( '@stdlib/random/base/uniform' ); +var bernoulli = require( '@stdlib/random/base/bernoulli' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var isnan = require( '@stdlib/math/base/assert/is-nan' ); var pow = require( '@stdlib/math/base/special/pow' ); var pkg = require( './../package.json' ).name; @@ -30,6 +32,19 @@ var gnansumors = require( './../lib/ndarray.js' ); // FUNCTIONS // +/** +* Returns a random number. +* +* @private +* @returns {number} random number +*/ +function rand() { + if ( bernoulli( 0.8 ) > 0 ) { + return uniform( -10.0, 10.0 ); + } + return NaN; +} + /** * Creates a benchmark function. * @@ -38,17 +53,7 @@ var gnansumors = require( './../lib/ndarray.js' ); * @returns {Function} benchmark function */ function createBenchmark( len ) { - var x; - var i; - - x = []; - for ( i = 0; i < len; i++ ) { - if ( randu() < 0.2 ) { - x.push( NaN ); - } else { - x.push( ( randu()*10.0 ) - 20.0 ); - } - } + var x = filledarrayBy( len, 'generic', rand ); return benchmark; function benchmark( b ) { diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/repl.txt index 16a5c9a454e8..f99e4fe8bd11 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/repl.txt +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/repl.txt @@ -1,10 +1,10 @@ -{{alias}}( N, x, stride ) +{{alias}}( N, x, strideX ) Computes the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation. - 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. @@ -19,8 +19,8 @@ x: Array|TypedArray Input array. - stride: integer - Index increment. + strideX: integer + Stride length. Returns ------- @@ -34,27 +34,24 @@ > {{alias}}( x.length, x, 1 ) 1.0 - // Using `N` and `stride` parameters: + // Using `N` and stride parameters: > x = [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0, NaN, NaN ]; - > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 ); - > var stride = 2; - > {{alias}}( N, x, stride ) + > {{alias}}( 4, x, 2 ) 1.0 // Using view offsets: > var x0 = new {{alias:@stdlib/array/float64}}( [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0, NaN, NaN ] ); > 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, x1, stride ) + > {{alias}}( 4, x1, 2 ) -1.0 -{{alias}}.ndarray( N, x, stride, offset ) + +{{alias}}.ndarray( N, x, strideX, offsetX ) Computes the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation 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 @@ -65,10 +62,10 @@ x: Array|TypedArray Input array. - stride: integer - Index increment. + strideX: integer + Stride length. - offset: integer + offsetX: integer Starting index. Returns @@ -85,8 +82,7 @@ // Using offset parameter: > var x = [ 1.0, -2.0, 3.0, 2.0, 5.0, -1.0, NaN, NaN ]; - > var N = {{alias:@stdlib/math/base/special/floor}}( x.length / 2 ); - > {{alias}}.ndarray( N, x, 2, 1 ) + > {{alias}}.ndarray( 4, x, 2, 1 ) -1.0 See Also diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/types/index.d.ts index 143ef7c7ad65..dbabe3b7d1d9 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/types/index.d.ts +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/docs/types/index.d.ts @@ -31,7 +31,7 @@ interface Routine { * * @param N - number of indexed elements * @param x - input array - * @param stride - stride length + * @param strideX - stride length * @returns sum * * @example @@ -40,15 +40,15 @@ interface Routine { * var v = gnansumors( x.length, x, 1 ); * // returns 1.0 */ - ( N: number, x: NumericArray, stride: number ): number; + ( N: number, x: NumericArray, strideX: number ): number; /** * Computes the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation and alternative indexing semantics. * * @param N - number of indexed elements * @param x - input array - * @param stride - stride length - * @param offset - starting index + * @param strideX - stride length + * @param offsetX - starting index * @returns sum * * @example @@ -57,7 +57,7 @@ interface Routine { * var v = gnansumors.ndarray( x.length, x, 1, 0 ); * // returns 1.0 */ - ndarray( N: number, x: NumericArray, stride: number, offset: number ): number; + ndarray( N: number, x: NumericArray, strideX: number, offsetX: number ): number; } /** @@ -65,7 +65,7 @@ interface Routine { * * @param N - number of indexed elements * @param x - input array -* @param stride - stride length +* @param strideX - stride length * @returns sum * * @example diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/examples/index.js index 8f3186f54941..0300e968049a 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/examples/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/examples/index.js @@ -18,22 +18,19 @@ '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/base/discrete-uniform' ); +var bernoulli = require( '@stdlib/random/base/bernoulli' ); +var filledarrayBy = require( '@stdlib/array/filled-by' ); var gnansumors = require( './../lib' ); -var x; -var i; - -x = new Float64Array( 10 ); -for ( i = 0; i < x.length; i++ ) { - if ( randu() < 0.2 ) { - x[ i ] = NaN; - } else { - x[ i ] = round( randu()*100.0 ); +function rand() { + if ( bernoulli( 0.7 ) > 0 ) { + return discreteUniform( 0, 100 ); } + return NaN; } + +var x = filledarrayBy( 10, 'float64', rand ); console.log( x ); var v = gnansumors( x.length, x, 1 ); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/index.js index 2247de83bd26..4cc491fd9841 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/index.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/index.js @@ -27,19 +27,16 @@ * var gnansumors = require( '@stdlib/blas/ext/base/gnansumors' ); * * var x = [ 1.0, -2.0, NaN, 2.0 ]; -* var N = x.length; * -* var v = gnansumors( N, x, 1 ); +* var v = gnansumors( x.length, x, 1 ); * // returns 1.0 * * @example -* var floor = require( '@stdlib/math/base/special/floor' ); * var gnansumors = require( '@stdlib/blas/ext/base/gnansumors' ); * * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ]; -* var N = floor( x.length / 2 ); * -* var v = gnansumors.ndarray( N, x, 2, 1 ); +* var v = gnansumors.ndarray( 5, x, 2, 1 ); * // returns 5.0 */ diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/main.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/main.js index d58ccbb4127b..5e7742c0d02d 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/main.js @@ -20,7 +20,8 @@ // MODULES // -var isnan = require( '@stdlib/math/base/assert/is-nan' ); +var stride2offset = require( '@stdlib/strided/base/stride2offset' ); +var ndarray = require( './ndarray.js' ); // MAIN // @@ -30,43 +31,17 @@ var isnan = require( '@stdlib/math/base/assert/is-nan' ); * * @param {PositiveInteger} N - number of indexed elements * @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, NaN, 2.0 ]; -* var N = x.length; * -* var v = gnansumors( N, x, 1 ); +* var v = gnansumors( x.length, x, 1 ); * // returns 1.0 */ -function gnansumors( N, x, stride ) { - var ix; - var s; - var i; - - s = 0.0; - if ( N <= 0 ) { - return s; - } - if ( N === 1 || stride === 0 ) { - if ( isnan( x[ 0 ] ) ) { - return s; - } - return x[ 0 ]; - } - if ( stride < 0 ) { - ix = (1-N) * stride; - } else { - ix = 0; - } - for ( i = 0; i < N; i++ ) { - if ( isnan( x[ ix ] ) === false ) { - s += x[ ix ]; - } - ix += stride; - } - return s; +function gnansumors( N, x, strideX ) { + return ndarray( N, x, strideX, stride2offset( N, strideX ) ); } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/ndarray.js index 45529e5abaf2..a61dc7ca7582 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/lib/ndarray.js @@ -30,42 +30,39 @@ var isnan = require( '@stdlib/math/base/assert/is-nan' ); * * @param {PositiveInteger} N - number of indexed elements * @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 = gnansumors( N, x, 2, 1 ); +* var v = gnansumors( 4, x, 2, 1 ); * // returns 5.0 */ -function gnansumors( N, x, stride, offset ) { +function gnansumors( N, x, strideX, offsetX ) { + var sum; var ix; - var s; var i; - s = 0.0; if ( N <= 0 ) { - return s; + return 0.0; } - if ( N === 1 || stride === 0 ) { - if ( isnan( x[ offset ] ) ) { - return s; + ix = offsetX; + if ( strideX === 0 ) { + if ( isnan( x[ ix ] ) ) { + return 0.0; } - return x[ offset ]; + return N * x[ ix ]; } - ix = offset; + sum = 0.0; for ( i = 0; i < N; i++ ) { if ( isnan( x[ ix ] ) === false ) { - s += x[ ix ]; + sum += x[ ix ]; } - ix += stride; + ix += strideX; } - return s; + return sum; } diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.main.js index 1558559014bf..69e3b49ab95f 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.main.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.main.js @@ -21,7 +21,6 @@ // MODULES // var tape = require( 'tape' ); -var floor = require( '@stdlib/math/base/special/floor' ); var Float64Array = require( '@stdlib/array/float64' ); var gnansumors = require( './../lib' ); @@ -102,7 +101,6 @@ tape( 'if provided an `N` parameter equal to `1`, the function returns the first }); tape( 'the function supports a `stride` parameter', function test( t ) { - var N; var x; var v; @@ -119,15 +117,13 @@ tape( 'the function supports a `stride` parameter', function test( t ) { NaN ]; - N = floor( x.length / 2 ); - v = gnansumors( N, x, 2 ); + v = gnansumors( 5, x, 2 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); tape( 'the function supports a negative `stride` parameter', function test( t ) { - var N; var x; var v; @@ -144,21 +140,32 @@ tape( 'the function supports a negative `stride` parameter', function test( t ) 2.0 ]; - N = floor( x.length / 2 ); - v = gnansumors( N, x, -2 ); + v = gnansumors( 5, x, -2 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', function test( t ) { var x; var v; x = [ 1.0, -2.0, -4.0, 5.0, 3.0 ]; v = gnansumors( x.length, x, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided a `stride` parameter equal to `0` and the first element is NaN, the function returns 0', function test( t ) { + var x; + var v; + + x = [ NaN, -2.0, -4.0, 5.0, 3.0 ]; + + v = gnansumors( x.length, x, 0 ); + t.strictEqual( v, 0.0, 'returns expected value' ); t.end(); }); @@ -166,7 +173,6 @@ tape( 'if provided a `stride` parameter equal to `0`, the function returns the f tape( 'the function supports view offsets', function test( t ) { var x0; var x1; - var N; var v; x0 = new Float64Array([ @@ -184,9 +190,8 @@ tape( 'the function supports view offsets', function test( t ) { ]); x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element - N = floor(x1.length / 2); - v = gnansumors( N, x1, 2 ); + v = gnansumors( 5, x1, 2 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.ndarray.js index 761ad2c2909c..bdc2a24686fe 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.ndarray.js +++ b/lib/node_modules/@stdlib/blas/ext/base/gnansumors/test/test.ndarray.js @@ -21,7 +21,6 @@ // MODULES // var tape = require( 'tape' ); -var floor = require( '@stdlib/math/base/special/floor' ); var gnansumors = require( './../lib/ndarray.js' ); @@ -101,7 +100,6 @@ tape( 'if provided an `N` parameter equal to `1`, the function returns the first }); tape( 'the function supports a `stride` parameter', function test( t ) { - var N; var x; var v; @@ -118,15 +116,13 @@ tape( 'the function supports a `stride` parameter', function test( t ) { NaN ]; - N = floor( x.length / 2 ); - v = gnansumors( N, x, 2, 0 ); + v = gnansumors( 5, x, 2, 0 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); tape( 'the function supports a negative `stride` parameter', function test( t ) { - var N; var x; var v; @@ -143,27 +139,37 @@ tape( 'the function supports a negative `stride` parameter', function test( t ) 2.0 ]; - N = floor( x.length / 2 ); - v = gnansumors( N, x, -2, 8 ); + v = gnansumors( 5, x, -2, 8 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end(); }); -tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element', function test( t ) { +tape( 'if provided a `stride` parameter equal to `0`, the function returns the sum of the first element repeated N times', function test( t ) { var x; var v; x = [ 1.0, -2.0, -4.0, 5.0, 3.0 ]; v = gnansumors( x.length, x, 0, 0 ); - t.strictEqual( v, 1.0, 'returns expected value' ); + t.strictEqual( v, 5.0, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided a `stride` parameter equal to `0` and the first element is NaN, the function returns 0', function test( t ) { + var x; + var v; + + x = [ NaN, -2.0, -4.0, 5.0, 3.0 ]; + + v = gnansumors( x.length, x, 0, 0 ); + t.strictEqual( v, 0.0, 'returns expected value' ); t.end(); }); tape( 'the function supports an `offset` parameter', function test( t ) { - var N; var x; var v; @@ -179,9 +185,8 @@ tape( 'the function supports an `offset` parameter', function test( t ) { NaN, NaN // 4 ]; - N = floor( x.length / 2 ); - v = gnansumors( N, x, 2, 1 ); + v = gnansumors( 5, x, 2, 1 ); t.strictEqual( v, 5.0, 'returns expected value' ); t.end();