@bigplay/tree-view-core 0.3.1 → 0.4.0

package/dist/index.js

@@ -1,47 +1,48 @@
-const U = {
+const H = {
   nodeWidth: 180,
   nodeHeight: 64,
   levelGap: 60,
   siblingGap: 16,
   direction: "top-to-bottom",
-  linkStyle: "elbow"
+  linkStyle: "elbow",
+  levelLayout: "tree"
 };
-function Y(e) {
-  return { ...U, ...e };
+function G(e) {
+  return { ...H, ...e };
 }
-function X(e) {
+function U(e) {
   return e?.children;
 }
-function W(e) {
+function R(e) {
   return e?.id;
 }
-function at(e, t = {}) {
+function ut(e, t = {}) {
   if (e == null) return [];
   const n = Array.isArray(e) ? e : [e];
-  return n.length === 0 ? [] : t.getParentId ? F(n, t) : G(n, t);
+  return n.length === 0 ? [] : t.getParentId ? X(n, t) : Y(n, t);
 }
-function G(e, t) {
-  const n = t.getId ?? W, i = t.getChildren ?? X, o = /* @__PURE__ */ new Set();
+function Y(e, t) {
+  const n = t.getId ?? R, i = t.getChildren ?? U, o = /* @__PURE__ */ new Set();
   function s(r, h, c, l) {
-    const d = k(n(r), l);
-    A(d, o);
-    const p = (i(r) ?? []).map((a, f) => s(a, h + 1, d, `${l}.${f}`));
-    return { id: d, data: r, depth: h, parentId: c, children: p, hasChildren: p.length > 0, collapsed: !1 };
+    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)));
 }
-function F(e, t) {
-  const n = t.getId ?? W, i = /* @__PURE__ */ new Set(), o = e.map((c, l) => {
-    const d = k(n(c), String(l));
-    return A(d, i), { id: d, data: c, depth: 0, parentId: null, children: [], hasChildren: !1, collapsed: !1 };
+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 d = t.getParentId(e[l]), u = d == null ? void 0 : s.get(String(d));
-    if (!u) {
+    const a = t.getParentId(e[l]), d = a == null ? void 0 : s.get(String(a));
+    if (!d) {
       r.push(c);
       return;
     }
-    c.parentId = u.id, u.children.push(c), u.hasChildren = !0;
+    c.parentId = d.id, d.children.push(c), d.hasChildren = !0;
   }), N(r) !== o.length)
     throw new Error("[tree-view] В данных есть цикл: часть узлов ссылается друг на друга по кругу.");
   return r;
@@ -55,20 +56,20 @@ function N(e) {
   }
   return t.length;
 }
-function k(e, t) {
+function A(e, t) {
   return e == null || e === "" ? t : String(e);
 }
-function A(e, t) {
+function W(e, t) {
   if (t.has(e))
     throw new Error(`[tree-view] Повторяющийся id узла: "${e}". Идентификаторы должны быть уникальными.`);
   t.add(e);
 }
-function dt(e, t = {}) {
+function ft(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: V(h, r, c, t.getId),
+      id: F(h, r, c, t.getId),
       data: h,
       // Финал — корень, поэтому глубина считается от последнего уровня.
       depth: i - r,
@@ -80,18 +81,18 @@ function dt(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, d) => {
-      const u = h[Math.min(Math.floor(d / c), h.length - 1)];
-      l.parentId = u.id, u.children.push(l), u.hasChildren = !0;
+    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;
     });
   }
   return o[i];
 }
-function V(e, t, n, i) {
+function F(e, t, n, i) {
   const o = i ? i(e, t, n) : e?.id;
   return o == null || o === "" ? `${t}.${n}` : String(o);
 }
-function ut(e, t) {
+function pt(e, t) {
   if (t.size === 0) return e;
   function n(i) {
     const o = t.has(i.id);
@@ -103,13 +104,13 @@ function ut(e, t) {
   }
   return e.map(n);
 }
-function ft(e, t) {
+function gt(e, t) {
   const n = new Set(e);
   return n.delete(t) || n.add(t), n;
 }
-const _ = 2, Z = 40;
-function pt(e, t = {}) {
-  const n = e?.teams ?? [], i = Math.max(t.rows ?? _, n.length), o = t.techDefeatLabel ?? "ТП", s = n.map((r, h) => {
+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;
     return {
       key: String(r.id ?? `team-${h}`),
@@ -135,48 +136,61 @@ function pt(e, t = {}) {
     });
   return { rows: s, hasMyTeam: n.some((r) => r.isMyTeam === !0) };
 }
-function mt(e, t = {}) {
+function wt(e, t = {}) {
   const n = e?.teams ?? [];
-  return Math.max(t.rows ?? _, n.length) * (t.rowHeight ?? Z);
+  return Math.max(t.rows ?? z, n.length) * (t.rowHeight ?? V);
 }
-const $ = { min: 0.2, max: 3 }, M = { x: 0, y: 0, scale: 1 };
-function v(e, t, n) {
+const I = { min: 0.2, max: 3 }, S = { x: 0, y: 0, scale: 1 };
+function L(e, t, n) {
   return Math.min(Math.max(e, t), n);
 }
-function q(e, t, n = 24, i = $) {
+function Z(e, t, n = 24, i = I) {
   if (e.width <= 0 || e.height <= 0 || t.width <= 0 || t.height <= 0)
-    return { ...M };
-  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 = v(r, i.min, i.max);
+    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 {
     scale: h,
     x: (t.width - e.width * h) / 2,
     y: (t.height - e.height * h) / 2
   };
 }
-function K(e, t, n) {
+function q(e, t, n) {
   return { ...e, x: e.x + t, y: e.y + n };
 }
-function L(e, t, n, i = $) {
-  const o = v(e.scale * t, i.min, i.max);
+function $(e, t, n, i = I) {
+  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 gt(e) {
+function yt(e) {
   return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
 }
-function wt(e, t) {
+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 };
   });
   return { columns: i, width: n * i.length, offset: t.levelGap / 2 };
 }
-function yt(e) {
+function Et(e) {
   const t = e.left + e.width / 2 - e.viewport / 2;
-  return v(t, 0, Math.max(0, e.scrollWidth - e.viewport));
+  return L(t, 0, Math.max(0, e.scrollWidth - e.viewport));
+}
+function Mt(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 xt(e) {
+function vt(e, t, n) {
+  return n ? t - 1 - e : e;
+}
+const K = 4;
+function Ct(e, t) {
+  return t * L(e, 1, K);
+}
+function bt(e) {
   if (typeof window > "u") return null;
   let t = e?.parentElement ?? null;
   for (; t; ) {
@@ -186,7 +200,7 @@ function xt(e) {
   }
   return null;
 }
-function Et(e, t) {
+function $t(e, t) {
   if (typeof e.scrollTo == "function") {
     e.scrollTo({ left: t, behavior: "smooth" });
     return;
@@ -197,30 +211,51 @@ function j(e, t) {
   return e.getBoundingClientRect().left - t.getBoundingClientRect().left + t.scrollLeft;
 }
 const Q = ".tree-view__node";
-function Ct(e, t, n, i) {
+function St(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;
   });
 }
-function Lt(e, t) {
+function It(e, t) {
   return { left: j(e, t), width: e.getBoundingClientRect().width };
 }
-const Mt = "(max-width: 768px)";
-function $t(e, t) {
+const J = "tv-hidden";
+function Pt(e, t, n) {
+  e.querySelectorAll("[data-depth]").forEach((i) => {
+    const o = Number(i.getAttribute("data-depth"));
+    i.classList.toggle(J, n(o) < t);
+  });
+}
+const Tt = "(max-width: 768px)";
+function Dt(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 m(e) {
+function Rt(e, t) {
+  if (!e) return () => {
+  };
+  if (t(e.clientWidth), typeof ResizeObserver > "u") return () => {
+  };
+  const n = new ResizeObserver(() => t(e.clientWidth));
+  return n.observe(e), () => n.disconnect();
+}
+function At(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) {
   return Math.round(e * 100) / 100;
 }
-function J(e) {
+function tt(e) {
   return e === "top-to-bottom" || e === "bottom-to-top";
 }
-function tt(e, t, n) {
+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;
   switch (n) {
     case "top-to-bottom":
@@ -233,102 +268,138 @@ function tt(e, t, n) {
       return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: r } };
   }
 }
-function et(e, t, n, i) {
-  const o = m(e.x), s = m(e.y), r = m(t.x), h = m(t.y);
+function nt(e, t, n, i) {
+  const o = E(e.x), s = E(e.y), r = E(t.x), h = E(t.y);
   if (n === "straight")
     return `M ${o} ${s} L ${r} ${h}`;
-  const c = J(i), l = m((o + r) / 2), d = m((s + h) / 2);
-  return n === "elbow" ? c ? `M ${o} ${s} L ${o} ${d} L ${r} ${d} L ${r} ${h}` : `M ${o} ${s} L ${l} ${s} L ${l} ${h} L ${r} ${h}` : c ? `M ${o} ${s} C ${o} ${d} ${r} ${d} ${r} ${h}` : `M ${o} ${s} C ${l} ${s} ${l} ${h} ${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 nt(e, t) {
+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 } = tt(s, o, t.direction);
+    const { from: r, to: h } = et(s, o, t.direction);
     i.push({
       id: `${s.id}->${o.id}`,
       source: s,
       target: o,
-      path: et(r, h, t.linkStyle, t.direction)
+      path: nt(r, h, t.linkStyle, t.direction)
     });
   }
   return i;
 }
-function R(e, t) {
+function C(e, t) {
   return typeof e == "function" ? e(t) : e;
 }
-function it(e, t) {
-  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [];
+function O(e, t, n) {
+  return typeof e == "function" ? e(t, n) : e;
+}
+function ot(e) {
+  const t = [];
+  for (const n of P(e)) t[n.depth] = (t[n.depth] ?? 0) + 1;
+  return t;
+}
+function k(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;
-  const r = [];
-  function h(a) {
-    const f = R(t.nodeWidth, a), I = R(t.nodeHeight, a), S = n ? I : f, y = n ? f : I;
-    r[a.depth] = Math.max(r[a.depth] ?? 0, S);
-    const T = s, O = o.length;
-    let g = s;
-    if (a.children.length > 0) {
-      const E = a.children.map(h), P = E[0], b = E[E.length - 1], B = P.across + P.acrossSize / 2, H = b.across + b.acrossSize / 2;
-      g = (B + H) / 2 - y / 2;
-      const D = T - g;
-      if (D > 0) {
-        for (let C = O; C < o.length; C += 1) o[C].across += D;
-        g = T;
+  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 r = t.length - 1;
+  return { alongExtent: r < 0 ? 0 : i[r] + t[r], acrossExtent: s };
+}
+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;
+        g = p;
       }
     }
-    const x = { depth: a.depth, along: 0, across: g, alongSize: S, acrossSize: y };
-    return i.set(a.id, x), o.push(x), s = Math.max(s, g + y + t.siblingGap), x;
-  }
-  e.forEach(h);
-  const c = [];
-  let l = 0;
-  for (let a = 0; a < r.length; a += 1)
-    c[a] = l, l += (r[a] ?? 0) + t.levelGap;
-  let d = 0;
-  for (const a of o) {
-    const f = r[a.depth] ?? a.alongSize;
-    a.along = c[a.depth] + (f - a.alongSize) / 2, d = Math.max(d, a.across + a.acrossSize);
+    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)
+    ), w;
   }
-  const u = r.length - 1, p = u < 0 ? 0 : c[u] + r[u];
-  return { byId: i, alongExtent: p, acrossExtent: d };
+  return e.forEach(c), { byId: o, ...k(s, h, t.levelGap) };
 }
-function ot(e) {
+function P(e) {
   const t = [];
   function n(i) {
     t.push(i), i.children.forEach(n);
   }
   return e.forEach(n), t;
 }
-function vt(e, t) {
-  const n = Y(t);
+function Wt(e, t) {
+  const n = G(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 } = it(e, n), h = n.direction === "bottom-to-top" || n.direction === "right-to-left", c = ot(e).map((l) => {
-    const { along: d, across: u, alongSize: p, acrossSize: a } = o.get(l.id), f = h ? s - p - d : d;
+  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;
     return {
       id: l.id,
       data: l.data,
       depth: l.depth,
       parentId: l.parentId,
-      x: i ? u : f,
-      y: i ? f : u,
-      width: i ? a : p,
-      height: i ? p : a,
+      x: i ? d : p,
+      y: i ? p : d,
+      width: i ? f : u,
+      height: i ? u : f,
       hasChildren: l.hasChildren,
       collapsed: l.collapsed
     };
   });
   return {
     nodes: c,
-    links: nt(c, n),
+    links: it(c, n),
     width: i ? r : s,
     height: i ? s : r
   };
 }
-const w = 1.2;
-class It {
+const v = 1.2;
+class zt {
   constructor(t) {
-    this.params = t, this.transform = { ...M }, this.element = null, this.pointers = /* @__PURE__ */ new Map(), this.lastPinchDistance = 0, this.onPointerDown = (n) => {
+    this.params = t, this.transform = { ...S }, 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);
@@ -337,15 +408,15 @@ class It {
           this.pinch();
           return;
         }
-        this.set(K(this.transform, n.clientX - i.x, n.clientY - i.y));
+        this.set(q(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 ? w : 1 / w;
-      this.set(L(this.transform, i, this.toLocalPoint(n), this.limits));
+      const i = n.deltaY < 0 ? v : 1 / v;
+      this.set($(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -361,7 +432,7 @@ class It {
   fit(t, n = 24) {
     const i = this.element;
     i && this.set(
-      q(
+      Z(
         t,
         { width: i.clientWidth, height: i.clientHeight },
         n,
@@ -370,20 +441,20 @@ class It {
     );
   }
   zoomIn() {
-    this.zoomToCenter(w);
+    this.zoomToCenter(v);
   }
   zoomOut() {
-    this.zoomToCenter(1 / w);
+    this.zoomToCenter(1 / v);
   }
   reset() {
-    this.set({ ...M });
+    this.set({ ...S });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
     this.transform = { ...t }, this.params.onChange(this.transform);
   }
   get limits() {
-    return this.params.limits?.() ?? $;
+    return this.params.limits?.() ?? I;
   }
   isPannable() {
     return this.params.pannable?.() ?? !0;
@@ -398,7 +469,7 @@ class It {
   }
   zoomToCenter(t) {
     const n = this.element, i = { x: (n?.clientWidth ?? 0) / 2, y: (n?.clientHeight ?? 0) / 2 };
-    this.set(L(this.transform, t, i, this.limits));
+    this.set($(this.transform, t, i, this.limits));
   }
   /** Два пальца: масштабируем вокруг точки ровно между ними. */
   pinch() {
@@ -411,21 +482,21 @@ class It {
         clientX: (t.x + n.x) / 2,
         clientY: (t.y + n.y) / 2
       });
-      this.set(L(this.transform, i / this.lastPinchDistance, o, this.limits));
+      this.set($(this.transform, i / this.lastPinchDistance, o, this.limits));
     }
     this.lastPinchDistance = i;
   }
 }
-function St(e, t = "tree-view-styles") {
+function Ot(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 rt = 400, st = 150;
-function z(e, t) {
+const ct = 400, ht = 150;
+function D(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 ht(e) {
+function lt(e) {
   const { source: t, target: n } = e, i = Math.min(t.x, n.x), o = Math.min(t.y, n.y);
   return {
     x: i,
@@ -434,24 +505,24 @@ function ht(e) {
     height: Math.max(t.y + t.height, n.y + n.height) - o
   };
 }
-function ct(e, t) {
+function at(e, t) {
   return { x: e.x - t, y: e.y - t, width: e.width + t * 2, height: e.height + t * 2 };
 }
-function Tt(e, t, n = rt) {
-  if (!t || e.nodes.length < st) return e;
+function kt(e, t, n = ct) {
+  if (!t || e.nodes.length < ht) return e;
   if (t.width <= 0 || t.height <= 0)
     return { nodes: [], links: [], width: e.width, height: e.height };
-  const i = ct(t, n), o = [], s = [];
+  const i = at(t, n), o = [], s = [];
   for (const r of e.nodes)
-    z(i, r) && o.push(r);
+    D(i, r) && o.push(r);
   for (const r of e.links)
-    z(i, ht(r)) && s.push(r);
+    D(i, lt(r)) && s.push(r);
   return { nodes: o, links: s, width: e.width, height: e.height };
 }
-function Pt() {
+function _t() {
   return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
 }
-function bt(e, t) {
+function Bt(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 } : {
@@ -462,47 +533,56 @@ function bt(e, t) {
   };
 }
 export {
-  _ as DEFAULT_BRACKET_ROWS,
-  Z as DEFAULT_BRACKET_ROW_HEIGHT,
-  U as DEFAULT_OPTIONS,
-  rt as DEFAULT_OVERSCAN,
-  $ as DEFAULT_SCALE_LIMITS,
-  M as IDENTITY_TRANSFORM,
-  Mt as MOBILE_MEDIA_QUERY,
-  It as PanZoomController,
+  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,
-  st as VIRTUALIZE_THRESHOLD,
-  w as ZOOM_STEP,
-  ut as applyCollapsed,
-  mt as bracketCardHeight,
-  pt as buildBracketCard,
-  wt as buildBracketRounds,
-  nt as buildLinks,
-  et as buildPath,
-  v as clamp,
-  Pt as estimateVisibleRect,
-  ct as expandRect,
-  xt as findScrollParent,
-  q as fitToViewport,
-  ot as flatten,
-  dt as fromLevels,
-  tt as getAnchors,
-  Lt as horizontalBox,
-  St as injectStyles,
-  vt as layoutTree,
-  bt as measureVisibleRect,
-  Ct as nodesInColumn,
+  ht 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,
+  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,
-  K as panBy,
-  it as placeNodes,
-  Y as resolveOptions,
-  yt as roundScrollLeft,
-  Et as smoothScrollLeft,
-  gt as toCssTransform,
-  at as toTree,
-  ft as toggleCollapsed,
-  Tt as visibleLayout,
-  $t as watchMedia,
-  L as zoomAtPoint
+  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
 };
 //# sourceMappingURL=index.js.map