@skygraph/core 0.0.0-placeholder.0 → 0.5.0

package/dist/chunk-Y7FTBBYX.js

@@ -0,0 +1,397 @@
+import {
+  TREE_PREFIX
+} from "./chunk-5CCD5Q4B.js";
+
+// src/engines/tree/TreeEngine.ts
+var treeCounter = 0;
+function createTree(core, options) {
+  const treeId = `tr${treeCounter++}`;
+  const fn = {
+    key: options?.fieldNames?.key ?? "key",
+    title: options?.fieldNames?.title ?? "title",
+    children: options?.fieldNames?.children ?? "children"
+  };
+  const checkStrictly = options?.checkStrictly ?? false;
+  let nodes = [];
+  let nodeMap = /* @__PURE__ */ new Map();
+  let expandedKeys = new Set(options?.defaultExpandedKeys ?? []);
+  let checkedKeys = new Set(options?.defaultCheckedKeys ?? []);
+  let halfCheckedKeys = /* @__PURE__ */ new Set();
+  let selectedKeys = new Set(options?.defaultSelectedKeys ?? []);
+  let loadedKeys = /* @__PURE__ */ new Set();
+  let loadingKeys = /* @__PURE__ */ new Set();
+  let filteredKeys = null;
+  function getKey(node) {
+    return node[fn.key];
+  }
+  function getChildren(node) {
+    return node[fn.children];
+  }
+  function buildMap(data) {
+    nodeMap = /* @__PURE__ */ new Map();
+    function walk(list, parentKey, depth) {
+      for (const n of list) {
+        const k = getKey(n);
+        const children = getChildren(n);
+        const childKeys = [];
+        const isLeaf = n.isLeaf === true || (!children || children.length === 0);
+        if (children && children.length > 0) {
+          for (const ch of children) childKeys.push(getKey(ch));
+        }
+        nodeMap.set(k, { node: n, key: k, depth, parentKey, childKeys, isLeaf });
+        if (children && children.length > 0) {
+          walk(children, k, depth + 1);
+        }
+      }
+    }
+    walk(data, null, 0);
+  }
+  function getAllDescendantKeys(key) {
+    const result = [];
+    const internal = nodeMap.get(key);
+    if (!internal) return result;
+    for (const ck of internal.childKeys) {
+      result.push(ck);
+      result.push(...getAllDescendantKeys(ck));
+    }
+    return result;
+  }
+  function getAllAncestorKeys(key) {
+    const result = [];
+    let current = nodeMap.get(key);
+    while (current && current.parentKey !== null) {
+      result.push(current.parentKey);
+      current = nodeMap.get(current.parentKey);
+    }
+    return result;
+  }
+  function recomputeHalfChecked() {
+    if (checkStrictly) {
+      halfCheckedKeys = /* @__PURE__ */ new Set();
+      return;
+    }
+    const half = /* @__PURE__ */ new Set();
+    for (const [key, internal] of nodeMap) {
+      if (internal.childKeys.length === 0) continue;
+      if (checkedKeys.has(key)) continue;
+      const allDescendants = getAllDescendantKeys(key);
+      const someChecked = allDescendants.some((dk) => checkedKeys.has(dk));
+      if (someChecked) half.add(key);
+    }
+    halfCheckedKeys = half;
+  }
+  function cascadeCheck(key, checked) {
+    if (checkStrictly) {
+      if (checked) checkedKeys.add(key);
+      else checkedKeys.delete(key);
+      return;
+    }
+    const internal = nodeMap.get(key);
+    if (!internal) return;
+    if (checked) {
+      checkedKeys.add(key);
+      const descendants = getAllDescendantKeys(key);
+      for (const dk of descendants) {
+        const dn = nodeMap.get(dk);
+        if (dn && !dn.node.disabled && !dn.node.disableCheckbox) {
+          checkedKeys.add(dk);
+        }
+      }
+    } else {
+      checkedKeys.delete(key);
+      const descendants = getAllDescendantKeys(key);
+      for (const dk of descendants) {
+        checkedKeys.delete(dk);
+      }
+    }
+    const ancestors = getAllAncestorKeys(key);
+    for (const ak of ancestors) {
+      const an = nodeMap.get(ak);
+      if (!an) continue;
+      const allChildren = getAllDescendantKeys(ak);
+      const enabledChildren = allChildren.filter((ck) => {
+        const cn = nodeMap.get(ck);
+        return cn && !cn.node.disabled && !cn.node.disableCheckbox;
+      });
+      const allChecked = enabledChildren.length > 0 && enabledChildren.every((ck) => checkedKeys.has(ck));
+      if (allChecked) {
+        checkedKeys.add(ak);
+      } else {
+        checkedKeys.delete(ak);
+      }
+    }
+    recomputeHalfChecked();
+  }
+  function removeFromTree(data, targetKey) {
+    let removed = null;
+    const remaining = data.filter((n) => {
+      if (getKey(n) === targetKey) {
+        removed = n;
+        return false;
+      }
+      return true;
+    });
+    if (!removed) {
+      for (const n of remaining) {
+        const children = getChildren(n);
+        if (children && children.length > 0) {
+          const result = removeFromTree(children, targetKey);
+          if (result.removed) {
+            ;
+            n[fn.children] = result.remaining;
+            return { remaining, removed: result.removed };
+          }
+        }
+      }
+    }
+    return { remaining, removed };
+  }
+  function insertIntoTree(data, targetKey, node, position) {
+    if (position === 0) {
+      return data.map((n) => {
+        if (getKey(n) === targetKey) {
+          const children2 = getChildren(n) ?? [];
+          n[fn.children] = [...children2, node];
+          return n;
+        }
+        const children = getChildren(n);
+        if (children && children.length > 0) {
+          ;
+          n[fn.children] = insertIntoTree(children, targetKey, node, position);
+        }
+        return n;
+      });
+    }
+    const result = [];
+    for (const n of data) {
+      if (getKey(n) === targetKey) {
+        if (position === -1) {
+          result.push(node, n);
+        } else {
+          result.push(n, node);
+        }
+      } else {
+        const children = getChildren(n);
+        if (children && children.length > 0) {
+          ;
+          n[fn.children] = insertIntoTree(children, targetKey, node, position);
+        }
+        result.push(n);
+      }
+    }
+    return result;
+  }
+  function publishState() {
+    const path = (k) => `${TREE_PREFIX}${treeId}.${k}`;
+    core.batch(() => {
+      core.set(path("expandedKeys"), [...expandedKeys]);
+      core.set(path("checkedKeys"), [...checkedKeys]);
+      core.set(path("halfCheckedKeys"), [...halfCheckedKeys]);
+      core.set(path("selectedKeys"), [...selectedKeys]);
+      core.set(path("loadedKeys"), [...loadedKeys]);
+      core.set(path("loadingKeys"), [...loadingKeys]);
+    });
+  }
+  function initDefaults() {
+    if (options?.defaultExpandAll) {
+      for (const [key, internal] of nodeMap) {
+        if (!internal.isLeaf) expandedKeys.add(key);
+      }
+    }
+    if (options?.defaultCheckedKeys && !checkStrictly) {
+      for (const key of options.defaultCheckedKeys) {
+        cascadeCheck(key, true);
+      }
+    }
+    recomputeHalfChecked();
+    publishState();
+  }
+  const engine = {
+    setData(data) {
+      nodes = data;
+      buildMap(data);
+      initDefaults();
+    },
+    getData() {
+      return nodes;
+    },
+    // Expand
+    expand(key) {
+      expandedKeys.add(key);
+      publishState();
+    },
+    collapse(key) {
+      expandedKeys.delete(key);
+      publishState();
+    },
+    toggleExpand(key) {
+      if (expandedKeys.has(key)) expandedKeys.delete(key);
+      else expandedKeys.add(key);
+      publishState();
+    },
+    setExpandedKeys(keys) {
+      expandedKeys = new Set(keys);
+      publishState();
+    },
+    expandAll() {
+      for (const [key, internal] of nodeMap) {
+        if (!internal.isLeaf) expandedKeys.add(key);
+      }
+      publishState();
+    },
+    collapseAll() {
+      expandedKeys = /* @__PURE__ */ new Set();
+      publishState();
+    },
+    // Check
+    check(key) {
+      cascadeCheck(key, true);
+      publishState();
+    },
+    uncheck(key) {
+      cascadeCheck(key, false);
+      publishState();
+    },
+    toggleCheck(key) {
+      const checked = !checkedKeys.has(key);
+      cascadeCheck(key, checked);
+      publishState();
+    },
+    setCheckedKeys(keys) {
+      checkedKeys = new Set(keys);
+      recomputeHalfChecked();
+      publishState();
+    },
+    // Select
+    select(key, multiple) {
+      if (multiple) {
+        if (selectedKeys.has(key)) selectedKeys.delete(key);
+        else selectedKeys.add(key);
+      } else {
+        selectedKeys = /* @__PURE__ */ new Set([key]);
+      }
+      publishState();
+    },
+    deselect(key) {
+      selectedKeys.delete(key);
+      publishState();
+    },
+    setSelectedKeys(keys) {
+      selectedKeys = new Set(keys);
+      publishState();
+    },
+    // Async loading
+    markLoading(key) {
+      loadingKeys.add(key);
+      publishState();
+    },
+    markLoaded(key) {
+      loadingKeys.delete(key);
+      loadedKeys.add(key);
+      publishState();
+    },
+    addChildren(parentKey, children) {
+      const internal = nodeMap.get(parentKey);
+      if (!internal) return;
+      internal.node[fn.children] = children;
+      buildMap(nodes);
+      publishState();
+    },
+    // Drag & drop
+    moveNode(dragKey, dropKey, position) {
+      if (dragKey === dropKey) return null;
+      const ancestors = getAllAncestorKeys(dropKey);
+      if (ancestors.includes(dragKey)) return null;
+      const { remaining, removed } = removeFromTree(nodes, dragKey);
+      if (!removed) return null;
+      nodes = insertIntoTree(remaining, dropKey, removed, position);
+      buildMap(nodes);
+      publishState();
+      return nodes;
+    },
+    // Filter
+    filterNodes(predicate) {
+      if (!predicate) {
+        filteredKeys = null;
+        return;
+      }
+      const matched = /* @__PURE__ */ new Set();
+      for (const [key, internal] of nodeMap) {
+        if (predicate(internal.node)) {
+          matched.add(key);
+          const ancestors = getAllAncestorKeys(key);
+          for (const ak of ancestors) matched.add(ak);
+        }
+      }
+      filteredKeys = matched;
+    },
+    getFilteredKeys() {
+      return filteredKeys ? [...filteredKeys] : null;
+    },
+    // Query
+    getNode(key) {
+      return nodeMap.get(key)?.node;
+    },
+    getParentKey(key) {
+      return nodeMap.get(key)?.parentKey ?? null;
+    },
+    getChildKeys(key) {
+      return nodeMap.get(key)?.childKeys ?? [];
+    },
+    getAllKeys() {
+      return [...nodeMap.keys()];
+    },
+    getLeafKeys() {
+      const result = [];
+      for (const [key, internal] of nodeMap) {
+        if (internal.isLeaf) result.push(key);
+      }
+      return result;
+    },
+    getState() {
+      return {
+        expandedKeys: [...expandedKeys],
+        checkedKeys: [...checkedKeys],
+        halfCheckedKeys: [...halfCheckedKeys],
+        selectedKeys: [...selectedKeys],
+        loadedKeys: [...loadedKeys],
+        loadingKeys: [...loadingKeys]
+      };
+    },
+    getFlatNodes() {
+      const result = [];
+      function walk(list, parentKey, depth) {
+        for (const n of list) {
+          const k = getKey(n);
+          if (filteredKeys && !filteredKeys.has(k)) continue;
+          const children = getChildren(n);
+          const isLeaf = n.isLeaf === true || (!children || children.length === 0);
+          result.push({ node: n, key: k, depth, isLeaf, parentKey });
+          if (!isLeaf && expandedKeys.has(k) && children && children.length > 0) {
+            walk(children, k, depth + 1);
+          }
+        }
+      }
+      walk(nodes, null, 0);
+      return result;
+    },
+    reset() {
+      nodes = [];
+      nodeMap = /* @__PURE__ */ new Map();
+      expandedKeys = /* @__PURE__ */ new Set();
+      checkedKeys = /* @__PURE__ */ new Set();
+      halfCheckedKeys = /* @__PURE__ */ new Set();
+      selectedKeys = /* @__PURE__ */ new Set();
+      loadedKeys = /* @__PURE__ */ new Set();
+      loadingKeys = /* @__PURE__ */ new Set();
+      filteredKeys = null;
+      publishState();
+    }
+  };
+  return engine;
+}
+
+export {
+  createTree
+};
+//# sourceMappingURL=chunk-Y7FTBBYX.js.map

