@voidhash/mimic 0.0.2 → 0.0.3

package/dist/primitives/Tree.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tree.mjs","names":["descendantIds: string[]","FractionalIndex.base62CharSet","FractionalIndex.generateKeyBetween","OperationDefinition.make","children: TreeNodeSnapshot<any>[]","Operation.fromDefinition","newState: TreeState<TRoot>","node","OperationPath.pathsOverlap","clientTokens","serverTokens","OperationPath.pathsEqual","OperationPath.isPrefix"],"sources":["../../src/primitives/Tree.ts"],"sourcesContent":["import { Effect, Schema } from \"effect\";\nimport * as OperationDefinition from \"../OperationDefinition\";\nimport * as Operation from \"../Operation\";\nimport * as OperationPath from \"../OperationPath\";\nimport * as ProxyEnvironment from \"../ProxyEnvironment\";\nimport * as Transform from \"../Transform\";\nimport * as FractionalIndex from \"../FractionalIndex\";\nimport type { Primitive, PrimitiveInternal, Validator, InferProxy, AnyPrimitive, InferSetInput, InferUpdateInput } from \"./shared\";\nimport { ValidationError, applyDefaults } from \"./shared\";\nimport { runValidators } from \"./shared\";\nimport type { AnyTreeNodePrimitive, InferTreeNodeType, InferTreeNodeDataState, InferTreeNodeChildren } from \"./TreeNode\";\nimport { InferStructState, StructSetInput, StructUpdateValue } from \"./Struct\";\nimport { StructPrimitive } from \"./Struct\";\n\n\n/**\n * A node in the tree state (flat storage format)\n */\nexport interface TreeNodeState {\n  readonly id: string;              // Unique node identifier (UUID)\n  readonly type: string;            // Node type discriminator\n  readonly parentId: string | null; // Parent node ID (null for root)\n  readonly pos: string;             // Fractional index for sibling ordering\n  readonly data: unknown;           // Node-specific data\n}\n\n/**\n * Typed node state for a specific node type\n */\nexport interface TypedTreeNodeState<TNode extends AnyTreeNodePrimitive> {\n  readonly id: string;\n  readonly type: InferTreeNodeType<TNode>;\n  readonly parentId: string | null;\n  readonly pos: string;\n  readonly data: InferTreeNodeDataState<TNode>;\n}\n\n/**\n * The state type for trees - a flat array of nodes\n */\nexport type TreeState<_TRoot extends AnyTreeNodePrimitive> = readonly TreeNodeState[];\n\n/**\n * Helper to get children sorted by position\n */\nconst getOrderedChildren = (\n  nodes: readonly TreeNodeState[],\n  parentId: string | null\n): TreeNodeState[] => {\n  return [...nodes]\n    .filter(n => n.parentId === parentId)\n    .sort((a, b) => a.pos < b.pos ? -1 : a.pos > b.pos ? 1 : 0);\n};\n\n/**\n * Get all descendant IDs of a node (recursive)\n */\nconst getDescendantIds = (\n  nodes: readonly TreeNodeState[],\n  nodeId: string\n): string[] => {\n  const children = nodes.filter(n => n.parentId === nodeId);\n  const descendantIds: string[] = [];\n  for (const child of children) {\n    descendantIds.push(child.id);\n    descendantIds.push(...getDescendantIds(nodes, child.id));\n  }\n  return descendantIds;\n};\n\n/**\n * Check if moving a node to a new parent would create a cycle\n */\nconst wouldCreateCycle = (\n  nodes: readonly TreeNodeState[],\n  nodeId: string,\n  newParentId: string | null\n): boolean => {\n  if (newParentId === null) return false;\n  if (newParentId === nodeId) return true;\n  \n  const descendants = getDescendantIds(nodes, nodeId);\n  return descendants.includes(newParentId);\n};\n\n/**\n * Generate a fractional position between two positions\n */\nconst generateTreePosBetween = (left: string | null, right: string | null): string => {\n  const charSet = FractionalIndex.base62CharSet();\n  return Effect.runSync(FractionalIndex.generateKeyBetween(left, right, charSet));\n};\n\n/**\n * Snapshot of a single node for UI rendering (data properties spread at node level)\n */\nexport type TreeNodeSnapshot<TNode extends AnyTreeNodePrimitive> = {\n  readonly id: string;\n  readonly type: InferTreeNodeType<TNode>;\n  readonly children: TreeNodeSnapshot<InferTreeNodeChildren<TNode>>[];\n} & InferTreeNodeDataState<TNode>;\n\n/**\n * Infer the snapshot type for a tree (recursive tree structure for UI)\n */\nexport type InferTreeSnapshot<T extends TreePrimitive<any>> =\n  T extends TreePrimitive<infer TRoot> ? TreeNodeSnapshot<TRoot> : never;\n\n/**\n * Helper type to infer the update value type from a TreeNode's data.\n * Uses StructUpdateValue directly to get field-level partial update semantics.\n * All fields are optional in update operations.\n */\nexport type TreeNodeUpdateValue<TNode extends AnyTreeNodePrimitive> = \n  TNode[\"data\"] extends StructPrimitive<infer TFields, any, any>\n    ? StructUpdateValue<TFields>\n    : InferUpdateInput<TNode[\"data\"]>;\n\n/**\n * Helper type to infer the input type for node data (respects field defaults).\n * Uses StructSetInput directly so that:\n * - Fields that are required AND have no default must be provided\n * - Fields that are optional OR have defaults can be omitted\n * \n * This bypasses the struct-level NeedsValue wrapper since tree inserts\n * always require a data object (even if empty for all-optional fields).\n */\nexport type TreeNodeDataSetInput<TNode extends AnyTreeNodePrimitive> = \n  TNode[\"data\"] extends StructPrimitive<infer TFields, any, any>\n    ? StructSetInput<TFields>\n    : InferSetInput<TNode[\"data\"]>;\n\n/**\n * Typed proxy for a specific node type - provides type-safe data access\n */\nexport interface TypedNodeProxy<TNode extends AnyTreeNodePrimitive> {\n  /** The node ID */\n  readonly id: string;\n  /** The node type */\n  readonly type: InferTreeNodeType<TNode>;\n  /** Access the node's data proxy */\n  readonly data: InferProxy<TNode[\"data\"]>;\n  /** Get the raw node state */\n  get(): TypedTreeNodeState<TNode>;\n  /** Updates only the specified data fields (partial update, handles nested structs recursively) */\n  update(value: TreeNodeUpdateValue<TNode>): void;\n}\n\n/**\n * Node proxy with type narrowing capabilities\n */\nexport interface TreeNodeProxyBase<_TRoot extends AnyTreeNodePrimitive> {\n  /** The node ID */\n  readonly id: string;\n  /** The node type (string) */\n  readonly type: string;\n  /** Type guard - narrows the proxy to a specific node type */\n  is<TNode extends AnyTreeNodePrimitive>(\n    nodeType: TNode\n  ): this is TypedNodeProxy<TNode>;\n  /** Type assertion - returns typed proxy (throws if wrong type) */\n  as<TNode extends AnyTreeNodePrimitive>(\n    nodeType: TNode\n  ): TypedNodeProxy<TNode>;\n  /** Get the raw node state */\n  get(): TreeNodeState;\n}\n\n/**\n * Proxy for accessing and modifying tree nodes\n */\nexport interface TreeProxy<TRoot extends AnyTreeNodePrimitive> {\n  /** Gets the entire tree state (flat array of nodes) */\n  get(): TreeState<TRoot>;\n  \n  /** Replaces the entire tree */\n  set(nodes: TreeState<TRoot>): void;\n  \n  /** Gets the root node state */\n  root(): TypedTreeNodeState<TRoot> | undefined;\n  \n  /** Gets ordered children states of a parent (null for root's children) */\n  children(parentId: string | null): TreeNodeState[];\n  \n  /** Gets a node proxy by ID with type narrowing capabilities */\n  node(id: string): TreeNodeProxyBase<TRoot> | undefined;\n  \n  /** Insert a new node as the first child (applies defaults for node data) */\n  insertFirst<TNode extends AnyTreeNodePrimitive>(\n    parentId: string | null,\n    nodeType: TNode,\n    data: TreeNodeDataSetInput<TNode>\n  ): string;\n  \n  /** Insert a new node as the last child (applies defaults for node data) */\n  insertLast<TNode extends AnyTreeNodePrimitive>(\n    parentId: string | null,\n    nodeType: TNode,\n    data: TreeNodeDataSetInput<TNode>\n  ): string;\n  \n  /** Insert a new node at a specific index among siblings (applies defaults for node data) */\n  insertAt<TNode extends AnyTreeNodePrimitive>(\n    parentId: string | null,\n    index: number,\n    nodeType: TNode,\n    data: TreeNodeDataSetInput<TNode>\n  ): string;\n  \n  /** Insert a new node after a sibling (applies defaults for node data) */\n  insertAfter<TNode extends AnyTreeNodePrimitive>(\n    siblingId: string,\n    nodeType: TNode,\n    data: TreeNodeDataSetInput<TNode>\n  ): string;\n  \n  /** Insert a new node before a sibling (applies defaults for node data) */\n  insertBefore<TNode extends AnyTreeNodePrimitive>(\n    siblingId: string,\n    nodeType: TNode,\n    data: TreeNodeDataSetInput<TNode>\n  ): string;\n  \n  /** Remove a node and all its descendants */\n  remove(id: string): void;\n  \n  /** Move a node to a new parent at a specific index */\n  move(nodeId: string, newParentId: string | null, toIndex: number): void;\n  \n  /** Move a node after a sibling */\n  moveAfter(nodeId: string, siblingId: string): void;\n  \n  /** Move a node before a sibling */\n  moveBefore(nodeId: string, siblingId: string): void;\n  \n  /** Move a node to be the first child of a parent */\n  moveToFirst(nodeId: string, newParentId: string | null): void;\n  \n  /** Move a node to be the last child of a parent */\n  moveToLast(nodeId: string, newParentId: string | null): void;\n  \n  /** Returns a typed proxy for a specific node's data */\n  at<TNode extends AnyTreeNodePrimitive>(\n    id: string,\n    nodeType: TNode\n  ): InferProxy<TNode[\"data\"]>;\n  \n  /** Updates only the specified data fields of a node (partial update) */\n  updateAt<TNode extends AnyTreeNodePrimitive>(\n    id: string,\n    nodeType: TNode,\n    value: TreeNodeUpdateValue<TNode>\n  ): void;\n  \n  /** Convert tree to a nested snapshot for UI rendering */\n  toSnapshot(): TreeNodeSnapshot<TRoot> | undefined;\n}\n\ninterface TreePrimitiveSchema<TRoot extends AnyTreeNodePrimitive> {\n  readonly required: boolean;\n  readonly defaultValue: TreeState<TRoot> | undefined;\n  readonly root: TRoot;\n  readonly validators: readonly Validator<TreeState<TRoot>>[];\n}\n\n/** Input type for tree set() - tree state */\nexport type TreeSetInput<TRoot extends AnyTreeNodePrimitive> = TreeState<TRoot>;\n\n/** Input type for tree update() - same as set() for trees */\nexport type TreeUpdateInput<TRoot extends AnyTreeNodePrimitive> = TreeState<TRoot>;\n\nexport class TreePrimitive<TRoot extends AnyTreeNodePrimitive, TRequired extends boolean = false, THasDefault extends boolean = false>\n  implements Primitive<TreeState<TRoot>, TreeProxy<TRoot>, TRequired, THasDefault, TreeSetInput<TRoot>, TreeUpdateInput<TRoot>>\n{\n  readonly _tag = \"TreePrimitive\" as const;\n  readonly _State!: TreeState<TRoot>;\n  readonly _Proxy!: TreeProxy<TRoot>;\n  readonly _TRequired!: TRequired;\n  readonly _THasDefault!: THasDefault;\n  readonly TSetInput!: TreeSetInput<TRoot>;\n  readonly TUpdateInput!: TreeUpdateInput<TRoot>;\n\n  private readonly _schema: TreePrimitiveSchema<TRoot>;\n  private _nodeTypeRegistry: Map<string, AnyTreeNodePrimitive> | undefined;\n\n  private readonly _opDefinitions = {\n    set: OperationDefinition.make({\n      kind: \"tree.set\" as const,\n      payload: Schema.Unknown,\n      target: Schema.Unknown,\n      apply: (payload) => payload,\n    }),\n    insert: OperationDefinition.make({\n      kind: \"tree.insert\" as const,\n      payload: Schema.Unknown,\n      target: Schema.Unknown,\n      apply: (payload) => payload,\n    }),\n    remove: OperationDefinition.make({\n      kind: \"tree.remove\" as const,\n      payload: Schema.Unknown,\n      target: Schema.Unknown,\n      apply: (payload) => payload,\n    }),\n    move: OperationDefinition.make({\n      kind: \"tree.move\" as const,\n      payload: Schema.Unknown,\n      target: Schema.Unknown,\n      apply: (payload) => payload,\n    }),\n  };\n\n  constructor(schema: TreePrimitiveSchema<TRoot>) {\n    this._schema = schema;\n  }\n\n  /** Mark this tree as required */\n  required(): TreePrimitive<TRoot, true, THasDefault> {\n    return new TreePrimitive({\n      ...this._schema,\n      required: true,\n    });\n  }\n\n  /** Set a default value for this tree */\n  default(defaultValue: TreeState<TRoot>): TreePrimitive<TRoot, TRequired, true> {\n    return new TreePrimitive({\n      ...this._schema,\n      defaultValue,\n    });\n  }\n\n  /** Get the root node type */\n  get root(): TRoot {\n    return this._schema.root;\n  }\n\n  /** Add a custom validation rule */\n  refine(fn: (value: TreeState<TRoot>) => boolean, message: string): TreePrimitive<TRoot, TRequired, THasDefault> {\n    return new TreePrimitive({\n      ...this._schema,\n      validators: [...this._schema.validators, { validate: fn, message }],\n    });\n  }\n\n  /**\n   * Build a registry of all node types reachable from root\n   */\n  private _buildNodeTypeRegistry(): Map<string, AnyTreeNodePrimitive> {\n    if (this._nodeTypeRegistry !== undefined) {\n      return this._nodeTypeRegistry;\n    }\n\n    const registry = new Map<string, AnyTreeNodePrimitive>();\n    const visited = new Set<string>();\n\n    const visit = (node: AnyTreeNodePrimitive) => {\n      if (visited.has(node.type)) return;\n      visited.add(node.type);\n      registry.set(node.type, node);\n\n      for (const child of node.children) {\n        visit(child);\n      }\n    };\n\n    visit(this._schema.root);\n    this._nodeTypeRegistry = registry;\n    return registry;\n  }\n\n  /**\n   * Get a node type primitive by its type string\n   */\n  private _getNodeTypePrimitive(type: string): AnyTreeNodePrimitive {\n    const registry = this._buildNodeTypeRegistry();\n    const nodeType = registry.get(type);\n    if (!nodeType) {\n      throw new ValidationError(`Unknown node type: ${type}`);\n    }\n    return nodeType;\n  }\n\n  /**\n   * Validate that a node type can be a child of a parent node type\n   */\n  private _validateChildType(\n    parentType: string | null,\n    childType: string\n  ): void {\n    if (parentType === null) {\n      // Root level - child must be the root type\n      if (childType !== this._schema.root.type) {\n        throw new ValidationError(\n          `Root node must be of type \"${this._schema.root.type}\", got \"${childType}\"`\n        );\n      }\n      return;\n    }\n\n    const parentNodePrimitive = this._getNodeTypePrimitive(parentType);\n    if (!parentNodePrimitive.isChildAllowed(childType)) {\n      const allowedTypes = parentNodePrimitive.children.map(c => c.type).join(\", \");\n      throw new ValidationError(\n        `Node type \"${childType}\" is not allowed as a child of \"${parentType}\". ` +\n        `Allowed types: ${allowedTypes || \"none\"}`\n      );\n    }\n  }\n\n  readonly _internal: PrimitiveInternal<TreeState<TRoot>, TreeProxy<TRoot>> = {\n    createProxy: (\n      env: ProxyEnvironment.ProxyEnvironment,\n      operationPath: OperationPath.OperationPath\n    ): TreeProxy<TRoot> => {\n      // Helper to get current state\n      const getCurrentState = (): TreeState<TRoot> => {\n        const state = env.getState(operationPath) as TreeState<TRoot> | undefined;\n        return state ?? [];\n      };\n\n      // Helper to get parent type from state\n      const getParentType = (parentId: string | null): string | null => {\n        if (parentId === null) return null;\n        const state = getCurrentState();\n        const parent = state.find(n => n.id === parentId);\n        return parent?.type ?? null;\n      };\n\n      // Helper to create a node proxy with type narrowing\n      const createNodeProxy = (nodeState: TreeNodeState): TreeNodeProxyBase<TRoot> => {\n        return {\n          id: nodeState.id,\n          type: nodeState.type,\n          \n          is: <TNode extends AnyTreeNodePrimitive>(\n            nodeType: TNode\n          ): boolean => {\n            return nodeState.type === nodeType.type;\n          },\n          \n          as: <TNode extends AnyTreeNodePrimitive>(\n            nodeType: TNode\n          ): TypedNodeProxy<TNode> => {\n            if (nodeState.type !== nodeType.type) {\n              throw new ValidationError(\n                `Node is of type \"${nodeState.type}\", not \"${nodeType.type}\"`\n              );\n            }\n            const nodePath = operationPath.append(nodeState.id);\n            const dataProxy = nodeType.data._internal.createProxy(env, nodePath) as InferProxy<TNode[\"data\"]>;\n            return {\n              id: nodeState.id,\n              type: nodeType.type as InferTreeNodeType<TNode>,\n              data: dataProxy,\n              get: () => nodeState as TypedTreeNodeState<TNode>,\n              update: (value: TreeNodeUpdateValue<TNode>) => {\n                // Delegate to the data proxy's update method\n                (dataProxy as { update: (v: unknown) => void }).update(value);\n              },\n            };\n          },\n          \n          get: () => nodeState,\n        } as TreeNodeProxyBase<TRoot>;\n      };\n\n      // Helper to build recursive snapshot\n      const buildSnapshot = (\n        nodeId: string,\n        nodes: readonly TreeNodeState[]\n      ): TreeNodeSnapshot<TRoot> | undefined => {\n        const node = nodes.find(n => n.id === nodeId);\n        if (!node) return undefined;\n\n        const childNodes = getOrderedChildren(nodes, nodeId);\n        const children: TreeNodeSnapshot<any>[] = [];\n        for (const child of childNodes) {\n          const childSnapshot = buildSnapshot(child.id, nodes);\n          if (childSnapshot) {\n            children.push(childSnapshot);\n          }\n        }\n\n        // Spread data properties at node level\n        return {\n          id: node.id,\n          type: node.type,\n          ...(node.data as object),\n          children,\n        } as unknown as TreeNodeSnapshot<TRoot>;\n      };\n\n      return {\n        get: (): TreeState<TRoot> => {\n          return getCurrentState();\n        },\n\n        set: (nodes: TreeState<TRoot>) => {\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.set, nodes)\n          );\n        },\n\n        root: (): TypedTreeNodeState<TRoot> | undefined => {\n          const state = getCurrentState();\n          const rootNode = state.find(n => n.parentId === null);\n          return rootNode as TypedTreeNodeState<TRoot> | undefined;\n        },\n\n        children: (parentId: string | null): TreeNodeState[] => {\n          const state = getCurrentState();\n          return getOrderedChildren(state, parentId);\n        },\n\n        node: (id: string): TreeNodeProxyBase<TRoot> | undefined => {\n          const state = getCurrentState();\n          const nodeState = state.find(n => n.id === id);\n          if (!nodeState) return undefined;\n          return createNodeProxy(nodeState);\n        },\n\n        insertFirst: <TNode extends AnyTreeNodePrimitive>(\n          parentId: string | null,\n          nodeType: TNode,\n          data: TreeNodeDataSetInput<TNode>\n        ): string => {\n          const state = getCurrentState();\n          const siblings = getOrderedChildren(state, parentId);\n          const firstPos = siblings.length > 0 ? siblings[0]!.pos : null;\n          const pos = generateTreePosBetween(null, firstPos);\n          const id = env.generateId();\n\n          // Validate parent exists (if not root)\n          if (parentId !== null && !state.find(n => n.id === parentId)) {\n            throw new ValidationError(`Parent node not found: ${parentId}`);\n          }\n\n          // Validate child type is allowed\n          const parentType = getParentType(parentId);\n          this._validateChildType(parentType, nodeType.type);\n\n          // Validate single root\n          if (parentId === null && state.some(n => n.parentId === null)) {\n            throw new ValidationError(\"Tree already has a root node\");\n          }\n\n          // Apply defaults to node data\n          const mergedData = applyDefaults(nodeType.data as AnyPrimitive, data as Partial<InferTreeNodeDataState<TNode>>) as InferTreeNodeDataState<TNode>;\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.insert, {\n              id,\n              type: nodeType.type,\n              parentId,\n              pos,\n              data: mergedData,\n            })\n          );\n\n          return id;\n        },\n\n        insertLast: <TNode extends AnyTreeNodePrimitive>(\n          parentId: string | null,\n          nodeType: TNode,\n          data: TreeNodeDataSetInput<TNode>\n        ): string => {\n          const state = getCurrentState();\n          const siblings = getOrderedChildren(state, parentId);\n          const lastPos = siblings.length > 0 ? siblings[siblings.length - 1]!.pos : null;\n          const pos = generateTreePosBetween(lastPos, null);\n          const id = env.generateId();\n\n          // Validate parent exists (if not root)\n          if (parentId !== null && !state.find(n => n.id === parentId)) {\n            throw new ValidationError(`Parent node not found: ${parentId}`);\n          }\n\n          // Validate child type is allowed\n          const parentType = getParentType(parentId);\n          this._validateChildType(parentType, nodeType.type);\n\n          // Validate single root\n          if (parentId === null && state.some(n => n.parentId === null)) {\n            throw new ValidationError(\"Tree already has a root node\");\n          }\n\n          // Apply defaults to node data\n          const mergedData = applyDefaults(nodeType.data as AnyPrimitive, data as Partial<InferTreeNodeDataState<TNode>>) as InferTreeNodeDataState<TNode>;\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.insert, {\n              id,\n              type: nodeType.type,\n              parentId,\n              pos,\n              data: mergedData,\n            })\n          );\n\n          return id;\n        },\n\n        insertAt: <TNode extends AnyTreeNodePrimitive>(\n          parentId: string | null,\n          index: number,\n          nodeType: TNode,\n          data: TreeNodeDataSetInput<TNode>\n        ): string => {\n          const state = getCurrentState();\n          const siblings = getOrderedChildren(state, parentId);\n          const clampedIndex = Math.max(0, Math.min(index, siblings.length));\n          const leftPos = clampedIndex > 0 && siblings[clampedIndex - 1] ? siblings[clampedIndex - 1]!.pos : null;\n          const rightPos = clampedIndex < siblings.length && siblings[clampedIndex] ? siblings[clampedIndex]!.pos : null;\n          const pos = generateTreePosBetween(leftPos, rightPos);\n          const id = env.generateId();\n\n          // Validate parent exists (if not root)\n          if (parentId !== null && !state.find(n => n.id === parentId)) {\n            throw new ValidationError(`Parent node not found: ${parentId}`);\n          }\n\n          // Validate child type is allowed\n          const parentType = getParentType(parentId);\n          this._validateChildType(parentType, nodeType.type);\n\n          // Validate single root\n          if (parentId === null && state.some(n => n.parentId === null)) {\n            throw new ValidationError(\"Tree already has a root node\");\n          }\n\n          // Apply defaults to node data\n          const mergedData = applyDefaults(nodeType.data as AnyPrimitive, data as Partial<InferTreeNodeDataState<TNode>>) as InferTreeNodeDataState<TNode>;\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.insert, {\n              id,\n              type: nodeType.type,\n              parentId,\n              pos,\n              data: mergedData,\n            })\n          );\n\n          return id;\n        },\n\n        insertAfter: <TNode extends AnyTreeNodePrimitive>(\n          siblingId: string,\n          nodeType: TNode,\n          data: TreeNodeDataSetInput<TNode>\n        ): string => {\n          const state = getCurrentState();\n          const sibling = state.find(n => n.id === siblingId);\n          if (!sibling) {\n            throw new ValidationError(`Sibling node not found: ${siblingId}`);\n          }\n\n          const parentId = sibling.parentId;\n          const siblings = getOrderedChildren(state, parentId);\n          const siblingIndex = siblings.findIndex(n => n.id === siblingId);\n          const nextSibling = siblings[siblingIndex + 1];\n          const pos = generateTreePosBetween(sibling.pos, nextSibling?.pos ?? null);\n          const id = env.generateId();\n\n          // Validate child type is allowed\n          const parentType = getParentType(parentId);\n          this._validateChildType(parentType, nodeType.type);\n\n          // Apply defaults to node data\n          const mergedData = applyDefaults(nodeType.data as AnyPrimitive, data as Partial<InferTreeNodeDataState<TNode>>) as InferTreeNodeDataState<TNode>;\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.insert, {\n              id,\n              type: nodeType.type,\n              parentId,\n              pos,\n              data: mergedData,\n            })\n          );\n\n          return id;\n        },\n\n        insertBefore: <TNode extends AnyTreeNodePrimitive>(\n          siblingId: string,\n          nodeType: TNode,\n          data: TreeNodeDataSetInput<TNode>\n        ): string => {\n          const state = getCurrentState();\n          const sibling = state.find(n => n.id === siblingId);\n          if (!sibling) {\n            throw new ValidationError(`Sibling node not found: ${siblingId}`);\n          }\n\n          const parentId = sibling.parentId;\n          const siblings = getOrderedChildren(state, parentId);\n          const siblingIndex = siblings.findIndex(n => n.id === siblingId);\n          const prevSibling = siblings[siblingIndex - 1];\n          const pos = generateTreePosBetween(prevSibling?.pos ?? null, sibling.pos);\n          const id = env.generateId();\n\n          // Validate child type is allowed\n          const parentType = getParentType(parentId);\n          this._validateChildType(parentType, nodeType.type);\n\n          // Apply defaults to node data\n          const mergedData = applyDefaults(nodeType.data as AnyPrimitive, data as Partial<InferTreeNodeDataState<TNode>>) as InferTreeNodeDataState<TNode>;\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.insert, {\n              id,\n              type: nodeType.type,\n              parentId,\n              pos,\n              data: mergedData,\n            })\n          );\n\n          return id;\n        },\n\n        remove: (id: string) => {\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.remove, { id })\n          );\n        },\n\n        move: (nodeId: string, newParentId: string | null, toIndex: number) => {\n          const state = getCurrentState();\n          const node = state.find(n => n.id === nodeId);\n          if (!node) {\n            throw new ValidationError(`Node not found: ${nodeId}`);\n          }\n\n          // Validate parent exists (if not moving to root)\n          if (newParentId !== null && !state.find(n => n.id === newParentId)) {\n            throw new ValidationError(`Parent node not found: ${newParentId}`);\n          }\n\n          // Validate no cycle\n          if (wouldCreateCycle(state, nodeId, newParentId)) {\n            throw new ValidationError(\"Move would create a cycle in the tree\");\n          }\n\n          // Validate child type is allowed in new parent\n          const newParentType = newParentId === null ? null : state.find(n => n.id === newParentId)?.type ?? null;\n          this._validateChildType(newParentType, node.type);\n\n          // Validate not moving root to a parent\n          if (node.parentId === null && newParentId !== null) {\n            throw new ValidationError(\"Cannot move root node to have a parent\");\n          }\n\n          // Calculate new position among new siblings (excluding self)\n          const siblings = getOrderedChildren(state, newParentId).filter(n => n.id !== nodeId);\n          const clampedIndex = Math.max(0, Math.min(toIndex, siblings.length));\n          const leftPos = clampedIndex > 0 && siblings[clampedIndex - 1] ? siblings[clampedIndex - 1]!.pos : null;\n          const rightPos = clampedIndex < siblings.length && siblings[clampedIndex] ? siblings[clampedIndex]!.pos : null;\n          const pos = generateTreePosBetween(leftPos, rightPos);\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.move, {\n              id: nodeId,\n              parentId: newParentId,\n              pos,\n            })\n          );\n        },\n\n        moveAfter: (nodeId: string, siblingId: string) => {\n          const state = getCurrentState();\n          const node = state.find(n => n.id === nodeId);\n          const sibling = state.find(n => n.id === siblingId);\n          \n          if (!node) {\n            throw new ValidationError(`Node not found: ${nodeId}`);\n          }\n          if (!sibling) {\n            throw new ValidationError(`Sibling node not found: ${siblingId}`);\n          }\n\n          const newParentId = sibling.parentId;\n\n          // Validate no cycle\n          if (wouldCreateCycle(state, nodeId, newParentId)) {\n            throw new ValidationError(\"Move would create a cycle in the tree\");\n          }\n\n          // Validate child type is allowed in new parent\n          const newParentType = newParentId === null ? null : state.find(n => n.id === newParentId)?.type ?? null;\n          this._validateChildType(newParentType, node.type);\n\n          // Validate not moving root to a parent\n          if (node.parentId === null && newParentId !== null) {\n            throw new ValidationError(\"Cannot move root node to have a parent\");\n          }\n\n          const siblings = getOrderedChildren(state, newParentId).filter(n => n.id !== nodeId);\n          const siblingIndex = siblings.findIndex(n => n.id === siblingId);\n          const nextSibling = siblings[siblingIndex + 1];\n          const pos = generateTreePosBetween(sibling.pos, nextSibling?.pos ?? null);\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.move, {\n              id: nodeId,\n              parentId: newParentId,\n              pos,\n            })\n          );\n        },\n\n        moveBefore: (nodeId: string, siblingId: string) => {\n          const state = getCurrentState();\n          const node = state.find(n => n.id === nodeId);\n          const sibling = state.find(n => n.id === siblingId);\n          \n          if (!node) {\n            throw new ValidationError(`Node not found: ${nodeId}`);\n          }\n          if (!sibling) {\n            throw new ValidationError(`Sibling node not found: ${siblingId}`);\n          }\n\n          const newParentId = sibling.parentId;\n\n          // Validate no cycle\n          if (wouldCreateCycle(state, nodeId, newParentId)) {\n            throw new ValidationError(\"Move would create a cycle in the tree\");\n          }\n\n          // Validate child type is allowed in new parent\n          const newParentType = newParentId === null ? null : state.find(n => n.id === newParentId)?.type ?? null;\n          this._validateChildType(newParentType, node.type);\n\n          // Validate not moving root to a parent\n          if (node.parentId === null && newParentId !== null) {\n            throw new ValidationError(\"Cannot move root node to have a parent\");\n          }\n\n          const siblings = getOrderedChildren(state, newParentId).filter(n => n.id !== nodeId);\n          const siblingIndex = siblings.findIndex(n => n.id === siblingId);\n          const prevSibling = siblings[siblingIndex - 1];\n          const pos = generateTreePosBetween(prevSibling?.pos ?? null, sibling.pos);\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.move, {\n              id: nodeId,\n              parentId: newParentId,\n              pos,\n            })\n          );\n        },\n\n        moveToFirst: (nodeId: string, newParentId: string | null) => {\n          const state = getCurrentState();\n          const node = state.find(n => n.id === nodeId);\n          \n          if (!node) {\n            throw new ValidationError(`Node not found: ${nodeId}`);\n          }\n\n          // Validate parent exists (if not moving to root)\n          if (newParentId !== null && !state.find(n => n.id === newParentId)) {\n            throw new ValidationError(`Parent node not found: ${newParentId}`);\n          }\n\n          // Validate no cycle\n          if (wouldCreateCycle(state, nodeId, newParentId)) {\n            throw new ValidationError(\"Move would create a cycle in the tree\");\n          }\n\n          // Validate child type is allowed in new parent\n          const newParentType = newParentId === null ? null : state.find(n => n.id === newParentId)?.type ?? null;\n          this._validateChildType(newParentType, node.type);\n\n          // Validate not moving root to a parent\n          if (node.parentId === null && newParentId !== null) {\n            throw new ValidationError(\"Cannot move root node to have a parent\");\n          }\n\n          const siblings = getOrderedChildren(state, newParentId).filter(n => n.id !== nodeId);\n          const firstPos = siblings.length > 0 ? siblings[0]!.pos : null;\n          const pos = generateTreePosBetween(null, firstPos);\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.move, {\n              id: nodeId,\n              parentId: newParentId,\n              pos,\n            })\n          );\n        },\n\n        moveToLast: (nodeId: string, newParentId: string | null) => {\n          const state = getCurrentState();\n          const node = state.find(n => n.id === nodeId);\n          \n          if (!node) {\n            throw new ValidationError(`Node not found: ${nodeId}`);\n          }\n\n          // Validate parent exists (if not moving to root)\n          if (newParentId !== null && !state.find(n => n.id === newParentId)) {\n            throw new ValidationError(`Parent node not found: ${newParentId}`);\n          }\n\n          // Validate no cycle\n          if (wouldCreateCycle(state, nodeId, newParentId)) {\n            throw new ValidationError(\"Move would create a cycle in the tree\");\n          }\n\n          // Validate child type is allowed in new parent\n          const newParentType = newParentId === null ? null : state.find(n => n.id === newParentId)?.type ?? null;\n          this._validateChildType(newParentType, node.type);\n\n          // Validate not moving root to a parent\n          if (node.parentId === null && newParentId !== null) {\n            throw new ValidationError(\"Cannot move root node to have a parent\");\n          }\n\n          const siblings = getOrderedChildren(state, newParentId).filter(n => n.id !== nodeId);\n          const lastPos = siblings.length > 0 ? siblings[siblings.length - 1]!.pos : null;\n          const pos = generateTreePosBetween(lastPos, null);\n\n          env.addOperation(\n            Operation.fromDefinition(operationPath, this._opDefinitions.move, {\n              id: nodeId,\n              parentId: newParentId,\n              pos,\n            })\n          );\n        },\n\n        at: <TNode extends AnyTreeNodePrimitive>(\n          id: string,\n          nodeType: TNode\n        ): InferProxy<TNode[\"data\"]> => {\n          // Get the node to verify its type\n          const state = getCurrentState();\n          const node = state.find(n => n.id === id);\n          if (!node) {\n            throw new ValidationError(`Node not found: ${id}`);\n          }\n          if (node.type !== nodeType.type) {\n            throw new ValidationError(\n              `Node is of type \"${node.type}\", not \"${nodeType.type}\"`\n            );\n          }\n\n          const nodePath = operationPath.append(id);\n          return nodeType.data._internal.createProxy(env, nodePath) as InferProxy<TNode[\"data\"]>;\n        },\n\n        updateAt: <TNode extends AnyTreeNodePrimitive>(\n          id: string,\n          nodeType: TNode,\n          value: TreeNodeUpdateValue<TNode>\n        ): void => {\n          // Get the node to verify its type\n          const state = getCurrentState();\n          const node = state.find(n => n.id === id);\n          if (!node) {\n            throw new ValidationError(`Node not found: ${id}`);\n          }\n          if (node.type !== nodeType.type) {\n            throw new ValidationError(\n              `Node is of type \"${node.type}\", not \"${nodeType.type}\"`\n            );\n          }\n\n          const nodePath = operationPath.append(id);\n          const dataProxy = nodeType.data._internal.createProxy(env, nodePath);\n          // Delegate to the data proxy's update method\n          (dataProxy as { update: (v: unknown) => void }).update(value);\n        },\n\n        toSnapshot: (): TreeNodeSnapshot<TRoot> | undefined => {\n          const state = getCurrentState();\n          const rootNode = state.find(n => n.parentId === null);\n          if (!rootNode) return undefined;\n          return buildSnapshot(rootNode.id, state);\n        },\n      };\n    },\n\n    applyOperation: (\n      state: TreeState<TRoot> | undefined,\n      operation: Operation.Operation<any, any, any>\n    ): TreeState<TRoot> => {\n      const path = operation.path;\n      const tokens = path.toTokens().filter((t: string) => t !== \"\");\n      const currentState = state ?? [];\n\n      let newState: TreeState<TRoot>;\n\n      // If path is empty, this is a tree-level operation\n      if (tokens.length === 0) {\n        switch (operation.kind) {\n          case \"tree.set\": {\n            const payload = operation.payload;\n            if (!globalThis.Array.isArray(payload)) {\n              throw new ValidationError(`TreePrimitive.set requires an array payload`);\n            }\n            newState = payload as TreeState<TRoot>;\n            break;\n          }\n          case \"tree.insert\": {\n            const { id, type, parentId, pos, data } = operation.payload as {\n              id: string;\n              type: string;\n              parentId: string | null;\n              pos: string;\n              data: unknown;\n            };\n            newState = [...currentState, { id, type, parentId, pos, data }] as TreeState<TRoot>;\n            break;\n          }\n          case \"tree.remove\": {\n            const { id } = operation.payload as { id: string };\n            // Get all descendants to remove\n            const descendantIds = getDescendantIds(currentState, id);\n            const idsToRemove = new Set([id, ...descendantIds]);\n            newState = currentState.filter(node => !idsToRemove.has(node.id));\n            break;\n          }\n          case \"tree.move\": {\n            const { id, parentId, pos } = operation.payload as {\n              id: string;\n              parentId: string | null;\n              pos: string;\n            };\n            newState = currentState.map(node =>\n              node.id === id ? { ...node, parentId, pos } : node\n            ) as TreeState<TRoot>;\n            break;\n          }\n          default:\n            throw new ValidationError(`TreePrimitive cannot apply operation of kind: ${operation.kind}`);\n        }\n      } else {\n        // Otherwise, delegate to the node's data primitive\n        const nodeId = tokens[0]!;\n        const nodeIndex = currentState.findIndex(node => node.id === nodeId);\n        \n        if (nodeIndex === -1) {\n          throw new ValidationError(`Tree node not found with ID: ${nodeId}`);\n        }\n\n        const node = currentState[nodeIndex]!;\n        const nodeTypePrimitive = this._getNodeTypePrimitive(node.type);\n        const remainingPath = path.shift();\n        const nodeOperation = {\n          ...operation,\n          path: remainingPath,\n        };\n\n        const newData = nodeTypePrimitive.data._internal.applyOperation(\n          node.data as InferStructState<any> | undefined,\n          nodeOperation\n        );\n\n        const mutableState = [...currentState];\n        mutableState[nodeIndex] = { ...node, data: newData };\n        newState = mutableState as TreeState<TRoot>;\n      }\n\n      // Run validators on the new state\n      runValidators(newState, this._schema.validators);\n\n      return newState;\n    },\n\n    getInitialState: (): TreeState<TRoot> | undefined => {\n      if (this._schema.defaultValue !== undefined) {\n        return this._schema.defaultValue;\n      }\n\n      // Automatically create a root node with default data\n      const rootNodeType = this._schema.root;\n      const rootData = rootNodeType.data._internal.getInitialState() ?? {};\n      const rootId = crypto.randomUUID();\n      const rootPos = generateTreePosBetween(null, null);\n\n      return [{\n        id: rootId,\n        type: rootNodeType.type,\n        parentId: null,\n        pos: rootPos,\n        data: rootData,\n      }] as TreeState<TRoot>;\n    },\n\n    transformOperation: (\n      clientOp: Operation.Operation<any, any, any>,\n      serverOp: Operation.Operation<any, any, any>\n    ): Transform.TransformResult => {\n      const clientPath = clientOp.path;\n      const serverPath = serverOp.path;\n\n      // If paths don't overlap at all, no transformation needed\n      if (!OperationPath.pathsOverlap(clientPath, serverPath)) {\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // Handle tree.remove from server - check if client is operating on removed node or descendants\n      if (serverOp.kind === \"tree.remove\") {\n        const removedId = (serverOp.payload as { id: string }).id;\n        const clientTokens = clientPath.toTokens().filter((t: string) => t !== \"\");\n        const serverTokens = serverPath.toTokens().filter((t: string) => t !== \"\");\n\n        // Check if client operation targets the removed node or uses it\n        if (clientOp.kind === \"tree.move\") {\n          const movePayload = clientOp.payload as { id: string; parentId: string | null };\n          // If moving the removed node or moving to a removed parent\n          if (movePayload.id === removedId || movePayload.parentId === removedId) {\n            return { type: \"noop\" };\n          }\n        }\n\n        if (clientOp.kind === \"tree.insert\") {\n          const insertPayload = clientOp.payload as { parentId: string | null };\n          // If inserting into a removed parent\n          if (insertPayload.parentId === removedId) {\n            return { type: \"noop\" };\n          }\n        }\n\n        // Check if client is operating on a node that was removed\n        if (clientTokens.length > serverTokens.length) {\n          const nodeId = clientTokens[serverTokens.length];\n          if (nodeId === removedId) {\n            return { type: \"noop\" };\n          }\n        }\n      }\n\n      // Both inserting - no conflict (fractional indexing handles order)\n      if (serverOp.kind === \"tree.insert\" && clientOp.kind === \"tree.insert\") {\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // Both moving same node - client wins\n      if (serverOp.kind === \"tree.move\" && clientOp.kind === \"tree.move\") {\n        const serverMoveId = (serverOp.payload as { id: string }).id;\n        const clientMoveId = (clientOp.payload as { id: string }).id;\n\n        if (serverMoveId === clientMoveId) {\n          return { type: \"transformed\", operation: clientOp };\n        }\n        // Different nodes - no conflict\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // For same exact path: client wins (last-write-wins)\n      if (OperationPath.pathsEqual(clientPath, serverPath)) {\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // If server set entire tree and client is operating on a node\n      if (serverOp.kind === \"tree.set\" && OperationPath.isPrefix(serverPath, clientPath)) {\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // Delegate to node data primitive for nested operations\n      const clientTokens = clientPath.toTokens().filter((t: string) => t !== \"\");\n      const serverTokens = serverPath.toTokens().filter((t: string) => t !== \"\");\n\n      // Both operations target children of this tree\n      if (clientTokens.length > 0 && serverTokens.length > 0) {\n        const clientNodeId = clientTokens[0];\n        const serverNodeId = serverTokens[0];\n\n        // If operating on different nodes, no conflict\n        if (clientNodeId !== serverNodeId) {\n          return { type: \"transformed\", operation: clientOp };\n        }\n\n        // Same node - would need to delegate to node's data primitive\n        // For simplicity, let client win\n        return { type: \"transformed\", operation: clientOp };\n      }\n\n      // Default: no transformation needed\n      return { type: \"transformed\", operation: clientOp };\n    },\n  };\n}\n\n/** Options for creating a Tree primitive */\nexport interface TreeOptions<TRoot extends AnyTreeNodePrimitive> {\n  /** The root node type */\n  readonly root: TRoot;\n}\n\n/** Creates a new TreePrimitive with the given root node type */\nexport const Tree = <TRoot extends AnyTreeNodePrimitive>(\n  options: TreeOptions<TRoot>\n): TreePrimitive<TRoot, false, false> =>\n  new TreePrimitive({\n    required: false,\n    defaultValue: undefined,\n    root: options.root,\n    validators: [],\n  });\n"],"mappings":";;;;;;;;;;;;;AA6CA,MAAM,sBACJ,OACA,aACoB;AACpB,QAAO,CAAC,GAAG,MAAM,CACd,QAAO,MAAK,EAAE,aAAa,SAAS,CACpC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,EAAE,MAAM,EAAE,MAAM,IAAI,EAAE;;;;;AAM/D,MAAM,oBACJ,OACA,WACa;CACb,MAAM,WAAW,MAAM,QAAO,MAAK,EAAE,aAAa,OAAO;CACzD,MAAMA,gBAA0B,EAAE;AAClC,MAAK,MAAM,SAAS,UAAU;AAC5B,gBAAc,KAAK,MAAM,GAAG;AAC5B,gBAAc,KAAK,GAAG,iBAAiB,OAAO,MAAM,GAAG,CAAC;;AAE1D,QAAO;;;;;AAMT,MAAM,oBACJ,OACA,QACA,gBACY;AACZ,KAAI,gBAAgB,KAAM,QAAO;AACjC,KAAI,gBAAgB,OAAQ,QAAO;AAGnC,QADoB,iBAAiB,OAAO,OAAO,CAChC,SAAS,YAAY;;;;;AAM1C,MAAM,0BAA0B,MAAqB,UAAiC;CACpF,MAAM,UAAUC,eAA+B;AAC/C,QAAO,OAAO,QAAQC,mBAAmC,MAAM,OAAO,QAAQ,CAAC;;AAqLjF,IAAa,gBAAb,MAAa,cAEb;CAuCE,YAAY,QAAoC;wBAtCvC,QAAO;wBACP;wBACA;wBACA;wBACA;wBACA;wBACA;wBAEQ;wBACT;wBAES,kBAAiB;GAChC,KAAKC,KAAyB;IAC5B,MAAM;IACN,SAAS,OAAO;IAChB,QAAQ,OAAO;IACf,QAAQ,YAAY;IACrB,CAAC;GACF,QAAQA,KAAyB;IAC/B,MAAM;IACN,SAAS,OAAO;IAChB,QAAQ,OAAO;IACf,QAAQ,YAAY;IACrB,CAAC;GACF,QAAQA,KAAyB;IAC/B,MAAM;IACN,SAAS,OAAO;IAChB,QAAQ,OAAO;IACf,QAAQ,YAAY;IACrB,CAAC;GACF,MAAMA,KAAyB;IAC7B,MAAM;IACN,SAAS,OAAO;IAChB,QAAQ,OAAO;IACf,QAAQ,YAAY;IACrB,CAAC;GACH;wBAoGQ,aAAmE;GAC1E,cACE,KACA,kBACqB;IAErB,MAAM,wBAA0C;KAC9C,MAAM,QAAQ,IAAI,SAAS,cAAc;AACzC,YAAO,6CAAS,EAAE;;IAIpB,MAAM,iBAAiB,aAA2C;;AAChE,SAAI,aAAa,KAAM,QAAO;KAE9B,MAAM,SADQ,iBAAiB,CACV,MAAK,MAAK,EAAE,OAAO,SAAS;AACjD,4EAAO,OAAQ,2DAAQ;;IAIzB,MAAM,mBAAmB,cAAuD;AAC9E,YAAO;MACL,IAAI,UAAU;MACd,MAAM,UAAU;MAEhB,KACE,aACY;AACZ,cAAO,UAAU,SAAS,SAAS;;MAGrC,KACE,aAC0B;AAC1B,WAAI,UAAU,SAAS,SAAS,KAC9B,OAAM,IAAI,gBACR,oBAAoB,UAAU,KAAK,UAAU,SAAS,KAAK,GAC5D;OAEH,MAAM,WAAW,cAAc,OAAO,UAAU,GAAG;OACnD,MAAM,YAAY,SAAS,KAAK,UAAU,YAAY,KAAK,SAAS;AACpE,cAAO;QACL,IAAI,UAAU;QACd,MAAM,SAAS;QACf,MAAM;QACN,WAAW;QACX,SAAS,UAAsC;AAE7C,SAAC,UAA+C,OAAO,MAAM;;QAEhE;;MAGH,WAAW;MACZ;;IAIH,MAAM,iBACJ,QACA,UACwC;KACxC,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;AAC7C,SAAI,CAAC,KAAM,QAAO;KAElB,MAAM,aAAa,mBAAmB,OAAO,OAAO;KACpD,MAAMC,WAAoC,EAAE;AAC5C,UAAK,MAAM,SAAS,YAAY;MAC9B,MAAM,gBAAgB,cAAc,MAAM,IAAI,MAAM;AACpD,UAAI,cACF,UAAS,KAAK,cAAc;;AAKhC;MACE,IAAI,KAAK;MACT,MAAM,KAAK;QACP,KAAK,aACT;;AAIJ,WAAO;KACL,WAA6B;AAC3B,aAAO,iBAAiB;;KAG1B,MAAM,UAA4B;AAChC,UAAI,aACFC,eAAyB,eAAe,KAAK,eAAe,KAAK,MAAM,CACxE;;KAGH,YAAmD;AAGjD,aAFc,iBAAiB,CACR,MAAK,MAAK,EAAE,aAAa,KAAK;;KAIvD,WAAW,aAA6C;AAEtD,aAAO,mBADO,iBAAiB,EACE,SAAS;;KAG5C,OAAO,OAAqD;MAE1D,MAAM,YADQ,iBAAiB,CACP,MAAK,MAAK,EAAE,OAAO,GAAG;AAC9C,UAAI,CAAC,UAAW,QAAO;AACvB,aAAO,gBAAgB,UAAU;;KAGnC,cACE,UACA,UACA,SACW;MACX,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,WAAW,mBAAmB,OAAO,SAAS;MAEpD,MAAM,MAAM,uBAAuB,MADlB,SAAS,SAAS,IAAI,SAAS,GAAI,MAAM,KACR;MAClD,MAAM,KAAK,IAAI,YAAY;AAG3B,UAAI,aAAa,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,SAAS,CAC1D,OAAM,IAAI,gBAAgB,0BAA0B,WAAW;MAIjE,MAAM,aAAa,cAAc,SAAS;AAC1C,WAAK,mBAAmB,YAAY,SAAS,KAAK;AAGlD,UAAI,aAAa,QAAQ,MAAM,MAAK,MAAK,EAAE,aAAa,KAAK,CAC3D,OAAM,IAAI,gBAAgB,+BAA+B;MAI3D,MAAM,aAAa,cAAc,SAAS,MAAsB,KAA+C;AAE/G,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ;OAClE;OACA,MAAM,SAAS;OACf;OACA;OACA,MAAM;OACP,CAAC,CACH;AAED,aAAO;;KAGT,aACE,UACA,UACA,SACW;MACX,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,WAAW,mBAAmB,OAAO,SAAS;MAEpD,MAAM,MAAM,uBADI,SAAS,SAAS,IAAI,SAAS,SAAS,SAAS,GAAI,MAAM,MAC/B,KAAK;MACjD,MAAM,KAAK,IAAI,YAAY;AAG3B,UAAI,aAAa,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,SAAS,CAC1D,OAAM,IAAI,gBAAgB,0BAA0B,WAAW;MAIjE,MAAM,aAAa,cAAc,SAAS;AAC1C,WAAK,mBAAmB,YAAY,SAAS,KAAK;AAGlD,UAAI,aAAa,QAAQ,MAAM,MAAK,MAAK,EAAE,aAAa,KAAK,CAC3D,OAAM,IAAI,gBAAgB,+BAA+B;MAI3D,MAAM,aAAa,cAAc,SAAS,MAAsB,KAA+C;AAE/G,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ;OAClE;OACA,MAAM,SAAS;OACf;OACA;OACA,MAAM;OACP,CAAC,CACH;AAED,aAAO;;KAGT,WACE,UACA,OACA,UACA,SACW;MACX,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,WAAW,mBAAmB,OAAO,SAAS;MACpD,MAAM,eAAe,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,SAAS,OAAO,CAAC;MAGlE,MAAM,MAAM,uBAFI,eAAe,KAAK,SAAS,eAAe,KAAK,SAAS,eAAe,GAAI,MAAM,MAClF,eAAe,SAAS,UAAU,SAAS,gBAAgB,SAAS,cAAe,MAAM,KACrD;MACrD,MAAM,KAAK,IAAI,YAAY;AAG3B,UAAI,aAAa,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,SAAS,CAC1D,OAAM,IAAI,gBAAgB,0BAA0B,WAAW;MAIjE,MAAM,aAAa,cAAc,SAAS;AAC1C,WAAK,mBAAmB,YAAY,SAAS,KAAK;AAGlD,UAAI,aAAa,QAAQ,MAAM,MAAK,MAAK,EAAE,aAAa,KAAK,CAC3D,OAAM,IAAI,gBAAgB,+BAA+B;MAI3D,MAAM,aAAa,cAAc,SAAS,MAAsB,KAA+C;AAE/G,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ;OAClE;OACA,MAAM,SAAS;OACf;OACA;OACA,MAAM;OACP,CAAC,CACH;AAED,aAAO;;KAGT,cACE,WACA,UACA,SACW;;MACX,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,UAAU,MAAM,MAAK,MAAK,EAAE,OAAO,UAAU;AACnD,UAAI,CAAC,QACH,OAAM,IAAI,gBAAgB,2BAA2B,YAAY;MAGnE,MAAM,WAAW,QAAQ;MACzB,MAAM,WAAW,mBAAmB,OAAO,SAAS;MAEpD,MAAM,cAAc,SADC,SAAS,WAAU,MAAK,EAAE,OAAO,UAAU,GACpB;MAC5C,MAAM,MAAM,uBAAuB,QAAQ,mFAAK,YAAa,kEAAO,KAAK;MACzE,MAAM,KAAK,IAAI,YAAY;MAG3B,MAAM,aAAa,cAAc,SAAS;AAC1C,WAAK,mBAAmB,YAAY,SAAS,KAAK;MAGlD,MAAM,aAAa,cAAc,SAAS,MAAsB,KAA+C;AAE/G,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ;OAClE;OACA,MAAM,SAAS;OACf;OACA;OACA,MAAM;OACP,CAAC,CACH;AAED,aAAO;;KAGT,eACE,WACA,UACA,SACW;;MACX,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,UAAU,MAAM,MAAK,MAAK,EAAE,OAAO,UAAU;AACnD,UAAI,CAAC,QACH,OAAM,IAAI,gBAAgB,2BAA2B,YAAY;MAGnE,MAAM,WAAW,QAAQ;MACzB,MAAM,WAAW,mBAAmB,OAAO,SAAS;MAEpD,MAAM,cAAc,SADC,SAAS,WAAU,MAAK,EAAE,OAAO,UAAU,GACpB;MAC5C,MAAM,MAAM,qGAAuB,YAAa,kEAAO,MAAM,QAAQ,IAAI;MACzE,MAAM,KAAK,IAAI,YAAY;MAG3B,MAAM,aAAa,cAAc,SAAS;AAC1C,WAAK,mBAAmB,YAAY,SAAS,KAAK;MAGlD,MAAM,aAAa,cAAc,SAAS,MAAsB,KAA+C;AAE/G,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ;OAClE;OACA,MAAM,SAAS;OACf;OACA;OACA,MAAM;OACP,CAAC,CACH;AAED,aAAO;;KAGT,SAAS,OAAe;AACtB,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,QAAQ,EAAE,IAAI,CAAC,CAC5E;;KAGH,OAAO,QAAgB,aAA4B,YAAoB;;MACrE,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;AAC7C,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,SAAS;AAIxD,UAAI,gBAAgB,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,CAChE,OAAM,IAAI,gBAAgB,0BAA0B,cAAc;AAIpE,UAAI,iBAAiB,OAAO,QAAQ,YAAY,CAC9C,OAAM,IAAI,gBAAgB,wCAAwC;MAIpE,MAAM,gBAAgB,gBAAgB,OAAO,0CAAO,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,4DAAE,mEAAQ;AACnG,WAAK,mBAAmB,eAAe,KAAK,KAAK;AAGjD,UAAI,KAAK,aAAa,QAAQ,gBAAgB,KAC5C,OAAM,IAAI,gBAAgB,yCAAyC;MAIrE,MAAM,WAAW,mBAAmB,OAAO,YAAY,CAAC,QAAO,MAAK,EAAE,OAAO,OAAO;MACpF,MAAM,eAAe,KAAK,IAAI,GAAG,KAAK,IAAI,SAAS,SAAS,OAAO,CAAC;MAGpE,MAAM,MAAM,uBAFI,eAAe,KAAK,SAAS,eAAe,KAAK,SAAS,eAAe,GAAI,MAAM,MAClF,eAAe,SAAS,UAAU,SAAS,gBAAgB,SAAS,cAAe,MAAM,KACrD;AAErD,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,MAAM;OAChE,IAAI;OACJ,UAAU;OACV;OACD,CAAC,CACH;;KAGH,YAAY,QAAgB,cAAsB;;MAChD,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;MAC7C,MAAM,UAAU,MAAM,MAAK,MAAK,EAAE,OAAO,UAAU;AAEnD,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,SAAS;AAExD,UAAI,CAAC,QACH,OAAM,IAAI,gBAAgB,2BAA2B,YAAY;MAGnE,MAAM,cAAc,QAAQ;AAG5B,UAAI,iBAAiB,OAAO,QAAQ,YAAY,CAC9C,OAAM,IAAI,gBAAgB,wCAAwC;MAIpE,MAAM,gBAAgB,gBAAgB,OAAO,4CAAO,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,8DAAE,qEAAQ;AACnG,WAAK,mBAAmB,eAAe,KAAK,KAAK;AAGjD,UAAI,KAAK,aAAa,QAAQ,gBAAgB,KAC5C,OAAM,IAAI,gBAAgB,yCAAyC;MAGrE,MAAM,WAAW,mBAAmB,OAAO,YAAY,CAAC,QAAO,MAAK,EAAE,OAAO,OAAO;MAEpF,MAAM,cAAc,SADC,SAAS,WAAU,MAAK,EAAE,OAAO,UAAU,GACpB;MAC5C,MAAM,MAAM,uBAAuB,QAAQ,oFAAK,YAAa,oEAAO,KAAK;AAEzE,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,MAAM;OAChE,IAAI;OACJ,UAAU;OACV;OACD,CAAC,CACH;;KAGH,aAAa,QAAgB,cAAsB;;MACjD,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;MAC7C,MAAM,UAAU,MAAM,MAAK,MAAK,EAAE,OAAO,UAAU;AAEnD,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,SAAS;AAExD,UAAI,CAAC,QACH,OAAM,IAAI,gBAAgB,2BAA2B,YAAY;MAGnE,MAAM,cAAc,QAAQ;AAG5B,UAAI,iBAAiB,OAAO,QAAQ,YAAY,CAC9C,OAAM,IAAI,gBAAgB,wCAAwC;MAIpE,MAAM,gBAAgB,gBAAgB,OAAO,4CAAO,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,8DAAE,qEAAQ;AACnG,WAAK,mBAAmB,eAAe,KAAK,KAAK;AAGjD,UAAI,KAAK,aAAa,QAAQ,gBAAgB,KAC5C,OAAM,IAAI,gBAAgB,yCAAyC;MAGrE,MAAM,WAAW,mBAAmB,OAAO,YAAY,CAAC,QAAO,MAAK,EAAE,OAAO,OAAO;MAEpF,MAAM,cAAc,SADC,SAAS,WAAU,MAAK,EAAE,OAAO,UAAU,GACpB;MAC5C,MAAM,MAAM,sGAAuB,YAAa,oEAAO,MAAM,QAAQ,IAAI;AAEzE,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,MAAM;OAChE,IAAI;OACJ,UAAU;OACV;OACD,CAAC,CACH;;KAGH,cAAc,QAAgB,gBAA+B;;MAC3D,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;AAE7C,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,SAAS;AAIxD,UAAI,gBAAgB,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,CAChE,OAAM,IAAI,gBAAgB,0BAA0B,cAAc;AAIpE,UAAI,iBAAiB,OAAO,QAAQ,YAAY,CAC9C,OAAM,IAAI,gBAAgB,wCAAwC;MAIpE,MAAM,gBAAgB,gBAAgB,OAAO,4CAAO,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,8DAAE,qEAAQ;AACnG,WAAK,mBAAmB,eAAe,KAAK,KAAK;AAGjD,UAAI,KAAK,aAAa,QAAQ,gBAAgB,KAC5C,OAAM,IAAI,gBAAgB,yCAAyC;MAGrE,MAAM,WAAW,mBAAmB,OAAO,YAAY,CAAC,QAAO,MAAK,EAAE,OAAO,OAAO;MAEpF,MAAM,MAAM,uBAAuB,MADlB,SAAS,SAAS,IAAI,SAAS,GAAI,MAAM,KACR;AAElD,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,MAAM;OAChE,IAAI;OACJ,UAAU;OACV;OACD,CAAC,CACH;;KAGH,aAAa,QAAgB,gBAA+B;;MAC1D,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,OAAO,MAAM,MAAK,MAAK,EAAE,OAAO,OAAO;AAE7C,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,SAAS;AAIxD,UAAI,gBAAgB,QAAQ,CAAC,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,CAChE,OAAM,IAAI,gBAAgB,0BAA0B,cAAc;AAIpE,UAAI,iBAAiB,OAAO,QAAQ,YAAY,CAC9C,OAAM,IAAI,gBAAgB,wCAAwC;MAIpE,MAAM,gBAAgB,gBAAgB,OAAO,4CAAO,MAAM,MAAK,MAAK,EAAE,OAAO,YAAY,8DAAE,qEAAQ;AACnG,WAAK,mBAAmB,eAAe,KAAK,KAAK;AAGjD,UAAI,KAAK,aAAa,QAAQ,gBAAgB,KAC5C,OAAM,IAAI,gBAAgB,yCAAyC;MAGrE,MAAM,WAAW,mBAAmB,OAAO,YAAY,CAAC,QAAO,MAAK,EAAE,OAAO,OAAO;MAEpF,MAAM,MAAM,uBADI,SAAS,SAAS,IAAI,SAAS,SAAS,SAAS,GAAI,MAAM,MAC/B,KAAK;AAEjD,UAAI,aACFA,eAAyB,eAAe,KAAK,eAAe,MAAM;OAChE,IAAI;OACJ,UAAU;OACV;OACD,CAAC,CACH;;KAGH,KACE,IACA,aAC8B;MAG9B,MAAM,OADQ,iBAAiB,CACZ,MAAK,MAAK,EAAE,OAAO,GAAG;AACzC,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,KAAK;AAEpD,UAAI,KAAK,SAAS,SAAS,KACzB,OAAM,IAAI,gBACR,oBAAoB,KAAK,KAAK,UAAU,SAAS,KAAK,GACvD;MAGH,MAAM,WAAW,cAAc,OAAO,GAAG;AACzC,aAAO,SAAS,KAAK,UAAU,YAAY,KAAK,SAAS;;KAG3D,WACE,IACA,UACA,UACS;MAGT,MAAM,OADQ,iBAAiB,CACZ,MAAK,MAAK,EAAE,OAAO,GAAG;AACzC,UAAI,CAAC,KACH,OAAM,IAAI,gBAAgB,mBAAmB,KAAK;AAEpD,UAAI,KAAK,SAAS,SAAS,KACzB,OAAM,IAAI,gBACR,oBAAoB,KAAK,KAAK,UAAU,SAAS,KAAK,GACvD;MAGH,MAAM,WAAW,cAAc,OAAO,GAAG;AAGzC,MAFkB,SAAS,KAAK,UAAU,YAAY,KAAK,SAAS,CAEpB,OAAO,MAAM;;KAG/D,kBAAuD;MACrD,MAAM,QAAQ,iBAAiB;MAC/B,MAAM,WAAW,MAAM,MAAK,MAAK,EAAE,aAAa,KAAK;AACrD,UAAI,CAAC,SAAU,QAAO;AACtB,aAAO,cAAc,SAAS,IAAI,MAAM;;KAE3C;;GAGH,iBACE,OACA,cACqB;IACrB,MAAM,OAAO,UAAU;IACvB,MAAM,SAAS,KAAK,UAAU,CAAC,QAAQ,MAAc,MAAM,GAAG;IAC9D,MAAM,eAAe,6CAAS,EAAE;IAEhC,IAAIC;AAGJ,QAAI,OAAO,WAAW,EACpB,SAAQ,UAAU,MAAlB;KACE,KAAK,YAAY;MACf,MAAM,UAAU,UAAU;AAC1B,UAAI,CAAC,WAAW,MAAM,QAAQ,QAAQ,CACpC,OAAM,IAAI,gBAAgB,8CAA8C;AAE1E,iBAAW;AACX;;KAEF,KAAK,eAAe;MAClB,MAAM,EAAE,IAAI,MAAM,UAAU,KAAK,SAAS,UAAU;AAOpD,iBAAW,CAAC,GAAG,cAAc;OAAE;OAAI;OAAM;OAAU;OAAK;OAAM,CAAC;AAC/D;;KAEF,KAAK,eAAe;MAClB,MAAM,EAAE,OAAO,UAAU;MAEzB,MAAM,gBAAgB,iBAAiB,cAAc,GAAG;MACxD,MAAM,cAAc,IAAI,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;AACnD,iBAAW,aAAa,QAAO,SAAQ,CAAC,YAAY,IAAI,KAAK,GAAG,CAAC;AACjE;;KAEF,KAAK,aAAa;MAChB,MAAM,EAAE,IAAI,UAAU,QAAQ,UAAU;AAKxC,iBAAW,aAAa,KAAI,SAC1B,KAAK,OAAO,uCAAU;OAAM;OAAU;WAAQ,KAC/C;AACD;;KAEF,QACE,OAAM,IAAI,gBAAgB,iDAAiD,UAAU,OAAO;;SAE3F;KAEL,MAAM,SAAS,OAAO;KACtB,MAAM,YAAY,aAAa,WAAU,WAAQC,OAAK,OAAO,OAAO;AAEpE,SAAI,cAAc,GAChB,OAAM,IAAI,gBAAgB,gCAAgC,SAAS;KAGrE,MAAM,OAAO,aAAa;KAC1B,MAAM,oBAAoB,KAAK,sBAAsB,KAAK,KAAK;KAC/D,MAAM,gBAAgB,KAAK,OAAO;KAClC,MAAM,kDACD,kBACH,MAAM;KAGR,MAAM,UAAU,kBAAkB,KAAK,UAAU,eAC/C,KAAK,MACL,cACD;KAED,MAAM,eAAe,CAAC,GAAG,aAAa;AACtC,kBAAa,+CAAkB,aAAM,MAAM;AAC3C,gBAAW;;AAIb,kBAAc,UAAU,KAAK,QAAQ,WAAW;AAEhD,WAAO;;GAGT,uBAAqD;;AACnD,QAAI,KAAK,QAAQ,iBAAiB,OAChC,QAAO,KAAK,QAAQ;IAItB,MAAM,eAAe,KAAK,QAAQ;IAClC,MAAM,oCAAW,aAAa,KAAK,UAAU,iBAAiB,yEAAI,EAAE;IACpE,MAAM,SAAS,OAAO,YAAY;IAClC,MAAM,UAAU,uBAAuB,MAAM,KAAK;AAElD,WAAO,CAAC;KACN,IAAI;KACJ,MAAM,aAAa;KACnB,UAAU;KACV,KAAK;KACL,MAAM;KACP,CAAC;;GAGJ,qBACE,UACA,aAC8B;IAC9B,MAAM,aAAa,SAAS;IAC5B,MAAM,aAAa,SAAS;AAG5B,QAAI,CAACC,aAA2B,YAAY,WAAW,CACrD,QAAO;KAAE,MAAM;KAAe,WAAW;KAAU;AAIrD,QAAI,SAAS,SAAS,eAAe;KACnC,MAAM,YAAa,SAAS,QAA2B;KACvD,MAAMC,iBAAe,WAAW,UAAU,CAAC,QAAQ,MAAc,MAAM,GAAG;KAC1E,MAAMC,iBAAe,WAAW,UAAU,CAAC,QAAQ,MAAc,MAAM,GAAG;AAG1E,SAAI,SAAS,SAAS,aAAa;MACjC,MAAM,cAAc,SAAS;AAE7B,UAAI,YAAY,OAAO,aAAa,YAAY,aAAa,UAC3D,QAAO,EAAE,MAAM,QAAQ;;AAI3B,SAAI,SAAS,SAAS,eAGpB;UAFsB,SAAS,QAEb,aAAa,UAC7B,QAAO,EAAE,MAAM,QAAQ;;AAK3B,SAAID,eAAa,SAASC,eAAa,QAErC;UADeD,eAAaC,eAAa,YAC1B,UACb,QAAO,EAAE,MAAM,QAAQ;;;AAM7B,QAAI,SAAS,SAAS,iBAAiB,SAAS,SAAS,cACvD,QAAO;KAAE,MAAM;KAAe,WAAW;KAAU;AAIrD,QAAI,SAAS,SAAS,eAAe,SAAS,SAAS,aAAa;AAIlE,SAHsB,SAAS,QAA2B,OACpC,SAAS,QAA2B,GAGxD,QAAO;MAAE,MAAM;MAAe,WAAW;MAAU;AAGrD,YAAO;MAAE,MAAM;MAAe,WAAW;MAAU;;AAIrD,QAAIC,WAAyB,YAAY,WAAW,CAClD,QAAO;KAAE,MAAM;KAAe,WAAW;KAAU;AAIrD,QAAI,SAAS,SAAS,cAAcC,SAAuB,YAAY,WAAW,CAChF,QAAO;KAAE,MAAM;KAAe,WAAW;KAAU;IAIrD,MAAM,eAAe,WAAW,UAAU,CAAC,QAAQ,MAAc,MAAM,GAAG;IAC1E,MAAM,eAAe,WAAW,UAAU,CAAC,QAAQ,MAAc,MAAM,GAAG;AAG1E,QAAI,aAAa,SAAS,KAAK,aAAa,SAAS,GAAG;AAKtD,SAJqB,aAAa,OACb,aAAa,GAIhC,QAAO;MAAE,MAAM;MAAe,WAAW;MAAU;AAKrD,YAAO;MAAE,MAAM;MAAe,WAAW;MAAU;;AAIrD,WAAO;KAAE,MAAM;KAAe,WAAW;KAAU;;GAEtD;AA32BC,OAAK,UAAU;;;CAIjB,WAAoD;AAClD,SAAO,IAAI,gDACN,KAAK,gBACR,UAAU,QACV;;;CAIJ,QAAQ,cAAuE;AAC7E,SAAO,IAAI,gDACN,KAAK,gBACR,gBACA;;;CAIJ,IAAI,OAAc;AAChB,SAAO,KAAK,QAAQ;;;CAItB,OAAO,IAA0C,SAA+D;AAC9G,SAAO,IAAI,gDACN,KAAK,gBACR,YAAY,CAAC,GAAG,KAAK,QAAQ,YAAY;GAAE,UAAU;GAAI;GAAS,CAAC,IACnE;;;;;CAMJ,AAAQ,yBAA4D;AAClE,MAAI,KAAK,sBAAsB,OAC7B,QAAO,KAAK;EAGd,MAAM,2BAAW,IAAI,KAAmC;EACxD,MAAM,0BAAU,IAAI,KAAa;EAEjC,MAAM,SAAS,SAA+B;AAC5C,OAAI,QAAQ,IAAI,KAAK,KAAK,CAAE;AAC5B,WAAQ,IAAI,KAAK,KAAK;AACtB,YAAS,IAAI,KAAK,MAAM,KAAK;AAE7B,QAAK,MAAM,SAAS,KAAK,SACvB,OAAM,MAAM;;AAIhB,QAAM,KAAK,QAAQ,KAAK;AACxB,OAAK,oBAAoB;AACzB,SAAO;;;;;CAMT,AAAQ,sBAAsB,MAAoC;EAEhE,MAAM,WADW,KAAK,wBAAwB,CACpB,IAAI,KAAK;AACnC,MAAI,CAAC,SACH,OAAM,IAAI,gBAAgB,sBAAsB,OAAO;AAEzD,SAAO;;;;;CAMT,AAAQ,mBACN,YACA,WACM;AACN,MAAI,eAAe,MAAM;AAEvB,OAAI,cAAc,KAAK,QAAQ,KAAK,KAClC,OAAM,IAAI,gBACR,8BAA8B,KAAK,QAAQ,KAAK,KAAK,UAAU,UAAU,GAC1E;AAEH;;EAGF,MAAM,sBAAsB,KAAK,sBAAsB,WAAW;AAClE,MAAI,CAAC,oBAAoB,eAAe,UAAU,CAEhD,OAAM,IAAI,gBACR,cAAc,UAAU,kCAAkC,WAAW,oBAFlD,oBAAoB,SAAS,KAAI,MAAK,EAAE,KAAK,CAAC,KAAK,KAAK,IAGzC,SACnC;;;;AAwxBP,MAAa,QACX,YAEA,IAAI,cAAc;CAChB,UAAU;CACV,cAAc;CACd,MAAM,QAAQ;CACd,YAAY,EAAE;CACf,CAAC"}

