@cube-dev/ui-kit 0.128.0 → 0.130.0

package/dist/components/content/Tree/use-checkbox-tree.js

@@ -0,0 +1,231 @@
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
+import { useEvent } from "../../../_internal/hooks/use-event.js";
+import { useMemo, useState } from "react";
+
+//#region src/components/content/Tree/use-checkbox-tree.ts
+/**
+* Returns whether a node should be checkable (i.e. clicking the
+* checkbox should affect it).
+*
+* Skips:
+* - explicitly disabled nodes (`isDisabled === true`)
+* - explicitly disabled checkboxes (`isCheckboxDisabled === true`)
+* - nodes that opted out via `isCheckable === false`
+*/
+function isNodeEligible(node) {
+	if (!node) return false;
+	if (node.isDisabled) return false;
+	if (node.isCheckboxDisabled) return false;
+	if (node.isCheckable === false) return false;
+	return true;
+}
+/**
+* Recursively walk a subtree bottom-up, deriving which nodes are fully
+* checked vs half-checked.  Mutates `checked` and `half` in place.
+*/
+function deriveCheckedState(node, index, checked, half) {
+	const childKeys = index.childrenOf.get(node.key) ?? [];
+	if (childKeys.length === 0) {
+		const eligible = isNodeEligible(node);
+		const isChecked = checked.has(node.key);
+		return {
+			allChecked: !eligible || isChecked,
+			anyChecked: isChecked,
+			anyEligible: eligible
+		};
+	}
+	let allChecked = true;
+	let anyChecked = false;
+	let anyEligible = false;
+	for (const childKey of childKeys) {
+		const child = index.byKey.get(childKey);
+		if (!child) continue;
+		const r = deriveCheckedState(child, index, checked, half);
+		if (r.anyEligible) anyEligible = true;
+		if (!r.allChecked) allChecked = false;
+		if (r.anyChecked) anyChecked = true;
+	}
+	const eligible = isNodeEligible(node);
+	if (!anyEligible) half.delete(node.key);
+	else if (allChecked) {
+		checked.add(node.key);
+		half.delete(node.key);
+	} else if (anyChecked) {
+		checked.delete(node.key);
+		half.add(node.key);
+	} else {
+		checked.delete(node.key);
+		half.delete(node.key);
+	}
+	return {
+		allChecked: !eligible ? allChecked : checked.has(node.key) && allChecked,
+		anyChecked: anyChecked || checked.has(node.key),
+		anyEligible: anyEligible || eligible
+	};
+}
+function normalizeControlledChecked(controlled) {
+	if (controlled == null) return null;
+	if (Array.isArray(controlled)) return {
+		checked: new Set(controlled),
+		halfChecked: /* @__PURE__ */ new Set()
+	};
+	return {
+		checked: new Set(controlled.checked ?? []),
+		halfChecked: new Set(controlled.halfChecked ?? [])
+	};
+}
+/**
+* Local hook implementing AntD-style cascading checkbox state.
+*
+* - `checked` and `halfChecked` are always derived together from a single
+*   `checked` set (the source of truth) so callers don't need to track
+*   indeterminate keys themselves.
+* - When the consumer passes `checkedKeys` as `{ checked, halfChecked }`,
+*   we keep the wire shape on the way out — same as AntD.
+* - Toggling a node propagates *down* (skipping ineligible descendants)
+*   and recomputes ancestors *up* in a single pass.
+*/
+function useCheckboxTree(opts) {
+	const { treeData, index, isCheckable, defaultCheckedKeys, checkedKeys, onCheck } = opts;
+	/**
+	* Normalize the controlled `checkedKeys` prop into stable `Set` instances.
+	* Memoized on the `checkedKeys` reference so unrelated re-renders don't
+	* invalidate the derivation memo below — `normalizeControlledChecked`
+	* allocates fresh `Set`s each call, which would otherwise force
+	* `deriveCheckedState` to re-walk the entire tree on every render in
+	* controlled mode.
+	*/
+	const controlled = useMemo(() => normalizeControlledChecked(checkedKeys), [checkedKeys]);
+	const isControlled = controlled != null;
+	const wantsObjectShape = checkedKeys != null && !Array.isArray(checkedKeys);
+	const [uncontrolledChecked, setUncontrolledChecked] = useState(() => new Set(defaultCheckedKeys ?? []));
+	const sourceChecked = isControlled ? controlled.checked : uncontrolledChecked;
+	/**
+	* Derive `{ checked, halfChecked }` from the source-of-truth `checked` set
+	* by walking the tree bottom-up:
+	*
+	* - A parent is considered fully checked iff every eligible descendant
+	*   leaf is checked.
+	* - A parent is half-checked iff at least one eligible descendant is
+	*   checked or half-checked, but not all.
+	*
+	* Ineligible nodes (disabled / opt-out) are ignored when computing the
+	* parent's state — they neither force a parent into the unchecked nor
+	* half state.
+	*/
+	const { checkedSet, halfCheckedSet } = useMemo(() => {
+		if (!isCheckable) return {
+			checkedSet: /* @__PURE__ */ new Set(),
+			halfCheckedSet: /* @__PURE__ */ new Set()
+		};
+		/**
+		* If the consumer passed the object shape (`{ checked, halfChecked }`),
+		* they own the half-checked set and we use it as-is. With the array
+		* shape we still need to derive `halfChecked` ourselves — the consumer
+		* only provides `checked`, so parents should still light up
+		* indeterminate when only some descendants are checked.
+		*/
+		if (isControlled && wantsObjectShape) return {
+			checkedSet: new Set(sourceChecked),
+			halfCheckedSet: new Set(controlled.halfChecked)
+		};
+		const checked = new Set(sourceChecked);
+		const half = /* @__PURE__ */ new Set();
+		for (const root of treeData) deriveCheckedState(root, index, checked, half);
+		return {
+			checkedSet: checked,
+			halfCheckedSet: half
+		};
+	}, [
+		isCheckable,
+		isControlled,
+		wantsObjectShape,
+		sourceChecked,
+		controlled,
+		treeData,
+		index
+	]);
+	return {
+		checkedSet,
+		halfCheckedSet,
+		toggle: useEvent((key) => {
+			const node = index.byKey.get(key);
+			if (!node || !isNodeEligible(node)) return;
+			const willCheck = !checkedSet.has(key);
+			/**
+			* Seed from the derived `checkedSet`, not `sourceChecked`. The
+			* source-of-truth set may only contain leaf keys (e.g. when
+			* `defaultCheckedKeys` is leaf-only, or a consumer in controlled-array
+			* mode passes only leaves). The ancestor walk below decides whether
+			* each ancestor is fully checked by inspecting its direct children
+			* via `next.has(ck)` — those children may themselves be inner nodes
+			* whose "fully checked" status only exists in the derived set. Seeding
+			* from `sourceChecked` causes a sibling subtree's parent key to be
+			* missing from `next`, which would incorrectly drop the grandparent
+			* from the stored state (the next render's `useMemo` self-corrects,
+			* but the intermediate stored value violates the cascade invariant).
+			*/
+			const next = new Set(checkedSet);
+			const apply = (n, value) => {
+				if (!isNodeEligible(n)) return;
+				if (value) next.add(n.key);
+				else next.delete(n.key);
+				const childKeys = index.childrenOf.get(n.key) ?? [];
+				for (const ck of childKeys) {
+					const child = index.byKey.get(ck);
+					if (child) apply(child, value);
+				}
+			};
+			apply(node, willCheck);
+			/**
+			* After the cascade, recompute ancestors so the public `checked` set
+			* doesn't carry parent keys that should be half-checked instead.
+			* Ancestors of `key` get visited bottom-up here.
+			*/
+			let parentKey = index.parentOf.get(key);
+			while (parentKey) {
+				const parent = index.byKey.get(parentKey);
+				if (!parent) break;
+				const childKeys = index.childrenOf.get(parentKey) ?? [];
+				let allEligibleChecked = true;
+				let anyEligible = false;
+				for (const ck of childKeys) {
+					const child = index.byKey.get(ck);
+					if (!child) continue;
+					if (!isNodeEligible(child)) continue;
+					anyEligible = true;
+					if (!next.has(ck)) {
+						allEligibleChecked = false;
+						break;
+					}
+				}
+				if (anyEligible && allEligibleChecked && isNodeEligible(parent)) next.add(parentKey);
+				else next.delete(parentKey);
+				parentKey = index.parentOf.get(parentKey);
+			}
+			if (!isControlled) setUncontrolledChecked(next);
+			if (onCheck) {
+				const finalChecked = new Set(next);
+				const finalHalf = /* @__PURE__ */ new Set();
+				for (const root of treeData) deriveCheckedState(root, index, finalChecked, finalHalf);
+				const checkedArr = Array.from(finalChecked);
+				const halfArr = Array.from(finalHalf);
+				const info = {
+					checked: willCheck,
+					node,
+					checkedNodes: checkedArr.map((k) => index.byKey.get(k)).filter((n) => !!n),
+					halfCheckedKeys: halfArr
+				};
+				if (wantsObjectShape) onCheck({
+					checked: checkedArr,
+					halfChecked: halfArr
+				}, info);
+				else onCheck(checkedArr, info);
+			}
+		})
+	};
+}
+
+//#endregion
+export { useCheckboxTree };
+//# sourceMappingURL=use-checkbox-tree.js.map

