@bigplay/tree-view-core 0.4.0 → 0.6.0

package/dist/index.js

@@ -5,47 +5,48 @@ 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) {
   return e?.id;
 }
-function ut(e, t = {}) {
+function pt(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 n.length === 0 ? [] : t.getParentId ? X(n, t) : F(n, t);
+}
+function F(e, t) {
+  const n = t.getId ?? R, i = t.getChildren ?? Y, o = /* @__PURE__ */ new Set();
+  function r(s, l, c, h) {
+    const a = W(n(s), h);
+    k(a, o);
+    const u = (i(s) ?? []).map((f, p) => r(f, l + 1, a, `${h}.${p}`));
+    return { id: a, data: s, depth: l, parentId: c, children: u, hasChildren: u.length > 0, collapsed: !1 };
   }
-  return e.map((r, h) => s(r, 0, null, String(h)));
+  return e.map((s, l) => r(s, 0, null, String(l)));
 }
 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 };
-  }), 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));
+  const n = t.getId ?? R, 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 };
+  }), r = new Map(o.map((c) => [c.id, c])), s = [];
+  if (o.forEach((c, h) => {
+    const a = t.getParentId(e[h]), d = a == null ? void 0 : r.get(String(a));
     if (!d) {
-      r.push(c);
+      s.push(c);
       return;
     }
     c.parentId = d.id, d.children.push(c), d.hasChildren = !0;
-  }), N(r) !== o.length)
+  }), N(s) !== o.length)
     throw new Error("[tree-view] В данных есть цикл: часть узлов ссылается друг на друга по кругу.");
