@mantine/core 9.0.1 → 9.1.0

package/cjs/components/Tree/flatten-tree-data/flatten-tree-data.cjs

@@ -0,0 +1,28 @@
+"use client";
+//#region packages/@mantine/core/src/components/Tree/flatten-tree-data/flatten-tree-data.ts
+function flattenTreeDataTo(acc, data, expandedState, parent, level) {
+	for (let i = 0; i < data.length; i++) {
+		const node = data[i];
+		const hasLoadedChildren = Array.isArray(node.children);
+		const hasAsyncChildren = !!node.hasChildren && !hasLoadedChildren;
+		const hasChildren = hasLoadedChildren || hasAsyncChildren;
+		const expanded = expandedState[node.value] || false;
+		acc.push({
+			node,
+			level,
+			parent,
+			hasChildren,
+			expanded
+		});
+		if (expanded && hasLoadedChildren) flattenTreeDataTo(acc, node.children, expandedState, node.value, level + 1);
+	}
+}
+function flattenTreeData(data, expandedState) {
+	const result = [];
+	flattenTreeDataTo(result, data, expandedState, null, 1);
+	return result;
+}
+//#endregion
+exports.flattenTreeData = flattenTreeData;
+
+//# sourceMappingURL=flatten-tree-data.cjs.map

package/cjs/components/Tree/flatten-tree-data/flatten-tree-data.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten-tree-data.cjs","names":[],"sources":["../../../../src/components/Tree/flatten-tree-data/flatten-tree-data.ts"],"sourcesContent":["import type { TreeNodeData } from '../Tree';\nimport type { TreeExpandedState } from '../use-tree';\n\nexport interface FlattenedTreeNodeData {\n  /** Node data from tree data */\n  node: TreeNodeData;\n\n  /** Nesting level of the node, starts at 1 */\n  level: number;\n\n  /** Value of the parent node, `null` for root nodes */\n  parent: string | null;\n\n  /** Whether the node has children */\n  hasChildren: boolean;\n\n  /** Whether the node is expanded */\n  expanded: boolean;\n}\n\nfunction flattenTreeDataTo(\n  acc: FlattenedTreeNodeData[],\n  data: TreeNodeData[],\n  expandedState: TreeExpandedState,\n  parent: string | null,\n  level: number\n): void {\n  for (let i = 0; i < data.length; i++) {\n    const node = data[i];\n    const hasLoadedChildren = Array.isArray(node.children);\n    const hasAsyncChildren = !!node.hasChildren && !hasLoadedChildren;\n    const hasChildren = hasLoadedChildren || hasAsyncChildren;\n    const expanded = expandedState[node.value] || false;\n\n    acc.push({ node, level, parent, hasChildren, expanded });\n\n    if (expanded && hasLoadedChildren) {\n      flattenTreeDataTo(acc, node.children!, expandedState, node.value, level + 1);\n    }\n  }\n}\n\nexport function flattenTreeData(\n  data: TreeNodeData[],\n  expandedState: TreeExpandedState\n): FlattenedTreeNodeData[] {\n  const result: FlattenedTreeNodeData[] = [];\n  flattenTreeDataTo(result, data, expandedState, null, 1);\n  return result;\n}\n"],"mappings":";;AAoBA,SAAS,kBACP,KACA,MACA,eACA,QACA,OACM;AACN,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,OAAO,KAAK;EAClB,MAAM,oBAAoB,MAAM,QAAQ,KAAK,SAAS;EACtD,MAAM,mBAAmB,CAAC,CAAC,KAAK,eAAe,CAAC;EAChD,MAAM,cAAc,qBAAqB;EACzC,MAAM,WAAW,cAAc,KAAK,UAAU;AAE9C,MAAI,KAAK;GAAE;GAAM;GAAO;GAAQ;GAAa;GAAU,CAAC;AAExD,MAAI,YAAY,kBACd,mBAAkB,KAAK,KAAK,UAAW,eAAe,KAAK,OAAO,QAAQ,EAAE;;;AAKlF,SAAgB,gBACd,MACA,eACyB;CACzB,MAAM,SAAkC,EAAE;AAC1C,mBAAkB,QAAQ,MAAM,eAAe,MAAM,EAAE;AACvD,QAAO"}

package/cjs/components/Tree/get-children-nodes-values/get-children-nodes-values.cjs

@@ -28,6 +28,7 @@ function getAllChildrenNodes(data) {
 	}, []);
 }
 //#endregion
+exports.findTreeNode = findTreeNode;
 exports.getAllChildrenNodes = getAllChildrenNodes;
 exports.getChildrenNodesValues = getChildrenNodesValues;
 

package/cjs/components/Tree/merge-async-children/merge-async-children.cjs

@@ -0,0 +1,32 @@
+"use client";
+//#region packages/@mantine/core/src/components/Tree/merge-async-children/merge-async-children.ts
+function mergeAsyncChildren(data, parentValue, children) {
+	let changed = false;
+	const result = data.map((node) => {
+		if (node.value === parentValue) {
+			changed = true;
+			const merged = {
+				...node,
+				children
+			};
+			delete merged.hasChildren;
+			return merged;
+		}
+		if (Array.isArray(node.children)) {
+			const updatedChildren = mergeAsyncChildren(node.children, parentValue, children);
+			if (updatedChildren !== node.children) {
+				changed = true;
+				return {
+					...node,
+					children: updatedChildren
+				};
+			}
+		}
+		return node;
+	});
+	return changed ? result : data;
+}
+//#endregion
+exports.mergeAsyncChildren = mergeAsyncChildren;
+
+//# sourceMappingURL=merge-async-children.cjs.map

