impact-nova 2.4.0 → 2.5.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (27) hide show
  1. package/dist/components/data/data-table/data-table-column-list.js +16 -16
  2. package/dist/components/data/data-table/data-table-sheet-layout.d.ts +26 -0
  3. package/dist/components/data/data-table/data-table-sheet-layout.js +71 -0
  4. package/dist/components/data/data-table/data-table-sheet.d.ts +2 -0
  5. package/dist/components/data/data-table/index.d.ts +1 -0
  6. package/dist/components/data/data-table/index.js +40 -34
  7. package/dist/components/data/expandable-list-item/expandable-list-item-attributes.js +2 -3
  8. package/dist/components/data/expandable-list-item/expandable-list-item-metrics.js +2 -3
  9. package/dist/components/data/nested-list/hooks/useNestedListHandlers.d.ts +3 -2
  10. package/dist/components/data/nested-list/hooks/useNestedListHandlers.js +129 -130
  11. package/dist/components/data/nested-list/hooks/useNestedListState.d.ts +2 -3
  12. package/dist/components/data/nested-list/hooks/useNestedListState.js +118 -117
  13. package/dist/components/data/nested-list/nested-list.js +219 -221
  14. package/dist/components/feedback/tooltip/tab-tooltip-render.js +2 -3
  15. package/dist/components/flows/accordion-nested-list/accordion-nested-list.js +80 -65
  16. package/dist/components/flows/command-palette/shortcut-settings.js +10 -10
  17. package/dist/components/flows/filter-panel/filter-panel.js +4 -4
  18. package/dist/components/forms/date-picker/month-picker.js +136 -109
  19. package/dist/components/forms/select/components/SelectTriggerValue.js +2 -3
  20. package/dist/components/forms/select/components/Submenu.js +2 -3
  21. package/dist/impact-nova.css +1 -1
  22. package/dist/index.js +170 -164
  23. package/dist/llms/rules/ag-grid.js +1 -1
  24. package/dist/llms/rules/installation.js +1 -1
  25. package/dist/llms/rules/real-world-patterns.js +1 -1
  26. package/dist/llms/rules/requirements.js +1 -1
  27. package/package.json +1 -1
@@ -1,185 +1,184 @@
1
1
  import { useCallback as _ } from "react";
