Skip to content

Commit a5f8e2c

Browse files
committed
chore: fix JavaScript lint errors (issue #7070 )
resolves #7070
1 parent 53c6429 commit a5f8e2c

File tree

1 file changed

+50
-50
lines changed
  • lib/node_modules/@stdlib/stats/strided/dnanvarianceyc/lib

1 file changed

+50
-50
lines changed

lib/node_modules/@stdlib/stats/strided/dnanvarianceyc/lib/ndarray.js

Lines changed: 50 additions & 50 deletions
Original file line numberDiff line numberDiff line change
@@ -47,58 +47,58 @@
4747
* // returns 6.25
4848
*/
4949
function dnanvarianceyc( N, correction, x, strideX, offsetX ) {
50-
var sum;
51-
var ix;
52-
var nc;
53-
var S;
54-
var v;
55-
var d;
56-
var n;
57-
var i;
50+
var sum;
51+
var ix;
52+
var nc;
53+
var S;
54+
var v;
55+
var d;
56+
var n;
57+
var i;
5858

59-
if ( N <= 0 ) {
60-
return NaN;
61-
}
62-
if ( N === 1 || strideX === 0 ) {
63-
v = x[ offsetX ];
64-
if ( v === v && N-correction > 0.0 ) {
65-
return 0.0;
66-
}
67-
return NaN;
68-
}
69-
ix = offsetX;
59+
if ( N <= 0 ) {
60+
return NaN;
61+
}
62+
if ( N === 1 || strideX === 0 ) {
63+
v = x[ offsetX ];
64+
if ( v === v && N-correction > 0.0 ) {
65+
return 0.0;
66+
}
67+
return NaN;
68+
}
69+
ix = offsetX;
7070

71-
// Find the first non-NaN element...
72-
for ( i = 0; i < N; i++ ) {
73-
v = x[ ix ];
74-
if ( v === v ) {
75-
break;
76-
}
77-
ix += strideX;
78-
}
79-
if ( i === N ) {
80-
return NaN;
81-
}
82-
ix += strideX;
83-
sum = v;
84-
S = 0.0;
85-
i += 1;
86-
n = 1;
87-
for ( i; i < N; i++ ) {
88-
v = x[ ix ];
89-
if ( v === v ) {
90-
n += 1;
91-
sum += v;
92-
d = (n*v) - sum;
93-
S += (1.0/(n*(n-1))) * d * d;
94-
}
95-
ix += strideX;
96-
}
97-
nc = n - correction;
98-
if ( nc <= 0.0 ) {
99-
return NaN;
100-
}
101-
return S / nc;
71+
// Find the first non-NaN element...
72+
for ( i = 0; i < N; i++ ) {
73+
v = x[ ix ];
74+
if ( v === v ) {
75+
break;
76+
}
77+
ix += strideX;
78+
}
79+
if ( i === N ) {
80+
return NaN;
81+
}
82+
ix += strideX;
83+
sum = v;
84+
S = 0.0;
85+
i += 1;
86+
n = 1;
87+
for ( i; i < N; i++ ) {
88+
v = x[ ix ];
89+
if ( v === v ) {
90+
n += 1;
91+
sum += v;
92+
d = (n*v) - sum;
93+
S += (1.0/(n*(n-1))) * d * d;
94+
}
95+
ix += strideX;
96+
}
97+
nc = n - correction;
98+
if ( nc <= 0.0 ) {
99+
return NaN;
100+
}
101+
return S / nc;
102102
}
103103

104104

0 commit comments

Comments
 (0)