@dxos/app-graph 0.6.3-main.d007b87 → 0.6.3-main.d76104f

package/dist/lib/browser/index.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts", "../../../src/helpers.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-core';\n\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { isActionLike, type EdgeDirection, type Node, type NodeArg, type NodeBase } from './node';\n\nexport const ROOT_ID = 'root';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  direction?: EdgeDirection;\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node, path: string[]) => void;\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  /**\n   * @internal\n   */\n  readonly _nodes = create<Record<string, NodeBase>>({\n    [ROOT_ID]: { id: ROOT_ID, properties: {}, data: null },\n  });\n\n  /**\n   * @internal\n   */\n  // Key is the `${node.id}-${direction}` and value is an ordered list of node ids.\n  // Explicit type required because TS says this is not portable.\n  readonly _edges = create<Record<string, string[]>>({});\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 = node.nodes();\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\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  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const nodeBase = this._nodes[id];\n    if (!nodeBase) {\n      return undefined;\n    }\n\n    return this._constructNode(nodeBase);\n  }\n\n  private _constructNode = (nodeBase: NodeBase): Node => {\n    const node: Node = {\n      ...nodeBase,\n      edges: ({ direction = 'outbound' } = {}) => {\n        return this._edges[this.getEdgeKey(node.id, direction)];\n      },\n      nodes: ({ direction, filter } = {}) => {\n        const nodes = this._getNodes({ id: node.id, direction }).filter((n) => !isActionLike(n));\n        return filter ? nodes.filter((n) => filter(n, node)) : nodes;\n      },\n      node: (id: string) => {\n        return this._getNodes({ id }).find((node) => node.id === id);\n      },\n      actions: () => {\n        return this._getNodes({ id: node.id }).filter(isActionLike);\n      },\n    };\n\n    return node;\n  };\n\n  private _getNodes({ id, direction = 'outbound' }: { id: string; direction?: EdgeDirection }): Node[] {\n    const edges = this._edges[this.getEdgeKey(id, direction)];\n    if (!edges) {\n      return [];\n    }\n\n    return edges.map((id) => this.findNode(id)).filter(nonNullable);\n  }\n\n  private getEdgeKey(id: string, direction: EdgeDirection) {\n    return `${id}-${direction}`;\n  }\n\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    ...nodes: NodeArg<TData, TProperties>[]\n  ): Node<TData, TProperties>[] {\n    return 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 node = { data: null, properties: {}, ..._node };\n      this._nodes[node.id] = node;\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, direction]) =>\n          direction === 'outbound'\n            ? this.addEdge({ source: node.id, target: id })\n            : this.addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return this._constructNode(node) as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param id The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   */\n  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 node.\n        delete this._edges[this.getEdgeKey(id, 'outbound')];\n        delete this._edges[this.getEdgeKey(id, 'inbound')];\n\n        // Remove edges from connected nodes.\n        this._getNodes({ id }).forEach((node) => this.removeEdge({ source: id, target: node.id }));\n        this._getNodes({ id, direction: 'inbound' }).forEach((node) =>\n          this.removeEdge({ source: node.id, target: id }),\n        );\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n    });\n  }\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outbound = this._edges[this.getEdgeKey(source, 'outbound')];\n      if (!outbound) {\n        this._edges[this.getEdgeKey(source, 'outbound')] = [target];\n      } else if (!outbound.includes(target)) {\n        outbound.push(target);\n      }\n\n      const inbound = this._edges[this.getEdgeKey(target, 'inbound')];\n      if (!inbound) {\n        this._edges[this.getEdgeKey(target, 'inbound')] = [source];\n      } else if (!inbound.includes(source)) {\n        inbound.push(source);\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 direction The direction of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   */\n  sortEdges(nodeId: string, direction: EdgeDirection, edges: string[]) {\n    untracked(() => {\n      const current = this._edges[this.getEdgeKey(nodeId, direction)];\n      if (current) {\n        const unsorted = current.filter((id) => !edges.includes(id)) ?? [];\n        const sorted = edges.filter((id) => current.includes(id)) ?? [];\n        current.splice(0, current.length, ...[...sorted, ...unsorted]);\n      }\n    });\n  }\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outboundIndex = this._edges[this.getEdgeKey(source, 'outbound')]?.findIndex((id) => id === target);\n      if (outboundIndex !== -1) {\n        this._edges[this.getEdgeKey(source, 'outbound')].splice(outboundIndex, 1);\n      }\n\n      const inboundIndex = this._edges[this.getEdgeKey(target, 'inbound')]?.findIndex((id) => id === source);\n      if (inboundIndex !== -1) {\n        this._edges[this.getEdgeKey(target, 'inbound')].splice(inboundIndex, 1);\n      }\n    });\n  }\n\n  /**\n   * Recursive depth-first traversal.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.direction The direction to traverse graph edges.\n   * @param options.filter A predicate to filter nodes which are passed to the `visitor` callback.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse({ node = this.root, direction = 'outbound', filter, visitor }: TraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    if (!filter || filter(node)) {\n      visitor?.(node, [...path, node.id]);\n    }\n\n    Object.values(this._getNodes({ id: node.id, direction })).forEach((child) =>\n      this.traverse({ node: child, direction, filter, visitor }, [...path, node.id]),\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      filter: () => !found,\n      visitor: (node, path) => {\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\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.\nexport type NodeBase<TData = any, TProperties extends Record<string, any> = Record<string, any>> = {\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: 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 EdgeDirection = 'outbound' | 'inbound';\n\nexport type ConnectedNodes = {\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(params?: { direction?: EdgeDirection }): Readonly<string[]>;\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>>(params?: {\n    direction?: EdgeDirection;\n    filter?: NodeFilter<T, U>;\n  }): Node<T>[];\n\n  /**\n   * Get a specific connected node by id.\n   */\n  node(id: string): Node | undefined;\n};\n\nexport type ConnectedActions = {\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(): ActionLike[];\n};\n\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<TData, TProperties>, 'properties'> & { properties: Readonly<TProperties> } & ConnectedNodes &\n    ConnectedActions\n>;\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  NodeBase<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, EdgeDirection][];\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<NodeBase<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  } & ConnectedNodes\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<NodeBase<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  } & ConnectedActions\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 { EventSubscriptions, type UnsubscribeCallback } from '@dxos/async';\n\nimport { Graph } from './graph';\n\nexport type BuilderExtension = (graph: Graph) => UnsubscribeCallback | void;\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\nexport class GraphBuilder {\n  private readonly _extensions = new Map<string, BuilderExtension>();\n  private readonly _unsubscribe = new EventSubscriptions();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(id: string, extension: BuilderExtension): GraphBuilder {\n    this._extensions.set(id, extension);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    this._extensions.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered extensions.\n   * @param previousGraph If provided, the graph will be updated in place.\n   */\n  build(previousGraph?: Graph): Graph {\n    // Clear previous extension subscriptions.\n    this._unsubscribe.clear();\n\n    const graph: Graph = previousGraph ?? new Graph();\n\n    Array.from(this._extensions.values()).forEach((builder) => {\n      const unsubscribe = builder(graph);\n      unsubscribe && this._unsubscribe.add(unsubscribe);\n    });\n\n    return graph;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Graph } from './graph';\nimport { type Node, type NodeArg } from './node';\n\n/**\n * If the condition is true, adds the nodes to the graph, otherwise removes the nodes from the graph.\n */\nexport const manageNodes = <TData = null, TProperties extends Record<string, any> = Record<string, any>>({\n  graph,\n  condition,\n  nodes,\n  removeEdges,\n}: {\n  graph: Graph;\n  condition: boolean;\n  nodes: NodeArg<TData, TProperties>[];\n  removeEdges?: boolean;\n}): Node<TData, TProperties>[] | void => {\n  if (condition) {\n    return graph.addNodes(...nodes);\n  } else {\n    nodes.forEach(({ id }) => graph.removeNode(id, removeEdges));\n  }\n};\n"],
-  "mappings": ";AAIA,SAASA,iBAAiB;AAE1B,SAASC,cAAc;AACvB,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;;AC4DrB,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;;;;AD3GtG,IAAMO,UAAU;AA+BhB,IAAMC,QAAN,MAAMA;EAAN;AAIIC;;;kBAASC,OAAiC;MACjD,CAACH,OAAAA,GAAU;QAAEI,IAAIJ;QAASK,YAAY,CAAC;QAAGC,MAAM;MAAK;IACvD,CAAA;AAOSC;;;;;kBAASJ,OAAiC,CAAC,CAAA;AAkD5CK,0BAAiB,CAACC,aAAAA;AACxB,YAAMC,OAAa;QACjB,GAAGD;QACHE,OAAO,CAAC,EAAEC,YAAY,WAAU,IAAK,CAAC,MAAC;AACrC,iBAAO,KAAKL,OAAO,KAAKM,WAAWH,KAAKN,IAAIQ,SAAAA,CAAAA;QAC9C;QACAE,OAAO,CAAC,EAAEF,WAAWG,OAAM,IAAK,CAAC,MAAC;AAChC,gBAAMD,QAAQ,KAAKE,UAAU;YAAEZ,IAAIM,KAAKN;YAAIQ;UAAU,CAAA,EAAGG,OAAO,CAACE,MAAM,CAACC,aAAaD,CAAAA,CAAAA;AACrF,iBAAOF,SAASD,MAAMC,OAAO,CAACE,MAAMF,OAAOE,GAAGP,IAAAA,CAAAA,IAASI;QACzD;QACAJ,MAAM,CAACN,OAAAA;AACL,iBAAO,KAAKY,UAAU;YAAEZ;UAAG,CAAA,EAAGe,KAAK,CAACT,UAASA,MAAKN,OAAOA,EAAAA;QAC3D;QACAgB,SAAS,MAAA;AACP,iBAAO,KAAKJ,UAAU;YAAEZ,IAAIM,KAAKN;UAAG,CAAA,EAAGW,OAAOG,YAAAA;QAChD;MACF;AAEA,aAAOR;IACT;;;;;EAhEA,IAAIW,OAAO;AACT,WAAO,KAAKC,SAAStB,OAAAA;EACvB;;;;EAKAuB,OAAO,EAAEnB,KAAKJ,SAASwB,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAACb,MAAYe,OAAiB,CAAA,MAAE;AAC7C,YAAMX,QAAQJ,KAAKI,MAAK;AACxB,YAAMY,MAA2B;QAC/BtB,IAAIM,KAAKN,GAAGuB,SAASH,YAAY,GAAGd,KAAKN,GAAGwB,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUd,KAAKN;MAClF;AACA,UAAIM,KAAKL,WAAWwB,OAAO;AACzBH,YAAIG,QAAQnB,KAAKL,WAAWwB;MAC9B;AACA,UAAIf,MAAMa,QAAQ;AAChBD,YAAIZ,QAAQA,MACTgB,IAAI,CAACb,MAAAA;AAEJ,gBAAMc,WAAW;eAAIN;YAAMf,KAAKN;;AAChC,iBAAO2B,SAASC,SAASf,EAAEb,EAAE,IAAI6B,SAAYV,OAAON,GAAGc,QAAAA;QACzD,CAAA,EACChB,OAAOmB,WAAAA;MACZ;AACA,aAAOR;IACT;AAEA,UAAML,OAAO,KAAKC,SAASlB,EAAAA;AAC3B+B,cAAUd,MAAM,mBAAmBjB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOmB,OAAOF,IAAAA;EAChB;;;;EAKAC,SAASlB,IAA8B;AACrC,UAAMK,WAAW,KAAKP,OAAOE,EAAAA;AAC7B,QAAI,CAACK,UAAU;AACb,aAAOwB;IACT;AAEA,WAAO,KAAKzB,eAAeC,QAAAA;EAC7B;EAuBQO,UAAU,EAAEZ,IAAIQ,YAAY,WAAU,GAAuD;AACnG,UAAMD,QAAQ,KAAKJ,OAAO,KAAKM,WAAWT,IAAIQ,SAAAA,CAAAA;AAC9C,QAAI,CAACD,OAAO;AACV,aAAO,CAAA;IACT;AAEA,WAAOA,MAAMmB,IAAI,CAAC1B,QAAO,KAAKkB,SAASlB,GAAAA,CAAAA,EAAKW,OAAOmB,WAAAA;EACrD;EAEQrB,WAAWT,IAAYQ,WAA0B;AACvD,WAAO,GAAGR,EAAAA,IAAMQ,SAAAA;EAClB;;;;EAKAwB,YACKtB,OACyB;AAC5B,WAAOA,MAAMgB,IAAI,CAACpB,SAAS,KAAK2B,SAAS3B,IAAAA,CAAAA;EAC3C;EAEQ2B,SAA+E,EACrFvB,OACAH,OACA,GAAG2B,MAAAA,GACqD;AACxD,WAAOC,UAAU,MAAA;AACf,YAAM7B,OAAO;QAAEJ,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAGiC;MAAM;AACpD,WAAKpC,OAAOQ,KAAKN,EAAE,IAAIM;AAEvB,UAAII,OAAO;AACTA,cAAM0B,QAAQ,CAACC,YAAAA;AACb,eAAKJ,SAASI,OAAAA;AACd,eAAKC,QAAQ;YAAEC,QAAQjC,KAAKN;YAAIwC,QAAQH,QAAQrC;UAAG,CAAA;QACrD,CAAA;MACF;AAEA,UAAIO,OAAO;AACTA,cAAM6B,QAAQ,CAAC,CAACpC,IAAIQ,SAAAA,MAClBA,cAAc,aACV,KAAK8B,QAAQ;UAAEC,QAAQjC,KAAKN;UAAIwC,QAAQxC;QAAG,CAAA,IAC3C,KAAKsC,QAAQ;UAAEC,QAAQvC;UAAIwC,QAAQlC,KAAKN;QAAG,CAAA,CAAA;MAEnD;AAEA,aAAO,KAAKI,eAAeE,IAAAA;IAC7B,CAAA;EACF;;;;;;;EAQAmC,WAAWzC,IAAYO,QAAQ,OAAO;AACpC4B,cAAU,MAAA;AACR,YAAM7B,OAAO,KAAKY,SAASlB,EAAAA;AAC3B,UAAI,CAACM,MAAM;AACT;MACF;AAEA,UAAIC,OAAO;AAET,eAAO,KAAKJ,OAAO,KAAKM,WAAWT,IAAI,UAAA,CAAA;AACvC,eAAO,KAAKG,OAAO,KAAKM,WAAWT,IAAI,SAAA,CAAA;AAGvC,aAAKY,UAAU;UAAEZ;QAAG,CAAA,EAAGoC,QAAQ,CAAC9B,UAAS,KAAKoC,WAAW;UAAEH,QAAQvC;UAAIwC,QAAQlC,MAAKN;QAAG,CAAA,CAAA;AACvF,aAAKY,UAAU;UAAEZ;UAAIQ,WAAW;QAAU,CAAA,EAAG4B,QAAQ,CAAC9B,UACpD,KAAKoC,WAAW;UAAEH,QAAQjC,MAAKN;UAAIwC,QAAQxC;QAAG,CAAA,CAAA;MAElD;AAGA,aAAO,KAAKF,OAAOE,EAAAA;IACrB,CAAA;EACF;;;;EAKAsC,QAAQ,EAAEC,QAAQC,OAAM,GAAwC;AAC9DL,cAAU,MAAA;AACR,YAAMQ,WAAW,KAAKxC,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA;AACrD,UAAI,CAACI,UAAU;AACb,aAAKxC,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,IAAe;UAACC;;MACtD,WAAW,CAACG,SAASf,SAASY,MAAAA,GAAS;AACrCG,iBAASC,KAAKJ,MAAAA;MAChB;AAEA,YAAMK,UAAU,KAAK1C,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA;AACpD,UAAI,CAACK,SAAS;AACZ,aAAK1C,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,IAAc;UAACD;;MACrD,WAAW,CAACM,QAAQjB,SAASW,MAAAA,GAAS;AACpCM,gBAAQD,KAAKL,MAAAA;MACf;IACF,CAAA;EACF;;;;;;;;;;EAWAO,UAAUC,QAAgBvC,WAA0BD,OAAiB;AACnE4B,cAAU,MAAA;AACR,YAAMa,UAAU,KAAK7C,OAAO,KAAKM,WAAWsC,QAAQvC,SAAAA,CAAAA;AACpD,UAAIwC,SAAS;AACX,cAAMC,WAAWD,QAAQrC,OAAO,CAACX,OAAO,CAACO,MAAMqB,SAAS5B,EAAAA,CAAAA,KAAQ,CAAA;AAChE,cAAMkD,SAAS3C,MAAMI,OAAO,CAACX,OAAOgD,QAAQpB,SAAS5B,EAAAA,CAAAA,KAAQ,CAAA;AAC7DgD,gBAAQG,OAAO,GAAGH,QAAQzB,QAAM,GAAK;aAAI2B;aAAWD;SAAS;MAC/D;IACF,CAAA;EACF;;;;EAKAP,WAAW,EAAEH,QAAQC,OAAM,GAAwC;AACjEL,cAAU,MAAA;AACR,YAAMiB,gBAAgB,KAAKjD,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,GAAcc,UAAU,CAACrD,OAAOA,OAAOwC,MAAAA;AACjG,UAAIY,kBAAkB,IAAI;AACxB,aAAKjD,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,EAAaY,OAAOC,eAAe,CAAA;MACzE;AAEA,YAAME,eAAe,KAAKnD,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,GAAaa,UAAU,CAACrD,OAAOA,OAAOuC,MAAAA;AAC/F,UAAIe,iBAAiB,IAAI;AACvB,aAAKnD,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,EAAYW,OAAOG,cAAc,CAAA;MACvE;IACF,CAAA;EACF;;;;;;;;;EAUAC,SAAS,EAAEjD,OAAO,KAAKW,MAAMT,YAAY,YAAYG,QAAQ6C,QAAO,GAAsBC,OAAiB,CAAA,GAAU;AAEnH,QAAIA,KAAK7B,SAAStB,KAAKN,EAAE,GAAG;AAC1B;IACF;AAEA,QAAI,CAACW,UAAUA,OAAOL,IAAAA,GAAO;AAC3BkD,gBAAUlD,MAAM;WAAImD;QAAMnD,KAAKN;OAAG;IACpC;AAEA0D,WAAOC,OAAO,KAAK/C,UAAU;MAAEZ,IAAIM,KAAKN;MAAIQ;IAAU,CAAA,CAAA,EAAI4B,QAAQ,CAACwB,UACjE,KAAKL,SAAS;MAAEjD,MAAMsD;MAAOpD;MAAWG;MAAQ6C;IAAQ,GAAG;SAAIC;MAAMnD,KAAKN;KAAG,CAAA;EAEjF;;;;EAKA6D,QAAQ,EAAEtB,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMsB,QAAQ,KAAK5C,SAASqB,MAAAA;AAC5B,QAAI,CAACuB,OAAO;AACV,aAAOjC;IACT;AAEA,QAAIkC;AACJ,SAAKR,SAAS;MACZjD,MAAMwD;MACNnD,QAAQ,MAAM,CAACoD;MACfP,SAAS,CAAClD,MAAMmD,SAAAA;AACd,YAAInD,KAAKN,OAAOwC,QAAQ;AACtBuB,kBAAQN;QACV;MACF;IACF,CAAA;AAEA,WAAOM;EACT;AACF;;;AElTA,SAASC,0BAAoD;AAStD,IAAMC,eAAN,MAAMA;EAAN;AACYC,uBAAc,oBAAIC,IAAAA;AAClBC,wBAAe,IAAIC,mBAAAA;;;;;EAKpCC,aAAaC,IAAYC,WAA2C;AAClE,SAAKN,YAAYO,IAAIF,IAAIC,SAAAA;AACzB,WAAO;EACT;;;;EAKAE,gBAAgBH,IAA0B;AACxC,SAAKL,YAAYS,OAAOJ,EAAAA;AACxB,WAAO;EACT;;;;;EAMAK,MAAMC,eAA8B;AAElC,SAAKT,aAAaU,MAAK;AAEvB,UAAMC,QAAeF,iBAAiB,IAAIG,MAAAA;AAE1CC,UAAMC,KAAK,KAAKhB,YAAYiB,OAAM,CAAA,EAAIC,QAAQ,CAACC,YAAAA;AAC7C,YAAMC,cAAcD,QAAQN,KAAAA;AAC5BO,qBAAe,KAAKlB,aAAamB,IAAID,WAAAA;IACvC,CAAA;AAEA,WAAOP;EACT;AACF;;;ACxCO,IAAMS,cAAc,CAA8E,EACvGC,OACAC,WACAC,OACAC,YAAW,MAMZ;AACC,MAAIF,WAAW;AACb,WAAOD,MAAMI,SAAQ,GAAIF,KAAAA;EAC3B,OAAO;AACLA,UAAMG,QAAQ,CAAC,EAAEC,GAAE,MAAON,MAAMO,WAAWD,IAAIH,WAAAA,CAAAA;EACjD;AACF;",
-  "names": ["untracked", "create", "invariant", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "ROOT_ID", "Graph", "_nodes", "create", "id", "properties", "data", "_edges", "_constructNode", "nodeBase", "node", "edges", "direction", "getEdgeKey", "nodes", "filter", "_getNodes", "n", "isActionLike", "find", "actions", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "nextSeen", "includes", "undefined", "nonNullable", "invariant", "addNodes", "_addNode", "_node", "untracked", "forEach", "subNode", "addEdge", "source", "target", "removeNode", "removeEdge", "outbound", "push", "inbound", "sortEdges", "nodeId", "current", "unsorted", "sorted", "splice", "outboundIndex", "findIndex", "inboundIndex", "traverse", "visitor", "path", "Object", "values", "child", "getPath", "start", "found", "EventSubscriptions", "GraphBuilder", "_extensions", "Map", "_unsubscribe", "EventSubscriptions", "addExtension", "id", "extension", "set", "removeExtension", "delete", "build", "previousGraph", "clear", "graph", "Graph", "Array", "from", "values", "forEach", "builder", "unsubscribe", "add", "manageNodes", "graph", "condition", "nodes", "removeEdges", "addNodes", "forEach", "id", "removeNode"]
+  "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 { nonNullable } from '@dxos/util';\n\nimport { type Relation, type Node, type NodeArg, type NodeFilter, isActionLike } 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\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\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({\n    onInitialNode,\n    onInitialNodes,\n    onRemoveNode,\n  }: {\n    onInitialNode?: Graph['_onInitialNode'];\n    onInitialNodes?: Graph['_onInitialNodes'];\n    onRemoveNode?: Graph['_onRemoveNode'];\n  } = {}) {\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n    this._nodes[ROOT_ID] = this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, properties: {}, data: null });\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\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  /**\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): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode) {\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, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => untracked(() => !isActionLike(n))).filter((n) => filter?.(n, node) ?? true);\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    // TODO(wittjosiah): Factor out helper.\n    const key = `${node.id}-${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  /**\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   * 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      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 }[]) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }) {\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    });\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.\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// import { yieldOrContinue } from 'main-thread-scheduling';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph } 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  node: Node;\n  relation?: Relation;\n  visitor: (node: Node, path: string[]) => void;\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() {\n    this._graph = new Graph({\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  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   * Traverse a graph using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  // TODO(wittjosiah): Rename? This is not traversing the graph proper.\n  async traverse({ node, relation = 'outbound', visitor }: GraphBuilderTraverseOptions, path: string[] = []) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): Failed in test environment. ESM only?\n    // await yieldOrContinue('idle');\n    visitor(node, [...path, node.id]);\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .flatMap((extension) => extension.connector?.({ node }) ?? [])\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.traverse({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    let resolved = false;\n    for (const { id, resolver } of Object.values(this._extensions)) {\n      if (resolved || !resolver) {\n        continue;\n      }\n\n      const unsubscribe = effect(() => {\n        this._dispatcher.currentExtension = id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const node = resolver({ id: nodeId });\n        BuilderInternal.currentDispatcher = undefined;\n        if (node) {\n          resolved = true;\n          this.graph._addNodes([node]);\n          if (this._nodeChanged[node.id]) {\n            this._nodeChanged[node.id].value = {};\n          }\n        }\n      });\n\n      if (resolved) {\n        this._resolverSubscriptions.get(nodeId)?.();\n        this._resolverSubscriptions.set(nodeId, unsubscribe);\n        break;\n      } else {\n        unsubscribe();\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 previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\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          nodes.push(...(connector({ node }) ?? []));\n          BuilderInternal.currentDispatcher = undefined;\n        }\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        this.graph._removeNodes(removed, true);\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,SAASA,OAAOC,QAAQC,iBAAiB;AAEzC,SAASC,cAAcC,eAAe;AACtC,SAA8BC,cAAc;AAC5C,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;;ACgCrB,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,cAAcC,OAAO,OAAA;AAIpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCK,YAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAwC1B,IAAMC,QAAN,MAAMA;EAkBXC,YAAY,EACVC,eACAC,gBACAC,aAAY,IAKV,CAAC,GAAG;AArBSC,4BAAkD,CAAC;AACnDC,wBAAwC,CAAC;AAKjDC;;;kBAAuD,CAAC;AAKxDC;;;kBAAoF,CAAC;AAkYtFC,0BAAiB,CAAChB,SAAAA;AACxB,aAAOiB,OAAqB;QAAE,GAAGjB;QAAM,CAACH,WAAAA,GAAc;MAAK,CAAA;IAC7D;AAzXE,SAAKqB,iBAAiBT;AACtB,SAAKU,kBAAkBT;AACvB,SAAKU,gBAAgBT;AACrB,SAAKG,OAAOX,OAAAA,IAAW,KAAKa,eAAe;MAAEK,IAAIlB;MAASmB,MAAMlB;MAAWmB,YAAY,CAAC;MAAGC,MAAM;IAAK,CAAA;AACtG,SAAKT,OAAOZ,OAAAA,IAAWc,OAAO;MAAEQ,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;EAC5D;;;;EAKA,IAAIC,OAAO;AACT,WAAO,KAAKC,SAASzB,OAAAA;EACvB;;;;EAKA0B,OAAO,EAAER,KAAKlB,SAAS2B,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAC7B,MAAY+B,OAAiB,CAAA,MAAE;AAC7C,YAAMC,QAAQ,KAAKA,MAAMhC,IAAAA;AACzB,YAAMiC,MAA2B;QAC/BZ,IAAIrB,KAAKqB,GAAGa,SAASJ,YAAY,GAAG9B,KAAKqB,GAAGc,MAAM,GAAGL,YAAY,CAAA,CAAA,QAAU9B,KAAKqB;QAChFC,MAAMtB,KAAKsB;MACb;AACA,UAAItB,KAAKuB,WAAWa,OAAO;AACzBH,YAAIG,QAAQpC,KAAKuB,WAAWa;MAC9B;AACA,UAAIJ,MAAME,QAAQ;AAChBD,YAAID,QAAQA,MACTK,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIR;YAAM/B,KAAKqB;;AAChC,iBAAOkB,SAASC,SAASF,EAAEjB,EAAE,IAAIoB,SAAYZ,OAAOS,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,WAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAMN,OAAO,KAAKC,SAASP,EAAAA;AAC3BnB,cAAUyB,MAAM,mBAAmBN,EAAAA,IAAI;;;;;;;;;AACvC,WAAOQ,OAAOF,IAAAA;EAChB;;;;;;;EAQAC,SAASP,IAA8B;AACrC,UAAMuB,eAAe,KAAK9B,OAAOO,EAAAA;AACjC,QAAI,CAACuB,cAAc;AACjB,WAAK,KAAK1B,iBAAiBG,EAAAA;IAC7B;AAEA,WAAOuB;EACT;;;;;;;;;EAUA,MAAMC,YAAYxB,IAAYyB,SAAiC;AAC7D,UAAMC,UAAU,KAAKnC,iBAAiBS,EAAAA,MAAQ,KAAKT,iBAAiBS,EAAAA,IAAM,IAAI2B,QAAAA;AAC9E,UAAMhD,OAAO,KAAK4B,SAASP,EAAAA;AAC3B,QAAIrB,MAAM;AACR,aAAO,KAAKY,iBAAiBS,EAAAA;AAC7B,aAAOrB;IACT;AAEA,QAAI8C,YAAYL,QAAW;AACzB,aAAOM,QAAQE,KAAI;IACrB,OAAO;AACL,aAAOC,aAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBzB,EAAAA,EAAI;IACtE;EACF;;;;EAKAW,MAAoEhC,MAAYmD,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEC,UAAUC,WAAWX,QAAQpB,KAAI,IAAK6B;AAC9C,UAAMnB,QAAQ,KAAKsB,UAAU;MAAEtD;MAAMoD;MAAUC;MAAW/B;IAAK,CAAA;AAC/D,WAAOU,MAAMU,OAAO,CAACJ,MAAMiB,UAAU,MAAM,CAACC,aAAalB,CAAAA,CAAAA,CAAAA,EAAKI,OAAO,CAACJ,MAAMI,SAASJ,GAAGtC,IAAAA,KAAS,IAAA;EACnG;;;;EAKAyD,MAAMzD,MAAY,EAAEoD,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKrC,OAAOf,KAAKqB,EAAE,IAAI+B,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAM,QAAQ1D,MAAY,EAAEqD,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKC,UAAU;QAAEtD;QAAMqD;QAAW/B,MAAMhB;MAAkB,CAAA;SAC1D,KAAKgD,UAAU;QAAEtD;QAAMqD;QAAW/B,MAAMjB;MAAY,CAAA;;EAE3D;EAEA,MAAMsD,OAAO3D,MAAYoD,WAAqB,YAAY9B,MAAe;AAEvE,UAAMsC,MAAM,GAAG5D,KAAKqB,EAAE,IAAI+B,QAAAA,IAAY9B,IAAAA;AACtC,UAAMuC,cAAc,KAAKhD,aAAa+C,GAAAA;AACtC,QAAI,CAACC,eAAe,KAAK1C,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBnB,MAAMoD,UAAU9B,IAAAA;AAC3C,WAAKT,aAAa+C,GAAAA,IAAO;IAC3B;EACF;;;;;;;;EASAE,SACE,EAAEC,SAAS/D,OAAO,KAAK2B,MAAMyB,WAAW,YAAYC,UAAS,GAC7DW,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAKxB,SAASxC,KAAKqB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAM4C,iBAAiBF,QAAQ/D,MAAM;SAAIgE;MAAMhE,KAAKqB;KAAG;AACvD,QAAI4C,mBAAmB,OAAO;AAC5B;IACF;AAEAC,WAAOC,OAAO,KAAKb,UAAU;MAAEtD;MAAMoD;MAAUC;IAAU,CAAA,CAAA,EAAIe,QAAQ,CAACC,UACpE,KAAKP,SAAS;MAAE9D,MAAMqE;MAAOjB;MAAUW;MAASV;IAAU,GAAG;SAAIW;MAAMhE,KAAKqB;KAAG,CAAA;EAEnF;;;;;;;;EASAiD,kBACE,EAAEP,SAAS/D,OAAO,KAAK2B,MAAMyB,WAAW,YAAYC,UAAS,GAC7DkB,cAAwB,CAAA,GACxB;AACA,WAAOC,OAAO,MAAA;AACZ,YAAMR,OAAO;WAAIO;QAAavE,KAAKqB;;AACnC,YAAMoD,SAASV,QAAQ/D,MAAMgE,IAAAA;AAC7B,UAAIS,WAAW,OAAO;AACpB;MACF;AAEA,YAAMzC,QAAQ,KAAKsB,UAAU;QAAEtD;QAAMoD;QAAUC;MAAU,CAAA;AACzD,YAAMqB,oBAAoB1C,MAAMK,IAAI,CAACC,MAAM,KAAKgC,kBAAkB;QAAEtE,MAAMsC;QAAGyB;QAASV;MAAU,GAAGW,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLU,0BAAkBN,QAAQ,CAACO,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAEC,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMC,QAAQ,KAAKnD,SAASiD,MAAAA;AAC5B,QAAI,CAACE,OAAO;AACV,aAAOtC;IACT;AAEA,QAAIuC;AACJ,SAAKlB,SAAS;MACZ9D,MAAM+E;MACNhB,SAAS,CAAC/D,MAAMgE,SAAAA;AACd,YAAIgB,OAAO;AACT,iBAAO;QACT;AAEA,YAAIhF,KAAKqB,OAAOyD,QAAQ;AACtBE,kBAAQhB;QACV;MACF;IACF,CAAA;AAEA,WAAOgB;EACT;;;;;;EAOAC,UACEjD,OAC4B;AAC5B,WAAOkD,MAAM,MAAMlD,MAAMK,IAAI,CAACrC,SAAS,KAAKmF,SAASnF,IAAAA,CAAAA,CAAAA;EACvD;EAEQmF,SAA+E,EACrFnD,OACAyB,OACA,GAAG2B,MAAAA,GACqD;AACxD,WAAO7B,UAAU,MAAA;AACf,YAAMX,eAAe,KAAK9B,OAAOsE,MAAM/D,EAAE;AACzC,YAAMrB,OAAO4C,gBAAgB,KAAK5B,eAAe;QAAEQ,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAG6D;MAAM,CAAA;AACxF,UAAIxC,cAAc;AAChB,cAAM,EAAEpB,MAAMD,YAAYD,KAAI,IAAK8D;AACnC,YAAI5D,QAAQA,SAASxB,KAAKwB,MAAM;AAC9BxB,eAAKwB,OAAOA;QACd;AAEA,YAAIF,SAAStB,KAAKsB,MAAM;AACtBtB,eAAKsB,OAAOA;QACd;AAEA,mBAAWsC,OAAOrC,YAAY;AAC5B,cAAIA,WAAWqC,GAAAA,MAAS5D,KAAKuB,WAAWqC,GAAAA,GAAM;AAC5C5D,iBAAKuB,WAAWqC,GAAAA,IAAOrC,WAAWqC,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK9C,OAAOd,KAAKqB,EAAE,IAAIrB;AACvB,aAAKe,OAAOf,KAAKqB,EAAE,IAAIJ,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAMqB,UAAU,KAAKnC,iBAAiBZ,KAAKqB,EAAE;AAC7C,UAAI0B,SAAS;AACXA,gBAAQsC,KAAKrF,IAAAA;AACb,eAAO,KAAKY,iBAAiBZ,KAAKqB,EAAE;MACtC;AAEA,UAAIW,OAAO;AACTA,cAAMoC,QAAQ,CAACkB,YAAAA;AACb,eAAKH,SAASG,OAAAA;AACd,eAAKC,SAAS;YAAEV,QAAQ7E,KAAKqB;YAAIyD,QAAQQ,QAAQjE;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIoC,OAAO;AACTA,cAAMW,QAAQ,CAAC,CAAC/C,IAAI+B,QAAAA,MAClBA,aAAa,aACT,KAAKmC,SAAS;UAAEV,QAAQ7E,KAAKqB;UAAIyD,QAAQzD;QAAG,CAAA,IAC5C,KAAKkE,SAAS;UAAEV,QAAQxD;UAAIyD,QAAQ9E,KAAKqB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOrB;IACT,CAAA;EACF;;;;;;;;EASAwF,aAAaC,KAAehC,QAAQ,OAAO;AACzCyB,UAAM,MAAMO,IAAIrB,QAAQ,CAAC/C,OAAO,KAAKqE,YAAYrE,IAAIoC,KAAAA,CAAAA,CAAAA;EACvD;EAEQiC,YAAYrE,IAAYoC,QAAQ,OAAO;AAC7CF,cAAU,MAAA;AACR,YAAMvD,OAAO,KAAK4B,SAASP,EAAAA;AAC3B,UAAI,CAACrB,MAAM;AACT;MACF;AAEA,UAAIyD,OAAO;AAET,aAAKH,UAAU;UAAEtD;QAAK,CAAA,EAAGoE,QAAQ,CAACpE,UAAAA;AAChC,eAAK2F,YAAY;YAAEd,QAAQxD;YAAIyD,QAAQ9E,MAAKqB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKiC,UAAU;UAAEtD;UAAMoD,UAAU;QAAU,CAAA,EAAGgB,QAAQ,CAACpE,UAAAA;AACrD,eAAK2F,YAAY;YAAEd,QAAQ7E,MAAKqB;YAAIyD,QAAQzD;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKN,OAAOM,EAAAA;MACrB;AAGA,aAAO,KAAKP,OAAOO,EAAAA;AACnB,WAAK,KAAKD,gBAAgBC,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOAuE,UAAUnC,OAA6C;AACrDyB,UAAM,MAAMzB,MAAMW,QAAQ,CAACyB,SAAS,KAAKN,SAASM,IAAAA,CAAAA,CAAAA;EACpD;EAEQN,SAAS,EAAEV,QAAQC,OAAM,GAAwC;AACvEvB,cAAU,MAAA;AACR,UAAI,CAAC,KAAKxC,OAAO8D,MAAAA,GAAS;AACxB,aAAK9D,OAAO8D,MAAAA,IAAU5D,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKX,OAAO+D,MAAAA,GAAS;AACxB,aAAK/D,OAAO+D,MAAAA,IAAU7D,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMoE,cAAc,KAAK/E,OAAO8D,MAAAA;AAChC,UAAI,CAACiB,YAAYpE,SAASc,SAASsC,MAAAA,GAAS;AAC1CgB,oBAAYpE,SAASqE,KAAKjB,MAAAA;MAC5B;AAEA,YAAMkB,cAAc,KAAKjF,OAAO+D,MAAAA;AAChC,UAAI,CAACkB,YAAYvE,QAAQe,SAASqC,MAAAA,GAAS;AACzCmB,oBAAYvE,QAAQsE,KAAKlB,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAoB,aAAaxC,OAA6C;AACxDyB,UAAM,MAAMzB,MAAMW,QAAQ,CAACyB,SAAS,KAAKF,YAAYE,IAAAA,CAAAA,CAAAA;EACvD;EAEQF,YAAY,EAAEd,QAAQC,OAAM,GAAwC;AAC1EvB,cAAU,MAAA;AACR2B,YAAM,MAAA;AACJ,cAAMgB,gBAAgB,KAAKnF,OAAO8D,MAAAA,GAASnD,SAASyE,UAAU,CAAC9E,OAAOA,OAAOyD,MAAAA;AAC7E,YAAIoB,kBAAkBzD,UAAayD,kBAAkB,IAAI;AACvD,eAAKnF,OAAO8D,MAAAA,EAAQnD,SAAS0E,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAKtF,OAAO+D,MAAAA,GAASrD,QAAQ0E,UAAU,CAAC9E,OAAOA,OAAOwD,MAAAA;AAC3E,YAAIwB,iBAAiB5D,UAAa4D,iBAAiB,IAAI;AACrD,eAAKtF,OAAO+D,MAAAA,EAAQrD,QAAQ2E,OAAOC,cAAc,CAAA;QACnD;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAC,WAAWC,QAAgBnD,UAAoBK,OAAiB;AAC9DF,cAAU,MAAA;AACR2B,YAAM,MAAA;AACJ,cAAMsB,UAAU,KAAKzF,OAAOwF,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQpD,QAAAA,EAAUV,OAAO,CAACrB,OAAO,CAACoC,MAAMjB,SAASnB,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAMqF,SAASjD,MAAMf,OAAO,CAACrB,OAAOmF,QAAQpD,QAAAA,EAAUZ,SAASnB,EAAAA,CAAAA,KAAQ,CAAA;AACvEmF,kBAAQpD,QAAAA,EAAUgD,OAAO,GAAGI,QAAQpD,QAAAA,EAAUlB,QAAM,GAAK;eAAIwE;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQnD,UAAU,EAChBtD,MACAoD,WAAW,YACX9B,MACA+B,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKM,OAAO3D,MAAMoD,UAAU9B,IAAAA;IACnC;AAEA,UAAMmC,QAAQ,KAAK1C,OAAOf,KAAKqB,EAAE;AACjC,QAAI,CAACoC,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAML,QAAAA,EACVf,IAAI,CAAChB,OAAO,KAAKP,OAAOO,EAAAA,CAAG,EAC3BqB,OAAOC,WAAAA,EACPD,OAAO,CAACJ,MAAM,CAAChB,QAAQgB,EAAEhB,SAASA,IAAAA;IACvC;EACF;AACF;;;AE7eA,SAAsBqF,UAAAA,SAAQC,cAAc;AAI5C,SAASC,UAAAA,eAAc;AACvB,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,eAAAA,oBAAmB;;AA8DrB,IAAMC,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAEC,IAAIC,UAAUC,WAAWC,SAASC,cAAc,GAAGC,KAAAA,IAASN;AACpE,QAAMO,QAAQ,CAACC,QAAgB,GAAGP,EAAAA,IAAMO,GAAAA;AACxC,SAAO;IACLN,WAAW;MAAED,IAAIM,MAAM,UAAA;MAAaL;IAAS,IAAIO;IACjDN,YAAY;MAAE,GAAGG;MAAML,IAAIM,MAAM,WAAA;MAAcJ;IAAU,IAAIM;IAC7DJ,eACK;MACC,GAAGC;MACHL,IAAIM,MAAM,cAAA;MACVG,MAAMC;MACNC,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAChBR,aAAa;QAAEQ;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKC,MAAMC;QAAmBP,MAAMC;MAAkB,EAAA;IACrG,IACAF;IACJL,UACK;MACC,GAAGE;MACHL,IAAIM,MAAM,SAAA;MACVG,MAAMQ;MACNN,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAAOT,QAAQ;QAAES;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKL,MAAMQ;MAAY,EAAA;IACxF,IACAT;IACJU,OAAOC,YAAAA;AACX;AAWA,IAAMC,aAAN,MAAMA;EAAN;AAEEC,sBAAa;AACbC,iBAA+B,CAAC;AAChCC,mBAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAanB,MAAM,aAAQ;AACpD,QAAMoB,aAAaH,gBAAgBI;AACnCC,EAAAA,WAAUF,YAAYG,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMJ,WAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMW,UAAUD,IAAIxB,GAAAA;AACpB,QAAM0B,SAASD,UAAUA,QAAQC,SAASP,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,IAAI;IAAE,GAAGU;IAAK,CAACxB,GAAAA,GAAM;MAAE0B;IAAO;EAAE;AACnGN,aAAWN;AACX,SAAOY;AACT;AAKO,IAAMV,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCC,IAAAA,WAAUF,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQW,KAAKR,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMS,WAAW,CACtBC,WACAC,KACA9B,QAAAA;AAEA,QAAM+B,aAAab,QAAQ,MAAA;AACzB,WAAOc,OAAOF,IAAAA,CAAAA;EAChB,GAAG9B,GAAAA;AACH,QAAMiC,cAAcf,QAAQ,MAAA;AAC1B,WAAOW,UAAU,MAAOE,WAAWG,QAAQJ,IAAAA,CAAAA;EAC7C,GAAG9B,GAAAA;AACHgB,UAAQ,MAAA;AACNiB,gBAAAA;EACF,CAAA;AACA,SAAOF,WAAWG;AACpB;AAoBO,IAAMC,eAAN,MAAMA;EAQXC,cAAc;AAPGC,uBAAc,IAAIxB,WAAAA;AAClByB,uBAAcC,QAAyC,CAAC,CAAA;AACxDC,kCAAyB,oBAAIC,IAAAA;AAC7BC,mCAA0B,oBAAID,IAAAA;AAC9BE,wBAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIC,MAAM;MACtBC,eAAe,CAACrD,OAAO,KAAKsD,eAAetD,EAAAA;MAC3CuD,gBAAgB,CAAC3C,MAAMD,UAAUF,SAAS,KAAK+C,gBAAgB5C,MAAMD,UAAUF,IAAAA;MAC/EgD,cAAc,CAACzD,OAAO,KAAK0D,cAAc1D,EAAAA;IAC3C,CAAA;EACF;EAEA,IAAI2D,QAAQ;AACV,WAAO,KAAKR;EACd;;;;EAKAS,aAAa7D,WAAuC;AAClD,QAAI8D,MAAMC,QAAQ/D,SAAAA,GAAY;AAC5BA,gBAAUgE,QAAQ,CAACC,QAAQ,KAAKJ,aAAaI,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKpB,YAAYtB,MAAMvB,UAAUC,EAAE,IAAI,CAAA;AACvC,SAAK6C,YAAY9C,UAAUC,EAAE,IAAID;AACjC,WAAO;EACT;;;;EAKAkE,gBAAgBjE,IAA0B;AACxC,WAAO,KAAK6C,YAAY7C,EAAAA;AACxB,WAAO;EACT;EAEAkE,UAAU;AACR,SAAKtB,YAAYrB,QAAQwC,QAAQ,CAACrC,OAAOA,GAAAA,CAAAA;AACzC,SAAKqB,uBAAuBgB,QAAQ,CAACvB,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKS,wBAAwBc,QAAQ,CAACvB,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKO,uBAAuBoB,MAAK;AACjC,SAAKlB,wBAAwBkB,MAAK;EACpC;;;;;EAMA,MAAMC,SAAS,EAAExD,MAAMD,WAAW,YAAY0D,QAAO,GAAiCC,OAAiB,CAAA,GAAI;AAEzG,QAAIA,KAAKC,SAAS3D,KAAKZ,EAAE,GAAG;AAC1B;IACF;AAIAqE,YAAQzD,MAAM;SAAI0D;MAAM1D,KAAKZ;KAAG;AAEhC,UAAMwE,QAAQC,OAAOC,OAAO,KAAK7B,WAAW,EACzC3B,OAAO,CAACnB,cAAcY,cAAcZ,UAAUY,YAAY,WAAS,EACnEgE,QAAQ,CAAC5E,cAAcA,UAAUG,YAAY;MAAEU;IAAK,CAAA,KAAM,CAAA,CAAE,EAC5DC,IACC,CAACC,SAAe;MACdd,IAAIc,IAAId;MACRS,MAAMK,IAAIL;MACVM,MAAMD,IAAIC,QAAQ;MAClB6D,YAAY9D,IAAI8D,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMC,QAAQ9C,IAAIyC,MAAM3D,IAAI,CAACiE,MAAM,KAAKV,SAAS;MAAExD,MAAMkE;MAAGnE;MAAU0D;IAAQ,GAAG;SAAIC;MAAM1D,KAAKZ;KAAG,CAAA,CAAA;EACrG;EAEA,MAAcsD,eAAeyB,QAAgB;AAC3C,SAAK7B,aAAa6B,MAAAA,IAAU,KAAK7B,aAAa6B,MAAAA,KAAWxC,OAAO,CAAC,CAAA;AACjE,QAAIyC,WAAW;AACf,eAAW,EAAEhF,IAAIC,SAAQ,KAAMwE,OAAOC,OAAO,KAAK7B,WAAW,GAAG;AAC9D,UAAImC,YAAY,CAAC/E,UAAU;AACzB;MACF;AAEA,YAAMuC,cAAcyC,QAAO,MAAA;AACzB,aAAKrC,YAAYd,mBAAmB9B;AACpC,aAAK4C,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC,cAAMhC,OAAOX,SAAS;UAAED,IAAI+E;QAAO,CAAA;AACnCvD,wBAAgBI,oBAAoBpB;AACpC,YAAII,MAAM;AACRoE,qBAAW;AACX,eAAKrB,MAAMuB,UAAU;YAACtE;WAAK;AAC3B,cAAI,KAAKsC,aAAatC,KAAKZ,EAAE,GAAG;AAC9B,iBAAKkD,aAAatC,KAAKZ,EAAE,EAAEyC,QAAQ,CAAC;UACtC;QACF;MACF,CAAA;AAEA,UAAIuC,UAAU;AACZ,aAAKjC,uBAAuBV,IAAI0C,MAAAA,IAAAA;AAChC,aAAKhC,uBAAuBoC,IAAIJ,QAAQvC,WAAAA;AACxC;MACF,OAAO;AACLA,oBAAAA;MACF;IACF;EACF;EAEA,MAAcgB,gBAAgB5C,MAAYwE,eAAyBC,WAAoB;AACrF,SAAKnC,aAAatC,KAAKZ,EAAE,IAAI,KAAKkD,aAAatC,KAAKZ,EAAE,KAAKuC,OAAO,CAAC,CAAA;AACnE,QAAI+C,WAAqB,CAAA;AACzB,SAAKrC,wBAAwBkC,IAC3BvE,KAAKZ,IACLiF,QAAO,MAAA;AAELR,aAAOc,KAAK,KAAK1C,WAAW;AAE5B,WAAKK,aAAatC,KAAKZ,EAAE,EAAEyC;AAG3B,YAAM+B,QAAwB,CAAA;AAC9B,iBAAW,EAAExE,IAAIE,WAAWgB,QAAQT,MAAME,WAAW,WAAU,KAAM8D,OAAOC,OAAO,KAAK7B,WAAW,GAAG;AACpG,YACE,CAAC3C,aACDS,aAAayE,iBACZC,aAAa5E,SAAS4E,aACtBnE,UAAU,CAACA,OAAON,IAAAA,GACnB;AACA;QACF;AAEA,aAAKgC,YAAYd,mBAAmB9B;AACpC,aAAK4C,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC4B,cAAMtC,KAAI,GAAKhC,UAAU;UAAEU;QAAK,CAAA,KAAM,CAAA,CAAE;AACxCY,wBAAgBI,oBAAoBpB;MACtC;AACA,YAAMgF,MAAMhB,MAAM3D,IAAI,CAACiE,MAAMA,EAAE9E,EAAE;AACjC,YAAMyF,UAAUH,SAASpE,OAAO,CAAClB,OAAO,CAACwF,IAAIjB,SAASvE,EAAAA,CAAAA;AACtDsF,iBAAWE;AAEX,WAAK7B,MAAM+B,aAAaD,SAAS,IAAA;AACjC,WAAK9B,MAAMuB,UAAUV,KAAAA;AACrB,WAAKb,MAAMgC,UACTnB,MAAM3D,IAAI,CAAC,EAAEb,GAAE,MACboF,kBAAkB,aAAa;QAAEQ,QAAQhF,KAAKZ;QAAI6F,QAAQ7F;MAAG,IAAI;QAAE4F,QAAQ5F;QAAI6F,QAAQjF,KAAKZ;MAAG,CAAA,CAAA;AAGnG,WAAK2D,MAAMmC,WACTlF,KAAKZ,IACLoF,eACAZ,MAAM3D,IAAI,CAAC,EAAEb,GAAE,MAAOA,EAAAA,CAAAA;AAExBwE,YAAMT,QAAQ,CAACe,MAAAA;AACb,YAAI,KAAK5B,aAAa4B,EAAE9E,EAAE,GAAG;AAC3B,eAAKkD,aAAa4B,EAAE9E,EAAE,EAAEyC,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAciB,cAAcqB,QAAgB;AAC1C,SAAKhC,uBAAuBV,IAAI0C,MAAAA,IAAAA;AAChC,SAAK9B,wBAAwBZ,IAAI0C,MAAAA,IAAAA;AACjC,SAAKhC,uBAAuBgD,OAAOhB,MAAAA;AACnC,SAAK9B,wBAAwB8C,OAAOhB,MAAAA;EACtC;AACF;",
+  "names": ["batch", "effect", "untracked", "asyncTimeout", "Trigger", "create", "invariant", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "Symbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "constructor", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_nodes", "_edges", "_constructNode", "create", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "id", "type", "properties", "data", "inbound", "outbound", "root", "findNode", "toJSON", "maxLength", "seen", "nodes", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "options", "relation", "expansion", "_getNodes", "untracked", "isActionLike", "edges", "actions", "expand", "key", "initialized", "traverse", "visitor", "path", "shouldContinue", "Object", "values", "forEach", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "source", "target", "start", "found", "_addNodes", "batch", "_addNode", "_node", "wake", "subNode", "_addEdge", "_removeNodes", "ids", "_removeNode", "_removeEdge", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "outboundIndex", "findIndex", "splice", "inboundIndex", "_sortEdges", "nodeId", "current", "unsorted", "sorted", "effect", "signal", "create", "invariant", "nonNullable", "createExtension", "extension", "id", "resolver", "connector", "actions", "actionGroups", "rest", "getId", "key", "undefined", "type", "ACTION_GROUP_TYPE", "relation", "node", "map", "arg", "data", "actionGroupSymbol", "ACTION_TYPE", "filter", "nonNullable", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "invariant", "currentExtension", "all", "current", "result", "push", "toSignal", "subscribe", "get", "thisSignal", "signal", "unsubscribe", "value", "GraphBuilder", "constructor", "_dispatcher", "_extensions", "create", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "Graph", "onInitialNode", "_onInitialNode", "onInitialNodes", "_onInitialNodes", "onRemoveNode", "_onRemoveNode", "graph", "addExtension", "Array", "isArray", "forEach", "ext", "removeExtension", "destroy", "clear", "traverse", "visitor", "path", "includes", "nodes", "Object", "values", "flatMap", "properties", "Promise", "n", "nodeId", "resolved", "effect", "_addNodes", "set", "nodesRelation", "nodesType", "previous", "keys", "ids", "removed", "_removeNodes", "_addEdges", "source", "target", "_sortEdges", "delete"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":6447,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":31580,"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/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":4684,"imports":[{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/helpers.ts":{"bytes":2079,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":759,"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/helpers.ts","kind":"import-statement","original":"./helpers"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":22904},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"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/util","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder","ROOT_ID","actionGroupSymbol","isAction","isActionGroup","isActionLike","isGraphNode","manageNodes"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":7855},"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":983},"packages/sdk/app-graph/src/helpers.ts":{"bytesInOutput":206}},"bytes":9907}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5259,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":50171,"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/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":38696,"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/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"}],"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/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":47906},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"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/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/util","kind":"import-statement","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":12265},"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":7747}},"bytes":20932}}}