2
- import { SelectionMode as D } from "../nested-list.types.js";
3
- const v = (l, t, r) => l.map((n) => n.id === t ? r(n) : n.children ? {
4
- ...n,
5
- children: v(n.children, t, r)
6
- } : n), q = (l, t, r, n) => {
7
- const s = (c, e) => c.map((h) => ({
2
+ import { SelectionMode as a } from "../nested-list.types.js";
3
+ const x = (l, s, r) => l.map((c) => c.id === s ? r(c) : c.children ? {
4
+ ...c,
5
+ children: x(c.children, s, r)
6
+ } : c), G = (l, s, r, c) => {
7
+ const t = (e, n) => e.map((h) => ({
8
8
  ...h,
9
- checked: e,
10
- children: h.children ? s(h.children, e) : void 0
9
+ checked: n,
10
+ children: h.children ? t(h.children, n) : void 0
11
11
  }));
12
- return v(l, t, (c) => {
13
- const e = { ...c, checked: r };
14
- return c.children && (n === D.INDEPENDENT ? e.children = [...c.children] : n === D.CASCADE_DOWN ? e.children = s(c.children, r) : n === D.CASCADE_UP_DOWN && (r ? e.children = [...c.children] : e.children = s(c.children, !1))), e;
12
+ return x(l, s, (e) => {
13
+ const n = { ...e, checked: r };
14
+ return e.children && (c === a.INDEPENDENT ? n.children = [...e.children] : c === a.CASCADE_DOWN ? n.children = t(e.children, r) : c === a.CASCADE_UP_DOWN && (r ? n.children = [...e.children] : n.children = t(e.children, !1))), n;
15
15
  });
16
16
  };
17
- function G(l, t, r, n) {
18
- const s = /* @__PURE__ */ new Map();
19
- s.set(t, { checked: r });
20
- const c = (e) => {
17
+ function J(l, s, r, c) {
18
+ const t = /* @__PURE__ */ new Map();
19
+ t.set(s, { checked: r });
20
+ const e = (n) => {
21
21
  const h = [];
22
- return (l.childrenById.get(e) || []).forEach((i) => {
23
- h.push(i), h.push(...c(i));
22
+ return (l.childrenById.get(n) || []).forEach((p) => {
23
+ h.push(p), h.push(...e(p));
24
24
  }), h;
25
25
  };
26
- return n === D.CASCADE_DOWN ? c(t).forEach((h) => {
27
- s.set(h, { checked: r });
28
- }) : n === D.CASCADE_UP_DOWN && !r && c(t).forEach((h) => {
29
- s.set(h, { checked: !1 });
30
- }), s;
26
+ return c === a.CASCADE_DOWN ? e(s).forEach((h) => {
27
+ t.set(h, { checked: r });
28
+ }) : c === a.CASCADE_UP_DOWN && !r && e(s).forEach((h) => {
29
+ t.set(h, { checked: !1 });
30
+ }), t;
31
31
  }
32
- function J(l, t, r, n) {
33
- if (n === D.INDEPENDENT) return;
34
- ((e) => {
32
+ function K(l, s, r, c) {
33
+ if (c === a.INDEPENDENT) return;
34
+ ((n) => {
35
35
  const h = [];
36
- let f = l.parentById.get(e) || null;
37
- for (; f !== null; )
38
- h.push(f), f = l.parentById.get(f) || null;
36
+ let o = l.parentById.get(n) || null;
37
+ for (; o !== null; )
38
+ h.push(o), o = l.parentById.get(o) || null;
39
39
  return h;
40
- })(r).forEach((e) => {
41
- const f = (l.childrenById.get(e) || []).map((o) => {
42
- const y = t.get(o);
43
- return y?.checked !== void 0 ? y.checked : l.byId.get(o)?.checked ?? !1;
40
+ })(r).forEach((n) => {
41
+ const o = (l.childrenById.get(n) || []).map((f) => {
42
+ const E = s.get(f);
43
+ return E?.checked !== void 0 ? E.checked : l.byId.get(f)?.checked ?? !1;
44
44
  });
45
- let i;
46
- n === D.CASCADE_UP_DOWN ? i = f.some((o) => o) : i = f.every((o) => o), t.set(e, { checked: i });
45
+ let p;
46
+ c === a.CASCADE_UP_DOWN ? p = o.some((f) => f) : p = o.every((f) => f), s.set(n, { checked: p });
47
47
  });
48
48
  }
49
- function B(l, t) {
49
+ function B(l, s) {
50
50
  return l.map((r) => {
51
- const n = t.get(r.id), s = n ? { ...r, ...n } : r;
51
+ const c = s.get(r.id), t = c ? { ...r, ...c } : r;
52
52
  return r.children ? {
53
- ...s,
54
- children: B(r.children, t)
55
- } : s;
53
+ ...t,
54
+ children: B(r.children, s)
55
+ } : t;
56
56
  });
57
57
  }
58
- const Q = ({
58
+ const V = ({
59
59
  setItems: l,
60
- findItemById: t,
61
- updateParentsUpward: r,
62
- onChange: n,
63
- onItemToggle: s,
64
- getCategory: c,
65
- setCollapsedItems: e,
66
- setIsListCollapsed: h,
67
- setSelectedCategories: f,
68
- isUserChangeRef: i,
69
- selectionMode: o,
60
+ itemsRef: s,
61
+ findItemById: r,
62
+ updateParentsUpward: c,
63
+ onChange: t,
64
+ onItemToggle: e,
65
+ getCategory: n,
66
+ setCollapsedItems: h,
67
+ setIsListCollapsed: o,
68
+ setSelectedCategories: p,
69
+ markUserChange: f,
70
+ selectionMode: E,
70
71
  // Normalized state helpers
71
- isNormalized: y = !1,
72
- normalizedState: E,
73
- batchUpdateItems: P
72
+ isNormalized: T = !1,
73
+ normalizedState: D,
74
+ batchUpdateItems: y
74
75
  }) => {
75
- const W = _(
76
+ const v = _(
76
77
  (d) => {
77
- if (!E || !P) return;
78
- i.current = !0;
79
- const p = E.byId.get(d);
80
- if (!p) return;
81
- const u = !p.checked, a = G(
82
- E,
78
+ if (!D || !y) return;
79
+ f();
80
+ const i = D.byId.get(d);
81
+ if (!i) return;
82
+ const u = !i.checked, N = J(
83
+ D,
83
84
  d,
84
85
  u,
85
- o
86
+ E
86
87
  );
87
- J(E, a, d, o), P(a), l((T) => {
88
- const w = B(T, a);
89
- if (n(w), s) {
90
- const k = [];
91
- a.forEach((N, A) => {
92
- if (N.checked !== void 0) {
93
- const C = E.byId.get(A), O = C ? c ? c(C) : C.category : void 0;
94
- k.push({ itemId: A, checked: N.checked, category: O });
95
- }
96
- }), s(k);
97
- }
98
- return w;
99
- });
88
+ K(D, N, d, E), y(N);
89
+ const O = B(s.current, N);
90
+ if (l(O), t(O), e) {
91
+ const g = [];
92
+ N.forEach((C, k) => {
93
+ if (C.checked !== void 0) {
94
+ const A = D.byId.get(k), P = A ? n ? n(A) : A.category : void 0;
95
+ g.push({ itemId: k, checked: C.checked, category: P });
96
+ }
97
+ }), e(g);
98
+ }
100
99
  },
101
100
  [
101
+ D,
102
+ y,
103
+ f,
104
+ s,
102
105
  E,
103
- P,
104
- i,
105
- o,
106
106
  l,
107
- n,
108
- s,
109
- c
107
+ t,
108
+ e,
109
+ n
110
110
  ]
111
- ), g = _(
111
+ ), W = _(
112
112
  (d) => {
113
- i.current = !0, l((p) => {
114
- const u = t(p, d), a = u ? !u.checked : !1, T = q(
115
- p,
116
- d,
117
- a,
118
- o
119
- ), w = r(T, d);
120
- if (n(w), s && u) {
121
- const k = [];
122
- if (o === D.INDEPENDENT) {
123
- const N = c ? c(u) : u.category;
124
- k.push({ itemId: u.id, checked: a, category: N });
125
- } else {
126
- const N = (A, C, O) => {
127
- const b = c ? c(A) : A.category;
128
- O.push({ itemId: A.id, checked: C, category: b }), A.children && A.children.forEach((j) => {
129
- N(j, C, O);
130
- });
131
- };
132
- N(u, a, k);
133
- }
134
- s(k);
113
+ f();
114
+ const i = s.current, u = r(i, d), N = u ? !u.checked : !1, O = G(
115
+ i,
116
+ d,
117
+ N,
118
+ E
119
+ ), g = c(O, d);
120
+ if (l(g), t(g), e && u) {
121
+ const C = [];
122
+ if (E === a.INDEPENDENT) {
123
+ const k = n ? n(u) : u.category;
124
+ C.push({ itemId: u.id, checked: N, category: k });
125
+ } else {
126
+ const k = (A, P, w) => {
127
+ const j = n ? n(A) : A.category;
128
+ w.push({ itemId: A.id, checked: P, category: j }), A.children && A.children.forEach((q) => {
129
+ k(q, P, w);
130
+ });
131
+ };
132
+ k(u, N, C);
135
133
  }
136
- return w;
137
- });
134
+ e(C);
135
+ }
138
136
  },
139
137
  [
138
+ r,
140
139
  t,
140
+ e,
141
+ c,
141
142
  n,
143
+ f,
142
144
  s,
143
- r,
144
- c,
145
- i,
146
145
  l,
147
- o
146
+ E
148
147
  ]
149
- ), x = _(
148
+ ), F = _(
150
149
  (d) => {
151
- y && E && P ? W(d) : g(d);
150
+ T && D && y ? v(d) : W(d);
152
151
  },
153
- [y, E, P, W, g]
154
- ), F = _(
152
+ [T, D, y, v, W]
153
+ ), H = _(
155
154
  (d) => {
156
- e((p) => ({
157
- ...p,
158
- [d]: !p[d]
155
+ h((i) => ({
156
+ ...i,
157
+ [d]: !i[d]
159
158
  }));
160
159
  },
161
- [e]
162
- ), H = _(() => {
163
- h((d) => !d);
164
- }, [h]), S = _(
160
+ [h]
161
+ ), S = _(() => {
162
+ o((d) => !d);
163
+ }, [o]), b = _(
165
164
  (d) => {
166
- f((p) => {
167
- const u = new Set(p);
165
+ p((i) => {
166
+ const u = new Set(i);
168
167
  return u.has(d) ? u.delete(d) : u.add(d), u;
169
168
  });
170
169
  },
171
- [f]
170
+ [p]
172
171
  );
173
172
  return {
174
- handleToggle: x,
175
- handleToggleCollapse: F,
176
- handleCollapseAll: H,
177
- handleToggleCategory: S
173
+ handleToggle: F,
174
+ handleToggleCollapse: H,
175
+ handleCollapseAll: S,
176
+ handleToggleCategory: b
178
177
  };
179
178
  };
180
179
  export {
181
180
  B as applyUpdatesToTree,
182
- G as toggleItemAndChildrenNormalized,
183
- J as updateParentsNormalized,
184
- Q as useNestedListHandlers
181
+ J as toggleItemAndChildrenNormalized,
182
+ K as updateParentsNormalized,
183
+ V as useNestedListHandlers
185
184
  };
@@ -51,11 +51,10 @@ export declare const useNestedListState: ({ initialItems, enableApplyDiscard, en
51
51
  setSavedNormalizedState: import('react').Dispatch<import('react').SetStateAction<NormalizedItems>>;
52
52
  items: NestedListItem[];
53
53
  setItems: import('react').Dispatch<import('react').SetStateAction<NestedListItem[]>>;
54
+ itemsRef: import('react').RefObject<NestedListItem[]>;
54
55
  savedItems: NestedListItem[];
55
56
  setSavedItems: import('react').Dispatch<import('react').SetStateAction<NestedListItem[]>>;
56
- isUserChangeRef: {
57
- current: boolean;
58
- };
57
+ markUserChange: () => void;
59
58
  searchText: string;
60
59
  setSearchText: import('react').Dispatch<import('react').SetStateAction<string>>;
61
60
  collapsedItems: Record<string, boolean>;
@@ -1,166 +1,167 @@
1
- import { useState as u, useMemo as O, useCallback as g } from "react";
2
- function p(s) {
3
- const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), d = [], i = (r, h) => {
4
- r.forEach((o) => {
5
- 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);
1
+ import { useState as o, useCallback as y, useRef as N, useEffect as z, useMemo as ss } from "react";
2
+ function l(t) {
3
+ const n = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), e = /* @__PURE__ */ new Map(), u = [], i = (I, h) => {
4
+ I.forEach((r) => {
5
+ 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);
6
6
  });
7
7
  };
8
- return i(s, null), { byId: e, childrenById: t, parentById: n, rootIds: d };
8
+ return i(t, null), { byId: n, childrenById: s, parentById: e, rootIds: u };
9
9
  }
10
- function a(s) {
11
- const e = (t) => {
12
- const n = [];
13
- for (const d of t) {
14
- const i = s.byId.get(d);
10
+ function T(t) {
11
+ const n = (s) => {
12
+ const e = [];
13
+ for (const u of s) {
14
+ const i = t.byId.get(u);
15
15
  if (!i) continue;
16
- const r = s.childrenById.get(d) || [], h = r.length > 0 ? e(r) : void 0;
17
- n.push({
16
+ const I = t.childrenById.get(u) || [], h = I.length > 0 ? n(I) : void 0;
17
+ e.push({
18
18
  ...i,
19
19
  children: h
20
20
  });
21
21
  }
22
- return n;
22
+ return e;
23
23
  };
24
- return e(s.rootIds);
24
+ return n(t.rootIds);
25
25
  }
26
- function R(s, e, t) {
27
- const n = s.byId.get(e);
28
- if (!n) return s;
29
- const d = new Map(s.byId);
30
- return d.set(e, { ...n, ...t }), {
31
- ...s,
32
- byId: d
26
+ function j(t, n, s) {
27
+ const e = t.byId.get(n);
28
+ if (!e) return t;
29
+ const u = new Map(t.byId);
30
+ return u.set(n, { ...e, ...s }), {
31
+ ...t,
32
+ byId: u
33
33
  };
34
34
  }
35
- function N(s, e) {
36
- return s.byId.get(e) || null;
35
+ function ts(t, n) {
36
+ return t.byId.get(n) || null;
37
37
  }
38
- function z(s, e) {
39
- const t = [];
40
- let n = s.parentById.get(e) || null;
41
- for (; n !== null; )
42
- t.push(n), n = s.parentById.get(n) || null;
43
- return t;
38
+ function es(t, n) {
39
+ const s = [];
40
+ let e = t.parentById.get(n) || null;
41
+ for (; e !== null; )
42
+ s.push(e), e = t.parentById.get(e) || null;
43
+ return s;
44
44
  }
45
- function tt(s, e) {
46
- const t = [], n = (d) => {
47
- (s.childrenById.get(d) || []).forEach((r) => {
48
- t.push(r), n(r);
45
+ function ns(t, n) {
46
+ const s = [], e = (u) => {
47
+ (t.childrenById.get(u) || []).forEach((I) => {
48
+ s.push(I), e(I);
49
49
  });
50
50
  };
51
- return n(e), t;
51
+ return e(n), s;
52
52
  }
53
- const nt = ({
54
- initialItems: s,
55
- enableApplyDiscard: e,
56
- enableNormalizedState: t = !1,
57
- initialCollapsedItems: n
53
+ const rs = ({
54
+ initialItems: t,
55
+ enableApplyDiscard: n,
56
+ enableNormalizedState: s = !1,
57
+ initialCollapsedItems: e
58
58
  }) => {
59
- const [d, i] = u(s), [r, h] = u(!1), o = O(() => ({
60
- get current() {
61
- return r;
62
- },
63
- set current(c) {
64
- c !== r && queueMicrotask(() => h(c));
65
- }
66
- }), [r]), C = d !== s, [j, x] = u(s), [v, l] = u(s), [f, w] = u(
67
- () => t ? p(s) : {
59
+ 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);
60
+ z(() => {
61
+ k.current = p;
62
+ }, [p]);
63
+ const [f, B] = o(
64
+ () => s ? l(t) : {
68
65
  byId: /* @__PURE__ */ new Map(),
69
66
  childrenById: /* @__PURE__ */ new Map(),
70
67
  parentById: /* @__PURE__ */ new Map(),
71
68
  rootIds: []
72
69
  }
73
- ), [k, E] = u(
74
- () => t ? p(s) : {
70
+ ), [E, U] = o(
71
+ () => s ? l(t) : {
75
72
  byId: /* @__PURE__ */ new Map(),
76
73
  childrenById: /* @__PURE__ */ new Map(),
77
74
  parentById: /* @__PURE__ */ new Map(),
78
75
  rootIds: []
79
76
  }
80
- ), [G, J] = u(""), [K, P] = u(n ?? {}), [Q, V] = u(!1), [W, X] = u(null), [Y, Z] = u(null), [_, $] = u(
77
+ ), [q, G] = o(""), [J, K] = o(e ?? {}), [P, Q] = o(!1), [V, W] = o(null), [X, Y] = o(null), [Z, _] = o(
81
78
  /* @__PURE__ */ new Set()
82
- ), [m, b] = u(/* @__PURE__ */ new Set());
83
- if (C && !r && (i(s), l(s), e && x(s), t)) {
84
- const c = p(s);
85
- w(c), e && E(c);
86
- }
87
- r && !C && h(!1);
88
- const U = g((c) => t ? N(f, c) : null, [t, f]), L = g((c, y) => {
89
- t && (w((I) => R(I, c, y)), l((I) => a(R(p(I), c, y))));
90
- }, [t]), A = g((c) => t ? z(f, c) : [], [t, f]), F = g((c) => t ? tt(f, c) : [], [t, f]), q = g((c) => {
91
- t && (w((y) => {
92
- const I = new Map(y.byId);
93
- return c.forEach((T, B) => {
94
- const M = I.get(B);
95
- M && I.set(B, { ...M, ...T });
96
- }), { ...y, byId: I };
97
- }), l((y) => {
98
- const I = p(y);
99
- return c.forEach((T, B) => {
100
- const M = I.byId.get(B);
101
- M && I.byId.set(B, { ...M, ...T });
102
- }), a(I);
79
+ ), [$, b] = o(/* @__PURE__ */ new Set());
80
+ if (C) {
81
+ if (i(t), I)
82
+ h(!1);
83
+ else if (w(t), n && x(t), s) {
84
+ const c = l(t);
85
+ B(c), n && U(c);
86
+ }
87
+ } else I && h(!1);
88
+ const L = y((c) => s ? ts(f, c) : null, [s, f]), A = y((c, g) => {
89
+ s && (B((d) => j(d, c, g)), w((d) => T(j(l(d), c, g))));
90
+ }, [s]), F = y((c) => s ? es(f, c) : [], [s, f]), R = y((c) => s ? ns(f, c) : [], [s, f]), D = y((c) => {
91
+ s && (B((g) => {
92
+ const d = new Map(g.byId);
93
+ return c.forEach((a, M) => {
94
+ const v = d.get(M);
95
+ v && d.set(M, { ...v, ...a });
96
+ }), { ...g, byId: d };
97
+ }), w((g) => {
98
+ const d = l(g);
99
+ return c.forEach((a, M) => {
100
+ const v = d.byId.get(M);
101
+ v && d.byId.set(M, { ...v, ...a });
102
+ }), T(d);
103
103
  }));
104
- }, [t]), D = g(() => {
105
- t && l(a(f));
106
- }, [t, f]), H = g(() => {
107
- t && w(p(v));
108
- }, [t, v]), S = O(() => ({
109
- findItemByIdFast: U,
110
- updateItemFast: L,
111
- getAncestors: A,
112
- getDescendants: F,
113
- batchUpdateItems: q,
114
- syncToTreeState: D,
115
- syncToNormalizedState: H,
116
- isNormalized: t,
104
+ }, [s]), H = y(() => {
105
+ s && w(T(f));
106
+ }, [s, f]), O = y(() => {
107
+ s && B(l(p));
108
+ }, [s, p]), S = ss(() => ({
109
+ findItemByIdFast: L,
110
+ updateItemFast: A,
111
+ getAncestors: F,
112
+ getDescendants: R,
113
+ batchUpdateItems: D,
114
+ syncToTreeState: H,
115
+ syncToNormalizedState: O,
116
+ isNormalized: s,
117
117
  normalizedState: f,
118
- setNormalizedState: w,
119
- savedNormalizedState: k,
120
- setSavedNormalizedState: E
118
+ setNormalizedState: B,
119
+ savedNormalizedState: E,
120
+ setSavedNormalizedState: U
121
121
  }), [
122
- U,
123
122
  L,
124
123
  A,
125
124
  F,
126
- q,
125
+ R,
127
126
  D,
128
127
  H,
129
- t,
128
+ O,
129
+ s,
130
130
  f,
131
- k
131
+ E
132
132
  ]);
133
133
  return {
134
134
  // Standard state (backward compatible)
135
- items: v,
136
- setItems: l,
137
- savedItems: j,
135
+ items: p,
136
+ setItems: w,
137
+ itemsRef: k,
138
+ savedItems: m,
138
139
  setSavedItems: x,
139
- isUserChangeRef: o,
140
- searchText: G,
141
- setSearchText: J,
142
- collapsedItems: K,
143
- setCollapsedItems: P,
144
- isListCollapsed: Q,
145
- setIsListCollapsed: V,
146
- activeId: W,
147
- setActiveId: X,
148
- overId: Y,
149
- setOverId: Z,
150
- selectedCategories: _,
151
- setSelectedCategories: $,
152
- itemsToBlink: m,
140
+ markUserChange: r,
141
+ searchText: q,
142
+ setSearchText: G,
143
+ collapsedItems: J,
144
+ setCollapsedItems: K,
145
+ isListCollapsed: P,
146
+ setIsListCollapsed: Q,
147
+ activeId: V,
148
+ setActiveId: W,
149
+ overId: X,
150
+ setOverId: Y,
151
+ selectedCategories: Z,
152
+ setSelectedCategories: _,
153
+ itemsToBlink: $,
153
154
  setItemsToBlink: b,
154
155
  // Normalized state helpers (for optimized operations)
155
156
  ...S
156
157
  };
157
158
  };
158
159
  export {
159
- a as denormalizeItems,
160
- z as getAncestorIds,
161
- tt as getDescendantIds,
162
- N as getItemById,
163
- p as normalizeItems,
164
- R as updateNormalizedItem,
165
- nt as useNestedListState
160
+ T as denormalizeItems,
161
+ es as getAncestorIds,
162
+ ns as getDescendantIds,
163
+ ts as getItemById,
164
+ l as normalizeItems,
165
+ j as updateNormalizedItem,
166
+ rs as useNestedListState
166
167
  };