package/dist/primitives/TreeNode.cjs

@@ -0,0 +1,73 @@
+const require_defineProperty = require('../_virtual/_@oxc-project_runtime@0.103.0/helpers/defineProperty.cjs');
+
+//#region src/primitives/TreeNode.ts
+/**
+* Symbol used to identify the Self placeholder
+*/
+const TreeNodeSelfSymbol = Symbol.for("TreeNode.Self");
+/**
+* Special placeholder for self-referential tree nodes.
+* Use this in the children array when a node type can contain itself.
+* 
+* @example
+* ```typescript
+* const FolderNode = TreeNode("folder", {
+*   data: Struct({ name: String() }),
+*   children: [TreeNodeSelf], // Folder can contain other folders
+* });
+* ```
+*/
+const TreeNodeSelf = {
+	_tag: "TreeNodeSelf",
+	_symbol: TreeNodeSelfSymbol
+};
+/**
+* Check if a value is the Self placeholder
+*/
+const isSelf = (value) => {
+	return typeof value === "object" && value !== null && "_symbol" in value && value._symbol === TreeNodeSelfSymbol;
+};
+/**
+* TreeNodePrimitive - defines a node type with its data schema and allowed children
+*/
+var TreeNodePrimitive = class {
+	constructor(type, config) {
+		require_defineProperty._defineProperty(this, "_tag", "TreeNodePrimitive");
+		require_defineProperty._defineProperty(this, "_Type", void 0);
+		require_defineProperty._defineProperty(this, "_Data", void 0);
+		require_defineProperty._defineProperty(this, "_Children", void 0);
+		require_defineProperty._defineProperty(this, "TSetInput", void 0);
+		require_defineProperty._defineProperty(this, "TUpdateInput", void 0);
+		require_defineProperty._defineProperty(this, "_type", void 0);
+		require_defineProperty._defineProperty(this, "_data", void 0);
+		require_defineProperty._defineProperty(this, "_children", void 0);
+		require_defineProperty._defineProperty(this, "_resolvedChildren", void 0);
+		this._type = type;
+		this._data = config.data;
+		this._children = config.children;
+	}
+	/** Get the node type identifier */
+	get type() {
+		return this._type;
+	}
+	/** Get the data primitive */
+	get data() {
+		return this._data;
+	}
+	/** Get resolved children (resolves lazy thunk if needed, replaces Self with this node) */
+	get children() {
+		if (this._resolvedChildren === void 0) this._resolvedChildren = (typeof this._children === "function" ? this._children() : this._children).map((child) => isSelf(child) ? this : child);
+		return this._resolvedChildren;
+	}
+	/** Check if a child type is allowed */
+	isChildAllowed(childType) {
+		return this.children.some((child) => child.type === childType);
+	}
+};
+/** Creates a new TreeNodePrimitive with the given type and config */
+const TreeNode = (type, config) => new TreeNodePrimitive(type, config);
+
+//#endregion
+exports.TreeNode = TreeNode;
+exports.TreeNodePrimitive = TreeNodePrimitive;
+exports.TreeNodeSelf = TreeNodeSelf;