package/dist/components/content/Tree/use-checkbox-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"use-checkbox-tree.js","names":[],"sources":["../../../../src/components/content/Tree/use-checkbox-tree.ts"],"sourcesContent":["import { useMemo, useState } from 'react';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport type { Key } from '@react-types/shared';\nimport type { TreeIndex } from './tree-index';\nimport type { CubeTreeNodeData, TreeOnCheckInfo } from './types';\n\nexport interface UseCheckboxTreeOptions {\n  treeData: CubeTreeNodeData[];\n  /**\n   * Pre-built tree index, shared with `Tree.tsx` so that `treeData`\n   * is walked exactly once per change rather than once per consumer.\n   */\n  index: TreeIndex;\n  isCheckable: boolean;\n  defaultCheckedKeys?: string[];\n  /** Either an array (AntD's default) or `{ checked, halfChecked }`. */\n  checkedKeys?: string[] | { checked: string[]; halfChecked?: string[] };\n  onCheck?: (\n    checked: Key[] | { checked: Key[]; halfChecked: Key[] },\n    info: TreeOnCheckInfo,\n  ) => void;\n}\n\nexport interface CheckboxTree {\n  /** Set of keys that are fully checked. */\n  checkedSet: Set<string>;\n  /** Set of keys that are in the indeterminate (half-checked) state. */\n  halfCheckedSet: Set<string>;\n  /** Toggle a key, propagating to descendants and updating ancestors. */\n  toggle: (key: string) => void;\n}\n\n/**\n * Returns whether a node should be checkable (i.e. clicking the\n * checkbox should affect it).\n *\n * Skips:\n * - explicitly disabled nodes (`isDisabled === true`)\n * - explicitly disabled checkboxes (`isCheckboxDisabled === true`)\n * - nodes that opted out via `isCheckable === false`\n */\nfunction isNodeEligible(node: CubeTreeNodeData | undefined): boolean {\n  if (!node) return false;\n  if (node.isDisabled) return false;\n  if (node.isCheckboxDisabled) return false;\n  if (node.isCheckable === false) return false;\n  return true;\n}\n\n/**\n * Recursively walk a subtree bottom-up, deriving which nodes are fully\n * checked vs half-checked.  Mutates `checked` and `half` in place.\n */\nfunction deriveCheckedState(\n  node: CubeTreeNodeData,\n  index: TreeIndex,\n  checked: Set<string>,\n  half: Set<string>,\n): { allChecked: boolean; anyChecked: boolean; anyEligible: boolean } {\n  const childKeys = index.childrenOf.get(node.key) ?? [];\n\n  if (childKeys.length === 0) {\n    const eligible = isNodeEligible(node);\n    const isChecked = checked.has(node.key);\n    return {\n      allChecked: !eligible || isChecked,\n      anyChecked: isChecked,\n      anyEligible: eligible,\n    };\n  }\n\n  let allChecked = true;\n  let anyChecked = false;\n  let anyEligible = false;\n\n  for (const childKey of childKeys) {\n    const child = index.byKey.get(childKey);\n    if (!child) continue;\n    const r = deriveCheckedState(child, index, checked, half);\n    if (r.anyEligible) anyEligible = true;\n    if (!r.allChecked) allChecked = false;\n    if (r.anyChecked) anyChecked = true;\n  }\n\n  const eligible = isNodeEligible(node);\n\n  if (!anyEligible) {\n    // No eligible descendants — this node behaves like a leaf for\n    // checking purposes: its own checked state stands as-is.\n    half.delete(node.key);\n  } else if (allChecked) {\n    checked.add(node.key);\n    half.delete(node.key);\n  } else if (anyChecked) {\n    checked.delete(node.key);\n    half.add(node.key);\n  } else {\n    checked.delete(node.key);\n    half.delete(node.key);\n  }\n\n  return {\n    allChecked: !eligible ? allChecked : checked.has(node.key) && allChecked,\n    anyChecked: anyChecked || checked.has(node.key),\n    anyEligible: anyEligible || eligible,\n  };\n}\n\nfunction normalizeControlledChecked(\n  controlled: UseCheckboxTreeOptions['checkedKeys'],\n): { checked: Set<string>; halfChecked: Set<string> } | null {\n  if (controlled == null) return null;\n  if (Array.isArray(controlled)) {\n    return {\n      checked: new Set(controlled),\n      halfChecked: new Set(),\n    };\n  }\n  return {\n    checked: new Set(controlled.checked ?? []),\n    halfChecked: new Set(controlled.halfChecked ?? []),\n  };\n}\n\n/**\n * Local hook implementing AntD-style cascading checkbox state.\n *\n * - `checked` and `halfChecked` are always derived together from a single\n *   `checked` set (the source of truth) so callers don't need to track\n *   indeterminate keys themselves.\n * - When the consumer passes `checkedKeys` as `{ checked, halfChecked }`,\n *   we keep the wire shape on the way out — same as AntD.\n * - Toggling a node propagates *down* (skipping ineligible descendants)\n *   and recomputes ancestors *up* in a single pass.\n */\nexport function useCheckboxTree(opts: UseCheckboxTreeOptions): CheckboxTree {\n  const {\n    treeData,\n    index,\n    isCheckable,\n    defaultCheckedKeys,\n    checkedKeys,\n    onCheck,\n  } = opts;\n\n  /**\n   * Normalize the controlled `checkedKeys` prop into stable `Set` instances.\n   * Memoized on the `checkedKeys` reference so unrelated re-renders don't\n   * invalidate the derivation memo below — `normalizeControlledChecked`\n   * allocates fresh `Set`s each call, which would otherwise force\n   * `deriveCheckedState` to re-walk the entire tree on every render in\n   * controlled mode.\n   */\n  const controlled = useMemo(\n    () => normalizeControlledChecked(checkedKeys),\n    [checkedKeys],\n  );\n  const isControlled = controlled != null;\n  const wantsObjectShape = checkedKeys != null && !Array.isArray(checkedKeys);\n\n  const [uncontrolledChecked, setUncontrolledChecked] = useState<Set<string>>(\n    () => new Set(defaultCheckedKeys ?? []),\n  );\n\n  const sourceChecked = isControlled\n    ? controlled!.checked\n    : uncontrolledChecked;\n\n  /**\n   * Derive `{ checked, halfChecked }` from the source-of-truth `checked` set\n   * by walking the tree bottom-up:\n   *\n   * - A parent is considered fully checked iff every eligible descendant\n   *   leaf is checked.\n   * - A parent is half-checked iff at least one eligible descendant is\n   *   checked or half-checked, but not all.\n   *\n   * Ineligible nodes (disabled / opt-out) are ignored when computing the\n   * parent's state — they neither force a parent into the unchecked nor\n   * half state.\n   */\n  const { checkedSet, halfCheckedSet } = useMemo(() => {\n    if (!isCheckable) {\n      return {\n        checkedSet: new Set<string>(),\n        halfCheckedSet: new Set<string>(),\n      };\n    }\n\n    /**\n     * If the consumer passed the object shape (`{ checked, halfChecked }`),\n     * they own the half-checked set and we use it as-is. With the array\n     * shape we still need to derive `halfChecked` ourselves — the consumer\n     * only provides `checked`, so parents should still light up\n     * indeterminate when only some descendants are checked.\n     */\n    if (isControlled && wantsObjectShape) {\n      return {\n        checkedSet: new Set(sourceChecked),\n        halfCheckedSet: new Set(controlled!.halfChecked),\n      };\n    }\n\n    const checked = new Set(sourceChecked);\n    const half = new Set<string>();\n\n    for (const root of treeData) {\n      deriveCheckedState(root, index, checked, half);\n    }\n\n    return { checkedSet: checked, halfCheckedSet: half };\n  }, [\n    isCheckable,\n    isControlled,\n    wantsObjectShape,\n    sourceChecked,\n    controlled,\n    treeData,\n    index,\n  ]);\n\n  const toggle = useEvent((key: string) => {\n    const node = index.byKey.get(key);\n    if (!node || !isNodeEligible(node)) return;\n\n    const isCurrentlyChecked = checkedSet.has(key);\n    const willCheck = !isCurrentlyChecked;\n\n    /**\n     * Seed from the derived `checkedSet`, not `sourceChecked`. The\n     * source-of-truth set may only contain leaf keys (e.g. when\n     * `defaultCheckedKeys` is leaf-only, or a consumer in controlled-array\n     * mode passes only leaves). The ancestor walk below decides whether\n     * each ancestor is fully checked by inspecting its direct children\n     * via `next.has(ck)` — those children may themselves be inner nodes\n     * whose \"fully checked\" status only exists in the derived set. Seeding\n     * from `sourceChecked` causes a sibling subtree's parent key to be\n     * missing from `next`, which would incorrectly drop the grandparent\n     * from the stored state (the next render's `useMemo` self-corrects,\n     * but the intermediate stored value violates the cascade invariant).\n     */\n    const next = new Set(checkedSet);\n\n    const apply = (n: CubeTreeNodeData, value: boolean) => {\n      if (!isNodeEligible(n)) return;\n      if (value) next.add(n.key);\n      else next.delete(n.key);\n      const childKeys = index.childrenOf.get(n.key) ?? [];\n      for (const ck of childKeys) {\n        const child = index.byKey.get(ck);\n        if (child) apply(child, value);\n      }\n    };\n\n    apply(node, willCheck);\n\n    /**\n     * After the cascade, recompute ancestors so the public `checked` set\n     * doesn't carry parent keys that should be half-checked instead.\n     * Ancestors of `key` get visited bottom-up here.\n     */\n    let parentKey = index.parentOf.get(key);\n    while (parentKey) {\n      const parent = index.byKey.get(parentKey);\n      if (!parent) break;\n      const childKeys = index.childrenOf.get(parentKey) ?? [];\n      let allEligibleChecked = true;\n      let anyEligible = false;\n      for (const ck of childKeys) {\n        const child = index.byKey.get(ck);\n        if (!child) continue;\n        if (!isNodeEligible(child)) continue;\n        anyEligible = true;\n        if (!next.has(ck)) {\n          allEligibleChecked = false;\n          break;\n        }\n      }\n      if (anyEligible && allEligibleChecked && isNodeEligible(parent)) {\n        next.add(parentKey);\n      } else {\n        next.delete(parentKey);\n      }\n      parentKey = index.parentOf.get(parentKey);\n    }\n\n    if (!isControlled) {\n      setUncontrolledChecked(next);\n    }\n\n    if (onCheck) {\n      const finalChecked = new Set(next);\n      const finalHalf = new Set<string>();\n\n      for (const root of treeData) {\n        deriveCheckedState(root, index, finalChecked, finalHalf);\n      }\n\n      const checkedArr = Array.from(finalChecked);\n      const halfArr = Array.from(finalHalf);\n      const checkedNodes: CubeTreeNodeData[] = checkedArr\n        .map((k) => index.byKey.get(k))\n        .filter((n): n is CubeTreeNodeData => !!n);\n\n      const info: TreeOnCheckInfo = {\n        checked: willCheck,\n        node,\n        checkedNodes,\n        halfCheckedKeys: halfArr,\n      };\n\n      if (wantsObjectShape) {\n        onCheck({ checked: checkedArr, halfChecked: halfArr }, info);\n      } else {\n        onCheck(checkedArr, info);\n      }\n    }\n  });\n\n  return { checkedSet, halfCheckedSet, toggle };\n}\n"],"mappings":";;;;;;;;;;;;;;AA2CA,SAAS,eAAe,MAA6C;AACnE,KAAI,CAAC,KAAM,QAAO;AAClB,KAAI,KAAK,WAAY,QAAO;AAC5B,KAAI,KAAK,mBAAoB,QAAO;AACpC,KAAI,KAAK,gBAAgB,MAAO,QAAO;AACvC,QAAO;;;;;;AAOT,SAAS,mBACP,MACA,OACA,SACA,MACoE;CACpE,MAAM,YAAY,MAAM,WAAW,IAAI,KAAK,IAAI,IAAI,EAAE;AAEtD,KAAI,UAAU,WAAW,GAAG;EAC1B,MAAM,WAAW,eAAe,KAAK;EACrC,MAAM,YAAY,QAAQ,IAAI,KAAK,IAAI;AACvC,SAAO;GACL,YAAY,CAAC,YAAY;GACzB,YAAY;GACZ,aAAa;GACd;;CAGH,IAAI,aAAa;CACjB,IAAI,aAAa;CACjB,IAAI,cAAc;AAElB,MAAK,MAAM,YAAY,WAAW;EAChC,MAAM,QAAQ,MAAM,MAAM,IAAI,SAAS;AACvC,MAAI,CAAC,MAAO;EACZ,MAAM,IAAI,mBAAmB,OAAO,OAAO,SAAS,KAAK;AACzD,MAAI,EAAE,YAAa,eAAc;AACjC,MAAI,CAAC,EAAE,WAAY,cAAa;AAChC,MAAI,EAAE,WAAY,cAAa;;CAGjC,MAAM,WAAW,eAAe,KAAK;AAErC,KAAI,CAAC,YAGH,MAAK,OAAO,KAAK,IAAI;UACZ,YAAY;AACrB,UAAQ,IAAI,KAAK,IAAI;AACrB,OAAK,OAAO,KAAK,IAAI;YACZ,YAAY;AACrB,UAAQ,OAAO,KAAK,IAAI;AACxB,OAAK,IAAI,KAAK,IAAI;QACb;AACL,UAAQ,OAAO,KAAK,IAAI;AACxB,OAAK,OAAO,KAAK,IAAI;;AAGvB,QAAO;EACL,YAAY,CAAC,WAAW,aAAa,QAAQ,IAAI,KAAK,IAAI,IAAI;EAC9D,YAAY,cAAc,QAAQ,IAAI,KAAK,IAAI;EAC/C,aAAa,eAAe;EAC7B;;AAGH,SAAS,2BACP,YAC2D;AAC3D,KAAI,cAAc,KAAM,QAAO;AAC/B,KAAI,MAAM,QAAQ,WAAW,CAC3B,QAAO;EACL,SAAS,IAAI,IAAI,WAAW;EAC5B,6BAAa,IAAI,KAAK;EACvB;AAEH,QAAO;EACL,SAAS,IAAI,IAAI,WAAW,WAAW,EAAE,CAAC;EAC1C,aAAa,IAAI,IAAI,WAAW,eAAe,EAAE,CAAC;EACnD;;;;;;;;;;;;;AAcH,SAAgB,gBAAgB,MAA4C;CAC1E,MAAM,EACJ,UACA,OACA,aACA,oBACA,aACA,YACE;;;;;;;;;CAUJ,MAAM,aAAa,cACX,2BAA2B,YAAY,EAC7C,CAAC,YAAY,CACd;CACD,MAAM,eAAe,cAAc;CACnC,MAAM,mBAAmB,eAAe,QAAQ,CAAC,MAAM,QAAQ,YAAY;CAE3E,MAAM,CAAC,qBAAqB,0BAA0B,eAC9C,IAAI,IAAI,sBAAsB,EAAE,CAAC,CACxC;CAED,MAAM,gBAAgB,eAClB,WAAY,UACZ;;;;;;;;;;;;;;CAeJ,MAAM,EAAE,YAAY,mBAAmB,cAAc;AACnD,MAAI,CAAC,YACH,QAAO;GACL,4BAAY,IAAI,KAAa;GAC7B,gCAAgB,IAAI,KAAa;GAClC;;;;;;;;AAUH,MAAI,gBAAgB,iBAClB,QAAO;GACL,YAAY,IAAI,IAAI,cAAc;GAClC,gBAAgB,IAAI,IAAI,WAAY,YAAY;GACjD;EAGH,MAAM,UAAU,IAAI,IAAI,cAAc;EACtC,MAAM,uBAAO,IAAI,KAAa;AAE9B,OAAK,MAAM,QAAQ,SACjB,oBAAmB,MAAM,OAAO,SAAS,KAAK;AAGhD,SAAO;GAAE,YAAY;GAAS,gBAAgB;GAAM;IACnD;EACD;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC;AAoGF,QAAO;EAAE;EAAY;EAAgB,QAlGtB,UAAU,QAAgB;GACvC,MAAM,OAAO,MAAM,MAAM,IAAI,IAAI;AACjC,OAAI,CAAC,QAAQ,CAAC,eAAe,KAAK,CAAE;GAGpC,MAAM,YAAY,CADS,WAAW,IAAI,IAAI;;;;;;;;;;;;;;GAgB9C,MAAM,OAAO,IAAI,IAAI,WAAW;GAEhC,MAAM,SAAS,GAAqB,UAAmB;AACrD,QAAI,CAAC,eAAe,EAAE,CAAE;AACxB,QAAI,MAAO,MAAK,IAAI,EAAE,IAAI;QACrB,MAAK,OAAO,EAAE,IAAI;IACvB,MAAM,YAAY,MAAM,WAAW,IAAI,EAAE,IAAI,IAAI,EAAE;AACnD,SAAK,MAAM,MAAM,WAAW;KAC1B,MAAM,QAAQ,MAAM,MAAM,IAAI,GAAG;AACjC,SAAI,MAAO,OAAM,OAAO,MAAM;;;AAIlC,SAAM,MAAM,UAAU;;;;;;GAOtB,IAAI,YAAY,MAAM,SAAS,IAAI,IAAI;AACvC,UAAO,WAAW;IAChB,MAAM,SAAS,MAAM,MAAM,IAAI,UAAU;AACzC,QAAI,CAAC,OAAQ;IACb,MAAM,YAAY,MAAM,WAAW,IAAI,UAAU,IAAI,EAAE;IACvD,IAAI,qBAAqB;IACzB,IAAI,cAAc;AAClB,SAAK,MAAM,MAAM,WAAW;KAC1B,MAAM,QAAQ,MAAM,MAAM,IAAI,GAAG;AACjC,SAAI,CAAC,MAAO;AACZ,SAAI,CAAC,eAAe,MAAM,CAAE;AAC5B,mBAAc;AACd,SAAI,CAAC,KAAK,IAAI,GAAG,EAAE;AACjB,2BAAqB;AACrB;;;AAGJ,QAAI,eAAe,sBAAsB,eAAe,OAAO,CAC7D,MAAK,IAAI,UAAU;QAEnB,MAAK,OAAO,UAAU;AAExB,gBAAY,MAAM,SAAS,IAAI,UAAU;;AAG3C,OAAI,CAAC,aACH,wBAAuB,KAAK;AAG9B,OAAI,SAAS;IACX,MAAM,eAAe,IAAI,IAAI,KAAK;IAClC,MAAM,4BAAY,IAAI,KAAa;AAEnC,SAAK,MAAM,QAAQ,SACjB,oBAAmB,MAAM,OAAO,cAAc,UAAU;IAG1D,MAAM,aAAa,MAAM,KAAK,aAAa;IAC3C,MAAM,UAAU,MAAM,KAAK,UAAU;IAKrC,MAAM,OAAwB;KAC5B,SAAS;KACT;KACA,cAPuC,WACtC,KAAK,MAAM,MAAM,MAAM,IAAI,EAAE,CAAC,CAC9B,QAAQ,MAA6B,CAAC,CAAC,EAAE;KAM1C,iBAAiB;KAClB;AAED,QAAI,iBACF,SAAQ;KAAE,SAAS;KAAY,aAAa;KAAS,EAAE,KAAK;QAE5D,SAAQ,YAAY,KAAK;;IAG7B;EAE2C"}

