@visual-json/core 0.1.1 → 0.3.0

package/README.md

@@ -80,6 +80,14 @@ All operations return a new `TreeState` with structural sharing.
       <td><code>addProperty(state, parentId, key, value)</code></td>
       <td>Add a child to an object or array</td>
     </tr>
+    <tr>
+      <td><code>insertProperty(state, parentId, key, value, index)</code></td>
+      <td>Insert a child at a specific index</td>
+    </tr>
+    <tr>
+      <td><code>insertNode(state, parentId, node, index)</code></td>
+      <td>Insert an existing node subtree at a specific index, preserving IDs</td>
+    </tr>
     <tr>
       <td><code>removeNode(state, nodeId)</code></td>
       <td>Remove a node</td>
@@ -92,6 +100,10 @@ All operations return a new `TreeState` with structural sharing.
       <td><code>reorderChildren(state, parentId, from, to)</code></td>
       <td>Reorder children within a parent</td>
     </tr>
+    <tr>
+      <td><code>reorderChildrenMulti(state, parentId, movedIds, targetSiblingId, position)</code></td>
+      <td>Reorder multiple children relative to a sibling</td>
+    </tr>
     <tr>
       <td><code>changeType(state, nodeId, newType)</code></td>
       <td>Convert a node to a different type</td>

package/dist/index.d.mts

@@ -70,15 +70,30 @@ declare function getNodeType(value: JsonValue): NodeType;
 declare function buildSubtree(key: string, value: JsonValue, parentPath: string, parentId: string | null, nodesById: Map<string, TreeNode>): TreeNode;
 declare function fromJson(value: JsonValue): TreeState;
 declare function toJson(node: TreeNode): JsonValue;
+/**
+ * Clone a subtree with updated key, path, and parentId while preserving
+ * all original node IDs. Used for cross-parent moves where identity must
+ * be retained so that UI state (expanded, selected, etc.) stays valid.
+ */
+declare function reparentSubtree(node: TreeNode, newKey: string, parentPath: string, newParentId: string): TreeNode;
 declare function findNode(state: TreeState, nodeId: string): TreeNode | undefined;
 declare function findNodeByPath(state: TreeState, path: string): TreeNode | undefined;
+/**
+ * Check whether `nodeId` is a descendant of `potentialAncestorId` by walking
+ * up `parentId` links. Returns `true` when the two IDs are equal (a node is
+ * considered a descendant of itself).
+ */
+declare function isDescendant(tree: TreeState, nodeId: string, potentialAncestorId: string): boolean;
 
 declare function setValue(state: TreeState, nodeId: string, value: JsonValue): TreeState;
 declare function setKey(state: TreeState, nodeId: string, newKey: string): TreeState;
 declare function addProperty(state: TreeState, parentId: string, key: string, value: JsonValue): TreeState;
+declare function insertProperty(state: TreeState, parentId: string, key: string, value: JsonValue, index: number): TreeState;
+declare function insertNode(state: TreeState, parentId: string, node: TreeNode, index: number): TreeState;
 declare function removeNode(state: TreeState, nodeId: string): TreeState;
 declare function moveNode(state: TreeState, nodeId: string, newParentId: string, index?: number): TreeState;
 declare function reorderChildren(state: TreeState, parentId: string, fromIndex: number, toIndex: number): TreeState;
+declare function reorderChildrenMulti(state: TreeState, parentId: string, movedIds: string[], targetSiblingId: string, position: "before" | "after"): TreeState;
 declare function changeType(state: TreeState, nodeId: string, newType: NodeType): TreeState;
 declare function duplicateNode(state: TreeState, nodeId: string): TreeState;
 
