@dxos/app-graph 0.7.1 → 0.7.2-staging.6d26b2a

package/dist/lib/node/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { nonNullable } from '@dxos/util';\n\nimport { type Relation, type Node, type NodeArg, type NodeFilter, isActionLike, actionGroupSymbol } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: DeepWriteable<T[K]> };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type NodesOptions<T = any, U extends Record<string, any> = Record<string, any>> = {\n  relation?: Relation;\n  filter?: NodeFilter<T, U>;\n  expansion?: boolean;\n  type?: string;\n};\n\n// TODO(wittjosiah): Consider having default be undefined. This is current default for backwards compatibility.\nconst DEFAULT_FILTER = (node: Node) => untracked(() => !isActionLike(node));\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n\n  /**\n   * Allow traversal to trigger expansion of the graph via `onInitialNodes`.\n   */\n  expansion?: boolean;\n};\n\nexport type GraphParams = {\n  // TODO(wittjosiah): Make data optional instead of omitting.\n  nodes?: Omit<Node, 'data'>[];\n  edges?: Record<string, string[]>;\n  onInitialNode?: Graph['_onInitialNode'];\n  onInitialNodes?: Graph['_onInitialNodes'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  private readonly _onInitialNode?: (id: string) => Promise<void>;\n  private readonly _onInitialNodes?: (node: Node, relation: Relation, type?: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => Promise<void>;\n\n  private readonly _waitingForNodes: Record<string, Trigger<Node>> = {};\n  private readonly _initialized: Record<string, boolean> = {};\n\n  /**\n   * @internal\n   */\n  readonly _nodes: Record<string, ReactiveObject<NodeInternal>> = {};\n\n  /**\n   * @internal\n   */\n  readonly _edges: Record<string, ReactiveObject<{ inbound: string[]; outbound: string[] }>> = {};\n\n  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode }: GraphParams = {}) {\n    this._nodes[ROOT_ID] = this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, properties: {}, data: null });\n    if (nodes) {\n      nodes.forEach((node) => {\n        if (node.type === ACTION_TYPE) {\n          this._addNode({ ...node, data: () => log.warn('Pickled action invocation') });\n        } else if (node.type === ACTION_GROUP_TYPE) {\n          this._addNode({ ...node, data: actionGroupSymbol });\n        } else {\n          this._addNode(node);\n        }\n      });\n    }\n\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        edges.forEach((target) => {\n          this._addEdge({ source, target });\n        });\n        this._sortEdges(source, 'outbound', edges);\n      });\n    }\n\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n  }\n\n  static from(pickle: string, options: Omit<GraphParams, 'nodes' | 'edges'> = {}) {\n    const { nodes, edges } = JSON.parse(pickle);\n    return new Graph({ nodes, edges, ...options });\n  }\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = this.nodes(node);\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n        type: node.type,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  pickle() {\n    const nodes = Object.values(this._nodes).map((node) => {\n      return {\n        id: node.id,\n        type: node.type,\n        properties: node.properties,\n      };\n    });\n\n    const edges = Object.fromEntries(\n      Object.entries(this._edges)\n        .map(([id, { outbound }]): [string, string[]] => [id, outbound])\n        .toSorted(([a], [b]) => a.localeCompare(b)),\n    );\n\n    return JSON.stringify({ nodes, edges });\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   *\n   * If a node is not found within the graph and an `onInitialNode` callback is provided,\n   * it is called with the id and type of the node, potentially initializing the node.\n   */\n  findNode(id: string, expansion = true): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode && expansion) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = DEFAULT_FILTER, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => filter(n, node));\n  }\n\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(node: Node, { relation = 'outbound' }: { relation?: Relation } = {}) {\n    return this._edges[node.id]?.[relation] ?? [];\n  }\n\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(node: Node, { expansion }: { expansion?: boolean } = {}) {\n    return [\n      ...this._getNodes({ node, expansion, type: ACTION_GROUP_TYPE }),\n      ...this._getNodes({ node, expansion, type: ACTION_TYPE }),\n    ];\n  }\n\n  async expand(node: Node, relation: Relation = 'outbound', type?: string) {\n    const key = this._key(node, relation, type);\n    const initialized = this._initialized[key];\n    if (!initialized && this._onInitialNodes) {\n      await this._onInitialNodes(node, relation, type);\n      this._initialized[key] = true;\n    }\n  }\n\n  private _key(node: Node, relation: Relation, type?: string) {\n    return `${node.id}-${relation}-${type}`;\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    path: string[] = [],\n  ): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    const shouldContinue = visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this._getNodes({ node, relation, expansion })).forEach((child) =>\n      this.traverse({ node: child, relation, visitor, expansion }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph wrapping each visitor call in an effect.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  subscribeTraverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    currentPath: string[] = [],\n  ) {\n    return effect(() => {\n      const path = [...currentPath, node.id];\n      const result = visitor(node, path);\n      if (result === false) {\n        return;\n      }\n\n      const nodes = this._getNodes({ node, relation, expansion });\n      const nodeSubscriptions = nodes.map((n) => this.subscribeTraverse({ node: n, visitor, expansion }, path));\n\n      return () => {\n        nodeSubscriptions.forEach((unsubscribe) => unsubscribe());\n      };\n    });\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      visitor: (node, path) => {\n        if (found) {\n          return false;\n        }\n\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ) {\n    const path = this.getPath(params);\n    if (path) {\n      return path;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (path) {\n        trigger.wake(path);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /**\n   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data, properties, type } = _node;\n        if (data && data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(nonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<Node<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Signal, effect, signal } from '@preact/signals-core';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { isNode, type MaybePromise, nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, type GraphParams } from './graph';\nimport { type Relation, type NodeArg, type Node, type ActionData, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(nonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = {\n  id: string;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n};\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _connectorSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private _graph: Graph;\n\n  constructor(params: Pick<GraphParams, 'nodes' | 'edges'> = {}) {\n    this._graph = new Graph({\n      ...params,\n      onInitialNode: (id) => this._onInitialNode(id),\n      onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string) {\n    if (!pickle) {\n      return new GraphBuilder();\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges });\n  }\n\n  /**\n   * If graph is being restored from a pickle, the data will be null.\n   * Initialize the data of each node by calling resolvers.\n   */\n  async initialize() {\n    return Promise.all(Object.keys(this._graph._nodes).map((id) => this._onInitialNode(id)));\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    if (Array.isArray(extension)) {\n      extension.forEach((ext) => this.addExtension(ext));\n      return this;\n    }\n\n    this._dispatcher.state[extension.id] = [];\n    this._extensions[extension.id] = extension;\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    delete this._extensions[id];\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        for (const { id, resolver } of Object.values(this._extensions)) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          if (node) {\n            this.graph._addNodes([node]);\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private async _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        for (const { id, connector, filter, type, relation = 'outbound' } of Object.values(this._extensions)) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAAyC;AAEzC,mBAAsC;AACtC,yBAA4C;AAC5C,uBAA0B;AAC1B,iBAAoB;AACpB,kBAA4B;AEN5B,IAAAA,uBAA4C;AAG5C,IAAAC,sBAAuB;AACvB,IAAAC,oBAA0B;AAC1B,IAAAC,cAAoB;AACpB,IAAAC,eAAuD;ADgChD,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;AD/E7G,IAAMO,cAAcH,OAAO,OAAA;AAIpB,IAAMI,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBF,WAAAA;AACrCI,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,aAAeQ,+BAAU,MAAM,CAACX,aAAaG,IAAAA,CAAAA;AA0C9D,IAAMS,QAAN,MAAMA,OAAAA;EAkBXC,YAAY,EAAEC,OAAOC,OAAOC,eAAeC,gBAAgBC,aAAY,IAAkB,CAAC,GAAG;AAb5EC,SAAAA,mBAAkD,CAAC;AACnDC,SAAAA,eAAwC,CAAC;kBAKM,CAAC;kBAK4B,CAAC;AAsdtFC,SAAAA,iBAAiB,CAAClB,SAAAA;AACxB,iBAAOmB,2BAAqB;QAAE,GAAGnB;QAAM,CAACF,WAAAA,GAAc;MAAK,CAAA;IAC7D;AArdE,SAAKsB,OAAOjB,OAAAA,IAAW,KAAKe,eAAe;MAAEG,IAAIlB;MAASmB,MAAMlB;MAAWZ,YAAY,CAAC;MAAGD,MAAM;IAAK,CAAA;AACtG,QAAIoB,OAAO;AACTA,YAAMY,QAAQ,CAACvB,SAAAA;AACb,YAAIA,KAAKsB,SAASjB,aAAa;AAC7B,eAAKmB,SAAS;YAAE,GAAGxB;YAAMT,MAAM,MAAMkC,eAAIC,KAAK,6BAAA,QAAA;;;;;;UAA6B,CAAA;QAC7E,WAAW1B,KAAKsB,SAAShB,mBAAmB;AAC1C,eAAKkB,SAAS;YAAE,GAAGxB;YAAMT,MAAMG;UAAkB,CAAA;QACnD,OAAO;AACL,eAAK8B,SAASxB,IAAAA;QAChB;MACF,CAAA;IACF;AAEA,SAAK2B,OAAOxB,OAAAA,QAAWgB,2BAAO;MAAES,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;AAC1D,QAAIjB,OAAO;AACTkB,aAAOC,QAAQnB,KAAAA,EAAOW,QAAQ,CAAC,CAACS,QAAQpB,MAAAA,MAAM;AAC5CA,eAAMW,QAAQ,CAACU,WAAAA;AACb,eAAKC,SAAS;YAAEF;YAAQC;UAAO,CAAA;QACjC,CAAA;AACA,aAAKE,WAAWH,QAAQ,YAAYpB,MAAAA;MACtC,CAAA;IACF;AAEA,SAAKwB,iBAAiBvB;AACtB,SAAKwB,kBAAkBvB;AACvB,SAAKwB,gBAAgBvB;EACvB;EAEA,OAAOwB,KAAKC,QAAgBC,UAAgD,CAAC,GAAG;AAC9E,UAAM,EAAE9B,OAAOC,MAAK,IAAK8B,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAI/B,OAAM;MAAEE;MAAOC;MAAO,GAAG6B;IAAQ,CAAA;EAC9C;;;;EAKA,IAAIG,OAAO;AACT,WAAO,KAAKC,SAAS1C,OAAAA;EACvB;;;;EAKA2C,OAAO,EAAEzB,KAAKlB,SAAS4C,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAC9C,MAAYgD,OAAiB,CAAA,MAAE;AAC7C,YAAMrC,QAAQ,KAAKA,MAAMX,IAAAA;AACzB,YAAMiD,MAA2B;QAC/B5B,IAAIrB,KAAKqB,GAAG6B,SAASH,YAAY,GAAG/C,KAAKqB,GAAG8B,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAU/C,KAAKqB;QAChFC,MAAMtB,KAAKsB;MACb;AACA,UAAItB,KAAKR,WAAW4D,OAAO;AACzBH,YAAIG,QAAQpD,KAAKR,WAAW4D;MAC9B;AACA,UAAIzC,MAAMuC,QAAQ;AAChBD,YAAItC,QAAQA,MACT0C,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIP;YAAMhD,KAAKqB;;AAChC,iBAAOkC,SAASC,SAASF,EAAEjC,EAAE,IAAIoC,SAAYX,OAAOQ,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,uBAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAML,OAAO,KAAKC,SAASxB,EAAAA;AAC3BnB,oCAAU0C,MAAM,mBAAmBvB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOyB,OAAOF,IAAAA;EAChB;EAEAJ,SAAS;AACP,UAAM7B,QAAQmB,OAAO8B,OAAO,KAAKxC,MAAM,EAAEiC,IAAI,CAACrD,SAAAA;AAC5C,aAAO;QACLqB,IAAIrB,KAAKqB;QACTC,MAAMtB,KAAKsB;QACX9B,YAAYQ,KAAKR;MACnB;IACF,CAAA;AAEA,UAAMoB,QAAQkB,OAAO+B,YACnB/B,OAAOC,QAAQ,KAAKJ,MAAM,EACvB0B,IAAI,CAAC,CAAChC,IAAI,EAAEQ,SAAQ,CAAE,MAA0B;MAACR;MAAIQ;KAAS,EAC9DiC,SAAS,CAAC,CAACC,CAAAA,GAAI,CAACC,CAAAA,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA,CAAAA;AAG5C,WAAOtB,KAAKwB,UAAU;MAAEvD;MAAOC;IAAM,CAAA;EACvC;;;;;;;EAQAiC,SAASxB,IAAY8C,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAKhD,OAAOC,EAAAA;AACjC,QAAI,CAAC+C,gBAAgBD,WAAW;AAC9B,WAAK,KAAK/B,iBAAiBf,EAAAA;IAC7B;AAEA,WAAO+C;EACT;;;;;;;;;EAUA,MAAMC,YAAYhD,IAAYiD,SAAiC;AAC7D,UAAMC,UAAU,KAAKvD,iBAAiBK,EAAAA,MAAQ,KAAKL,iBAAiBK,EAAAA,IAAM,IAAImD,qBAAAA;AAC9E,UAAMxE,OAAO,KAAK6C,SAASxB,EAAAA;AAC3B,QAAIrB,MAAM;AACR,aAAO,KAAKgB,iBAAiBK,EAAAA;AAC7B,aAAOrB;IACT;AAEA,QAAIsE,YAAYb,QAAW;AACzB,aAAOc,QAAQE,KAAI;IACrB,OAAO;AACL,iBAAOC,2BAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBjD,EAAAA,EAAI;IACtE;EACF;;;;EAKAV,MAAoEX,MAAYyC,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEkC,UAAUR,WAAWT,SAASnD,gBAAgBe,KAAI,IAAKmB;AAC/D,UAAM9B,QAAQ,KAAKiE,UAAU;MAAE5E;MAAM2E;MAAUR;MAAW7C;IAAK,CAAA;AAC/D,WAAOX,MAAM+C,OAAO,CAACJ,MAAMI,OAAOJ,GAAGtD,IAAAA,CAAAA;EACvC;;;;EAKAY,MAAMZ,MAAY,EAAE2E,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKhD,OAAO3B,KAAKqB,EAAE,IAAIsD,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAE,QAAQ7E,MAAY,EAAEmE,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKS,UAAU;QAAE5E;QAAMmE;QAAW7C,MAAMhB;MAAkB,CAAA;SAC1D,KAAKsE,UAAU;QAAE5E;QAAMmE;QAAW7C,MAAMjB;MAAY,CAAA;;EAE3D;EAEA,MAAMyE,OAAO9E,MAAY2E,WAAqB,YAAYrD,MAAe;AACvE,UAAMyD,MAAM,KAAKC,KAAKhF,MAAM2E,UAAUrD,IAAAA;AACtC,UAAM2D,cAAc,KAAKhE,aAAa8D,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAK5C,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBrC,MAAM2E,UAAUrD,IAAAA;AAC3C,WAAKL,aAAa8D,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAKhF,MAAY2E,UAAoBrD,MAAe;AAC1D,WAAO,GAAGtB,KAAKqB,EAAE,IAAIsD,QAAAA,IAAYrD,IAAAA;EACnC;;;;;;;;EASA4D,SACE,EAAEC,SAASnF,OAAO,KAAK4C,MAAM+B,WAAW,YAAYR,UAAS,GAC7DiB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAK5B,SAASxD,KAAKqB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAMgE,iBAAiBF,QAAQnF,MAAM;SAAIoF;MAAMpF,KAAKqB;KAAG;AACvD,QAAIgE,mBAAmB,OAAO;AAC5B;IACF;AAEAvD,WAAO8B,OAAO,KAAKgB,UAAU;MAAE5E;MAAM2E;MAAUR;IAAU,CAAA,CAAA,EAAI5C,QAAQ,CAAC+D,UACpE,KAAKJ,SAAS;MAAElF,MAAMsF;MAAOX;MAAUQ;MAAShB;IAAU,GAAG;SAAIiB;MAAMpF,KAAKqB;KAAG,CAAA;EAEnF;;;;;;;;EASAkE,kBACE,EAAEJ,SAASnF,OAAO,KAAK4C,MAAM+B,WAAW,YAAYR,UAAS,GAC7DqB,cAAwB,CAAA,GACxB;AACA,eAAOC,4BAAO,MAAA;AACZ,YAAML,OAAO;WAAII;QAAaxF,KAAKqB;;AACnC,YAAMqE,SAASP,QAAQnF,MAAMoF,IAAAA;AAC7B,UAAIM,WAAW,OAAO;AACpB;MACF;AAEA,YAAM/E,QAAQ,KAAKiE,UAAU;QAAE5E;QAAM2E;QAAUR;MAAU,CAAA;AACzD,YAAMwB,oBAAoBhF,MAAM0C,IAAI,CAACC,MAAM,KAAKiC,kBAAkB;QAAEvF,MAAMsD;QAAG6B;QAAShB;MAAU,GAAGiB,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLO,0BAAkBpE,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAE7D,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAM6D,QAAQ,KAAKjD,SAASb,MAAAA;AAC5B,QAAI,CAAC8D,OAAO;AACV,aAAOrC;IACT;AAEA,QAAIsC;AACJ,SAAKb,SAAS;MACZlF,MAAM8F;MACNX,SAAS,CAACnF,MAAMoF,SAAAA;AACd,YAAIW,OAAO;AACT,iBAAO;QACT;AAEA,YAAI/F,KAAKqB,OAAOY,QAAQ;AACtB8D,kBAAQX;QACV;MACF;IACF,CAAA;AAEA,WAAOW;EACT;;;;EAKA,MAAMC,YACJC,QACA,EAAE3B,UAAU,KAAO4B,WAAW,IAAG,IAA8C,CAAC,GAChF;AACA,UAAMd,OAAO,KAAKS,QAAQI,MAAAA;AAC1B,QAAIb,MAAM;AACR,aAAOA;IACT;AAEA,UAAMb,UAAU,IAAIC,qBAAAA;AACpB,UAAM2B,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKS,QAAQI,MAAAA;AAC1B,UAAIb,OAAM;AACRb,gBAAQ8B,KAAKjB,KAAAA;MACf;IACF,GAAGc,QAAAA;AAEH,WAAO3B,QAAQE,KAAK;MAAEH;IAAQ,CAAA,EAAGgC,QAAQ,MAAMC,cAAcJ,CAAAA,CAAAA;EAC/D;;;;;;EAOAK,UACE7F,OAC4B;AAC5B,eAAO8F,2BAAM,MAAM9F,MAAM0C,IAAI,CAACrD,SAAS,KAAKwB,SAASxB,IAAAA,CAAAA,CAAAA;EACvD;EAEQwB,SAA+E,EACrFb,OACAC,OACA,GAAG8F,MAAAA,GACqD;AACxD,eAAOlG,+BAAU,MAAA;AACf,YAAM4D,eAAe,KAAKhD,OAAOsF,MAAMrF,EAAE;AACzC,YAAMrB,OAAOoE,gBAAgB,KAAKlD,eAAe;QAAE3B,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAGkH;MAAM,CAAA;AACxF,UAAItC,cAAc;AAChB,cAAM,EAAE7E,MAAMC,YAAY8B,KAAI,IAAKoF;AACnC,YAAInH,QAAQA,SAASS,KAAKT,MAAM;AAC9BS,eAAKT,OAAOA;QACd;AAEA,YAAI+B,SAAStB,KAAKsB,MAAM;AACtBtB,eAAKsB,OAAOA;QACd;AAEA,mBAAWyD,OAAOvF,YAAY;AAC5B,cAAIA,WAAWuF,GAAAA,MAAS/E,KAAKR,WAAWuF,GAAAA,GAAM;AAC5C/E,iBAAKR,WAAWuF,GAAAA,IAAOvF,WAAWuF,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK3D,OAAOpB,KAAKqB,EAAE,IAAIrB;AACvB,aAAK2B,OAAO3B,KAAKqB,EAAE,QAAIF,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAM0C,UAAU,KAAKvD,iBAAiBhB,KAAKqB,EAAE;AAC7C,UAAIkD,SAAS;AACXA,gBAAQ8B,KAAKrG,IAAAA;AACb,eAAO,KAAKgB,iBAAiBhB,KAAKqB,EAAE;MACtC;AAEA,UAAIV,OAAO;AACTA,cAAMY,QAAQ,CAACoF,YAAAA;AACb,eAAKnF,SAASmF,OAAAA;AACd,eAAKzE,SAAS;YAAEF,QAAQhC,KAAKqB;YAAIY,QAAQ0E,QAAQtF;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIT,OAAO;AACTA,cAAMW,QAAQ,CAAC,CAACF,IAAIsD,QAAAA,MAClBA,aAAa,aACT,KAAKzC,SAAS;UAAEF,QAAQhC,KAAKqB;UAAIY,QAAQZ;QAAG,CAAA,IAC5C,KAAKa,SAAS;UAAEF,QAAQX;UAAIY,QAAQjC,KAAKqB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOrB;IACT,CAAA;EACF;;;;;;;;EASA4G,aAAaC,KAAejG,QAAQ,OAAO;AACzC6F,mCAAM,MAAMI,IAAItF,QAAQ,CAACF,OAAO,KAAKyF,YAAYzF,IAAIT,KAAAA,CAAAA,CAAAA;EACvD;EAEQkG,YAAYzF,IAAYT,QAAQ,OAAO;AAC7CJ,uCAAU,MAAA;AACR,YAAMR,OAAO,KAAK6C,SAASxB,EAAAA;AAC3B,UAAI,CAACrB,MAAM;AACT;MACF;AAEA,UAAIY,OAAO;AAET,aAAKgE,UAAU;UAAE5E;QAAK,CAAA,EAAGuB,QAAQ,CAACvB,UAAAA;AAChC,eAAK+G,YAAY;YAAE/E,QAAQX;YAAIY,QAAQjC,MAAKqB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKuD,UAAU;UAAE5E;UAAM2E,UAAU;QAAU,CAAA,EAAGpD,QAAQ,CAACvB,UAAAA;AACrD,eAAK+G,YAAY;YAAE/E,QAAQhC,MAAKqB;YAAIY,QAAQZ;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKM,OAAON,EAAAA;MACrB;AAGA,aAAO,KAAKD,OAAOC,EAAAA;AACnBS,aAAOkF,KAAK,KAAK/F,YAAY,EAC1ByC,OAAO,CAACqB,QAAQA,IAAIkC,WAAW5F,EAAAA,CAAAA,EAC/BE,QAAQ,CAACwD,QAAAA;AACR,eAAO,KAAK9D,aAAa8D,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAKzC,gBAAgBjB,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOA6F,UAAUtG,OAA6C;AACrD6F,mCAAM,MAAM7F,MAAMW,QAAQ,CAAC4F,SAAS,KAAKjF,SAASiF,IAAAA,CAAAA,CAAAA;EACpD;EAEQjF,SAAS,EAAEF,QAAQC,OAAM,GAAwC;AACvEzB,uCAAU,MAAA;AACR,UAAI,CAAC,KAAKmB,OAAOK,MAAAA,GAAS;AACxB,aAAKL,OAAOK,MAAAA,QAAUb,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKF,OAAOM,MAAAA,GAAS;AACxB,aAAKN,OAAOM,MAAAA,QAAUd,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMuF,cAAc,KAAKzF,OAAOK,MAAAA;AAChC,UAAI,CAACoF,YAAYvF,SAAS2B,SAASvB,MAAAA,GAAS;AAC1CmF,oBAAYvF,SAASwF,KAAKpF,MAAAA;MAC5B;AAEA,YAAMqF,cAAc,KAAK3F,OAAOM,MAAAA;AAChC,UAAI,CAACqF,YAAY1F,QAAQ4B,SAASxB,MAAAA,GAAS;AACzCsF,oBAAY1F,QAAQyF,KAAKrF,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAuF,aAAa3G,OAA6C4G,gBAAgB,OAAO;AAC/Ef,mCAAM,MAAM7F,MAAMW,QAAQ,CAAC4F,SAAS,KAAKJ,YAAYI,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQT,YAAY,EAAE/E,QAAQC,OAAM,GAAwCuF,gBAAgB,OAAO;AACjGhH,uCAAU,MAAA;AACRiG,qCAAM,MAAA;AACJ,cAAMgB,gBAAgB,KAAK9F,OAAOK,MAAAA,GAASH,SAAS6F,UAAU,CAACrG,OAAOA,OAAOY,MAAAA;AAC7E,YAAIwF,kBAAkBhE,UAAagE,kBAAkB,IAAI;AACvD,eAAK9F,OAAOK,MAAAA,EAAQH,SAAS8F,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAKjG,OAAOM,MAAAA,GAASL,QAAQ8F,UAAU,CAACrG,OAAOA,OAAOW,MAAAA;AAC3E,YAAI4F,iBAAiBnE,UAAamE,iBAAiB,IAAI;AACrD,eAAKjG,OAAOM,MAAAA,EAAQL,QAAQ+F,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAK7F,OAAOK,MAAAA,GAASH,SAASqB,WAAW,KACzC,KAAKvB,OAAOK,MAAAA,GAASJ,QAAQsB,WAAW,KACxClB,WAAW7B,SACX;AACA,iBAAK2G,YAAY9E,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKL,OAAOM,MAAAA,GAASJ,SAASqB,WAAW,KACzC,KAAKvB,OAAOM,MAAAA,GAASL,QAAQsB,WAAW,KACxCjB,WAAW9B,SACX;AACA,iBAAK2G,YAAY7E,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAE,WAAW0F,QAAgBlD,UAAoB/D,OAAiB;AAC9DJ,uCAAU,MAAA;AACRiG,qCAAM,MAAA;AACJ,cAAMqB,UAAU,KAAKnG,OAAOkG,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQnD,QAAAA,EAAUjB,OAAO,CAACrC,OAAO,CAACT,MAAM4C,SAASnC,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAM2G,SAASpH,MAAM8C,OAAO,CAACrC,OAAOyG,QAAQnD,QAAAA,EAAUnB,SAASnC,EAAAA,CAAAA,KAAQ,CAAA;AACvEyG,kBAAQnD,QAAAA,EAAUgD,OAAO,GAAGG,QAAQnD,QAAAA,EAAUzB,QAAM,GAAK;eAAI8E;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQnD,UAAU,EAChB5E,MACA2E,WAAW,YACXrD,MACA6C,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKW,OAAO9E,MAAM2E,UAAUrD,IAAAA;IACnC;AAEA,UAAMV,QAAQ,KAAKe,OAAO3B,KAAKqB,EAAE;AACjC,QAAI,CAACT,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAM+D,QAAAA,EACVtB,IAAI,CAAChC,OAAO,KAAKD,OAAOC,EAAAA,CAAG,EAC3BqC,OAAOC,uBAAAA,EACPD,OAAO,CAACJ,MAAM,CAAChC,QAAQgC,EAAEhC,SAASA,IAAAA;IACvC;EACF;AACF;;AE1gBO,IAAM2G,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAE7G,IAAI8G,UAAUC,WAAWvD,SAASwD,cAAc,GAAGC,KAAAA,IAASJ;AACpE,QAAMK,QAAQ,CAACxD,QAAgB,GAAG1D,EAAAA,IAAM0D,GAAAA;AACxC,SAAO;IACLoD,WAAW;MAAE9G,IAAIkH,MAAM,UAAA;MAAaJ;IAAS,IAAI1E;IACjD2E,YAAY;MAAE,GAAGE;MAAMjH,IAAIkH,MAAM,WAAA;MAAcH;IAAU,IAAI3E;IAC7D4E,eACK;MACC,GAAGC;MACHjH,IAAIkH,MAAM,cAAA;MACVjH,MAAMhB;MACNqE,UAAU;MACVyD,WAAW,CAAC,EAAEpI,KAAI,MAChBqI,aAAa;QAAErI;MAAK,CAAA,GAAIqD,IAAI,CAACmF,SAAS;QAAE,GAAGA;QAAKjJ,MAAMG;QAAmB4B,MAAMhB;MAAkB,EAAA;IACrG,IACAmD;IACJoB,UACK;MACC,GAAGyD;MACHjH,IAAIkH,MAAM,SAAA;MACVjH,MAAMjB;MACNsE,UAAU;MACVyD,WAAW,CAAC,EAAEpI,KAAI,MAAO6E,QAAQ;QAAE7E;MAAK,CAAA,GAAIqD,IAAI,CAACmF,SAAS;QAAE,GAAGA;QAAKlH,MAAMjB;MAAY,EAAA;IACxF,IACAoD;IACJC,OAAOC,aAAAA,WAAAA;AACX;AAWA,IAAM8E,aAAN,MAAMA;EAAN,cAAA;AAEEC,SAAAA,aAAa;AACbC,SAAAA,QAA+B,CAAC;AAChCC,SAAAA,UAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAahE,MAAM,aAAQ;AACpD,QAAMiE,aAAaH,gBAAgBI;AACnC/I,wBAAAA,WAAU8I,YAAYE,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMH,WAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMZ,UAAUqB,IAAIpE,GAAAA;AACpB,QAAMW,SAASoC,UAAUA,QAAQpC,SAASqD,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,IAAI;IAAE,GAAGS;IAAK,CAACpE,GAAAA,GAAM;MAAEW;IAAO;EAAE;AACnGsD,aAAWN;AACX,SAAOhD;AACT;AAKO,IAAMkD,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnC/I,0BAAAA,WAAU8I,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQvB,KAAK0B,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMK,WAAW,CACtBC,WACAC,KACAvE,QAAAA;AAEA,QAAMwE,aAAaT,QAAQ,MAAA;AACzB,eAAOU,6BAAOF,IAAAA,CAAAA;EAChB,GAAGvE,GAAAA;AACH,QAAMa,cAAckD,QAAQ,MAAA;AAC1B,WAAOO,UAAU,MAAOE,WAAWE,QAAQH,IAAAA,CAAAA;EAC7C,GAAGvE,GAAAA;AACH6D,UAAQ,MAAA;AACNhD,gBAAAA;EACF,CAAA;AACA,SAAO2D,WAAWE;AACpB;AAoBO,IAAMC,eAAN,MAAMA,cAAAA;EAQXhJ,YAAYuF,SAA+C,CAAC,GAAG;AAP9C0D,SAAAA,cAAc,IAAIlB,WAAAA;AAClBmB,SAAAA,kBAAczI,oBAAAA,QAAyC,CAAC,CAAA;AACxD0I,SAAAA,yBAAyB,oBAAIC,IAAAA;AAC7BC,SAAAA,0BAA0B,oBAAID,IAAAA;AAC9BE,SAAAA,eAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIxJ,MAAM;MACtB,GAAGwF;MACHpF,eAAe,CAACQ,OAAO,KAAKe,eAAef,EAAAA;MAC3CP,gBAAgB,CAACd,MAAM2E,UAAUrD,SAAS,KAAKe,gBAAgBrC,MAAM2E,UAAUrD,IAAAA;MAC/EP,cAAc,CAACM,OAAO,KAAKiB,cAAcjB,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOkB,KAAKC,QAAiB;AAC3B,QAAI,CAACA,QAAQ;AACX,aAAO,IAAIkH,cAAAA;IACb;AAEA,UAAM,EAAE/I,OAAOC,MAAK,IAAK8B,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAIkH,cAAa;MAAE/I;MAAOC;IAAM,CAAA;EACzC;;;;;EAMA,MAAMsJ,aAAa;AACjB,WAAOC,QAAQhB,IAAIrH,OAAOkF,KAAK,KAAKiD,OAAO7I,MAAM,EAAEiC,IAAI,CAAChC,OAAO,KAAKe,eAAef,EAAAA,CAAAA,CAAAA;EACrF;EAEA,IAAIpB,QAAQ;AACV,WAAO,KAAKgK;EACd;;;;EAKAG,aAAalC,WAAuC;AAClD,QAAImC,MAAMC,QAAQpC,SAAAA,GAAY;AAC5BA,gBAAU3G,QAAQ,CAACgJ,QAAQ,KAAKH,aAAaG,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKZ,YAAYhB,MAAMT,UAAU7G,EAAE,IAAI,CAAA;AACvC,SAAKuI,YAAY1B,UAAU7G,EAAE,IAAI6G;AACjC,WAAO;EACT;;;;EAKAsC,gBAAgBnJ,IAA0B;AACxC,WAAO,KAAKuI,YAAYvI,EAAAA;AACxB,WAAO;EACT;EAEAoJ,UAAU;AACR,SAAKd,YAAYf,QAAQrH,QAAQ,CAACwH,OAAOA,GAAAA,CAAAA;AACzC,SAAKc,uBAAuBtI,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKmE,wBAAwBxI,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKiE,uBAAuBa,MAAK;AACjC,SAAKX,wBAAwBW,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAE3K,OAAO,KAAKiK,OAAOrH,MAAM+B,WAAW,YAAYQ,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAK5B,SAASxD,KAAKqB,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,KAACuJ,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMxF,iBAAiB,MAAMF,QAAQnF,MAAM;SAAIoF;MAAMpF,KAAKqB;KAAG;AAC7D,QAAIgE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAM1E,QAAQmB,OAAO8B,OAAO,KAAKgG,WAAW,EACzClG,OAAO,CAACwE,cAAcvD,cAAcuD,UAAUvD,YAAY,WAAS,EACnEjB,OAAO,CAACwE,cAAc,CAACA,UAAUxE,UAAUwE,UAAUxE,OAAO1D,IAAAA,CAAAA,EAC5D8K,QAAQ,CAAC5C,cAAAA;AACR,WAAKyB,YAAYT,mBAAmBhB,UAAU7G;AAC9C,WAAKsI,YAAYjB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKU;AACzC,YAAMjE,SAASwC,UAAUE,YAAY;QAAEpI;MAAK,CAAA,KAAM,CAAA;AAClD6I,sBAAgBI,oBAAoBxF;AACpC,aAAOiC;IACT,CAAA,EACCrC,IACC,CAACmF,SAAe;MACdnH,IAAImH,IAAInH;MACRC,MAAMkH,IAAIlH;MACV/B,MAAMiJ,IAAIjJ,QAAQ;MAClBC,YAAYgJ,IAAIhJ,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAM2K,QAAQhB,IAAIxI,MAAM0C,IAAI,CAACC,MAAM,KAAKqH,QAAQ;MAAE3K,MAAMsD;MAAGqB;MAAUQ;IAAQ,GAAG;SAAIC;MAAMpF,KAAKqB;KAAG,CAAA,CAAA;EACpG;EAEA,MAAce,eAAeyF,QAAgB;AAC3C,SAAKmC,aAAanC,MAAAA,IAAU,KAAKmC,aAAanC,MAAAA,SAAW2B,6BAAO,CAAC,CAAA;AACjE,SAAKK,uBAAuBkB,IAC1BlD,YACApC,qBAAAA,QAAO,MAAA;AACL,iBAAW,EAAEpE,IAAI8G,SAAQ,KAAMrG,OAAO8B,OAAO,KAAKgG,WAAW,GAAG;AAC9D,YAAI,CAACzB,UAAU;AACb;QACF;AAEA,aAAKwB,YAAYT,mBAAmB7H;AACpC,aAAKsI,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAI3J;AACJ,YAAI;AACFA,iBAAOmI,SAAS;YAAE9G,IAAIwG;UAAO,CAAA;QAC/B,SAASmD,KAAK;AACZvJ,sBAAAA,IAAIwJ,MAAMD,KAAK;YAAE9C,WAAW7G;UAAG,GAAA;;;;;;AAC/BI,sBAAAA,IAAIyJ,MAAM,yCAAyC7J,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwH,0BAAgBI,oBAAoBxF;QACtC;AAEA,YAAIzD,MAAM;AACR,eAAKC,MAAMuG,UAAU;YAACxG;WAAK;AAC3B,cAAI,KAAKgK,aAAahK,KAAKqB,EAAE,GAAG;AAC9B,iBAAK2I,aAAahK,KAAKqB,EAAE,EAAEoI,QAAQ,CAAC;UACtC;AACA;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAcpH,gBAAgBrC,MAAYmL,eAAyBC,WAAoB;AACrF,SAAKpB,aAAahK,KAAKqB,EAAE,IAAI,KAAK2I,aAAahK,KAAKqB,EAAE,SAAKmI,6BAAO,CAAC,CAAA;AACnE,QAAI6B,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKvB,wBAAwBgB,IAC3B/K,KAAKqB,QACLoE,qBAAAA,QAAO,MAAA;AAGL,UAAI,CAAC4F,SAAS,CAAC,KAAKtB,wBAAwBwB,IAAIvL,KAAKqB,EAAE,GAAG;AACxD;MACF;AACAgK,cAAQ;AAGRvJ,aAAOkF,KAAK,KAAK4C,WAAW;AAE5B,WAAKI,aAAahK,KAAKqB,EAAE,EAAEoI;AAG3B,YAAM9I,QAAwB,CAAA;AAC9B,iBAAW,EAAEU,IAAI+G,WAAW1E,QAAQpC,MAAMqD,WAAW,WAAU,KAAM7C,OAAO8B,OAAO,KAAKgG,WAAW,GAAG;AACpG,YACE,CAACxB,aACDzD,aAAawG,iBACZC,aAAa9J,SAAS8J,aACtB1H,UAAU,CAACA,OAAO1D,IAAAA,GACnB;AACA;QACF;AAEA,aAAK2J,YAAYT,mBAAmB7H;AACpC,aAAKsI,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAI;AACFhJ,gBAAM0G,KAAI,GAAKe,UAAU;YAAEpI;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAASgL,KAAK;AACZvJ,sBAAAA,IAAIwJ,MAAMD,KAAK;YAAE9C,WAAW7G;UAAG,GAAA;;;;;;AAC/BI,sBAAAA,IAAIyJ,MAAM,yCAAyC7J,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwH,0BAAgBI,oBAAoBxF;QACtC;MACF;AAEA,YAAMoD,MAAMlG,MAAM0C,IAAI,CAACC,MAAMA,EAAEjC,EAAE;AACjC,YAAMmK,UAAUF,SAAS5H,OAAO,CAACrC,OAAO,CAACwF,IAAIrD,SAASnC,EAAAA,CAAAA;AACtDiK,iBAAWzE;AAGX,WAAK5G,MAAMsH,aACTiE,QAAQnI,IAAI,CAACpB,YAAY;QAAED,QAAQhC,KAAKqB;QAAIY;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKhC,MAAMuG,UAAU7F,KAAAA;AACrB,WAAKV,MAAMiH,UACTvG,MAAM0C,IAAI,CAAC,EAAEhC,GAAE,MACb8J,kBAAkB,aAAa;QAAEnJ,QAAQhC,KAAKqB;QAAIY,QAAQZ;MAAG,IAAI;QAAEW,QAAQX;QAAIY,QAAQjC,KAAKqB;MAAG,CAAA,CAAA;AAGnG,WAAKpB,MAAMkC,WACTnC,KAAKqB,IACL8J,eACAxK,MAAM0C,IAAI,CAAC,EAAEhC,GAAE,MAAOA,EAAAA,CAAAA;AAExBV,YAAMY,QAAQ,CAAC+B,MAAAA;AACb,YAAI,KAAK0G,aAAa1G,EAAEjC,EAAE,GAAG;AAC3B,eAAK2I,aAAa1G,EAAEjC,EAAE,EAAEoI,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAcnH,cAAcuF,QAAgB;AAC1C,SAAKgC,uBAAuBP,IAAIzB,MAAAA,IAAAA;AAChC,SAAKkC,wBAAwBT,IAAIzB,MAAAA,IAAAA;AACjC,SAAKgC,uBAAuB4B,OAAO5D,MAAAA;AACnC,SAAKkC,wBAAwB0B,OAAO5D,MAAAA;EACtC;AACF;",
-  "names": ["import_signals_core", "import_echo_schema", "import_invariant", "import_log", "import_util", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "Graph", "constructor", "nodes", "edges", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_constructNode", "create", "_nodes", "id", "type", "forEach", "_addNode", "log", "warn", "_edges", "inbound", "outbound", "Object", "entries", "source", "target", "_addEdge", "_sortEdges", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "from", "pickle", "options", "JSON", "parse", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "values", "fromEntries", "toSorted", "a", "b", "localeCompare", "stringify", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "relation", "_getNodes", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "start", "found", "waitForPath", "params", "interval", "i", "setInterval", "wake", "finally", "clearInterval", "_addNodes", "batch", "_node", "subNode", "_removeNodes", "ids", "_removeNode", "_removeEdge", "keys", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "nodeId", "current", "unsorted", "sorted", "createExtension", "extension", "resolver", "connector", "actionGroups", "rest", "getId", "arg", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "currentExtension", "all", "toSignal", "subscribe", "get", "thisSignal", "signal", "value", "GraphBuilder", "_dispatcher", "_extensions", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "initialize", "Promise", "addExtension", "Array", "isArray", "ext", "removeExtension", "destroy", "clear", "explore", "isNode", "yieldOrContinue", "flatMap", "set", "err", "catch", "error", "nodesRelation", "nodesType", "first", "previous", "has", "removed", "delete"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, nonNullable, pick } from '@dxos/util';\n\nimport { type Relation, type Node, type NodeArg, type NodeFilter, isActionLike, actionGroupSymbol } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: DeepWriteable<T[K]> };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type NodesOptions<T = any, U extends Record<string, any> = Record<string, any>> = {\n  relation?: Relation;\n  filter?: NodeFilter<T, U>;\n  expansion?: boolean;\n  type?: string;\n};\n\n// TODO(wittjosiah): Consider having default be undefined. This is current default for backwards compatibility.\nconst DEFAULT_FILTER = (node: Node) => untracked(() => !isActionLike(node));\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n\n  /**\n   * Allow traversal to trigger expansion of the graph via `onInitialNodes`.\n   */\n  expansion?: boolean;\n};\n\nexport type GraphParams = {\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, string[]>;\n  onInitialNode?: Graph['_onInitialNode'];\n  onInitialNodes?: Graph['_onInitialNodes'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  private readonly _onInitialNode?: (id: string) => Promise<void>;\n  private readonly _onInitialNodes?: (node: Node, relation: Relation, type?: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => Promise<void>;\n\n  private readonly _waitingForNodes: Record<string, Trigger<Node>> = {};\n  private readonly _initialized: Record<string, boolean> = {};\n\n  /**\n   * @internal\n   */\n  readonly _nodes: Record<string, ReactiveObject<NodeInternal>> = {};\n\n  /**\n   * @internal\n   */\n  readonly _edges: Record<string, ReactiveObject<{ inbound: string[]; outbound: string[] }>> = {};\n\n  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode }: GraphParams = {}) {\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n\n    this._nodes[ROOT_ID] = this._constructNode({\n      id: ROOT_ID,\n      type: ROOT_TYPE,\n      cacheable: [],\n      properties: {},\n      data: null,\n    });\n    if (nodes) {\n      nodes.forEach((node) => {\n        const cacheable = Object.keys(node.properties ?? {});\n        if (node.type === ACTION_TYPE) {\n          this._addNode({ cacheable, data: () => log.warn('Pickled action invocation'), ...node });\n        } else if (node.type === ACTION_GROUP_TYPE) {\n          this._addNode({ cacheable, data: actionGroupSymbol, ...node });\n        } else {\n          this._addNode({ cacheable, ...node });\n        }\n      });\n    }\n\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        edges.forEach((target) => {\n          this._addEdge({ source, target });\n        });\n        this._sortEdges(source, 'outbound', edges);\n      });\n    }\n  }\n\n  static from(pickle: string, options: Omit<GraphParams, 'nodes' | 'edges'> = {}) {\n    const { nodes, edges } = JSON.parse(pickle);\n    return new Graph({ nodes, edges, ...options });\n  }\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = this.nodes(node);\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n        type: node.type,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  pickle() {\n    const nodes = Object.values(this._nodes)\n      .filter((node) => !!node.cacheable)\n      .map((node) => {\n        return {\n          id: node.id,\n          type: node.type,\n          properties: pick(node.properties, node.cacheable!),\n        };\n      });\n\n    const cacheable = new Set(nodes.map((node) => node.id));\n\n    const edges = Object.fromEntries(\n      Object.entries(this._edges)\n        .filter(([id]) => cacheable.has(id))\n        .map(([id, { outbound }]): [string, string[]] => [id, outbound.filter((nodeId) => cacheable.has(nodeId))])\n        // TODO(wittjosiah): Why sort?\n        .toSorted(([a], [b]) => a.localeCompare(b)),\n    );\n\n    return JSON.stringify({ nodes, edges });\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   *\n   * If a node is not found within the graph and an `onInitialNode` callback is provided,\n   * it is called with the id and type of the node, potentially initializing the node.\n   */\n  findNode(id: string, expansion = true): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode && expansion) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = DEFAULT_FILTER, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => filter(n, node));\n  }\n\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(node: Node, { relation = 'outbound' }: { relation?: Relation } = {}) {\n    return this._edges[node.id]?.[relation] ?? [];\n  }\n\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(node: Node, { expansion }: { expansion?: boolean } = {}) {\n    return [\n      ...this._getNodes({ node, expansion, type: ACTION_GROUP_TYPE }),\n      ...this._getNodes({ node, expansion, type: ACTION_TYPE }),\n    ];\n  }\n\n  async expand(node: Node, relation: Relation = 'outbound', type?: string) {\n    const key = this._key(node, relation, type);\n    const initialized = this._initialized[key];\n    if (!initialized && this._onInitialNodes) {\n      await this._onInitialNodes(node, relation, type);\n      this._initialized[key] = true;\n    }\n  }\n\n  private _key(node: Node, relation: Relation, type?: string) {\n    return `${node.id}-${relation}-${type}`;\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    path: string[] = [],\n  ): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    const shouldContinue = visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this._getNodes({ node, relation, expansion })).forEach((child) =>\n      this.traverse({ node: child, relation, visitor, expansion }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph wrapping each visitor call in an effect.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  subscribeTraverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    currentPath: string[] = [],\n  ) {\n    return effect(() => {\n      const path = [...currentPath, node.id];\n      const result = visitor(node, path);\n      if (result === false) {\n        return;\n      }\n\n      const nodes = this._getNodes({ node, relation, expansion });\n      const nodeSubscriptions = nodes.map((n) => this.subscribeTraverse({ node: n, visitor, expansion }, path));\n\n      return () => {\n        nodeSubscriptions.forEach((unsubscribe) => unsubscribe());\n      };\n    });\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      visitor: (node, path) => {\n        if (found) {\n          return false;\n        }\n\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ) {\n    const path = this.getPath(params);\n    if (path) {\n      return path;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (path) {\n        trigger.wake(path);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /**\n   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data, properties, type } = _node;\n        if (data && data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id, false);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(nonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Keys in of the properties which should be cached.\n   * If defined, the node will be included in the cache.\n   * If undefined, the node will not be included in the cache.\n   */\n  cacheable?: string[];\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties' | 'cacheable'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<Node<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Signal, effect, signal } from '@preact/signals-core';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { isNode, type MaybePromise, nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, type GraphParams } from './graph';\nimport { type Relation, type NodeArg, type Node, type ActionData, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | false | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(nonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = {\n  id: string;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n};\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _connectorSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private _graph: Graph;\n\n  constructor(params: Pick<GraphParams, 'nodes' | 'edges'> = {}) {\n    this._graph = new Graph({\n      ...params,\n      onInitialNode: (id) => this._onInitialNode(id),\n      onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string) {\n    if (!pickle) {\n      return new GraphBuilder();\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges });\n  }\n\n  /**\n   * If graph is being restored from a pickle, the data will be null.\n   * Initialize the data of each node by calling resolvers.\n   */\n  async initialize() {\n    return Promise.all(Object.keys(this._graph._nodes).map((id) => this._onInitialNode(id)));\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    if (Array.isArray(extension)) {\n      extension.forEach((ext) => this.addExtension(ext));\n      return this;\n    }\n\n    this._dispatcher.state[extension.id] = [];\n    this._extensions[extension.id] = extension;\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    delete this._extensions[id];\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          cacheable: arg.cacheable,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        for (const { id, resolver } of Object.values(this._extensions)) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | false | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          if (node) {\n            this.graph._addNodes([node]);\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          } else if (node === false) {\n            this.graph._removeNodes([nodeId]);\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private async _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        for (const { id, connector, filter, type, relation = 'outbound' } of Object.values(this._extensions)) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAAyC;AAEzC,mBAAsC;AACtC,yBAA4C;AAC5C,uBAA0B;AAC1B,iBAAoB;AACpB,kBAAqD;AENrD,IAAAA,uBAA4C;AAG5C,IAAAC,sBAAuB;AACvB,IAAAC,oBAA0B;AAC1B,IAAAC,cAAoB;AACpB,IAAAC,eAAuD;ADuChD,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;ADtF7G,IAAMO,cAAcH,OAAO,OAAA;AAIpB,IAAMI,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBF,WAAAA;AACrCI,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,aAAeQ,+BAAU,MAAM,CAACX,aAAaG,IAAAA,CAAAA;AAyC9D,IAAMS,QAAN,MAAMA,OAAAA;EAkBXC,YAAY,EAAEC,OAAOC,OAAOC,eAAeC,gBAAgBC,aAAY,IAAkB,CAAC,GAAG;AAb5EC,SAAAA,mBAAkD,CAAC;AACnDC,SAAAA,eAAwC,CAAC;kBAKM,CAAC;kBAK4B,CAAC;AAmetFC,SAAAA,iBAAiB,CAAClB,SAAAA;AACxB,iBAAOmB,2BAAqB;QAAE,GAAGnB;QAAM,CAACF,WAAAA,GAAc;MAAK,CAAA;IAC7D;AAleE,SAAKsB,iBAAiBP;AACtB,SAAKQ,kBAAkBP;AACvB,SAAKQ,gBAAgBP;AAErB,SAAKQ,OAAOpB,OAAAA,IAAW,KAAKe,eAAe;MACzCM,IAAIrB;MACJsB,MAAMrB;MACNsB,WAAW,CAAA;MACXlC,YAAY,CAAC;MACbD,MAAM;IACR,CAAA;AACA,QAAIoB,OAAO;AACTA,YAAMgB,QAAQ,CAAC3B,SAAAA;AACb,cAAM0B,YAAYE,OAAOC,KAAK7B,KAAKR,cAAc,CAAC,CAAA;AAClD,YAAIQ,KAAKyB,SAASpB,aAAa;AAC7B,eAAKyB,SAAS;YAAEJ;YAAWnC,MAAM,MAAMwC,eAAIC,KAAK,6BAAA,QAAA;;;;;;YAA8B,GAAGhC;UAAK,CAAA;QACxF,WAAWA,KAAKyB,SAASnB,mBAAmB;AAC1C,eAAKwB,SAAS;YAAEJ;YAAWnC,MAAMG;YAAmB,GAAGM;UAAK,CAAA;QAC9D,OAAO;AACL,eAAK8B,SAAS;YAAEJ;YAAW,GAAG1B;UAAK,CAAA;QACrC;MACF,CAAA;IACF;AAEA,SAAKiC,OAAO9B,OAAAA,QAAWgB,2BAAO;MAAEe,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;AAC1D,QAAIvB,OAAO;AACTgB,aAAOQ,QAAQxB,KAAAA,EAAOe,QAAQ,CAAC,CAACU,QAAQzB,MAAAA,MAAM;AAC5CA,eAAMe,QAAQ,CAACW,WAAAA;AACb,eAAKC,SAAS;YAAEF;YAAQC;UAAO,CAAA;QACjC,CAAA;AACA,aAAKE,WAAWH,QAAQ,YAAYzB,MAAAA;MACtC,CAAA;IACF;EACF;EAEA,OAAO6B,KAAKC,QAAgBC,UAAgD,CAAC,GAAG;AAC9E,UAAM,EAAEhC,OAAOC,MAAK,IAAKgC,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAIjC,OAAM;MAAEE;MAAOC;MAAO,GAAG+B;IAAQ,CAAA;EAC9C;;;;EAKA,IAAIG,OAAO;AACT,WAAO,KAAKC,SAAS5C,OAAAA;EACvB;;;;EAKA6C,OAAO,EAAExB,KAAKrB,SAAS8C,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAChD,MAAYkD,OAAiB,CAAA,MAAE;AAC7C,YAAMvC,QAAQ,KAAKA,MAAMX,IAAAA;AACzB,YAAMmD,MAA2B;QAC/B3B,IAAIxB,KAAKwB,GAAG4B,SAASH,YAAY,GAAGjD,KAAKwB,GAAG6B,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUjD,KAAKwB;QAChFC,MAAMzB,KAAKyB;MACb;AACA,UAAIzB,KAAKR,WAAW8D,OAAO;AACzBH,YAAIG,QAAQtD,KAAKR,WAAW8D;MAC9B;AACA,UAAI3C,MAAMyC,QAAQ;AAChBD,YAAIxC,QAAQA,MACT4C,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIP;YAAMlD,KAAKwB;;AAChC,iBAAOiC,SAASC,SAASF,EAAEhC,EAAE,IAAImC,SAAYX,OAAOQ,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,uBAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAML,OAAO,KAAKC,SAASvB,EAAAA;AAC3BtB,oCAAU4C,MAAM,mBAAmBtB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOwB,OAAOF,IAAAA;EAChB;EAEAJ,SAAS;AACP,UAAM/B,QAAQiB,OAAOkC,OAAO,KAAKvC,MAAM,EACpCqC,OAAO,CAAC5D,SAAS,CAAC,CAACA,KAAK0B,SAAS,EACjC6B,IAAI,CAACvD,SAAAA;AACJ,aAAO;QACLwB,IAAIxB,KAAKwB;QACTC,MAAMzB,KAAKyB;QACXjC,gBAAYuE,kBAAK/D,KAAKR,YAAYQ,KAAK0B,SAAS;MAClD;IACF,CAAA;AAEF,UAAMA,YAAY,IAAIsC,IAAIrD,MAAM4C,IAAI,CAACvD,SAASA,KAAKwB,EAAE,CAAA;AAErD,UAAMZ,QAAQgB,OAAOqC,YACnBrC,OAAOQ,QAAQ,KAAKH,MAAM,EACvB2B,OAAO,CAAC,CAACpC,EAAAA,MAAQE,UAAUwC,IAAI1C,EAAAA,CAAAA,EAC/B+B,IAAI,CAAC,CAAC/B,IAAI,EAAEW,SAAQ,CAAE,MAA0B;MAACX;MAAIW,SAASyB,OAAO,CAACO,WAAWzC,UAAUwC,IAAIC,MAAAA,CAAAA;KAAS,EAExGC,SAAS,CAAC,CAACC,CAAAA,GAAI,CAACC,CAAAA,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA,CAAAA;AAG5C,WAAO1B,KAAK4B,UAAU;MAAE7D;MAAOC;IAAM,CAAA;EACvC;;;;;;;EAQAmC,SAASvB,IAAYiD,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAKnD,OAAOC,EAAAA;AACjC,QAAI,CAACkD,gBAAgBD,WAAW;AAC9B,WAAK,KAAKrD,iBAAiBI,EAAAA;IAC7B;AAEA,WAAOkD;EACT;;;;;;;;;EAUA,MAAMC,YAAYnD,IAAYoD,SAAiC;AAC7D,UAAMC,UAAU,KAAK7D,iBAAiBQ,EAAAA,MAAQ,KAAKR,iBAAiBQ,EAAAA,IAAM,IAAIsD,qBAAAA;AAC9E,UAAM9E,OAAO,KAAK+C,SAASvB,EAAAA;AAC3B,QAAIxB,MAAM;AACR,aAAO,KAAKgB,iBAAiBQ,EAAAA;AAC7B,aAAOxB;IACT;AAEA,QAAI4E,YAAYjB,QAAW;AACzB,aAAOkB,QAAQE,KAAI;IACrB,OAAO;AACL,iBAAOC,2BAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBpD,EAAAA,EAAI;IACtE;EACF;;;;EAKAb,MAAoEX,MAAY2C,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEsC,UAAUR,WAAWb,SAASrD,gBAAgBkB,KAAI,IAAKkB;AAC/D,UAAMhC,QAAQ,KAAKuE,UAAU;MAAElF;MAAMiF;MAAUR;MAAWhD;IAAK,CAAA;AAC/D,WAAOd,MAAMiD,OAAO,CAACJ,MAAMI,OAAOJ,GAAGxD,IAAAA,CAAAA;EACvC;;;;EAKAY,MAAMZ,MAAY,EAAEiF,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKhD,OAAOjC,KAAKwB,EAAE,IAAIyD,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAE,QAAQnF,MAAY,EAAEyE,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKS,UAAU;QAAElF;QAAMyE;QAAWhD,MAAMnB;MAAkB,CAAA;SAC1D,KAAK4E,UAAU;QAAElF;QAAMyE;QAAWhD,MAAMpB;MAAY,CAAA;;EAE3D;EAEA,MAAM+E,OAAOpF,MAAYiF,WAAqB,YAAYxD,MAAe;AACvE,UAAM4D,MAAM,KAAKC,KAAKtF,MAAMiF,UAAUxD,IAAAA;AACtC,UAAM8D,cAAc,KAAKtE,aAAaoE,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAKlE,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBrB,MAAMiF,UAAUxD,IAAAA;AAC3C,WAAKR,aAAaoE,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAKtF,MAAYiF,UAAoBxD,MAAe;AAC1D,WAAO,GAAGzB,KAAKwB,EAAE,IAAIyD,QAAAA,IAAYxD,IAAAA;EACnC;;;;;;;;EASA+D,SACE,EAAEC,SAASzF,OAAO,KAAK8C,MAAMmC,WAAW,YAAYR,UAAS,GAC7DiB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAKhC,SAAS1D,KAAKwB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAMmE,iBAAiBF,QAAQzF,MAAM;SAAI0F;MAAM1F,KAAKwB;KAAG;AACvD,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA/D,WAAOkC,OAAO,KAAKoB,UAAU;MAAElF;MAAMiF;MAAUR;IAAU,CAAA,CAAA,EAAI9C,QAAQ,CAACiE,UACpE,KAAKJ,SAAS;MAAExF,MAAM4F;MAAOX;MAAUQ;MAAShB;IAAU,GAAG;SAAIiB;MAAM1F,KAAKwB;KAAG,CAAA;EAEnF;;;;;;;;EASAqE,kBACE,EAAEJ,SAASzF,OAAO,KAAK8C,MAAMmC,WAAW,YAAYR,UAAS,GAC7DqB,cAAwB,CAAA,GACxB;AACA,eAAOC,4BAAO,MAAA;AACZ,YAAML,OAAO;WAAII;QAAa9F,KAAKwB;;AACnC,YAAMwE,SAASP,QAAQzF,MAAM0F,IAAAA;AAC7B,UAAIM,WAAW,OAAO;AACpB;MACF;AAEA,YAAMrF,QAAQ,KAAKuE,UAAU;QAAElF;QAAMiF;QAAUR;MAAU,CAAA;AACzD,YAAMwB,oBAAoBtF,MAAM4C,IAAI,CAACC,MAAM,KAAKqC,kBAAkB;QAAE7F,MAAMwD;QAAGiC;QAAShB;MAAU,GAAGiB,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLO,0BAAkBtE,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAE9D,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAM8D,QAAQ,KAAKrD,SAASV,MAAAA;AAC5B,QAAI,CAAC+D,OAAO;AACV,aAAOzC;IACT;AAEA,QAAI0C;AACJ,SAAKb,SAAS;MACZxF,MAAMoG;MACNX,SAAS,CAACzF,MAAM0F,SAAAA;AACd,YAAIW,OAAO;AACT,iBAAO;QACT;AAEA,YAAIrG,KAAKwB,OAAOc,QAAQ;AACtB+D,kBAAQX;QACV;MACF;IACF,CAAA;AAEA,WAAOW;EACT;;;;EAKA,MAAMC,YACJC,QACA,EAAE3B,UAAU,KAAO4B,WAAW,IAAG,IAA8C,CAAC,GAChF;AACA,UAAMd,OAAO,KAAKS,QAAQI,MAAAA;AAC1B,QAAIb,MAAM;AACR,aAAOA;IACT;AAEA,UAAMb,UAAU,IAAIC,qBAAAA;AACpB,UAAM2B,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKS,QAAQI,MAAAA;AAC1B,UAAIb,OAAM;AACRb,gBAAQ8B,KAAKjB,KAAAA;MACf;IACF,GAAGc,QAAAA;AAEH,WAAO3B,QAAQE,KAAK;MAAEH;IAAQ,CAAA,EAAGgC,QAAQ,MAAMC,cAAcJ,CAAAA,CAAAA;EAC/D;;;;;;EAOAK,UACEnG,OAC4B;AAC5B,eAAOoG,2BAAM,MAAMpG,MAAM4C,IAAI,CAACvD,SAAS,KAAK8B,SAAS9B,IAAAA,CAAAA,CAAAA;EACvD;EAEQ8B,SAA+E,EACrFnB,OACAC,OACA,GAAGoG,MAAAA,GACqD;AACxD,eAAOxG,+BAAU,MAAA;AACf,YAAMkE,eAAe,KAAKnD,OAAOyF,MAAMxF,EAAE;AACzC,YAAMxB,OAAO0E,gBAAgB,KAAKxD,eAAe;QAAE3B,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAGwH;MAAM,CAAA;AACxF,UAAItC,cAAc;AAChB,cAAM,EAAEnF,MAAMC,YAAYiC,KAAI,IAAKuF;AACnC,YAAIzH,QAAQA,SAASS,KAAKT,MAAM;AAC9BS,eAAKT,OAAOA;QACd;AAEA,YAAIkC,SAASzB,KAAKyB,MAAM;AACtBzB,eAAKyB,OAAOA;QACd;AAEA,mBAAW4D,OAAO7F,YAAY;AAC5B,cAAIA,WAAW6F,GAAAA,MAASrF,KAAKR,WAAW6F,GAAAA,GAAM;AAC5CrF,iBAAKR,WAAW6F,GAAAA,IAAO7F,WAAW6F,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK9D,OAAOvB,KAAKwB,EAAE,IAAIxB;AACvB,aAAKiC,OAAOjC,KAAKwB,EAAE,QAAIL,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAM0C,UAAU,KAAK7D,iBAAiBhB,KAAKwB,EAAE;AAC7C,UAAIqD,SAAS;AACXA,gBAAQ8B,KAAK3G,IAAAA;AACb,eAAO,KAAKgB,iBAAiBhB,KAAKwB,EAAE;MACtC;AAEA,UAAIb,OAAO;AACTA,cAAMgB,QAAQ,CAACsF,YAAAA;AACb,eAAKnF,SAASmF,OAAAA;AACd,eAAK1E,SAAS;YAAEF,QAAQrC,KAAKwB;YAAIc,QAAQ2E,QAAQzF;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIZ,OAAO;AACTA,cAAMe,QAAQ,CAAC,CAACH,IAAIyD,QAAAA,MAClBA,aAAa,aACT,KAAK1C,SAAS;UAAEF,QAAQrC,KAAKwB;UAAIc,QAAQd;QAAG,CAAA,IAC5C,KAAKe,SAAS;UAAEF,QAAQb;UAAIc,QAAQtC,KAAKwB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOxB;IACT,CAAA;EACF;;;;;;;;EASAkH,aAAaC,KAAevG,QAAQ,OAAO;AACzCmG,mCAAM,MAAMI,IAAIxF,QAAQ,CAACH,OAAO,KAAK4F,YAAY5F,IAAIZ,KAAAA,CAAAA,CAAAA;EACvD;EAEQwG,YAAY5F,IAAYZ,QAAQ,OAAO;AAC7CJ,uCAAU,MAAA;AACR,YAAMR,OAAO,KAAK+C,SAASvB,IAAI,KAAA;AAC/B,UAAI,CAACxB,MAAM;AACT;MACF;AAEA,UAAIY,OAAO;AAET,aAAKsE,UAAU;UAAElF;QAAK,CAAA,EAAG2B,QAAQ,CAAC3B,UAAAA;AAChC,eAAKqH,YAAY;YAAEhF,QAAQb;YAAIc,QAAQtC,MAAKwB;UAAG,CAAA;QACjD,CAAA;AACA,aAAK0D,UAAU;UAAElF;UAAMiF,UAAU;QAAU,CAAA,EAAGtD,QAAQ,CAAC3B,UAAAA;AACrD,eAAKqH,YAAY;YAAEhF,QAAQrC,MAAKwB;YAAIc,QAAQd;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKS,OAAOT,EAAAA;MACrB;AAGA,aAAO,KAAKD,OAAOC,EAAAA;AACnBI,aAAOC,KAAK,KAAKZ,YAAY,EAC1B2C,OAAO,CAACyB,QAAQA,IAAIiC,WAAW9F,EAAAA,CAAAA,EAC/BG,QAAQ,CAAC0D,QAAAA;AACR,eAAO,KAAKpE,aAAaoE,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAK/D,gBAAgBE,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOA+F,UAAU3G,OAA6C;AACrDmG,mCAAM,MAAMnG,MAAMe,QAAQ,CAAC6F,SAAS,KAAKjF,SAASiF,IAAAA,CAAAA,CAAAA;EACpD;EAEQjF,SAAS,EAAEF,QAAQC,OAAM,GAAwC;AACvE9B,uCAAU,MAAA;AACR,UAAI,CAAC,KAAKyB,OAAOI,MAAAA,GAAS;AACxB,aAAKJ,OAAOI,MAAAA,QAAUlB,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKF,OAAOK,MAAAA,GAAS;AACxB,aAAKL,OAAOK,MAAAA,QAAUnB,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMsF,cAAc,KAAKxF,OAAOI,MAAAA;AAChC,UAAI,CAACoF,YAAYtF,SAASuB,SAASpB,MAAAA,GAAS;AAC1CmF,oBAAYtF,SAASuF,KAAKpF,MAAAA;MAC5B;AAEA,YAAMqF,cAAc,KAAK1F,OAAOK,MAAAA;AAChC,UAAI,CAACqF,YAAYzF,QAAQwB,SAASrB,MAAAA,GAAS;AACzCsF,oBAAYzF,QAAQwF,KAAKrF,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAuF,aAAahH,OAA6CiH,gBAAgB,OAAO;AAC/Ed,mCAAM,MAAMnG,MAAMe,QAAQ,CAAC6F,SAAS,KAAKH,YAAYG,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQR,YAAY,EAAEhF,QAAQC,OAAM,GAAwCuF,gBAAgB,OAAO;AACjGrH,uCAAU,MAAA;AACRuG,qCAAM,MAAA;AACJ,cAAMe,gBAAgB,KAAK7F,OAAOI,MAAAA,GAASF,SAAS4F,UAAU,CAACvG,OAAOA,OAAOc,MAAAA;AAC7E,YAAIwF,kBAAkBnE,UAAamE,kBAAkB,IAAI;AACvD,eAAK7F,OAAOI,MAAAA,EAAQF,SAAS6F,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAKhG,OAAOK,MAAAA,GAASJ,QAAQ6F,UAAU,CAACvG,OAAOA,OAAOa,MAAAA;AAC3E,YAAI4F,iBAAiBtE,UAAasE,iBAAiB,IAAI;AACrD,eAAKhG,OAAOK,MAAAA,EAAQJ,QAAQ8F,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAK5F,OAAOI,MAAAA,GAASF,SAASiB,WAAW,KACzC,KAAKnB,OAAOI,MAAAA,GAASH,QAAQkB,WAAW,KACxCf,WAAWlC,SACX;AACA,iBAAKiH,YAAY/E,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKJ,OAAOK,MAAAA,GAASH,SAASiB,WAAW,KACzC,KAAKnB,OAAOK,MAAAA,GAASJ,QAAQkB,WAAW,KACxCd,WAAWnC,SACX;AACA,iBAAKiH,YAAY9E,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAE,WAAW2B,QAAgBc,UAAoBrE,OAAiB;AAC9DJ,uCAAU,MAAA;AACRuG,qCAAM,MAAA;AACJ,cAAMmB,UAAU,KAAKjG,OAAOkC,MAAAA;AAC5B,YAAI+D,SAAS;AACX,gBAAMC,WAAWD,QAAQjD,QAAAA,EAAUrB,OAAO,CAACpC,OAAO,CAACZ,MAAM8C,SAASlC,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAM4G,SAASxH,MAAMgD,OAAO,CAACpC,OAAO0G,QAAQjD,QAAAA,EAAUvB,SAASlC,EAAAA,CAAAA,KAAQ,CAAA;AACvE0G,kBAAQjD,QAAAA,EAAU+C,OAAO,GAAGE,QAAQjD,QAAAA,EAAU7B,QAAM,GAAK;eAAIgF;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQjD,UAAU,EAChBlF,MACAiF,WAAW,YACXxD,MACAgD,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKW,OAAOpF,MAAMiF,UAAUxD,IAAAA;IACnC;AAEA,UAAMb,QAAQ,KAAKqB,OAAOjC,KAAKwB,EAAE;AACjC,QAAI,CAACZ,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAMqE,QAAAA,EACV1B,IAAI,CAAC/B,OAAO,KAAKD,OAAOC,EAAAA,CAAG,EAC3BoC,OAAOC,uBAAAA,EACPD,OAAO,CAACJ,MAAM,CAAC/B,QAAQ+B,EAAE/B,SAASA,IAAAA;IACvC;EACF;AACF;;AEthBO,IAAM4G,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAE9G,IAAI+G,UAAUC,WAAWrD,SAASsD,cAAc,GAAGC,KAAAA,IAASJ;AACpE,QAAMK,QAAQ,CAACtD,QAAgB,GAAG7D,EAAAA,IAAM6D,GAAAA;AACxC,SAAO;IACLkD,WAAW;MAAE/G,IAAImH,MAAM,UAAA;MAAaJ;IAAS,IAAI5E;IACjD6E,YAAY;MAAE,GAAGE;MAAMlH,IAAImH,MAAM,WAAA;MAAcH;IAAU,IAAI7E;IAC7D8E,eACK;MACC,GAAGC;MACHlH,IAAImH,MAAM,cAAA;MACVlH,MAAMnB;MACN2E,UAAU;MACVuD,WAAW,CAAC,EAAExI,KAAI,MAChByI,aAAa;QAAEzI;MAAK,CAAA,GAAIuD,IAAI,CAACqF,SAAS;QAAE,GAAGA;QAAKrJ,MAAMG;QAAmB+B,MAAMnB;MAAkB,EAAA;IACrG,IACAqD;IACJwB,UACK;MACC,GAAGuD;MACHlH,IAAImH,MAAM,SAAA;MACVlH,MAAMpB;MACN4E,UAAU;MACVuD,WAAW,CAAC,EAAExI,KAAI,MAAOmF,QAAQ;QAAEnF;MAAK,CAAA,GAAIuD,IAAI,CAACqF,SAAS;QAAE,GAAGA;QAAKnH,MAAMpB;MAAY,EAAA;IACxF,IACAsD;IACJC,OAAOC,aAAAA,WAAAA;AACX;AAWA,IAAMgF,aAAN,MAAMA;EAAN,cAAA;AAEEC,SAAAA,aAAa;AACbC,SAAAA,QAA+B,CAAC;AAChCC,SAAAA,UAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAa9D,MAAM,aAAQ;AACpD,QAAM+D,aAAaH,gBAAgBI;AACnCnJ,wBAAAA,WAAUkJ,YAAYE,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMH,WAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMZ,UAAUqB,IAAIlE,GAAAA;AACpB,QAAMW,SAASkC,UAAUA,QAAQlC,SAASmD,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,IAAI;IAAE,GAAGS;IAAK,CAAClE,GAAAA,GAAM;MAAEW;IAAO;EAAE;AACnGoD,aAAWN;AACX,SAAO9C;AACT;AAKO,IAAMgD,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCnJ,0BAAAA,WAAUkJ,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQtB,KAAKyB,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMK,WAAW,CACtBC,WACAC,KACArE,QAAAA;AAEA,QAAMsE,aAAaT,QAAQ,MAAA;AACzB,eAAOU,6BAAOF,IAAAA,CAAAA;EAChB,GAAGrE,GAAAA;AACH,QAAMa,cAAcgD,QAAQ,MAAA;AAC1B,WAAOO,UAAU,MAAOE,WAAWE,QAAQH,IAAAA,CAAAA;EAC7C,GAAGrE,GAAAA;AACH2D,UAAQ,MAAA;AACN9C,gBAAAA;EACF,CAAA;AACA,SAAOyD,WAAWE;AACpB;AAoBO,IAAMC,eAAN,MAAMA,cAAAA;EAQXpJ,YAAY6F,SAA+C,CAAC,GAAG;AAP9CwD,SAAAA,cAAc,IAAIlB,WAAAA;AAClBmB,SAAAA,kBAAc7I,oBAAAA,QAAyC,CAAC,CAAA;AACxD8I,SAAAA,yBAAyB,oBAAIC,IAAAA;AAC7BC,SAAAA,0BAA0B,oBAAID,IAAAA;AAC9BE,SAAAA,eAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAI5J,MAAM;MACtB,GAAG8F;MACH1F,eAAe,CAACW,OAAO,KAAKJ,eAAeI,EAAAA;MAC3CV,gBAAgB,CAACd,MAAMiF,UAAUxD,SAAS,KAAKJ,gBAAgBrB,MAAMiF,UAAUxD,IAAAA;MAC/EV,cAAc,CAACS,OAAO,KAAKF,cAAcE,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOiB,KAAKC,QAAiB;AAC3B,QAAI,CAACA,QAAQ;AACX,aAAO,IAAIoH,cAAAA;IACb;AAEA,UAAM,EAAEnJ,OAAOC,MAAK,IAAKgC,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAIoH,cAAa;MAAEnJ;MAAOC;IAAM,CAAA;EACzC;;;;;EAMA,MAAM0J,aAAa;AACjB,WAAOC,QAAQhB,IAAI3H,OAAOC,KAAK,KAAKwI,OAAO9I,MAAM,EAAEgC,IAAI,CAAC/B,OAAO,KAAKJ,eAAeI,EAAAA,CAAAA,CAAAA;EACrF;EAEA,IAAIvB,QAAQ;AACV,WAAO,KAAKoK;EACd;;;;EAKAG,aAAalC,WAAuC;AAClD,QAAImC,MAAMC,QAAQpC,SAAAA,GAAY;AAC5BA,gBAAU3G,QAAQ,CAACgJ,QAAQ,KAAKH,aAAaG,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKZ,YAAYhB,MAAMT,UAAU9G,EAAE,IAAI,CAAA;AACvC,SAAKwI,YAAY1B,UAAU9G,EAAE,IAAI8G;AACjC,WAAO;EACT;;;;EAKAsC,gBAAgBpJ,IAA0B;AACxC,WAAO,KAAKwI,YAAYxI,EAAAA;AACxB,WAAO;EACT;EAEAqJ,UAAU;AACR,SAAKd,YAAYf,QAAQrH,QAAQ,CAACwH,OAAOA,GAAAA,CAAAA;AACzC,SAAKc,uBAAuBtI,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKiE,wBAAwBxI,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;AACtD,SAAK+D,uBAAuBa,MAAK;AACjC,SAAKX,wBAAwBW,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAE/K,OAAO,KAAKqK,OAAOvH,MAAMmC,WAAW,YAAYQ,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAKhC,SAAS1D,KAAKwB,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,KAACwJ,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMtF,iBAAiB,MAAMF,QAAQzF,MAAM;SAAI0F;MAAM1F,KAAKwB;KAAG;AAC7D,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMhF,QAAQiB,OAAOkC,OAAO,KAAKkG,WAAW,EACzCpG,OAAO,CAAC0E,cAAcrD,cAAcqD,UAAUrD,YAAY,WAAS,EACnErB,OAAO,CAAC0E,cAAc,CAACA,UAAU1E,UAAU0E,UAAU1E,OAAO5D,IAAAA,CAAAA,EAC5DkL,QAAQ,CAAC5C,cAAAA;AACR,WAAKyB,YAAYT,mBAAmBhB,UAAU9G;AAC9C,WAAKuI,YAAYjB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKU;AACzC,YAAM/D,SAASsC,UAAUE,YAAY;QAAExI;MAAK,CAAA,KAAM,CAAA;AAClDiJ,sBAAgBI,oBAAoB1F;AACpC,aAAOqC;IACT,CAAA,EACCzC,IACC,CAACqF,SAAe;MACdpH,IAAIoH,IAAIpH;MACRC,MAAMmH,IAAInH;MACVC,WAAWkH,IAAIlH;MACfnC,MAAMqJ,IAAIrJ,QAAQ;MAClBC,YAAYoJ,IAAIpJ,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAM+K,QAAQhB,IAAI5I,MAAM4C,IAAI,CAACC,MAAM,KAAKuH,QAAQ;MAAE/K,MAAMwD;MAAGyB;MAAUQ;IAAQ,GAAG;SAAIC;MAAM1F,KAAKwB;KAAG,CAAA,CAAA;EACpG;EAEA,MAAcJ,eAAe+C,QAAgB;AAC3C,SAAKiG,aAAajG,MAAAA,IAAU,KAAKiG,aAAajG,MAAAA,SAAWyF,6BAAO,CAAC,CAAA;AACjE,SAAKK,uBAAuBkB,IAC1BhH,YACA4B,qBAAAA,QAAO,MAAA;AACL,iBAAW,EAAEvE,IAAI+G,SAAQ,KAAM3G,OAAOkC,OAAO,KAAKkG,WAAW,GAAG;AAC9D,YAAI,CAACzB,UAAU;AACb;QACF;AAEA,aAAKwB,YAAYT,mBAAmB9H;AACpC,aAAKuI,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAI/J;AACJ,YAAI;AACFA,iBAAOuI,SAAS;YAAE/G,IAAI2C;UAAO,CAAA;QAC/B,SAASiH,KAAK;AACZrJ,sBAAAA,IAAIsJ,MAAMD,KAAK;YAAE9C,WAAW9G;UAAG,GAAA;;;;;;AAC/BO,sBAAAA,IAAIuJ,MAAM,yCAAyC9J,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEyH,0BAAgBI,oBAAoB1F;QACtC;AAEA,YAAI3D,MAAM;AACR,eAAKC,MAAM6G,UAAU;YAAC9G;WAAK;AAC3B,cAAI,KAAKoK,aAAapK,KAAKwB,EAAE,GAAG;AAC9B,iBAAK4I,aAAapK,KAAKwB,EAAE,EAAEqI,QAAQ,CAAC;UACtC;AACA;QACF,WAAW7J,SAAS,OAAO;AACzB,eAAKC,MAAMiH,aAAa;YAAC/C;WAAO;AAChC;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAc9C,gBAAgBrB,MAAYuL,eAAyBC,WAAoB;AACrF,SAAKpB,aAAapK,KAAKwB,EAAE,IAAI,KAAK4I,aAAapK,KAAKwB,EAAE,SAAKoI,6BAAO,CAAC,CAAA;AACnE,QAAI6B,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKvB,wBAAwBgB,IAC3BnL,KAAKwB,QACLuE,qBAAAA,QAAO,MAAA;AAGL,UAAI,CAAC0F,SAAS,CAAC,KAAKtB,wBAAwBjG,IAAIlE,KAAKwB,EAAE,GAAG;AACxD;MACF;AACAiK,cAAQ;AAGR7J,aAAOC,KAAK,KAAKmI,WAAW;AAE5B,WAAKI,aAAapK,KAAKwB,EAAE,EAAEqI;AAG3B,YAAMlJ,QAAwB,CAAA;AAC9B,iBAAW,EAAEa,IAAIgH,WAAW5E,QAAQnC,MAAMwD,WAAW,WAAU,KAAMrD,OAAOkC,OAAO,KAAKkG,WAAW,GAAG;AACpG,YACE,CAACxB,aACDvD,aAAasG,iBACZC,aAAa/J,SAAS+J,aACtB5H,UAAU,CAACA,OAAO5D,IAAAA,GACnB;AACA;QACF;AAEA,aAAK+J,YAAYT,mBAAmB9H;AACpC,aAAKuI,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAI;AACFpJ,gBAAM+G,KAAI,GAAKc,UAAU;YAAExI;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAASoL,KAAK;AACZrJ,sBAAAA,IAAIsJ,MAAMD,KAAK;YAAE9C,WAAW9G;UAAG,GAAA;;;;;;AAC/BO,sBAAAA,IAAIuJ,MAAM,yCAAyC9J,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEyH,0BAAgBI,oBAAoB1F;QACtC;MACF;AAEA,YAAMwD,MAAMxG,MAAM4C,IAAI,CAACC,MAAMA,EAAEhC,EAAE;AACjC,YAAMmK,UAAUD,SAAS9H,OAAO,CAACpC,OAAO,CAAC2F,IAAIzD,SAASlC,EAAAA,CAAAA;AACtDkK,iBAAWvE;AAGX,WAAKlH,MAAM2H,aACT+D,QAAQpI,IAAI,CAACjB,YAAY;QAAED,QAAQrC,KAAKwB;QAAIc;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKrC,MAAM6G,UAAUnG,KAAAA;AACrB,WAAKV,MAAMsH,UACT5G,MAAM4C,IAAI,CAAC,EAAE/B,GAAE,MACb+J,kBAAkB,aAAa;QAAElJ,QAAQrC,KAAKwB;QAAIc,QAAQd;MAAG,IAAI;QAAEa,QAAQb;QAAIc,QAAQtC,KAAKwB;MAAG,CAAA,CAAA;AAGnG,WAAKvB,MAAMuC,WACTxC,KAAKwB,IACL+J,eACA5K,MAAM4C,IAAI,CAAC,EAAE/B,GAAE,MAAOA,EAAAA,CAAAA;AAExBb,YAAMgB,QAAQ,CAAC6B,MAAAA;AACb,YAAI,KAAK4G,aAAa5G,EAAEhC,EAAE,GAAG;AAC3B,eAAK4I,aAAa5G,EAAEhC,EAAE,EAAEqI,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAcvI,cAAc6C,QAAgB;AAC1C,SAAK8F,uBAAuBP,IAAIvF,MAAAA,IAAAA;AAChC,SAAKgG,wBAAwBT,IAAIvF,MAAAA,IAAAA;AACjC,SAAK8F,uBAAuB2B,OAAOzH,MAAAA;AACnC,SAAKgG,wBAAwByB,OAAOzH,MAAAA;EACtC;AACF;",
+  "names": ["import_signals_core", "import_echo_schema", "import_invariant", "import_log", "import_util", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "Graph", "constructor", "nodes", "edges", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_constructNode", "create", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "_nodes", "id", "type", "cacheable", "forEach", "Object", "keys", "_addNode", "log", "warn", "_edges", "inbound", "outbound", "entries", "source", "target", "_addEdge", "_sortEdges", "from", "pickle", "options", "JSON", "parse", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "values", "pick", "Set", "fromEntries", "has", "nodeId", "toSorted", "a", "b", "localeCompare", "stringify", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "relation", "_getNodes", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "start", "found", "waitForPath", "params", "interval", "i", "setInterval", "wake", "finally", "clearInterval", "_addNodes", "batch", "_node", "subNode", "_removeNodes", "ids", "_removeNode", "_removeEdge", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "current", "unsorted", "sorted", "createExtension", "extension", "resolver", "connector", "actionGroups", "rest", "getId", "arg", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "currentExtension", "all", "toSignal", "subscribe", "get", "thisSignal", "signal", "value", "GraphBuilder", "_dispatcher", "_extensions", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "initialize", "Promise", "addExtension", "Array", "isArray", "ext", "removeExtension", "destroy", "clear", "explore", "isNode", "yieldOrContinue", "flatMap", "set", "err", "catch", "error", "nodesRelation", "nodesType", "first", "previous", "removed", "delete"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5363,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":61441,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":46212,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":56883},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":15004},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":9707}},"bytes":25631}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5675,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":63106,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":46847,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":58246},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":15394},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":9862}},"bytes":26176}}}

