velo-plot 3.1.0 → 4.0.0-alpha.1

package/dist/plugins/forecasting.js

@@ -1,8 +1,9 @@
-function E(l) {
+import { e as D } from "../regression-HNdyk1Dm.js";
+function P(l) {
   return Array.from(l);
 }
-function D(l) {
-  const a = [
+function I(l) {
+  const i = [
     [0.5, 0.674],
     [0.68, 0.994],
     [0.8, 1.282],
@@ -12,41 +13,41 @@ function D(l) {
     [0.99, 2.576],
     [0.995, 2.807]
   ];
-  let o = a[0], e = 1 / 0;
-  for (const c of a) {
+  let s = i[0], n = 1 / 0;
+  for (const c of i) {
     const t = Math.abs(c[0] - l);
-    t < e && (e = t, o = c);
+    t < n && (n = t, s = c);
   }
-  return o[1];
+  return s[1];
 }
-function C(l, a, o, e, c = {}, t = 0.95) {
+function B(l, i, s, n, c = {}, t = 0.95) {
   const r = l.length;
   if (r === 0) throw new Error("Dataset is empty");
-  const s = E(a), n = E(l), i = r > 1 ? (n[r - 1] - n[0]) / (r - 1) : 1, m = n[r - 1];
-  let f;
-  switch (o) {
+  const o = P(i), e = P(l), a = r > 1 ? (e[r - 1] - e[0]) / (r - 1) : 1, w = e[r - 1];
+  let u;
+  switch (s) {
     case "sma":
-      f = X(s, e, c.windowSize || 10);
+      u = C(o, n, c.windowSize || 10);
       break;
     case "ema":
-      f = R(s, e, c.alpha ?? 0.3);
+      u = R(o, n, c.alpha ?? 0.3);
       break;
     case "linear":
-      f = j(n, s, e);
+      u = j(e, o, n);
       break;
     case "expSmoothing":
-      f = B(s, e, c.alpha ?? 0.3);
+      u = Y(o, n, c.alpha ?? 0.3);
       break;
     case "holt":
-      f = F(s, e, c.alpha ?? 0.3, c.beta ?? 0.1);
+      u = F(o, n, c.alpha ?? 0.3, c.beta ?? 0.1);
       break;
     case "wma":
-      f = W(s, e, c.windowSize || 10);
+      u = X(o, n, c.windowSize || 10);
       break;
     case "holtWinters":
-      f = Y(
-        s,
-        e,
+      u = H(
+        o,
+        n,
         c.period || 12,
         c.alpha ?? 0.3,
         c.beta ?? 0.1,
@@ -54,363 +55,377 @@ function C(l, a, o, e, c = {}, t = 0.95) {
       );
       break;
     case "arima":
-      f = H(
-        s,
-        e,
+      u = O(
+        o,
+        n,
         c.p ?? 1,
         c.d ?? 1,
         c.q ?? 0
       );
       break;
     default:
-      throw new Error(`Method ${o} not implemented yet`);
+      throw new Error(`Method ${s} not implemented yet`);
   }
-  const w = new Array(e);
-  for (let S = 0; S < e; S++)
-    w[S] = m + (S + 1) * i;
-  const u = J(s, f.fitted), y = D(t), h = u.rmse, { lower: v, upper: x } = I(
-    f.yValues,
+  const g = new Array(n);
+  for (let p = 0; p < n; p++)
+    g[p] = w + (p + 1) * a;
+  const f = K(o, u.fitted), y = I(t), h = f.rmse, { lower: v, upper: b } = W(
+    u.yValues,
     h,
     y,
-    f.accumulates
+    u.accumulates
   );
   return {
-    xValues: w,
-    yValues: f.yValues,
+    xValues: g,
+    yValues: u.yValues,
     lowerBound: v,
-    upperBound: x,
-    method: o,
-    metadata: { ...u, confidence: t }
+    upperBound: b,
+    method: s,
+    metadata: { ...f, confidence: t }
   };
 }
-function I(l, a, o, e) {
+function W(l, i, s, n) {
   const c = new Array(l.length), t = new Array(l.length);
   for (let r = 0; r < l.length; r++) {
-    const s = e ? Math.sqrt(r + 1) : 1, n = o * a * s;
-    c[r] = l[r] - n, t[r] = l[r] + n;
+    const o = n ? Math.sqrt(r + 1) : 1, e = s * i * o;
+    c[r] = l[r] - e, t[r] = l[r] + e;
   }
   return { lower: c, upper: t };
 }
-function W(l, a, o) {
-  const e = l.length, c = Math.min(o, e), t = (n) => {
-    const i = Math.min(c, n);
-    let m = 0, f = 0;
-    for (let w = 0; w < i; w++) {
-      const u = w + 1;
-      m += l[n - i + w] * u, f += u;
+function X(l, i, s) {
+  const n = l.length, c = Math.min(s, n), t = (e) => {
+    const a = Math.min(c, e);
+    let w = 0, u = 0;
+    for (let g = 0; g < a; g++) {
+      const f = g + 1;
+      w += l[e - a + g] * f, u += f;
     }
-    return m / f;
-  }, r = new Array(e).fill(null);
-  for (let n = 1; n < e; n++) r[n] = t(n);
-  const s = t(e);
-  return { yValues: new Array(a).fill(s), fitted: r, accumulates: !1 };
+    return w / u;
+  }, r = new Array(n).fill(null);
+  for (let e = 1; e < n; e++) r[e] = t(e);
+  const o = t(n);
+  return { yValues: new Array(i).fill(o), fitted: r, accumulates: !1 };
 }
-function X(l, a, o) {
-  const e = l.length, c = Math.min(o, e), t = (n) => {
-    const i = Math.min(c, n);
-    let m = 0;
-    for (let f = n - i; f < n; f++) m += l[f];
-    return m / i;
-  }, r = new Array(e).fill(null);
-  for (let n = 1; n < e; n++) r[n] = t(n);
-  const s = t(e);
-  return { yValues: new Array(a).fill(s), fitted: r, accumulates: !1 };
+function C(l, i, s) {
+  const n = l.length, c = Math.min(s, n), t = (e) => {
+    const a = Math.min(c, e);
+    let w = 0;
+    for (let u = e - a; u < e; u++) w += l[u];
+    return w / a;
+  }, r = new Array(n).fill(null);
+  for (let e = 1; e < n; e++) r[e] = t(e);
+  const o = t(n);
+  return { yValues: new Array(i).fill(o), fitted: r, accumulates: !1 };
 }
-function R(l, a, o) {
-  const e = l.length;
+function R(l, i, s) {
+  const n = l.length;
   let c = l[0];
-  const t = new Array(e).fill(null);
-  for (let r = 1; r < e; r++)
-    t[r] = c, c = o * l[r] + (1 - o) * c;
-  return { yValues: new Array(a).fill(c), fitted: t, accumulates: !1 };
+  const t = new Array(n).fill(null);
+  for (let r = 1; r < n; r++)
+    t[r] = c, c = s * l[r] + (1 - s) * c;
+  return { yValues: new Array(i).fill(c), fitted: t, accumulates: !1 };
 }
-function j(l, a, o) {
-  const e = l.length;
-  let c = 0, t = 0, r = 0, s = 0;
-  for (let h = 0; h < e; h++)
-    c += l[h], t += a[h], r += l[h] * a[h], s += l[h] * l[h];
-  const n = e * s - c * c, i = n !== 0 ? (e * r - c * t) / n : 0, m = (t - i * c) / e, f = new Array(e);
-  for (let h = 0; h < e; h++) f[h] = i * l[h] + m;
-  const w = l[e - 1], u = e > 1 ? (l[e - 1] - l[0]) / (e - 1) : 1, y = new Array(o);
-  for (let h = 0; h < o; h++) {
-    const v = w + (h + 1) * u;
-    y[h] = i * v + m;
+function j(l, i, s) {
+  const n = l.length;
+  let c = 0, t = 0, r = 0, o = 0;
+  for (let h = 0; h < n; h++)
+    c += l[h], t += i[h], r += l[h] * i[h], o += l[h] * l[h];
+  const e = n * o - c * c, a = e !== 0 ? (n * r - c * t) / e : 0, w = (t - a * c) / n, u = new Array(n);
+  for (let h = 0; h < n; h++) u[h] = a * l[h] + w;
+  const g = l[n - 1], f = n > 1 ? (l[n - 1] - l[0]) / (n - 1) : 1, y = new Array(s);
+  for (let h = 0; h < s; h++) {
+    const v = g + (h + 1) * f;
+    y[h] = a * v + w;
   }
-  return { yValues: y, fitted: f, accumulates: !0 };
+  return { yValues: y, fitted: u, accumulates: !0 };
 }
-function B(l, a, o) {
-  const e = l.length;
+function Y(l, i, s) {
+  const n = l.length;
   let c = l[0];
-  const t = new Array(e).fill(null);
-  for (let r = 1; r < e; r++)
-    t[r] = c, c = o * l[r] + (1 - o) * c;
-  return { yValues: new Array(a).fill(c), fitted: t, accumulates: !1 };
+  const t = new Array(n).fill(null);
+  for (let r = 1; r < n; r++)
+    t[r] = c, c = s * l[r] + (1 - s) * c;
+  return { yValues: new Array(i).fill(c), fitted: t, accumulates: !1 };
 }
-function F(l, a, o, e) {
+function F(l, i, s, n) {
   const c = l.length;
   if (c < 2)
-    return { yValues: new Array(a).fill(l[0] || 0), fitted: [], accumulates: !0 };
+    return { yValues: new Array(i).fill(l[0] || 0), fitted: [], accumulates: !0 };
   let t = l[0], r = l[1] - l[0];
-  const s = new Array(c).fill(null);
-  for (let i = 1; i < c; i++) {
-    s[i] = t + r;
-    const m = t;
-    t = o * l[i] + (1 - o) * (t + r), r = e * (t - m) + (1 - e) * r;
+  const o = new Array(c).fill(null);
+  for (let a = 1; a < c; a++) {
+    o[a] = t + r;
+    const w = t;
+    t = s * l[a] + (1 - s) * (t + r), r = n * (t - w) + (1 - n) * r;
   }
-  const n = new Array(a);
-  for (let i = 0; i < a; i++) n[i] = t + (i + 1) * r;
-  return { yValues: n, fitted: s, accumulates: !0 };
+  const e = new Array(i);
+  for (let a = 0; a < i; a++) e[a] = t + (a + 1) * r;
+  return { yValues: e, fitted: o, accumulates: !0 };
 }
-function Y(l, a, o, e, c, t) {
+function H(l, i, s, n, c, t) {
   const r = l.length;
-  if (r < o * 2)
-    return F(l, a, e, c);
-  const s = new Array(o), n = new Array(Math.floor(r / o));
-  for (let u = 0; u < n.length; u++) {
+  if (r < s * 2)
+    return F(l, i, n, c);
+  const o = new Array(s), e = new Array(Math.floor(r / s));
+  for (let f = 0; f < e.length; f++) {
     let y = 0;
-    for (let h = 0; h < o; h++) y += l[u * o + h];
-    n[u] = y / o;
+    for (let h = 0; h < s; h++) y += l[f * s + h];
+    e[f] = y / s;
   }
-  for (let u = 0; u < o; u++) {
+  for (let f = 0; f < s; f++) {
     let y = 0;
-    for (let h = 0; h < n.length; h++)
-      y += l[h * o + u] - n[h];
-    s[u] = y / n.length;
+    for (let h = 0; h < e.length; h++)
+      y += l[h * s + f] - e[h];
+    o[f] = y / e.length;
   }
-  let i = n[0], m = (n[n.length - 1] - n[0]) / ((n.length - 1) * o);
-  const f = new Array(r).fill(null);
-  for (let u = 0; u < r; u++) {
-    const y = s[u % o];
-    u > 0 && (f[u] = i + m + y);
-    const h = i, v = l[u];
-    i = e * (v - y) + (1 - e) * (i + m), m = c * (i - h) + (1 - c) * m, s[u % o] = t * (v - i) + (1 - t) * y;
+  let a = e[0], w = (e[e.length - 1] - e[0]) / ((e.length - 1) * s);
+  const u = new Array(r).fill(null);
+  for (let f = 0; f < r; f++) {
+    const y = o[f % s];
+    f > 0 && (u[f] = a + w + y);
+    const h = a, v = l[f];
+    a = n * (v - y) + (1 - n) * (a + w), w = c * (a - h) + (1 - c) * w, o[f % s] = t * (v - a) + (1 - t) * y;
   }
-  const w = new Array(a);
-  for (let u = 0; u < a; u++) {
-    const y = u + 1;
-    w[u] = i + y * m + s[(r + u) % o];
+  const g = new Array(i);
+  for (let f = 0; f < i; f++) {
+    const y = f + 1;
+    g[f] = a + y * w + o[(r + f) % s];
   }
-  return { yValues: w, fitted: f, accumulates: !0 };
+  return { yValues: g, fitted: u, accumulates: !0 };
 }
-function H(l, a, o, e, c) {
-  const t = l.length, r = Math.max(o, c);
-  if (t < e + r + 2 || t < 4)
-    return F(l, a, 0.3, 0.1);
-  const s = [l.slice()];
-  for (let g = 0; g < e; g++)
-    s.push($(s[g]));
-  const n = s[e], i = n.length, m = n.reduce((g, A) => g + A, 0) / i, f = n.map((g) => g - m);
-  let w = new Array(i).fill(0);
+function O(l, i, s, n, c) {
+  const t = l.length, r = Math.max(s, c);
+  if (t < n + r + 2 || t < 4)
+    return F(l, i, 0.3, 0.1);
+  const o = [l.slice()];
+  for (let m = 0; m < n; m++)
+    o.push(_(o[m]));
+  const e = o[n], a = e.length, w = e.reduce((m, A) => m + A, 0) / a, u = e.map((m) => m - w);
+  let g = new Array(a).fill(0);
   if (c > 0) {
-    const g = Math.min(Math.max(o + c + 2, 5), Math.floor(i / 2)), { residuals: A } = _(f, g);
-    w = A;
+    const m = Math.min(Math.max(s + c + 2, 5), Math.floor(a / 2)), { residuals: A } = G(u, m);
+    g = A;
   }
-  const u = Math.max(o, c), y = [], h = [];
-  for (let g = u; g < i; g++) {
+  const f = Math.max(s, c), y = [], h = [];
+  for (let m = f; m < a; m++) {
     const A = [];
-    for (let d = 1; d <= o; d++) A.push(f[g - d]);
-    for (let d = 1; d <= c; d++) A.push(w[g - d]);
-    y.push(A), h.push(f[g]);
+    for (let d = 1; d <= s; d++) A.push(u[m - d]);
+    for (let d = 1; d <= c; d++) A.push(g[m - d]);
+    y.push(A), h.push(u[m]);
   }
   let v = [];
-  if (y.length > 0 && y[0].length > 0 && (v = L(y, h)), v.length !== o + c || v.some((g) => !Number.isFinite(g)))
-    return F(l, a, 0.3, 0.1);
-  const x = v.slice(0, o), S = v.slice(o, o + c), k = new Array(t).fill(null), T = new Array(i).fill(0);
-  for (let g = u; g < i; g++) {
+  if (y.length > 0 && y[0].length > 0 && (v = L(y, h)), v.length !== s + c || v.some((m) => !Number.isFinite(m)))
+    return F(l, i, 0.3, 0.1);
+  const b = v.slice(0, s), p = v.slice(s, s + c), k = new Array(t).fill(null), V = new Array(a).fill(0);
+  for (let m = f; m < a; m++) {
     let A = 0;
-    for (let d = 1; d <= o; d++) A += x[d - 1] * f[g - d];
-    for (let d = 1; d <= c; d++) A += S[d - 1] * T[g - d];
-    T[g] = f[g] - A, k[g + (t - i)] = O(s, e, g, A + m);
+    for (let d = 1; d <= s; d++) A += b[d - 1] * u[m - d];
+    for (let d = 1; d <= c; d++) A += p[d - 1] * V[m - d];
+    V[m] = u[m] - A, k[m + (t - a)] = N(o, n, m, A + w);
   }
-  const V = f.slice(), b = T.slice(), p = [];
-  for (let g = 0; g < a; g++) {
+  const T = u.slice(), S = V.slice(), x = [];
+  for (let m = 0; m < i; m++) {
     let A = 0;
-    for (let d = 1; d <= o; d++)
-      A += x[d - 1] * V[V.length - d];
+    for (let d = 1; d <= s; d++)
+      A += b[d - 1] * T[T.length - d];
     for (let d = 1; d <= c; d++)
-      A += S[d - 1] * b[b.length - d];
-    V.push(A), b.push(0), p.push(A + m);
+      A += p[d - 1] * S[S.length - d];
+    T.push(A), S.push(0), x.push(A + w);
   }
-  return { yValues: N(s, e, p), fitted: k, accumulates: !0 };
+  return { yValues: $(o, n, x), fitted: k, accumulates: !0 };
 }
-function $(l) {
-  const a = new Array(l.length - 1);
-  for (let o = 1; o < l.length; o++) a[o - 1] = l[o] - l[o - 1];
-  return a;
+function _(l) {
+  const i = new Array(l.length - 1);
+  for (let s = 1; s < l.length; s++) i[s - 1] = l[s] - l[s - 1];
+  return i;
 }
-function N(l, a, o) {
-  let e = o.slice();
-  for (let c = a; c >= 1; c--) {
+function $(l, i, s) {
+  let n = s.slice();
+  for (let c = i; c >= 1; c--) {
     const t = l[c - 1];
     let r = t[t.length - 1];
-    const s = new Array(e.length);
-    for (let n = 0; n < e.length; n++)
-      r += e[n], s[n] = r;
-    e = s;
+    const o = new Array(n.length);
+    for (let e = 0; e < n.length; e++)
+      r += n[e], o[e] = r;
+    n = o;
   }
-  return e;
+  return n;
 }
-function O(l, a, o, e) {
-  return a === 0 ? e : l[a - 1][o] + e;
+function N(l, i, s, n) {
+  return i === 0 ? n : l[i - 1][s] + n;
 }
-function _(l, a) {
-  const o = l.length, e = [], c = [];
-  for (let s = a; s < o; s++) {
-    const n = [];
-    for (let i = 1; i <= a; i++) n.push(l[s - i]);
-    e.push(n), c.push(l[s]);
+function G(l, i) {
+  const s = l.length, n = [], c = [];
+  for (let o = i; o < s; o++) {
+    const e = [];
+    for (let a = 1; a <= i; a++) e.push(l[o - a]);
+    n.push(e), c.push(l[o]);
   }
-  const t = e.length > 0 ? L(e, c) : new Array(a).fill(0), r = new Array(o).fill(0);
-  for (let s = a; s < o; s++) {
-    let n = 0;
-    for (let i = 1; i <= a; i++) n += (t[i - 1] || 0) * l[s - i];
-    r[s] = l[s] - n;
+  const t = n.length > 0 ? L(n, c) : new Array(i).fill(0), r = new Array(s).fill(0);
+  for (let o = i; o < s; o++) {
+    let e = 0;
+    for (let a = 1; a <= i; a++) e += (t[a - 1] || 0) * l[o - a];
+    r[o] = l[o] - e;
   }
   return { coeffs: t, residuals: r };
 }
-function L(l, a) {
-  const o = l.length, e = l[0].length, c = Array.from({ length: e }, () => new Array(e).fill(0)), t = new Array(e).fill(0);
-  for (let r = 0; r < o; r++)
-    for (let s = 0; s < e; s++) {
-      t[s] += l[r][s] * a[r];
-      for (let n = 0; n < e; n++)
-        c[s][n] += l[r][s] * l[r][n];
+function L(l, i) {
+  const s = l.length, n = l[0].length, c = Array.from({ length: n }, () => new Array(n).fill(0)), t = new Array(n).fill(0);
+  for (let r = 0; r < s; r++)
+    for (let o = 0; o < n; o++) {
+      t[o] += l[r][o] * i[r];
+      for (let e = 0; e < n; e++)
+        c[o][e] += l[r][o] * l[r][e];
     }
-  for (let r = 0; r < e; r++) c[r][r] += 1e-8;
-  return G(c, t);
+  for (let r = 0; r < n; r++) c[r][r] += 1e-8;
+  return J(c, t);
 }
-function G(l, a) {
-  const o = a.length, e = l.map((t, r) => [...t, a[r]]);
-  for (let t = 0; t < o; t++) {
+function J(l, i) {
+  const s = i.length, n = l.map((t, r) => [...t, i[r]]);
+  for (let t = 0; t < s; t++) {
     let r = t;
-    for (let s = t + 1; s < o; s++)
-      Math.abs(e[s][t]) > Math.abs(e[r][t]) && (r = s);
-    if (Math.abs(e[r][t]) < 1e-12) return [];
-    [e[t], e[r]] = [e[r], e[t]];
-    for (let s = 0; s < o; s++) {
-      if (s === t) continue;
-      const n = e[s][t] / e[t][t];
-      for (let i = t; i <= o; i++) e[s][i] -= n * e[t][i];
+    for (let o = t + 1; o < s; o++)
+      Math.abs(n[o][t]) > Math.abs(n[r][t]) && (r = o);
+    if (Math.abs(n[r][t]) < 1e-12) return [];
+    [n[t], n[r]] = [n[r], n[t]];
+    for (let o = 0; o < s; o++) {
+      if (o === t) continue;
+      const e = n[o][t] / n[t][t];
+      for (let a = t; a <= s; a++) n[o][a] -= e * n[t][a];
     }
   }
-  const c = new Array(o);
-  for (let t = 0; t < o; t++) c[t] = e[t][o] / e[t][t];
+  const c = new Array(s);
+  for (let t = 0; t < s; t++) c[t] = n[t][s] / n[t][t];
   return c;
 }
-function J(l, a) {
-  if (!a || a.length === 0)
+function K(l, i) {
+  if (!i || i.length === 0)
     return { mse: 0, rmse: 0, mae: 0, r2: 0 };
-  let o = 0, e = 0, c = 0;
+  let s = 0, n = 0, c = 0;
   const t = [];
-  for (let w = 0; w < a.length && w < l.length; w++) {
-    const u = a[w];
-    if (u == null || !Number.isFinite(u)) continue;
-    const y = l[w] - u;
-    o += y * y, e += Math.abs(y), t.push(l[w]), c++;
+  for (let g = 0; g < i.length && g < l.length; g++) {
+    const f = i[g];
+    if (f == null || !Number.isFinite(f)) continue;
+    const y = l[g] - f;
+    s += y * y, n += Math.abs(y), t.push(l[g]), c++;
   }
   if (c === 0) return { mse: 0, rmse: 0, mae: 0, r2: 0 };
-  const r = o / c, s = Math.sqrt(r), n = e / c, i = t.reduce((w, u) => w + u, 0) / t.length, m = t.reduce((w, u) => w + (u - i) * (u - i), 0), f = m > 0 ? 1 - o / m : 0;
+  const r = s / c, o = Math.sqrt(r), e = n / c, a = t.reduce((g, f) => g + f, 0) / t.length, w = t.reduce((g, f) => g + (f - a) * (f - a), 0), u = w > 0 ? 1 - s / w : 0;
   return {
-    mse: P(r),
-    rmse: P(s),
-    mae: P(n),
-    r2: P(f)
+    mse: E(r),
+    rmse: E(o),
+    mae: E(e),
+    r2: E(u)
   };
 }
-function P(l) {
+function E(l) {
   return Math.round(l * 1e6) / 1e6;
 }
-const K = {
+const Q = {
   name: "velo-plot-forecasting",
   version: "1.0.0",
   description: "Time series forecasting for velo-plot",
   provides: ["analysis", "forecasting"],
   tags: ["statistics", "forecasting", "analysis"]
 };
-function Q(l = {}) {
-  let a = null;
-  const o = /* @__PURE__ */ new Map(), e = {
+function Z(l = {}) {
+  let i = null;
+  const s = /* @__PURE__ */ new Map(), n = {
     forecast(t, r) {
-      let s, n;
+      let o, e;
       if (typeof t == "string") {
-        if (!a) throw new Error("Plugin not initialized");
-        const i = a.data.getAllSeries().find((f) => f.getId() === t);
-        if (!i) throw new Error(`Series not found: ${t}`);
-        const m = i.getData();
-        s = m.x, n = m.y;
+        if (!i) throw new Error("Plugin not initialized");
+        const a = i.data.getAllSeries().find((u) => u.getId() === t);
+        if (!a) throw new Error(`Series not found: ${t}`);
+        const w = a.getData();
+        o = w.x, e = w.y;
       } else if (Array.isArray(t))
-        n = t, s = t.map((i, m) => m);
+        e = t, o = t.map((a, w) => w);
       else if (t.x && t.y)
-        s = t.x, n = t.y;
+        o = t.x, e = t.y;
       else
         throw new Error("Invalid data format for forecasting");
-      return C(s, n, r.method, r.horizon, r.params, r.confidence);
+      return B(o, e, r.method, r.horizon, r.params, r.confidence);
     },
     async forecastSeries(t, r) {
-      if (!a) throw new Error("Plugin not initialized");
-      const s = a.data.getAllSeries().find((i) => i.getId() === t);
-      if (!s) throw new Error(`Series not found: ${t}`);
-      const n = s.getData();
-      return this.forecast(n, r);
+      if (!i) throw new Error("Plugin not initialized");
+      const o = i.data.getAllSeries().find((a) => a.getId() === t);
+      if (!o) throw new Error(`Series not found: ${t}`);
+      const e = o.getData();
+      return this.forecast(e, r);
     },
     visualize(t, r = {}) {
-      const s = `forecast-${Math.random().toString(36).substr(2, 9)}`, n = {
+      const o = `forecast-${Math.random().toString(36).substr(2, 9)}`, e = {
         showLine: !0,
         showConfidenceInterval: !0,
         ...l.defaultVisualization,
         ...r
       };
-      return o.set(s, { result: t, config: n }), a == null || a.requestRender(), s;
+      return s.set(o, { result: t, config: e }), i == null || i.requestRender(), o;
     },
     clear(t) {
-      t ? o.delete(t) : o.clear(), a == null || a.requestRender();
+      t ? s.delete(t) : s.clear(), i == null || i.requestRender();
     }
   };
   function c(t) {
-    const { render: r, coords: s } = t, { ctx2d: n } = r;
-    n && o.forEach((i) => {
-      var v, x, S, k, T, V;
-      const { result: m, config: f } = i, { xValues: w, yValues: u, lowerBound: y, upperBound: h } = m;
-      if (n.save(), f.showConfidenceInterval && y && h) {
-        n.beginPath();
-        const b = ((v = f.intervalStyle) == null ? void 0 : v.opacity) ?? 0.15, p = ((x = f.intervalStyle) == null ? void 0 : x.fillColor) || ((S = f.lineStyle) == null ? void 0 : S.color) || "#3b82f6";
-        n.fillStyle = p.startsWith("rgba") ? p : p + Math.floor(b * 255).toString(16).padStart(2, "0");
-        for (let M = 0; M < w.length; M++) {
-          const g = s.dataToPixelX(w[M]), A = s.dataToPixelY(h[M]);
-          M === 0 ? n.moveTo(g, A) : n.lineTo(g, A);
+    const { render: r, coords: o } = t, { ctx2d: e } = r;
+    e && s.forEach((a) => {
+      var v, b, p, k, V, T;
+      const { result: w, config: u } = a, { xValues: g, yValues: f, lowerBound: y, upperBound: h } = w;
+      if (e.save(), u.showConfidenceInterval && y && h) {
+        e.beginPath();
+        const S = ((v = u.intervalStyle) == null ? void 0 : v.opacity) ?? 0.15, x = ((b = u.intervalStyle) == null ? void 0 : b.fillColor) || ((p = u.lineStyle) == null ? void 0 : p.color) || "#3b82f6";
+        e.fillStyle = x.startsWith("rgba") ? x : x + Math.floor(S * 255).toString(16).padStart(2, "0");
+        for (let M = 0; M < g.length; M++) {
+          const m = o.dataToPixelX(g[M]), A = o.dataToPixelY(h[M]);
+          M === 0 ? e.moveTo(m, A) : e.lineTo(m, A);
         }
-        for (let M = w.length - 1; M >= 0; M--) {
-          const g = s.dataToPixelX(w[M]), A = s.dataToPixelY(y[M]);
-          n.lineTo(g, A);
+        for (let M = g.length - 1; M >= 0; M--) {
+          const m = o.dataToPixelX(g[M]), A = o.dataToPixelY(y[M]);
+          e.lineTo(m, A);
         }
-        n.closePath(), n.fill();
+        e.closePath(), e.fill();
       }
-      if (f.showLine) {
-        n.beginPath(), n.strokeStyle = ((k = f.lineStyle) == null ? void 0 : k.color) || "#3b82f6", n.lineWidth = ((T = f.lineStyle) == null ? void 0 : T.width) || 2, (V = f.lineStyle) != null && V.dash ? n.setLineDash(f.lineStyle.dash) : n.setLineDash([5, 5]);
-        for (let b = 0; b < w.length; b++) {
-          const p = s.dataToPixelX(w[b]), M = s.dataToPixelY(u[b]);
-          b === 0 ? n.moveTo(p, M) : n.lineTo(p, M);
+      if (u.showLine) {
+        e.beginPath(), e.strokeStyle = ((k = u.lineStyle) == null ? void 0 : k.color) || "#3b82f6", e.lineWidth = ((V = u.lineStyle) == null ? void 0 : V.width) || 2, (T = u.lineStyle) != null && T.dash ? e.setLineDash(u.lineStyle.dash) : e.setLineDash([5, 5]);
+        for (let S = 0; S < g.length; S++) {
+          const x = o.dataToPixelX(g[S]), M = o.dataToPixelY(f[S]);
+          S === 0 ? e.moveTo(x, M) : e.lineTo(x, M);
         }
-        n.stroke();
+        e.stroke();
       }
-      n.restore();
+      e.restore();
     });
   }
   return {
-    manifest: K,
+    manifest: Q,
     onInit(t) {
-      a = t;
+      i = t;
     },
     onRenderOverlay(t, r) {
       c(t);
     },
-    api: e
+    onExportSVG(t) {
+      var r;
+      !t.builder || ((r = t.exportContext) == null ? void 0 : r.options.includeOverlays) === !1 || s.forEach(({ result: o, config: e }) => {
+        var v;
+        const { xValues: a, yValues: w, lowerBound: u, upperBound: g } = o, f = a.length, y = [];
+        for (let b = 0; b < f; b++)
+          y.push({ x: a[b], y: w[b] });
+        const h = e.showConfidenceInterval && u && g ? {
+          upper: Array.from({ length: f }, (b, p) => ({ x: a[p], y: g[p] })),
+          lower: Array.from({ length: f }, (b, p) => ({ x: a[p], y: u[p] }))
+        } : void 0;
+        D(t, y, h, ((v = e.lineStyle) == null ? void 0 : v.color) ?? "#3b82f6");
+      });
+    },
+    api: n
   };
 }
 export {
-  Q as PluginForecasting,
-  C as calculateForecast,
-  G as gaussianSolve,
-  K as manifestForecasting
+  Z as PluginForecasting,
+  B as calculateForecast,
+  J as gaussianSolve,
+  Q as manifestForecasting
 };
 //# sourceMappingURL=forecasting.js.map