package/dist/components/content/Tree/use-load-data.js

@@ -0,0 +1,75 @@
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
+import { useEvent } from "../../../_internal/hooks/use-event.js";
+import { useRef, useState } from "react";
+
+//#region src/components/content/Tree/use-load-data.ts
+/**
+* Tracks which rows are currently fetching their children via `loadData`
+* and exposes a setter for the Tree to call after every expand change.
+*
+* `loadData` is fired exactly once per key per "first expand" event:
+*
+* - Skipped if there is no `loadData` callback.
+* - Skipped for leaf nodes (`isLeaf === true`).
+* - Skipped if the node already has `children` (already loaded).
+* - Skipped if a previous fetch for the same key is still in flight.
+*
+* The promise's resolution is awaited only to clear the `loading` mod;
+* the consumer is expected to commit the new children to the controlled
+* `treeData` themselves (matching AntD's pattern).
+*/
+function useLoadData(opts) {
+	const { nodesByKey, loadData, initialExpandedKeys } = opts;
+	const [loadingKeys, setLoadingKeys] = useState(() => /* @__PURE__ */ new Set());
+	const previousExpandedRef = useRef(new Set(initialExpandedKeys));
+	const inFlightRef = useRef(/* @__PURE__ */ new Set());
+	return {
+		loadingKeys,
+		onExpandedChanged: useEvent((expandedKeys) => {
+			const next = /* @__PURE__ */ new Set();
+			for (const k of expandedKeys) next.add(String(k));
+			const prev = previousExpandedRef.current;
+			const newlyExpanded = [];
+			for (const k of next) if (!prev.has(k)) newlyExpanded.push(k);
+			previousExpandedRef.current = next;
+			if (!loadData || newlyExpanded.length === 0) return;
+			const toLoad = [];
+			for (const key of newlyExpanded) {
+				const node = nodesByKey.get(key);
+				if (!node) continue;
+				if (node.isLeaf) continue;
+				if (node.children && node.children.length > 0) continue;
+				if (inFlightRef.current.has(key)) continue;
+				inFlightRef.current.add(key);
+				toLoad.push(key);
+			}
+			if (toLoad.length === 0) return;
+			setLoadingKeys((current) => {
+				const updated = new Set(current);
+				for (const k of toLoad) updated.add(k);
+				return updated;
+			});
+			for (const key of toLoad) {
+				const loadNode = nodesByKey.get(key);
+				Promise.resolve(loadData({
+					key,
+					children: loadNode?.children
+				})).catch((err) => {
+					console.error(`[Tree] loadData failed for key "${key}":`, err);
+				}).finally(() => {
+					inFlightRef.current.delete(key);
+					setLoadingKeys((current) => {
+						if (!current.has(key)) return current;
+						const updated = new Set(current);
+						updated.delete(key);
+						return updated;
+					});
+				});
+			}
+		})
+	};
+}
+
+//#endregion
+export { useLoadData };
+//# sourceMappingURL=use-load-data.js.map