-  return r;
+  return s;
 }
 function N(e) {
   const t = [...e];
@@ -56,43 +57,43 @@ 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 = {}) {
-  const n = e.filter((s) => s.length > 0);
+function gt(e, t = {}) {
+  const n = e.filter((r) => r.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,
+    (r, s) => r.map((l, c) => ({
+      id: q(l, s, c, t.getId),
+      data: l,
       // Финал — корень, поэтому глубина считается от последнего уровня.
-      depth: i - r,
+      depth: i - s,
       parentId: null,
       children: [],
       hasChildren: !1,
       collapsed: !1
     }))
   );
-  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;
+  for (let r = 0; r < i; r += 1) {
+    const s = o[r], l = o[r + 1], c = Math.ceil(s.length / l.length);
+    s.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 q(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 mt(e, t) {
   if (t.size === 0) return e;
   function n(i) {
     const o = t.has(i.id);
@@ -104,28 +105,28 @@ function pt(e, t) {
   }
   return e.map(n);
 }
-function gt(e, t) {
+function wt(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;
+function yt(e, t = {}) {
+  const n = e?.teams ?? [], i = Math.max(t.rows ?? z, n.length), o = t.techDefeatLabel ?? "ТП", r = n.map((s, l) => {
+    const c = s.isTechDefeat === !0, h = s.isWinner === !0;
     return {
-      key: String(r.id ?? `team-${h}`),
-      team: r,
-      score: c ? o : String(r.score ?? ""),
-      isWinner: l,
-      isLoser: !l,
-      isMyTeam: r.isMyTeam === !0,
+      key: String(s.id ?? `team-${l}`),
+      team: s,
+      score: c ? o : String(s.score ?? ""),
+      isWinner: h,
+      isLoser: !h,
+      isMyTeam: s.isMyTeam === !0,
       isTechDefeat: c,
       isEmpty: !1
     };
   });
-  for (let r = n.length; r < i; r += 1)
-    s.push({
-      key: `empty-${r}`,
+  for (let s = n.length; s < i; s += 1)
+    r.push({
+      key: `empty-${s}`,
       team: null,
       score: "",
       isWinner: !1,
@@ -134,63 +135,72 @@ function mt(e, t = {}) {
       isTechDefeat: !1,
       isEmpty: !0
     });
-  return { rows: s, hasMyTeam: n.some((r) => r.isMyTeam === !0) };
+  return { rows: r, hasMyTeam: n.some((s) => s.isMyTeam === !0) };
 }
-function wt(e, t = {}) {
+function xt(e, t = {}) {
   const n = e?.teams ?? [];
   return Math.max(t.rows ?? z, n.length) * (t.rowHeight ?? V);
 }
-const I = { min: 0.2, max: 3 }, S = { x: 0, y: 0, scale: 1 };
-function L(e, t, n) {
+const P = { min: 0.2, max: 3 }, T = { x: 0, y: 0, scale: 1 };
+function $(e, t, n) {
   return Math.min(Math.max(e, t), n);
 }
-function Z(e, t, n = 24, i = I) {
+function Z(e, t, n = 24, i = P) {
   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 { ...T };
+  const o = Math.max(t.width - n * 2, 1), r = Math.max(t.height - n * 2, 1), s = Math.min(o / e.width, r / e.height, 1), l = $(s, 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) {
-  const o = L(e.scale * t, i.min, i.max);
+function I(e, t, n, i = P) {
+  const o = $(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 };
+  const r = (n.x - e.x) / e.scale, s = (n.y - e.y) / e.scale;
+  return { scale: o, x: n.x - r * o, y: n.y - s * o };
 }
-function yt(e) {
+function Lt(e) {
   return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
 }
-function xt(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 };
+function Mt(e, t) {
+  const n = t.nodeWidth + t.levelGap, i = (e ?? []).map((o, r) => {
+    const s = o.id ?? r;
+    return { key: String(s), id: s, name: o.name, index: r, 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));
+  return $(t, 0, Math.max(0, e.scrollWidth - e.viewport));
 }
-function Mt(e, t) {
+function Et(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 vt(e, t, n) {
+  if (t <= 0 || n <= 0) return 0;
+  const i = Math.ceil(e / t - 1e-3);
+  return $(i, 0, n - 1);
+}
+function j(e, t, n) {
   return n ? t - 1 - e : e;
 }
-const K = 4;
-function Ct(e, t) {
-  return t * L(e, 1, K);
+const Q = 4;
+function bt(e, t) {
+  return t * $(e, 1, Q);
+}
+const St = 20;
+function Ct(e, t, n, i) {
+  let o = 0;
+  for (const r of e)
+    j(r.depth, n, i) === t && (o = Math.max(o, r.y + r.height));
+  return o;
 }
-function bt(e) {
+function It(e) {
   if (typeof window > "u") return null;
   let t = e?.parentElement ?? null;
   for (; t; ) {
@@ -200,42 +210,62 @@ function bt(e) {
   }
   return null;
 }
-function $t(e, t) {
+function Tt(e, t) {
   if (typeof e.scrollTo == "function") {
     e.scrollTo({ left: t, behavior: "smooth" });
     return;
   }
   e.scrollLeft = t;
 }
-function j(e, t) {
+function J(e, t) {
   return e.getBoundingClientRect().left - t.getBoundingClientRect().left + t.scrollLeft;
 }
-const Q = ".tree-view__node";
-function St(e, t, n, i) {
+const tt = ".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(tt)).filter((s) => {
+    const l = s.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 Dt(e, t) {
+  return { left: J(e, t), width: e.getBoundingClientRect().width };
 }
-const J = "tv-hidden";
-function Pt(e, t, n) {
+const et = "tv-hidden";
+function At(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(et, n(o) < t);
   });
 }
-const Tt = "(max-width: 768px)";
-function Dt(e, t) {
+function Ot(e, t, n = 1e3) {
+  if (typeof e.onscrollend < "u") {
+    const l = () => {
+      e.removeEventListener("scrollend", l), t();
+    };
+    e.addEventListener("scrollend", l, { once: !0 }), setTimeout(l, n);
+    return;
+  }
+  const o = Date.now();
+  let r = e.scrollLeft;
+  const s = () => {
+    const l = e.scrollLeft === r;
+    if (r = e.scrollLeft, l || Date.now() - o > n) {
+      t();
+      return;
+    }
+    requestAnimationFrame(s);
+  };
+  requestAnimationFrame(s);
+}
+const Rt = "(max-width: 768px)";
+function Wt(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 kt(e, t) {
   if (!e) return () => {
   };
   if (t(e.clientWidth), typeof ResizeObserver > "u") return () => {
@@ -243,163 +273,199 @@ function Rt(e, t) {
   const n = new ResizeObserver(() => t(e.clientWidth));
   return n.observe(e), () => n.disconnect();
 }
-function At(e, t) {
+function zt(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) {
-  const i = e.x + e.width / 2, o = e.y + e.height / 2, s = t.x + t.width / 2, r = t.y + t.height / 2;
+function nt(e, t, n) {
+  const i = e.x + e.width / 2, o = e.y + e.height / 2, r = t.x + t.width / 2, s = t.y + t.height / 2;
   switch (n) {
     case "top-to-bottom":
-      return { from: { x: i, y: e.y + e.height }, to: { x: s, y: t.y } };
+      return { from: { x: i, y: e.y + e.height }, to: { x: r, y: t.y } };
     case "bottom-to-top":
-      return { from: { x: i, y: e.y }, to: { x: s, y: t.y + t.height } };
+      return { from: { x: i, y: e.y }, to: { x: r, y: t.y + t.height } };
     case "left-to-right":
-      return { from: { x: e.x + e.width, y: o }, to: { x: t.x, y: r } };
+      return { from: { x: e.x + e.width, y: o }, to: { x: t.x, y: s } };
     case "right-to-left":
-      return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: r } };
+      return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: s } };
   }
 }
-function nt(e, t, n, i) {
-  const o = E(e.x), s = E(e.y), r = E(t.x), h = E(t.y);
+function it(e, t, n, i, o = {}) {
+  const { elbowOffset: r, groupMid: s } = 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}`;
-}
-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);
+    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 (r == null) return w;
+    const y = Math.abs(g - m);
+    return x(m + Math.sign(g - m) * Math.min(r, y));
+  };
+  if (n === "bracket") {
+    if (d) {
+      const w = p(a, c, f), y = x(s ?? 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(s ?? 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 ot(e, t) {
+  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, r = n.get(i.parentId);
+    r ? (r.min = Math.min(r.min, o), r.max = Math.max(r.max, o)) : n.set(i.parentId, { min: o, max: o });
+  }
+  return new Map([...n].map(([i, o]) => [i, (o.min + o.max) / 2]));
+}
+function rt(e, t) {
+  const n = new Map(e.map((r) => [r.id, r])), i = [], o = t.linkStyle === "bracket" ? ot(e, _(t.direction)) : void 0;
+  for (const r of e) {
+    const s = r.parentId == null ? void 0 : n.get(r.parentId);
     if (!s) continue;
-    const { from: r, to: h } = et(s, o, t.direction);
+    const { from: l, to: c } = nt(s, r, t.direction);
     i.push({
-      id: `${s.id}->${o.id}`,
+      id: `${s.id}->${r.id}`,
       source: s,
-      target: o,
-      path: nt(r, h, t.linkStyle, t.direction)
+      target: r,
+      path: it(l, c, t.linkStyle, t.direction, {
+        elbowOffset: t.elbowOffset,
+        groupMid: o?.get(s.id)
+      })
     });
   }
   return i;
 }
-function C(e, t) {
+function b(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 st(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;
+  let r = 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, r = Math.max(r, c.across + c.acrossSize);
   }
-  const r = t.length - 1;
-  return { alongExtent: r < 0 ? 0 : i[r] + t[r], acrossExtent: s };
+  const s = t.length - 1;
+  return { alongExtent: s < 0 ? 0 : i[s] + t[s], acrossExtent: r };
+}
+function ct(e, t) {
+  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [], r = [], s = [];
+  for (const h of D(e)) (s[h.depth] ??= []).push(h);
+  const l = [], c = [];
+  if (s.forEach((h, a) => {
+    const d = [];
+    let u = 0;
+    h.forEach((p, m) => {
+      const g = b(t.nodeWidth, p), w = b(t.nodeHeight, p), y = n ? w : g, M = n ? g : w;
+      r[a] = Math.max(r[a] ?? 0, y);
+      const L = { depth: a, along: 0, across: u, alongSize: y, acrossSize: M };
+      i.set(p.id, L), d.push(L), o.push(L);
+      const E = h[m + 1], S = E && E.parentId !== p.parentId ? t.groupGap ?? t.siblingGap : t.siblingGap;
+      u += M + B(S, 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, r, t.levelGap) };
 }
-function rt(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) };
-}
-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 = [];
-  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 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;
+function ht(e, t) {
+  if (t.levelLayout === "stack") return ct(e, t);
+  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = st(e), o = /* @__PURE__ */ new Map(), r = [];
+  let s = 0;
+  const l = [];
+  function c(h) {
+    const a = b(t.nodeWidth, h), d = b(t.nodeHeight, h), u = n ? d : a, f = n ? a : d;
+    l[h.depth] = Math.max(l[h.depth] ?? 0, u);
+    const p = s, m = r.length;
+    let g = s;
+    if (h.children.length > 0) {
+      const y = h.children.map(c), M = y[0], L = y[y.length - 1], E = M.across + M.acrossSize / 2, S = L.across + L.acrossSize / 2;
+      g = (E + S) / 2 - f / 2;
+      const A = p - g;
+      if (A > 0) {
+        for (let C = m; C < r.length; C += 1) r[C].across += A;
         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(
-      r,
-      g + f + O(t.siblingGap, l, i[l.depth] ?? 1)
+    const w = { depth: h.depth, along: 0, across: g, alongSize: u, acrossSize: f };
+    return o.set(h.id, w), r.push(w), s = Math.max(
+      s,
+      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(r, 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 _t(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: r, acrossExtent: s } = ht(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 ? r - 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),
-    width: i ? r : s,
-    height: i ? s : r
+    links: rt(c, n),
+    width: i ? s : r,
+    height: i ? r : s
   };
 }
 const v = 1.2;
-class zt {
+class Bt {
   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 = { ...T }, 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,7 +474,7 @@ 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);
@@ -416,7 +482,7 @@ class zt {
       if (!this.isZoomable()) return;
       n.preventDefault();
       const i = n.deltaY < 0 ? v : 1 / v;
-      this.set($(this.transform, i, this.toLocalPoint(n), this.limits));
+      this.set(I(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -447,14 +513,14 @@ class zt {
     this.zoomToCenter(1 / v);
   }
   reset() {
-    this.set({ ...S });
+    this.set({ ...T });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
     this.transform = { ...t }, this.params.onChange(this.transform);
   }
   get limits() {
-    return this.params.limits?.() ?? I;
+    return this.params.limits?.() ?? P;
   }
   isPannable() {
     return this.params.pannable?.() ?? !0;
@@ -469,7 +535,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 +548,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 Gt(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 lt = 400, at = 150;
+function O(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 dt(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,84 +571,87 @@ function lt(e) {
     height: Math.max(t.y + t.height, n.y + n.height) - o
   };
 }
-function at(e, t) {
+function ut(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 Ht(e, t, n = lt) {
+  if (!t || e.nodes.length < at) 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 = [];
-  for (const r of e.nodes)
-    D(i, r) && o.push(r);
-  for (const r of e.links)
-    D(i, lt(r)) && s.push(r);
-  return { nodes: o, links: s, width: e.width, height: e.height };
-}
-function _t() {
+  const i = ut(t, n), o = [], r = [];
+  for (const s of e.nodes)
+    O(i, s) && o.push(s);
+  for (const s of e.links)
+    O(i, dt(s)) && r.push(s);
+  return { nodes: o, links: r, width: e.width, height: e.height };
+}
+function Ut() {
   return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
 }
-function Bt(e, t) {
+function Yt(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 } : {
+  const n = e.getBoundingClientRect(), i = Math.max(n.left, 0), o = Math.max(n.top, 0), r = Math.min(n.right, window.innerWidth), s = Math.min(n.bottom, window.innerHeight);
+  return r <= i || s <= o ? { x: 0, y: 0, width: 0, height: 0 } : {
     x: (i - n.left) / t,
     y: (o - n.top) / t,
-    width: (s - i) / t,
-    height: (r - o) / t
+    width: (r - i) / t,
+    height: (s - o) / t
   };
 }
 export {
   z as DEFAULT_BRACKET_ROWS,
   V 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,
-  zt as PanZoomController,
-  Q as TREE_NODE_SELECTOR,
-  ht as VIRTUALIZE_THRESHOLD,
+  lt as DEFAULT_OVERSCAN,
+  P as DEFAULT_SCALE_LIMITS,
+  et as HIDDEN_CLASS,
+  T as IDENTITY_TRANSFORM,
+  Q as MAX_GAP_STEPS,
+  Rt as MOBILE_MEDIA_QUERY,
+  Bt as PanZoomController,
+  St as SWIPE_ELBOW_OFFSET,
+  tt as TREE_NODE_SELECTOR,
+  at as VIRTUALIZE_THRESHOLD,
   v as ZOOM_STEP,
-  pt as applyCollapsed,
-  wt as bracketCardHeight,
-  mt as buildBracketCard,
-  xt as buildBracketRounds,
-  it as buildLinks,
-  nt as buildPath,
-  L as clamp,
-  _t as estimateVisibleRect,
-  at as expandRect,
-  bt as findScrollParent,
+  Ot as afterScrollEnd,
+  mt as applyCollapsed,
+  xt as bracketCardHeight,
+  yt as buildBracketCard,
+  Mt as buildBracketRounds,
+  rt as buildLinks,
+  it as buildPath,
+  $ as clamp,
+  Ut as estimateVisibleRect,
+  ut as expandRect,
+  It as findScrollParent,
   Z as fitToViewport,
-  P as flatten,
-  ft 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
+  D as flatten,
+  gt as fromLevels,
+  nt as getAnchors,
+  At as hideRoundsBefore,
+  Dt as horizontalBox,
+  Gt as injectStyles,
+  _t as layoutTree,
+  Et as levelGapForWidth,
+  Yt as measureVisibleRect,
+  Pt as nodesInColumn,
+  J as offsetWithin,
+  K as panBy,
+  ht as placeNodes,
+  U as resolveOptions,
+  vt as roundAtScroll,
+  Ct as roundContentHeight,
+  j as roundOfDepth,
+  $t as roundScrollLeft,
+  bt as roundSiblingGap,
+  Tt as smoothScrollLeft,
+  Lt as toCssTransform,
+  pt as toTree,
+  wt as toggleCollapsed,
+  Ht as visibleLayout,
+  zt as watchChildren,
+  Wt as watchMedia,
+  kt as watchWidth,
+  I as zoomAtPoint
 };
 //# sourceMappingURL=index.js.map