linear-react-components-ui 1.1.26-beta.9 → 1.1.27-rc.0

package/lib/treeview/index.js

@@ -1,268 +1,319 @@
-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
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "TreeNode", {
+  enumerable: true,
+  get: function () {
+    return _Node.default;
+  }
+});
+Object.defineProperty(exports, "TreeViewHeader", {
+  enumerable: true,
+  get: function () {
+    return _Header.default;
+  }
+});
+exports.default = void 0;
+var _react = _interopRequireWildcard(require("react"));
+var _lodash = _interopRequireDefault(require("lodash"));
+var _Node = _interopRequireDefault(require("./Node"));
+var _Header = _interopRequireDefault(require("./Header"));
+require("../assets/styles/treeview.scss");
+var _constants = require("./constants");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+const TreeView = props => {
+  const {
+    selectedIds = [],
+    enableDynamicData,
+    allowCheckAllAncestry,
+    onNodeOpen,
+    allowCheckAllChildren,
+    onSelectedIdsChange,
+    idsInLoading,
+    startNodesOpened = false,
+    alwaysShowArrow,
+    nodeElementsValidations,
+    nodeRightElements,
+    nodeMenuButtonSize = 'small',
+    nodeToolbarElements,
+    onNodeClick,
+    selectedNodeId,
+    customClass = '',
+    children,
+    styleForContainer,
+    bordered,
+    requiredIds: propsRequiredIds = [],
+    customClassForNodes = '',
+    customStyleForNodes
+  } = props;
+  const [data, setData] = (0, _react.useState)(props.data);
+  const [currentSelectedIds, setCurrentSelectedIds] = (0, _react.useState)(selectedIds);
+  const [propSelectedIds, setPropSelectedIds] = (0, _react.useState)(selectedIds);
+  const [isHandlingSelectedIds, setIsHandlingSelectedIds] = (0, _react.useState)(false);
+  const [selectedIdsUpdatedOnMount, setSelectedIdsUpdatedOnMount] = (0, _react.useState)(false);
+  const [requiredParentsIds, setRequiredParentsIds] = (0, _react.useState)([]);
+  const [alreadyOpenedIds, setAlreadyOpenedIds] = (0, _react.useState)([]);
+  const [idsWithChildren] = (0, _react.useState)({});
+  const returnChildrenIds = function (nodeId) {
+    let returnRequiredIds = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let nodeChildrenIds = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+    let requiredIds = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
+    if (idsWithChildren[nodeId] !== undefined) {
+      nodeChildrenIds.push(nodeId);
+      if (returnRequiredIds) requiredIds.push(nodeId);
+      idsWithChildren[nodeId].forEach(childId => returnChildrenIds(childId, returnRequiredIds, nodeChildrenIds, requiredIds));
+    } else nodeChildrenIds.push(nodeId);
+    return returnRequiredIds ? {
+      nodeChildrenIds,
+      requiredIds
     } : {
-      nodeChildrenIds: i
+      nodeChildrenIds
     };
-  }, 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);
+  };
+  const returnParentId = nodeId => {
+    const parentId = Object.keys(idsWithChildren).find(id => idsWithChildren[id].find(childId => childId === nodeId));
+    return Number(parentId);
+  };
+  const returnAllAncestryIds = function (nodeId) {
+    let ancestryIds = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+    const parentId = returnParentId(nodeId);
+    if (parentId) {
+      const currentAncestryIds = [...ancestryIds, Number(parentId)];
+      return returnAllAncestryIds(Number(parentId), currentAncestryIds);
     }
-    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 ancestryIds;
+  };
+  const returnRequiredAncestryIds = function (nodeId) {
+    let requiredAncestryIds = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+    let previousParentId = arguments.length > 2 ? arguments[2] : undefined;
+    let selectedSiblingsIds = [];
+    const parentId = returnParentId(nodeId);
+    if (parentId) {
+      const nodeSiblingsIds = idsWithChildren && idsWithChildren[parentId].filter(childId => childId !== nodeId);
+      const isPreviousParentSelected = previousParentId && currentSelectedIds.includes(previousParentId);
+      if (nodeSiblingsIds && nodeSiblingsIds.length > 0) {
+        selectedSiblingsIds = currentSelectedIds.filter(id => nodeSiblingsIds.includes(id));
+      }
+      const requiredIds = isPreviousParentSelected || selectedSiblingsIds.length > 0 ? [...requiredAncestryIds] : [...requiredAncestryIds, parentId];
+      if (selectedSiblingsIds.length === 0 && !isPreviousParentSelected) {
+        return returnRequiredAncestryIds(parentId, requiredIds, parentId);
+      }
     }
-    return n;
-  }, 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
+    return requiredAncestryIds;
+  };
+  const updateAncestryAndSelectedIds = (nodeId, codigos, requiredParents) => {
+    const ancestryIds = returnRequiredAncestryIds(nodeId);
+    const remainRequiredParentsIds = requiredParents.filter(id => !ancestryIds.includes(id));
+    const newSelectedIds = currentSelectedIds.filter(selectedId => !codigos.includes(selectedId));
+    setRequiredParentsIds(remainRequiredParentsIds);
+    return newSelectedIds;
+  };
+  const checkAllAncestry = function (nodeId, codigos) {
+    let returnRequiredParentsIds = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    let updateState = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
+    const nodeAncestryIds = returnAllAncestryIds(nodeId);
+    const notRequiredAncestryIds = nodeAncestryIds.filter(id => !requiredParentsIds.includes(id));
+    const notSelectedAncestryIds = nodeAncestryIds.filter(id => !currentSelectedIds.includes(id));
+    const newSelectedIds = [...currentSelectedIds, ...codigos, ...notSelectedAncestryIds];
+    const newRequiredParentsIds = [...requiredParentsIds, ...notRequiredAncestryIds];
+    if (updateState) {
+      setRequiredParentsIds(newRequiredParentsIds);
+    }
+    return !returnRequiredParentsIds ? {
+      updatedIdsWithAncestryIds: newSelectedIds
     } : {
-      updatedIdsWithAncestryIds: q
+      updatedIdsWithAncestryIds: newSelectedIds,
+      requiredParentsIds: newRequiredParentsIds
     };
-  }, 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 checkAllChildren = function (nodeId) {
+    let returnRequiredIds = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let currentRequiredIds = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+    let childrenIds;
+    let newRequiredParentsIds = currentRequiredIds;
+    if (returnRequiredIds) {
       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) => {
+        nodeChildrenIds,
+        requiredIds
+      } = returnChildrenIds(nodeId, returnRequiredIds);
+      const newRequiredIds = requiredIds ? requiredIds.filter(id => !currentRequiredIds.includes(id)) : [];
+      newRequiredParentsIds = [...currentRequiredIds, ...newRequiredIds];
+      childrenIds = nodeChildrenIds;
+    } else childrenIds = returnChildrenIds(nodeId).nodeChildrenIds;
+    const notSelectedChildrenIds = childrenIds.filter(id => !currentSelectedIds.includes(id));
+    const newSelectedIds = [...currentSelectedIds, ...notSelectedChildrenIds];
+    setRequiredParentsIds(newRequiredParentsIds);
+    setIsHandlingSelectedIds(false);
+    return newSelectedIds;
+  };
+  const uncheckAllChildren = function (nodeId) {
+    let remainSelectedIds = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+    let newSelectedIds = remainSelectedIds.length > 0 ? remainSelectedIds : currentSelectedIds;
+    const childrenIds = returnChildrenIds(nodeId).nodeChildrenIds;
+    newSelectedIds = newSelectedIds.filter(selectedId => !childrenIds.includes(selectedId));
+    setIsHandlingSelectedIds(false);
+    return newSelectedIds;
+  };
+  const uncheckRequiredChildren = (nodeId, codigos, requiredParents) => {
+    const childrenIds = returnChildrenIds(nodeId).nodeChildrenIds;
+    const remainRequiredIds = requiredParents.filter(id => !childrenIds.includes(id));
+    setRequiredParentsIds([...remainRequiredIds]);
+    updateAncestryAndSelectedIds(nodeId, codigos, remainRequiredIds);
+  };
+  const handleOnNodeOpen = node => {
     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) {
+      id
+    } = node;
+    let newAlreadyOpenedIds = alreadyOpenedIds;
+    if (!alreadyOpenedIds.includes(id) && onNodeOpen) {
+      newAlreadyOpenedIds = [...newAlreadyOpenedIds, id];
+      onNodeOpen(node);
+    }
+    setAlreadyOpenedIds(newAlreadyOpenedIds);
+  };
+  const handleCheck = (nodeId, handlingSelectedIds, isParent) => {
+    const codigos = _lodash.default.isArray(nodeId) ? nodeId : [nodeId];
+    let newSelectedIds = [...currentSelectedIds, ...codigos];
+    if (isParent && (handlingSelectedIds || isHandlingSelectedIds) && allowCheckAllChildren) {
+      if (allowCheckAllAncestry) {
         const {
-          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);
+          updatedIdsWithAncestryIds,
+          requiredParentsIds: requiredParents
+        } = checkAllAncestry(nodeId, codigos, true);
+        const updatedIdsWithChildrenIds = checkAllChildren(nodeId, true, requiredParents);
+        newSelectedIds = [...updatedIdsWithAncestryIds, ...updatedIdsWithChildrenIds];
+      } else newSelectedIds = checkAllChildren(nodeId);
+    } else if (allowCheckAllAncestry) {
+      newSelectedIds = checkAllAncestry(nodeId, codigos).updatedIdsWithAncestryIds;
+    }
+    return newSelectedIds;
+  };
+  const handleUncheck = (nodeId, handlingSelectedIds, isParent, required) => {
+    const codigos = _lodash.default.isArray(nodeId) ? nodeId : [nodeId];
+    let newSelectedIds = currentSelectedIds.filter(id => !codigos.includes(id));
+    if (isParent && (handlingSelectedIds || isHandlingSelectedIds) && allowCheckAllChildren) {
+      if (allowCheckAllAncestry) {
+        const updatedSelectedIds = updateAncestryAndSelectedIds(nodeId, codigos, requiredParentsIds);
+        newSelectedIds = uncheckAllChildren(nodeId, updatedSelectedIds);
+        if (required) uncheckRequiredChildren(nodeId, codigos, requiredParentsIds);
+      } else newSelectedIds = uncheckAllChildren(nodeId);
+    } else if (allowCheckAllAncestry) {
+      newSelectedIds = updateAncestryAndSelectedIds(nodeId, codigos, requiredParentsIds);
+    }
+    return newSelectedIds;
+  };
+  const updateSelectedIds = function (nodeId, checked, isParent) {
+    let required = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
+    let handlingSelectedIds = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : isHandlingSelectedIds;
+    let newSelectedIds = [...currentSelectedIds];
+    if (checked) {
+      newSelectedIds = handleCheck(nodeId, handlingSelectedIds, isParent);
+    } else {
+      newSelectedIds = handleUncheck(nodeId, handlingSelectedIds, isParent, required);
+    }
+    setCurrentSelectedIds(newSelectedIds);
+    if (onSelectedIdsChange) onSelectedIdsChange(newSelectedIds);
+  };
+  const toggleCheckChildren = function (nodeId, check) {
+    let required = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    setIsHandlingSelectedIds(true);
+    updateSelectedIds(nodeId, check, true, required, true);
+  };
+  const buildTree = (node, parentId, ids) => {
+    let childrenIds = [];
+    if (node.itens && node.itens.length > 0) {
+      childrenIds = node.itens.map(i => i.id);
+      if (ids) {
+        const idWithChildren = {};
+        idWithChildren[node.id] = childrenIds;
+        Object.assign(ids, idWithChildren);
+      }
     }
-    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) => {
+    return /*#__PURE__*/_react.default.createElement(_Node.default, {
+      key: "node-".concat(node.id),
+      node: node,
+      idsInLoading: idsInLoading,
+      startNodesOpened: startNodesOpened,
+      alwaysShowArrow: alwaysShowArrow,
+      childrenIds: childrenIds,
+      isParent: node.itens && node.itens.length > 0,
+      parentId: parentId,
+      nodeRightElements: nodeRightElements,
+      nodeToolbarElements: nodeToolbarElements,
+      nodeElementsValidations: nodeElementsValidations,
+      nodeMenuButtonSize: nodeMenuButtonSize,
+      onNodeClick: onNodeClick,
+      selectedNodeId: selectedNodeId,
+      handlerOnNodeOpen: handleOnNodeOpen,
+      customClass: customClassForNodes,
+      customStyle: customStyleForNodes
+    }, childrenIds.length > 0 && node.itens && node.itens.map(nodeitem => buildTree(nodeitem, node.id, idsWithChildren)));
+  };
+  const handleNewSelectedIds = selectedNodeIds => {
+    let requiredIds = [];
+    let newSelectedIds = [];
+    selectedNodeIds.forEach(id => {
       const {
-        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: 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 {
-  lt as TreeNode,
-  qt as TreeViewHeader,
-  mt as default
+        requiredParentsIds: requiredParents,
+        updatedIdsWithAncestryIds
+      } = checkAllAncestry(id, [], true, false);
+      newSelectedIds = [...newSelectedIds, ...updatedIdsWithAncestryIds];
+      if (requiredParents) {
+        requiredIds = [...requiredIds, ...requiredParents];
+      }
+    });
+    setRequiredParentsIds(_lodash.default.uniq(requiredIds));
+    setCurrentSelectedIds(_lodash.default.uniq(newSelectedIds));
+    setSelectedIdsUpdatedOnMount(prevState => prevState || true);
+  };
+  (0, _react.useEffect)(() => {
+    const isSameSelectedIds = _lodash.default.isEqual(propSelectedIds.sort(), selectedIds.sort());
+    if (enableDynamicData && props.data !== data) {
+      setData(props.data);
+    } else if (!isSameSelectedIds) {
+      setCurrentSelectedIds(selectedIds);
+      onSelectedIdsChange === null || onSelectedIdsChange === void 0 ? void 0 : onSelectedIdsChange(selectedIds);
+      setPropSelectedIds(selectedIds);
+    }
+  }, [selectedIds.length, props.data]);
+  (0, _react.useEffect)(() => {
+    if (allowCheckAllAncestry && !selectedIdsUpdatedOnMount) {
+      handleNewSelectedIds(currentSelectedIds);
+    }
+  }, [currentSelectedIds]);
+  (0, _react.useEffect)(() => {
+    if (allowCheckAllAncestry) {
+      handleNewSelectedIds(currentSelectedIds);
+    }
+  }, [propSelectedIds]);
+  (0, _react.useEffect)(() => {
+    buildTree(data, undefined, idsWithChildren);
+  }, []);
+  const contextValues = _objectSpread(_objectSpread({}, props), {}, {
+    requiredIds: propsRequiredIds,
+    selectedIds: currentSelectedIds,
+    isHandlingSelectedIds,
+    selectedIdsUpdatedOnMount,
+    requiredParentsIds,
+    alreadyOpenedIds,
+    handlerUpdateSelectedIds: updateSelectedIds,
+    handlerToggleCheckChildren: toggleCheckChildren
+  });
+  return /*#__PURE__*/_react.default.createElement(_constants.TreeviewContext.Provider, {
+    value: contextValues
+  }, /*#__PURE__*/_react.default.createElement("div", {
+    className: "treeview-component ".concat(customClass)
+  }, children, /*#__PURE__*/_react.default.createElement("ul", {
+    style: styleForContainer,
+    className: "treeviewcontainer ".concat(bordered && '-bordered')
+  }, buildTree(data))));
 };
+var _default = exports.default = TreeView;