package/dist/components/content/Tree/use-load-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"use-load-data.js","names":[],"sources":["../../../../src/components/content/Tree/use-load-data.ts"],"sourcesContent":["import { useRef, useState } from 'react';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport type { Key } from '@react-types/shared';\nimport type { CubeTreeNodeData, TreeLoadDataNode } from './types';\n\nexport interface UseLoadDataOptions {\n  /**\n   * Map of `key -> node` built from the consumer's `treeData`. Used to\n   * find the node being expanded when `loadData` fires.\n   */\n  nodesByKey: Map<string, CubeTreeNodeData>;\n  loadData?: (node: TreeLoadDataNode) => Promise<void>;\n  /**\n   * Keys that are expanded at mount time (controlled or default).\n   * Seeds `previousExpandedRef` so the first `onExpandedChanged` call\n   * doesn't misidentify them as user-triggered expansions.\n   */\n  initialExpandedKeys?: Iterable<string>;\n}\n\nexport interface LoadDataController {\n  /** Set of keys that are currently waiting on `loadData`. */\n  loadingKeys: Set<string>;\n  /**\n   * Called by `Tree.tsx` whenever the underlying React Stately state's\n   * `expandedKeys` change. We diff against the previous set, and for\n   * each newly-expanded key we trigger `loadData` if appropriate.\n   */\n  onExpandedChanged: (expandedKeys: Iterable<Key>) => void;\n}\n\n/**\n * Tracks which rows are currently fetching their children via `loadData`\n * and exposes a setter for the Tree to call after every expand change.\n *\n * `loadData` is fired exactly once per key per \"first expand\" event:\n *\n * - Skipped if there is no `loadData` callback.\n * - Skipped for leaf nodes (`isLeaf === true`).\n * - Skipped if the node already has `children` (already loaded).\n * - Skipped if a previous fetch for the same key is still in flight.\n *\n * The promise's resolution is awaited only to clear the `loading` mod;\n * the consumer is expected to commit the new children to the controlled\n * `treeData` themselves (matching AntD's pattern).\n */\nexport function useLoadData(opts: UseLoadDataOptions): LoadDataController {\n  const { nodesByKey, loadData, initialExpandedKeys } = opts;\n  const [loadingKeys, setLoadingKeys] = useState<Set<string>>(() => new Set());\n  const previousExpandedRef = useRef<Set<string>>(new Set(initialExpandedKeys));\n  const inFlightRef = useRef<Set<string>>(new Set());\n\n  const onExpandedChanged = useEvent((expandedKeys: Iterable<Key>) => {\n    const next = new Set<string>();\n    for (const k of expandedKeys) next.add(String(k));\n\n    const prev = previousExpandedRef.current;\n    const newlyExpanded: string[] = [];\n    for (const k of next) {\n      if (!prev.has(k)) newlyExpanded.push(k);\n    }\n    previousExpandedRef.current = next;\n\n    if (!loadData || newlyExpanded.length === 0) return;\n\n    const toLoad: string[] = [];\n    for (const key of newlyExpanded) {\n      const node = nodesByKey.get(key);\n      if (!node) continue;\n      if (node.isLeaf) continue;\n      if (node.children && node.children.length > 0) continue;\n      if (inFlightRef.current.has(key)) continue;\n      inFlightRef.current.add(key);\n      toLoad.push(key);\n    }\n\n    if (toLoad.length === 0) return;\n\n    setLoadingKeys((current) => {\n      const updated = new Set(current);\n      for (const k of toLoad) updated.add(k);\n      return updated;\n    });\n\n    for (const key of toLoad) {\n      const loadNode = nodesByKey.get(key);\n      Promise.resolve(loadData({ key, children: loadNode?.children }))\n        .catch((err) => {\n          if (process.env.NODE_ENV !== 'production') {\n            console.error(`[Tree] loadData failed for key \"${key}\":`, err);\n          }\n        })\n        .finally(() => {\n          inFlightRef.current.delete(key);\n          setLoadingKeys((current) => {\n            if (!current.has(key)) return current;\n            const updated = new Set(current);\n            updated.delete(key);\n            return updated;\n          });\n        });\n    }\n  });\n\n  return { loadingKeys, onExpandedChanged };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAgDA,SAAgB,YAAY,MAA8C;CACxE,MAAM,EAAE,YAAY,UAAU,wBAAwB;CACtD,MAAM,CAAC,aAAa,kBAAkB,+BAA4B,IAAI,KAAK,CAAC;CAC5E,MAAM,sBAAsB,OAAoB,IAAI,IAAI,oBAAoB,CAAC;CAC7E,MAAM,cAAc,uBAAoB,IAAI,KAAK,CAAC;AAsDlD,QAAO;EAAE;EAAa,mBApDI,UAAU,iBAAgC;GAClE,MAAM,uBAAO,IAAI,KAAa;AAC9B,QAAK,MAAM,KAAK,aAAc,MAAK,IAAI,OAAO,EAAE,CAAC;GAEjD,MAAM,OAAO,oBAAoB;GACjC,MAAM,gBAA0B,EAAE;AAClC,QAAK,MAAM,KAAK,KACd,KAAI,CAAC,KAAK,IAAI,EAAE,CAAE,eAAc,KAAK,EAAE;AAEzC,uBAAoB,UAAU;AAE9B,OAAI,CAAC,YAAY,cAAc,WAAW,EAAG;GAE7C,MAAM,SAAmB,EAAE;AAC3B,QAAK,MAAM,OAAO,eAAe;IAC/B,MAAM,OAAO,WAAW,IAAI,IAAI;AAChC,QAAI,CAAC,KAAM;AACX,QAAI,KAAK,OAAQ;AACjB,QAAI,KAAK,YAAY,KAAK,SAAS,SAAS,EAAG;AAC/C,QAAI,YAAY,QAAQ,IAAI,IAAI,CAAE;AAClC,gBAAY,QAAQ,IAAI,IAAI;AAC5B,WAAO,KAAK,IAAI;;AAGlB,OAAI,OAAO,WAAW,EAAG;AAEzB,mBAAgB,YAAY;IAC1B,MAAM,UAAU,IAAI,IAAI,QAAQ;AAChC,SAAK,MAAM,KAAK,OAAQ,SAAQ,IAAI,EAAE;AACtC,WAAO;KACP;AAEF,QAAK,MAAM,OAAO,QAAQ;IACxB,MAAM,WAAW,WAAW,IAAI,IAAI;AACpC,YAAQ,QAAQ,SAAS;KAAE;KAAK,UAAU,UAAU;KAAU,CAAC,CAAC,CAC7D,OAAO,QAAQ;AAEZ,aAAQ,MAAM,mCAAmC,IAAI,KAAK,IAAI;MAEhE,CACD,cAAc;AACb,iBAAY,QAAQ,OAAO,IAAI;AAC/B,qBAAgB,YAAY;AAC1B,UAAI,CAAC,QAAQ,IAAI,IAAI,CAAE,QAAO;MAC9B,MAAM,UAAU,IAAI,IAAI,QAAQ;AAChC,cAAQ,OAAO,IAAI;AACnB,aAAO;OACP;MACF;;IAEN;EAEuC"}

