qntjs-lib 2.0.3 → 2.0.4

package/dist/bundle/index.js

@@ -215,7 +215,7 @@ function sn(n, t) {
   }
   return e;
 }
-function V() {
+function S() {
   return typeof process == "undefined" || typeof process.env == "undefined" ? !1 : process.env.SKIP_DENSE_OPTIMIZATION === "true";
 }
 function dt(n, t, r, e = !0) {
@@ -229,33 +229,33 @@ function dt(n, t, r, e = !0) {
   if (!e) {
     a = 0, s = 0;
     const N = Math.min(o, t);
-    for (let h = 1; h < N; h++) {
-      const m = h - 1, w = n[m];
+    for (let m = 1; m < N; m++) {
+      const h = m - 1, w = n[h];
       if (f)
         for (; s > a && n[i[s - 1]] <= w; )
           s--;
       else
         for (; s > a && n[i[s - 1]] >= w; )
           s--;
-      i[s++] = m;
-      const v = h - t;
+      i[s++] = h;
+      const v = m - t;
       for (; s > a && i[a] < v; )
         a++;
     }
-    for (let h = Math.max(t, 1); h < o; h++) {
-      const m = h - 1, w = n[m];
+    for (let m = Math.max(t, 1); m < o; m++) {
+      const h = m - 1, w = n[h];
       if (f)
         for (; s > a && n[i[s - 1]] <= w; )
           s--;
       else
         for (; s > a && n[i[s - 1]] >= w; )
           s--;
-      i[s++] = m;
-      const v = h - t;
+      i[s++] = h;
+      const v = m - t;
       for (; s > a && i[a] < v; )
         a++;
       const d = s > a ? i[a] : -1;
-      d >= 0 ? l[h] = f ? n[h] > n[d] ? 1 : 0 : n[h] < n[d] ? 1 : 0 : l[h] = 0;
+      d >= 0 ? l[m] = f ? n[m] > n[d] ? 1 : 0 : n[m] < n[d] ? 1 : 0 : l[m] = 0;
     }
     return l;
   }
@@ -267,21 +267,21 @@ function dt(n, t, r, e = !0) {
     N !== N ? (l[0] = 0, u = -1) : (u = 0, l[0] = 0);
   }
   for (let N = 1; N < c; N++) {
-    const h = n[N];
-    if (h !== h) {
+    const m = n[N];
+    if (m !== m) {
       l[N] = l[N - 1];
       continue;
     }
-    const m = u;
-    if (m >= 0) {
-      const v = n[m];
+    const h = u;
+    if (h >= 0) {
+      const v = n[h];
       if (f)
         for (; s > a && n[i[s - 1]] <= v; )
           s--;
       else
         for (; s > a && n[i[s - 1]] >= v; )
           s--;
-      i[s++] = m;
+      i[s++] = h;
     }
     u = N;
     const w = N - t;
@@ -289,21 +289,21 @@ function dt(n, t, r, e = !0) {
       a++;
   }
   for (let N = Math.max(t, 1); N < o; N++) {
-    const h = n[N];
-    if (h !== h) {
+    const m = n[N];
+    if (m !== m) {
       l[N] = l[N - 1];
       continue;
     }
-    const m = u;
-    if (m >= 0) {
-      const d = n[m];
+    const h = u;
+    if (h >= 0) {
+      const d = n[h];
       if (f)
         for (; s > a && n[i[s - 1]] <= d; )
           s--;
       else
         for (; s > a && n[i[s - 1]] >= d; )
           s--;
-      i[s++] = m;
+      i[s++] = h;
     }
     u = N;
     const w = N - t;
@@ -402,7 +402,7 @@ function At(n) {
   }
   return r;
 }
-function D(n) {
+function P(n) {
   const t = At(n), r = t.length;
   for (let e = 0; e < r; e++)
     t[e] = t[e] ? 0 : 1;
@@ -492,12 +492,12 @@ const Do = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   havena: k,
   isna: At,
   lag: yt,
-  notna: D,
+  notna: P,
   replace: bn
 }, Symbol.toStringTag, { value: "Module" }));
 function it(n, t = !0) {
   let r = 0, e = 0;
-  if (!V() && t && (k(n) || (t = !1)), t)
+  if (!S() && t && (k(n) || (t = !1)), t)
     for (let o = 0; o < n.length; o++) {
       const l = n[o];
       l === l && (r += l, e++);
@@ -509,7 +509,7 @@ function it(n, t = !0) {
   }
   return e === 0 ? NaN : r;
 }
-function Mn(n) {
+function Fn(n) {
   const t = n.length, r = new Float64Array(t);
   let e = 0;
   for (let o = 0; o < t; o++) {
@@ -524,7 +524,7 @@ function nt(n, t, r = !0) {
     throw new Error("period must be positive");
   if (e < t)
     return o.fill(NaN);
-  if (V() || r && !k(n) && (r = !1), !r) {
+  if (S() || r && !k(n) && (r = !1), !r) {
     let i = 0;
     for (let a = 0; a < t; a++)
       i += n[a];
@@ -574,7 +574,7 @@ function bt(n, t, r) {
   }
   return o;
 }
-function Fn(n, t) {
+function Mn(n, t) {
   return bt(n, t, !1);
 }
 function xn(n, t) {
@@ -591,27 +591,27 @@ function Nt(n, t, r, e) {
     return { min: l, max: f };
   const i = new Int32Array(o), a = new Int32Array(o);
   let s = 0, u = 0, c = 0, N = 0;
-  for (let h = 0; h < r - 1; h++) {
-    const m = n[h], w = t[h];
-    for (; u > s && n[i[u - 1]] > m; )
+  for (let m = 0; m < r - 1; m++) {
+    const h = n[m], w = t[m];
+    for (; u > s && n[i[u - 1]] >= h; )
       u--;
-    for (; N > c && t[a[N - 1]] < w; )
+    for (; N > c && t[a[N - 1]] <= w; )
       N--;
-    m === m && (i[u++] = h), w === w && (a[N++] = h);
+    h === h && (i[u++] = m), w === w && (a[N++] = m);
   }
-  for (let h = r - 1; h < o; h++) {
-    const m = n[h], w = t[h];
-    for (; u > s && i[s] <= h - r; )
+  for (let m = r - 1; m < o; m++) {
+    const h = n[m], w = t[m];
+    for (; u > s && i[s] <= m - r; )
       s++;
-    for (; u > s && n[i[u - 1]] > m; )
+    for (; u > s && n[i[u - 1]] > h; )
       u--;
-    for (; N > c && a[c] <= h - r; )
+    for (; N > c && a[c] <= m - r; )
       c++;
     for (; N > c && t[a[N - 1]] < w; )
       N--;
-    m === m && (i[u++] = h), w === w && (a[N++] = h);
+    h === h && (i[u++] = m), w === w && (a[N++] = m);
     const v = u > s ? n[i[s]] : NaN, d = N > c ? t[a[c]] : NaN;
-    l[h] = v, f[h] = d, e && e(v, d, h);
+    l[m] = v, f[m] = d, e && e(v, d, m);
   }
   return { min: l, max: f };
 }
@@ -647,7 +647,7 @@ function _n(n) {
   }
   return t;
 }
-function Vn(n) {
+function Sn(n) {
   const t = n.length, r = new Float64Array(t);
   let e = -1 / 0;
   for (let o = 0; o < t; o++) {
@@ -656,7 +656,7 @@ function Vn(n) {
   }
   return r;
 }
-function Sn(n) {
+function Vn(n) {
   const t = n.length, r = new Float64Array(t);
   let e = 1 / 0;
   for (let o = 0; o < t; o++) {
@@ -665,7 +665,7 @@ function Sn(n) {
   }
   return r;
 }
-function Mt(n, t) {
+function Ft(n, t) {
   const r = n.length, e = new Float64Array(r);
   if (t <= 0)
     throw new Error("period must be positive");
@@ -676,10 +676,10 @@ function Mt(n, t) {
   let l = 0, f = 0;
   for (let i = 0; i < r; i++) {
     const a = n[i];
-    for (; f > l && o[l] <= i - t; )
+    for (; f > l && o[l] < i - t; )
       l++;
     if (a === a) {
-      for (; f > l && n[o[f - 1]] > a; )
+      for (; f > l && n[o[f - 1]] >= a; )
         f--;
       o[f++] = i;
     }
@@ -687,7 +687,7 @@ function Mt(n, t) {
   }
   return e;
 }
-function Ft(n, t) {
+function Mt(n, t) {
   const r = n.length, e = new Float64Array(r);
   if (t <= 0)
     throw new Error("period must be positive");
@@ -698,10 +698,10 @@ function Ft(n, t) {
   let l = 0, f = 0;
   for (let i = 0; i < r; i++) {
     const a = n[i];
-    for (; f > l && o[l] <= i - t; )
+    for (; f > l && o[l] < i - t; )
       l++;
     if (a === a) {
-      for (; f > l && n[o[f - 1]] < a; )
+      for (; f > l && n[o[f - 1]] <= a; )
         f--;
       o[f++] = i;
     }
@@ -781,8 +781,8 @@ function On(n, t) {
   const r = Math.min(n.length, t.length);
   let e = 0, o = 0, l = 0, f = 0, i = 0;
   for (let c = 0; c < r; c++) {
-    const N = n[c], h = t[c];
-    N === N && h === h && (e += N, o += h, l += N * N, f += N * h, i++);
+    const N = n[c], m = t[c];
+    N === N && m === m && (e += N, o += m, l += N * N, f += N * m, i++);
   }
   if (i === 0)
     return { intercept: NaN, slope: NaN };
@@ -815,8 +815,8 @@ function Cn(n) {
     for (let c = 0; c < t; c++)
       if (c !== o) {
         const N = r[c][o];
-        for (let h = 0; h < t; h++)
-          r[c][h] -= N * r[o][h], e[c][h] -= N * e[o][h];
+        for (let m = 0; m < t; m++)
+          r[c][m] -= N * r[o][m], e[c][m] -= N * e[o][m];
       }
   }
   return e;
@@ -830,13 +830,13 @@ function Tn(n, t) {
   }), f = new Array(o).fill(0);
   for (let s = 0; s < r; s++) {
     const u = n[s], c = t[s], N = [1];
-    for (let h = 0; h < e; h++)
-      N.push(u[h]);
-    for (let h = 0; h < o; h++)
-      for (let m = 0; m < o; m++)
-        l[h][m] += N[h] * N[m];
-    for (let h = 0; h < o; h++)
-      f[h] += N[h] * c;
+    for (let m = 0; m < e; m++)
+      N.push(u[m]);
+    for (let m = 0; m < o; m++)
+      for (let h = 0; h < o; h++)
+        l[m][h] += N[m] * N[h];
+    for (let m = 0; m < o; m++)
+      f[m] += N[m] * c;
   }
   const i = Cn(l);
   if (!i)
@@ -857,10 +857,10 @@ const Oo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   avg: gt,
   ceil: Gt,
   clamp: zt,
-  cummax: Vn,
-  cummin: Sn,
+  cummax: Sn,
+  cummin: Vn,
   cumprod: an,
-  cumsum: Mn,
+  cumsum: Fn,
   diff: $t,
   div: Xt,
   dot: Pn,
@@ -882,10 +882,10 @@ const Oo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   prod: fn,
   randnormal: jn,
   randuniform: Ln,
-  rollargmax: Ft,
-  rollargmin: Mt,
+  rollargmax: Mt,
+  rollargmin: Ft,
   rollmax: xn,
-  rollmin: Fn,
+  rollmin: Mn,
   rollminmax: Nt,
   rollprod: sn,
   rollsum: nt,
@@ -917,11 +917,11 @@ function qn(n, t, r, e) {
   }
   return e;
 }
-function P(n, t, r = !0) {
+function O(n, t, r = !0) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const e = n.length, o = new Float64Array(e);
-  return e < t ? o.fill(NaN) : (r && !V() && !k(n) && (r = !1), r ? qn(n, t, e, o) : Un(n, t, e, o));
+  return e < t ? o.fill(NaN) : (r && !S() && !k(n) && (r = !1), r ? qn(n, t, e, o) : Un(n, t, e, o));
 }
 function xt(n, t) {
   if (t <= 0)
@@ -963,7 +963,7 @@ function p(n, t, r = !0) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const e = n.length, o = new Float64Array(e);
-  return e < t ? o.fill(NaN) : (r && !V() && !k(n) && (r = !1), r ? Xn(n, t, o) : Bn(n, t, o));
+  return e < t ? o.fill(NaN) : (r && !S() && !k(n) && (r = !1), r ? Xn(n, t, o) : Bn(n, t, o));
 }
 function Bn(n, t, r) {
   const e = n.length, o = t * (t + 1) / 2;
@@ -986,18 +986,18 @@ function Xn(n, t, r) {
   let f = 0, i = 0, a = 0, s = 0;
   const u = Math.min(e, o);
   for (let N = 0; N < u; N++) {
-    const h = n[N];
-    if (l[N] = h, h === h) {
-      const m = N + 1;
-      f += h, i += h * m, a += m, s++;
+    const m = n[N];
+    if (l[N] = m, m === m) {
+      const h = N + 1;
+      f += m, i += m * h, a += h, s++;
     }
     r[N] = NaN;
   }
   s > 0 ? r[o - 1] = i / a : r[o - 1] = NaN;
   let c = 0;
   for (let N = o; N < e; N++) {
-    const h = n[N], m = l[c], w = m === m, v = h === h, d = f;
-    w && (f -= m), v && (f += h), i = i - d + (v ? h * o : 0), a = a - s + (v ? o : 0), w && s--, v && s++, l[c] = h, c = (c + 1) % o, a > 0 ? r[N] = i / a : r[N] = NaN;
+    const m = n[N], h = l[c], w = h === h, v = m === m, d = f;
+    w && (f -= h), v && (f += m), i = i - d + (v ? m * o : 0), a = a - s + (v ? o : 0), w && s--, v && s++, l[c] = m, c = (c + 1) % o, a > 0 ? r[N] = i / a : r[N] = NaN;
   }
   return r;
 }
@@ -1012,7 +1012,7 @@ function Rn(n, t, r, e = !0) {
     return l.fill(NaN);
   for (let f = 0; f < r; f++)
     l[f] = NaN;
-  return e && !V() && !k(n, t) && (e = !1), e ? zn(n, t, r, l) : Kn(n, t, r, l);
+  return e && !S() && !k(n, t) && (e = !1), e ? zn(n, t, r, l) : Kn(n, t, r, l);
 }
 function zn(n, t, r, e) {
   const o = n.length, l = r;
@@ -1023,20 +1023,20 @@ function zn(n, t, r, e) {
     f[c] = NaN, i[c] = NaN;
   let a = 0, s = 0;
   for (let c = 0; c < l; c++) {
-    const N = n[c], h = t[c];
-    if (N === N && h === h) {
-      const m = N * h;
-      f[c] = m, i[c] = h, a += m, s += h;
+    const N = n[c], m = t[c];
+    if (N === N && m === m) {
+      const h = N * m;
+      f[c] = h, i[c] = m, a += h, s += m;
     } else
       f[c] = NaN, i[c] = NaN;
   }
   e[l - 1] = s !== 0 ? a / s : NaN;
   let u = 0;
   for (let c = l; c < o; c++) {
-    const N = n[c], h = t[c], m = f[u], w = i[u];
-    if (w === w && (a -= m, s -= w), N === N && h === h) {
-      const v = N * h;
-      f[u] = v, i[u] = h, a += v, s += h;
+    const N = n[c], m = t[c], h = f[u], w = i[u];
+    if (w === w && (a -= h, s -= w), N === N && m === m) {
+      const v = N * m;
+      f[u] = v, i[u] = m, a += v, s += m;
     } else
       f[u] = NaN, i[u] = NaN;
     u++, u === l && (u = 0), e[c] = s !== 0 ? a / s : NaN;
@@ -1101,8 +1101,31 @@ function Hn(n, t) {
   const r = n.length;
   if (r < t)
     return new Float64Array(r).fill(NaN);
-  const e = Math.floor((t + 1) / 2);
-  return P(P(n, e, !1), t + 1 - e, !1);
+  const e = new Float64Array(r);
+  e.fill(NaN);
+  const o = Math.floor((t + 1) / 2), l = new Float64Array(t);
+  for (let s = 0; s < t; s++)
+    l[s] = s < o ? s + 1 : t - s;
+  let f = 0;
+  for (let s = 0; s < t; s++)
+    f += l[s];
+  let i = 0, a = 0;
+  for (let s = 0; s < t; s++) {
+    const u = n[s];
+    Number.isFinite(u) && (i += l[s] * u, a += l[s]), e[s] = NaN;
+  }
+  e[t - 1] = a > 0 ? i / a : NaN;
+  for (let s = t; s < r; s++) {
+    const u = s - t, c = n[u];
+    Number.isFinite(c) && (i -= l[0] * c, a -= l[0]), i = 0, a = 0;
+    const N = s - t + 1;
+    for (let m = 0; m < t; m++) {
+      const h = n[N + m];
+      Number.isFinite(h) && (i += l[m] * h, a += l[m]);
+    }
+    e[s] = a > 0 ? i / a : NaN;
+  }
+  return e;
 }
 function Wn(n, t) {
   if (t <= 0)
@@ -1118,34 +1141,34 @@ function Wn(n, t) {
     return e.fill(NaN);
   let f = n[l], i = 1;
   for (l++; l < r && i < t; ) {
-    const h = n[l];
-    l++, h === h && (f = f + o * (h - f), i++);
+    const m = n[l];
+    l++, m === m && (f = f + o * (m - f), i++);
   }
   if (i < t)
     return e.fill(NaN);
   let a = f, s = 1;
   for (; l < r && s < t; ) {
-    const h = n[l];
-    l++, h === h && (f = f + o * (h - f), i++, a = a + o * (f - a), s++);
+    const m = n[l];
+    l++, m === m && (f = f + o * (m - f), i++, a = a + o * (f - a), s++);
   }
   if (s < t)
     return e.fill(NaN);
   let u = a, c = 1;
   for (; l < r && c < t; ) {
-    const h = n[l];
-    l++, h === h && (f = f + o * (h - f), a = a + o * (f - a), u = u + o * (a - u), c++);
+    const m = n[l];
+    l++, m === m && (f = f + o * (m - f), a = a + o * (f - a), u = u + o * (a - u), c++);
   }
   if (c < t)
     return e.fill(NaN);
   const N = l - 1;
   e[N] = 3 * f - 3 * a + u, N > 0 && e.fill(NaN, 0, N);
-  for (let h = l; h < r; h++) {
-    const m = n[h];
-    if (m !== m) {
-      e[h] = NaN;
+  for (let m = l; m < r; m++) {
+    const h = n[m];
+    if (h !== h) {
+      e[m] = NaN;
       continue;
     }
-    f = f + o * (m - f), a = a + o * (f - a), u = u + o * (a - u), e[h] = 3 * f - 3 * a + u;
+    f = f + o * (h - f), a = a + o * (f - a), u = u + o * (a - u), e[m] = 3 * f - 3 * a + u;
   }
   return e;
 }
@@ -1154,18 +1177,30 @@ function Gn(n, t) {
   if (r < t)
     return e.fill(NaN);
   const o = Math.floor(t / 2), l = Math.floor(Math.sqrt(t)), f = new Float64Array(r);
-  for (let s = 0; s < t - 1; s++)
-    f[s] = NaN;
-  const i = p(n, o), a = p(n, t);
-  for (let s = t - 1; s < r; s++)
-    f[s] = 2 * i[s] - a[s];
-  return p(f, l, !1);
+  for (let h = 0; h < t - 1; h++)
+    f[h] = NaN;
+  const i = k(n), a = p(n, o, i), s = p(n, t, i);
+  for (let h = t - 1; h < r; h++)
+    f[h] = 2 * a[h] - s[h];
+  let u = -1;
+  for (let h = 0; h < r; h++)
+    if (Number.isFinite(f[h])) {
+      u = h;
+      break;
+    }
+  if (u === -1)
+    return f;
+  const c = f.slice(u), N = p(c, l, i), m = new Float64Array(r);
+  m.fill(NaN);
+  for (let h = 0; h < N.length; h++)
+    m[u + h] = N[h];
+  return m;
 }
 function $n(n, t, r = 2, e = 30, o = !0) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const l = n.length, f = new Float64Array(l);
-  return l < t ? (f.fill(NaN), f) : (o && !V() && !k(n) && (o = !1), o ? Jn(n, t, r, e) : ft(n, t, r, e));
+  return l < t ? (f.fill(NaN), f) : (o && !S() && !k(n) && (o = !1), o ? Jn(n, t, r, e) : ft(n, t, r, e));
 }
 function ft(n, t, r, e) {
   const o = n.length, l = new Float64Array(o);
@@ -1178,7 +1213,7 @@ function ft(n, t, r, e) {
   let u = n[t - 1];
   l[t - 1] = u;
   for (let c = t; c < o; c++) {
-    const N = a(n[c] - n[c - t]), m = (s !== 0 ? N / s : 0) * (f - i) + i, w = m * m;
+    const N = a(n[c] - n[c - t]), h = (s !== 0 ? N / s : 0) * (f - i) + i, w = h * h;
     if (u = u + w * (n[c] - u), l[c] = u, c + 1 < o) {
       const v = a(n[c + 1] - n[c]), d = a(n[c - t + 1] - n[c - t]);
       s += v - d;
@@ -1249,7 +1284,7 @@ function at(n, t, r = !0) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const e = n.length, o = new Float64Array(e);
-  return e < t ? (o.fill(NaN), o) : (r && !V() && !k(n) && (r = !1), r ? Zn(n, t, e, o) : Qn(n, t, e, o));
+  return e < t ? (o.fill(NaN), o) : (r && !S() && !k(n) && (r = !1), r ? Zn(n, t, e, o) : Qn(n, t, e, o));
 }
 function pn(n, t, r) {
   if (t <= 0)
@@ -1282,36 +1317,36 @@ function pn(n, t, r) {
   }
   if (u < t)
     return o;
-  let h = s / t;
-  for (s = h, u = 1; a < e && u < t; ) {
+  let m = s / t;
+  for (s = m, u = 1; a < e && u < t; ) {
     const y = n[a++];
-    y === y && (c = f * y + i * c, N = f * c + i * N, h = f * N + i * h, s += h, u++);
+    y === y && (c = f * y + i * c, N = f * c + i * N, m = f * N + i * m, s += m, u++);
   }
   if (u < t)
     return o;
-  let m = s / t;
-  for (s = m, u = 1; a < e && u < t; ) {
+  let h = s / t;
+  for (s = h, u = 1; a < e && u < t; ) {
     const y = n[a++];
-    y === y && (c = f * y + i * c, N = f * c + i * N, h = f * N + i * h, m = f * h + i * m, s += m, u++);
+    y === y && (c = f * y + i * c, N = f * c + i * N, m = f * N + i * m, h = f * m + i * h, s += h, u++);
   }
   if (u < t)
     return o;
   let w = s / t;
   for (s = w, u = 1; a < e && u < t; ) {
     const y = n[a++];
-    y === y && (c = f * y + i * c, N = f * c + i * N, h = f * N + i * h, m = f * h + i * m, w = f * m + i * w, s += w, u++);
+    y === y && (c = f * y + i * c, N = f * c + i * N, m = f * N + i * m, h = f * m + i * h, w = f * h + i * w, s += w, u++);
   }
   if (u < t)
     return o;
   let v = s / t;
   const d = l;
   a = d + 1;
-  const A = r * r, b = -(A * r), g = 3 * (A - b), F = -6 * A - 3 * (r - b), x = 1 + 3 * r - b + 3 * A;
+  const A = r * r, b = -(A * r), g = 3 * (A - b), M = -6 * A - 3 * (r - b), x = 1 + 3 * r - b + 3 * A;
   let I = d;
-  o[I++] = b * v + g * w + F * m + x * h;
+  o[I++] = b * v + g * w + M * h + x * m;
   for (let y = a; y < e; y++) {
-    const M = n[y];
-    c = f * M + i * c, N = f * c + i * N, h = f * N + i * h, m = f * h + i * m, w = f * m + i * w, v = f * w + i * v, o[I++] = b * v + g * w + F * m + x * h;
+    const F = n[y];
+    c = f * F + i * c, N = f * c + i * N, m = f * N + i * m, h = f * m + i * h, w = f * h + i * w, v = f * w + i * v, o[I++] = b * v + g * w + M * h + x * m;
   }
   return o;
 }
@@ -1322,16 +1357,16 @@ function Et(n, t = { ddof: 1, skipna: !0 }) {
   const f = n.length;
   let i = 0, a = 0, s = 0;
   if (l) {
-    !V() && l && !k(n) && (l = !1);
+    !S() && l && !k(n) && (l = !1);
     for (let N = 0; N < f; N++) {
-      const h = n[N];
-      h === h && (i += h, a += h * h, s++);
+      const m = n[N];
+      m === m && (i += m, a += m * m, s++);
     }
   } else {
     s = f;
     for (let N = 0; N < f; N++) {
-      const h = n[N];
-      i += h, a += h * h;
+      const m = n[N];
+      i += m, a += m * m;
     }
   }
   if (s === 0)
@@ -1352,9 +1387,9 @@ function te(n, t, r = { ddof: 1 }) {
     throw new Error("x and y must have same length");
   const o = n.length, l = (e = r == null ? void 0 : r.ddof) !== null && e !== void 0 ? e : 1;
   let f = 0, i = 0, a = 0, s = 0;
-  for (let h = 0; h < o; h++) {
-    const m = n[h], w = t[h];
-    m === m && w === w && (f += m, i += w, a += m * w, s++);
+  for (let m = 0; m < o; m++) {
+    const h = n[m], w = t[m];
+    h === h && w === w && (f += h, i += w, a += h * w, s++);
   }
   if (s === 0)
     return NaN;
@@ -1398,7 +1433,7 @@ function wt(n, t, r) {
 function It(n, t, r = { skipna: !0, ddof: 1 }) {
   var e, o;
   let l = (e = r.skipna) !== null && e !== void 0 ? e : !0, f = (o = r.ddof) !== null && o !== void 0 ? o : 1;
-  return l ? !V() && !k(n) ? wt(n, t, f) : ne(n, t, f) : wt(n, t, f);
+  return l ? !S() && !k(n) ? wt(n, t, f) : ne(n, t, f) : wt(n, t, f);
 }
 function ne(n, t, r) {
   const e = n.length, o = new Float64Array(e);
@@ -1430,25 +1465,25 @@ function kt(n, t, r, e = { ddof: 1 }) {
     throw new Error("x and y must have same length");
   const f = n.length, i = new Float64Array(f);
   let a = 0, s = 0, u = 0, c = 0;
-  for (let h = 0; h < r; h++) {
-    const m = n[h], w = t[h];
-    m === m && w === w && (a += m, s += w, u += m * w, c++);
+  for (let m = 0; m < r; m++) {
+    const h = n[m], w = t[m];
+    h === h && w === w && (a += h, s += w, u += h * w, c++);
   }
   const N = l + 1;
   if (c >= N) {
-    const h = 1 / c, m = a * h, w = s * h, v = c - l;
-    i[r - 1] = v > 0 ? (u - c * m * w) / v : NaN;
+    const m = 1 / c, h = a * m, w = s * m, v = c - l;
+    i[r - 1] = v > 0 ? (u - c * h * w) / v : NaN;
   } else
     i[r - 1] = NaN;
-  for (let h = r; h < f; h++) {
-    const m = n[h], w = t[h], v = n[h - r], d = t[h - r];
-    m === m && w === w && (a += m, s += w, u += m * w, c++), v === v && d === d && (a -= v, s -= d, u -= v * d, c--);
+  for (let m = r; m < f; m++) {
+    const h = n[m], w = t[m], v = n[m - r], d = t[m - r];
+    h === h && w === w && (a += h, s += w, u += h * w, c++), v === v && d === d && (a -= v, s -= d, u -= v * d, c--);
     const A = l + 1;
     if (c >= A) {
-      const b = 1 / c, g = a * b, F = s * b, x = c - l;
-      i[h] = x > 0 ? (u - c * g * F) / x : NaN;
+      const b = 1 / c, g = a * b, M = s * b, x = c - l;
+      i[m] = x > 0 ? (u - c * g * M) / x : NaN;
     } else
-      i[h] = NaN;
+      i[m] = NaN;
   }
   return i;
 }
@@ -1464,7 +1499,7 @@ function T(n, t = { skipna: !0 }) {
   let o = (r = t == null ? void 0 : t.skipna) !== null && r !== void 0 ? r : !0;
   if (e && e.length !== n.length)
     throw new Error("source and weights must have same length");
-  if (!V() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
+  if (!S() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
     if (!o) {
       const s = it(n, !1);
       return s !== s ? NaN : s / n.length;
@@ -1498,7 +1533,7 @@ function ht(n, t, r = !0) {
     throw new Error("period must be positive");
   if (e < t)
     return o;
-  if (!V() && r && !k(n)) {
+  if (!S() && r && !k(n)) {
     let i = 0;
     for (let a = 0; a < t; a++)
       i += n[a];
@@ -1525,7 +1560,7 @@ function ee(n, t = { skipna: !0 }) {
   let o = (r = t == null ? void 0 : t.skipna) !== null && r !== void 0 ? r : !0;
   if (e && e.length !== n.length)
     throw new Error("source and weights must have same length");
-  if (!V() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
+  if (!S() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
     if (!o) {
       let s = 0;
       for (let u = 0; u < n.length; u++) {
@@ -1574,7 +1609,7 @@ function oe(n, t = { skipna: !0 }) {
   let o = (r = t == null ? void 0 : t.skipna) !== null && r !== void 0 ? r : !0;
   if (e && e.length !== n.length)
     throw new Error("source and weights must have same length");
-  if (!V() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
+  if (!S() && o && (e ? k(n, e) || (o = !1) : k(n) || (o = !1)), !e) {
     if (!o) {
       let s = 0;
       for (let u = 0; u < n.length; u++) {
@@ -1623,7 +1658,7 @@ function le(n, t = !0) {
   const r = T(n, { skipna: t });
   if (r !== r)
     return NaN;
-  if (!V() && t && !k(n)) {
+  if (!S() && t && !k(n)) {
     let l = 0;
     for (let f = 0; f < n.length; f++)
       l += Math.abs(n[f] - r);
@@ -1733,44 +1768,44 @@ function _t(n, t, r) {
   if (r < 0 || r > 1)
     throw new Error("q must be in [0,1]");
   const f = new Int32Array(t), i = new Int32Array(t), a = new Uint8Array(e), s = new Uint8Array(e);
-  let u = 0, c = 0, N = 0, h = 0;
-  const m = n;
+  let u = 0, c = 0, N = 0, m = 0;
+  const h = n;
   for (let w = 0; w < e; w++) {
-    const v = w, d = m[v];
+    const v = w, d = h[v];
     if (d === d) {
       const b = u === 0 ? void 0 : f[0];
-      b === void 0 || d <= m[b] ? (f[u] = v, Q(f, u, !1, m), u++, N++, s[v] = 1) : (i[c] = v, Q(i, c, !0, m), c++, h++, s[v] = 2);
+      b === void 0 || d <= h[b] ? (f[u] = v, Q(f, u, !1, h), u++, N++, s[v] = 1) : (i[c] = v, Q(i, c, !0, h), c++, m++, s[v] = 2);
     }
     if (w >= t) {
       const b = w - t;
-      s[b] === 1 ? (N--, a[b] = 1, s[b] = 0) : s[b] === 2 && (h--, a[b] = 1, s[b] = 0);
+      s[b] === 1 ? (N--, a[b] = 1, s[b] = 0) : s[b] === 2 && (m--, a[b] = 1, s[b] = 0);
     }
-    const A = N + h;
+    const A = N + m;
     if (A !== 0) {
       const g = Math.floor((A - 1) * r) + 1;
-      for (u = q(f, u, !1, a, s, m), c = q(i, c, !0, a, s, m); N > g; ) {
-        u = q(f, u, !1, a, s, m);
-        const F = ct(f, u, !1, m, s), x = F.top;
-        u = F.len, N--, i[c] = x, Q(i, c, !0, m), c++, h++;
+      for (u = q(f, u, !1, a, s, h), c = q(i, c, !0, a, s, h); N > g; ) {
+        u = q(f, u, !1, a, s, h);
+        const M = ct(f, u, !1, h, s), x = M.top;
+        u = M.len, N--, i[c] = x, Q(i, c, !0, h), c++, m++;
       }
       for (; N < g; ) {
-        c = q(i, c, !0, a, s, m);
-        const F = ct(i, c, !0, m, s), x = F.top;
-        c = F.len, h--, f[u] = x, Q(f, u, !1, m), u++, N++;
+        c = q(i, c, !0, a, s, h);
+        const M = ct(i, c, !0, h, s), x = M.top;
+        c = M.len, m--, f[u] = x, Q(f, u, !1, h), u++, N++;
       }
-      u = q(f, u, !1, a, s, m), c = q(i, c, !0, a, s, m);
+      u = q(f, u, !1, a, s, h), c = q(i, c, !0, a, s, h);
     }
     if (w >= t - 1) {
-      u = q(f, u, !1, a, s, m), c = q(i, c, !0, a, s, m);
-      const b = N + h;
+      u = q(f, u, !1, a, s, h), c = q(i, c, !0, a, s, h);
+      const b = N + m;
       if (b === 0)
         o[w] = NaN;
       else if ((b & 1) === 1) {
         const g = f[0];
-        o[w] = m[g];
+        o[w] = h[g];
       } else {
-        const g = f[0], F = i[0];
-        o[w] = (m[g] + m[F]) / 2;
+        const g = f[0], M = i[0];
+        o[w] = (h[g] + h[M]) / 2;
       }
     }
   }
@@ -1779,7 +1814,7 @@ function _t(n, t, r) {
 function ae(n, t) {
   return n.length, _t(n, t, 0.5);
 }
-function Vt(n, t, r) {
+function St(n, t, r) {
   const e = (t - 1) * r, o = Math.floor(e), l = Math.ceil(e);
   if (o === l)
     return st(n, o, 0, t - 1);
@@ -1804,7 +1839,7 @@ function C(n, t) {
     const f = n[l];
     f === f && (e[o++] = f);
   }
-  return o === 0 ? NaN : Vt(e, o, t);
+  return o === 0 ? NaN : St(e, o, t);
 }
 function se(n, t) {
   if (t.length === 0)
@@ -1827,7 +1862,7 @@ function se(n, t) {
         l[a] = NaN;
         continue;
       }
-      l[a] = Vt(e, o, s);
+      l[a] = St(e, o, s);
     }
     return l;
   }
@@ -1844,8 +1879,8 @@ function se(n, t) {
     if (c === N)
       l[a] = f[c];
     else {
-      const h = u - c;
-      l[a] = f[c] * (1 - h) + f[N] * h;
+      const m = u - c;
+      l[a] = f[c] * (1 - m) + f[N] * m;
     }
   }
   return l;
@@ -1857,7 +1892,7 @@ function ue(n, t = !0) {
   const r = n.length, e = new Float64Array(r);
   if (r === 0)
     return e;
-  !V() && t && (k(n) || (t = !1));
+  !S() && t && (k(n) || (t = !1));
   const o = T(n, { skipna: t }), l = W(n, { ddof: 1, skipna: t });
   if (l === 0 || l !== l)
     return e.fill(NaN), e;
@@ -1903,7 +1938,7 @@ function he(n, t, r = !0) {
   const e = n.length;
   if (e === 0)
     return NaN;
-  if (!V() && r && (k(n, t) || (r = !1)), r) {
+  if (!S() && r && (k(n, t) || (r = !1)), r) {
     let o = 0, l = 0, f = 0, i = 0, a = 0, s = 0;
     for (let d = 0; d < e; d++) {
       const A = n[d], b = t[d];
@@ -1917,8 +1952,8 @@ function he(n, t, r = !0) {
     const c = s - u;
     if (c <= 0)
       return NaN;
-    const N = o / s, h = l / s, m = (f - s * N * h) / c, w = (i - s * N * N) / c, v = (a - s * h * h) / c;
-    return w === 0 || v === 0 ? NaN : m / Math.sqrt(w * v);
+    const N = o / s, m = l / s, h = (f - s * N * m) / c, w = (i - s * N * N) / c, v = (a - s * m * m) / c;
+    return w === 0 || v === 0 ? NaN : h / Math.sqrt(w * v);
   } else {
     let o = 0, l = 0;
     for (let c = 0; c < e; c++)
@@ -1926,8 +1961,8 @@ function he(n, t, r = !0) {
     const f = o / e, i = l / e;
     let a = 0, s = 0, u = 0;
     for (let c = 0; c < e; c++) {
-      const N = n[c] - f, h = t[c] - i;
-      a += N * h, s += N * N, u += h * h;
+      const N = n[c] - f, m = t[c] - i;
+      a += N * m, s += N * N, u += m * m;
     }
     return s === 0 || u === 0 ? NaN : a / Math.sqrt(s * u);
   }
@@ -1943,12 +1978,12 @@ function me(n, t, r, e) {
     for (let w = 0; w < i; w++)
       s[w] = w < n.length ? n[w] : NaN, u[w] = w < t.length ? t[w] : NaN;
   }
-  const c = kt(s, u, r), N = X(s, r, { skipna: a }), h = X(u, r, { skipna: a }), m = new Float64Array(i);
+  const c = kt(s, u, r), N = X(s, r, { skipna: a }), m = X(u, r, { skipna: a }), h = new Float64Array(i);
   for (let w = 0; w < i; w++) {
-    const v = N[w] * h[w];
-    v > 1e-12 ? m[w] = c[w] / v : m[w] = NaN;
+    const v = N[w] * m[w];
+    v > 1e-12 ? h[w] = c[w] / v : h[w] = NaN;
   }
-  return m;
+  return h;
 }
 function we(n, t) {
   var r, e, o;
@@ -1958,19 +1993,19 @@ function we(n, t) {
     return s;
   if (l < 0 || f < 0 || l > 1 || f > 1 || l > f)
     throw new Error("invalid quantile bounds");
-  !V() && i && (k(n) || (i = !1));
+  !S() && i && (k(n) || (i = !1));
   const u = C(n, l), c = C(n, f);
   if (u !== u || c !== c)
     return s.fill(NaN), s;
   if (i)
     for (let N = 0; N < a; N++) {
-      const h = n[N];
-      h !== h ? s[N] = NaN : h < u ? s[N] = u : h > c ? s[N] = c : s[N] = h;
+      const m = n[N];
+      m !== m ? s[N] = NaN : m < u ? s[N] = u : m > c ? s[N] = c : s[N] = m;
     }
   else
     for (let N = 0; N < a; N++) {
-      const h = n[N];
-      h < u ? s[N] = u : h > c ? s[N] = c : s[N] = h;
+      const m = n[N];
+      m < u ? s[N] = u : m > c ? s[N] = c : s[N] = m;
     }
   return s;
 }
@@ -2032,8 +2067,8 @@ function de(n, t) {
     if (u === u && (i++, o += u, l += u * u, f += u * u * u), i >= 3) {
       const c = o / i, N = l / i - c * c;
       if (N > 1e-12) {
-        const h = Math.sqrt(N);
-        e[a] = (f / i - 3 * c * N - c * c * c) / (h * h * h);
+        const m = Math.sqrt(N);
+        e[a] = (f / i - 3 * c * N - c * c * c) / (m * m * m);
       } else
         e[a] = 0;
     }
@@ -2056,8 +2091,8 @@ function Ae(n, t) {
   if (a >= 4) {
     const s = o / a, u = l / a - s * s;
     if (u > 1e-12) {
-      const c = l / a, N = f / a, h = i / a;
-      e[t - 1] = (h - 4 * s * N + 6 * s * s * c - 3 * s * s * s * s) / (u * u) - 3;
+      const c = l / a, N = f / a, m = i / a;
+      e[t - 1] = (m - 4 * s * N + 6 * s * s * c - 3 * s * s * s * s) / (u * u) - 3;
     } else
       e[t - 1] = 0;
   }
@@ -2075,10 +2110,10 @@ function Ae(n, t) {
       l += N, f += N * c, i += N * N;
     }
     if (a >= 4) {
-      const N = o / a, h = l / a - N * N;
-      if (h > 1e-12) {
-        const m = l / a, w = f / a, v = i / a;
-        e[s] = (v - 4 * N * w + 6 * N * N * m - 3 * N * N * N * N) / (h * h) - 3;
+      const N = o / a, m = l / a - N * N;
+      if (m > 1e-12) {
+        const h = l / a, w = f / a, v = i / a;
+        e[s] = (v - 4 * N * w + 6 * N * N * h - 3 * N * N * N * N) / (m * m) - 3;
       } else
         e[s] = 0;
     }
@@ -2105,7 +2140,7 @@ function be(n, t) {
   }
   return e;
 }
-function Me(n, t) {
+function Fe(n, t) {
   const r = [];
   for (let e = 0; e < t; e++) {
     const o = Math.floor(Math.random() * n.length);
@@ -2115,7 +2150,7 @@ function Me(n, t) {
 }
 const Co = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  bootstrap: Me,
+  bootstrap: Fe,
   corr: he,
   covar: te,
   gmean: oe,
@@ -2144,7 +2179,7 @@ const Co = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   winsorize: we,
   zscore: ue
 }, Symbol.toStringTag, { value: "Module" }));
-function Fe(n) {
+function Me(n) {
   const t = n.length;
   if (t === 0)
     return new Float32Array(0);
@@ -2196,22 +2231,22 @@ function ke(n, t, r = 0) {
   if (e === 0)
     return { days: [], dailyReturns: new Float32Array(0) };
   const o = 1440 * 60 * 1e3, l = r * 60 * 1e3, f = /* @__PURE__ */ new Map();
-  for (let h = 0; h < e; h++) {
-    const m = Number(n[h]), w = Number(t[h]);
-    if (!Number.isFinite(m) || w !== w)
+  for (let m = 0; m < e; m++) {
+    const h = Number(n[m]), w = Number(t[m]);
+    if (!Number.isFinite(h) || w !== w)
       continue;
-    const v = Math.floor((m + l) / o), d = f.get(v);
+    const v = Math.floor((h + l) / o), d = f.get(v);
     d ? (d.prod *= 1 + w, d.count += 1) : f.set(v, { prod: 1 + w, count: 1 });
   }
-  const i = Array.from(f.keys()).sort((h, m) => h - m);
+  const i = Array.from(f.keys()).sort((m, h) => m - h);
   if (i.length === 0)
     return { days: [], dailyReturns: new Float32Array(0) };
   const a = i[0], u = i[i.length - 1] - a + 1, c = new Array(u), N = new Float32Array(u);
-  for (let h = 0; h < u; h++) {
-    const m = a + h;
-    c[h] = m * o - l;
-    const w = f.get(m);
-    w ? N[h] = w.prod - 1 : N[h] = 0;
+  for (let m = 0; m < u; m++) {
+    const h = a + m;
+    c[m] = h * o - l;
+    const w = f.get(h);
+    w ? N[m] = w.prod - 1 : N[m] = 0;
   }
   return { days: c, dailyReturns: N };
 }
@@ -2219,7 +2254,7 @@ function _e(n) {
   const t = n.length, r = new Float64Array(t);
   if (t === 0)
     return r;
-  const e = D(n);
+  const e = P(n);
   let o = -1;
   for (let f = 0; f < t; f++)
     if (e[f] === 1) {
@@ -2246,7 +2281,7 @@ function mt(n) {
   const t = n.length;
   if (t === 0)
     return NaN;
-  const r = D(n);
+  const r = P(n);
   let e = -1;
   for (let i = 0; i < t; i++)
     if (r[i] === 1) {
@@ -2269,53 +2304,53 @@ function mt(n) {
   }
   return f ? -l : 0;
 }
-function Ve(n) {
+function Se(n) {
   const t = n.length;
   if (t === 0)
     return { maxDrawdown: NaN, peakIndex: -1, troughIndex: -1, startIndex: -1, endIndex: -1 };
-  const r = D(n);
+  const r = P(n);
   let e = -1;
-  for (let m = 0; m < t; m++)
-    if (r[m] === 1) {
-      e = m;
+  for (let h = 0; h < t; h++)
+    if (r[h] === 1) {
+      e = h;
       break;
     }
   if (e === -1)
     return { maxDrawdown: NaN, peakIndex: -1, troughIndex: -1, startIndex: -1, endIndex: -1 };
   let o = n[e], l = e, f = 0, i = e;
-  for (let m = e + 1; m < t; m++) {
-    if (r[m] !== 1)
+  for (let h = e + 1; h < t; h++) {
+    if (r[h] !== 1)
       continue;
-    const w = n[m];
+    const w = n[h];
     if (w > o)
-      o = w, l = m;
+      o = w, l = h;
     else {
       const v = w / o - 1;
-      v < f && (f = v, i = m);
+      v < f && (f = v, i = h);
     }
   }
   if (f === 0)
     return { maxDrawdown: 0, peakIndex: l, troughIndex: l, startIndex: l, endIndex: l };
   const a = -f;
   let s = n[e], u = e;
-  for (let m = e + 1; m <= i; m++) {
-    if (r[m] !== 1)
+  for (let h = e + 1; h <= i; h++) {
+    if (r[h] !== 1)
       continue;
-    const w = n[m];
-    w > s && (s = w, u = m);
+    const w = n[h];
+    w > s && (s = w, u = h);
   }
   const c = u;
   let N = -1;
-  const h = n[c];
-  for (let m = i + 1; m < t; m++)
-    if (r[m] === 1 && n[m] > h) {
-      N = m;
+  const m = n[c];
+  for (let h = i + 1; h < t; h++)
+    if (r[h] === 1 && n[h] > m) {
+      N = h;
       break;
     }
   if (N === -1) {
-    for (let m = t - 1; m >= 0; m--)
-      if (r[m] === 1) {
-        N = m;
+    for (let h = t - 1; h >= 0; h--)
+      if (r[h] === 1) {
+        N = h;
         break;
       }
   }
@@ -2327,13 +2362,13 @@ function Ve(n) {
     endIndex: N
   };
 }
-function Se(n, t) {
+function Ve(n, t) {
   if (t <= 0)
     throw new Error("window must be positive");
   const r = n.length, e = new Float64Array(r);
   if (r === 0)
     return e;
-  const o = D(n);
+  const o = P(n);
   for (let l = 0; l < r; l++) {
     const f = Math.max(0, l - t + 1);
     let i = -1;
@@ -2354,8 +2389,8 @@ function Se(n, t) {
       if (N > a)
         a = N;
       else {
-        const h = N / a - 1;
-        (!u || h < s) && (s = h), u = !0;
+        const m = N / a - 1;
+        (!u || m < s) && (s = m), u = !0;
       }
     }
     e[l] = u ? -s : 0;
@@ -2363,7 +2398,7 @@ function Se(n, t) {
   return e;
 }
 function Le(n) {
-  const t = n.length, r = new Int32Array(t), e = D(n);
+  const t = n.length, r = new Int32Array(t), e = P(n);
   let o = -1;
   for (let a = 0; a < t; a++)
     if (e[a] === 1) {
@@ -2394,7 +2429,7 @@ function je(n, t = 252) {
   const r = n.length;
   if (r === 0)
     return NaN;
-  const e = D(n);
+  const e = P(n);
   let o = -1, l = -1;
   for (let N = 0; N < r; N++)
     if (e[N] === 1) {
@@ -2421,7 +2456,7 @@ function Pe(n, t = 3, r = 252) {
   const e = n.length;
   if (e === 0)
     return NaN;
-  const o = D(n);
+  const o = P(n);
   let l = -1, f = -1;
   for (let v = 0; v < e; v++)
     if (o[v] === 1) {
@@ -2454,18 +2489,18 @@ function Pe(n, t = 3, r = 252) {
   const c = (f - i) / r;
   if (c <= 0)
     return NaN;
-  const N = Math.pow(s / a, 1 / c) - 1, h = new Float64Array(f - i + 1);
-  let m = 0;
+  const N = Math.pow(s / a, 1 / c) - 1, m = new Float64Array(f - i + 1);
+  let h = 0;
   for (let v = i; v <= f; v++)
-    h[m++] = n[v];
-  const w = mt(h);
+    m[h++] = n[v];
+  const w = mt(m);
   return w !== w || w === 0 ? NaN : N / w;
 }
 function De(n) {
   const t = n.length;
   if (t === 0)
     return NaN;
-  const r = D(n);
+  const r = P(n);
   let e = -1;
   for (let i = 0; i < t; i++)
     if (r[i] === 1) {
@@ -2491,7 +2526,7 @@ function Oe(n, t, r = 1) {
   const e = n.length, o = new Float64Array(e);
   if (e === 0)
     return o;
-  const l = D(n);
+  const l = P(n);
   for (let f = 0; f < e; f++) {
     const i = Math.max(0, f - t + 1);
     let a = -1;
@@ -2508,10 +2543,10 @@ function Oe(n, t, r = 1) {
     for (let N = a; N <= f; N++) {
       if (l[N] !== 1)
         continue;
-      const h = n[N];
-      h > s && (s = h);
-      const m = (s - h) / s;
-      u += m * m, c++;
+      const m = n[N];
+      m > s && (s = m);
+      const h = (s - m) / s;
+      u += h * h, c++;
     }
     if (c < r || c === 0) {
       o[f] = NaN;
@@ -2551,23 +2586,23 @@ function Ue(n, t, r = 0, e = 252, o = 1) {
   const l = n.length, f = new Float64Array(l);
   if (l === 0)
     return f;
-  const i = r / e, a = H(n, i), s = D(a), u = ht(a, t), c = X(a, t, { skipna: !0, ddof: 0 }), N = nt(s, t);
-  for (let h = 0; h < l; h++) {
-    const m = N[h];
-    if (m !== m || m < o) {
-      f[h] = NaN;
+  const i = r / e, a = H(n, i), s = P(a), u = ht(a, t), c = X(a, t, { skipna: !0, ddof: 0 }), N = nt(s, t);
+  for (let m = 0; m < l; m++) {
+    const h = N[m];
+    if (h !== h || h < o) {
+      f[m] = NaN;
       continue;
     }
-    if (m <= 1) {
-      f[h] = NaN;
+    if (h <= 1) {
+      f[m] = NaN;
       continue;
     }
-    const w = c[h] * Math.sqrt(m / (m - 1)), v = u[h];
+    const w = c[m] * Math.sqrt(h / (h - 1)), v = u[m];
     if (w !== w || w === 0 || v !== v) {
-      f[h] = NaN;
+      f[m] = NaN;
       continue;
     }
-    f[h] = v * Math.sqrt(e) / w;
+    f[m] = v * Math.sqrt(e) / w;
   }
   return f;
 }
@@ -2576,23 +2611,23 @@ function qe(n, t, r = 0, e = 252, o = 1) {
   if (l === 0)
     return f;
   const i = r / e, a = H(n, i), s = new Float64Array(l);
-  for (let m = 0; m < l; m++) {
-    const w = a[m];
-    s[m] = w === w && w < 0 ? w : NaN;
+  for (let h = 0; h < l; h++) {
+    const w = a[h];
+    s[h] = w === w && w < 0 ? w : NaN;
   }
-  const u = D(s), c = ht(a, t), N = X(s, t, { skipna: !0, ddof: 0 }), h = nt(u, t);
-  for (let m = 0; m < l; m++) {
-    const w = h[m], v = c[m];
+  const u = P(s), c = ht(a, t), N = X(s, t, { skipna: !0, ddof: 0 }), m = nt(u, t);
+  for (let h = 0; h < l; h++) {
+    const w = m[h], v = c[h];
     if (w !== w || v !== v || w < 2) {
-      f[m] = NaN;
+      f[h] = NaN;
       continue;
     }
-    const d = N[m] * Math.sqrt(w / (w - 1));
+    const d = N[h] * Math.sqrt(w / (w - 1));
     if (d !== d || d === 0) {
-      f[m] = NaN;
+      f[h] = NaN;
       continue;
     }
-    f[m] = v * Math.sqrt(e) / d;
+    f[h] = v * Math.sqrt(e) / d;
   }
   return f;
 }
@@ -2606,7 +2641,7 @@ function Xe(n, t, r = 252, e = 1) {
   const o = n.length, l = new Float64Array(o);
   if (o === 0)
     return l;
-  const f = X(n, t, { skipna: !0, ddof: 0 }), i = nt(D(n), t);
+  const f = X(n, t, { skipna: !0, ddof: 0 }), i = nt(P(n), t);
   for (let a = 0; a < o; a++) {
     const s = i[a];
     if (s !== s || s < e) {
@@ -2626,10 +2661,10 @@ function Xe(n, t, r = 252, e = 1) {
   }
   return l;
 }
-function St(n) {
-  const t = -39.69683028665376, r = 220.9460984245205, e = -275.9285104469687, o = 138.357751867269, l = -30.66479806614716, f = 2.506628277459239, i = -54.47609879822406, a = 161.5858368580409, s = -155.6989798598866, u = 66.80131188771972, c = -13.28068155288572, N = -0.007784894002430293, h = -0.3223964580411365, m = -2.400758277161838, w = -2.549732539343734, v = 4.374664141464968, d = 2.938163982698783, A = 0.007784695709041462, b = 0.3224671290700398, g = 2.445134137142996, F = 3.754408661907416, x = 0.02425, I = 1 - x;
-  let y, M, E;
-  return n < x ? (y = Math.sqrt(-2 * Math.log(n)), E = (((((N * y + h) * y + m) * y + w) * y + v) * y + d) / ((((A * y + b) * y + g) * y + F) * y + 1), -E) : n <= I ? (y = n - 0.5, M = y * y, E = (((((t * M + r) * M + e) * M + o) * M + l) * M + f) * y / (((((i * M + a) * M + s) * M + u) * M + c) * M + 1), E) : (y = Math.sqrt(-2 * Math.log(1 - n)), E = (((((N * y + h) * y + m) * y + w) * y + v) * y + d) / ((((A * y + b) * y + g) * y + F) * y + 1), E);
+function Vt(n) {
+  const t = -39.69683028665376, r = 220.9460984245205, e = -275.9285104469687, o = 138.357751867269, l = -30.66479806614716, f = 2.506628277459239, i = -54.47609879822406, a = 161.5858368580409, s = -155.6989798598866, u = 66.80131188771972, c = -13.28068155288572, N = -0.007784894002430293, m = -0.3223964580411365, h = -2.400758277161838, w = -2.549732539343734, v = 4.374664141464968, d = 2.938163982698783, A = 0.007784695709041462, b = 0.3224671290700398, g = 2.445134137142996, M = 3.754408661907416, x = 0.02425, I = 1 - x;
+  let y, F, E;
+  return n < x ? (y = Math.sqrt(-2 * Math.log(n)), E = (((((N * y + m) * y + h) * y + w) * y + v) * y + d) / ((((A * y + b) * y + g) * y + M) * y + 1), -E) : n <= I ? (y = n - 0.5, F = y * y, E = (((((t * F + r) * F + e) * F + o) * F + l) * F + f) * y / (((((i * F + a) * F + s) * F + u) * F + c) * F + 1), E) : (y = Math.sqrt(-2 * Math.log(1 - n)), E = (((((N * y + m) * y + h) * y + w) * y + v) * y + d) / ((((A * y + b) * y + g) * y + M) * y + 1), E);
 }
 function Re(n) {
   return Math.exp(-0.5 * n * n) / Math.sqrt(2 * Math.PI);
@@ -2646,7 +2681,7 @@ function ze(n, t = 0.05, r = "historical") {
   const o = T(n), l = W(n);
   if (o !== o || l !== l || l === 0)
     return NaN;
-  const f = St(t);
+  const f = Vt(t);
   return o + l * f;
 }
 function Ke(n, t = 0.05, r = "historical") {
@@ -2661,15 +2696,15 @@ function Ke(n, t = 0.05, r = "historical") {
     const s = C(a, t);
     let u = 0, c = 0;
     for (let N = 0; N < a.length; N++) {
-      const h = a[N];
-      h <= s && (u += h, c++);
+      const m = a[N];
+      m <= s && (u += m, c++);
     }
     return u / c;
   }
   const o = T(n), l = W(n);
   if (o !== o || l !== l || l === 0)
     return NaN;
-  const f = St(t);
+  const f = Vt(t);
   return o - l * (Re(f) / t);
 }
 function Ye(n, t = 0.05) {
@@ -2683,8 +2718,8 @@ function Ye(n, t = 0.05) {
   const o = C(e, t), l = C(e, 1 - t);
   let f = 0, i = 0, a = 0, s = 0;
   for (let N = 0; N < e.length; N++) {
-    const h = e[N];
-    h <= o && (f += h, i++), h >= l && (a += h, s++);
+    const m = e[N];
+    m <= o && (f += m, i++), m >= l && (a += m, s++);
   }
   const u = f / i, c = a / s;
   return u === 0 ? NaN : c / Math.abs(u);
@@ -2713,11 +2748,11 @@ const To = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   expshortfall: Ke,
   logreturns: xe,
   maxdd: mt,
-  maxddDetails: Ve,
+  maxddDetails: Se,
   omega: He,
   recoveryfactor: je,
-  returns: Fe,
-  rollmaxdd: Se,
+  returns: Me,
+  rollmaxdd: Ve,
   rollsharpe: Ue,
   rollsortino: qe,
   rollulcer: Oe,
@@ -2741,20 +2776,20 @@ function We(n, t, r = 5, e = 34, o = !0) {
   if (l < e)
     return f.fill(NaN);
   let i = o;
-  if (i && !V() && (k(n, t) || (i = !0)), !i) {
+  if (i && !S() && (k(n, t) || (i = !0)), !i) {
     const c = new Float64Array(e), N = new Float64Array(r);
-    let h = 0, m = 0, w = 0, v = 0;
+    let m = 0, h = 0, w = 0, v = 0;
     for (let d = 0; d < l; d++) {
       const A = (n[d] + t[d]) / 2;
-      h += A, m += A;
+      m += A, h += A;
       const b = c[w];
-      h -= b, c[w] = A, w++, w === e && (w = 0);
+      m -= b, c[w] = A, w++, w === e && (w = 0);
       const g = N[v];
-      m -= g, N[v] = A, v++, v === r && (v = 0), d >= e - 1 && (d >= r - 1 ? f[d] = m / r - h / e : f[d] = NaN);
+      h -= g, N[v] = A, v++, v === r && (v = 0), d >= e - 1 && (d >= r - 1 ? f[d] = h / r - m / e : f[d] = NaN);
     }
     return f;
   }
-  const a = gt(n, t), s = P(a, r), u = P(a, e);
+  const a = gt(n, t), s = O(a, r), u = O(a, e);
   return H(s, u);
 }
 function Ge(n, t, r) {
@@ -2797,8 +2832,8 @@ function $e(n, t) {
   const i = o + l;
   e[t] = f === 0 ? NaN : i !== 0 ? 100 * (o - l) / i : 0;
   for (let a = t + 1; a < r; a++) {
-    const s = n[a - 1], c = n[a] - s, N = n[a - t - 1], m = n[a - t] - N, w = m === m, v = c === c;
-    if (w && (m > 0 ? o -= m : m < 0 && (l -= -m), f--), v && (c > 0 ? o += c : c < 0 && (l += -c), f++), f === 0) {
+    const s = n[a - 1], c = n[a] - s, N = n[a - t - 1], h = n[a - t] - N, w = h === h, v = c === c;
+    if (w && (h > 0 ? o -= h : h < 0 && (l -= -h), f--), v && (c > 0 ? o += c : c < 0 && (l += -c), f++), f === 0) {
       e[a] = NaN;
       continue;
     }
@@ -2816,16 +2851,16 @@ function Je(n, t, r, e) {
   if (o < a)
     return [l, f, i];
   const s = 2 / (t + 1), u = 2 / (r + 1), c = 2 / (e + 1);
-  let N = !1, h = NaN, m = NaN, w = NaN, v = 0, d = 0;
+  let N = !1, m = NaN, h = NaN, w = NaN, v = 0, d = 0;
   for (let A = 0; A < o; A++) {
     const b = n[A];
     if (b === b) {
       if (v === 0) {
-        h = b, m = b, v = 1, d = 1;
+        m = b, h = b, v = 1, d = 1;
         continue;
       }
-      if (h = h + s * (b - h), m = m + u * (b - m), v++, d++, d >= r && v >= t) {
-        const g = h - m;
+      if (m = m + s * (b - m), h = h + u * (b - h), v++, d++, d >= r && v >= t) {
+        const g = m - h;
         l[A] = g, N ? (w = w + c * (g - w), f[A] = w, i[A] = g - w) : (w = g, N = !0, f[A] = w, i[A] = 0);
       }
     }
@@ -2915,8 +2950,8 @@ function no(n, t) {
       s = c;
       continue;
     }
-    const N = c - s, h = Math.max(N, 0), m = Math.max(-N, 0);
-    f < t ? (o += h, l += m, f++, f === t ? (i = o / t, a = l / t, e[u] = a === 0 ? 100 : 100 - 100 / (1 + i / a)) : e[u] = NaN) : (i = (i * (t - 1) + h) / t, a = (a * (t - 1) + m) / t, e[u] = a === 0 ? 100 : 100 - 100 / (1 + i / a)), s = c;
+    const N = c - s, m = Math.max(N, 0), h = Math.max(-N, 0);
+    f < t ? (o += m, l += h, f++, f === t ? (i = o / t, a = l / t, e[u] = a === 0 ? 100 : 100 - 100 / (1 + i / a)) : e[u] = NaN) : (i = (i * (t - 1) + m) / t, a = (a * (t - 1) + h) / t, e[u] = a === 0 ? 100 : 100 - 100 / (1 + i / a)), s = c;
   }
   return e;
 }
@@ -2924,7 +2959,7 @@ function jt(n, t, r = !0) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const e = n.length;
-  if (r && !V()) {
+  if (r && !S()) {
     let o = !1;
     for (let l = 0; l < e; l++)
       if (n[l] !== n[l]) {
@@ -2944,16 +2979,20 @@ function eo(n, t, r, e, o, l) {
   const i = new Float64Array(f), a = new Float64Array(f);
   if (f === 0)
     return [i, a];
-  const s = e + o + l - 2;
-  if (f < s)
+  const s = e + o + l - 3;
+  if (f <= s)
     return [i.fill(NaN), a.fill(NaN)];
   const u = new Float64Array(f).fill(NaN);
-  Nt(t, n, e, (m, w, v) => {
-    const d = r[v], A = w - m;
-    u[v] = A === 0 ? 0 : (d - m) / A * 100;
+  Nt(t, n, e, (h, w, v) => {
+    const d = r[v], A = w - h;
+    u[v] = A === 0 ? 0 : (d - h) / A * 100;
   });
-  const N = P(u, o, !1), h = P(N, l, !1);
-  return [N, h];
+  const N = O(u, o, !0), m = O(N, l, !0);
+  for (let h = 0; h < s; h++)
+    i[h] = NaN, a[h] = NaN;
+  for (let h = s; h < f; h++)
+    i[h] = N[h], a[h] = m[h];
+  return [i, a];
 }
 function oo(n, t) {
   if (t <= 0)
@@ -2964,30 +3003,30 @@ function oo(n, t) {
   if (r === 0)
     return e;
   const l = new Int32Array(r), f = new Int32Array(r), i = new Int32Array(r), a = new Int32Array(r);
-  let s = 0, u = 0, c = 0, N = 0, h = -1;
-  for (let m = 0; m < r; m++) {
-    const w = o[m];
+  let s = 0, u = 0, c = 0, N = 0, m = -1;
+  for (let h = 0; h < r; h++) {
+    const w = o[h];
     if (w !== w) {
-      e[m] = NaN;
+      e[h] = NaN;
       continue;
     }
-    for (h++; u > s && o[l[u - 1]] >= w; )
+    for (m++; u > s && o[l[u - 1]] >= w; )
       u--;
-    l[u] = m, i[u] = h, u++;
-    const v = h - t;
+    l[u] = h, i[u] = m, u++;
+    const v = m - t;
     for (; u > s && i[s] <= v; )
       s++;
     for (; N > c && o[f[N - 1]] <= w; )
       N--;
-    f[N] = m, a[N] = h, N++;
-    const d = h - t;
+    f[N] = h, a[N] = m, N++;
+    const d = m - t;
     for (; N > c && a[c] <= d; )
       c++;
-    if (h >= t - 1) {
+    if (m >= t - 1) {
       const A = o[l[s]], g = o[f[c]] - A;
-      e[m] = g === 0 ? 0 : (w - A) / g;
+      e[h] = g === 0 ? 0 : (w - A) / g;
     } else
-      e[m] = NaN;
+      e[h] = NaN;
   }
   return e;
 }
@@ -3005,22 +3044,22 @@ function lo(n, t, r, e) {
     c[g] = NaN;
   if (u === 0)
     return c;
-  const N = new Float64Array(u + 1), h = new Float64Array(u + 1);
+  const N = new Float64Array(u + 1), m = new Float64Array(u + 1);
   {
-    const g = n[0], F = t[0], I = r[0] - F, y = g - F;
-    N[1] = I, h[1] = y;
+    const g = n[0], M = t[0], I = r[0] - M, y = g - M;
+    N[1] = I, m[1] = y;
   }
   for (let g = 1; g < u; g++) {
-    const F = n[g], x = t[g], I = r[g], y = r[g - 1], M = Math.min(x, y), E = Math.max(F, y), _ = I - M, S = E - M;
-    N[g + 1] = N[g] + _, h[g + 1] = h[g] + S;
+    const M = n[g], x = t[g], I = r[g], y = r[g - 1], F = Math.min(x, y), E = Math.max(M, y), _ = I - F, V = E - F;
+    N[g + 1] = N[g] + _, m[g + 1] = m[g] + V;
   }
-  const m = 4, w = 2, v = 1, d = m + w + v, A = Math.max(i, a, s);
+  const h = 4, w = 2, v = 1, d = h + w + v, A = Math.max(i, a, s);
   if (u < A)
     return c;
   const b = A;
   for (let g = b; g < u; g++) {
-    const F = g - i + 1, x = g - a + 1, I = g - s + 1, y = N[g + 1] - N[F], M = h[g + 1] - h[F], E = M === 0 ? 0 : y / M, _ = N[g + 1] - N[x], S = h[g + 1] - h[x], L = S === 0 ? 0 : _ / S, j = N[g + 1] - N[I], U = h[g + 1] - h[I], R = U === 0 ? 0 : j / U;
-    c[g] = 100 * ((m * E + w * L + v * R) / d);
+    const M = g - i + 1, x = g - a + 1, I = g - s + 1, y = N[g + 1] - N[M], F = m[g + 1] - m[M], E = F === 0 ? 0 : y / F, _ = N[g + 1] - N[x], V = m[g + 1] - m[x], L = V === 0 ? 0 : _ / V, j = N[g + 1] - N[I], U = m[g + 1] - m[I], R = U === 0 ? 0 : j / U;
+    c[g] = 100 * ((h * E + w * L + v * R) / d);
   }
   return c;
 }
@@ -3045,10 +3084,10 @@ function io(n, t, r, e = !0) {
   const l = new Float64Array(o), f = new Float64Array(o);
   if (l.fill(NaN), f.fill(NaN), o < r)
     return [l, f];
-  if (k(n, t))
+  if (e && k(n, t))
     return [l, f];
   let i = e;
-  if (i && !V()) {
+  if (i && !S()) {
     let u = !1;
     for (let c = 0; c < o; c++)
       if (n[c] !== n[c] || t[c] !== t[c]) {
@@ -3058,36 +3097,36 @@ function io(n, t, r, e = !0) {
     u || (i = !0);
   }
   if (!i) {
-    let u = -1, c = NaN, N = -1, h = NaN;
-    for (let m = r; m < o; m++) {
-      const w = m - r + 1;
+    let u = -1, c = NaN, N = -1, m = NaN;
+    for (let h = r; h < o; h++) {
+      const w = h - r;
       if (u < w) {
         u = -1, c = NaN;
-        for (let A = w; A <= m; A++) {
+        for (let A = w; A <= h; A++) {
           const b = n[A];
-          b === b && (u === -1 || b > c) && (u = A, c = b);
+          b === b && (u === -1 || b >= c) && (u = A, c = b);
         }
       } else {
-        const A = n[m];
-        A === A && (u === -1 || A > c) && (u = m, c = A);
+        const A = n[h];
+        A === A && (u === -1 || A >= c) && (u = h, c = A);
       }
-      const v = u === -1 ? NaN : m - u;
-      if (l[m - 1] = v === v ? (r - v) / r * 100 : NaN, N < w) {
-        N = -1, h = NaN;
-        for (let A = w; A <= m; A++) {
+      const v = u === -1 ? NaN : h - u;
+      if (l[h - 1] = v === v ? (r - v) / r * 100 : NaN, N < w) {
+        N = -1, m = NaN;
+        for (let A = w; A <= h; A++) {
           const b = t[A];
-          b === b && (N === -1 || b < h) && (N = A, h = b);
+          b === b && (N === -1 || b <= m) && (N = A, m = b);
         }
       } else {
-        const A = t[m];
-        A === A && (N === -1 || A < h) && (N = m, h = A);
+        const A = t[h];
+        A === A && (N === -1 || A <= m) && (N = h, m = A);
       }
-      const d = N === -1 ? NaN : m - N;
-      f[m - 1] = d === d ? (r - d) / r * 100 : NaN;
+      const d = N === -1 ? NaN : h - N;
+      f[h - 1] = d === d ? (r - d) / r * 100 : NaN;
     }
     return [l, f];
   }
-  const a = Ft(n, r), s = Mt(t, r);
+  const a = Mt(n, r), s = Ft(t, r);
   for (let u = r; u < o; u++) {
     const c = a[u];
     l[u - 1] = c !== c ? NaN : (r - (u - c)) / r * 100;
@@ -3096,7 +3135,7 @@ function io(n, t, r, e = !0) {
   }
   return [l, f];
 }
-const O = {
+const D = {
   r1: 10,
   r2: 15,
   r3: 20,
@@ -3111,15 +3150,15 @@ const O = {
   w4: 4
 };
 function fo(n, t) {
-  var r, e, o, l, f, i, a, s, u, c, N, h;
-  let m = (r = t == null ? void 0 : t.r1) !== null && r !== void 0 ? r : O.r1, w = (e = t == null ? void 0 : t.r2) !== null && e !== void 0 ? e : O.r2, v = (o = t == null ? void 0 : t.r3) !== null && o !== void 0 ? o : O.r3, d = (l = t == null ? void 0 : t.r4) !== null && l !== void 0 ? l : O.r4, A = (f = t == null ? void 0 : t.n1) !== null && f !== void 0 ? f : O.n1, b = (i = t == null ? void 0 : t.n2) !== null && i !== void 0 ? i : O.n2, g = (a = t == null ? void 0 : t.n3) !== null && a !== void 0 ? a : O.n3, F = (s = t == null ? void 0 : t.n4) !== null && s !== void 0 ? s : O.n4, x = (u = t == null ? void 0 : t.w1) !== null && u !== void 0 ? u : O.w1, I = (c = t == null ? void 0 : t.w2) !== null && c !== void 0 ? c : O.w2, y = (N = t == null ? void 0 : t.w3) !== null && N !== void 0 ? N : O.w3, M = (h = t == null ? void 0 : t.w4) !== null && h !== void 0 ? h : O.w4;
-  const E = [m, w, v, d], _ = [A, b, g, F];
+  var r, e, o, l, f, i, a, s, u, c, N, m;
+  let h = (r = t == null ? void 0 : t.r1) !== null && r !== void 0 ? r : D.r1, w = (e = t == null ? void 0 : t.r2) !== null && e !== void 0 ? e : D.r2, v = (o = t == null ? void 0 : t.r3) !== null && o !== void 0 ? o : D.r3, d = (l = t == null ? void 0 : t.r4) !== null && l !== void 0 ? l : D.r4, A = (f = t == null ? void 0 : t.n1) !== null && f !== void 0 ? f : D.n1, b = (i = t == null ? void 0 : t.n2) !== null && i !== void 0 ? i : D.n2, g = (a = t == null ? void 0 : t.n3) !== null && a !== void 0 ? a : D.n3, M = (s = t == null ? void 0 : t.n4) !== null && s !== void 0 ? s : D.n4, x = (u = t == null ? void 0 : t.w1) !== null && u !== void 0 ? u : D.w1, I = (c = t == null ? void 0 : t.w2) !== null && c !== void 0 ? c : D.w2, y = (N = t == null ? void 0 : t.w3) !== null && N !== void 0 ? N : D.w3, F = (m = t == null ? void 0 : t.w4) !== null && m !== void 0 ? m : D.w4;
+  const E = [h, w, v, d], _ = [A, b, g, M];
   for (const Bt of E.concat(_))
     if (Bt <= 0)
       throw new Error("Periods must be positive");
   if (n.length === 0)
     return new Float64Array(0);
-  const L = $(n, m), j = $(n, w), U = $(n, v), R = $(n, d), z = P(L, A), K = P(j, b), Y = P(U, g), Ot = P(R, F), Ct = G(z, x), Tt = G(K, I), Ut = G(Y, y), qt = G(Ot, M);
+  const L = $(n, h), j = $(n, w), U = $(n, v), R = $(n, d), z = O(L, A), K = O(j, b), Y = O(U, g), Ot = O(R, M), Ct = G(z, x), Tt = G(K, I), Ut = G(Y, y), qt = G(Ot, F);
   return Z(Z(Ct, Tt), Z(Ut, qt));
 }
 function ao(n, t, r, e) {
@@ -3132,30 +3171,30 @@ function ao(n, t, r, e) {
   if (o < e)
     return l;
   const f = new Float64Array(o);
-  for (let m = 0; m < o; m++)
-    f[m] = (n[m] + t[m] + r[m]) / 3;
+  for (let h = 0; h < o; h++)
+    f[h] = (n[h] + t[h] + r[h]) / 3;
   let i = 0, a = 0;
   const s = e;
-  for (let m = 0; m < s && m < o; m++) {
-    const w = f[m];
+  for (let h = 0; h < s && h < o; h++) {
+    const w = f[h];
     w === w && (i += w, a++);
   }
-  const u = Math.abs, c = 1 / s, N = 0.015, h = 2 * s - 2;
-  for (let m = s - 1; m < o; m++) {
-    if (a === s && m >= h) {
+  const u = Math.abs, c = 1 / s, N = 0.015, m = 2 * s - 2;
+  for (let h = s - 1; h < o; h++) {
+    if (a === s && h >= m) {
       const w = i * c;
       let v = 0;
-      const d = m - s + 1;
-      for (let g = d; g <= m; g++)
+      const d = h - s + 1;
+      for (let g = d; g <= h; g++)
         v += u(f[g] - w);
       v = v * c;
-      const A = N * v, b = f[m];
-      l[m] = A === 0 ? 0 : (b - w) / A;
+      const A = N * v, b = f[h];
+      l[h] = A === 0 ? 0 : (b - w) / A;
     }
-    if (m + 1 < o) {
-      const w = m - s + 1, v = f[w];
+    if (h + 1 < o) {
+      const w = h - s + 1, v = f[w];
       v === v && (i -= v, a--);
-      const d = f[m + 1];
+      const d = f[h + 1];
       d === d && (i += d, a++);
     }
   }
@@ -3171,38 +3210,38 @@ function et(n, t, r, e) {
   if (o < e)
     return l.fill(NaN), f.fill(NaN), i.fill(NaN), a.fill(NaN), s.fill(NaN), { diplus: l, diminus: f, dx: i, adx: a, adxr: s };
   let u = 0, c = 0, N = 0;
-  function h(g) {
-    const F = n[g] - n[g - 1], x = t[g - 1] - t[g], I = F > x && F > 0 ? F : 0, y = x > F && x > 0 ? x : 0, M = n[g] - t[g], E = Math.abs(n[g] - r[g - 1]), _ = Math.abs(t[g] - r[g - 1]);
-    return { tr: Math.max(M, Math.max(E, _)), p: I, m: y };
+  function m(g) {
+    const M = n[g] - n[g - 1], x = t[g - 1] - t[g], I = M > x && M > 0 ? M : 0, y = x > M && x > 0 ? x : 0, F = n[g] - t[g], E = Math.abs(n[g] - r[g - 1]), _ = Math.abs(t[g] - r[g - 1]);
+    return { tr: Math.max(F, Math.max(E, _)), p: I, m: y };
   }
   n[0] - t[0], u += 0;
   for (let g = 1; g < e; g++) {
-    const F = h(g);
-    u += F.tr, c += F.p, N += F.m;
+    const M = m(g);
+    u += M.tr, c += M.p, N += M.m;
   }
   for (let g = 0; g < e - 1 && g < o; g++)
     l[g] = NaN, f[g] = NaN, i[g] = NaN, s[g] = NaN;
-  const m = u !== 0 ? 100 * (c / u) : NaN, w = u !== 0 ? 100 * (N / u) : NaN;
-  l[e - 1] = m, f[e - 1] = w, i[e - 1] = 100 * Math.abs(m - w) / (m + w);
+  const h = u !== 0 ? 100 * (c / u) : NaN, w = u !== 0 ? 100 * (N / u) : NaN;
+  l[e - 1] = h, f[e - 1] = w, i[e - 1] = 100 * Math.abs(h - w) / (h + w);
   const v = 2 * e - 2;
   v > 0 && (a.fill(NaN, 0, Math.min(o, v + 1)), s.fill(NaN, 0, Math.min(o, v + 1)));
   let d = 0, A = 0;
   const b = i[e - 1];
   b === b && (d += b, A++);
   for (let g = e; g <= v && g < o; g++) {
-    const { tr: F, p: x, m: I } = h(g);
-    u = u - u / e + F, c = c - c / e + x, N = N - N / e + I;
-    const y = u !== 0 ? 100 * (c / u) : NaN, M = u !== 0 ? 100 * (N / u) : NaN;
-    l[g] = y, f[g] = M;
-    const E = 100 * Math.abs(y - M) / (y + M);
+    const { tr: M, p: x, m: I } = m(g);
+    u = u - u / e + M, c = c - c / e + x, N = N - N / e + I;
+    const y = u !== 0 ? 100 * (c / u) : NaN, F = u !== 0 ? 100 * (N / u) : NaN;
+    l[g] = y, f[g] = F;
+    const E = 100 * Math.abs(y - F) / (y + F);
     i[g] = E, E === E && (d += E, A++), g === v && (a[v] = A === e ? d / A : NaN);
   }
   for (let g = Math.max(e, v + 1); g < o; g++) {
-    const { tr: F, p: x, m: I } = h(g);
-    u = u - u / e + F, c = c - c / e + x, N = N - N / e + I;
-    const y = u !== 0 ? 100 * (c / u) : NaN, M = u !== 0 ? 100 * (N / u) : NaN;
-    l[g] = y, f[g] = M;
-    const E = 100 * Math.abs(y - M) / (y + M);
+    const { tr: M, p: x, m: I } = m(g);
+    u = u - u / e + M, c = c - c / e + x, N = N - N / e + I;
+    const y = u !== 0 ? 100 * (c / u) : NaN, F = u !== 0 ? 100 * (N / u) : NaN;
+    l[g] = y, f[g] = F;
+    const E = 100 * Math.abs(y - F) / (y + F);
     i[g] = E, a[g] = (a[g - 1] * (e - 1) + E) / e;
     const _ = a[g - e + 1];
     s[g] = (a[g] + _) / 2;
@@ -3228,7 +3267,7 @@ function ho(n, t) {
   const r = n.length, e = new Float64Array(r);
   if (r < t)
     return e.fill(NaN);
-  const o = P(n, t, !0), l = Math.floor(t / 2) + 1;
+  const o = O(n, t, !0), l = Math.floor(t / 2) + 1;
   for (let f = 0; f < l && f < r; f++)
     e[f] = NaN;
   for (let f = l; f < r; f++)
@@ -3246,60 +3285,60 @@ function mo(n, t, r, e, o = !0) {
   const f = new Float64Array(l);
   if (l === 0)
     return f;
-  function i(u, c, N, h, m, w, v, d, A, b) {
-    let g = u + c * (N - u), F, x = c, I = u, y = h, M = N;
-    return h ? (g > b && (g = b), g > A && (g = A), m > M && (M = m, x += r, x >= e && (x = e)), I = g, w < g && (x = r, I = M, y = !1, M = w), F = I) : (g < d && (g = d), g < v && (g = v), w < M && (M = w, x += r, x >= e && (x = e)), I = g, m > g && (x = r, I = M, y = !0, M = m), F = I), { sar: I, accel: x, lng: y, extreme: M, outVal: F };
+  function i(u, c, N, m, h, w, v, d, A, b) {
+    let g = u + c * (N - u), M, x = c, I = u, y = m, F = N;
+    return m ? (g > b && (g = b), g > A && (g = A), h > F && (F = h, x += r, x >= e && (x = e)), I = g, w < g && (x = r, I = F, y = !1, F = w), M = I) : (g < d && (g = d), g < v && (g = v), w < F && (F = w, x += r, x >= e && (x = e)), I = g, h > g && (x = r, I = F, y = !0, F = h), M = I), { sar: I, accel: x, lng: y, extreme: F, outVal: M };
   }
   function a(u, c) {
-    const N = u.length, h = new Float64Array(N);
-    if (h.fill(NaN), N < 2)
-      return h;
-    let m = u[0] + c[0] <= u[1] + c[1], w, v;
-    m ? (v = u[0], w = c[0]) : (v = c[0], w = u[0]);
+    const N = u.length, m = new Float64Array(N);
+    if (m.fill(NaN), N < 2)
+      return m;
+    let h = u[0] + c[0] <= u[1] + c[1], w, v;
+    h ? (v = u[0], w = c[0]) : (v = c[0], w = u[0]);
     let d = r;
     {
-      const b = u[0], g = c[0], F = i(w, d, v, m, u[1], c[1], b, b, g, g);
-      w = F.sar, d = F.accel, m = F.lng, v = F.extreme, h[1] = F.outVal;
+      const b = u[0], g = c[0], M = i(w, d, v, h, u[1], c[1], b, b, g, g);
+      w = M.sar, d = M.accel, h = M.lng, v = M.extreme, m[1] = M.outVal;
     }
     for (let A = 2; A < N; A++) {
-      const b = u[A], g = c[A], F = u[A - 1], x = u[A - 2], I = c[A - 1], y = c[A - 2], M = i(w, d, v, m, b, g, F, x, I, y);
-      w = M.sar, d = M.accel, m = M.lng, v = M.extreme, h[A] = M.outVal;
+      const b = u[A], g = c[A], M = u[A - 1], x = u[A - 2], I = c[A - 1], y = c[A - 2], F = i(w, d, v, h, b, g, M, x, I, y);
+      w = F.sar, d = F.accel, h = F.lng, v = F.extreme, m[A] = F.outVal;
     }
-    return h;
+    return m;
   }
   function s(u, c) {
     const N = new Float64Array(l).fill(NaN);
     if (l < 2)
       return N;
-    const h = (y) => {
-      const M = u[y], E = c[y];
-      return M === M && E === E;
-    }, m = (y) => {
-      let M = y;
-      for (; M < l && !h(M); )
-        M++;
-      return M;
-    }, w = m(0);
+    const m = (y) => {
+      const F = u[y], E = c[y];
+      return F === F && E === E;
+    }, h = (y) => {
+      let F = y;
+      for (; F < l && !m(F); )
+        F++;
+      return F;
+    }, w = h(0);
     if (w >= l)
       return N;
-    const v = m(w + 1);
+    const v = h(w + 1);
     if (v >= l)
       return N;
     let d = u[w] + c[w] <= u[v] + c[v], A, b;
     d ? (b = u[w], A = c[w]) : (b = c[w], A = u[w]);
     let g = r;
     {
-      const y = v, M = u[w], E = c[w], _ = i(A, g, b, d, u[y], c[y], M, M, E, E);
+      const y = v, F = u[w], E = c[w], _ = i(A, g, b, d, u[y], c[y], F, F, E, E);
       A = _.sar, g = _.accel, d = _.lng, b = _.extreme, N[y] = _.outVal;
     }
-    let F = w, x = v, I = m(x + 1);
+    let M = w, x = v, I = h(x + 1);
     for (; I < l; ) {
-      const y = u[I], M = c[I], E = u[x], _ = u[F], S = c[x], L = c[F], j = i(A, g, b, d, y, M, E, _, S, L);
-      A = j.sar, g = j.accel, d = j.lng, b = j.extreme, N[I] = j.outVal, F = x, x = I, I = m(x + 1);
+      const y = u[I], F = c[I], E = u[x], _ = u[M], V = c[x], L = c[M], j = i(A, g, b, d, y, F, E, _, V, L);
+      A = j.sar, g = j.accel, d = j.lng, b = j.extreme, N[I] = j.outVal, M = x, x = I, I = h(x + 1);
     }
     return N;
   }
-  return o && !V() && (k(n, t) || (o = !1)), o ? s(n, t) : a(n, t);
+  return o && !S() && (k(n, t) || (o = !1)), o ? s(n, t) : a(n, t);
 }
 function Pt(n, t, r) {
   const e = n.length;
@@ -3322,7 +3361,7 @@ function ot(n, t, r, e) {
   if (o < e)
     return new Float64Array(o).fill(NaN);
   const l = Pt(n, t, r);
-  return !V() && !k(n, t, r) ? at(l, e, !1) : at(l, e, !0);
+  return !S() && !k(n, t, r) ? at(l, e, !1) : at(l, e, !0);
 }
 function wo(n, t, r, e) {
   const o = ot(n, t, r, e);
@@ -3338,25 +3377,25 @@ function vo(n, t, r, e, o) {
   if (l === 0)
     return [f, i, a, s];
   const u = ot(n, t, r, e);
-  for (let m = 0; m < l; m++)
-    f[m] = i[m] = a[m] = NaN;
-  let c = NaN, N = NaN, h = 1;
-  for (let m = 0; m < l; m++) {
-    const w = u[m], v = n[m], d = t[m], A = r[m];
+  for (let h = 0; h < l; h++)
+    f[h] = i[h] = a[h] = NaN;
+  let c = NaN, N = NaN, m = 1;
+  for (let h = 0; h < l; h++) {
+    const w = u[h], v = n[h], d = t[h], A = r[h];
     if (w !== w || v !== v || d !== d || A !== A)
       continue;
-    const b = (v + d) / 2, g = b + o * w, F = b - o * w;
-    let x = g, I = F;
-    if (m > 0 && c === c) {
-      const M = r[m - 1];
-      g < c || M === M && M > c || (x = c);
+    const b = (v + d) / 2, g = b + o * w, M = b - o * w;
+    let x = g, I = M;
+    if (h > 0 && c === c) {
+      const F = r[h - 1];
+      g < c || F === F && F > c || (x = c);
     }
-    if (m > 0 && N === N) {
-      const M = r[m - 1];
-      F > N || M === M && M < N || (I = N);
+    if (h > 0 && N === N) {
+      const F = r[h - 1];
+      M > N || F === F && F < N || (I = N);
     }
-    let y = h;
-    A > x ? y = 1 : A < I && (y = 0), f[m] = y ? I : x, i[m] = x, a[m] = I, s[m] = y ? 1 : 0, c = x, N = I, h = y;
+    let y = m;
+    A > x ? y = 1 : A < I && (y = 0), f[h] = y ? I : x, i[h] = x, a[h] = I, s[h] = y ? 1 : 0, c = x, N = I, m = y;
   }
   return [f, i, a, s];
 }
@@ -3369,14 +3408,14 @@ function bo(n, t, r, e) {
   const c = n.length;
   if (t.length !== c || r.length !== c)
     throw new Error("high/low/close must have the same length");
-  const N = new Float64Array(c), h = new Float64Array(c), m = new Float64Array(c), w = new Float64Array(c);
-  N.fill(NaN), h.fill(NaN), m.fill(NaN), w.fill(NaN);
-  function v(y, M, E, _, S) {
+  const N = new Float64Array(c), m = new Float64Array(c), h = new Float64Array(c), w = new Float64Array(c);
+  N.fill(NaN), m.fill(NaN), h.fill(NaN), w.fill(NaN);
+  function v(y, F, E, _, V) {
     if (!(c < E))
       for (let L = E - 1; L < c; L++) {
         let j = -1 / 0, U = 1 / 0, R = !1;
         for (let z = L - E + 1; z <= L; z++) {
-          const K = y[z], Y = M[z];
+          const K = y[z], Y = F[z];
           if (K !== K || Y !== Y) {
             R = !0;
             break;
@@ -3384,50 +3423,50 @@ function bo(n, t, r, e) {
           K > j && (j = K), Y < U && (U = Y);
         }
         if (R) {
-          _[L] = S[L] = NaN;
+          _[L] = V[L] = NaN;
           continue;
         }
-        _[L] = j, S[L] = U;
+        _[L] = j, V[L] = U;
       }
   }
   const d = new Float64Array(c), A = new Float64Array(c);
   d.fill(NaN), A.fill(NaN), v(n, t, i, d, A);
   for (let y = 0; y < c; y++) {
-    const M = d[y], E = A[y];
-    M !== M || E !== E ? N[y] = NaN : N[y] = (M + E) / 2;
+    const F = d[y], E = A[y];
+    F !== F || E !== E ? N[y] = NaN : N[y] = (F + E) / 2;
   }
   const b = new Float64Array(c), g = new Float64Array(c);
   b.fill(NaN), g.fill(NaN), v(n, t, a, b, g);
   for (let y = 0; y < c; y++) {
-    const M = b[y], E = g[y];
-    M !== M || E !== E ? h[y] = NaN : h[y] = (M + E) / 2;
+    const F = b[y], E = g[y];
+    F !== F || E !== E ? m[y] = NaN : m[y] = (F + E) / 2;
   }
   for (let y = 0; y < c; y++) {
-    const M = N[y], E = h[y];
-    if (M !== M || E !== E)
+    const F = N[y], E = m[y];
+    if (F !== F || E !== E)
       continue;
-    const _ = (M + E) / 2, S = y + u;
-    S < c && (m[S] = _);
+    const _ = (F + E) / 2, V = y + u;
+    V < c && (h[V] = _);
   }
-  const F = new Float64Array(c), x = new Float64Array(c);
-  F.fill(NaN), x.fill(NaN), v(n, t, s, F, x);
+  const M = new Float64Array(c), x = new Float64Array(c);
+  M.fill(NaN), x.fill(NaN), v(n, t, s, M, x);
   for (let y = 0; y < c; y++) {
-    const M = F[y], E = x[y];
-    if (M !== M || E !== E)
+    const F = M[y], E = x[y];
+    if (F !== F || E !== E)
       continue;
-    const _ = (M + E) / 2, S = y + u;
-    S < c && (w[S] = _);
+    const _ = (F + E) / 2, V = y + u;
+    V < c && (w[V] = _);
   }
   const I = yt(r, -u);
-  return [N, h, m, w, I];
+  return [N, m, h, w, I];
 }
 function Dt(n, t, r) {
   if (t <= 0)
     throw new Error("Period must be positive");
-  const e = n.length, o = P(n, t, !0), l = new Float64Array(e), f = new Float64Array(e);
+  const e = n.length, o = O(n, t, !0), l = new Float64Array(e), f = new Float64Array(e);
   if (f.fill(NaN, 0, Math.min(e, t)), l.fill(NaN, 0, Math.min(e, t)), e < t)
     return [o.fill(NaN), l.fill(NaN), f.fill(NaN)];
-  const i = !(V() === !1 && !k(n)), a = X(n, t, { skipna: i, ddof: 0 });
+  const i = !(S() === !1 && !k(n)), a = X(n, t, { skipna: i, ddof: 0 });
   for (let s = t - 1; s < e; s++) {
     const u = o[s], c = a[s];
     if (u !== u || c !== c) {
@@ -3438,7 +3477,7 @@ function Dt(n, t, r) {
   }
   return [o, l, f];
 }
-function Mo(n, t, r) {
+function Fo(n, t, r) {
   if (t <= 0)
     throw new Error("Period must be positive");
   const e = n.length, o = new Float64Array(e);
@@ -3451,7 +3490,7 @@ function Mo(n, t, r) {
   }
   return o;
 }
-function Fo(n, t, r) {
+function Mo(n, t, r) {
   if (r <= 0)
     throw new Error("Period must be positive");
   const e = n.length;
@@ -3460,17 +3499,17 @@ function Fo(n, t, r) {
   const o = new Float64Array(e), l = new Float64Array(e), f = new Float64Array(e);
   if (o.fill(NaN, 0, Math.min(e, r - 1)), l.fill(NaN, 0, Math.min(e, r - 1)), f.fill(NaN, 0, Math.min(e, r - 1)), e < r)
     return [o, l, f];
-  const i = !V() && !k(n, t);
+  const i = !S() && !k(n, t);
   for (let a = r - 1; a < e; a++) {
     let s = -1 / 0, u = 1 / 0, c = !1;
     for (let N = a - r + 1; N <= a; N++) {
-      const h = n[N], m = t[N];
-      if (h !== h || m !== m) {
+      const m = n[N], h = t[N];
+      if (m !== m || h !== h) {
         if (c = !0, i)
           break;
         break;
       }
-      h > s && (s = h), m < u && (u = m);
+      m > s && (s = m), h < u && (u = h);
     }
     if (c) {
       o[a] = l[a] = f[a] = NaN;
@@ -3490,17 +3529,17 @@ function xo(n, t, r, e, o) {
     return [new Float64Array(0), new Float64Array(0), new Float64Array(0)];
   const f = new Float64Array(l);
   for (let c = 0; c < l; c++) {
-    const N = n[c], h = t[c], m = r[c];
-    N !== N || h !== h || m !== m ? f[c] = NaN : f[c] = (N + h + m) / 3;
+    const N = n[c], m = t[c], h = r[c];
+    N !== N || m !== m || h !== h ? f[c] = NaN : f[c] = (N + m + h) / 3;
   }
   const i = xt(f, e), a = ot(n, t, r, e), s = new Float64Array(l), u = new Float64Array(l);
   for (let c = 0; c < l; c++) {
-    const N = i[c], h = a[c];
-    if (N !== N || h !== h) {
+    const N = i[c], m = a[c];
+    if (N !== N || m !== m) {
       s[c] = u[c] = NaN;
       continue;
     }
-    s[c] = N + o * h, u[c] = N - o * h;
+    s[c] = N + o * m, u[c] = N - o * m;
   }
   return [i, s, u];
 }
@@ -3511,35 +3550,35 @@ function Eo(n, t, r, e) {
   const l = new Float64Array(o);
   let f = 0;
   for (let i = 0; i < o; i++) {
-    const a = n[i], s = t[i], u = r[i], c = e[i], N = a - s, h = N === 0 ? 0 : (u - s - (a - u)) / N, m = f + h * c;
-    m === m && (f = m), l[i] = m;
+    const a = n[i], s = t[i], u = r[i], c = e[i], N = a - s, m = N === 0 ? 0 : (u - s - (a - u)) / N, h = f + m * c;
+    h === h && (f = h), l[i] = h;
   }
   return l;
 }
 function Io(n, t, r, e, o, l, f, i) {
   if (o < f)
     return i.fill(NaN);
-  const a = 2 / (l + 1), s = 2 / (f + 1), u = n[0], c = t[0], N = r[0], h = e[0];
-  let m = 0;
+  const a = 2 / (l + 1), s = 2 / (f + 1), u = n[0], c = t[0], N = r[0], m = e[0];
+  let h = 0;
   const w = u - c;
-  w !== 0 && (m = (N - c - (u - N)) / w);
-  let d = m * h, A = d, b = d;
+  w !== 0 && (h = (N - c - (u - N)) / w);
+  let d = h * m, A = d, b = d;
   i[0] = NaN;
   for (let g = 1; g < f; g++) {
-    const F = n[g], x = t[g], I = r[g], y = e[g];
-    let M = 0;
-    const E = F - x;
-    E !== 0 && (M = (I - x - (F - I)) / E);
-    const _ = M * y;
+    const M = n[g], x = t[g], I = r[g], y = e[g];
+    let F = 0;
+    const E = M - x;
+    E !== 0 && (F = (I - x - (M - I)) / E);
+    const _ = F * y;
     d += _, A = A + a * (d - A), b = b + s * (d - b), i[g] = NaN;
   }
   i[f - 1] = A - b;
   for (let g = f; g < o; g++) {
-    const F = n[g], x = t[g], I = r[g], y = e[g];
-    let M = 0;
-    const E = F - x;
-    E !== 0 && (M = (I - x - (F - I)) / E);
-    const _ = M * y;
+    const M = n[g], x = t[g], I = r[g], y = e[g];
+    let F = 0;
+    const E = M - x;
+    E !== 0 && (F = (I - x - (M - I)) / E);
+    const _ = F * y;
     d += _, A = A + a * (d - A), b = b + s * (d - b), i[g] = A - b;
   }
   return i;
@@ -3547,16 +3586,16 @@ function Io(n, t, r, e, o, l, f, i) {
 function ko(n, t, r, e, o, l, f, i) {
   i.fill(NaN);
   const a = 2 / (l + 1), s = 2 / (f + 1);
-  let u = 0, c = NaN, N = NaN, h = 0;
-  for (let m = 0; m < o; m++) {
-    const w = n[m], v = t[m], d = r[m], A = e[m];
+  let u = 0, c = NaN, N = NaN, m = 0;
+  for (let h = 0; h < o; h++) {
+    const w = n[h], v = t[h], d = r[h], A = e[h];
     if (!(w === w && v === v && d === d && A === A))
       continue;
     const b = w - v;
     let g = 0;
     b !== 0 && (g = (d - v - (w - d)) / b);
-    const F = g * A;
-    u += F, h === 0 ? (c = u, N = u) : (c = c + a * (u - c), N = N + s * (u - N)), h++, h >= f && (i[m] = c - N);
+    const M = g * A;
+    u += M, m === 0 ? (c = u, N = u) : (c = c + a * (u - c), N = N + s * (u - N)), m++, m >= f && (i[h] = c - N);
   }
   return i;
 }
@@ -3568,11 +3607,11 @@ function _o(n, t, r, e, o, l, f = !0) {
   const i = r.length;
   if (n.length !== i || t.length !== i || e.length !== i)
     throw new Error("high, low, close and volume must have equal length");
-  f && !V() && !k(n, t, r, e) && (f = !1);
+  f && !S() && !k(n, t, r, e) && (f = !1);
   const a = new Float64Array(i);
   return i === 0 ? a : f ? ko(n, t, r, e, i, o, l, a) : Io(n, t, r, e, i, o, l, a);
 }
-function Vo(n, t, r, e, o) {
+function So(n, t, r, e, o) {
   if (o <= 0)
     throw new Error("Period must be positive");
   const l = r.length;
@@ -3582,16 +3621,16 @@ function Vo(n, t, r, e, o) {
   if (f.fill(NaN), l <= o)
     return f;
   const i = new Float64Array(o), a = new Float64Array(o), s = new Uint8Array(o);
-  let u = 0, c = 0, N = 0, m = (n[0] + t[0] + r[0]) / 3;
+  let u = 0, c = 0, N = 0, h = (n[0] + t[0] + r[0]) / 3;
   for (let v = 1; v < o; v++) {
     const d = (n[v] + t[v] + r[v]) / 3, A = d * e[v], b = Number.isFinite(A);
-    let g = 0, F = 0;
-    b ? d > m ? g = A : d < m && (F = A) : (s[v] = 1, N++), i[v] = g, a[v] = F, u += g, c += F, m = d;
+    let g = 0, M = 0;
+    b ? d > h ? g = A : d < h && (M = A) : (s[v] = 1, N++), i[v] = g, a[v] = M, u += g, c += M, h = d;
   }
   {
     const v = o, d = (n[v] + t[v] + r[v]) / 3, A = d * e[v], b = Number.isFinite(A);
-    let g = 0, F = 0;
-    if (b ? d > m ? g = A : d < m && (F = A) : (s[0] = 1, N++), i[0] = g, a[0] = F, u += g, c += F, Number.isFinite(d) && N === 0)
+    let g = 0, M = 0;
+    if (b ? d > h ? g = A : d < h && (M = A) : (s[0] = 1, N++), i[0] = g, a[0] = M, u += g, c += M, Number.isFinite(d) && N === 0)
       if (u + c === 0)
         f[v] = 50;
       else if (c === 0)
@@ -3600,13 +3639,13 @@ function Vo(n, t, r, e, o) {
         const I = u / c;
         f[v] = 100 - 100 / (1 + I);
       }
-    m = d;
+    h = d;
   }
   let w = 1;
   for (let v = o + 1; v < l; v++) {
     const d = (n[v] + t[v] + r[v]) / 3, A = d * e[v], b = Number.isFinite(A);
-    let g = 0, F = 0, x = 0;
-    if (b ? d > m ? g = A : d < m && (F = A) : x = 1, u += g - i[w], c += F - a[w], N += x - s[w], i[w] = g, a[w] = F, s[w] = x, w++, w === o && (w = 0), Number.isFinite(d) && N === 0)
+    let g = 0, M = 0, x = 0;
+    if (b ? d > h ? g = A : d < h && (M = A) : x = 1, u += g - i[w], c += M - a[w], N += x - s[w], i[w] = g, a[w] = M, s[w] = x, w++, w === o && (w = 0), Number.isFinite(d) && N === 0)
       if (u + c === 0)
         f[v] = 50;
       else if (c === 0)
@@ -3615,11 +3654,11 @@ function Vo(n, t, r, e, o) {
         const y = u / c;
         f[v] = 100 - 100 / (1 + y);
       }
-    m = d;
+    h = d;
   }
   return f;
 }
-function So(n, t) {
+function Vo(n, t) {
   const r = n.length;
   if (t.length !== r)
     throw new Error("price and volume must have same length");
@@ -3648,8 +3687,8 @@ function Lo(n, t, r = 1e3) {
   o.fill(NaN), l.fill(NaN);
   let f = -1;
   for (let c = 0; c < e; c++) {
-    const N = n[c], h = t[c];
-    if (N === N && h === h && N !== 0) {
+    const N = n[c], m = t[c];
+    if (N === N && m === m && N !== 0) {
       f = c;
       break;
     }
@@ -3660,11 +3699,11 @@ function Lo(n, t, r = 1e3) {
   o[f] = i, l[f] = a;
   let s = n[f], u = t[f];
   for (let c = f + 1; c < e; c++) {
-    const N = n[c], h = t[c];
-    if (!(N === N && h === h && N !== 0))
+    const N = n[c], m = t[c];
+    if (!(N === N && m === m && N !== 0))
       continue;
-    const m = (N - s) / s;
-    h > u && (i = i + m * i), h < u && (a = a + m * a), o[c] = i, l[c] = a, s = N, u = h;
+    const h = (N - s) / s;
+    m > u && (i = i + h * i), m < u && (a = a + h * a), o[c] = i, l[c] = a, s = N, u = m;
   }
   return [o, l];
 }
@@ -3703,7 +3742,7 @@ function Po(n, t, r, e = !0) {
   if (n.length !== o || t.length !== o)
     throw new Error("high, low and close must have equal length");
   const l = new Float64Array(o);
-  return o === 0 ? l : e && !V() && !k(n, t, r) || !e ? vt(n, t, r, o, l) : (l.fill(NaN), jo(n, t, r, o, l));
+  return o === 0 ? l : e && !S() && !k(n, t, r) || !e ? vt(n, t, r, o, l) : (l.fill(NaN), jo(n, t, r, o, l));
 }
 const Uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
@@ -3716,7 +3755,7 @@ const Uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   aroon: io,
   atr: ot,
   bb: Dt,
-  bbw: Mo,
+  bbw: Fo,
   cci: ao,
   change: pe,
   cmo: $e,
@@ -3725,7 +3764,7 @@ const Uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   crossunder: hn,
   dema: Yn,
   di: so,
-  donchian: Fo,
+  donchian: Mo,
   dpo: ho,
   dx: co,
   ema: xt,
@@ -3736,10 +3775,10 @@ const Uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   keltner: xo,
   kst: fo,
   macd: Je,
-  mfi: Vo,
+  mfi: So,
   mom: Qe,
   natr: wo,
-  obv: So,
+  obv: Vo,
   pnvi: Lo,
   ppo: Ze,
   psar: mo,
@@ -3747,7 +3786,7 @@ const Uo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   rma: at,
   roc: $,
   rsi: jt,
-  sma: P,
+  sma: O,
   stoch: eo,
   stochrsi: oo,
   supertrend: vo,