package/dist/primitives/TreeNode.d.cts

@@ -0,0 +1,92 @@
+import { InferSetInput, InferState, InferUpdateInput } from "./shared.cjs";
+import { StructPrimitive } from "./Struct.cjs";
+
+//#region src/primitives/TreeNode.d.ts
+
+/**
+ * Branded type for TreeNodeSelf - distinguishable at compile time
+ */
+declare const SelfBrand: unique symbol;
+interface TreeNodeSelfType {
+  readonly _tag: "TreeNodeSelf";
+  readonly _brand: typeof SelfBrand;
+}
+/**
+ * Special placeholder for self-referential tree nodes.
+ * Use this in the children array when a node type can contain itself.
+ *
+ * @example
+ * ```typescript
+ * const FolderNode = TreeNode("folder", {
+ *   data: Struct({ name: String() }),
+ *   children: [TreeNodeSelf], // Folder can contain other folders
+ * });
+ * ```
+ */
+declare const TreeNodeSelf: TreeNodeSelfType;
+/**
+ * Type utility to resolve Self placeholders to the actual node type
+ */
+type ResolveSelf<T, TSelf extends AnyTreeNodePrimitive> = T extends TreeNodeSelfType ? TSelf : T;
+/**
+ * Type utility to resolve all children in a tuple, replacing Self with the node type
+ */
+type ResolveChildrenUnion<TChildren, TSelf extends AnyTreeNodePrimitive> = TChildren extends readonly (infer U)[] ? ResolveSelf<U, TSelf> : never;
+/**
+ * The type for children - either a direct array or a lazy function (for self-referential nodes).
+ */
+type TreeNodeChildrenInput = readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[] | (() => readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]);
+/**
+ * Any TreeNodePrimitive type - used for generic constraints.
+ */
+type AnyTreeNodePrimitive = TreeNodePrimitive<string, StructPrimitive<any>, any>;
+/**
+ * Infer the data state type from a TreeNodePrimitive
+ */
+type InferTreeNodeDataState<T extends AnyTreeNodePrimitive> = T extends TreeNodePrimitive<any, infer TData, any> ? InferState<TData> : never;
+/**
+ * Infer the type literal from a TreeNodePrimitive
+ */
+type InferTreeNodeType<T extends AnyTreeNodePrimitive> = T extends TreeNodePrimitive<infer TType, any, any> ? TType : never;
+/**
+ * Infer the allowed children from a TreeNodePrimitive
+ */
+type InferTreeNodeChildren<T> = T extends TreeNodePrimitive<any, any, infer TChildren> ? TChildren : never;
+/**
+ * Configuration for a TreeNode primitive
+ */
+interface TreeNodeConfig<TData$1 extends StructPrimitive<any>, TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]> {
+  readonly data: TData$1;
+  readonly children: TChildren | (() => TChildren);
+}
+/**
+ * TreeNodePrimitive - defines a node type with its data schema and allowed children
+ */
+declare class TreeNodePrimitive<TType extends string, TData$1 extends StructPrimitive<any>, TChildren extends AnyTreeNodePrimitive = AnyTreeNodePrimitive> {
+  readonly _tag: "TreeNodePrimitive";
+  readonly _Type: TType;
+  readonly _Data: TData$1;
+  readonly _Children: TChildren;
+  /** For InferSetInput compatibility - delegates to the data struct's set input type */
+  readonly TSetInput: InferSetInput<TData$1>;
+  /** For InferUpdateInput compatibility - delegates to the data struct's update input type */
+  readonly TUpdateInput: InferUpdateInput<TData$1>;
+  private readonly _type;
+  private readonly _data;
+  private readonly _children;
+  private _resolvedChildren;
+  constructor(type: TType, config: TreeNodeConfig<TData$1, readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]>);
+  /** Get the node type identifier */
+  get type(): TType;
+  /** Get the data primitive */
+  get data(): TData$1;
+  /** Get resolved children (resolves lazy thunk if needed, replaces Self with this node) */
+  get children(): readonly AnyTreeNodePrimitive[];
+  /** Check if a child type is allowed */
+  isChildAllowed(childType: string): boolean;
+}
+/** Creates a new TreeNodePrimitive with the given type and config */
+declare const TreeNode: <TType extends string, TData$1 extends StructPrimitive<any>, const TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]>(type: TType, config: TreeNodeConfig<TData$1, TChildren>) => TreeNodePrimitive<TType, TData$1, ResolveChildrenUnion<TChildren, TreeNodePrimitive<TType, TData$1, any>>>;
+//#endregion
+export { AnyTreeNodePrimitive, InferTreeNodeChildren, InferTreeNodeDataState, InferTreeNodeType, TreeNode, TreeNodeChildrenInput, TreeNodeConfig, TreeNodePrimitive, TreeNodeSelf, TreeNodeSelfType };
+//# sourceMappingURL=TreeNode.d.cts.map

