impact-nova 1.7.29 → 1.7.30

package/dist/components/ui/nested-list/hooks/useNestedListState.d.ts

@@ -9,6 +9,7 @@ interface UseNestedListStateProps {
     initialItems: NestedListItem[];
     enableApplyDiscard: boolean;
     enableNormalizedState?: boolean;
+    initialCollapsedItems?: Record<string, boolean>;
 }
 /**
  * Build normalized state from nested tree structure
@@ -35,7 +36,7 @@ declare function getAncestorIds(normalized: NormalizedItems, itemId: string): st
  * Get all descendant IDs for an item (for cascade operations)
  */
 declare function getDescendantIds(normalized: NormalizedItems, itemId: string): string[];
-export declare const useNestedListState: ({ initialItems, enableApplyDiscard, enableNormalizedState, }: UseNestedListStateProps) => {
+export declare const useNestedListState: ({ initialItems, enableApplyDiscard, enableNormalizedState, initialCollapsedItems, }: UseNestedListStateProps) => {
     findItemByIdFast: (id: string) => NestedListItem | null;
     updateItemFast: (itemId: string, updates: Partial<NestedListItem>) => void;
     getAncestors: (itemId: string) => string[];

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

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