package/dist/components/content/highlightText.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { _Text } from "./Text.js";
 import { jsx } from "react/jsx-runtime";
 

package/dist/components/content/use-auto-tooltip.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { TooltipProvider } from "../overlays/Tooltip/TooltipProvider.js";
 import { useCallback, useEffect, useMemo, useRef, useState } from "react";
 import { jsx } from "react/jsx-runtime";

package/dist/components/fields/Checkbox/Checkbox.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { extractStyles } from "../../../utils/styles.js";
 import { mergeProps as mergeProps$1 } from "../../../utils/react/mergeProps.js";
 import { _Text } from "../../content/Text.js";

package/dist/components/fields/Checkbox/CheckboxGroup.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { extractStyles } from "../../../utils/styles.js";
 import { mergeProps as mergeProps$1 } from "../../../utils/react/mergeProps.js";
 import { useProviderProps } from "../../../provider.js";

package/dist/components/fields/Checkbox/context.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { createContext } from "react";
 
 //#region src/components/fields/Checkbox/context.ts

package/dist/components/fields/ComboBox/ComboBox.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.128.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.130.0 | Cube Dev Team */
 import { extractStyles } from "../../../utils/styles.js";
 import { useLayoutEffect as useLayoutEffect$1 } from "../../../utils/react/useLayoutEffect.js";
 import { mergeProps as mergeProps$1 } from "../../../utils/react/mergeProps.js";
