@wick-charts/vue 0.8.1 → 0.8.2

package/dist/core/dist/data/decimation.js

@@ -1,73 +1,74 @@
-function D(t, h) {
-  return t.length <= h ? t : v(
+function k(t, n) {
+  return t.length <= n ? t : D(
     t,
-    h,
-    (l) => l.time,
-    (l) => l.value
+    n,
+    (h) => h.time,
+    (h) => h.value
   );
 }
-function k(t, h) {
-  if (t.length <= h) return t;
-  const l = Math.ceil(t.length / h), u = [];
-  for (let o = 0; o < t.length; o += l) {
-    const n = Math.min(o + l, t.length);
+function x(t, n) {
+  if (t.length <= n) return t;
+  const h = Math.ceil(t.length / n), a = [];
+  for (let l = 0; l < t.length; l += h) {
+    const o = Math.min(l + h, t.length);
     let s = -1 / 0, i = 1 / 0, c = 0;
-    for (let r = o; r < n; r++)
-      t[r].high > s && (s = t[r].high), t[r].low < i && (i = t[r].low), c += t[r].volume ?? 0;
-    u.push({
-      time: t[o].time,
-      open: t[o].open,
+    for (let e = l; e < o; e++)
+      t[e].high > s && (s = t[e].high), t[e].low < i && (i = t[e].low), c += t[e].volume ?? 0;
+    a.push({
+      time: t[l].time,
+      open: t[l].open,
       high: s,
       low: i,
-      close: t[n - 1].close,
+      close: t[o - 1].close,
       volume: c
     });
   }
-  return u;
+  return a;
 }
-function x(t, h) {
-  if (t.length <= h || h < 3) return t;
-  const l = t.length - 1, u = Math.ceil((t.length - 2) / (h - 2)), o = [t[0]];
-  for (let n = 1; n < l; n += u) {
-    const s = Math.min(n + u, l);
-    let i = 1 / 0, c = -1 / 0, r = !1;
-    for (let f = n; f < s; f++) {
-      const a = t[f];
-      if (!Number.isFinite(a.low) || !Number.isFinite(a.high)) {
-        r = !0;
+function L(t, n) {
+  if (t.length <= n || n < 3) return t;
+  const h = t.length - 1, a = Math.ceil((t.length - 2) / (n - 2)), l = [t[0]];
+  for (let o = 1; o < h; o += a) {
+    const s = Math.min(o + a, h);
+    let i = 1 / 0, c = -1 / 0, e = !1;
+    for (let m = o; m < s; m++) {
+      const r = t[m];
+      if (!Number.isFinite(r.low) || !Number.isFinite(r.high)) {
+        e = !0;
         break;
       }
-      a.low < i && (i = a.low), a.high > c && (c = a.high);
+      r.low < i && (i = r.low), r.high > c && (c = r.high);
     }
-    o.push(r ? { time: t[n].time, low: Number.NaN, high: Number.NaN } : { time: t[n].time, low: i, high: c });
+    l.push(e ? { time: t[o].time, low: Number.NaN, high: Number.NaN } : { time: t[o].time, low: i, high: c });
   }
-  return o.push(t[l]), o;
+  return l.push(t[h]), l;
 }
-function v(t, h, l, u) {
-  if (h >= t.length || h < 3) return t;
-  const o = [t[0]], n = (t.length - 2) / (h - 2);
+function D(t, n, h, a) {
+  if (n >= t.length || n < 3) return t;
+  const l = [t[0]], o = (t.length - 2) / (n - 2);
   let s = 0;
-  for (let i = 0; i < h - 2; i++) {
-    const c = Math.floor((i + 1) * n) + 1, r = Math.min(Math.floor((i + 2) * n) + 1, t.length - 1);
-    let f = 0, a = 0;
-    const M = r, p = Math.min(Math.floor((i + 3) * n) + 1, t.length), g = p - M;
-    if (g > 0) {
-      for (let e = M; e < p; e++)
-        f += l(t[e]), a += u(t[e]);
-      f /= g, a /= g;
+  for (let i = 0; i < n - 2; i++) {
+    const c = Math.floor((i + 1) * o) + 1, e = Math.min(Math.floor((i + 2) * o) + 1, t.length - 1), m = h(t[s]), r = a(t[s]), p = Number.isFinite(r);
+    let g = 0, N = 0, b = 0;
+    const d = e, v = Math.min(Math.floor((i + 3) * o) + 1, t.length);
+    for (let u = d; u < v; u++) {
+      const f = a(t[u]);
+      Number.isFinite(f) && (g += h(t[u]), N += f, b++);
     }
-    let w = -1, m = c;
-    const N = l(t[s]), b = u(t[s]);
-    for (let e = c; e < r; e++) {
-      const d = Math.abs((N - f) * (u(t[e]) - b) - (N - l(t[e])) * (a - b));
-      d > w && (w = d, m = e);
+    b > 0 ? (g /= b, N /= b) : (g = m, N = p ? r : 0);
+    let w = -1, M = c;
+    for (let u = c; u < e; u++) {
+      const f = a(t[u]);
+      if (!Number.isFinite(f)) continue;
+      const F = p ? Math.abs((m - g) * (f - r) - (m - h(t[u])) * (N - r)) : 0;
+      F > w && (w = F, M = u);
     }
-    o.push(t[m]), s = m;
+    l.push(t[M]), s = M;
   }
-  return o.push(t[t.length - 1]), o;
+  return l.push(t[t.length - 1]), l;
 }
 export {
-  x as decimateBandData,
-  D as decimateLineData,
-  k as decimateOHLCData
+  L as decimateBandData,
+  k as decimateLineData,
+  x as decimateOHLCData
 };

package/dist/core/dist/data/store.js

@@ -1,10 +1,16 @@
-import { EventEmitter as d } from "../events.js";
+import { EventEmitter as l } from "../events.js";
 import { binarySearch as n } from "../utils/math.js";
-class u extends d {
+class u extends l {
   data = [];
   _visible = !0;
   cachedRange = null;
   cachedResult = [];
+  // Points `trimStart` dropped, oldest first. A view whose left edge is older
+  // than the kept head still draws them, so a rolling window slides out of view.
+  exited = [];
+  // Leftmost `from` read since the last trim: older exited points are out of every view since then.
+  lowestReadFrom = Number.POSITIVE_INFINITY;
+  appendedSinceTrim = 0;
   // Dev-only, warn-once-per-instance: these two conditions are almost always
   // a persistent bug in the caller's feed (not a one-off), so a per-call
   // warning would just spam the console on every tick.
@@ -25,7 +31,7 @@ class u extends d {
       }
     !a && process.env.NODE_ENV !== "production" && !this.warnedUnsorted && (this.warnedUnsorted = !0, console.warn(
       "[wick-charts] data is not sorted by time — re-sorting on every setData() call is wasted work. Sort your feed by `time` ascending before passing it in."
-    )), this.data = a ? t.slice() : [...t].sort((e, i) => e.time - i.time), this.cachedRange = null, this.emit("update");
+    )), this.data = a ? t.slice() : [...t].sort((e, s) => e.time - s.time), this.exited = [], this.appendedSinceTrim = 0, this.cachedRange = null, this.emit("update");
   }
   append(t) {
     if (this.data.length > 0 && t.time <= this.data[this.data.length - 1].time) {
@@ -34,7 +40,7 @@ class u extends d {
       )), this.updateLast(t);
       return;
     }
-    this.data.push(t), this.cachedRange = null, this.emit("update");
+    this.data.push(t), this.appendedSinceTrim++, this.cachedRange = null, this.emit("update");
   }
   updateLast(t) {
     this.data.length !== 0 && (this.data[this.data.length - 1] = t, this.cachedRange = null, this.emit("update"));
@@ -47,16 +53,22 @@ class u extends d {
    * is already validated and no re-sort is needed here. No-op on empty input.
    */
   prepend(t) {
-    t.length !== 0 && (this.data = t.concat(this.data), this.cachedRange = null, this.emit("update"));
+    t.length !== 0 && (this.data = t.concat(this.data), this.exited = [], this.cachedRange = null, this.emit("update"));
   }
   trimStart(t) {
-    if (!(t <= 0 || this.data.length === 0)) {
-      if (t >= this.data.length) {
-        this.data = [], this.cachedRange = null, this.emit("update");
-        return;
-      }
-      this.data = this.data.slice(t), this.cachedRange = null, this.emit("update");
-    }
+    if (t <= 0 || this.data.length === 0) return;
+    const a = this.data.slice(0, t), e = a.slice(Math.max(0, a.length - this.appendedSinceTrim)), s = e.length === a.length ? this.exited.concat(e) : e;
+    this.data = this.data.slice(t), this.exited = this.reachedByView(s), this.appendedSinceTrim = 0, this.lowestReadFrom = Number.POSITIVE_INFINITY, this.cachedRange = null, this.emit("update");
+  }
+  /**
+   * The exited points the leftmost view read since the last trim needs to reach its left edge.
+   * None without a read, so a chart that does not paint (a hidden tab) does not pile them up.
+   */
+  reachedByView(t) {
+    const a = this.lowestReadFrom, e = this.data[0];
+    if (e === void 0 || e.time <= a) return [];
+    const s = Math.max(0, n(t, a, (h) => h.time) - 1);
+    return t.slice(s);
   }
   getAll() {
     return this.data;
@@ -64,8 +76,14 @@ class u extends d {
   getVisibleData(t, a) {
     if (this.data.length === 0) return [];
     if (this.cachedRange && this.cachedRange.from === t && this.cachedRange.to === a) return this.cachedResult;
-    const e = Math.max(0, n(this.data, t, (s) => s.time) - 1), i = Math.min(this.data.length, n(this.data, a, (s) => s.time) + 1);
-    return this.cachedResult = this.data.slice(e, i), this.cachedRange = { from: t, to: a }, this.cachedResult;
+    this.lowestReadFrom = Math.min(this.lowestReadFrom, t);
+    const e = Math.max(0, n(this.data, t, (i) => i.time) - 1), s = Math.min(this.data.length, n(this.data, a, (i) => i.time) + 1);
+    let h = this.data.slice(e, s);
+    if (e === 0 && this.data[0].time > t && this.exited.length > 0) {
+      const i = Math.max(0, n(this.exited, t, (r) => r.time) - 1), d = Math.min(this.exited.length, n(this.exited, a, (r) => r.time) + 1);
+      h = this.exited.slice(i, d).concat(h);
+    }
+    return this.cachedResult = h, this.cachedRange = { from: t, to: a }, h;
   }
   first() {
     return this.data[0];
@@ -81,13 +99,13 @@ class u extends d {
   }
   findNearest(t, a) {
     if (this.data.length === 0) return null;
-    const e = n(this.data, t, (h) => h.time);
-    let i = null, s = a;
-    for (let h = Math.max(0, e - 1); h <= Math.min(this.data.length - 1, e + 1); h++) {
-      const r = Math.abs(this.data[h].time - t);
-      r <= s && (s = r, i = this.data[h]);
+    const e = n(this.data, t, (i) => i.time);
+    let s = null, h = a;
+    for (let i = Math.max(0, e - 1); i <= Math.min(this.data.length - 1, e + 1); i++) {
+      const d = Math.abs(this.data[i].time - t);
+      d <= h && (h = d, s = this.data[i]);
     }
-    return i;
+    return s;
   }
 }
 export {

package/dist/core/dist/data/sync.js

@@ -1,102 +1,113 @@
-import { normalizeTime as T } from "../utils/time.js";
-function s(a) {
-  return "x" in a ? a.x : T(a.time);
+import { normalizeTime as A } from "../utils/time.js";
+function i(a) {
+  return "x" in a ? a.x : A(a.time);
 }
-const D = { len: 0, firstTime: null, lastTime: null, data: null }, A = 20;
+const S = { len: 0, firstTime: null, lastTime: null, data: null, last: null }, b = 20;
 function o(a, t) {
-  if (s(a) !== s(t)) return !1;
-  const r = Object.keys(a), e = Object.keys(t);
-  return r.length !== e.length ? !1 : r.every((n) => n === "time" || a[n] === t[n]);
+  if (i(a) !== i(t)) return !1;
+  const l = Object.keys(a), e = Object.keys(t);
+  return l.length !== e.length ? !1 : l.every((r) => r === "time" || a[r] === t[r]);
 }
-function y(a, t) {
+function p(a, t) {
   if (!a || a.length !== t.length || a === t) return !1;
-  for (let r = 0; r < t.length - 1; r++)
-    if (a[r] !== t[r] && !o(a[r], t[r]))
+  for (let l = 0; l < t.length - 1; l++)
+    if (a[l] !== t[l] && !o(a[l], t[l]))
       return !1;
   return !0;
 }
-function S(a, t, r) {
-  if (!a || a.length === 0 || r <= 0 || a.length !== t.length - r) return !1;
-  for (let e = 1; e < r; e++)
-    if (s(t[e - 1]) >= s(t[e])) return !1;
-  if (s(t[r - 1]) >= s(a[0])) return !1;
+function E(a, t, l) {
+  if (!a || a.length === 0 || l <= 0 || a.length !== t.length - l) return !1;
+  for (let e = 1; e < l; e++)
+    if (i(t[e - 1]) >= i(t[e])) return !1;
+  if (i(t[l - 1]) >= i(a[0])) return !1;
   for (let e = 0; e < a.length; e++)
-    if (!o(a[e], t[r + e])) return !1;
+    if (!o(a[e], t[l + e])) return !1;
   return !0;
 }
-function m(a, t, r) {
-  if (!a || a === t) return "unchanged";
-  const e = a.length - r;
-  if (e <= 0 || e > t.length) return null;
-  for (let l = 0; l < e - 1; l++) {
-    const u = a[r + l];
-    if (u !== t[l] && !o(u, t[l]))
+function m(a, t, l) {
+  const e = a.data;
+  if (!e) return "unchanged";
+  if (e === t) return T(a, t) ? "lastEdited" : "unchanged";
+  const r = e.length - l;
+  if (r <= 0 || r > t.length) return null;
+  for (let u = 0; u < r - 1; u++) {
+    const f = e[l + u];
+    if (f !== t[u] && !o(f, t[u]))
       return null;
   }
-  for (let l = e; l < t.length; l++)
-    if (s(t[l - 1]) >= s(t[l])) return null;
-  const n = a[a.length - 1], i = t[e - 1];
-  return n === i || o(n, i) ? "unchanged" : s(n) !== s(i) ? null : "lastEdited";
+  for (let u = r; u < t.length; u++)
+    if (i(t[u - 1]) >= i(t[u])) return null;
+  const n = e[e.length - 1], s = t[r - 1];
+  return n === s || o(n, s) ? "unchanged" : i(n) !== i(s) ? null : "lastEdited";
 }
-function b(a) {
-  return typeof a == "object" && a !== null && !Array.isArray(a) && Array.isArray(a.data);
+function T(a, t) {
+  const l = a.last ?? null, e = t[a.len - 1];
+  return l === null || e === void 0 ? !1 : i(l) === i(e) && !o(l, e);
+}
+function h(a) {
+  const t = a[a.length - 1];
+  return { len: a.length, firstTime: i(a[0]), lastTime: i(t), data: a, last: { ...t } };
 }
 function L(a) {
+  return typeof a == "object" && a !== null && !Array.isArray(a) && Array.isArray(a.data);
+}
+function v(a) {
   if (!Array.isArray(a)) return [a];
   if (a.length === 0) return [{ data: [] }];
   const t = a[0];
-  return Array.isArray(t) || b(t) ? a.map((r) => Array.isArray(r) ? { data: r } : r) : [{ data: a }];
+  return Array.isArray(t) || L(t) ? a.map((l) => Array.isArray(l) ? { data: l } : l) : [{ data: a }];
 }
-function k(a) {
-  const { chart: t, id: r } = a, e = L(a.data), n = e.length > 1 ? e.map((l, u) => l.label ?? `Series ${u + 1}`) : [e[0].label];
-  t.setSeriesLabels(r, n), t.setLayerColors(
-    r,
-    e.map((l) => l.color)
+function j(a) {
+  const { chart: t, id: l } = a, e = v(a.data), r = e.length > 1 ? e.map((s, u) => s.label ?? `Series ${u + 1}`) : [e[0].label];
+  t.setSeriesLabels(l, r), t.setLayerColors(
+    l,
+    e.map((s) => s.color)
   );
-  const i = [];
+  const n = [];
   return t.batch(() => {
-    for (let l = 0; l < e.length; l++)
-      i[l] = E({
+    for (let s = 0; s < e.length; s++)
+      n[s] = x({
         chart: t,
-        id: r,
-        data: e[l].data,
-        prev: a.prev[l] ?? D,
-        layerIndex: l
+        id: l,
+        data: e[s].data,
+        prev: a.prev[s] ?? S,
+        layerIndex: s
       });
-  }), i;
+  }), n;
 }
-function E(a) {
-  const { chart: t, id: r, data: e, prev: n, layerIndex: i } = a;
+function x(a) {
+  const { chart: t, id: l, data: e, prev: r, layerIndex: n } = a;
   if (e.length === 0)
-    return t.setSeriesData(r, [], i), { len: 0, firstTime: null, lastTime: null, data: [] };
-  if (n.data === e && n.len === e.length) return n;
-  const l = s(e[0]), u = s(e[e.length - 1]);
-  if (typeof l == "string")
-    return e.length === n.len && y(n.data, e) ? t.updateData(r, e[e.length - 1], i) : t.setSeriesData(r, e, i), { len: e.length, firstTime: l, lastTime: u, data: e };
-  const d = n.firstTime !== null && n.firstTime !== l, f = e.length - n.len, p = n.lastTime !== null && n.lastTime !== u, c = d && f === 0 && p ? m(n.data, e, 1) : null;
-  if (c !== null)
+    return t.setSeriesData(l, [], n), { len: 0, firstTime: null, lastTime: null, data: [], last: null };
+  if (r.data === e && r.len === e.length)
+    return T(r, e) ? (t.updateData(l, e[e.length - 1], n), h(e)) : r;
+  const s = i(e[0]), u = i(e[e.length - 1]);
+  if (typeof s == "string")
+    return e.length === r.len && p(r.data, e) ? t.updateData(l, e[e.length - 1], n) : t.setSeriesData(l, e, n), h(e);
+  const f = r.firstTime !== null && r.firstTime !== s, c = e.length - r.len, D = r.lastTime !== null && r.lastTime !== u, g = f && c === 0 && D ? m(r, e, 1) : null;
+  if (g !== null)
     t.batch(() => {
-      c === "lastEdited" && t.updateData(r, e[e.length - 2], i), t.appendData(r, e[e.length - 1], i), t.keepLast(r, e.length, i);
+      g === "lastEdited" && t.updateData(l, e[e.length - 2], n), t.appendData(l, e[e.length - 1], n), t.keepLast(l, e.length, n);
     });
-  else if (S(n.data, e, f))
-    t.prependData(r, e.slice(0, f), i);
-  else if (n.len === 0 || e.length < n.len || f > A || d)
-    t.setSeriesData(r, e, i);
-  else if (e.length === n.len)
-    y(n.data, e) ? t.updateData(r, e[e.length - 1], i) : t.setSeriesData(r, e, i);
+  else if (E(r.data, e, c))
+    t.prependData(l, e.slice(0, c), n);
+  else if (r.len === 0 || e.length < r.len || c > b || f)
+    t.setSeriesData(l, e, n);
+  else if (e.length === r.len)
+    p(r.data, e) ? t.updateData(l, e[e.length - 1], n) : t.setSeriesData(l, e, n);
   else {
-    const g = m(n.data, e, 0);
-    g === null ? t.setSeriesData(r, e, i) : t.batch(() => {
-      g === "lastEdited" && t.updateData(r, e[n.len - 1], i);
-      for (let h = n.len; h < e.length; h++)
-        t.appendData(r, e[h], i);
+    const y = m(r, e, 0);
+    y === null ? t.setSeriesData(l, e, n) : t.batch(() => {
+      y === "lastEdited" && t.updateData(l, e[r.len - 1], n);
+      for (let d = r.len; d < e.length; d++)
+        t.appendData(l, e[d], n);
     });
   }
-  return { len: e.length, firstTime: l, lastTime: u, data: e };
+  return h(e);
 }
 export {
-  D as EMPTY_SYNC_STATE,
-  k as syncLayers,
-  E as syncSeriesLayer,
-  L as toLayers
+  S as EMPTY_SYNC_STATE,
+  j as syncLayers,
+  x as syncSeriesLayer,
+  v as toLayers
 };

package/dist/core/dist/perf/perf-hud.js

@@ -20,7 +20,7 @@ function I(i) {
 function O(i) {
   return -I(i) / 12;
 }
-const B = "#9aa6b6", c = "#5d6877", C = "#e8eef7", x = "#cdd6e2", y = "#3fd68f", V = "#f5c451", $ = "#f4756a", Y = "#5d6877", X = {
+const V = "#9aa6b6", c = "#5d6877", C = "#e8eef7", x = "#cdd6e2", y = "#3fd68f", B = "#f5c451", $ = "#f4756a", Y = "#5d6877", X = {
   position: "absolute",
   top: "8px",
   right: "8px",
@@ -34,7 +34,7 @@ const B = "#9aa6b6", c = "#5d6877", C = "#e8eef7", x = "#cdd6e2", y = "#3fd68f",
   border: "1px solid rgba(255, 255, 255, 0.09)",
   borderRadius: "10px",
   boxShadow: "0 10px 28px rgba(0, 0, 0, 0.45), inset 0 1px 0 rgba(255, 255, 255, 0.05)",
-  color: B,
+  color: V,
   font: "10px/1.5 ui-monospace, SFMono-Regular, Menlo, monospace",
   fontVariantNumeric: "tabular-nums",
   letterSpacing: "0.02em",
@@ -50,7 +50,7 @@ function G(i) {
 }`, i.head.appendChild(e);
 }
 function v(i) {
-  return i <= H ? y : i <= F ? V : $;
+  return i <= H ? y : i <= F ? B : $;
 }
 function A(i) {
   return i >= 1e6 ? `${(i / 1e6).toFixed(1)}M` : i >= 1e4 ? `${(i / 1e3).toFixed(1)}k` : Math.round(i).toLocaleString("en-US");

package/dist/core/dist/scales/tick-tracker.js

@@ -74,8 +74,9 @@ class m {
     const t = [];
     let e = !1;
     for (const [o, r] of this.#t) {
+      r.animating && (e = !0);
       const i = r.current;
-      i <= 0 || (t.push({ value: o, opacity: i }), r.animating && (e = !0));
+      i <= 0 || t.push({ value: o, opacity: i });
     }
     return { entries: t, isAnimating: e };
   }

package/dist/core/dist/series/band.js

@@ -122,7 +122,7 @@ class nt {
     const e = this.#t[i];
     if (!e) return;
     const o = this.#t.some((l) => l.store.length > 0), s = (t ?? []).map(S);
-    e.store.setData(s), !o && s.length > 0 && this.#i.arm(this.#e.introMs);
+    !o && s.length > 0 && this.#i.arm(this.#e.introMs), e.store.setData(s);
     const n = e.store.last();
     e.displayedLast = n ? x(n) : null, e.chase = null, e.pinned = null, e.morphs.clear(), e.entries.clear(), this.#o.finish(), this.#s = null;
   }