@accelint/design-system 0.8.1 → 0.9.0

package/dist/hooks/use-tree/index.d.ts

@@ -1,4 +1,7 @@
-export { useTree } from './use-tree.js';
-import '../../types/use-tree.js';
+import { UseTreeOptions, UseTreeResult } from '../../types/use-tree.js';
 import '@react-stately/data';
 import '@react-types/shared';
+
+declare function useTree<T>({ allowsExpansion, allowsVisibility, nodes, selectionMode, onSelectionChange, onUpdate, }: UseTreeOptions<T>): UseTreeResult<T>;
+
+export { useTree };

package/dist/hooks/use-tree/index.js

@@ -1,4 +1,262 @@
 import '../../chunk-PZ5AY32C.js';
-export { useTree } from './use-tree.js';
+import { useTreeData } from '@react-stately/data';
+import isEqual from 'lodash/isEqual';
+import { useId, useMemo, useRef, useCallback } from 'react';
+import { useUpdateEffect } from '../use-update-effect/index.js';
+import { getKey, getChildren, mapTree, toggleVisibility } from './utils.js';
+
+function useTree({
+  allowsExpansion = true,
+  allowsVisibility = false,
+  nodes,
+  selectionMode = "none",
+  onSelectionChange,
+  onUpdate
+}) {
+  const rootKey = useId();
+  const list = useTreeData({
+    initialItems: nodes,
+    getChildren,
+    getKey
+  });
+  useUpdateEffect(() => {
+    if (selectionMode === "none" && list.selectedKeys.size) {
+      list.setSelectedKeys(/* @__PURE__ */ new Set());
+    }
+  }, [selectionMode, list.selectedKeys.size]);
+  const { lookup, tree, getItem, update } = useMemo(() => {
+    const lookup2 = {};
+    let tree2 = mapTree(
+      {
+        key: rootKey,
+        children: list.items
+      },
+      (node) => {
+        if (node.key === rootKey) {
+          return;
+        }
+        node = lookup2[node.key] = getItem2(node.key);
+        return node;
+      }
+    );
+    if (allowsVisibility) {
+      tree2 = mapTree(
+        {
+          key: rootKey,
+          children: toggleVisibility(tree2.children)
+        },
+        (node) => {
+          if (node.key === rootKey) {
+            return;
+          }
+          lookup2[node.key] = node;
+          return node;
+        }
+      );
+    }
+    function getItem2(key) {
+      let node = lookup2[key];
+      if (node) {
+        return node;
+      }
+      node = list.getItem(key);
+      if ("nodes" in node.value) {
+        return {
+          ...node,
+          value: {
+            ...node.value,
+            nodes: node.children.flatMap((child) => {
+              const value = lookup2[child.key]?.value;
+              if (value) {
+                return [value];
+              }
+              return [];
+            })
+          }
+        };
+      }
+      return node;
+    }
+    function update2(key, patch) {
+      const node = getItem2(key);
+      let value;
+      if ("nodes" in node.value) {
+        value = {
+          ...node.value,
+          ...patch,
+          // Disallow a parent update to change child values
+          nodes: node.children.flatMap((child) => {
+            const value2 = lookup2[child.key]?.value;
+            if (value2) {
+              return [value2];
+            }
+            return [];
+          })
+        };
+      } else {
+        value = {
+          ...node.value,
+          ...patch
+        };
+      }
+      lookup2[key] = {
+        ...node,
+        value
+      };
+      list.update(key, value);
+    }
+    return { lookup: lookup2, tree: tree2, getItem: getItem2, update: update2 };
+  }, [rootKey, list, allowsVisibility]);
+  const treeRef = useRef(tree);
+  useUpdateEffect(() => {
+    if (isEqual(treeRef.current, tree)) {
+      return;
+    }
+    treeRef.current = tree;
+    onUpdate?.(tree.children.map(({ value }) => value));
+  }, [tree]);
+  const previousExpansionValuesRef = useRef([]);
+  const revertIsExpanded = useCallback(() => {
+    if (!previousExpansionValuesRef.current.length) {
+      return;
+    }
+    for (const { key, patch } of previousExpansionValuesRef.current) {
+      update(key, patch);
+    }
+    previousExpansionValuesRef.current = [];
+  }, [update]);
+  const toggleIsExpanded = useCallback(
+    (selection = "all", isExpanded = void 0, isRevertable = false) => {
+      if (!(allowsExpansion || isRevertable)) {
+        return;
+      }
+      if (!isRevertable) {
+        previousExpansionValuesRef.current = [];
+      }
+      function toggle({ key, value }) {
+        if (key === rootKey || !("nodes" in value)) {
+          return;
+        }
+        if (isRevertable) {
+          previousExpansionValuesRef.current.push({
+            key,
+            patch: { isExpanded: value.isExpanded }
+          });
+        }
+        update(key, { isExpanded: isExpanded ?? !value.isExpanded });
+      }
+      if (selection === "all") {
+        return mapTree(tree, toggle);
+      }
+      mapTree(tree, (node) => {
+        if (!selection.has(node.key)) {
+          return;
+        }
+        toggle(node);
+      });
+    },
+    [allowsExpansion, tree, rootKey, update]
+  );
+  const toggleIsSelected = useCallback(
+    // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: TODO: refactor
+    (selection = "all", isSelected = void 0) => {
+      if (selectionMode === "none" || selectionMode === "single" && (selection === "all" || selection.size > 1)) {
+        return;
+      }
+      const all = Object.values(lookup);
+      let keys = selection === "all" ? new Set(all.map(({ key }) => key)) : selection;
+      if (isSelected != null) {
+        keys = isSelected ? keys : /* @__PURE__ */ new Set();
+        list.setSelectedKeys(keys);
+        return onSelectionChange?.(
+          (selection === "all" || keys.size === all.length) && isSelected ? "all" : keys
+        );
+      }
+      keys = /* @__PURE__ */ new Set([
+        ...selectionMode === "multiple" ? [...list.selectedKeys].filter(
+          (key) => !selection.has(key)
+        ) : [],
+        ...[...keys].filter((key) => !list.selectedKeys.has(key))
+      ]);
+      list.setSelectedKeys(keys);
+      onSelectionChange?.(
+        selection === "all" && keys.size === all.length ? "all" : keys
+      );
+    },
+    [selectionMode, lookup, list, onSelectionChange]
+  );
+  const toggleIsViewable = useCallback(
+    (selection = "all", isViewable = void 0) => {
+      if (!allowsVisibility) {
+        return;
+      }
+      if (selection === "all") {
+        return mapTree(tree, ({ key, value }) => {
+          if (key === rootKey) {
+            return;
+          }
+          if (!value.isReadOnly) {
+            update(key, {
+              isViewable: isViewable ?? !value.isViewable
+            });
+          }
+        });
+      }
+      mapTree(
+        {
+          key: rootKey,
+          children: Array.from(selection).reduce(
+            (acc, key) => toggleVisibility(acc, key, isViewable),
+            tree.children
+          )
+        },
+        ({ key, value }) => {
+          if (key === rootKey) {
+            return;
+          }
+          if (!value.isReadOnly) {
+            update(key, { isViewable: value.isViewable });
+          }
+        }
+      );
+    },
+    [allowsVisibility, tree, rootKey, update]
+  );
+  return useMemo(() => {
+    const { items: _, selectedKeys, ...rest } = list;
+    return {
+      actions: {
+        ...rest,
+        getItem,
+        revertIsExpanded,
+        toggleIsExpanded,
+        toggleIsSelected,
+        toggleIsViewable,
+        update
+      },
+      allowsExpansion,
+      allowsVisibility,
+      lookup,
+      selectedKeys,
+      selectionMode,
+      tree
+    };
+  }, [
+    list,
+    allowsExpansion,
+    allowsVisibility,
+    lookup,
+    selectionMode,
+    tree,
+    getItem,
+    revertIsExpanded,
+    toggleIsExpanded,
+    toggleIsSelected,
+    toggleIsViewable,
+    update
+  ]);
+}
+
+export { useTree };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/hooks/use-tree/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"index.js","sourcesContent":[]}
+{"version":3,"sources":["../../../src/hooks/use-tree/index.ts"],"names":["lookup","tree","getItem","update","value"],"mappings":";;;;;;;AA0BO,SAAS,OAAW,CAAA;AAAA,EACzB,eAAkB,GAAA,IAAA;AAAA,EAClB,gBAAmB,GAAA,KAAA;AAAA,EACnB,KAAA;AAAA,EACA,aAAgB,GAAA,MAAA;AAAA,EAChB,iBAAA;AAAA,EACA;AACF,CAAwC,EAAA;AACtC,EAAA,MAAM,UAAU,KAAM,EAAA;AAEtB,EAAA,MAAM,OAAO,WAAY,CAAA;AAAA,IACvB,YAAc,EAAA,KAAA;AAAA,IACd,WAAA;AAAA,IACA;AAAA,GACD,CAAA;AAED,EAAA,eAAA,CAAgB,MAAM;AACpB,IAAA,IAAI,aAAkB,KAAA,MAAA,IAAU,IAAK,CAAA,YAAA,CAAa,IAAM,EAAA;AACtD,MAAK,IAAA,CAAA,eAAA,iBAAoB,IAAA,GAAA,EAAK,CAAA;AAAA;AAChC,KACC,CAAC,aAAA,EAAe,IAAK,CAAA,YAAA,CAAa,IAAI,CAAC,CAAA;AAuB1C,EAAA,MAAM,EAAE,MAAQ,EAAA,IAAA,EAAM,SAAS,MAAO,EAAA,GAAI,QAAQ,MAAM;AACtD,IAAA,MAAMA,UAAmC,EAAC;AAE1C,IAAA,IAAIC,KAAO,GAAA,OAAA;AAAA,MACT;AAAA,QACE,GAAK,EAAA,OAAA;AAAA,QACL,UAAU,IAAK,CAAA;AAAA,OACjB;AAAA,MACA,CAAC,IAAS,KAAA;AACR,QAAI,IAAA,IAAA,CAAK,QAAQ,OAAS,EAAA;AACxB,UAAA;AAAA;AAGF,QAAA,IAAA,GAAOD,QAAO,IAAK,CAAA,GAAG,CAAIE,GAAAA,QAAAA,CAAQ,KAAK,GAAG,CAAA;AAE1C,QAAO,OAAA,IAAA;AAAA;AACT,KACF;AAEA,IAAA,IAAI,gBAAkB,EAAA;AACpB,MAAAD,KAAO,GAAA,OAAA;AAAA,QACL;AAAA,UACE,GAAK,EAAA,OAAA;AAAA,UACL,QAAA,EAAU,gBAAiBA,CAAAA,KAAAA,CAAK,QAAQ;AAAA,SAC1C;AAAA,QACA,CAAC,IAAS,KAAA;AACR,UAAI,IAAA,IAAA,CAAK,QAAQ,OAAS,EAAA;AACxB,YAAA;AAAA;AAGF,UAAAD,OAAAA,CAAO,IAAK,CAAA,GAAG,CAAI,GAAA,IAAA;AAEnB,UAAO,OAAA,IAAA;AAAA;AACT,OACF;AAAA;AAGF,IAAA,SAASE,SAAQ,GAAuB,EAAA;AACtC,MAAI,IAAA,IAAA,GAAOF,QAAO,GAAG,CAAA;AAErB,MAAA,IAAI,IAAM,EAAA;AACR,QAAO,OAAA,IAAA;AAAA;AAGT,MAAO,IAAA,GAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAEvB,MAAI,IAAA,OAAA,IAAW,KAAK,KAAO,EAAA;AACzB,QAAO,OAAA;AAAA,UACL,GAAG,IAAA;AAAA,UACH,KAAO,EAAA;AAAA,YACL,GAAG,IAAK,CAAA,KAAA;AAAA,YACR,KAAO,EAAA,IAAA,CAAK,QAAS,CAAA,OAAA,CAAQ,CAAC,KAAU,KAAA;AACtC,cAAA,MAAM,KAAQA,GAAAA,OAAAA,CAAO,KAAM,CAAA,GAAG,CAAG,EAAA,KAAA;AAEjC,cAAA,IAAI,KAAO,EAAA;AACT,gBAAA,OAAO,CAAC,KAAK,CAAA;AAAA;AAGf,cAAA,OAAO,EAAC;AAAA,aACT;AAAA;AACH,SACF;AAAA;AAGF,MAAO,OAAA,IAAA;AAAA;AAGT,IAASG,SAAAA,OAAAA,CAAO,KAAU,KAA8B,EAAA;AACtD,MAAM,MAAA,IAAA,GAAOD,SAAQ,GAAG,CAAA;AAExB,MAAI,IAAA,KAAA;AAEJ,MAAI,IAAA,OAAA,IAAW,KAAK,KAAO,EAAA;AACzB,QAAQ,KAAA,GAAA;AAAA,UACN,GAAG,IAAK,CAAA,KAAA;AAAA,UACR,GAAG,KAAA;AAAA;AAAA,UAEH,KAAO,EAAA,IAAA,CAAK,QAAS,CAAA,OAAA,CAAQ,CAAC,KAAU,KAAA;AACtC,YAAA,MAAME,MAAQJ,GAAAA,OAAAA,CAAO,KAAM,CAAA,GAAG,CAAG,EAAA,KAAA;AAEjC,YAAA,IAAII,MAAO,EAAA;AACT,cAAA,OAAO,CAACA,MAAK,CAAA;AAAA;AAGf,YAAA,OAAO,EAAC;AAAA,WACT;AAAA,SACH;AAAA,OACK,MAAA;AACL,QAAQ,KAAA,GAAA;AAAA,UACN,GAAG,IAAK,CAAA,KAAA;AAAA,UACR,GAAG;AAAA,SACL;AAAA;AAQF,MAAAJ,OAAAA,CAAO,GAAG,CAAI,GAAA;AAAA,QACZ,GAAG,IAAA;AAAA,QACH;AAAA,OACF;AAEA,MAAK,IAAA,CAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA;AAGxB,IAAO,OAAA,EAAE,QAAAA,OAAQ,EAAA,IAAA,EAAAC,OAAM,OAAAC,EAAAA,QAAAA,EAAS,QAAAC,OAAO,EAAA;AAAA,GACtC,EAAA,CAAC,OAAS,EAAA,IAAA,EAAM,gBAAgB,CAAC,CAAA;AAEpC,EAAM,MAAA,OAAA,GAAU,OAAO,IAAI,CAAA;AAS3B,EAAA,eAAA,CAAgB,MAAM;AACpB,IAAA,IAAI,OAAQ,CAAA,OAAA,CAAQ,OAAS,EAAA,IAAI,CAAG,EAAA;AAClC,MAAA;AAAA;AAGF,IAAA,OAAA,CAAQ,OAAU,GAAA,IAAA;AAElB,IAAW,QAAA,GAAA,IAAA,CAAK,SAAS,GAAI,CAAA,CAAC,EAAE,KAAM,EAAA,KAAM,KAAK,CAAC,CAAA;AAAA,GACpD,EAAG,CAAC,IAAI,CAAC,CAAA;AAET,EAAM,MAAA,0BAAA,GAA6B,MAKjC,CAAA,EAAE,CAAA;AAEJ,EAAM,MAAA,gBAAA,GAAmB,YAAY,MAAM;AACzC,IAAI,IAAA,CAAC,0BAA2B,CAAA,OAAA,CAAQ,MAAQ,EAAA;AAC9C,MAAA;AAAA;AAGF,IAAA,KAAA,MAAW,EAAE,GAAA,EAAK,KAAM,EAAA,IAAK,2BAA2B,OAAS,EAAA;AAC/D,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA;AAGnB,IAAA,0BAAA,CAA2B,UAAU,EAAC;AAAA,GACxC,EAAG,CAAC,MAAM,CAAC,CAAA;AAEX,EAAA,MAAM,gBAAmB,GAAA,WAAA;AAAA,IACvB,CAAC,SAAY,GAAA,KAAA,EAAO,UAAa,GAAA,MAAA,EAAW,eAAe,KAAU,KAAA;AACnE,MAAI,IAAA,EAAE,mBAAmB,YAAe,CAAA,EAAA;AACtC,QAAA;AAAA;AAGF,MAAA,IAAI,CAAC,YAAc,EAAA;AACjB,QAAA,0BAAA,CAA2B,UAAU,EAAC;AAAA;AAGxC,MAAA,SAAS,MAAO,CAAA,EAAE,GAAK,EAAA,KAAA,EAAsB,EAAA;AAC3C,QAAA,IAAI,GAAQ,KAAA,OAAA,IAAW,EAAE,OAAA,IAAW,KAAQ,CAAA,EAAA;AAC1C,UAAA;AAAA;AAGF,QAAA,IAAI,YAAc,EAAA;AAChB,UAAA,0BAAA,CAA2B,QAAQ,IAAK,CAAA;AAAA,YACtC,GAAA;AAAA,YACA,KAAO,EAAA,EAAE,UAAY,EAAA,KAAA,CAAM,UAAW;AAAA,WACvC,CAAA;AAAA;AAGH,QAAA,MAAA,CAAO,KAAK,EAAE,UAAA,EAAY,cAAc,CAAC,KAAA,CAAM,YAAY,CAAA;AAAA;AAG7D,MAAA,IAAI,cAAc,KAAO,EAAA;AACvB,QAAO,OAAA,OAAA,CAAQ,MAAM,MAAM,CAAA;AAAA;AAG7B,MAAQ,OAAA,CAAA,IAAA,EAAM,CAAC,IAAS,KAAA;AACtB,QAAA,IAAI,CAAC,SAAA,CAAU,GAAI,CAAA,IAAA,CAAK,GAAG,CAAG,EAAA;AAC5B,UAAA;AAAA;AAGF,QAAA,MAAA,CAAO,IAAI,CAAA;AAAA,OACZ,CAAA;AAAA,KACH;AAAA,IACA,CAAC,eAAA,EAAiB,IAAM,EAAA,OAAA,EAAS,MAAM;AAAA,GACzC;AAEA,EAAA,MAAM,gBAAmB,GAAA,WAAA;AAAA;AAAA,IAEvB,CAAC,SAAA,GAAY,KAAO,EAAA,UAAA,GAAa,MAAc,KAAA;AAC7C,MACE,IAAA,aAAA,KAAkB,UACjB,aAAkB,KAAA,QAAA,KAChB,cAAc,KAAS,IAAA,SAAA,CAAU,OAAO,CAC3C,CAAA,EAAA;AACA,QAAA;AAAA;AAGF,MAAM,MAAA,GAAA,GAAM,MAAO,CAAA,MAAA,CAAO,MAAM,CAAA;AAEhC,MAAA,IAAI,IACF,GAAA,SAAA,KAAc,KAAQ,GAAA,IAAI,GAAI,CAAA,GAAA,CAAI,GAAI,CAAA,CAAC,EAAE,GAAA,EAAU,KAAA,GAAG,CAAC,CAAI,GAAA,SAAA;AAE7D,MAAA,IAAI,cAAc,IAAM,EAAA;AACtB,QAAO,IAAA,GAAA,UAAA,GAAa,IAAO,mBAAA,IAAI,GAAI,EAAA;AAEnC,QAAA,IAAA,CAAK,gBAAgB,IAAI,CAAA;AAEzB,QAAO,OAAA,iBAAA;AAAA,UAAA,CACJ,cAAc,KAAS,IAAA,IAAA,CAAK,SAAS,GAAI,CAAA,MAAA,KAAW,aACjD,KACA,GAAA;AAAA,SACN;AAAA;AAGF,MAAA,IAAA,uBAAW,GAAI,CAAA;AAAA,QACb,GAAI,aAAkB,KAAA,UAAA,GAClB,CAAC,GAAG,IAAA,CAAK,YAAY,CAAE,CAAA,MAAA;AAAA,UACrB,CAAC,GAAA,KAAQ,CAAE,SAAA,CAAuB,IAAI,GAAG;AAAA,YAE3C,EAAC;AAAA,QACL,GAAG,CAAC,GAAG,IAAI,CAAE,CAAA,MAAA,CAAO,CAAC,GAAA,KAAQ,CAAC,IAAA,CAAK,YAAa,CAAA,GAAA,CAAI,GAAG,CAAC;AAAA,OACzD,CAAA;AAED,MAAA,IAAA,CAAK,gBAAgB,IAAI,CAAA;AAEzB,MAAA,iBAAA;AAAA,QACE,cAAc,KAAS,IAAA,IAAA,CAAK,IAAS,KAAA,GAAA,CAAI,SAAS,KAAQ,GAAA;AAAA,OAC5D;AAAA,KACF;AAAA,IACA,CAAC,aAAA,EAAe,MAAQ,EAAA,IAAA,EAAM,iBAAiB;AAAA,GACjD;AAEA,EAAA,MAAM,gBAAmB,GAAA,WAAA;AAAA,IACvB,CAAC,SAAA,GAAY,KAAO,EAAA,UAAA,GAAa,MAAc,KAAA;AAC7C,MAAA,IAAI,CAAC,gBAAkB,EAAA;AACrB,QAAA;AAAA;AAGF,MAAA,IAAI,cAAc,KAAO,EAAA;AACvB,QAAA,OAAO,QAAQ,IAAM,EAAA,CAAC,EAAE,GAAA,EAAK,OAAY,KAAA;AACvC,UAAA,IAAI,QAAQ,OAAS,EAAA;AACnB,YAAA;AAAA;AAGF,UAAI,IAAA,CAAC,MAAM,UAAY,EAAA;AACrB,YAAA,MAAA,CAAO,GAAK,EAAA;AAAA,cACV,UAAA,EAAY,UAAc,IAAA,CAAC,KAAM,CAAA;AAAA,aAClC,CAAA;AAAA;AACH,SACD,CAAA;AAAA;AAGH,MAAA,OAAA;AAAA,QACE;AAAA,UACE,GAAK,EAAA,OAAA;AAAA,UACL,QAAU,EAAA,KAAA,CAAM,IAAK,CAAA,SAAS,CAAE,CAAA,MAAA;AAAA,YAC9B,CAAC,GAAK,EAAA,GAAA,KAAQ,gBAAiB,CAAA,GAAA,EAAK,KAAK,UAAU,CAAA;AAAA,YACnD,IAAK,CAAA;AAAA;AACP,SACF;AAAA,QACA,CAAC,EAAE,GAAK,EAAA,KAAA,EAAY,KAAA;AAClB,UAAA,IAAI,QAAQ,OAAS,EAAA;AACnB,YAAA;AAAA;AAGF,UAAI,IAAA,CAAC,MAAM,UAAY,EAAA;AACrB,YAAA,MAAA,CAAO,GAAK,EAAA,EAAE,UAAY,EAAA,KAAA,CAAM,YAAY,CAAA;AAAA;AAC9C;AACF,OACF;AAAA,KACF;AAAA,IACA,CAAC,gBAAA,EAAkB,IAAM,EAAA,OAAA,EAAS,MAAM;AAAA,GAC1C;AAEA,EAAA,OAAO,QAAQ,MAAM;AACnB,IAAA,MAAM,EAAE,KAAO,EAAA,CAAA,EAAG,YAAc,EAAA,GAAG,MAAS,GAAA,IAAA;AAE5C,IAAO,OAAA;AAAA,MACL,OAAS,EAAA;AAAA,QACP,GAAG,IAAA;AAAA,QACH,OAAA;AAAA,QACA,gBAAA;AAAA,QACA,gBAAA;AAAA,QACA,gBAAA;AAAA,QACA,gBAAA;AAAA,QACA;AAAA,OACF;AAAA,MACA,eAAA;AAAA,MACA,gBAAA;AAAA,MACA,MAAA;AAAA,MACA,YAAA;AAAA,MACA,aAAA;AAAA,MACA;AAAA,KACF;AAAA,GACC,EAAA;AAAA,IACD,IAAA;AAAA,IACA,eAAA;AAAA,IACA,gBAAA;AAAA,IACA,MAAA;AAAA,IACA,aAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA;AAAA,IACA,gBAAA;AAAA,IACA,gBAAA;AAAA,IACA,gBAAA;AAAA,IACA,gBAAA;AAAA,IACA;AAAA,GACD,CAAA;AACH","file":"index.js","sourcesContent":["/*\n * Copyright 2025 Hypergiant Galactic Systems Inc. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport { useTreeData } from '@react-stately/data';\nimport type { Key } from '@react-types/shared';\nimport isEqual from 'lodash/isEqual';\nimport { useCallback, useId, useMemo, useRef } from 'react';\nimport type {\n  TreeActions,\n  TreeNode,\n  TreeNodes,\n  UseTreeOptions,\n  UseTreeResult,\n} from '../../types/use-tree';\nimport { useUpdateEffect } from '../use-update-effect';\nimport { getChildren, getKey, mapTree, toggleVisibility } from './utils';\n\nexport function useTree<T>({\n  allowsExpansion = true,\n  allowsVisibility = false,\n  nodes,\n  selectionMode = 'none',\n  onSelectionChange,\n  onUpdate,\n}: UseTreeOptions<T>): UseTreeResult<T> {\n  const rootKey = useId();\n\n  const list = useTreeData({\n    initialItems: nodes,\n    getChildren,\n    getKey,\n  });\n\n  useUpdateEffect(() => {\n    if (selectionMode === 'none' && list.selectedKeys.size) {\n      list.setSelectedKeys(new Set());\n    }\n  }, [selectionMode, list.selectedKeys.size]);\n\n  /**\n   * useTreeData doesn't update the state of TreeNode.value when updates\n   * are made to children.\n   *\n   * Given the structure:\n   * Foo\n   * - Bar\n   * - Cat\n   *\n   * There will be TreeNodes for each item, with a value that represents\n   * the original node passed in. If an update occurs to one of the child\n   * nodes (Bar, Cat), then Foo node's value is NOT updated to reflect that\n   * change. This means that each node is the source of truth only for itself\n   * and not any of its children.\n   *\n   * To provide a completely accurate tree, we need to override the getItem\n   * and update methods, as well as replace the list.items with a tree that\n   * is completely accurate at all times. This requires storing (depth first)\n   * each node in a lookup, so that parent node's values can be updated to\n   * reflect the current state of their children.\n   */\n  const { lookup, tree, getItem, update } = useMemo(() => {\n    const lookup: Record<Key, TreeNode<T>> = {};\n\n    let tree = mapTree(\n      {\n        key: rootKey,\n        children: list.items,\n      } as TreeNode<T>,\n      (node) => {\n        if (node.key === rootKey) {\n          return;\n        }\n\n        node = lookup[node.key] = getItem(node.key);\n\n        return node;\n      },\n    );\n\n    if (allowsVisibility) {\n      tree = mapTree(\n        {\n          key: rootKey,\n          children: toggleVisibility(tree.children),\n        } as TreeNode<T>,\n        (node) => {\n          if (node.key === rootKey) {\n            return;\n          }\n\n          lookup[node.key] = node;\n\n          return node;\n        },\n      );\n    }\n\n    function getItem(key: Key): TreeNode<T> {\n      let node = lookup[key];\n\n      if (node) {\n        return node;\n      }\n\n      node = list.getItem(key);\n\n      if ('nodes' in node.value) {\n        return {\n          ...node,\n          value: {\n            ...node.value,\n            nodes: node.children.flatMap((child) => {\n              const value = lookup[child.key]?.value;\n\n              if (value) {\n                return [value];\n              }\n\n              return [];\n            }),\n          },\n        };\n      }\n\n      return node;\n    }\n\n    function update(key: Key, patch: Partial<TreeNodes<T>>) {\n      const node = getItem(key);\n\n      let value: TreeNode<T>['value'];\n\n      if ('nodes' in node.value) {\n        value = {\n          ...node.value,\n          ...patch,\n          // Disallow a parent update to change child values\n          nodes: node.children.flatMap((child) => {\n            const value = lookup[child.key]?.value;\n\n            if (value) {\n              return [value];\n            }\n\n            return [];\n          }),\n        };\n      } else {\n        value = {\n          ...node.value,\n          ...patch,\n        };\n      }\n\n      /**\n       * We must immediately update the state of the lookup due to the\n       * possibility of a queue of state changes and we can't allow for\n       * a parent to update and wipe out a previous child update\n       */\n      lookup[key] = {\n        ...node,\n        value,\n      };\n\n      list.update(key, value);\n    }\n\n    return { lookup, tree, getItem, update };\n  }, [rootKey, list, allowsVisibility]);\n\n  const treeRef = useRef(tree);\n\n  /**\n   * Because tree is a computed value and there are so many methods\n   * that update list.items, it's far simpler to fire the onUpdate\n   * during the render cycle. However, this means that onUpdate can\n   * only be used for side effect purposes and should not trigger\n   * state updates\n   */\n  useUpdateEffect(() => {\n    if (isEqual(treeRef.current, tree)) {\n      return;\n    }\n\n    treeRef.current = tree;\n\n    onUpdate?.(tree.children.map(({ value }) => value));\n  }, [tree]);\n\n  const previousExpansionValuesRef = useRef<\n    {\n      key: Key;\n      patch: { isExpanded?: boolean };\n    }[]\n  >([]);\n\n  const revertIsExpanded = useCallback(() => {\n    if (!previousExpansionValuesRef.current.length) {\n      return;\n    }\n\n    for (const { key, patch } of previousExpansionValuesRef.current) {\n      update(key, patch);\n    }\n\n    previousExpansionValuesRef.current = [];\n  }, [update]);\n\n  const toggleIsExpanded = useCallback<TreeActions<T>['toggleIsExpanded']>(\n    (selection = 'all', isExpanded = undefined, isRevertable = false) => {\n      if (!(allowsExpansion || isRevertable)) {\n        return;\n      }\n\n      if (!isRevertable) {\n        previousExpansionValuesRef.current = [];\n      }\n\n      function toggle({ key, value }: TreeNode<T>) {\n        if (key === rootKey || !('nodes' in value)) {\n          return;\n        }\n\n        if (isRevertable) {\n          previousExpansionValuesRef.current.push({\n            key,\n            patch: { isExpanded: value.isExpanded },\n          });\n        }\n\n        update(key, { isExpanded: isExpanded ?? !value.isExpanded });\n      }\n\n      if (selection === 'all') {\n        return mapTree(tree, toggle);\n      }\n\n      mapTree(tree, (node) => {\n        if (!selection.has(node.key)) {\n          return;\n        }\n\n        toggle(node);\n      });\n    },\n    [allowsExpansion, tree, rootKey, update],\n  );\n\n  const toggleIsSelected = useCallback<TreeActions<T>['toggleIsSelected']>(\n    // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: TODO: refactor\n    (selection = 'all', isSelected = undefined) => {\n      if (\n        selectionMode === 'none' ||\n        (selectionMode === 'single' &&\n          (selection === 'all' || selection.size > 1))\n      ) {\n        return;\n      }\n\n      const all = Object.values(lookup);\n\n      let keys =\n        selection === 'all' ? new Set(all.map(({ key }) => key)) : selection;\n\n      if (isSelected != null) {\n        keys = isSelected ? keys : new Set();\n\n        list.setSelectedKeys(keys);\n\n        return onSelectionChange?.(\n          (selection === 'all' || keys.size === all.length) && isSelected\n            ? 'all'\n            : keys,\n        );\n      }\n\n      keys = new Set([\n        ...(selectionMode === 'multiple'\n          ? [...list.selectedKeys].filter(\n              (key) => !(selection as Set<Key>).has(key),\n            )\n          : []),\n        ...[...keys].filter((key) => !list.selectedKeys.has(key)),\n      ]);\n\n      list.setSelectedKeys(keys);\n\n      onSelectionChange?.(\n        selection === 'all' && keys.size === all.length ? 'all' : keys,\n      );\n    },\n    [selectionMode, lookup, list, onSelectionChange],\n  );\n\n  const toggleIsViewable = useCallback<TreeActions<T>['toggleIsViewable']>(\n    (selection = 'all', isViewable = undefined) => {\n      if (!allowsVisibility) {\n        return;\n      }\n\n      if (selection === 'all') {\n        return mapTree(tree, ({ key, value }) => {\n          if (key === rootKey) {\n            return;\n          }\n\n          if (!value.isReadOnly) {\n            update(key, {\n              isViewable: isViewable ?? !value.isViewable,\n            });\n          }\n        });\n      }\n\n      mapTree(\n        {\n          key: rootKey,\n          children: Array.from(selection).reduce(\n            (acc, key) => toggleVisibility(acc, key, isViewable),\n            tree.children,\n          ),\n        } as TreeNode<T>,\n        ({ key, value }) => {\n          if (key === rootKey) {\n            return;\n          }\n\n          if (!value.isReadOnly) {\n            update(key, { isViewable: value.isViewable });\n          }\n        },\n      );\n    },\n    [allowsVisibility, tree, rootKey, update],\n  );\n\n  return useMemo(() => {\n    const { items: _, selectedKeys, ...rest } = list;\n\n    return {\n      actions: {\n        ...rest,\n        getItem,\n        revertIsExpanded,\n        toggleIsExpanded,\n        toggleIsSelected,\n        toggleIsViewable,\n        update,\n      },\n      allowsExpansion,\n      allowsVisibility,\n      lookup,\n      selectedKeys,\n      selectionMode,\n      tree,\n    };\n  }, [\n    list,\n    allowsExpansion,\n    allowsVisibility,\n    lookup,\n    selectionMode,\n    tree,\n    getItem,\n    revertIsExpanded,\n    toggleIsExpanded,\n    toggleIsSelected,\n    toggleIsViewable,\n    update,\n  ]);\n}\n"]}