package/cjs/components/Tree/merge-async-children/merge-async-children.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-async-children.cjs","names":[],"sources":["../../../../src/components/Tree/merge-async-children/merge-async-children.ts"],"sourcesContent":["import type { TreeNodeData } from '../Tree';\n\nexport function mergeAsyncChildren(\n  data: TreeNodeData[],\n  parentValue: string,\n  children: TreeNodeData[]\n): TreeNodeData[] {\n  let changed = false;\n\n  const result = data.map((node) => {\n    if (node.value === parentValue) {\n      changed = true;\n      const merged: TreeNodeData = { ...node, children };\n      delete merged.hasChildren;\n      return merged;\n    }\n\n    if (Array.isArray(node.children)) {\n      const updatedChildren = mergeAsyncChildren(node.children, parentValue, children);\n      if (updatedChildren !== node.children) {\n        changed = true;\n        return { ...node, children: updatedChildren };\n      }\n    }\n\n    return node;\n  });\n\n  return changed ? result : data;\n}\n"],"mappings":";;AAEA,SAAgB,mBACd,MACA,aACA,UACgB;CAChB,IAAI,UAAU;CAEd,MAAM,SAAS,KAAK,KAAK,SAAS;AAChC,MAAI,KAAK,UAAU,aAAa;AAC9B,aAAU;GACV,MAAM,SAAuB;IAAE,GAAG;IAAM;IAAU;AAClD,UAAO,OAAO;AACd,UAAO;;AAGT,MAAI,MAAM,QAAQ,KAAK,SAAS,EAAE;GAChC,MAAM,kBAAkB,mBAAmB,KAAK,UAAU,aAAa,SAAS;AAChF,OAAI,oBAAoB,KAAK,UAAU;AACrC,cAAU;AACV,WAAO;KAAE,GAAG;KAAM,UAAU;KAAiB;;;AAIjD,SAAO;GACP;AAEF,QAAO,UAAU,SAAS"}

package/cjs/components/Tree/move-tree-node/move-tree-node.cjs

@@ -0,0 +1,78 @@
+"use client";
+const require_get_children_nodes_values = require("../get-children-nodes-values/get-children-nodes-values.cjs");
+//#region packages/@mantine/core/src/components/Tree/move-tree-node/move-tree-node.ts
+function isDescendant(data, ancestorValue, value) {
+	const ancestor = require_get_children_nodes_values.findTreeNode(ancestorValue, data);
+	if (!ancestor || !ancestor.children) return false;
+	function check(nodes) {
+		for (const node of nodes) {
+			if (node.value === value) return true;
+			if (node.children && check(node.children)) return true;
+		}
+		return false;
+	}
+	return check(ancestor.children);
+}
+function removeNode(data, value) {
+	let removed = null;
+	return {
+		data: data.reduce((acc, node) => {
+			if (node.value === value) {
+				removed = { ...node };
+				return acc;
+			}
+			if (node.children) {
+				const result = removeNode(node.children, value);
+				if (result.removed) {
+					removed = result.removed;
+					acc.push({
+						...node,
+						children: result.data
+					});
+				} else acc.push(node);
+			} else acc.push(node);
+			return acc;
+		}, []),
+		removed
+	};
+}
+function insertNode(data, node, targetValue, position) {
+	if (position === "inside") return data.map((item) => {
+		if (item.value === targetValue) return {
+			...item,
+			children: [...item.children || [], node]
+		};
+		if (item.children) return {
+			...item,
+			children: insertNode(item.children, node, targetValue, position)
+		};
+		return item;
+	});
+	const targetIndex = data.findIndex((item) => item.value === targetValue);
+	if (targetIndex !== -1) {
+		const result = [...data];
+		const insertIndex = position === "before" ? targetIndex : targetIndex + 1;
+		result.splice(insertIndex, 0, node);
+		return result;
+	}
+	return data.map((item) => {
+		if (item.children) return {
+			...item,
+			children: insertNode(item.children, node, targetValue, position)
+		};
+		return item;
+	});
+}
+function moveTreeNode(data, payload) {
+	const { draggedNode, targetNode, position } = payload;
+	if (draggedNode === targetNode) return data;
+	if (!require_get_children_nodes_values.findTreeNode(targetNode, data)) return data;
+	if (isDescendant(data, draggedNode, targetNode)) return data;
+	const { data: dataWithout, removed } = removeNode(data, draggedNode);
+	if (!removed) return data;
+	return insertNode(dataWithout, removed, targetNode, position);
+}
+//#endregion
+exports.moveTreeNode = moveTreeNode;
+
+//# sourceMappingURL=move-tree-node.cjs.map

