@bigplay/tree-view-core 0.3.0 → 0.3.1

package/dist/index.js

@@ -12,41 +12,41 @@ function Y(e) {
 function X(e) {
   return e?.children;
 }
-function z(e) {
+function W(e) {
   return e?.id;
 }
-function lt(e, t = {}) {
+function at(e, t = {}) {
   if (e == null) return [];
   const n = Array.isArray(e) ? e : [e];
-  return n.length === 0 ? [] : t.getParentId ? N(n, t) : G(n, t);
+  return n.length === 0 ? [] : t.getParentId ? F(n, t) : G(n, t);
 }
 function G(e, t) {
-  const n = t.getId ?? z, i = t.getChildren ?? X, o = /* @__PURE__ */ new Set();
-  function s(r, c, h, l) {
-    const d = W(n(r), l);
+  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, c + 1, d, `${l}.${f}`));
-    return { id: d, data: r, depth: c, parentId: h, children: p, hasChildren: p.length > 0, collapsed: !1 };
+    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((r, c) => s(r, 0, null, String(c)));
-}
-function N(e, t) {
-  const n = t.getId ?? z, i = /* @__PURE__ */ new Set(), o = e.map((h, l) => {
-    const d = W(n(h), String(l));
-    return A(d, i), { id: d, data: h, depth: 0, parentId: null, children: [], hasChildren: !1, collapsed: !1 };
-  }), s = new Map(o.map((h) => [h.id, h])), r = [];
-  if (o.forEach((h, l) => {
+  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 };
+  }), 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) {
-      r.push(h);
+      r.push(c);
       return;
     }
-    h.parentId = u.id, u.children.push(h), u.hasChildren = !0;
-  }), V(r) !== o.length)
+    c.parentId = u.id, u.children.push(c), u.hasChildren = !0;
+  }), N(r) !== o.length)
     throw new Error("[tree-view] В данных есть цикл: часть узлов ссылается друг на друга по кругу.");
   return r;
 }
