@bigplay/tree-view-core 0.2.1 → 0.3.1

package/dist/index.js

@@ -1,4 +1,4 @@
-const Y = {
+const U = {
   nodeWidth: 180,
   nodeHeight: 64,
   levelGap: 60,
@@ -6,45 +6,45 @@ const Y = {
   direction: "top-to-bottom",
   linkStyle: "elbow"
 };
-function X(e) {
-  return { ...Y, ...e };
+function Y(e) {
+  return { ...U, ...e };
 }
-function B(e) {
+function X(e) {
   return e?.children;
 }
-function k(e) {
+function W(e) {
   return e?.id;
 }
-function ct(e, t = {}) {
+function at(e, t = {}) {
   if (e == null) return [];
   const n = Array.isArray(e) ? e : [e];
-  return n.length === 0 ? [] : t.getParentId ? G(n, t) : F(n, t);
+  return n.length === 0 ? [] : t.getParentId ? F(n, t) : G(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 };
+function G(e, t) {
+  const n = t.getId ?? W, i = t.getChildren ?? X, 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 };
   }
-  return e.map((s, h) => r(s, 0, null, String(h)));
+  return e.map((r, h) => s(r, 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 = [];
+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 };
+  }), 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 : r.get(String(d));
+    const d = t.getParentId(e[l]), u = d == null ? void 0 : s.get(String(d));
     if (!u) {
-      s.push(c);
+      r.push(c);
       return;
     }
     c.parentId = u.id, u.children.push(c), u.hasChildren = !0;
-  }), N(s) !== o.length)
+  }), N(r) !== o.length)
     throw new Error("[tree-view] В данных есть цикл: часть узлов ссылается друг на друга по кругу.");
-  return s;
+  return r;
 }
 function N(e) {
   const t = [...e];
@@ -55,32 +55,32 @@ function N(e) {
   }
   return t.length;
 }