package/cjs/components/Tree/move-tree-node/move-tree-node.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"move-tree-node.cjs","names":["findTreeNode"],"sources":["../../../../src/components/Tree/move-tree-node/move-tree-node.ts"],"sourcesContent":["import { findTreeNode } from '../get-children-nodes-values/get-children-nodes-values';\nimport type { TreeNodeData } from '../Tree';\n\nexport type TreeDragDropPosition = 'before' | 'after' | 'inside';\n\nexport interface TreeDragDropPayload {\n  /** Value of the dragged node */\n  draggedNode: string;\n\n  /** Value of the target node */\n  targetNode: string;\n\n  /** Position relative to the target node */\n  position: TreeDragDropPosition;\n}\n\nfunction isDescendant(data: TreeNodeData[], ancestorValue: string, value: string): boolean {\n  const ancestor = findTreeNode(ancestorValue, data);\n  if (!ancestor || !ancestor.children) {\n    return false;\n  }\n\n  function check(nodes: TreeNodeData[]): boolean {\n    for (const node of nodes) {\n      if (node.value === value) {\n        return true;\n      }\n\n      if (node.children && check(node.children)) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  return check(ancestor.children);\n}\n\nfunction removeNode(\n  data: TreeNodeData[],\n  value: string\n): { data: TreeNodeData[]; removed: TreeNodeData | null } {\n  let removed: TreeNodeData | null = null;\n\n  const newData = data.reduce<TreeNodeData[]>((acc, node) => {\n    if (node.value === value) {\n      removed = { ...node };\n      return acc;\n    }\n\n    if (node.children) {\n      const result = removeNode(node.children, value);\n      if (result.removed) {\n        removed = result.removed;\n        acc.push({ ...node, children: result.data });\n      } else {\n        acc.push(node);\n      }\n    } else {\n      acc.push(node);\n    }\n\n    return acc;\n  }, []);\n\n  return { data: newData, removed };\n}\n\nfunction insertNode(\n  data: TreeNodeData[],\n  node: TreeNodeData,\n  targetValue: string,\n  position: TreeDragDropPosition\n): TreeNodeData[] {\n  if (position === 'inside') {\n    return data.map((item) => {\n      if (item.value === targetValue) {\n        return { ...item, children: [...(item.children || []), node] };\n      }\n\n      if (item.children) {\n        return { ...item, children: insertNode(item.children, node, targetValue, position) };\n      }\n\n      return item;\n    });\n  }\n\n  const targetIndex = data.findIndex((item) => item.value === targetValue);\n\n  if (targetIndex !== -1) {\n    const result = [...data];\n    const insertIndex = position === 'before' ? targetIndex : targetIndex + 1;\n    result.splice(insertIndex, 0, node);\n    return result;\n  }\n\n  return data.map((item) => {\n    if (item.children) {\n      return { ...item, children: insertNode(item.children, node, targetValue, position) };\n    }\n\n    return item;\n  });\n}\n\nexport function moveTreeNode(data: TreeNodeData[], payload: TreeDragDropPayload): TreeNodeData[] {\n  const { draggedNode, targetNode, position } = payload;\n\n  if (draggedNode === targetNode) {\n    return data;\n  }\n\n  if (!findTreeNode(targetNode, data)) {\n    return data;\n  }\n\n  if (isDescendant(data, draggedNode, targetNode)) {\n    return data;\n  }\n\n  const { data: dataWithout, removed } = removeNode(data, draggedNode);\n\n  if (!removed) {\n    return data;\n  }\n\n  return insertNode(dataWithout, removed, targetNode, position);\n}\n"],"mappings":";;;AAgBA,SAAS,aAAa,MAAsB,eAAuB,OAAwB;CACzF,MAAM,WAAWA,kCAAAA,aAAa,eAAe,KAAK;AAClD,KAAI,CAAC,YAAY,CAAC,SAAS,SACzB,QAAO;CAGT,SAAS,MAAM,OAAgC;AAC7C,OAAK,MAAM,QAAQ,OAAO;AACxB,OAAI,KAAK,UAAU,MACjB,QAAO;AAGT,OAAI,KAAK,YAAY,MAAM,KAAK,SAAS,CACvC,QAAO;;AAIX,SAAO;;AAGT,QAAO,MAAM,SAAS,SAAS;;AAGjC,SAAS,WACP,MACA,OACwD;CACxD,IAAI,UAA+B;AAuBnC,QAAO;EAAE,MArBO,KAAK,QAAwB,KAAK,SAAS;AACzD,OAAI,KAAK,UAAU,OAAO;AACxB,cAAU,EAAE,GAAG,MAAM;AACrB,WAAO;;AAGT,OAAI,KAAK,UAAU;IACjB,MAAM,SAAS,WAAW,KAAK,UAAU,MAAM;AAC/C,QAAI,OAAO,SAAS;AAClB,eAAU,OAAO;AACjB,SAAI,KAAK;MAAE,GAAG;MAAM,UAAU,OAAO;MAAM,CAAC;UAE5C,KAAI,KAAK,KAAK;SAGhB,KAAI,KAAK,KAAK;AAGhB,UAAO;KACN,EAAE,CAAC;EAEkB;EAAS;;AAGnC,SAAS,WACP,MACA,MACA,aACA,UACgB;AAChB,KAAI,aAAa,SACf,QAAO,KAAK,KAAK,SAAS;AACxB,MAAI,KAAK,UAAU,YACjB,QAAO;GAAE,GAAG;GAAM,UAAU,CAAC,GAAI,KAAK,YAAY,EAAE,EAAG,KAAK;GAAE;AAGhE,MAAI,KAAK,SACP,QAAO;GAAE,GAAG;GAAM,UAAU,WAAW,KAAK,UAAU,MAAM,aAAa,SAAS;GAAE;AAGtF,SAAO;GACP;CAGJ,MAAM,cAAc,KAAK,WAAW,SAAS,KAAK,UAAU,YAAY;AAExE,KAAI,gBAAgB,IAAI;EACtB,MAAM,SAAS,CAAC,GAAG,KAAK;EACxB,MAAM,cAAc,aAAa,WAAW,cAAc,cAAc;AACxE,SAAO,OAAO,aAAa,GAAG,KAAK;AACnC,SAAO;;AAGT,QAAO,KAAK,KAAK,SAAS;AACxB,MAAI,KAAK,SACP,QAAO;GAAE,GAAG;GAAM,UAAU,WAAW,KAAK,UAAU,MAAM,aAAa,SAAS;GAAE;AAGtF,SAAO;GACP;;AAGJ,SAAgB,aAAa,MAAsB,SAA8C;CAC/F,MAAM,EAAE,aAAa,YAAY,aAAa;AAE9C,KAAI,gBAAgB,WAClB,QAAO;AAGT,KAAI,CAACA,kCAAAA,aAAa,YAAY,KAAK,CACjC,QAAO;AAGT,KAAI,aAAa,MAAM,aAAa,WAAW,CAC7C,QAAO;CAGT,MAAM,EAAE,MAAM,aAAa,YAAY,WAAW,MAAM,YAAY;AAEpE,KAAI,CAAC,QACH,QAAO;AAGT,QAAO,WAAW,aAAa,SAAS,YAAY,SAAS"}

