@bigplay/tree-view-core 0.1.0 → 0.2.1

package/dist/index.js

@@ -1,4 +1,4 @@
-const I = {
+const Y = {
   nodeWidth: 180,
   nodeHeight: 64,
   levelGap: 60,
@@ -6,71 +6,69 @@ const I = {
   direction: "top-to-bottom",
   linkStyle: "elbow"
 };
-function L(e) {
-  return { ...I, ...e };
+function X(e) {
+  return { ...Y, ...e };
 }
-function S(e) {
+function B(e) {
   return e?.children;
 }
-function w(e) {
+function k(e) {
   return e?.id;
 }
-function H(e, t = {}) {
+function ct(e, t = {}) {
   if (e == null) return [];
   const n = Array.isArray(e) ? e : [e];
-  return n.length === 0 ? [] : t.getParentId ? E(n, t) : b(n, t);
-}
-function b(e, t) {
-  const n = t.getId ?? w, i = t.getChildren ?? S, r = /* @__PURE__ */ new Set();
-  function o(s, h, l, d) {
-    const c = P(n(s), d);
-    v(c, r);
-    const p = (i(s) ?? []).map((f, m) => o(f, h + 1, c, `${d}.${m}`));
-    return { id: c, data: s, depth: h, parentId: l, children: p, hasChildren: p.length > 0, collapsed: !1 };
+  return n.length === 0 ? [] : t.getParentId ? G(n, t) : F(n, t);
+}
+function F(e, t) {
+  const n = t.getId ?? k, i = t.getChildren ?? B, o = /* @__PURE__ */ new Set();
+  function r(s, h, c, l) {
+    const d = A(n(s), l);
+    R(d, o);
+    const p = (i(s) ?? []).map((a, f) => r(a, h + 1, d, `${l}.${f}`));
+    return { id: d, data: s, depth: h, parentId: c, children: p, hasChildren: p.length > 0, collapsed: !1 };
   }
-  return e.map((s, h) => o(s, 0, null, String(h)));
-}
-function E(e, t) {
-  const n = t.getId ?? w, i = /* @__PURE__ */ new Set(), r = e.map((l, d) => {
-    const c = P(n(l), String(d));
-    return v(c, i), { id: c, data: l, depth: 0, parentId: null, children: [], hasChildren: !1, collapsed: !1 };
-  }), o = new Map(r.map((l) => [l.id, l])), s = [];
-  if (r.forEach((l, d) => {
-    const c = t.getParentId(e[d]), a = c == null ? void 0 : o.get(String(c));
-    if (!a) {
-      s.push(l);
+  return e.map((s, h) => r(s, 0, null, String(h)));
+}
+function G(e, t) {
+  const n = t.getId ?? k, i = /* @__PURE__ */ new Set(), o = e.map((c, l) => {
+    const d = A(n(c), String(l));
+    return R(d, i), { id: d, 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, l) => {
+    const d = t.getParentId(e[l]), u = d == null ? void 0 : r.get(String(d));
+    if (!u) {
+      s.push(c);
       return;
     }
-    l.parentId = a.id, a.children.push(l), a.hasChildren = !0;
-  }), M(s) !== r.length)
+    c.parentId = u.id, u.children.push(c), u.hasChildren = !0;
+  }), N(s) !== o.length)
     throw new Error("[tree-view] В данных есть цикл: часть узлов ссылается друг на друга по кругу.");
   return s;
 }
-function M(e) {
+function N(e) {
   const t = [...e];
-  let n = 0;
-  for (; t.length > 0; ) {
-    const i = t.shift();
-    n += 1;
-    for (const r of i.children)
-      r.depth = i.depth + 1, t.push(r);
+  for (let n = 0; n < t.length; n += 1) {
+    const i = t[n];
+    for (const o of i.children)
+      o.depth = i.depth + 1, t.push(o);
   }
-  return n;
+  return t.length;
 }
-function P(e, t) {
+function A(e, t) {
   return e == null || e === "" ? t : String(e);
 }
-function v(e, t) {
+function R(e, t) {
   if (t.has(e))
     throw new Error(`[tree-view] Повторяющийся id узла: "${e}". Идентификаторы должны быть уникальными.`);
   t.add(e);
 }
-function G(e, t = {}) {
-  const n = e.filter((o) => o.length > 0);
+function lt(e, t = {}) {
+  const n = e.filter((r) => r.length > 0);
   if (n.length === 0) return [];
-  const i = n.length - 1, r = n.map(
-    (o, s) => o.map((h, l) => ({
-      id: D(h, s, l, t.getId),
+  const i = n.length - 1, o = n.map(
+    (r, s) => r.map((h, c) => ({
+      id: V(h, s, c, t.getId),
       data: h,
       // Финал — корень, поэтому глубина считается от последнего уровня.
       depth: i - s,
@@ -80,162 +78,208 @@ function G(e, t = {}) {
       collapsed: !1
     }))
   );
-  for (let o = 0; o < i; o += 1) {
-    const s = r[o], h = r[o + 1], l = Math.ceil(s.length / h.length);
-    s.forEach((d, c) => {
-      const a = h[Math.min(Math.floor(c / l), h.length - 1)];
-      d.parentId = a.id, a.children.push(d), a.hasChildren = !0;
+  for (let r = 0; r < i; r += 1) {
+    const s = o[r], h = o[r + 1], c = Math.ceil(s.length / h.length);
+    s.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;
     });
   }
-  return r[i];
+  return o[i];
 }
-function D(e, t, n, i) {
-  const r = i ? i(e, t, n) : e?.id;
-  return r == null || r === "" ? `${t}.${n}` : String(r);
+function V(e, t, n, i) {
+  const o = i ? i(e, t, n) : e?.id;
+  return o == null || o === "" ? `${t}.${n}` : String(o);
 }
-function Z(e, t) {
+function at(e, t) {
   if (t.size === 0) return e;
   function n(i) {
-    const r = t.has(i.id);
+    const o = t.has(i.id);
     return {
       ...i,
-      collapsed: r,
-      children: r ? [] : i.children.map(n)
+      collapsed: o,
+      children: o ? [] : i.children.map(n)
     };
   }
   return e.map(n);
 }
-function _(e, t) {
+function dt(e, t) {
   const n = new Set(e);
   return n.delete(t) || n.add(t), n;
 }
-function u(e) {
+const W = 2, Z = 40;
+function ut(e, t = {}) {
+  const n = e?.teams ?? [], i = Math.max(t.rows ?? W, n.length), o = t.techDefeatLabel ?? "ТП", r = n.map((s, h) => {
+    const c = s.isTechDefeat === !0, l = s.isWinner === !0;
+    return {
+      key: String(s.id ?? `team-${h}`),
+      team: s,
+      score: c ? o : String(s.score ?? ""),
+      isWinner: l,
+      isLoser: !l,
+      isMyTeam: s.isMyTeam === !0,
+      isTechDefeat: c,
+      isEmpty: !1
+    };
+  });
+  for (let s = n.length; s < i; s += 1)
+    r.push({
+      key: `empty-${s}`,
+      team: null,
+      score: "",
+      isWinner: !1,
+      isLoser: !1,
+      isMyTeam: !1,
+      isTechDefeat: !1,
+      isEmpty: !0
+    });
+  return { rows: r, hasMyTeam: n.some((s) => s.isMyTeam === !0) };
+}
+function ft(e, t = {}) {
+  const n = e?.teams ?? [];
+  return Math.max(t.rows ?? W, n.length) * (t.rowHeight ?? Z);
+}
+function m(e) {
   return Math.round(e * 100) / 100;
 }
-function z(e) {
+function q(e) {
   return e === "top-to-bottom" || e === "bottom-to-top";
 }
-function T(e, t, n) {
-  const i = e.x + e.width / 2, r = e.y + e.height / 2, o = t.x + t.width / 2, s = t.y + t.height / 2;
+function K(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: o, 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: o, 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: r }, to: { x: t.x, y: s } };
+      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: r }, to: { x: t.x + t.width, y: s } };
+      return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: s } };
   }
 }
-function O(e, t, n, i) {
-  const r = u(e.x), o = u(e.y), s = u(t.x), h = u(t.y);
+function j(e, t, n, i) {
+  const o = m(e.x), r = m(e.y), s = m(t.x), h = m(t.y);
   if (n === "straight")
-    return `M ${r} ${o} L ${s} ${h}`;
-  const l = z(i), d = u((r + s) / 2), c = u((o + h) / 2);
-  return n === "elbow" ? l ? `M ${r} ${o} L ${r} ${c} L ${s} ${c} L ${s} ${h}` : `M ${r} ${o} L ${d} ${o} L ${d} ${h} L ${s} ${h}` : l ? `M ${r} ${o} C ${r} ${c} ${s} ${c} ${s} ${h}` : `M ${r} ${o} C ${d} ${o} ${d} ${h} ${s} ${h}`;
-}
-function Y(e, t) {
-  const n = new Map(e.map((r) => [r.id, r])), i = [];
-  for (const r of e) {
-    const o = r.parentId == null ? void 0 : n.get(r.parentId);
-    if (!o) continue;
-    const { from: s, to: h } = T(o, r, t.direction);
+    return `M ${o} ${r} L ${s} ${h}`;
+  const c = q(i), l = m((o + s) / 2), d = m((r + h) / 2);
+  return n === "elbow" ? c ? `M ${o} ${r} L ${o} ${d} L ${s} ${d} L ${s} ${h}` : `M ${o} ${r} L ${l} ${r} L ${l} ${h} L ${s} ${h}` : c ? `M ${o} ${r} C ${o} ${d} ${s} ${d} ${s} ${h}` : `M ${o} ${r} C ${l} ${r} ${l} ${h} ${s} ${h}`;
+}
+function J(e, t) {
+  const n = new Map(e.map((o) => [o.id, o])), i = [];
+  for (const o of e) {
+    const r = o.parentId == null ? void 0 : n.get(o.parentId);
+    if (!r) continue;
+    const { from: s, to: h } = K(r, o, t.direction);
     i.push({
-      id: `${o.id}->${r.id}`,
-      source: o,
-      target: r,
-      path: O(s, h, t.linkStyle, t.direction)
+      id: `${r.id}->${o.id}`,
+      source: r,
+      target: o,
+      path: j(s, h, t.linkStyle, t.direction)
     });
   }
   return i;
 }
-function W(e) {
-  const t = e.direction === "top-to-bottom" || e.direction === "bottom-to-top", n = t ? e.nodeHeight : e.nodeWidth, i = t ? e.nodeWidth : e.nodeHeight;
-  return {
-    vertical: t,
-    alongSize: n,
-    acrossSize: i,
-    alongStep: n + e.levelGap,
-    acrossStep: i + e.siblingGap
-  };
+function D(e, t) {
+  return typeof e == "function" ? e(t) : e;
 }
-function A(e) {
-  const t = /* @__PURE__ */ new Map();
-  let n = 0, i = 0;
-  function r(o) {
-    if (o.depth > i && (i = o.depth), o.children.length === 0) {
-      const l = n;
-      return n += 1, t.set(o.id, l), l;
+function Q(e, t) {
+  const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [];
+  let r = 0;
+  const s = [];
+  function h(a) {
+    const f = D(t.nodeWidth, a), I = D(t.nodeHeight, a), b = n ? I : f, w = n ? f : I;
+    s[a.depth] = Math.max(s[a.depth] ?? 0, b);
+    const P = r, O = o.length;
+    let g = r;
+    if (a.children.length > 0) {
+      const $ = a.children.map(h), S = $[0], T = $[$.length - 1], U = S.across + S.acrossSize / 2, _ = T.across + T.acrossSize / 2;
+      g = (U + _) / 2 - w / 2;
+      const v = P - g;
+      if (v > 0) {
+        for (let M = O; M < o.length; M += 1) o[M].across += v;
+        g = P;
+      }
     }
-    const s = o.children.map(r), h = (s[0] + s[s.length - 1]) / 2;
-    return t.set(o.id, h), h;
+    const y = { depth: a.depth, along: 0, across: g, alongSize: b, acrossSize: w };
+    return i.set(a.id, y), o.push(y), r = Math.max(r, g + w + t.siblingGap), y;
+  }
+  e.forEach(h);
+  const c = [];
+  let l = 0;
+  for (let a = 0; a < s.length; a += 1)
+    c[a] = l, l += (s[a] ?? 0) + t.levelGap;
+  let d = 0;
+  for (const a of o) {
+    const f = s[a.depth] ?? a.alongSize;
+    a.along = c[a.depth] + (f - a.alongSize) / 2, d = Math.max(d, a.across + a.acrossSize);
   }
-  return e.forEach(r), { orders: t, maxOrder: Math.max(0, n - 1), maxDepth: i };
+  const u = s.length - 1, p = u < 0 ? 0 : c[u] + s[u];
+  return { byId: i, alongExtent: p, acrossExtent: d };
 }
-function X(e) {
+function tt(e) {
   const t = [];
   function n(i) {
     t.push(i), i.children.forEach(n);
   }
   return e.forEach(n), t;
 }
-function F(e, t) {
-  const n = L(t), i = W(n);
+function pt(e, t) {
+  const n = X(t);
   if (e.length === 0)
     return { nodes: [], links: [], width: 0, height: 0 };
-  const { orders: r, maxOrder: o, maxDepth: s } = A(e), h = s * i.alongStep + i.alongSize, l = o * i.acrossStep + i.acrossSize, d = n.direction === "bottom-to-top" || n.direction === "right-to-left", c = X(e).map((a) => {
-    const p = a.depth * i.alongStep, f = r.get(a.id) * i.acrossStep, m = d ? h - i.alongSize - p : p;
+  const i = n.direction === "top-to-bottom" || n.direction === "bottom-to-top", { byId: o, alongExtent: r, acrossExtent: s } = Q(e, n), h = n.direction === "bottom-to-top" || n.direction === "right-to-left", c = tt(e).map((l) => {
+    const { along: d, across: u, alongSize: p, acrossSize: a } = o.get(l.id), f = h ? r - p - d : d;
     return {
-      id: a.id,
-      data: a.data,
-      depth: a.depth,
-      parentId: a.parentId,
-      x: i.vertical ? f : m,
-      y: i.vertical ? m : f,
-      width: n.nodeWidth,
-      height: n.nodeHeight,
-      hasChildren: a.hasChildren,
-      collapsed: a.collapsed
+      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,
+      hasChildren: l.hasChildren,
+      collapsed: l.collapsed
     };
   });
   return {
     nodes: c,
-    links: Y(c, n),
-    width: i.vertical ? l : h,
-    height: i.vertical ? h : l
+    links: J(c, n),
+    width: i ? s : r,
+    height: i ? r : s
   };
 }
-const $ = { min: 0.2, max: 3 }, y = { x: 0, y: 0, scale: 1 };
-function C(e, t, n) {
+const L = { min: 0.2, max: 3 }, E = { x: 0, y: 0, scale: 1 };
+function H(e, t, n) {
   return Math.min(Math.max(e, t), n);
 }
-function k(e, t, n = 24, i = $) {
+function et(e, t, n = 24, i = L) {
   if (e.width <= 0 || e.height <= 0 || t.width <= 0 || t.height <= 0)
-    return { ...y };
-  const r = Math.max(t.width - n * 2, 1), o = Math.max(t.height - n * 2, 1), s = Math.min(r / e.width, o / e.height, 1), h = C(s, i.min, i.max);
+    return { ...E };
+  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), h = H(s, i.min, i.max);
   return {
     scale: h,
     x: (t.width - e.width * h) / 2,
     y: (t.height - e.height * h) / 2
   };
 }
-function U(e, t, n) {
+function nt(e, t, n) {
   return { ...e, x: e.x + t, y: e.y + n };
 }
-function x(e, t, n, i = $) {
-  const r = C(e.scale * t, i.min, i.max);
-  if (r === e.scale) return e;
-  const o = (n.x - e.x) / e.scale, s = (n.y - e.y) / e.scale;
-  return { scale: r, x: n.x - o * r, y: n.y - s * r };
+function C(e, t, n, i = L) {
+  const o = H(e.scale * t, i.min, i.max);
+  if (o === e.scale) return e;
+  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 N(e) {
+function mt(e) {
   return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
 }
-const g = 1.2;
-class B {
+const x = 1.2;
+class gt {
   constructor(t) {
-    this.params = t, this.transform = { ...y }, this.element = null, this.pointers = /* @__PURE__ */ new Map(), this.lastPinchDistance = 0, this.onPointerDown = (n) => {
+    this.params = t, this.transform = { ...E }, 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);
@@ -244,15 +288,15 @@ class B {
           this.pinch();
           return;
         }
-        this.set(U(this.transform, n.clientX - i.x, n.clientY - i.y));
+        this.set(nt(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 ? g : 1 / g;
-      this.set(x(this.transform, i, this.toLocalPoint(n), this.limits));
+      const i = n.deltaY < 0 ? x : 1 / x;
+      this.set(C(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -268,7 +312,7 @@ class B {
   fit(t, n = 24) {
     const i = this.element;
     i && this.set(
-      k(
+      et(
         t,
         { width: i.clientWidth, height: i.clientHeight },
         n,
@@ -277,20 +321,20 @@ class B {
     );
   }
   zoomIn() {
-    this.zoomToCenter(g);
+    this.zoomToCenter(x);
   }
   zoomOut() {
-    this.zoomToCenter(1 / g);
+    this.zoomToCenter(1 / x);
   }
   reset() {
-    this.set({ ...y });
+    this.set({ ...E });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
     this.transform = { ...t }, this.params.onChange(this.transform);
   }
   get limits() {
-    return this.params.limits?.() ?? $;
+    return this.params.limits?.() ?? L;
   }
   isPannable() {
     return this.params.pannable?.() ?? !0;
@@ -305,7 +349,7 @@ class B {
   }
   zoomToCenter(t) {
     const n = this.element, i = { x: (n?.clientWidth ?? 0) / 2, y: (n?.clientHeight ?? 0) / 2 };
-    this.set(x(this.transform, t, i, this.limits));
+    this.set(C(this.transform, t, i, this.limits));
   }
   /** Два пальца: масштабируем вокруг точки ровно между ними. */
   pinch() {
@@ -314,42 +358,92 @@ class B {
     if (!t || !n) return;
     const i = Math.hypot(t.x - n.x, t.y - n.y);
     if (this.lastPinchDistance > 0 && i > 0) {
-      const r = this.toLocalPoint({
+      const o = this.toLocalPoint({
         clientX: (t.x + n.x) / 2,
         clientY: (t.y + n.y) / 2
       });
-      this.set(x(this.transform, i / this.lastPinchDistance, r, this.limits));
+      this.set(C(this.transform, i / this.lastPinchDistance, o, this.limits));
     }
     this.lastPinchDistance = i;
   }
 }
-function R(e, t = "tree-view-styles") {
+function xt(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 it = 400, ot = 150;
+function z(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 st(e) {
+  const { source: t, target: n } = e, i = Math.min(t.x, n.x), o = Math.min(t.y, n.y);
+  return {
+    x: i,
+    y: o,
+    width: Math.max(t.x + t.width, n.x + n.width) - i,
+    height: Math.max(t.y + t.height, n.y + n.height) - o
+  };
+}
+function rt(e, t) {
+  return { x: e.x - t, y: e.y - t, width: e.width + t * 2, height: e.height + t * 2 };
+}
+function wt(e, t, n = it) {
+  if (!t || e.nodes.length < ot) return e;
+  if (t.width <= 0 || t.height <= 0)
+    return { nodes: [], links: [], width: e.width, height: e.height };
+  const i = rt(t, n), o = [], r = [];
+  for (const s of e.nodes)
+    z(i, s) && o.push(s);
+  for (const s of e.links)
+    z(i, st(s)) && r.push(s);
+  return { nodes: o, links: r, width: e.width, height: e.height };
+}
+function yt() {
+  return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
+}
+function $t(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), 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: (r - i) / t,
+    height: (s - o) / t
+  };
+}
 export {
-  I as DEFAULT_OPTIONS,
-  $ as DEFAULT_SCALE_LIMITS,
-  y as IDENTITY_TRANSFORM,
-  B as PanZoomController,
-  g as ZOOM_STEP,
-  Z as applyCollapsed,
-  A as assignOrders,
-  Y as buildLinks,
-  O as buildPath,
-  C as clamp,
-  k as fitToViewport,
-  X as flatten,
-  G as fromLevels,
-  T as getAnchors,
-  R as injectStyles,
-  F as layoutTree,
-  U as panBy,
-  L as resolveOptions,
-  N as toCssTransform,
-  H as toTree,
-  _ as toggleCollapsed,
-  x as zoomAtPoint
+  W as DEFAULT_BRACKET_ROWS,
+  Z as DEFAULT_BRACKET_ROW_HEIGHT,
+  Y as DEFAULT_OPTIONS,
+  it as DEFAULT_OVERSCAN,
+  L as DEFAULT_SCALE_LIMITS,
+  E as IDENTITY_TRANSFORM,
+  gt as PanZoomController,
+  ot as VIRTUALIZE_THRESHOLD,
+  x as ZOOM_STEP,
+  at as applyCollapsed,
+  ft as bracketCardHeight,
+  ut as buildBracketCard,
+  J as buildLinks,
+  j as buildPath,
+  H as clamp,
+  yt as estimateVisibleRect,
+  rt as expandRect,
+  et as fitToViewport,
+  tt as flatten,
+  lt as fromLevels,
+  K as getAnchors,
+  xt as injectStyles,
+  pt as layoutTree,
+  $t as measureVisibleRect,
+  nt as panBy,
+  Q as placeNodes,
+  X as resolveOptions,
+  mt as toCssTransform,
+  ct as toTree,
+  dt as toggleCollapsed,
+  wt as visibleLayout,
+  C as zoomAtPoint
 };
 //# sourceMappingURL=index.js.map