package/dist/primitives/TreeNode.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeNode.d.cts","names":[],"sources":["../../src/primitives/TreeNode.ts"],"sourcesContent":[],"mappings":";;;;;;AAE2C;AAW3C;AAiBA,cAlBc,SAkBoH,EAAA,OAAvG,MAAA;AAYtB,UA7BY,gBAAA,CA6BD;EAAkB,SAAA,IAAA,EAAA,cAAA;EAChC,SAAA,MAAA,EAAA,OA5BwB,SA4BxB;;;;;AAAsC;;;;;;;AAaxC;;AAAqE,cA1BxD,YA0BwD,EA1B1C,gBA0B0C;;;;AAKrE,KAnBK,WAmBO,CAAA,CAAA,EAAA,cAnBsB,oBAmB2B,CAAA,GAlB3D,CAkBiC,SAlBvB,gBAkBwC,GAlBrB,KAkBqB,GAlBb,CAkBa;AAKpD;;;KAlBK,oBAmBO,CAAA,SAAA,EAAA,cAnBuC,oBAmBvC,CAAA,GAlBV,SAkBU,SAAA,SAAA,CAAA,KAAA,EAAA,CAAA,EAAA,GAjBN,WAiBM,CAjBM,CAiBN,EAjBS,KAiBT,CAAA,GAAA,KAAA;;;;AAKA,KAhBA,qBAAA,GAgBiB,SAAA,CAhBiB,oBAgBjB,GAhBwC,gBAgBxC,CAAA,EAAA,GAAA,CAAA,GAAA,GAAA,SAAA,CAhB+E,oBAgB/E,GAhBsG,gBAgBtG,CAAA,EAAA,CAAA;;;;AACA,KAZjB,oBAAA,GAAuB,iBAYN,CAAA,MAAA,EAZgC,eAYhC,CAAA,GAAA,CAAA,EAAA,GAAA,CAAA;AAK7B;AAMA;;AAE8B,KApBlB,sBAoBkB,CAAA,UApBe,oBAoBf,CAAA,GAnB5B,CAmB4B,SAnBlB,iBAmBkB,CAAA,GAAA,EAAA,KAAA,MAAA,EAAA,GAAA,CAAA,GAnByB,UAmBzB,CAnBoC,KAmBpC,CAAA,GAAA,KAAA;;;;AAGU,KAjB5B,iBAiB4B,CAAA,UAjBA,oBAiBA,CAAA,GAhBtC,CAgBsC,SAhB5B,iBAgB4B,CAAA,KAAA,MAAA,EAAA,GAAA,EAAA,GAAA,CAAA,GAAA,KAAA,GAAA,KAAA;;AAMxC;;AAGoB,KApBR,qBAoBQ,CAAA,CAAA,CAAA,GAnBlB,CAmBkB,SAnBR,iBAmBQ,CAAA,GAAA,EAAA,GAAA,EAAA,KAAA,UAAA,CAAA,GAAA,SAAA,GAAA,KAAA;;;;AAKG,UAnBN,cAmBM,CAAA,gBAlBP,eAkBO,CAAA,GAAA,CAAA,EAAA,kBAAA,SAAA,CAjBO,oBAiBP,GAjB8B,gBAiB9B,CAAA,EAAA,CAAA,CAAA;EAGc,SAAA,IAAA,EAlBpB,OAkBoB;EAAd,SAAA,QAAA,EAjBF,SAiBE,GAAA,CAAA,GAAA,GAjBiB,SAiBjB,CAAA;;;;;AAS4C,cApBtD,iBAoBsD,CAAA,cAAA,MAAA,EAAA,gBAlBnD,eAkBmD,CAAA,GAAA,CAAA,EAAA,kBAjB/C,oBAiB+C,GAjBxB,oBAiBwB,CAAA,CAAA;EAAuB,SAAA,IAAA,EAAA,mBAAA;EAAvD,SAAA,KAAA,EAdhB,KAcgB;EAOrB,SAAA,KAAA,EApBK,OAoBL;EAKA,SAAA,SAAA,EAxBS,SAwBT;EAKa;EAAoB,SAAA,SAAA,EA1BxB,aA0BwB,CA1BV,OA0BU,CAAA;EAkBlC;EAEG,SAAA,YAAA,EA5CU,gBA4CV,CA5C2B,OA4C3B,CAAA;EACoB,iBAAA,KAAA;EAAuB,iBAAA,KAAA;EAEnD,iBAAA,SAAA;EACiB,QAAA,iBAAA;EAAO,WAAA,CAAA,IAAA,EAzCZ,KAyCY,EAAA,MAAA,EAzCG,cAyCH,CAzCkB,OAyClB,EAAA,SAAA,CAzCmC,oBAyCnC,GAzC0D,gBAyC1D,CAAA,EAAA,CAAA;EAAtB;EACW,IAAA,IAAA,CAAA,CAAA,EAnCP,KAmCO;EAAO;EAA4B,IAAA,IAAA,CAAA,CAAA,EA9B1C,OA8B0C;EAA6B;EAAO,IAAA,QAAA,CAAA,CAAA,EAAA,SAzBjE,oBAyBiE,EAAA;EAAzB;EAAhC,cAAA,CAAA,SAAA,EAAA,MAAA,CAAA,EAAA,OAAA;;;cAPtB,iDAEG,wDACoB,uBAAuB,2BAEnD,eACE,eAAe,SAAO,eAC7B,kBAAkB,OAAO,SAAO,qBAAqB,WAAW,kBAAkB,OAAO"}