-function V(e) {
+function N(e) {
   const t = [...e];
   for (let n = 0; n < t.length; n += 1) {
     const i = t[n];
@@ -55,7 +55,7 @@ function V(e) {
   }
   return t.length;
 }
-function W(e, t) {
+function k(e, t) {
   return e == null || e === "" ? t : String(e);
 }
 function A(e, t) {
@@ -63,13 +63,13 @@ function A(e, t) {
     throw new Error(`[tree-view] Повторяющийся id узла: "${e}". Идентификаторы должны быть уникальными.`);
   t.add(e);
 }
-function at(e, t = {}) {
+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(
-    (s, r) => s.map((c, h) => ({
-      id: F(c, r, h, t.getId),
-      data: c,
+    (s, r) => s.map((h, c) => ({
+      id: V(h, r, c, t.getId),
+      data: h,
       // Финал — корень, поэтому глубина считается от последнего уровня.
       depth: i - r,
       parentId: null,
@@ -79,19 +79,19 @@ function at(e, t = {}) {
     }))
   );
   for (let s = 0; s < i; s += 1) {
-    const r = o[s], c = o[s + 1], h = Math.ceil(r.length / c.length);
+    const r = o[s], h = o[s + 1], c = Math.ceil(r.length / h.length);
     r.forEach((l, d) => {
-      const u = c[Math.min(Math.floor(d / h), c.length - 1)];
+      const u = h[Math.min(Math.floor(d / c), h.length - 1)];
       l.parentId = u.id, u.children.push(l), u.hasChildren = !0;
     });
   }
   return o[i];
 }
-function F(e, t, n, i) {
+function V(e, t, n, i) {
   const o = i ? i(e, t, n) : e?.id;
   return o == null || o === "" ? `${t}.${n}` : String(o);
 }
-function dt(e, t) {
+function ut(e, t) {
   if (t.size === 0) return e;
   function n(i) {
     const o = t.has(i.id);
@@ -103,22 +103,22 @@ function dt(e, t) {
   }
   return e.map(n);
 }
-function ut(e, t) {
+function ft(e, t) {
   const n = new Set(e);
   return n.delete(t) || n.add(t), n;
 }
 const _ = 2, Z = 40;
-function ft(e, t = {}) {
-  const n = e?.teams ?? [], i = Math.max(t.rows ?? _, n.length), o = t.techDefeatLabel ?? "ТП", s = n.map((r, c) => {
-    const h = r.isTechDefeat === !0, l = r.isWinner === !0;
+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(r.id ?? `team-${c}`),
+      key: String(r.id ?? `team-${h}`),
       team: r,
-      score: h ? o : String(r.score ?? ""),
+      score: c ? o : String(r.score ?? ""),
       isWinner: l,
       isLoser: !l,
       isMyTeam: r.isMyTeam === !0,
-      isTechDefeat: h,
+      isTechDefeat: c,
       isEmpty: !1
     };
   });
@@ -135,48 +135,48 @@ function ft(e, t = {}) {
     });
   return { rows: s, hasMyTeam: n.some((r) => r.isMyTeam === !0) };
 }
-function pt(e, t = {}) {
+function mt(e, t = {}) {
   const n = e?.teams ?? [];
   return Math.max(t.rows ?? _, n.length) * (t.rowHeight ?? Z);
 }
-const $ = { min: 0.2, max: 3 }, C = { x: 0, y: 0, scale: 1 };
+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 { ...C };
-  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), c = v(r, i.min, i.max);
+    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: c,
-    x: (t.width - e.width * c) / 2,
-    y: (t.height - e.height * c) / 2
+    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 M(e, t, n, i = $) {
+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 mt(e) {
+function gt(e) {
   return `translate(${e.x}px, ${e.y}px) scale(${e.scale})`;
 }
-function gt(e, t) {
+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 wt(e) {
+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 yt(e) {
+function xt(e) {
   if (typeof window > "u") return null;
   let t = e?.parentElement ?? null;
   for (; t; ) {
@@ -186,28 +186,28 @@ function yt(e) {
   }
   return null;
 }
-function xt(e, t) {
+function Et(e, t) {
   if (typeof e.scrollTo == "function") {
     e.scrollTo({ left: t, behavior: "smooth" });
     return;
   }
   e.scrollLeft = t;
 }
-function Et(e, t) {
+function j(e, t) {
   return e.getBoundingClientRect().left - t.getBoundingClientRect().left + t.scrollLeft;
 }
-const j = ".tree-view__node";
-function Lt(e, t, n, i) {
+const Q = ".tree-view__node";
+function Ct(e, t, n, i) {
   const o = e.getBoundingClientRect().left + i;
-  return Array.from(e.querySelectorAll(j)).filter((r) => {
-    const c = r.getBoundingClientRect();
-    return Math.floor((c.left + c.width / 2 - o) / n) === t;
+  return Array.from(e.querySelectorAll(Q)).filter((r) => {
+    const h = r.getBoundingClientRect();
+    return Math.floor((h.left + h.width / 2 - o) / n) === t;
   });
 }
-function Mt(e) {
-  return typeof e.scrollIntoView != "function" ? !1 : (e.scrollIntoView({ behavior: "smooth", block: "center", inline: "center" }), !0);
+function Lt(e, t) {
+  return { left: j(e, t), width: e.getBoundingClientRect().width };
 }
-const Ct = "(max-width: 768px)";
+const Mt = "(max-width: 768px)";
 function $t(e, t) {
   if (typeof window > "u" || typeof window.matchMedia != "function") return () => {
   };
@@ -217,10 +217,10 @@ function $t(e, t) {
 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 J(e, t, n) {
+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":
@@ -233,24 +233,24 @@ function J(e, t, n) {
       return { from: { x: e.x, y: o }, to: { x: t.x + t.width, y: r } };
   }
 }
-function tt(e, t, n, i) {
-  const o = m(e.x), s = m(e.y), r = m(t.x), c = 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} ${s} L ${r} ${c}`;
-  const h = Q(i), l = m((o + r) / 2), d = m((s + c) / 2);
-  return n === "elbow" ? h ? `M ${o} ${s} L ${o} ${d} L ${r} ${d} L ${r} ${c}` : `M ${o} ${s} L ${l} ${s} L ${l} ${c} L ${r} ${c}` : h ? `M ${o} ${s} C ${o} ${d} ${r} ${d} ${r} ${c}` : `M ${o} ${s} C ${l} ${s} ${l} ${c} ${r} ${c}`;
+    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 et(e, t) {
+function nt(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: c } = J(s, o, t.direction);
+    const { from: r, to: h } = tt(s, o, t.direction);
     i.push({
       id: `${s.id}->${o.id}`,
       source: s,
       target: o,
-      path: tt(r, c, t.linkStyle, t.direction)
+      path: et(r, h, t.linkStyle, t.direction)
     });
   }
   return i;
@@ -258,41 +258,41 @@ function et(e, t) {
 function R(e, t) {
   return typeof e == "function" ? e(t) : e;
 }
-function nt(e, t) {
+function it(e, t) {
   const n = t.direction === "top-to-bottom" || t.direction === "bottom-to-top", i = /* @__PURE__ */ new Map(), o = [];
   let s = 0;
   const r = [];
-  function c(a) {
+  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(c), b = E[0], P = E[E.length - 1], B = b.across + b.acrossSize / 2, H = P.across + P.acrossSize / 2;
+      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 L = O; L < o.length; L += 1) o[L].across += D;
+        for (let C = O; C < o.length; C += 1) o[C].across += D;
         g = T;
       }
     }
     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(c);
-  const h = [];
+  e.forEach(h);
+  const c = [];
   let l = 0;
   for (let a = 0; a < r.length; a += 1)
-    h[a] = l, l += (r[a] ?? 0) + t.levelGap;
+    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 = h[a.depth] + (f - a.alongSize) / 2, d = Math.max(d, a.across + a.acrossSize);
+    a.along = c[a.depth] + (f - a.alongSize) / 2, d = Math.max(d, a.across + a.acrossSize);
   }
-  const u = r.length - 1, p = u < 0 ? 0 : h[u] + r[u];
+  const u = r.length - 1, p = u < 0 ? 0 : c[u] + r[u];
   return { byId: i, alongExtent: p, acrossExtent: d };
 }
-function it(e) {
+function ot(e) {
   const t = [];
   function n(i) {
     t.push(i), i.children.forEach(n);
@@ -303,8 +303,8 @@ 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: s, acrossExtent: r } = nt(e, n), c = n.direction === "bottom-to-top" || n.direction === "right-to-left", h = it(e).map((l) => {
-    const { along: d, across: u, alongSize: p, acrossSize: a } = o.get(l.id), f = c ? s - 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,
@@ -319,8 +319,8 @@ function vt(e, t) {
     };
   });
   return {
-    nodes: h,
-    links: et(h, n),
+    nodes: c,
+    links: nt(c, n),
     width: i ? r : s,
     height: i ? s : r
   };
@@ -328,7 +328,7 @@ function vt(e, t) {
 const w = 1.2;
 class It {
   constructor(t) {
-    this.params = t, this.transform = { ...C }, 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);
@@ -345,7 +345,7 @@ class It {
       if (!this.isZoomable()) return;
       n.preventDefault();
       const i = n.deltaY < 0 ? w : 1 / w;
-      this.set(M(this.transform, i, this.toLocalPoint(n), this.limits));
+      this.set(L(this.transform, i, this.toLocalPoint(n), this.limits));
     };
   }
   /** Подписывается на события элемента. Повторный вызов сначала отписывается. */
@@ -376,7 +376,7 @@ class It {
     this.zoomToCenter(1 / w);
   }
   reset() {
-    this.set({ ...C });
+    this.set({ ...M });
   }
   /** Устанавливает состояние напрямую (например, восстановление после перезагрузки). */
   set(t) {
@@ -398,7 +398,7 @@ class It {
   }
   zoomToCenter(t) {
     const n = this.element, i = { x: (n?.clientWidth ?? 0) / 2, y: (n?.clientHeight ?? 0) / 2 };
-    this.set(M(this.transform, t, i, this.limits));
+    this.set(L(this.transform, t, i, this.limits));
   }
   /** Два пальца: масштабируем вокруг точки ровно между ними. */
   pinch() {
@@ -411,7 +411,7 @@ class It {
         clientX: (t.x + n.x) / 2,
         clientY: (t.y + n.y) / 2
       });
-      this.set(M(this.transform, i / this.lastPinchDistance, o, this.limits));
+      this.set(L(this.transform, i / this.lastPinchDistance, o, this.limits));
     }
     this.lastPinchDistance = i;
   }
@@ -421,11 +421,11 @@ function St(e, t = "tree-view-styles") {
   const n = document.createElement("style");
   n.id = t, n.textContent = e, document.head.appendChild(n);
 }
-const ot = 400, rt = 150;
-function k(e, t) {
+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,
@@ -437,21 +437,21 @@ function st(e) {
 function ct(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 = ot) {
-  if (!t || e.nodes.length < rt) 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 = ct(t, n), o = [], s = [];
   for (const r of e.nodes)
-    k(i, r) && o.push(r);
+    z(i, r) && o.push(r);
   for (const r of e.links)
-    k(i, st(r)) && s.push(r);
+    z(i, ht(r)) && s.push(r);
   return { nodes: o, links: s, width: e.width, height: e.height };
 }
-function bt() {
+function Pt() {
   return typeof window > "u" ? null : { x: 0, y: 0, width: window.innerWidth, height: window.innerHeight };
 }
-function Pt(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 } : {
@@ -465,44 +465,44 @@ export {
   _ as DEFAULT_BRACKET_ROWS,
   Z as DEFAULT_BRACKET_ROW_HEIGHT,
   U as DEFAULT_OPTIONS,
-  ot as DEFAULT_OVERSCAN,
+  rt as DEFAULT_OVERSCAN,
   $ as DEFAULT_SCALE_LIMITS,
-  C as IDENTITY_TRANSFORM,
-  Ct as MOBILE_MEDIA_QUERY,
+  M as IDENTITY_TRANSFORM,
+  Mt as MOBILE_MEDIA_QUERY,
   It as PanZoomController,
-  j as TREE_NODE_SELECTOR,
-  rt as VIRTUALIZE_THRESHOLD,
+  Q as TREE_NODE_SELECTOR,
+  st as VIRTUALIZE_THRESHOLD,
   w as ZOOM_STEP,
-  dt as applyCollapsed,
-  pt as bracketCardHeight,
-  ft as buildBracketCard,
-  gt as buildBracketRounds,
-  et as buildLinks,
-  tt as buildPath,
+  ut as applyCollapsed,
+  mt as bracketCardHeight,
+  pt as buildBracketCard,
+  wt as buildBracketRounds,
+  nt as buildLinks,
+  et as buildPath,
   v as clamp,
-  bt as estimateVisibleRect,
+  Pt as estimateVisibleRect,
   ct as expandRect,
-  yt as findScrollParent,
+  xt as findScrollParent,
   q as fitToViewport,
-  it as flatten,
-  at as fromLevels,
-  J as getAnchors,
+  ot as flatten,
+  dt as fromLevels,
+  tt as getAnchors,
+  Lt as horizontalBox,
   St as injectStyles,
   vt as layoutTree,
-  Pt as measureVisibleRect,
-  Lt as nodesInColumn,
-  Et as offsetWithin,
+  bt as measureVisibleRect,
+  Ct as nodesInColumn,
+  j as offsetWithin,
   K as panBy,
-  nt as placeNodes,
+  it as placeNodes,
   Y as resolveOptions,
-  wt as roundScrollLeft,
-  Mt as scrollToNode,
-  xt as smoothScrollLeft,
-  mt as toCssTransform,
-  lt as toTree,
-  ut as toggleCollapsed,
+  yt as roundScrollLeft,
+  Et as smoothScrollLeft,
+  gt as toCssTransform,
+  at as toTree,
+  ft as toggleCollapsed,
   Tt as visibleLayout,
   $t as watchMedia,
-  M as zoomAtPoint
+  L as zoomAtPoint
 };
 //# sourceMappingURL=index.js.map