package/cjs/components/Tree/use-tree-node-drag-drop.cjs

@@ -0,0 +1,96 @@
+"use client";
+const require_get_children_nodes_values = require("./get-children-nodes-values/get-children-nodes-values.cjs");
+//#region packages/@mantine/core/src/components/Tree/use-tree-node-drag-drop.ts
+function isDescendantOf(data, ancestorValue, descendantValue) {
+	const ancestor = require_get_children_nodes_values.findTreeNode(ancestorValue, data);
+	if (!ancestor || !ancestor.children) return false;
+	function check(nodes) {
+		for (const node of nodes) {
+			if (node.value === descendantValue) return true;
+			if (node.children && check(node.children)) return true;
+		}
+		return false;
+	}
+	return check(ancestor.children);
+}
+function getDragDropPosition(event, element, hasChildren) {
+	const rect = element.getBoundingClientRect();
+	const y = event.clientY - rect.top;
+	const height = rect.height;
+	if (hasChildren) {
+		if (y < height * .25) return "before";
+		if (y > height * .75) return "after";
+		return "inside";
+	}
+	if (y < height * .5) return "before";
+	return "after";
+}
+const EMPTY_DRAG_PROPS = {};
+function useTreeNodeDragDrop({ nodeValue, hasChildren, data, onDragDrop, dragStateRef }) {
+	if (!onDragDrop) return EMPTY_DRAG_PROPS;
+	const handleDragStart = (event) => {
+		event.stopPropagation();
+		event.dataTransfer.effectAllowed = "move";
+		event.dataTransfer.setData("text/plain", nodeValue);
+		dragStateRef.current.draggedValue = nodeValue;
+		const target = event.currentTarget;
+		requestAnimationFrame(() => {
+			target.setAttribute("data-dragging", "true");
+		});
+	};
+	const handleDragOver = (event) => {
+		const draggedValue = dragStateRef.current.draggedValue;
+		if (!draggedValue || draggedValue === nodeValue) return;
+		if (isDescendantOf(data, draggedValue, nodeValue)) return;
+		event.preventDefault();
+		event.stopPropagation();
+		event.dataTransfer.dropEffect = "move";
+		const target = event.currentTarget;
+		const position = getDragDropPosition(event, target, hasChildren);
+		const prevTarget = dragStateRef.current.currentDropTarget;
+		if (prevTarget && prevTarget !== target) prevTarget.removeAttribute("data-drag-over");
+		target.setAttribute("data-drag-over", position);
+		dragStateRef.current.currentDropTarget = target;
+	};
+	const handleDragLeave = (event) => {
+		const target = event.currentTarget;
+		const related = event.relatedTarget;
+		if (related && target.contains(related)) return;
+		target.removeAttribute("data-drag-over");
+		if (dragStateRef.current.currentDropTarget === target) dragStateRef.current.currentDropTarget = null;
+	};
+	const handleDrop = (event) => {
+		event.preventDefault();
+		event.stopPropagation();
+		const target = event.currentTarget;
+		const position = target.getAttribute("data-drag-over");
+		target.removeAttribute("data-drag-over");
+		const draggedValue = dragStateRef.current.draggedValue;
+		if (draggedValue && position && draggedValue !== nodeValue) onDragDrop({
+			draggedNode: draggedValue,
+			targetNode: nodeValue,
+			position
+		});
+		dragStateRef.current.draggedValue = null;
+		dragStateRef.current.currentDropTarget = null;
+	};
+	const handleDragEnd = (event) => {
+		event.currentTarget.removeAttribute("data-dragging");
+		const prevTarget = dragStateRef.current.currentDropTarget;
+		if (prevTarget) prevTarget.removeAttribute("data-drag-over");
+		dragStateRef.current.draggedValue = null;
+		dragStateRef.current.currentDropTarget = null;
+	};
+	return {
+		draggable: true,
+		onDragStart: handleDragStart,
+		onDragOver: handleDragOver,
+		onDragLeave: handleDragLeave,
+		onDrop: handleDrop,
+		onDragEnd: handleDragEnd
+	};
+}
+//#endregion
+exports.useTreeNodeDragDrop = useTreeNodeDragDrop;
+
+//# sourceMappingURL=use-tree-node-drag-drop.cjs.map

