@feugene/granularity 0.43.0 → 0.45.0

package/dist/chunks/useTree-BebEiBcL.js

@@ -0,0 +1,525 @@
+import { computed, ref, shallowRef, toValue, watch } from "vue";
+//#region src/composables/internal/treeAdapter.ts
+var DEFAULT_CHILDREN_KEY = "children";
+var DEFAULT_LABEL_KEY = "label";
+var DEFAULT_IS_LEAF_KEY = "isLeaf";
+function isTreeKey(value) {
+	return typeof value === "string" || typeof value === "number";
+}
+function resolveMapValue(map, key, fallback) {
+	return map?.[key] ?? fallback;
+}
+function createGrTreeDataAdapter(options) {
+	function hasNodeKey() {
+		return options.nodeKey != null;
+	}
+	function getChildrenKey() {
+		return resolveMapValue(options.props, "children", DEFAULT_CHILDREN_KEY);
+	}
+	function getLabelKey() {
+		return resolveMapValue(options.props, "label", DEFAULT_LABEL_KEY);
+	}
+	function getLabel(data) {
+		const value = data[getLabelKey()];
+		return value == null ? "" : String(value);
+	}
+	function getIsLeaf(data) {
+		const value = data[resolveMapValue(options.props, "isLeaf", DEFAULT_IS_LEAF_KEY)];
+		return typeof value === "boolean" ? value : void 0;
+	}
+	function getChildren(data) {
+		const value = data[getChildrenKey()];
+		return Array.isArray(value) ? value : [];
+	}
+	function ensureChildren(data) {
+		const key = getChildrenKey();
+		const record = data;
+		if (Array.isArray(record[key])) return record[key];
+		record[key] = [];
+		return record[key];
+	}
+	function getExplicitNodeKey(data) {
+		if (options.nodeKey == null) return void 0;
+		const value = data[options.nodeKey];
+		return isTreeKey(value) ? value : void 0;
+	}
+	function getNodeKey(data, index, parentKey) {
+		const explicitKey = getExplicitNodeKey(data);
+		if (explicitKey != null) return explicitKey;
+		return parentKey == null ? index : `${String(parentKey)}:${index}`;
+	}
+	return {
+		hasNodeKey,
+		getChildrenKey,
+		getLabelKey,
+		getLabel,
+		getIsLeaf,
+		getChildren,
+		ensureChildren,
+		getNodeKey,
+		getExplicitNodeKey
+	};
+}
+//#endregion
+//#region src/composables/internal/treeChecking.ts
+/**
+* Раскладывает отмеченные ключи по всему дереву: родитель отмечен, когда
+* отмечены все дети, и наполовину — когда часть.
+*
+* Считается от листьев вверх, поэтому `checkedKeys` снаружи может содержать
+* только листья (типовой формат ответа сервера) — родители посчитаются сами.
+* При `strict` дерево не связывает узлы вовсе: каждый отвечает сам за себя.
+*/
+function resolveCheckStates(roots, checkedKeys, strict) {
+	const states = /* @__PURE__ */ new Map();
+	const walk = (node) => {
+		if (strict || node.childNodes.length === 0) {
+			const state = checkedKeys.has(node.key) ? "checked" : "unchecked";
+			if (strict) node.childNodes.forEach(walk);
+			states.set(node.key, state);
+			return state;
+		}
+		const childStates = node.childNodes.map(walk);
+		const allChecked = childStates.every((s) => s === "checked");
+		const someMarked = childStates.some((s) => s !== "unchecked");
+		const state = allChecked ? "checked" : someMarked || checkedKeys.has(node.key) ? "half" : "unchecked";
+		states.set(node.key, state);
+		return state;
+	};
+	roots.forEach(walk);
+	return states;
+}
+/**
+* Новый набор отмеченных ключей после переключения узла.
+*
+* Каскад идёт вниз (все потомки повторяют решение) и вверх (родитель отмечен,
+* только если отмечены все его дети). Возвращается набор с родителями —
+* `getCheckedKeys({ leafOnly: true })` при необходимости отбросит их обратно.
+*/
+function toggleCheckedKeys(roots, checkedKeys, node, checked, strict) {
+	const next = new Set(checkedKeys);
+	if (strict) {
+		if (checked) next.add(node.key);
+		else next.delete(node.key);
+		return next;
+	}
+	const applyDown = (target) => {
+		if (checked) next.add(target.key);
+		else next.delete(target.key);
+		target.childNodes.forEach(applyDown);
+	};
+	applyDown(node);
+	for (let parent = node.parent; parent; parent = parent.parent) if (parent.childNodes.every((child) => next.has(child.key))) next.add(parent.key);
+	else next.delete(parent.key);
+	return pruneToTree(roots, next);
+}
+/** Отбрасывает ключи, которых нет в текущей модели (данные могли смениться). */
+function pruneToTree(roots, keys) {
+	const known = /* @__PURE__ */ new Set();
+	const walk = (node) => {
+		known.add(node.key);
+		node.childNodes.forEach(walk);
+	};
+	roots.forEach(walk);
+	const next = /* @__PURE__ */ new Set();
+	for (const key of keys) if (known.has(key)) next.add(key);
+	return next;
+}
+/** Ключи в состоянии `checked`; `leafOnly` оставляет только листья. */
+function collectCheckedKeys(roots, states, leafOnly) {
+	const out = [];
+	const walk = (node) => {
+		const isLeaf = node.childNodes.length === 0;
+		if (states.get(node.key) === "checked" && (!leafOnly || isLeaf)) out.push(node.key);
+		node.childNodes.forEach(walk);
+	};
+	roots.forEach(walk);
+	return out;
+}
+/** Ключи в состоянии `half` — родители с частично отмеченными потомками. */
+function collectHalfCheckedKeys(states) {
+	const out = [];
+	for (const [key, state] of states) if (state === "half") out.push(key);
+	return out;
+}
+//#endregion
+//#region src/composables/useTree.ts
+function useTree(options) {
+	const adapter = options.adapter ?? createGrTreeDataAdapter({
+		props: options.props,
+		nodeKey: options.nodeKey
+	});
+	const filterValue = ref("");
+	const expandedKeys = shallowRef(/* @__PURE__ */ new Set());
+	const checkedKeys = shallowRef(new Set(toValue(options.defaultCheckedKeys) ?? []));
+	const loadingKeys = shallowRef(/* @__PURE__ */ new Set());
+	const loadedKeys = shallowRef(/* @__PURE__ */ new Set());
+	const loadedChildren = shallowRef(/* @__PURE__ */ new Map());
+	const currentKey = ref(void 0);
+	const getData = () => toValue(options.data) ?? [];
+	const getFilterNodeMethod = () => options.filterNodeMethod;
+	watch(() => toValue(options.defaultExpandedKeys), (keys) => {
+		expandedKeys.value = new Set(keys ?? []);
+	}, { immediate: true });
+	watch(() => toValue(options.checkedKeys), (keys) => {
+		if (keys) checkedKeys.value = new Set(keys);
+	}, { immediate: true });
+	const treeModel = computed(() => {
+		const byKey = /* @__PURE__ */ new Map();
+		const byData = /* @__PURE__ */ new WeakMap();
+		const build = (items, parent, level) => {
+			return items.map((item, index) => {
+				const node = {
+					key: adapter.getNodeKey(item, index, parent?.key),
+					label: adapter.getLabel(item),
+					data: item,
+					level,
+					parent,
+					childNodes: []
+				};
+				byKey.set(node.key, node);
+				byData.set(item, node);
+				const ownChildren = adapter.getChildren(item);
+				const lazyChildren = loadedChildren.value.get(node.key) ?? [];
+				node.childNodes = build([...ownChildren, ...lazyChildren], node, level + 1);
+				return node;
+			});
+		};
+		return {
+			roots: build(getData(), void 0, 1),
+			byKey,
+			byData
+		};
+	});
+	const autoExpandedKeys = /* @__PURE__ */ new Set();
+	watch(treeModel, (model) => {
+		if (!toValue(options.defaultExpandAll)) return;
+		const next = new Set(expandedKeys.value);
+		let changed = false;
+		for (const key of model.byKey.keys()) {
+			if (autoExpandedKeys.has(key)) continue;
+			autoExpandedKeys.add(key);
+			next.add(key);
+			changed = true;
+		}
+		if (changed) expandedKeys.value = next;
+	}, { immediate: true });
+	const filterInfo = computed(() => {
+		const value = filterValue.value;
+		const isActive = value.trim().length > 0;
+		const valueLower = value.toLowerCase();
+		const subtreeHasMatch = /* @__PURE__ */ new Map();
+		const matchedKeys = /* @__PURE__ */ new Set();
+		const autoExpandKeys = /* @__PURE__ */ new Set();
+		if (!isActive) return {
+			isActive,
+			subtreeHasMatch,
+			matchedKeys,
+			autoExpandKeys
+		};
+		const match = (node) => {
+			const custom = getFilterNodeMethod()?.(value, node.data, node);
+			if (custom !== void 0) return custom;
+			return node.label.toLowerCase().includes(valueLower);
+		};
+		const walk = (nodes) => {
+			let any = false;
+			for (const node of nodes) {
+				const self = match(node);
+				const childAny = walk(node.childNodes);
+				const has = self || childAny;
+				subtreeHasMatch.set(node.key, has);
+				if (self) matchedKeys.add(node.key);
+				if (childAny) autoExpandKeys.add(node.key);
+				any ||= has;
+			}
+			return any;
+		};
+		walk(treeModel.value.roots);
+		return {
+			isActive,
+			subtreeHasMatch,
+			matchedKeys,
+			autoExpandKeys
+		};
+	});
+	function getNode(key) {
+		return treeModel.value.byKey.get(key);
+	}
+	function findNodeByData(data) {
+		return treeModel.value.byData.get(data);
+	}
+	function isTreeNode(target) {
+		return typeof target === "object" && target !== null && "key" in target && "data" in target && "childNodes" in target;
+	}
+	function resolveNodeTarget(target) {
+		if (target == null) return void 0;
+		if (typeof target === "string" || typeof target === "number") return getNode(target);
+		if (isTreeNode(target)) return getNode(target.key) ?? target;
+		const key = adapter.getExplicitNodeKey(target);
+		if (key != null) return getNode(key);
+		return findNodeByData(target);
+	}
+	function getNodeContainer(node) {
+		const items = node.parent ? adapter.ensureChildren(node.parent.data) : getData();
+		let index = items.findIndex((item) => item === node.data);
+		if (index >= 0) return {
+			items,
+			index
+		};
+		const key = adapter.getExplicitNodeKey(node.data);
+		if (key == null) return void 0;
+		index = items.findIndex((item) => adapter.getExplicitNodeKey(item) === key);
+		if (index < 0) return void 0;
+		return {
+			items,
+			index
+		};
+	}
+	function isDescendantNode(ancestor, node) {
+		let current = node.parent;
+		while (current) {
+			if (current.key === ancestor.key) return true;
+			current = current.parent;
+		}
+		return false;
+	}
+	function canMoveNode(node, referenceNode, dropType) {
+		const sourceNode = resolveNodeTarget(node);
+		const targetNode = resolveNodeTarget(referenceNode);
+		if (!sourceNode || !targetNode) return false;
+		if (sourceNode.key === targetNode.key) return false;
+		if (isDescendantNode(sourceNode, targetNode)) return false;
+		if (!getNodeContainer(sourceNode)) return false;
+		if (dropType === "inner") return true;
+		return Boolean(getNodeContainer(targetNode));
+	}
+	function sanitizeTreeState() {
+		const byKey = treeModel.value.byKey;
+		if (currentKey.value != null && !byKey.has(currentKey.value)) currentKey.value = void 0;
+		const nextExpandedKeys = new Set(Array.from(expandedKeys.value).filter((key) => byKey.has(key)));
+		if (nextExpandedKeys.size !== expandedKeys.value.size) expandedKeys.value = nextExpandedKeys;
+		const nextCheckedKeys = new Set(Array.from(checkedKeys.value).filter((key) => byKey.has(key)));
+		if (nextCheckedKeys.size !== checkedKeys.value.size) checkedKeys.value = nextCheckedKeys;
+	}
+	function isExpandedKey(key) {
+		return expandedKeys.value.has(key);
+	}
+	function setExpandedKey(key, expanded) {
+		const next = new Set(expandedKeys.value);
+		if (expanded) next.add(key);
+		else next.delete(key);
+		expandedKeys.value = next;
+	}
+	function toggleExpand(node) {
+		setExpandedKey(node.key, !isExpandedKey(node.key));
+	}
+	function setCurrentKey(key) {
+		currentKey.value = key;
+	}
+	function getCurrentKey() {
+		return currentKey.value;
+	}
+	function getCurrentNode() {
+		const key = currentKey.value;
+		return key == null ? void 0 : getNode(key);
+	}
+	function setCurrentNode(node) {
+		if (node == null) {
+			currentKey.value = void 0;
+			return true;
+		}
+		const targetNode = resolveNodeTarget(node);
+		if (!targetNode) return false;
+		currentKey.value = targetNode.key;
+		return true;
+	}
+	function resolveInsertedNode(data) {
+		const key = adapter.getExplicitNodeKey(data);
+		if (key != null) return getNode(key);
+		return findNodeByData(data);
+	}
+	function moveNode(node, referenceNode, dropType) {
+		const sourceNode = resolveNodeTarget(node);
+		const targetNode = resolveNodeTarget(referenceNode);
+		if (!sourceNode || !targetNode) return void 0;
+		if (!canMoveNode(sourceNode, targetNode, dropType)) return void 0;
+		const sourceContainer = getNodeContainer(sourceNode);
+		if (!sourceContainer) return void 0;
+		let destinationItems;
+		let destinationIndex;
+		if (dropType === "inner") {
+			destinationItems = adapter.ensureChildren(targetNode.data);
+			destinationIndex = destinationItems.length;
+		} else {
+			const targetContainer = getNodeContainer(targetNode);
+			if (!targetContainer) return void 0;
+			destinationItems = targetContainer.items;
+			destinationIndex = dropType === "prev" ? targetContainer.index : targetContainer.index + 1;
+		}
+		if (destinationItems === sourceContainer.items && sourceContainer.index < destinationIndex) destinationIndex -= 1;
+		const [movedData] = sourceContainer.items.splice(sourceContainer.index, 1);
+		destinationItems.splice(destinationIndex, 0, movedData);
+		if (dropType === "inner") setExpandedKey(targetNode.key, true);
+		sanitizeTreeState();
+		return resolveInsertedNode(movedData);
+	}
+	function appendNode(data, parent) {
+		const parentNode = resolveNodeTarget(parent);
+		if (!parentNode) return void 0;
+		adapter.ensureChildren(parentNode.data).push(data);
+		setExpandedKey(parentNode.key, true);
+		sanitizeTreeState();
+		return resolveInsertedNode(data);
+	}
+	function removeNode(node) {
+		if (!adapter.hasNodeKey()) return false;
+		const targetNode = resolveNodeTarget(node);
+		if (!targetNode) return false;
+		const container = getNodeContainer(targetNode);
+		if (!container) return false;
+		container.items.splice(container.index, 1);
+		sanitizeTreeState();
+		return true;
+	}
+	function insertNodeBefore(data, referenceNode) {
+		const targetNode = resolveNodeTarget(referenceNode);
+		if (!targetNode) return void 0;
+		const container = getNodeContainer(targetNode);
+		if (!container) return void 0;
+		container.items.splice(container.index, 0, data);
+		sanitizeTreeState();
+		return resolveInsertedNode(data);
+	}
+	function insertNodeAfter(data, referenceNode) {
+		const targetNode = resolveNodeTarget(referenceNode);
+		if (!targetNode) return void 0;
+		const container = getNodeContainer(targetNode);
+		if (!container) return void 0;
+		container.items.splice(container.index + 1, 0, data);
+		sanitizeTreeState();
+		return resolveInsertedNode(data);
+	}
+	const checkStates = computed(() => resolveCheckStates(treeModel.value.roots, checkedKeys.value, Boolean(toValue(options.checkStrictly))));
+	function getCheckState(key) {
+		return checkStates.value.get(key) ?? "unchecked";
+	}
+	function setChecked(node, checked) {
+		const targetNode = resolveNodeTarget(node);
+		if (!targetNode) return void 0;
+		checkedKeys.value = toggleCheckedKeys(treeModel.value.roots, checkedKeys.value, targetNode, checked, Boolean(toValue(options.checkStrictly)));
+		return targetNode;
+	}
+	function toggleChecked(node) {
+		return setChecked(node, getCheckState(node.key) !== "checked");
+	}
+	function getCheckedKeys(opts) {
+		return collectCheckedKeys(treeModel.value.roots, checkStates.value, Boolean(opts?.leafOnly));
+	}
+	function setCheckedKeys(keys) {
+		checkedKeys.value = pruneToTree(treeModel.value.roots, new Set(keys));
+	}
+	function getHalfCheckedKeys() {
+		return collectHalfCheckedKeys(checkStates.value);
+	}
+	function isLeafNode(node) {
+		if (node.childNodes.length > 0) return false;
+		if (!toValue(options.lazy)) return true;
+		const declared = adapter.getIsLeaf(node.data);
+		if (declared !== void 0) return declared;
+		return loadedKeys.value.has(node.key);
+	}
+	function isLoadingKey(key) {
+		return loadingKeys.value.has(key);
+	}
+	function markLoading(key, loading) {
+		const next = new Set(loadingKeys.value);
+		if (loading) next.add(key);
+		else next.delete(key);
+		loadingKeys.value = next;
+	}
+	function ensureLoaded(node) {
+		const load = options.load;
+		if (!toValue(options.lazy) || !load) return;
+		if (loadedKeys.value.has(node.key) || loadingKeys.value.has(node.key) || isLeafNode(node)) return;
+		markLoading(node.key, true);
+		let settled = false;
+		load(node, (children) => {
+			if (settled) return;
+			settled = true;
+			const next = new Map(loadedChildren.value);
+			next.set(node.key, [...children ?? []]);
+			loadedChildren.value = next;
+			loadedKeys.value = new Set(loadedKeys.value).add(node.key);
+			markLoading(node.key, false);
+		});
+	}
+	function filter(value) {
+		filterValue.value = value;
+	}
+	return {
+		visibleRows: computed(() => {
+			const { roots } = treeModel.value;
+			const { isActive, subtreeHasMatch, matchedKeys, autoExpandKeys } = filterInfo.value;
+			const rows = [];
+			const walk = (nodes, ancestorColors) => {
+				const siblings = isActive ? nodes.filter((node) => subtreeHasMatch.get(node.key)) : nodes;
+				siblings.forEach((node, index) => {
+					const isLeaf = isLeafNode(node);
+					const isExpanded = isExpandedKey(node.key) || isActive && autoExpandKeys.has(node.key);
+					rows.push({
+						node,
+						isExpanded,
+						isLeaf,
+						isMatched: matchedKeys.has(node.key),
+						posInSet: index + 1,
+						setSize: siblings.length,
+						isLoading: isLoadingKey(node.key),
+						branchColors: ancestorColors
+					});
+					if (!isExpanded || node.childNodes.length === 0) return;
+					const color = options.branchColorFor?.(node);
+					walk(node.childNodes, color ? [...ancestorColors, color] : ancestorColors);
+				});
+			};
+			walk(roots, []);
+			return rows;
+		}),
+		filterValue,
+		expandedKeys,
+		loadedChildren,
+		checkedKeys,
+		checkStates,
+		loadingKeys,
+		loadedKeys,
+		currentKey,
+		treeModel,
+		filterInfo,
+		filter,
+		isExpandedKey,
+		setExpandedKey,
+		toggleExpand,
+		setCurrentKey,
+		getCurrentKey,
+		getCurrentNode,
+		setCurrentNode,
+		getNode,
+		canMoveNode,
+		moveNode,
+		appendNode,
+		removeNode,
+		insertNodeBefore,
+		insertNodeAfter,
+		getCheckState,
+		setChecked,
+		toggleChecked,
+		getCheckedKeys,
+		setCheckedKeys,
+		getHalfCheckedKeys,
+		isLeafNode,
+		isLoadingKey,
+		ensureLoaded
+	};
+}
+//#endregion
+export { createGrTreeDataAdapter as n, useTree as t };

