Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /**
* @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';
// MAIN //
/**
* Computes the variance of a strided array ignoring `NaN` values and using a one-pass algorithm proposed by Youngs and Cramer.
*
* ## Method
*
* - This implementation uses a one-pass algorithm, as proposed by Youngs and Cramer (1971).
*
* ## References
*
* - Youngs, Edward A., and Elliot M. Cramer. 1971. "Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms." _Technometrics_ 13 (3): 657–65. doi:[10.1080/00401706.1971.10488826](https://doi.org/10.1080/00401706.1971.10488826).
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} correction - degrees of freedom adjustment
* @param {Object} x - input array object
* @param {Collection} x.data - input array data
* @param {Array<Function>} x.accessors - array element accessors
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {number} variance
*
* @example
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
*
* var x = toAccessorArray( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ] );
*
* var v = nanvarianceyc( 5, 1.0, arraylike2object( x ), 2, 1 );
* // returns 6.25
*/
function nanvarianceyc( N, correction, x, strideX, offsetX ) {
var xbuf;
var xget;
var sum;
var ix;
var nc;
var S;
var v;
var d;
var n;
var i;
// Cache a reference to array data:
xbuf = x.data;
// Cache a reference to an element accessor:
xget = x.accessors[ 0 ];
if ( N === 1 || strideX === 0 ) {
v = xget( xbuf, offsetX );
if ( v === v && N-correction > 0.0 ) {
return 0.0;
}
return NaN;
}
ix = offsetX;
// Find the first non-NaN element...
for ( i = 0; i < N; i++ ) {
v = xget( xbuf, ix );
if ( v === v ) {
break;
}
ix += strideX;
}
if ( i === N ) {
return NaN;
}
ix += strideX;
sum = v;
S = 0.0;
i += 1;
n = 1;
for ( i; i < N; i++ ) {
v = xget( xbuf, ix );
if ( v === v ) {
n += 1;
sum += v;
d = (n*v) - sum;
S += (1.0/(n*(n-1))) * d * d;
}
ix += strideX;
}
nc = n - correction;
if ( nc <= 0.0 ) {
return NaN;
}
return S / nc;
}
// EXPORTS //
module.exports = nanvarianceyc;
|