package/cjs/components/Tree/use-tree-node-drag-drop.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"use-tree-node-drag-drop.cjs","names":["findTreeNode"],"sources":["../../../src/components/Tree/use-tree-node-drag-drop.ts"],"sourcesContent":["import { findTreeNode } from './get-children-nodes-values/get-children-nodes-values';\nimport type { TreeDragDropPayload, TreeDragDropPosition } from './move-tree-node/move-tree-node';\nimport type { TreeDragState, TreeNodeData } from './Tree';\n\ninterface UseTreeNodeDragDropInput {\n  nodeValue: string;\n  hasChildren: boolean;\n  data: TreeNodeData[];\n  onDragDrop: ((payload: TreeDragDropPayload) => void) | undefined;\n  dragStateRef: React.RefObject<TreeDragState>;\n}\n\nfunction isDescendantOf(\n  data: TreeNodeData[],\n  ancestorValue: string,\n  descendantValue: string\n): boolean {\n  const ancestor = findTreeNode(ancestorValue, data);\n  if (!ancestor || !ancestor.children) {\n    return false;\n  }\n\n  function check(nodes: TreeNodeData[]): boolean {\n    for (const node of nodes) {\n      if (node.value === descendantValue) {\n        return true;\n      }\n\n      if (node.children && check(node.children)) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  return check(ancestor.children);\n}\n\nfunction getDragDropPosition(\n  event: React.DragEvent,\n  element: HTMLElement,\n  hasChildren: boolean\n): TreeDragDropPosition {\n  const rect = element.getBoundingClientRect();\n  const y = event.clientY - rect.top;\n  const height = rect.height;\n\n  if (hasChildren) {\n    if (y < height * 0.25) {\n      return 'before';\n    }\n\n    if (y > height * 0.75) {\n      return 'after';\n    }\n\n    return 'inside';\n  }\n\n  if (y < height * 0.5) {\n    return 'before';\n  }\n\n  return 'after';\n}\n\nconst EMPTY_DRAG_PROPS: Record<string, never> = {};\n\nexport function useTreeNodeDragDrop({\n  nodeValue,\n  hasChildren,\n  data,\n  onDragDrop,\n  dragStateRef,\n}: UseTreeNodeDragDropInput) {\n  if (!onDragDrop) {\n    return EMPTY_DRAG_PROPS;\n  }\n\n  const handleDragStart = (event: React.DragEvent) => {\n    event.stopPropagation();\n    event.dataTransfer.effectAllowed = 'move';\n    event.dataTransfer.setData('text/plain', nodeValue);\n    dragStateRef.current.draggedValue = nodeValue;\n\n    const target = event.currentTarget as HTMLElement;\n    requestAnimationFrame(() => {\n      target.setAttribute('data-dragging', 'true');\n    });\n  };\n\n  const handleDragOver = (event: React.DragEvent) => {\n    const draggedValue = dragStateRef.current.draggedValue;\n    if (!draggedValue || draggedValue === nodeValue) {\n      return;\n    }\n\n    if (isDescendantOf(data, draggedValue, nodeValue)) {\n      return;\n    }\n\n    event.preventDefault();\n    event.stopPropagation();\n    event.dataTransfer.dropEffect = 'move';\n\n    const target = event.currentTarget as HTMLElement;\n    const position = getDragDropPosition(event, target, hasChildren);\n\n    const prevTarget = dragStateRef.current.currentDropTarget;\n    if (prevTarget && prevTarget !== target) {\n      prevTarget.removeAttribute('data-drag-over');\n    }\n\n    target.setAttribute('data-drag-over', position);\n    dragStateRef.current.currentDropTarget = target;\n  };\n\n  const handleDragLeave = (event: React.DragEvent) => {\n    const target = event.currentTarget as HTMLElement;\n    const related = event.relatedTarget as HTMLElement | null;\n\n    if (related && target.contains(related)) {\n      return;\n    }\n\n    target.removeAttribute('data-drag-over');\n\n    if (dragStateRef.current.currentDropTarget === target) {\n      dragStateRef.current.currentDropTarget = null;\n    }\n  };\n\n  const handleDrop = (event: React.DragEvent) => {\n    event.preventDefault();\n    event.stopPropagation();\n\n    const target = event.currentTarget as HTMLElement;\n    const position = target.getAttribute('data-drag-over') as TreeDragDropPosition | null;\n    target.removeAttribute('data-drag-over');\n\n    const draggedValue = dragStateRef.current.draggedValue;\n    if (draggedValue && position && draggedValue !== nodeValue) {\n      onDragDrop({ draggedNode: draggedValue, targetNode: nodeValue, position });\n    }\n\n    dragStateRef.current.draggedValue = null;\n    dragStateRef.current.currentDropTarget = null;\n  };\n\n  const handleDragEnd = (event: React.DragEvent) => {\n    const target = event.currentTarget as HTMLElement;\n    target.removeAttribute('data-dragging');\n\n    const prevTarget = dragStateRef.current.currentDropTarget;\n    if (prevTarget) {\n      prevTarget.removeAttribute('data-drag-over');\n    }\n\n    dragStateRef.current.draggedValue = null;\n    dragStateRef.current.currentDropTarget = null;\n  };\n\n  return {\n    draggable: true as const,\n    onDragStart: handleDragStart,\n    onDragOver: handleDragOver,\n    onDragLeave: handleDragLeave,\n    onDrop: handleDrop,\n    onDragEnd: handleDragEnd,\n  };\n}\n"],"mappings":";;;AAYA,SAAS,eACP,MACA,eACA,iBACS;CACT,MAAM,WAAWA,kCAAAA,aAAa,eAAe,KAAK;AAClD,KAAI,CAAC,YAAY,CAAC,SAAS,SACzB,QAAO;CAGT,SAAS,MAAM,OAAgC;AAC7C,OAAK,MAAM,QAAQ,OAAO;AACxB,OAAI,KAAK,UAAU,gBACjB,QAAO;AAGT,OAAI,KAAK,YAAY,MAAM,KAAK,SAAS,CACvC,QAAO;;AAIX,SAAO;;AAGT,QAAO,MAAM,SAAS,SAAS;;AAGjC,SAAS,oBACP,OACA,SACA,aACsB;CACtB,MAAM,OAAO,QAAQ,uBAAuB;CAC5C,MAAM,IAAI,MAAM,UAAU,KAAK;CAC/B,MAAM,SAAS,KAAK;AAEpB,KAAI,aAAa;AACf,MAAI,IAAI,SAAS,IACf,QAAO;AAGT,MAAI,IAAI,SAAS,IACf,QAAO;AAGT,SAAO;;AAGT,KAAI,IAAI,SAAS,GACf,QAAO;AAGT,QAAO;;AAGT,MAAM,mBAA0C,EAAE;AAElD,SAAgB,oBAAoB,EAClC,WACA,aACA,MACA,YACA,gBAC2B;AAC3B,KAAI,CAAC,WACH,QAAO;CAGT,MAAM,mBAAmB,UAA2B;AAClD,QAAM,iBAAiB;AACvB,QAAM,aAAa,gBAAgB;AACnC,QAAM,aAAa,QAAQ,cAAc,UAAU;AACnD,eAAa,QAAQ,eAAe;EAEpC,MAAM,SAAS,MAAM;AACrB,8BAA4B;AAC1B,UAAO,aAAa,iBAAiB,OAAO;IAC5C;;CAGJ,MAAM,kBAAkB,UAA2B;EACjD,MAAM,eAAe,aAAa,QAAQ;AAC1C,MAAI,CAAC,gBAAgB,iBAAiB,UACpC;AAGF,MAAI,eAAe,MAAM,cAAc,UAAU,CAC/C;AAGF,QAAM,gBAAgB;AACtB,QAAM,iBAAiB;AACvB,QAAM,aAAa,aAAa;EAEhC,MAAM,SAAS,MAAM;EACrB,MAAM,WAAW,oBAAoB,OAAO,QAAQ,YAAY;EAEhE,MAAM,aAAa,aAAa,QAAQ;AACxC,MAAI,cAAc,eAAe,OAC/B,YAAW,gBAAgB,iBAAiB;AAG9C,SAAO,aAAa,kBAAkB,SAAS;AAC/C,eAAa,QAAQ,oBAAoB;;CAG3C,MAAM,mBAAmB,UAA2B;EAClD,MAAM,SAAS,MAAM;EACrB,MAAM,UAAU,MAAM;AAEtB,MAAI,WAAW,OAAO,SAAS,QAAQ,CACrC;AAGF,SAAO,gBAAgB,iBAAiB;AAExC,MAAI,aAAa,QAAQ,sBAAsB,OAC7C,cAAa,QAAQ,oBAAoB;;CAI7C,MAAM,cAAc,UAA2B;AAC7C,QAAM,gBAAgB;AACtB,QAAM,iBAAiB;EAEvB,MAAM,SAAS,MAAM;EACrB,MAAM,WAAW,OAAO,aAAa,iBAAiB;AACtD,SAAO,gBAAgB,iBAAiB;EAExC,MAAM,eAAe,aAAa,QAAQ;AAC1C,MAAI,gBAAgB,YAAY,iBAAiB,UAC/C,YAAW;GAAE,aAAa;GAAc,YAAY;GAAW;GAAU,CAAC;AAG5E,eAAa,QAAQ,eAAe;AACpC,eAAa,QAAQ,oBAAoB;;CAG3C,MAAM,iBAAiB,UAA2B;AACjC,QAAM,cACd,gBAAgB,gBAAgB;EAEvC,MAAM,aAAa,aAAa,QAAQ;AACxC,MAAI,WACF,YAAW,gBAAgB,iBAAiB;AAG9C,eAAa,QAAQ,eAAe;AACpC,eAAa,QAAQ,oBAAoB;;AAG3C,QAAO;EACL,WAAW;EACX,aAAa;EACb,YAAY;EACZ,aAAa;EACb,QAAQ;EACR,WAAW;EACZ"}