package/dist/chunks/useTree-BebEiBcL.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useTree-BebEiBcL.js","names":[],"sources":["../../src/composables/internal/treeAdapter.ts","../../src/composables/internal/treeChecking.ts","../../src/composables/useTree.ts"],"sourcesContent":["import type { GrTreeKey } from '../../components/GrTree/grTreeTypes'\nimport type {\n  GrTreeDataProps,\n  GrTreePropsMap,\n} from '../../components/GrTree/grTreeProps'\n\nconst DEFAULT_CHILDREN_KEY = 'children'\nconst DEFAULT_LABEL_KEY = 'label'\nconst DEFAULT_IS_LEAF_KEY = 'isLeaf'\n\nexport type GrTreeDataAdapterOptions<T extends object> = Pick<GrTreeDataProps<T>, 'props' | 'nodeKey'>\n\nexport type GrTreeDataAdapter<T extends object> = {\n  hasNodeKey: () => boolean\n  getChildrenKey: () => string\n  getLabelKey: () => string\n  getLabel: (data: T) => string\n  /** Признак «лист» из данных. `undefined` — данные молчат, решает вызывающий. */\n  getIsLeaf: (data: T) => boolean | undefined\n  getChildren: (data: T) => T[]\n  ensureChildren: (data: T) => T[]\n  getNodeKey: (data: T, index: number, parentKey: GrTreeKey | undefined) => GrTreeKey\n  getExplicitNodeKey: (data: T) => GrTreeKey | undefined\n}\n\nfunction isTreeKey(value: unknown): value is GrTreeKey {\n  return typeof value === 'string' || typeof value === 'number'\n}\n\nfunction resolveMapValue(map: GrTreePropsMap | undefined, key: keyof GrTreePropsMap, fallback: string) {\n  return map?.[key] ?? fallback\n}\n\nexport function createGrTreeDataAdapter<T extends object>(\n  options: GrTreeDataAdapterOptions<T>,\n): GrTreeDataAdapter<T> {\n  function hasNodeKey() {\n    return options.nodeKey != null\n  }\n\n  function getChildrenKey() {\n    return resolveMapValue(options.props, 'children', DEFAULT_CHILDREN_KEY)\n  }\n\n  function getLabelKey() {\n    return resolveMapValue(options.props, 'label', DEFAULT_LABEL_KEY)\n  }\n\n  function getLabel(data: T): string {\n    const key = getLabelKey() as keyof T\n    const value = data[key]\n    return value == null ? '' : String(value)\n  }\n\n  function getIsLeaf(data: T): boolean | undefined {\n    const key = resolveMapValue(options.props, 'isLeaf', DEFAULT_IS_LEAF_KEY)\n    const value = (data as Record<string, unknown>)[key]\n    return typeof value === 'boolean' ? value : undefined\n  }\n\n  function getChildren(data: T): T[] {\n    const key = getChildrenKey() as keyof T\n    const value = data[key]\n    return Array.isArray(value) ? (value as T[]) : []\n  }\n\n  function ensureChildren(data: T): T[] {\n    const key = getChildrenKey()\n    const record = data as Record<string, unknown>\n    if (Array.isArray(record[key])) {\n      return record[key] as T[]\n    }\n\n    record[key] = []\n\n    // Читаем обратно, а не возвращаем только что созданный массив: у\n    // реактивных данных чтение отдаёт прокси, и только запись через него\n    // видна дереву. Иначе `push` уходит мимо реактивности, и добавленные\n    // дети не появляются на экране.\n    return record[key] as T[]\n  }\n\n  function getExplicitNodeKey(data: T): GrTreeKey | undefined {\n    if (options.nodeKey == null)\n      return undefined\n\n    const keyName = options.nodeKey as keyof T\n    const value = data[keyName] as unknown\n    return isTreeKey(value) ? value : undefined\n  }\n\n  function getNodeKey(data: T, index: number, parentKey: GrTreeKey | undefined): GrTreeKey {\n    const explicitKey = getExplicitNodeKey(data)\n    if (explicitKey != null)\n      return explicitKey\n\n    return parentKey == null ? index : `${String(parentKey)}:${index}`\n  }\n\n  return {\n    hasNodeKey,\n    getChildrenKey,\n    getLabelKey,\n    getLabel,\n    getIsLeaf,\n    getChildren,\n    ensureChildren,\n    getNodeKey,\n    getExplicitNodeKey,\n  }\n}\n","import type { GrTreeKey, GrTreeNode } from '../../components/GrTree/grTreeTypes'\n\n/**\n * Состояние отметки узла. `half` — часть потомков отмечена: в ARIA это\n * `aria-checked=\"mixed\"`.\n */\nexport const GR_TREE_CHECK_STATES = ['checked', 'half', 'unchecked'] as const\n\nexport type GrTreeCheckState = typeof GR_TREE_CHECK_STATES[number]\n\nexport type GrTreeCheckStates = Map<GrTreeKey, GrTreeCheckState>\n\n/**\n * Раскладывает отмеченные ключи по всему дереву: родитель отмечен, когда\n * отмечены все дети, и наполовину — когда часть.\n *\n * Считается от листьев вверх, поэтому `checkedKeys` снаружи может содержать\n * только листья (типовой формат ответа сервера) — родители посчитаются сами.\n * При `strict` дерево не связывает узлы вовсе: каждый отвечает сам за себя.\n */\nexport function resolveCheckStates<T>(\n  roots: GrTreeNode<T>[],\n  checkedKeys: Set<GrTreeKey>,\n  strict: boolean,\n): GrTreeCheckStates {\n  const states: GrTreeCheckStates = new Map()\n\n  const walk = (node: GrTreeNode<T>): GrTreeCheckState => {\n    if (strict || node.childNodes.length === 0) {\n      const state: GrTreeCheckState = checkedKeys.has(node.key) ? 'checked' : 'unchecked'\n      // В strict-режиме потомков всё равно нужно обойти: у них своё состояние.\n      if (strict)\n        node.childNodes.forEach(walk)\n      states.set(node.key, state)\n      return state\n    }\n\n    const childStates = node.childNodes.map(walk)\n    const allChecked = childStates.every(s => s === 'checked')\n    const someMarked = childStates.some(s => s !== 'unchecked')\n\n    const state: GrTreeCheckState = allChecked\n      ? 'checked'\n      : (someMarked || checkedKeys.has(node.key) ? 'half' : 'unchecked')\n\n    states.set(node.key, state)\n    return state\n  }\n\n  roots.forEach(walk)\n  return states\n}\n\n/**\n * Новый набор отмеченных ключей после переключения узла.\n *\n * Каскад идёт вниз (все потомки повторяют решение) и вверх (родитель отмечен,\n * только если отмечены все его дети). Возвращается набор с родителями —\n * `getCheckedKeys({ leafOnly: true })` при необходимости отбросит их обратно.\n */\nexport function toggleCheckedKeys<T>(\n  roots: GrTreeNode<T>[],\n  checkedKeys: Set<GrTreeKey>,\n  node: GrTreeNode<T>,\n  checked: boolean,\n  strict: boolean,\n): Set<GrTreeKey> {\n  const next = new Set(checkedKeys)\n\n  if (strict) {\n    if (checked)\n      next.add(node.key)\n    else next.delete(node.key)\n    return next\n  }\n\n  const applyDown = (target: GrTreeNode<T>): void => {\n    if (checked)\n      next.add(target.key)\n    else next.delete(target.key)\n    target.childNodes.forEach(applyDown)\n  }\n  applyDown(node)\n\n  for (let parent = node.parent; parent; parent = parent.parent) {\n    const allChecked = parent.childNodes.every(child => next.has(child.key))\n    if (allChecked)\n      next.add(parent.key)\n    else next.delete(parent.key)\n  }\n\n  // Отметки узлов, которых уже нет в дереве, тянуть незачем.\n  return pruneToTree(roots, next)\n}\n\n/** Отбрасывает ключи, которых нет в текущей модели (данные могли смениться). */\nexport function pruneToTree<T>(roots: GrTreeNode<T>[], keys: Set<GrTreeKey>): Set<GrTreeKey> {\n  const known = new Set<GrTreeKey>()\n  const walk = (node: GrTreeNode<T>): void => {\n    known.add(node.key)\n    node.childNodes.forEach(walk)\n  }\n  roots.forEach(walk)\n\n  const next = new Set<GrTreeKey>()\n  for (const key of keys) {\n    if (known.has(key))\n      next.add(key)\n  }\n  return next\n}\n\n/** Ключи в состоянии `checked`; `leafOnly` оставляет только листья. */\nexport function collectCheckedKeys<T>(\n  roots: GrTreeNode<T>[],\n  states: GrTreeCheckStates,\n  leafOnly: boolean,\n): GrTreeKey[] {\n  const out: GrTreeKey[] = []\n\n  const walk = (node: GrTreeNode<T>): void => {\n    const isLeaf = node.childNodes.length === 0\n    if (states.get(node.key) === 'checked' && (!leafOnly || isLeaf))\n      out.push(node.key)\n    node.childNodes.forEach(walk)\n  }\n\n  roots.forEach(walk)\n  return out\n}\n\n/** Ключи в состоянии `half` — родители с частично отмеченными потомками. */\nexport function collectHalfCheckedKeys(states: GrTreeCheckStates): GrTreeKey[] {\n  const out: GrTreeKey[] = []\n  for (const [key, state] of states) {\n    if (state === 'half')\n      out.push(key)\n  }\n  return out\n}\n","import type { ComputedRef, MaybeRefOrGetter, Ref, ShallowRef } from 'vue'\nimport { computed, ref, shallowRef, toValue, watch } from 'vue'\nimport type {\n  GrTreeKey,\n  GrTreeNode,\n  GrTreeNodeDropType,\n  GrTreeNodeTarget,\n} from '../components/GrTree/grTreeTypes'\nimport type { GrTreeDataAdapter } from './internal/treeAdapter'\nimport { createGrTreeDataAdapter } from './internal/treeAdapter'\nimport type { GrTreeDataProps, GrTreeLoad, GrTreePropsMap, GrTreeVisibleRow } from '../components/GrTree/grTreeProps'\nimport type { GrTreeCheckState, GrTreeCheckStates } from './internal/treeChecking'\nimport {\n  collectCheckedKeys,\n  collectHalfCheckedKeys,\n  pruneToTree,\n  resolveCheckStates,\n  toggleCheckedKeys,\n} from './internal/treeChecking'\n\nexport type GrTreeModel<T extends object> = {\n  roots: GrTreeNode<T>[]\n  byKey: Map<GrTreeKey, GrTreeNode<T>>\n  byData: WeakMap<T, GrTreeNode<T>>\n}\n\nexport type GrTreeFilterInfo = {\n  isActive: boolean\n  subtreeHasMatch: Map<GrTreeKey, boolean>\n  matchedKeys: Set<GrTreeKey>\n  autoExpandKeys: Set<GrTreeKey>\n}\n\nexport type UseTreeOptions<T extends object> = {\n  data: MaybeRefOrGetter<GrTreeDataProps<T>['data']>\n  defaultExpandedKeys?: MaybeRefOrGetter<GrTreeDataProps<T>['defaultExpandedKeys']>\n  defaultExpandAll?: MaybeRefOrGetter<boolean | undefined>\n  /**\n   * Совпал ли узел с запросом фильтра.\n   *\n   * Обычная функция, а не `MaybeRefOrGetter`: `toValue` не отличает геттер от\n   * значения-функции и вызвал бы её вместо того, чтобы вернуть. Реактивность\n   * при этом не теряется — потребитель читает своё состояние внутри вызова.\n   */\n  /**\n   * Совпал ли узел с запросом. Вернуть `undefined` — оставить решение модели\n   * (подстрочный матч по подписи).\n   */\n  filterNodeMethod?: (value: string, data: T, node: GrTreeNode<T>) => boolean | undefined\n  defaultCheckedKeys?: MaybeRefOrGetter<GrTreeKey[] | undefined>\n  /** Внешние отмеченные ключи (`v-model:checked-keys`), если потребитель их ведёт. */\n  checkedKeys?: MaybeRefOrGetter<GrTreeKey[] | undefined>\n  checkStrictly?: MaybeRefOrGetter<boolean | undefined>\n  lazy?: MaybeRefOrGetter<boolean | undefined>\n  /** Загрузка детей ветки. Обычная функция — по той же причине, что `filterNodeMethod`. */\n  load?: GrTreeLoad<T>\n  /** Форма данных: поля детей, подписи и признака листа. */\n  props?: GrTreePropsMap\n  /** Поле-идентификатор узла. */\n  nodeKey?: GrTreeDataProps<T>['nodeKey']\n  /**\n   * Готовый адаптер. Не задан — собирается из `props` и `nodeKey`.\n   *\n   * Необязателен намеренно: фабрика адаптера наружу не публикуется, и\n   * требовать её значило бы сделать композабл невызываемым вне пакета.\n   * Компонент передаёт свой, потому что уже собрал его для себя.\n   */\n  adapter?: GrTreeDataAdapter<T>\n  /**\n   * Цвет направляющей уровня для узла. Не задан — `branchColors` у строк\n   * остаётся пустым: направляющие рисует потребитель, и модель о них не знает.\n   *\n   * Обычная функция, а не `MaybeRefOrGetter`: `toValue` не отличает геттер от\n   * значения-функции и вызвал бы её вместо того, чтобы вернуть.\n   */\n  branchColorFor?: (node: GrTreeNode<T>) => string | undefined | null\n}\n\nexport type UseTreeReturn<T extends object> = {\n  filterValue: Ref<string>\n  expandedKeys: ShallowRef<Set<GrTreeKey>>\n  checkedKeys: ShallowRef<Set<GrTreeKey>>\n  checkStates: ComputedRef<GrTreeCheckStates>\n  loadingKeys: ShallowRef<Set<GrTreeKey>>\n  loadedKeys: ShallowRef<Set<GrTreeKey>>\n  loadedChildren: ShallowRef<Map<GrTreeKey, T[]>>\n  currentKey: Ref<GrTreeKey | undefined>\n  /**\n   * Видимые строки одним плоским списком в порядке отображения — то, из чего\n   * строится разметка. Иерархию несут `node.level`, `posInSet` и `setSize`:\n   * в плоском DOM группы нет, и структуру диктору сообщают они.\n   */\n  visibleRows: ComputedRef<GrTreeVisibleRow<T>[]>\n  treeModel: ComputedRef<GrTreeModel<T>>\n  filterInfo: ComputedRef<GrTreeFilterInfo>\n  filter: (value: string) => void\n  isExpandedKey: (key: GrTreeKey) => boolean\n  setExpandedKey: (key: GrTreeKey, expanded: boolean) => void\n  toggleExpand: (node: GrTreeNode<T>) => void\n  setCurrentKey: (key?: GrTreeKey) => void\n  getCurrentKey: () => GrTreeKey | undefined\n  getCurrentNode: () => GrTreeNode<T> | undefined\n  setCurrentNode: (node?: GrTreeNodeTarget<T>) => boolean\n  getNode: (key: GrTreeKey) => GrTreeNode<T> | undefined\n  canMoveNode: (node: GrTreeNodeTarget<T>, referenceNode: GrTreeNodeTarget<T>, dropType: GrTreeNodeDropType) => boolean\n  moveNode: (node: GrTreeNodeTarget<T>, referenceNode: GrTreeNodeTarget<T>, dropType: GrTreeNodeDropType) => GrTreeNode<T> | undefined\n  appendNode: (data: T, parent: GrTreeNodeTarget<T>) => GrTreeNode<T> | undefined\n  removeNode: (node: GrTreeNodeTarget<T>) => boolean\n  insertNodeBefore: (data: T, referenceNode: GrTreeNodeTarget<T>) => GrTreeNode<T> | undefined\n  insertNodeAfter: (data: T, referenceNode: GrTreeNodeTarget<T>) => GrTreeNode<T> | undefined\n  getCheckState: (key: GrTreeKey) => GrTreeCheckState\n  setChecked: (node: GrTreeNodeTarget<T>, checked: boolean) => GrTreeNode<T> | undefined\n  toggleChecked: (node: GrTreeNode<T>) => GrTreeNode<T> | undefined\n  getCheckedKeys: (options?: { leafOnly?: boolean }) => GrTreeKey[]\n  setCheckedKeys: (keys: GrTreeKey[]) => void\n  getHalfCheckedKeys: () => GrTreeKey[]\n  /** Лист ли узел с точки зрения раскрытия: в ленивом режиме решают данные и факт загрузки. */\n  isLeafNode: (node: GrTreeNode<T>) => boolean\n  isLoadingKey: (key: GrTreeKey) => boolean\n  /** Грузит детей ветки, если это нужно и ещё не делалось. */\n  ensureLoaded: (node: GrTreeNode<T>) => void\n}\n\nexport function useTree<T extends object>(\n  options: UseTreeOptions<T>,\n): UseTreeReturn<T> {\n  const adapter = options.adapter\n    ?? createGrTreeDataAdapter<T>({ props: options.props, nodeKey: options.nodeKey })\n\n  const filterValue = ref('')\n  const expandedKeys = shallowRef<Set<GrTreeKey>>(new Set())\n  const checkedKeys = shallowRef<Set<GrTreeKey>>(new Set(toValue(options.defaultCheckedKeys) ?? []))\n  const loadingKeys = shallowRef<Set<GrTreeKey>>(new Set())\n  const loadedKeys = shallowRef<Set<GrTreeKey>>(new Set())\n  // Дети, пришедшие ленивой загрузкой, живут в сторе, а не в данных потребителя:\n  // `data` — обычный проп и реактивным быть не обязан, а дерево обязано\n  // показать загруженное в любом случае.\n  const loadedChildren = shallowRef<Map<GrTreeKey, T[]>>(new Map())\n  const currentKey = ref<GrTreeKey | undefined>(undefined)\n  const getData = () => toValue(options.data) ?? []\n  const getFilterNodeMethod = () => options.filterNodeMethod\n\n  watch(\n    () => toValue(options.defaultExpandedKeys),\n    (keys) => {\n      expandedKeys.value = new Set(keys ?? [])\n    },\n    { immediate: true },\n  )\n\n  // Внешние отметки: компонент управляемый, пока проп задан. Не задан — ведёт\n  // набор сам, начиная с `defaultCheckedKeys`.\n  watch(\n    () => toValue(options.checkedKeys),\n    (keys) => {\n      if (keys)\n        checkedKeys.value = new Set(keys)\n    },\n    { immediate: true },\n  )\n\n  const treeModel = computed<GrTreeModel<T>>(() => {\n    const byKey = new Map<GrTreeKey, GrTreeNode<T>>()\n    const byData = new WeakMap<T, GrTreeNode<T>>()\n\n    const build = (items: T[], parent: GrTreeNode<T> | undefined, level: number): GrTreeNode<T>[] => {\n      return items.map((item, index) => {\n        const node: GrTreeNode<T> = {\n          key: adapter.getNodeKey(item, index, parent?.key),\n          label: adapter.getLabel(item),\n          data: item,\n          level,\n          parent,\n          childNodes: [],\n        }\n\n        byKey.set(node.key, node)\n        byData.set(item, node)\n\n        const ownChildren = adapter.getChildren(item)\n        const lazyChildren = loadedChildren.value.get(node.key) ?? []\n        node.childNodes = build([...ownChildren, ...lazyChildren], node, level + 1)\n\n        return node\n      })\n    }\n\n    return {\n      roots: build(getData(), undefined, 1),\n      byKey,\n      byData,\n    }\n  })\n\n  // `defaultExpandAll` раскрывает узел один раз — в момент его появления в\n  // данных. Иначе любое обновление `data` отменяло бы всё, что пользователь\n  // свернул руками.\n  const autoExpandedKeys = new Set<GrTreeKey>()\n  watch(treeModel, (model) => {\n    if (!toValue(options.defaultExpandAll))\n      return\n\n    const next = new Set(expandedKeys.value)\n    let changed = false\n\n    for (const key of model.byKey.keys()) {\n      if (autoExpandedKeys.has(key))\n        continue\n\n      autoExpandedKeys.add(key)\n      next.add(key)\n      changed = true\n    }\n\n    if (changed)\n      expandedKeys.value = next\n  }, { immediate: true })\n\n  const filterInfo = computed<GrTreeFilterInfo>(() => {\n    const value = filterValue.value\n    const isActive = value.trim().length > 0\n    const valueLower = value.toLowerCase()\n    const subtreeHasMatch = new Map<GrTreeKey, boolean>()\n    const matchedKeys = new Set<GrTreeKey>()\n    const autoExpandKeys = new Set<GrTreeKey>()\n\n    if (!isActive) {\n      return {\n        isActive,\n        subtreeHasMatch,\n        matchedKeys,\n        autoExpandKeys,\n      }\n    }\n\n    const match = (node: GrTreeNode<T>): boolean => {\n      // `undefined` от метода означает «решай сам»: обёртка компонента отдаёт\n      // его, когда своего правила потребитель не задал, — иначе она не смогла\n      // бы вернуть модель к дефолту, оставаясь обычной функцией.\n      const custom = getFilterNodeMethod()?.(value, node.data, node)\n\n      if (custom !== undefined)\n        return custom\n\n      return node.label.toLowerCase().includes(valueLower)\n    }\n\n    const walk = (nodes: GrTreeNode<T>[]): boolean => {\n      let any = false\n\n      for (const node of nodes) {\n        const self = match(node)\n        const childAny = walk(node.childNodes)\n        const has = self || childAny\n\n        subtreeHasMatch.set(node.key, has)\n\n        if (self)\n          matchedKeys.add(node.key)\n\n        if (childAny)\n          autoExpandKeys.add(node.key)\n\n        any ||= has\n      }\n\n      return any\n    }\n\n    walk(treeModel.value.roots)\n\n    return {\n      isActive,\n      subtreeHasMatch,\n      matchedKeys,\n      autoExpandKeys,\n    }\n  })\n\n  function getNode(key: GrTreeKey) {\n    return treeModel.value.byKey.get(key)\n  }\n\n  function findNodeByData(data: T): GrTreeNode<T> | undefined {\n    return treeModel.value.byData.get(data)\n  }\n\n  function isTreeNode(target: GrTreeNodeTarget<T>): target is GrTreeNode<T> {\n    return typeof target === 'object'\n      && target !== null\n      && 'key' in target\n      && 'data' in target\n      && 'childNodes' in target\n  }\n\n  function resolveNodeTarget(target?: GrTreeNodeTarget<T>): GrTreeNode<T> | undefined {\n    if (target == null)\n      return undefined\n\n    if (typeof target === 'string' || typeof target === 'number')\n      return getNode(target)\n\n    if (isTreeNode(target))\n      return getNode(target.key) ?? target\n\n    const key = adapter.getExplicitNodeKey(target)\n    if (key != null)\n      return getNode(key)\n\n    return findNodeByData(target)\n  }\n\n  function getNodeContainer(node: GrTreeNode<T>) {\n    const items = node.parent ? adapter.ensureChildren(node.parent.data) : getData()\n\n    let index = items.findIndex(item => item === node.data)\n    if (index >= 0)\n      return { items, index }\n\n    const key = adapter.getExplicitNodeKey(node.data)\n    if (key == null)\n      return undefined\n\n    index = items.findIndex(item => adapter.getExplicitNodeKey(item) === key)\n    if (index < 0)\n      return undefined\n\n    return { items, index }\n  }\n\n  function isDescendantNode(ancestor: GrTreeNode<T>, node: GrTreeNode<T>) {\n    let current = node.parent\n\n    while (current) {\n      if (current.key === ancestor.key)\n        return true\n\n      current = current.parent\n    }\n\n    return false\n  }\n\n  function canMoveNode(node: GrTreeNodeTarget<T>, referenceNode: GrTreeNodeTarget<T>, dropType: GrTreeNodeDropType) {\n    const sourceNode = resolveNodeTarget(node)\n    const targetNode = resolveNodeTarget(referenceNode)\n\n    if (!sourceNode || !targetNode)\n      return false\n\n    if (sourceNode.key === targetNode.key)\n      return false\n\n    if (isDescendantNode(sourceNode, targetNode))\n      return false\n\n    const sourceContainer = getNodeContainer(sourceNode)\n    if (!sourceContainer)\n      return false\n\n    if (dropType === 'inner')\n      return true\n\n    return Boolean(getNodeContainer(targetNode))\n  }\n\n  function sanitizeTreeState() {\n    const byKey = treeModel.value.byKey\n\n    if (currentKey.value != null && !byKey.has(currentKey.value))\n      currentKey.value = undefined\n\n    const nextExpandedKeys = new Set(Array.from(expandedKeys.value).filter(key => byKey.has(key)))\n    if (nextExpandedKeys.size !== expandedKeys.value.size)\n      expandedKeys.value = nextExpandedKeys\n\n    const nextCheckedKeys = new Set(Array.from(checkedKeys.value).filter(key => byKey.has(key)))\n    if (nextCheckedKeys.size !== checkedKeys.value.size)\n      checkedKeys.value = nextCheckedKeys\n  }\n\n  function isExpandedKey(key: GrTreeKey): boolean {\n    return expandedKeys.value.has(key)\n  }\n\n  function setExpandedKey(key: GrTreeKey, expanded: boolean) {\n    const next = new Set(expandedKeys.value)\n\n    if (expanded)\n      next.add(key)\n    else\n      next.delete(key)\n\n    expandedKeys.value = next\n  }\n\n  function toggleExpand(node: GrTreeNode<T>) {\n    setExpandedKey(node.key, !isExpandedKey(node.key))\n  }\n\n  function setCurrentKey(key?: GrTreeKey) {\n    currentKey.value = key\n  }\n\n  function getCurrentKey() {\n    return currentKey.value\n  }\n\n  function getCurrentNode() {\n    const key = currentKey.value\n    return key == null ? undefined : getNode(key)\n  }\n\n  function setCurrentNode(node?: GrTreeNodeTarget<T>) {\n    if (node == null) {\n      currentKey.value = undefined\n      return true\n    }\n\n    const targetNode = resolveNodeTarget(node)\n    if (!targetNode)\n      return false\n\n    currentKey.value = targetNode.key\n    return true\n  }\n\n  function resolveInsertedNode(data: T) {\n    const key = adapter.getExplicitNodeKey(data)\n    if (key != null)\n      return getNode(key)\n\n    return findNodeByData(data)\n  }\n\n  function moveNode(node: GrTreeNodeTarget<T>, referenceNode: GrTreeNodeTarget<T>, dropType: GrTreeNodeDropType) {\n    const sourceNode = resolveNodeTarget(node)\n    const targetNode = resolveNodeTarget(referenceNode)\n\n    if (!sourceNode || !targetNode)\n      return undefined\n\n    if (!canMoveNode(sourceNode, targetNode, dropType))\n      return undefined\n\n    const sourceContainer = getNodeContainer(sourceNode)\n    if (!sourceContainer)\n      return undefined\n\n    let destinationItems: T[]\n    let destinationIndex: number\n\n    if (dropType === 'inner') {\n      destinationItems = adapter.ensureChildren(targetNode.data)\n      destinationIndex = destinationItems.length\n    }\n    else {\n      const targetContainer = getNodeContainer(targetNode)\n      if (!targetContainer)\n        return undefined\n\n      destinationItems = targetContainer.items\n      destinationIndex = dropType === 'prev'\n        ? targetContainer.index\n        : targetContainer.index + 1\n    }\n\n    if (destinationItems === sourceContainer.items && sourceContainer.index < destinationIndex)\n      destinationIndex -= 1\n\n    const [movedData] = sourceContainer.items.splice(sourceContainer.index, 1)\n    destinationItems.splice(destinationIndex, 0, movedData)\n\n    if (dropType === 'inner')\n      setExpandedKey(targetNode.key, true)\n\n    sanitizeTreeState()\n    return resolveInsertedNode(movedData)\n  }\n\n  function appendNode(data: T, parent: GrTreeNodeTarget<T>) {\n    const parentNode = resolveNodeTarget(parent)\n    if (!parentNode)\n      return undefined\n\n    adapter.ensureChildren(parentNode.data).push(data)\n    setExpandedKey(parentNode.key, true)\n    sanitizeTreeState()\n    return resolveInsertedNode(data)\n  }\n\n  function removeNode(node: GrTreeNodeTarget<T>) {\n    if (!adapter.hasNodeKey())\n      return false\n\n    const targetNode = resolveNodeTarget(node)\n    if (!targetNode)\n      return false\n\n    const container = getNodeContainer(targetNode)\n    if (!container)\n      return false\n\n    container.items.splice(container.index, 1)\n    sanitizeTreeState()\n    return true\n  }\n\n  function insertNodeBefore(data: T, referenceNode: GrTreeNodeTarget<T>) {\n    const targetNode = resolveNodeTarget(referenceNode)\n    if (!targetNode)\n      return undefined\n\n    const container = getNodeContainer(targetNode)\n    if (!container)\n      return undefined\n\n    container.items.splice(container.index, 0, data)\n    sanitizeTreeState()\n    return resolveInsertedNode(data)\n  }\n\n  function insertNodeAfter(data: T, referenceNode: GrTreeNodeTarget<T>) {\n    const targetNode = resolveNodeTarget(referenceNode)\n    if (!targetNode)\n      return undefined\n\n    const container = getNodeContainer(targetNode)\n    if (!container)\n      return undefined\n\n    container.items.splice(container.index + 1, 0, data)\n    sanitizeTreeState()\n    return resolveInsertedNode(data)\n  }\n\n  // ————— Отметки (чекбоксы).\n\n  const checkStates = computed<GrTreeCheckStates>(() => resolveCheckStates(\n    treeModel.value.roots,\n    checkedKeys.value,\n    Boolean(toValue(options.checkStrictly)),\n  ))\n\n  function getCheckState(key: GrTreeKey): GrTreeCheckState {\n    return checkStates.value.get(key) ?? 'unchecked'\n  }\n\n  function setChecked(node: GrTreeNodeTarget<T>, checked: boolean) {\n    const targetNode = resolveNodeTarget(node)\n    if (!targetNode)\n      return undefined\n\n    checkedKeys.value = toggleCheckedKeys(\n      treeModel.value.roots,\n      checkedKeys.value,\n      targetNode,\n      checked,\n      Boolean(toValue(options.checkStrictly)),\n    )\n\n    return targetNode\n  }\n\n  function toggleChecked(node: GrTreeNode<T>) {\n    return setChecked(node, getCheckState(node.key) !== 'checked')\n  }\n\n  function getCheckedKeys(opts?: { leafOnly?: boolean }) {\n    return collectCheckedKeys(treeModel.value.roots, checkStates.value, Boolean(opts?.leafOnly))\n  }\n\n  function setCheckedKeys(keys: GrTreeKey[]) {\n    checkedKeys.value = pruneToTree(treeModel.value.roots, new Set(keys))\n  }\n\n  function getHalfCheckedKeys() {\n    return collectHalfCheckedKeys(checkStates.value)\n  }\n\n  // ————— Ленивая подгрузка ветки.\n\n  function isLeafNode(node: GrTreeNode<T>): boolean {\n    if (node.childNodes.length > 0)\n      return false\n\n    if (!toValue(options.lazy))\n      return true\n\n    const declared = adapter.getIsLeaf(node.data)\n    if (declared !== undefined)\n      return declared\n\n    // Данные молчат: пока ветку не грузили, считаем её разворачиваемой —\n    // иначе до первого запроса дело бы не дошло.\n    return loadedKeys.value.has(node.key)\n  }\n\n  function isLoadingKey(key: GrTreeKey): boolean {\n    return loadingKeys.value.has(key)\n  }\n\n  function markLoading(key: GrTreeKey, loading: boolean) {\n    const next = new Set(loadingKeys.value)\n    if (loading)\n      next.add(key)\n    else\n      next.delete(key)\n    loadingKeys.value = next\n  }\n\n  function ensureLoaded(node: GrTreeNode<T>) {\n    const load = options.load\n    if (!toValue(options.lazy) || !load)\n      return\n\n    if (loadedKeys.value.has(node.key) || loadingKeys.value.has(node.key) || isLeafNode(node))\n      return\n\n    markLoading(node.key, true)\n\n    let settled = false\n    load(node, (children) => {\n      // Ответ приходит от потребителя: второй вызов `resolve` — его ошибка, но\n      // дублировать детей из-за неё дерево не обязано.\n      if (settled)\n        return\n      settled = true\n\n      const next = new Map(loadedChildren.value)\n      next.set(node.key, [...(children ?? [])])\n      loadedChildren.value = next\n      loadedKeys.value = new Set(loadedKeys.value).add(node.key)\n      markLoading(node.key, false)\n    })\n  }\n  function filter(value: string) {\n    filterValue.value = value\n  }\n\n  /**\n   * Плоско — потому что рекурсивный рендер стоил по инстансу компонента на\n   * каждый раскрытый узел: дерево на 2 000 видимых строк превращалось в 2 000\n   * компонентов со своими вычислениями и подписками.\n   */\n  const visibleRows = computed<GrTreeVisibleRow<T>[]>(() => {\n    const { roots } = treeModel.value\n    const { isActive, subtreeHasMatch, matchedKeys, autoExpandKeys } = filterInfo.value\n    const rows: GrTreeVisibleRow<T>[] = []\n\n    const walk = (nodes: GrTreeNode<T>[], ancestorColors: string[]): void => {\n      const siblings = isActive ? nodes.filter(node => subtreeHasMatch.get(node.key)) : nodes\n\n      siblings.forEach((node, index) => {\n        const isLeaf = isLeafNode(node)\n        const isExpanded = isExpandedKey(node.key) || (isActive && autoExpandKeys.has(node.key))\n\n        rows.push({\n          node,\n          isExpanded,\n          isLeaf,\n          isMatched: matchedKeys.has(node.key),\n          posInSet: index + 1,\n          setSize: siblings.length,\n          isLoading: isLoadingKey(node.key),\n          branchColors: ancestorColors,\n        })\n\n        if (!isExpanded || node.childNodes.length === 0)\n          return\n\n        const color = options.branchColorFor?.(node)\n\n        walk(node.childNodes, color ? [...ancestorColors, color] : ancestorColors)\n      })\n    }\n\n    walk(roots, [])\n\n    return rows\n  })\n\n  return {\n    visibleRows,\n    filterValue,\n    expandedKeys,\n    loadedChildren,\n    checkedKeys,\n    checkStates,\n    loadingKeys,\n    loadedKeys,\n    currentKey,\n    treeModel,\n    filterInfo,\n    filter,\n    isExpandedKey,\n    setExpandedKey,\n    toggleExpand,\n    setCurrentKey,\n    getCurrentKey,\n    getCurrentNode,\n    setCurrentNode,\n    getNode,\n    canMoveNode,\n    moveNode,\n    appendNode,\n    removeNode,\n    insertNodeBefore,\n    insertNodeAfter,\n    getCheckState,\n    setChecked,\n    toggleChecked,\n    getCheckedKeys,\n    setCheckedKeys,\n    getHalfCheckedKeys,\n    isLeafNode,\n    isLoadingKey,\n    ensureLoaded,\n  }\n}\n"],"mappings":";;AAMA,IAAM,uBAAuB;AAC7B,IAAM,oBAAoB;AAC1B,IAAM,sBAAsB;AAiB5B,SAAS,UAAU,OAAoC;CACrD,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU;AACvD;AAEA,SAAS,gBAAgB,KAAiC,KAA2B,UAAkB;CACrG,OAAO,MAAM,QAAQ;AACvB;AAEA,SAAgB,wBACd,SACsB;CACtB,SAAS,aAAa;EACpB,OAAO,QAAQ,WAAW;CAC5B;CAEA,SAAS,iBAAiB;EACxB,OAAO,gBAAgB,QAAQ,OAAO,YAAY,oBAAoB;CACxE;CAEA,SAAS,cAAc;EACrB,OAAO,gBAAgB,QAAQ,OAAO,SAAS,iBAAiB;CAClE;CAEA,SAAS,SAAS,MAAiB;EAEjC,MAAM,QAAQ,KADF,YACO;EACnB,OAAO,SAAS,OAAO,KAAK,OAAO,KAAK;CAC1C;CAEA,SAAS,UAAU,MAA8B;EAE/C,MAAM,QAAS,KADH,gBAAgB,QAAQ,OAAO,UAAU,mBACL;EAChD,OAAO,OAAO,UAAU,YAAY,QAAQ,KAAA;CAC9C;CAEA,SAAS,YAAY,MAAc;EAEjC,MAAM,QAAQ,KADF,eACO;EACnB,OAAO,MAAM,QAAQ,KAAK,IAAK,QAAgB,CAAC;CAClD;CAEA,SAAS,eAAe,MAAc;EACpC,MAAM,MAAM,eAAe;EAC3B,MAAM,SAAS;EACf,IAAI,MAAM,QAAQ,OAAO,IAAI,GAC3B,OAAO,OAAO;EAGhB,OAAO,OAAO,CAAC;EAMf,OAAO,OAAO;CAChB;CAEA,SAAS,mBAAmB,MAAgC;EAC1D,IAAI,QAAQ,WAAW,MACrB,OAAO,KAAA;EAGT,MAAM,QAAQ,KADE,QAAQ;EAExB,OAAO,UAAU,KAAK,IAAI,QAAQ,KAAA;CACpC;CAEA,SAAS,WAAW,MAAS,OAAe,WAA6C;EACvF,MAAM,cAAc,mBAAmB,IAAI;EAC3C,IAAI,eAAe,MACjB,OAAO;EAET,OAAO,aAAa,OAAO,QAAQ,GAAG,OAAO,SAAS,EAAE,GAAG;CAC7D;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;;;AC1FA,SAAgB,mBACd,OACA,aACA,QACmB;CACnB,MAAM,yBAA4B,IAAI,IAAI;CAE1C,MAAM,QAAQ,SAA0C;EACtD,IAAI,UAAU,KAAK,WAAW,WAAW,GAAG;GAC1C,MAAM,QAA0B,YAAY,IAAI,KAAK,GAAG,IAAI,YAAY;GAExE,IAAI,QACF,KAAK,WAAW,QAAQ,IAAI;GAC9B,OAAO,IAAI,KAAK,KAAK,KAAK;GAC1B,OAAO;EACT;EAEA,MAAM,cAAc,KAAK,WAAW,IAAI,IAAI;EAC5C,MAAM,aAAa,YAAY,OAAM,MAAK,MAAM,SAAS;EACzD,MAAM,aAAa,YAAY,MAAK,MAAK,MAAM,WAAW;EAE1D,MAAM,QAA0B,aAC5B,YACC,cAAc,YAAY,IAAI,KAAK,GAAG,IAAI,SAAS;EAExD,OAAO,IAAI,KAAK,KAAK,KAAK;EAC1B,OAAO;CACT;CAEA,MAAM,QAAQ,IAAI;CAClB,OAAO;AACT;;;;;;;;AASA,SAAgB,kBACd,OACA,aACA,MACA,SACA,QACgB;CAChB,MAAM,OAAO,IAAI,IAAI,WAAW;CAEhC,IAAI,QAAQ;EACV,IAAI,SACF,KAAK,IAAI,KAAK,GAAG;OACd,KAAK,OAAO,KAAK,GAAG;EACzB,OAAO;CACT;CAEA,MAAM,aAAa,WAAgC;EACjD,IAAI,SACF,KAAK,IAAI,OAAO,GAAG;OAChB,KAAK,OAAO,OAAO,GAAG;EAC3B,OAAO,WAAW,QAAQ,SAAS;CACrC;CACA,UAAU,IAAI;CAEd,KAAK,IAAI,SAAS,KAAK,QAAQ,QAAQ,SAAS,OAAO,QAErD,IADmB,OAAO,WAAW,OAAM,UAAS,KAAK,IAAI,MAAM,GAAG,CAClE,GACF,KAAK,IAAI,OAAO,GAAG;MAChB,KAAK,OAAO,OAAO,GAAG;CAI7B,OAAO,YAAY,OAAO,IAAI;AAChC;;AAGA,SAAgB,YAAe,OAAwB,MAAsC;CAC3F,MAAM,wBAAQ,IAAI,IAAe;CACjC,MAAM,QAAQ,SAA8B;EAC1C,MAAM,IAAI,KAAK,GAAG;EAClB,KAAK,WAAW,QAAQ,IAAI;CAC9B;CACA,MAAM,QAAQ,IAAI;CAElB,MAAM,uBAAO,IAAI,IAAe;CAChC,KAAK,MAAM,OAAO,MAChB,IAAI,MAAM,IAAI,GAAG,GACf,KAAK,IAAI,GAAG;CAEhB,OAAO;AACT;;AAGA,SAAgB,mBACd,OACA,QACA,UACa;CACb,MAAM,MAAmB,CAAC;CAE1B,MAAM,QAAQ,SAA8B;EAC1C,MAAM,SAAS,KAAK,WAAW,WAAW;EAC1C,IAAI,OAAO,IAAI,KAAK,GAAG,MAAM,cAAc,CAAC,YAAY,SACtD,IAAI,KAAK,KAAK,GAAG;EACnB,KAAK,WAAW,QAAQ,IAAI;CAC9B;CAEA,MAAM,QAAQ,IAAI;CAClB,OAAO;AACT;;AAGA,SAAgB,uBAAuB,QAAwC;CAC7E,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,CAAC,KAAK,UAAU,QACzB,IAAI,UAAU,QACZ,IAAI,KAAK,GAAG;CAEhB,OAAO;AACT;;;AChBA,SAAgB,QACd,SACkB;CAClB,MAAM,UAAU,QAAQ,WACnB,wBAA2B;EAAE,OAAO,QAAQ;EAAO,SAAS,QAAQ;CAAQ,CAAC;CAElF,MAAM,cAAc,IAAI,EAAE;CAC1B,MAAM,eAAe,2BAA2B,IAAI,IAAI,CAAC;CACzD,MAAM,cAAc,WAA2B,IAAI,IAAI,QAAQ,QAAQ,kBAAkB,KAAK,CAAC,CAAC,CAAC;CACjG,MAAM,cAAc,2BAA2B,IAAI,IAAI,CAAC;CACxD,MAAM,aAAa,2BAA2B,IAAI,IAAI,CAAC;CAIvD,MAAM,iBAAiB,2BAAgC,IAAI,IAAI,CAAC;CAChE,MAAM,aAAa,IAA2B,KAAA,CAAS;CACvD,MAAM,gBAAgB,QAAQ,QAAQ,IAAI,KAAK,CAAC;CAChD,MAAM,4BAA4B,QAAQ;CAE1C,YACQ,QAAQ,QAAQ,mBAAmB,IACxC,SAAS;EACR,aAAa,QAAQ,IAAI,IAAI,QAAQ,CAAC,CAAC;CACzC,GACA,EAAE,WAAW,KAAK,CACpB;CAIA,YACQ,QAAQ,QAAQ,WAAW,IAChC,SAAS;EACR,IAAI,MACF,YAAY,QAAQ,IAAI,IAAI,IAAI;CACpC,GACA,EAAE,WAAW,KAAK,CACpB;CAEA,MAAM,YAAY,eAA+B;EAC/C,MAAM,wBAAQ,IAAI,IAA8B;EAChD,MAAM,yBAAS,IAAI,QAA0B;EAE7C,MAAM,SAAS,OAAY,QAAmC,UAAmC;GAC/F,OAAO,MAAM,KAAK,MAAM,UAAU;IAChC,MAAM,OAAsB;KAC1B,KAAK,QAAQ,WAAW,MAAM,OAAO,QAAQ,GAAG;KAChD,OAAO,QAAQ,SAAS,IAAI;KAC5B,MAAM;KACN;KACA;KACA,YAAY,CAAC;IACf;IAEA,MAAM,IAAI,KAAK,KAAK,IAAI;IACxB,OAAO,IAAI,MAAM,IAAI;IAErB,MAAM,cAAc,QAAQ,YAAY,IAAI;IAC5C,MAAM,eAAe,eAAe,MAAM,IAAI,KAAK,GAAG,KAAK,CAAC;IAC5D,KAAK,aAAa,MAAM,CAAC,GAAG,aAAa,GAAG,YAAY,GAAG,MAAM,QAAQ,CAAC;IAE1E,OAAO;GACT,CAAC;EACH;EAEA,OAAO;GACL,OAAO,MAAM,QAAQ,GAAG,KAAA,GAAW,CAAC;GACpC;GACA;EACF;CACF,CAAC;CAKD,MAAM,mCAAmB,IAAI,IAAe;CAC5C,MAAM,YAAY,UAAU;EAC1B,IAAI,CAAC,QAAQ,QAAQ,gBAAgB,GACnC;EAEF,MAAM,OAAO,IAAI,IAAI,aAAa,KAAK;EACvC,IAAI,UAAU;EAEd,KAAK,MAAM,OAAO,MAAM,MAAM,KAAK,GAAG;GACpC,IAAI,iBAAiB,IAAI,GAAG,GAC1B;GAEF,iBAAiB,IAAI,GAAG;GACxB,KAAK,IAAI,GAAG;GACZ,UAAU;EACZ;EAEA,IAAI,SACF,aAAa,QAAQ;CACzB,GAAG,EAAE,WAAW,KAAK,CAAC;CAEtB,MAAM,aAAa,eAAiC;EAClD,MAAM,QAAQ,YAAY;EAC1B,MAAM,WAAW,MAAM,KAAK,CAAC,CAAC,SAAS;EACvC,MAAM,aAAa,MAAM,YAAY;EACrC,MAAM,kCAAkB,IAAI,IAAwB;EACpD,MAAM,8BAAc,IAAI,IAAe;EACvC,MAAM,iCAAiB,IAAI,IAAe;EAE1C,IAAI,CAAC,UACH,OAAO;GACL;GACA;GACA;GACA;EACF;EAGF,MAAM,SAAS,SAAiC;GAI9C,MAAM,SAAS,oBAAoB,CAAC,GAAG,OAAO,KAAK,MAAM,IAAI;GAE7D,IAAI,WAAW,KAAA,GACb,OAAO;GAET,OAAO,KAAK,MAAM,YAAY,CAAC,CAAC,SAAS,UAAU;EACrD;EAEA,MAAM,QAAQ,UAAoC;GAChD,IAAI,MAAM;GAEV,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,OAAO,MAAM,IAAI;IACvB,MAAM,WAAW,KAAK,KAAK,UAAU;IACrC,MAAM,MAAM,QAAQ;IAEpB,gBAAgB,IAAI,KAAK,KAAK,GAAG;IAEjC,IAAI,MACF,YAAY,IAAI,KAAK,GAAG;IAE1B,IAAI,UACF,eAAe,IAAI,KAAK,GAAG;IAE7B,QAAQ;GACV;GAEA,OAAO;EACT;EAEA,KAAK,UAAU,MAAM,KAAK;EAE1B,OAAO;GACL;GACA;GACA;GACA;EACF;CACF,CAAC;CAED,SAAS,QAAQ,KAAgB;EAC/B,OAAO,UAAU,MAAM,MAAM,IAAI,GAAG;CACtC;CAEA,SAAS,eAAe,MAAoC;EAC1D,OAAO,UAAU,MAAM,OAAO,IAAI,IAAI;CACxC;CAEA,SAAS,WAAW,QAAsD;EACxE,OAAO,OAAO,WAAW,YACpB,WAAW,QACX,SAAS,UACT,UAAU,UACV,gBAAgB;CACvB;CAEA,SAAS,kBAAkB,QAAyD;EAClF,IAAI,UAAU,MACZ,OAAO,KAAA;EAET,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UAClD,OAAO,QAAQ,MAAM;EAEvB,IAAI,WAAW,MAAM,GACnB,OAAO,QAAQ,OAAO,GAAG,KAAK;EAEhC,MAAM,MAAM,QAAQ,mBAAmB,MAAM;EAC7C,IAAI,OAAO,MACT,OAAO,QAAQ,GAAG;EAEpB,OAAO,eAAe,MAAM;CAC9B;CAEA,SAAS,iBAAiB,MAAqB;EAC7C,MAAM,QAAQ,KAAK,SAAS,QAAQ,eAAe,KAAK,OAAO,IAAI,IAAI,QAAQ;EAE/E,IAAI,QAAQ,MAAM,WAAU,SAAQ,SAAS,KAAK,IAAI;EACtD,IAAI,SAAS,GACX,OAAO;GAAE;GAAO;EAAM;EAExB,MAAM,MAAM,QAAQ,mBAAmB,KAAK,IAAI;EAChD,IAAI,OAAO,MACT,OAAO,KAAA;EAET,QAAQ,MAAM,WAAU,SAAQ,QAAQ,mBAAmB,IAAI,MAAM,GAAG;EACxE,IAAI,QAAQ,GACV,OAAO,KAAA;EAET,OAAO;GAAE;GAAO;EAAM;CACxB;CAEA,SAAS,iBAAiB,UAAyB,MAAqB;EACtE,IAAI,UAAU,KAAK;EAEnB,OAAO,SAAS;GACd,IAAI,QAAQ,QAAQ,SAAS,KAC3B,OAAO;GAET,UAAU,QAAQ;EACpB;EAEA,OAAO;CACT;CAEA,SAAS,YAAY,MAA2B,eAAoC,UAA8B;EAChH,MAAM,aAAa,kBAAkB,IAAI;EACzC,MAAM,aAAa,kBAAkB,aAAa;EAElD,IAAI,CAAC,cAAc,CAAC,YAClB,OAAO;EAET,IAAI,WAAW,QAAQ,WAAW,KAChC,OAAO;EAET,IAAI,iBAAiB,YAAY,UAAU,GACzC,OAAO;EAGT,IAAI,CADoB,iBAAiB,UACpC,GACH,OAAO;EAET,IAAI,aAAa,SACf,OAAO;EAET,OAAO,QAAQ,iBAAiB,UAAU,CAAC;CAC7C;CAEA,SAAS,oBAAoB;EAC3B,MAAM,QAAQ,UAAU,MAAM;EAE9B,IAAI,WAAW,SAAS,QAAQ,CAAC,MAAM,IAAI,WAAW,KAAK,GACzD,WAAW,QAAQ,KAAA;EAErB,MAAM,mBAAmB,IAAI,IAAI,MAAM,KAAK,aAAa,KAAK,CAAC,CAAC,QAAO,QAAO,MAAM,IAAI,GAAG,CAAC,CAAC;EAC7F,IAAI,iBAAiB,SAAS,aAAa,MAAM,MAC/C,aAAa,QAAQ;EAEvB,MAAM,kBAAkB,IAAI,IAAI,MAAM,KAAK,YAAY,KAAK,CAAC,CAAC,QAAO,QAAO,MAAM,IAAI,GAAG,CAAC,CAAC;EAC3F,IAAI,gBAAgB,SAAS,YAAY,MAAM,MAC7C,YAAY,QAAQ;CACxB;CAEA,SAAS,cAAc,KAAyB;EAC9C,OAAO,aAAa,MAAM,IAAI,GAAG;CACnC;CAEA,SAAS,eAAe,KAAgB,UAAmB;EACzD,MAAM,OAAO,IAAI,IAAI,aAAa,KAAK;EAEvC,IAAI,UACF,KAAK,IAAI,GAAG;OAEZ,KAAK,OAAO,GAAG;EAEjB,aAAa,QAAQ;CACvB;CAEA,SAAS,aAAa,MAAqB;EACzC,eAAe,KAAK,KAAK,CAAC,cAAc,KAAK,GAAG,CAAC;CACnD;CAEA,SAAS,cAAc,KAAiB;EACtC,WAAW,QAAQ;CACrB;CAEA,SAAS,gBAAgB;EACvB,OAAO,WAAW;CACpB;CAEA,SAAS,iBAAiB;EACxB,MAAM,MAAM,WAAW;EACvB,OAAO,OAAO,OAAO,KAAA,IAAY,QAAQ,GAAG;CAC9C;CAEA,SAAS,eAAe,MAA4B;EAClD,IAAI,QAAQ,MAAM;GAChB,WAAW,QAAQ,KAAA;GACnB,OAAO;EACT;EAEA,MAAM,aAAa,kBAAkB,IAAI;EACzC,IAAI,CAAC,YACH,OAAO;EAET,WAAW,QAAQ,WAAW;EAC9B,OAAO;CACT;CAEA,SAAS,oBAAoB,MAAS;EACpC,MAAM,MAAM,QAAQ,mBAAmB,IAAI;EAC3C,IAAI,OAAO,MACT,OAAO,QAAQ,GAAG;EAEpB,OAAO,eAAe,IAAI;CAC5B;CAEA,SAAS,SAAS,MAA2B,eAAoC,UAA8B;EAC7G,MAAM,aAAa,kBAAkB,IAAI;EACzC,MAAM,aAAa,kBAAkB,aAAa;EAElD,IAAI,CAAC,cAAc,CAAC,YAClB,OAAO,KAAA;EAET,IAAI,CAAC,YAAY,YAAY,YAAY,QAAQ,GAC/C,OAAO,KAAA;EAET,MAAM,kBAAkB,iBAAiB,UAAU;EACnD,IAAI,CAAC,iBACH,OAAO,KAAA;EAET,IAAI;EACJ,IAAI;EAEJ,IAAI,aAAa,SAAS;GACxB,mBAAmB,QAAQ,eAAe,WAAW,IAAI;GACzD,mBAAmB,iBAAiB;EACtC,OACK;GACH,MAAM,kBAAkB,iBAAiB,UAAU;GACnD,IAAI,CAAC,iBACH,OAAO,KAAA;GAET,mBAAmB,gBAAgB;GACnC,mBAAmB,aAAa,SAC5B,gBAAgB,QAChB,gBAAgB,QAAQ;EAC9B;EAEA,IAAI,qBAAqB,gBAAgB,SAAS,gBAAgB,QAAQ,kBACxE,oBAAoB;EAEtB,MAAM,CAAC,aAAa,gBAAgB,MAAM,OAAO,gBAAgB,OAAO,CAAC;EACzE,iBAAiB,OAAO,kBAAkB,GAAG,SAAS;EAEtD,IAAI,aAAa,SACf,eAAe,WAAW,KAAK,IAAI;EAErC,kBAAkB;EAClB,OAAO,oBAAoB,SAAS;CACtC;CAEA,SAAS,WAAW,MAAS,QAA6B;EACxD,MAAM,aAAa,kBAAkB,MAAM;EAC3C,IAAI,CAAC,YACH,OAAO,KAAA;EAET,QAAQ,eAAe,WAAW,IAAI,CAAC,CAAC,KAAK,IAAI;EACjD,eAAe,WAAW,KAAK,IAAI;EACnC,kBAAkB;EAClB,OAAO,oBAAoB,IAAI;CACjC;CAEA,SAAS,WAAW,MAA2B;EAC7C,IAAI,CAAC,QAAQ,WAAW,GACtB,OAAO;EAET,MAAM,aAAa,kBAAkB,IAAI;EACzC,IAAI,CAAC,YACH,OAAO;EAET,MAAM,YAAY,iBAAiB,UAAU;EAC7C,IAAI,CAAC,WACH,OAAO;EAET,UAAU,MAAM,OAAO,UAAU,OAAO,CAAC;EACzC,kBAAkB;EAClB,OAAO;CACT;CAEA,SAAS,iBAAiB,MAAS,eAAoC;EACrE,MAAM,aAAa,kBAAkB,aAAa;EAClD,IAAI,CAAC,YACH,OAAO,KAAA;EAET,MAAM,YAAY,iBAAiB,UAAU;EAC7C,IAAI,CAAC,WACH,OAAO,KAAA;EAET,UAAU,MAAM,OAAO,UAAU,OAAO,GAAG,IAAI;EAC/C,kBAAkB;EAClB,OAAO,oBAAoB,IAAI;CACjC;CAEA,SAAS,gBAAgB,MAAS,eAAoC;EACpE,MAAM,aAAa,kBAAkB,aAAa;EAClD,IAAI,CAAC,YACH,OAAO,KAAA;EAET,MAAM,YAAY,iBAAiB,UAAU;EAC7C,IAAI,CAAC,WACH,OAAO,KAAA;EAET,UAAU,MAAM,OAAO,UAAU,QAAQ,GAAG,GAAG,IAAI;EACnD,kBAAkB;EAClB,OAAO,oBAAoB,IAAI;CACjC;CAIA,MAAM,cAAc,eAAkC,mBACpD,UAAU,MAAM,OAChB,YAAY,OACZ,QAAQ,QAAQ,QAAQ,aAAa,CAAC,CACxC,CAAC;CAED,SAAS,cAAc,KAAkC;EACvD,OAAO,YAAY,MAAM,IAAI,GAAG,KAAK;CACvC;CAEA,SAAS,WAAW,MAA2B,SAAkB;EAC/D,MAAM,aAAa,kBAAkB,IAAI;EACzC,IAAI,CAAC,YACH,OAAO,KAAA;EAET,YAAY,QAAQ,kBAClB,UAAU,MAAM,OAChB,YAAY,OACZ,YACA,SACA,QAAQ,QAAQ,QAAQ,aAAa,CAAC,CACxC;EAEA,OAAO;CACT;CAEA,SAAS,cAAc,MAAqB;EAC1C,OAAO,WAAW,MAAM,cAAc,KAAK,GAAG,MAAM,SAAS;CAC/D;CAEA,SAAS,eAAe,MAA+B;EACrD,OAAO,mBAAmB,UAAU,MAAM,OAAO,YAAY,OAAO,QAAQ,MAAM,QAAQ,CAAC;CAC7F;CAEA,SAAS,eAAe,MAAmB;EACzC,YAAY,QAAQ,YAAY,UAAU,MAAM,OAAO,IAAI,IAAI,IAAI,CAAC;CACtE;CAEA,SAAS,qBAAqB;EAC5B,OAAO,uBAAuB,YAAY,KAAK;CACjD;CAIA,SAAS,WAAW,MAA8B;EAChD,IAAI,KAAK,WAAW,SAAS,GAC3B,OAAO;EAET,IAAI,CAAC,QAAQ,QAAQ,IAAI,GACvB,OAAO;EAET,MAAM,WAAW,QAAQ,UAAU,KAAK,IAAI;EAC5C,IAAI,aAAa,KAAA,GACf,OAAO;EAIT,OAAO,WAAW,MAAM,IAAI,KAAK,GAAG;CACtC;CAEA,SAAS,aAAa,KAAyB;EAC7C,OAAO,YAAY,MAAM,IAAI,GAAG;CAClC;CAEA,SAAS,YAAY,KAAgB,SAAkB;EACrD,MAAM,OAAO,IAAI,IAAI,YAAY,KAAK;EACtC,IAAI,SACF,KAAK,IAAI,GAAG;OAEZ,KAAK,OAAO,GAAG;EACjB,YAAY,QAAQ;CACtB;CAEA,SAAS,aAAa,MAAqB;EACzC,MAAM,OAAO,QAAQ;EACrB,IAAI,CAAC,QAAQ,QAAQ,IAAI,KAAK,CAAC,MAC7B;EAEF,IAAI,WAAW,MAAM,IAAI,KAAK,GAAG,KAAK,YAAY,MAAM,IAAI,KAAK,GAAG,KAAK,WAAW,IAAI,GACtF;EAEF,YAAY,KAAK,KAAK,IAAI;EAE1B,IAAI,UAAU;EACd,KAAK,OAAO,aAAa;GAGvB,IAAI,SACF;GACF,UAAU;GAEV,MAAM,OAAO,IAAI,IAAI,eAAe,KAAK;GACzC,KAAK,IAAI,KAAK,KAAK,CAAC,GAAI,YAAY,CAAC,CAAE,CAAC;GACxC,eAAe,QAAQ;GACvB,WAAW,QAAQ,IAAI,IAAI,WAAW,KAAK,CAAC,CAAC,IAAI,KAAK,GAAG;GACzD,YAAY,KAAK,KAAK,KAAK;EAC7B,CAAC;CACH;CACA,SAAS,OAAO,OAAe;EAC7B,YAAY,QAAQ;CACtB;CA4CA,OAAO;EACL,aAtCkB,eAAsC;GACxD,MAAM,EAAE,UAAU,UAAU;GAC5B,MAAM,EAAE,UAAU,iBAAiB,aAAa,mBAAmB,WAAW;GAC9E,MAAM,OAA8B,CAAC;GAErC,MAAM,QAAQ,OAAwB,mBAAmC;IACvE,MAAM,WAAW,WAAW,MAAM,QAAO,SAAQ,gBAAgB,IAAI,KAAK,GAAG,CAAC,IAAI;IAElF,SAAS,SAAS,MAAM,UAAU;KAChC,MAAM,SAAS,WAAW,IAAI;KAC9B,MAAM,aAAa,cAAc,KAAK,GAAG,KAAM,YAAY,eAAe,IAAI,KAAK,GAAG;KAEtF,KAAK,KAAK;MACR;MACA;MACA;MACA,WAAW,YAAY,IAAI,KAAK,GAAG;MACnC,UAAU,QAAQ;MAClB,SAAS,SAAS;MAClB,WAAW,aAAa,KAAK,GAAG;MAChC,cAAc;KAChB,CAAC;KAED,IAAI,CAAC,cAAc,KAAK,WAAW,WAAW,GAC5C;KAEF,MAAM,QAAQ,QAAQ,iBAAiB,IAAI;KAE3C,KAAK,KAAK,YAAY,QAAQ,CAAC,GAAG,gBAAgB,KAAK,IAAI,cAAc;IAC3E,CAAC;GACH;GAEA,KAAK,OAAO,CAAC,CAAC;GAEd,OAAO;EACT,CAGE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF"}

package/dist/components/GrJsonViewer/chunks/{GrJsonViewer-CwCBMh4h.js → GrJsonViewer-CdlWMGnF.js}

@@ -4,7 +4,7 @@ import { t as check_default } from "../../../chunks/check-BZI24Qs4.js";
 import { t as GrButton_default } from "../../GrButton/chunks/GrButton-CS4TqMtG.js";
 import { useAnnouncer } from "../../../composables/useAnnouncer.js";
 import { t as GrInput_default } from "../../GrInput/chunks/GrInput-TFeBm3gQ.js";
-import { t as GrTree_default } from "../../GrTree/chunks/GrTree-CkHzgYg1.js";
+import { t as GrTree_default } from "../../GrTree/chunks/GrTree-DnDGW0xO.js";
 import { a as jsonViewerCopyClass, c as jsonViewerMutedClass, d as jsonViewerRowClass, f as jsonViewerSearchClass, i as jsonViewerContentClass, l as jsonViewerPunctuationClass, m as jsonViewerValueClass, o as jsonViewerGroupClass, p as jsonViewerToolbarClass, r as jsonValueClass, s as jsonViewerKeyClass, u as jsonViewerRootClass } from "../../../chunks/config-DpAYidyY.js";
 import { computed, createBlock, createCommentVNode, createElementBlock, createElementVNode, createTextVNode, createVNode, defineComponent, markRaw, normalizeClass, onBeforeUnmount, onMounted, openBlock, ref, renderSlot, resolveDynamicComponent, toDisplayString, unref, watch, withCtx, withModifiers } from "vue";
 //#region ~icons/lucide/copy