package/dist/hooks/use-tree/utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/hooks/use-tree/utils.ts"],"names":[],"mappings":";;;AAeO,SAAS,YAAe,IAAoB,EAAA;AACjD,EAAA,OAAO,OAAW,IAAA,IAAA,GAAO,IAAK,CAAA,KAAA,GAAQ,EAAC;AACzC;AAEO,SAAS,OAAU,IAAoB,EAAA;AAC5C,EAAA,OAAO,IAAK,CAAA,EAAA;AACd;AAEO,SAAS,OAAA,CACd,MAEA,QACa,EAAA;AACb,EAAA,IAAI,OAAU,GAAA,KAAA;AAEd,EAAA,MAAM,QAAW,GAAA,IAAA,CAAK,QAAS,CAAA,GAAA,CAAI,CAAC,KAAU,KAAA;AAC5C,IAAM,MAAA,MAAA,GAAS,OAAQ,CAAA,KAAA,EAAO,QAAQ,CAAA;AAEtC,IAAA,IAAI,WAAW,KAAO,EAAA;AACpB,MAAU,OAAA,GAAA,IAAA;AAAA;AAGZ,IAAO,OAAA,MAAA;AAAA,GACR,CAAA;AAED,EAAA,IAAI,OAAS,EAAA;AACX,IAAO,IAAA,GAAA;AAAA,MACL,GAAG,IAAA;AAAA,MACH;AAAA,KACF;AAAA;AAGF,EAAO,OAAA,QAAA,CAAS,IAAI,CAAK,IAAA,IAAA;AAC3B;AAWO,SAAS,gBACd,CAAA,KAAA,EACA,MAAc,GAAA,EAAA,EACd,UACe,EAAA;AACf,EAAA,MAAM,SAAgB,EAAC;AAEvB,EAAA,IAAI,MAAS,GAAA,wBAAA,CAAyB,KAAO,EAAA,MAAA,EAAQ,UAAY,EAAA;AAAA,IAC/D,eAAiB,EAAA,KAAA;AAAA,IACjB,MAAQ,EAAA,EAAoB,WAAW,IAAK,EAAA;AAAA,IAC5C;AAAA,GACD,CAAA;AAGD,EAAA,OAAQ,MAAS,GAAA,MAAA,CAAO,KAAM,EAAA,IAAK,EAAK,EAAA;AACtC,IAAS,MAAA,GAAA,wBAAA,CAAyB,MAAQ,EAAA,MAAA,EAAQ,MAAW,EAAA;AAAA,MAC3D,eAAiB,EAAA,KAAA;AAAA,MACjB,MAAQ,EAAA,EAAoB,WAAW,IAAK,EAAA;AAAA,MAC5C;AAAA,KACD,CAAA;AAAA;AAGH,EAAO,OAAA,MAAA;AACT;AAEA,SAAS,wBAAA,CACP,OACA,MACA,EAAA,KAAA,EACA,EAAE,eAAiB,EAAA,MAAA,EAAQ,QACZ,EAAA;AACf,EAAO,OAAA,KAAA,CAAM,GAAI,CAAA,CAAC,IAAS,KAAA;AACzB,IAAM,MAAA,UAAA,GACJ,eACC,KAAA,MAAA,KAAW,IAAK,CAAA,GAAA,GACZ,KAAS,IAAA,CAAC,IAAK,CAAA,KAAA,CAAM,UACtB,GAAA,IAAA,CAAK,KAAM,CAAA,UAAA,CAAA;AAEjB,IAAM,MAAA,SAAA,GAAY,OAAO,SAAa,IAAA,UAAA;AACtC,IAAM,MAAA,oBAAA,GAAuB,IAAK,CAAA,KAAA,CAAM,UAAe,KAAA,UAAA;AAGvD,IAAA,IACE,KAAK,SACL,IAAA,oBAAA,IACA,UACA,IAAA,CAAC,OAAO,SACR,EAAA;AACA,MAAO,MAAA,CAAA,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA;AAI5B,IACE,IAAA,IAAA,CAAK,SACL,IAAA,oBAAA,IACA,CAAC,UAAA,IACD,OAAO,SACP,IAAA,qBAAA,CAAsB,KAAO,EAAA,IAAI,CACjC,EAAA;AACA,MAAO,MAAA,CAAA,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA;AAG5B,IAAO,OAAA;AAAA,MACL,GAAG,IAAA;AAAA,MACH,QAAU,EAAA,wBAAA,CAAyB,IAAK,CAAA,QAAA,EAAU,QAAQ,KAAO,EAAA;AAAA;AAAA,QAE/D,eAAA,EACE,mBACC,oBACC,IAAA,CAAC,CAAC,UACF,IAAA,aAAA,CAAc,KAAK,QAAQ,CAAA;AAAA,QAC/B,MAAQ,EAAA;AAAA,UAEN,SAAA,EAAW,CAAC,CAAC;AAAA,SACf;AAAA,QACA;AAAA,OACD,CAAA;AAAA,MACD,KAAO,EAAA;AAAA,QACL,GAAG,IAAK,CAAA,KAAA;AAAA,QACR,UAAA;AAAA,QACA;AAAA;AACF,KACF;AAAA,GACD,CAAA;AACH;AAEA,SAAS,cAAiB,KAA+B,EAAA;AACvD,EAAA,OAAO,KAAM,CAAA,KAAA;AAAA,IACX,CAAC,EAAE,QAAU,EAAA,KAAA,EACX,KAAA,CAAC,KAAM,CAAA,UAAA,KAAe,CAAC,QAAA,CAAS,MAAU,IAAA,aAAA,CAAiB,QAAQ,CAAA;AAAA,GACvE;AACF;AAEA,SAAS,qBAAA,CAAyB,OAAsB,IAAmB,EAAA;AACzE,EAAA,OAAO,cAAc,KAAM,CAAA,MAAA,CAAO,CAAC,CAAM,KAAA,CAAA,KAAM,IAAI,CAAC,CAAA;AACtD","file":"utils.js","sourcesContent":["/*\n * Copyright 2025 Hypergiant Galactic Systems Inc. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport type { Key } from '@react-types/shared';\nimport type { TreeNode, TreeNodes } from '../../types';\n\nexport function getChildren<T>(node: TreeNodes<T>) {\n  return 'nodes' in node ? node.nodes : [];\n}\n\nexport function getKey<T>(node: TreeNodes<T>) {\n  return node.id;\n}\n\nexport function mapTree<T>(\n  node: TreeNode<T>,\n  // biome-ignore lint/suspicious/noConfusingVoidType: void is being used in a return type here. seems like a biome issue\n  callback: (node: TreeNode<T>) => void | TreeNode<T> | undefined,\n): TreeNode<T> {\n  let changed = false;\n\n  const children = node.children.map((child) => {\n    const update = mapTree(child, callback);\n\n    if (update !== child) {\n      changed = true;\n    }\n\n    return update;\n  });\n\n  if (changed) {\n    node = {\n      ...node,\n      children,\n    };\n  }\n\n  return callback(node) ?? node;\n}\n\ntype VisibilityUpdateContext = {\n  forceIsViewable: boolean;\n  parent: {\n    isViewable: boolean;\n    isVisible: boolean;\n  };\n  toggle: Key[];\n};\n\nexport function toggleVisibility<T>(\n  nodes: TreeNode<T>[],\n  target: Key = '',\n  isViewable?: boolean,\n): TreeNode<T>[] {\n  const toggle: Key[] = [];\n\n  let result = toggleVisibilityInternal(nodes, target, isViewable, {\n    forceIsViewable: false,\n    parent: { isViewable: true, isVisible: true },\n    toggle,\n  });\n\n  // biome-ignore lint/suspicious/noAssignInExpressions: intentional\n  while ((target = toggle.shift() ?? '')) {\n    result = toggleVisibilityInternal(result, target, undefined, {\n      forceIsViewable: false,\n      parent: { isViewable: true, isVisible: true },\n      toggle,\n    });\n  }\n\n  return result;\n}\n\nfunction toggleVisibilityInternal<T>(\n  nodes: TreeNode<T>[],\n  target: Key,\n  state: boolean | undefined,\n  { forceIsViewable, parent, toggle }: VisibilityUpdateContext,\n): TreeNode<T>[] {\n  return nodes.map((node) => {\n    const isViewable =\n      forceIsViewable ||\n      (target === node.key\n        ? (state ?? !node.value.isViewable)\n        : node.value.isViewable);\n\n    const isVisible = parent.isVisible && isViewable;\n    const willUpdateIsViewable = node.value.isViewable !== isViewable;\n\n    // Toggle on parent if child of inactive parent is toggled on\n    if (\n      node.parentKey &&\n      willUpdateIsViewable &&\n      isViewable &&\n      !parent.isVisible\n    ) {\n      toggle.push(node.parentKey);\n    }\n\n    // Toggle off parent if last active child is toggled off\n    if (\n      node.parentKey &&\n      willUpdateIsViewable &&\n      !isViewable &&\n      parent.isVisible &&\n      areSiblingsUnviewable(nodes, node)\n    ) {\n      toggle.push(node.parentKey);\n    }\n\n    return {\n      ...node,\n      children: toggleVisibilityInternal(node.children, target, state, {\n        // Toggle all children on if all are inactive and parent is toggled on\n        forceIsViewable:\n          forceIsViewable ||\n          (willUpdateIsViewable &&\n            !!isViewable &&\n            areUnviewable(node.children)),\n        parent: {\n          isViewable: !!isViewable,\n          isVisible: !!isVisible,\n        },\n        toggle,\n      }),\n      value: {\n        ...node.value,\n        isViewable,\n        isVisible,\n      },\n    };\n  });\n}\n\nfunction areUnviewable<T>(nodes: TreeNode<T>[]): boolean {\n  return nodes.every(\n    ({ children, value }) =>\n      !value.isViewable && (!children.length || areUnviewable<T>(children)),\n  );\n}\n\nfunction areSiblingsUnviewable<T>(nodes: TreeNode<T>[], node: TreeNode<T>) {\n  return areUnviewable(nodes.filter((n) => n !== node));\n}\n"]}
+{"version":3,"sources":["../../../src/hooks/use-tree/utils.ts"],"names":[],"mappings":";;;AAeO,SAAS,YAAe,IAAoB,EAAA;AACjD,EAAA,OAAO,OAAW,IAAA,IAAA,GAAO,IAAK,CAAA,KAAA,GAAQ,EAAC;AACzC;AAEO,SAAS,OAAU,IAAoB,EAAA;AAC5C,EAAA,OAAO,IAAK,CAAA,EAAA;AACd;AAEO,SAAS,OAAA,CACd,MAEA,QACa,EAAA;AACb,EAAA,IAAI,OAAU,GAAA,KAAA;AAEd,EAAA,MAAM,QAAW,GAAA,IAAA,CAAK,QAAS,CAAA,GAAA,CAAI,CAAC,KAAU,KAAA;AAC5C,IAAM,MAAA,MAAA,GAAS,OAAQ,CAAA,KAAA,EAAO,QAAQ,CAAA;AAEtC,IAAA,IAAI,WAAW,KAAO,EAAA;AACpB,MAAU,OAAA,GAAA,IAAA;AAAA;AAGZ,IAAO,OAAA,MAAA;AAAA,GACR,CAAA;AAED,EAAA,IAAI,OAAS,EAAA;AACX,IAAO,IAAA,GAAA;AAAA,MACL,GAAG,IAAA;AAAA,MACH;AAAA,KACF;AAAA;AAGF,EAAO,OAAA,QAAA,CAAS,IAAI,CAAK,IAAA,IAAA;AAC3B;AAWO,SAAS,gBACd,CAAA,KAAA,EACA,MAAc,GAAA,EAAA,EACd,UACe,EAAA;AACf,EAAA,MAAM,SAAgB,EAAC;AAEvB,EAAA,IAAI,MAAS,GAAA,wBAAA,CAAyB,KAAO,EAAA,MAAA,EAAQ,UAAY,EAAA;AAAA,IAC/D,eAAiB,EAAA,KAAA;AAAA,IACjB,MAAQ,EAAA,EAAoB,WAAW,IAAK,EAAA;AAAA,IAC5C;AAAA,GACD,CAAA;AAGD,EAAA,OAAQ,MAAS,GAAA,MAAA,CAAO,KAAM,EAAA,IAAK,EAAK,EAAA;AACtC,IAAS,MAAA,GAAA,wBAAA,CAAyB,MAAQ,EAAA,MAAA,EAAQ,MAAW,EAAA;AAAA,MAC3D,eAAiB,EAAA,KAAA;AAAA,MACjB,MAAQ,EAAA,EAAoB,WAAW,IAAK,EAAA;AAAA,MAC5C;AAAA,KACD,CAAA;AAAA;AAGH,EAAO,OAAA,MAAA;AACT;AAEA,SAAS,wBAAA,CACP,OACA,MACA,EAAA,KAAA,EACA,EAAE,eAAiB,EAAA,MAAA,EAAQ,QACZ,EAAA;AACf,EAAO,OAAA,KAAA,CAAM,GAAI,CAAA,CAAC,IAAS,KAAA;AACzB,IAAM,MAAA,UAAA,GACJ,eACC,KAAA,MAAA,KAAW,IAAK,CAAA,GAAA,GACZ,KAAS,IAAA,CAAC,IAAK,CAAA,KAAA,CAAM,UACtB,GAAA,IAAA,CAAK,KAAM,CAAA,UAAA,CAAA;AAEjB,IAAM,MAAA,SAAA,GAAY,OAAO,SAAa,IAAA,UAAA;AACtC,IAAM,MAAA,oBAAA,GAAuB,IAAK,CAAA,KAAA,CAAM,UAAe,KAAA,UAAA;AAGvD,IAAA,IACE,KAAK,SACL,IAAA,oBAAA,IACA,UACA,IAAA,CAAC,OAAO,SACR,EAAA;AACA,MAAO,MAAA,CAAA,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA;AAI5B,IACE,IAAA,IAAA,CAAK,SACL,IAAA,oBAAA,IACA,CAAC,UAAA,IACD,OAAO,SACP,IAAA,qBAAA,CAAsB,KAAO,EAAA,IAAI,CACjC,EAAA;AACA,MAAO,MAAA,CAAA,IAAA,CAAK,KAAK,SAAS,CAAA;AAAA;AAG5B,IAAO,OAAA;AAAA,MACL,GAAG,IAAA;AAAA,MACH,QAAU,EAAA,wBAAA,CAAyB,IAAK,CAAA,QAAA,EAAU,QAAQ,KAAO,EAAA;AAAA;AAAA,QAE/D,eAAA,EACE,mBACC,oBACC,IAAA,CAAC,CAAC,UACF,IAAA,aAAA,CAAc,KAAK,QAAQ,CAAA;AAAA,QAC/B,MAAQ,EAAA;AAAA,UAEN,SAAA,EAAW,CAAC,CAAC;AAAA,SACf;AAAA,QACA;AAAA,OACD,CAAA;AAAA,MACD,KAAO,EAAA;AAAA,QACL,GAAG,IAAK,CAAA,KAAA;AAAA,QACR,UAAA;AAAA,QACA;AAAA;AACF,KACF;AAAA,GACD,CAAA;AACH;AAEA,SAAS,cAAiB,KAA+B,EAAA;AACvD,EAAA,OAAO,KAAM,CAAA,KAAA;AAAA,IACX,CAAC,EAAE,QAAU,EAAA,KAAA,EACX,KAAA,CAAC,KAAM,CAAA,UAAA,KAAe,CAAC,QAAA,CAAS,MAAU,IAAA,aAAA,CAAiB,QAAQ,CAAA;AAAA,GACvE;AACF;AAEA,SAAS,qBAAA,CAAyB,OAAsB,IAAmB,EAAA;AACzE,EAAA,OAAO,cAAc,KAAM,CAAA,MAAA,CAAO,CAAC,CAAM,KAAA,CAAA,KAAM,IAAI,CAAC,CAAA;AACtD","file":"utils.js","sourcesContent":["/*\n * Copyright 2025 Hypergiant Galactic Systems Inc. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport type { Key } from '@react-types/shared';\nimport type { TreeNode, TreeNodes } from '../../types/use-tree';\n\nexport function getChildren<T>(node: TreeNodes<T>) {\n  return 'nodes' in node ? node.nodes : [];\n}\n\nexport function getKey<T>(node: TreeNodes<T>) {\n  return node.id;\n}\n\nexport function mapTree<T>(\n  node: TreeNode<T>,\n  // biome-ignore lint/suspicious/noConfusingVoidType: void is being used in a return type here. seems like a biome issue\n  callback: (node: TreeNode<T>) => void | TreeNode<T> | undefined,\n): TreeNode<T> {\n  let changed = false;\n\n  const children = node.children.map((child) => {\n    const update = mapTree(child, callback);\n\n    if (update !== child) {\n      changed = true;\n    }\n\n    return update;\n  });\n\n  if (changed) {\n    node = {\n      ...node,\n      children,\n    };\n  }\n\n  return callback(node) ?? node;\n}\n\ntype VisibilityUpdateContext = {\n  forceIsViewable: boolean;\n  parent: {\n    isViewable: boolean;\n    isVisible: boolean;\n  };\n  toggle: Key[];\n};\n\nexport function toggleVisibility<T>(\n  nodes: TreeNode<T>[],\n  target: Key = '',\n  isViewable?: boolean,\n): TreeNode<T>[] {\n  const toggle: Key[] = [];\n\n  let result = toggleVisibilityInternal(nodes, target, isViewable, {\n    forceIsViewable: false,\n    parent: { isViewable: true, isVisible: true },\n    toggle,\n  });\n\n  // biome-ignore lint/suspicious/noAssignInExpressions: intentional\n  while ((target = toggle.shift() ?? '')) {\n    result = toggleVisibilityInternal(result, target, undefined, {\n      forceIsViewable: false,\n      parent: { isViewable: true, isVisible: true },\n      toggle,\n    });\n  }\n\n  return result;\n}\n\nfunction toggleVisibilityInternal<T>(\n  nodes: TreeNode<T>[],\n  target: Key,\n  state: boolean | undefined,\n  { forceIsViewable, parent, toggle }: VisibilityUpdateContext,\n): TreeNode<T>[] {\n  return nodes.map((node) => {\n    const isViewable =\n      forceIsViewable ||\n      (target === node.key\n        ? (state ?? !node.value.isViewable)\n        : node.value.isViewable);\n\n    const isVisible = parent.isVisible && isViewable;\n    const willUpdateIsViewable = node.value.isViewable !== isViewable;\n\n    // Toggle on parent if child of inactive parent is toggled on\n    if (\n      node.parentKey &&\n      willUpdateIsViewable &&\n      isViewable &&\n      !parent.isVisible\n    ) {\n      toggle.push(node.parentKey);\n    }\n\n    // Toggle off parent if last active child is toggled off\n    if (\n      node.parentKey &&\n      willUpdateIsViewable &&\n      !isViewable &&\n      parent.isVisible &&\n      areSiblingsUnviewable(nodes, node)\n    ) {\n      toggle.push(node.parentKey);\n    }\n\n    return {\n      ...node,\n      children: toggleVisibilityInternal(node.children, target, state, {\n        // Toggle all children on if all are inactive and parent is toggled on\n        forceIsViewable:\n          forceIsViewable ||\n          (willUpdateIsViewable &&\n            !!isViewable &&\n            areUnviewable(node.children)),\n        parent: {\n          isViewable: !!isViewable,\n          isVisible: !!isVisible,\n        },\n        toggle,\n      }),\n      value: {\n        ...node.value,\n        isViewable,\n        isVisible,\n      },\n    };\n  });\n}\n\nfunction areUnviewable<T>(nodes: TreeNode<T>[]): boolean {\n  return nodes.every(\n    ({ children, value }) =>\n      !value.isViewable && (!children.length || areUnviewable<T>(children)),\n  );\n}\n\nfunction areSiblingsUnviewable<T>(nodes: TreeNode<T>[], node: TreeNode<T>) {\n  return areUnviewable(nodes.filter((n) => n !== node));\n}\n"]}

package/dist/hooks/use-update-effect/index.d.ts

@@ -1 +1,3 @@
-export { useUpdateEffect } from './use-update-effect.js';
+declare function useUpdateEffect(effect: () => void, deps: any): void;
+
+export { useUpdateEffect };

package/dist/hooks/use-update-effect/index.js

@@ -1,4 +1,23 @@
 import '../../chunk-PZ5AY32C.js';
-export { useUpdateEffect } from './use-update-effect.js';
+import { useEffect, useRef } from 'react';
+
+function useIsFirstMount() {
+  const isFirst = useRef(true);
+  if (isFirst.current) {
+    isFirst.current = false;
+    return true;
+  }
+  return isFirst.current;
+}
+function useUpdateEffect(effect, deps) {
+  const isFirstMount = useIsFirstMount();
+  useEffect(() => {
+    if (!isFirstMount) {
+      return effect();
+    }
+  }, deps);
+}
+
+export { useUpdateEffect };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/hooks/use-update-effect/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"index.js","sourcesContent":[]}
+{"version":3,"sources":["../../../src/hooks/use-update-effect/index.ts"],"names":[],"mappings":";;;AAcA,SAAS,eAA2B,GAAA;AAClC,EAAM,MAAA,OAAA,GAAU,OAAO,IAAI,CAAA;AAE3B,EAAA,IAAI,QAAQ,OAAS,EAAA;AACnB,IAAA,OAAA,CAAQ,OAAU,GAAA,KAAA;AAElB,IAAO,OAAA,IAAA;AAAA;AAGT,EAAA,OAAO,OAAQ,CAAA,OAAA;AACjB;AAEO,SAAS,eAAA,CAAgB,QAAoB,IAAW,EAAA;AAC7D,EAAA,MAAM,eAAe,eAAgB,EAAA;AAErC,EAAA,SAAA,CAAU,MAAM;AACd,IAAA,IAAI,CAAC,YAAc,EAAA;AACjB,MAAA,OAAO,MAAO,EAAA;AAAA;AAChB,KACC,IAAI,CAAA;AACT","file":"index.js","sourcesContent":["/*\n * Copyright 2025 Hypergiant Galactic Systems Inc. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\nimport { useEffect, useRef } from 'react';\n\nfunction useIsFirstMount(): boolean {\n  const isFirst = useRef(true);\n\n  if (isFirst.current) {\n    isFirst.current = false;\n\n    return true;\n  }\n\n  return isFirst.current;\n}\n\nexport function useUpdateEffect(effect: () => void, deps: any) {\n  const isFirstMount = useIsFirstMount();\n\n  useEffect(() => {\n    if (!isFirstMount) {\n      return effect();\n    }\n  }, deps);\n}\n"]}