package/cjs/components/Tree/use-tree.cjs

@@ -1,7 +1,7 @@
 "use client";
 require("../../_virtual/_rolldown/runtime.cjs");
-const require_get_all_checked_nodes = require("./get-all-checked-nodes/get-all-checked-nodes.cjs");
 const require_get_children_nodes_values = require("./get-children-nodes-values/get-children-nodes-values.cjs");
+const require_get_all_checked_nodes = require("./get-all-checked-nodes/get-all-checked-nodes.cjs");
 const require_is_node_checked = require("./is-node-checked/is-node-checked.cjs");
 const require_is_node_indeterminate = require("./is-node-indeterminate/is-node-indeterminate.cjs");
 let react = require("react");
@@ -16,21 +16,32 @@ function getInitialTreeExpandedState(initialState, data, value, acc = {}) {
 }
 function getTreeExpandedState(data, expandedNodesValues) {
 	const state = getInitialTreeExpandedState({}, data, []);
-	if (expandedNodesValues === "*") return Object.keys(state).reduce((acc, key) => ({
-		...acc,
-		[key]: true
-	}), {});
+	if (expandedNodesValues === "*") {
+		const result = {};
+		const keys = Object.keys(state);
+		for (let i = 0; i < keys.length; i++) result[keys[i]] = true;
+		return result;
+	}
 	expandedNodesValues.forEach((node) => {
 		state[node] = true;
 	});
 	return state;
 }