@@ -18,7 +18,6 @@ import { useFormProps } from "../../form/Form/Form.js";
 import { useFieldProps } from "../../form/Form/use-field/use-field-props.js";
 import { wrapWithField } from "../../form/wrapper.js";
 import { ListBox } from "../ListBox/ListBox.js";
-import { chainRaf } from "../../../utils/raf.js";
 import { InvalidIcon } from "../../shared/InvalidIcon.js";
 import { ValidIcon } from "../../shared/ValidIcon.js";
 import { DEFAULT_INPUT_STYLES, INPUT_WRAPPER_STYLES } from "../TextInput/TextInputBase.js";
@@ -318,7 +317,7 @@ const ComboBoxInput = forwardRef(function ComboBoxInput({ qa, inputRef, id, valu
 	});
 });
 function ComboBoxOverlay({ isOpen, triggerRef, popoverRef, listBoxRef, direction, shouldFlip, overlayOffset, containerPadding, comboBoxWidth, comboBoxId, overlayStyles, listBoxStyles, optionStyles, sectionStyles, headingStyles, effectiveSelectedKey, isDisabled, disabledKeys, items, children, listStateRef, onSelectionChange, onClose, label, ariaLabel, compositeFocusProps, filter, size = "medium" }) {
-	const { overlayProps: overlayPositionProps, placement, updatePosition } = useOverlayPosition({
+	const { overlayProps: overlayPositionProps, placement } = useOverlayPosition({
 		targetRef: triggerRef,
 		overlayRef: popoverRef,
 		placement: `${direction} start`,
@@ -339,11 +338,6 @@ function ComboBoxOverlay({ isOpen, triggerRef, popoverRef, listBoxRef, direction
 			return false;
 		}
 	}, popoverRef);
-	useLayoutEffect$1(() => {
-		if (isOpen && updatePosition) return chainRaf(() => {
-			updatePosition();
-		}, 3);
-	}, [isOpen]);
 	const placementDirection = placement?.split(" ")[0] || direction;
 	return /* @__PURE__ */ jsx(Portal, { children: /* @__PURE__ */ jsx(DisplayTransition, {
 		isShown: isOpen,