linear-react-components-ui 1.1.26-beta-1 → 1.1.26-beta.10

package/lib/treeview/index.js

@@ -1,185 +1,268 @@
-import { j as g } from "../chunks/jsx-runtime.CYK1ROHF.js";
-import { useState as u, useEffect as q } from "react";
-import w from "lodash";
-import pe from "./Node.js";
-import { default as Oe } from "./Header.js";
-import { TreeviewContext as Se } from "./constants.js";
-import '../assets/index18.css';const qe = (h) => {
-  const {
-    selectedIds: f = [],
-    enableDynamicData: $,
-    allowCheckAllAncestry: I,
-    onNodeOpen: v,
-    allowCheckAllChildren: E,
-    onSelectedIdsChange: p,
-    idsInLoading: z,
-    startNodesOpened: B = !1,
-    alwaysShowArrow: L,
-    nodeElementsValidations: _,
-    nodeRightElements: G,
-    nodeMenuButtonSize: J = "small",
-    nodeToolbarElements: K,
-    onNodeClick: Q,
-    selectedNodeId: X,
-    customClass: Y = "",
-    children: Z,
-    styleForContainer: ee,
-    bordered: te,
-    requiredIds: se = [],
-    customClassForNodes: ne = "",
-    customStyleForNodes: re
-  } = h, [N, le] = u(h.data), [c, P] = u(f), [W, de] = u(f), [C, O] = u(!1), [R, ce] = u(!1), [m, S] = u([]), [b, ie] = u([]), [o] = u({}), y = (e, n = !1, t = [], r = []) => (o[e] !== void 0 ? (t.push(e), n && r.push(e), o[e].forEach((s) => y(s, n, t, r))) : t.push(e), n ? { nodeChildrenIds: t, requiredIds: r } : { nodeChildrenIds: t }), T = (e) => {
-    const n = Object.keys(o).find((t) => o[t].find((r) => r === e));
-    return Number(n);
-  }, U = (e, n = []) => {
-    const t = T(e);
-    if (t) {
-      const r = [...n, Number(t)];
-      return U(Number(t), r);
+import { j as Ce } from "../chunks/jsx-runtime.D1SHvdVE.js";
+import { c as dt } from "../chunks/compiler-runtime.Cu50tn6L.js";
+import { useState as C, useEffect as Ae } from "react";
+import { _ as V } from "../chunks/lodash.CIAK_hAg.js";
+import lt from "./Node.js";
+import { default as qt } from "./Header.js";
+import { TreeviewContext as rt } from "./constants.js";
+import '../assets/index18.css';const mt = (o) => {
+  const e = dt.c(126), {
+    selectedIds: $,
+    enableDynamicData: pe,
+    allowCheckAllAncestry: f,
+    onNodeOpen: D,
+    allowCheckAllChildren: b,
+    onSelectedIdsChange: A,
+    idsInLoading: ve,
+    startNodesOpened: Ge,
+    alwaysShowArrow: ge,
+    nodeElementsValidations: we,
+    nodeRightElements: Ne,
+    nodeMenuButtonSize: Je,
+    nodeToolbarElements: Re,
+    onNodeClick: be,
+    selectedNodeId: Pe,
+    customClass: Ke,
+    children: Oe,
+    styleForContainer: ke,
+    bordered: Xe,
+    requiredIds: H,
+    customClassForNodes: Qe,
+    customStyleForNodes: xe
+  } = o;
+  let z;
+  e[0] !== $ ? (z = $ === void 0 ? [] : $, e[0] = $, e[1] = z) : z = e[1];
+  const S = z, _e = Ge === void 0 ? !1 : Ge, Ee = Je === void 0 ? "small" : Je, Ye = Ke === void 0 ? "" : Ke;
+  let B;
+  e[2] !== H ? (B = H === void 0 ? [] : H, e[2] = H, e[3] = B) : B = e[3];
+  const We = B, je = Qe === void 0 ? "" : Qe, [p, Ze] = C(o.data), [r, Te] = C(S), [P, et] = C(S), [h, Fe] = C(!1), [O, tt] = C(!1);
+  let L;
+  e[4] === Symbol.for("react.memo_cache_sentinel") ? (L = [], e[4] = L) : L = e[4];
+  const [m, T] = C(L);
+  let G;
+  e[5] === Symbol.for("react.memo_cache_sentinel") ? (G = [], e[5] = G) : G = e[5];
+  const [v, st] = C(G);
+  let J;
+  e[6] === Symbol.for("react.memo_cache_sentinel") ? (J = {}, e[6] = J) : J = e[6];
+  const [a] = C(J);
+  let I, K;
+  e[7] !== a ? (I = (t, l, s, n) => {
+    const d = l === void 0 ? !1 : l, i = s === void 0 ? [] : s, c = n === void 0 ? [] : n;
+    return a[t] !== void 0 ? (i.push(t), d && c.push(t), a[t].forEach((u) => I(u, d, i, c))) : i.push(t), d ? {
+      nodeChildrenIds: i,
+      requiredIds: c
+    } : {
+      nodeChildrenIds: i
+    };
+  }, K = (t) => {
+    const l = Object.keys(a).find((s) => a[s].find((n) => n === t));
+    return Number(l);
+  }, e[7] = a, e[8] = I, e[9] = K) : (I = e[8], K = e[9]);
+  const k = K;
+  let g;
+  e[10] !== k ? (g = (t, l) => {
+    const s = l === void 0 ? [] : l, n = k(t);
+    if (n) {
+      const d = [...s, Number(n)];
+      return g(Number(n), d);
     }
-    return n;
-  }, V = (e, n = [], t) => {
-    let r = [];
-    const s = T(e);
-    if (s) {
-      const l = o && o[s].filter((a) => a !== e), d = t && c.includes(t);
-      l && l.length > 0 && (r = c.filter((a) => l.includes(a)));
-      const i = d || r.length > 0 ? [...n] : [...n, s];
-      if (r.length === 0 && !d)
-        return V(s, i, s);
+    return s;
+  }, e[10] = k, e[11] = g) : g = e[11];
+  let w;
+  e[12] !== r || e[13] !== a || e[14] !== k ? (w = (t, l, s) => {
+    const n = l === void 0 ? [] : l;
+    let d = [];
+    const i = k(t);
+    if (i) {
+      const c = a && a[i].filter((q) => q !== t), u = s && r.includes(s);
+      c && c.length > 0 && (d = r.filter((q) => c.includes(q)));
+      const F = u || d.length > 0 ? [...n] : [...n, i];
+      if (d.length === 0 && !u)
+        return w(i, F, i);
     }
     return n;
-  }, k = (e, n, t) => {
-    const r = V(e), s = t.filter((d) => !r.includes(d)), l = c.filter((d) => !n.includes(d));
-    return S(s), l;
-  }, x = (e, n, t = !1, r = !0) => {
-    const s = U(e), l = s.filter((A) => !m.includes(A)), d = s.filter((A) => !c.includes(A)), i = [...c, ...n, ...d], a = [...m, ...l];
-    return r && S(a), t ? { updatedIdsWithAncestryIds: i, requiredParentsIds: a } : { updatedIdsWithAncestryIds: i };
-  }, D = (e, n = !1, t = []) => {
-    let r, s = t;
+  }, e[12] = r, e[13] = a, e[14] = k, e[15] = w) : w = e[15];
+  let Q;
+  e[16] !== r || e[17] !== w ? (Q = (t, l, s) => {
+    const n = w(t), d = s.filter((c) => !n.includes(c)), i = r.filter((c) => !l.includes(c));
+    return T(d), i;
+  }, e[16] = r, e[17] = w, e[18] = Q) : Q = e[18];
+  const N = Q;
+  let X;
+  e[19] !== r || e[20] !== m || e[21] !== g ? (X = (t, l, s, n) => {
+    const d = s === void 0 ? !1 : s, i = n === void 0 ? !0 : n, c = g(t), u = c.filter((U) => !m.includes(U)), F = c.filter((U) => !r.includes(U)), q = [...r, ...l, ...F], M = [...m, ...u];
+    return i && T(M), d ? {
+      updatedIdsWithAncestryIds: q,
+      requiredParentsIds: M
+    } : {
+      updatedIdsWithAncestryIds: q
+    };
+  }, e[19] = r, e[20] = m, e[21] = g, e[22] = X) : X = e[22];
+  const R = X;
+  let Y;
+  e[23] !== r || e[24] !== I ? (Y = (t, l, s) => {
+    const n = l === void 0 ? !1 : l, d = s === void 0 ? [] : s;
+    let i, c = d;
     if (n) {
-      const { nodeChildrenIds: i, requiredIds: a } = y(e, n), A = a ? a.filter((me) => !t.includes(me)) : [];
-      s = [...t, ...A], r = i;
-    } else r = y(e).nodeChildrenIds;
-    const l = r.filter((i) => !c.includes(i)), d = [...c, ...l];
-    return S(s), O(!1), d;
-  }, F = (e, n = []) => {
-    let t = n.length > 0 ? n : c;
-    const r = y(e).nodeChildrenIds;
-    return t = t.filter((s) => !r.includes(s)), O(!1), t;
-  }, ae = (e, n, t) => {
-    const r = y(e).nodeChildrenIds, s = t.filter((l) => !r.includes(l));
-    S([...s]), k(e, n, s);
-  }, oe = (e) => {
-    const { id: n } = e;
-    let t = b;
-    !b.includes(n) && v && (t = [...t, n], v(e)), ie(t);
-  }, ue = (e, n, t) => {
-    const r = w.isArray(e) ? e : [e];
-    let s = [...c, ...r];
-    if (t && (n || C) && E)
-      if (I) {
+      const {
+        nodeChildrenIds: q,
+        requiredIds: M
+      } = I(t, n), U = M ? M.filter((nt) => !d.includes(nt)) : [];
+      c = [...d, ...U], i = q;
+    } else
+      i = I(t).nodeChildrenIds;
+    const u = i.filter((q) => !r.includes(q)), F = [...r, ...u];
+    return T(c), Fe(!1), F;
+  }, e[23] = r, e[24] = I, e[25] = Y) : Y = e[25];
+  const Z = Y;
+  let ee;
+  e[26] !== r || e[27] !== I ? (ee = (t, l) => {
+    const s = l === void 0 ? [] : l;
+    let n = s.length > 0 ? s : r;
+    const d = I(t).nodeChildrenIds;
+    return n = n.filter((i) => !d.includes(i)), Fe(!1), n;
+  }, e[26] = r, e[27] = I, e[28] = ee) : ee = e[28];
+  const te = ee;
+  let se;
+  e[29] !== I || e[30] !== N ? (se = (t, l, s) => {
+    const n = I(t).nodeChildrenIds, d = s.filter((i) => !n.includes(i));
+    T([...d]), N(t, l, d);
+  }, e[29] = I, e[30] = N, e[31] = se) : se = e[31];
+  const Me = se;
+  let ne;
+  e[32] !== v || e[33] !== D ? (ne = (t) => {
+    const {
+      id: l
+    } = t;
+    let s = v;
+    !v.includes(l) && D && (s = [...s, l], D(t)), st(s);
+  }, e[32] = v, e[33] = D, e[34] = ne) : ne = e[34];
+  const Ue = ne;
+  let de;
+  e[35] !== f || e[36] !== b || e[37] !== R || e[38] !== Z || e[39] !== r || e[40] !== h ? (de = (t, l, s) => {
+    const n = V.isArray(t) ? t : [t];
+    let d = [...r, ...n];
+    if (s && (l || h) && b)
+      if (f) {
         const {
-          updatedIdsWithAncestryIds: l,
-          requiredParentsIds: d
-        } = x(e, r, !0), i = D(e, !0, d);
-        s = [...l, ...i];
-      } else s = D(e);
-    else I && (s = x(e, r).updatedIdsWithAncestryIds);
-    return s;
-  }, fe = (e, n, t, r) => {
-    const s = w.isArray(e) ? e : [e];
-    let l = c.filter((d) => !s.includes(d));
-    if (t && (n || C) && E)
-      if (I) {
-        const d = k(
-          e,
-          s,
-          m
-        );
-        l = F(e, d), r && ae(e, s, m);
-      } else l = F(e);
-    else I && (l = k(e, s, m));
-    return l;
-  }, H = (e, n, t, r = !1, s = C) => {
-    let l = [...c];
-    n ? l = ue(e, s, t) : l = fe(e, s, t, r), P(l), p && p(l);
-  }, he = (e, n, t = !1) => {
-    O(!0), H(e, n, !0, t, !0);
-  }, j = (e, n, t) => {
-    let r = [];
-    if (e.itens && e.itens.length > 0 && (r = e.itens.map((s) => s.id), t)) {
-      const s = {};
-      s[e.id] = r, Object.assign(t, s);
+          updatedIdsWithAncestryIds: i,
+          requiredParentsIds: c
+        } = R(t, n, !0), u = Z(t, !0, c);
+        d = [...i, ...u];
+      } else
+        d = Z(t);
+    else
+      f && (d = R(t, n).updatedIdsWithAncestryIds);
+    return d;
+  }, e[35] = f, e[36] = b, e[37] = R, e[38] = Z, e[39] = r, e[40] = h, e[41] = de) : de = e[41];
+  const Ve = de;
+  let le;
+  e[42] !== f || e[43] !== b || e[44] !== r || e[45] !== h || e[46] !== m || e[47] !== te || e[48] !== Me || e[49] !== N ? (le = (t, l, s, n) => {
+    const d = V.isArray(t) ? t : [t];
+    let i = r.filter((c) => !d.includes(c));
+    if (s && (l || h) && b)
+      if (f) {
+        const c = N(t, d, m);
+        i = te(t, c), n && Me(t, d, m);
+      } else
+        i = te(t);
+    else
+      f && (i = N(t, d, m));
+    return i;
+  }, e[42] = f, e[43] = b, e[44] = r, e[45] = h, e[46] = m, e[47] = te, e[48] = Me, e[49] = N, e[50] = le) : le = e[50];
+  const $e = le;
+  let re;
+  e[51] !== Ve || e[52] !== $e || e[53] !== h || e[54] !== A ? (re = (t, l, s, n, d) => {
+    const i = n === void 0 ? !1 : n, c = d === void 0 ? h : d;
+    let u;
+    l ? u = Ve(t, c, s) : u = $e(t, c, s, i), Te(u), A && A(u);
+  }, e[51] = Ve, e[52] = $e, e[53] = h, e[54] = A, e[55] = re) : re = e[55];
+  const x = re;
+  let ie;
+  e[56] !== x ? (ie = (t, l, s) => {
+    const n = s === void 0 ? !1 : s;
+    Fe(!0), x(t, l, !0, n, !0);
+  }, e[56] = x, e[57] = ie) : ie = e[57];
+  const De = ie;
+  let y;
+  e[58] !== ge || e[59] !== je || e[60] !== xe || e[61] !== Ue || e[62] !== ve || e[63] !== a || e[64] !== we || e[65] !== Ee || e[66] !== Ne || e[67] !== Re || e[68] !== be || e[69] !== Pe || e[70] !== _e ? (y = (t, l, s) => {
+    let n = [];
+    if (t.itens && t.itens.length > 0 && (n = t.itens.map(it), s)) {
+      const d = {};
+      d[t.id] = n, Object.assign(s, d);
     }
-    return /* @__PURE__ */ g.jsx(
-      pe,
-      {
-        node: e,
-        idsInLoading: z,
-        startNodesOpened: B,
-        alwaysShowArrow: L,
-        childrenIds: r,
-        isParent: e.itens && e.itens.length > 0,
-        parentId: n,
-        nodeRightElements: G,
-        nodeToolbarElements: K,
-        nodeElementsValidations: _,
-        nodeMenuButtonSize: J,
-        onNodeClick: Q,
-        selectedNodeId: X,
-        handlerOnNodeOpen: oe,
-        customClass: ne,
-        customStyle: re,
-        children: r.length > 0 && e.itens && e.itens.map((s) => j(s, e.id, o))
-      },
-      `node-${e.id}`
-    );
-  }, M = (e) => {
-    let n = [], t = [];
-    e.forEach((r) => {
+    return /* @__PURE__ */ Ce.jsx(lt, { node: t, idsInLoading: ve, startNodesOpened: _e, alwaysShowArrow: ge, childrenIds: n, isParent: t.itens && t.itens.length > 0, parentId: l, nodeRightElements: Ne, nodeToolbarElements: Re, nodeElementsValidations: we, nodeMenuButtonSize: Ee, onNodeClick: be, selectedNodeId: Pe, handlerOnNodeOpen: Ue, customClass: je, customStyle: xe, children: n.length > 0 && t.itens && t.itens.map((d) => y(d, t.id, a)) }, `node-${t.id}`);
+  }, e[58] = ge, e[59] = je, e[60] = xe, e[61] = Ue, e[62] = ve, e[63] = a, e[64] = we, e[65] = Ee, e[66] = Ne, e[67] = Re, e[68] = be, e[69] = Pe, e[70] = _e, e[71] = y) : y = e[71];
+  let ce;
+  e[72] !== R ? (ce = (t) => {
+    let l = [], s = [];
+    t.forEach((n) => {
       const {
-        requiredParentsIds: s,
-        updatedIdsWithAncestryIds: l
-      } = x(r, [], !0, !1);
-      t = [...t, ...l], s && (n = [...n, ...s]);
-    }), S(w.uniq(n)), P(w.uniq(t)), ce((r) => r || !0);
-  };
-  q(() => {
-    const e = w.isEqual(W.sort(), f.sort());
-    $ && h.data !== N ? le(h.data) : e || (P(f), p == null || p(f), de(f));
-  }, [f.length, h.data]), q(() => {
-    I && !R && M(c);
-  }, [c]), q(() => {
-    I && M(c);
-  }, [W]), q(() => {
-    j(N, void 0, o);
-  }, []);
-  const Ie = {
-    ...h,
-    requiredIds: se,
-    selectedIds: c,
-    isHandlingSelectedIds: C,
-    selectedIdsUpdatedOnMount: R,
+        requiredParentsIds: d,
+        updatedIdsWithAncestryIds: i
+      } = R(n, [], !0, !1);
+      s = [...s, ...i], d && (l = [...l, ...d]);
+    }), T(V.uniq(l)), Te(V.uniq(s)), tt(ct);
+  }, e[72] = R, e[73] = ce) : ce = e[73];
+  const _ = ce;
+  let oe;
+  e[74] !== p || e[75] !== pe || e[76] !== A || e[77] !== P || e[78] !== o.data || e[79] !== S ? (oe = () => {
+    const t = V.isEqual(P.sort(), S.sort());
+    pe && o.data !== p ? Ze(o.data) : t || (Te(S), A?.(S), et(S));
+  }, e[74] = p, e[75] = pe, e[76] = A, e[77] = P, e[78] = o.data, e[79] = S, e[80] = oe) : oe = e[80];
+  let ae;
+  e[81] !== o.data || e[82] !== S.length ? (ae = [S.length, o.data], e[81] = o.data, e[82] = S.length, e[83] = ae) : ae = e[83], Ae(oe, ae);
+  let ue;
+  e[84] !== f || e[85] !== r || e[86] !== _ || e[87] !== O ? (ue = () => {
+    f && !O && _(r);
+  }, e[84] = f, e[85] = r, e[86] = _, e[87] = O, e[88] = ue) : ue = e[88];
+  let fe;
+  e[89] !== r ? (fe = [r], e[89] = r, e[90] = fe) : fe = e[90], Ae(ue, fe);
+  let Ie;
+  e[91] !== f || e[92] !== r || e[93] !== _ ? (Ie = () => {
+    f && _(r);
+  }, e[91] = f, e[92] = r, e[93] = _, e[94] = Ie) : Ie = e[94];
+  let he;
+  e[95] !== P ? (he = [P], e[95] = P, e[96] = he) : he = e[96], Ae(Ie, he);
+  let me;
+  e[97] !== y || e[98] !== p || e[99] !== a ? (me = () => {
+    y(p, void 0, a);
+  }, e[97] = y, e[98] = p, e[99] = a, e[100] = me) : me = e[100];
+  let Se;
+  e[101] === Symbol.for("react.memo_cache_sentinel") ? (Se = [], e[101] = Se) : Se = e[101], Ae(me, Se);
+  let ye;
+  e[102] !== v || e[103] !== r || e[104] !== h || e[105] !== o || e[106] !== We || e[107] !== m || e[108] !== O || e[109] !== De || e[110] !== x ? (ye = {
+    ...o,
+    requiredIds: We,
+    selectedIds: r,
+    isHandlingSelectedIds: h,
+    selectedIdsUpdatedOnMount: O,
     requiredParentsIds: m,
-    alreadyOpenedIds: b,
-    handlerUpdateSelectedIds: H,
-    handlerToggleCheckChildren: he
-  };
-  return /* @__PURE__ */ g.jsx(Se.Provider, { value: Ie, children: /* @__PURE__ */ g.jsxs("div", { className: `treeview-component ${Y}`, children: [
-    Z,
-    /* @__PURE__ */ g.jsx(
-      "ul",
-      {
-        style: ee,
-        className: `treeviewcontainer ${te && "-bordered"}`,
-        children: j(N)
-      }
-    )
-  ] }) });
+    alreadyOpenedIds: v,
+    handlerUpdateSelectedIds: x,
+    handlerToggleCheckChildren: De
+  }, e[102] = v, e[103] = r, e[104] = h, e[105] = o, e[106] = We, e[107] = m, e[108] = O, e[109] = De, e[110] = x, e[111] = ye) : ye = e[111];
+  const He = ye, ze = `treeview-component ${Ye}`, Be = `treeviewcontainer ${Xe && "-bordered"}`, Le = p;
+  let E;
+  e[112] !== y || e[113] !== Le ? (E = y(Le), e[112] = y, e[113] = Le, e[114] = E) : E = e[114];
+  let W;
+  e[115] !== ke || e[116] !== Be || e[117] !== E ? (W = /* @__PURE__ */ Ce.jsx("ul", { style: ke, className: Be, children: E }), e[115] = ke, e[116] = Be, e[117] = E, e[118] = W) : W = e[118];
+  let j;
+  e[119] !== Oe || e[120] !== ze || e[121] !== W ? (j = /* @__PURE__ */ Ce.jsxs("div", { className: ze, children: [
+    Oe,
+    W
+  ] }), e[119] = Oe, e[120] = ze, e[121] = W, e[122] = j) : j = e[122];
+  let qe;
+  return e[123] !== He || e[124] !== j ? (qe = /* @__PURE__ */ Ce.jsx(rt.Provider, { value: He, children: j }), e[123] = He, e[124] = j, e[125] = qe) : qe = e[125], qe;
 };
+function it(o) {
+  return o.id;
+}
+function ct(o) {
+  return o || !0;
+}
 export {
-  pe as TreeNode,
-  Oe as TreeViewHeader,
-  qe as default
+  lt as TreeNode,
+  qt as TreeViewHeader,
+  mt as default
 };