-function getInitialCheckedState(initialState, data) {
+function getInitialCheckedState(initialState, data, checkStrictly) {
+	if (checkStrictly) return initialState;
 	const acc = [];
 	initialState.forEach((node) => acc.push(...require_get_children_nodes_values.getChildrenNodesValues(node, data)));
 	return Array.from(new Set(acc));
 }
-function useTree({ initialSelectedState = [], expandedState, initialCheckedState = [], checkedState, initialExpandedState = {}, selectedState, multiple = false, onNodeCollapse, onNodeExpand, onCheckedStateChange, onSelectedStateChange, onExpandedStateChange } = {}) {
+function getAllNodeValues(data) {
+	const acc = [];
+	for (const node of data) {
+		acc.push(node.value);
+		if (Array.isArray(node.children) && node.children.length > 0) acc.push(...getAllNodeValues(node.children));
+	}
+	return acc;
+}
+function useTree({ initialSelectedState = [], expandedState, initialCheckedState = [], checkedState, initialExpandedState = {}, selectedState, multiple = false, onNodeCollapse, onNodeExpand, onCheckedStateChange, onSelectedStateChange, onExpandedStateChange, onLoadChildren, checkStrictly = false } = {}) {
 	const [data, setData] = (0, react.useState)([]);
 	const [_expandedState, setExpandedState] = (0, _mantine_hooks.useUncontrolled)({
 		value: expandedState,
@@ -51,14 +62,53 @@ function useTree({ initialSelectedState = [], expandedState, initialCheckedState
 		onChange: onCheckedStateChange
 	});
 	const [anchorNode, setAnchorNode] = (0, react.useState)(null);
+	const loadingNodesRef = (0, react.useRef)(/* @__PURE__ */ new Set());
+	const loadedNodesRef = (0, react.useRef)(/* @__PURE__ */ new Set());
+	const [loadingNodes, setLoadingNodes] = (0, react.useState)([]);
+	const [loadErrors, setLoadErrors] = (0, react.useState)({});
 	const initialize = (0, react.useCallback)((_data) => {
 		setExpandedState(getInitialTreeExpandedState(_expandedState, _data, _selectedState));
-		setCheckedState(getInitialCheckedState(_checkedState, _data));
+		setCheckedState(getInitialCheckedState(_checkedState, _data, checkStrictly));
 		setData(_data);
 	}, [
 		_selectedState,
 		_checkedState,
-		_expandedState
+		_expandedState,
+		checkStrictly
+	]);
+	const loadNodeImpl = (0, react.useCallback)(async (value) => {
+		if (!onLoadChildren) return;
+		if (loadingNodesRef.current.has(value) || loadedNodesRef.current.has(value)) return;
+		loadingNodesRef.current.add(value);
+		setLoadingNodes(Array.from(loadingNodesRef.current));
+		setLoadErrors((prev) => {
+			if (!(value in prev)) return prev;
+			const next = { ...prev };
+			delete next[value];
+			return next;
+		});
+		try {
+			await onLoadChildren(value);
+			loadedNodesRef.current.add(value);
+		} catch (error) {
+			const err = error instanceof Error ? error : new Error(String(error));
+			setLoadErrors((prev) => ({
+				...prev,
+				[value]: err
+			}));
+		} finally {
+			loadingNodesRef.current.delete(value);
+			setLoadingNodes(Array.from(loadingNodesRef.current));
+		}
+	}, [onLoadChildren]);
+	const tryLoadAsync = (0, react.useCallback)((value) => {
+		if (!onLoadChildren) return;
+		const node = require_get_children_nodes_values.findTreeNode(value, data);
+		if (node && node.hasChildren && !Array.isArray(node.children)) loadNodeImpl(value);
+	}, [
+		onLoadChildren,
+		data,
+		loadNodeImpl
 	]);
 	const toggleExpanded = (0, react.useCallback)((value) => {
 		const nextState = {
@@ -66,11 +116,13 @@ function useTree({ initialSelectedState = [], expandedState, initialCheckedState
 			[value]: !_expandedState[value]
 		};
 		nextState[value] ? onNodeExpand?.(value) : onNodeCollapse?.(value);
+		if (nextState[value]) tryLoadAsync(value);
 		setExpandedState(nextState);
 	}, [
 		onNodeCollapse,
 		onNodeExpand,
-		_expandedState
+		_expandedState,
+		tryLoadAsync
 	]);
 	const collapse = (0, react.useCallback)((value) => {
 		if (_expandedState[value] !== false) onNodeCollapse?.(value);
@@ -81,18 +133,24 @@ function useTree({ initialSelectedState = [], expandedState, initialCheckedState
 	}, [onNodeCollapse, _expandedState]);
 	const expand = (0, react.useCallback)((value) => {
 		if (_expandedState[value] !== true) onNodeExpand?.(value);
+		tryLoadAsync(value);
 		setExpandedState({
 			..._expandedState,
 			[value]: true
 		});
-	}, [onNodeExpand, _expandedState]);
+	}, [
+		onNodeExpand,
+		_expandedState,
+		tryLoadAsync
+	]);
 	const expandAllNodes = (0, react.useCallback)(() => {
 		const nextState = { ..._expandedState };
 		Object.keys(nextState).forEach((key) => {
 			nextState[key] = true;
+			tryLoadAsync(key);
 		});
 		setExpandedState(nextState);
-	}, [_expandedState]);
+	}, [_expandedState, tryLoadAsync]);
 	const collapseAllNodes = (0, react.useCallback)(() => {
 		const nextState = { ..._expandedState };
 		Object.keys(nextState).forEach((key) => {
@@ -129,23 +187,80 @@ function useTree({ initialSelectedState = [], expandedState, initialCheckedState
 		setAnchorNode(null);
 	}, []);
 	const checkNode = (0, react.useCallback)((value) => {
-		const checkedNodes = require_get_children_nodes_values.getChildrenNodesValues(value, data);
-		setCheckedState(Array.from(new Set([..._checkedState, ...checkedNodes])));
-	}, [data, _checkedState]);
+		if (checkStrictly) {
+			if (!_checkedState.includes(value)) setCheckedState([..._checkedState, value]);
+		} else {
+			const checkedNodes = require_get_children_nodes_values.getChildrenNodesValues(value, data);
+			setCheckedState(Array.from(new Set([..._checkedState, ...checkedNodes])));
+		}
+	}, [
+		data,
+		_checkedState,
+		checkStrictly
+	]);
 	const uncheckNode = (0, react.useCallback)((value) => {
-		const checkedNodes = require_get_children_nodes_values.getChildrenNodesValues(value, data);
-		setCheckedState(_checkedState.filter((item) => !checkedNodes.includes(item)));
-	}, [data, _checkedState]);
+		if (checkStrictly) setCheckedState(_checkedState.filter((item) => item !== value));
+		else {
+			const checkedNodes = require_get_children_nodes_values.getChildrenNodesValues(value, data);
+			setCheckedState(_checkedState.filter((item) => !checkedNodes.includes(item)));
+		}
+	}, [
+		data,
+		_checkedState,
+		checkStrictly
+	]);
 	const checkAllNodes = (0, react.useCallback)(() => {
-		setCheckedState(require_get_children_nodes_values.getAllChildrenNodes(data));
-	}, [data]);
+		if (checkStrictly) setCheckedState(getAllNodeValues(data));
+		else setCheckedState(require_get_children_nodes_values.getAllChildrenNodes(data));
+	}, [data, checkStrictly]);
 	const uncheckAllNodes = (0, react.useCallback)(() => {
 		setCheckedState([]);
 	}, []);
-	const getCheckedNodes = () => require_get_all_checked_nodes.getAllCheckedNodes(data, _checkedState).result;
-	const isNodeChecked = (value) => require_is_node_checked.memoizedIsNodeChecked(value, data, _checkedState);
-	const isNodeIndeterminate = (value) => require_is_node_indeterminate.memoizedIsNodeIndeterminate(value, data, _checkedState);
-	return {
+	const getCheckedNodes = (0, react.useCallback)(() => {
+		if (checkStrictly) return _checkedState.map((value) => {
+			const node = require_get_children_nodes_values.findTreeNode(value, data);
+			return {
+				checked: true,
+				indeterminate: false,
+				value,
+				hasChildren: node ? Array.isArray(node.children) && node.children.length > 0 || !!node.hasChildren : false
+			};
+		});
+		return require_get_all_checked_nodes.getAllCheckedNodes(data, _checkedState).result;
+	}, [
+		checkStrictly,
+		_checkedState,
+		data
+	]);
+	const isNodeChecked = (0, react.useCallback)((value) => {
+		if (checkStrictly) return _checkedState.includes(value);
+		return require_is_node_checked.memoizedIsNodeChecked(value, data, _checkedState);
+	}, [
+		checkStrictly,
+		_checkedState,
+		data
+	]);
+	const isNodeIndeterminate = (0, react.useCallback)((value) => {
+		if (checkStrictly) return false;
+		return require_is_node_indeterminate.memoizedIsNodeIndeterminate(value, data, _checkedState);
+	}, [
+		checkStrictly,
+		_checkedState,
+		data
+	]);
+	const isNodeLoading = (0, react.useCallback)((value) => loadingNodes.includes(value), [loadingNodes]);
+	const getNodeLoadError = (0, react.useCallback)((value) => loadErrors[value] || null, [loadErrors]);
+	const invalidateNode = (0, react.useCallback)((value) => {
+		loadedNodesRef.current.delete(value);
+		setLoadErrors((prev) => {
+			if (!(value in prev)) return prev;
+			const next = { ...prev };
+			delete next[value];
+			return next;
+		});
+	}, []);
+	return (0, react.useMemo)(() => ({
+		checkStrictly,
 		multiple,
 		expandedState: _expandedState,
 		selectedState: _selectedState,
@@ -170,8 +285,43 @@ function useTree({ initialSelectedState = [], expandedState, initialCheckedState
 		setSelectedState,
 		getCheckedNodes,
 		isNodeChecked,
-		isNodeIndeterminate
-	};
+		isNodeIndeterminate,
+		isNodeLoading,
+		getNodeLoadError,
+		loadNode: loadNodeImpl,
+		invalidateNode
+	}), [
+		checkStrictly,
+		multiple,
+		_expandedState,
+		_selectedState,
+		_checkedState,
+		anchorNode,
+		initialize,
+		toggleExpanded,
+		collapse,
+		expand,
+		expandAllNodes,
+		collapseAllNodes,
+		setExpandedState,
+		checkNode,
+		uncheckNode,
+		checkAllNodes,
+		uncheckAllNodes,
+		setCheckedState,
+		toggleSelected,
+		select,
+		deselect,
+		clearSelected,
+		setSelectedState,
+		getCheckedNodes,
+		isNodeChecked,
+		isNodeIndeterminate,
+		isNodeLoading,
+		getNodeLoadError,
+		loadNodeImpl,
+		invalidateNode
+	]);
 }
 //#endregion
 exports.getTreeExpandedState = getTreeExpandedState;