-function A(e, t) {
+function k(e, t) {
   return e == null || e === "" ? t : String(e);
 }
-function R(e, t) {
+function A(e, t) {
   if (t.has(e))
     throw new Error(`[tree-view] Повторяющийся id узла: "${e}". Идентификаторы должны быть уникальными.`);
   t.add(e);
 }
-function lt(e, t = {}) {
-  const n = e.filter((r) => r.length > 0);
+function dt(e, t = {}) {
+  const n = e.filter((s) => s.length > 0);
   if (n.length === 0) return [];
   const i = n.length - 1, o = n.map(
-    (r, s) => r.map((h, c) => ({
-      id: V(h, s, c, t.getId),
+    (s, r) => s.map((h, c) => ({
+      id: V(h, r, c, t.getId),
       data: h,
       // Финал — корень, поэтому глубина считается от последнего уровня.
-      depth: i - s,
+      depth: i - r,
       parentId: null,
       children: [],
       hasChildren: !1,
       collapsed: !1
     }))
   );
-  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) => {
+  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;
     });
@@ -91,7 +91,7 @@ function V(e, t, n, i) {
   const o = i ? i(e, t, n) : e?.id;
   return o == null || o === "" ? `${t}.${n}` : String(o);
 }
-function at(e, t) {
+function ut(e, t) {
   if (t.size === 0) return e;
   function n(i) {
     const o = t.has(i.id);
@@ -103,28 +103,28 @@ function at(e, t) {
   }
   return e.map(n);
 }
-function dt(e, t) {
+function ft(e, t) {
   const n = new Set(e);
   return n.delete(t) || n.add(t), n;
 }
-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;
+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 c = r.isTechDefeat === !0, l = r.isWinner === !0;
     return {
-      key: String(s.id ?? `team-${h}`),
-      team: s,
-      score: c ? o : String(s.score ?? ""),
+      key: String(r.id ?? `team-${h}`),
+      team: r,
+      score: c ? o : String(r.score ?? ""),
       isWinner: l,
       isLoser: !l,
-      isMyTeam: s.isMyTeam === !0,
+      isMyTeam: r.isMyTeam === !0,
       isTechDefeat: c,
       isEmpty: !1
     };
   });
-  for (let s = n.length; s < i; s += 1)
-    r.push({
-      key: `empty-${s}`,
+  for (let r = n.length; r < i; r += 1)
+    s.push({
+      key: `empty-${r}`,
       team: null,
       score: "",
       isWinner: !1,
@@ -133,103 +133,178 @@ function ut(e, t = {}) {
       isTechDefeat: !1,
       isEmpty: !0
     });
-  return { rows: r, hasMyTeam: n.some((s) => s.isMyTeam === !0) };
+  return { rows: s, hasMyTeam: n.some((r) => r.isMyTeam === !0) };
 }
-function ft(e, t = {}) {
+function mt(e, t = {}) {
   const n = e?.teams ?? [];
-  return Math.max(t.rows ?? W, n.length) * (t.rowHeight ?? Z);
+  return Math.max(t.rows ?? _, n.length) * (t.rowHeight ?? Z);
+}
+const $ = { min: 0.2, max: 3 }, M = { x: 0, y: 0, scale: 1 };
+function v(e, t, n) {
+  return Math.min(Math.max(e, t), n);
+}
+function q(e, t, n = 24, 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 {
+    scale: h,
+    x: (t.width - e.width * h) / 2,
+    y: (t.height - e.height * h) / 2
+  };
+}
+function K(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);
+  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) {
+  return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
+}
+function wt(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) {
+  const t = e.left + e.width / 2 - e.viewport / 2;
+  return v(t, 0, Math.max(0, e.scrollWidth - e.viewport));
+}
+function xt(e) {
+  if (typeof window > "u") return null;
+  let t = e?.parentElement ?? null;
+  for (; t; ) {
+    const { overflowX: n } = window.getComputedStyle(t);
+    if ((n === "auto" || n === "scroll") && t.scrollWidth > t.clientWidth) return t;
+    t = t.parentElement;
+  }
+  return null;
+}
+function Et(e, t) {
+  if (typeof e.scrollTo == "function") {
+    e.scrollTo({ left: t, behavior: "smooth" });
+    return;
+  }
+  e.scrollLeft = t;
+}
+function j(e, t) {
+  return e.getBoundingClientRect().left - t.getBoundingClientRect().left + t.scrollLeft;
+}
+const Q = ".tree-view__node";
+function Ct(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) {
+  return { left: j(e, t), width: e.getBoundingClientRect().width };
+}
+const Mt = "(max-width: 768px)";
+function $t(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) {
   return Math.round(e * 100) / 100;
 }
-function q(e) {
+function J(e) {
   return e === "top-to-bottom" || e === "bottom-to-top";
 }
-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;
+function tt(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":
-      return { from: { x: i, y: e.y + e.height }, to: { x: r, y: t.y } };
+      return { from: { x: i, y: e.y + e.height }, to: { x: s, y: t.y } };
     case "bottom-to-top":
-      return { from: { x: i, y: e.y }, to: { x: r, y: t.y + t.height } };
+      return { from: { x: i, y: e.y }, to: { x: s, y: t.y + t.height } };
     case "left-to-right":
-      return { from: { x: e.x + e.width, y: o }, to: { x: t.x, y: s } };
+      return { from: { x: e.x + e.width, y: o }, to: { x: t.x, y: r } };
     case "right-to-left":
-      return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: s } };
+      return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: r } };
   }
 }
-function j(e, t, n, i) {
-  const o = m(e.x), r = m(e.y), s = m(t.x), h = m(t.y);
+function et(e, t, n, i) {
+  const o = m(e.x), s = m(e.y), r = m(t.x), h = m(t.y);
   if (n === "straight")
-    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}`;
+    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}`;
 }
-function J(e, t) {
+function nt(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);
+    const s = o.parentId == null ? void 0 : n.get(o.parentId);
+    if (!s) continue;
+    const { from: r, to: h } = tt(s, o, t.direction);
     i.push({
-      id: `${r.id}->${o.id}`,
-      source: r,
+      id: `${s.id}->${o.id}`,
+      source: s,
       target: o,
-      path: j(s, h, t.linkStyle, t.direction)
+      path: et(r, h, t.linkStyle, t.direction)
     });
   }
   return i;
 }
-function D(e, t) {
+function R(e, t) {
   return typeof e == "function" ? e(t) : e;
 }
-function Q(e, t) {
+function it(e, t) {
   const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [];
-  let r = 0;
-  const s = [];
+  let s = 0;
+  const r = [];
   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;
+    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 $ = 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 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;
       }
     }
-    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;
+    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 < s.length; a += 1)
-    c[a] = l, l += (s[a] ?? 0) + t.levelGap;
+  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 = s[a.depth] ?? a.alongSize;
+    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 u = s.length - 1, p = u < 0 ? 0 : c[u] + s[u];
+  const u = r.length - 1, p = u < 0 ? 0 : c[u] + r[u];
   return { byId: i, alongExtent: p, acrossExtent: d };
 }
-function tt(e) {
+function ot(e) {
   const t = [];
   function n(i) {
     t.push(i), i.children.forEach(n);
   }
   return e.forEach(n), t;
 }
-function pt(e, t) {
-  const n = X(t);
+function vt(e, t) {
+  const n = Y(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: 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;
+  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;
     return {
       id: l.id,
       data: l.data,
@@ -245,41 +320,15 @@ function pt(e, t) {
   });
   return {
     nodes: c,
-    links: J(c, n),
-    width: i ? s : r,
-    height: i ? r : s
+    links: nt(c, n),
+    width: i ? r : s,
+    height: i ? s : r
   };
 }
-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 et(e, t, n = 24, i = L) {
-  if (e.width <= 0 || e.height <= 0 || t.width <= 0 || t.height <= 0)
-    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 nt(e, t, n) {
-  return { ...e, x: e.x + t, y: e.y + n };
-}
-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 mt(e) {
-  return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
-}
-const x = 1.2;
-class gt {
+const w = 1.2;
+class It {
   constructor(t) {
-    this.params = t, this.transform = { ...E }, this.element = null, this.pointers = /* @__PURE__ */ new Map(), this.lastPinchDistance = 0, this.onPointerDown = (n) => {
+    this.params = t, this.transform = { ...M }, 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);
@@ -288,15 +337,15 @@ class gt {
           this.pinch();
           return;
         }
-        this.set(nt(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 ? x : 1 / x;
-      this.set(C(this.transform, i, this.toLocalPoint(n), this.limits));
+      const i = n.deltaY < 0 ? w : 1 / w;
+      this.set(L(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -312,7 +361,7 @@ class gt {
   fit(t, n = 24) {
     const i = this.element;
     i && this.set(
-      et(
+      q(
         t,
         { width: i.clientWidth, height: i.clientHeight },
         n,
@@ -321,20 +370,20 @@ class gt {
     );
   }
   zoomIn() {
-    this.zoomToCenter(x);
+    this.zoomToCenter(w);
   }
   zoomOut() {
-    this.zoomToCenter(1 / x);
+    this.zoomToCenter(1 / w);
   }
   reset() {
-    this.set({ ...E });
+    this.set({ ...M });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
     this.transform = { ...t }, this.params.onChange(this.transform);
   }
   get limits() {
-    return this.params.limits?.() ?? L;
+    return this.params.limits?.() ?? $;
   }
   isPannable() {
     return this.params.pannable?.() ?? !0;
@@ -349,7 +398,7 @@ class gt {
   }
   zoomToCenter(t) {
     const n = this.element, i = { x: (n?.clientWidth ?? 0) / 2, y: (n?.clientHeight ?? 0) / 2 };
-    this.set(C(this.transform, t, i, this.limits));
+    this.set(L(this.transform, t, i, this.limits));
   }
   /** Два пальца: масштабируем вокруг точки ровно между ними. */
   pinch() {
@@ -362,21 +411,21 @@ class gt {
         clientX: (t.x + n.x) / 2,
         clientY: (t.y + n.y) / 2
       });
-      this.set(C(this.transform, i / this.lastPinchDistance, o, this.limits));
+      this.set(L(this.transform, i / this.lastPinchDistance, o, this.limits));
     }
     this.lastPinchDistance = i;
   }
 }
-function xt(e, t = "tree-view-styles") {
+function St(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;
+const rt = 400, st = 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) {
+function ht(e) {
   const { source: t, target: n } = e, i = Math.min(t.x, n.x), o = Math.min(t.y, n.y);
   return {
     x: i,
@@ -385,65 +434,75 @@ function st(e) {
     height: Math.max(t.y + t.height, n.y + n.height) - o
   };
 }
-function rt(e, t) {
+function ct(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;
+function Tt(e, t, n = rt) {
+  if (!t || e.nodes.length < st) 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() {
+  const i = ct(t, n), o = [], s = [];
+  for (const r of e.nodes)
+    z(i, r) && o.push(r);
+  for (const r of e.links)
+    z(i, ht(r)) && s.push(r);
+  return { nodes: o, links: s, width: e.width, height: e.height };
+}
+function Pt() {
   return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
 }
-function $t(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), 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 } : {
+  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 } : {
     x: (i - n.left) / t,
     y: (o - n.top) / t,
-    width: (r - i) / t,
-    height: (s - o) / t
+    width: (s - i) / t,
+    height: (r - o) / t
   };
 }
 export {
-  W as DEFAULT_BRACKET_ROWS,
+  _ 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
+  U as DEFAULT_OPTIONS,
+  rt as DEFAULT_OVERSCAN,
+  $ as DEFAULT_SCALE_LIMITS,
+  M as IDENTITY_TRANSFORM,
+  Mt as MOBILE_MEDIA_QUERY,
+  It 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,
+  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
 };
 //# sourceMappingURL=index.js.map