@accelint/design-toolkit 9.9.1 → 9.10.0

package/dist/components/tree/item-content.js

@@ -48,7 +48,7 @@ import Show from "@accelint/icons/show";
 * @returns The rendered TreeItemContent component.
 */
 function TreeItemContent({ children }) {
-	const { showVisibility, variant, visibleKeys, onVisibilityChange } = useContext(TreeContext);
+	const { showVisibility, variant, visibleKeys, indeterminateKeys, onVisibilityChange } = useContext(TreeContext);
 	const { isVisible, isViewable, ancestors } = useContext(TreeItemContext);
 	const size = variant === "cozy" ? "medium" : "small";
 	return /* @__PURE__ */ jsx(TreeItemContent$1, { children: (renderProps) => {
@@ -103,7 +103,8 @@ function TreeItemContent({ children }) {
 					shouldShowSelection && /* @__PURE__ */ jsx(Checkbox$1, {
 						slot: "selection",
 						isSelected,
-						isDisabled
+						isDisabled,
+						isIndeterminate: indeterminateKeys?.has(id)
 					}),
 					allowsDragging && /* @__PURE__ */ jsx(Button$1, {
 						slot: "drag",

package/dist/components/tree/item-content.js.map

@@ -1 +1 @@
-{"version":3,"file":"item-content.js","names":["AriaTreeItemContent","Button","Checkbox"],"sources":["../../../src/components/tree/item-content.tsx"],"sourcesContent":["/*\n * Copyright 2026 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 { clsx } from '@accelint/design-foundation/lib/utils';\nimport ChevronDown from '@accelint/icons/chevron-down';\nimport ChevronUp from '@accelint/icons/chevron-up';\nimport DragVert from '@accelint/icons/drag-vert';\nimport Hide from '@accelint/icons/hide';\nimport Show from '@accelint/icons/show';\nimport { useContext } from 'react';\nimport { TreeItemContent as AriaTreeItemContent } from 'react-aria-components';\nimport { Button } from '../button';\nimport { Checkbox } from '../checkbox';\nimport { Icon } from '../icon';\nimport { IconProvider } from '../icon/context';\nimport { TreeContext, TreeItemContext } from './context';\nimport { TreeLines } from './lines';\nimport styles from './styles.module.css';\nimport type { Key } from '@react-types/shared';\nimport type { TreeItemContentProps } from './types';\n\n/**\n * TreeItemContent - Renders the display content of a tree node\n *\n * @example\n * ```tsx\n * <TreeItem id=\"node\" textValue=\"Node\">\n *   <TreeItemContent>\n *     <TreeItemPrefixIcon><Folder /></TreeItemPrefixIcon>\n *     <TreeItemLabel>Folder Name</TreeItemLabel>\n *     <TreeItemDescription>Contains 5 items</TreeItemDescription>\n *   </TreeItemContent>\n * </TreeItem>\n * ```\n *\n * @param props - {@link TreeItemContentProps}\n * @param props.children - Content to render, or a render function receiving TreeItemContentRenderProps.\n * @returns The rendered TreeItemContent component.\n */\nexport function TreeItemContent({ children }: TreeItemContentProps) {\n  const { showVisibility, variant, visibleKeys, onVisibilityChange } =\n    useContext(TreeContext);\n  const { isVisible, isViewable, ancestors } = useContext(TreeItemContext);\n  const size = variant === 'cozy' ? 'medium' : 'small';\n\n  return (\n    <AriaTreeItemContent>\n      {(renderProps) => {\n        const {\n          id,\n          allowsDragging,\n          hasChildItems,\n          level,\n          selectionBehavior,\n          selectionMode,\n          state,\n          isDisabled,\n          isExpanded,\n          isSelected,\n        } = renderProps;\n\n        const item = state.collection.getItem(id);\n        const isLastOfSet = !item?.nextKey;\n\n        // Determine if ancestors are last of set (excludes current item)\n        const ancestorLastOfSet = ancestors.slice(0, -1).map((ancestorKey) => {\n          const ancestorItem = state.collection.getItem(ancestorKey);\n          return !ancestorItem?.nextKey;\n        });\n\n        const shouldShowSelection =\n          selectionBehavior === 'toggle' && selectionMode !== 'none';\n\n        const handlePress = () => {\n          const keys = new Set<Key>(visibleKeys);\n          visibleKeys?.has(id) ? keys.delete(id) : keys.add(id);\n          onVisibilityChange?.(keys);\n        };\n\n        return (\n          <IconProvider size={size}>\n            <div\n              className={clsx('group', styles.content, styles[variant])}\n              data-last-of-set={isLastOfSet}\n            >\n              {showVisibility && (\n                <Button\n                  variant='icon'\n                  color='mono-bold'\n                  size={size}\n                  onPress={handlePress}\n                  isDisabled={isDisabled}\n                  className={styles.visibility}\n                >\n                  <Icon>{isVisible ? <Show /> : <Hide />}</Icon>\n                </Button>\n              )}\n              {level > 1 && (\n                <TreeLines\n                  level={level}\n                  isLastOfSet={isLastOfSet}\n                  ancestorLastOfSet={ancestorLastOfSet}\n                />\n              )}\n              {hasChildItems && (\n                <Button\n                  slot='chevron'\n                  variant='icon'\n                  size={size}\n                  className={styles.expansion}\n                >\n                  <Icon>{isExpanded ? <ChevronDown /> : <ChevronUp />}</Icon>\n                </Button>\n              )}\n              <div className={clsx(styles.display, styles[variant])}>\n                {typeof children === 'function'\n                  ? children({\n                      ...renderProps,\n                      variant,\n                      isVisible,\n                      isViewable: isViewable,\n                      defaultChildren: null,\n                    })\n                  : children}\n              </div>\n              {shouldShowSelection && (\n                <Checkbox\n                  slot='selection'\n                  isSelected={isSelected}\n                  isDisabled={isDisabled}\n                />\n              )}\n              {allowsDragging && (\n                <Button\n                  slot='drag'\n                  variant='icon'\n                  size={size}\n                  isDisabled={isDisabled}\n                  className={styles.drag}\n                >\n                  <Icon>\n                    <DragVert />\n                  </Icon>\n                </Button>\n              )}\n            </div>\n          </IconProvider>\n        );\n      }}\n    </AriaTreeItemContent>\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDA,SAAgB,gBAAgB,EAAE,YAAkC;CAClE,MAAM,EAAE,gBAAgB,SAAS,aAAa,uBAC5C,WAAW,YAAY;CACzB,MAAM,EAAE,WAAW,YAAY,cAAc,WAAW,gBAAgB;CACxE,MAAM,OAAO,YAAY,SAAS,WAAW;AAE7C,QACE,oBAACA,gCACG,gBAAgB;EAChB,MAAM,EACJ,IACA,gBACA,eACA,OACA,mBACA,eACA,OACA,YACA,YACA,eACE;EAGJ,MAAM,cAAc,CADP,MAAM,WAAW,QAAQ,GAAG,EACd;EAG3B,MAAM,oBAAoB,UAAU,MAAM,GAAG,GAAG,CAAC,KAAK,gBAAgB;AAEpE,UAAO,CADc,MAAM,WAAW,QAAQ,YAAY,EACpC;IACtB;EAEF,MAAM,sBACJ,sBAAsB,YAAY,kBAAkB;EAEtD,MAAM,oBAAoB;GACxB,MAAM,OAAO,IAAI,IAAS,YAAY;AACtC,gBAAa,IAAI,GAAG,GAAG,KAAK,OAAO,GAAG,GAAG,KAAK,IAAI,GAAG;AACrD,wBAAqB,KAAK;;AAG5B,SACE,oBAAC;GAAmB;aAClB,qBAAC;IACC,WAAW,KAAK,SAAS,OAAO,SAAS,OAAO,SAAS;IACzD,oBAAkB;;KAEjB,kBACC,oBAACC;MACC,SAAQ;MACR,OAAM;MACA;MACN,SAAS;MACG;MACZ,WAAW,OAAO;gBAElB,oBAAC,kBAAM,YAAY,oBAAC,SAAO,GAAG,oBAAC,SAAO,GAAQ;OACvC;KAEV,QAAQ,KACP,oBAAC;MACQ;MACM;MACM;OACnB;KAEH,iBACC,oBAACA;MACC,MAAK;MACL,SAAQ;MACF;MACN,WAAW,OAAO;gBAElB,oBAAC,kBAAM,aAAa,oBAAC,gBAAc,GAAG,oBAAC,cAAY,GAAQ;OACpD;KAEX,oBAAC;MAAI,WAAW,KAAK,OAAO,SAAS,OAAO,SAAS;gBAClD,OAAO,aAAa,aACjB,SAAS;OACP,GAAG;OACH;OACA;OACY;OACZ,iBAAiB;OAClB,CAAC,GACF;OACA;KACL,uBACC,oBAACC;MACC,MAAK;MACO;MACA;OACZ;KAEH,kBACC,oBAACD;MACC,MAAK;MACL,SAAQ;MACF;MACM;MACZ,WAAW,OAAO;gBAElB,oBAAC,kBACC,oBAAC,aAAW,GACP;OACA;;KAEP;IACO;KAGC"}
+{"version":3,"file":"item-content.js","names":["AriaTreeItemContent","Button","Checkbox"],"sources":["../../../src/components/tree/item-content.tsx"],"sourcesContent":["/*\n * Copyright 2026 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 { clsx } from '@accelint/design-foundation/lib/utils';\nimport ChevronDown from '@accelint/icons/chevron-down';\nimport ChevronUp from '@accelint/icons/chevron-up';\nimport DragVert from '@accelint/icons/drag-vert';\nimport Hide from '@accelint/icons/hide';\nimport Show from '@accelint/icons/show';\nimport { useContext } from 'react';\nimport { TreeItemContent as AriaTreeItemContent } from 'react-aria-components';\nimport { Button } from '../button';\nimport { Checkbox } from '../checkbox';\nimport { Icon } from '../icon';\nimport { IconProvider } from '../icon/context';\nimport { TreeContext, TreeItemContext } from './context';\nimport { TreeLines } from './lines';\nimport styles from './styles.module.css';\nimport type { Key } from '@react-types/shared';\nimport type { TreeItemContentProps } from './types';\n\n/**\n * TreeItemContent - Renders the display content of a tree node\n *\n * @example\n * ```tsx\n * <TreeItem id=\"node\" textValue=\"Node\">\n *   <TreeItemContent>\n *     <TreeItemPrefixIcon><Folder /></TreeItemPrefixIcon>\n *     <TreeItemLabel>Folder Name</TreeItemLabel>\n *     <TreeItemDescription>Contains 5 items</TreeItemDescription>\n *   </TreeItemContent>\n * </TreeItem>\n * ```\n *\n * @param props - {@link TreeItemContentProps}\n * @param props.children - Content to render, or a render function receiving TreeItemContentRenderProps.\n * @returns The rendered TreeItemContent component.\n */\nexport function TreeItemContent({ children }: TreeItemContentProps) {\n  const {\n    showVisibility,\n    variant,\n    visibleKeys,\n    indeterminateKeys,\n    onVisibilityChange,\n  } = useContext(TreeContext);\n  const { isVisible, isViewable, ancestors } = useContext(TreeItemContext);\n  const size = variant === 'cozy' ? 'medium' : 'small';\n\n  return (\n    <AriaTreeItemContent>\n      {(renderProps) => {\n        const {\n          id,\n          allowsDragging,\n          hasChildItems,\n          level,\n          selectionBehavior,\n          selectionMode,\n          state,\n          isDisabled,\n          isExpanded,\n          isSelected,\n        } = renderProps;\n\n        const item = state.collection.getItem(id);\n        const isLastOfSet = !item?.nextKey;\n\n        // Determine if ancestors are last of set (excludes current item)\n        const ancestorLastOfSet = ancestors.slice(0, -1).map((ancestorKey) => {\n          const ancestorItem = state.collection.getItem(ancestorKey);\n          return !ancestorItem?.nextKey;\n        });\n\n        const shouldShowSelection =\n          selectionBehavior === 'toggle' && selectionMode !== 'none';\n\n        const handlePress = () => {\n          const keys = new Set<Key>(visibleKeys);\n          visibleKeys?.has(id) ? keys.delete(id) : keys.add(id);\n          onVisibilityChange?.(keys);\n        };\n\n        return (\n          <IconProvider size={size}>\n            <div\n              className={clsx('group', styles.content, styles[variant])}\n              data-last-of-set={isLastOfSet}\n            >\n              {showVisibility && (\n                <Button\n                  variant='icon'\n                  color='mono-bold'\n                  size={size}\n                  onPress={handlePress}\n                  isDisabled={isDisabled}\n                  className={styles.visibility}\n                >\n                  <Icon>{isVisible ? <Show /> : <Hide />}</Icon>\n                </Button>\n              )}\n              {level > 1 && (\n                <TreeLines\n                  level={level}\n                  isLastOfSet={isLastOfSet}\n                  ancestorLastOfSet={ancestorLastOfSet}\n                />\n              )}\n              {hasChildItems && (\n                <Button\n                  slot='chevron'\n                  variant='icon'\n                  size={size}\n                  className={styles.expansion}\n                >\n                  <Icon>{isExpanded ? <ChevronDown /> : <ChevronUp />}</Icon>\n                </Button>\n              )}\n              <div className={clsx(styles.display, styles[variant])}>\n                {typeof children === 'function'\n                  ? children({\n                      ...renderProps,\n                      variant,\n                      isVisible,\n                      isViewable: isViewable,\n                      defaultChildren: null,\n                    })\n                  : children}\n              </div>\n              {shouldShowSelection && (\n                <Checkbox\n                  slot='selection'\n                  isSelected={isSelected}\n                  isDisabled={isDisabled}\n                  isIndeterminate={indeterminateKeys?.has(id)}\n                />\n              )}\n              {allowsDragging && (\n                <Button\n                  slot='drag'\n                  variant='icon'\n                  size={size}\n                  isDisabled={isDisabled}\n                  className={styles.drag}\n                >\n                  <Icon>\n                    <DragVert />\n                  </Icon>\n                </Button>\n              )}\n            </div>\n          </IconProvider>\n        );\n      }}\n    </AriaTreeItemContent>\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDA,SAAgB,gBAAgB,EAAE,YAAkC;CAClE,MAAM,EACJ,gBACA,SACA,aACA,mBACA,uBACE,WAAW,YAAY;CAC3B,MAAM,EAAE,WAAW,YAAY,cAAc,WAAW,gBAAgB;CACxE,MAAM,OAAO,YAAY,SAAS,WAAW;AAE7C,QACE,oBAACA,gCACG,gBAAgB;EAChB,MAAM,EACJ,IACA,gBACA,eACA,OACA,mBACA,eACA,OACA,YACA,YACA,eACE;EAGJ,MAAM,cAAc,CADP,MAAM,WAAW,QAAQ,GAAG,EACd;EAG3B,MAAM,oBAAoB,UAAU,MAAM,GAAG,GAAG,CAAC,KAAK,gBAAgB;AAEpE,UAAO,CADc,MAAM,WAAW,QAAQ,YAAY,EACpC;IACtB;EAEF,MAAM,sBACJ,sBAAsB,YAAY,kBAAkB;EAEtD,MAAM,oBAAoB;GACxB,MAAM,OAAO,IAAI,IAAS,YAAY;AACtC,gBAAa,IAAI,GAAG,GAAG,KAAK,OAAO,GAAG,GAAG,KAAK,IAAI,GAAG;AACrD,wBAAqB,KAAK;;AAG5B,SACE,oBAAC;GAAmB;aAClB,qBAAC;IACC,WAAW,KAAK,SAAS,OAAO,SAAS,OAAO,SAAS;IACzD,oBAAkB;;KAEjB,kBACC,oBAACC;MACC,SAAQ;MACR,OAAM;MACA;MACN,SAAS;MACG;MACZ,WAAW,OAAO;gBAElB,oBAAC,kBAAM,YAAY,oBAAC,SAAO,GAAG,oBAAC,SAAO,GAAQ;OACvC;KAEV,QAAQ,KACP,oBAAC;MACQ;MACM;MACM;OACnB;KAEH,iBACC,oBAACA;MACC,MAAK;MACL,SAAQ;MACF;MACN,WAAW,OAAO;gBAElB,oBAAC,kBAAM,aAAa,oBAAC,gBAAc,GAAG,oBAAC,cAAY,GAAQ;OACpD;KAEX,oBAAC;MAAI,WAAW,KAAK,OAAO,SAAS,OAAO,SAAS;gBAClD,OAAO,aAAa,aACjB,SAAS;OACP,GAAG;OACH;OACA;OACY;OACZ,iBAAiB;OAClB,CAAC,GACF;OACA;KACL,uBACC,oBAACC;MACC,MAAK;MACO;MACA;MACZ,iBAAiB,mBAAmB,IAAI,GAAG;OAC3C;KAEH,kBACC,oBAACD;MACC,MAAK;MACL,SAAQ;MACF;MACM;MACZ,WAAW,OAAO;gBAElB,oBAAC,kBACC,oBAAC,aAAW,GACP;OACA;;KAEP;IACO;KAGC"}

package/dist/components/tree/item-description.d.ts

@@ -11,7 +11,7 @@
  */
 
 import { TextProps } from "react-aria-components";
-import * as react_jsx_runtime200 from "react/jsx-runtime";
+import * as react_jsx_runtime187 from "react/jsx-runtime";
 
 //#region src/components/tree/item-description.d.ts
 /**
@@ -33,7 +33,7 @@ import * as react_jsx_runtime200 from "react/jsx-runtime";
 declare function TreeItemDescription({
   children,
   className
-}: TextProps): react_jsx_runtime200.JSX.Element | null;
+}: TextProps): react_jsx_runtime187.JSX.Element | null;
 //#endregion
 export { TreeItemDescription };
 //# sourceMappingURL=item-description.d.ts.map

package/dist/components/tree/item-label.d.ts

@@ -11,7 +11,7 @@
  */
 
 import { TextProps } from "react-aria-components";
-import * as react_jsx_runtime197 from "react/jsx-runtime";
+import * as react_jsx_runtime188 from "react/jsx-runtime";
 
 //#region src/components/tree/item-label.d.ts
 /**
@@ -33,7 +33,7 @@ import * as react_jsx_runtime197 from "react/jsx-runtime";
 declare function TreeItemLabel({
   children,
   className
-}: TextProps): react_jsx_runtime197.JSX.Element;
+}: TextProps): react_jsx_runtime188.JSX.Element;
 //#endregion
 export { TreeItemLabel };
 //# sourceMappingURL=item-label.d.ts.map

package/dist/components/tree/item-prefix-icon.d.ts

@@ -11,7 +11,7 @@
  */
 
 import { IconProps } from "../icon/types.js";
-import * as react_jsx_runtime195 from "react/jsx-runtime";
+import * as react_jsx_runtime189 from "react/jsx-runtime";
 
 //#region src/components/tree/item-prefix-icon.d.ts
 /**
@@ -33,7 +33,7 @@ import * as react_jsx_runtime195 from "react/jsx-runtime";
 declare function TreeItemPrefixIcon({
   children,
   className
-}: IconProps): react_jsx_runtime195.JSX.Element;
+}: IconProps): react_jsx_runtime189.JSX.Element;
 //#endregion
 export { TreeItemPrefixIcon };
 //# sourceMappingURL=item-prefix-icon.d.ts.map

package/dist/components/tree/item.d.ts

@@ -12,7 +12,7 @@
 
 import { TreeItemProps } from "./types.js";
 import "client-only";
-import * as react_jsx_runtime201 from "react/jsx-runtime";
+import * as react_jsx_runtime190 from "react/jsx-runtime";
 
 //#region src/components/tree/item.d.ts
 
@@ -44,7 +44,7 @@ declare function TreeItem({
   className,
   id,
   ...rest
-}: TreeItemProps): react_jsx_runtime201.JSX.Element;
+}: TreeItemProps): react_jsx_runtime190.JSX.Element;
 //#endregion
 export { TreeItem };
 //# sourceMappingURL=item.d.ts.map

package/dist/components/tree/lines.d.ts

@@ -10,7 +10,7 @@
  * governing permissions and limitations under the License.
  */
 
-import * as react52 from "react";
+import * as react44 from "react";
 
 //#region src/components/tree/lines.d.ts
 /**
@@ -22,7 +22,7 @@ import * as react52 from "react";
  * @param props.ancestorLastOfSet - Array tracking which ancestors are last of set at each level.
  * @returns An array of Line components representing the tree structure.
  */
-declare const TreeLines: react52.NamedExoticComponent<{
+declare const TreeLines: react44.NamedExoticComponent<{
   level: number;
   isLastOfSet: boolean;
   ancestorLastOfSet: boolean[];

package/dist/components/tree/types.d.ts

@@ -63,6 +63,7 @@ type TreeContextValue = Required<Pick<TreeProps<unknown>, 'showRuleLines' | 'sho
   selectedKeys?: Set<Key$1>;
   visibleKeys?: Set<Key$1>;
   visibilityComputedKeys?: Set<Key$1>;
+  indeterminateKeys?: Set<Key$1>;
   isStatic: boolean;
 };
 /**

package/dist/components/video/index.d.ts

@@ -12,7 +12,7 @@
 
 import { VideoProps } from "./types.js";
 import "client-only";
-import * as react_jsx_runtime203 from "react/jsx-runtime";
+import * as react_jsx_runtime193 from "react/jsx-runtime";
 
 //#region src/components/video/index.d.ts
 
@@ -91,7 +91,7 @@ declare function Video({
   noMutedPref,
   lang,
   ...rest
-}: VideoProps): react_jsx_runtime203.JSX.Element;
+}: VideoProps): react_jsx_runtime193.JSX.Element;
 //#endregion
 export { Video };
 //# sourceMappingURL=index.d.ts.map

package/dist/components/view-stack/context.d.ts

@@ -12,12 +12,12 @@
 
 import { ViewStackContextValue } from "./types.js";
 import "client-only";
-import * as react44 from "react";
+import * as react47 from "react";
 import { UniqueId } from "@accelint/core";
 
 //#region src/components/view-stack/context.d.ts
 /** Context for sharing state across ViewStack components */
-declare const ViewStackContext: react44.Context<ViewStackContextValue>;
+declare const ViewStackContext: react47.Context<ViewStackContextValue>;
 /** Event handlers for ViewStack events */
 declare const ViewStackEventHandlers: {
   readonly back: (stack: UniqueId) => void;

package/dist/components/view-stack/index.d.ts

@@ -12,7 +12,7 @@
 
 import { ViewStackProps } from "./types.js";
 import "client-only";
-import * as react_jsx_runtime186 from "react/jsx-runtime";
+import * as react_jsx_runtime232 from "react/jsx-runtime";
 
 //#region src/components/view-stack/index.d.ts
 
@@ -47,7 +47,7 @@ declare function ViewStack({
   children,
   defaultView,
   onChange
-}: ViewStackProps): react_jsx_runtime186.JSX.Element;
+}: ViewStackProps): react_jsx_runtime232.JSX.Element;
 //#endregion
 export { ViewStack };
 //# sourceMappingURL=index.d.ts.map

package/dist/components/view-stack/trigger.d.ts

@@ -12,7 +12,7 @@
 
 import { ViewStackTriggerProps } from "./types.js";
 import "client-only";
-import * as react_jsx_runtime187 from "react/jsx-runtime";
+import * as react_jsx_runtime234 from "react/jsx-runtime";
 
 //#region src/components/view-stack/trigger.d.ts
 
@@ -45,7 +45,7 @@ import * as react_jsx_runtime187 from "react/jsx-runtime";
 declare function ViewStackTrigger({
   children,
   for: types
-}: ViewStackTriggerProps): react_jsx_runtime187.JSX.Element;
+}: ViewStackTriggerProps): react_jsx_runtime234.JSX.Element;
 //#endregion
 export { ViewStackTrigger };
 //# sourceMappingURL=trigger.d.ts.map

package/dist/components/view-stack/view.d.ts

@@ -12,7 +12,7 @@
 
 import { ViewStackViewProps } from "./types.js";
 import "client-only";
-import * as react_jsx_runtime188 from "react/jsx-runtime";
+import * as react_jsx_runtime191 from "react/jsx-runtime";
 
 //#region src/components/view-stack/view.d.ts
 
@@ -43,7 +43,7 @@ import * as react_jsx_runtime188 from "react/jsx-runtime";
 declare function ViewStackView({
   id,
   children
-}: ViewStackViewProps): react_jsx_runtime188.JSX.Element | null;
+}: ViewStackViewProps): react_jsx_runtime191.JSX.Element | null;
 //#endregion
 export { ViewStackView };
 //# sourceMappingURL=view.d.ts.map

package/dist/hooks/use-tree/actions/cache.d.ts

@@ -71,12 +71,13 @@ declare class Cache<T> {
   toTree(deriveVisible?: boolean): TreeNode<T>[];
   /**
    * CACHE FUNCTIONS
-   * These manage cache operations. No cache operations should ever be done
-   * outside this file.
+   * These are the public functions to manage cache operations. No cache operations should ever be done
+   * outside this file since it risks corruption of the data.
    **/
   getNode(key: Key): TreeNode<T>;
   getAllKeys(): MapIterator<Key>;
   getAllNodes(): MapIterator<CacheTreeNode<T>>;
+  getParentForPosition(target: Key | null, position: 'before' | 'after'): Key | null;
   setNode(key: Key, node: TreeNode<T>): void;
   setAllNodes({
     parentKey,
@@ -88,7 +89,23 @@ declare class Cache<T> {
   insertNode(parentKey: Key | null, node: TreeNode<T>, idx: number): void;
   moveNodes(target: Key | null, nodes: Set<Key>, position: 'before' | 'after'): void;
   moveNode(parentKey: Key | null, key: Key, idx: number): void;
+  /**
+   * Cascade selection down through descendants
+   */
+  cascadeSelection(key: Key, selected: boolean): void;
+  /**
+   * Bubble up selection state through ancestors
+   */
+  bubbleUpSelection(key: Key): void;
+  /**
+   * Compute selection state for a node based on its children
+   */
+  private computeSelectionState;
+  /**
+   * Sync cascade state for parents after a move operation
+   */
+  syncParentsAfterMove(oldParents: Set<Key>, newParent: Key | null): void;
 }
 //#endregion
-export { Cache };
+export { Cache, CacheTreeNode };
 //# sourceMappingURL=cache.d.ts.map

package/dist/hooks/use-tree/actions/cache.js

@@ -41,6 +41,7 @@ var Cache = class {
 				isSelected: false,
 				isVisible: false,
 				isVisibleComputed: false,
+				isIndeterminate: false,
 				...rest,
 				parentKey,
 				...children ? { children: children.map((child) => child.key) } : {}
@@ -56,6 +57,7 @@ var Cache = class {
 		return cache;
 	}
 	get(key) {
+		if (key == null) throw new Error(`Key is ${key} (null/undefined) - this is invalid`);
 		const node = this.cache.lookup.get(key);
 		if (node === void 0) throw new Error(`Key of ${key} does not exist in tree`);
 		return node;
@@ -183,8 +185,8 @@ var Cache = class {
 	}
 	/**
 	* CACHE FUNCTIONS
-	* These manage cache operations. No cache operations should ever be done
-	* outside this file.
+	* These are the public functions to manage cache operations. No cache operations should ever be done
+	* outside this file since it risks corruption of the data.
 	**/
 	getNode(key) {
 		const node = this.get(key);
@@ -199,6 +201,10 @@ var Cache = class {
 	getAllNodes() {
 		return this.cache.lookup.values();
 	}
+	getParentForPosition(target, position) {
+		const { parentKey } = this.parentOrSibling(target, position);
+		return parentKey;
+	}
 	setNode(key, node) {
 		this.set(key, {
 			...node,
@@ -231,6 +237,7 @@ var Cache = class {
 			isSelected: false,
 			isVisible: false,
 			isVisibleComputed: false,
+			isIndeterminate: false,
 			...rest,
 			parentKey,
 			...children ? { children: children.map((child) => child.key) } : {}
@@ -248,6 +255,107 @@ var Cache = class {
 		node.parentKey ? this.removeFromParent(node.parentKey, key) : this.removeFromRoot(key);
 		parentKey ? this.addToParent(parentKey, key, idx) : this.addToRoot(key, idx);
 	}
+	/**
+	* Cascade selection down through descendants
+	*/
+	cascadeSelection(key, selected) {
+		try {
+			const node = this.get(key);
+			if (!node.isDisabled) this.set(key, {
+				...node,
+				isSelected: selected,
+				isIndeterminate: false
+			});
+			if (node.children) {
+				for (const childKey of node.children) if (childKey != null) this.cascadeSelection(childKey, selected);
+			}
+		} catch {
+			return;
+		}
+	}
+	/**
+	* Bubble up selection state through ancestors
+	*/
+	bubbleUpSelection(key) {
+		try {
+			let current = this.get(key);
+			while (current.parentKey) {
+				const parent = this.get(current.parentKey);
+				const newState = this.computeSelectionState(parent);
+				if (parent.isSelected === newState.isSelected && parent.isIndeterminate === newState.isIndeterminate) break;
+				this.set(parent.key, {
+					...parent,
+					isSelected: newState.isSelected,
+					isIndeterminate: newState.isIndeterminate
+				});
+				current = parent;
+			}
+		} catch {
+			return;
+		}
+	}
+	/**
+	* Compute selection state for a node based on its children
+	*/
+	computeSelectionState(node) {
+		if (!node.children || node.children.length === 0) return {
+			isSelected: node.isSelected ?? false,
+			isIndeterminate: false
+		};
+		const selectableChildren = node.children.filter((k) => {
+			try {
+				return !this.get(k).isDisabled;
+			} catch {
+				return false;
+			}
+		}).map((k) => this.get(k));
+		if (selectableChildren.length === 0) return {
+			isSelected: node.isSelected ?? false,
+			isIndeterminate: false
+		};
+		const selectedCount = selectableChildren.filter((c) => c.isSelected).length;
+		if (selectableChildren.filter((c) => c.isIndeterminate).length > 0) return {
+			isSelected: false,
+			isIndeterminate: true
+		};
+		if (selectedCount === selectableChildren.length) return {
+			isSelected: true,
+			isIndeterminate: false
+		};
+		if (selectedCount === 0) return {
+			isSelected: false,
+			isIndeterminate: false
+		};
+		return {
+			isSelected: false,
+			isIndeterminate: true
+		};
+	}
+	/**
+	* Sync cascade state for parents after a move operation
+	*/
+	syncParentsAfterMove(oldParents, newParent) {
+		for (const parentKey of oldParents) try {
+			const parent = this.get(parentKey);
+			const newState = this.computeSelectionState(parent);
+			this.set(parentKey, {
+				...parent,
+				isSelected: newState.isSelected,
+				isIndeterminate: newState.isIndeterminate
+			});
+			if (parent.parentKey) this.bubbleUpSelection(parentKey);
+		} catch {}
+		if (newParent) try {
+			const parent = this.get(newParent);
+			const newState = this.computeSelectionState(parent);
+			this.set(newParent, {
+				...parent,
+				isSelected: newState.isSelected,
+				isIndeterminate: newState.isIndeterminate
+			});
+			if (parent.parentKey) this.bubbleUpSelection(newParent);
+		} catch {}
+	}
 };
 
 //#endregion

package/dist/hooks/use-tree/actions/cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"cache.js","names":["index: number","parentKey: Key | null","key"],"sources":["../../../../src/hooks/use-tree/actions/cache.ts"],"sourcesContent":["// __private-exports\n/*\n * Copyright 2026 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 } from '../types';\n\ntype CacheTreeNode<T> = Omit<TreeNode<T>, 'children'> & {\n  children?: Key[];\n};\n\n/**\n * This is a cache created only for performance reasons and is considered\n * to be only a temporary mirror of the data. The data is *always* correct\n * cache should be updated according to the data, only. If the data and\n * the cache do not match, the cache is invalidated and rebuilt.\n *\n * This will initialize once on load with data, then\n * updated with each tree operation.\n */\nexport class Cache<T> {\n  protected cache: { lookup: Map<Key, CacheTreeNode<T>>; roots: Key[] } = {\n    lookup: new Map(),\n    roots: [],\n  };\n\n  constructor(nodes: TreeNode<T>[] = []) {\n    this.rebuild(nodes);\n  }\n\n  /**\n   * Recursively creates the cache object from tree data\n   */\n  rebuild(\n    nodes: TreeNode<T>[],\n    lookup: Map<Key, CacheTreeNode<T>> = new Map(),\n    parentKey: Key | null = null,\n  ) {\n    nodes.forEach((node) => {\n      const { children, ...rest } = node;\n\n      lookup.set(node.key, {\n        isDisabled: false,\n        isExpanded: false,\n        isSelected: false,\n        isVisible: false,\n        isVisibleComputed: false,\n        ...rest,\n        parentKey,\n        ...(children ? { children: children.map((child) => child.key) } : {}),\n      });\n\n      if (node.children) {\n        this.rebuild(node.children, lookup, node.key);\n      }\n    });\n\n    const cache = { lookup, roots: nodes.map((node) => node.key) };\n\n    if (!parentKey) {\n      this.cache = cache;\n    }\n\n    this.deriveVisibility();\n    return cache;\n  }\n\n  protected get(key: Key) {\n    const node = this.cache.lookup.get(key);\n\n    if (node === undefined) {\n      throw new Error(`Key of ${key} does not exist in tree`);\n    }\n\n    return node;\n  }\n\n  protected set(key: Key, node: CacheTreeNode<T>) {\n    this.cache.lookup.set(key, node);\n  }\n\n  protected delete(key: Key) {\n    this.cache.lookup.delete(key);\n  }\n\n  protected addToParent(parentKey: Key, childKey: Key, idx: number) {\n    const parent = this.get(parentKey);\n    const child = this.get(childKey);\n    const index = Math.max(0, idx);\n\n    this.set(childKey, {\n      ...child,\n      parentKey,\n    });\n\n    const children = (parent.children ?? []).slice(0);\n\n    children.splice(index, 0, childKey);\n\n    this.set(parentKey, {\n      ...parent,\n      children,\n    });\n  }\n\n  protected addToRoot(key: Key, idx: number) {\n    const node = this.get(key);\n    const index = Math.max(0, idx);\n\n    this.set(key, {\n      ...node,\n      parentKey: null,\n    });\n\n    this.cache.roots.splice(index, 0, key);\n  }\n\n  protected removeFromParent(parentKey: Key, childKey: Key) {\n    const parent = this.get(parentKey);\n    const child = this.get(childKey);\n\n    this.set(childKey, {\n      ...child,\n      parentKey: null,\n    });\n\n    this.cache.lookup.set(parentKey, {\n      ...parent,\n      children: parent.children?.filter((key) => key !== childKey),\n    });\n  }\n\n  protected removeFromRoot(key: Key) {\n    const node = this.get(key);\n    const idx = this.cache.roots.indexOf(key);\n\n    if (idx >= 0) {\n      this.set(key, {\n        ...node,\n        parentKey: null,\n      });\n\n      this.cache.roots.splice(idx, 1);\n    }\n  }\n\n  protected parentOrSibling(target: Key | null, position: 'before' | 'after') {\n    let index: number;\n    let parentKey: Key | null = null;\n\n    if (target === null) {\n      index = position === 'before' ? 0 : this.cache.roots.length;\n    } else {\n      const targetNode = this.get(target);\n\n      if (targetNode.parentKey) {\n        const parent = this.get(targetNode.parentKey);\n\n        parentKey = parent.key;\n        index = parent.children?.indexOf(target) ?? 0;\n      } else {\n        index = this.cache.roots.indexOf(target);\n      }\n    }\n\n    return { parentKey, index };\n  }\n\n  protected traverse(key: Key) {\n    const node = this.get(key);\n\n    this.cache.lookup.set(key, {\n      ...node,\n      isVisibleComputed: this.calculateVisibility(key),\n    });\n\n    node.children?.map((child) => this.traverse(child));\n  }\n\n  protected calculateVisibility(key: Key) {\n    let current = this.get(key);\n    const ancestry = [current];\n\n    while (current.parentKey) {\n      const parent = this.get(current.parentKey);\n      if (parent) {\n        ancestry.push(parent);\n      }\n      current = parent;\n    }\n\n    return ancestry.every((n) => n.isVisible);\n  }\n\n  protected deriveVisibility() {\n    return this.cache.roots.map((key) => this.traverse(key));\n  }\n  /**\n   * Recursively builds a TreeNode from a key\n   *\n   * @param key\n   */\n  protected buildNode(key: Key): TreeNode<T> {\n    const node = this.get(key);\n\n    const children = (node.children ?? []).reduce(\n      (acc: TreeNode<T>[], child) => {\n        const childNode = this.cache.lookup.get(child);\n\n        if (childNode && childNode.parentKey === key) {\n          acc.push(this.buildNode(child));\n        }\n\n        return acc;\n      },\n      [],\n    );\n\n    return {\n      ...node,\n      children,\n    };\n  }\n\n  /**\n   * Builds a tree structure from cache\n   *\n   * TODO: optimization - rebuild only from change to root\n   * Rebuild only from the changed node up the tree to avoid\n   * rebuilding the entire tree\n   *\n   * @param deriveVisible boolean - if true, will recompute visibility for nodes based on ancestry\n   */\n  toTree(deriveVisible?: boolean): TreeNode<T>[] {\n    if (deriveVisible) {\n      this.deriveVisibility();\n    }\n    return this.cache.roots.map((key) => this.buildNode(key));\n  }\n\n  /**\n   * CACHE FUNCTIONS\n   * These manage cache operations. No cache operations should ever be done\n   * outside this file.\n   **/\n  getNode(key: Key): TreeNode<T> {\n    const node = this.get(key);\n\n    return {\n      ...node,\n      children: node.children?.map((key) => this.buildNode(key)),\n    };\n  }\n\n  getAllKeys() {\n    return this.cache.lookup.keys();\n  }\n\n  getAllNodes() {\n    return this.cache.lookup.values();\n  }\n\n  setNode(key: Key, node: TreeNode<T>) {\n    this.set(key, {\n      ...node,\n      children: (node.children ?? []).map((child) => child.key),\n    });\n  }\n\n  setAllNodes({ parentKey, children, ...rest }: Partial<TreeNode<T>>) {\n    for (const node of this.cache.lookup.values()) {\n      this.set(node.key, {\n        ...node,\n        ...rest,\n      });\n    }\n  }\n\n  deleteNode(key: Key) {\n    const node = this.cache.lookup.get(key);\n\n    if (!node) {\n      return;\n    }\n\n    // remove children\n    node.children?.map((key) => this.deleteNode(key));\n\n    // remove node from previous parent or root\n    node.parentKey\n      ? this.removeFromParent(node.parentKey, key)\n      : this.removeFromRoot(key);\n\n    // remove the actual node\n    this.delete(key);\n  }\n\n  addNodes(\n    target: Key | null,\n    nodes: TreeNode<T>[],\n    position: 'before' | 'after',\n  ) {\n    const { parentKey, index } = this.parentOrSibling(target, position);\n    const idx = index + (position === 'before' ? 0 : 1);\n\n    nodes.map((node, i) => this.insertNode(parentKey, node, idx + i));\n  }\n\n  insertNode(parentKey: Key | null, node: TreeNode<T>, idx: number) {\n    const { children, ...rest } = node;\n\n    this.set(node.key, {\n      isDisabled: false,\n      isExpanded: false,\n      isSelected: false,\n      isVisible: false,\n      isVisibleComputed: false,\n      ...rest,\n      parentKey,\n      ...(children ? { children: children.map((child) => child.key) } : {}),\n    });\n\n    node.children?.map((child, i) => this.insertNode(node.key, child, i));\n\n    parentKey === null\n      ? this.addToRoot(node.key, idx)\n      : this.addToParent(parentKey, node.key, idx);\n  }\n\n  moveNodes(target: Key | null, nodes: Set<Key>, position: 'before' | 'after') {\n    const { parentKey, index } = this.parentOrSibling(target, position);\n    const idx = index + (position === 'before' ? 0 : 1);\n\n    Array.from(nodes).map((key, i) => this.moveNode(parentKey, key, idx + i));\n  }\n\n  moveNode(parentKey: Key | null, key: Key, idx: number) {\n    const node = this.get(key);\n\n    // remove from previous parent\n    node.parentKey\n      ? this.removeFromParent(node.parentKey, key)\n      : this.removeFromRoot(key);\n\n    // add as child to new parent or root at position\n    parentKey\n      ? this.addToParent(parentKey, key, idx)\n      : this.addToRoot(key, idx);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AA6BA,IAAa,QAAb,MAAsB;CACpB,AAAU,QAA8D;EACtE,wBAAQ,IAAI,KAAK;EACjB,OAAO,EAAE;EACV;CAED,YAAY,QAAuB,EAAE,EAAE;AACrC,OAAK,QAAQ,MAAM;;;;;CAMrB,QACE,OACA,yBAAqC,IAAI,KAAK,EAC9C,YAAwB,MACxB;AACA,QAAM,SAAS,SAAS;GACtB,MAAM,EAAE,UAAU,GAAG,SAAS;AAE9B,UAAO,IAAI,KAAK,KAAK;IACnB,YAAY;IACZ,YAAY;IACZ,YAAY;IACZ,WAAW;IACX,mBAAmB;IACnB,GAAG;IACH;IACA,GAAI,WAAW,EAAE,UAAU,SAAS,KAAK,UAAU,MAAM,IAAI,EAAE,GAAG,EAAE;IACrE,CAAC;AAEF,OAAI,KAAK,SACP,MAAK,QAAQ,KAAK,UAAU,QAAQ,KAAK,IAAI;IAE/C;EAEF,MAAM,QAAQ;GAAE;GAAQ,OAAO,MAAM,KAAK,SAAS,KAAK,IAAI;GAAE;AAE9D,MAAI,CAAC,UACH,MAAK,QAAQ;AAGf,OAAK,kBAAkB;AACvB,SAAO;;CAGT,AAAU,IAAI,KAAU;EACtB,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;AAEvC,MAAI,SAAS,OACX,OAAM,IAAI,MAAM,UAAU,IAAI,yBAAyB;AAGzD,SAAO;;CAGT,AAAU,IAAI,KAAU,MAAwB;AAC9C,OAAK,MAAM,OAAO,IAAI,KAAK,KAAK;;CAGlC,AAAU,OAAO,KAAU;AACzB,OAAK,MAAM,OAAO,OAAO,IAAI;;CAG/B,AAAU,YAAY,WAAgB,UAAe,KAAa;EAChE,MAAM,SAAS,KAAK,IAAI,UAAU;EAClC,MAAM,QAAQ,KAAK,IAAI,SAAS;EAChC,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAE9B,OAAK,IAAI,UAAU;GACjB,GAAG;GACH;GACD,CAAC;EAEF,MAAM,YAAY,OAAO,YAAY,EAAE,EAAE,MAAM,EAAE;AAEjD,WAAS,OAAO,OAAO,GAAG,SAAS;AAEnC,OAAK,IAAI,WAAW;GAClB,GAAG;GACH;GACD,CAAC;;CAGJ,AAAU,UAAU,KAAU,KAAa;EACzC,MAAM,OAAO,KAAK,IAAI,IAAI;EAC1B,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAE9B,OAAK,IAAI,KAAK;GACZ,GAAG;GACH,WAAW;GACZ,CAAC;AAEF,OAAK,MAAM,MAAM,OAAO,OAAO,GAAG,IAAI;;CAGxC,AAAU,iBAAiB,WAAgB,UAAe;EACxD,MAAM,SAAS,KAAK,IAAI,UAAU;EAClC,MAAM,QAAQ,KAAK,IAAI,SAAS;AAEhC,OAAK,IAAI,UAAU;GACjB,GAAG;GACH,WAAW;GACZ,CAAC;AAEF,OAAK,MAAM,OAAO,IAAI,WAAW;GAC/B,GAAG;GACH,UAAU,OAAO,UAAU,QAAQ,QAAQ,QAAQ,SAAS;GAC7D,CAAC;;CAGJ,AAAU,eAAe,KAAU;EACjC,MAAM,OAAO,KAAK,IAAI,IAAI;EAC1B,MAAM,MAAM,KAAK,MAAM,MAAM,QAAQ,IAAI;AAEzC,MAAI,OAAO,GAAG;AACZ,QAAK,IAAI,KAAK;IACZ,GAAG;IACH,WAAW;IACZ,CAAC;AAEF,QAAK,MAAM,MAAM,OAAO,KAAK,EAAE;;;CAInC,AAAU,gBAAgB,QAAoB,UAA8B;EAC1E,IAAIA;EACJ,IAAIC,YAAwB;AAE5B,MAAI,WAAW,KACb,SAAQ,aAAa,WAAW,IAAI,KAAK,MAAM,MAAM;OAChD;GACL,MAAM,aAAa,KAAK,IAAI,OAAO;AAEnC,OAAI,WAAW,WAAW;IACxB,MAAM,SAAS,KAAK,IAAI,WAAW,UAAU;AAE7C,gBAAY,OAAO;AACnB,YAAQ,OAAO,UAAU,QAAQ,OAAO,IAAI;SAE5C,SAAQ,KAAK,MAAM,MAAM,QAAQ,OAAO;;AAI5C,SAAO;GAAE;GAAW;GAAO;;CAG7B,AAAU,SAAS,KAAU;EAC3B,MAAM,OAAO,KAAK,IAAI,IAAI;AAE1B,OAAK,MAAM,OAAO,IAAI,KAAK;GACzB,GAAG;GACH,mBAAmB,KAAK,oBAAoB,IAAI;GACjD,CAAC;AAEF,OAAK,UAAU,KAAK,UAAU,KAAK,SAAS,MAAM,CAAC;;CAGrD,AAAU,oBAAoB,KAAU;EACtC,IAAI,UAAU,KAAK,IAAI,IAAI;EAC3B,MAAM,WAAW,CAAC,QAAQ;AAE1B,SAAO,QAAQ,WAAW;GACxB,MAAM,SAAS,KAAK,IAAI,QAAQ,UAAU;AAC1C,OAAI,OACF,UAAS,KAAK,OAAO;AAEvB,aAAU;;AAGZ,SAAO,SAAS,OAAO,MAAM,EAAE,UAAU;;CAG3C,AAAU,mBAAmB;AAC3B,SAAO,KAAK,MAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,IAAI,CAAC;;;;;;;CAO1D,AAAU,UAAU,KAAuB;EACzC,MAAM,OAAO,KAAK,IAAI,IAAI;EAE1B,MAAM,YAAY,KAAK,YAAY,EAAE,EAAE,QACpC,KAAoB,UAAU;GAC7B,MAAM,YAAY,KAAK,MAAM,OAAO,IAAI,MAAM;AAE9C,OAAI,aAAa,UAAU,cAAc,IACvC,KAAI,KAAK,KAAK,UAAU,MAAM,CAAC;AAGjC,UAAO;KAET,EAAE,CACH;AAED,SAAO;GACL,GAAG;GACH;GACD;;;;;;;;;;;CAYH,OAAO,eAAwC;AAC7C,MAAI,cACF,MAAK,kBAAkB;AAEzB,SAAO,KAAK,MAAM,MAAM,KAAK,QAAQ,KAAK,UAAU,IAAI,CAAC;;;;;;;CAQ3D,QAAQ,KAAuB;EAC7B,MAAM,OAAO,KAAK,IAAI,IAAI;AAE1B,SAAO;GACL,GAAG;GACH,UAAU,KAAK,UAAU,KAAK,UAAQ,KAAK,UAAUC,MAAI,CAAC;GAC3D;;CAGH,aAAa;AACX,SAAO,KAAK,MAAM,OAAO,MAAM;;CAGjC,cAAc;AACZ,SAAO,KAAK,MAAM,OAAO,QAAQ;;CAGnC,QAAQ,KAAU,MAAmB;AACnC,OAAK,IAAI,KAAK;GACZ,GAAG;GACH,WAAW,KAAK,YAAY,EAAE,EAAE,KAAK,UAAU,MAAM,IAAI;GAC1D,CAAC;;CAGJ,YAAY,EAAE,WAAW,UAAU,GAAG,QAA8B;AAClE,OAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,QAAQ,CAC3C,MAAK,IAAI,KAAK,KAAK;GACjB,GAAG;GACH,GAAG;GACJ,CAAC;;CAIN,WAAW,KAAU;EACnB,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;AAEvC,MAAI,CAAC,KACH;AAIF,OAAK,UAAU,KAAK,UAAQ,KAAK,WAAWA,MAAI,CAAC;AAGjD,OAAK,YACD,KAAK,iBAAiB,KAAK,WAAW,IAAI,GAC1C,KAAK,eAAe,IAAI;AAG5B,OAAK,OAAO,IAAI;;CAGlB,SACE,QACA,OACA,UACA;EACA,MAAM,EAAE,WAAW,UAAU,KAAK,gBAAgB,QAAQ,SAAS;EACnE,MAAM,MAAM,SAAS,aAAa,WAAW,IAAI;AAEjD,QAAM,KAAK,MAAM,MAAM,KAAK,WAAW,WAAW,MAAM,MAAM,EAAE,CAAC;;CAGnE,WAAW,WAAuB,MAAmB,KAAa;EAChE,MAAM,EAAE,UAAU,GAAG,SAAS;AAE9B,OAAK,IAAI,KAAK,KAAK;GACjB,YAAY;GACZ,YAAY;GACZ,YAAY;GACZ,WAAW;GACX,mBAAmB;GACnB,GAAG;GACH;GACA,GAAI,WAAW,EAAE,UAAU,SAAS,KAAK,UAAU,MAAM,IAAI,EAAE,GAAG,EAAE;GACrE,CAAC;AAEF,OAAK,UAAU,KAAK,OAAO,MAAM,KAAK,WAAW,KAAK,KAAK,OAAO,EAAE,CAAC;AAErE,gBAAc,OACV,KAAK,UAAU,KAAK,KAAK,IAAI,GAC7B,KAAK,YAAY,WAAW,KAAK,KAAK,IAAI;;CAGhD,UAAU,QAAoB,OAAiB,UAA8B;EAC3E,MAAM,EAAE,WAAW,UAAU,KAAK,gBAAgB,QAAQ,SAAS;EACnE,MAAM,MAAM,SAAS,aAAa,WAAW,IAAI;AAEjD,QAAM,KAAK,MAAM,CAAC,KAAK,KAAK,MAAM,KAAK,SAAS,WAAW,KAAK,MAAM,EAAE,CAAC;;CAG3E,SAAS,WAAuB,KAAU,KAAa;EACrD,MAAM,OAAO,KAAK,IAAI,IAAI;AAG1B,OAAK,YACD,KAAK,iBAAiB,KAAK,WAAW,IAAI,GAC1C,KAAK,eAAe,IAAI;AAG5B,cACI,KAAK,YAAY,WAAW,KAAK,IAAI,GACrC,KAAK,UAAU,KAAK,IAAI"}
+{"version":3,"file":"cache.js","names":["index: number","parentKey: Key | null","key"],"sources":["../../../../src/hooks/use-tree/actions/cache.ts"],"sourcesContent":["// __private-exports\n/*\n * Copyright 2026 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 } from '../types';\n\nexport type CacheTreeNode<T> = Omit<TreeNode<T>, 'children'> & {\n  children?: Key[];\n};\n\n/**\n * This is a cache created only for performance reasons and is considered\n * to be only a temporary mirror of the data. The data is *always* correct\n * cache should be updated according to the data, only. If the data and\n * the cache do not match, the cache is invalidated and rebuilt.\n *\n * This will initialize once on load with data, then\n * updated with each tree operation.\n */\nexport class Cache<T> {\n  protected cache: { lookup: Map<Key, CacheTreeNode<T>>; roots: Key[] } = {\n    lookup: new Map(),\n    roots: [],\n  };\n\n  constructor(nodes: TreeNode<T>[] = []) {\n    this.rebuild(nodes);\n  }\n\n  /**\n   * Recursively creates the cache object from tree data\n   */\n  rebuild(\n    nodes: TreeNode<T>[],\n    lookup: Map<Key, CacheTreeNode<T>> = new Map(),\n    parentKey: Key | null = null,\n  ) {\n    nodes.forEach((node) => {\n      const { children, ...rest } = node;\n\n      lookup.set(node.key, {\n        isDisabled: false,\n        isExpanded: false,\n        isSelected: false,\n        isVisible: false,\n        isVisibleComputed: false,\n        isIndeterminate: false,\n        ...rest,\n        parentKey,\n        ...(children ? { children: children.map((child) => child.key) } : {}),\n      });\n\n      if (node.children) {\n        this.rebuild(node.children, lookup, node.key);\n      }\n    });\n\n    const cache = { lookup, roots: nodes.map((node) => node.key) };\n\n    if (!parentKey) {\n      this.cache = cache;\n    }\n\n    this.deriveVisibility();\n    return cache;\n  }\n\n  protected get(key: Key) {\n    if (key == null) {\n      throw new Error(`Key is ${key} (null/undefined) - this is invalid`);\n    }\n\n    const node = this.cache.lookup.get(key);\n\n    if (node === undefined) {\n      throw new Error(`Key of ${key} does not exist in tree`);\n    }\n\n    return node;\n  }\n\n  protected set(key: Key, node: CacheTreeNode<T>) {\n    this.cache.lookup.set(key, node);\n  }\n\n  protected delete(key: Key) {\n    this.cache.lookup.delete(key);\n  }\n\n  protected addToParent(parentKey: Key, childKey: Key, idx: number) {\n    const parent = this.get(parentKey);\n    const child = this.get(childKey);\n    const index = Math.max(0, idx);\n\n    this.set(childKey, {\n      ...child,\n      parentKey,\n    });\n\n    const children = (parent.children ?? []).slice(0);\n\n    children.splice(index, 0, childKey);\n\n    this.set(parentKey, {\n      ...parent,\n      children,\n    });\n  }\n\n  protected addToRoot(key: Key, idx: number) {\n    const node = this.get(key);\n    const index = Math.max(0, idx);\n\n    this.set(key, {\n      ...node,\n      parentKey: null,\n    });\n\n    this.cache.roots.splice(index, 0, key);\n  }\n\n  protected removeFromParent(parentKey: Key, childKey: Key) {\n    const parent = this.get(parentKey);\n    const child = this.get(childKey);\n\n    this.set(childKey, {\n      ...child,\n      parentKey: null,\n    });\n\n    this.cache.lookup.set(parentKey, {\n      ...parent,\n      children: parent.children?.filter((key) => key !== childKey),\n    });\n  }\n\n  protected removeFromRoot(key: Key) {\n    const node = this.get(key);\n    const idx = this.cache.roots.indexOf(key);\n\n    if (idx >= 0) {\n      this.set(key, {\n        ...node,\n        parentKey: null,\n      });\n\n      this.cache.roots.splice(idx, 1);\n    }\n  }\n\n  protected parentOrSibling(target: Key | null, position: 'before' | 'after') {\n    let index: number;\n    let parentKey: Key | null = null;\n\n    if (target === null) {\n      index = position === 'before' ? 0 : this.cache.roots.length;\n    } else {\n      const targetNode = this.get(target);\n\n      if (targetNode.parentKey) {\n        const parent = this.get(targetNode.parentKey);\n\n        parentKey = parent.key;\n        index = parent.children?.indexOf(target) ?? 0;\n      } else {\n        index = this.cache.roots.indexOf(target);\n      }\n    }\n\n    return { parentKey, index };\n  }\n\n  protected traverse(key: Key) {\n    const node = this.get(key);\n\n    this.cache.lookup.set(key, {\n      ...node,\n      isVisibleComputed: this.calculateVisibility(key),\n    });\n\n    node.children?.map((child) => this.traverse(child));\n  }\n\n  protected calculateVisibility(key: Key) {\n    let current = this.get(key);\n    const ancestry = [current];\n\n    while (current.parentKey) {\n      const parent = this.get(current.parentKey);\n      if (parent) {\n        ancestry.push(parent);\n      }\n      current = parent;\n    }\n\n    return ancestry.every((n) => n.isVisible);\n  }\n\n  protected deriveVisibility() {\n    return this.cache.roots.map((key) => this.traverse(key));\n  }\n  /**\n   * Recursively builds a TreeNode from a key\n   *\n   * @param key\n   */\n  protected buildNode(key: Key): TreeNode<T> {\n    const node = this.get(key);\n\n    const children = (node.children ?? []).reduce(\n      (acc: TreeNode<T>[], child) => {\n        const childNode = this.cache.lookup.get(child);\n\n        if (childNode && childNode.parentKey === key) {\n          acc.push(this.buildNode(child));\n        }\n\n        return acc;\n      },\n      [],\n    );\n\n    return {\n      ...node,\n      children,\n    };\n  }\n\n  /**\n   * Builds a tree structure from cache\n   *\n   * TODO: optimization - rebuild only from change to root\n   * Rebuild only from the changed node up the tree to avoid\n   * rebuilding the entire tree\n   *\n   * @param deriveVisible boolean - if true, will recompute visibility for nodes based on ancestry\n   */\n  toTree(deriveVisible?: boolean): TreeNode<T>[] {\n    if (deriveVisible) {\n      this.deriveVisibility();\n    }\n    return this.cache.roots.map((key) => this.buildNode(key));\n  }\n\n  /**\n   * CACHE FUNCTIONS\n   * These are the public functions to manage cache operations. No cache operations should ever be done\n   * outside this file since it risks corruption of the data.\n   **/\n  getNode(key: Key): TreeNode<T> {\n    const node = this.get(key);\n\n    return {\n      ...node,\n      children: node.children?.map((key) => this.buildNode(key)),\n    };\n  }\n\n  getAllKeys() {\n    return this.cache.lookup.keys();\n  }\n\n  getAllNodes() {\n    return this.cache.lookup.values();\n  }\n\n  getParentForPosition(\n    target: Key | null,\n    position: 'before' | 'after',\n  ): Key | null {\n    const { parentKey } = this.parentOrSibling(target, position);\n    return parentKey;\n  }\n\n  setNode(key: Key, node: TreeNode<T>) {\n    this.set(key, {\n      ...node,\n      children: (node.children ?? []).map((child) => child.key),\n    });\n  }\n\n  setAllNodes({ parentKey, children, ...rest }: Partial<TreeNode<T>>) {\n    for (const node of this.cache.lookup.values()) {\n      this.set(node.key, {\n        ...node,\n        ...rest,\n      });\n    }\n  }\n\n  deleteNode(key: Key) {\n    const node = this.cache.lookup.get(key);\n\n    if (!node) {\n      return;\n    }\n\n    // remove children\n    node.children?.map((key) => this.deleteNode(key));\n\n    // remove node from previous parent or root\n    node.parentKey\n      ? this.removeFromParent(node.parentKey, key)\n      : this.removeFromRoot(key);\n\n    // remove the actual node\n    this.delete(key);\n  }\n\n  addNodes(\n    target: Key | null,\n    nodes: TreeNode<T>[],\n    position: 'before' | 'after',\n  ) {\n    const { parentKey, index } = this.parentOrSibling(target, position);\n    const idx = index + (position === 'before' ? 0 : 1);\n\n    nodes.map((node, i) => this.insertNode(parentKey, node, idx + i));\n  }\n\n  insertNode(parentKey: Key | null, node: TreeNode<T>, idx: number) {\n    const { children, ...rest } = node;\n\n    this.set(node.key, {\n      isDisabled: false,\n      isExpanded: false,\n      isSelected: false,\n      isVisible: false,\n      isVisibleComputed: false,\n      isIndeterminate: false,\n      ...rest,\n      parentKey,\n      ...(children\n        ? {\n            children: children.map((child) => child.key),\n          }\n        : {}),\n    });\n\n    node.children?.map((child, i) => this.insertNode(node.key, child, i));\n\n    parentKey === null\n      ? this.addToRoot(node.key, idx)\n      : this.addToParent(parentKey, node.key, idx);\n  }\n\n  moveNodes(target: Key | null, nodes: Set<Key>, position: 'before' | 'after') {\n    const { parentKey, index } = this.parentOrSibling(target, position);\n    const idx = index + (position === 'before' ? 0 : 1);\n\n    Array.from(nodes).map((key, i) => this.moveNode(parentKey, key, idx + i));\n  }\n\n  moveNode(parentKey: Key | null, key: Key, idx: number) {\n    const node = this.get(key);\n\n    // remove from previous parent\n    node.parentKey\n      ? this.removeFromParent(node.parentKey, key)\n      : this.removeFromRoot(key);\n\n    // add as child to new parent or root at position\n    parentKey\n      ? this.addToParent(parentKey, key, idx)\n      : this.addToRoot(key, idx);\n  }\n\n  /**\n   * Cascade selection down through descendants\n   */\n  cascadeSelection(key: Key, selected: boolean): void {\n    try {\n      const node = this.get(key);\n\n      // Update this node (skip if disabled)\n      if (!node.isDisabled) {\n        this.set(key, {\n          ...node,\n          isSelected: selected,\n          isIndeterminate: false,\n        });\n      }\n\n      // Recurse to children\n      if (node.children) {\n        for (const childKey of node.children) {\n          if (childKey != null) {\n            this.cascadeSelection(childKey, selected);\n          }\n        }\n      }\n    } catch {\n      // Key doesn't exist, skip\n      return;\n    }\n  }\n\n  /**\n   * Bubble up selection state through ancestors\n   */\n  bubbleUpSelection(key: Key): void {\n    try {\n      let current = this.get(key);\n\n      while (current.parentKey) {\n        const parent = this.get(current.parentKey);\n        const newState = this.computeSelectionState(parent);\n\n        // Early termination: if parent state unchanged, ancestors won't change\n        if (\n          parent.isSelected === newState.isSelected &&\n          parent.isIndeterminate === newState.isIndeterminate\n        ) {\n          break;\n        }\n\n        this.set(parent.key, {\n          ...parent,\n          isSelected: newState.isSelected,\n          isIndeterminate: newState.isIndeterminate,\n        });\n\n        current = parent;\n      }\n    } catch {\n      // Key doesn't exist, skip\n      return;\n    }\n  }\n\n  /**\n   * Compute selection state for a node based on its children\n   */\n  private computeSelectionState(node: CacheTreeNode<T>): {\n    isSelected: boolean;\n    isIndeterminate: boolean;\n  } {\n    // Leaf nodes: use their own state\n    if (!node.children || node.children.length === 0) {\n      return {\n        isSelected: node.isSelected ?? false,\n        isIndeterminate: false,\n      };\n    }\n\n    // Get selectable children (exclude disabled)\n    const selectableChildren = node.children\n      .filter((k) => {\n        try {\n          const child = this.get(k);\n          return !child.isDisabled;\n        } catch {\n          return false;\n        }\n      })\n      .map((k) => this.get(k));\n\n    // If all children disabled, treat as leaf\n    if (selectableChildren.length === 0) {\n      return {\n        isSelected: node.isSelected ?? false,\n        isIndeterminate: false,\n      };\n    }\n\n    // Check if all/none/some selected\n    const selectedCount = selectableChildren.filter((c) => c.isSelected).length;\n    const indeterminateCount = selectableChildren.filter(\n      (c) => c.isIndeterminate,\n    ).length;\n\n    // If any child is indeterminate, parent is indeterminate\n    if (indeterminateCount > 0) {\n      return {\n        isSelected: false,\n        isIndeterminate: true,\n      };\n    }\n\n    // All children selected\n    if (selectedCount === selectableChildren.length) {\n      return {\n        isSelected: true,\n        isIndeterminate: false,\n      };\n    }\n\n    // No children selected\n    if (selectedCount === 0) {\n      return {\n        isSelected: false,\n        isIndeterminate: false,\n      };\n    }\n\n    // Some children selected (indeterminate)\n    return {\n      isSelected: false,\n      isIndeterminate: true,\n    };\n  }\n\n  /**\n   * Sync cascade state for parents after a move operation\n   */\n  syncParentsAfterMove(oldParents: Set<Key>, newParent: Key | null): void {\n    // Update old parents (lost children)\n    for (const parentKey of oldParents) {\n      try {\n        const parent = this.get(parentKey);\n        const newState = this.computeSelectionState(parent);\n\n        this.set(parentKey, {\n          ...parent,\n          isSelected: newState.isSelected,\n          isIndeterminate: newState.isIndeterminate,\n        });\n\n        // Bubble up to ancestors\n        if (parent.parentKey) {\n          this.bubbleUpSelection(parentKey);\n        }\n      } catch {\n        // Parent doesn't exist, skip\n      }\n    }\n\n    // Update new parent (gained children)\n    if (newParent) {\n      try {\n        const parent = this.get(newParent);\n        const newState = this.computeSelectionState(parent);\n\n        this.set(newParent, {\n          ...parent,\n          isSelected: newState.isSelected,\n          isIndeterminate: newState.isIndeterminate,\n        });\n\n        // Bubble up to ancestors\n        if (parent.parentKey) {\n          this.bubbleUpSelection(newParent);\n        }\n      } catch {\n        // Parent doesn't exist, skip\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AA6BA,IAAa,QAAb,MAAsB;CACpB,AAAU,QAA8D;EACtE,wBAAQ,IAAI,KAAK;EACjB,OAAO,EAAE;EACV;CAED,YAAY,QAAuB,EAAE,EAAE;AACrC,OAAK,QAAQ,MAAM;;;;;CAMrB,QACE,OACA,yBAAqC,IAAI,KAAK,EAC9C,YAAwB,MACxB;AACA,QAAM,SAAS,SAAS;GACtB,MAAM,EAAE,UAAU,GAAG,SAAS;AAE9B,UAAO,IAAI,KAAK,KAAK;IACnB,YAAY;IACZ,YAAY;IACZ,YAAY;IACZ,WAAW;IACX,mBAAmB;IACnB,iBAAiB;IACjB,GAAG;IACH;IACA,GAAI,WAAW,EAAE,UAAU,SAAS,KAAK,UAAU,MAAM,IAAI,EAAE,GAAG,EAAE;IACrE,CAAC;AAEF,OAAI,KAAK,SACP,MAAK,QAAQ,KAAK,UAAU,QAAQ,KAAK,IAAI;IAE/C;EAEF,MAAM,QAAQ;GAAE;GAAQ,OAAO,MAAM,KAAK,SAAS,KAAK,IAAI;GAAE;AAE9D,MAAI,CAAC,UACH,MAAK,QAAQ;AAGf,OAAK,kBAAkB;AACvB,SAAO;;CAGT,AAAU,IAAI,KAAU;AACtB,MAAI,OAAO,KACT,OAAM,IAAI,MAAM,UAAU,IAAI,qCAAqC;EAGrE,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;AAEvC,MAAI,SAAS,OACX,OAAM,IAAI,MAAM,UAAU,IAAI,yBAAyB;AAGzD,SAAO;;CAGT,AAAU,IAAI,KAAU,MAAwB;AAC9C,OAAK,MAAM,OAAO,IAAI,KAAK,KAAK;;CAGlC,AAAU,OAAO,KAAU;AACzB,OAAK,MAAM,OAAO,OAAO,IAAI;;CAG/B,AAAU,YAAY,WAAgB,UAAe,KAAa;EAChE,MAAM,SAAS,KAAK,IAAI,UAAU;EAClC,MAAM,QAAQ,KAAK,IAAI,SAAS;EAChC,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAE9B,OAAK,IAAI,UAAU;GACjB,GAAG;GACH;GACD,CAAC;EAEF,MAAM,YAAY,OAAO,YAAY,EAAE,EAAE,MAAM,EAAE;AAEjD,WAAS,OAAO,OAAO,GAAG,SAAS;AAEnC,OAAK,IAAI,WAAW;GAClB,GAAG;GACH;GACD,CAAC;;CAGJ,AAAU,UAAU,KAAU,KAAa;EACzC,MAAM,OAAO,KAAK,IAAI,IAAI;EAC1B,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAE9B,OAAK,IAAI,KAAK;GACZ,GAAG;GACH,WAAW;GACZ,CAAC;AAEF,OAAK,MAAM,MAAM,OAAO,OAAO,GAAG,IAAI;;CAGxC,AAAU,iBAAiB,WAAgB,UAAe;EACxD,MAAM,SAAS,KAAK,IAAI,UAAU;EAClC,MAAM,QAAQ,KAAK,IAAI,SAAS;AAEhC,OAAK,IAAI,UAAU;GACjB,GAAG;GACH,WAAW;GACZ,CAAC;AAEF,OAAK,MAAM,OAAO,IAAI,WAAW;GAC/B,GAAG;GACH,UAAU,OAAO,UAAU,QAAQ,QAAQ,QAAQ,SAAS;GAC7D,CAAC;;CAGJ,AAAU,eAAe,KAAU;EACjC,MAAM,OAAO,KAAK,IAAI,IAAI;EAC1B,MAAM,MAAM,KAAK,MAAM,MAAM,QAAQ,IAAI;AAEzC,MAAI,OAAO,GAAG;AACZ,QAAK,IAAI,KAAK;IACZ,GAAG;IACH,WAAW;IACZ,CAAC;AAEF,QAAK,MAAM,MAAM,OAAO,KAAK,EAAE;;;CAInC,AAAU,gBAAgB,QAAoB,UAA8B;EAC1E,IAAIA;EACJ,IAAIC,YAAwB;AAE5B,MAAI,WAAW,KACb,SAAQ,aAAa,WAAW,IAAI,KAAK,MAAM,MAAM;OAChD;GACL,MAAM,aAAa,KAAK,IAAI,OAAO;AAEnC,OAAI,WAAW,WAAW;IACxB,MAAM,SAAS,KAAK,IAAI,WAAW,UAAU;AAE7C,gBAAY,OAAO;AACnB,YAAQ,OAAO,UAAU,QAAQ,OAAO,IAAI;SAE5C,SAAQ,KAAK,MAAM,MAAM,QAAQ,OAAO;;AAI5C,SAAO;GAAE;GAAW;GAAO;;CAG7B,AAAU,SAAS,KAAU;EAC3B,MAAM,OAAO,KAAK,IAAI,IAAI;AAE1B,OAAK,MAAM,OAAO,IAAI,KAAK;GACzB,GAAG;GACH,mBAAmB,KAAK,oBAAoB,IAAI;GACjD,CAAC;AAEF,OAAK,UAAU,KAAK,UAAU,KAAK,SAAS,MAAM,CAAC;;CAGrD,AAAU,oBAAoB,KAAU;EACtC,IAAI,UAAU,KAAK,IAAI,IAAI;EAC3B,MAAM,WAAW,CAAC,QAAQ;AAE1B,SAAO,QAAQ,WAAW;GACxB,MAAM,SAAS,KAAK,IAAI,QAAQ,UAAU;AAC1C,OAAI,OACF,UAAS,KAAK,OAAO;AAEvB,aAAU;;AAGZ,SAAO,SAAS,OAAO,MAAM,EAAE,UAAU;;CAG3C,AAAU,mBAAmB;AAC3B,SAAO,KAAK,MAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,IAAI,CAAC;;;;;;;CAO1D,AAAU,UAAU,KAAuB;EACzC,MAAM,OAAO,KAAK,IAAI,IAAI;EAE1B,MAAM,YAAY,KAAK,YAAY,EAAE,EAAE,QACpC,KAAoB,UAAU;GAC7B,MAAM,YAAY,KAAK,MAAM,OAAO,IAAI,MAAM;AAE9C,OAAI,aAAa,UAAU,cAAc,IACvC,KAAI,KAAK,KAAK,UAAU,MAAM,CAAC;AAGjC,UAAO;KAET,EAAE,CACH;AAED,SAAO;GACL,GAAG;GACH;GACD;;;;;;;;;;;CAYH,OAAO,eAAwC;AAC7C,MAAI,cACF,MAAK,kBAAkB;AAEzB,SAAO,KAAK,MAAM,MAAM,KAAK,QAAQ,KAAK,UAAU,IAAI,CAAC;;;;;;;CAQ3D,QAAQ,KAAuB;EAC7B,MAAM,OAAO,KAAK,IAAI,IAAI;AAE1B,SAAO;GACL,GAAG;GACH,UAAU,KAAK,UAAU,KAAK,UAAQ,KAAK,UAAUC,MAAI,CAAC;GAC3D;;CAGH,aAAa;AACX,SAAO,KAAK,MAAM,OAAO,MAAM;;CAGjC,cAAc;AACZ,SAAO,KAAK,MAAM,OAAO,QAAQ;;CAGnC,qBACE,QACA,UACY;EACZ,MAAM,EAAE,cAAc,KAAK,gBAAgB,QAAQ,SAAS;AAC5D,SAAO;;CAGT,QAAQ,KAAU,MAAmB;AACnC,OAAK,IAAI,KAAK;GACZ,GAAG;GACH,WAAW,KAAK,YAAY,EAAE,EAAE,KAAK,UAAU,MAAM,IAAI;GAC1D,CAAC;;CAGJ,YAAY,EAAE,WAAW,UAAU,GAAG,QAA8B;AAClE,OAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,QAAQ,CAC3C,MAAK,IAAI,KAAK,KAAK;GACjB,GAAG;GACH,GAAG;GACJ,CAAC;;CAIN,WAAW,KAAU;EACnB,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;AAEvC,MAAI,CAAC,KACH;AAIF,OAAK,UAAU,KAAK,UAAQ,KAAK,WAAWA,MAAI,CAAC;AAGjD,OAAK,YACD,KAAK,iBAAiB,KAAK,WAAW,IAAI,GAC1C,KAAK,eAAe,IAAI;AAG5B,OAAK,OAAO,IAAI;;CAGlB,SACE,QACA,OACA,UACA;EACA,MAAM,EAAE,WAAW,UAAU,KAAK,gBAAgB,QAAQ,SAAS;EACnE,MAAM,MAAM,SAAS,aAAa,WAAW,IAAI;AAEjD,QAAM,KAAK,MAAM,MAAM,KAAK,WAAW,WAAW,MAAM,MAAM,EAAE,CAAC;;CAGnE,WAAW,WAAuB,MAAmB,KAAa;EAChE,MAAM,EAAE,UAAU,GAAG,SAAS;AAE9B,OAAK,IAAI,KAAK,KAAK;GACjB,YAAY;GACZ,YAAY;GACZ,YAAY;GACZ,WAAW;GACX,mBAAmB;GACnB,iBAAiB;GACjB,GAAG;GACH;GACA,GAAI,WACA,EACE,UAAU,SAAS,KAAK,UAAU,MAAM,IAAI,EAC7C,GACD,EAAE;GACP,CAAC;AAEF,OAAK,UAAU,KAAK,OAAO,MAAM,KAAK,WAAW,KAAK,KAAK,OAAO,EAAE,CAAC;AAErE,gBAAc,OACV,KAAK,UAAU,KAAK,KAAK,IAAI,GAC7B,KAAK,YAAY,WAAW,KAAK,KAAK,IAAI;;CAGhD,UAAU,QAAoB,OAAiB,UAA8B;EAC3E,MAAM,EAAE,WAAW,UAAU,KAAK,gBAAgB,QAAQ,SAAS;EACnE,MAAM,MAAM,SAAS,aAAa,WAAW,IAAI;AAEjD,QAAM,KAAK,MAAM,CAAC,KAAK,KAAK,MAAM,KAAK,SAAS,WAAW,KAAK,MAAM,EAAE,CAAC;;CAG3E,SAAS,WAAuB,KAAU,KAAa;EACrD,MAAM,OAAO,KAAK,IAAI,IAAI;AAG1B,OAAK,YACD,KAAK,iBAAiB,KAAK,WAAW,IAAI,GAC1C,KAAK,eAAe,IAAI;AAG5B,cACI,KAAK,YAAY,WAAW,KAAK,IAAI,GACrC,KAAK,UAAU,KAAK,IAAI;;;;;CAM9B,iBAAiB,KAAU,UAAyB;AAClD,MAAI;GACF,MAAM,OAAO,KAAK,IAAI,IAAI;AAG1B,OAAI,CAAC,KAAK,WACR,MAAK,IAAI,KAAK;IACZ,GAAG;IACH,YAAY;IACZ,iBAAiB;IAClB,CAAC;AAIJ,OAAI,KAAK,UACP;SAAK,MAAM,YAAY,KAAK,SAC1B,KAAI,YAAY,KACd,MAAK,iBAAiB,UAAU,SAAS;;UAIzC;AAEN;;;;;;CAOJ,kBAAkB,KAAgB;AAChC,MAAI;GACF,IAAI,UAAU,KAAK,IAAI,IAAI;AAE3B,UAAO,QAAQ,WAAW;IACxB,MAAM,SAAS,KAAK,IAAI,QAAQ,UAAU;IAC1C,MAAM,WAAW,KAAK,sBAAsB,OAAO;AAGnD,QACE,OAAO,eAAe,SAAS,cAC/B,OAAO,oBAAoB,SAAS,gBAEpC;AAGF,SAAK,IAAI,OAAO,KAAK;KACnB,GAAG;KACH,YAAY,SAAS;KACrB,iBAAiB,SAAS;KAC3B,CAAC;AAEF,cAAU;;UAEN;AAEN;;;;;;CAOJ,AAAQ,sBAAsB,MAG5B;AAEA,MAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,EAC7C,QAAO;GACL,YAAY,KAAK,cAAc;GAC/B,iBAAiB;GAClB;EAIH,MAAM,qBAAqB,KAAK,SAC7B,QAAQ,MAAM;AACb,OAAI;AAEF,WAAO,CADO,KAAK,IAAI,EAAE,CACX;WACR;AACN,WAAO;;IAET,CACD,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC;AAG1B,MAAI,mBAAmB,WAAW,EAChC,QAAO;GACL,YAAY,KAAK,cAAc;GAC/B,iBAAiB;GAClB;EAIH,MAAM,gBAAgB,mBAAmB,QAAQ,MAAM,EAAE,WAAW,CAAC;AAMrE,MAL2B,mBAAmB,QAC3C,MAAM,EAAE,gBACV,CAAC,SAGuB,EACvB,QAAO;GACL,YAAY;GACZ,iBAAiB;GAClB;AAIH,MAAI,kBAAkB,mBAAmB,OACvC,QAAO;GACL,YAAY;GACZ,iBAAiB;GAClB;AAIH,MAAI,kBAAkB,EACpB,QAAO;GACL,YAAY;GACZ,iBAAiB;GAClB;AAIH,SAAO;GACL,YAAY;GACZ,iBAAiB;GAClB;;;;;CAMH,qBAAqB,YAAsB,WAA6B;AAEtE,OAAK,MAAM,aAAa,WACtB,KAAI;GACF,MAAM,SAAS,KAAK,IAAI,UAAU;GAClC,MAAM,WAAW,KAAK,sBAAsB,OAAO;AAEnD,QAAK,IAAI,WAAW;IAClB,GAAG;IACH,YAAY,SAAS;IACrB,iBAAiB,SAAS;IAC3B,CAAC;AAGF,OAAI,OAAO,UACT,MAAK,kBAAkB,UAAU;UAE7B;AAMV,MAAI,UACF,KAAI;GACF,MAAM,SAAS,KAAK,IAAI,UAAU;GAClC,MAAM,WAAW,KAAK,sBAAsB,OAAO;AAEnD,QAAK,IAAI,WAAW;IAClB,GAAG;IACH,YAAY,SAAS;IACrB,iBAAiB,SAAS;IAC3B,CAAC;AAGF,OAAI,OAAO,UACT,MAAK,kBAAkB,UAAU;UAE7B"}

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

@@ -48,7 +48,8 @@ import "client-only";
  * ```
  */
 declare function useTreeActions<T>({
-  nodes
+  nodes,
+  selectionCascade
 }: UseTreeActionsOptions<T>): TreeActions<T>;
 //#endregion
 export { useTreeActions };