package/dist/primitives/TreeNode.d.mts

@@ -0,0 +1,93 @@
+import { InferSetInput, InferState, InferUpdateInput } from "./shared.mjs";
+import { StructPrimitive } from "./Struct.mjs";
+import "../Primitive.mjs";
+
+//#region src/primitives/TreeNode.d.ts
+
+/**
+ * Branded type for TreeNodeSelf - distinguishable at compile time
+ */
+declare const SelfBrand: unique symbol;
+interface TreeNodeSelfType {
+  readonly _tag: "TreeNodeSelf";
+  readonly _brand: typeof SelfBrand;
+}
+/**
+ * Special placeholder for self-referential tree nodes.
+ * Use this in the children array when a node type can contain itself.
+ *
+ * @example
+ * ```typescript
+ * const FolderNode = TreeNode("folder", {
+ *   data: Struct({ name: String() }),
+ *   children: [TreeNodeSelf], // Folder can contain other folders
+ * });
+ * ```
+ */
+declare const TreeNodeSelf: TreeNodeSelfType;
+/**
+ * Type utility to resolve Self placeholders to the actual node type
+ */
+type ResolveSelf<T, TSelf extends AnyTreeNodePrimitive> = T extends TreeNodeSelfType ? TSelf : T;
+/**
+ * Type utility to resolve all children in a tuple, replacing Self with the node type
+ */
+type ResolveChildrenUnion<TChildren, TSelf extends AnyTreeNodePrimitive> = TChildren extends readonly (infer U)[] ? ResolveSelf<U, TSelf> : never;
+/**
+ * The type for children - either a direct array or a lazy function (for self-referential nodes).
+ */
+type TreeNodeChildrenInput = readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[] | (() => readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]);
+/**
+ * Any TreeNodePrimitive type - used for generic constraints.
+ */
+type AnyTreeNodePrimitive = TreeNodePrimitive<string, StructPrimitive<any>, any>;
+/**
+ * Infer the data state type from a TreeNodePrimitive
+ */
+type InferTreeNodeDataState<T extends AnyTreeNodePrimitive> = T extends TreeNodePrimitive<any, infer TData, any> ? InferState<TData> : never;
+/**
+ * Infer the type literal from a TreeNodePrimitive
+ */
+type InferTreeNodeType<T extends AnyTreeNodePrimitive> = T extends TreeNodePrimitive<infer TType, any, any> ? TType : never;
+/**
+ * Infer the allowed children from a TreeNodePrimitive
+ */
+type InferTreeNodeChildren<T> = T extends TreeNodePrimitive<any, any, infer TChildren> ? TChildren : never;
+/**
+ * Configuration for a TreeNode primitive
+ */
+interface TreeNodeConfig<TData$1 extends StructPrimitive<any>, TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]> {
+  readonly data: TData$1;
+  readonly children: TChildren | (() => TChildren);
+}
+/**
+ * TreeNodePrimitive - defines a node type with its data schema and allowed children
+ */
+declare class TreeNodePrimitive<TType extends string, TData$1 extends StructPrimitive<any>, TChildren extends AnyTreeNodePrimitive = AnyTreeNodePrimitive> {
+  readonly _tag: "TreeNodePrimitive";
+  readonly _Type: TType;
+  readonly _Data: TData$1;
+  readonly _Children: TChildren;
+  /** For InferSetInput compatibility - delegates to the data struct's set input type */
+  readonly TSetInput: InferSetInput<TData$1>;
+  /** For InferUpdateInput compatibility - delegates to the data struct's update input type */
+  readonly TUpdateInput: InferUpdateInput<TData$1>;
+  private readonly _type;
+  private readonly _data;
+  private readonly _children;
+  private _resolvedChildren;
+  constructor(type: TType, config: TreeNodeConfig<TData$1, readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]>);
+  /** Get the node type identifier */
+  get type(): TType;
+  /** Get the data primitive */
+  get data(): TData$1;
+  /** Get resolved children (resolves lazy thunk if needed, replaces Self with this node) */
+  get children(): readonly AnyTreeNodePrimitive[];
+  /** Check if a child type is allowed */
+  isChildAllowed(childType: string): boolean;
+}
+/** Creates a new TreeNodePrimitive with the given type and config */
+declare const TreeNode: <TType extends string, TData$1 extends StructPrimitive<any>, const TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]>(type: TType, config: TreeNodeConfig<TData$1, TChildren>) => TreeNodePrimitive<TType, TData$1, ResolveChildrenUnion<TChildren, TreeNodePrimitive<TType, TData$1, any>>>;
+//#endregion
+export { AnyTreeNodePrimitive, InferTreeNodeChildren, InferTreeNodeDataState, InferTreeNodeType, TreeNode, TreeNodeChildrenInput, TreeNodeConfig, TreeNodePrimitive, TreeNodeSelf, TreeNodeSelfType };
+//# sourceMappingURL=TreeNode.d.mts.map