package/dist/lib/node-esm/index.mjs

@@ -6,7 +6,7 @@ import { asyncTimeout, Trigger } from "@dxos/async";
 import { create } from "@dxos/echo-schema";
 import { invariant } from "@dxos/invariant";
 import { log } from "@dxos/log";
-import { nonNullable } from "@dxos/util";
+import { nonNullable, pick } from "@dxos/util";
 
 // packages/sdk/app-graph/src/node.ts
 var isGraphNode = (data) => data && typeof data === "object" && "id" in data && "properties" in data && data.properties ? typeof data.properties === "object" && "data" in data : false;
@@ -54,31 +54,41 @@ var Graph = class _Graph {
         [graphSymbol]: this
       });
     };
+    this._onInitialNode = onInitialNode;
+    this._onInitialNodes = onInitialNodes;
+    this._onRemoveNode = onRemoveNode;
     this._nodes[ROOT_ID] = this._constructNode({
       id: ROOT_ID,
       type: ROOT_TYPE,
+      cacheable: [],
       properties: {},
       data: null
     });
     if (nodes) {
       nodes.forEach((node) => {
+        const cacheable = Object.keys(node.properties ?? {});
         if (node.type === ACTION_TYPE) {
           this._addNode({
-            ...node,
+            cacheable,
             data: () => log.warn("Pickled action invocation", void 0, {
               F: __dxlog_file,
-              L: 103,
+              L: 113,
               S: this,
               C: (f, a) => f(...a)
-            })
+            }),
+            ...node
           });
         } else if (node.type === ACTION_GROUP_TYPE) {
           this._addNode({
-            ...node,
-            data: actionGroupSymbol
+            cacheable,
+            data: actionGroupSymbol,
+            ...node
           });
         } else {
-          this._addNode(node);
+          this._addNode({
+            cacheable,
+            ...node
+          });
         }
       });
     }