package/dist/chunk-Y7FTBBYX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/engines/tree/TreeEngine.ts"],"sourcesContent":["import type { Core } from '../../types'\nimport type {\n  TreeKey,\n  TreeNodeData,\n  TreeFieldNames,\n  TreeEngine,\n  TreeEngineOptions,\n  TreeState,\n} from './types'\n\nimport { TREE_PREFIX } from '../namespaces'\n\nlet treeCounter = 0\n\ninterface InternalNode {\n  node: TreeNodeData\n  key: TreeKey\n  depth: number\n  parentKey: TreeKey | null\n  childKeys: TreeKey[]\n  isLeaf: boolean\n}\n\nexport function createTree(core: Core, options?: TreeEngineOptions): TreeEngine {\n  const treeId = `tr${treeCounter++}`\n  const fn: Required<TreeFieldNames> = {\n    key: options?.fieldNames?.key ?? 'key',\n    title: options?.fieldNames?.title ?? 'title',\n    children: options?.fieldNames?.children ?? 'children',\n  }\n  const checkStrictly = options?.checkStrictly ?? false\n\n  let nodes: TreeNodeData[] = []\n  let nodeMap = new Map<TreeKey, InternalNode>()\n\n  let expandedKeys = new Set<TreeKey>(options?.defaultExpandedKeys ?? [])\n  let checkedKeys = new Set<TreeKey>(options?.defaultCheckedKeys ?? [])\n  let halfCheckedKeys = new Set<TreeKey>()\n  let selectedKeys = new Set<TreeKey>(options?.defaultSelectedKeys ?? [])\n  let loadedKeys = new Set<TreeKey>()\n  let loadingKeys = new Set<TreeKey>()\n  let filteredKeys: Set<TreeKey> | null = null\n\n  function getKey(node: TreeNodeData): TreeKey {\n    return (node as Record<string, unknown>)[fn.key] as TreeKey\n  }\n\n  function getChildren(node: TreeNodeData): TreeNodeData[] | undefined {\n    return (node as Record<string, unknown>)[fn.children] as TreeNodeData[] | undefined\n  }\n\n  function buildMap(data: TreeNodeData[]): void {\n    nodeMap = new Map()\n    function walk(list: TreeNodeData[], parentKey: TreeKey | null, depth: number) {\n      for (const n of list) {\n        const k = getKey(n)\n        const children = getChildren(n)\n        const childKeys: TreeKey[] = []\n        const isLeaf = n.isLeaf === true || (!children || children.length === 0)\n\n        if (children && children.length > 0) {\n          for (const ch of children) childKeys.push(getKey(ch))\n        }\n\n        nodeMap.set(k, { node: n, key: k, depth, parentKey, childKeys, isLeaf })\n\n        if (children && children.length > 0) {\n          walk(children, k, depth + 1)\n        }\n      }\n    }\n    walk(data, null, 0)\n  }\n\n  function getAllDescendantKeys(key: TreeKey): TreeKey[] {\n    const result: TreeKey[] = []\n    const internal = nodeMap.get(key)\n    if (!internal) return result\n    for (const ck of internal.childKeys) {\n      result.push(ck)\n      result.push(...getAllDescendantKeys(ck))\n    }\n    return result\n  }\n\n  function getAllAncestorKeys(key: TreeKey): TreeKey[] {\n    const result: TreeKey[] = []\n    let current = nodeMap.get(key)\n    while (current && current.parentKey !== null) {\n      result.push(current.parentKey)\n      current = nodeMap.get(current.parentKey)\n    }\n    return result\n  }\n\n  function recomputeHalfChecked(): void {\n    if (checkStrictly) {\n      halfCheckedKeys = new Set()\n      return\n    }\n    const half = new Set<TreeKey>()\n    for (const [key, internal] of nodeMap) {\n      if (internal.childKeys.length === 0) continue\n      if (checkedKeys.has(key)) continue\n      const allDescendants = getAllDescendantKeys(key)\n      const someChecked = allDescendants.some((dk) => checkedKeys.has(dk))\n      if (someChecked) half.add(key)\n    }\n    halfCheckedKeys = half\n  }\n\n  function cascadeCheck(key: TreeKey, checked: boolean): void {\n    if (checkStrictly) {\n      if (checked) checkedKeys.add(key)\n      else checkedKeys.delete(key)\n      return\n    }\n\n    const internal = nodeMap.get(key)\n    if (!internal) return\n\n    if (checked) {\n      checkedKeys.add(key)\n      const descendants = getAllDescendantKeys(key)\n      for (const dk of descendants) {\n        const dn = nodeMap.get(dk)\n        if (dn && !dn.node.disabled && !dn.node.disableCheckbox) {\n          checkedKeys.add(dk)\n        }\n      }\n    } else {\n      checkedKeys.delete(key)\n      const descendants = getAllDescendantKeys(key)\n      for (const dk of descendants) {\n        checkedKeys.delete(dk)\n      }\n    }\n\n    // Propagate up\n    const ancestors = getAllAncestorKeys(key)\n    for (const ak of ancestors) {\n      const an = nodeMap.get(ak)\n      if (!an) continue\n      const allChildren = getAllDescendantKeys(ak)\n      const enabledChildren = allChildren.filter((ck) => {\n        const cn = nodeMap.get(ck)\n        return cn && !cn.node.disabled && !cn.node.disableCheckbox\n      })\n      const allChecked = enabledChildren.length > 0 && enabledChildren.every((ck) => checkedKeys.has(ck))\n      if (allChecked) {\n        checkedKeys.add(ak)\n      } else {\n        checkedKeys.delete(ak)\n      }\n    }\n\n    recomputeHalfChecked()\n  }\n\n  function removeFromTree(data: TreeNodeData[], targetKey: TreeKey): { remaining: TreeNodeData[]; removed: TreeNodeData | null } {\n    let removed: TreeNodeData | null = null\n    const remaining = data.filter((n) => {\n      if (getKey(n) === targetKey) {\n        removed = n\n        return false\n      }\n      return true\n    })\n    if (!removed) {\n      for (const n of remaining) {\n        const children = getChildren(n)\n        if (children && children.length > 0) {\n          const result = removeFromTree(children, targetKey)\n          if (result.removed) {\n            ;(n as Record<string, unknown>)[fn.children] = result.remaining\n            return { remaining, removed: result.removed }\n          }\n        }\n      }\n    }\n    return { remaining, removed }\n  }\n\n  function insertIntoTree(\n    data: TreeNodeData[],\n    targetKey: TreeKey,\n    node: TreeNodeData,\n    position: -1 | 0 | 1,\n  ): TreeNodeData[] {\n    if (position === 0) {\n      return data.map((n) => {\n        if (getKey(n) === targetKey) {\n          const children = getChildren(n) ?? []\n          ;(n as Record<string, unknown>)[fn.children] = [...children, node]\n          return n\n        }\n        const children = getChildren(n)\n        if (children && children.length > 0) {\n          ;(n as Record<string, unknown>)[fn.children] = insertIntoTree(children, targetKey, node, position)\n        }\n        return n\n      })\n    }\n\n    const result: TreeNodeData[] = []\n    for (const n of data) {\n      if (getKey(n) === targetKey) {\n        if (position === -1) {\n          result.push(node, n)\n        } else {\n          result.push(n, node)\n        }\n      } else {\n        const children = getChildren(n)\n        if (children && children.length > 0) {\n          ;(n as Record<string, unknown>)[fn.children] = insertIntoTree(children, targetKey, node, position)\n        }\n        result.push(n)\n      }\n    }\n    return result\n  }\n\n  function publishState(): void {\n    const path = (k: string) => `${TREE_PREFIX}${treeId}.${k}`\n    core.batch(() => {\n      core.set(path('expandedKeys'), [...expandedKeys])\n      core.set(path('checkedKeys'), [...checkedKeys])\n      core.set(path('halfCheckedKeys'), [...halfCheckedKeys])\n      core.set(path('selectedKeys'), [...selectedKeys])\n      core.set(path('loadedKeys'), [...loadedKeys])\n      core.set(path('loadingKeys'), [...loadingKeys])\n    })\n  }\n\n  function initDefaults(): void {\n    if (options?.defaultExpandAll) {\n      for (const [key, internal] of nodeMap) {\n        if (!internal.isLeaf) expandedKeys.add(key)\n      }\n    }\n\n    if (options?.defaultCheckedKeys && !checkStrictly) {\n      for (const key of options.defaultCheckedKeys) {\n        cascadeCheck(key, true)\n      }\n    }\n\n    recomputeHalfChecked()\n    publishState()\n  }\n\n  const engine: TreeEngine = {\n    setData(data: TreeNodeData[]): void {\n      nodes = data\n      buildMap(data)\n      initDefaults()\n    },\n\n    getData(): TreeNodeData[] {\n      return nodes\n    },\n\n    // Expand\n    expand(key: TreeKey): void {\n      expandedKeys.add(key)\n      publishState()\n    },\n\n    collapse(key: TreeKey): void {\n      expandedKeys.delete(key)\n      publishState()\n    },\n\n    toggleExpand(key: TreeKey): void {\n      if (expandedKeys.has(key)) expandedKeys.delete(key)\n      else expandedKeys.add(key)\n      publishState()\n    },\n\n    setExpandedKeys(keys: TreeKey[]): void {\n      expandedKeys = new Set(keys)\n      publishState()\n    },\n\n    expandAll(): void {\n      for (const [key, internal] of nodeMap) {\n        if (!internal.isLeaf) expandedKeys.add(key)\n      }\n      publishState()\n    },\n\n    collapseAll(): void {\n      expandedKeys = new Set()\n      publishState()\n    },\n\n    // Check\n    check(key: TreeKey): void {\n      cascadeCheck(key, true)\n      publishState()\n    },\n\n    uncheck(key: TreeKey): void {\n      cascadeCheck(key, false)\n      publishState()\n    },\n\n    toggleCheck(key: TreeKey): void {\n      const checked = !checkedKeys.has(key)\n      cascadeCheck(key, checked)\n      publishState()\n    },\n\n    setCheckedKeys(keys: TreeKey[]): void {\n      checkedKeys = new Set(keys)\n      recomputeHalfChecked()\n      publishState()\n    },\n\n    // Select\n    select(key: TreeKey, multiple?: boolean): void {\n      if (multiple) {\n        if (selectedKeys.has(key)) selectedKeys.delete(key)\n        else selectedKeys.add(key)\n      } else {\n        selectedKeys = new Set([key])\n      }\n      publishState()\n    },\n\n    deselect(key: TreeKey): void {\n      selectedKeys.delete(key)\n      publishState()\n    },\n\n    setSelectedKeys(keys: TreeKey[]): void {\n      selectedKeys = new Set(keys)\n      publishState()\n    },\n\n    // Async loading\n    markLoading(key: TreeKey): void {\n      loadingKeys.add(key)\n      publishState()\n    },\n\n    markLoaded(key: TreeKey): void {\n      loadingKeys.delete(key)\n      loadedKeys.add(key)\n      publishState()\n    },\n\n    addChildren(parentKey: TreeKey, children: TreeNodeData[]): void {\n      const internal = nodeMap.get(parentKey)\n      if (!internal) return\n      ;(internal.node as Record<string, unknown>)[fn.children] = children\n      buildMap(nodes)\n      publishState()\n    },\n\n    // Drag & drop\n    moveNode(dragKey: TreeKey, dropKey: TreeKey, position: -1 | 0 | 1): TreeNodeData[] | null {\n      if (dragKey === dropKey) return null\n      const ancestors = getAllAncestorKeys(dropKey)\n      if (ancestors.includes(dragKey)) return null\n\n      const { remaining, removed } = removeFromTree(nodes, dragKey)\n      if (!removed) return null\n\n      nodes = insertIntoTree(remaining, dropKey, removed, position)\n      buildMap(nodes)\n      publishState()\n      return nodes\n    },\n\n    // Filter\n    filterNodes(predicate: ((node: TreeNodeData) => boolean) | null): void {\n      if (!predicate) {\n        filteredKeys = null\n        return\n      }\n      const matched = new Set<TreeKey>()\n      for (const [key, internal] of nodeMap) {\n        if (predicate(internal.node)) {\n          matched.add(key)\n          const ancestors = getAllAncestorKeys(key)\n          for (const ak of ancestors) matched.add(ak)\n        }\n      }\n      filteredKeys = matched\n    },\n\n    getFilteredKeys(): TreeKey[] | null {\n      return filteredKeys ? [...filteredKeys] : null\n    },\n\n    // Query\n    getNode(key: TreeKey): TreeNodeData | undefined {\n      return nodeMap.get(key)?.node\n    },\n\n    getParentKey(key: TreeKey): TreeKey | null {\n      return nodeMap.get(key)?.parentKey ?? null\n    },\n\n    getChildKeys(key: TreeKey): TreeKey[] {\n      return nodeMap.get(key)?.childKeys ?? []\n    },\n\n    getAllKeys(): TreeKey[] {\n      return [...nodeMap.keys()]\n    },\n\n    getLeafKeys(): TreeKey[] {\n      const result: TreeKey[] = []\n      for (const [key, internal] of nodeMap) {\n        if (internal.isLeaf) result.push(key)\n      }\n      return result\n    },\n\n    getState(): TreeState {\n      return {\n        expandedKeys: [...expandedKeys],\n        checkedKeys: [...checkedKeys],\n        halfCheckedKeys: [...halfCheckedKeys],\n        selectedKeys: [...selectedKeys],\n        loadedKeys: [...loadedKeys],\n        loadingKeys: [...loadingKeys],\n      }\n    },\n\n    getFlatNodes() {\n      const result: Array<{ node: TreeNodeData; key: TreeKey; depth: number; isLeaf: boolean; parentKey: TreeKey | null }> = []\n\n      function walk(list: TreeNodeData[], parentKey: TreeKey | null, depth: number) {\n        for (const n of list) {\n          const k = getKey(n)\n          if (filteredKeys && !filteredKeys.has(k)) continue\n\n          const children = getChildren(n)\n          const isLeaf = n.isLeaf === true || (!children || children.length === 0)\n\n          result.push({ node: n, key: k, depth, isLeaf, parentKey })\n\n          if (!isLeaf && expandedKeys.has(k) && children && children.length > 0) {\n            walk(children, k, depth + 1)\n          }\n        }\n      }\n\n      walk(nodes, null, 0)\n      return result\n    },\n\n    reset(): void {\n      nodes = []\n      nodeMap = new Map()\n      expandedKeys = new Set()\n      checkedKeys = new Set()\n      halfCheckedKeys = new Set()\n      selectedKeys = new Set()\n      loadedKeys = new Set()\n      loadingKeys = new Set()\n      filteredKeys = null\n      publishState()\n    },\n  }\n\n  return engine\n}\n"],"mappings":";;;;;AAYA,IAAI,cAAc;AAWX,SAAS,WAAW,MAAY,SAAyC;AAC9E,QAAM,SAAS,KAAK,aAAa;AACjC,QAAM,KAA+B;AAAA,IACnC,KAAK,SAAS,YAAY,OAAO;AAAA,IACjC,OAAO,SAAS,YAAY,SAAS;AAAA,IACrC,UAAU,SAAS,YAAY,YAAY;AAAA,EAC7C;AACA,QAAM,gBAAgB,SAAS,iBAAiB;AAEhD,MAAI,QAAwB,CAAC;AAC7B,MAAI,UAAU,oBAAI,IAA2B;AAE7C,MAAI,eAAe,IAAI,IAAa,SAAS,uBAAuB,CAAC,CAAC;AACtE,MAAI,cAAc,IAAI,IAAa,SAAS,sBAAsB,CAAC,CAAC;AACpE,MAAI,kBAAkB,oBAAI,IAAa;AACvC,MAAI,eAAe,IAAI,IAAa,SAAS,uBAAuB,CAAC,CAAC;AACtE,MAAI,aAAa,oBAAI,IAAa;AAClC,MAAI,cAAc,oBAAI,IAAa;AACnC,MAAI,eAAoC;AAExC,WAAS,OAAO,MAA6B;AAC3C,WAAQ,KAAiC,GAAG,GAAG;AAAA,EACjD;AAEA,WAAS,YAAY,MAAgD;AACnE,WAAQ,KAAiC,GAAG,QAAQ;AAAA,EACtD;AAEA,WAAS,SAAS,MAA4B;AAC5C,cAAU,oBAAI,IAAI;AAClB,aAAS,KAAK,MAAsB,WAA2B,OAAe;AAC5E,iBAAW,KAAK,MAAM;AACpB,cAAM,IAAI,OAAO,CAAC;AAClB,cAAM,WAAW,YAAY,CAAC;AAC9B,cAAM,YAAuB,CAAC;AAC9B,cAAM,SAAS,EAAE,WAAW,SAAS,CAAC,YAAY,SAAS,WAAW;AAEtE,YAAI,YAAY,SAAS,SAAS,GAAG;AACnC,qBAAW,MAAM,SAAU,WAAU,KAAK,OAAO,EAAE,CAAC;AAAA,QACtD;AAEA,gBAAQ,IAAI,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,OAAO,WAAW,WAAW,OAAO,CAAC;AAEvE,YAAI,YAAY,SAAS,SAAS,GAAG;AACnC,eAAK,UAAU,GAAG,QAAQ,CAAC;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AACA,SAAK,MAAM,MAAM,CAAC;AAAA,EACpB;AAEA,WAAS,qBAAqB,KAAyB;AACrD,UAAM,SAAoB,CAAC;AAC3B,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,CAAC,SAAU,QAAO;AACtB,eAAW,MAAM,SAAS,WAAW;AACnC,aAAO,KAAK,EAAE;AACd,aAAO,KAAK,GAAG,qBAAqB,EAAE,CAAC;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AAEA,WAAS,mBAAmB,KAAyB;AACnD,UAAM,SAAoB,CAAC;AAC3B,QAAI,UAAU,QAAQ,IAAI,GAAG;AAC7B,WAAO,WAAW,QAAQ,cAAc,MAAM;AAC5C,aAAO,KAAK,QAAQ,SAAS;AAC7B,gBAAU,QAAQ,IAAI,QAAQ,SAAS;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AAEA,WAAS,uBAA6B;AACpC,QAAI,eAAe;AACjB,wBAAkB,oBAAI,IAAI;AAC1B;AAAA,IACF;AACA,UAAM,OAAO,oBAAI,IAAa;AAC9B,eAAW,CAAC,KAAK,QAAQ,KAAK,SAAS;AACrC,UAAI,SAAS,UAAU,WAAW,EAAG;AACrC,UAAI,YAAY,IAAI,GAAG,EAAG;AAC1B,YAAM,iBAAiB,qBAAqB,GAAG;AAC/C,YAAM,cAAc,eAAe,KAAK,CAAC,OAAO,YAAY,IAAI,EAAE,CAAC;AACnE,UAAI,YAAa,MAAK,IAAI,GAAG;AAAA,IAC/B;AACA,sBAAkB;AAAA,EACpB;AAEA,WAAS,aAAa,KAAc,SAAwB;AAC1D,QAAI,eAAe;AACjB,UAAI,QAAS,aAAY,IAAI,GAAG;AAAA,UAC3B,aAAY,OAAO,GAAG;AAC3B;AAAA,IACF;AAEA,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,CAAC,SAAU;AAEf,QAAI,SAAS;AACX,kBAAY,IAAI,GAAG;AACnB,YAAM,cAAc,qBAAqB,GAAG;AAC5C,iBAAW,MAAM,aAAa;AAC5B,cAAM,KAAK,QAAQ,IAAI,EAAE;AACzB,YAAI,MAAM,CAAC,GAAG,KAAK,YAAY,CAAC,GAAG,KAAK,iBAAiB;AACvD,sBAAY,IAAI,EAAE;AAAA,QACpB;AAAA,MACF;AAAA,IACF,OAAO;AACL,kBAAY,OAAO,GAAG;AACtB,YAAM,cAAc,qBAAqB,GAAG;AAC5C,iBAAW,MAAM,aAAa;AAC5B,oBAAY,OAAO,EAAE;AAAA,MACvB;AAAA,IACF;AAGA,UAAM,YAAY,mBAAmB,GAAG;AACxC,eAAW,MAAM,WAAW;AAC1B,YAAM,KAAK,QAAQ,IAAI,EAAE;AACzB,UAAI,CAAC,GAAI;AACT,YAAM,cAAc,qBAAqB,EAAE;AAC3C,YAAM,kBAAkB,YAAY,OAAO,CAAC,OAAO;AACjD,cAAM,KAAK,QAAQ,IAAI,EAAE;AACzB,eAAO,MAAM,CAAC,GAAG,KAAK,YAAY,CAAC,GAAG,KAAK;AAAA,MAC7C,CAAC;AACD,YAAM,aAAa,gBAAgB,SAAS,KAAK,gBAAgB,MAAM,CAAC,OAAO,YAAY,IAAI,EAAE,CAAC;AAClG,UAAI,YAAY;AACd,oBAAY,IAAI,EAAE;AAAA,MACpB,OAAO;AACL,oBAAY,OAAO,EAAE;AAAA,MACvB;AAAA,IACF;AAEA,yBAAqB;AAAA,EACvB;AAEA,WAAS,eAAe,MAAsB,WAAiF;AAC7H,QAAI,UAA+B;AACnC,UAAM,YAAY,KAAK,OAAO,CAAC,MAAM;AACnC,UAAI,OAAO,CAAC,MAAM,WAAW;AAC3B,kBAAU;AACV,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,CAAC;AACD,QAAI,CAAC,SAAS;AACZ,iBAAW,KAAK,WAAW;AACzB,cAAM,WAAW,YAAY,CAAC;AAC9B,YAAI,YAAY,SAAS,SAAS,GAAG;AACnC,gBAAM,SAAS,eAAe,UAAU,SAAS;AACjD,cAAI,OAAO,SAAS;AAClB;AAAC,YAAC,EAA8B,GAAG,QAAQ,IAAI,OAAO;AACtD,mBAAO,EAAE,WAAW,SAAS,OAAO,QAAQ;AAAA,UAC9C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,WAAW,QAAQ;AAAA,EAC9B;AAEA,WAAS,eACP,MACA,WACA,MACA,UACgB;AAChB,QAAI,aAAa,GAAG;AAClB,aAAO,KAAK,IAAI,CAAC,MAAM;AACrB,YAAI,OAAO,CAAC,MAAM,WAAW;AAC3B,gBAAMA,YAAW,YAAY,CAAC,KAAK,CAAC;AACnC,UAAC,EAA8B,GAAG,QAAQ,IAAI,CAAC,GAAGA,WAAU,IAAI;AACjE,iBAAO;AAAA,QACT;AACA,cAAM,WAAW,YAAY,CAAC;AAC9B,YAAI,YAAY,SAAS,SAAS,GAAG;AACnC;AAAC,UAAC,EAA8B,GAAG,QAAQ,IAAI,eAAe,UAAU,WAAW,MAAM,QAAQ;AAAA,QACnG;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,UAAM,SAAyB,CAAC;AAChC,eAAW,KAAK,MAAM;AACpB,UAAI,OAAO,CAAC,MAAM,WAAW;AAC3B,YAAI,aAAa,IAAI;AACnB,iBAAO,KAAK,MAAM,CAAC;AAAA,QACrB,OAAO;AACL,iBAAO,KAAK,GAAG,IAAI;AAAA,QACrB;AAAA,MACF,OAAO;AACL,cAAM,WAAW,YAAY,CAAC;AAC9B,YAAI,YAAY,SAAS,SAAS,GAAG;AACnC;AAAC,UAAC,EAA8B,GAAG,QAAQ,IAAI,eAAe,UAAU,WAAW,MAAM,QAAQ;AAAA,QACnG;AACA,eAAO,KAAK,CAAC;AAAA,MACf;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,eAAqB;AAC5B,UAAM,OAAO,CAAC,MAAc,GAAG,WAAW,GAAG,MAAM,IAAI,CAAC;AACxD,SAAK,MAAM,MAAM;AACf,WAAK,IAAI,KAAK,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC;AAChD,WAAK,IAAI,KAAK,aAAa,GAAG,CAAC,GAAG,WAAW,CAAC;AAC9C,WAAK,IAAI,KAAK,iBAAiB,GAAG,CAAC,GAAG,eAAe,CAAC;AACtD,WAAK,IAAI,KAAK,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC;AAChD,WAAK,IAAI,KAAK,YAAY,GAAG,CAAC,GAAG,UAAU,CAAC;AAC5C,WAAK,IAAI,KAAK,aAAa,GAAG,CAAC,GAAG,WAAW,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AAEA,WAAS,eAAqB;AAC5B,QAAI,SAAS,kBAAkB;AAC7B,iBAAW,CAAC,KAAK,QAAQ,KAAK,SAAS;AACrC,YAAI,CAAC,SAAS,OAAQ,cAAa,IAAI,GAAG;AAAA,MAC5C;AAAA,IACF;AAEA,QAAI,SAAS,sBAAsB,CAAC,eAAe;AACjD,iBAAW,OAAO,QAAQ,oBAAoB;AAC5C,qBAAa,KAAK,IAAI;AAAA,MACxB;AAAA,IACF;AAEA,yBAAqB;AACrB,iBAAa;AAAA,EACf;AAEA,QAAM,SAAqB;AAAA,IACzB,QAAQ,MAA4B;AAClC,cAAQ;AACR,eAAS,IAAI;AACb,mBAAa;AAAA,IACf;AAAA,IAEA,UAA0B;AACxB,aAAO;AAAA,IACT;AAAA;AAAA,IAGA,OAAO,KAAoB;AACzB,mBAAa,IAAI,GAAG;AACpB,mBAAa;AAAA,IACf;AAAA,IAEA,SAAS,KAAoB;AAC3B,mBAAa,OAAO,GAAG;AACvB,mBAAa;AAAA,IACf;AAAA,IAEA,aAAa,KAAoB;AAC/B,UAAI,aAAa,IAAI,GAAG,EAAG,cAAa,OAAO,GAAG;AAAA,UAC7C,cAAa,IAAI,GAAG;AACzB,mBAAa;AAAA,IACf;AAAA,IAEA,gBAAgB,MAAuB;AACrC,qBAAe,IAAI,IAAI,IAAI;AAC3B,mBAAa;AAAA,IACf;AAAA,IAEA,YAAkB;AAChB,iBAAW,CAAC,KAAK,QAAQ,KAAK,SAAS;AACrC,YAAI,CAAC,SAAS,OAAQ,cAAa,IAAI,GAAG;AAAA,MAC5C;AACA,mBAAa;AAAA,IACf;AAAA,IAEA,cAAoB;AAClB,qBAAe,oBAAI,IAAI;AACvB,mBAAa;AAAA,IACf;AAAA;AAAA,IAGA,MAAM,KAAoB;AACxB,mBAAa,KAAK,IAAI;AACtB,mBAAa;AAAA,IACf;AAAA,IAEA,QAAQ,KAAoB;AAC1B,mBAAa,KAAK,KAAK;AACvB,mBAAa;AAAA,IACf;AAAA,IAEA,YAAY,KAAoB;AAC9B,YAAM,UAAU,CAAC,YAAY,IAAI,GAAG;AACpC,mBAAa,KAAK,OAAO;AACzB,mBAAa;AAAA,IACf;AAAA,IAEA,eAAe,MAAuB;AACpC,oBAAc,IAAI,IAAI,IAAI;AAC1B,2BAAqB;AACrB,mBAAa;AAAA,IACf;AAAA;AAAA,IAGA,OAAO,KAAc,UAA0B;AAC7C,UAAI,UAAU;AACZ,YAAI,aAAa,IAAI,GAAG,EAAG,cAAa,OAAO,GAAG;AAAA,YAC7C,cAAa,IAAI,GAAG;AAAA,MAC3B,OAAO;AACL,uBAAe,oBAAI,IAAI,CAAC,GAAG,CAAC;AAAA,MAC9B;AACA,mBAAa;AAAA,IACf;AAAA,IAEA,SAAS,KAAoB;AAC3B,mBAAa,OAAO,GAAG;AACvB,mBAAa;AAAA,IACf;AAAA,IAEA,gBAAgB,MAAuB;AACrC,qBAAe,IAAI,IAAI,IAAI;AAC3B,mBAAa;AAAA,IACf;AAAA;AAAA,IAGA,YAAY,KAAoB;AAC9B,kBAAY,IAAI,GAAG;AACnB,mBAAa;AAAA,IACf;AAAA,IAEA,WAAW,KAAoB;AAC7B,kBAAY,OAAO,GAAG;AACtB,iBAAW,IAAI,GAAG;AAClB,mBAAa;AAAA,IACf;AAAA,IAEA,YAAY,WAAoB,UAAgC;AAC9D,YAAM,WAAW,QAAQ,IAAI,SAAS;AACtC,UAAI,CAAC,SAAU;AACd,MAAC,SAAS,KAAiC,GAAG,QAAQ,IAAI;AAC3D,eAAS,KAAK;AACd,mBAAa;AAAA,IACf;AAAA;AAAA,IAGA,SAAS,SAAkB,SAAkB,UAA6C;AACxF,UAAI,YAAY,QAAS,QAAO;AAChC,YAAM,YAAY,mBAAmB,OAAO;AAC5C,UAAI,UAAU,SAAS,OAAO,EAAG,QAAO;AAExC,YAAM,EAAE,WAAW,QAAQ,IAAI,eAAe,OAAO,OAAO;AAC5D,UAAI,CAAC,QAAS,QAAO;AAErB,cAAQ,eAAe,WAAW,SAAS,SAAS,QAAQ;AAC5D,eAAS,KAAK;AACd,mBAAa;AACb,aAAO;AAAA,IACT;AAAA;AAAA,IAGA,YAAY,WAA2D;AACrE,UAAI,CAAC,WAAW;AACd,uBAAe;AACf;AAAA,MACF;AACA,YAAM,UAAU,oBAAI,IAAa;AACjC,iBAAW,CAAC,KAAK,QAAQ,KAAK,SAAS;AACrC,YAAI,UAAU,SAAS,IAAI,GAAG;AAC5B,kBAAQ,IAAI,GAAG;AACf,gBAAM,YAAY,mBAAmB,GAAG;AACxC,qBAAW,MAAM,UAAW,SAAQ,IAAI,EAAE;AAAA,QAC5C;AAAA,MACF;AACA,qBAAe;AAAA,IACjB;AAAA,IAEA,kBAAoC;AAClC,aAAO,eAAe,CAAC,GAAG,YAAY,IAAI;AAAA,IAC5C;AAAA;AAAA,IAGA,QAAQ,KAAwC;AAC9C,aAAO,QAAQ,IAAI,GAAG,GAAG;AAAA,IAC3B;AAAA,IAEA,aAAa,KAA8B;AACzC,aAAO,QAAQ,IAAI,GAAG,GAAG,aAAa;AAAA,IACxC;AAAA,IAEA,aAAa,KAAyB;AACpC,aAAO,QAAQ,IAAI,GAAG,GAAG,aAAa,CAAC;AAAA,IACzC;AAAA,IAEA,aAAwB;AACtB,aAAO,CAAC,GAAG,QAAQ,KAAK,CAAC;AAAA,IAC3B;AAAA,IAEA,cAAyB;AACvB,YAAM,SAAoB,CAAC;AAC3B,iBAAW,CAAC,KAAK,QAAQ,KAAK,SAAS;AACrC,YAAI,SAAS,OAAQ,QAAO,KAAK,GAAG;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AAAA,IAEA,WAAsB;AACpB,aAAO;AAAA,QACL,cAAc,CAAC,GAAG,YAAY;AAAA,QAC9B,aAAa,CAAC,GAAG,WAAW;AAAA,QAC5B,iBAAiB,CAAC,GAAG,eAAe;AAAA,QACpC,cAAc,CAAC,GAAG,YAAY;AAAA,QAC9B,YAAY,CAAC,GAAG,UAAU;AAAA,QAC1B,aAAa,CAAC,GAAG,WAAW;AAAA,MAC9B;AAAA,IACF;AAAA,IAEA,eAAe;AACb,YAAM,SAAiH,CAAC;AAExH,eAAS,KAAK,MAAsB,WAA2B,OAAe;AAC5E,mBAAW,KAAK,MAAM;AACpB,gBAAM,IAAI,OAAO,CAAC;AAClB,cAAI,gBAAgB,CAAC,aAAa,IAAI,CAAC,EAAG;AAE1C,gBAAM,WAAW,YAAY,CAAC;AAC9B,gBAAM,SAAS,EAAE,WAAW,SAAS,CAAC,YAAY,SAAS,WAAW;AAEtE,iBAAO,KAAK,EAAE,MAAM,GAAG,KAAK,GAAG,OAAO,QAAQ,UAAU,CAAC;AAEzD,cAAI,CAAC,UAAU,aAAa,IAAI,CAAC,KAAK,YAAY,SAAS,SAAS,GAAG;AACrE,iBAAK,UAAU,GAAG,QAAQ,CAAC;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,MAAM,CAAC;AACnB,aAAO;AAAA,IACT;AAAA,IAEA,QAAc;AACZ,cAAQ,CAAC;AACT,gBAAU,oBAAI,IAAI;AAClB,qBAAe,oBAAI,IAAI;AACvB,oBAAc,oBAAI,IAAI;AACtB,wBAAkB,oBAAI,IAAI;AAC1B,qBAAe,oBAAI,IAAI;AACvB,mBAAa,oBAAI,IAAI;AACrB,oBAAc,oBAAI,IAAI;AACtB,qBAAe;AACf,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,SAAO;AACT;","names":["children"]}