package/dist/primitives/TreeNode.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeNode.d.mts","names":[],"sources":["../../src/primitives/TreeNode.ts"],"sourcesContent":[],"mappings":";;;;;;;;AAE2C;AAW3C,cADc,SACmB,EAAA,OAAA,MAEP;AAeb,UAjBI,gBAAA,CAiBU;EAYtB,SAAA,IAAA,EAAW,cAAA;EAAkB,SAAA,MAAA,EAAA,OA3BR,SA2BQ;;;;;;AACM;;;;;;;AAaxC;AAA8C,cA1BjC,YA0BiC,EA1BnB,gBA0BmB;;;;KAdzC,WAc8I,CAAA,CAAA,EAAA,cAdjH,oBAciH,CAAA,GAbjJ,CAaiJ,SAbvI,gBAauI,GAbpH,KAaoH,GAb5G,CAa4G;AAKnJ;AAKA;;KAlBK,oBAmBH,CAAA,SAAA,EAAA,cAnBiD,oBAmBjD,CAAA,GAlBA,SAkBA,SAAA,SAAA,CAAA,KAAA,EAAA,CAAA,EAAA,GAjBI,WAiBJ,CAjBgB,CAiBhB,EAjBmB,KAiBnB,CAAA,GAAA,KAAA;;;;AAA+D,KAXrD,qBAAA,GAWqD,SAAA,CAXnB,oBAWmB,GAXI,gBAWJ,CAAA,EAAA,GAAA,CAAA,GAAA,GAAA,SAAA,CAX2C,oBAW3C,GAXkE,gBAWlE,CAAA,EAAA,CAAA;AAKjE;;;AACY,KAZA,oBAAA,GAAuB,iBAYvB,CAAA,MAAA,EAZiD,eAYjD,CAAA,GAAA,CAAA,EAAA,GAAA,CAAA;;AAKZ;AAMA;AACgB,KAnBJ,sBAmBI,CAAA,UAnB6B,oBAmB7B,CAAA,GAlBd,CAkBc,SAlBJ,iBAkBI,CAAA,GAAA,EAAA,KAAA,MAAA,EAAA,GAAA,CAAA,GAlBuC,UAkBvC,CAlBkD,KAkBlD,CAAA,GAAA,KAAA;;;;AAIK,KAjBT,iBAiBS,CAAA,UAjBmB,oBAiBnB,CAAA,GAhBnB,CAgBmB,SAhBT,iBAgBS,CAAA,KAAA,MAAA,EAAA,GAAA,EAAA,GAAA,CAAA,GAAA,KAAA,GAAA,KAAA;;;AAMrB;AAEgB,KAnBJ,qBAmBI,CAAA,CAAA,CAAA,GAlBd,CAkBc,SAlBJ,iBAkBI,CAAA,GAAA,EAAA,GAAA,EAAA,KAAA,UAAA,CAAA,GAAA,SAAA,GAAA,KAAA;;;;AAKG,UAlBF,cAkBE,CAAA,gBAjBH,eAiBG,CAAA,GAAA,CAAA,EAAA,kBAAA,SAAA,CAhBW,oBAgBX,GAhBkC,gBAgBlC,CAAA,EAAA,CAAA,CAAA;EACI,SAAA,IAAA,EAfN,OAeM;EAGc,SAAA,QAAA,EAjBhB,SAiBgB,GAAA,CAAA,GAAA,GAjBG,SAiBH,CAAA;;;;;AASa,cApBrC,iBAoBqC,CAAA,cAAA,MAAA,EAAA,gBAlBlC,eAkBkC,CAAA,GAAA,CAAA,EAAA,kBAjB9B,oBAiB8B,GAjBP,oBAiBO,CAAA,CAAA;EAAiB,SAAA,IAAA,EAAA,mBAAA;EAAuB,SAAA,KAAA,EAdvE,KAcuE;EAAvD,SAAA,KAAA,EAbhB,OAagB;EAOrB,SAAA,SAAA,EAnBS,SAmBT;EAKA;EAKa,SAAA,SAAA,EA1BJ,aA0BI,CA1BU,OA0BV,CAAA;EAAoB;EAkBlC,SAAA,YAQkI,EAlDrH,gBAkDqH,CAlDpG,OAkDoG,CAAA;EAN/H,iBAAA,KAAA;EACoB,iBAAA,KAAA;EAAuB,iBAAA,SAAA;EAEnD,QAAA,iBAAA;EACiB,WAAA,CAAA,IAAA,EAzCL,KAyCK,EAAA,MAAA,EAzCU,cAyCV,CAzCyB,OAyCzB,EAAA,SAAA,CAzC0C,oBAyC1C,GAzCiE,gBAyCjE,CAAA,EAAA,CAAA;EAAO;EAAtB,IAAA,IAAA,CAAA,CAAA,EAlCI,KAkCJ;EACW;EAAO,IAAA,IAAA,CAAA,CAAA,EA9Bd,OA8Bc;EAA4B;EAA6B,IAAA,QAAA,CAAA,CAAA,EAAA,SAzB1D,oBAyB0D,EAAA;EAAO;EAAzB,cAAA,CAAA,SAAA,EAAA,MAAA,CAAA,EAAA,OAAA;;;AAA/C,cAPP,QAOO,EAAA,CAAA,cAAA,MAAA,EAAA,gBALJ,eAKI,CAAA,GAAA,CAAA,EAAA,wBAAA,SAAA,CAJgB,oBAIhB,GAJuC,gBAIvC,CAAA,EAAA,CAAA,CAAA,IAAA,EAFZ,KAEY,EAAA,MAAA,EADV,cACU,CADK,OACL,EADY,SACZ,CAAA,EAAA,GAAjB,iBAAiB,CAAC,KAAD,EAAQ,OAAR,EAAe,oBAAf,CAAoC,SAApC,EAA+C,iBAA/C,CAAiE,KAAjE,EAAwE,OAAxE,EAAA,GAAA,CAAA,CAAA,CAAA"}