@@ -129,4 +144,4 @@ interface DiffEntry {
 declare function computeDiff(original: JsonValue, current: JsonValue, path?: string): DiffEntry[];
 declare function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType>;
 
-export { type DiffEntry, type DiffType, History, type JsonArray, type JsonObject, type JsonPrimitive, type JsonSchema, type JsonSchemaProperty, type JsonValue, type NodeType, type SearchMatch, type TreeNode, type TreeState, type ValidationResult, addProperty, buildSubtree, changeType, clearSchemaCache, computeDiff, duplicateNode, findNode, findNodeByPath, fromJson, generateId, getAncestorIds, getDiffPaths, getNodeType, getPropertySchema, moveNode, removeNode, reorderChildren, resetIdCounter, resolveRef, resolveSchema, searchNodes, setKey, setValue, toJson, validateNode };
+export { type DiffEntry, type DiffType, History, type JsonArray, type JsonObject, type JsonPrimitive, type JsonSchema, type JsonSchemaProperty, type JsonValue, type NodeType, type SearchMatch, type TreeNode, type TreeState, type ValidationResult, addProperty, buildSubtree, changeType, clearSchemaCache, computeDiff, duplicateNode, findNode, findNodeByPath, fromJson, generateId, getAncestorIds, getDiffPaths, getNodeType, getPropertySchema, insertNode, insertProperty, isDescendant, moveNode, removeNode, reorderChildren, reorderChildrenMulti, reparentSubtree, resetIdCounter, resolveRef, resolveSchema, searchNodes, setKey, setValue, toJson, validateNode };

package/dist/index.d.ts

@@ -70,15 +70,30 @@ declare function getNodeType(value: JsonValue): NodeType;
 declare function buildSubtree(key: string, value: JsonValue, parentPath: string, parentId: string | null, nodesById: Map<string, TreeNode>): TreeNode;
 declare function fromJson(value: JsonValue): TreeState;
 declare function toJson(node: TreeNode): JsonValue;
+/**
+ * Clone a subtree with updated key, path, and parentId while preserving
+ * all original node IDs. Used for cross-parent moves where identity must
+ * be retained so that UI state (expanded, selected, etc.) stays valid.
+ */
+declare function reparentSubtree(node: TreeNode, newKey: string, parentPath: string, newParentId: string): TreeNode;
 declare function findNode(state: TreeState, nodeId: string): TreeNode | undefined;
 declare function findNodeByPath(state: TreeState, path: string): TreeNode | undefined;
+/**
+ * Check whether `nodeId` is a descendant of `potentialAncestorId` by walking
+ * up `parentId` links. Returns `true` when the two IDs are equal (a node is
+ * considered a descendant of itself).
+ */
+declare function isDescendant(tree: TreeState, nodeId: string, potentialAncestorId: string): boolean;
 
 declare function setValue(state: TreeState, nodeId: string, value: JsonValue): TreeState;
 declare function setKey(state: TreeState, nodeId: string, newKey: string): TreeState;
 declare function addProperty(state: TreeState, parentId: string, key: string, value: JsonValue): TreeState;
+declare function insertProperty(state: TreeState, parentId: string, key: string, value: JsonValue, index: number): TreeState;
+declare function insertNode(state: TreeState, parentId: string, node: TreeNode, index: number): TreeState;
 declare function removeNode(state: TreeState, nodeId: string): TreeState;
 declare function moveNode(state: TreeState, nodeId: string, newParentId: string, index?: number): TreeState;
 declare function reorderChildren(state: TreeState, parentId: string, fromIndex: number, toIndex: number): TreeState;
+declare function reorderChildrenMulti(state: TreeState, parentId: string, movedIds: string[], targetSiblingId: string, position: "before" | "after"): TreeState;
 declare function changeType(state: TreeState, nodeId: string, newType: NodeType): TreeState;
 declare function duplicateNode(state: TreeState, nodeId: string): TreeState;
 
@@ -129,4 +144,4 @@ interface DiffEntry {
 declare function computeDiff(original: JsonValue, current: JsonValue, path?: string): DiffEntry[];
 declare function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType>;
 
-export { type DiffEntry, type DiffType, History, type JsonArray, type JsonObject, type JsonPrimitive, type JsonSchema, type JsonSchemaProperty, type JsonValue, type NodeType, type SearchMatch, type TreeNode, type TreeState, type ValidationResult, addProperty, buildSubtree, changeType, clearSchemaCache, computeDiff, duplicateNode, findNode, findNodeByPath, fromJson, generateId, getAncestorIds, getDiffPaths, getNodeType, getPropertySchema, moveNode, removeNode, reorderChildren, resetIdCounter, resolveRef, resolveSchema, searchNodes, setKey, setValue, toJson, validateNode };
+export { type DiffEntry, type DiffType, History, type JsonArray, type JsonObject, type JsonPrimitive, type JsonSchema, type JsonSchemaProperty, type JsonValue, type NodeType, type SearchMatch, type TreeNode, type TreeState, type ValidationResult, addProperty, buildSubtree, changeType, clearSchemaCache, computeDiff, duplicateNode, findNode, findNodeByPath, fromJson, generateId, getAncestorIds, getDiffPaths, getNodeType, getPropertySchema, insertNode, insertProperty, isDescendant, moveNode, removeNode, reorderChildren, reorderChildrenMulti, reparentSubtree, resetIdCounter, resolveRef, resolveSchema, searchNodes, setKey, setValue, toJson, validateNode };

package/dist/index.js

@@ -35,9 +35,14 @@ __export(index_exports, {
   getDiffPaths: () => getDiffPaths,
   getNodeType: () => getNodeType,
   getPropertySchema: () => getPropertySchema,
+  insertNode: () => insertNode,
+  insertProperty: () => insertProperty,
+  isDescendant: () => isDescendant,
   moveNode: () => moveNode,
   removeNode: () => removeNode,
   reorderChildren: () => reorderChildren,
+  reorderChildrenMulti: () => reorderChildrenMulti,
+  reparentSubtree: () => reparentSubtree,
   resetIdCounter: () => resetIdCounter,
   resolveRef: () => resolveRef,
   resolveSchema: () => resolveSchema,
@@ -130,6 +135,23 @@ function toJson(node) {
       return node.value;
   }
 }
+function reparentSubtree(node, newKey, parentPath, newParentId) {
+  const newPath = parentPath ? `${parentPath}/${newKey}` : `/${newKey}`;
+  return {
+    ...node,
+    key: newKey,
+    path: newPath,
+    parentId: newParentId,
+    children: node.children.map(
+      (child, i) => reparentSubtree(
+        child,
+        node.type === "array" ? String(i) : child.key,
+        newPath,
+        node.id
+      )
+    )
+  };
+}
 function findNode(state, nodeId) {
   return state.nodesById.get(nodeId);
 }
@@ -144,6 +166,14 @@ function findNodeByPath(state, path) {
   }
   return current;
 }
+function isDescendant(tree, nodeId, potentialAncestorId) {
+  let current = tree.nodesById.get(nodeId);
+  while (current) {
+    if (current.id === potentialAncestorId) return true;
+    current = current.parentId ? tree.nodesById.get(current.parentId) : void 0;
+  }
+  return false;
+}
 
 // src/operations.ts
 function rebuildMap(root) {
@@ -214,7 +244,13 @@ function setValue(state, nodeId, value) {
   return clonePathToNode(state, nodeId, (n) => {
     const parentPath = n.path.split("/").slice(0, -1).join("/") || "";
     const nodesById = /* @__PURE__ */ new Map();
-    const subtree = buildSubtree(n.key, value, parentPath, n.parentId, nodesById);
+    const subtree = buildSubtree(
+      n.key,
+      value,
+      parentPath,
+      n.parentId,
+      nodesById
+    );
     return { ...subtree, id: n.id };
   });
 }
@@ -240,11 +276,33 @@ function addProperty(state, parentId, key, value) {
   if (!parent) return state;
   return clonePathToNode(state, parentId, (p) => {
     const parentPath = p.path === "/" ? "" : p.path;
-    const nodesById = /* @__PURE__ */ new Map();
-    const newChild = buildSubtree(key, value, parentPath, p.id, nodesById);
+    const newChild = buildSubtree(key, value, parentPath, p.id, /* @__PURE__ */ new Map());
     return { ...p, children: [...p.children, newChild] };
   });
 }
+function insertProperty(state, parentId, key, value, index) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  return clonePathToNode(state, parentId, (p) => {
+    const parentPath = p.path === "/" ? "" : p.path;
+    const newChild = buildSubtree(key, value, parentPath, p.id, /* @__PURE__ */ new Map());
+    const newChildren = [...p.children];
+    newChildren.splice(index, 0, newChild);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
+function insertNode(state, parentId, node, index) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  return clonePathToNode(state, parentId, (p) => {
+    const parentPath = p.path === "/" ? "" : p.path;
+    const key = p.type === "array" ? String(index) : node.key;
+    const reparented = reparentSubtree(node, key, parentPath, p.id);
+    const newChildren = [...p.children];
+    newChildren.splice(index, 0, reparented);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
 function removeNode(state, nodeId) {
   const node = state.nodesById.get(nodeId);
   if (!node || !node.parentId) return state;
@@ -266,13 +324,12 @@ function moveNode(state, nodeId, newParentId, index) {
   });
   return clonePathToNode(removed, newParentId, (p) => {
     const parentPath = p.path === "/" ? "" : p.path;
-    const nodesById = /* @__PURE__ */ new Map();
     const newChild = buildSubtree(
       p.type === "array" ? String(index ?? p.children.length) : node.key,
       nodeValue,
       parentPath,
       p.id,
-      nodesById
+      /* @__PURE__ */ new Map()
     );
     const newChildren = [...p.children];
     const insertAt = index ?? newChildren.length;
@@ -290,6 +347,40 @@ function reorderChildren(state, parentId, fromIndex, toIndex) {
     return reindexArrayChildren({ ...p, children: newChildren });
   });
 }
+function reorderChildrenMulti(state, parentId, movedIds, targetSiblingId, position) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  const movedSet = new Set(movedIds);
+  return clonePathToNode(state, parentId, (p) => {
+    const remaining = p.children.filter((c) => !movedSet.has(c.id));
+    let insertIdx = remaining.findIndex((c) => c.id === targetSiblingId);
+    if (insertIdx === -1) {
+      if (movedSet.has(targetSiblingId)) {
+        const origIdx = p.children.findIndex((c) => c.id === targetSiblingId);
+        const origMap = new Map(p.children.map((c, i) => [c.id, i]));
+        if (position === "after") {
+          insertIdx = remaining.findIndex(
+            (c) => (origMap.get(c.id) ?? -1) > origIdx
+          );
+          if (insertIdx === -1) insertIdx = remaining.length;
+        } else {
+          insertIdx = remaining.findIndex(
+            (c) => (origMap.get(c.id) ?? -1) >= origIdx
+          );
+          if (insertIdx === -1) insertIdx = remaining.length;
+        }
+      } else {
+        insertIdx = position === "after" ? remaining.length : 0;
+      }
+    } else if (position === "after") {
+      insertIdx++;
+    }
+    const moved = movedIds.map((id) => p.children.find((c) => c.id === id)).filter((c) => c !== void 0);
+    const newChildren = [...remaining];
+    newChildren.splice(insertIdx, 0, ...moved);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
 function convertValue(current, newType) {
   switch (newType) {
     case "string":
@@ -341,13 +432,12 @@ function duplicateNode(state, nodeId) {
     const idx = p.children.findIndex((c) => c.id === nodeId);
     const parentPath = p.path === "/" ? "" : p.path;
     const newKey = p.type === "array" ? String(idx + 1) : `${node.key}_copy`;
-    const nodesById = /* @__PURE__ */ new Map();
     const newChild = buildSubtree(
       newKey,
       structuredClone(nodeValue),
       parentPath,
       p.id,
-      nodesById
+      /* @__PURE__ */ new Map()
     );
     const newChildren = [...p.children];
     newChildren.splice(idx + 1, 0, newChild);
@@ -812,9 +902,14 @@ function getDiffPaths(entries) {
   getDiffPaths,
   getNodeType,
   getPropertySchema,
+  insertNode,
+  insertProperty,
+  isDescendant,
   moveNode,
   removeNode,
   reorderChildren,
+  reorderChildrenMulti,
+  reparentSubtree,
   resetIdCounter,
   resolveRef,
   resolveSchema,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/tree.ts","../src/operations.ts","../src/history.ts","../src/schema.ts","../src/validate.ts","../src/search.ts","../src/diff.ts"],"sourcesContent":["export type {\n  JsonValue,\n  JsonPrimitive,\n  JsonArray,\n  JsonObject,\n  NodeType,\n  TreeNode,\n  TreeState,\n  JsonSchema,\n  JsonSchemaProperty,\n} from \"./types\";\n\nexport {\n  fromJson,\n  toJson,\n  findNode,\n  findNodeByPath,\n  resetIdCounter,\n  getNodeType,\n  generateId,\n  buildSubtree,\n} from \"./tree\";\n\nexport {\n  setValue,\n  setKey,\n  addProperty,\n  removeNode,\n  moveNode,\n  reorderChildren,\n  changeType,\n  duplicateNode,\n} from \"./operations\";\n\nexport { History } from \"./history\";\n\nexport {\n  resolveSchema,\n  resolveRef,\n  getPropertySchema,\n  clearSchemaCache,\n} from \"./schema\";\n\nexport { validateNode, type ValidationResult } from \"./validate\";\n\nexport { searchNodes, getAncestorIds, type SearchMatch } from \"./search\";\n\nexport {\n  computeDiff,\n  getDiffPaths,\n  type DiffEntry,\n  type DiffType,\n} from \"./diff\";\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  JsonObject,\n  JsonArray,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\n\nlet nextId = 0;\n\nexport function generateId(): string {\n  return `node_${++nextId}`;\n}\n\nexport function resetIdCounter(): void {\n  nextId = 0;\n}\n\nexport function getNodeType(value: JsonValue): NodeType {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  return typeof value as NodeType;\n}\n\nexport function buildSubtree(\n  key: string,\n  value: JsonValue,\n  parentPath: string,\n  parentId: string | null,\n  nodesById: Map<string, TreeNode>,\n): TreeNode {\n  const id = generateId();\n  const path = parentPath ? `${parentPath}/${key}` : `/${key}`;\n  const type = getNodeType(value);\n\n  const node: TreeNode = {\n    id,\n    key,\n    path,\n    type,\n    value:\n      type === \"object\" || type === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId,\n  };\n\n  nodesById.set(id, node);\n\n  if (type === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    node.children = Object.keys(obj).map((childKey) =>\n      buildSubtree(childKey, obj[childKey], path, id, nodesById),\n    );\n  } else if (type === \"array\") {\n    const arr = value as JsonArray;\n    node.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, path, id, nodesById),\n    );\n  }\n\n  return node;\n}\n\nexport function fromJson(value: JsonValue): TreeState {\n  const nodesById = new Map<string, TreeNode>();\n\n  const rootType = getNodeType(value);\n  const root: TreeNode = {\n    id: generateId(),\n    key: \"\",\n    path: \"/\",\n    type: rootType,\n    value:\n      rootType === \"object\" || rootType === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId: null,\n  };\n\n  nodesById.set(root.id, root);\n\n  if (rootType === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    root.children = Object.keys(obj).map((key) =>\n      buildSubtree(key, obj[key], \"\", root.id, nodesById),\n    );\n  } else if (rootType === \"array\") {\n    const arr = value as JsonArray;\n    root.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, \"\", root.id, nodesById),\n    );\n  }\n\n  return { root, nodesById };\n}\n\nexport function toJson(node: TreeNode): JsonValue {\n  switch (node.type) {\n    case \"object\": {\n      const obj: JsonObject = {};\n      for (const child of node.children) {\n        obj[child.key] = toJson(child);\n      }\n      return obj;\n    }\n    case \"array\":\n      return node.children.map((child) => toJson(child));\n    default:\n      return node.value as JsonValue;\n  }\n}\n\nexport function findNode(\n  state: TreeState,\n  nodeId: string,\n): TreeNode | undefined {\n  return state.nodesById.get(nodeId);\n}\n\nexport function findNodeByPath(\n  state: TreeState,\n  path: string,\n): TreeNode | undefined {\n  if (path === \"/\") return state.root;\n\n  const segments = path.split(\"/\").filter(Boolean);\n  let current = state.root;\n\n  for (const segment of segments) {\n    const child = current.children.find((c) => c.key === segment);\n    if (!child) return undefined;\n    current = child;\n  }\n\n  return current;\n}\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\nimport {\n  toJson,\n  getNodeType,\n  generateId,\n  buildSubtree,\n} from \"./tree\";\n\nfunction rebuildMap(root: TreeNode): Map<string, TreeNode> {\n  const map = new Map<string, TreeNode>();\n  function walk(node: TreeNode) {\n    map.set(node.id, node);\n    for (const child of node.children) walk(child);\n  }\n  walk(root);\n  return map;\n}\n\nfunction recomputePaths(node: TreeNode, newParentPath: string): TreeNode {\n  const newPath = newParentPath\n    ? `${newParentPath}/${node.key}`\n    : `/${node.key}`;\n  if (node.path === newPath && node.children.length === 0) return node;\n  return {\n    ...node,\n    path: newPath,\n    children: node.children.map((child) => recomputePaths(child, newPath)),\n  };\n}\n\n/**\n * Clone only the ancestor chain from root to `targetId` (structural sharing),\n * apply `updater` to the target, and rebuild the `nodesById` map.\n */\nfunction clonePathToNode(\n  state: TreeState,\n  targetId: string,\n  updater: (node: TreeNode) => TreeNode,\n): TreeState {\n  const chain: string[] = [];\n  let cur: TreeNode | undefined = state.nodesById.get(targetId);\n  while (cur) {\n    chain.unshift(cur.id);\n    cur = cur.parentId ? state.nodesById.get(cur.parentId) : undefined;\n  }\n  if (chain.length === 0) return state;\n\n  function cloneAlongPath(node: TreeNode, depth: number): TreeNode {\n    if (depth === chain.length - 1) {\n      return updater(node);\n    }\n    const nextInChain = chain[depth + 1];\n    return {\n      ...node,\n      children: node.children.map((child) =>\n        child.id === nextInChain ? cloneAlongPath(child, depth + 1) : child,\n      ),\n    };\n  }\n\n  const newRoot = cloneAlongPath(state.root, 0);\n  return { root: newRoot, nodesById: rebuildMap(newRoot) };\n}\n\nfunction reindexArrayChildren(parent: TreeNode): TreeNode {\n  if (parent.type !== \"array\") return parent;\n  const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n  return {\n    ...parent,\n    children: parent.children.map((child, i) => {\n      const newKey = String(i);\n      if (child.key === newKey) return child;\n      return recomputePaths({ ...child, key: newKey }, parentPath);\n    }),\n  };\n}\n\nexport function setValue(\n  state: TreeState,\n  nodeId: string,\n  value: JsonValue,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const newType = getNodeType(value);\n\n  if (newType !== \"object\" && newType !== \"array\") {\n    return clonePathToNode(state, nodeId, (n) => ({\n      ...n,\n      type: newType,\n      value: value as JsonPrimitive,\n      children: [],\n    }));\n  }\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = n.path.split(\"/\").slice(0, -1).join(\"/\") || \"\";\n    const nodesById = new Map<string, TreeNode>();\n    const subtree = buildSubtree(n.key, value, parentPath, n.parentId, nodesById);\n    return { ...subtree, id: n.id };\n  });\n}\n\nexport function setKey(\n  state: TreeState,\n  nodeId: string,\n  newKey: string,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent || parent.type !== \"object\") return state;\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n    const newPath = `${parentPath}/${newKey}`;\n    const updated: TreeNode = { ...n, key: newKey, path: newPath };\n    if (updated.children.length > 0) {\n      updated.children = updated.children.map((child) =>\n        recomputePaths(child, newPath),\n      );\n    }\n    return updated;\n  });\n}\n\nexport function addProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(key, value, parentPath, p.id, nodesById);\n    return { ...p, children: [...p.children, newChild] };\n  });\n}\n\nexport function removeNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function moveNode(\n  state: TreeState,\n  nodeId: string,\n  newParentId: string,\n  index?: number,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const srcParent = state.nodesById.get(node.parentId);\n  const dstParent = state.nodesById.get(newParentId);\n  if (!srcParent || !dstParent) return state;\n\n  const nodeValue = toJson(node);\n\n  const removed = clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n\n  return clonePathToNode(removed, newParentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(\n      p.type === \"array\" ? String(index ?? p.children.length) : node.key,\n      nodeValue,\n      parentPath,\n      p.id,\n      nodesById,\n    );\n    const newChildren = [...p.children];\n    const insertAt = index ?? newChildren.length;\n    newChildren.splice(insertAt, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildren(\n  state: TreeState,\n  parentId: string,\n  fromIndex: number,\n  toIndex: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const newChildren = [...p.children];\n    const [item] = newChildren.splice(fromIndex, 1);\n    newChildren.splice(toIndex, 0, item);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nfunction convertValue(current: JsonValue, newType: NodeType): JsonValue {\n  switch (newType) {\n    case \"string\":\n      if (current === null || current === undefined) return \"\";\n      if (typeof current === \"object\") return JSON.stringify(current);\n      return String(current);\n    case \"number\": {\n      const n = Number(current);\n      return isNaN(n) ? 0 : n;\n    }\n    case \"boolean\":\n      return Boolean(current);\n    case \"null\":\n      return null;\n    case \"object\":\n      if (\n        current !== null &&\n        typeof current === \"object\" &&\n        !Array.isArray(current)\n      )\n        return current;\n      if (Array.isArray(current)) {\n        const obj: Record<string, JsonValue> = {};\n        current.forEach((item, i) => {\n          obj[String(i)] = item;\n        });\n        return obj;\n      }\n      return {};\n    case \"array\":\n      if (Array.isArray(current)) return current;\n      if (current !== null && typeof current === \"object\")\n        return Object.values(current);\n      return current === null || current === undefined ? [] : [current];\n    default:\n      return current;\n  }\n}\n\nexport function changeType(\n  state: TreeState,\n  nodeId: string,\n  newType: NodeType,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const currentValue = toJson(node);\n  const newValue = convertValue(currentValue, newType);\n  return setValue(state, nodeId, newValue);\n}\n\nexport function duplicateNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent) return state;\n\n  const nodeValue = toJson(node);\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const idx = p.children.findIndex((c) => c.id === nodeId);\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newKey = p.type === \"array\" ? String(idx + 1) : `${node.key}_copy`;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(\n      newKey,\n      structuredClone(nodeValue),\n      parentPath,\n      p.id,\n      nodesById,\n    );\n    const newChildren = [...p.children];\n    newChildren.splice(idx + 1, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n","import type { TreeState } from \"./types\";\n\nconst MAX_HISTORY = 100;\n\nexport class History {\n  private stack: TreeState[] = [];\n  private cursor = -1;\n\n  push(state: TreeState): void {\n    this.stack = this.stack.slice(0, this.cursor + 1);\n    this.stack.push(state);\n    if (this.stack.length > MAX_HISTORY) {\n      this.stack.shift();\n    } else {\n      this.cursor++;\n    }\n  }\n\n  undo(): TreeState | null {\n    if (!this.canUndo) return null;\n    this.cursor--;\n    return this.stack[this.cursor];\n  }\n\n  redo(): TreeState | null {\n    if (!this.canRedo) return null;\n    this.cursor++;\n    return this.stack[this.cursor];\n  }\n\n  get canUndo(): boolean {\n    return this.cursor > 0;\n  }\n\n  get canRedo(): boolean {\n    return this.cursor < this.stack.length - 1;\n  }\n\n  get current(): TreeState | null {\n    return this.stack[this.cursor] ?? null;\n  }\n}\n","import type {\n  JsonSchema,\n  JsonSchemaProperty,\n  JsonValue,\n  JsonObject,\n} from \"./types\";\n\nconst KNOWN_SCHEMAS: Record<string, string> = {\n  \"package.json\": \"https://json.schemastore.org/package.json\",\n  \"tsconfig.json\": \"https://json.schemastore.org/tsconfig\",\n  \"tsconfig.base.json\": \"https://json.schemastore.org/tsconfig\",\n  \".eslintrc.json\": \"https://json.schemastore.org/eslintrc\",\n  \".prettierrc\": \"https://json.schemastore.org/prettierrc\",\n  \".prettierrc.json\": \"https://json.schemastore.org/prettierrc\",\n  \"turbo.json\": \"https://turborepo.dev/schema.json\",\n  \".babelrc\": \"https://json.schemastore.org/babelrc\",\n  \"nest-cli.json\": \"https://json.schemastore.org/nest-cli\",\n  \"vercel.json\": \"https://openapi.vercel.sh/vercel.json\",\n  \".swcrc\": \"https://json.schemastore.org/swcrc\",\n};\n\nconst MAX_SCHEMA_CACHE = 50;\nconst schemaCache = new Map<string, JsonSchema>();\n\nasync function fetchSchema(url: string): Promise<JsonSchema | null> {\n  if (schemaCache.has(url)) {\n    return schemaCache.get(url)!;\n  }\n  try {\n    const res = await fetch(url);\n    if (!res.ok) return null;\n    const schema = (await res.json()) as JsonSchema;\n    if (schemaCache.size >= MAX_SCHEMA_CACHE) {\n      const oldest = schemaCache.keys().next().value;\n      if (oldest !== undefined) schemaCache.delete(oldest);\n    }\n    schemaCache.set(url, schema);\n    return schema;\n  } catch {\n    return null;\n  }\n}\n\nexport async function resolveSchema(\n  json: JsonValue,\n  filename?: string,\n): Promise<JsonSchema | null> {\n  if (\n    json !== null &&\n    typeof json === \"object\" &&\n    !Array.isArray(json) &&\n    typeof (json as JsonObject)[\"$schema\"] === \"string\"\n  ) {\n    const url = (json as JsonObject)[\"$schema\"] as string;\n    const schema = await fetchSchema(url);\n    if (schema) return schema;\n  }\n\n  if (filename) {\n    const base = filename.split(\"/\").pop() ?? filename;\n    const knownUrl = KNOWN_SCHEMAS[base];\n    if (knownUrl) {\n      return fetchSchema(knownUrl);\n    }\n  }\n\n  return null;\n}\n\nfunction findDefinition(\n  root: JsonSchemaProperty,\n  refPath: string,\n): JsonSchemaProperty | undefined {\n  if (!refPath.startsWith(\"#/\")) return undefined;\n  const segments = refPath.slice(2).split(\"/\");\n  let current: unknown = root;\n\n  for (const seg of segments) {\n    if (current === null || typeof current !== \"object\") return undefined;\n    current = (current as Record<string, unknown>)[seg];\n  }\n\n  return current as JsonSchemaProperty | undefined;\n}\n\n/**\n * Resolve `$ref` pointers and merge `allOf` within a schema.\n * `visited` tracks refs to prevent infinite cycles.\n */\nexport function resolveRef(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited?: Set<string>,\n): JsonSchemaProperty {\n  const seen = visited ?? new Set<string>();\n\n  if (prop.$ref) {\n    if (seen.has(prop.$ref)) return prop;\n    seen.add(prop.$ref);\n    const resolved = findDefinition(root, prop.$ref);\n    if (resolved) {\n      return resolveRef(resolved, root, seen);\n    }\n    return prop;\n  }\n\n  if (prop.allOf && prop.allOf.length > 0) {\n    return mergeAllOf(prop, root, seen);\n  }\n\n  return prop;\n}\n\nfunction mergeAllOf(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited: Set<string>,\n): JsonSchemaProperty {\n  const merged: JsonSchemaProperty = { ...prop };\n  delete merged.allOf;\n\n  for (const sub of prop.allOf!) {\n    const resolved = resolveRef(sub, root, new Set(visited));\n    if (resolved.type && !merged.type) merged.type = resolved.type;\n    if (resolved.properties) {\n      merged.properties = { ...merged.properties, ...resolved.properties };\n    }\n    if (resolved.required) {\n      merged.required = [\n        ...new Set([...(merged.required ?? []), ...resolved.required]),\n      ];\n    }\n    if (\n      resolved.additionalProperties !== undefined &&\n      merged.additionalProperties === undefined\n    ) {\n      merged.additionalProperties = resolved.additionalProperties;\n    }\n    if (resolved.items && !merged.items) merged.items = resolved.items;\n    if (resolved.description && !merged.description)\n      merged.description = resolved.description;\n    if (resolved.title && !merged.title) merged.title = resolved.title;\n    if (resolved.enum && !merged.enum) merged.enum = resolved.enum;\n    if (resolved.minimum !== undefined && merged.minimum === undefined)\n      merged.minimum = resolved.minimum;\n    if (resolved.maximum !== undefined && merged.maximum === undefined)\n      merged.maximum = resolved.maximum;\n    if (resolved.minLength !== undefined && merged.minLength === undefined)\n      merged.minLength = resolved.minLength;\n    if (resolved.maxLength !== undefined && merged.maxLength === undefined)\n      merged.maxLength = resolved.maxLength;\n    if (resolved.pattern && !merged.pattern) merged.pattern = resolved.pattern;\n    if (resolved.format && !merged.format) merged.format = resolved.format;\n  }\n\n  return merged;\n}\n\nexport function getPropertySchema(\n  schema: JsonSchema | JsonSchemaProperty,\n  path: string,\n  rootSchema?: JsonSchemaProperty,\n): JsonSchemaProperty | undefined {\n  const root = rootSchema ?? schema;\n  const segments = path.split(\"/\").filter(Boolean);\n  let current: JsonSchemaProperty | undefined = resolveRef(schema, root);\n\n  for (const seg of segments) {\n    if (!current) return undefined;\n    current = resolveRef(current, root);\n\n    if (current.properties?.[seg]) {\n      current = resolveRef(current.properties[seg], root);\n      continue;\n    }\n\n    if (current.patternProperties) {\n      const match = Object.entries(current.patternProperties).find(\n        ([pattern]) => {\n          try {\n            return new RegExp(pattern).test(seg);\n          } catch {\n            return false;\n          }\n        },\n      );\n      if (match) {\n        current = resolveRef(match[1], root);\n        continue;\n      }\n    }\n\n    if (\n      current.additionalProperties &&\n      typeof current.additionalProperties === \"object\"\n    ) {\n      current = resolveRef(current.additionalProperties, root);\n      continue;\n    }\n\n    if (current.items) {\n      if (Array.isArray(current.items)) {\n        const idx = Number(seg);\n        if (!isNaN(idx) && current.items[idx]) {\n          current = resolveRef(current.items[idx], root);\n          continue;\n        }\n      } else {\n        current = resolveRef(current.items, root);\n        continue;\n      }\n    }\n\n    if (current.anyOf || current.oneOf) {\n      const variants = current.anyOf ?? current.oneOf ?? [];\n      let found: JsonSchemaProperty | undefined;\n      for (const variant of variants) {\n        const resolved = resolveRef(variant, root);\n        found = getPropertySchema(resolved, seg, root);\n        if (found) break;\n      }\n      if (found) {\n        current = found;\n        continue;\n      }\n      return undefined;\n    }\n\n    return undefined;\n  }\n\n  return current;\n}\n\nexport function clearSchemaCache(): void {\n  schemaCache.clear();\n}\n","import type { TreeNode, JsonSchemaProperty } from \"./types\";\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nfunction schemaTypeMatches(\n  nodeType: string,\n  schemaType: string | string[] | undefined,\n): boolean {\n  if (!schemaType) return true;\n  const types = Array.isArray(schemaType) ? schemaType : [schemaType];\n\n  if (nodeType === \"number\" && types.includes(\"integer\")) return true;\n  return types.includes(nodeType);\n}\n\nconst FORMAT_PATTERNS: Record<string, RegExp> = {\n  email: /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/,\n  uri: /^https?:\\/\\/.+/,\n  \"uri-reference\": /^(https?:\\/\\/|\\/|\\.\\.?\\/|#).*/,\n  \"date-time\": /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}/,\n  date: /^\\d{4}-\\d{2}-\\d{2}$/,\n  time: /^\\d{2}:\\d{2}:\\d{2}/,\n  ipv4: /^(\\d{1,3}\\.){3}\\d{1,3}$/,\n  ipv6: /^([0-9a-fA-F]{0,4}:){2,7}[0-9a-fA-F]{0,4}$/,\n  uuid: /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$/,\n  hostname:\n    /^[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?(\\.[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?)*$/,\n};\n\nexport function validateNode(\n  node: TreeNode,\n  schema: JsonSchemaProperty | undefined,\n): ValidationResult {\n  const errors: string[] = [];\n\n  if (!schema) {\n    return { valid: true, errors };\n  }\n\n  if (schema.type && !schemaTypeMatches(node.type, schema.type)) {\n    const expected = Array.isArray(schema.type)\n      ? schema.type.join(\" | \")\n      : schema.type;\n    errors.push(`Expected type \"${expected}\", got \"${node.type}\"`);\n  }\n\n  if (schema.enum && schema.enum.length > 0 && node.value !== undefined) {\n    const match = schema.enum.some(\n      (v) => JSON.stringify(v) === JSON.stringify(node.value),\n    );\n    if (!match) {\n      errors.push(\n        `Value must be one of: ${schema.enum.map((v) => JSON.stringify(v)).join(\", \")}`,\n      );\n    }\n  }\n\n  if (schema.const !== undefined && node.value !== undefined) {\n    if (JSON.stringify(node.value) !== JSON.stringify(schema.const)) {\n      errors.push(`Value must be ${JSON.stringify(schema.const)}`);\n    }\n  }\n\n  if (schema.required && (node.type === \"object\" || node.type === \"array\")) {\n    const childKeys = new Set(node.children.map((c) => c.key));\n    for (const req of schema.required) {\n      if (!childKeys.has(req)) {\n        errors.push(`Missing required property \"${req}\"`);\n      }\n    }\n  }\n\n  if (node.type === \"number\" && typeof node.value === \"number\") {\n    const val = node.value;\n    if (schema.minimum !== undefined && val < schema.minimum) {\n      errors.push(`Value must be >= ${schema.minimum}`);\n    }\n    if (schema.maximum !== undefined && val > schema.maximum) {\n      errors.push(`Value must be <= ${schema.maximum}`);\n    }\n    if (schema.exclusiveMinimum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMinimum === \"number\"\n          ? schema.exclusiveMinimum\n          : schema.minimum;\n      if (bound !== undefined && val <= bound) {\n        errors.push(`Value must be > ${bound}`);\n      }\n    }\n    if (schema.exclusiveMaximum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMaximum === \"number\"\n          ? schema.exclusiveMaximum\n          : schema.maximum;\n      if (bound !== undefined && val >= bound) {\n        errors.push(`Value must be < ${bound}`);\n      }\n    }\n    if (schema.multipleOf !== undefined) {\n      const remainder = Math.abs(val % schema.multipleOf);\n      if (remainder > 1e-10 && Math.abs(remainder - schema.multipleOf) > 1e-10) {\n        errors.push(`Value must be a multiple of ${schema.multipleOf}`);\n      }\n    }\n  }\n\n  if (node.type === \"string\" && typeof node.value === \"string\") {\n    const val = node.value;\n    if (schema.minLength !== undefined && val.length < schema.minLength) {\n      errors.push(`Must be at least ${schema.minLength} characters`);\n    }\n    if (schema.maxLength !== undefined && val.length > schema.maxLength) {\n      errors.push(`Must be at most ${schema.maxLength} characters`);\n    }\n    if (schema.pattern) {\n      try {\n        if (!new RegExp(schema.pattern).test(val)) {\n          errors.push(`Must match pattern: ${schema.pattern}`);\n        }\n      } catch {\n        // invalid regex in schema, skip\n      }\n    }\n    if (schema.format && FORMAT_PATTERNS[schema.format]) {\n      if (!FORMAT_PATTERNS[schema.format].test(val)) {\n        errors.push(`Invalid ${schema.format} format`);\n      }\n    }\n  }\n\n  if (node.type === \"array\") {\n    if (\n      schema.minItems !== undefined &&\n      node.children.length < schema.minItems\n    ) {\n      errors.push(`Must have at least ${schema.minItems} items`);\n    }\n    if (\n      schema.maxItems !== undefined &&\n      node.children.length > schema.maxItems\n    ) {\n      errors.push(`Must have at most ${schema.maxItems} items`);\n    }\n  }\n\n  if (node.type === \"object\") {\n    if (\n      schema.minProperties !== undefined &&\n      node.children.length < schema.minProperties\n    ) {\n      errors.push(`Must have at least ${schema.minProperties} properties`);\n    }\n    if (\n      schema.maxProperties !== undefined &&\n      node.children.length > schema.maxProperties\n    ) {\n      errors.push(`Must have at most ${schema.maxProperties} properties`);\n    }\n  }\n\n  return { valid: errors.length === 0, errors };\n}\n","import type { TreeNode, TreeState } from \"./types\";\n\nexport interface SearchMatch {\n  nodeId: string;\n  field: \"key\" | \"value\";\n}\n\nexport function searchNodes(tree: TreeState, query: string): SearchMatch[] {\n  if (!query.trim()) return [];\n  const matches: SearchMatch[] = [];\n  const lower = query.toLowerCase();\n\n  function walk(node: TreeNode) {\n    if (node.key && node.key.toLowerCase().includes(lower)) {\n      matches.push({ nodeId: node.id, field: \"key\" });\n    }\n    if (\n      node.value !== undefined &&\n      node.value !== null &&\n      String(node.value).toLowerCase().includes(lower)\n    ) {\n      matches.push({ nodeId: node.id, field: \"value\" });\n    }\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(tree.root);\n  return matches;\n}\n\n/**\n * Collect all ancestor node IDs for each matched node so the tree\n * can auto-expand paths to search results.\n */\nexport function getAncestorIds(\n  tree: TreeState,\n  nodeIds: string[],\n): Set<string> {\n  const ancestors = new Set<string>();\n\n  for (const nodeId of nodeIds) {\n    let current = tree.nodesById.get(nodeId);\n    while (current && current.parentId) {\n      ancestors.add(current.parentId);\n      current = tree.nodesById.get(current.parentId);\n    }\n  }\n\n  return ancestors;\n}\n","import type { JsonValue } from \"./types\";\n\nexport type DiffType = \"added\" | \"removed\" | \"changed\";\n\nexport interface DiffEntry {\n  path: string;\n  type: DiffType;\n  oldValue?: JsonValue;\n  newValue?: JsonValue;\n}\n\nexport function computeDiff(\n  original: JsonValue,\n  current: JsonValue,\n  path = \"\",\n): DiffEntry[] {\n  const entries: DiffEntry[] = [];\n\n  if (original === current) {\n    return entries;\n  }\n\n  if (\n    original === null ||\n    current === null ||\n    typeof original !== typeof current ||\n    Array.isArray(original) !== Array.isArray(current)\n  ) {\n    if (path) {\n      entries.push({\n        path,\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    } else {\n      diffObject(original, current, path, entries);\n    }\n    return entries;\n  }\n\n  if (typeof original !== \"object\") {\n    if (original !== current) {\n      entries.push({\n        path: path || \"/\",\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    }\n    return entries;\n  }\n\n  if (Array.isArray(original) && Array.isArray(current)) {\n    const maxLen = Math.max(original.length, current.length);\n    for (let i = 0; i < maxLen; i++) {\n      const childPath = path ? `${path}/${i}` : `/${i}`;\n      if (i >= original.length) {\n        entries.push({ path: childPath, type: \"added\", newValue: current[i] });\n      } else if (i >= current.length) {\n        entries.push({\n          path: childPath,\n          type: \"removed\",\n          oldValue: original[i],\n        });\n      } else {\n        entries.push(...computeDiff(original[i], current[i], childPath));\n      }\n    }\n    return entries;\n  }\n\n  diffObject(original, current, path, entries);\n  return entries;\n}\n\nfunction diffObject(\n  original: JsonValue,\n  current: JsonValue,\n  path: string,\n  entries: DiffEntry[],\n) {\n  const origObj =\n    original !== null &&\n    typeof original === \"object\" &&\n    !Array.isArray(original)\n      ? (original as Record<string, JsonValue>)\n      : {};\n  const currObj =\n    current !== null && typeof current === \"object\" && !Array.isArray(current)\n      ? (current as Record<string, JsonValue>)\n      : {};\n\n  const allKeys = new Set([...Object.keys(origObj), ...Object.keys(currObj)]);\n\n  for (const key of allKeys) {\n    const childPath = path ? `${path}/${key}` : `/${key}`;\n    const inOriginal = key in origObj;\n    const inCurrent = key in currObj;\n\n    if (!inOriginal && inCurrent) {\n      entries.push({ path: childPath, type: \"added\", newValue: currObj[key] });\n    } else if (inOriginal && !inCurrent) {\n      entries.push({\n        path: childPath,\n        type: \"removed\",\n        oldValue: origObj[key],\n      });\n    } else {\n      entries.push(...computeDiff(origObj[key], currObj[key], childPath));\n    }\n  }\n}\n\nexport function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType> {\n  const map = new Map<string, DiffType>();\n  for (const entry of entries) {\n    map.set(entry.path, entry.type);\n  }\n  return map;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACUA,IAAI,SAAS;AAEN,SAAS,aAAqB;AACnC,SAAO,QAAQ,EAAE,MAAM;AACzB;AAEO,SAAS,iBAAuB;AACrC,WAAS;AACX;AAEO,SAAS,YAAY,OAA4B;AACtD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,OAAO;AAChB;AAEO,SAAS,aACd,KACA,OACA,YACA,UACA,WACU;AACV,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,aAAa,GAAG,UAAU,IAAI,GAAG,KAAK,IAAI,GAAG;AAC1D,QAAM,OAAO,YAAY,KAAK;AAE9B,QAAM,OAAiB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OACE,SAAS,YAAY,SAAS,UAC1B,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX;AAAA,EACF;AAEA,YAAU,IAAI,IAAI,IAAI;AAEtB,MAAI,SAAS,YAAY,UAAU,MAAM;AACvC,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,aACpC,aAAa,UAAU,IAAI,QAAQ,GAAG,MAAM,IAAI,SAAS;AAAA,IAC3D;AAAA,EACF,WAAW,SAAS,SAAS;AAC3B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,MAAM,IAAI,SAAS;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,SAAS,OAA6B;AACpD,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,WAAW,YAAY,KAAK;AAClC,QAAM,OAAiB;AAAA,IACrB,IAAI,WAAW;AAAA,IACf,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OACE,aAAa,YAAY,aAAa,UAClC,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX,UAAU;AAAA,EACZ;AAEA,YAAU,IAAI,KAAK,IAAI,IAAI;AAE3B,MAAI,aAAa,YAAY,UAAU,MAAM;AAC3C,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,QACpC,aAAa,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,SAAS;AAAA,IACpD;AAAA,EACF,WAAW,aAAa,SAAS;AAC/B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,SAAS;AAAA,IAC1D;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,UAAU;AAC3B;AAEO,SAAS,OAAO,MAA2B;AAChD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,UAAU;AACb,YAAM,MAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,GAAG,IAAI,OAAO,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AACH,aAAO,KAAK,SAAS,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AAAA,IACnD;AACE,aAAO,KAAK;AAAA,EAChB;AACF;AAEO,SAAS,SACd,OACA,QACsB;AACtB,SAAO,MAAM,UAAU,IAAI,MAAM;AACnC;AAEO,SAAS,eACd,OACA,MACsB;AACtB,MAAI,SAAS,IAAK,QAAO,MAAM;AAE/B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAAU,MAAM;AAEpB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO;AAC5D,QAAI,CAAC,MAAO,QAAO;AACnB,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;;;AC9HA,SAAS,WAAW,MAAuC;AACzD,QAAM,MAAM,oBAAI,IAAsB;AACtC,WAAS,KAAK,MAAgB;AAC5B,QAAI,IAAI,KAAK,IAAI,IAAI;AACrB,eAAW,SAAS,KAAK,SAAU,MAAK,KAAK;AAAA,EAC/C;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAEA,SAAS,eAAe,MAAgB,eAAiC;AACvE,QAAM,UAAU,gBACZ,GAAG,aAAa,IAAI,KAAK,GAAG,KAC5B,IAAI,KAAK,GAAG;AAChB,MAAI,KAAK,SAAS,WAAW,KAAK,SAAS,WAAW,EAAG,QAAO;AAChE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,eAAe,OAAO,OAAO,CAAC;AAAA,EACvE;AACF;AAMA,SAAS,gBACP,OACA,UACA,SACW;AACX,QAAM,QAAkB,CAAC;AACzB,MAAI,MAA4B,MAAM,UAAU,IAAI,QAAQ;AAC5D,SAAO,KAAK;AACV,UAAM,QAAQ,IAAI,EAAE;AACpB,UAAM,IAAI,WAAW,MAAM,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC3D;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,WAAS,eAAe,MAAgB,OAAyB;AAC/D,QAAI,UAAU,MAAM,SAAS,GAAG;AAC9B,aAAO,QAAQ,IAAI;AAAA,IACrB;AACA,UAAM,cAAc,MAAM,QAAQ,CAAC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,KAAK,SAAS;AAAA,QAAI,CAAC,UAC3B,MAAM,OAAO,cAAc,eAAe,OAAO,QAAQ,CAAC,IAAI;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,eAAe,MAAM,MAAM,CAAC;AAC5C,SAAO,EAAE,MAAM,SAAS,WAAW,WAAW,OAAO,EAAE;AACzD;AAEA,SAAS,qBAAqB,QAA4B;AACxD,MAAI,OAAO,SAAS,QAAS,QAAO;AACpC,QAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,OAAO,SAAS,IAAI,CAAC,OAAO,MAAM;AAC1C,YAAM,SAAS,OAAO,CAAC;AACvB,UAAI,MAAM,QAAQ,OAAQ,QAAO;AACjC,aAAO,eAAe,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG,UAAU;AAAA,IAC7D,CAAC;AAAA,EACH;AACF;AAEO,SAAS,SACd,OACA,QACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,UAAU,YAAY,KAAK;AAEjC,MAAI,YAAY,YAAY,YAAY,SAAS;AAC/C,WAAO,gBAAgB,OAAO,QAAQ,CAAC,OAAO;AAAA,MAC5C,GAAG;AAAA,MACH,MAAM;AAAA,MACN;AAAA,MACA,UAAU,CAAC;AAAA,IACb,EAAE;AAAA,EACJ;AAEA,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,EAAE,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,KAAK;AAC/D,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,UAAU,aAAa,EAAE,KAAK,OAAO,YAAY,EAAE,UAAU,SAAS;AAC5E,WAAO,EAAE,GAAG,SAAS,IAAI,EAAE,GAAG;AAAA,EAChC,CAAC;AACH;AAEO,SAAS,OACd,OACA,QACA,QACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,UAAU,OAAO,SAAS,SAAU,QAAO;AAEhD,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,UAAM,UAAU,GAAG,UAAU,IAAI,MAAM;AACvC,UAAM,UAAoB,EAAE,GAAG,GAAG,KAAK,QAAQ,MAAM,QAAQ;AAC7D,QAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,cAAQ,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACvC,eAAe,OAAO,OAAO;AAAA,MAC/B;AAAA,IACF;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,SAAS,YACd,OACA,UACA,KACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,SAAS;AACrE,WAAO,EAAE,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,UAAU,QAAQ,EAAE;AAAA,EACrD,CAAC;AACH;AAEO,SAAS,WAAW,OAAkB,QAA2B;AACtE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,SACd,OACA,QACA,aACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,YAAY,MAAM,UAAU,IAAI,KAAK,QAAQ;AACnD,QAAM,YAAY,MAAM,UAAU,IAAI,WAAW;AACjD,MAAI,CAAC,aAAa,CAAC,UAAW,QAAO;AAErC,QAAM,YAAY,OAAO,IAAI;AAE7B,QAAM,UAAU,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAC3D,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AAED,SAAO,gBAAgB,SAAS,aAAa,CAAC,MAAM;AAClD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW;AAAA,MACf,EAAE,SAAS,UAAU,OAAO,SAAS,EAAE,SAAS,MAAM,IAAI,KAAK;AAAA,MAC/D;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,WAAW,SAAS,YAAY;AACtC,gBAAY,OAAO,UAAU,GAAG,QAAQ;AACxC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,gBACd,OACA,UACA,WACA,SACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,CAAC,IAAI,IAAI,YAAY,OAAO,WAAW,CAAC;AAC9C,gBAAY,OAAO,SAAS,GAAG,IAAI;AACnC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEA,SAAS,aAAa,SAAoB,SAA8B;AACtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,UAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AACtD,UAAI,OAAO,YAAY,SAAU,QAAO,KAAK,UAAU,OAAO;AAC9D,aAAO,OAAO,OAAO;AAAA,IACvB,KAAK,UAAU;AACb,YAAM,IAAI,OAAO,OAAO;AACxB,aAAO,MAAM,CAAC,IAAI,IAAI;AAAA,IACxB;AAAA,IACA,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,UACE,YAAY,QACZ,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO;AAEtB,eAAO;AACT,UAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAM,MAAiC,CAAC;AACxC,gBAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,cAAI,OAAO,CAAC,CAAC,IAAI;AAAA,QACnB,CAAC;AACD,eAAO;AAAA,MACT;AACA,aAAO,CAAC;AAAA,IACV,KAAK;AACH,UAAI,MAAM,QAAQ,OAAO,EAAG,QAAO;AACnC,UAAI,YAAY,QAAQ,OAAO,YAAY;AACzC,eAAO,OAAO,OAAO,OAAO;AAC9B,aAAO,YAAY,QAAQ,YAAY,SAAY,CAAC,IAAI,CAAC,OAAO;AAAA,IAClE;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,WACd,OACA,QACA,SACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,eAAe,OAAO,IAAI;AAChC,QAAM,WAAW,aAAa,cAAc,OAAO;AACnD,SAAO,SAAS,OAAO,QAAQ,QAAQ;AACzC;AAEO,SAAS,cAAc,OAAkB,QAA2B;AACzE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,YAAY,OAAO,IAAI;AAE7B,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,MAAM,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,MAAM;AACvD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,SAAS,EAAE,SAAS,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG;AACjE,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW;AAAA,MACf;AAAA,MACA,gBAAgB,SAAS;AAAA,MACzB;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,MAAM,GAAG,GAAG,QAAQ;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;;;AClSA,IAAM,cAAc;AAEb,IAAM,UAAN,MAAc;AAAA,EAAd;AACL,SAAQ,QAAqB,CAAC;AAC9B,SAAQ,SAAS;AAAA;AAAA,EAEjB,KAAK,OAAwB;AAC3B,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,CAAC;AAChD,SAAK,MAAM,KAAK,KAAK;AACrB,QAAI,KAAK,MAAM,SAAS,aAAa;AACnC,WAAK,MAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EAEA,IAAI,UAA4B;AAC9B,WAAO,KAAK,MAAM,KAAK,MAAM,KAAK;AAAA,EACpC;AACF;;;AClCA,IAAM,gBAAwC;AAAA,EAC5C,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,IAAM,mBAAmB;AACzB,IAAM,cAAc,oBAAI,IAAwB;AAEhD,eAAe,YAAY,KAAyC;AAClE,MAAI,YAAY,IAAI,GAAG,GAAG;AACxB,WAAO,YAAY,IAAI,GAAG;AAAA,EAC5B;AACA,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAU,MAAM,IAAI,KAAK;AAC/B,QAAI,YAAY,QAAQ,kBAAkB;AACxC,YAAM,SAAS,YAAY,KAAK,EAAE,KAAK,EAAE;AACzC,UAAI,WAAW,OAAW,aAAY,OAAO,MAAM;AAAA,IACrD;AACA,gBAAY,IAAI,KAAK,MAAM;AAC3B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,cACpB,MACA,UAC4B;AAC5B,MACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAQ,IAAI,KACnB,OAAQ,KAAoB,SAAS,MAAM,UAC3C;AACA,UAAM,MAAO,KAAoB,SAAS;AAC1C,UAAM,SAAS,MAAM,YAAY,GAAG;AACpC,QAAI,OAAQ,QAAO;AAAA,EACrB;AAEA,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC1C,UAAM,WAAW,cAAc,IAAI;AACnC,QAAI,UAAU;AACZ,aAAO,YAAY,QAAQ;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,eACP,MACA,SACgC;AAChC,MAAI,CAAC,QAAQ,WAAW,IAAI,EAAG,QAAO;AACtC,QAAM,WAAW,QAAQ,MAAM,CAAC,EAAE,MAAM,GAAG;AAC3C,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,OAAO,YAAY,SAAU,QAAO;AAC5D,cAAW,QAAoC,GAAG;AAAA,EACpD;AAEA,SAAO;AACT;AAMO,SAAS,WACd,MACA,MACA,SACoB;AACpB,QAAM,OAAO,WAAW,oBAAI,IAAY;AAExC,MAAI,KAAK,MAAM;AACb,QAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,SAAK,IAAI,KAAK,IAAI;AAClB,UAAM,WAAW,eAAe,MAAM,KAAK,IAAI;AAC/C,QAAI,UAAU;AACZ,aAAO,WAAW,UAAU,MAAM,IAAI;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO,WAAW,MAAM,MAAM,IAAI;AAAA,EACpC;AAEA,SAAO;AACT;AAEA,SAAS,WACP,MACA,MACA,SACoB;AACpB,QAAM,SAA6B,EAAE,GAAG,KAAK;AAC7C,SAAO,OAAO;AAEd,aAAW,OAAO,KAAK,OAAQ;AAC7B,UAAM,WAAW,WAAW,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC;AACvD,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY;AACvB,aAAO,aAAa,EAAE,GAAG,OAAO,YAAY,GAAG,SAAS,WAAW;AAAA,IACrE;AACA,QAAI,SAAS,UAAU;AACrB,aAAO,WAAW;AAAA,QAChB,GAAG,oBAAI,IAAI,CAAC,GAAI,OAAO,YAAY,CAAC,GAAI,GAAG,SAAS,QAAQ,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,QACE,SAAS,yBAAyB,UAClC,OAAO,yBAAyB,QAChC;AACA,aAAO,uBAAuB,SAAS;AAAA,IACzC;AACA,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,eAAe,CAAC,OAAO;AAClC,aAAO,cAAc,SAAS;AAChC,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,WAAW,CAAC,OAAO,QAAS,QAAO,UAAU,SAAS;AACnE,QAAI,SAAS,UAAU,CAAC,OAAO,OAAQ,QAAO,SAAS,SAAS;AAAA,EAClE;AAEA,SAAO;AACT;AAEO,SAAS,kBACd,QACA,MACA,YACgC;AAChC,QAAM,OAAO,cAAc;AAC3B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAA0C,WAAW,QAAQ,IAAI;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,cAAU,WAAW,SAAS,IAAI;AAElC,QAAI,QAAQ,aAAa,GAAG,GAAG;AAC7B,gBAAU,WAAW,QAAQ,WAAW,GAAG,GAAG,IAAI;AAClD;AAAA,IACF;AAEA,QAAI,QAAQ,mBAAmB;AAC7B,YAAM,QAAQ,OAAO,QAAQ,QAAQ,iBAAiB,EAAE;AAAA,QACtD,CAAC,CAAC,OAAO,MAAM;AACb,cAAI;AACF,mBAAO,IAAI,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,UACrC,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO;AACT,kBAAU,WAAW,MAAM,CAAC,GAAG,IAAI;AACnC;AAAA,MACF;AAAA,IACF;AAEA,QACE,QAAQ,wBACR,OAAO,QAAQ,yBAAyB,UACxC;AACA,gBAAU,WAAW,QAAQ,sBAAsB,IAAI;AACvD;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,UAAI,MAAM,QAAQ,QAAQ,KAAK,GAAG;AAChC,cAAM,MAAM,OAAO,GAAG;AACtB,YAAI,CAAC,MAAM,GAAG,KAAK,QAAQ,MAAM,GAAG,GAAG;AACrC,oBAAU,WAAW,QAAQ,MAAM,GAAG,GAAG,IAAI;AAC7C;AAAA,QACF;AAAA,MACF,OAAO;AACL,kBAAU,WAAW,QAAQ,OAAO,IAAI;AACxC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,QAAQ,OAAO;AAClC,YAAM,WAAW,QAAQ,SAAS,QAAQ,SAAS,CAAC;AACpD,UAAI;AACJ,iBAAW,WAAW,UAAU;AAC9B,cAAM,WAAW,WAAW,SAAS,IAAI;AACzC,gBAAQ,kBAAkB,UAAU,KAAK,IAAI;AAC7C,YAAI,MAAO;AAAA,MACb;AACA,UAAI,OAAO;AACT,kBAAU;AACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,mBAAyB;AACvC,cAAY,MAAM;AACpB;;;ACrOA,SAAS,kBACP,UACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,QAAQ,MAAM,QAAQ,UAAU,IAAI,aAAa,CAAC,UAAU;AAElE,MAAI,aAAa,YAAY,MAAM,SAAS,SAAS,EAAG,QAAO;AAC/D,SAAO,MAAM,SAAS,QAAQ;AAChC;AAEA,IAAM,kBAA0C;AAAA,EAC9C,OAAO;AAAA,EACP,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,UACE;AACJ;AAEO,SAAS,aACd,MACA,QACkB;AAClB,QAAM,SAAmB,CAAC;AAE1B,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,OAAO,MAAM,OAAO;AAAA,EAC/B;AAEA,MAAI,OAAO,QAAQ,CAAC,kBAAkB,KAAK,MAAM,OAAO,IAAI,GAAG;AAC7D,UAAM,WAAW,MAAM,QAAQ,OAAO,IAAI,IACtC,OAAO,KAAK,KAAK,KAAK,IACtB,OAAO;AACX,WAAO,KAAK,kBAAkB,QAAQ,WAAW,KAAK,IAAI,GAAG;AAAA,EAC/D;AAEA,MAAI,OAAO,QAAQ,OAAO,KAAK,SAAS,KAAK,KAAK,UAAU,QAAW;AACrE,UAAM,QAAQ,OAAO,KAAK;AAAA,MACxB,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,KAAK,KAAK;AAAA,IACxD;AACA,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,yBAAyB,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,UAAa,KAAK,UAAU,QAAW;AAC1D,QAAI,KAAK,UAAU,KAAK,KAAK,MAAM,KAAK,UAAU,OAAO,KAAK,GAAG;AAC/D,aAAO,KAAK,iBAAiB,KAAK,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,OAAO,aAAa,KAAK,SAAS,YAAY,KAAK,SAAS,UAAU;AACxE,UAAM,YAAY,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AACzD,eAAW,OAAO,OAAO,UAAU;AACjC,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,eAAO,KAAK,8BAA8B,GAAG,GAAG;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,eAAe,QAAW;AACnC,YAAM,YAAY,KAAK,IAAI,MAAM,OAAO,UAAU;AAClD,UAAI,YAAY,SAAS,KAAK,IAAI,YAAY,OAAO,UAAU,IAAI,OAAO;AACxE,eAAO,KAAK,+BAA+B,OAAO,UAAU,EAAE;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,oBAAoB,OAAO,SAAS,aAAa;AAAA,IAC/D;AACA,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,mBAAmB,OAAO,SAAS,aAAa;AAAA,IAC9D;AACA,QAAI,OAAO,SAAS;AAClB,UAAI;AACF,YAAI,CAAC,IAAI,OAAO,OAAO,OAAO,EAAE,KAAK,GAAG,GAAG;AACzC,iBAAO,KAAK,uBAAuB,OAAO,OAAO,EAAE;AAAA,QACrD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,QAAI,OAAO,UAAU,gBAAgB,OAAO,MAAM,GAAG;AACnD,UAAI,CAAC,gBAAgB,OAAO,MAAM,EAAE,KAAK,GAAG,GAAG;AAC7C,eAAO,KAAK,WAAW,OAAO,MAAM,SAAS;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,SAAS;AACzB,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,QAAQ,QAAQ;AAAA,IAC3D;AACA,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,QAAQ,QAAQ;AAAA,IAC1D;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,UAAU;AAC1B,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,aAAa,aAAa;AAAA,IACrE;AACA,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,aAAa,aAAa;AAAA,IACpE;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC9C;;;AC7JO,SAAS,YAAY,MAAiB,OAA8B;AACzE,MAAI,CAAC,MAAM,KAAK,EAAG,QAAO,CAAC;AAC3B,QAAM,UAAyB,CAAC;AAChC,QAAM,QAAQ,MAAM,YAAY;AAEhC,WAAS,KAAK,MAAgB;AAC5B,QAAI,KAAK,OAAO,KAAK,IAAI,YAAY,EAAE,SAAS,KAAK,GAAG;AACtD,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,CAAC;AAAA,IAChD;AACA,QACE,KAAK,UAAU,UACf,KAAK,UAAU,QACf,OAAO,KAAK,KAAK,EAAE,YAAY,EAAE,SAAS,KAAK,GAC/C;AACA,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAClD;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAMO,SAAS,eACd,MACA,SACa;AACb,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,UAAU,SAAS;AAC5B,QAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,WAAO,WAAW,QAAQ,UAAU;AAClC,gBAAU,IAAI,QAAQ,QAAQ;AAC9B,gBAAU,KAAK,UAAU,IAAI,QAAQ,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;;;ACxCO,SAAS,YACd,UACA,SACA,OAAO,IACM;AACb,QAAM,UAAuB,CAAC;AAE9B,MAAI,aAAa,SAAS;AACxB,WAAO;AAAA,EACT;AAEA,MACE,aAAa,QACb,YAAY,QACZ,OAAO,aAAa,OAAO,WAC3B,MAAM,QAAQ,QAAQ,MAAM,MAAM,QAAQ,OAAO,GACjD;AACA,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,UAAU,SAAS,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,aAAa,UAAU;AAChC,QAAI,aAAa,SAAS;AACxB,cAAQ,KAAK;AAAA,QACX,MAAM,QAAQ;AAAA,QACd,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,QAAQ,KAAK,MAAM,QAAQ,OAAO,GAAG;AACrD,UAAM,SAAS,KAAK,IAAI,SAAS,QAAQ,QAAQ,MAAM;AACvD,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,YAAY,OAAO,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAC/C,UAAI,KAAK,SAAS,QAAQ;AACxB,gBAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,CAAC,EAAE,CAAC;AAAA,MACvE,WAAW,KAAK,QAAQ,QAAQ;AAC9B,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,UAAU,SAAS,CAAC;AAAA,QACtB,CAAC;AAAA,MACH,OAAO;AACL,gBAAQ,KAAK,GAAG,YAAY,SAAS,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,CAAC;AAAA,MACjE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,UAAU,SAAS,MAAM,OAAO;AAC3C,SAAO;AACT;AAEA,SAAS,WACP,UACA,SACA,MACA,SACA;AACA,QAAM,UACJ,aAAa,QACb,OAAO,aAAa,YACpB,CAAC,MAAM,QAAQ,QAAQ,IAClB,WACD,CAAC;AACP,QAAM,UACJ,YAAY,QAAQ,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IACpE,UACD,CAAC;AAEP,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC;AAE1E,aAAW,OAAO,SAAS;AACzB,UAAM,YAAY,OAAO,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG;AACnD,UAAM,aAAa,OAAO;AAC1B,UAAM,YAAY,OAAO;AAEzB,QAAI,CAAC,cAAc,WAAW;AAC5B,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,GAAG,EAAE,CAAC;AAAA,IACzE,WAAW,cAAc,CAAC,WAAW;AACnC,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU,QAAQ,GAAG;AAAA,MACvB,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,QAAQ,GAAG,GAAG,SAAS,CAAC;AAAA,IACpE;AAAA,EACF;AACF;AAEO,SAAS,aAAa,SAA6C;AACxE,QAAM,MAAM,oBAAI,IAAsB;AACtC,aAAW,SAAS,SAAS;AAC3B,QAAI,IAAI,MAAM,MAAM,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/index.ts","../src/tree.ts","../src/operations.ts","../src/history.ts","../src/schema.ts","../src/validate.ts","../src/search.ts","../src/diff.ts"],"sourcesContent":["export type {\n  JsonValue,\n  JsonPrimitive,\n  JsonArray,\n  JsonObject,\n  NodeType,\n  TreeNode,\n  TreeState,\n  JsonSchema,\n  JsonSchemaProperty,\n} from \"./types\";\n\nexport {\n  fromJson,\n  toJson,\n  findNode,\n  findNodeByPath,\n  isDescendant,\n  resetIdCounter,\n  getNodeType,\n  generateId,\n  buildSubtree,\n  reparentSubtree,\n} from \"./tree\";\n\nexport {\n  setValue,\n  setKey,\n  addProperty,\n  insertProperty,\n  insertNode,\n  removeNode,\n  moveNode,\n  reorderChildren,\n  reorderChildrenMulti,\n  changeType,\n  duplicateNode,\n} from \"./operations\";\n\nexport { History } from \"./history\";\n\nexport {\n  resolveSchema,\n  resolveRef,\n  getPropertySchema,\n  clearSchemaCache,\n} from \"./schema\";\n\nexport { validateNode, type ValidationResult } from \"./validate\";\n\nexport { searchNodes, getAncestorIds, type SearchMatch } from \"./search\";\n\nexport {\n  computeDiff,\n  getDiffPaths,\n  type DiffEntry,\n  type DiffType,\n} from \"./diff\";\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  JsonObject,\n  JsonArray,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\n\nlet nextId = 0;\n\nexport function generateId(): string {\n  return `node_${++nextId}`;\n}\n\nexport function resetIdCounter(): void {\n  nextId = 0;\n}\n\nexport function getNodeType(value: JsonValue): NodeType {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  return typeof value as NodeType;\n}\n\nexport function buildSubtree(\n  key: string,\n  value: JsonValue,\n  parentPath: string,\n  parentId: string | null,\n  nodesById: Map<string, TreeNode>,\n): TreeNode {\n  const id = generateId();\n  const path = parentPath ? `${parentPath}/${key}` : `/${key}`;\n  const type = getNodeType(value);\n\n  const node: TreeNode = {\n    id,\n    key,\n    path,\n    type,\n    value:\n      type === \"object\" || type === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId,\n  };\n\n  nodesById.set(id, node);\n\n  if (type === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    node.children = Object.keys(obj).map((childKey) =>\n      buildSubtree(childKey, obj[childKey], path, id, nodesById),\n    );\n  } else if (type === \"array\") {\n    const arr = value as JsonArray;\n    node.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, path, id, nodesById),\n    );\n  }\n\n  return node;\n}\n\nexport function fromJson(value: JsonValue): TreeState {\n  const nodesById = new Map<string, TreeNode>();\n\n  const rootType = getNodeType(value);\n  const root: TreeNode = {\n    id: generateId(),\n    key: \"\",\n    path: \"/\",\n    type: rootType,\n    value:\n      rootType === \"object\" || rootType === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId: null,\n  };\n\n  nodesById.set(root.id, root);\n\n  if (rootType === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    root.children = Object.keys(obj).map((key) =>\n      buildSubtree(key, obj[key], \"\", root.id, nodesById),\n    );\n  } else if (rootType === \"array\") {\n    const arr = value as JsonArray;\n    root.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, \"\", root.id, nodesById),\n    );\n  }\n\n  return { root, nodesById };\n}\n\nexport function toJson(node: TreeNode): JsonValue {\n  switch (node.type) {\n    case \"object\": {\n      const obj: JsonObject = {};\n      for (const child of node.children) {\n        obj[child.key] = toJson(child);\n      }\n      return obj;\n    }\n    case \"array\":\n      return node.children.map((child) => toJson(child));\n    default:\n      return node.value as JsonValue;\n  }\n}\n\n/**\n * Clone a subtree with updated key, path, and parentId while preserving\n * all original node IDs. Used for cross-parent moves where identity must\n * be retained so that UI state (expanded, selected, etc.) stays valid.\n */\nexport function reparentSubtree(\n  node: TreeNode,\n  newKey: string,\n  parentPath: string,\n  newParentId: string,\n): TreeNode {\n  const newPath = parentPath ? `${parentPath}/${newKey}` : `/${newKey}`;\n  return {\n    ...node,\n    key: newKey,\n    path: newPath,\n    parentId: newParentId,\n    children: node.children.map((child, i) =>\n      reparentSubtree(\n        child,\n        node.type === \"array\" ? String(i) : child.key,\n        newPath,\n        node.id,\n      ),\n    ),\n  };\n}\n\nexport function findNode(\n  state: TreeState,\n  nodeId: string,\n): TreeNode | undefined {\n  return state.nodesById.get(nodeId);\n}\n\nexport function findNodeByPath(\n  state: TreeState,\n  path: string,\n): TreeNode | undefined {\n  if (path === \"/\") return state.root;\n\n  const segments = path.split(\"/\").filter(Boolean);\n  let current = state.root;\n\n  for (const segment of segments) {\n    const child = current.children.find((c) => c.key === segment);\n    if (!child) return undefined;\n    current = child;\n  }\n\n  return current;\n}\n\n/**\n * Check whether `nodeId` is a descendant of `potentialAncestorId` by walking\n * up `parentId` links. Returns `true` when the two IDs are equal (a node is\n * considered a descendant of itself).\n */\nexport function isDescendant(\n  tree: TreeState,\n  nodeId: string,\n  potentialAncestorId: string,\n): boolean {\n  let current = tree.nodesById.get(nodeId);\n  while (current) {\n    if (current.id === potentialAncestorId) return true;\n    current = current.parentId\n      ? tree.nodesById.get(current.parentId)\n      : undefined;\n  }\n  return false;\n}\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\nimport { toJson, getNodeType, buildSubtree, reparentSubtree } from \"./tree\";\n\nfunction rebuildMap(root: TreeNode): Map<string, TreeNode> {\n  const map = new Map<string, TreeNode>();\n  function walk(node: TreeNode) {\n    map.set(node.id, node);\n    for (const child of node.children) walk(child);\n  }\n  walk(root);\n  return map;\n}\n\nfunction recomputePaths(node: TreeNode, newParentPath: string): TreeNode {\n  const newPath = newParentPath\n    ? `${newParentPath}/${node.key}`\n    : `/${node.key}`;\n  if (node.path === newPath && node.children.length === 0) return node;\n  return {\n    ...node,\n    path: newPath,\n    children: node.children.map((child) => recomputePaths(child, newPath)),\n  };\n}\n\n/**\n * Clone only the ancestor chain from root to `targetId` (structural sharing),\n * apply `updater` to the target, and rebuild the `nodesById` map.\n */\nfunction clonePathToNode(\n  state: TreeState,\n  targetId: string,\n  updater: (node: TreeNode) => TreeNode,\n): TreeState {\n  const chain: string[] = [];\n  let cur: TreeNode | undefined = state.nodesById.get(targetId);\n  while (cur) {\n    chain.unshift(cur.id);\n    cur = cur.parentId ? state.nodesById.get(cur.parentId) : undefined;\n  }\n  if (chain.length === 0) return state;\n\n  function cloneAlongPath(node: TreeNode, depth: number): TreeNode {\n    if (depth === chain.length - 1) {\n      return updater(node);\n    }\n    const nextInChain = chain[depth + 1];\n    return {\n      ...node,\n      children: node.children.map((child) =>\n        child.id === nextInChain ? cloneAlongPath(child, depth + 1) : child,\n      ),\n    };\n  }\n\n  const newRoot = cloneAlongPath(state.root, 0);\n  return { root: newRoot, nodesById: rebuildMap(newRoot) };\n}\n\nfunction reindexArrayChildren(parent: TreeNode): TreeNode {\n  if (parent.type !== \"array\") return parent;\n  const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n  return {\n    ...parent,\n    children: parent.children.map((child, i) => {\n      const newKey = String(i);\n      if (child.key === newKey) return child;\n      return recomputePaths({ ...child, key: newKey }, parentPath);\n    }),\n  };\n}\n\nexport function setValue(\n  state: TreeState,\n  nodeId: string,\n  value: JsonValue,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const newType = getNodeType(value);\n\n  if (newType !== \"object\" && newType !== \"array\") {\n    return clonePathToNode(state, nodeId, (n) => ({\n      ...n,\n      type: newType,\n      value: value as JsonPrimitive,\n      children: [],\n    }));\n  }\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = n.path.split(\"/\").slice(0, -1).join(\"/\") || \"\";\n    const nodesById = new Map<string, TreeNode>();\n    const subtree = buildSubtree(\n      n.key,\n      value,\n      parentPath,\n      n.parentId,\n      nodesById,\n    );\n    return { ...subtree, id: n.id };\n  });\n}\n\nexport function setKey(\n  state: TreeState,\n  nodeId: string,\n  newKey: string,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent || parent.type !== \"object\") return state;\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n    const newPath = `${parentPath}/${newKey}`;\n    const updated: TreeNode = { ...n, key: newKey, path: newPath };\n    if (updated.children.length > 0) {\n      updated.children = updated.children.map((child) =>\n        recomputePaths(child, newPath),\n      );\n    }\n    return updated;\n  });\n}\n\nexport function addProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(key, value, parentPath, p.id, new Map());\n    return { ...p, children: [...p.children, newChild] };\n  });\n}\n\nexport function insertProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n  index: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(key, value, parentPath, p.id, new Map());\n    const newChildren = [...p.children];\n    newChildren.splice(index, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function insertNode(\n  state: TreeState,\n  parentId: string,\n  node: TreeNode,\n  index: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const key = p.type === \"array\" ? String(index) : node.key;\n    const reparented = reparentSubtree(node, key, parentPath, p.id);\n    const newChildren = [...p.children];\n    newChildren.splice(index, 0, reparented);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function removeNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function moveNode(\n  state: TreeState,\n  nodeId: string,\n  newParentId: string,\n  index?: number,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const srcParent = state.nodesById.get(node.parentId);\n  const dstParent = state.nodesById.get(newParentId);\n  if (!srcParent || !dstParent) return state;\n\n  const nodeValue = toJson(node);\n\n  const removed = clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n\n  return clonePathToNode(removed, newParentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(\n      p.type === \"array\" ? String(index ?? p.children.length) : node.key,\n      nodeValue,\n      parentPath,\n      p.id,\n      new Map(),\n    );\n    const newChildren = [...p.children];\n    const insertAt = index ?? newChildren.length;\n    newChildren.splice(insertAt, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildren(\n  state: TreeState,\n  parentId: string,\n  fromIndex: number,\n  toIndex: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const newChildren = [...p.children];\n    const [item] = newChildren.splice(fromIndex, 1);\n    newChildren.splice(toIndex, 0, item);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildrenMulti(\n  state: TreeState,\n  parentId: string,\n  movedIds: string[],\n  targetSiblingId: string,\n  position: \"before\" | \"after\",\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  const movedSet = new Set(movedIds);\n\n  return clonePathToNode(state, parentId, (p) => {\n    const remaining = p.children.filter((c) => !movedSet.has(c.id));\n    let insertIdx = remaining.findIndex((c) => c.id === targetSiblingId);\n    if (insertIdx === -1) {\n      if (movedSet.has(targetSiblingId)) {\n        const origIdx = p.children.findIndex((c) => c.id === targetSiblingId);\n        const origMap = new Map(p.children.map((c, i) => [c.id, i]));\n        if (position === \"after\") {\n          insertIdx = remaining.findIndex(\n            (c) => (origMap.get(c.id) ?? -1) > origIdx,\n          );\n          if (insertIdx === -1) insertIdx = remaining.length;\n        } else {\n          insertIdx = remaining.findIndex(\n            (c) => (origMap.get(c.id) ?? -1) >= origIdx,\n          );\n          if (insertIdx === -1) insertIdx = remaining.length;\n        }\n      } else {\n        insertIdx = position === \"after\" ? remaining.length : 0;\n      }\n    } else if (position === \"after\") {\n      insertIdx++;\n    }\n    const moved = movedIds\n      .map((id) => p.children.find((c) => c.id === id))\n      .filter((c): c is TreeNode => c !== undefined);\n    const newChildren = [...remaining];\n    newChildren.splice(insertIdx, 0, ...moved);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nfunction convertValue(current: JsonValue, newType: NodeType): JsonValue {\n  switch (newType) {\n    case \"string\":\n      if (current === null || current === undefined) return \"\";\n      if (typeof current === \"object\") return JSON.stringify(current);\n      return String(current);\n    case \"number\": {\n      const n = Number(current);\n      return isNaN(n) ? 0 : n;\n    }\n    case \"boolean\":\n      return Boolean(current);\n    case \"null\":\n      return null;\n    case \"object\":\n      if (\n        current !== null &&\n        typeof current === \"object\" &&\n        !Array.isArray(current)\n      )\n        return current;\n      if (Array.isArray(current)) {\n        const obj: Record<string, JsonValue> = {};\n        current.forEach((item, i) => {\n          obj[String(i)] = item;\n        });\n        return obj;\n      }\n      return {};\n    case \"array\":\n      if (Array.isArray(current)) return current;\n      if (current !== null && typeof current === \"object\")\n        return Object.values(current);\n      return current === null || current === undefined ? [] : [current];\n    default:\n      return current;\n  }\n}\n\nexport function changeType(\n  state: TreeState,\n  nodeId: string,\n  newType: NodeType,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const currentValue = toJson(node);\n  const newValue = convertValue(currentValue, newType);\n  return setValue(state, nodeId, newValue);\n}\n\nexport function duplicateNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent) return state;\n\n  const nodeValue = toJson(node);\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const idx = p.children.findIndex((c) => c.id === nodeId);\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newKey = p.type === \"array\" ? String(idx + 1) : `${node.key}_copy`;\n    const newChild = buildSubtree(\n      newKey,\n      structuredClone(nodeValue),\n      parentPath,\n      p.id,\n      new Map(),\n    );\n    const newChildren = [...p.children];\n    newChildren.splice(idx + 1, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n","import type { TreeState } from \"./types\";\n\nconst MAX_HISTORY = 100;\n\nexport class History {\n  private stack: TreeState[] = [];\n  private cursor = -1;\n\n  push(state: TreeState): void {\n    this.stack = this.stack.slice(0, this.cursor + 1);\n    this.stack.push(state);\n    if (this.stack.length > MAX_HISTORY) {\n      this.stack.shift();\n    } else {\n      this.cursor++;\n    }\n  }\n\n  undo(): TreeState | null {\n    if (!this.canUndo) return null;\n    this.cursor--;\n    return this.stack[this.cursor];\n  }\n\n  redo(): TreeState | null {\n    if (!this.canRedo) return null;\n    this.cursor++;\n    return this.stack[this.cursor];\n  }\n\n  get canUndo(): boolean {\n    return this.cursor > 0;\n  }\n\n  get canRedo(): boolean {\n    return this.cursor < this.stack.length - 1;\n  }\n\n  get current(): TreeState | null {\n    return this.stack[this.cursor] ?? null;\n  }\n}\n","import type {\n  JsonSchema,\n  JsonSchemaProperty,\n  JsonValue,\n  JsonObject,\n} from \"./types\";\n\nconst KNOWN_SCHEMAS: Record<string, string> = {\n  \"package.json\": \"https://json.schemastore.org/package.json\",\n  \"tsconfig.json\": \"https://json.schemastore.org/tsconfig\",\n  \"tsconfig.base.json\": \"https://json.schemastore.org/tsconfig\",\n  \".eslintrc.json\": \"https://json.schemastore.org/eslintrc\",\n  \".prettierrc\": \"https://json.schemastore.org/prettierrc\",\n  \".prettierrc.json\": \"https://json.schemastore.org/prettierrc\",\n  \"turbo.json\": \"https://turborepo.dev/schema.json\",\n  \".babelrc\": \"https://json.schemastore.org/babelrc\",\n  \"nest-cli.json\": \"https://json.schemastore.org/nest-cli\",\n  \"vercel.json\": \"https://openapi.vercel.sh/vercel.json\",\n  \".swcrc\": \"https://json.schemastore.org/swcrc\",\n};\n\nconst MAX_SCHEMA_CACHE = 50;\nconst schemaCache = new Map<string, JsonSchema>();\n\nasync function fetchSchema(url: string): Promise<JsonSchema | null> {\n  if (schemaCache.has(url)) {\n    return schemaCache.get(url)!;\n  }\n  try {\n    const res = await fetch(url);\n    if (!res.ok) return null;\n    const schema = (await res.json()) as JsonSchema;\n    if (schemaCache.size >= MAX_SCHEMA_CACHE) {\n      const oldest = schemaCache.keys().next().value;\n      if (oldest !== undefined) schemaCache.delete(oldest);\n    }\n    schemaCache.set(url, schema);\n    return schema;\n  } catch {\n    return null;\n  }\n}\n\nexport async function resolveSchema(\n  json: JsonValue,\n  filename?: string,\n): Promise<JsonSchema | null> {\n  if (\n    json !== null &&\n    typeof json === \"object\" &&\n    !Array.isArray(json) &&\n    typeof (json as JsonObject)[\"$schema\"] === \"string\"\n  ) {\n    const url = (json as JsonObject)[\"$schema\"] as string;\n    const schema = await fetchSchema(url);\n    if (schema) return schema;\n  }\n\n  if (filename) {\n    const base = filename.split(\"/\").pop() ?? filename;\n    const knownUrl = KNOWN_SCHEMAS[base];\n    if (knownUrl) {\n      return fetchSchema(knownUrl);\n    }\n  }\n\n  return null;\n}\n\nfunction findDefinition(\n  root: JsonSchemaProperty,\n  refPath: string,\n): JsonSchemaProperty | undefined {\n  if (!refPath.startsWith(\"#/\")) return undefined;\n  const segments = refPath.slice(2).split(\"/\");\n  let current: unknown = root;\n\n  for (const seg of segments) {\n    if (current === null || typeof current !== \"object\") return undefined;\n    current = (current as Record<string, unknown>)[seg];\n  }\n\n  return current as JsonSchemaProperty | undefined;\n}\n\n/**\n * Resolve `$ref` pointers and merge `allOf` within a schema.\n * `visited` tracks refs to prevent infinite cycles.\n */\nexport function resolveRef(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited?: Set<string>,\n): JsonSchemaProperty {\n  const seen = visited ?? new Set<string>();\n\n  if (prop.$ref) {\n    if (seen.has(prop.$ref)) return prop;\n    seen.add(prop.$ref);\n    const resolved = findDefinition(root, prop.$ref);\n    if (resolved) {\n      return resolveRef(resolved, root, seen);\n    }\n    return prop;\n  }\n\n  if (prop.allOf && prop.allOf.length > 0) {\n    return mergeAllOf(prop, root, seen);\n  }\n\n  return prop;\n}\n\nfunction mergeAllOf(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited: Set<string>,\n): JsonSchemaProperty {\n  const merged: JsonSchemaProperty = { ...prop };\n  delete merged.allOf;\n\n  for (const sub of prop.allOf!) {\n    const resolved = resolveRef(sub, root, new Set(visited));\n    if (resolved.type && !merged.type) merged.type = resolved.type;\n    if (resolved.properties) {\n      merged.properties = { ...merged.properties, ...resolved.properties };\n    }\n    if (resolved.required) {\n      merged.required = [\n        ...new Set([...(merged.required ?? []), ...resolved.required]),\n      ];\n    }\n    if (\n      resolved.additionalProperties !== undefined &&\n      merged.additionalProperties === undefined\n    ) {\n      merged.additionalProperties = resolved.additionalProperties;\n    }\n    if (resolved.items && !merged.items) merged.items = resolved.items;\n    if (resolved.description && !merged.description)\n      merged.description = resolved.description;\n    if (resolved.title && !merged.title) merged.title = resolved.title;\n    if (resolved.enum && !merged.enum) merged.enum = resolved.enum;\n    if (resolved.minimum !== undefined && merged.minimum === undefined)\n      merged.minimum = resolved.minimum;\n    if (resolved.maximum !== undefined && merged.maximum === undefined)\n      merged.maximum = resolved.maximum;\n    if (resolved.minLength !== undefined && merged.minLength === undefined)\n      merged.minLength = resolved.minLength;\n    if (resolved.maxLength !== undefined && merged.maxLength === undefined)\n      merged.maxLength = resolved.maxLength;\n    if (resolved.pattern && !merged.pattern) merged.pattern = resolved.pattern;\n    if (resolved.format && !merged.format) merged.format = resolved.format;\n  }\n\n  return merged;\n}\n\nexport function getPropertySchema(\n  schema: JsonSchema | JsonSchemaProperty,\n  path: string,\n  rootSchema?: JsonSchemaProperty,\n): JsonSchemaProperty | undefined {\n  const root = rootSchema ?? schema;\n  const segments = path.split(\"/\").filter(Boolean);\n  let current: JsonSchemaProperty | undefined = resolveRef(schema, root);\n\n  for (const seg of segments) {\n    if (!current) return undefined;\n    current = resolveRef(current, root);\n\n    if (current.properties?.[seg]) {\n      current = resolveRef(current.properties[seg], root);\n      continue;\n    }\n\n    if (current.patternProperties) {\n      const match = Object.entries(current.patternProperties).find(\n        ([pattern]) => {\n          try {\n            return new RegExp(pattern).test(seg);\n          } catch {\n            return false;\n          }\n        },\n      );\n      if (match) {\n        current = resolveRef(match[1], root);\n        continue;\n      }\n    }\n\n    if (\n      current.additionalProperties &&\n      typeof current.additionalProperties === \"object\"\n    ) {\n      current = resolveRef(current.additionalProperties, root);\n      continue;\n    }\n\n    if (current.items) {\n      if (Array.isArray(current.items)) {\n        const idx = Number(seg);\n        if (!isNaN(idx) && current.items[idx]) {\n          current = resolveRef(current.items[idx], root);\n          continue;\n        }\n      } else {\n        current = resolveRef(current.items, root);\n        continue;\n      }\n    }\n\n    if (current.anyOf || current.oneOf) {\n      const variants = current.anyOf ?? current.oneOf ?? [];\n      let found: JsonSchemaProperty | undefined;\n      for (const variant of variants) {\n        const resolved = resolveRef(variant, root);\n        found = getPropertySchema(resolved, seg, root);\n        if (found) break;\n      }\n      if (found) {\n        current = found;\n        continue;\n      }\n      return undefined;\n    }\n\n    return undefined;\n  }\n\n  return current;\n}\n\nexport function clearSchemaCache(): void {\n  schemaCache.clear();\n}\n","import type { TreeNode, JsonSchemaProperty } from \"./types\";\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nfunction schemaTypeMatches(\n  nodeType: string,\n  schemaType: string | string[] | undefined,\n): boolean {\n  if (!schemaType) return true;\n  const types = Array.isArray(schemaType) ? schemaType : [schemaType];\n\n  if (nodeType === \"number\" && types.includes(\"integer\")) return true;\n  return types.includes(nodeType);\n}\n\nconst FORMAT_PATTERNS: Record<string, RegExp> = {\n  email: /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/,\n  uri: /^https?:\\/\\/.+/,\n  \"uri-reference\": /^(https?:\\/\\/|\\/|\\.\\.?\\/|#).*/,\n  \"date-time\": /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}/,\n  date: /^\\d{4}-\\d{2}-\\d{2}$/,\n  time: /^\\d{2}:\\d{2}:\\d{2}/,\n  ipv4: /^(\\d{1,3}\\.){3}\\d{1,3}$/,\n  ipv6: /^([0-9a-fA-F]{0,4}:){2,7}[0-9a-fA-F]{0,4}$/,\n  uuid: /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$/,\n  hostname:\n    /^[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?(\\.[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?)*$/,\n};\n\nexport function validateNode(\n  node: TreeNode,\n  schema: JsonSchemaProperty | undefined,\n): ValidationResult {\n  const errors: string[] = [];\n\n  if (!schema) {\n    return { valid: true, errors };\n  }\n\n  if (schema.type && !schemaTypeMatches(node.type, schema.type)) {\n    const expected = Array.isArray(schema.type)\n      ? schema.type.join(\" | \")\n      : schema.type;\n    errors.push(`Expected type \"${expected}\", got \"${node.type}\"`);\n  }\n\n  if (schema.enum && schema.enum.length > 0 && node.value !== undefined) {\n    const match = schema.enum.some(\n      (v) => JSON.stringify(v) === JSON.stringify(node.value),\n    );\n    if (!match) {\n      errors.push(\n        `Value must be one of: ${schema.enum.map((v) => JSON.stringify(v)).join(\", \")}`,\n      );\n    }\n  }\n\n  if (schema.const !== undefined && node.value !== undefined) {\n    if (JSON.stringify(node.value) !== JSON.stringify(schema.const)) {\n      errors.push(`Value must be ${JSON.stringify(schema.const)}`);\n    }\n  }\n\n  if (schema.required && (node.type === \"object\" || node.type === \"array\")) {\n    const childKeys = new Set(node.children.map((c) => c.key));\n    for (const req of schema.required) {\n      if (!childKeys.has(req)) {\n        errors.push(`Missing required property \"${req}\"`);\n      }\n    }\n  }\n\n  if (node.type === \"number\" && typeof node.value === \"number\") {\n    const val = node.value;\n    if (schema.minimum !== undefined && val < schema.minimum) {\n      errors.push(`Value must be >= ${schema.minimum}`);\n    }\n    if (schema.maximum !== undefined && val > schema.maximum) {\n      errors.push(`Value must be <= ${schema.maximum}`);\n    }\n    if (schema.exclusiveMinimum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMinimum === \"number\"\n          ? schema.exclusiveMinimum\n          : schema.minimum;\n      if (bound !== undefined && val <= bound) {\n        errors.push(`Value must be > ${bound}`);\n      }\n    }\n    if (schema.exclusiveMaximum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMaximum === \"number\"\n          ? schema.exclusiveMaximum\n          : schema.maximum;\n      if (bound !== undefined && val >= bound) {\n        errors.push(`Value must be < ${bound}`);\n      }\n    }\n    if (schema.multipleOf !== undefined) {\n      const remainder = Math.abs(val % schema.multipleOf);\n      if (\n        remainder > 1e-10 &&\n        Math.abs(remainder - schema.multipleOf) > 1e-10\n      ) {\n        errors.push(`Value must be a multiple of ${schema.multipleOf}`);\n      }\n    }\n  }\n\n  if (node.type === \"string\" && typeof node.value === \"string\") {\n    const val = node.value;\n    if (schema.minLength !== undefined && val.length < schema.minLength) {\n      errors.push(`Must be at least ${schema.minLength} characters`);\n    }\n    if (schema.maxLength !== undefined && val.length > schema.maxLength) {\n      errors.push(`Must be at most ${schema.maxLength} characters`);\n    }\n    if (schema.pattern) {\n      try {\n        if (!new RegExp(schema.pattern).test(val)) {\n          errors.push(`Must match pattern: ${schema.pattern}`);\n        }\n      } catch {\n        // invalid regex in schema, skip\n      }\n    }\n    if (schema.format && FORMAT_PATTERNS[schema.format]) {\n      if (!FORMAT_PATTERNS[schema.format].test(val)) {\n        errors.push(`Invalid ${schema.format} format`);\n      }\n    }\n  }\n\n  if (node.type === \"array\") {\n    if (\n      schema.minItems !== undefined &&\n      node.children.length < schema.minItems\n    ) {\n      errors.push(`Must have at least ${schema.minItems} items`);\n    }\n    if (\n      schema.maxItems !== undefined &&\n      node.children.length > schema.maxItems\n    ) {\n      errors.push(`Must have at most ${schema.maxItems} items`);\n    }\n  }\n\n  if (node.type === \"object\") {\n    if (\n      schema.minProperties !== undefined &&\n      node.children.length < schema.minProperties\n    ) {\n      errors.push(`Must have at least ${schema.minProperties} properties`);\n    }\n    if (\n      schema.maxProperties !== undefined &&\n      node.children.length > schema.maxProperties\n    ) {\n      errors.push(`Must have at most ${schema.maxProperties} properties`);\n    }\n  }\n\n  return { valid: errors.length === 0, errors };\n}\n","import type { TreeNode, TreeState } from \"./types\";\n\nexport interface SearchMatch {\n  nodeId: string;\n  field: \"key\" | \"value\";\n}\n\nexport function searchNodes(tree: TreeState, query: string): SearchMatch[] {\n  if (!query.trim()) return [];\n  const matches: SearchMatch[] = [];\n  const lower = query.toLowerCase();\n\n  function walk(node: TreeNode) {\n    if (node.key && node.key.toLowerCase().includes(lower)) {\n      matches.push({ nodeId: node.id, field: \"key\" });\n    }\n    if (\n      node.value !== undefined &&\n      node.value !== null &&\n      String(node.value).toLowerCase().includes(lower)\n    ) {\n      matches.push({ nodeId: node.id, field: \"value\" });\n    }\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(tree.root);\n  return matches;\n}\n\n/**\n * Collect all ancestor node IDs for each matched node so the tree\n * can auto-expand paths to search results.\n */\nexport function getAncestorIds(\n  tree: TreeState,\n  nodeIds: string[],\n): Set<string> {\n  const ancestors = new Set<string>();\n\n  for (const nodeId of nodeIds) {\n    let current = tree.nodesById.get(nodeId);\n    while (current && current.parentId) {\n      ancestors.add(current.parentId);\n      current = tree.nodesById.get(current.parentId);\n    }\n  }\n\n  return ancestors;\n}\n","import type { JsonValue } from \"./types\";\n\nexport type DiffType = \"added\" | \"removed\" | \"changed\";\n\nexport interface DiffEntry {\n  path: string;\n  type: DiffType;\n  oldValue?: JsonValue;\n  newValue?: JsonValue;\n}\n\nexport function computeDiff(\n  original: JsonValue,\n  current: JsonValue,\n  path = \"\",\n): DiffEntry[] {\n  const entries: DiffEntry[] = [];\n\n  if (original === current) {\n    return entries;\n  }\n\n  if (\n    original === null ||\n    current === null ||\n    typeof original !== typeof current ||\n    Array.isArray(original) !== Array.isArray(current)\n  ) {\n    if (path) {\n      entries.push({\n        path,\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    } else {\n      diffObject(original, current, path, entries);\n    }\n    return entries;\n  }\n\n  if (typeof original !== \"object\") {\n    if (original !== current) {\n      entries.push({\n        path: path || \"/\",\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    }\n    return entries;\n  }\n\n  if (Array.isArray(original) && Array.isArray(current)) {\n    const maxLen = Math.max(original.length, current.length);\n    for (let i = 0; i < maxLen; i++) {\n      const childPath = path ? `${path}/${i}` : `/${i}`;\n      if (i >= original.length) {\n        entries.push({ path: childPath, type: \"added\", newValue: current[i] });\n      } else if (i >= current.length) {\n        entries.push({\n          path: childPath,\n          type: \"removed\",\n          oldValue: original[i],\n        });\n      } else {\n        entries.push(...computeDiff(original[i], current[i], childPath));\n      }\n    }\n    return entries;\n  }\n\n  diffObject(original, current, path, entries);\n  return entries;\n}\n\nfunction diffObject(\n  original: JsonValue,\n  current: JsonValue,\n  path: string,\n  entries: DiffEntry[],\n) {\n  const origObj =\n    original !== null &&\n    typeof original === \"object\" &&\n    !Array.isArray(original)\n      ? (original as Record<string, JsonValue>)\n      : {};\n  const currObj =\n    current !== null && typeof current === \"object\" && !Array.isArray(current)\n      ? (current as Record<string, JsonValue>)\n      : {};\n\n  const allKeys = new Set([...Object.keys(origObj), ...Object.keys(currObj)]);\n\n  for (const key of allKeys) {\n    const childPath = path ? `${path}/${key}` : `/${key}`;\n    const inOriginal = key in origObj;\n    const inCurrent = key in currObj;\n\n    if (!inOriginal && inCurrent) {\n      entries.push({ path: childPath, type: \"added\", newValue: currObj[key] });\n    } else if (inOriginal && !inCurrent) {\n      entries.push({\n        path: childPath,\n        type: \"removed\",\n        oldValue: origObj[key],\n      });\n    } else {\n      entries.push(...computeDiff(origObj[key], currObj[key], childPath));\n    }\n  }\n}\n\nexport function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType> {\n  const map = new Map<string, DiffType>();\n  for (const entry of entries) {\n    map.set(entry.path, entry.type);\n  }\n  return map;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACUA,IAAI,SAAS;AAEN,SAAS,aAAqB;AACnC,SAAO,QAAQ,EAAE,MAAM;AACzB;AAEO,SAAS,iBAAuB;AACrC,WAAS;AACX;AAEO,SAAS,YAAY,OAA4B;AACtD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,OAAO;AAChB;AAEO,SAAS,aACd,KACA,OACA,YACA,UACA,WACU;AACV,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,aAAa,GAAG,UAAU,IAAI,GAAG,KAAK,IAAI,GAAG;AAC1D,QAAM,OAAO,YAAY,KAAK;AAE9B,QAAM,OAAiB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OACE,SAAS,YAAY,SAAS,UAC1B,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX;AAAA,EACF;AAEA,YAAU,IAAI,IAAI,IAAI;AAEtB,MAAI,SAAS,YAAY,UAAU,MAAM;AACvC,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,aACpC,aAAa,UAAU,IAAI,QAAQ,GAAG,MAAM,IAAI,SAAS;AAAA,IAC3D;AAAA,EACF,WAAW,SAAS,SAAS;AAC3B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,MAAM,IAAI,SAAS;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,SAAS,OAA6B;AACpD,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,WAAW,YAAY,KAAK;AAClC,QAAM,OAAiB;AAAA,IACrB,IAAI,WAAW;AAAA,IACf,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OACE,aAAa,YAAY,aAAa,UAClC,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX,UAAU;AAAA,EACZ;AAEA,YAAU,IAAI,KAAK,IAAI,IAAI;AAE3B,MAAI,aAAa,YAAY,UAAU,MAAM;AAC3C,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,QACpC,aAAa,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,SAAS;AAAA,IACpD;AAAA,EACF,WAAW,aAAa,SAAS;AAC/B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,SAAS;AAAA,IAC1D;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,UAAU;AAC3B;AAEO,SAAS,OAAO,MAA2B;AAChD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,UAAU;AACb,YAAM,MAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,GAAG,IAAI,OAAO,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AACH,aAAO,KAAK,SAAS,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AAAA,IACnD;AACE,aAAO,KAAK;AAAA,EAChB;AACF;AAOO,SAAS,gBACd,MACA,QACA,YACA,aACU;AACV,QAAM,UAAU,aAAa,GAAG,UAAU,IAAI,MAAM,KAAK,IAAI,MAAM;AACnE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,KAAK;AAAA,IACL,MAAM;AAAA,IACN,UAAU;AAAA,IACV,UAAU,KAAK,SAAS;AAAA,MAAI,CAAC,OAAO,MAClC;AAAA,QACE;AAAA,QACA,KAAK,SAAS,UAAU,OAAO,CAAC,IAAI,MAAM;AAAA,QAC1C;AAAA,QACA,KAAK;AAAA,MACP;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,SACd,OACA,QACsB;AACtB,SAAO,MAAM,UAAU,IAAI,MAAM;AACnC;AAEO,SAAS,eACd,OACA,MACsB;AACtB,MAAI,SAAS,IAAK,QAAO,MAAM;AAE/B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAAU,MAAM;AAEpB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO;AAC5D,QAAI,CAAC,MAAO,QAAO;AACnB,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAOO,SAAS,aACd,MACA,QACA,qBACS;AACT,MAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,SAAO,SAAS;AACd,QAAI,QAAQ,OAAO,oBAAqB,QAAO;AAC/C,cAAU,QAAQ,WACd,KAAK,UAAU,IAAI,QAAQ,QAAQ,IACnC;AAAA,EACN;AACA,SAAO;AACT;;;ACnLA,SAAS,WAAW,MAAuC;AACzD,QAAM,MAAM,oBAAI,IAAsB;AACtC,WAAS,KAAK,MAAgB;AAC5B,QAAI,IAAI,KAAK,IAAI,IAAI;AACrB,eAAW,SAAS,KAAK,SAAU,MAAK,KAAK;AAAA,EAC/C;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAEA,SAAS,eAAe,MAAgB,eAAiC;AACvE,QAAM,UAAU,gBACZ,GAAG,aAAa,IAAI,KAAK,GAAG,KAC5B,IAAI,KAAK,GAAG;AAChB,MAAI,KAAK,SAAS,WAAW,KAAK,SAAS,WAAW,EAAG,QAAO;AAChE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,eAAe,OAAO,OAAO,CAAC;AAAA,EACvE;AACF;AAMA,SAAS,gBACP,OACA,UACA,SACW;AACX,QAAM,QAAkB,CAAC;AACzB,MAAI,MAA4B,MAAM,UAAU,IAAI,QAAQ;AAC5D,SAAO,KAAK;AACV,UAAM,QAAQ,IAAI,EAAE;AACpB,UAAM,IAAI,WAAW,MAAM,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC3D;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,WAAS,eAAe,MAAgB,OAAyB;AAC/D,QAAI,UAAU,MAAM,SAAS,GAAG;AAC9B,aAAO,QAAQ,IAAI;AAAA,IACrB;AACA,UAAM,cAAc,MAAM,QAAQ,CAAC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,KAAK,SAAS;AAAA,QAAI,CAAC,UAC3B,MAAM,OAAO,cAAc,eAAe,OAAO,QAAQ,CAAC,IAAI;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,eAAe,MAAM,MAAM,CAAC;AAC5C,SAAO,EAAE,MAAM,SAAS,WAAW,WAAW,OAAO,EAAE;AACzD;AAEA,SAAS,qBAAqB,QAA4B;AACxD,MAAI,OAAO,SAAS,QAAS,QAAO;AACpC,QAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,OAAO,SAAS,IAAI,CAAC,OAAO,MAAM;AAC1C,YAAM,SAAS,OAAO,CAAC;AACvB,UAAI,MAAM,QAAQ,OAAQ,QAAO;AACjC,aAAO,eAAe,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG,UAAU;AAAA,IAC7D,CAAC;AAAA,EACH;AACF;AAEO,SAAS,SACd,OACA,QACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,UAAU,YAAY,KAAK;AAEjC,MAAI,YAAY,YAAY,YAAY,SAAS;AAC/C,WAAO,gBAAgB,OAAO,QAAQ,CAAC,OAAO;AAAA,MAC5C,GAAG;AAAA,MACH,MAAM;AAAA,MACN;AAAA,MACA,UAAU,CAAC;AAAA,IACb,EAAE;AAAA,EACJ;AAEA,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,EAAE,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,KAAK;AAC/D,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,UAAU;AAAA,MACd,EAAE;AAAA,MACF;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,GAAG,SAAS,IAAI,EAAE,GAAG;AAAA,EAChC,CAAC;AACH;AAEO,SAAS,OACd,OACA,QACA,QACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,UAAU,OAAO,SAAS,SAAU,QAAO;AAEhD,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,UAAM,UAAU,GAAG,UAAU,IAAI,MAAM;AACvC,UAAM,UAAoB,EAAE,GAAG,GAAG,KAAK,QAAQ,MAAM,QAAQ;AAC7D,QAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,cAAQ,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACvC,eAAe,OAAO,OAAO;AAAA,MAC/B;AAAA,IACF;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,SAAS,YACd,OACA,UACA,KACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,oBAAI,IAAI,CAAC;AACrE,WAAO,EAAE,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,UAAU,QAAQ,EAAE;AAAA,EACrD,CAAC;AACH;AAEO,SAAS,eACd,OACA,UACA,KACA,OACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,oBAAI,IAAI,CAAC;AACrE,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,OAAO,GAAG,QAAQ;AACrC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,WACd,OACA,UACA,MACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,MAAM,EAAE,SAAS,UAAU,OAAO,KAAK,IAAI,KAAK;AACtD,UAAM,aAAa,gBAAgB,MAAM,KAAK,YAAY,EAAE,EAAE;AAC9D,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,OAAO,GAAG,UAAU;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,WAAW,OAAkB,QAA2B;AACtE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,SACd,OACA,QACA,aACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,YAAY,MAAM,UAAU,IAAI,KAAK,QAAQ;AACnD,QAAM,YAAY,MAAM,UAAU,IAAI,WAAW;AACjD,MAAI,CAAC,aAAa,CAAC,UAAW,QAAO;AAErC,QAAM,YAAY,OAAO,IAAI;AAE7B,QAAM,UAAU,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAC3D,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AAED,SAAO,gBAAgB,SAAS,aAAa,CAAC,MAAM;AAClD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW;AAAA,MACf,EAAE,SAAS,UAAU,OAAO,SAAS,EAAE,SAAS,MAAM,IAAI,KAAK;AAAA,MAC/D;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF,oBAAI,IAAI;AAAA,IACV;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,WAAW,SAAS,YAAY;AACtC,gBAAY,OAAO,UAAU,GAAG,QAAQ;AACxC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,gBACd,OACA,UACA,WACA,SACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,CAAC,IAAI,IAAI,YAAY,OAAO,WAAW,CAAC;AAC9C,gBAAY,OAAO,SAAS,GAAG,IAAI;AACnC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,qBACd,OACA,UACA,UACA,iBACA,UACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,WAAW,IAAI,IAAI,QAAQ;AAEjC,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,YAAY,EAAE,SAAS,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;AAC9D,QAAI,YAAY,UAAU,UAAU,CAAC,MAAM,EAAE,OAAO,eAAe;AACnE,QAAI,cAAc,IAAI;AACpB,UAAI,SAAS,IAAI,eAAe,GAAG;AACjC,cAAM,UAAU,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,eAAe;AACpE,cAAM,UAAU,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,YAAI,aAAa,SAAS;AACxB,sBAAY,UAAU;AAAA,YACpB,CAAC,OAAO,QAAQ,IAAI,EAAE,EAAE,KAAK,MAAM;AAAA,UACrC;AACA,cAAI,cAAc,GAAI,aAAY,UAAU;AAAA,QAC9C,OAAO;AACL,sBAAY,UAAU;AAAA,YACpB,CAAC,OAAO,QAAQ,IAAI,EAAE,EAAE,KAAK,OAAO;AAAA,UACtC;AACA,cAAI,cAAc,GAAI,aAAY,UAAU;AAAA,QAC9C;AAAA,MACF,OAAO;AACL,oBAAY,aAAa,UAAU,UAAU,SAAS;AAAA,MACxD;AAAA,IACF,WAAW,aAAa,SAAS;AAC/B;AAAA,IACF;AACA,UAAM,QAAQ,SACX,IAAI,CAAC,OAAO,EAAE,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,EAC/C,OAAO,CAAC,MAAqB,MAAM,MAAS;AAC/C,UAAM,cAAc,CAAC,GAAG,SAAS;AACjC,gBAAY,OAAO,WAAW,GAAG,GAAG,KAAK;AACzC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEA,SAAS,aAAa,SAAoB,SAA8B;AACtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,UAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AACtD,UAAI,OAAO,YAAY,SAAU,QAAO,KAAK,UAAU,OAAO;AAC9D,aAAO,OAAO,OAAO;AAAA,IACvB,KAAK,UAAU;AACb,YAAM,IAAI,OAAO,OAAO;AACxB,aAAO,MAAM,CAAC,IAAI,IAAI;AAAA,IACxB;AAAA,IACA,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,UACE,YAAY,QACZ,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO;AAEtB,eAAO;AACT,UAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAM,MAAiC,CAAC;AACxC,gBAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,cAAI,OAAO,CAAC,CAAC,IAAI;AAAA,QACnB,CAAC;AACD,eAAO;AAAA,MACT;AACA,aAAO,CAAC;AAAA,IACV,KAAK;AACH,UAAI,MAAM,QAAQ,OAAO,EAAG,QAAO;AACnC,UAAI,YAAY,QAAQ,OAAO,YAAY;AACzC,eAAO,OAAO,OAAO,OAAO;AAC9B,aAAO,YAAY,QAAQ,YAAY,SAAY,CAAC,IAAI,CAAC,OAAO;AAAA,IAClE;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,WACd,OACA,QACA,SACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,eAAe,OAAO,IAAI;AAChC,QAAM,WAAW,aAAa,cAAc,OAAO;AACnD,SAAO,SAAS,OAAO,QAAQ,QAAQ;AACzC;AAEO,SAAS,cAAc,OAAkB,QAA2B;AACzE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,YAAY,OAAO,IAAI;AAE7B,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,MAAM,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,MAAM;AACvD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,SAAS,EAAE,SAAS,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG;AACjE,UAAM,WAAW;AAAA,MACf;AAAA,MACA,gBAAgB,SAAS;AAAA,MACzB;AAAA,MACA,EAAE;AAAA,MACF,oBAAI,IAAI;AAAA,IACV;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,MAAM,GAAG,GAAG,QAAQ;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;;;ACnXA,IAAM,cAAc;AAEb,IAAM,UAAN,MAAc;AAAA,EAAd;AACL,SAAQ,QAAqB,CAAC;AAC9B,SAAQ,SAAS;AAAA;AAAA,EAEjB,KAAK,OAAwB;AAC3B,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,CAAC;AAChD,SAAK,MAAM,KAAK,KAAK;AACrB,QAAI,KAAK,MAAM,SAAS,aAAa;AACnC,WAAK,MAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EAEA,IAAI,UAA4B;AAC9B,WAAO,KAAK,MAAM,KAAK,MAAM,KAAK;AAAA,EACpC;AACF;;;AClCA,IAAM,gBAAwC;AAAA,EAC5C,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,IAAM,mBAAmB;AACzB,IAAM,cAAc,oBAAI,IAAwB;AAEhD,eAAe,YAAY,KAAyC;AAClE,MAAI,YAAY,IAAI,GAAG,GAAG;AACxB,WAAO,YAAY,IAAI,GAAG;AAAA,EAC5B;AACA,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAU,MAAM,IAAI,KAAK;AAC/B,QAAI,YAAY,QAAQ,kBAAkB;AACxC,YAAM,SAAS,YAAY,KAAK,EAAE,KAAK,EAAE;AACzC,UAAI,WAAW,OAAW,aAAY,OAAO,MAAM;AAAA,IACrD;AACA,gBAAY,IAAI,KAAK,MAAM;AAC3B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,cACpB,MACA,UAC4B;AAC5B,MACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAQ,IAAI,KACnB,OAAQ,KAAoB,SAAS,MAAM,UAC3C;AACA,UAAM,MAAO,KAAoB,SAAS;AAC1C,UAAM,SAAS,MAAM,YAAY,GAAG;AACpC,QAAI,OAAQ,QAAO;AAAA,EACrB;AAEA,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC1C,UAAM,WAAW,cAAc,IAAI;AACnC,QAAI,UAAU;AACZ,aAAO,YAAY,QAAQ;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,eACP,MACA,SACgC;AAChC,MAAI,CAAC,QAAQ,WAAW,IAAI,EAAG,QAAO;AACtC,QAAM,WAAW,QAAQ,MAAM,CAAC,EAAE,MAAM,GAAG;AAC3C,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,OAAO,YAAY,SAAU,QAAO;AAC5D,cAAW,QAAoC,GAAG;AAAA,EACpD;AAEA,SAAO;AACT;AAMO,SAAS,WACd,MACA,MACA,SACoB;AACpB,QAAM,OAAO,WAAW,oBAAI,IAAY;AAExC,MAAI,KAAK,MAAM;AACb,QAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,SAAK,IAAI,KAAK,IAAI;AAClB,UAAM,WAAW,eAAe,MAAM,KAAK,IAAI;AAC/C,QAAI,UAAU;AACZ,aAAO,WAAW,UAAU,MAAM,IAAI;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO,WAAW,MAAM,MAAM,IAAI;AAAA,EACpC;AAEA,SAAO;AACT;AAEA,SAAS,WACP,MACA,MACA,SACoB;AACpB,QAAM,SAA6B,EAAE,GAAG,KAAK;AAC7C,SAAO,OAAO;AAEd,aAAW,OAAO,KAAK,OAAQ;AAC7B,UAAM,WAAW,WAAW,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC;AACvD,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY;AACvB,aAAO,aAAa,EAAE,GAAG,OAAO,YAAY,GAAG,SAAS,WAAW;AAAA,IACrE;AACA,QAAI,SAAS,UAAU;AACrB,aAAO,WAAW;AAAA,QAChB,GAAG,oBAAI,IAAI,CAAC,GAAI,OAAO,YAAY,CAAC,GAAI,GAAG,SAAS,QAAQ,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,QACE,SAAS,yBAAyB,UAClC,OAAO,yBAAyB,QAChC;AACA,aAAO,uBAAuB,SAAS;AAAA,IACzC;AACA,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,eAAe,CAAC,OAAO;AAClC,aAAO,cAAc,SAAS;AAChC,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,WAAW,CAAC,OAAO,QAAS,QAAO,UAAU,SAAS;AACnE,QAAI,SAAS,UAAU,CAAC,OAAO,OAAQ,QAAO,SAAS,SAAS;AAAA,EAClE;AAEA,SAAO;AACT;AAEO,SAAS,kBACd,QACA,MACA,YACgC;AAChC,QAAM,OAAO,cAAc;AAC3B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAA0C,WAAW,QAAQ,IAAI;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,cAAU,WAAW,SAAS,IAAI;AAElC,QAAI,QAAQ,aAAa,GAAG,GAAG;AAC7B,gBAAU,WAAW,QAAQ,WAAW,GAAG,GAAG,IAAI;AAClD;AAAA,IACF;AAEA,QAAI,QAAQ,mBAAmB;AAC7B,YAAM,QAAQ,OAAO,QAAQ,QAAQ,iBAAiB,EAAE;AAAA,QACtD,CAAC,CAAC,OAAO,MAAM;AACb,cAAI;AACF,mBAAO,IAAI,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,UACrC,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO;AACT,kBAAU,WAAW,MAAM,CAAC,GAAG,IAAI;AACnC;AAAA,MACF;AAAA,IACF;AAEA,QACE,QAAQ,wBACR,OAAO,QAAQ,yBAAyB,UACxC;AACA,gBAAU,WAAW,QAAQ,sBAAsB,IAAI;AACvD;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,UAAI,MAAM,QAAQ,QAAQ,KAAK,GAAG;AAChC,cAAM,MAAM,OAAO,GAAG;AACtB,YAAI,CAAC,MAAM,GAAG,KAAK,QAAQ,MAAM,GAAG,GAAG;AACrC,oBAAU,WAAW,QAAQ,MAAM,GAAG,GAAG,IAAI;AAC7C;AAAA,QACF;AAAA,MACF,OAAO;AACL,kBAAU,WAAW,QAAQ,OAAO,IAAI;AACxC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,QAAQ,OAAO;AAClC,YAAM,WAAW,QAAQ,SAAS,QAAQ,SAAS,CAAC;AACpD,UAAI;AACJ,iBAAW,WAAW,UAAU;AAC9B,cAAM,WAAW,WAAW,SAAS,IAAI;AACzC,gBAAQ,kBAAkB,UAAU,KAAK,IAAI;AAC7C,YAAI,MAAO;AAAA,MACb;AACA,UAAI,OAAO;AACT,kBAAU;AACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,mBAAyB;AACvC,cAAY,MAAM;AACpB;;;ACrOA,SAAS,kBACP,UACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,QAAQ,MAAM,QAAQ,UAAU,IAAI,aAAa,CAAC,UAAU;AAElE,MAAI,aAAa,YAAY,MAAM,SAAS,SAAS,EAAG,QAAO;AAC/D,SAAO,MAAM,SAAS,QAAQ;AAChC;AAEA,IAAM,kBAA0C;AAAA,EAC9C,OAAO;AAAA,EACP,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,UACE;AACJ;AAEO,SAAS,aACd,MACA,QACkB;AAClB,QAAM,SAAmB,CAAC;AAE1B,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,OAAO,MAAM,OAAO;AAAA,EAC/B;AAEA,MAAI,OAAO,QAAQ,CAAC,kBAAkB,KAAK,MAAM,OAAO,IAAI,GAAG;AAC7D,UAAM,WAAW,MAAM,QAAQ,OAAO,IAAI,IACtC,OAAO,KAAK,KAAK,KAAK,IACtB,OAAO;AACX,WAAO,KAAK,kBAAkB,QAAQ,WAAW,KAAK,IAAI,GAAG;AAAA,EAC/D;AAEA,MAAI,OAAO,QAAQ,OAAO,KAAK,SAAS,KAAK,KAAK,UAAU,QAAW;AACrE,UAAM,QAAQ,OAAO,KAAK;AAAA,MACxB,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,KAAK,KAAK;AAAA,IACxD;AACA,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,yBAAyB,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,UAAa,KAAK,UAAU,QAAW;AAC1D,QAAI,KAAK,UAAU,KAAK,KAAK,MAAM,KAAK,UAAU,OAAO,KAAK,GAAG;AAC/D,aAAO,KAAK,iBAAiB,KAAK,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,OAAO,aAAa,KAAK,SAAS,YAAY,KAAK,SAAS,UAAU;AACxE,UAAM,YAAY,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AACzD,eAAW,OAAO,OAAO,UAAU;AACjC,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,eAAO,KAAK,8BAA8B,GAAG,GAAG;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,eAAe,QAAW;AACnC,YAAM,YAAY,KAAK,IAAI,MAAM,OAAO,UAAU;AAClD,UACE,YAAY,SACZ,KAAK,IAAI,YAAY,OAAO,UAAU,IAAI,OAC1C;AACA,eAAO,KAAK,+BAA+B,OAAO,UAAU,EAAE;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,oBAAoB,OAAO,SAAS,aAAa;AAAA,IAC/D;AACA,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,mBAAmB,OAAO,SAAS,aAAa;AAAA,IAC9D;AACA,QAAI,OAAO,SAAS;AAClB,UAAI;AACF,YAAI,CAAC,IAAI,OAAO,OAAO,OAAO,EAAE,KAAK,GAAG,GAAG;AACzC,iBAAO,KAAK,uBAAuB,OAAO,OAAO,EAAE;AAAA,QACrD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,QAAI,OAAO,UAAU,gBAAgB,OAAO,MAAM,GAAG;AACnD,UAAI,CAAC,gBAAgB,OAAO,MAAM,EAAE,KAAK,GAAG,GAAG;AAC7C,eAAO,KAAK,WAAW,OAAO,MAAM,SAAS;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,SAAS;AACzB,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,QAAQ,QAAQ;AAAA,IAC3D;AACA,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,QAAQ,QAAQ;AAAA,IAC1D;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,UAAU;AAC1B,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,aAAa,aAAa;AAAA,IACrE;AACA,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,aAAa,aAAa;AAAA,IACpE;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC9C;;;AChKO,SAAS,YAAY,MAAiB,OAA8B;AACzE,MAAI,CAAC,MAAM,KAAK,EAAG,QAAO,CAAC;AAC3B,QAAM,UAAyB,CAAC;AAChC,QAAM,QAAQ,MAAM,YAAY;AAEhC,WAAS,KAAK,MAAgB;AAC5B,QAAI,KAAK,OAAO,KAAK,IAAI,YAAY,EAAE,SAAS,KAAK,GAAG;AACtD,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,CAAC;AAAA,IAChD;AACA,QACE,KAAK,UAAU,UACf,KAAK,UAAU,QACf,OAAO,KAAK,KAAK,EAAE,YAAY,EAAE,SAAS,KAAK,GAC/C;AACA,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAClD;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAMO,SAAS,eACd,MACA,SACa;AACb,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,UAAU,SAAS;AAC5B,QAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,WAAO,WAAW,QAAQ,UAAU;AAClC,gBAAU,IAAI,QAAQ,QAAQ;AAC9B,gBAAU,KAAK,UAAU,IAAI,QAAQ,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;;;ACxCO,SAAS,YACd,UACA,SACA,OAAO,IACM;AACb,QAAM,UAAuB,CAAC;AAE9B,MAAI,aAAa,SAAS;AACxB,WAAO;AAAA,EACT;AAEA,MACE,aAAa,QACb,YAAY,QACZ,OAAO,aAAa,OAAO,WAC3B,MAAM,QAAQ,QAAQ,MAAM,MAAM,QAAQ,OAAO,GACjD;AACA,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,UAAU,SAAS,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,aAAa,UAAU;AAChC,QAAI,aAAa,SAAS;AACxB,cAAQ,KAAK;AAAA,QACX,MAAM,QAAQ;AAAA,QACd,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,QAAQ,KAAK,MAAM,QAAQ,OAAO,GAAG;AACrD,UAAM,SAAS,KAAK,IAAI,SAAS,QAAQ,QAAQ,MAAM;AACvD,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,YAAY,OAAO,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAC/C,UAAI,KAAK,SAAS,QAAQ;AACxB,gBAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,CAAC,EAAE,CAAC;AAAA,MACvE,WAAW,KAAK,QAAQ,QAAQ;AAC9B,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,UAAU,SAAS,CAAC;AAAA,QACtB,CAAC;AAAA,MACH,OAAO;AACL,gBAAQ,KAAK,GAAG,YAAY,SAAS,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,CAAC;AAAA,MACjE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,UAAU,SAAS,MAAM,OAAO;AAC3C,SAAO;AACT;AAEA,SAAS,WACP,UACA,SACA,MACA,SACA;AACA,QAAM,UACJ,aAAa,QACb,OAAO,aAAa,YACpB,CAAC,MAAM,QAAQ,QAAQ,IAClB,WACD,CAAC;AACP,QAAM,UACJ,YAAY,QAAQ,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IACpE,UACD,CAAC;AAEP,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC;AAE1E,aAAW,OAAO,SAAS;AACzB,UAAM,YAAY,OAAO,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG;AACnD,UAAM,aAAa,OAAO;AAC1B,UAAM,YAAY,OAAO;AAEzB,QAAI,CAAC,cAAc,WAAW;AAC5B,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,GAAG,EAAE,CAAC;AAAA,IACzE,WAAW,cAAc,CAAC,WAAW;AACnC,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU,QAAQ,GAAG;AAAA,MACvB,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,QAAQ,GAAG,GAAG,SAAS,CAAC;AAAA,IACpE;AAAA,EACF;AACF;AAEO,SAAS,aAAa,SAA6C;AACxE,QAAM,MAAM,oBAAI,IAAsB;AACtC,aAAW,SAAS,SAAS;AAC3B,QAAI,IAAI,MAAM,MAAM,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACT;","names":[]}

package/dist/index.mjs

@@ -79,6 +79,23 @@ function toJson(node) {
       return node.value;
   }
 }
+function reparentSubtree(node, newKey, parentPath, newParentId) {
+  const newPath = parentPath ? `${parentPath}/${newKey}` : `/${newKey}`;
+  return {
+    ...node,
+    key: newKey,
+    path: newPath,
+    parentId: newParentId,
+    children: node.children.map(
+      (child, i) => reparentSubtree(
+        child,
+        node.type === "array" ? String(i) : child.key,
+        newPath,
+        node.id
+      )
+    )
+  };
+}
 function findNode(state, nodeId) {
   return state.nodesById.get(nodeId);
 }
@@ -93,6 +110,14 @@ function findNodeByPath(state, path) {
   }
   return current;
 }
+function isDescendant(tree, nodeId, potentialAncestorId) {
+  let current = tree.nodesById.get(nodeId);
+  while (current) {
+    if (current.id === potentialAncestorId) return true;
+    current = current.parentId ? tree.nodesById.get(current.parentId) : void 0;
+  }
+  return false;
+}
 
 // src/operations.ts
 function rebuildMap(root) {
@@ -163,7 +188,13 @@ function setValue(state, nodeId, value) {
   return clonePathToNode(state, nodeId, (n) => {
     const parentPath = n.path.split("/").slice(0, -1).join("/") || "";
     const nodesById = /* @__PURE__ */ new Map();
-    const subtree = buildSubtree(n.key, value, parentPath, n.parentId, nodesById);
+    const subtree = buildSubtree(
+      n.key,
+      value,
+      parentPath,
+      n.parentId,
+      nodesById
+    );
     return { ...subtree, id: n.id };
   });
 }
@@ -189,11 +220,33 @@ function addProperty(state, parentId, key, value) {
   if (!parent) return state;
   return clonePathToNode(state, parentId, (p) => {
     const parentPath = p.path === "/" ? "" : p.path;
-    const nodesById = /* @__PURE__ */ new Map();
-    const newChild = buildSubtree(key, value, parentPath, p.id, nodesById);
+    const newChild = buildSubtree(key, value, parentPath, p.id, /* @__PURE__ */ new Map());
     return { ...p, children: [...p.children, newChild] };
   });
 }
+function insertProperty(state, parentId, key, value, index) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  return clonePathToNode(state, parentId, (p) => {
+    const parentPath = p.path === "/" ? "" : p.path;
+    const newChild = buildSubtree(key, value, parentPath, p.id, /* @__PURE__ */ new Map());
+    const newChildren = [...p.children];
+    newChildren.splice(index, 0, newChild);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
+function insertNode(state, parentId, node, index) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  return clonePathToNode(state, parentId, (p) => {
+    const parentPath = p.path === "/" ? "" : p.path;
+    const key = p.type === "array" ? String(index) : node.key;
+    const reparented = reparentSubtree(node, key, parentPath, p.id);
+    const newChildren = [...p.children];
+    newChildren.splice(index, 0, reparented);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
 function removeNode(state, nodeId) {
   const node = state.nodesById.get(nodeId);
   if (!node || !node.parentId) return state;
@@ -215,13 +268,12 @@ function moveNode(state, nodeId, newParentId, index) {
   });
   return clonePathToNode(removed, newParentId, (p) => {
     const parentPath = p.path === "/" ? "" : p.path;
-    const nodesById = /* @__PURE__ */ new Map();
     const newChild = buildSubtree(
       p.type === "array" ? String(index ?? p.children.length) : node.key,
       nodeValue,
       parentPath,
       p.id,
-      nodesById
+      /* @__PURE__ */ new Map()
     );
     const newChildren = [...p.children];
     const insertAt = index ?? newChildren.length;
@@ -239,6 +291,40 @@ function reorderChildren(state, parentId, fromIndex, toIndex) {
     return reindexArrayChildren({ ...p, children: newChildren });
   });
 }
+function reorderChildrenMulti(state, parentId, movedIds, targetSiblingId, position) {
+  const parent = state.nodesById.get(parentId);
+  if (!parent) return state;
+  const movedSet = new Set(movedIds);
+  return clonePathToNode(state, parentId, (p) => {
+    const remaining = p.children.filter((c) => !movedSet.has(c.id));
+    let insertIdx = remaining.findIndex((c) => c.id === targetSiblingId);
+    if (insertIdx === -1) {
+      if (movedSet.has(targetSiblingId)) {
+        const origIdx = p.children.findIndex((c) => c.id === targetSiblingId);
+        const origMap = new Map(p.children.map((c, i) => [c.id, i]));
+        if (position === "after") {
+          insertIdx = remaining.findIndex(
+            (c) => (origMap.get(c.id) ?? -1) > origIdx
+          );
+          if (insertIdx === -1) insertIdx = remaining.length;
+        } else {
+          insertIdx = remaining.findIndex(
+            (c) => (origMap.get(c.id) ?? -1) >= origIdx
+          );
+          if (insertIdx === -1) insertIdx = remaining.length;
+        }
+      } else {
+        insertIdx = position === "after" ? remaining.length : 0;
+      }
+    } else if (position === "after") {
+      insertIdx++;
+    }
+    const moved = movedIds.map((id) => p.children.find((c) => c.id === id)).filter((c) => c !== void 0);
+    const newChildren = [...remaining];
+    newChildren.splice(insertIdx, 0, ...moved);
+    return reindexArrayChildren({ ...p, children: newChildren });
+  });
+}
 function convertValue(current, newType) {
   switch (newType) {
     case "string":
@@ -290,13 +376,12 @@ function duplicateNode(state, nodeId) {
     const idx = p.children.findIndex((c) => c.id === nodeId);
     const parentPath = p.path === "/" ? "" : p.path;
     const newKey = p.type === "array" ? String(idx + 1) : `${node.key}_copy`;
-    const nodesById = /* @__PURE__ */ new Map();
     const newChild = buildSubtree(
       newKey,
       structuredClone(nodeValue),
       parentPath,
       p.id,
-      nodesById
+      /* @__PURE__ */ new Map()
     );
     const newChildren = [...p.children];
     newChildren.splice(idx + 1, 0, newChild);
@@ -760,9 +845,14 @@ export {
   getDiffPaths,
   getNodeType,
   getPropertySchema,
+  insertNode,
+  insertProperty,
+  isDescendant,
   moveNode,
   removeNode,
   reorderChildren,
+  reorderChildrenMulti,
+  reparentSubtree,
   resetIdCounter,
   resolveRef,
   resolveSchema,

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/tree.ts","../src/operations.ts","../src/history.ts","../src/schema.ts","../src/validate.ts","../src/search.ts","../src/diff.ts"],"sourcesContent":["import type {\n  JsonPrimitive,\n  JsonValue,\n  JsonObject,\n  JsonArray,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\n\nlet nextId = 0;\n\nexport function generateId(): string {\n  return `node_${++nextId}`;\n}\n\nexport function resetIdCounter(): void {\n  nextId = 0;\n}\n\nexport function getNodeType(value: JsonValue): NodeType {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  return typeof value as NodeType;\n}\n\nexport function buildSubtree(\n  key: string,\n  value: JsonValue,\n  parentPath: string,\n  parentId: string | null,\n  nodesById: Map<string, TreeNode>,\n): TreeNode {\n  const id = generateId();\n  const path = parentPath ? `${parentPath}/${key}` : `/${key}`;\n  const type = getNodeType(value);\n\n  const node: TreeNode = {\n    id,\n    key,\n    path,\n    type,\n    value:\n      type === \"object\" || type === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId,\n  };\n\n  nodesById.set(id, node);\n\n  if (type === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    node.children = Object.keys(obj).map((childKey) =>\n      buildSubtree(childKey, obj[childKey], path, id, nodesById),\n    );\n  } else if (type === \"array\") {\n    const arr = value as JsonArray;\n    node.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, path, id, nodesById),\n    );\n  }\n\n  return node;\n}\n\nexport function fromJson(value: JsonValue): TreeState {\n  const nodesById = new Map<string, TreeNode>();\n\n  const rootType = getNodeType(value);\n  const root: TreeNode = {\n    id: generateId(),\n    key: \"\",\n    path: \"/\",\n    type: rootType,\n    value:\n      rootType === \"object\" || rootType === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId: null,\n  };\n\n  nodesById.set(root.id, root);\n\n  if (rootType === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    root.children = Object.keys(obj).map((key) =>\n      buildSubtree(key, obj[key], \"\", root.id, nodesById),\n    );\n  } else if (rootType === \"array\") {\n    const arr = value as JsonArray;\n    root.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, \"\", root.id, nodesById),\n    );\n  }\n\n  return { root, nodesById };\n}\n\nexport function toJson(node: TreeNode): JsonValue {\n  switch (node.type) {\n    case \"object\": {\n      const obj: JsonObject = {};\n      for (const child of node.children) {\n        obj[child.key] = toJson(child);\n      }\n      return obj;\n    }\n    case \"array\":\n      return node.children.map((child) => toJson(child));\n    default:\n      return node.value as JsonValue;\n  }\n}\n\nexport function findNode(\n  state: TreeState,\n  nodeId: string,\n): TreeNode | undefined {\n  return state.nodesById.get(nodeId);\n}\n\nexport function findNodeByPath(\n  state: TreeState,\n  path: string,\n): TreeNode | undefined {\n  if (path === \"/\") return state.root;\n\n  const segments = path.split(\"/\").filter(Boolean);\n  let current = state.root;\n\n  for (const segment of segments) {\n    const child = current.children.find((c) => c.key === segment);\n    if (!child) return undefined;\n    current = child;\n  }\n\n  return current;\n}\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\nimport {\n  toJson,\n  getNodeType,\n  generateId,\n  buildSubtree,\n} from \"./tree\";\n\nfunction rebuildMap(root: TreeNode): Map<string, TreeNode> {\n  const map = new Map<string, TreeNode>();\n  function walk(node: TreeNode) {\n    map.set(node.id, node);\n    for (const child of node.children) walk(child);\n  }\n  walk(root);\n  return map;\n}\n\nfunction recomputePaths(node: TreeNode, newParentPath: string): TreeNode {\n  const newPath = newParentPath\n    ? `${newParentPath}/${node.key}`\n    : `/${node.key}`;\n  if (node.path === newPath && node.children.length === 0) return node;\n  return {\n    ...node,\n    path: newPath,\n    children: node.children.map((child) => recomputePaths(child, newPath)),\n  };\n}\n\n/**\n * Clone only the ancestor chain from root to `targetId` (structural sharing),\n * apply `updater` to the target, and rebuild the `nodesById` map.\n */\nfunction clonePathToNode(\n  state: TreeState,\n  targetId: string,\n  updater: (node: TreeNode) => TreeNode,\n): TreeState {\n  const chain: string[] = [];\n  let cur: TreeNode | undefined = state.nodesById.get(targetId);\n  while (cur) {\n    chain.unshift(cur.id);\n    cur = cur.parentId ? state.nodesById.get(cur.parentId) : undefined;\n  }\n  if (chain.length === 0) return state;\n\n  function cloneAlongPath(node: TreeNode, depth: number): TreeNode {\n    if (depth === chain.length - 1) {\n      return updater(node);\n    }\n    const nextInChain = chain[depth + 1];\n    return {\n      ...node,\n      children: node.children.map((child) =>\n        child.id === nextInChain ? cloneAlongPath(child, depth + 1) : child,\n      ),\n    };\n  }\n\n  const newRoot = cloneAlongPath(state.root, 0);\n  return { root: newRoot, nodesById: rebuildMap(newRoot) };\n}\n\nfunction reindexArrayChildren(parent: TreeNode): TreeNode {\n  if (parent.type !== \"array\") return parent;\n  const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n  return {\n    ...parent,\n    children: parent.children.map((child, i) => {\n      const newKey = String(i);\n      if (child.key === newKey) return child;\n      return recomputePaths({ ...child, key: newKey }, parentPath);\n    }),\n  };\n}\n\nexport function setValue(\n  state: TreeState,\n  nodeId: string,\n  value: JsonValue,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const newType = getNodeType(value);\n\n  if (newType !== \"object\" && newType !== \"array\") {\n    return clonePathToNode(state, nodeId, (n) => ({\n      ...n,\n      type: newType,\n      value: value as JsonPrimitive,\n      children: [],\n    }));\n  }\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = n.path.split(\"/\").slice(0, -1).join(\"/\") || \"\";\n    const nodesById = new Map<string, TreeNode>();\n    const subtree = buildSubtree(n.key, value, parentPath, n.parentId, nodesById);\n    return { ...subtree, id: n.id };\n  });\n}\n\nexport function setKey(\n  state: TreeState,\n  nodeId: string,\n  newKey: string,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent || parent.type !== \"object\") return state;\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n    const newPath = `${parentPath}/${newKey}`;\n    const updated: TreeNode = { ...n, key: newKey, path: newPath };\n    if (updated.children.length > 0) {\n      updated.children = updated.children.map((child) =>\n        recomputePaths(child, newPath),\n      );\n    }\n    return updated;\n  });\n}\n\nexport function addProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(key, value, parentPath, p.id, nodesById);\n    return { ...p, children: [...p.children, newChild] };\n  });\n}\n\nexport function removeNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function moveNode(\n  state: TreeState,\n  nodeId: string,\n  newParentId: string,\n  index?: number,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const srcParent = state.nodesById.get(node.parentId);\n  const dstParent = state.nodesById.get(newParentId);\n  if (!srcParent || !dstParent) return state;\n\n  const nodeValue = toJson(node);\n\n  const removed = clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n\n  return clonePathToNode(removed, newParentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(\n      p.type === \"array\" ? String(index ?? p.children.length) : node.key,\n      nodeValue,\n      parentPath,\n      p.id,\n      nodesById,\n    );\n    const newChildren = [...p.children];\n    const insertAt = index ?? newChildren.length;\n    newChildren.splice(insertAt, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildren(\n  state: TreeState,\n  parentId: string,\n  fromIndex: number,\n  toIndex: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const newChildren = [...p.children];\n    const [item] = newChildren.splice(fromIndex, 1);\n    newChildren.splice(toIndex, 0, item);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nfunction convertValue(current: JsonValue, newType: NodeType): JsonValue {\n  switch (newType) {\n    case \"string\":\n      if (current === null || current === undefined) return \"\";\n      if (typeof current === \"object\") return JSON.stringify(current);\n      return String(current);\n    case \"number\": {\n      const n = Number(current);\n      return isNaN(n) ? 0 : n;\n    }\n    case \"boolean\":\n      return Boolean(current);\n    case \"null\":\n      return null;\n    case \"object\":\n      if (\n        current !== null &&\n        typeof current === \"object\" &&\n        !Array.isArray(current)\n      )\n        return current;\n      if (Array.isArray(current)) {\n        const obj: Record<string, JsonValue> = {};\n        current.forEach((item, i) => {\n          obj[String(i)] = item;\n        });\n        return obj;\n      }\n      return {};\n    case \"array\":\n      if (Array.isArray(current)) return current;\n      if (current !== null && typeof current === \"object\")\n        return Object.values(current);\n      return current === null || current === undefined ? [] : [current];\n    default:\n      return current;\n  }\n}\n\nexport function changeType(\n  state: TreeState,\n  nodeId: string,\n  newType: NodeType,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const currentValue = toJson(node);\n  const newValue = convertValue(currentValue, newType);\n  return setValue(state, nodeId, newValue);\n}\n\nexport function duplicateNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent) return state;\n\n  const nodeValue = toJson(node);\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const idx = p.children.findIndex((c) => c.id === nodeId);\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newKey = p.type === \"array\" ? String(idx + 1) : `${node.key}_copy`;\n    const nodesById = new Map<string, TreeNode>();\n    const newChild = buildSubtree(\n      newKey,\n      structuredClone(nodeValue),\n      parentPath,\n      p.id,\n      nodesById,\n    );\n    const newChildren = [...p.children];\n    newChildren.splice(idx + 1, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n","import type { TreeState } from \"./types\";\n\nconst MAX_HISTORY = 100;\n\nexport class History {\n  private stack: TreeState[] = [];\n  private cursor = -1;\n\n  push(state: TreeState): void {\n    this.stack = this.stack.slice(0, this.cursor + 1);\n    this.stack.push(state);\n    if (this.stack.length > MAX_HISTORY) {\n      this.stack.shift();\n    } else {\n      this.cursor++;\n    }\n  }\n\n  undo(): TreeState | null {\n    if (!this.canUndo) return null;\n    this.cursor--;\n    return this.stack[this.cursor];\n  }\n\n  redo(): TreeState | null {\n    if (!this.canRedo) return null;\n    this.cursor++;\n    return this.stack[this.cursor];\n  }\n\n  get canUndo(): boolean {\n    return this.cursor > 0;\n  }\n\n  get canRedo(): boolean {\n    return this.cursor < this.stack.length - 1;\n  }\n\n  get current(): TreeState | null {\n    return this.stack[this.cursor] ?? null;\n  }\n}\n","import type {\n  JsonSchema,\n  JsonSchemaProperty,\n  JsonValue,\n  JsonObject,\n} from \"./types\";\n\nconst KNOWN_SCHEMAS: Record<string, string> = {\n  \"package.json\": \"https://json.schemastore.org/package.json\",\n  \"tsconfig.json\": \"https://json.schemastore.org/tsconfig\",\n  \"tsconfig.base.json\": \"https://json.schemastore.org/tsconfig\",\n  \".eslintrc.json\": \"https://json.schemastore.org/eslintrc\",\n  \".prettierrc\": \"https://json.schemastore.org/prettierrc\",\n  \".prettierrc.json\": \"https://json.schemastore.org/prettierrc\",\n  \"turbo.json\": \"https://turborepo.dev/schema.json\",\n  \".babelrc\": \"https://json.schemastore.org/babelrc\",\n  \"nest-cli.json\": \"https://json.schemastore.org/nest-cli\",\n  \"vercel.json\": \"https://openapi.vercel.sh/vercel.json\",\n  \".swcrc\": \"https://json.schemastore.org/swcrc\",\n};\n\nconst MAX_SCHEMA_CACHE = 50;\nconst schemaCache = new Map<string, JsonSchema>();\n\nasync function fetchSchema(url: string): Promise<JsonSchema | null> {\n  if (schemaCache.has(url)) {\n    return schemaCache.get(url)!;\n  }\n  try {\n    const res = await fetch(url);\n    if (!res.ok) return null;\n    const schema = (await res.json()) as JsonSchema;\n    if (schemaCache.size >= MAX_SCHEMA_CACHE) {\n      const oldest = schemaCache.keys().next().value;\n      if (oldest !== undefined) schemaCache.delete(oldest);\n    }\n    schemaCache.set(url, schema);\n    return schema;\n  } catch {\n    return null;\n  }\n}\n\nexport async function resolveSchema(\n  json: JsonValue,\n  filename?: string,\n): Promise<JsonSchema | null> {\n  if (\n    json !== null &&\n    typeof json === \"object\" &&\n    !Array.isArray(json) &&\n    typeof (json as JsonObject)[\"$schema\"] === \"string\"\n  ) {\n    const url = (json as JsonObject)[\"$schema\"] as string;\n    const schema = await fetchSchema(url);\n    if (schema) return schema;\n  }\n\n  if (filename) {\n    const base = filename.split(\"/\").pop() ?? filename;\n    const knownUrl = KNOWN_SCHEMAS[base];\n    if (knownUrl) {\n      return fetchSchema(knownUrl);\n    }\n  }\n\n  return null;\n}\n\nfunction findDefinition(\n  root: JsonSchemaProperty,\n  refPath: string,\n): JsonSchemaProperty | undefined {\n  if (!refPath.startsWith(\"#/\")) return undefined;\n  const segments = refPath.slice(2).split(\"/\");\n  let current: unknown = root;\n\n  for (const seg of segments) {\n    if (current === null || typeof current !== \"object\") return undefined;\n    current = (current as Record<string, unknown>)[seg];\n  }\n\n  return current as JsonSchemaProperty | undefined;\n}\n\n/**\n * Resolve `$ref` pointers and merge `allOf` within a schema.\n * `visited` tracks refs to prevent infinite cycles.\n */\nexport function resolveRef(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited?: Set<string>,\n): JsonSchemaProperty {\n  const seen = visited ?? new Set<string>();\n\n  if (prop.$ref) {\n    if (seen.has(prop.$ref)) return prop;\n    seen.add(prop.$ref);\n    const resolved = findDefinition(root, prop.$ref);\n    if (resolved) {\n      return resolveRef(resolved, root, seen);\n    }\n    return prop;\n  }\n\n  if (prop.allOf && prop.allOf.length > 0) {\n    return mergeAllOf(prop, root, seen);\n  }\n\n  return prop;\n}\n\nfunction mergeAllOf(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited: Set<string>,\n): JsonSchemaProperty {\n  const merged: JsonSchemaProperty = { ...prop };\n  delete merged.allOf;\n\n  for (const sub of prop.allOf!) {\n    const resolved = resolveRef(sub, root, new Set(visited));\n    if (resolved.type && !merged.type) merged.type = resolved.type;\n    if (resolved.properties) {\n      merged.properties = { ...merged.properties, ...resolved.properties };\n    }\n    if (resolved.required) {\n      merged.required = [\n        ...new Set([...(merged.required ?? []), ...resolved.required]),\n      ];\n    }\n    if (\n      resolved.additionalProperties !== undefined &&\n      merged.additionalProperties === undefined\n    ) {\n      merged.additionalProperties = resolved.additionalProperties;\n    }\n    if (resolved.items && !merged.items) merged.items = resolved.items;\n    if (resolved.description && !merged.description)\n      merged.description = resolved.description;\n    if (resolved.title && !merged.title) merged.title = resolved.title;\n    if (resolved.enum && !merged.enum) merged.enum = resolved.enum;\n    if (resolved.minimum !== undefined && merged.minimum === undefined)\n      merged.minimum = resolved.minimum;\n    if (resolved.maximum !== undefined && merged.maximum === undefined)\n      merged.maximum = resolved.maximum;\n    if (resolved.minLength !== undefined && merged.minLength === undefined)\n      merged.minLength = resolved.minLength;\n    if (resolved.maxLength !== undefined && merged.maxLength === undefined)\n      merged.maxLength = resolved.maxLength;\n    if (resolved.pattern && !merged.pattern) merged.pattern = resolved.pattern;\n    if (resolved.format && !merged.format) merged.format = resolved.format;\n  }\n\n  return merged;\n}\n\nexport function getPropertySchema(\n  schema: JsonSchema | JsonSchemaProperty,\n  path: string,\n  rootSchema?: JsonSchemaProperty,\n): JsonSchemaProperty | undefined {\n  const root = rootSchema ?? schema;\n  const segments = path.split(\"/\").filter(Boolean);\n  let current: JsonSchemaProperty | undefined = resolveRef(schema, root);\n\n  for (const seg of segments) {\n    if (!current) return undefined;\n    current = resolveRef(current, root);\n\n    if (current.properties?.[seg]) {\n      current = resolveRef(current.properties[seg], root);\n      continue;\n    }\n\n    if (current.patternProperties) {\n      const match = Object.entries(current.patternProperties).find(\n        ([pattern]) => {\n          try {\n            return new RegExp(pattern).test(seg);\n          } catch {\n            return false;\n          }\n        },\n      );\n      if (match) {\n        current = resolveRef(match[1], root);\n        continue;\n      }\n    }\n\n    if (\n      current.additionalProperties &&\n      typeof current.additionalProperties === \"object\"\n    ) {\n      current = resolveRef(current.additionalProperties, root);\n      continue;\n    }\n\n    if (current.items) {\n      if (Array.isArray(current.items)) {\n        const idx = Number(seg);\n        if (!isNaN(idx) && current.items[idx]) {\n          current = resolveRef(current.items[idx], root);\n          continue;\n        }\n      } else {\n        current = resolveRef(current.items, root);\n        continue;\n      }\n    }\n\n    if (current.anyOf || current.oneOf) {\n      const variants = current.anyOf ?? current.oneOf ?? [];\n      let found: JsonSchemaProperty | undefined;\n      for (const variant of variants) {\n        const resolved = resolveRef(variant, root);\n        found = getPropertySchema(resolved, seg, root);\n        if (found) break;\n      }\n      if (found) {\n        current = found;\n        continue;\n      }\n      return undefined;\n    }\n\n    return undefined;\n  }\n\n  return current;\n}\n\nexport function clearSchemaCache(): void {\n  schemaCache.clear();\n}\n","import type { TreeNode, JsonSchemaProperty } from \"./types\";\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nfunction schemaTypeMatches(\n  nodeType: string,\n  schemaType: string | string[] | undefined,\n): boolean {\n  if (!schemaType) return true;\n  const types = Array.isArray(schemaType) ? schemaType : [schemaType];\n\n  if (nodeType === \"number\" && types.includes(\"integer\")) return true;\n  return types.includes(nodeType);\n}\n\nconst FORMAT_PATTERNS: Record<string, RegExp> = {\n  email: /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/,\n  uri: /^https?:\\/\\/.+/,\n  \"uri-reference\": /^(https?:\\/\\/|\\/|\\.\\.?\\/|#).*/,\n  \"date-time\": /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}/,\n  date: /^\\d{4}-\\d{2}-\\d{2}$/,\n  time: /^\\d{2}:\\d{2}:\\d{2}/,\n  ipv4: /^(\\d{1,3}\\.){3}\\d{1,3}$/,\n  ipv6: /^([0-9a-fA-F]{0,4}:){2,7}[0-9a-fA-F]{0,4}$/,\n  uuid: /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$/,\n  hostname:\n    /^[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?(\\.[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?)*$/,\n};\n\nexport function validateNode(\n  node: TreeNode,\n  schema: JsonSchemaProperty | undefined,\n): ValidationResult {\n  const errors: string[] = [];\n\n  if (!schema) {\n    return { valid: true, errors };\n  }\n\n  if (schema.type && !schemaTypeMatches(node.type, schema.type)) {\n    const expected = Array.isArray(schema.type)\n      ? schema.type.join(\" | \")\n      : schema.type;\n    errors.push(`Expected type \"${expected}\", got \"${node.type}\"`);\n  }\n\n  if (schema.enum && schema.enum.length > 0 && node.value !== undefined) {\n    const match = schema.enum.some(\n      (v) => JSON.stringify(v) === JSON.stringify(node.value),\n    );\n    if (!match) {\n      errors.push(\n        `Value must be one of: ${schema.enum.map((v) => JSON.stringify(v)).join(\", \")}`,\n      );\n    }\n  }\n\n  if (schema.const !== undefined && node.value !== undefined) {\n    if (JSON.stringify(node.value) !== JSON.stringify(schema.const)) {\n      errors.push(`Value must be ${JSON.stringify(schema.const)}`);\n    }\n  }\n\n  if (schema.required && (node.type === \"object\" || node.type === \"array\")) {\n    const childKeys = new Set(node.children.map((c) => c.key));\n    for (const req of schema.required) {\n      if (!childKeys.has(req)) {\n        errors.push(`Missing required property \"${req}\"`);\n      }\n    }\n  }\n\n  if (node.type === \"number\" && typeof node.value === \"number\") {\n    const val = node.value;\n    if (schema.minimum !== undefined && val < schema.minimum) {\n      errors.push(`Value must be >= ${schema.minimum}`);\n    }\n    if (schema.maximum !== undefined && val > schema.maximum) {\n      errors.push(`Value must be <= ${schema.maximum}`);\n    }\n    if (schema.exclusiveMinimum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMinimum === \"number\"\n          ? schema.exclusiveMinimum\n          : schema.minimum;\n      if (bound !== undefined && val <= bound) {\n        errors.push(`Value must be > ${bound}`);\n      }\n    }\n    if (schema.exclusiveMaximum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMaximum === \"number\"\n          ? schema.exclusiveMaximum\n          : schema.maximum;\n      if (bound !== undefined && val >= bound) {\n        errors.push(`Value must be < ${bound}`);\n      }\n    }\n    if (schema.multipleOf !== undefined) {\n      const remainder = Math.abs(val % schema.multipleOf);\n      if (remainder > 1e-10 && Math.abs(remainder - schema.multipleOf) > 1e-10) {\n        errors.push(`Value must be a multiple of ${schema.multipleOf}`);\n      }\n    }\n  }\n\n  if (node.type === \"string\" && typeof node.value === \"string\") {\n    const val = node.value;\n    if (schema.minLength !== undefined && val.length < schema.minLength) {\n      errors.push(`Must be at least ${schema.minLength} characters`);\n    }\n    if (schema.maxLength !== undefined && val.length > schema.maxLength) {\n      errors.push(`Must be at most ${schema.maxLength} characters`);\n    }\n    if (schema.pattern) {\n      try {\n        if (!new RegExp(schema.pattern).test(val)) {\n          errors.push(`Must match pattern: ${schema.pattern}`);\n        }\n      } catch {\n        // invalid regex in schema, skip\n      }\n    }\n    if (schema.format && FORMAT_PATTERNS[schema.format]) {\n      if (!FORMAT_PATTERNS[schema.format].test(val)) {\n        errors.push(`Invalid ${schema.format} format`);\n      }\n    }\n  }\n\n  if (node.type === \"array\") {\n    if (\n      schema.minItems !== undefined &&\n      node.children.length < schema.minItems\n    ) {\n      errors.push(`Must have at least ${schema.minItems} items`);\n    }\n    if (\n      schema.maxItems !== undefined &&\n      node.children.length > schema.maxItems\n    ) {\n      errors.push(`Must have at most ${schema.maxItems} items`);\n    }\n  }\n\n  if (node.type === \"object\") {\n    if (\n      schema.minProperties !== undefined &&\n      node.children.length < schema.minProperties\n    ) {\n      errors.push(`Must have at least ${schema.minProperties} properties`);\n    }\n    if (\n      schema.maxProperties !== undefined &&\n      node.children.length > schema.maxProperties\n    ) {\n      errors.push(`Must have at most ${schema.maxProperties} properties`);\n    }\n  }\n\n  return { valid: errors.length === 0, errors };\n}\n","import type { TreeNode, TreeState } from \"./types\";\n\nexport interface SearchMatch {\n  nodeId: string;\n  field: \"key\" | \"value\";\n}\n\nexport function searchNodes(tree: TreeState, query: string): SearchMatch[] {\n  if (!query.trim()) return [];\n  const matches: SearchMatch[] = [];\n  const lower = query.toLowerCase();\n\n  function walk(node: TreeNode) {\n    if (node.key && node.key.toLowerCase().includes(lower)) {\n      matches.push({ nodeId: node.id, field: \"key\" });\n    }\n    if (\n      node.value !== undefined &&\n      node.value !== null &&\n      String(node.value).toLowerCase().includes(lower)\n    ) {\n      matches.push({ nodeId: node.id, field: \"value\" });\n    }\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(tree.root);\n  return matches;\n}\n\n/**\n * Collect all ancestor node IDs for each matched node so the tree\n * can auto-expand paths to search results.\n */\nexport function getAncestorIds(\n  tree: TreeState,\n  nodeIds: string[],\n): Set<string> {\n  const ancestors = new Set<string>();\n\n  for (const nodeId of nodeIds) {\n    let current = tree.nodesById.get(nodeId);\n    while (current && current.parentId) {\n      ancestors.add(current.parentId);\n      current = tree.nodesById.get(current.parentId);\n    }\n  }\n\n  return ancestors;\n}\n","import type { JsonValue } from \"./types\";\n\nexport type DiffType = \"added\" | \"removed\" | \"changed\";\n\nexport interface DiffEntry {\n  path: string;\n  type: DiffType;\n  oldValue?: JsonValue;\n  newValue?: JsonValue;\n}\n\nexport function computeDiff(\n  original: JsonValue,\n  current: JsonValue,\n  path = \"\",\n): DiffEntry[] {\n  const entries: DiffEntry[] = [];\n\n  if (original === current) {\n    return entries;\n  }\n\n  if (\n    original === null ||\n    current === null ||\n    typeof original !== typeof current ||\n    Array.isArray(original) !== Array.isArray(current)\n  ) {\n    if (path) {\n      entries.push({\n        path,\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    } else {\n      diffObject(original, current, path, entries);\n    }\n    return entries;\n  }\n\n  if (typeof original !== \"object\") {\n    if (original !== current) {\n      entries.push({\n        path: path || \"/\",\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    }\n    return entries;\n  }\n\n  if (Array.isArray(original) && Array.isArray(current)) {\n    const maxLen = Math.max(original.length, current.length);\n    for (let i = 0; i < maxLen; i++) {\n      const childPath = path ? `${path}/${i}` : `/${i}`;\n      if (i >= original.length) {\n        entries.push({ path: childPath, type: \"added\", newValue: current[i] });\n      } else if (i >= current.length) {\n        entries.push({\n          path: childPath,\n          type: \"removed\",\n          oldValue: original[i],\n        });\n      } else {\n        entries.push(...computeDiff(original[i], current[i], childPath));\n      }\n    }\n    return entries;\n  }\n\n  diffObject(original, current, path, entries);\n  return entries;\n}\n\nfunction diffObject(\n  original: JsonValue,\n  current: JsonValue,\n  path: string,\n  entries: DiffEntry[],\n) {\n  const origObj =\n    original !== null &&\n    typeof original === \"object\" &&\n    !Array.isArray(original)\n      ? (original as Record<string, JsonValue>)\n      : {};\n  const currObj =\n    current !== null && typeof current === \"object\" && !Array.isArray(current)\n      ? (current as Record<string, JsonValue>)\n      : {};\n\n  const allKeys = new Set([...Object.keys(origObj), ...Object.keys(currObj)]);\n\n  for (const key of allKeys) {\n    const childPath = path ? `${path}/${key}` : `/${key}`;\n    const inOriginal = key in origObj;\n    const inCurrent = key in currObj;\n\n    if (!inOriginal && inCurrent) {\n      entries.push({ path: childPath, type: \"added\", newValue: currObj[key] });\n    } else if (inOriginal && !inCurrent) {\n      entries.push({\n        path: childPath,\n        type: \"removed\",\n        oldValue: origObj[key],\n      });\n    } else {\n      entries.push(...computeDiff(origObj[key], currObj[key], childPath));\n    }\n  }\n}\n\nexport function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType> {\n  const map = new Map<string, DiffType>();\n  for (const entry of entries) {\n    map.set(entry.path, entry.type);\n  }\n  return map;\n}\n"],"mappings":";AAUA,IAAI,SAAS;AAEN,SAAS,aAAqB;AACnC,SAAO,QAAQ,EAAE,MAAM;AACzB;AAEO,SAAS,iBAAuB;AACrC,WAAS;AACX;AAEO,SAAS,YAAY,OAA4B;AACtD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,OAAO;AAChB;AAEO,SAAS,aACd,KACA,OACA,YACA,UACA,WACU;AACV,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,aAAa,GAAG,UAAU,IAAI,GAAG,KAAK,IAAI,GAAG;AAC1D,QAAM,OAAO,YAAY,KAAK;AAE9B,QAAM,OAAiB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OACE,SAAS,YAAY,SAAS,UAC1B,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX;AAAA,EACF;AAEA,YAAU,IAAI,IAAI,IAAI;AAEtB,MAAI,SAAS,YAAY,UAAU,MAAM;AACvC,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,aACpC,aAAa,UAAU,IAAI,QAAQ,GAAG,MAAM,IAAI,SAAS;AAAA,IAC3D;AAAA,EACF,WAAW,SAAS,SAAS;AAC3B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,MAAM,IAAI,SAAS;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,SAAS,OAA6B;AACpD,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,WAAW,YAAY,KAAK;AAClC,QAAM,OAAiB;AAAA,IACrB,IAAI,WAAW;AAAA,IACf,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OACE,aAAa,YAAY,aAAa,UAClC,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX,UAAU;AAAA,EACZ;AAEA,YAAU,IAAI,KAAK,IAAI,IAAI;AAE3B,MAAI,aAAa,YAAY,UAAU,MAAM;AAC3C,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,QACpC,aAAa,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,SAAS;AAAA,IACpD;AAAA,EACF,WAAW,aAAa,SAAS;AAC/B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,SAAS;AAAA,IAC1D;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,UAAU;AAC3B;AAEO,SAAS,OAAO,MAA2B;AAChD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,UAAU;AACb,YAAM,MAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,GAAG,IAAI,OAAO,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AACH,aAAO,KAAK,SAAS,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AAAA,IACnD;AACE,aAAO,KAAK;AAAA,EAChB;AACF;AAEO,SAAS,SACd,OACA,QACsB;AACtB,SAAO,MAAM,UAAU,IAAI,MAAM;AACnC;AAEO,SAAS,eACd,OACA,MACsB;AACtB,MAAI,SAAS,IAAK,QAAO,MAAM;AAE/B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAAU,MAAM;AAEpB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO;AAC5D,QAAI,CAAC,MAAO,QAAO;AACnB,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;;;AC9HA,SAAS,WAAW,MAAuC;AACzD,QAAM,MAAM,oBAAI,IAAsB;AACtC,WAAS,KAAK,MAAgB;AAC5B,QAAI,IAAI,KAAK,IAAI,IAAI;AACrB,eAAW,SAAS,KAAK,SAAU,MAAK,KAAK;AAAA,EAC/C;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAEA,SAAS,eAAe,MAAgB,eAAiC;AACvE,QAAM,UAAU,gBACZ,GAAG,aAAa,IAAI,KAAK,GAAG,KAC5B,IAAI,KAAK,GAAG;AAChB,MAAI,KAAK,SAAS,WAAW,KAAK,SAAS,WAAW,EAAG,QAAO;AAChE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,eAAe,OAAO,OAAO,CAAC;AAAA,EACvE;AACF;AAMA,SAAS,gBACP,OACA,UACA,SACW;AACX,QAAM,QAAkB,CAAC;AACzB,MAAI,MAA4B,MAAM,UAAU,IAAI,QAAQ;AAC5D,SAAO,KAAK;AACV,UAAM,QAAQ,IAAI,EAAE;AACpB,UAAM,IAAI,WAAW,MAAM,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC3D;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,WAAS,eAAe,MAAgB,OAAyB;AAC/D,QAAI,UAAU,MAAM,SAAS,GAAG;AAC9B,aAAO,QAAQ,IAAI;AAAA,IACrB;AACA,UAAM,cAAc,MAAM,QAAQ,CAAC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,KAAK,SAAS;AAAA,QAAI,CAAC,UAC3B,MAAM,OAAO,cAAc,eAAe,OAAO,QAAQ,CAAC,IAAI;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,eAAe,MAAM,MAAM,CAAC;AAC5C,SAAO,EAAE,MAAM,SAAS,WAAW,WAAW,OAAO,EAAE;AACzD;AAEA,SAAS,qBAAqB,QAA4B;AACxD,MAAI,OAAO,SAAS,QAAS,QAAO;AACpC,QAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,OAAO,SAAS,IAAI,CAAC,OAAO,MAAM;AAC1C,YAAM,SAAS,OAAO,CAAC;AACvB,UAAI,MAAM,QAAQ,OAAQ,QAAO;AACjC,aAAO,eAAe,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG,UAAU;AAAA,IAC7D,CAAC;AAAA,EACH;AACF;AAEO,SAAS,SACd,OACA,QACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,UAAU,YAAY,KAAK;AAEjC,MAAI,YAAY,YAAY,YAAY,SAAS;AAC/C,WAAO,gBAAgB,OAAO,QAAQ,CAAC,OAAO;AAAA,MAC5C,GAAG;AAAA,MACH,MAAM;AAAA,MACN;AAAA,MACA,UAAU,CAAC;AAAA,IACb,EAAE;AAAA,EACJ;AAEA,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,EAAE,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,KAAK;AAC/D,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,UAAU,aAAa,EAAE,KAAK,OAAO,YAAY,EAAE,UAAU,SAAS;AAC5E,WAAO,EAAE,GAAG,SAAS,IAAI,EAAE,GAAG;AAAA,EAChC,CAAC;AACH;AAEO,SAAS,OACd,OACA,QACA,QACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,UAAU,OAAO,SAAS,SAAU,QAAO;AAEhD,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,UAAM,UAAU,GAAG,UAAU,IAAI,MAAM;AACvC,UAAM,UAAoB,EAAE,GAAG,GAAG,KAAK,QAAQ,MAAM,QAAQ;AAC7D,QAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,cAAQ,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACvC,eAAe,OAAO,OAAO;AAAA,MAC/B;AAAA,IACF;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,SAAS,YACd,OACA,UACA,KACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,SAAS;AACrE,WAAO,EAAE,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,UAAU,QAAQ,EAAE;AAAA,EACrD,CAAC;AACH;AAEO,SAAS,WAAW,OAAkB,QAA2B;AACtE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,SACd,OACA,QACA,aACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,YAAY,MAAM,UAAU,IAAI,KAAK,QAAQ;AACnD,QAAM,YAAY,MAAM,UAAU,IAAI,WAAW;AACjD,MAAI,CAAC,aAAa,CAAC,UAAW,QAAO;AAErC,QAAM,YAAY,OAAO,IAAI;AAE7B,QAAM,UAAU,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAC3D,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AAED,SAAO,gBAAgB,SAAS,aAAa,CAAC,MAAM;AAClD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW;AAAA,MACf,EAAE,SAAS,UAAU,OAAO,SAAS,EAAE,SAAS,MAAM,IAAI,KAAK;AAAA,MAC/D;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,WAAW,SAAS,YAAY;AACtC,gBAAY,OAAO,UAAU,GAAG,QAAQ;AACxC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,gBACd,OACA,UACA,WACA,SACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,CAAC,IAAI,IAAI,YAAY,OAAO,WAAW,CAAC;AAC9C,gBAAY,OAAO,SAAS,GAAG,IAAI;AACnC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEA,SAAS,aAAa,SAAoB,SAA8B;AACtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,UAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AACtD,UAAI,OAAO,YAAY,SAAU,QAAO,KAAK,UAAU,OAAO;AAC9D,aAAO,OAAO,OAAO;AAAA,IACvB,KAAK,UAAU;AACb,YAAM,IAAI,OAAO,OAAO;AACxB,aAAO,MAAM,CAAC,IAAI,IAAI;AAAA,IACxB;AAAA,IACA,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,UACE,YAAY,QACZ,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO;AAEtB,eAAO;AACT,UAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAM,MAAiC,CAAC;AACxC,gBAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,cAAI,OAAO,CAAC,CAAC,IAAI;AAAA,QACnB,CAAC;AACD,eAAO;AAAA,MACT;AACA,aAAO,CAAC;AAAA,IACV,KAAK;AACH,UAAI,MAAM,QAAQ,OAAO,EAAG,QAAO;AACnC,UAAI,YAAY,QAAQ,OAAO,YAAY;AACzC,eAAO,OAAO,OAAO,OAAO;AAC9B,aAAO,YAAY,QAAQ,YAAY,SAAY,CAAC,IAAI,CAAC,OAAO;AAAA,IAClE;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,WACd,OACA,QACA,SACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,eAAe,OAAO,IAAI;AAChC,QAAM,WAAW,aAAa,cAAc,OAAO;AACnD,SAAO,SAAS,OAAO,QAAQ,QAAQ;AACzC;AAEO,SAAS,cAAc,OAAkB,QAA2B;AACzE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,YAAY,OAAO,IAAI;AAE7B,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,MAAM,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,MAAM;AACvD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,SAAS,EAAE,SAAS,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG;AACjE,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,WAAW;AAAA,MACf;AAAA,MACA,gBAAgB,SAAS;AAAA,MACzB;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,MAAM,GAAG,GAAG,QAAQ;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;;;AClSA,IAAM,cAAc;AAEb,IAAM,UAAN,MAAc;AAAA,EAAd;AACL,SAAQ,QAAqB,CAAC;AAC9B,SAAQ,SAAS;AAAA;AAAA,EAEjB,KAAK,OAAwB;AAC3B,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,CAAC;AAChD,SAAK,MAAM,KAAK,KAAK;AACrB,QAAI,KAAK,MAAM,SAAS,aAAa;AACnC,WAAK,MAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EAEA,IAAI,UAA4B;AAC9B,WAAO,KAAK,MAAM,KAAK,MAAM,KAAK;AAAA,EACpC;AACF;;;AClCA,IAAM,gBAAwC;AAAA,EAC5C,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,IAAM,mBAAmB;AACzB,IAAM,cAAc,oBAAI,IAAwB;AAEhD,eAAe,YAAY,KAAyC;AAClE,MAAI,YAAY,IAAI,GAAG,GAAG;AACxB,WAAO,YAAY,IAAI,GAAG;AAAA,EAC5B;AACA,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAU,MAAM,IAAI,KAAK;AAC/B,QAAI,YAAY,QAAQ,kBAAkB;AACxC,YAAM,SAAS,YAAY,KAAK,EAAE,KAAK,EAAE;AACzC,UAAI,WAAW,OAAW,aAAY,OAAO,MAAM;AAAA,IACrD;AACA,gBAAY,IAAI,KAAK,MAAM;AAC3B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,cACpB,MACA,UAC4B;AAC5B,MACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAQ,IAAI,KACnB,OAAQ,KAAoB,SAAS,MAAM,UAC3C;AACA,UAAM,MAAO,KAAoB,SAAS;AAC1C,UAAM,SAAS,MAAM,YAAY,GAAG;AACpC,QAAI,OAAQ,QAAO;AAAA,EACrB;AAEA,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC1C,UAAM,WAAW,cAAc,IAAI;AACnC,QAAI,UAAU;AACZ,aAAO,YAAY,QAAQ;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,eACP,MACA,SACgC;AAChC,MAAI,CAAC,QAAQ,WAAW,IAAI,EAAG,QAAO;AACtC,QAAM,WAAW,QAAQ,MAAM,CAAC,EAAE,MAAM,GAAG;AAC3C,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,OAAO,YAAY,SAAU,QAAO;AAC5D,cAAW,QAAoC,GAAG;AAAA,EACpD;AAEA,SAAO;AACT;AAMO,SAAS,WACd,MACA,MACA,SACoB;AACpB,QAAM,OAAO,WAAW,oBAAI,IAAY;AAExC,MAAI,KAAK,MAAM;AACb,QAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,SAAK,IAAI,KAAK,IAAI;AAClB,UAAM,WAAW,eAAe,MAAM,KAAK,IAAI;AAC/C,QAAI,UAAU;AACZ,aAAO,WAAW,UAAU,MAAM,IAAI;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO,WAAW,MAAM,MAAM,IAAI;AAAA,EACpC;AAEA,SAAO;AACT;AAEA,SAAS,WACP,MACA,MACA,SACoB;AACpB,QAAM,SAA6B,EAAE,GAAG,KAAK;AAC7C,SAAO,OAAO;AAEd,aAAW,OAAO,KAAK,OAAQ;AAC7B,UAAM,WAAW,WAAW,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC;AACvD,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY;AACvB,aAAO,aAAa,EAAE,GAAG,OAAO,YAAY,GAAG,SAAS,WAAW;AAAA,IACrE;AACA,QAAI,SAAS,UAAU;AACrB,aAAO,WAAW;AAAA,QAChB,GAAG,oBAAI,IAAI,CAAC,GAAI,OAAO,YAAY,CAAC,GAAI,GAAG,SAAS,QAAQ,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,QACE,SAAS,yBAAyB,UAClC,OAAO,yBAAyB,QAChC;AACA,aAAO,uBAAuB,SAAS;AAAA,IACzC;AACA,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,eAAe,CAAC,OAAO;AAClC,aAAO,cAAc,SAAS;AAChC,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,WAAW,CAAC,OAAO,QAAS,QAAO,UAAU,SAAS;AACnE,QAAI,SAAS,UAAU,CAAC,OAAO,OAAQ,QAAO,SAAS,SAAS;AAAA,EAClE;AAEA,SAAO;AACT;AAEO,SAAS,kBACd,QACA,MACA,YACgC;AAChC,QAAM,OAAO,cAAc;AAC3B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAA0C,WAAW,QAAQ,IAAI;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,cAAU,WAAW,SAAS,IAAI;AAElC,QAAI,QAAQ,aAAa,GAAG,GAAG;AAC7B,gBAAU,WAAW,QAAQ,WAAW,GAAG,GAAG,IAAI;AAClD;AAAA,IACF;AAEA,QAAI,QAAQ,mBAAmB;AAC7B,YAAM,QAAQ,OAAO,QAAQ,QAAQ,iBAAiB,EAAE;AAAA,QACtD,CAAC,CAAC,OAAO,MAAM;AACb,cAAI;AACF,mBAAO,IAAI,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,UACrC,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO;AACT,kBAAU,WAAW,MAAM,CAAC,GAAG,IAAI;AACnC;AAAA,MACF;AAAA,IACF;AAEA,QACE,QAAQ,wBACR,OAAO,QAAQ,yBAAyB,UACxC;AACA,gBAAU,WAAW,QAAQ,sBAAsB,IAAI;AACvD;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,UAAI,MAAM,QAAQ,QAAQ,KAAK,GAAG;AAChC,cAAM,MAAM,OAAO,GAAG;AACtB,YAAI,CAAC,MAAM,GAAG,KAAK,QAAQ,MAAM,GAAG,GAAG;AACrC,oBAAU,WAAW,QAAQ,MAAM,GAAG,GAAG,IAAI;AAC7C;AAAA,QACF;AAAA,MACF,OAAO;AACL,kBAAU,WAAW,QAAQ,OAAO,IAAI;AACxC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,QAAQ,OAAO;AAClC,YAAM,WAAW,QAAQ,SAAS,QAAQ,SAAS,CAAC;AACpD,UAAI;AACJ,iBAAW,WAAW,UAAU;AAC9B,cAAM,WAAW,WAAW,SAAS,IAAI;AACzC,gBAAQ,kBAAkB,UAAU,KAAK,IAAI;AAC7C,YAAI,MAAO;AAAA,MACb;AACA,UAAI,OAAO;AACT,kBAAU;AACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,mBAAyB;AACvC,cAAY,MAAM;AACpB;;;ACrOA,SAAS,kBACP,UACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,QAAQ,MAAM,QAAQ,UAAU,IAAI,aAAa,CAAC,UAAU;AAElE,MAAI,aAAa,YAAY,MAAM,SAAS,SAAS,EAAG,QAAO;AAC/D,SAAO,MAAM,SAAS,QAAQ;AAChC;AAEA,IAAM,kBAA0C;AAAA,EAC9C,OAAO;AAAA,EACP,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,UACE;AACJ;AAEO,SAAS,aACd,MACA,QACkB;AAClB,QAAM,SAAmB,CAAC;AAE1B,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,OAAO,MAAM,OAAO;AAAA,EAC/B;AAEA,MAAI,OAAO,QAAQ,CAAC,kBAAkB,KAAK,MAAM,OAAO,IAAI,GAAG;AAC7D,UAAM,WAAW,MAAM,QAAQ,OAAO,IAAI,IACtC,OAAO,KAAK,KAAK,KAAK,IACtB,OAAO;AACX,WAAO,KAAK,kBAAkB,QAAQ,WAAW,KAAK,IAAI,GAAG;AAAA,EAC/D;AAEA,MAAI,OAAO,QAAQ,OAAO,KAAK,SAAS,KAAK,KAAK,UAAU,QAAW;AACrE,UAAM,QAAQ,OAAO,KAAK;AAAA,MACxB,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,KAAK,KAAK;AAAA,IACxD;AACA,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,yBAAyB,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,UAAa,KAAK,UAAU,QAAW;AAC1D,QAAI,KAAK,UAAU,KAAK,KAAK,MAAM,KAAK,UAAU,OAAO,KAAK,GAAG;AAC/D,aAAO,KAAK,iBAAiB,KAAK,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,OAAO,aAAa,KAAK,SAAS,YAAY,KAAK,SAAS,UAAU;AACxE,UAAM,YAAY,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AACzD,eAAW,OAAO,OAAO,UAAU;AACjC,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,eAAO,KAAK,8BAA8B,GAAG,GAAG;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,eAAe,QAAW;AACnC,YAAM,YAAY,KAAK,IAAI,MAAM,OAAO,UAAU;AAClD,UAAI,YAAY,SAAS,KAAK,IAAI,YAAY,OAAO,UAAU,IAAI,OAAO;AACxE,eAAO,KAAK,+BAA+B,OAAO,UAAU,EAAE;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,oBAAoB,OAAO,SAAS,aAAa;AAAA,IAC/D;AACA,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,mBAAmB,OAAO,SAAS,aAAa;AAAA,IAC9D;AACA,QAAI,OAAO,SAAS;AAClB,UAAI;AACF,YAAI,CAAC,IAAI,OAAO,OAAO,OAAO,EAAE,KAAK,GAAG,GAAG;AACzC,iBAAO,KAAK,uBAAuB,OAAO,OAAO,EAAE;AAAA,QACrD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,QAAI,OAAO,UAAU,gBAAgB,OAAO,MAAM,GAAG;AACnD,UAAI,CAAC,gBAAgB,OAAO,MAAM,EAAE,KAAK,GAAG,GAAG;AAC7C,eAAO,KAAK,WAAW,OAAO,MAAM,SAAS;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,SAAS;AACzB,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,QAAQ,QAAQ;AAAA,IAC3D;AACA,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,QAAQ,QAAQ;AAAA,IAC1D;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,UAAU;AAC1B,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,aAAa,aAAa;AAAA,IACrE;AACA,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,aAAa,aAAa;AAAA,IACpE;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC9C;;;AC7JO,SAAS,YAAY,MAAiB,OAA8B;AACzE,MAAI,CAAC,MAAM,KAAK,EAAG,QAAO,CAAC;AAC3B,QAAM,UAAyB,CAAC;AAChC,QAAM,QAAQ,MAAM,YAAY;AAEhC,WAAS,KAAK,MAAgB;AAC5B,QAAI,KAAK,OAAO,KAAK,IAAI,YAAY,EAAE,SAAS,KAAK,GAAG;AACtD,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,CAAC;AAAA,IAChD;AACA,QACE,KAAK,UAAU,UACf,KAAK,UAAU,QACf,OAAO,KAAK,KAAK,EAAE,YAAY,EAAE,SAAS,KAAK,GAC/C;AACA,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAClD;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAMO,SAAS,eACd,MACA,SACa;AACb,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,UAAU,SAAS;AAC5B,QAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,WAAO,WAAW,QAAQ,UAAU;AAClC,gBAAU,IAAI,QAAQ,QAAQ;AAC9B,gBAAU,KAAK,UAAU,IAAI,QAAQ,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;;;ACxCO,SAAS,YACd,UACA,SACA,OAAO,IACM;AACb,QAAM,UAAuB,CAAC;AAE9B,MAAI,aAAa,SAAS;AACxB,WAAO;AAAA,EACT;AAEA,MACE,aAAa,QACb,YAAY,QACZ,OAAO,aAAa,OAAO,WAC3B,MAAM,QAAQ,QAAQ,MAAM,MAAM,QAAQ,OAAO,GACjD;AACA,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,UAAU,SAAS,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,aAAa,UAAU;AAChC,QAAI,aAAa,SAAS;AACxB,cAAQ,KAAK;AAAA,QACX,MAAM,QAAQ;AAAA,QACd,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,QAAQ,KAAK,MAAM,QAAQ,OAAO,GAAG;AACrD,UAAM,SAAS,KAAK,IAAI,SAAS,QAAQ,QAAQ,MAAM;AACvD,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,YAAY,OAAO,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAC/C,UAAI,KAAK,SAAS,QAAQ;AACxB,gBAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,CAAC,EAAE,CAAC;AAAA,MACvE,WAAW,KAAK,QAAQ,QAAQ;AAC9B,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,UAAU,SAAS,CAAC;AAAA,QACtB,CAAC;AAAA,MACH,OAAO;AACL,gBAAQ,KAAK,GAAG,YAAY,SAAS,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,CAAC;AAAA,MACjE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,UAAU,SAAS,MAAM,OAAO;AAC3C,SAAO;AACT;AAEA,SAAS,WACP,UACA,SACA,MACA,SACA;AACA,QAAM,UACJ,aAAa,QACb,OAAO,aAAa,YACpB,CAAC,MAAM,QAAQ,QAAQ,IAClB,WACD,CAAC;AACP,QAAM,UACJ,YAAY,QAAQ,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IACpE,UACD,CAAC;AAEP,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC;AAE1E,aAAW,OAAO,SAAS;AACzB,UAAM,YAAY,OAAO,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG;AACnD,UAAM,aAAa,OAAO;AAC1B,UAAM,YAAY,OAAO;AAEzB,QAAI,CAAC,cAAc,WAAW;AAC5B,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,GAAG,EAAE,CAAC;AAAA,IACzE,WAAW,cAAc,CAAC,WAAW;AACnC,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU,QAAQ,GAAG;AAAA,MACvB,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,QAAQ,GAAG,GAAG,SAAS,CAAC;AAAA,IACpE;AAAA,EACF;AACF;AAEO,SAAS,aAAa,SAA6C;AACxE,QAAM,MAAM,oBAAI,IAAsB;AACtC,aAAW,SAAS,SAAS;AAC3B,QAAI,IAAI,MAAM,MAAM,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/tree.ts","../src/operations.ts","../src/history.ts","../src/schema.ts","../src/validate.ts","../src/search.ts","../src/diff.ts"],"sourcesContent":["import type {\n  JsonPrimitive,\n  JsonValue,\n  JsonObject,\n  JsonArray,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\n\nlet nextId = 0;\n\nexport function generateId(): string {\n  return `node_${++nextId}`;\n}\n\nexport function resetIdCounter(): void {\n  nextId = 0;\n}\n\nexport function getNodeType(value: JsonValue): NodeType {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  return typeof value as NodeType;\n}\n\nexport function buildSubtree(\n  key: string,\n  value: JsonValue,\n  parentPath: string,\n  parentId: string | null,\n  nodesById: Map<string, TreeNode>,\n): TreeNode {\n  const id = generateId();\n  const path = parentPath ? `${parentPath}/${key}` : `/${key}`;\n  const type = getNodeType(value);\n\n  const node: TreeNode = {\n    id,\n    key,\n    path,\n    type,\n    value:\n      type === \"object\" || type === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId,\n  };\n\n  nodesById.set(id, node);\n\n  if (type === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    node.children = Object.keys(obj).map((childKey) =>\n      buildSubtree(childKey, obj[childKey], path, id, nodesById),\n    );\n  } else if (type === \"array\") {\n    const arr = value as JsonArray;\n    node.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, path, id, nodesById),\n    );\n  }\n\n  return node;\n}\n\nexport function fromJson(value: JsonValue): TreeState {\n  const nodesById = new Map<string, TreeNode>();\n\n  const rootType = getNodeType(value);\n  const root: TreeNode = {\n    id: generateId(),\n    key: \"\",\n    path: \"/\",\n    type: rootType,\n    value:\n      rootType === \"object\" || rootType === \"array\"\n        ? undefined\n        : (value as JsonPrimitive),\n    children: [],\n    parentId: null,\n  };\n\n  nodesById.set(root.id, root);\n\n  if (rootType === \"object\" && value !== null) {\n    const obj = value as JsonObject;\n    root.children = Object.keys(obj).map((key) =>\n      buildSubtree(key, obj[key], \"\", root.id, nodesById),\n    );\n  } else if (rootType === \"array\") {\n    const arr = value as JsonArray;\n    root.children = arr.map((item, index) =>\n      buildSubtree(String(index), item, \"\", root.id, nodesById),\n    );\n  }\n\n  return { root, nodesById };\n}\n\nexport function toJson(node: TreeNode): JsonValue {\n  switch (node.type) {\n    case \"object\": {\n      const obj: JsonObject = {};\n      for (const child of node.children) {\n        obj[child.key] = toJson(child);\n      }\n      return obj;\n    }\n    case \"array\":\n      return node.children.map((child) => toJson(child));\n    default:\n      return node.value as JsonValue;\n  }\n}\n\n/**\n * Clone a subtree with updated key, path, and parentId while preserving\n * all original node IDs. Used for cross-parent moves where identity must\n * be retained so that UI state (expanded, selected, etc.) stays valid.\n */\nexport function reparentSubtree(\n  node: TreeNode,\n  newKey: string,\n  parentPath: string,\n  newParentId: string,\n): TreeNode {\n  const newPath = parentPath ? `${parentPath}/${newKey}` : `/${newKey}`;\n  return {\n    ...node,\n    key: newKey,\n    path: newPath,\n    parentId: newParentId,\n    children: node.children.map((child, i) =>\n      reparentSubtree(\n        child,\n        node.type === \"array\" ? String(i) : child.key,\n        newPath,\n        node.id,\n      ),\n    ),\n  };\n}\n\nexport function findNode(\n  state: TreeState,\n  nodeId: string,\n): TreeNode | undefined {\n  return state.nodesById.get(nodeId);\n}\n\nexport function findNodeByPath(\n  state: TreeState,\n  path: string,\n): TreeNode | undefined {\n  if (path === \"/\") return state.root;\n\n  const segments = path.split(\"/\").filter(Boolean);\n  let current = state.root;\n\n  for (const segment of segments) {\n    const child = current.children.find((c) => c.key === segment);\n    if (!child) return undefined;\n    current = child;\n  }\n\n  return current;\n}\n\n/**\n * Check whether `nodeId` is a descendant of `potentialAncestorId` by walking\n * up `parentId` links. Returns `true` when the two IDs are equal (a node is\n * considered a descendant of itself).\n */\nexport function isDescendant(\n  tree: TreeState,\n  nodeId: string,\n  potentialAncestorId: string,\n): boolean {\n  let current = tree.nodesById.get(nodeId);\n  while (current) {\n    if (current.id === potentialAncestorId) return true;\n    current = current.parentId\n      ? tree.nodesById.get(current.parentId)\n      : undefined;\n  }\n  return false;\n}\n","import type {\n  JsonPrimitive,\n  JsonValue,\n  NodeType,\n  TreeNode,\n  TreeState,\n} from \"./types\";\nimport { toJson, getNodeType, buildSubtree, reparentSubtree } from \"./tree\";\n\nfunction rebuildMap(root: TreeNode): Map<string, TreeNode> {\n  const map = new Map<string, TreeNode>();\n  function walk(node: TreeNode) {\n    map.set(node.id, node);\n    for (const child of node.children) walk(child);\n  }\n  walk(root);\n  return map;\n}\n\nfunction recomputePaths(node: TreeNode, newParentPath: string): TreeNode {\n  const newPath = newParentPath\n    ? `${newParentPath}/${node.key}`\n    : `/${node.key}`;\n  if (node.path === newPath && node.children.length === 0) return node;\n  return {\n    ...node,\n    path: newPath,\n    children: node.children.map((child) => recomputePaths(child, newPath)),\n  };\n}\n\n/**\n * Clone only the ancestor chain from root to `targetId` (structural sharing),\n * apply `updater` to the target, and rebuild the `nodesById` map.\n */\nfunction clonePathToNode(\n  state: TreeState,\n  targetId: string,\n  updater: (node: TreeNode) => TreeNode,\n): TreeState {\n  const chain: string[] = [];\n  let cur: TreeNode | undefined = state.nodesById.get(targetId);\n  while (cur) {\n    chain.unshift(cur.id);\n    cur = cur.parentId ? state.nodesById.get(cur.parentId) : undefined;\n  }\n  if (chain.length === 0) return state;\n\n  function cloneAlongPath(node: TreeNode, depth: number): TreeNode {\n    if (depth === chain.length - 1) {\n      return updater(node);\n    }\n    const nextInChain = chain[depth + 1];\n    return {\n      ...node,\n      children: node.children.map((child) =>\n        child.id === nextInChain ? cloneAlongPath(child, depth + 1) : child,\n      ),\n    };\n  }\n\n  const newRoot = cloneAlongPath(state.root, 0);\n  return { root: newRoot, nodesById: rebuildMap(newRoot) };\n}\n\nfunction reindexArrayChildren(parent: TreeNode): TreeNode {\n  if (parent.type !== \"array\") return parent;\n  const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n  return {\n    ...parent,\n    children: parent.children.map((child, i) => {\n      const newKey = String(i);\n      if (child.key === newKey) return child;\n      return recomputePaths({ ...child, key: newKey }, parentPath);\n    }),\n  };\n}\n\nexport function setValue(\n  state: TreeState,\n  nodeId: string,\n  value: JsonValue,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const newType = getNodeType(value);\n\n  if (newType !== \"object\" && newType !== \"array\") {\n    return clonePathToNode(state, nodeId, (n) => ({\n      ...n,\n      type: newType,\n      value: value as JsonPrimitive,\n      children: [],\n    }));\n  }\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = n.path.split(\"/\").slice(0, -1).join(\"/\") || \"\";\n    const nodesById = new Map<string, TreeNode>();\n    const subtree = buildSubtree(\n      n.key,\n      value,\n      parentPath,\n      n.parentId,\n      nodesById,\n    );\n    return { ...subtree, id: n.id };\n  });\n}\n\nexport function setKey(\n  state: TreeState,\n  nodeId: string,\n  newKey: string,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent || parent.type !== \"object\") return state;\n\n  return clonePathToNode(state, nodeId, (n) => {\n    const parentPath = parent.path === \"/\" ? \"\" : parent.path;\n    const newPath = `${parentPath}/${newKey}`;\n    const updated: TreeNode = { ...n, key: newKey, path: newPath };\n    if (updated.children.length > 0) {\n      updated.children = updated.children.map((child) =>\n        recomputePaths(child, newPath),\n      );\n    }\n    return updated;\n  });\n}\n\nexport function addProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(key, value, parentPath, p.id, new Map());\n    return { ...p, children: [...p.children, newChild] };\n  });\n}\n\nexport function insertProperty(\n  state: TreeState,\n  parentId: string,\n  key: string,\n  value: JsonValue,\n  index: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(key, value, parentPath, p.id, new Map());\n    const newChildren = [...p.children];\n    newChildren.splice(index, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function insertNode(\n  state: TreeState,\n  parentId: string,\n  node: TreeNode,\n  index: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const key = p.type === \"array\" ? String(index) : node.key;\n    const reparented = reparentSubtree(node, key, parentPath, p.id);\n    const newChildren = [...p.children];\n    newChildren.splice(index, 0, reparented);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function removeNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function moveNode(\n  state: TreeState,\n  nodeId: string,\n  newParentId: string,\n  index?: number,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const srcParent = state.nodesById.get(node.parentId);\n  const dstParent = state.nodesById.get(newParentId);\n  if (!srcParent || !dstParent) return state;\n\n  const nodeValue = toJson(node);\n\n  const removed = clonePathToNode(state, node.parentId, (p) => {\n    const newChildren = p.children.filter((c) => c.id !== nodeId);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n\n  return clonePathToNode(removed, newParentId, (p) => {\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newChild = buildSubtree(\n      p.type === \"array\" ? String(index ?? p.children.length) : node.key,\n      nodeValue,\n      parentPath,\n      p.id,\n      new Map(),\n    );\n    const newChildren = [...p.children];\n    const insertAt = index ?? newChildren.length;\n    newChildren.splice(insertAt, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildren(\n  state: TreeState,\n  parentId: string,\n  fromIndex: number,\n  toIndex: number,\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  return clonePathToNode(state, parentId, (p) => {\n    const newChildren = [...p.children];\n    const [item] = newChildren.splice(fromIndex, 1);\n    newChildren.splice(toIndex, 0, item);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nexport function reorderChildrenMulti(\n  state: TreeState,\n  parentId: string,\n  movedIds: string[],\n  targetSiblingId: string,\n  position: \"before\" | \"after\",\n): TreeState {\n  const parent = state.nodesById.get(parentId);\n  if (!parent) return state;\n\n  const movedSet = new Set(movedIds);\n\n  return clonePathToNode(state, parentId, (p) => {\n    const remaining = p.children.filter((c) => !movedSet.has(c.id));\n    let insertIdx = remaining.findIndex((c) => c.id === targetSiblingId);\n    if (insertIdx === -1) {\n      if (movedSet.has(targetSiblingId)) {\n        const origIdx = p.children.findIndex((c) => c.id === targetSiblingId);\n        const origMap = new Map(p.children.map((c, i) => [c.id, i]));\n        if (position === \"after\") {\n          insertIdx = remaining.findIndex(\n            (c) => (origMap.get(c.id) ?? -1) > origIdx,\n          );\n          if (insertIdx === -1) insertIdx = remaining.length;\n        } else {\n          insertIdx = remaining.findIndex(\n            (c) => (origMap.get(c.id) ?? -1) >= origIdx,\n          );\n          if (insertIdx === -1) insertIdx = remaining.length;\n        }\n      } else {\n        insertIdx = position === \"after\" ? remaining.length : 0;\n      }\n    } else if (position === \"after\") {\n      insertIdx++;\n    }\n    const moved = movedIds\n      .map((id) => p.children.find((c) => c.id === id))\n      .filter((c): c is TreeNode => c !== undefined);\n    const newChildren = [...remaining];\n    newChildren.splice(insertIdx, 0, ...moved);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n\nfunction convertValue(current: JsonValue, newType: NodeType): JsonValue {\n  switch (newType) {\n    case \"string\":\n      if (current === null || current === undefined) return \"\";\n      if (typeof current === \"object\") return JSON.stringify(current);\n      return String(current);\n    case \"number\": {\n      const n = Number(current);\n      return isNaN(n) ? 0 : n;\n    }\n    case \"boolean\":\n      return Boolean(current);\n    case \"null\":\n      return null;\n    case \"object\":\n      if (\n        current !== null &&\n        typeof current === \"object\" &&\n        !Array.isArray(current)\n      )\n        return current;\n      if (Array.isArray(current)) {\n        const obj: Record<string, JsonValue> = {};\n        current.forEach((item, i) => {\n          obj[String(i)] = item;\n        });\n        return obj;\n      }\n      return {};\n    case \"array\":\n      if (Array.isArray(current)) return current;\n      if (current !== null && typeof current === \"object\")\n        return Object.values(current);\n      return current === null || current === undefined ? [] : [current];\n    default:\n      return current;\n  }\n}\n\nexport function changeType(\n  state: TreeState,\n  nodeId: string,\n  newType: NodeType,\n): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node) return state;\n\n  const currentValue = toJson(node);\n  const newValue = convertValue(currentValue, newType);\n  return setValue(state, nodeId, newValue);\n}\n\nexport function duplicateNode(state: TreeState, nodeId: string): TreeState {\n  const node = state.nodesById.get(nodeId);\n  if (!node || !node.parentId) return state;\n\n  const parent = state.nodesById.get(node.parentId);\n  if (!parent) return state;\n\n  const nodeValue = toJson(node);\n\n  return clonePathToNode(state, node.parentId, (p) => {\n    const idx = p.children.findIndex((c) => c.id === nodeId);\n    const parentPath = p.path === \"/\" ? \"\" : p.path;\n    const newKey = p.type === \"array\" ? String(idx + 1) : `${node.key}_copy`;\n    const newChild = buildSubtree(\n      newKey,\n      structuredClone(nodeValue),\n      parentPath,\n      p.id,\n      new Map(),\n    );\n    const newChildren = [...p.children];\n    newChildren.splice(idx + 1, 0, newChild);\n    return reindexArrayChildren({ ...p, children: newChildren });\n  });\n}\n","import type { TreeState } from \"./types\";\n\nconst MAX_HISTORY = 100;\n\nexport class History {\n  private stack: TreeState[] = [];\n  private cursor = -1;\n\n  push(state: TreeState): void {\n    this.stack = this.stack.slice(0, this.cursor + 1);\n    this.stack.push(state);\n    if (this.stack.length > MAX_HISTORY) {\n      this.stack.shift();\n    } else {\n      this.cursor++;\n    }\n  }\n\n  undo(): TreeState | null {\n    if (!this.canUndo) return null;\n    this.cursor--;\n    return this.stack[this.cursor];\n  }\n\n  redo(): TreeState | null {\n    if (!this.canRedo) return null;\n    this.cursor++;\n    return this.stack[this.cursor];\n  }\n\n  get canUndo(): boolean {\n    return this.cursor > 0;\n  }\n\n  get canRedo(): boolean {\n    return this.cursor < this.stack.length - 1;\n  }\n\n  get current(): TreeState | null {\n    return this.stack[this.cursor] ?? null;\n  }\n}\n","import type {\n  JsonSchema,\n  JsonSchemaProperty,\n  JsonValue,\n  JsonObject,\n} from \"./types\";\n\nconst KNOWN_SCHEMAS: Record<string, string> = {\n  \"package.json\": \"https://json.schemastore.org/package.json\",\n  \"tsconfig.json\": \"https://json.schemastore.org/tsconfig\",\n  \"tsconfig.base.json\": \"https://json.schemastore.org/tsconfig\",\n  \".eslintrc.json\": \"https://json.schemastore.org/eslintrc\",\n  \".prettierrc\": \"https://json.schemastore.org/prettierrc\",\n  \".prettierrc.json\": \"https://json.schemastore.org/prettierrc\",\n  \"turbo.json\": \"https://turborepo.dev/schema.json\",\n  \".babelrc\": \"https://json.schemastore.org/babelrc\",\n  \"nest-cli.json\": \"https://json.schemastore.org/nest-cli\",\n  \"vercel.json\": \"https://openapi.vercel.sh/vercel.json\",\n  \".swcrc\": \"https://json.schemastore.org/swcrc\",\n};\n\nconst MAX_SCHEMA_CACHE = 50;\nconst schemaCache = new Map<string, JsonSchema>();\n\nasync function fetchSchema(url: string): Promise<JsonSchema | null> {\n  if (schemaCache.has(url)) {\n    return schemaCache.get(url)!;\n  }\n  try {\n    const res = await fetch(url);\n    if (!res.ok) return null;\n    const schema = (await res.json()) as JsonSchema;\n    if (schemaCache.size >= MAX_SCHEMA_CACHE) {\n      const oldest = schemaCache.keys().next().value;\n      if (oldest !== undefined) schemaCache.delete(oldest);\n    }\n    schemaCache.set(url, schema);\n    return schema;\n  } catch {\n    return null;\n  }\n}\n\nexport async function resolveSchema(\n  json: JsonValue,\n  filename?: string,\n): Promise<JsonSchema | null> {\n  if (\n    json !== null &&\n    typeof json === \"object\" &&\n    !Array.isArray(json) &&\n    typeof (json as JsonObject)[\"$schema\"] === \"string\"\n  ) {\n    const url = (json as JsonObject)[\"$schema\"] as string;\n    const schema = await fetchSchema(url);\n    if (schema) return schema;\n  }\n\n  if (filename) {\n    const base = filename.split(\"/\").pop() ?? filename;\n    const knownUrl = KNOWN_SCHEMAS[base];\n    if (knownUrl) {\n      return fetchSchema(knownUrl);\n    }\n  }\n\n  return null;\n}\n\nfunction findDefinition(\n  root: JsonSchemaProperty,\n  refPath: string,\n): JsonSchemaProperty | undefined {\n  if (!refPath.startsWith(\"#/\")) return undefined;\n  const segments = refPath.slice(2).split(\"/\");\n  let current: unknown = root;\n\n  for (const seg of segments) {\n    if (current === null || typeof current !== \"object\") return undefined;\n    current = (current as Record<string, unknown>)[seg];\n  }\n\n  return current as JsonSchemaProperty | undefined;\n}\n\n/**\n * Resolve `$ref` pointers and merge `allOf` within a schema.\n * `visited` tracks refs to prevent infinite cycles.\n */\nexport function resolveRef(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited?: Set<string>,\n): JsonSchemaProperty {\n  const seen = visited ?? new Set<string>();\n\n  if (prop.$ref) {\n    if (seen.has(prop.$ref)) return prop;\n    seen.add(prop.$ref);\n    const resolved = findDefinition(root, prop.$ref);\n    if (resolved) {\n      return resolveRef(resolved, root, seen);\n    }\n    return prop;\n  }\n\n  if (prop.allOf && prop.allOf.length > 0) {\n    return mergeAllOf(prop, root, seen);\n  }\n\n  return prop;\n}\n\nfunction mergeAllOf(\n  prop: JsonSchemaProperty,\n  root: JsonSchemaProperty,\n  visited: Set<string>,\n): JsonSchemaProperty {\n  const merged: JsonSchemaProperty = { ...prop };\n  delete merged.allOf;\n\n  for (const sub of prop.allOf!) {\n    const resolved = resolveRef(sub, root, new Set(visited));\n    if (resolved.type && !merged.type) merged.type = resolved.type;\n    if (resolved.properties) {\n      merged.properties = { ...merged.properties, ...resolved.properties };\n    }\n    if (resolved.required) {\n      merged.required = [\n        ...new Set([...(merged.required ?? []), ...resolved.required]),\n      ];\n    }\n    if (\n      resolved.additionalProperties !== undefined &&\n      merged.additionalProperties === undefined\n    ) {\n      merged.additionalProperties = resolved.additionalProperties;\n    }\n    if (resolved.items && !merged.items) merged.items = resolved.items;\n    if (resolved.description && !merged.description)\n      merged.description = resolved.description;\n    if (resolved.title && !merged.title) merged.title = resolved.title;\n    if (resolved.enum && !merged.enum) merged.enum = resolved.enum;\n    if (resolved.minimum !== undefined && merged.minimum === undefined)\n      merged.minimum = resolved.minimum;\n    if (resolved.maximum !== undefined && merged.maximum === undefined)\n      merged.maximum = resolved.maximum;\n    if (resolved.minLength !== undefined && merged.minLength === undefined)\n      merged.minLength = resolved.minLength;\n    if (resolved.maxLength !== undefined && merged.maxLength === undefined)\n      merged.maxLength = resolved.maxLength;\n    if (resolved.pattern && !merged.pattern) merged.pattern = resolved.pattern;\n    if (resolved.format && !merged.format) merged.format = resolved.format;\n  }\n\n  return merged;\n}\n\nexport function getPropertySchema(\n  schema: JsonSchema | JsonSchemaProperty,\n  path: string,\n  rootSchema?: JsonSchemaProperty,\n): JsonSchemaProperty | undefined {\n  const root = rootSchema ?? schema;\n  const segments = path.split(\"/\").filter(Boolean);\n  let current: JsonSchemaProperty | undefined = resolveRef(schema, root);\n\n  for (const seg of segments) {\n    if (!current) return undefined;\n    current = resolveRef(current, root);\n\n    if (current.properties?.[seg]) {\n      current = resolveRef(current.properties[seg], root);\n      continue;\n    }\n\n    if (current.patternProperties) {\n      const match = Object.entries(current.patternProperties).find(\n        ([pattern]) => {\n          try {\n            return new RegExp(pattern).test(seg);\n          } catch {\n            return false;\n          }\n        },\n      );\n      if (match) {\n        current = resolveRef(match[1], root);\n        continue;\n      }\n    }\n\n    if (\n      current.additionalProperties &&\n      typeof current.additionalProperties === \"object\"\n    ) {\n      current = resolveRef(current.additionalProperties, root);\n      continue;\n    }\n\n    if (current.items) {\n      if (Array.isArray(current.items)) {\n        const idx = Number(seg);\n        if (!isNaN(idx) && current.items[idx]) {\n          current = resolveRef(current.items[idx], root);\n          continue;\n        }\n      } else {\n        current = resolveRef(current.items, root);\n        continue;\n      }\n    }\n\n    if (current.anyOf || current.oneOf) {\n      const variants = current.anyOf ?? current.oneOf ?? [];\n      let found: JsonSchemaProperty | undefined;\n      for (const variant of variants) {\n        const resolved = resolveRef(variant, root);\n        found = getPropertySchema(resolved, seg, root);\n        if (found) break;\n      }\n      if (found) {\n        current = found;\n        continue;\n      }\n      return undefined;\n    }\n\n    return undefined;\n  }\n\n  return current;\n}\n\nexport function clearSchemaCache(): void {\n  schemaCache.clear();\n}\n","import type { TreeNode, JsonSchemaProperty } from \"./types\";\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nfunction schemaTypeMatches(\n  nodeType: string,\n  schemaType: string | string[] | undefined,\n): boolean {\n  if (!schemaType) return true;\n  const types = Array.isArray(schemaType) ? schemaType : [schemaType];\n\n  if (nodeType === \"number\" && types.includes(\"integer\")) return true;\n  return types.includes(nodeType);\n}\n\nconst FORMAT_PATTERNS: Record<string, RegExp> = {\n  email: /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/,\n  uri: /^https?:\\/\\/.+/,\n  \"uri-reference\": /^(https?:\\/\\/|\\/|\\.\\.?\\/|#).*/,\n  \"date-time\": /^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}/,\n  date: /^\\d{4}-\\d{2}-\\d{2}$/,\n  time: /^\\d{2}:\\d{2}:\\d{2}/,\n  ipv4: /^(\\d{1,3}\\.){3}\\d{1,3}$/,\n  ipv6: /^([0-9a-fA-F]{0,4}:){2,7}[0-9a-fA-F]{0,4}$/,\n  uuid: /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$/,\n  hostname:\n    /^[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?(\\.[a-zA-Z0-9]([a-zA-Z0-9-]*[a-zA-Z0-9])?)*$/,\n};\n\nexport function validateNode(\n  node: TreeNode,\n  schema: JsonSchemaProperty | undefined,\n): ValidationResult {\n  const errors: string[] = [];\n\n  if (!schema) {\n    return { valid: true, errors };\n  }\n\n  if (schema.type && !schemaTypeMatches(node.type, schema.type)) {\n    const expected = Array.isArray(schema.type)\n      ? schema.type.join(\" | \")\n      : schema.type;\n    errors.push(`Expected type \"${expected}\", got \"${node.type}\"`);\n  }\n\n  if (schema.enum && schema.enum.length > 0 && node.value !== undefined) {\n    const match = schema.enum.some(\n      (v) => JSON.stringify(v) === JSON.stringify(node.value),\n    );\n    if (!match) {\n      errors.push(\n        `Value must be one of: ${schema.enum.map((v) => JSON.stringify(v)).join(\", \")}`,\n      );\n    }\n  }\n\n  if (schema.const !== undefined && node.value !== undefined) {\n    if (JSON.stringify(node.value) !== JSON.stringify(schema.const)) {\n      errors.push(`Value must be ${JSON.stringify(schema.const)}`);\n    }\n  }\n\n  if (schema.required && (node.type === \"object\" || node.type === \"array\")) {\n    const childKeys = new Set(node.children.map((c) => c.key));\n    for (const req of schema.required) {\n      if (!childKeys.has(req)) {\n        errors.push(`Missing required property \"${req}\"`);\n      }\n    }\n  }\n\n  if (node.type === \"number\" && typeof node.value === \"number\") {\n    const val = node.value;\n    if (schema.minimum !== undefined && val < schema.minimum) {\n      errors.push(`Value must be >= ${schema.minimum}`);\n    }\n    if (schema.maximum !== undefined && val > schema.maximum) {\n      errors.push(`Value must be <= ${schema.maximum}`);\n    }\n    if (schema.exclusiveMinimum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMinimum === \"number\"\n          ? schema.exclusiveMinimum\n          : schema.minimum;\n      if (bound !== undefined && val <= bound) {\n        errors.push(`Value must be > ${bound}`);\n      }\n    }\n    if (schema.exclusiveMaximum !== undefined) {\n      const bound =\n        typeof schema.exclusiveMaximum === \"number\"\n          ? schema.exclusiveMaximum\n          : schema.maximum;\n      if (bound !== undefined && val >= bound) {\n        errors.push(`Value must be < ${bound}`);\n      }\n    }\n    if (schema.multipleOf !== undefined) {\n      const remainder = Math.abs(val % schema.multipleOf);\n      if (\n        remainder > 1e-10 &&\n        Math.abs(remainder - schema.multipleOf) > 1e-10\n      ) {\n        errors.push(`Value must be a multiple of ${schema.multipleOf}`);\n      }\n    }\n  }\n\n  if (node.type === \"string\" && typeof node.value === \"string\") {\n    const val = node.value;\n    if (schema.minLength !== undefined && val.length < schema.minLength) {\n      errors.push(`Must be at least ${schema.minLength} characters`);\n    }\n    if (schema.maxLength !== undefined && val.length > schema.maxLength) {\n      errors.push(`Must be at most ${schema.maxLength} characters`);\n    }\n    if (schema.pattern) {\n      try {\n        if (!new RegExp(schema.pattern).test(val)) {\n          errors.push(`Must match pattern: ${schema.pattern}`);\n        }\n      } catch {\n        // invalid regex in schema, skip\n      }\n    }\n    if (schema.format && FORMAT_PATTERNS[schema.format]) {\n      if (!FORMAT_PATTERNS[schema.format].test(val)) {\n        errors.push(`Invalid ${schema.format} format`);\n      }\n    }\n  }\n\n  if (node.type === \"array\") {\n    if (\n      schema.minItems !== undefined &&\n      node.children.length < schema.minItems\n    ) {\n      errors.push(`Must have at least ${schema.minItems} items`);\n    }\n    if (\n      schema.maxItems !== undefined &&\n      node.children.length > schema.maxItems\n    ) {\n      errors.push(`Must have at most ${schema.maxItems} items`);\n    }\n  }\n\n  if (node.type === \"object\") {\n    if (\n      schema.minProperties !== undefined &&\n      node.children.length < schema.minProperties\n    ) {\n      errors.push(`Must have at least ${schema.minProperties} properties`);\n    }\n    if (\n      schema.maxProperties !== undefined &&\n      node.children.length > schema.maxProperties\n    ) {\n      errors.push(`Must have at most ${schema.maxProperties} properties`);\n    }\n  }\n\n  return { valid: errors.length === 0, errors };\n}\n","import type { TreeNode, TreeState } from \"./types\";\n\nexport interface SearchMatch {\n  nodeId: string;\n  field: \"key\" | \"value\";\n}\n\nexport function searchNodes(tree: TreeState, query: string): SearchMatch[] {\n  if (!query.trim()) return [];\n  const matches: SearchMatch[] = [];\n  const lower = query.toLowerCase();\n\n  function walk(node: TreeNode) {\n    if (node.key && node.key.toLowerCase().includes(lower)) {\n      matches.push({ nodeId: node.id, field: \"key\" });\n    }\n    if (\n      node.value !== undefined &&\n      node.value !== null &&\n      String(node.value).toLowerCase().includes(lower)\n    ) {\n      matches.push({ nodeId: node.id, field: \"value\" });\n    }\n    for (const child of node.children) {\n      walk(child);\n    }\n  }\n\n  walk(tree.root);\n  return matches;\n}\n\n/**\n * Collect all ancestor node IDs for each matched node so the tree\n * can auto-expand paths to search results.\n */\nexport function getAncestorIds(\n  tree: TreeState,\n  nodeIds: string[],\n): Set<string> {\n  const ancestors = new Set<string>();\n\n  for (const nodeId of nodeIds) {\n    let current = tree.nodesById.get(nodeId);\n    while (current && current.parentId) {\n      ancestors.add(current.parentId);\n      current = tree.nodesById.get(current.parentId);\n    }\n  }\n\n  return ancestors;\n}\n","import type { JsonValue } from \"./types\";\n\nexport type DiffType = \"added\" | \"removed\" | \"changed\";\n\nexport interface DiffEntry {\n  path: string;\n  type: DiffType;\n  oldValue?: JsonValue;\n  newValue?: JsonValue;\n}\n\nexport function computeDiff(\n  original: JsonValue,\n  current: JsonValue,\n  path = \"\",\n): DiffEntry[] {\n  const entries: DiffEntry[] = [];\n\n  if (original === current) {\n    return entries;\n  }\n\n  if (\n    original === null ||\n    current === null ||\n    typeof original !== typeof current ||\n    Array.isArray(original) !== Array.isArray(current)\n  ) {\n    if (path) {\n      entries.push({\n        path,\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    } else {\n      diffObject(original, current, path, entries);\n    }\n    return entries;\n  }\n\n  if (typeof original !== \"object\") {\n    if (original !== current) {\n      entries.push({\n        path: path || \"/\",\n        type: \"changed\",\n        oldValue: original,\n        newValue: current,\n      });\n    }\n    return entries;\n  }\n\n  if (Array.isArray(original) && Array.isArray(current)) {\n    const maxLen = Math.max(original.length, current.length);\n    for (let i = 0; i < maxLen; i++) {\n      const childPath = path ? `${path}/${i}` : `/${i}`;\n      if (i >= original.length) {\n        entries.push({ path: childPath, type: \"added\", newValue: current[i] });\n      } else if (i >= current.length) {\n        entries.push({\n          path: childPath,\n          type: \"removed\",\n          oldValue: original[i],\n        });\n      } else {\n        entries.push(...computeDiff(original[i], current[i], childPath));\n      }\n    }\n    return entries;\n  }\n\n  diffObject(original, current, path, entries);\n  return entries;\n}\n\nfunction diffObject(\n  original: JsonValue,\n  current: JsonValue,\n  path: string,\n  entries: DiffEntry[],\n) {\n  const origObj =\n    original !== null &&\n    typeof original === \"object\" &&\n    !Array.isArray(original)\n      ? (original as Record<string, JsonValue>)\n      : {};\n  const currObj =\n    current !== null && typeof current === \"object\" && !Array.isArray(current)\n      ? (current as Record<string, JsonValue>)\n      : {};\n\n  const allKeys = new Set([...Object.keys(origObj), ...Object.keys(currObj)]);\n\n  for (const key of allKeys) {\n    const childPath = path ? `${path}/${key}` : `/${key}`;\n    const inOriginal = key in origObj;\n    const inCurrent = key in currObj;\n\n    if (!inOriginal && inCurrent) {\n      entries.push({ path: childPath, type: \"added\", newValue: currObj[key] });\n    } else if (inOriginal && !inCurrent) {\n      entries.push({\n        path: childPath,\n        type: \"removed\",\n        oldValue: origObj[key],\n      });\n    } else {\n      entries.push(...computeDiff(origObj[key], currObj[key], childPath));\n    }\n  }\n}\n\nexport function getDiffPaths(entries: DiffEntry[]): Map<string, DiffType> {\n  const map = new Map<string, DiffType>();\n  for (const entry of entries) {\n    map.set(entry.path, entry.type);\n  }\n  return map;\n}\n"],"mappings":";AAUA,IAAI,SAAS;AAEN,SAAS,aAAqB;AACnC,SAAO,QAAQ,EAAE,MAAM;AACzB;AAEO,SAAS,iBAAuB;AACrC,WAAS;AACX;AAEO,SAAS,YAAY,OAA4B;AACtD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,SAAO,OAAO;AAChB;AAEO,SAAS,aACd,KACA,OACA,YACA,UACA,WACU;AACV,QAAM,KAAK,WAAW;AACtB,QAAM,OAAO,aAAa,GAAG,UAAU,IAAI,GAAG,KAAK,IAAI,GAAG;AAC1D,QAAM,OAAO,YAAY,KAAK;AAE9B,QAAM,OAAiB;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OACE,SAAS,YAAY,SAAS,UAC1B,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX;AAAA,EACF;AAEA,YAAU,IAAI,IAAI,IAAI;AAEtB,MAAI,SAAS,YAAY,UAAU,MAAM;AACvC,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,aACpC,aAAa,UAAU,IAAI,QAAQ,GAAG,MAAM,IAAI,SAAS;AAAA,IAC3D;AAAA,EACF,WAAW,SAAS,SAAS;AAC3B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,MAAM,IAAI,SAAS;AAAA,IACvD;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,SAAS,OAA6B;AACpD,QAAM,YAAY,oBAAI,IAAsB;AAE5C,QAAM,WAAW,YAAY,KAAK;AAClC,QAAM,OAAiB;AAAA,IACrB,IAAI,WAAW;AAAA,IACf,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OACE,aAAa,YAAY,aAAa,UAClC,SACC;AAAA,IACP,UAAU,CAAC;AAAA,IACX,UAAU;AAAA,EACZ;AAEA,YAAU,IAAI,KAAK,IAAI,IAAI;AAE3B,MAAI,aAAa,YAAY,UAAU,MAAM;AAC3C,UAAM,MAAM;AACZ,SAAK,WAAW,OAAO,KAAK,GAAG,EAAE;AAAA,MAAI,CAAC,QACpC,aAAa,KAAK,IAAI,GAAG,GAAG,IAAI,KAAK,IAAI,SAAS;AAAA,IACpD;AAAA,EACF,WAAW,aAAa,SAAS;AAC/B,UAAM,MAAM;AACZ,SAAK,WAAW,IAAI;AAAA,MAAI,CAAC,MAAM,UAC7B,aAAa,OAAO,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,SAAS;AAAA,IAC1D;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,UAAU;AAC3B;AAEO,SAAS,OAAO,MAA2B;AAChD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,UAAU;AACb,YAAM,MAAkB,CAAC;AACzB,iBAAW,SAAS,KAAK,UAAU;AACjC,YAAI,MAAM,GAAG,IAAI,OAAO,KAAK;AAAA,MAC/B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AACH,aAAO,KAAK,SAAS,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AAAA,IACnD;AACE,aAAO,KAAK;AAAA,EAChB;AACF;AAOO,SAAS,gBACd,MACA,QACA,YACA,aACU;AACV,QAAM,UAAU,aAAa,GAAG,UAAU,IAAI,MAAM,KAAK,IAAI,MAAM;AACnE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,KAAK;AAAA,IACL,MAAM;AAAA,IACN,UAAU;AAAA,IACV,UAAU,KAAK,SAAS;AAAA,MAAI,CAAC,OAAO,MAClC;AAAA,QACE;AAAA,QACA,KAAK,SAAS,UAAU,OAAO,CAAC,IAAI,MAAM;AAAA,QAC1C;AAAA,QACA,KAAK;AAAA,MACP;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,SACd,OACA,QACsB;AACtB,SAAO,MAAM,UAAU,IAAI,MAAM;AACnC;AAEO,SAAS,eACd,OACA,MACsB;AACtB,MAAI,SAAS,IAAK,QAAO,MAAM;AAE/B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAAU,MAAM;AAEpB,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO;AAC5D,QAAI,CAAC,MAAO,QAAO;AACnB,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAOO,SAAS,aACd,MACA,QACA,qBACS;AACT,MAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,SAAO,SAAS;AACd,QAAI,QAAQ,OAAO,oBAAqB,QAAO;AAC/C,cAAU,QAAQ,WACd,KAAK,UAAU,IAAI,QAAQ,QAAQ,IACnC;AAAA,EACN;AACA,SAAO;AACT;;;ACnLA,SAAS,WAAW,MAAuC;AACzD,QAAM,MAAM,oBAAI,IAAsB;AACtC,WAAS,KAAK,MAAgB;AAC5B,QAAI,IAAI,KAAK,IAAI,IAAI;AACrB,eAAW,SAAS,KAAK,SAAU,MAAK,KAAK;AAAA,EAC/C;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAEA,SAAS,eAAe,MAAgB,eAAiC;AACvE,QAAM,UAAU,gBACZ,GAAG,aAAa,IAAI,KAAK,GAAG,KAC5B,IAAI,KAAK,GAAG;AAChB,MAAI,KAAK,SAAS,WAAW,KAAK,SAAS,WAAW,EAAG,QAAO;AAChE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,eAAe,OAAO,OAAO,CAAC;AAAA,EACvE;AACF;AAMA,SAAS,gBACP,OACA,UACA,SACW;AACX,QAAM,QAAkB,CAAC;AACzB,MAAI,MAA4B,MAAM,UAAU,IAAI,QAAQ;AAC5D,SAAO,KAAK;AACV,UAAM,QAAQ,IAAI,EAAE;AACpB,UAAM,IAAI,WAAW,MAAM,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC3D;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,WAAS,eAAe,MAAgB,OAAyB;AAC/D,QAAI,UAAU,MAAM,SAAS,GAAG;AAC9B,aAAO,QAAQ,IAAI;AAAA,IACrB;AACA,UAAM,cAAc,MAAM,QAAQ,CAAC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,KAAK,SAAS;AAAA,QAAI,CAAC,UAC3B,MAAM,OAAO,cAAc,eAAe,OAAO,QAAQ,CAAC,IAAI;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,eAAe,MAAM,MAAM,CAAC;AAC5C,SAAO,EAAE,MAAM,SAAS,WAAW,WAAW,OAAO,EAAE;AACzD;AAEA,SAAS,qBAAqB,QAA4B;AACxD,MAAI,OAAO,SAAS,QAAS,QAAO;AACpC,QAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,OAAO,SAAS,IAAI,CAAC,OAAO,MAAM;AAC1C,YAAM,SAAS,OAAO,CAAC;AACvB,UAAI,MAAM,QAAQ,OAAQ,QAAO;AACjC,aAAO,eAAe,EAAE,GAAG,OAAO,KAAK,OAAO,GAAG,UAAU;AAAA,IAC7D,CAAC;AAAA,EACH;AACF;AAEO,SAAS,SACd,OACA,QACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,UAAU,YAAY,KAAK;AAEjC,MAAI,YAAY,YAAY,YAAY,SAAS;AAC/C,WAAO,gBAAgB,OAAO,QAAQ,CAAC,OAAO;AAAA,MAC5C,GAAG;AAAA,MACH,MAAM;AAAA,MACN;AAAA,MACA,UAAU,CAAC;AAAA,IACb,EAAE;AAAA,EACJ;AAEA,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,EAAE,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,KAAK;AAC/D,UAAM,YAAY,oBAAI,IAAsB;AAC5C,UAAM,UAAU;AAAA,MACd,EAAE;AAAA,MACF;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,GAAG,SAAS,IAAI,EAAE,GAAG;AAAA,EAChC,CAAC;AACH;AAEO,SAAS,OACd,OACA,QACA,QACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,UAAU,OAAO,SAAS,SAAU,QAAO;AAEhD,SAAO,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AAC3C,UAAM,aAAa,OAAO,SAAS,MAAM,KAAK,OAAO;AACrD,UAAM,UAAU,GAAG,UAAU,IAAI,MAAM;AACvC,UAAM,UAAoB,EAAE,GAAG,GAAG,KAAK,QAAQ,MAAM,QAAQ;AAC7D,QAAI,QAAQ,SAAS,SAAS,GAAG;AAC/B,cAAQ,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACvC,eAAe,OAAO,OAAO;AAAA,MAC/B;AAAA,IACF;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,SAAS,YACd,OACA,UACA,KACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,oBAAI,IAAI,CAAC;AACrE,WAAO,EAAE,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,UAAU,QAAQ,EAAE;AAAA,EACrD,CAAC;AACH;AAEO,SAAS,eACd,OACA,UACA,KACA,OACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW,aAAa,KAAK,OAAO,YAAY,EAAE,IAAI,oBAAI,IAAI,CAAC;AACrE,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,OAAO,GAAG,QAAQ;AACrC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,WACd,OACA,UACA,MACA,OACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,MAAM,EAAE,SAAS,UAAU,OAAO,KAAK,IAAI,KAAK;AACtD,UAAM,aAAa,gBAAgB,MAAM,KAAK,YAAY,EAAE,EAAE;AAC9D,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,OAAO,GAAG,UAAU;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,WAAW,OAAkB,QAA2B;AACtE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,SACd,OACA,QACA,aACA,OACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,YAAY,MAAM,UAAU,IAAI,KAAK,QAAQ;AACnD,QAAM,YAAY,MAAM,UAAU,IAAI,WAAW;AACjD,MAAI,CAAC,aAAa,CAAC,UAAW,QAAO;AAErC,QAAM,YAAY,OAAO,IAAI;AAE7B,QAAM,UAAU,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAC3D,UAAM,cAAc,EAAE,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM;AAC5D,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AAED,SAAO,gBAAgB,SAAS,aAAa,CAAC,MAAM;AAClD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,WAAW;AAAA,MACf,EAAE,SAAS,UAAU,OAAO,SAAS,EAAE,SAAS,MAAM,IAAI,KAAK;AAAA,MAC/D;AAAA,MACA;AAAA,MACA,EAAE;AAAA,MACF,oBAAI,IAAI;AAAA,IACV;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,WAAW,SAAS,YAAY;AACtC,gBAAY,OAAO,UAAU,GAAG,QAAQ;AACxC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,gBACd,OACA,UACA,WACA,SACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,UAAM,CAAC,IAAI,IAAI,YAAY,OAAO,WAAW,CAAC;AAC9C,gBAAY,OAAO,SAAS,GAAG,IAAI;AACnC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEO,SAAS,qBACd,OACA,UACA,UACA,iBACA,UACW;AACX,QAAM,SAAS,MAAM,UAAU,IAAI,QAAQ;AAC3C,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,WAAW,IAAI,IAAI,QAAQ;AAEjC,SAAO,gBAAgB,OAAO,UAAU,CAAC,MAAM;AAC7C,UAAM,YAAY,EAAE,SAAS,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;AAC9D,QAAI,YAAY,UAAU,UAAU,CAAC,MAAM,EAAE,OAAO,eAAe;AACnE,QAAI,cAAc,IAAI;AACpB,UAAI,SAAS,IAAI,eAAe,GAAG;AACjC,cAAM,UAAU,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,eAAe;AACpE,cAAM,UAAU,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3D,YAAI,aAAa,SAAS;AACxB,sBAAY,UAAU;AAAA,YACpB,CAAC,OAAO,QAAQ,IAAI,EAAE,EAAE,KAAK,MAAM;AAAA,UACrC;AACA,cAAI,cAAc,GAAI,aAAY,UAAU;AAAA,QAC9C,OAAO;AACL,sBAAY,UAAU;AAAA,YACpB,CAAC,OAAO,QAAQ,IAAI,EAAE,EAAE,KAAK,OAAO;AAAA,UACtC;AACA,cAAI,cAAc,GAAI,aAAY,UAAU;AAAA,QAC9C;AAAA,MACF,OAAO;AACL,oBAAY,aAAa,UAAU,UAAU,SAAS;AAAA,MACxD;AAAA,IACF,WAAW,aAAa,SAAS;AAC/B;AAAA,IACF;AACA,UAAM,QAAQ,SACX,IAAI,CAAC,OAAO,EAAE,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,EAC/C,OAAO,CAAC,MAAqB,MAAM,MAAS;AAC/C,UAAM,cAAc,CAAC,GAAG,SAAS;AACjC,gBAAY,OAAO,WAAW,GAAG,GAAG,KAAK;AACzC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;AAEA,SAAS,aAAa,SAAoB,SAA8B;AACtE,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,UAAI,YAAY,QAAQ,YAAY,OAAW,QAAO;AACtD,UAAI,OAAO,YAAY,SAAU,QAAO,KAAK,UAAU,OAAO;AAC9D,aAAO,OAAO,OAAO;AAAA,IACvB,KAAK,UAAU;AACb,YAAM,IAAI,OAAO,OAAO;AACxB,aAAO,MAAM,CAAC,IAAI,IAAI;AAAA,IACxB;AAAA,IACA,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,UACE,YAAY,QACZ,OAAO,YAAY,YACnB,CAAC,MAAM,QAAQ,OAAO;AAEtB,eAAO;AACT,UAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,cAAM,MAAiC,CAAC;AACxC,gBAAQ,QAAQ,CAAC,MAAM,MAAM;AAC3B,cAAI,OAAO,CAAC,CAAC,IAAI;AAAA,QACnB,CAAC;AACD,eAAO;AAAA,MACT;AACA,aAAO,CAAC;AAAA,IACV,KAAK;AACH,UAAI,MAAM,QAAQ,OAAO,EAAG,QAAO;AACnC,UAAI,YAAY,QAAQ,OAAO,YAAY;AACzC,eAAO,OAAO,OAAO,OAAO;AAC9B,aAAO,YAAY,QAAQ,YAAY,SAAY,CAAC,IAAI,CAAC,OAAO;AAAA,IAClE;AACE,aAAO;AAAA,EACX;AACF;AAEO,SAAS,WACd,OACA,QACA,SACW;AACX,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,eAAe,OAAO,IAAI;AAChC,QAAM,WAAW,aAAa,cAAc,OAAO;AACnD,SAAO,SAAS,OAAO,QAAQ,QAAQ;AACzC;AAEO,SAAS,cAAc,OAAkB,QAA2B;AACzE,QAAM,OAAO,MAAM,UAAU,IAAI,MAAM;AACvC,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO;AAEpC,QAAM,SAAS,MAAM,UAAU,IAAI,KAAK,QAAQ;AAChD,MAAI,CAAC,OAAQ,QAAO;AAEpB,QAAM,YAAY,OAAO,IAAI;AAE7B,SAAO,gBAAgB,OAAO,KAAK,UAAU,CAAC,MAAM;AAClD,UAAM,MAAM,EAAE,SAAS,UAAU,CAAC,MAAM,EAAE,OAAO,MAAM;AACvD,UAAM,aAAa,EAAE,SAAS,MAAM,KAAK,EAAE;AAC3C,UAAM,SAAS,EAAE,SAAS,UAAU,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG;AACjE,UAAM,WAAW;AAAA,MACf;AAAA,MACA,gBAAgB,SAAS;AAAA,MACzB;AAAA,MACA,EAAE;AAAA,MACF,oBAAI,IAAI;AAAA,IACV;AACA,UAAM,cAAc,CAAC,GAAG,EAAE,QAAQ;AAClC,gBAAY,OAAO,MAAM,GAAG,GAAG,QAAQ;AACvC,WAAO,qBAAqB,EAAE,GAAG,GAAG,UAAU,YAAY,CAAC;AAAA,EAC7D,CAAC;AACH;;;ACnXA,IAAM,cAAc;AAEb,IAAM,UAAN,MAAc;AAAA,EAAd;AACL,SAAQ,QAAqB,CAAC;AAC9B,SAAQ,SAAS;AAAA;AAAA,EAEjB,KAAK,OAAwB;AAC3B,SAAK,QAAQ,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,CAAC;AAChD,SAAK,MAAM,KAAK,KAAK;AACrB,QAAI,KAAK,MAAM,SAAS,aAAa;AACnC,WAAK,MAAM,MAAM;AAAA,IACnB,OAAO;AACL,WAAK;AAAA,IACP;AAAA,EACF;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,OAAyB;AACvB,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,SAAK;AACL,WAAO,KAAK,MAAM,KAAK,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,SAAS,KAAK,MAAM,SAAS;AAAA,EAC3C;AAAA,EAEA,IAAI,UAA4B;AAC9B,WAAO,KAAK,MAAM,KAAK,MAAM,KAAK;AAAA,EACpC;AACF;;;AClCA,IAAM,gBAAwC;AAAA,EAC5C,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,UAAU;AACZ;AAEA,IAAM,mBAAmB;AACzB,IAAM,cAAc,oBAAI,IAAwB;AAEhD,eAAe,YAAY,KAAyC;AAClE,MAAI,YAAY,IAAI,GAAG,GAAG;AACxB,WAAO,YAAY,IAAI,GAAG;AAAA,EAC5B;AACA,MAAI;AACF,UAAM,MAAM,MAAM,MAAM,GAAG;AAC3B,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAU,MAAM,IAAI,KAAK;AAC/B,QAAI,YAAY,QAAQ,kBAAkB;AACxC,YAAM,SAAS,YAAY,KAAK,EAAE,KAAK,EAAE;AACzC,UAAI,WAAW,OAAW,aAAY,OAAO,MAAM;AAAA,IACrD;AACA,gBAAY,IAAI,KAAK,MAAM;AAC3B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAsB,cACpB,MACA,UAC4B;AAC5B,MACE,SAAS,QACT,OAAO,SAAS,YAChB,CAAC,MAAM,QAAQ,IAAI,KACnB,OAAQ,KAAoB,SAAS,MAAM,UAC3C;AACA,UAAM,MAAO,KAAoB,SAAS;AAC1C,UAAM,SAAS,MAAM,YAAY,GAAG;AACpC,QAAI,OAAQ,QAAO;AAAA,EACrB;AAEA,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC1C,UAAM,WAAW,cAAc,IAAI;AACnC,QAAI,UAAU;AACZ,aAAO,YAAY,QAAQ;AAAA,IAC7B;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,eACP,MACA,SACgC;AAChC,MAAI,CAAC,QAAQ,WAAW,IAAI,EAAG,QAAO;AACtC,QAAM,WAAW,QAAQ,MAAM,CAAC,EAAE,MAAM,GAAG;AAC3C,MAAI,UAAmB;AAEvB,aAAW,OAAO,UAAU;AAC1B,QAAI,YAAY,QAAQ,OAAO,YAAY,SAAU,QAAO;AAC5D,cAAW,QAAoC,GAAG;AAAA,EACpD;AAEA,SAAO;AACT;AAMO,SAAS,WACd,MACA,MACA,SACoB;AACpB,QAAM,OAAO,WAAW,oBAAI,IAAY;AAExC,MAAI,KAAK,MAAM;AACb,QAAI,KAAK,IAAI,KAAK,IAAI,EAAG,QAAO;AAChC,SAAK,IAAI,KAAK,IAAI;AAClB,UAAM,WAAW,eAAe,MAAM,KAAK,IAAI;AAC/C,QAAI,UAAU;AACZ,aAAO,WAAW,UAAU,MAAM,IAAI;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO,WAAW,MAAM,MAAM,IAAI;AAAA,EACpC;AAEA,SAAO;AACT;AAEA,SAAS,WACP,MACA,MACA,SACoB;AACpB,QAAM,SAA6B,EAAE,GAAG,KAAK;AAC7C,SAAO,OAAO;AAEd,aAAW,OAAO,KAAK,OAAQ;AAC7B,UAAM,WAAW,WAAW,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC;AACvD,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY;AACvB,aAAO,aAAa,EAAE,GAAG,OAAO,YAAY,GAAG,SAAS,WAAW;AAAA,IACrE;AACA,QAAI,SAAS,UAAU;AACrB,aAAO,WAAW;AAAA,QAChB,GAAG,oBAAI,IAAI,CAAC,GAAI,OAAO,YAAY,CAAC,GAAI,GAAG,SAAS,QAAQ,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,QACE,SAAS,yBAAyB,UAClC,OAAO,yBAAyB,QAChC;AACA,aAAO,uBAAuB,SAAS;AAAA,IACzC;AACA,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,eAAe,CAAC,OAAO;AAClC,aAAO,cAAc,SAAS;AAChC,QAAI,SAAS,SAAS,CAAC,OAAO,MAAO,QAAO,QAAQ,SAAS;AAC7D,QAAI,SAAS,QAAQ,CAAC,OAAO,KAAM,QAAO,OAAO,SAAS;AAC1D,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,YAAY,UAAa,OAAO,YAAY;AACvD,aAAO,UAAU,SAAS;AAC5B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,cAAc,UAAa,OAAO,cAAc;AAC3D,aAAO,YAAY,SAAS;AAC9B,QAAI,SAAS,WAAW,CAAC,OAAO,QAAS,QAAO,UAAU,SAAS;AACnE,QAAI,SAAS,UAAU,CAAC,OAAO,OAAQ,QAAO,SAAS,SAAS;AAAA,EAClE;AAEA,SAAO;AACT;AAEO,SAAS,kBACd,QACA,MACA,YACgC;AAChC,QAAM,OAAO,cAAc;AAC3B,QAAM,WAAW,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO;AAC/C,MAAI,UAA0C,WAAW,QAAQ,IAAI;AAErE,aAAW,OAAO,UAAU;AAC1B,QAAI,CAAC,QAAS,QAAO;AACrB,cAAU,WAAW,SAAS,IAAI;AAElC,QAAI,QAAQ,aAAa,GAAG,GAAG;AAC7B,gBAAU,WAAW,QAAQ,WAAW,GAAG,GAAG,IAAI;AAClD;AAAA,IACF;AAEA,QAAI,QAAQ,mBAAmB;AAC7B,YAAM,QAAQ,OAAO,QAAQ,QAAQ,iBAAiB,EAAE;AAAA,QACtD,CAAC,CAAC,OAAO,MAAM;AACb,cAAI;AACF,mBAAO,IAAI,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,UACrC,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO;AACT,kBAAU,WAAW,MAAM,CAAC,GAAG,IAAI;AACnC;AAAA,MACF;AAAA,IACF;AAEA,QACE,QAAQ,wBACR,OAAO,QAAQ,yBAAyB,UACxC;AACA,gBAAU,WAAW,QAAQ,sBAAsB,IAAI;AACvD;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO;AACjB,UAAI,MAAM,QAAQ,QAAQ,KAAK,GAAG;AAChC,cAAM,MAAM,OAAO,GAAG;AACtB,YAAI,CAAC,MAAM,GAAG,KAAK,QAAQ,MAAM,GAAG,GAAG;AACrC,oBAAU,WAAW,QAAQ,MAAM,GAAG,GAAG,IAAI;AAC7C;AAAA,QACF;AAAA,MACF,OAAO;AACL,kBAAU,WAAW,QAAQ,OAAO,IAAI;AACxC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,SAAS,QAAQ,OAAO;AAClC,YAAM,WAAW,QAAQ,SAAS,QAAQ,SAAS,CAAC;AACpD,UAAI;AACJ,iBAAW,WAAW,UAAU;AAC9B,cAAM,WAAW,WAAW,SAAS,IAAI;AACzC,gBAAQ,kBAAkB,UAAU,KAAK,IAAI;AAC7C,YAAI,MAAO;AAAA,MACb;AACA,UAAI,OAAO;AACT,kBAAU;AACV;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,mBAAyB;AACvC,cAAY,MAAM;AACpB;;;ACrOA,SAAS,kBACP,UACA,YACS;AACT,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,QAAQ,MAAM,QAAQ,UAAU,IAAI,aAAa,CAAC,UAAU;AAElE,MAAI,aAAa,YAAY,MAAM,SAAS,SAAS,EAAG,QAAO;AAC/D,SAAO,MAAM,SAAS,QAAQ;AAChC;AAEA,IAAM,kBAA0C;AAAA,EAC9C,OAAO;AAAA,EACP,KAAK;AAAA,EACL,iBAAiB;AAAA,EACjB,aAAa;AAAA,EACb,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,UACE;AACJ;AAEO,SAAS,aACd,MACA,QACkB;AAClB,QAAM,SAAmB,CAAC;AAE1B,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,OAAO,MAAM,OAAO;AAAA,EAC/B;AAEA,MAAI,OAAO,QAAQ,CAAC,kBAAkB,KAAK,MAAM,OAAO,IAAI,GAAG;AAC7D,UAAM,WAAW,MAAM,QAAQ,OAAO,IAAI,IACtC,OAAO,KAAK,KAAK,KAAK,IACtB,OAAO;AACX,WAAO,KAAK,kBAAkB,QAAQ,WAAW,KAAK,IAAI,GAAG;AAAA,EAC/D;AAEA,MAAI,OAAO,QAAQ,OAAO,KAAK,SAAS,KAAK,KAAK,UAAU,QAAW;AACrE,UAAM,QAAQ,OAAO,KAAK;AAAA,MACxB,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,KAAK,KAAK;AAAA,IACxD;AACA,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,QACL,yBAAyB,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,UAAa,KAAK,UAAU,QAAW;AAC1D,QAAI,KAAK,UAAU,KAAK,KAAK,MAAM,KAAK,UAAU,OAAO,KAAK,GAAG;AAC/D,aAAO,KAAK,iBAAiB,KAAK,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,IAC7D;AAAA,EACF;AAEA,MAAI,OAAO,aAAa,KAAK,SAAS,YAAY,KAAK,SAAS,UAAU;AACxE,UAAM,YAAY,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AACzD,eAAW,OAAO,OAAO,UAAU;AACjC,UAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,eAAO,KAAK,8BAA8B,GAAG,GAAG;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,YAAY,UAAa,MAAM,OAAO,SAAS;AACxD,aAAO,KAAK,oBAAoB,OAAO,OAAO,EAAE;AAAA,IAClD;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,qBAAqB,QAAW;AACzC,YAAM,QACJ,OAAO,OAAO,qBAAqB,WAC/B,OAAO,mBACP,OAAO;AACb,UAAI,UAAU,UAAa,OAAO,OAAO;AACvC,eAAO,KAAK,mBAAmB,KAAK,EAAE;AAAA,MACxC;AAAA,IACF;AACA,QAAI,OAAO,eAAe,QAAW;AACnC,YAAM,YAAY,KAAK,IAAI,MAAM,OAAO,UAAU;AAClD,UACE,YAAY,SACZ,KAAK,IAAI,YAAY,OAAO,UAAU,IAAI,OAC1C;AACA,eAAO,KAAK,+BAA+B,OAAO,UAAU,EAAE;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,YAAY,OAAO,KAAK,UAAU,UAAU;AAC5D,UAAM,MAAM,KAAK;AACjB,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,oBAAoB,OAAO,SAAS,aAAa;AAAA,IAC/D;AACA,QAAI,OAAO,cAAc,UAAa,IAAI,SAAS,OAAO,WAAW;AACnE,aAAO,KAAK,mBAAmB,OAAO,SAAS,aAAa;AAAA,IAC9D;AACA,QAAI,OAAO,SAAS;AAClB,UAAI;AACF,YAAI,CAAC,IAAI,OAAO,OAAO,OAAO,EAAE,KAAK,GAAG,GAAG;AACzC,iBAAO,KAAK,uBAAuB,OAAO,OAAO,EAAE;AAAA,QACrD;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,QAAI,OAAO,UAAU,gBAAgB,OAAO,MAAM,GAAG;AACnD,UAAI,CAAC,gBAAgB,OAAO,MAAM,EAAE,KAAK,GAAG,GAAG;AAC7C,eAAO,KAAK,WAAW,OAAO,MAAM,SAAS;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,SAAS;AACzB,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,QAAQ,QAAQ;AAAA,IAC3D;AACA,QACE,OAAO,aAAa,UACpB,KAAK,SAAS,SAAS,OAAO,UAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,QAAQ,QAAQ;AAAA,IAC1D;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,UAAU;AAC1B,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,sBAAsB,OAAO,aAAa,aAAa;AAAA,IACrE;AACA,QACE,OAAO,kBAAkB,UACzB,KAAK,SAAS,SAAS,OAAO,eAC9B;AACA,aAAO,KAAK,qBAAqB,OAAO,aAAa,aAAa;AAAA,IACpE;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC9C;;;AChKO,SAAS,YAAY,MAAiB,OAA8B;AACzE,MAAI,CAAC,MAAM,KAAK,EAAG,QAAO,CAAC;AAC3B,QAAM,UAAyB,CAAC;AAChC,QAAM,QAAQ,MAAM,YAAY;AAEhC,WAAS,KAAK,MAAgB;AAC5B,QAAI,KAAK,OAAO,KAAK,IAAI,YAAY,EAAE,SAAS,KAAK,GAAG;AACtD,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,CAAC;AAAA,IAChD;AACA,QACE,KAAK,UAAU,UACf,KAAK,UAAU,QACf,OAAO,KAAK,KAAK,EAAE,YAAY,EAAE,SAAS,KAAK,GAC/C;AACA,cAAQ,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAClD;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAMO,SAAS,eACd,MACA,SACa;AACb,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,UAAU,SAAS;AAC5B,QAAI,UAAU,KAAK,UAAU,IAAI,MAAM;AACvC,WAAO,WAAW,QAAQ,UAAU;AAClC,gBAAU,IAAI,QAAQ,QAAQ;AAC9B,gBAAU,KAAK,UAAU,IAAI,QAAQ,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO;AACT;;;ACxCO,SAAS,YACd,UACA,SACA,OAAO,IACM;AACb,QAAM,UAAuB,CAAC;AAE9B,MAAI,aAAa,SAAS;AACxB,WAAO;AAAA,EACT;AAEA,MACE,aAAa,QACb,YAAY,QACZ,OAAO,aAAa,OAAO,WAC3B,MAAM,QAAQ,QAAQ,MAAM,MAAM,QAAQ,OAAO,GACjD;AACA,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,UAAU,SAAS,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,aAAa,UAAU;AAChC,QAAI,aAAa,SAAS;AACxB,cAAQ,KAAK;AAAA,QACX,MAAM,QAAQ;AAAA,QACd,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,QAAQ,KAAK,MAAM,QAAQ,OAAO,GAAG;AACrD,UAAM,SAAS,KAAK,IAAI,SAAS,QAAQ,QAAQ,MAAM;AACvD,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAM,YAAY,OAAO,GAAG,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAC/C,UAAI,KAAK,SAAS,QAAQ;AACxB,gBAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,CAAC,EAAE,CAAC;AAAA,MACvE,WAAW,KAAK,QAAQ,QAAQ;AAC9B,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,MAAM;AAAA,UACN,UAAU,SAAS,CAAC;AAAA,QACtB,CAAC;AAAA,MACH,OAAO;AACL,gBAAQ,KAAK,GAAG,YAAY,SAAS,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,CAAC;AAAA,MACjE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,aAAW,UAAU,SAAS,MAAM,OAAO;AAC3C,SAAO;AACT;AAEA,SAAS,WACP,UACA,SACA,MACA,SACA;AACA,QAAM,UACJ,aAAa,QACb,OAAO,aAAa,YACpB,CAAC,MAAM,QAAQ,QAAQ,IAClB,WACD,CAAC;AACP,QAAM,UACJ,YAAY,QAAQ,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IACpE,UACD,CAAC;AAEP,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC;AAE1E,aAAW,OAAO,SAAS;AACzB,UAAM,YAAY,OAAO,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG;AACnD,UAAM,aAAa,OAAO;AAC1B,UAAM,YAAY,OAAO;AAEzB,QAAI,CAAC,cAAc,WAAW;AAC5B,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,UAAU,QAAQ,GAAG,EAAE,CAAC;AAAA,IACzE,WAAW,cAAc,CAAC,WAAW;AACnC,cAAQ,KAAK;AAAA,QACX,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU,QAAQ,GAAG;AAAA,MACvB,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,KAAK,GAAG,YAAY,QAAQ,GAAG,GAAG,QAAQ,GAAG,GAAG,SAAS,CAAC;AAAA,IACpE;AAAA,EACF;AACF;AAEO,SAAS,aAAa,SAA6C;AACxE,QAAM,MAAM,oBAAI,IAAsB;AACtC,aAAW,SAAS,SAAS;AAC3B,QAAI,IAAI,MAAM,MAAM,MAAM,IAAI;AAAA,EAChC;AACA,SAAO;AACT;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@visual-json/core",
-  "version": "0.1.1",
+  "version": "0.3.0",
   "license": "Apache-2.0",
   "description": "Headless core for visual-json — the visual JSON editor. Schema-aware, embeddable, extensible.",
   "keywords": [
@@ -26,15 +26,15 @@
   "files": [
     "dist"
   ],
-  "devDependencies": {
-    "tsup": "^8.5.1",
-    "typescript": "5.9.3"
-  },
   "scripts": {
     "build": "tsup",
     "dev": "tsup --watch",
     "check-types": "tsc --noEmit",
     "lint": "eslint .",
     "format": "prettier --write \"**/*.{ts,tsx}\""
+  },
+  "devDependencies": {
+    "tsup": "^8.5.1",
+    "typescript": "5.9.3"
   }
-}
+}

package/LICENSE

@@ -1,201 +0,0 @@
-
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to the Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by the Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding any notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. Please also get an
-      "applicable copyright law appl" file (see
-      http://www.apache.org/legal/), if one is available.
-
-   Copyright 2025 visual-json contributors
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.