@bigplay/tree-view-core 0.4.0 → 0.5.0

package/dist/index.js

@@ -5,39 +5,40 @@ const H = {
   siblingGap: 16,
   direction: "top-to-bottom",
   linkStyle: "elbow",
-  levelLayout: "tree"
+  levelLayout: "tree",
+  levelAlign: "start"
 };
-function G(e) {
+function U(e) {
   return { ...H, ...e };
 }
-function U(e) {
+function Y(e) {
   return e?.children;
 }
-function R(e) {
+function A(e) {
   return e?.id;
 }
-function ut(e, t = {}) {
+function ft(e, t = {}) {
   if (e == null) return [];
   const n = Array.isArray(e) ? e : [e];
-  return n.length === 0 ? [] : t.getParentId ? X(n, t) : Y(n, t);
-}
-function Y(e, t) {
-  const n = t.getId ?? R, i = t.getChildren ?? U, o = /* @__PURE__ */ new Set();
-  function s(r, h, c, l) {
-    const a = A(n(r), l);
-    W(a, o);
-    const u = (i(r) ?? []).map((f, p) => s(f, h + 1, a, `${l}.${p}`));
-    return { id: a, data: r, depth: h, parentId: c, children: u, hasChildren: u.length > 0, collapsed: !1 };
-  }
-  return e.map((r, h) => s(r, 0, null, String(h)));
+  return n.length === 0 ? [] : t.getParentId ? F(n, t) : X(n, t);
 }
 function X(e, t) {
-  const n = t.getId ?? R, i = /* @__PURE__ */ new Set(), o = e.map((c, l) => {
-    const a = A(n(c), String(l));
-    return W(a, i), { id: a, data: c, depth: 0, parentId: null, children: [], hasChildren: !1, collapsed: !1 };
+  const n = t.getId ?? A, i = t.getChildren ?? Y, o = /* @__PURE__ */ new Set();
+  function s(r, l, c, h) {
+    const a = W(n(r), h);
+    k(a, o);
+    const u = (i(r) ?? []).map((f, p) => s(f, l + 1, a, `${h}.${p}`));
+    return { id: a, data: r, depth: l, parentId: c, children: u, hasChildren: u.length > 0, collapsed: !1 };
+  }
+  return e.map((r, l) => s(r, 0, null, String(l)));
+}
+function F(e, t) {
+  const n = t.getId ?? A, i = /* @__PURE__ */ new Set(), o = e.map((c, h) => {
+    const a = W(n(c), String(h));
+    return k(a, i), { id: a, data: c, depth: 0, parentId: null, children: [], hasChildren: !1, collapsed: !1 };
   }), s = new Map(o.map((c) => [c.id, c])), r = [];
-  if (o.forEach((c, l) => {
-    const a = t.getParentId(e[l]), d = a == null ? void 0 : s.get(String(a));
+  if (o.forEach((c, h) => {
+    const a = t.getParentId(e[h]), d = a == null ? void 0 : s.get(String(a));
     if (!d) {
       r.push(c);
       return;
@@ -56,21 +57,21 @@ function N(e) {
   }
   return t.length;
 }
-function A(e, t) {
+function W(e, t) {
   return e == null || e === "" ? t : String(e);
 }
-function W(e, t) {
+function k(e, t) {
   if (t.has(e))
     throw new Error(`[tree-view] Повторяющийся id узла: "${e}". Идентификаторы должны быть уникальными.`);
   t.add(e);
 }
-function ft(e, t = {}) {
+function pt(e, t = {}) {
   const n = e.filter((s) => s.length > 0);
   if (n.length === 0) return [];
   const i = n.length - 1, o = n.map(
-    (s, r) => s.map((h, c) => ({
-      id: F(h, r, c, t.getId),
-      data: h,
+    (s, r) => s.map((l, c) => ({
+      id: V(l, r, c, t.getId),
+      data: l,
       // Финал — корень, поэтому глубина считается от последнего уровня.
       depth: i - r,
       parentId: null,
@@ -80,19 +81,19 @@ function ft(e, t = {}) {
     }))
   );
   for (let s = 0; s < i; s += 1) {
-    const r = o[s], h = o[s + 1], c = Math.ceil(r.length / h.length);
-    r.forEach((l, a) => {
-      const d = h[Math.min(Math.floor(a / c), h.length - 1)];
-      l.parentId = d.id, d.children.push(l), d.hasChildren = !0;
+    const r = o[s], l = o[s + 1], c = Math.ceil(r.length / l.length);
+    r.forEach((h, a) => {
+      const d = l[Math.min(Math.floor(a / c), l.length - 1)];
+      h.parentId = d.id, d.children.push(h), d.hasChildren = !0;
     });
   }
   return o[i];
 }
-function F(e, t, n, i) {
+function V(e, t, n, i) {
   const o = i ? i(e, t, n) : e?.id;
   return o == null || o === "" ? `${t}.${n}` : String(o);
 }
-function pt(e, t) {
+function gt(e, t) {
   if (t.size === 0) return e;
   function n(i) {
     const o = t.has(i.id);
@@ -104,20 +105,20 @@ function pt(e, t) {
   }
   return e.map(n);
 }
-function gt(e, t) {
+function mt(e, t) {
   const n = new Set(e);
   return n.delete(t) || n.add(t), n;
 }
-const z = 2, V = 40;
-function mt(e, t = {}) {
-  const n = e?.teams ?? [], i = Math.max(t.rows ?? z, n.length), o = t.techDefeatLabel ?? "ТП", s = n.map((r, h) => {
-    const c = r.isTechDefeat === !0, l = r.isWinner === !0;
+const z = 2, Z = 40;
+function wt(e, t = {}) {
+  const n = e?.teams ?? [], i = Math.max(t.rows ?? z, n.length), o = t.techDefeatLabel ?? "ТП", s = n.map((r, l) => {
+    const c = r.isTechDefeat === !0, h = r.isWinner === !0;
     return {
-      key: String(r.id ?? `team-${h}`),
+      key: String(r.id ?? `team-${l}`),
       team: r,
       score: c ? o : String(r.score ?? ""),
-      isWinner: l,
-      isLoser: !l,
+      isWinner: h,
+      isLoser: !h,
       isMyTeam: r.isMyTeam === !0,
       isTechDefeat: c,
       isEmpty: !1
@@ -136,61 +137,64 @@ function mt(e, t = {}) {
     });
   return { rows: s, hasMyTeam: n.some((r) => r.isMyTeam === !0) };
 }
-function wt(e, t = {}) {
+function yt(e, t = {}) {
   const n = e?.teams ?? [];
-  return Math.max(t.rows ?? z, n.length) * (t.rowHeight ?? V);
+  return Math.max(t.rows ?? z, n.length) * (t.rowHeight ?? Z);
 }
-const I = { min: 0.2, max: 3 }, S = { x: 0, y: 0, scale: 1 };
+const T = { min: 0.2, max: 3 }, P = { x: 0, y: 0, scale: 1 };
 function L(e, t, n) {
   return Math.min(Math.max(e, t), n);
 }
-function Z(e, t, n = 24, i = I) {
+function q(e, t, n = 24, i = T) {
   if (e.width <= 0 || e.height <= 0 || t.width <= 0 || t.height <= 0)
-    return { ...S };
-  const o = Math.max(t.width - n * 2, 1), s = Math.max(t.height - n * 2, 1), r = Math.min(o / e.width, s / e.height, 1), h = L(r, i.min, i.max);
+    return { ...P };
+  const o = Math.max(t.width - n * 2, 1), s = Math.max(t.height - n * 2, 1), r = Math.min(o / e.width, s / e.height, 1), l = L(r, i.min, i.max);
   return {
-    scale: h,
-    x: (t.width - e.width * h) / 2,
-    y: (t.height - e.height * h) / 2
+    scale: l,
+    x: (t.width - e.width * l) / 2,
+    y: (t.height - e.height * l) / 2
   };
 }
-function q(e, t, n) {
+function K(e, t, n) {
   return { ...e, x: e.x + t, y: e.y + n };
 }
-function $(e, t, n, i = I) {
+function I(e, t, n, i = T) {
   const o = L(e.scale * t, i.min, i.max);
   if (o === e.scale) return e;
   const s = (n.x - e.x) / e.scale, r = (n.y - e.y) / e.scale;
   return { scale: o, x: n.x - s * o, y: n.y - r * o };
 }
-function yt(e) {
+function xt(e) {
   return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
 }
-function xt(e, t) {
+function Mt(e, t) {
   const n = t.nodeWidth + t.levelGap, i = (e ?? []).map((o, s) => {
     const r = o.id ?? s;
     return { key: String(r), id: r, name: o.name, index: s, width: n };
   });
   return { columns: i, width: n * i.length, offset: t.levelGap / 2 };
 }
-function Et(e) {
+function $t(e) {
   const t = e.left + e.width / 2 - e.viewport / 2;
   return L(t, 0, Math.max(0, e.scrollWidth - e.viewport));
 }
-function Mt(e, t) {
+function Lt(e, t) {
   return Math.max(0, e - t);
 }
-function Lt(e, t, n) {
-  return t <= 0 || n <= 0 ? 0 : L(Math.round(e / t), 0, n - 1);
+function Et(e, t, n) {
+  if (t <= 0 || n <= 0) return 0;
+  const i = Math.ceil(e / t - 1e-3);
+  return L(i, 0, n - 1);
 }
-function vt(e, t, n) {
+function bt(e, t, n) {
   return n ? t - 1 - e : e;
 }
-const K = 4;
-function Ct(e, t) {
-  return t * L(e, 1, K);
+const j = 4;
+function vt(e, t) {
+  return t * L(e, 1, j);
 }
-function bt(e) {
+const Ct = 20;
+function St(e) {
   if (typeof window > "u") return null;
   let t = e?.parentElement ?? null;
   for (; t; ) {
@@ -200,42 +204,42 @@ function bt(e) {
   }
   return null;
 }
-function $t(e, t) {
+function It(e, t) {
   if (typeof e.scrollTo == "function") {
     e.scrollTo({ left: t, behavior: "smooth" });
     return;
   }
   e.scrollLeft = t;
 }
-function j(e, t) {
+function Q(e, t) {
   return e.getBoundingClientRect().left - t.getBoundingClientRect().left + t.scrollLeft;
 }
-const Q = ".tree-view__node";
-function St(e, t, n, i) {
+const J = ".tree-view__node";
+function Pt(e, t, n, i) {
   const o = e.getBoundingClientRect().left + i;
-  return Array.from(e.querySelectorAll(Q)).filter((r) => {
-    const h = r.getBoundingClientRect();
-    return Math.floor((h.left + h.width / 2 - o) / n) === t;
+  return Array.from(e.querySelectorAll(J)).filter((r) => {
+    const l = r.getBoundingClientRect();
+    return Math.floor((l.left + l.width / 2 - o) / n) === t;
   });
 }
-function It(e, t) {
-  return { left: j(e, t), width: e.getBoundingClientRect().width };
+function Tt(e, t) {
+  return { left: Q(e, t), width: e.getBoundingClientRect().width };
 }
-const J = "tv-hidden";
-function Pt(e, t, n) {
+const tt = "tv-hidden";
+function Dt(e, t, n) {
   e.querySelectorAll("[data-depth]").forEach((i) => {
     const o = Number(i.getAttribute("data-depth"));
-    i.classList.toggle(J, n(o) < t);
+    i.classList.toggle(tt, n(o) < t);
   });
 }
-const Tt = "(max-width: 768px)";
-function Dt(e, t) {
+const Ot = "(max-width: 768px)";
+function Rt(e, t) {
   if (typeof window > "u" || typeof window.matchMedia != "function") return () => {
   };
   const n = window.matchMedia(e), i = () => t(n.matches);
   return i(), typeof n.addEventListener == "function" ? (n.addEventListener("change", i), () => n.removeEventListener("change", i)) : (n.addListener(i), () => n.removeListener(i));
 }
-function Rt(e, t) {
+function At(e, t) {
   if (!e) return () => {
   };
   if (t(e.clientWidth), typeof ResizeObserver > "u") return () => {
@@ -243,16 +247,16 @@ function Rt(e, t) {
   const n = new ResizeObserver(() => t(e.clientWidth));
   return n.observe(e), () => n.disconnect();
 }
-function At(e, t) {
+function Wt(e, t) {
   if (!e || typeof MutationObserver > "u") return () => {
   };
   const n = new MutationObserver(t);
   return n.observe(e, { childList: !0, subtree: !0 }), () => n.disconnect();
 }
-function E(e) {
+function x(e) {
   return Math.round(e * 100) / 100;
 }
-function tt(e) {
+function _(e) {
   return e === "top-to-bottom" || e === "bottom-to-top";
 }
 function et(e, t, n) {
@@ -268,138 +272,174 @@ function et(e, t, n) {
       return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: r } };
   }
 }
-function nt(e, t, n, i) {
-  const o = E(e.x), s = E(e.y), r = E(t.x), h = E(t.y);
+function nt(e, t, n, i, o = {}) {
+  const { elbowOffset: s, groupMid: r } = o, l = x(e.x), c = x(e.y), h = x(t.x), a = x(t.y);
   if (n === "straight")
-    return `M ${o} ${s} L ${r} ${h}`;
-  const c = tt(i), l = E((o + r) / 2), a = E((s + h) / 2);
-  return n === "elbow" ? c ? `M ${o} ${s} L ${o} ${a} L ${r} ${a} L ${r} ${h}` : `M ${o} ${s} L ${l} ${s} L ${l} ${h} L ${r} ${h}` : c ? `M ${o} ${s} C ${o} ${a} ${r} ${a} ${r} ${h}` : `M ${o} ${s} C ${l} ${s} ${l} ${h} ${r} ${h}`;
+    return `M ${l} ${c} L ${h} ${a}`;
+  const d = _(i), u = x((l + h) / 2), f = x((c + a) / 2), p = (m, g, w) => {
+    if (s == null) return w;
+    const y = Math.abs(g - m);
+    return x(m + Math.sign(g - m) * Math.min(s, y));
+  };
+  if (n === "bracket") {
+    if (d) {
+      const w = p(a, c, f), y = x(r ?? l);
+      return `M ${l} ${c} L ${y} ${c} L ${y} ${w} L ${h} ${w} L ${h} ${a}`;
+    }
+    const m = p(h, l, u), g = x(r ?? c);
+    return `M ${l} ${c} L ${l} ${g} L ${m} ${g} L ${m} ${a} L ${h} ${a}`;
+  }
+  if (n === "elbow") {
+    if (d) {
+      const g = p(a, c, f);
+      return `M ${l} ${c} L ${l} ${g} L ${h} ${g} L ${h} ${a}`;
+    }
+    const m = p(h, l, u);
+    return `M ${l} ${c} L ${m} ${c} L ${m} ${a} L ${h} ${a}`;
+  }
+  return d ? `M ${l} ${c} C ${l} ${f} ${h} ${f} ${h} ${a}` : `M ${l} ${c} C ${u} ${c} ${u} ${a} ${h} ${a}`;
 }
 function it(e, t) {
-  const n = new Map(e.map((o) => [o.id, o])), i = [];
-  for (const o of e) {
-    const s = o.parentId == null ? void 0 : n.get(o.parentId);
-    if (!s) continue;
-    const { from: r, to: h } = et(s, o, t.direction);
+  const n = /* @__PURE__ */ new Map();
+  for (const i of e) {
+    if (i.parentId == null) continue;
+    const o = t ? i.x + i.width / 2 : i.y + i.height / 2, s = n.get(i.parentId);
+    s ? (s.min = Math.min(s.min, o), s.max = Math.max(s.max, o)) : n.set(i.parentId, { min: o, max: o });
+  }
+  return new Map([...n].map(([i, o]) => [i, (o.min + o.max) / 2]));
+}
+function ot(e, t) {
+  const n = new Map(e.map((s) => [s.id, s])), i = [], o = t.linkStyle === "bracket" ? it(e, _(t.direction)) : void 0;
+  for (const s of e) {
+    const r = s.parentId == null ? void 0 : n.get(s.parentId);
+    if (!r) continue;
+    const { from: l, to: c } = et(r, s, t.direction);
     i.push({
-      id: `${s.id}->${o.id}`,
-      source: s,
-      target: o,
-      path: nt(r, h, t.linkStyle, t.direction)
+      id: `${r.id}->${s.id}`,
+      source: r,
+      target: s,
+      path: nt(l, c, t.linkStyle, t.direction, {
+        elbowOffset: t.elbowOffset,
+        groupMid: o?.get(r.id)
+      })
     });
   }
   return i;
 }
-function C(e, t) {
+function v(e, t) {
   return typeof e == "function" ? e(t) : e;
 }
-function O(e, t, n) {
+function B(e, t, n) {
   return typeof e == "function" ? e(t, n) : e;
 }
-function ot(e) {
+function rt(e) {
   const t = [];
-  for (const n of P(e)) t[n.depth] = (t[n.depth] ?? 0) + 1;
+  for (const n of D(e)) t[n.depth] = (t[n.depth] ?? 0) + 1;
   return t;
 }
-function k(e, t, n) {
+function G(e, t, n) {
   const i = [];
   let o = 0;
   for (let c = 0; c < t.length; c += 1)
     i[c] = o, o += (t[c] ?? 0) + n;
   let s = 0;
   for (const c of e) {
-    const l = t[c.depth] ?? c.alongSize;
-    c.along = i[c.depth] + (l - c.alongSize) / 2, s = Math.max(s, c.across + c.acrossSize);
+    const h = t[c.depth] ?? c.alongSize;
+    c.along = i[c.depth] + (h - c.alongSize) / 2, s = Math.max(s, c.across + c.acrossSize);
   }
   const r = t.length - 1;
   return { alongExtent: r < 0 ? 0 : i[r] + t[r], acrossExtent: s };
 }
-function rt(e, t) {
+function st(e, t) {
   const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [], s = [], r = [];
-  for (const a of P(e)) (r[a.depth] ??= []).push(a);
-  const h = [], c = [];
-  r.forEach((a, d) => {
-    const u = [];
-    let f = 0;
-    for (const m of a) {
-      const g = C(t.nodeWidth, m), w = C(t.nodeHeight, m), y = n ? w : g, M = n ? g : w;
-      s[d] = Math.max(s[d] ?? 0, y);
-      const x = { depth: d, along: 0, across: f, alongSize: y, acrossSize: M };
-      i.set(m.id, x), u.push(x), o.push(x), f += M + O(t.siblingGap, m, a.length);
-    }
-    const p = u[u.length - 1];
-    h[d] = u, c[d] = p ? p.across + p.acrossSize : 0;
-  });
-  const l = Math.max(0, ...c);
-  return h.forEach((a, d) => {
-    const u = (l - (c[d] ?? 0)) / 2;
-    if (u > 0) for (const f of a) f.across += u;
-  }), { byId: i, ...k(o, s, t.levelGap) };
+  for (const h of D(e)) (r[h.depth] ??= []).push(h);
+  const l = [], c = [];
+  if (r.forEach((h, a) => {
+    const d = [];
+    let u = 0;
+    h.forEach((p, m) => {
+      const g = v(t.nodeWidth, p), w = v(t.nodeHeight, p), y = n ? w : g, $ = n ? g : w;
+      s[a] = Math.max(s[a] ?? 0, y);
+      const M = { depth: a, along: 0, across: u, alongSize: y, acrossSize: $ };
+      i.set(p.id, M), d.push(M), o.push(M);
+      const E = h[m + 1], C = E && E.parentId !== p.parentId ? t.groupGap ?? t.siblingGap : t.siblingGap;
+      u += $ + B(C, p, h.length);
+    });
+    const f = d[d.length - 1];
+    l[a] = d, c[a] = f ? f.across + f.acrossSize : 0;
+  }), t.levelAlign === "center") {
+    const h = Math.max(0, ...c);
+    l.forEach((a, d) => {
+      const u = (h - (c[d] ?? 0)) / 2;
+      if (u > 0) for (const f of a) f.across += u;
+    });
+  }
+  return { byId: i, ...G(o, s, t.levelGap) };
 }
-function st(e, t) {
-  if (t.levelLayout === "stack") return rt(e, t);
-  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = ot(e), o = /* @__PURE__ */ new Map(), s = [];
+function ct(e, t) {
+  if (t.levelLayout === "stack") return st(e, t);
+  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = rt(e), o = /* @__PURE__ */ new Map(), s = [];
   let r = 0;
-  const h = [];
-  function c(l) {
-    const a = C(t.nodeWidth, l), d = C(t.nodeHeight, l), u = n ? d : a, f = n ? a : d;
-    h[l.depth] = Math.max(h[l.depth] ?? 0, u);
+  const l = [];
+  function c(h) {
+    const a = v(t.nodeWidth, h), d = v(t.nodeHeight, h), u = n ? d : a, f = n ? a : d;
+    l[h.depth] = Math.max(l[h.depth] ?? 0, u);
     const p = r, m = s.length;
     let g = r;
-    if (l.children.length > 0) {
-      const y = l.children.map(c), M = y[0], x = y[y.length - 1], _ = M.across + M.acrossSize / 2, B = x.across + x.acrossSize / 2;
-      g = (_ + B) / 2 - f / 2;
-      const T = p - g;
-      if (T > 0) {
-        for (let b = m; b < s.length; b += 1) s[b].across += T;
+    if (h.children.length > 0) {
+      const y = h.children.map(c), $ = y[0], M = y[y.length - 1], E = $.across + $.acrossSize / 2, C = M.across + M.acrossSize / 2;
+      g = (E + C) / 2 - f / 2;
+      const O = p - g;
+      if (O > 0) {
+        for (let S = m; S < s.length; S += 1) s[S].across += O;
         g = p;
       }
     }
-    const w = { depth: l.depth, along: 0, across: g, alongSize: u, acrossSize: f };
-    return o.set(l.id, w), s.push(w), r = Math.max(
+    const w = { depth: h.depth, along: 0, across: g, alongSize: u, acrossSize: f };
+    return o.set(h.id, w), s.push(w), r = Math.max(
       r,
-      g + f + O(t.siblingGap, l, i[l.depth] ?? 1)
+      g + f + B(t.siblingGap, h, i[h.depth] ?? 1)
     ), w;
   }
-  return e.forEach(c), { byId: o, ...k(s, h, t.levelGap) };
+  return e.forEach(c), { byId: o, ...G(s, l, t.levelGap) };
 }
-function P(e) {
+function D(e) {
   const t = [];
   function n(i) {
     t.push(i), i.children.forEach(n);
   }
   return e.forEach(n), t;
 }
-function Wt(e, t) {
-  const n = G(t);
+function kt(e, t) {
+  const n = U(t);
   if (e.length === 0)
     return { nodes: [], links: [], width: 0, height: 0 };
-  const i = n.direction === "top-to-bottom" || n.direction === "bottom-to-top", { byId: o, alongExtent: s, acrossExtent: r } = st(e, n), h = n.direction === "bottom-to-top" || n.direction === "right-to-left", c = P(e).map((l) => {
-    const { along: a, across: d, alongSize: u, acrossSize: f } = o.get(l.id), p = h ? s - u - a : a;
+  const i = n.direction === "top-to-bottom" || n.direction === "bottom-to-top", { byId: o, alongExtent: s, acrossExtent: r } = ct(e, n), l = n.direction === "bottom-to-top" || n.direction === "right-to-left", c = D(e).map((h) => {
+    const { along: a, across: d, alongSize: u, acrossSize: f } = o.get(h.id), p = l ? s - u - a : a;
     return {
-      id: l.id,
-      data: l.data,
-      depth: l.depth,
-      parentId: l.parentId,
+      id: h.id,
+      data: h.data,
+      depth: h.depth,
+      parentId: h.parentId,
       x: i ? d : p,
       y: i ? p : d,
       width: i ? f : u,
       height: i ? u : f,
-      hasChildren: l.hasChildren,
-      collapsed: l.collapsed
+      hasChildren: h.hasChildren,
+      collapsed: h.collapsed
     };
   });
   return {
     nodes: c,
-    links: it(c, n),
+    links: ot(c, n),
     width: i ? r : s,
     height: i ? s : r
   };
 }
-const v = 1.2;
+const b = 1.2;
 class zt {
   constructor(t) {
-    this.params = t, this.transform = { ...S }, this.element = null, this.pointers = /* @__PURE__ */ new Map(), this.lastPinchDistance = 0, this.onPointerDown = (n) => {
+    this.params = t, this.transform = { ...P }, this.element = null, this.pointers = /* @__PURE__ */ new Map(), this.lastPinchDistance = 0, this.onPointerDown = (n) => {
       this.isPannable() && (n.target?.closest?.("[data-tv-no-pan]") || (this.pointers.set(n.pointerId, { x: n.clientX, y: n.clientY }), this.element?.setPointerCapture?.(n.pointerId)));
     }, this.onPointerMove = (n) => {
       const i = this.pointers.get(n.pointerId);
@@ -408,15 +448,15 @@ class zt {
           this.pinch();
           return;
         }
-        this.set(q(this.transform, n.clientX - i.x, n.clientY - i.y));
+        this.set(K(this.transform, n.clientX - i.x, n.clientY - i.y));
       }
     }, this.onPointerUp = (n) => {
       this.pointers.delete(n.pointerId), this.pointers.size < 2 && (this.lastPinchDistance = 0);
     }, this.onWheel = (n) => {
       if (!this.isZoomable()) return;
       n.preventDefault();
-      const i = n.deltaY < 0 ? v : 1 / v;
-      this.set($(this.transform, i, this.toLocalPoint(n), this.limits));
+      const i = n.deltaY < 0 ? b : 1 / b;
+      this.set(I(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -432,7 +472,7 @@ class zt {
   fit(t, n = 24) {
     const i = this.element;
     i && this.set(
-      Z(
+      q(
         t,
         { width: i.clientWidth, height: i.clientHeight },
         n,
@@ -441,20 +481,20 @@ class zt {
     );
   }
   zoomIn() {
-    this.zoomToCenter(v);
+    this.zoomToCenter(b);
   }
   zoomOut() {
-    this.zoomToCenter(1 / v);
+    this.zoomToCenter(1 / b);
   }
   reset() {
-    this.set({ ...S });
+    this.set({ ...P });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
     this.transform = { ...t }, this.params.onChange(this.transform);
   }
   get limits() {
-    return this.params.limits?.() ?? I;
+    return this.params.limits?.() ?? T;
   }
   isPannable() {
     return this.params.pannable?.() ?? !0;
@@ -469,7 +509,7 @@ class zt {
   }
   zoomToCenter(t) {
     const n = this.element, i = { x: (n?.clientWidth ?? 0) / 2, y: (n?.clientHeight ?? 0) / 2 };
-    this.set($(this.transform, t, i, this.limits));
+    this.set(I(this.transform, t, i, this.limits));
   }
   /** Два пальца: масштабируем вокруг точки ровно между ними. */
   pinch() {
@@ -482,21 +522,21 @@ class zt {
         clientX: (t.x + n.x) / 2,
         clientY: (t.y + n.y) / 2
       });
-      this.set($(this.transform, i / this.lastPinchDistance, o, this.limits));
+      this.set(I(this.transform, i / this.lastPinchDistance, o, this.limits));
     }
     this.lastPinchDistance = i;
   }
 }
-function Ot(e, t = "tree-view-styles") {
+function _t(e, t = "tree-view-styles") {
   if (typeof document > "u" || document.getElementById(t)) return;
   const n = document.createElement("style");
   n.id = t, n.textContent = e, document.head.appendChild(n);
 }
-const ct = 400, ht = 150;
-function D(e, t) {
+const ht = 400, lt = 150;
+function R(e, t) {
   return e.x <= t.x + t.width && e.x + e.width >= t.x && e.y <= t.y + t.height && e.y + e.height >= t.y;
 }
-function lt(e) {
+function at(e) {
   const { source: t, target: n } = e, i = Math.min(t.x, n.x), o = Math.min(t.y, n.y);
   return {
     x: i,
@@ -505,24 +545,24 @@ function lt(e) {
     height: Math.max(t.y + t.height, n.y + n.height) - o
   };
 }
-function at(e, t) {
+function dt(e, t) {
   return { x: e.x - t, y: e.y - t, width: e.width + t * 2, height: e.height + t * 2 };
 }
-function kt(e, t, n = ct) {
-  if (!t || e.nodes.length < ht) return e;
+function Bt(e, t, n = ht) {
+  if (!t || e.nodes.length < lt) return e;
   if (t.width <= 0 || t.height <= 0)
     return { nodes: [], links: [], width: e.width, height: e.height };
-  const i = at(t, n), o = [], s = [];
+  const i = dt(t, n), o = [], s = [];
   for (const r of e.nodes)
-    D(i, r) && o.push(r);
+    R(i, r) && o.push(r);
   for (const r of e.links)
-    D(i, lt(r)) && s.push(r);
+    R(i, at(r)) && s.push(r);
   return { nodes: o, links: s, width: e.width, height: e.height };
 }
-function _t() {
+function Gt() {
   return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
 }
-function Bt(e, t) {
+function Ht(e, t) {
   if (!e || typeof window > "u" || t <= 0) return null;
   const n = e.getBoundingClientRect(), i = Math.max(n.left, 0), o = Math.max(n.top, 0), s = Math.min(n.right, window.innerWidth), r = Math.min(n.bottom, window.innerHeight);
   return s <= i || r <= o ? { x: 0, y: 0, width: 0, height: 0 } : {
@@ -534,55 +574,56 @@ function Bt(e, t) {
 }
 export {
   z as DEFAULT_BRACKET_ROWS,
-  V as DEFAULT_BRACKET_ROW_HEIGHT,
+  Z as DEFAULT_BRACKET_ROW_HEIGHT,
   H as DEFAULT_OPTIONS,
-  ct as DEFAULT_OVERSCAN,
-  I as DEFAULT_SCALE_LIMITS,
-  J as HIDDEN_CLASS,
-  S as IDENTITY_TRANSFORM,
-  K as MAX_GAP_STEPS,
-  Tt as MOBILE_MEDIA_QUERY,
+  ht as DEFAULT_OVERSCAN,
+  T as DEFAULT_SCALE_LIMITS,
+  tt as HIDDEN_CLASS,
+  P as IDENTITY_TRANSFORM,
+  j as MAX_GAP_STEPS,
+  Ot as MOBILE_MEDIA_QUERY,
   zt as PanZoomController,
-  Q as TREE_NODE_SELECTOR,
-  ht as VIRTUALIZE_THRESHOLD,
-  v as ZOOM_STEP,
-  pt as applyCollapsed,
-  wt as bracketCardHeight,
-  mt as buildBracketCard,
-  xt as buildBracketRounds,
-  it as buildLinks,
+  Ct as SWIPE_ELBOW_OFFSET,
+  J as TREE_NODE_SELECTOR,
+  lt as VIRTUALIZE_THRESHOLD,
+  b as ZOOM_STEP,
+  gt as applyCollapsed,
+  yt as bracketCardHeight,
+  wt as buildBracketCard,
+  Mt as buildBracketRounds,
+  ot as buildLinks,
   nt as buildPath,
   L as clamp,
-  _t as estimateVisibleRect,
-  at as expandRect,
-  bt as findScrollParent,
-  Z as fitToViewport,
-  P as flatten,
-  ft as fromLevels,
+  Gt as estimateVisibleRect,
+  dt as expandRect,
+  St as findScrollParent,
+  q as fitToViewport,
+  D as flatten,
+  pt as fromLevels,
   et as getAnchors,
-  Pt as hideRoundsBefore,
-  It as horizontalBox,
-  Ot as injectStyles,
-  Wt as layoutTree,
-  Mt as levelGapForWidth,
-  Bt as measureVisibleRect,
-  St as nodesInColumn,
-  j as offsetWithin,
-  q as panBy,
-  st as placeNodes,
-  G as resolveOptions,
-  Lt as roundAtScroll,
-  vt as roundOfDepth,
-  Et as roundScrollLeft,
-  Ct as roundSiblingGap,
-  $t as smoothScrollLeft,
-  yt as toCssTransform,
-  ut as toTree,
-  gt as toggleCollapsed,
-  kt as visibleLayout,
-  At as watchChildren,
-  Dt as watchMedia,
-  Rt as watchWidth,
-  $ as zoomAtPoint
+  Dt as hideRoundsBefore,
+  Tt as horizontalBox,
+  _t as injectStyles,
+  kt as layoutTree,
+  Lt as levelGapForWidth,
+  Ht as measureVisibleRect,
+  Pt as nodesInColumn,
+  Q as offsetWithin,
+  K as panBy,
+  ct as placeNodes,
+  U as resolveOptions,
+  Et as roundAtScroll,
+  bt as roundOfDepth,
+  $t as roundScrollLeft,
+  vt as roundSiblingGap,
+  It as smoothScrollLeft,
+  xt as toCssTransform,
+  ft as toTree,
+  mt as toggleCollapsed,
+  Bt as visibleLayout,
+  Wt as watchChildren,
+  Rt as watchMedia,
+  At as watchWidth,
+  I as zoomAtPoint
 };
 //# sourceMappingURL=index.js.map