package/dist/primitives/TreeNode.mjs

@@ -0,0 +1,72 @@
+import { _defineProperty } from "../_virtual/_@oxc-project_runtime@0.103.0/helpers/defineProperty.mjs";
+
+//#region src/primitives/TreeNode.ts
+/**
+* Symbol used to identify the Self placeholder
+*/
+const TreeNodeSelfSymbol = Symbol.for("TreeNode.Self");
+/**
+* Special placeholder for self-referential tree nodes.
+* Use this in the children array when a node type can contain itself.
+* 
+* @example
+* ```typescript
+* const FolderNode = TreeNode("folder", {
+*   data: Struct({ name: String() }),
+*   children: [TreeNodeSelf], // Folder can contain other folders
+* });
+* ```
+*/
+const TreeNodeSelf = {
+	_tag: "TreeNodeSelf",
+	_symbol: TreeNodeSelfSymbol
+};
+/**
+* Check if a value is the Self placeholder
+*/
+const isSelf = (value) => {
+	return typeof value === "object" && value !== null && "_symbol" in value && value._symbol === TreeNodeSelfSymbol;
+};
+/**
+* TreeNodePrimitive - defines a node type with its data schema and allowed children
+*/
+var TreeNodePrimitive = class {
+	constructor(type, config) {
+		_defineProperty(this, "_tag", "TreeNodePrimitive");
+		_defineProperty(this, "_Type", void 0);
+		_defineProperty(this, "_Data", void 0);
+		_defineProperty(this, "_Children", void 0);
+		_defineProperty(this, "TSetInput", void 0);
+		_defineProperty(this, "TUpdateInput", void 0);
+		_defineProperty(this, "_type", void 0);
+		_defineProperty(this, "_data", void 0);
+		_defineProperty(this, "_children", void 0);
+		_defineProperty(this, "_resolvedChildren", void 0);
+		this._type = type;
+		this._data = config.data;
+		this._children = config.children;
+	}
+	/** Get the node type identifier */
+	get type() {
+		return this._type;
+	}
+	/** Get the data primitive */
+	get data() {
+		return this._data;
+	}
+	/** Get resolved children (resolves lazy thunk if needed, replaces Self with this node) */
+	get children() {
+		if (this._resolvedChildren === void 0) this._resolvedChildren = (typeof this._children === "function" ? this._children() : this._children).map((child) => isSelf(child) ? this : child);
+		return this._resolvedChildren;
+	}
+	/** Check if a child type is allowed */
+	isChildAllowed(childType) {
+		return this.children.some((child) => child.type === childType);
+	}
+};
+/** Creates a new TreeNodePrimitive with the given type and config */
+const TreeNode = (type, config) => new TreeNodePrimitive(type, config);
+
+//#endregion
+export { TreeNode, TreeNodePrimitive, TreeNodeSelf };
+//# sourceMappingURL=TreeNode.mjs.map

