impact-nova 2.3.0 → 2.5.0

package/dist/components/data/nested-list/hooks/useNestedListState.js

@@ -1,166 +1,167 @@
-import { useState as u, useMemo as O, useCallback as g } from "react";
-function p(s) {
-  const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), d = [], i = (r, h) => {
-    r.forEach((o) => {
-      e.set(o.id, o), n.set(o.id, h), o.children && o.children.length > 0 ? (t.set(o.id, o.children.map((C) => C.id)), i(o.children, o.id)) : t.set(o.id, []), h === null && d.push(o.id);
+import { useState as o, useCallback as y, useRef as N, useEffect as z, useMemo as ss } from "react";
+function l(t) {
+  const n = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), e = /* @__PURE__ */ new Map(), u = [], i = (I, h) => {
+    I.forEach((r) => {
+      n.set(r.id, r), e.set(r.id, h), r.children && r.children.length > 0 ? (s.set(r.id, r.children.map((C) => C.id)), i(r.children, r.id)) : s.set(r.id, []), h === null && u.push(r.id);
     });
   };
-  return i(s, null), { byId: e, childrenById: t, parentById: n, rootIds: d };
+  return i(t, null), { byId: n, childrenById: s, parentById: e, rootIds: u };
 }
-function a(s) {
-  const e = (t) => {
-    const n = [];
-    for (const d of t) {
-      const i = s.byId.get(d);
+function T(t) {
+  const n = (s) => {
+    const e = [];
+    for (const u of s) {
+      const i = t.byId.get(u);
       if (!i) continue;
-      const r = s.childrenById.get(d) || [], h = r.length > 0 ? e(r) : void 0;
-      n.push({
+      const I = t.childrenById.get(u) || [], h = I.length > 0 ? n(I) : void 0;
+      e.push({
         ...i,
         children: h
       });
     }
-    return n;
+    return e;
   };
-  return e(s.rootIds);
+  return n(t.rootIds);
 }
-function R(s, e, t) {
-  const n = s.byId.get(e);
-  if (!n) return s;
-  const d = new Map(s.byId);
-  return d.set(e, { ...n, ...t }), {
-    ...s,
-    byId: d
+function j(t, n, s) {
+  const e = t.byId.get(n);
+  if (!e) return t;
+  const u = new Map(t.byId);
+  return u.set(n, { ...e, ...s }), {
+    ...t,
+    byId: u
   };
 }
-function N(s, e) {
-  return s.byId.get(e) || null;
+function ts(t, n) {
+  return t.byId.get(n) || null;
 }
-function z(s, e) {
-  const t = [];
-  let n = s.parentById.get(e) || null;
-  for (; n !== null; )
-    t.push(n), n = s.parentById.get(n) || null;
-  return t;
+function es(t, n) {
+  const s = [];
+  let e = t.parentById.get(n) || null;
+  for (; e !== null; )
+    s.push(e), e = t.parentById.get(e) || null;
+  return s;
 }
-function tt(s, e) {
-  const t = [], n = (d) => {
-    (s.childrenById.get(d) || []).forEach((r) => {
-      t.push(r), n(r);
+function ns(t, n) {
+  const s = [], e = (u) => {
+    (t.childrenById.get(u) || []).forEach((I) => {
+      s.push(I), e(I);
     });
   };
-  return n(e), t;
+  return e(n), s;
 }
-const nt = ({
-  initialItems: s,
-  enableApplyDiscard: e,
-  enableNormalizedState: t = !1,
-  initialCollapsedItems: n
+const rs = ({
+  initialItems: t,
+  enableApplyDiscard: n,
+  enableNormalizedState: s = !1,
+  initialCollapsedItems: e
 }) => {
-  const [d, i] = u(s), [r, h] = u(!1), o = O(() => ({
-    get current() {
-      return r;
-    },
-    set current(c) {
-      c !== r && queueMicrotask(() => h(c));
-    }
-  }), [r]), C = d !== s, [j, x] = u(s), [v, l] = u(s), [f, w] = u(
-    () => t ? p(s) : {
+  const [u, i] = o(t), [I, h] = o(!1), r = y(() => h(!0), []), C = u !== t, [m, x] = o(t), [p, w] = o(t), k = N(p);
+  z(() => {
+    k.current = p;
+  }, [p]);
+  const [f, B] = o(
+    () => s ? l(t) : {
       byId: /* @__PURE__ */ new Map(),
       childrenById: /* @__PURE__ */ new Map(),
       parentById: /* @__PURE__ */ new Map(),
       rootIds: []
     }
-  ), [k, E] = u(
-    () => t ? p(s) : {
+  ), [E, U] = o(
+    () => s ? l(t) : {
       byId: /* @__PURE__ */ new Map(),
       childrenById: /* @__PURE__ */ new Map(),
       parentById: /* @__PURE__ */ new Map(),
       rootIds: []
     }
-  ), [G, J] = u(""), [K, P] = u(n ?? {}), [Q, V] = u(!1), [W, X] = u(null), [Y, Z] = u(null), [_, $] = u(
+  ), [q, G] = o(""), [J, K] = o(e ?? {}), [P, Q] = o(!1), [V, W] = o(null), [X, Y] = o(null), [Z, _] = o(
     /* @__PURE__ */ new Set()
-  ), [m, b] = u(/* @__PURE__ */ new Set());
-  if (C && !r && (i(s), l(s), e && x(s), t)) {
-    const c = p(s);
-    w(c), e && E(c);
-  }
-  r && !C && h(!1);
-  const U = g((c) => t ? N(f, c) : null, [t, f]), L = g((c, y) => {
-    t && (w((I) => R(I, c, y)), l((I) => a(R(p(I), c, y))));
-  }, [t]), A = g((c) => t ? z(f, c) : [], [t, f]), F = g((c) => t ? tt(f, c) : [], [t, f]), q = g((c) => {
-    t && (w((y) => {
-      const I = new Map(y.byId);
-      return c.forEach((T, B) => {
-        const M = I.get(B);
-        M && I.set(B, { ...M, ...T });
-      }), { ...y, byId: I };
-    }), l((y) => {
-      const I = p(y);
-      return c.forEach((T, B) => {
-        const M = I.byId.get(B);
-        M && I.byId.set(B, { ...M, ...T });
-      }), a(I);
+  ), [$, b] = o(/* @__PURE__ */ new Set());
+  if (C) {
+    if (i(t), I)
+      h(!1);
+    else if (w(t), n && x(t), s) {
+      const c = l(t);
+      B(c), n && U(c);
+    }
+  } else I && h(!1);
+  const L = y((c) => s ? ts(f, c) : null, [s, f]), A = y((c, g) => {
+    s && (B((d) => j(d, c, g)), w((d) => T(j(l(d), c, g))));
+  }, [s]), F = y((c) => s ? es(f, c) : [], [s, f]), R = y((c) => s ? ns(f, c) : [], [s, f]), D = y((c) => {
+    s && (B((g) => {
+      const d = new Map(g.byId);
+      return c.forEach((a, M) => {
+        const v = d.get(M);
+        v && d.set(M, { ...v, ...a });
+      }), { ...g, byId: d };
+    }), w((g) => {
+      const d = l(g);
+      return c.forEach((a, M) => {
+        const v = d.byId.get(M);
+        v && d.byId.set(M, { ...v, ...a });
+      }), T(d);
     }));
-  }, [t]), D = g(() => {
-    t && l(a(f));
-  }, [t, f]), H = g(() => {
-    t && w(p(v));
-  }, [t, v]), S = O(() => ({
-    findItemByIdFast: U,
-    updateItemFast: L,
-    getAncestors: A,
-    getDescendants: F,
-    batchUpdateItems: q,
-    syncToTreeState: D,
-    syncToNormalizedState: H,
-    isNormalized: t,
+  }, [s]), H = y(() => {
+    s && w(T(f));
+  }, [s, f]), O = y(() => {
+    s && B(l(p));
+  }, [s, p]), S = ss(() => ({
+    findItemByIdFast: L,
+    updateItemFast: A,
+    getAncestors: F,
+    getDescendants: R,
+    batchUpdateItems: D,
+    syncToTreeState: H,
+    syncToNormalizedState: O,
+    isNormalized: s,
     normalizedState: f,
-    setNormalizedState: w,
-    savedNormalizedState: k,
-    setSavedNormalizedState: E
+    setNormalizedState: B,
+    savedNormalizedState: E,
+    setSavedNormalizedState: U
   }), [
-    U,
     L,
     A,
     F,
-    q,
+    R,
     D,
     H,
-    t,
+    O,
+    s,
     f,
-    k
+    E
   ]);
   return {
     // Standard state (backward compatible)
-    items: v,
-    setItems: l,
-    savedItems: j,
+    items: p,
+    setItems: w,
+    itemsRef: k,
+    savedItems: m,
     setSavedItems: x,
-    isUserChangeRef: o,
-    searchText: G,
-    setSearchText: J,
-    collapsedItems: K,
-    setCollapsedItems: P,
-    isListCollapsed: Q,
-    setIsListCollapsed: V,
-    activeId: W,
-    setActiveId: X,
-    overId: Y,
-    setOverId: Z,
-    selectedCategories: _,
-    setSelectedCategories: $,
-    itemsToBlink: m,
+    markUserChange: r,
+    searchText: q,
+    setSearchText: G,
+    collapsedItems: J,
+    setCollapsedItems: K,
+    isListCollapsed: P,
+    setIsListCollapsed: Q,
+    activeId: V,
+    setActiveId: W,
+    overId: X,
+    setOverId: Y,
+    selectedCategories: Z,
+    setSelectedCategories: _,
+    itemsToBlink: $,
     setItemsToBlink: b,
     // Normalized state helpers (for optimized operations)
     ...S
   };
 };
 export {
-  a as denormalizeItems,
-  z as getAncestorIds,
-  tt as getDescendantIds,
-  N as getItemById,
-  p as normalizeItems,
-  R as updateNormalizedItem,
-  nt as useNestedListState
+  T as denormalizeItems,
+  es as getAncestorIds,
+  ns as getDescendantIds,
+  ts as getItemById,
+  l as normalizeItems,
+  j as updateNormalizedItem,
+  rs as useNestedListState
 };