@@ -97,9 +107,6 @@ var Graph = class _Graph {
         this._sortEdges(source, "outbound", edges2);
       });
     }
-    this._onInitialNode = onInitialNode;
-    this._onInitialNodes = onInitialNodes;
-    this._onRemoveNode = onRemoveNode;
   }
   static from(pickle, options = {}) {
     const { nodes, edges } = JSON.parse(pickle);
@@ -142,7 +149,7 @@ var Graph = class _Graph {
     const root = this.findNode(id);
     invariant(root, `Node not found: ${id}`, {
       F: __dxlog_file,
-      L: 165,
+      L: 171,
       S: this,
       A: [
         "root",
@@ -152,16 +159,17 @@ var Graph = class _Graph {
     return toJSON(root);
   }
   pickle() {
-    const nodes = Object.values(this._nodes).map((node) => {
+    const nodes = Object.values(this._nodes).filter((node) => !!node.cacheable).map((node) => {
       return {
         id: node.id,
         type: node.type,
-        properties: node.properties
+        properties: pick(node.properties, node.cacheable)
       };
     });
-    const edges = Object.fromEntries(Object.entries(this._edges).map(([id, { outbound }]) => [
+    const cacheable = new Set(nodes.map((node) => node.id));
+    const edges = Object.fromEntries(Object.entries(this._edges).filter(([id]) => cacheable.has(id)).map(([id, { outbound }]) => [
       id,
-      outbound
+      outbound.filter((nodeId) => cacheable.has(nodeId))
     ]).toSorted(([a], [b]) => a.localeCompare(b)));
     return JSON.stringify({
       nodes,
@@ -428,7 +436,7 @@ var Graph = class _Graph {
   }
   _removeNode(id, edges = false) {
     untracked(() => {
-      const node = this.findNode(id);
+      const node = this.findNode(id, false);
       if (!node) {
         return;
       }
@@ -754,6 +762,7 @@ var GraphBuilder = class _GraphBuilder {
     }).map((arg) => ({
       id: arg.id,
       type: arg.type,
+      cacheable: arg.cacheable,
       data: arg.data ?? null,
       properties: arg.properties ?? {}
     }));
@@ -786,13 +795,13 @@ var GraphBuilder = class _GraphBuilder {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 318,
+            L: 319,
             S: this,
             C: (f, a) => f(...a)
           });
           log2.error(`Previous error occurred in extension: ${id}`, void 0, {
             F: __dxlog_file2,
-            L: 319,
+            L: 320,
             S: this,
             C: (f, a) => f(...a)
           });
@@ -807,6 +816,11 @@ var GraphBuilder = class _GraphBuilder {
             this._nodeChanged[node.id].value = {};
           }
           break;
+        } else if (node === false) {
+          this.graph._removeNodes([
+            nodeId
+          ]);
+          break;
         }
       }
     }));
@@ -839,13 +853,13 @@ var GraphBuilder = class _GraphBuilder {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 373,
+            L: 377,
             S: this,
             C: (f, a) => f(...a)
           });
           log2.error(`Previous error occurred in extension: ${id}`, void 0, {
             F: __dxlog_file2,
-            L: 374,
+            L: 378,
             S: this,
             C: (f, a) => f(...a)
           });