package/dist/primitives/TreeNode.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"TreeNode.mjs","names":["TreeNodeSelf: TreeNodeSelfType"],"sources":["../../src/primitives/TreeNode.ts"],"sourcesContent":["import type { InferState } from \"../Primitive\";\nimport type { InferSetInput, InferUpdateInput } from \"./shared\";\nimport { StructPrimitive } from \"./Struct\";\n\n/**\n * Symbol used to identify the Self placeholder\n */\nconst TreeNodeSelfSymbol = Symbol.for(\"TreeNode.Self\");\n\n/**\n * Branded type for TreeNodeSelf - distinguishable at compile time\n */\ndeclare const SelfBrand: unique symbol;\nexport interface TreeNodeSelfType {\n  readonly _tag: \"TreeNodeSelf\";\n  readonly _brand: typeof SelfBrand;\n}\n\n/**\n * Special placeholder for self-referential tree nodes.\n * Use this in the children array when a node type can contain itself.\n * \n * @example\n * ```typescript\n * const FolderNode = TreeNode(\"folder\", {\n *   data: Struct({ name: String() }),\n *   children: [TreeNodeSelf], // Folder can contain other folders\n * });\n * ```\n */\nexport const TreeNodeSelf: TreeNodeSelfType = { _tag: \"TreeNodeSelf\", _symbol: TreeNodeSelfSymbol } as unknown as TreeNodeSelfType;\n\n/**\n * Check if a value is the Self placeholder\n */\nconst isSelf = (value: unknown): boolean => {\n  return typeof value === \"object\" && value !== null && \"_symbol\" in value && (value as any)._symbol === TreeNodeSelfSymbol;\n};\n\n/**\n * Type utility to resolve Self placeholders to the actual node type\n */\ntype ResolveSelf<T, TSelf extends AnyTreeNodePrimitive> = \n  T extends TreeNodeSelfType ? TSelf : T;\n\n/**\n * Type utility to resolve all children in a tuple, replacing Self with the node type\n */\ntype ResolveChildrenUnion<TChildren, TSelf extends AnyTreeNodePrimitive> = \n  TChildren extends readonly (infer U)[] \n    ? ResolveSelf<U, TSelf> \n    : never;\n\n/**\n * The type for children - either a direct array or a lazy function (for self-referential nodes).\n */\nexport type TreeNodeChildrenInput = readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[] | (() => readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]);\n\n/**\n * Any TreeNodePrimitive type - used for generic constraints.\n */\nexport type AnyTreeNodePrimitive = TreeNodePrimitive<string, StructPrimitive<any>, any>;\n\n/**\n * Infer the data state type from a TreeNodePrimitive\n */\nexport type InferTreeNodeDataState<T extends AnyTreeNodePrimitive> = \n  T extends TreeNodePrimitive<any, infer TData, any> ? InferState<TData> : never;\n\n/**\n * Infer the type literal from a TreeNodePrimitive\n */\nexport type InferTreeNodeType<T extends AnyTreeNodePrimitive> =\n  T extends TreeNodePrimitive<infer TType, any, any> ? TType : never;\n\n/**\n * Infer the allowed children from a TreeNodePrimitive\n */\nexport type InferTreeNodeChildren<T> = \n  T extends TreeNodePrimitive<any, any, infer TChildren> ? TChildren : never;\n\n/**\n * Configuration for a TreeNode primitive\n */\nexport interface TreeNodeConfig<\n  TData extends StructPrimitive<any>,\n  TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]\n> {\n  readonly data: TData;\n  readonly children: TChildren | (() => TChildren);\n}\n\n/**\n * TreeNodePrimitive - defines a node type with its data schema and allowed children\n */\nexport class TreeNodePrimitive<\n  TType extends string,\n  TData extends StructPrimitive<any>,\n  TChildren extends AnyTreeNodePrimitive = AnyTreeNodePrimitive\n> {\n  readonly _tag = \"TreeNodePrimitive\" as const;\n  readonly _Type!: TType;\n  readonly _Data!: TData;\n  readonly _Children!: TChildren;\n  \n  /** For InferSetInput compatibility - delegates to the data struct's set input type */\n  readonly TSetInput!: InferSetInput<TData>;\n  /** For InferUpdateInput compatibility - delegates to the data struct's update input type */\n  readonly TUpdateInput!: InferUpdateInput<TData>;\n\n  private readonly _type: TType;\n  private readonly _data: TData;\n  private readonly _children: TreeNodeChildrenInput;\n  private _resolvedChildren: readonly AnyTreeNodePrimitive[] | undefined;\n\n  constructor(type: TType, config: TreeNodeConfig<TData, readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]>) {\n    this._type = type;\n    this._data = config.data;\n    this._children = config.children;\n  }\n\n  /** Get the node type identifier */\n  get type(): TType {\n    return this._type;\n  }\n\n  /** Get the data primitive */\n  get data(): TData {\n    return this._data;\n  }\n\n  /** Get resolved children (resolves lazy thunk if needed, replaces Self with this node) */\n  get children(): readonly AnyTreeNodePrimitive[] {\n    if (this._resolvedChildren === undefined) {\n      const resolved = typeof this._children === \"function\"\n        ? (this._children as () => readonly AnyTreeNodePrimitive[])()\n        : this._children;\n      // Replace Self placeholders with this node\n      this._resolvedChildren = resolved.map(child => isSelf(child) ? this : child) as readonly AnyTreeNodePrimitive[];\n    }\n    return this._resolvedChildren;\n  }\n\n  /** Check if a child type is allowed */\n  isChildAllowed(childType: string): boolean {\n    return this.children.some(child => child.type === childType);\n  }\n}\n\n/** Creates a new TreeNodePrimitive with the given type and config */\nexport const TreeNode = <\n  TType extends string,\n  TData extends StructPrimitive<any>,\n  const TChildren extends readonly (AnyTreeNodePrimitive | TreeNodeSelfType)[]\n>(\n  type: TType,\n  config: TreeNodeConfig<TData, TChildren>\n): TreeNodePrimitive<TType, TData, ResolveChildrenUnion<TChildren, TreeNodePrimitive<TType, TData, any>>> =>\n  new TreeNodePrimitive(type, config) as TreeNodePrimitive<TType, TData, ResolveChildrenUnion<TChildren, TreeNodePrimitive<TType, TData, any>>>;\n\n"],"mappings":";;;;;;AAOA,MAAM,qBAAqB,OAAO,IAAI,gBAAgB;;;;;;;;;;;;;AAuBtD,MAAaA,eAAiC;CAAE,MAAM;CAAgB,SAAS;CAAoB;;;;AAKnG,MAAM,UAAU,UAA4B;AAC1C,QAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa,SAAU,MAAc,YAAY;;;;;AA2DzG,IAAa,oBAAb,MAIE;CAgBA,YAAY,MAAa,QAAqF;wBAfrG,QAAO;wBACP;wBACA;wBACA;wBAGA;wBAEA;wBAEQ;wBACA;wBACA;wBACT;AAGN,OAAK,QAAQ;AACb,OAAK,QAAQ,OAAO;AACpB,OAAK,YAAY,OAAO;;;CAI1B,IAAI,OAAc;AAChB,SAAO,KAAK;;;CAId,IAAI,OAAc;AAChB,SAAO,KAAK;;;CAId,IAAI,WAA4C;AAC9C,MAAI,KAAK,sBAAsB,OAK7B,MAAK,qBAJY,OAAO,KAAK,cAAc,aACtC,KAAK,WAAqD,GAC3D,KAAK,WAEyB,KAAI,UAAS,OAAO,MAAM,GAAG,OAAO,MAAM;AAE9E,SAAO,KAAK;;;CAId,eAAe,WAA4B;AACzC,SAAO,KAAK,SAAS,MAAK,UAAS,MAAM,SAAS,UAAU;;;;AAKhE,MAAa,YAKX,MACA,WAEA,IAAI,kBAAkB,MAAM,OAAO"}