@cube-dev/ui-kit 0.0.0-canary-0b79a39 → 0.0.0-canary-c02e70f

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

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-0b79a39 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c02e70f | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { c } from "react-compiler-runtime";
 import { useState } from "react";
@@ -76,6 +76,36 @@ function normalizeControlledChecked(controlled) {
 	};
 }
 /**
+* 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.
+*/
+function resolveCheckedSets({ isCheckable, sourceChecked, ownHalfChecked, treeData, index }) {
+	if (!isCheckable) return {
+		checkedSet: /* @__PURE__ */ new Set(),
+		halfCheckedSet: /* @__PURE__ */ new Set()
+	};
+	if (ownHalfChecked) return {
+		checkedSet: new Set(sourceChecked),
+		halfCheckedSet: new Set(ownHalfChecked)
+	};
+	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
+	};
+}
+/**
 * Local hook implementing AntD-style cascading checkbox state.
 *
 * - `checked` and `halfChecked` are always derived together from a single
@@ -87,96 +117,28 @@ function normalizeControlledChecked(controlled) {
 *   and recomputes ancestors *up* in a single pass.
 */
 function useCheckboxTree(opts) {
-	const $ = c(31);
+	const $ = c(14);
 	const { treeData, index, isCheckable, defaultCheckedKeys, checkedKeys, onCheck } = opts;
+	const controlled = normalizeControlledChecked(checkedKeys);
+	const isControlled = controlled != null;
+	const wantsObjectShape = checkedKeys != null && !Array.isArray(checkedKeys);
 	let t0;
-	if ($[0] !== checkedKeys) {
-		t0 = normalizeControlledChecked(checkedKeys);
-		$[0] = checkedKeys;
+	if ($[0] !== defaultCheckedKeys) {
+		t0 = () => new Set(defaultCheckedKeys ?? []);
+		$[0] = defaultCheckedKeys;
 		$[1] = t0;
 	} else t0 = $[1];
-	const controlled = t0;
-	const isControlled = controlled != null;
-	const wantsObjectShape = checkedKeys != null && !Array.isArray(checkedKeys);
+	const [uncontrolledChecked, setUncontrolledChecked] = useState(t0);
+	const { checkedSet, halfCheckedSet } = resolveCheckedSets({
+		isCheckable,
+		sourceChecked: isControlled ? controlled.checked : uncontrolledChecked,
+		ownHalfChecked: isControlled && wantsObjectShape ? controlled.halfChecked : null,
+		treeData,
+		index
+	});
 	let t1;
-	if ($[2] !== defaultCheckedKeys) {
-		t1 = () => new Set(defaultCheckedKeys ?? []);
-		$[2] = defaultCheckedKeys;
-		$[3] = t1;
-	} else t1 = $[3];
-	const [uncontrolledChecked, setUncontrolledChecked] = useState(t1);
-	const sourceChecked = isControlled ? controlled.checked : uncontrolledChecked;
-	let t2;
-	bb0: {
-		if (!isCheckable) {
-			let t3;
-			if ($[4] === Symbol.for("react.memo_cache_sentinel")) {
-				t3 = {
-					checkedSet: /* @__PURE__ */ new Set(),
-					halfCheckedSet: /* @__PURE__ */ new Set()
-				};
-				$[4] = t3;
-			} else t3 = $[4];
-			t2 = t3;
-			break bb0;
-		}
-		if (isControlled && wantsObjectShape) {
-			let t3;
-			if ($[5] !== sourceChecked) {
-				t3 = new Set(sourceChecked);
-				$[5] = sourceChecked;
-				$[6] = t3;
-			} else t3 = $[6];
-			let t4;
-			if ($[7] !== controlled.halfChecked) {
-				t4 = new Set(controlled.halfChecked);
-				$[7] = controlled.halfChecked;
-				$[8] = t4;
-			} else t4 = $[8];
-			let t5;
-			if ($[9] !== t3 || $[10] !== t4) {
-				t5 = {
-					checkedSet: t3,
-					halfCheckedSet: t4
-				};
-				$[9] = t3;
-				$[10] = t4;
-				$[11] = t5;
-			} else t5 = $[11];
-			t2 = t5;
-			break bb0;
-		}
-		let checked;
-		let half;
-		if ($[12] !== index || $[13] !== sourceChecked || $[14] !== treeData) {
-			checked = new Set(sourceChecked);
-			half = /* @__PURE__ */ new Set();
-			for (const root of treeData) deriveCheckedState(root, index, checked, half);
-			$[12] = index;
-			$[13] = sourceChecked;
-			$[14] = treeData;
-			$[15] = checked;
-			$[16] = half;
-		} else {
-			checked = $[15];
-			half = $[16];
-		}
-		let t3;
-		if ($[17] !== checked || $[18] !== half) {
-			t3 = {
-				checkedSet: checked,
-				halfCheckedSet: half
-			};
-			$[17] = checked;
-			$[18] = half;
-			$[19] = t3;
-		} else t3 = $[19];
-		t2 = t3;
-	}
-	const { checkedSet, halfCheckedSet } = t2;
-	let t3;
-	if ($[20] !== checkedSet || $[21] !== index || $[22] !== isControlled || $[23] !== onCheck || $[24] !== treeData || $[25] !== wantsObjectShape) {
-		t3 = (key) => {
+	if ($[2] !== checkedSet || $[3] !== index || $[4] !== isControlled || $[5] !== onCheck || $[6] !== setUncontrolledChecked || $[7] !== treeData || $[8] !== wantsObjectShape) {
+		t1 = (key) => {
 			const node = index.byKey.get(key);
 			if (!node || !isNodeEligible(node)) return;
 			const willCheck = !checkedSet.has(key);
@@ -217,7 +179,7 @@ function useCheckboxTree(opts) {
 			if (onCheck) {
 				const finalChecked = new Set(next);
 				const finalHalf = /* @__PURE__ */ new Set();
-				for (const root_0 of treeData) deriveCheckedState(root_0, index, finalChecked, finalHalf);
+				for (const root of treeData) deriveCheckedState(root, index, finalChecked, finalHalf);
 				const checkedArr = Array.from(finalChecked);
 				const halfArr = Array.from(finalHalf);
 				const info = {
@@ -233,28 +195,29 @@ function useCheckboxTree(opts) {
 				else onCheck(checkedArr, info);
 			}
 		};
-		$[20] = checkedSet;
-		$[21] = index;
-		$[22] = isControlled;
-		$[23] = onCheck;
-		$[24] = treeData;
-		$[25] = wantsObjectShape;
-		$[26] = t3;
-	} else t3 = $[26];
-	const toggle = useEvent(t3);
-	let t4;
-	if ($[27] !== checkedSet || $[28] !== halfCheckedSet || $[29] !== toggle) {
-		t4 = {
+		$[2] = checkedSet;
+		$[3] = index;
+		$[4] = isControlled;
+		$[5] = onCheck;
+		$[6] = setUncontrolledChecked;
+		$[7] = treeData;
+		$[8] = wantsObjectShape;
+		$[9] = t1;
+	} else t1 = $[9];
+	const toggle = useEvent(t1);
+	let t2;
+	if ($[10] !== checkedSet || $[11] !== halfCheckedSet || $[12] !== toggle) {
+		t2 = {
 			checkedSet,
 			halfCheckedSet,
 			toggle
 		};
-		$[27] = checkedSet;
-		$[28] = halfCheckedSet;
-		$[29] = toggle;
-		$[30] = t4;
-	} else t4 = $[30];
-	return t4;
+		$[10] = checkedSet;
+		$[11] = halfCheckedSet;
+		$[12] = toggle;
+		$[13] = t2;
+	} else t2 = $[13];
+	return t2;
 }
 function _temp(n_0) {
 	return !!n_0;

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

@@ -1 +1 @@
-{"version":3,"file":"use-checkbox-tree.js","names":["useMemo","useState","useEvent","Key","TreeIndex","CubeTreeNodeData","TreeOnCheckInfo","UseCheckboxTreeOptions","treeData","index","isCheckable","defaultCheckedKeys","checkedKeys","checked","halfChecked","onCheck","info","CheckboxTree","checkedSet","Set","halfCheckedSet","toggle","key","isNodeEligible","node","isDisabled","isCheckboxDisabled","deriveCheckedState","half","allChecked","anyChecked","anyEligible","childKeys","childrenOf","get","length","eligible","isChecked","has","childKey","child","byKey","r","delete","add","normalizeControlledChecked","controlled","Array","isArray","useCheckboxTree","opts","$","_c","t0","isControlled","wantsObjectShape","t1","uncontrolledChecked","setUncontrolledChecked","sourceChecked","t2","bb0","t3","Symbol","for","t4","t5","root","isCurrentlyChecked","willCheck","next","apply","n","value","ck","parentKey","parentOf","parent","childKeys_0","allEligibleChecked","ck_0","child_0","finalChecked","finalHalf","root_0","checkedArr","from","halfArr","checkedNodes","map","k","filter","_temp","halfCheckedKeys","n_0"],"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,SAASuB,eAAeC,MAA6C;AACnE,KAAI,CAACA,KAAM,QAAO;AAClB,KAAIA,KAAKC,WAAY,QAAO;AAC5B,KAAID,KAAKE,mBAAoB,QAAO;AACpC,KAAIF,KAAKd,gBAAgB,MAAO,QAAO;AACvC,QAAO;;;;;;AAOT,SAASiB,mBACPH,MACAf,OACAI,SACAe,MACoE;CACpE,MAAMI,YAAYvB,MAAMwB,WAAWC,IAAIV,KAAKF,IAAI,IAAI,EAAE;AAEtD,KAAIU,UAAUG,WAAW,GAAG;EAC1B,MAAMC,WAAWb,eAAeC,KAAK;EACrC,MAAMa,YAAYxB,QAAQyB,IAAId,KAAKF,IAAI;AACvC,SAAO;GACLO,YAAY,CAACO,YAAYC;GACzBP,YAAYO;GACZN,aAAaK;GACd;;CAGH,IAAIP,aAAa;CACjB,IAAIC,aAAa;CACjB,IAAIC,cAAc;AAElB,MAAK,MAAMQ,YAAYP,WAAW;EAChC,MAAMQ,QAAQ/B,MAAMgC,MAAMP,IAAIK,SAAS;AACvC,MAAI,CAACC,MAAO;EACZ,MAAME,IAAIf,mBAAmBa,OAAO/B,OAAOI,SAASe,KAAK;AACzD,MAAIc,EAAEX,YAAaA,eAAc;AACjC,MAAI,CAACW,EAAEb,WAAYA,cAAa;AAChC,MAAIa,EAAEZ,WAAYA,cAAa;;CAGjC,MAAMM,WAAWb,eAAeC,KAAK;AAErC,KAAI,CAACO,YAGHH,MAAKe,OAAOnB,KAAKF,IAAI;UACZO,YAAY;AACrBhB,UAAQ+B,IAAIpB,KAAKF,IAAI;AACrBM,OAAKe,OAAOnB,KAAKF,IAAI;YACZQ,YAAY;AACrBjB,UAAQ8B,OAAOnB,KAAKF,IAAI;AACxBM,OAAKgB,IAAIpB,KAAKF,IAAI;QACb;AACLT,UAAQ8B,OAAOnB,KAAKF,IAAI;AACxBM,OAAKe,OAAOnB,KAAKF,IAAI;;AAGvB,QAAO;EACLO,YAAY,CAACO,WAAWP,aAAahB,QAAQyB,IAAId,KAAKF,IAAI,IAAIO;EAC9DC,YAAYA,cAAcjB,QAAQyB,IAAId,KAAKF,IAAI;EAC/CS,aAAaA,eAAeK;EAC7B;;AAGH,SAASS,2BACPC,YAC2D;AAC3D,KAAIA,cAAc,KAAM,QAAO;AAC/B,KAAIC,MAAMC,QAAQF,WAAW,CAC3B,QAAO;EACLjC,SAAS,IAAIM,IAAI2B,WAAW;EAC5BhC,6BAAa,IAAIK,KAAI;EACtB;AAEH,QAAO;EACLN,SAAS,IAAIM,IAAI2B,WAAWjC,WAAW,EAAE,CAAC;EAC1CC,aAAa,IAAIK,IAAI2B,WAAWhC,eAAe,EAAE,CAAA;EAClD;;;;;;;;;;;;;AAcH,SAAOmC,gBAAAC,MAAA;CAAA,MAAAC,IAAAC,EAAA,GAAA;CACL,MAAA,EAAA5C,UAAAC,OAAAC,aAAAC,oBAAAC,aAAAG,YAOImC;CAAK,IAAAG;AAAA,KAAAF,EAAA,OAAAvC,aAAA;AAWDyC,OAAAR,2BAA2BjC,YAAY;AAAAuC,IAAA,KAAAvC;AAAAuC,IAAA,KAAAE;OAAAA,MAAAF,EAAA;CAD/C,MAAAL,aACQO;CAGR,MAAAC,eAAqBR,cAAc;CACnC,MAAAS,mBAAyB3C,eAAe,QAAf,CAAwBmC,MAAKC,QAASpC,YAAY;CAAC,IAAA4C;AAAA,KAAAL,EAAA,OAAAxC,oBAAA;AAG1E6C,aAAM,IAAIrC,IAAIR,sBAAA,EAAwB,CAAC;AAAAwC,IAAA,KAAAxC;AAAAwC,IAAA,KAAAK;OAAAA,MAAAL,EAAA;CADzC,MAAA,CAAAM,qBAAAC,0BAAsDzD,SACpDuD,GACD;CAED,MAAAG,gBAAsBL,eAClBR,WAAUjC,UADQ4C;CAEE,IAAAG;AAAAC,MAAA;AAgBtB,MAAI,CAACnD,aAAW;GAAA,IAAAoD;AAAA,OAAAX,EAAA,OAAAY,OAAAC,IAAA,4BAAA,EAAA;AACPF,SAAA;KAAA5C,4BACO,IAAIC,KAAa;KAAAC,gCACb,IAAID,KAAY;KACjC;AAAAgC,MAAA,KAAAW;SAAAA,MAAAX,EAAA;AAHDS,QAAOE;AAAP,SAAAD;;AAaF,MAAIP,gBAAAC,kBAAgC;GAAA,IAAAO;AAAA,OAAAX,EAAA,OAAAQ,eAAA;AAEpBG,SAAA,IAAI3C,IAAIwC,cAAc;AAAAR,MAAA,KAAAQ;AAAAR,MAAA,KAAAW;SAAAA,MAAAX,EAAA;GAAA,IAAAc;AAAA,OAAAd,EAAA,OAAAL,WAAAhC,aAAA;AAClBmD,SAAA,IAAI9C,IAAI2B,WAAUhC,YAAc;AAAAqC,MAAA,KAAAL,WAAAhC;AAAAqC,MAAA,KAAAc;SAAAA,MAAAd,EAAA;GAAA,IAAAe;AAAA,OAAAf,EAAA,OAAAW,MAAAX,EAAA,QAAAc,IAAA;AAF3CC,SAAA;KAAAhD,YACO4C;KAAsB1C,gBAClB6C;KACjB;AAAAd,MAAA,KAAAW;AAAAX,MAAA,MAAAc;AAAAd,MAAA,MAAAe;SAAAA,MAAAf,EAAA;AAHDS,QAAOM;AAAP,SAAAL;;EAID,IAAAhD;EAAA,IAAAe;AAAA,MAAAuB,EAAA,QAAA1C,SAAA0C,EAAA,QAAAQ,iBAAAR,EAAA,QAAA3C,UAAA;AAEDK,aAAgB,IAAIM,IAAIwC,cAAc;AACtC/B,0BAAa,IAAIT,KAAa;AAE9B,QAAK,MAAAgD,QAAc3D,SACjBmB,oBAAmBwC,MAAM1D,OAAOI,SAASe,KAAK;AAC/CuB,KAAA,MAAA1C;AAAA0C,KAAA,MAAAQ;AAAAR,KAAA,MAAA3C;AAAA2C,KAAA,MAAAtC;AAAAsC,KAAA,MAAAvB;SAAA;AAAAf,aAAAsC,EAAA;AAAAvB,UAAAuB,EAAA;;EAAA,IAAAW;AAAA,MAAAX,EAAA,QAAAtC,WAAAsC,EAAA,QAAAvB,MAAA;AAEMkC,QAAA;IAAA5C,YAAcL;IAAOO,gBAAkBQ;IAAM;AAAAuB,KAAA,MAAAtC;AAAAsC,KAAA,MAAAvB;AAAAuB,KAAA,MAAAW;QAAAA,MAAAX,EAAA;AAApDS,OAAOE;;CA7BT,MAAA,EAAA5C,YAAAE,mBAAuCwC;CAsCpC,IAAAE;AAAA,KAAAX,EAAA,QAAAjC,cAAAiC,EAAA,QAAA1C,SAAA0C,EAAA,QAAAG,gBAAAH,EAAA,QAAApC,WAAAoC,EAAA,QAAA3C,YAAA2C,EAAA,QAAAI,kBAAA;AAEqBO,QAAAxC,QAAA;GACtB,MAAAE,OAAaf,MAAKgC,MAAMP,IAAKZ,IAAI;AACjC,OAAI,CAACE,QAAD,CAAUD,eAAeC,KAAK,CAAA;GAGlC,MAAA6C,YAAkB,CADSnD,WAAUoB,IAAKhB,IAAI;GAgB9C,MAAAgD,OAAa,IAAInD,IAAID,WAAW;GAEhC,MAAAqD,SAAcC,GAAAC,UAAA;AACZ,QAAI,CAAClD,eAAeiD,EAAE,CAAA;AACtB,QAAIC,MAAOH,MAAI1B,IAAK4B,EAAClD,IAAK;QACrBgD,MAAI3B,OAAQ6B,EAAClD,IAAK;IACvB,MAAAU,YAAkBvB,MAAKwB,WAAWC,IAAKsC,EAAClD,IAAW,IAAjC,EAAiC;AACnD,SAAK,MAAAoD,MAAY1C,WAAS;KACxB,MAAAQ,QAAc/B,MAAKgC,MAAMP,IAAKwC,GAAG;AACjC,SAAIlC,MAAO+B,OAAM/B,OAAOiC,MAAM;;;AAIlCF,SAAM/C,MAAM6C,UAAU;GAOtB,IAAAM,YAAgBlE,MAAKmE,SAAS1C,IAAKZ,IAAI;AACvC,UAAOqD,WAAS;IACd,MAAAE,SAAepE,MAAKgC,MAAMP,IAAKyC,UAAU;AACzC,QAAI,CAACE,OAAQ;IACb,MAAAC,cAAkBrE,MAAKwB,WAAWC,IAAKyC,UAAgB,IAArC,EAAqC;IACvD,IAAAI,qBAAyB;IACzB,IAAAhD,cAAkB;AAClB,SAAK,MAAAiD,QAAYhD,aAAS;KACxB,MAAAiD,UAAcxE,MAAKgC,MAAMP,IAAKwC,KAAG;AACjC,SAAI,CAAClC,QAAO;AACZ,SAAI,CAACjB,eAAeiB,QAAM,CAAE;AAC5BT,mBAAcA;AACd,SAAI,CAACuC,KAAIhC,IAAKoC,KAAG,EAAA;AACfK,2BAAqBA;AACrB;;;AAGJ,QAAIhD,eAAAgD,sBAAqCxD,eAAesD,OAAO,CAC7DP,MAAI1B,IAAK+B,UAAU;QAEnBL,MAAI3B,OAAQgC,UAAU;AAExBA,gBAAYlE,MAAKmE,SAAS1C,IAAKyC,UAAU;;AAG3C,OAAI,CAACrB,aACHI,wBAAuBY,KAAK;AAG9B,OAAIvD,SAAO;IACT,MAAAmE,eAAqB,IAAI/D,IAAImD,KAAK;IAClC,MAAAa,4BAAkB,IAAIhE,KAAa;AAEnC,SAAK,MAAAiE,UAAc5E,SACjBmB,oBAAmBwC,QAAM1D,OAAOyE,cAAcC,UAAU;IAG1D,MAAAE,aAAmBtC,MAAKuC,KAAMJ,aAAa;IAC3C,MAAAK,UAAgBxC,MAAKuC,KAAMH,UAAU;IAKrC,MAAAnE,OAA8B;KAAAH,SACnBwD;KAAS7C;KAAAgE,cALqBH,WAAUI,KAC5CC,MAAOjF,MAAKgC,MAAMP,IAAKwD,EAAE,CAAC,CAAAC,OACvBC,MAAkC;KAGxBC,iBAGDN;KAClB;AAED,QAAIhC,iBACFxC,SAAQ;KAAAF,SAAWwE;KAAUvE,aAAeyE;KAAS,EAAEvE,KAAK;QAE5DD,SAAQsE,YAAYrE,KAAK;;;AAG9BmC,IAAA,MAAAjC;AAAAiC,IAAA,MAAA1C;AAAA0C,IAAA,MAAAG;AAAAH,IAAA,MAAApC;AAAAoC,IAAA,MAAA3C;AAAA2C,IAAA,MAAAI;AAAAJ,IAAA,MAAAW;OAAAA,MAAAX,EAAA;CAhGD,MAAA9B,SAAenB,SAAS4D,GAgGtB;CAAC,IAAAG;AAAA,KAAAd,EAAA,QAAAjC,cAAAiC,EAAA,QAAA/B,kBAAA+B,EAAA,QAAA9B,QAAA;AAEI4C,OAAA;GAAA/C;GAAAE;GAAAC;GAAsC;AAAA8B,IAAA,MAAAjC;AAAAiC,IAAA,MAAA/B;AAAA+B,IAAA,MAAA9B;AAAA8B,IAAA,MAAAc;OAAAA,MAAAd,EAAA;AAAA,QAAtCc;;AAxLF,SAAA2B,MAAAE,KAAA;AAAA,QAuKuC,CAAC,CAACtB"}
+{"version":3,"file":"use-checkbox-tree.js","names":["useState","useEvent","Key","TreeIndex","CubeTreeNodeData","TreeOnCheckInfo","UseCheckboxTreeOptions","treeData","index","isCheckable","defaultCheckedKeys","checkedKeys","checked","halfChecked","onCheck","info","CheckboxTree","checkedSet","Set","halfCheckedSet","toggle","key","isNodeEligible","node","isDisabled","isCheckboxDisabled","deriveCheckedState","half","allChecked","anyChecked","anyEligible","childKeys","childrenOf","get","length","eligible","isChecked","has","childKey","child","byKey","r","delete","add","normalizeControlledChecked","controlled","Array","isArray","resolveCheckedSets","sourceChecked","ownHalfChecked","Pick","root","useCheckboxTree","opts","$","_c","isControlled","wantsObjectShape","t0","uncontrolledChecked","setUncontrolledChecked","t1","isCurrentlyChecked","willCheck","next","apply","n","value","ck","parentKey","parentOf","parent","childKeys_0","allEligibleChecked","ck_0","child_0","finalChecked","finalHalf","checkedArr","from","halfArr","checkedNodes","map","k","filter","_temp","halfCheckedKeys","t2","n_0"],"sources":["../../../../src/components/content/Tree/use-checkbox-tree.ts"],"sourcesContent":["import { 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 * 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 */\nfunction resolveCheckedSets({\n  isCheckable,\n  sourceChecked,\n  ownHalfChecked,\n  treeData,\n  index,\n}: {\n  isCheckable: boolean;\n  sourceChecked: Set<string>;\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  ownHalfChecked: Set<string> | null;\n  treeData: CubeTreeNodeData[];\n  index: TreeIndex;\n}): Pick<CheckboxTree, 'checkedSet' | 'halfCheckedSet'> {\n  if (!isCheckable) {\n    return {\n      checkedSet: new Set<string>(),\n      halfCheckedSet: new Set<string>(),\n    };\n  }\n\n  if (ownHalfChecked) {\n    return {\n      checkedSet: new Set(sourceChecked),\n      halfCheckedSet: new Set(ownHalfChecked),\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\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  /** Normalize the controlled `checkedKeys` prop into `Set` instances. */\n  const controlled = normalizeControlledChecked(checkedKeys);\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  const { checkedSet, halfCheckedSet } = resolveCheckedSets({\n    isCheckable,\n    sourceChecked,\n    ownHalfChecked:\n      isControlled && wantsObjectShape ? controlled!.halfChecked : null,\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 derivation 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,SAASsB,eAAeC,MAA6C;AACnE,KAAI,CAACA,KAAM,QAAO;AAClB,KAAIA,KAAKC,WAAY,QAAO;AAC5B,KAAID,KAAKE,mBAAoB,QAAO;AACpC,KAAIF,KAAKd,gBAAgB,MAAO,QAAO;AACvC,QAAO;;;;;;AAOT,SAASiB,mBACPH,MACAf,OACAI,SACAe,MACoE;CACpE,MAAMI,YAAYvB,MAAMwB,WAAWC,IAAIV,KAAKF,IAAI,IAAI,EAAE;AAEtD,KAAIU,UAAUG,WAAW,GAAG;EAC1B,MAAMC,WAAWb,eAAeC,KAAK;EACrC,MAAMa,YAAYxB,QAAQyB,IAAId,KAAKF,IAAI;AACvC,SAAO;GACLO,YAAY,CAACO,YAAYC;GACzBP,YAAYO;GACZN,aAAaK;GACd;;CAGH,IAAIP,aAAa;CACjB,IAAIC,aAAa;CACjB,IAAIC,cAAc;AAElB,MAAK,MAAMQ,YAAYP,WAAW;EAChC,MAAMQ,QAAQ/B,MAAMgC,MAAMP,IAAIK,SAAS;AACvC,MAAI,CAACC,MAAO;EACZ,MAAME,IAAIf,mBAAmBa,OAAO/B,OAAOI,SAASe,KAAK;AACzD,MAAIc,EAAEX,YAAaA,eAAc;AACjC,MAAI,CAACW,EAAEb,WAAYA,cAAa;AAChC,MAAIa,EAAEZ,WAAYA,cAAa;;CAGjC,MAAMM,WAAWb,eAAeC,KAAK;AAErC,KAAI,CAACO,YAGHH,MAAKe,OAAOnB,KAAKF,IAAI;UACZO,YAAY;AACrBhB,UAAQ+B,IAAIpB,KAAKF,IAAI;AACrBM,OAAKe,OAAOnB,KAAKF,IAAI;YACZQ,YAAY;AACrBjB,UAAQ8B,OAAOnB,KAAKF,IAAI;AACxBM,OAAKgB,IAAIpB,KAAKF,IAAI;QACb;AACLT,UAAQ8B,OAAOnB,KAAKF,IAAI;AACxBM,OAAKe,OAAOnB,KAAKF,IAAI;;AAGvB,QAAO;EACLO,YAAY,CAACO,WAAWP,aAAahB,QAAQyB,IAAId,KAAKF,IAAI,IAAIO;EAC9DC,YAAYA,cAAcjB,QAAQyB,IAAId,KAAKF,IAAI;EAC/CS,aAAaA,eAAeK;EAC7B;;AAGH,SAASS,2BACPC,YAC2D;AAC3D,KAAIA,cAAc,KAAM,QAAO;AAC/B,KAAIC,MAAMC,QAAQF,WAAW,CAC3B,QAAO;EACLjC,SAAS,IAAIM,IAAI2B,WAAW;EAC5BhC,6BAAa,IAAIK,KAAI;EACtB;AAEH,QAAO;EACLN,SAAS,IAAIM,IAAI2B,WAAWjC,WAAW,EAAE,CAAC;EAC1CC,aAAa,IAAIK,IAAI2B,WAAWhC,eAAe,EAAE,CAAA;EAClD;;;;;;;;;;;;;;;AAgBH,SAASmC,mBAAmB,EAC1BvC,aACAwC,eACAC,gBACA3C,UACAC,SAcsD;AACtD,KAAI,CAACC,YACH,QAAO;EACLQ,4BAAY,IAAIC,KAAa;EAC7BC,gCAAgB,IAAID,KAAY;EACjC;AAGH,KAAIgC,eACF,QAAO;EACLjC,YAAY,IAAIC,IAAI+B,cAAc;EAClC9B,gBAAgB,IAAID,IAAIgC,eAAc;EACvC;CAGH,MAAMtC,UAAU,IAAIM,IAAI+B,cAAc;CACtC,MAAMtB,uBAAO,IAAIT,KAAa;AAE9B,MAAK,MAAMkC,QAAQ7C,SACjBmB,oBAAmB0B,MAAM5C,OAAOI,SAASe,KAAK;AAGhD,QAAO;EAAEV,YAAYL;EAASO,gBAAgBQ;EAAM;;;;;;;;;;;;;AActD,SAAO0B,gBAAAC,MAAA;CAAA,MAAAC,IAAAC,EAAA,GAAA;CACL,MAAA,EAAAjD,UAAAC,OAAAC,aAAAC,oBAAAC,aAAAG,YAOIwC;CAGJ,MAAAT,aAAmBD,2BAA2BjC,YAAY;CAC1D,MAAA8C,eAAqBZ,cAAc;CACnC,MAAAa,mBAAyB/C,eAAe,QAAf,CAAwBmC,MAAKC,QAASpC,YAAY;CAAC,IAAAgD;AAAA,KAAAJ,EAAA,OAAA7C,oBAAA;AAG1EiD,aAAM,IAAIzC,IAAIR,sBAAA,EAAwB,CAAC;AAAA6C,IAAA,KAAA7C;AAAA6C,IAAA,KAAAI;OAAAA,MAAAJ,EAAA;CADzC,MAAA,CAAAK,qBAAAC,0BAAsD7D,SACpD2D,GACD;CAMD,MAAA,EAAA1C,YAAAE,mBAAuC6B,mBAAmB;EAAAvC;EAAAwC,eAJpCQ,eAClBZ,WAAUjC,UADQgD;EAIoCV,gBAItDO,gBAAAC,mBAAmCb,WAAUhC,cAA7C;EAAiEN;EAAAC;EAGpE,CAAC;CAAC,IAAAsD;AAAA,KAAAP,EAAA,OAAAtC,cAAAsC,EAAA,OAAA/C,SAAA+C,EAAA,OAAAE,gBAAAF,EAAA,OAAAzC,WAAAyC,EAAA,OAAAM,0BAAAN,EAAA,OAAAhD,YAAAgD,EAAA,OAAAG,kBAAA;AAEqBI,QAAAzC,QAAA;GACtB,MAAAE,OAAaf,MAAKgC,MAAMP,IAAKZ,IAAI;AACjC,OAAI,CAACE,QAAD,CAAUD,eAAeC,KAAK,CAAA;GAGlC,MAAAyC,YAAkB,CADS/C,WAAUoB,IAAKhB,IAAI;GAgB9C,MAAA4C,OAAa,IAAI/C,IAAID,WAAW;GAEhC,MAAAiD,SAAcC,GAAAC,UAAA;AACZ,QAAI,CAAC9C,eAAe6C,EAAE,CAAA;AACtB,QAAIC,MAAOH,MAAItB,IAAKwB,EAAC9C,IAAK;QACrB4C,MAAIvB,OAAQyB,EAAC9C,IAAK;IACvB,MAAAU,YAAkBvB,MAAKwB,WAAWC,IAAKkC,EAAC9C,IAAW,IAAjC,EAAiC;AACnD,SAAK,MAAAgD,MAAYtC,WAAS;KACxB,MAAAQ,QAAc/B,MAAKgC,MAAMP,IAAKoC,GAAG;AACjC,SAAI9B,MAAO2B,OAAM3B,OAAO6B,MAAM;;;AAIlCF,SAAM3C,MAAMyC,UAAU;GAOtB,IAAAM,YAAgB9D,MAAK+D,SAAStC,IAAKZ,IAAI;AACvC,UAAOiD,WAAS;IACd,MAAAE,SAAehE,MAAKgC,MAAMP,IAAKqC,UAAU;AACzC,QAAI,CAACE,OAAQ;IACb,MAAAC,cAAkBjE,MAAKwB,WAAWC,IAAKqC,UAAgB,IAArC,EAAqC;IACvD,IAAAI,qBAAyB;IACzB,IAAA5C,cAAkB;AAClB,SAAK,MAAA6C,QAAY5C,aAAS;KACxB,MAAA6C,UAAcpE,MAAKgC,MAAMP,IAAKoC,KAAG;AACjC,SAAI,CAAC9B,QAAO;AACZ,SAAI,CAACjB,eAAeiB,QAAM,CAAE;AAC5BT,mBAAcA;AACd,SAAI,CAACmC,KAAI5B,IAAKgC,KAAG,EAAA;AACfK,2BAAqBA;AACrB;;;AAGJ,QAAI5C,eAAA4C,sBAAqCpD,eAAekD,OAAO,CAC7DP,MAAItB,IAAK2B,UAAU;QAEnBL,MAAIvB,OAAQ4B,UAAU;AAExBA,gBAAY9D,MAAK+D,SAAStC,IAAKqC,UAAU;;AAG3C,OAAI,CAACb,aACHI,wBAAuBI,KAAK;AAG9B,OAAInD,SAAO;IACT,MAAA+D,eAAqB,IAAI3D,IAAI+C,KAAK;IAClC,MAAAa,4BAAkB,IAAI5D,KAAa;AAEnC,SAAK,MAAAkC,QAAc7C,SACjBmB,oBAAmB0B,MAAM5C,OAAOqE,cAAcC,UAAU;IAG1D,MAAAC,aAAmBjC,MAAKkC,KAAMH,aAAa;IAC3C,MAAAI,UAAgBnC,MAAKkC,KAAMF,UAAU;IAKrC,MAAA/D,OAA8B;KAAAH,SACnBoD;KAASzC;KAAA2D,cALqBH,WAAUI,KAC5CC,MAAO5E,MAAKgC,MAAMP,IAAKmD,EAAE,CAAC,CAAAC,OACvBC,MAAkC;KAGxBC,iBAGDN;KAClB;AAED,QAAIvB,iBACF5C,SAAQ;KAAAF,SAAWmE;KAAUlE,aAAeoE;KAAS,EAAElE,KAAK;QAE5DD,SAAQiE,YAAYhE,KAAK;;;AAG9BwC,IAAA,KAAAtC;AAAAsC,IAAA,KAAA/C;AAAA+C,IAAA,KAAAE;AAAAF,IAAA,KAAAzC;AAAAyC,IAAA,KAAAM;AAAAN,IAAA,KAAAhD;AAAAgD,IAAA,KAAAG;AAAAH,IAAA,KAAAO;OAAAA,MAAAP,EAAA;CAhGD,MAAAnC,SAAenB,SAAS6D,GAgGtB;CAAC,IAAA0B;AAAA,KAAAjC,EAAA,QAAAtC,cAAAsC,EAAA,QAAApC,kBAAAoC,EAAA,QAAAnC,QAAA;AAEIoE,OAAA;GAAAvE;GAAAE;GAAAC;GAAsC;AAAAmC,IAAA,MAAAtC;AAAAsC,IAAA,MAAApC;AAAAoC,IAAA,MAAAnC;AAAAmC,IAAA,MAAAiC;OAAAA,MAAAjC,EAAA;AAAA,QAAtCiC;;AAlIF,SAAAF,MAAAG,KAAA;AAAA,QAiHuC,CAAC,CAACtB"}

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

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-0b79a39 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c02e70f | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { isDevEnvOrTest } from "../../../utils/is-dev-env.js";
 import { c } from "react-compiler-runtime";

package/dist/components/content/highlightText.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-0b79a39 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c02e70f | 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.0.0-canary-0b79a39 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c02e70f | Cube Dev Team */
 import { TooltipProvider } from "../overlays/Tooltip/TooltipProvider.js";
 import { c } from "react-compiler-runtime";
 import { useEffect, useRef, useState } from "react";
@@ -34,30 +34,54 @@ function queueOverflowCheck(check) {
 	if (!pendingOverflowChecks.size) queueMicrotask(runOverflowChecks);
 	pendingOverflowChecks.add(check);
 }
+/**
+* Whether the tooltip detects label overflow on its own. Overflow detection
+* measures text, so it needs a string label.
+*/
+function isAutoTooltip(tooltip, children) {
+	if (typeof children !== "string") return false;
+	if (tooltip === true) return true;
+	if (typeof tooltip === "object") {
+		if (tooltip.title) return tooltip.auto === true;
+		return tooltip.auto !== void 0 ? !!tooltip.auto : true;
+	}
+	return false;
+}
+/**
+* The `TooltipProvider` props a tooltip resolves to, or `null` when no tooltip
+* is rendered at all.
+*/
+function resolveTooltip({ tooltip, children, labelProps, isDynamicLabel, isLabelOverflowed }) {
+	if (!tooltip) return null;
+	if (typeof tooltip === "string") return { title: tooltip };
+	const hasAutoContent = !!(children || labelProps) && (isLabelOverflowed || isDynamicLabel);
+	if (tooltip === true) {
+		if (!hasAutoContent) return null;
+		return {
+			title: children,
+			isDisabled: !isLabelOverflowed && isDynamicLabel
+		};
+	}
+	const { auto, ...tooltipProps } = tooltip;
+	if (tooltipProps.title && auto !== true) return tooltipProps;
+	if (!hasAutoContent) return null;
+	return {
+		title: tooltipProps.title ?? children,
+		isDisabled: !isLabelOverflowed && isDynamicLabel && tooltipProps.isDisabled !== true,
+		...tooltipProps
+	};
+}
 function useAutoTooltip(t0) {
-	const $ = c(36);
+	const $ = c(33);
 	const { tooltip, children, labelProps, isDynamicLabel: t1, labelRef: labelRefOption } = t0;
 	const isDynamicLabel = t1 === void 0 ? false : t1;
 	let t2;
-	bb0: {
-		if (typeof children !== "string") {
-			t2 = false;
-			break bb0;
-		}
-		if (tooltip === true) {
-			t2 = true;
-			break bb0;
-		}
-		if (typeof tooltip === "object") {
-			if (tooltip.title) {
-				t2 = tooltip.auto === true;
-				break bb0;
-			}
-			t2 = !!(tooltip.auto !== void 0 ? tooltip.auto : true);
-			break bb0;
-		}
-		t2 = false;
-	}
+	if ($[0] !== children || $[1] !== tooltip) {
+		t2 = isAutoTooltip(tooltip, children);
+		$[0] = children;
+		$[1] = tooltip;
+		$[2] = t2;
+	} else t2 = $[2];
 	const isAutoTooltipEnabled = t2;
 	const externalLabelRef = labelProps?.ref;
 	const [isLabelOverflowed, setIsLabelOverflowed] = useState(false);
@@ -65,36 +89,36 @@ function useAutoTooltip(t0) {
 	const resizeObserverRef = useRef(null);
 	const verdictRef = useRef(false);
 	let t3;
-	if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+	if ($[3] === Symbol.for("react.memo_cache_sentinel")) {
 		t3 = (value) => {
 			if (verdictRef.current === value) return;
 			verdictRef.current = value;
 			setIsLabelOverflowed(value);
 		};
-		$[0] = t3;
-	} else t3 = $[0];
+		$[3] = t3;
+	} else t3 = $[3];
 	const setVerdict = t3;
 	let t4;
-	if ($[1] === Symbol.for("react.memo_cache_sentinel")) {
+	if ($[4] === Symbol.for("react.memo_cache_sentinel")) {
 		t4 = () => {
 			const label = elementRef.current;
 			if (!label) return;
 			setVerdict(label.scrollWidth > label.clientWidth);
 		};
-		$[1] = t4;
-	} else t4 = $[1];
+		$[4] = t4;
+	} else t4 = $[4];
 	const checkLabelOverflow = t4;
 	let t5;
-	if ($[2] === Symbol.for("react.memo_cache_sentinel")) {
+	if ($[5] === Symbol.for("react.memo_cache_sentinel")) {
 		t5 = () => {
 			queueOverflowCheck(checkLabelOverflow);
 		};
-		$[2] = t5;
-	} else t5 = $[2];
+		$[5] = t5;
+	} else t5 = $[5];
 	const scheduleLabelOverflowCheck = t5;
 	let t6;
 	let t7;
-	if ($[3] !== isAutoTooltipEnabled) {
+	if ($[6] !== isAutoTooltipEnabled) {
 		t6 = () => {
 			if (isAutoTooltipEnabled) {
 				scheduleLabelOverflowCheck();
@@ -107,16 +131,16 @@ function useAutoTooltip(t0) {
 			scheduleLabelOverflowCheck,
 			setVerdict
 		];
-		$[3] = isAutoTooltipEnabled;
-		$[4] = t6;
-		$[5] = t7;
+		$[6] = isAutoTooltipEnabled;
+		$[7] = t6;
+		$[8] = t7;
 	} else {
-		t6 = $[4];
-		t7 = $[5];
+		t6 = $[7];
+		t7 = $[8];
 	}
 	useEffect(t6, t7);
 	let t8;
-	if ($[6] !== externalLabelRef || $[7] !== isAutoTooltipEnabled || $[8] !== labelRefOption) {
+	if ($[9] !== externalLabelRef || $[10] !== isAutoTooltipEnabled || $[11] !== labelRefOption) {
 		t8 = (element) => {
 			assignRef(externalLabelRef, element);
 			assignRef(labelRefOption, element);
@@ -139,101 +163,45 @@ function useAutoTooltip(t0) {
 			resizeObserverRef.current = obs;
 			obs.observe(element);
 		};
-		$[6] = externalLabelRef;
-		$[7] = isAutoTooltipEnabled;
-		$[8] = labelRefOption;
-		$[9] = t8;
-	} else t8 = $[9];
+		$[9] = externalLabelRef;
+		$[10] = isAutoTooltipEnabled;
+		$[11] = labelRefOption;
+		$[12] = t8;
+	} else t8 = $[12];
 	const handleLabelElementRef = t8;
 	let t9;
-	if ($[10] !== labelProps) {
+	if ($[13] !== labelProps) {
 		t9 = labelProps || {};
-		$[10] = labelProps;
-		$[11] = t9;
-	} else t9 = $[11];
-	let props;
-	if ($[12] !== t9) {
-		props = { ...t9 };
-		delete props.ref;
-		$[12] = t9;
-		$[13] = props;
-	} else props = $[13];
-	const finalLabelProps = props;
+		$[13] = labelProps;
+		$[14] = t9;
+	} else t9 = $[14];
+	let finalLabelProps;
+	if ($[15] !== t9) {
+		const { ref: _labelPropsRef, ...t10 } = t9;
+		finalLabelProps = t10;
+		$[15] = t9;
+		$[16] = finalLabelProps;
+	} else finalLabelProps = $[16];
 	let t10;
-	bb1: {
-		if (!tooltip) {
-			t10 = null;
-			break bb1;
-		}
-		if (typeof tooltip === "string") {
-			let t11;
-			if ($[14] !== tooltip) {
-				t11 = { title: tooltip };
-				$[14] = tooltip;
-				$[15] = t11;
-			} else t11 = $[15];
-			t10 = t11;
-			break bb1;
-		}
-		const hasAutoContent = !!(children || labelProps) && (isLabelOverflowed || isDynamicLabel);
-		if (tooltip === true) {
-			if (!hasAutoContent) {
-				t10 = null;
-				break bb1;
-			}
-			const t11 = !isLabelOverflowed && isDynamicLabel;
-			let t12;
-			if ($[16] !== children || $[17] !== t11) {
-				t12 = {
-					title: children,
-					isDisabled: t11
-				};
-				$[16] = children;
-				$[17] = t11;
-				$[18] = t12;
-			} else t12 = $[18];
-			t10 = t12;
-			break bb1;
-		}
-		let auto;
-		let tooltipProps;
-		if ($[19] !== tooltip) {
-			({auto, ...tooltipProps} = tooltip);
-			$[19] = tooltip;
-			$[20] = auto;
-			$[21] = tooltipProps;
-		} else {
-			auto = $[20];
-			tooltipProps = $[21];
-		}
-		if (tooltipProps.title && auto !== true) {
-			t10 = tooltipProps;
-			break bb1;
-		}
-		if (!hasAutoContent) {
-			t10 = null;
-			break bb1;
-		}
-		const t11 = tooltipProps.title ?? children;
-		const t12 = !isLabelOverflowed && isDynamicLabel && tooltipProps.isDisabled !== true;
-		let t13;
-		if ($[22] !== t11 || $[23] !== t12 || $[24] !== tooltipProps) {
-			t13 = {
-				title: t11,
-				isDisabled: t12,
-				...tooltipProps
-			};
-			$[22] = t11;
-			$[23] = t12;
-			$[24] = tooltipProps;
-			$[25] = t13;
-		} else t13 = $[25];
-		t10 = t13;
-	}
+	if ($[17] !== children || $[18] !== isDynamicLabel || $[19] !== isLabelOverflowed || $[20] !== labelProps || $[21] !== tooltip) {
+		t10 = resolveTooltip({
+			tooltip,
+			children,
+			labelProps,
+			isDynamicLabel,
+			isLabelOverflowed
+		});
+		$[17] = children;
+		$[18] = isDynamicLabel;
+		$[19] = isLabelOverflowed;
+		$[20] = labelProps;
+		$[21] = tooltip;
+		$[22] = t10;
+	} else t10 = $[22];
 	const resolvedTooltip = t10;
 	const isTooltipActive = !!resolvedTooltip && resolvedTooltip.isDisabled !== true;
 	let t11;
-	if ($[26] !== resolvedTooltip) {
+	if ($[23] !== resolvedTooltip) {
 		t11 = (renderElement, defaultTooltipPlacement) => {
 			if (!resolvedTooltip) return renderElement();
 			return /* @__PURE__ */ jsx(TooltipProvider, {
@@ -242,13 +210,13 @@ function useAutoTooltip(t0) {
 				children: (triggerProps, ref) => renderElement(triggerProps, ref)
 			});
 		};
-		$[26] = resolvedTooltip;
-		$[27] = t11;
-	} else t11 = $[27];
+		$[23] = resolvedTooltip;
+		$[24] = t11;
+	} else t11 = $[24];
 	const renderWithTooltip = t11;
 	const t12 = !!tooltip;
 	let t13;
-	if ($[28] !== finalLabelProps || $[29] !== handleLabelElementRef || $[30] !== isAutoTooltipEnabled || $[31] !== isLabelOverflowed || $[32] !== isTooltipActive || $[33] !== renderWithTooltip || $[34] !== t12) {
+	if ($[25] !== finalLabelProps || $[26] !== handleLabelElementRef || $[27] !== isAutoTooltipEnabled || $[28] !== isLabelOverflowed || $[29] !== isTooltipActive || $[30] !== renderWithTooltip || $[31] !== t12) {
 		t13 = {
 			labelRef: handleLabelElementRef,
 			labelProps: finalLabelProps,
@@ -258,15 +226,15 @@ function useAutoTooltip(t0) {
 			isTooltipActive,
 			renderWithTooltip
 		};
-		$[28] = finalLabelProps;
-		$[29] = handleLabelElementRef;
-		$[30] = isAutoTooltipEnabled;
-		$[31] = isLabelOverflowed;
-		$[32] = isTooltipActive;
-		$[33] = renderWithTooltip;
-		$[34] = t12;
-		$[35] = t13;
-	} else t13 = $[35];
+		$[25] = finalLabelProps;
+		$[26] = handleLabelElementRef;
+		$[27] = isAutoTooltipEnabled;
+		$[28] = isLabelOverflowed;
+		$[29] = isTooltipActive;
+		$[30] = renderWithTooltip;
+		$[31] = t12;
+		$[32] = t13;
+	} else t13 = $[32];
 	return t13;
 }