@dxos/app-graph 0.8.4-main.dedc0f3 → 0.8.4-main.e8ec1fe

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/graph-builder.ts", "../../../src/node.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport { Option, Record, pipe } from 'effect';\n\nimport { Event, Trigger } from '@dxos/async';\nimport { todo } from '@dxos/debug';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, isNonNullable } from '@dxos/util';\n\nimport { type Action, type ActionGroup, type Node, type NodeArg, type Relation } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: T[K] extends object ? DeepWriteable<T[K]> : T[K] };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\n/**\n * Get the Graph a Node is currently associated with.\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 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_ID\n   */\n  source?: string;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n};\n\nexport type GraphParams = {\n  registry?: Registry.Registry;\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, Edges>;\n  onExpand?: Graph['_onExpand'];\n  onInitialize?: Graph['_onInitialize'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\nexport type Edge = { source: string; target: string };\nexport type Edges = { inbound: string[]; outbound: string[] };\n\nexport interface ReadableGraph {\n  /**\n   * Event emitted when a node is changed.\n   */\n  onNodeChanged: Event<{ id: string; node: Option.Option<Node> }>;\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON(id?: string): object;\n\n  json(id?: string): Rx.Rx<any>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  node(id: string): Rx.Rx<Option.Option<Node>>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  nodeOrThrow(id: string): Rx.Rx<Node>;\n\n  /**\n   * Get the rx key for the connections of the node with the given id.\n   */\n  connections(id: string, relation?: Relation): Rx.Rx<Node[]>;\n\n  /**\n   * Get the rx key for the actions of the node with the given id.\n   */\n  actions(id: string): Rx.Rx<(Action | ActionGroup)[]>;\n\n  /**\n   * Get the rx key for the edges of the node with the given id.\n   */\n  edges(id: string): Rx.Rx<Edges>;\n\n  /**\n   * Alias for `getNodeOrThrow(ROOT_ID)`.\n   */\n  get root(): Node;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   */\n  getNode(id: string): Option.Option<Node>;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   *\n   * @throws If the node is Option.none().\n   */\n  getNodeOrThrow(id: string): Node;\n\n  /**\n   * Get all nodes connected to the node with the given id by the given relation from the graph's registry.\n   */\n  getConnections(id: string, relation?: Relation): Node[];\n\n  /**\n   * Get all actions connected to the node with the given id from the graph's registry.\n   */\n  getActions(id: string): Node[];\n\n  /**\n   * Get the edges from the node with the given id from the graph's registry.\n   */\n  getEdges(id: string): Edges;\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(options: GraphTraversalOptions, path?: string[]): void;\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath(params: { source?: string; target: string }): Option.Option<string[]>;\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  waitForPath(\n    params: { source?: string; target: string },\n    options?: { timeout?: number; interval?: number },\n  ): Promise<string[]>;\n}\n\nexport interface ExpandableGraph extends ReadableGraph {\n  /**\n   * Initialize a node in the graph.\n   *\n   * Fires the `onInitialize` callback to provide initial data for a node.\n   */\n  initialize(id: string): Promise<void>;\n\n  /**\n   * Expand a node in the graph.\n   *\n   * Fires the `onExpand` callback to add connections to the node.\n   */\n  expand(id: string, relation?: Relation): void;\n\n  /**\n   * Sort the edges of the node with the given id.\n   */\n  sortEdges(id: string, relation: Relation, order: string[]): void;\n}\n\nexport interface WritableGraph extends ExpandableGraph {\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void;\n\n  /**\n   * Add a node to the graph.\n   */\n  addNode(node: NodeArg<any, Record<string, any>>): void;\n\n  /**\n   * Remove nodes from the graph.\n   */\n  removeNodes(ids: string[], edges?: boolean): void;\n\n  /**\n   * Remove a node from the graph.\n   */\n  removeNode(id: string, edges?: boolean): void;\n\n  /**\n   * Add edges to the graph.\n   */\n  addEdges(edges: Edge[]): void;\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge(edge: Edge): void;\n\n  /**\n   * Remove edges from the graph.\n   */\n  removeEdges(edges: Edge[], removeOrphans?: boolean): void;\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge(edge: Edge, removeOrphans?: boolean): void;\n}\n\n/**\n * The Graph represents the user interface information architecture of the application constructed via plugins.\n */\nexport class Graph implements WritableGraph {\n  readonly onNodeChanged = new Event<{ id: string; node: Option.Option<Node> }>();\n\n  private readonly _onExpand?: (id: string, relation: Relation) => void;\n  private readonly _onInitialize?: (id: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => void;\n\n  private readonly _registry: Registry.Registry;\n  private readonly _expanded = Record.empty<string, boolean>();\n  private readonly _initialized = Record.empty<string, boolean>();\n  private readonly _initialEdges = Record.empty<string, Edges>();\n  private readonly _initialNodes = Record.fromEntries([\n    [ROOT_ID, this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, data: null, properties: {} })],\n  ]);\n\n  /** @internal */\n  readonly _node = Rx.family<string, Rx.Writable<Option.Option<Node>>>((id) => {\n    const initial = Option.flatten(Record.get(this._initialNodes, id));\n    return Rx.make<Option.Option<Node>>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:node:${id}`));\n  });\n\n  private readonly _nodeOrThrow = Rx.family<string, Rx.Rx<Node>>((id) => {\n    return Rx.make((get) => {\n      const node = get(this._node(id));\n      invariant(Option.isSome(node), `Node not available: ${id}`);\n      return node.value;\n    });\n  });\n\n  private readonly _edges = Rx.family<string, Rx.Writable<Edges>>((id) => {\n    const initial = Record.get(this._initialEdges, id).pipe(Option.getOrElse(() => ({ inbound: [], outbound: [] })));\n    return Rx.make<Edges>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:edges:${id}`));\n  });\n\n  // NOTE: Currently the argument to the family needs to be referentially stable for the rx to be referentially stable.\n  // TODO(wittjosiah): Rx feature request, support for something akin to `ComplexMap` to allow for complex arguments.\n  private readonly _connections = Rx.family<string, Rx.Rx<Node[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('$');\n      const edges = get(this._edges(id));\n      return edges[relation as Relation]\n        .map((id) => get(this._node(id)))\n        .filter(Option.isSome)\n        .map((o) => o.value);\n    }).pipe(Rx.withLabel(`graph:connections:${key}`));\n  });\n\n  private readonly _actions = Rx.family<string, Rx.Rx<(Action | ActionGroup)[]>>((id) => {\n    return Rx.make((get) => {\n      return get(this._connections(`${id}$outbound`)).filter(\n        (node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE,\n      );\n    }).pipe(Rx.withLabel(`graph:actions:${id}`));\n  });\n\n  private readonly _json = Rx.family<string, Rx.Rx<any>>((id) => {\n    return Rx.make((get) => {\n      const toJSON = (node: Node, seen: string[] = []): any => {\n        const nodes = get(this.connections(node.id));\n        const obj: Record<string, any> = {\n          id: node.id.length > 32 ? `${node.id.slice(0, 32)}...` : 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(isNonNullable);\n        }\n        return obj;\n      };\n\n      const root = get(this.nodeOrThrow(id));\n      return toJSON(root);\n    }).pipe(Rx.withLabel(`graph:json:${id}`));\n  });\n\n  constructor({ registry, nodes, edges, onInitialize, onExpand, onRemoveNode }: GraphParams = {}) {\n    this._registry = registry ?? Registry.make();\n    this._onInitialize = onInitialize;\n    this._onExpand = onExpand;\n    this._onRemoveNode = onRemoveNode;\n\n    if (nodes) {\n      nodes.forEach((node) => {\n        Record.set(this._initialNodes, node.id, this._constructNode(node));\n      });\n    }\n\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        Record.set(this._initialEdges, source, edges);\n      });\n    }\n  }\n\n  toJSON(id = ROOT_ID) {\n    return this._registry.get(this._json(id));\n  }\n\n  json(id = ROOT_ID) {\n    return this._json(id);\n  }\n\n  node(id: string): Rx.Rx<Option.Option<Node>> {\n    return this._node(id);\n  }\n\n  nodeOrThrow(id: string): Rx.Rx<Node> {\n    return this._nodeOrThrow(id);\n  }\n\n  connections(id: string, relation: Relation = 'outbound'): Rx.Rx<Node[]> {\n    return this._connections(`${id}$${relation}`);\n  }\n\n  actions(id: string) {\n    return this._actions(id);\n  }\n\n  edges(id: string): Rx.Rx<Edges> {\n    return this._edges(id);\n  }\n\n  get root() {\n    return this.getNodeOrThrow(ROOT_ID);\n  }\n\n  getNode(id: string): Option.Option<Node> {\n    return this._registry.get(this.node(id));\n  }\n\n  getNodeOrThrow(id: string): Node {\n    return this._registry.get(this.nodeOrThrow(id));\n  }\n\n  getConnections(id: string, relation: Relation = 'outbound'): Node[] {\n    return this._registry.get(this.connections(id, relation));\n  }\n\n  getActions(id: string): Node[] {\n    return this._registry.get(this.actions(id));\n  }\n\n  getEdges(id: string): Edges {\n    return this._registry.get(this.edges(id));\n  }\n\n  async initialize(id: string) {\n    const initialized = Record.get(this._initialized, id).pipe(Option.getOrElse(() => false));\n    log('initialize', { id, initialized });\n    if (!initialized) {\n      await this._onInitialize?.(id);\n      Record.set(this._initialized, id, true);\n    }\n  }\n\n  expand(id: string, relation: Relation = 'outbound'): void {\n    const key = `${id}$${relation}`;\n    const expanded = Record.get(this._expanded, key).pipe(Option.getOrElse(() => false));\n    log('expand', { key, expanded });\n    if (!expanded) {\n      this._onExpand?.(id, relation);\n      Record.set(this._expanded, key, true);\n    }\n  }\n\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void {\n    Rx.batch(() => {\n      nodes.map((node) => this.addNode(node));\n    });\n  }\n\n  addNode({ nodes, edges, ...nodeArg }: NodeArg<any, Record<string, any>>): void {\n    const { id, type, data = null, properties = {} } = nodeArg;\n    const nodeRx = this._node(id);\n    const node = this._registry.get(nodeRx);\n    Option.match(node, {\n      onSome: (node) => {\n        const typeChanged = node.type !== type;\n        const dataChanged = node.data !== data;\n        const propertiesChanged = Object.keys(properties).some((key) => node.properties[key] !== properties[key]);\n        log('existing node', { id, typeChanged, dataChanged, propertiesChanged });\n        if (typeChanged || dataChanged || propertiesChanged) {\n          log('updating node', { id, type, data, properties });\n          const newNode = Option.some({ ...node, type, data, properties: { ...node.properties, ...properties } });\n          this._registry.set(nodeRx, newNode);\n          this.onNodeChanged.emit({ id, node: newNode });\n        }\n      },\n      onNone: () => {\n        log('new node', { id, type, data, properties });\n        const newNode = this._constructNode({ id, type, data, properties });\n        this._registry.set(nodeRx, newNode);\n        this.onNodeChanged.emit({ id, node: newNode });\n      },\n    });\n\n    if (nodes) {\n      // Rx.batch(() => {\n      this.addNodes(nodes);\n      const _edges = nodes.map((node) => ({ source: id, target: node.id }));\n      this.addEdges(_edges);\n      // });\n    }\n\n    if (edges) {\n      todo();\n    }\n  }\n\n  removeNodes(ids: string[], edges = false): void {\n    Rx.batch(() => {\n      ids.map((id) => this.removeNode(id, edges));\n    });\n  }\n\n  removeNode(id: string, edges = false): void {\n    const nodeRx = this._node(id);\n    // TODO(wittjosiah): Is there a way to mark these rx values for garbage collection?\n    this._registry.set(nodeRx, Option.none());\n    this.onNodeChanged.emit({ id, node: Option.none() });\n    // TODO(wittjosiah): Reset expanded and initialized flags?\n\n    if (edges) {\n      const { inbound, outbound } = this._registry.get(this._edges(id));\n      const edges = [\n        ...inbound.map((source) => ({ source, target: id })),\n        ...outbound.map((target) => ({ source: id, target })),\n      ];\n      this.removeEdges(edges);\n    }\n\n    this._onRemoveNode?.(id);\n  }\n\n  addEdges(edges: Edge[]): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.addEdge(edge));\n    });\n  }\n\n  addEdge(edgeArg: Edge): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (!source.outbound.includes(edgeArg.target)) {\n      log('add outbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(sourceRx, { inbound: source.inbound, outbound: [...source.outbound, edgeArg.target] });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (!target.inbound.includes(edgeArg.source)) {\n      log('add inbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(targetRx, { inbound: [...target.inbound, edgeArg.source], outbound: target.outbound });\n    }\n  }\n\n  removeEdges(edges: Edge[], removeOrphans = false): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.removeEdge(edge, removeOrphans));\n    });\n  }\n\n  removeEdge(edgeArg: Edge, removeOrphans = false): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (source.outbound.includes(edgeArg.target)) {\n      this._registry.set(sourceRx, {\n        inbound: source.inbound,\n        outbound: source.outbound.filter((id) => id !== edgeArg.target),\n      });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (target.inbound.includes(edgeArg.source)) {\n      this._registry.set(targetRx, {\n        inbound: target.inbound.filter((id) => id !== edgeArg.source),\n        outbound: target.outbound,\n      });\n    }\n\n    if (removeOrphans) {\n      const source = this._registry.get(sourceRx);\n      const target = this._registry.get(targetRx);\n      if (source.outbound.length === 0 && source.inbound.length === 0 && edgeArg.source !== ROOT_ID) {\n        this.removeNodes([edgeArg.source]);\n      }\n      if (target.outbound.length === 0 && target.inbound.length === 0 && edgeArg.target !== ROOT_ID) {\n        this.removeNodes([edgeArg.target]);\n      }\n    }\n  }\n\n  sortEdges(id: string, relation: Relation, order: string[]): void {\n    const edgesRx = this._edges(id);\n    const edges = this._registry.get(edgesRx);\n    const unsorted = edges[relation].filter((id) => !order.includes(id)) ?? [];\n    const sorted = order.filter((id) => edges[relation].includes(id)) ?? [];\n    edges[relation].splice(0, edges[relation].length, ...[...sorted, ...unsorted]);\n    this._registry.set(edgesRx, edges);\n  }\n\n  traverse({ visitor, source = ROOT_ID, relation = 'outbound' }: GraphTraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    const node = this.getNodeOrThrow(source);\n    const shouldContinue = visitor(node, [...path, source]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this.getConnections(source, relation)).forEach((child) =>\n      this.traverse({ source: child.id, relation, visitor }, [...path, source]),\n    );\n  }\n\n  getPath({ source = 'root', target }: { source?: string; target: string }): Option.Option<string[]> {\n    return pipe(\n      this.getNode(source),\n      Option.flatMap((node) => {\n        let found: Option.Option<string[]> = Option.none();\n        this.traverse({\n          source: node.id,\n          visitor: (node, path) => {\n            if (Option.isSome(found)) {\n              return false;\n            }\n\n            if (node.id === target) {\n              found = Option.some(path);\n            }\n          },\n        });\n\n        return found;\n      }),\n    );\n  }\n\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ): Promise<string[]> {\n    const path = this.getPath(params);\n    if (Option.isSome(path)) {\n      return path.value;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (Option.isSome(path)) {\n        trigger.wake(path.value);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /** @internal */\n  _constructNode(node: NodeArg<any>): Option.Option<Node> {\n    return Option.some({ [graphSymbol]: this, data: null, properties: {}, ...node });\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport { effect } from '@preact/signals-core';\nimport { Array, Option, Record, pipe } from 'effect';\n\nimport { type CleanupFn, type MulticastObservable, type Trigger } from '@dxos/async';\nimport { log } from '@dxos/log';\nimport { type MaybePromise, type Position, byPosition, getDebugName, isNode, isNonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, type ExpandableGraph, Graph, type GraphParams, ROOT_ID } from './graph';\nimport { type ActionData, type Node, type NodeArg, type Relation, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on a node id.\n */\nexport type ResolverExtension = (id: string) => Rx.Rx<NodeArg<any> | null>;\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 = (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[]>;\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.position Affects the order the extensions are processed in.\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 = {\n  id: string;\n  relation?: Relation;\n  position?: Position;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  actions?: ActionsExtension;\n  actionGroups?: ActionGroupsExtension;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = (extension: CreateExtensionOptions): BuilderExtension[] => {\n  const {\n    id,\n    position = 'static',\n    relation = 'outbound',\n    resolver: _resolver,\n    connector: _connector,\n    actions: _actions,\n    actionGroups: _actionGroups,\n  } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n\n  const resolver =\n    _resolver && Rx.family((id: string) => _resolver(id).pipe(Rx.withLabel(`graph-builder:_resolver:${id}`)));\n\n  const connector =\n    _connector &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _connector(node).pipe(Rx.withLabel(`graph-builder:_connector:${id}`)),\n    );\n\n  const actionGroups =\n    _actionGroups &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _actionGroups(node).pipe(Rx.withLabel(`graph-builder:_actionGroups:${id}`)),\n    );\n\n  const actions =\n    _actions &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) => _actions(node).pipe(Rx.withLabel(`graph-builder:_actions:${id}`)));\n\n  return [\n    resolver ? { id: getId('resolver'), position, resolver } : undefined,\n    connector\n      ? ({\n          id: getId('connector'),\n          position,\n          relation,\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(connector(node));\n              } catch {\n                log.warn('Error in connector', { id: getId('connector'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actionGroups\n      ? ({\n          id: getId('actionGroups'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actionGroups(node)).map((arg) => ({\n                  ...arg,\n                  data: actionGroupSymbol,\n                  type: ACTION_GROUP_TYPE,\n                }));\n              } catch {\n                log.warn('Error in actionGroups', { id: getId('actionGroups'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actionGroups:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          id: getId('actions'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actions(node)).map((arg) => ({ ...arg, type: ACTION_TYPE }));\n              } catch {\n                log.warn('Error in actions', { id: getId('actions'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actions:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(isNonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  registry?: Registry.Registry;\n  source?: string;\n  relation?: Relation;\n};\n\nexport type BuilderExtension = Readonly<{\n  id: string;\n  position: Position;\n  relation?: Relation; // Only for connector.\n  resolver?: ResolverExtension;\n  connector?: (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n}>;\n\nexport type BuilderExtensions = BuilderExtension | BuilderExtension[] | BuilderExtensions[];\n\nexport const flattenExtensions = (extension: BuilderExtensions, acc: BuilderExtension[] = []): BuilderExtension[] => {\n  if (Array.isArray(extension)) {\n    return [...acc, ...extension.flatMap((ext) => flattenExtensions(ext, acc))];\n  } else {\n    return [...acc, extension];\n  }\n};\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  // TODO(wittjosiah): Use Context.\n  private readonly _subscriptions = new Map<string, CleanupFn>();\n  private readonly _extensions = Rx.make(Record.empty<string, BuilderExtension>()).pipe(\n    Rx.keepAlive,\n    Rx.withLabel('graph-builder:extensions'),\n  );\n  private readonly _initialized: Record<string, Trigger> = {};\n  private readonly _registry: Registry.Registry;\n  private readonly _graph: Graph;\n\n  constructor({ registry, ...params }: Pick<GraphParams, 'registry' | 'nodes' | 'edges'> = {}) {\n    this._registry = registry ?? Registry.make();\n    this._graph = new Graph({\n      ...params,\n      registry: this._registry,\n      onExpand: (id, relation) => this._onExpand(id, relation),\n      onInitialize: (id) => this._onInitialize(id),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string, registry?: Registry.Registry): GraphBuilder {\n    if (!pickle) {\n      return new GraphBuilder({ registry });\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges, registry });\n  }\n\n  get graph(): ExpandableGraph {\n    return this._graph;\n  }\n\n  get extensions() {\n    return this._extensions;\n  }\n\n  addExtension(extensions: BuilderExtensions): GraphBuilder {\n    flattenExtensions(extensions).forEach((extension) => {\n      const extensions = this._registry.get(this._extensions);\n      this._registry.set(this._extensions, Record.set(extensions, extension.id, extension));\n    });\n    return this;\n  }\n\n  removeExtension(id: string): GraphBuilder {\n    const extensions = this._registry.get(this._extensions);\n    this._registry.set(this._extensions, Record.remove(extensions, id));\n    return this;\n  }\n\n  async explore(\n    // TODO(wittjosiah): Currently defaulting to new registry.\n    //   Currently unsure about how to handle nodes which are expanded in the background.\n    //   This seems like a good place to start.\n    { registry = Registry.make(), source = ROOT_ID, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ): Promise<void> {\n    // Break cycles.\n    if (path.includes(source)) {\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\n    const node = registry.get(this._graph.nodeOrThrow(source));\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._registry.get(this._extensions))\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .map((extension) => extension.connector)\n      .filter(isNonNullable)\n      .flatMap((connector) => registry.get(connector(this._graph.node(source))));\n\n    await Promise.all(\n      nodes.map((nodeArg) => {\n        registry.set(this._graph._node(nodeArg.id), this._graph._constructNode(nodeArg));\n        return this.explore({ registry, source: nodeArg.id, relation, visitor }, [...path, node.id]);\n      }),\n    );\n\n    if (registry !== this._registry) {\n      registry.reset();\n      registry.dispose();\n    }\n  }\n\n  destroy(): void {\n    this._subscriptions.forEach((unsubscribe) => unsubscribe());\n    this._subscriptions.clear();\n  }\n\n  private readonly _resolvers = Rx.family<string, Rx.Rx<Option.Option<NodeArg<any>>>>((id) => {\n    return Rx.make((get) => {\n      return pipe(\n        get(this._extensions),\n        Record.values,\n        Array.sortBy(byPosition),\n        Array.map(({ resolver }) => resolver),\n        Array.filter(isNonNullable),\n        Array.map((resolver) => get(resolver(id))),\n        Array.filter(isNonNullable),\n        Array.head,\n      );\n    });\n  });\n\n  private readonly _connectors = Rx.family<string, Rx.Rx<NodeArg<any>[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('+');\n      const node = this._graph.node(id);\n\n      return pipe(\n        get(this._extensions),\n        Record.values,\n        // TODO(wittjosiah): Sort on write rather than read.\n        Array.sortBy(byPosition),\n        Array.filter(({ relation: _relation = 'outbound' }) => _relation === relation),\n        Array.map(({ connector }) => connector?.(node)),\n        Array.filter(isNonNullable),\n        Array.flatMap((result) => get(result)),\n      );\n    }).pipe(Rx.withLabel(`graph-builder:connectors:${key}`));\n  });\n\n  private _onExpand(id: string, relation: Relation): void {\n    log('onExpand', { id, relation, registry: getDebugName(this._registry) });\n    const connectors = this._connectors(`${id}+${relation}`);\n\n    let previous: string[] = [];\n    const cancel = this._registry.subscribe(\n      connectors,\n      (nodes) => {\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        log('update', { id, relation, ids, removed });\n        const update = () => {\n          Rx.batch(() => {\n            this._graph.removeEdges(\n              removed.map((target) => ({ source: id, target })),\n              true,\n            );\n            this._graph.addNodes(nodes);\n            this._graph.addEdges(\n              nodes.map((node) =>\n                relation === 'outbound' ? { source: id, target: node.id } : { source: node.id, target: id },\n              ),\n            );\n            this._graph.sortEdges(\n              id,\n              relation,\n              nodes.map(({ id }) => id),\n            );\n          });\n        };\n\n        // TODO(wittjosiah): Remove `requestAnimationFrame` once we have a better solution.\n        //  This is a workaround to avoid a race condition where the graph is updated during React render.\n        if (typeof requestAnimationFrame === 'function') {\n          requestAnimationFrame(update);\n        } else {\n          update();\n        }\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  // TODO(wittjosiah): If the same node is added by a connector, the resolver should probably cancel itself?\n  private async _onInitialize(id: string) {\n    log('onInitialize', { id });\n    const resolver = this._resolvers(id);\n\n    const cancel = this._registry.subscribe(\n      resolver,\n      (node) => {\n        const trigger = this._initialized[id];\n        Option.match(node, {\n          onSome: (node) => {\n            this._graph.addNodes([node]);\n            trigger?.wake();\n          },\n          onNone: () => {\n            trigger?.wake();\n            this._graph.removeNodes([id]);\n          },\n        });\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  private _onRemoveNode(id: string): void {\n    this._subscriptions.get(id)?.();\n    this._subscriptions.delete(id);\n  }\n}\n\n/**\n * Creates an Rx.Rx<T> from a callback which accesses signals.\n * Will return a new rx instance each time.\n */\nexport const rxFromSignal = <T>(cb: () => T): Rx.Rx<T> => {\n  return Rx.make((get) => {\n    const dispose = effect(() => {\n      get.setSelf(cb());\n    });\n\n    get.addFinalizer(() => dispose());\n\n    return cb();\n  });\n};\n\nconst observableFamily = Rx.family((observable: MulticastObservable<any>) => {\n  return Rx.make((get) => {\n    const subscription = observable.subscribe((value) => get.setSelf(value));\n\n    get.addFinalizer(() => subscription.unsubscribe());\n\n    return observable.get();\n  });\n});\n\n/**\n * Creates an Rx.Rx<T> from a MulticastObservable<T>\n * Will return the same rx instance for the same observable.\n */\nexport const rxFromObservable = <T>(observable: MulticastObservable<T>): Rx.Rx<T> => {\n  return observableFamily(observable) as Rx.Rx<T>;\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MakeOptional, type MaybePromise } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE } from './graph';\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  // TODO(burdon): Allow string array, which is concatenated.\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<TData = any, TProperties extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<TData, TProperties>;\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  parent?: 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' && data.type === ACTION_TYPE : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<typeof actionGroupSymbol, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol && data.type === ACTION_GROUP_TYPE : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n"],
-  "mappings": ";AAIA,SAASA,UAAUC,UAAU;AAC7B,SAASC,QAAQC,QAAQC,YAAY;AAErC,SAASC,OAAOC,eAAe;AAC/B,SAASC,YAAY;AACrB,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAA4BC,qBAAqB;;;;;;;;;;;;;;;AAIjD,IAAMC,cAAcC,OAAO,OAAA;AAOpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCH,YAAUO,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAMC,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAoM1B,IAAMC,QAAN,MAAMA;EAsGXC,OAAOC,KAAKN,SAAS;AACnB,WAAO,KAAKO,UAAUC,IAAI,KAAKC,MAAMH,EAAAA,CAAAA;EACvC;EAEAI,KAAKJ,KAAKN,SAAS;AACjB,WAAO,KAAKS,MAAMH,EAAAA;EACpB;EAEAR,KAAKQ,IAAwC;AAC3C,WAAO,KAAKK,MAAML,EAAAA;EACpB;EAEAM,YAAYN,IAAyB;AACnC,WAAO,KAAKO,aAAaP,EAAAA;EAC3B;EAEAQ,YAAYR,IAAYS,WAAqB,YAA2B;AACtE,WAAO,KAAKC,aAAa,GAAGV,EAAAA,IAAMS,QAAAA,EAAU;EAC9C;EAEAE,QAAQX,IAAY;AAClB,WAAO,KAAKY,SAASZ,EAAAA;EACvB;EAEAa,MAAMb,IAA0B;AAC9B,WAAO,KAAKc,OAAOd,EAAAA;EACrB;EAEA,IAAIe,OAAO;AACT,WAAO,KAAKC,eAAetB,OAAAA;EAC7B;EAEAuB,QAAQjB,IAAiC;AACvC,WAAO,KAAKC,UAAUC,IAAI,KAAKV,KAAKQ,EAAAA,CAAAA;EACtC;EAEAgB,eAAehB,IAAkB;AAC/B,WAAO,KAAKC,UAAUC,IAAI,KAAKI,YAAYN,EAAAA,CAAAA;EAC7C;EAEAkB,eAAelB,IAAYS,WAAqB,YAAoB;AAClE,WAAO,KAAKR,UAAUC,IAAI,KAAKM,YAAYR,IAAIS,QAAAA,CAAAA;EACjD;EAEAU,WAAWnB,IAAoB;AAC7B,WAAO,KAAKC,UAAUC,IAAI,KAAKS,QAAQX,EAAAA,CAAAA;EACzC;EAEAoB,SAASpB,IAAmB;AAC1B,WAAO,KAAKC,UAAUC,IAAI,KAAKW,MAAMb,EAAAA,CAAAA;EACvC;EAEA,MAAMqB,WAAWrB,IAAY;AAC3B,UAAMsB,cAAczC,OAAOqB,IAAI,KAAKqB,cAAcvB,EAAAA,EAAIlB,KAAKF,OAAO4C,UAAU,MAAM,KAAA,CAAA;AAClFrC,QAAI,cAAc;MAAEa;MAAIsB;IAAY,GAAA;;;;;;AACpC,QAAI,CAACA,aAAa;AAChB,YAAM,KAAKG,gBAAgBzB,EAAAA;AAC3BnB,aAAO6C,IAAI,KAAKH,cAAcvB,IAAI,IAAA;IACpC;EACF;EAEA2B,OAAO3B,IAAYS,WAAqB,YAAkB;AACxD,UAAMmB,MAAM,GAAG5B,EAAAA,IAAMS,QAAAA;AACrB,UAAMoB,WAAWhD,OAAOqB,IAAI,KAAK4B,WAAWF,GAAAA,EAAK9C,KAAKF,OAAO4C,UAAU,MAAM,KAAA,CAAA;AAC7ErC,QAAI,UAAU;MAAEyC;MAAKC;IAAS,GAAA;;;;;;AAC9B,QAAI,CAACA,UAAU;AACb,WAAKE,YAAY/B,IAAIS,QAAAA;AACrB5B,aAAO6C,IAAI,KAAKI,WAAWF,KAAK,IAAA;IAClC;EACF;EAEAI,SAASC,OAAkD;AACzDtD,OAAGuD,MAAM,MAAA;AACPD,YAAME,IAAI,CAAC3C,SAAS,KAAK4C,QAAQ5C,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEA4C,QAAQ,EAAEH,OAAOpB,OAAO,GAAGwB,QAAAA,GAAoD;AAC7E,UAAM,EAAErC,IAAIsC,MAAMC,OAAO,MAAMC,aAAa,CAAC,EAAC,IAAKH;AACnD,UAAMI,SAAS,KAAKpC,MAAML,EAAAA;AAC1B,UAAMR,OAAO,KAAKS,UAAUC,IAAIuC,MAAAA;AAChC7D,WAAO8D,MAAMlD,MAAM;MACjBmD,QAAQ,CAACnD,UAAAA;AACP,cAAMoD,cAAcpD,MAAK8C,SAASA;AAClC,cAAMO,cAAcrD,MAAK+C,SAASA;AAClC,cAAMO,oBAAoBC,OAAOC,KAAKR,UAAAA,EAAYS,KAAK,CAACrB,QAAQpC,MAAKgD,WAAWZ,GAAAA,MAASY,WAAWZ,GAAAA,CAAI;AACxGzC,YAAI,iBAAiB;UAAEa;UAAI4C;UAAaC;UAAaC;QAAkB,GAAA;;;;;;AACvE,YAAIF,eAAeC,eAAeC,mBAAmB;AACnD3D,cAAI,iBAAiB;YAAEa;YAAIsC;YAAMC;YAAMC;UAAW,GAAA;;;;;;AAClD,gBAAMU,UAAUtE,OAAOqE,KAAK;YAAE,GAAGzD;YAAM8C;YAAMC;YAAMC,YAAY;cAAE,GAAGhD,MAAKgD;cAAY,GAAGA;YAAW;UAAE,CAAA;AACrG,eAAKvC,UAAUyB,IAAIe,QAAQS,OAAAA;AAC3B,eAAKC,cAAcC,KAAK;YAAEpD;YAAIR,MAAM0D;UAAQ,CAAA;QAC9C;MACF;MACAG,QAAQ,MAAA;AACNlE,YAAI,YAAY;UAAEa;UAAIsC;UAAMC;UAAMC;QAAW,GAAA;;;;;;AAC7C,cAAMU,UAAU,KAAKI,eAAe;UAAEtD;UAAIsC;UAAMC;UAAMC;QAAW,CAAA;AACjE,aAAKvC,UAAUyB,IAAIe,QAAQS,OAAAA;AAC3B,aAAKC,cAAcC,KAAK;UAAEpD;UAAIR,MAAM0D;QAAQ,CAAA;MAC9C;IACF,CAAA;AAEA,QAAIjB,OAAO;AAET,WAAKD,SAASC,KAAAA;AACd,YAAMnB,SAASmB,MAAME,IAAI,CAAC3C,WAAU;QAAE+D,QAAQvD;QAAIwD,QAAQhE,MAAKQ;MAAG,EAAA;AAClE,WAAKyD,SAAS3C,MAAAA;IAEhB;AAEA,QAAID,OAAO;AACT5B,WAAAA;IACF;EACF;EAEAyE,YAAYC,KAAe9C,QAAQ,OAAa;AAC9ClC,OAAGuD,MAAM,MAAA;AACPyB,UAAIxB,IAAI,CAACnC,OAAO,KAAK4D,WAAW5D,IAAIa,KAAAA,CAAAA;IACtC,CAAA;EACF;EAEA+C,WAAW5D,IAAYa,QAAQ,OAAa;AAC1C,UAAM4B,SAAS,KAAKpC,MAAML,EAAAA;AAE1B,SAAKC,UAAUyB,IAAIe,QAAQ7D,OAAOiF,KAAI,CAAA;AACtC,SAAKV,cAAcC,KAAK;MAAEpD;MAAIR,MAAMZ,OAAOiF,KAAI;IAAG,CAAA;AAGlD,QAAIhD,OAAO;AACT,YAAM,EAAEiD,SAASC,SAAQ,IAAK,KAAK9D,UAAUC,IAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC7D,YAAMa,SAAQ;WACTiD,QAAQ3B,IAAI,CAACoB,YAAY;UAAEA;UAAQC,QAAQxD;QAAG,EAAA;WAC9C+D,SAAS5B,IAAI,CAACqB,YAAY;UAAED,QAAQvD;UAAIwD;QAAO,EAAA;;AAEpD,WAAKQ,YAAYnD,MAAAA;IACnB;AAEA,SAAKoD,gBAAgBjE,EAAAA;EACvB;EAEAyD,SAAS5C,OAAqB;AAC5BlC,OAAGuD,MAAM,MAAA;AACPrB,YAAMsB,IAAI,CAAC+B,SAAS,KAAKC,QAAQD,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAC,QAAQC,SAAqB;AAC3B,UAAMC,WAAW,KAAKvD,OAAOsD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,QAAI,CAACd,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC7CrE,UAAI,qBAAqB;QAAEoE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AAC1E,WAAKvD,UAAUyB,IAAI2C,UAAU;QAAEP,SAASP,OAAOO;QAASC,UAAU;aAAIR,OAAOQ;UAAUK,QAAQZ;;MAAQ,CAAA;IACzG;AAEA,UAAMe,WAAW,KAAKzD,OAAOsD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,QAAI,CAACf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC5CpE,UAAI,oBAAoB;QAAEoE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AACzE,WAAKvD,UAAUyB,IAAI6C,UAAU;QAAET,SAAS;aAAIN,OAAOM;UAASM,QAAQb;;QAASQ,UAAUP,OAAOO;MAAS,CAAA;IACzG;EACF;EAEAC,YAAYnD,OAAe2D,gBAAgB,OAAa;AACtD7F,OAAGuD,MAAM,MAAA;AACPrB,YAAMsB,IAAI,CAAC+B,SAAS,KAAKO,WAAWP,MAAMM,aAAAA,CAAAA;IAC5C,CAAA;EACF;EAEAC,WAAWL,SAAeI,gBAAgB,OAAa;AACrD,UAAMH,WAAW,KAAKvD,OAAOsD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,QAAId,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC5C,WAAKvD,UAAUyB,IAAI2C,UAAU;QAC3BP,SAASP,OAAOO;QAChBC,UAAUR,OAAOQ,SAASW,OAAO,CAAC1E,OAAOA,OAAOoE,QAAQZ,MAAM;MAChE,CAAA;IACF;AAEA,UAAMe,WAAW,KAAKzD,OAAOsD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,QAAIf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC3C,WAAKtD,UAAUyB,IAAI6C,UAAU;QAC3BT,SAASN,OAAOM,QAAQY,OAAO,CAAC1E,OAAOA,OAAOoE,QAAQb,MAAM;QAC5DQ,UAAUP,OAAOO;MACnB,CAAA;IACF;AAEA,QAAIS,eAAe;AACjB,YAAMjB,UAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,YAAMb,UAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,UAAIhB,QAAOQ,SAASY,WAAW,KAAKpB,QAAOO,QAAQa,WAAW,KAAKP,QAAQb,WAAW7D,SAAS;AAC7F,aAAKgE,YAAY;UAACU,QAAQb;SAAO;MACnC;AACA,UAAIC,QAAOO,SAASY,WAAW,KAAKnB,QAAOM,QAAQa,WAAW,KAAKP,QAAQZ,WAAW9D,SAAS;AAC7F,aAAKgE,YAAY;UAACU,QAAQZ;SAAO;MACnC;IACF;EACF;EAEAoB,UAAU5E,IAAYS,UAAoBoE,OAAuB;AAC/D,UAAMC,UAAU,KAAKhE,OAAOd,EAAAA;AAC5B,UAAMa,QAAQ,KAAKZ,UAAUC,IAAI4E,OAAAA;AACjC,UAAMC,WAAWlE,MAAMJ,QAAAA,EAAUiE,OAAO,CAAC1E,QAAO,CAAC6E,MAAMP,SAAStE,GAAAA,CAAAA,KAAQ,CAAA;AACxE,UAAMgF,SAASH,MAAMH,OAAO,CAAC1E,QAAOa,MAAMJ,QAAAA,EAAU6D,SAAStE,GAAAA,CAAAA,KAAQ,CAAA;AACrEa,UAAMJ,QAAAA,EAAUwE,OAAO,GAAGpE,MAAMJ,QAAAA,EAAUkE,QAAM,GAAK;SAAIK;SAAWD;KAAS;AAC7E,SAAK9E,UAAUyB,IAAIoD,SAASjE,KAAAA;EAC9B;EAEAqE,SAAS,EAAEC,SAAS5B,SAAS7D,SAASe,WAAW,WAAU,GAA2B2E,OAAiB,CAAA,GAAU;AAE/G,QAAIA,KAAKd,SAASf,MAAAA,GAAS;AACzB;IACF;AAEA,UAAM/D,OAAO,KAAKwB,eAAeuC,MAAAA;AACjC,UAAM8B,iBAAiBF,QAAQ3F,MAAM;SAAI4F;MAAM7B;KAAO;AACtD,QAAI8B,mBAAmB,OAAO;AAC5B;IACF;AAEAtC,WAAOuC,OAAO,KAAKpE,eAAeqC,QAAQ9C,QAAAA,CAAAA,EAAW8E,QAAQ,CAACC,UAC5D,KAAKN,SAAS;MAAE3B,QAAQiC,MAAMxF;MAAIS;MAAU0E;IAAQ,GAAG;SAAIC;MAAM7B;KAAO,CAAA;EAE5E;EAEAkC,QAAQ,EAAElC,SAAS,QAAQC,OAAM,GAAkE;AACjG,WAAO1E,KACL,KAAKmC,QAAQsC,MAAAA,GACb3E,OAAO8G,QAAQ,CAAClG,SAAAA;AACd,UAAImG,QAAiC/G,OAAOiF,KAAI;AAChD,WAAKqB,SAAS;QACZ3B,QAAQ/D,KAAKQ;QACbmF,SAAS,CAAC3F,OAAM4F,SAAAA;AACd,cAAIxG,OAAOgH,OAAOD,KAAAA,GAAQ;AACxB,mBAAO;UACT;AAEA,cAAInG,MAAKQ,OAAOwD,QAAQ;AACtBmC,oBAAQ/G,OAAOqE,KAAKmC,IAAAA;UACtB;QACF;MACF,CAAA;AAEA,aAAOO;IACT,CAAA,CAAA;EAEJ;EAEA,MAAME,YACJC,QACA,EAAEC,UAAU,KAAOC,WAAW,IAAG,IAA8C,CAAC,GAC7D;AACnB,UAAMZ,OAAO,KAAKK,QAAQK,MAAAA;AAC1B,QAAIlH,OAAOgH,OAAOR,IAAAA,GAAO;AACvB,aAAOA,KAAKa;IACd;AAEA,UAAMC,UAAU,IAAIlH,QAAAA;AACpB,UAAMmH,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKK,QAAQK,MAAAA;AAC1B,UAAIlH,OAAOgH,OAAOR,KAAAA,GAAO;AACvBc,gBAAQG,KAAKjB,MAAKa,KAAK;MACzB;IACF,GAAGD,QAAAA;AAEH,WAAOE,QAAQI,KAAK;MAAEP;IAAQ,CAAA,EAAGQ,QAAQ,MAAMC,cAAcL,CAAAA,CAAAA;EAC/D;;EAGA7C,eAAe9D,MAAyC;AACtD,WAAOZ,OAAOqE,KAAK;MAAE,CAAC5D,WAAAA,GAAc;MAAMkD,MAAM;MAAMC,YAAY,CAAC;MAAG,GAAGhD;IAAK,CAAA;EAChF;EAlSA,YAAY,EAAEiH,UAAUxE,OAAOpB,OAAO6F,cAAcC,UAAUC,aAAY,IAAkB,CAAC,GAAG;AAlFhG,qBAAA,MAASzD,iBAAgB,IAAIpE,MAAAA,CAAAA;AAE7B,qBAAA,MAAiBgD,aAAjB,MAAA;AACA,qBAAA,MAAiBN,iBAAjB,MAAA;AACA,qBAAA,MAAiBwC,iBAAjB,MAAA;AAEA,qBAAA,MAAiBhE,aAAjB,MAAA;AACA,qBAAA,MAAiB6B,aAAYjD,OAAOgI,MAAK,CAAA;AACzC,qBAAA,MAAiBtF,gBAAe1C,OAAOgI,MAAK,CAAA;AAC5C,qBAAA,MAAiBC,iBAAgBjI,OAAOgI,MAAK,CAAA;AAC7C,qBAAA,MAAiBE,iBAAgBlI,OAAOmI,YAAY;MAClD;QAACtH;QAAS,KAAK4D,eAAe;UAAEtD,IAAIN;UAAS4C,MAAM3C;UAAW4C,MAAM;UAAMC,YAAY,CAAC;QAAE,CAAA;;KAC1F,CAAA;AAGD,qBAAA,MAASnC,SAAQ1B,GAAGsI,OAAiD,CAACjH,OAAAA;AACpE,YAAMkH,UAAUtI,OAAOuI,QAAQtI,OAAOqB,IAAI,KAAK6G,eAAe/G,EAAAA,CAAAA;AAC9D,aAAOrB,GAAGyI,KAA0BF,OAAAA,EAASpI,KAAKH,GAAG0I,WAAW1I,GAAG2I,UAAU,cAActH,EAAAA,EAAI,CAAA;IACjG,CAAA,CAAA;AAEA,qBAAA,MAAiBO,gBAAe5B,GAAGsI,OAA4B,CAACjH,OAAAA;AAC9D,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAMV,OAAOU,IAAI,KAAKG,MAAML,EAAAA,CAAAA;AAC5Bd,kBAAUN,OAAOgH,OAAOpG,IAAAA,GAAO,uBAAuBQ,EAAAA,IAAI;;;;;;;;;AAC1D,eAAOR,KAAKyG;MACd,CAAA;IACF,CAAA,CAAA;AAEA,qBAAA,MAAiBnF,UAASnC,GAAGsI,OAAmC,CAACjH,OAAAA;AAC/D,YAAMkH,UAAUrI,OAAOqB,IAAI,KAAK4G,eAAe9G,EAAAA,EAAIlB,KAAKF,OAAO4C,UAAU,OAAO;QAAEsC,SAAS,CAAA;QAAIC,UAAU,CAAA;MAAG,EAAA,CAAA;AAC5G,aAAOpF,GAAGyI,KAAYF,OAAAA,EAASpI,KAAKH,GAAG0I,WAAW1I,GAAG2I,UAAU,eAAetH,EAAAA,EAAI,CAAA;IACpF,CAAA,CAAA;AAIA,qBAAA,MAAiBU,gBAAe/B,GAAGsI,OAA8B,CAACrF,QAAAA;AAChE,aAAOjD,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAM,CAACF,IAAIS,QAAAA,IAAYmB,IAAI2F,MAAM,GAAA;AACjC,cAAM1G,SAAQX,IAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC9B,eAAOa,OAAMJ,QAAAA,EACV0B,IAAI,CAACnC,QAAOE,IAAI,KAAKG,MAAML,GAAAA,CAAAA,CAAAA,EAC3B0E,OAAO9F,OAAOgH,MAAM,EACpBzD,IAAI,CAACqF,MAAMA,EAAEvB,KAAK;MACvB,CAAA,EAAGnH,KAAKH,GAAG2I,UAAU,qBAAqB1F,GAAAA,EAAK,CAAA;IACjD,CAAA,CAAA;AAEA,qBAAA,MAAiBhB,YAAWjC,GAAGsI,OAAgD,CAACjH,OAAAA;AAC9E,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,eAAOA,IAAI,KAAKQ,aAAa,GAAGV,EAAAA,WAAa,CAAA,EAAG0E,OAC9C,CAAClF,SAASA,KAAK8C,SAAS1C,eAAeJ,KAAK8C,SAASzC,iBAAAA;MAEzD,CAAA,EAAGf,KAAKH,GAAG2I,UAAU,iBAAiBtH,EAAAA,EAAI,CAAA;IAC5C,CAAA,CAAA;AAEA,qBAAA,MAAiBG,SAAQxB,GAAGsI,OAA2B,CAACjH,OAAAA;AACtD,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAMH,SAAS,CAACP,MAAYiI,OAAiB,CAAA,MAAE;AAC7C,gBAAMxF,SAAQ/B,IAAI,KAAKM,YAAYhB,KAAKQ,EAAE,CAAA;AAC1C,gBAAM0H,MAA2B;YAC/B1H,IAAIR,KAAKQ,GAAG2E,SAAS,KAAK,GAAGnF,KAAKQ,GAAG2H,MAAM,GAAG,EAAA,CAAA,QAAWnI,KAAKQ;YAC9DsC,MAAM9C,KAAK8C;UACb;AACA,cAAI9C,KAAKgD,WAAWoF,OAAO;AACzBF,gBAAIE,QAAQpI,KAAKgD,WAAWoF;UAC9B;AACA,cAAI3F,OAAM0C,QAAQ;AAChB+C,gBAAIzF,QAAQA,OACTE,IAAI,CAAC0F,MAAAA;AAEJ,oBAAMC,WAAW;mBAAIL;gBAAMjI,KAAKQ;;AAChC,qBAAO8H,SAASxD,SAASuD,EAAE7H,EAAE,IAAI+H,SAAYhI,OAAO8H,GAAGC,QAAAA;YACzD,CAAA,EACCpD,OAAOtF,aAAAA;UACZ;AACA,iBAAOsI;QACT;AAEA,cAAM3G,OAAOb,IAAI,KAAKI,YAAYN,EAAAA,CAAAA;AAClC,eAAOD,OAAOgB,IAAAA;MAChB,CAAA,EAAGjC,KAAKH,GAAG2I,UAAU,cAActH,EAAAA,EAAI,CAAA;IACzC,CAAA,CAAA;AAGE,SAAKC,YAAYwG,YAAY/H,SAAS0I,KAAI;AAC1C,SAAK3F,gBAAgBiF;AACrB,SAAK3E,YAAY4E;AACjB,SAAK1C,gBAAgB2C;AAErB,QAAI3E,OAAO;AACTA,YAAMsD,QAAQ,CAAC/F,SAAAA;AACbX,eAAO6C,IAAI,KAAKqF,eAAevH,KAAKQ,IAAI,KAAKsD,eAAe9D,IAAAA,CAAAA;MAC9D,CAAA;IACF;AAEA,QAAIqB,OAAO;AACTkC,aAAOiF,QAAQnH,KAAAA,EAAO0E,QAAQ,CAAC,CAAChC,QAAQ1C,MAAAA,MAAM;AAC5ChC,eAAO6C,IAAI,KAAKoF,eAAevD,QAAQ1C,MAAAA;MACzC,CAAA;IACF;EACF;AAkRF;;;ACrlBA,SAASoH,YAAAA,WAAUC,MAAAA,WAAU;AAC7B,SAASC,cAAc;AACvB,SAASC,OAAOC,UAAAA,SAAQC,UAAAA,SAAQC,QAAAA,aAAY;AAG5C,SAASC,OAAAA,YAAW;AACpB,SAA2CC,YAAYC,cAAcC,QAAQC,iBAAAA,sBAAqB;;;AC0C3F,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,cAAcA,KAAKG,SAASC,cAAc;AAE9E,IAAMC,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACP,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASK,qBAAqBL,KAAKG,SAASK,oBAAoB;AAIpF,IAAMC,eAAe,CAACT,SAAgDE,SAASF,IAAAA,KAASO,cAAcP,IAAAA;;;;;;;;;;;;;;;;;ADtCtG,IAAMU,kBAAkB,CAACC,cAAAA;AAC9B,QAAM,EACJC,IACAC,WAAW,UACXC,WAAW,YACXC,UAAUC,WACVC,WAAWC,YACXC,SAASC,UACTC,cAAcC,cAAa,IACzBX;AACJ,QAAMY,QAAQ,CAACC,QAAgB,GAAGZ,EAAAA,IAAMY,GAAAA;AAExC,QAAMT,WACJC,aAAaS,IAAGC,OAAO,CAACd,QAAeI,UAAUJ,GAAAA,EAAIe,KAAKF,IAAGG,UAAU,2BAA2BhB,GAAAA,EAAI,CAAA,CAAA;AAExG,QAAMK,YACJC,cACAO,IAAGC,OAAO,CAACG,SACTX,WAAWW,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,4BAA4BhB,EAAAA,EAAI,CAAA,CAAA;AAGvE,QAAMS,eACJC,iBACAG,IAAGC,OAAO,CAACG,SACTP,cAAcO,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,+BAA+BhB,EAAAA,EAAI,CAAA,CAAA;AAG7E,QAAMO,UACJC,YACAK,IAAGC,OAAO,CAACG,SAAqCT,SAASS,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,0BAA0BhB,EAAAA,EAAI,CAAA,CAAA;AAEjH,SAAO;IACLG,WAAW;MAAEH,IAAIW,MAAM,UAAA;MAAaV;MAAUE;IAAS,IAAIe;IAC3Db,YACK;MACCL,IAAIW,MAAM,WAAA;MACVV;MACAC;MACAG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIf,UAAUY,IAAAA,CAAAA;QACvB,QAAQ;AACNI,UAAAA,KAAIC,KAAK,sBAAsB;YAAEtB,IAAIW,MAAM,WAAA;YAAcM;UAAK,GAAA;;;;;;AAC9D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,2BAA2BhB,EAAAA,EAAI,CAAA,CAAA;IAExD,IACAkB;IACJT,eACK;MACCT,IAAIW,MAAM,cAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIX,aAAaQ,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAC3C,GAAGA;YACHC,MAAMC;YACNC,MAAMC;UACR,EAAA;QACF,QAAQ;AACNP,UAAAA,KAAIC,KAAK,yBAAyB;YAAEtB,IAAIW,MAAM,cAAA;YAAiBM;UAAK,GAAA;;;;;;AACpE,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,wCAAwChB,EAAAA,EAAI,CAAA,CAAA;IAErE,IACAkB;IACJX,UACK;MACCP,IAAIW,MAAM,SAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIb,QAAQU,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAAE,GAAGA;YAAKG,MAAME;UAAY,EAAA;QACtE,QAAQ;AACNR,UAAAA,KAAIC,KAAK,oBAAoB;YAAEtB,IAAIW,MAAM,SAAA;YAAYM;UAAK,GAAA;;;;;;AAC1D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,mCAAmChB,EAAAA,EAAI,CAAA,CAAA;IAEhE,IACAkB;IACJY,OAAOC,cAAAA;AACX;AAmBO,IAAMC,oBAAoB,CAACjC,WAA8BkC,MAA0B,CAAA,MAAE;AAC1F,MAAIC,MAAMC,QAAQpC,SAAAA,GAAY;AAC5B,WAAO;SAAIkC;SAAQlC,UAAUqC,QAAQ,CAACC,QAAQL,kBAAkBK,KAAKJ,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAKlC;;EAClB;AACF;AAQO,IAAMuC,eAAN,MAAMA,cAAAA;EAsBX,OAAOC,KAAKC,QAAiBC,UAA4C;AACvE,QAAI,CAACD,QAAQ;AACX,aAAO,IAAIF,cAAa;QAAEG;MAAS,CAAA;IACrC;AAEA,UAAM,EAAEC,OAAOC,MAAK,IAAKC,KAAKC,MAAML,MAAAA;AACpC,WAAO,IAAIF,cAAa;MAAEI;MAAOC;MAAOF;IAAS,CAAA;EACnD;EAEA,IAAIK,QAAyB;AAC3B,WAAO,KAAKC;EACd;EAEA,IAAIC,aAAa;AACf,WAAO,KAAKC;EACd;EAEAC,aAAaF,YAA6C;AACxDhB,sBAAkBgB,UAAAA,EAAYG,QAAQ,CAACpD,cAAAA;AACrC,YAAMiD,cAAa,KAAKI,UAAUhC,IAAI,KAAK6B,WAAW;AACtD,WAAKG,UAAUC,IAAI,KAAKJ,aAAaK,QAAOD,IAAIL,aAAYjD,UAAUC,IAAID,SAAAA,CAAAA;IAC5E,CAAA;AACA,WAAO;EACT;EAEAwD,gBAAgBvD,IAA0B;AACxC,UAAMgD,aAAa,KAAKI,UAAUhC,IAAI,KAAK6B,WAAW;AACtD,SAAKG,UAAUC,IAAI,KAAKJ,aAAaK,QAAOE,OAAOR,YAAYhD,EAAAA,CAAAA;AAC/D,WAAO;EACT;EAEA,MAAMyD,QAIJ,EAAEhB,WAAWiB,UAASvC,KAAI,GAAIwC,SAASC,SAAS1D,WAAW,YAAY2D,QAAO,GAC9EC,OAAiB,CAAA,GACF;AAEf,QAAIA,KAAKC,SAASJ,MAAAA,GAAS;AACzB;IACF;AAIA,QAAI,CAACK,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AAEA,UAAMhD,OAAOwB,SAASrB,IAAI,KAAK2B,OAAOmB,YAAYP,MAAAA,CAAAA;AAClD,UAAMQ,iBAAiB,MAAMN,QAAQ5C,MAAM;SAAI6C;MAAM7C,KAAKjB;KAAG;AAC7D,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMzB,QAAQ0B,OAAOC,OAAO,KAAKjB,UAAUhC,IAAI,KAAK6B,WAAW,CAAA,EAC5DnB,OAAO,CAAC/B,cAAcG,cAAcH,UAAUG,YAAY,WAAS,EACnEqB,IAAI,CAACxB,cAAcA,UAAUM,SAAS,EACtCyB,OAAOC,cAAAA,EACPK,QAAQ,CAAC/B,cAAcoC,SAASrB,IAAIf,UAAU,KAAK0C,OAAO9B,KAAK0C,MAAAA,CAAAA,CAAAA,CAAAA;AAElE,UAAMW,QAAQC,IACZ7B,MAAMnB,IAAI,CAACiD,YAAAA;AACT/B,eAASY,IAAI,KAAKN,OAAO0B,MAAMD,QAAQxE,EAAE,GAAG,KAAK+C,OAAO2B,eAAeF,OAAAA,CAAAA;AACvE,aAAO,KAAKf,QAAQ;QAAEhB;QAAUkB,QAAQa,QAAQxE;QAAIE;QAAU2D;MAAQ,GAAG;WAAIC;QAAM7C,KAAKjB;OAAG;IAC7F,CAAA,CAAA;AAGF,QAAIyC,aAAa,KAAKW,WAAW;AAC/BX,eAASkC,MAAK;AACdlC,eAASmC,QAAO;IAClB;EACF;EAEAC,UAAgB;AACd,SAAKC,eAAe3B,QAAQ,CAAC4B,gBAAgBA,YAAAA,CAAAA;AAC7C,SAAKD,eAAeE,MAAK;EAC3B;EAmCQC,UAAUjF,IAAYE,UAA0B;AACtDmB,IAAAA,KAAI,YAAY;MAAErB;MAAIE;MAAUuC,UAAUyC,aAAa,KAAK9B,SAAS;IAAE,GAAA;;;;;;AACvE,UAAM+B,aAAa,KAAKC,YAAY,GAAGpF,EAAAA,IAAME,QAAAA,EAAU;AAEvD,QAAImF,WAAqB,CAAA;AACzB,UAAMC,SAAS,KAAKlC,UAAUmC,UAC5BJ,YACA,CAACzC,UAAAA;AACC,YAAM8C,MAAM9C,MAAMnB,IAAI,CAACkE,MAAMA,EAAEzF,EAAE;AACjC,YAAM0F,UAAUL,SAASvD,OAAO,CAAC9B,QAAO,CAACwF,IAAIzB,SAAS/D,GAAAA,CAAAA;AACtDqF,iBAAWG;AAEXnE,MAAAA,KAAI,UAAU;QAAErB;QAAIE;QAAUsF;QAAKE;MAAQ,GAAA;;;;;;AAC3C,YAAMC,SAAS,MAAA;AACb9E,QAAAA,IAAG+E,MAAM,MAAA;AACP,eAAK7C,OAAO8C,YACVH,QAAQnE,IAAI,CAACuE,YAAY;YAAEnC,QAAQ3D;YAAI8F;UAAO,EAAA,GAC9C,IAAA;AAEF,eAAK/C,OAAOgD,SAASrD,KAAAA;AACrB,eAAKK,OAAOiD,SACVtD,MAAMnB,IAAI,CAACN,SACTf,aAAa,aAAa;YAAEyD,QAAQ3D;YAAI8F,QAAQ7E,KAAKjB;UAAG,IAAI;YAAE2D,QAAQ1C,KAAKjB;YAAI8F,QAAQ9F;UAAG,CAAA,CAAA;AAG9F,eAAK+C,OAAOkD,UACVjG,IACAE,UACAwC,MAAMnB,IAAI,CAAC,EAAEvB,IAAAA,IAAE,MAAOA,GAAAA,CAAAA;QAE1B,CAAA;MACF;AAIA,UAAI,OAAOkG,0BAA0B,YAAY;AAC/CA,8BAAsBP,MAAAA;MACxB,OAAO;AACLA,eAAAA;MACF;IACF,GACA;MAAEQ,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAezB,IAAIrD,IAAIsF,MAAAA;EAC9B;;EAGA,MAAcc,cAAcpG,IAAY;AACtCqB,IAAAA,KAAI,gBAAgB;MAAErB;IAAG,GAAA;;;;;;AACzB,UAAMG,WAAW,KAAKkG,WAAWrG,EAAAA;AAEjC,UAAMsF,SAAS,KAAKlC,UAAUmC,UAC5BpF,UACA,CAACc,SAAAA;AACC,YAAMqF,UAAU,KAAKC,aAAavG,EAAAA;AAClCwG,MAAAA,QAAOC,MAAMxF,MAAM;QACjByF,QAAQ,CAACzF,UAAAA;AACP,eAAK8B,OAAOgD,SAAS;YAAC9E;WAAK;AAC3BqF,mBAASK,KAAAA;QACX;QACAC,QAAQ,MAAA;AACNN,mBAASK,KAAAA;AACT,eAAK5D,OAAO8D,YAAY;YAAC7G;WAAG;QAC9B;MACF,CAAA;IACF,GACA;MAAEmG,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAezB,IAAIrD,IAAIsF,MAAAA;EAC9B;EAEQwB,cAAc9G,IAAkB;AACtC,SAAK8E,eAAe1D,IAAIpB,EAAAA,IAAAA;AACxB,SAAK8E,eAAeiC,OAAO/G,EAAAA;EAC7B;EAxMA,YAAY,EAAEyC,UAAU,GAAGuE,OAAAA,IAA8D,CAAC,GAAG;AAT7F,IAAAC,kBAAA,MAAiBnC,kBAAiB,oBAAIoC,IAAAA,CAAAA;AACtC,IAAAD,kBAAA,MAAiBhE,eAAcpC,IAAGM,KAAKmC,QAAO6D,MAAK,CAAA,EAA8BpG,KAC/EF,IAAGuG,WACHvG,IAAGG,UAAU,0BAAA,CAAA,CAAA;AAEf,IAAAiG,kBAAA,MAAiBV,gBAAwC,CAAC,CAAA;AAC1D,IAAAU,kBAAA,MAAiB7D,aAAjB,MAAA;AACA,IAAA6D,kBAAA,MAAiBlE,UAAjB,MAAA;AA6FA,IAAAkE,kBAAA,MAAiBZ,cAAaxF,IAAGC,OAAmD,CAACd,OAAAA;AACnF,aAAOa,IAAGM,KAAK,CAACC,QAAAA;AACd,eAAOL,MACLK,IAAI,KAAK6B,WAAW,GACpBK,QAAOe,QACPnC,MAAMmF,OAAOC,UAAAA,GACbpF,MAAMX,IAAI,CAAC,EAAEpB,SAAQ,MAAOA,QAAAA,GAC5B+B,MAAMJ,OAAOC,cAAAA,GACbG,MAAMX,IAAI,CAACpB,aAAaiB,IAAIjB,SAASH,EAAAA,CAAAA,CAAAA,GACrCkC,MAAMJ,OAAOC,cAAAA,GACbG,MAAMqF,IAAI;MAEd,CAAA;IACF,CAAA,CAAA;AAEA,IAAAN,kBAAA,MAAiB7B,eAAcvE,IAAGC,OAAsC,CAACF,QAAAA;AACvE,aAAOC,IAAGM,KAAK,CAACC,QAAAA;AACd,cAAM,CAACpB,IAAIE,QAAAA,IAAYU,IAAI4G,MAAM,GAAA;AACjC,cAAMvG,OAAO,KAAK8B,OAAO9B,KAAKjB,EAAAA;AAE9B,eAAOe;UACLK,IAAI,KAAK6B,WAAW;UACpBK,QAAOe;;UAEPnC,MAAMmF,OAAOC,UAAAA;UACbpF,MAAMJ,OAAO,CAAC,EAAE5B,UAAUuH,YAAY,WAAU,MAAOA,cAAcvH,QAAAA;UACrEgC,MAAMX,IAAI,CAAC,EAAElB,UAAS,MAAOA,YAAYY,IAAAA,CAAAA;UACzCiB,MAAMJ,OAAOC,cAAAA;UACbG,MAAME,QAAQ,CAACsF,WAAWtG,IAAIsG,MAAAA,CAAAA;QAAAA;MAElC,CAAA,EAAG3G,KAAKF,IAAGG,UAAU,4BAA4BJ,GAAAA,EAAK,CAAA;IACxD,CAAA,CAAA;AAzHE,SAAKwC,YAAYX,YAAYiB,UAASvC,KAAI;AAC1C,SAAK4B,SAAS,IAAI4E,MAAM;MACtB,GAAGX;MACHvE,UAAU,KAAKW;MACfwE,UAAU,CAAC5H,IAAIE,aAAa,KAAK+E,UAAUjF,IAAIE,QAAAA;MAC/C2H,cAAc,CAAC7H,OAAO,KAAKoG,cAAcpG,EAAAA;MACzC8H,cAAc,CAAC9H,OAAO,KAAK8G,cAAc9G,EAAAA;IAC3C,CAAA;EACF;AAgMF;AAMO,IAAM+H,eAAe,CAAIC,OAAAA;AAC9B,SAAOnH,IAAGM,KAAK,CAACC,QAAAA;AACd,UAAMwD,UAAUqD,OAAO,MAAA;AACrB7G,UAAI8G,QAAQF,GAAAA,CAAAA;IACd,CAAA;AAEA5G,QAAI+G,aAAa,MAAMvD,QAAAA,CAAAA;AAEvB,WAAOoD,GAAAA;EACT,CAAA;AACF;AAEA,IAAMI,mBAAmBvH,IAAGC,OAAO,CAACuH,eAAAA;AAClC,SAAOxH,IAAGM,KAAK,CAACC,QAAAA;AACd,UAAMkH,eAAeD,WAAW9C,UAAU,CAACgD,UAAUnH,IAAI8G,QAAQK,KAAAA,CAAAA;AAEjEnH,QAAI+G,aAAa,MAAMG,aAAavD,YAAW,CAAA;AAE/C,WAAOsD,WAAWjH,IAAG;EACvB,CAAA;AACF,CAAA;AAMO,IAAMoH,mBAAmB,CAAIH,eAAAA;AAClC,SAAOD,iBAAiBC,UAAAA;AAC1B;",
-  "names": ["Registry", "Rx", "Option", "Record", "pipe", "Event", "Trigger", "todo", "invariant", "log", "isNonNullable", "graphSymbol", "Symbol", "getGraph", "node", "graph", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "toJSON", "id", "_registry", "get", "_json", "json", "_node", "nodeOrThrow", "_nodeOrThrow", "connections", "relation", "_connections", "actions", "_actions", "edges", "_edges", "root", "getNodeOrThrow", "getNode", "getConnections", "getActions", "getEdges", "initialize", "initialized", "_initialized", "getOrElse", "_onInitialize", "set", "expand", "key", "expanded", "_expanded", "_onExpand", "addNodes", "nodes", "batch", "map", "addNode", "nodeArg", "type", "data", "properties", "nodeRx", "match", "onSome", "typeChanged", "dataChanged", "propertiesChanged", "Object", "keys", "some", "newNode", "onNodeChanged", "emit", "onNone", "_constructNode", "source", "target", "addEdges", "removeNodes", "ids", "removeNode", "none", "inbound", "outbound", "removeEdges", "_onRemoveNode", "edge", "addEdge", "edgeArg", "sourceRx", "includes", "targetRx", "removeOrphans", "removeEdge", "filter", "length", "sortEdges", "order", "edgesRx", "unsorted", "sorted", "splice", "traverse", "visitor", "path", "shouldContinue", "values", "forEach", "child", "getPath", "flatMap", "found", "isSome", "waitForPath", "params", "timeout", "interval", "value", "trigger", "i", "setInterval", "wake", "wait", "finally", "clearInterval", "registry", "onInitialize", "onExpand", "onRemoveNode", "empty", "_initialEdges", "_initialNodes", "fromEntries", "family", "initial", "flatten", "make", "keepAlive", "withLabel", "split", "o", "seen", "obj", "slice", "label", "n", "nextSeen", "undefined", "entries", "Registry", "Rx", "effect", "Array", "Option", "Record", "pipe", "log", "byPosition", "getDebugName", "isNode", "isNonNullable", "isGraphNode", "data", "properties", "isAction", "type", "ACTION_TYPE", "actionGroupSymbol", "Symbol", "isActionGroup", "ACTION_GROUP_TYPE", "isActionLike", "createExtension", "extension", "id", "position", "relation", "resolver", "_resolver", "connector", "_connector", "actions", "_actions", "actionGroups", "_actionGroups", "getId", "key", "Rx", "family", "pipe", "withLabel", "node", "undefined", "make", "get", "log", "warn", "map", "arg", "data", "actionGroupSymbol", "type", "ACTION_GROUP_TYPE", "ACTION_TYPE", "filter", "isNonNullable", "flattenExtensions", "acc", "Array", "isArray", "flatMap", "ext", "GraphBuilder", "from", "pickle", "registry", "nodes", "edges", "JSON", "parse", "graph", "_graph", "extensions", "_extensions", "addExtension", "forEach", "_registry", "set", "Record", "removeExtension", "remove", "explore", "Registry", "source", "ROOT_ID", "visitor", "path", "includes", "isNode", "yieldOrContinue", "nodeOrThrow", "shouldContinue", "Object", "values", "Promise", "all", "nodeArg", "_node", "_constructNode", "reset", "dispose", "destroy", "_subscriptions", "unsubscribe", "clear", "_onExpand", "getDebugName", "connectors", "_connectors", "previous", "cancel", "subscribe", "ids", "n", "removed", "update", "batch", "removeEdges", "target", "addNodes", "addEdges", "sortEdges", "requestAnimationFrame", "immediate", "_onInitialize", "_resolvers", "trigger", "_initialized", "Option", "match", "onSome", "wake", "onNone", "removeNodes", "_onRemoveNode", "delete", "params", "_define_property", "Map", "empty", "keepAlive", "sortBy", "byPosition", "head", "split", "_relation", "result", "Graph", "onExpand", "onInitialize", "onRemoveNode", "rxFromSignal", "cb", "effect", "setSelf", "addFinalizer", "observableFamily", "observable", "subscription", "value", "rxFromObservable"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\n\nimport { Event, Trigger } from '@dxos/async';\nimport { todo } from '@dxos/debug';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, isNonNullable } from '@dxos/util';\n\nimport { type Action, type ActionGroup, type Node, type NodeArg, type Relation } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = {\n  -readonly [K in keyof T]: T[K] extends object ? DeepWriteable<T[K]> : T[K];\n};\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\n/**\n * Get the Graph a Node is currently associated with.\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 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_ID\n   */\n  source?: string;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n};\n\nexport type GraphParams = {\n  registry?: Registry.Registry;\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, Edges>;\n  onExpand?: Graph['_onExpand'];\n  onInitialize?: Graph['_onInitialize'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\nexport type Edge = { source: string; target: string };\nexport type Edges = { inbound: string[]; outbound: string[] };\n\nexport interface ReadableGraph {\n  /**\n   * Event emitted when a node is changed.\n   */\n  onNodeChanged: Event<{ id: string; node: Option.Option<Node> }>;\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON(id?: string): object;\n\n  json(id?: string): Atom.Atom<any>;\n\n  /**\n   * Get the atom key for the node with the given id.\n   */\n  node(id: string): Atom.Atom<Option.Option<Node>>;\n\n  /**\n   * Get the atom key for the node with the given id.\n   */\n  nodeOrThrow(id: string): Atom.Atom<Node>;\n\n  /**\n   * Get the atom key for the connections of the node with the given id.\n   */\n  connections(id: string, relation?: Relation): Atom.Atom<Node[]>;\n\n  /**\n   * Get the atom key for the actions of the node with the given id.\n   */\n  actions(id: string): Atom.Atom<(Action | ActionGroup)[]>;\n\n  /**\n   * Get the atom key for the edges of the node with the given id.\n   */\n  edges(id: string): Atom.Atom<Edges>;\n\n  /**\n   * Alias for `getNodeOrThrow(ROOT_ID)`.\n   */\n  get root(): Node;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   */\n  getNode(id: string): Option.Option<Node>;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   *\n   * @throws If the node is Option.none().\n   */\n  getNodeOrThrow(id: string): Node;\n\n  /**\n   * Get all nodes connected to the node with the given id by the given relation from the graph's registry.\n   */\n  getConnections(id: string, relation?: Relation): Node[];\n\n  /**\n   * Get all actions connected to the node with the given id from the graph's registry.\n   */\n  getActions(id: string): Node[];\n\n  /**\n   * Get the edges from the node with the given id from the graph's registry.\n   */\n  getEdges(id: string): Edges;\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(options: GraphTraversalOptions, path?: string[]): void;\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath(params: { source?: string; target: string }): Option.Option<string[]>;\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  waitForPath(\n    params: { source?: string; target: string },\n    options?: { timeout?: number; interval?: number },\n  ): Promise<string[]>;\n}\n\nexport interface ExpandableGraph extends ReadableGraph {\n  /**\n   * Initialize a node in the graph.\n   *\n   * Fires the `onInitialize` callback to provide initial data for a node.\n   */\n  initialize(id: string): Promise<void>;\n\n  /**\n   * Expand a node in the graph.\n   *\n   * Fires the `onExpand` callback to add connections to the node.\n   */\n  expand(id: string, relation?: Relation): void;\n\n  /**\n   * Sort the edges of the node with the given id.\n   */\n  sortEdges(id: string, relation: Relation, order: string[]): void;\n}\n\nexport interface WritableGraph extends ExpandableGraph {\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void;\n\n  /**\n   * Add a node to the graph.\n   */\n  addNode(node: NodeArg<any, Record<string, any>>): void;\n\n  /**\n   * Remove nodes from the graph.\n   */\n  removeNodes(ids: string[], edges?: boolean): void;\n\n  /**\n   * Remove a node from the graph.\n   */\n  removeNode(id: string, edges?: boolean): void;\n\n  /**\n   * Add edges to the graph.\n   */\n  addEdges(edges: Edge[]): void;\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge(edge: Edge): void;\n\n  /**\n   * Remove edges from the graph.\n   */\n  removeEdges(edges: Edge[], removeOrphans?: boolean): void;\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge(edge: Edge, removeOrphans?: boolean): void;\n}\n\n/**\n * The Graph represents the user interface information architecture of the application constructed via plugins.\n */\nexport class Graph implements WritableGraph {\n  readonly onNodeChanged = new Event<{\n    id: string;\n    node: Option.Option<Node>;\n  }>();\n\n  private readonly _onExpand?: (id: string, relation: Relation) => void;\n  private readonly _onInitialize?: (id: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => void;\n\n  private readonly _registry: Registry.Registry;\n  private readonly _expanded = Record.empty<string, boolean>();\n  private readonly _initialized = Record.empty<string, boolean>();\n  private readonly _initialEdges = Record.empty<string, Edges>();\n  private readonly _initialNodes = Record.fromEntries([\n    [\n      ROOT_ID,\n      this._constructNode({\n        id: ROOT_ID,\n        type: ROOT_TYPE,\n        data: null,\n        properties: {},\n      }),\n    ],\n  ]);\n\n  /** @internal */\n  readonly _node = Atom.family<string, Atom.Writable<Option.Option<Node>>>((id) => {\n    const initial = Option.flatten(Record.get(this._initialNodes, id));\n    return Atom.make<Option.Option<Node>>(initial).pipe(Atom.keepAlive, Atom.withLabel(`graph:node:${id}`));\n  });\n\n  private readonly _nodeOrThrow = Atom.family<string, Atom.Atom<Node>>((id) => {\n    return Atom.make((get) => {\n      const node = get(this._node(id));\n      invariant(Option.isSome(node), `Node not available: ${id}`);\n      return node.value;\n    });\n  });\n\n  private readonly _edges = Atom.family<string, Atom.Writable<Edges>>((id) => {\n    const initial = Record.get(this._initialEdges, id).pipe(Option.getOrElse(() => ({ inbound: [], outbound: [] })));\n    return Atom.make<Edges>(initial).pipe(Atom.keepAlive, Atom.withLabel(`graph:edges:${id}`));\n  });\n\n  // NOTE: Currently the argument to the family needs to be referentially stable for the atom to be referentially stable.\n  // TODO(wittjosiah): Atom feature request, support for something akin to `ComplexMap` to allow for complex arguments.\n  private readonly _connections = Atom.family<string, Atom.Atom<Node[]>>((key) => {\n    return Atom.make((get) => {\n      const [id, relation] = key.split('$');\n      const edges = get(this._edges(id));\n      return edges[relation as Relation]\n        .map((id) => get(this._node(id)))\n        .filter(Option.isSome)\n        .map((o) => o.value);\n    }).pipe(Atom.withLabel(`graph:connections:${key}`));\n  });\n\n  private readonly _actions = Atom.family<string, Atom.Atom<(Action | ActionGroup)[]>>((id) => {\n    return Atom.make((get) => {\n      return get(this._connections(`${id}$outbound`)).filter(\n        (node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE,\n      );\n    }).pipe(Atom.withLabel(`graph:actions:${id}`));\n  });\n\n  private readonly _json = Atom.family<string, Atom.Atom<any>>((id) => {\n    return Atom.make((get) => {\n      const toJSON = (node: Node, seen: string[] = []): any => {\n        const nodes = get(this.connections(node.id));\n        const obj: Record<string, any> = {\n          id: 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(isNonNullable);\n        }\n        return obj;\n      };\n\n      const root = get(this.nodeOrThrow(id));\n      return toJSON(root);\n    }).pipe(Atom.withLabel(`graph:json:${id}`));\n  });\n\n  constructor({ registry, nodes, edges, onInitialize, onExpand, onRemoveNode }: GraphParams = {}) {\n    this._registry = registry ?? Registry.make();\n    this._onInitialize = onInitialize;\n    this._onExpand = onExpand;\n    this._onRemoveNode = onRemoveNode;\n\n    if (nodes) {\n      nodes.forEach((node) => {\n        Record.set(this._initialNodes, node.id, this._constructNode(node));\n      });\n    }\n\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        Record.set(this._initialEdges, source, edges);\n      });\n    }\n  }\n\n  toJSON(id = ROOT_ID) {\n    return this._registry.get(this._json(id));\n  }\n\n  json(id = ROOT_ID) {\n    return this._json(id);\n  }\n\n  node(id: string): Atom.Atom<Option.Option<Node>> {\n    return this._node(id);\n  }\n\n  nodeOrThrow(id: string): Atom.Atom<Node> {\n    return this._nodeOrThrow(id);\n  }\n\n  connections(id: string, relation: Relation = 'outbound'): Atom.Atom<Node[]> {\n    return this._connections(`${id}$${relation}`);\n  }\n\n  actions(id: string) {\n    return this._actions(id);\n  }\n\n  edges(id: string): Atom.Atom<Edges> {\n    return this._edges(id);\n  }\n\n  get root() {\n    return this.getNodeOrThrow(ROOT_ID);\n  }\n\n  getNode(id: string): Option.Option<Node> {\n    return this._registry.get(this.node(id));\n  }\n\n  getNodeOrThrow(id: string): Node {\n    return this._registry.get(this.nodeOrThrow(id));\n  }\n\n  getConnections(id: string, relation: Relation = 'outbound'): Node[] {\n    return this._registry.get(this.connections(id, relation));\n  }\n\n  getActions(id: string): Node[] {\n    return this._registry.get(this.actions(id));\n  }\n\n  getEdges(id: string): Edges {\n    return this._registry.get(this.edges(id));\n  }\n\n  async initialize(id: string) {\n    const initialized = Record.get(this._initialized, id).pipe(Option.getOrElse(() => false));\n    log('initialize', { id, initialized });\n    if (!initialized) {\n      await this._onInitialize?.(id);\n      Record.set(this._initialized, id, true);\n    }\n  }\n\n  expand(id: string, relation: Relation = 'outbound'): void {\n    const key = `${id}$${relation}`;\n    const expanded = Record.get(this._expanded, key).pipe(Option.getOrElse(() => false));\n    log('expand', { key, expanded });\n    if (!expanded) {\n      this._onExpand?.(id, relation);\n      Record.set(this._expanded, key, true);\n    }\n  }\n\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void {\n    Atom.batch(() => {\n      nodes.map((node) => this.addNode(node));\n    });\n  }\n\n  addNode({ nodes, edges, ...nodeArg }: NodeArg<any, Record<string, any>>): void {\n    const { id, type, data = null, properties = {} } = nodeArg;\n    const nodeAtom = this._node(id);\n    const node = this._registry.get(nodeAtom);\n    Option.match(node, {\n      onSome: (node) => {\n        const typeChanged = node.type !== type;\n        const dataChanged = node.data !== data;\n        const propertiesChanged = Object.keys(properties).some((key) => node.properties[key] !== properties[key]);\n        log('existing node', {\n          id,\n          typeChanged,\n          dataChanged,\n          propertiesChanged,\n        });\n        if (typeChanged || dataChanged || propertiesChanged) {\n          log('updating node', { id, type, data, properties });\n          const newNode = Option.some({\n            ...node,\n            type,\n            data,\n            properties: { ...node.properties, ...properties },\n          });\n          this._registry.set(nodeAtom, newNode);\n          this.onNodeChanged.emit({ id, node: newNode });\n        }\n      },\n      onNone: () => {\n        log('new node', { id, type, data, properties });\n        const newNode = this._constructNode({ id, type, data, properties });\n        this._registry.set(nodeAtom, newNode);\n        this.onNodeChanged.emit({ id, node: newNode });\n      },\n    });\n\n    if (nodes) {\n      // Atom.batch(() => {\n      this.addNodes(nodes);\n      const _edges = nodes.map((node) => ({ source: id, target: node.id }));\n      this.addEdges(_edges);\n      // });\n    }\n\n    if (edges) {\n      todo();\n    }\n  }\n\n  removeNodes(ids: string[], edges = false): void {\n    Atom.batch(() => {\n      ids.map((id) => this.removeNode(id, edges));\n    });\n  }\n\n  removeNode(id: string, edges = false): void {\n    const nodeAtom = this._node(id);\n    // TODO(wittjosiah): Is there a way to mark these atom values for garbage collection?\n    this._registry.set(nodeAtom, Option.none());\n    this.onNodeChanged.emit({ id, node: Option.none() });\n    // TODO(wittjosiah): Reset expanded and initialized flags?\n\n    if (edges) {\n      const { inbound, outbound } = this._registry.get(this._edges(id));\n      const edges = [\n        ...inbound.map((source) => ({ source, target: id })),\n        ...outbound.map((target) => ({ source: id, target })),\n      ];\n      this.removeEdges(edges);\n    }\n\n    this._onRemoveNode?.(id);\n  }\n\n  addEdges(edges: Edge[]): void {\n    Atom.batch(() => {\n      edges.map((edge) => this.addEdge(edge));\n    });\n  }\n\n  addEdge(edgeArg: Edge): void {\n    const sourceAtom = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceAtom);\n    if (!source.outbound.includes(edgeArg.target)) {\n      log('add outbound edge', {\n        source: edgeArg.source,\n        target: edgeArg.target,\n      });\n      this._registry.set(sourceAtom, {\n        inbound: source.inbound,\n        outbound: [...source.outbound, edgeArg.target],\n      });\n    }\n\n    const targetAtom = this._edges(edgeArg.target);\n    const target = this._registry.get(targetAtom);\n    if (!target.inbound.includes(edgeArg.source)) {\n      log('add inbound edge', {\n        source: edgeArg.source,\n        target: edgeArg.target,\n      });\n      this._registry.set(targetAtom, {\n        inbound: [...target.inbound, edgeArg.source],\n        outbound: target.outbound,\n      });\n    }\n  }\n\n  removeEdges(edges: Edge[], removeOrphans = false): void {\n    Atom.batch(() => {\n      edges.map((edge) => this.removeEdge(edge, removeOrphans));\n    });\n  }\n\n  removeEdge(edgeArg: Edge, removeOrphans = false): void {\n    const sourceAtom = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceAtom);\n    if (source.outbound.includes(edgeArg.target)) {\n      this._registry.set(sourceAtom, {\n        inbound: source.inbound,\n        outbound: source.outbound.filter((id) => id !== edgeArg.target),\n      });\n    }\n\n    const targetAtom = this._edges(edgeArg.target);\n    const target = this._registry.get(targetAtom);\n    if (target.inbound.includes(edgeArg.source)) {\n      this._registry.set(targetAtom, {\n        inbound: target.inbound.filter((id) => id !== edgeArg.source),\n        outbound: target.outbound,\n      });\n    }\n\n    if (removeOrphans) {\n      const source = this._registry.get(sourceAtom);\n      const target = this._registry.get(targetAtom);\n      if (source.outbound.length === 0 && source.inbound.length === 0 && edgeArg.source !== ROOT_ID) {\n        this.removeNodes([edgeArg.source]);\n      }\n      if (target.outbound.length === 0 && target.inbound.length === 0 && edgeArg.target !== ROOT_ID) {\n        this.removeNodes([edgeArg.target]);\n      }\n    }\n  }\n\n  sortEdges(id: string, relation: Relation, order: string[]): void {\n    const edgesAtom = this._edges(id);\n    const edges = this._registry.get(edgesAtom);\n    const unsorted = edges[relation].filter((id) => !order.includes(id)) ?? [];\n    const sorted = order.filter((id) => edges[relation].includes(id)) ?? [];\n    edges[relation].splice(0, edges[relation].length, ...[...sorted, ...unsorted]);\n    this._registry.set(edgesAtom, edges);\n  }\n\n  traverse({ visitor, source = ROOT_ID, relation = 'outbound' }: GraphTraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    const node = this.getNodeOrThrow(source);\n    const shouldContinue = visitor(node, [...path, source]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this.getConnections(source, relation)).forEach((child) =>\n      this.traverse({ source: child.id, relation, visitor }, [...path, source]),\n    );\n  }\n\n  getPath({ source = 'root', target }: { source?: string; target: string }): Option.Option<string[]> {\n    return Function.pipe(\n      this.getNode(source),\n      Option.flatMap((node) => {\n        let found: Option.Option<string[]> = Option.none();\n        this.traverse({\n          source: node.id,\n          visitor: (node, path) => {\n            if (Option.isSome(found)) {\n              return false;\n            }\n\n            if (node.id === target) {\n              found = Option.some(path);\n            }\n          },\n        });\n\n        return found;\n      }),\n    );\n  }\n\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ): Promise<string[]> {\n    const path = this.getPath(params);\n    if (Option.isSome(path)) {\n      return path.value;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (Option.isSome(path)) {\n        trigger.wake(path.value);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /** @internal */\n  _constructNode(node: NodeArg<any>): Option.Option<Node> {\n    return Option.some({\n      [graphSymbol]: this,\n      data: null,\n      properties: {},\n      ...node,\n    });\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\nimport { effect } from '@preact/signals-core';\nimport * as Array from 'effect/Array';\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\n\nimport { type CleanupFn, type MulticastObservable, type Trigger } from '@dxos/async';\nimport { log } from '@dxos/log';\nimport { type MaybePromise, type Position, byPosition, getDebugName, isNode, isNonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, type ExpandableGraph, Graph, type GraphParams, ROOT_ID } from './graph';\nimport { type ActionData, type Node, type NodeArg, type Relation, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on a node id.\n */\nexport type ResolverExtension = (id: string) => Atom.Atom<NodeArg<any> | null>;\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 = (node: Atom.Atom<Option.Option<Node>>) => Atom.Atom<NodeArg<any>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension = (\n  node: Atom.Atom<Option.Option<Node>>,\n) => Atom.Atom<Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension = (\n  node: Atom.Atom<Option.Option<Node>>,\n) => Atom.Atom<Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[]>;\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.position Affects the order the extensions are processed in.\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 = {\n  id: string;\n  relation?: Relation;\n  position?: Position;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  actions?: ActionsExtension;\n  actionGroups?: ActionGroupsExtension;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = (extension: CreateExtensionOptions): BuilderExtension[] => {\n  const {\n    id,\n    position = 'static',\n    relation = 'outbound',\n    resolver: _resolver,\n    connector: _connector,\n    actions: _actions,\n    actionGroups: _actionGroups,\n  } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n\n  const resolver =\n    _resolver && Atom.family((id: string) => _resolver(id).pipe(Atom.withLabel(`graph-builder:_resolver:${id}`)));\n\n  const connector =\n    _connector &&\n    Atom.family((node: Atom.Atom<Option.Option<Node>>) =>\n      _connector(node).pipe(Atom.withLabel(`graph-builder:_connector:${id}`)),\n    );\n\n  const actionGroups =\n    _actionGroups &&\n    Atom.family((node: Atom.Atom<Option.Option<Node>>) =>\n      _actionGroups(node).pipe(Atom.withLabel(`graph-builder:_actionGroups:${id}`)),\n    );\n\n  const actions =\n    _actions &&\n    Atom.family((node: Atom.Atom<Option.Option<Node>>) =>\n      _actions(node).pipe(Atom.withLabel(`graph-builder:_actions:${id}`)),\n    );\n\n  return [\n    resolver ? { id: getId('resolver'), position, resolver } : undefined,\n    connector\n      ? ({\n          id: getId('connector'),\n          position,\n          relation,\n          connector: Atom.family((node) =>\n            Atom.make((get) => {\n              try {\n                return get(connector(node));\n              } catch {\n                log.warn('Error in connector', { id: getId('connector'), node });\n                return [];\n              }\n            }).pipe(Atom.withLabel(`graph-builder:connector:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actionGroups\n      ? ({\n          id: getId('actionGroups'),\n          position,\n          relation: 'outbound',\n          connector: Atom.family((node) =>\n            Atom.make((get) => {\n              try {\n                return get(actionGroups(node)).map((arg) => ({\n                  ...arg,\n                  data: actionGroupSymbol,\n                  type: ACTION_GROUP_TYPE,\n                }));\n              } catch {\n                log.warn('Error in actionGroups', { id: getId('actionGroups'), node });\n                return [];\n              }\n            }).pipe(Atom.withLabel(`graph-builder:connector:actionGroups:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          id: getId('actions'),\n          position,\n          relation: 'outbound',\n          connector: Atom.family((node) =>\n            Atom.make((get) => {\n              try {\n                return get(actions(node)).map((arg) => ({ ...arg, type: ACTION_TYPE }));\n              } catch {\n                log.warn('Error in actions', { id: getId('actions'), node });\n                return [];\n              }\n            }).pipe(Atom.withLabel(`graph-builder:connector:actions:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(isNonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  registry?: Registry.Registry;\n  source?: string;\n  relation?: Relation;\n};\n\nexport type BuilderExtension = Readonly<{\n  id: string;\n  position: Position;\n  relation?: Relation; // Only for connector.\n  resolver?: ResolverExtension;\n  connector?: (node: Atom.Atom<Option.Option<Node>>) => Atom.Atom<NodeArg<any>[]>;\n}>;\n\nexport type BuilderExtensions = BuilderExtension | BuilderExtension[] | BuilderExtensions[];\n\nexport const flattenExtensions = (extension: BuilderExtensions, acc: BuilderExtension[] = []): BuilderExtension[] => {\n  if (Array.isArray(extension)) {\n    return [...acc, ...extension.flatMap((ext) => flattenExtensions(ext, acc))];\n  } else {\n    return [...acc, extension];\n  }\n};\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  // TODO(wittjosiah): Use Context.\n  private readonly _subscriptions = new Map<string, CleanupFn>();\n  private readonly _extensions = Atom.make(Record.empty<string, BuilderExtension>()).pipe(\n    Atom.keepAlive,\n    Atom.withLabel('graph-builder:extensions'),\n  );\n  private readonly _initialized: Record<string, Trigger> = {};\n  private readonly _registry: Registry.Registry;\n  private readonly _graph: Graph;\n\n  constructor({ registry, ...params }: Pick<GraphParams, 'registry' | 'nodes' | 'edges'> = {}) {\n    this._registry = registry ?? Registry.make();\n    this._graph = new Graph({\n      ...params,\n      registry: this._registry,\n      onExpand: (id, relation) => this._onExpand(id, relation),\n      onInitialize: (id) => this._onInitialize(id),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string, registry?: Registry.Registry): GraphBuilder {\n    if (!pickle) {\n      return new GraphBuilder({ registry });\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges, registry });\n  }\n\n  get graph(): ExpandableGraph {\n    return this._graph;\n  }\n\n  get extensions() {\n    return this._extensions;\n  }\n\n  addExtension(extensions: BuilderExtensions): GraphBuilder {\n    flattenExtensions(extensions).forEach((extension) => {\n      const extensions = this._registry.get(this._extensions);\n      this._registry.set(this._extensions, Record.set(extensions, extension.id, extension));\n    });\n    return this;\n  }\n\n  removeExtension(id: string): GraphBuilder {\n    const extensions = this._registry.get(this._extensions);\n    this._registry.set(this._extensions, Record.remove(extensions, id));\n    return this;\n  }\n\n  async explore(\n    // TODO(wittjosiah): Currently defaulting to new registry.\n    //   Currently unsure about how to handle nodes which are expanded in the background.\n    //   This seems like a good place to start.\n    { registry = Registry.make(), source = ROOT_ID, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ): Promise<void> {\n    // Break cycles.\n    if (path.includes(source)) {\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\n    const node = registry.get(this._graph.nodeOrThrow(source));\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._registry.get(this._extensions))\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .map((extension) => extension.connector)\n      .filter(isNonNullable)\n      .flatMap((connector) => registry.get(connector(this._graph.node(source))));\n\n    await Promise.all(\n      nodes.map((nodeArg) => {\n        registry.set(this._graph._node(nodeArg.id), this._graph._constructNode(nodeArg));\n        return this.explore({ registry, source: nodeArg.id, relation, visitor }, [...path, node.id]);\n      }),\n    );\n\n    if (registry !== this._registry) {\n      registry.reset();\n      registry.dispose();\n    }\n  }\n\n  destroy(): void {\n    this._subscriptions.forEach((unsubscribe) => unsubscribe());\n    this._subscriptions.clear();\n  }\n\n  private readonly _resolvers = Atom.family<string, Atom.Atom<Option.Option<NodeArg<any>>>>((id) => {\n    return Atom.make((get) => {\n      return Function.pipe(\n        get(this._extensions),\n        Record.values,\n        Array.sortBy(byPosition),\n        Array.map(({ resolver }) => resolver),\n        Array.filter(isNonNullable),\n        Array.map((resolver) => get(resolver(id))),\n        Array.filter(isNonNullable),\n        Array.head,\n      );\n    });\n  });\n\n  private readonly _connectors = Atom.family<string, Atom.Atom<NodeArg<any>[]>>((key) => {\n    return Atom.make((get) => {\n      const [id, relation] = key.split('+');\n      const node = this._graph.node(id);\n\n      return Function.pipe(\n        get(this._extensions),\n        Record.values,\n        // TODO(wittjosiah): Sort on write rather than read.\n        Array.sortBy(byPosition),\n        Array.filter(({ relation: _relation = 'outbound' }) => _relation === relation),\n        Array.map(({ connector }) => connector?.(node)),\n        Array.filter(isNonNullable),\n        Array.flatMap((result) => get(result)),\n      );\n    }).pipe(Atom.withLabel(`graph-builder:connectors:${key}`));\n  });\n\n  private _onExpand(id: string, relation: Relation): void {\n    log('onExpand', { id, relation, registry: getDebugName(this._registry) });\n    const connectors = this._connectors(`${id}+${relation}`);\n\n    let previous: string[] = [];\n    const cancel = this._registry.subscribe(\n      connectors,\n      (nodes) => {\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        log('update', { id, relation, ids, removed });\n        const update = () => {\n          Atom.batch(() => {\n            this._graph.removeEdges(\n              removed.map((target) => ({ source: id, target })),\n              true,\n            );\n            this._graph.addNodes(nodes);\n            this._graph.addEdges(\n              nodes.map((node) =>\n                relation === 'outbound' ? { source: id, target: node.id } : { source: node.id, target: id },\n              ),\n            );\n            this._graph.sortEdges(\n              id,\n              relation,\n              nodes.map(({ id }) => id),\n            );\n          });\n        };\n\n        // TODO(wittjosiah): Remove `requestAnimationFrame` once we have a better solution.\n        //  This is a workaround to avoid a race condition where the graph is updated during React render.\n        if (typeof requestAnimationFrame === 'function') {\n          requestAnimationFrame(update);\n        } else {\n          update();\n        }\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  // TODO(wittjosiah): If the same node is added by a connector, the resolver should probably cancel itself?\n  private async _onInitialize(id: string) {\n    log('onInitialize', { id });\n    const resolver = this._resolvers(id);\n\n    const cancel = this._registry.subscribe(\n      resolver,\n      (node) => {\n        const trigger = this._initialized[id];\n        Option.match(node, {\n          onSome: (node) => {\n            this._graph.addNodes([node]);\n            trigger?.wake();\n          },\n          onNone: () => {\n            trigger?.wake();\n            this._graph.removeNodes([id]);\n          },\n        });\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  private _onRemoveNode(id: string): void {\n    this._subscriptions.get(id)?.();\n    this._subscriptions.delete(id);\n  }\n}\n\n/**\n * Creates an Atom.Atom<T> from a callback which accesses signals.\n * Will return a new atom instance each time.\n */\nexport const atomFromSignal = <T>(cb: () => T): Atom.Atom<T> => {\n  return Atom.make((get) => {\n    const dispose = effect(() => {\n      get.setSelf(cb());\n    });\n\n    get.addFinalizer(() => dispose());\n\n    return cb();\n  });\n};\n\nconst observableFamily = Atom.family((observable: MulticastObservable<any>) => {\n  return Atom.make((get) => {\n    const subscription = observable.subscribe((value) => get.setSelf(value));\n\n    get.addFinalizer(() => subscription.unsubscribe());\n\n    return observable.get();\n  });\n});\n\n/**\n * Creates an Atom.Atom<T> from a MulticastObservable<T>\n * Will return the same atom instance for the same observable.\n */\nexport const atomFromObservable = <T>(observable: MulticastObservable<T>): Atom.Atom<T> => {\n  return observableFamily(observable) as Atom.Atom<T>;\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MakeOptional, type MaybePromise } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE } from './graph';\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  // TODO(burdon): Allow string array, which is concatenated.\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<TData = any, TProperties extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<TData, TProperties>;\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  parent?: 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' && data.type === ACTION_TYPE : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<typeof actionGroupSymbol, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol && data.type === ACTION_GROUP_TYPE : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n"],
+  "mappings": ";AAIA,SAASA,MAAMC,gBAAgB;AAC/B,YAAYC,cAAc;AAC1B,YAAYC,YAAY;AACxB,YAAYC,YAAY;AAExB,SAASC,OAAOC,eAAe;AAC/B,SAASC,YAAY;AACrB,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAA4BC,qBAAqB;;AAIjD,IAAMC,cAAcC,OAAO,OAAA;AASpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCH,YAAUO,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAMC,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAoM1B,IAAMC,QAAN,MAAMA;EACFC,gBAAgB,IAAIhB,MAAAA;EAKZiB;EACAC;EACAC;EAEAC;EACAC,YAAmBC,aAAK;EACxBC,eAAsBD,aAAK;EAC3BE,gBAAuBF,aAAK;EAC5BG,gBAAuBC,mBAAY;IAClD;MACEf;MACA,KAAKgB,eAAe;QAClBC,IAAIjB;QACJkB,MAAMjB;QACNkB,MAAM;QACNC,YAAY,CAAC;MACf,CAAA;;GAEH;;EAGQC,QAAQrC,KAAKsC,OAAmD,CAACL,OAAAA;AACxE,UAAMM,UAAiBC,eAAeC,WAAI,KAAKX,eAAeG,EAAAA,CAAAA;AAC9D,WAAOjC,KAAK0C,KAA0BH,OAAAA,EAASI,KAAK3C,KAAK4C,WAAW5C,KAAK6C,UAAU,cAAcZ,EAAAA,EAAI,CAAA;EACvG,CAAA;EAEiBa,eAAe9C,KAAKsC,OAAgC,CAACL,OAAAA;AACpE,WAAOjC,KAAK0C,KAAK,CAACD,SAAAA;AAChB,YAAM3B,OAAO2B,KAAI,KAAKJ,MAAMJ,EAAAA,CAAAA;AAC5BzB,gBAAiBuC,cAAOjC,IAAAA,GAAO,uBAAuBmB,EAAAA,IAAI;;;;;;;;;AAC1D,aAAOnB,KAAKkC;IACd,CAAA;EACF,CAAA;EAEiBC,SAASjD,KAAKsC,OAAqC,CAACL,OAAAA;AACnE,UAAMM,UAAiBE,WAAI,KAAKZ,eAAeI,EAAAA,EAAIU,KAAYO,iBAAU,OAAO;MAAEC,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,EAAA,CAAA;AAC5G,WAAOpD,KAAK0C,KAAYH,OAAAA,EAASI,KAAK3C,KAAK4C,WAAW5C,KAAK6C,UAAU,eAAeZ,EAAAA,EAAI,CAAA;EAC1F,CAAA;;;EAIiBoB,eAAerD,KAAKsC,OAAkC,CAACgB,QAAAA;AACtE,WAAOtD,KAAK0C,KAAK,CAACD,SAAAA;AAChB,YAAM,CAACR,IAAIsB,QAAAA,IAAYD,IAAIE,MAAM,GAAA;AACjC,YAAMC,QAAQhB,KAAI,KAAKQ,OAAOhB,EAAAA,CAAAA;AAC9B,aAAOwB,MAAMF,QAAAA,EACVG,IAAI,CAACzB,QAAOQ,KAAI,KAAKJ,MAAMJ,GAAAA,CAAAA,CAAAA,EAC3B0B,OAAcZ,aAAM,EACpBW,IAAI,CAACE,MAAMA,EAAEZ,KAAK;IACvB,CAAA,EAAGL,KAAK3C,KAAK6C,UAAU,qBAAqBS,GAAAA,EAAK,CAAA;EACnD,CAAA;EAEiBO,WAAW7D,KAAKsC,OAAoD,CAACL,OAAAA;AACpF,WAAOjC,KAAK0C,KAAK,CAACD,SAAAA;AAChB,aAAOA,KAAI,KAAKY,aAAa,GAAGpB,EAAAA,WAAa,CAAA,EAAG0B,OAC9C,CAAC7C,SAASA,KAAKoB,SAAShB,eAAeJ,KAAKoB,SAASf,iBAAAA;IAEzD,CAAA,EAAGwB,KAAK3C,KAAK6C,UAAU,iBAAiBZ,EAAAA,EAAI,CAAA;EAC9C,CAAA;EAEiB6B,QAAQ9D,KAAKsC,OAA+B,CAACL,OAAAA;AAC5D,WAAOjC,KAAK0C,KAAK,CAACD,SAAAA;AAChB,YAAMsB,SAAS,CAACjD,MAAYkD,OAAiB,CAAA,MAAE;AAC7C,cAAMC,QAAQxB,KAAI,KAAKyB,YAAYpD,KAAKmB,EAAE,CAAA;AAC1C,cAAMkC,MAA2B;UAC/BlC,IAAInB,KAAKmB;UACTC,MAAMpB,KAAKoB;QACb;AACA,YAAIpB,KAAKsB,WAAWgC,OAAO;AACzBD,cAAIC,QAAQtD,KAAKsB,WAAWgC;QAC9B;AACA,YAAIH,MAAMI,QAAQ;AAChBF,cAAIF,QAAQA,MACTP,IAAI,CAACY,MAAAA;AAEJ,kBAAMC,WAAW;iBAAIP;cAAMlD,KAAKmB;;AAChC,mBAAOsC,SAASC,SAASF,EAAErC,EAAE,IAAIwC,SAAYV,OAAOO,GAAGC,QAAAA;UACzD,CAAA,EACCZ,OAAOjD,aAAAA;QACZ;AACA,eAAOyD;MACT;AAEA,YAAMO,OAAOjC,KAAI,KAAKkC,YAAY1C,EAAAA,CAAAA;AAClC,aAAO8B,OAAOW,IAAAA;IAChB,CAAA,EAAG/B,KAAK3C,KAAK6C,UAAU,cAAcZ,EAAAA,EAAI,CAAA;EAC3C,CAAA;EAEA,YAAY,EAAE2C,UAAUX,OAAOR,OAAOoB,cAAcC,UAAUC,aAAY,IAAkB,CAAC,GAAG;AAC9F,SAAKtD,YAAYmD,YAAY3E,SAASyC,KAAI;AAC1C,SAAKnB,gBAAgBsD;AACrB,SAAKvD,YAAYwD;AACjB,SAAKtD,gBAAgBuD;AAErB,QAAId,OAAO;AACTA,YAAMe,QAAQ,CAAClE,SAAAA;AACbV,QAAO6E,WAAI,KAAKnD,eAAehB,KAAKmB,IAAI,KAAKD,eAAelB,IAAAA,CAAAA;MAC9D,CAAA;IACF;AAEA,QAAI2C,OAAO;AACTyB,aAAOC,QAAQ1B,KAAAA,EAAOuB,QAAQ,CAAC,CAACI,QAAQ3B,MAAAA,MAAM;AAC5CrD,QAAO6E,WAAI,KAAKpD,eAAeuD,QAAQ3B,MAAAA;MACzC,CAAA;IACF;EACF;EAEAM,OAAO9B,KAAKjB,SAAS;AACnB,WAAO,KAAKS,UAAUgB,IAAI,KAAKqB,MAAM7B,EAAAA,CAAAA;EACvC;EAEAoD,KAAKpD,KAAKjB,SAAS;AACjB,WAAO,KAAK8C,MAAM7B,EAAAA;EACpB;EAEAnB,KAAKmB,IAA4C;AAC/C,WAAO,KAAKI,MAAMJ,EAAAA;EACpB;EAEA0C,YAAY1C,IAA6B;AACvC,WAAO,KAAKa,aAAab,EAAAA;EAC3B;EAEAiC,YAAYjC,IAAYsB,WAAqB,YAA+B;AAC1E,WAAO,KAAKF,aAAa,GAAGpB,EAAAA,IAAMsB,QAAAA,EAAU;EAC9C;EAEA+B,QAAQrD,IAAY;AAClB,WAAO,KAAK4B,SAAS5B,EAAAA;EACvB;EAEAwB,MAAMxB,IAA8B;AAClC,WAAO,KAAKgB,OAAOhB,EAAAA;EACrB;EAEA,IAAIyC,OAAO;AACT,WAAO,KAAKa,eAAevE,OAAAA;EAC7B;EAEAwE,QAAQvD,IAAiC;AACvC,WAAO,KAAKR,UAAUgB,IAAI,KAAK3B,KAAKmB,EAAAA,CAAAA;EACtC;EAEAsD,eAAetD,IAAkB;AAC/B,WAAO,KAAKR,UAAUgB,IAAI,KAAKkC,YAAY1C,EAAAA,CAAAA;EAC7C;EAEAwD,eAAexD,IAAYsB,WAAqB,YAAoB;AAClE,WAAO,KAAK9B,UAAUgB,IAAI,KAAKyB,YAAYjC,IAAIsB,QAAAA,CAAAA;EACjD;EAEAmC,WAAWzD,IAAoB;AAC7B,WAAO,KAAKR,UAAUgB,IAAI,KAAK6C,QAAQrD,EAAAA,CAAAA;EACzC;EAEA0D,SAAS1D,IAAmB;AAC1B,WAAO,KAAKR,UAAUgB,IAAI,KAAKgB,MAAMxB,EAAAA,CAAAA;EACvC;EAEA,MAAM2D,WAAW3D,IAAY;AAC3B,UAAM4D,cAAqBpD,WAAI,KAAKb,cAAcK,EAAAA,EAAIU,KAAYO,iBAAU,MAAM,KAAA,CAAA;AAClFzC,QAAI,cAAc;MAAEwB;MAAI4D;IAAY,GAAA;;;;;;AACpC,QAAI,CAACA,aAAa;AAChB,YAAM,KAAKtE,gBAAgBU,EAAAA;AAC3B7B,MAAO6E,WAAI,KAAKrD,cAAcK,IAAI,IAAA;IACpC;EACF;EAEA6D,OAAO7D,IAAYsB,WAAqB,YAAkB;AACxD,UAAMD,MAAM,GAAGrB,EAAAA,IAAMsB,QAAAA;AACrB,UAAMwC,WAAkBtD,WAAI,KAAKf,WAAW4B,GAAAA,EAAKX,KAAYO,iBAAU,MAAM,KAAA,CAAA;AAC7EzC,QAAI,UAAU;MAAE6C;MAAKyC;IAAS,GAAA;;;;;;AAC9B,QAAI,CAACA,UAAU;AACb,WAAKzE,YAAYW,IAAIsB,QAAAA;AACrBnD,MAAO6E,WAAI,KAAKvD,WAAW4B,KAAK,IAAA;IAClC;EACF;EAEA0C,SAAS/B,OAAkD;AACzDjE,SAAKiG,MAAM,MAAA;AACThC,YAAMP,IAAI,CAAC5C,SAAS,KAAKoF,QAAQpF,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAoF,QAAQ,EAAEjC,OAAOR,OAAO,GAAG0C,QAAAA,GAAoD;AAC7E,UAAM,EAAElE,IAAIC,MAAMC,OAAO,MAAMC,aAAa,CAAC,EAAC,IAAK+D;AACnD,UAAMC,WAAW,KAAK/D,MAAMJ,EAAAA;AAC5B,UAAMnB,OAAO,KAAKW,UAAUgB,IAAI2D,QAAAA;AAChCjG,IAAOkG,aAAMvF,MAAM;MACjBwF,QAAQ,CAACxF,UAAAA;AACP,cAAMyF,cAAczF,MAAKoB,SAASA;AAClC,cAAMsE,cAAc1F,MAAKqB,SAASA;AAClC,cAAMsE,oBAAoBvB,OAAOwB,KAAKtE,UAAAA,EAAYuE,KAAK,CAACrD,QAAQxC,MAAKsB,WAAWkB,GAAAA,MAASlB,WAAWkB,GAAAA,CAAI;AACxG7C,YAAI,iBAAiB;UACnBwB;UACAsE;UACAC;UACAC;QACF,GAAA;;;;;;AACA,YAAIF,eAAeC,eAAeC,mBAAmB;AACnDhG,cAAI,iBAAiB;YAAEwB;YAAIC;YAAMC;YAAMC;UAAW,GAAA;;;;;;AAClD,gBAAMwE,UAAiBD,YAAK;YAC1B,GAAG7F;YACHoB;YACAC;YACAC,YAAY;cAAE,GAAGtB,MAAKsB;cAAY,GAAGA;YAAW;UAClD,CAAA;AACA,eAAKX,UAAUwD,IAAImB,UAAUQ,OAAAA;AAC7B,eAAKvF,cAAcwF,KAAK;YAAE5E;YAAInB,MAAM8F;UAAQ,CAAA;QAC9C;MACF;MACAE,QAAQ,MAAA;AACNrG,YAAI,YAAY;UAAEwB;UAAIC;UAAMC;UAAMC;QAAW,GAAA;;;;;;AAC7C,cAAMwE,UAAU,KAAK5E,eAAe;UAAEC;UAAIC;UAAMC;UAAMC;QAAW,CAAA;AACjE,aAAKX,UAAUwD,IAAImB,UAAUQ,OAAAA;AAC7B,aAAKvF,cAAcwF,KAAK;UAAE5E;UAAInB,MAAM8F;QAAQ,CAAA;MAC9C;IACF,CAAA;AAEA,QAAI3C,OAAO;AAET,WAAK+B,SAAS/B,KAAAA;AACd,YAAMhB,SAASgB,MAAMP,IAAI,CAAC5C,WAAU;QAAEsE,QAAQnD;QAAI8E,QAAQjG,MAAKmB;MAAG,EAAA;AAClE,WAAK+E,SAAS/D,MAAAA;IAEhB;AAEA,QAAIQ,OAAO;AACTlD,WAAAA;IACF;EACF;EAEA0G,YAAYC,KAAezD,QAAQ,OAAa;AAC9CzD,SAAKiG,MAAM,MAAA;AACTiB,UAAIxD,IAAI,CAACzB,OAAO,KAAKkF,WAAWlF,IAAIwB,KAAAA,CAAAA;IACtC,CAAA;EACF;EAEA0D,WAAWlF,IAAYwB,QAAQ,OAAa;AAC1C,UAAM2C,WAAW,KAAK/D,MAAMJ,EAAAA;AAE5B,SAAKR,UAAUwD,IAAImB,UAAiBgB,YAAI,CAAA;AACxC,SAAK/F,cAAcwF,KAAK;MAAE5E;MAAInB,MAAasG,YAAI;IAAG,CAAA;AAGlD,QAAI3D,OAAO;AACT,YAAM,EAAEN,SAASC,SAAQ,IAAK,KAAK3B,UAAUgB,IAAI,KAAKQ,OAAOhB,EAAAA,CAAAA;AAC7D,YAAMwB,SAAQ;WACTN,QAAQO,IAAI,CAAC0B,YAAY;UAAEA;UAAQ2B,QAAQ9E;QAAG,EAAA;WAC9CmB,SAASM,IAAI,CAACqD,YAAY;UAAE3B,QAAQnD;UAAI8E;QAAO,EAAA;;AAEpD,WAAKM,YAAY5D,MAAAA;IACnB;AAEA,SAAKjC,gBAAgBS,EAAAA;EACvB;EAEA+E,SAASvD,OAAqB;AAC5BzD,SAAKiG,MAAM,MAAA;AACTxC,YAAMC,IAAI,CAAC4D,SAAS,KAAKC,QAAQD,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAC,QAAQC,SAAqB;AAC3B,UAAMC,aAAa,KAAKxE,OAAOuE,QAAQpC,MAAM;AAC7C,UAAMA,SAAS,KAAK3D,UAAUgB,IAAIgF,UAAAA;AAClC,QAAI,CAACrC,OAAOhC,SAASoB,SAASgD,QAAQT,MAAM,GAAG;AAC7CtG,UAAI,qBAAqB;QACvB2E,QAAQoC,QAAQpC;QAChB2B,QAAQS,QAAQT;MAClB,GAAA;;;;;;AACA,WAAKtF,UAAUwD,IAAIwC,YAAY;QAC7BtE,SAASiC,OAAOjC;QAChBC,UAAU;aAAIgC,OAAOhC;UAAUoE,QAAQT;;MACzC,CAAA;IACF;AAEA,UAAMW,aAAa,KAAKzE,OAAOuE,QAAQT,MAAM;AAC7C,UAAMA,SAAS,KAAKtF,UAAUgB,IAAIiF,UAAAA;AAClC,QAAI,CAACX,OAAO5D,QAAQqB,SAASgD,QAAQpC,MAAM,GAAG;AAC5C3E,UAAI,oBAAoB;QACtB2E,QAAQoC,QAAQpC;QAChB2B,QAAQS,QAAQT;MAClB,GAAA;;;;;;AACA,WAAKtF,UAAUwD,IAAIyC,YAAY;QAC7BvE,SAAS;aAAI4D,OAAO5D;UAASqE,QAAQpC;;QACrChC,UAAU2D,OAAO3D;MACnB,CAAA;IACF;EACF;EAEAiE,YAAY5D,OAAekE,gBAAgB,OAAa;AACtD3H,SAAKiG,MAAM,MAAA;AACTxC,YAAMC,IAAI,CAAC4D,SAAS,KAAKM,WAAWN,MAAMK,aAAAA,CAAAA;IAC5C,CAAA;EACF;EAEAC,WAAWJ,SAAeG,gBAAgB,OAAa;AACrD,UAAMF,aAAa,KAAKxE,OAAOuE,QAAQpC,MAAM;AAC7C,UAAMA,SAAS,KAAK3D,UAAUgB,IAAIgF,UAAAA;AAClC,QAAIrC,OAAOhC,SAASoB,SAASgD,QAAQT,MAAM,GAAG;AAC5C,WAAKtF,UAAUwD,IAAIwC,YAAY;QAC7BtE,SAASiC,OAAOjC;QAChBC,UAAUgC,OAAOhC,SAASO,OAAO,CAAC1B,OAAOA,OAAOuF,QAAQT,MAAM;MAChE,CAAA;IACF;AAEA,UAAMW,aAAa,KAAKzE,OAAOuE,QAAQT,MAAM;AAC7C,UAAMA,SAAS,KAAKtF,UAAUgB,IAAIiF,UAAAA;AAClC,QAAIX,OAAO5D,QAAQqB,SAASgD,QAAQpC,MAAM,GAAG;AAC3C,WAAK3D,UAAUwD,IAAIyC,YAAY;QAC7BvE,SAAS4D,OAAO5D,QAAQQ,OAAO,CAAC1B,OAAOA,OAAOuF,QAAQpC,MAAM;QAC5DhC,UAAU2D,OAAO3D;MACnB,CAAA;IACF;AAEA,QAAIuE,eAAe;AACjB,YAAMvC,UAAS,KAAK3D,UAAUgB,IAAIgF,UAAAA;AAClC,YAAMV,UAAS,KAAKtF,UAAUgB,IAAIiF,UAAAA;AAClC,UAAItC,QAAOhC,SAASiB,WAAW,KAAKe,QAAOjC,QAAQkB,WAAW,KAAKmD,QAAQpC,WAAWpE,SAAS;AAC7F,aAAKiG,YAAY;UAACO,QAAQpC;SAAO;MACnC;AACA,UAAI2B,QAAO3D,SAASiB,WAAW,KAAK0C,QAAO5D,QAAQkB,WAAW,KAAKmD,QAAQT,WAAW/F,SAAS;AAC7F,aAAKiG,YAAY;UAACO,QAAQT;SAAO;MACnC;IACF;EACF;EAEAc,UAAU5F,IAAYsB,UAAoBuE,OAAuB;AAC/D,UAAMC,YAAY,KAAK9E,OAAOhB,EAAAA;AAC9B,UAAMwB,QAAQ,KAAKhC,UAAUgB,IAAIsF,SAAAA;AACjC,UAAMC,WAAWvE,MAAMF,QAAAA,EAAUI,OAAO,CAAC1B,QAAO,CAAC6F,MAAMtD,SAASvC,GAAAA,CAAAA,KAAQ,CAAA;AACxE,UAAMgG,SAASH,MAAMnE,OAAO,CAAC1B,QAAOwB,MAAMF,QAAAA,EAAUiB,SAASvC,GAAAA,CAAAA,KAAQ,CAAA;AACrEwB,UAAMF,QAAAA,EAAU2E,OAAO,GAAGzE,MAAMF,QAAAA,EAAUc,QAAM,GAAK;SAAI4D;SAAWD;KAAS;AAC7E,SAAKvG,UAAUwD,IAAI8C,WAAWtE,KAAAA;EAChC;EAEA0E,SAAS,EAAEC,SAAShD,SAASpE,SAASuC,WAAW,WAAU,GAA2B8E,OAAiB,CAAA,GAAU;AAE/G,QAAIA,KAAK7D,SAASY,MAAAA,GAAS;AACzB;IACF;AAEA,UAAMtE,OAAO,KAAKyE,eAAeH,MAAAA;AACjC,UAAMkD,iBAAiBF,QAAQtH,MAAM;SAAIuH;MAAMjD;KAAO;AACtD,QAAIkD,mBAAmB,OAAO;AAC5B;IACF;AAEApD,WAAOqD,OAAO,KAAK9C,eAAeL,QAAQ7B,QAAAA,CAAAA,EAAWyB,QAAQ,CAACwD,UAC5D,KAAKL,SAAS;MAAE/C,QAAQoD,MAAMvG;MAAIsB;MAAU6E;IAAQ,GAAG;SAAIC;MAAMjD;KAAO,CAAA;EAE5E;EAEAqD,QAAQ,EAAErD,SAAS,QAAQ2B,OAAM,GAAkE;AACjG,WAAgBpE,cACd,KAAK6C,QAAQJ,MAAAA,GACNsD,eAAQ,CAAC5H,SAAAA;AACd,UAAI6H,QAAwCvB,YAAI;AAChD,WAAKe,SAAS;QACZ/C,QAAQtE,KAAKmB;QACbmG,SAAS,CAACtH,OAAMuH,SAAAA;AACd,cAAWtF,cAAO4F,KAAAA,GAAQ;AACxB,mBAAO;UACT;AAEA,cAAI7H,MAAKmB,OAAO8E,QAAQ;AACtB4B,oBAAehC,YAAK0B,IAAAA;UACtB;QACF;MACF,CAAA;AAEA,aAAOM;IACT,CAAA,CAAA;EAEJ;EAEA,MAAMC,YACJC,QACA,EAAEC,UAAU,KAAOC,WAAW,IAAG,IAA8C,CAAC,GAC7D;AACnB,UAAMV,OAAO,KAAKI,QAAQI,MAAAA;AAC1B,QAAW9F,cAAOsF,IAAAA,GAAO;AACvB,aAAOA,KAAKrF;IACd;AAEA,UAAMgG,UAAU,IAAI1I,QAAAA;AACpB,UAAM2I,IAAIC,YAAY,MAAA;AACpB,YAAMb,QAAO,KAAKI,QAAQI,MAAAA;AAC1B,UAAW9F,cAAOsF,KAAAA,GAAO;AACvBW,gBAAQG,KAAKd,MAAKrF,KAAK;MACzB;IACF,GAAG+F,QAAAA;AAEH,WAAOC,QAAQI,KAAK;MAAEN;IAAQ,CAAA,EAAGO,QAAQ,MAAMC,cAAcL,CAAAA,CAAAA;EAC/D;;EAGAjH,eAAelB,MAAyC;AACtD,WAAc6F,YAAK;MACjB,CAAChG,WAAAA,GAAc;MACfwB,MAAM;MACNC,YAAY,CAAC;MACb,GAAGtB;IACL,CAAA;EACF;AACF;;;AC/nBA,SAASyI,QAAAA,OAAMC,YAAAA,iBAAgB;AAC/B,SAASC,cAAc;AACvB,YAAYC,WAAW;AACvB,YAAYC,eAAc;AAC1B,YAAYC,aAAY;AACxB,YAAYC,aAAY;AAGxB,SAASC,OAAAA,YAAW;AACpB,SAA2CC,YAAYC,cAAcC,QAAQC,iBAAAA,sBAAqB;;;ACuC3F,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,cAAcA,KAAKG,SAASC,cAAc;AAE9E,IAAMC,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACP,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASK,qBAAqBL,KAAKG,SAASK,oBAAoB;AAIpF,IAAMC,eAAe,CAACT,SAAgDE,SAASF,IAAAA,KAASO,cAAcP,IAAAA;;;;ADnCtG,IAAMU,kBAAkB,CAACC,cAAAA;AAC9B,QAAM,EACJC,IACAC,WAAW,UACXC,WAAW,YACXC,UAAUC,WACVC,WAAWC,YACXC,SAASC,UACTC,cAAcC,cAAa,IACzBX;AACJ,QAAMY,QAAQ,CAACC,QAAgB,GAAGZ,EAAAA,IAAMY,GAAAA;AAExC,QAAMT,WACJC,aAAaS,MAAKC,OAAO,CAACd,QAAeI,UAAUJ,GAAAA,EAAIe,KAAKF,MAAKG,UAAU,2BAA2BhB,GAAAA,EAAI,CAAA,CAAA;AAE5G,QAAMK,YACJC,cACAO,MAAKC,OAAO,CAACG,SACXX,WAAWW,IAAAA,EAAMF,KAAKF,MAAKG,UAAU,4BAA4BhB,EAAAA,EAAI,CAAA,CAAA;AAGzE,QAAMS,eACJC,iBACAG,MAAKC,OAAO,CAACG,SACXP,cAAcO,IAAAA,EAAMF,KAAKF,MAAKG,UAAU,+BAA+BhB,EAAAA,EAAI,CAAA,CAAA;AAG/E,QAAMO,UACJC,YACAK,MAAKC,OAAO,CAACG,SACXT,SAASS,IAAAA,EAAMF,KAAKF,MAAKG,UAAU,0BAA0BhB,EAAAA,EAAI,CAAA,CAAA;AAGrE,SAAO;IACLG,WAAW;MAAEH,IAAIW,MAAM,UAAA;MAAaV;MAAUE;IAAS,IAAIe;IAC3Db,YACK;MACCL,IAAIW,MAAM,WAAA;MACVV;MACAC;MACAG,WAAWQ,MAAKC,OAAO,CAACG,SACtBJ,MAAKM,KAAK,CAACC,SAAAA;AACT,YAAI;AACF,iBAAOA,KAAIf,UAAUY,IAAAA,CAAAA;QACvB,QAAQ;AACNI,UAAAA,KAAIC,KAAK,sBAAsB;YAAEtB,IAAIW,MAAM,WAAA;YAAcM;UAAK,GAAA;;;;;;AAC9D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,MAAKG,UAAU,2BAA2BhB,EAAAA,EAAI,CAAA,CAAA;IAE1D,IACAkB;IACJT,eACK;MACCT,IAAIW,MAAM,cAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,MAAKC,OAAO,CAACG,SACtBJ,MAAKM,KAAK,CAACC,SAAAA;AACT,YAAI;AACF,iBAAOA,KAAIX,aAAaQ,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAC3C,GAAGA;YACHC,MAAMC;YACNC,MAAMC;UACR,EAAA;QACF,QAAQ;AACNP,UAAAA,KAAIC,KAAK,yBAAyB;YAAEtB,IAAIW,MAAM,cAAA;YAAiBM;UAAK,GAAA;;;;;;AACpE,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,MAAKG,UAAU,wCAAwChB,EAAAA,EAAI,CAAA,CAAA;IAEvE,IACAkB;IACJX,UACK;MACCP,IAAIW,MAAM,SAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,MAAKC,OAAO,CAACG,SACtBJ,MAAKM,KAAK,CAACC,SAAAA;AACT,YAAI;AACF,iBAAOA,KAAIb,QAAQU,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAAE,GAAGA;YAAKG,MAAME;UAAY,EAAA;QACtE,QAAQ;AACNR,UAAAA,KAAIC,KAAK,oBAAoB;YAAEtB,IAAIW,MAAM,SAAA;YAAYM;UAAK,GAAA;;;;;;AAC1D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,MAAKG,UAAU,mCAAmChB,EAAAA,EAAI,CAAA,CAAA;IAElE,IACAkB;IACJY,OAAOC,cAAAA;AACX;AAmBO,IAAMC,oBAAoB,CAACjC,WAA8BkC,MAA0B,CAAA,MAAE;AAC1F,MAAUC,cAAQnC,SAAAA,GAAY;AAC5B,WAAO;SAAIkC;SAAQlC,UAAUoC,QAAQ,CAACC,QAAQJ,kBAAkBI,KAAKH,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAKlC;;EAClB;AACF;AAQO,IAAMsC,eAAN,MAAMA,cAAAA;;EAEMC,iBAAiB,oBAAIC,IAAAA;EACrBC,cAAc3B,MAAKM,KAAYsB,cAAK,CAAA,EAA8B1B,KACjFF,MAAK6B,WACL7B,MAAKG,UAAU,0BAAA,CAAA;EAEA2B,eAAwC,CAAC;EACzCC;EACAC;EAEjB,YAAY,EAAEC,UAAU,GAAGC,OAAAA,IAA8D,CAAC,GAAG;AAC3F,SAAKH,YAAYE,YAAYE,UAAS7B,KAAI;AAC1C,SAAK0B,SAAS,IAAII,MAAM;MACtB,GAAGF;MACHD,UAAU,KAAKF;MACfM,UAAU,CAAClD,IAAIE,aAAa,KAAKiD,UAAUnD,IAAIE,QAAAA;MAC/CkD,cAAc,CAACpD,OAAO,KAAKqD,cAAcrD,EAAAA;MACzCsD,cAAc,CAACtD,OAAO,KAAKuD,cAAcvD,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOwD,KAAKC,QAAiBX,UAA4C;AACvE,QAAI,CAACW,QAAQ;AACX,aAAO,IAAIpB,cAAa;QAAES;MAAS,CAAA;IACrC;AAEA,UAAM,EAAEY,OAAOC,MAAK,IAAKC,KAAKC,MAAMJ,MAAAA;AACpC,WAAO,IAAIpB,cAAa;MAAEqB;MAAOC;MAAOb;IAAS,CAAA;EACnD;EAEA,IAAIgB,QAAyB;AAC3B,WAAO,KAAKjB;EACd;EAEA,IAAIkB,aAAa;AACf,WAAO,KAAKvB;EACd;EAEAwB,aAAaD,YAA6C;AACxD/B,sBAAkB+B,UAAAA,EAAYE,QAAQ,CAAClE,cAAAA;AACrC,YAAMgE,cAAa,KAAKnB,UAAUxB,IAAI,KAAKoB,WAAW;AACtD,WAAKI,UAAUsB,IAAI,KAAK1B,aAAoB0B,YAAIH,aAAYhE,UAAUC,IAAID,SAAAA,CAAAA;IAC5E,CAAA;AACA,WAAO;EACT;EAEAoE,gBAAgBnE,IAA0B;AACxC,UAAM+D,aAAa,KAAKnB,UAAUxB,IAAI,KAAKoB,WAAW;AACtD,SAAKI,UAAUsB,IAAI,KAAK1B,aAAoB4B,eAAOL,YAAY/D,EAAAA,CAAAA;AAC/D,WAAO;EACT;EAEA,MAAMqE,QAIJ,EAAEvB,WAAWE,UAAS7B,KAAI,GAAImD,SAASC,SAASrE,WAAW,YAAYsE,QAAO,GAC9EC,OAAiB,CAAA,GACF;AAEf,QAAIA,KAAKC,SAASJ,MAAAA,GAAS;AACzB;IACF;AAIA,QAAI,CAACK,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AAEA,UAAM3D,OAAO6B,SAAS1B,IAAI,KAAKyB,OAAOgC,YAAYP,MAAAA,CAAAA;AAClD,UAAMQ,iBAAiB,MAAMN,QAAQvD,MAAM;SAAIwD;MAAMxD,KAAKjB;KAAG;AAC7D,QAAI8E,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMpB,QAAQqB,OAAOC,OAAO,KAAKpC,UAAUxB,IAAI,KAAKoB,WAAW,CAAA,EAC5DV,OAAO,CAAC/B,cAAcG,cAAcH,UAAUG,YAAY,WAAS,EACnEqB,IAAI,CAACxB,cAAcA,UAAUM,SAAS,EACtCyB,OAAOC,cAAAA,EACPI,QAAQ,CAAC9B,cAAcyC,SAAS1B,IAAIf,UAAU,KAAKwC,OAAO5B,KAAKqD,MAAAA,CAAAA,CAAAA,CAAAA;AAElE,UAAMW,QAAQC,IACZxB,MAAMnC,IAAI,CAAC4D,YAAAA;AACTrC,eAASoB,IAAI,KAAKrB,OAAOuC,MAAMD,QAAQnF,EAAE,GAAG,KAAK6C,OAAOwC,eAAeF,OAAAA,CAAAA;AACvE,aAAO,KAAKd,QAAQ;QAAEvB;QAAUwB,QAAQa,QAAQnF;QAAIE;QAAUsE;MAAQ,GAAG;WAAIC;QAAMxD,KAAKjB;OAAG;IAC7F,CAAA,CAAA;AAGF,QAAI8C,aAAa,KAAKF,WAAW;AAC/BE,eAASwC,MAAK;AACdxC,eAASyC,QAAO;IAClB;EACF;EAEAC,UAAgB;AACd,SAAKlD,eAAe2B,QAAQ,CAACwB,gBAAgBA,YAAAA,CAAAA;AAC7C,SAAKnD,eAAeoD,MAAK;EAC3B;EAEiBC,aAAa9E,MAAKC,OAAuD,CAACd,OAAAA;AACzF,WAAOa,MAAKM,KAAK,CAACC,SAAAA;AAChB,aAAgBL,eACdK,KAAI,KAAKoB,WAAW,GACbwC,gBACDY,aAAOC,UAAAA,GACPtE,UAAI,CAAC,EAAEpB,SAAQ,MAAOA,QAAAA,GACtB2B,aAAOC,cAAAA,GACPR,UAAI,CAACpB,aAAaiB,KAAIjB,SAASH,EAAAA,CAAAA,CAAAA,GAC/B8B,aAAOC,cAAAA,GACP+D,UAAI;IAEd,CAAA;EACF,CAAA;EAEiBC,cAAclF,MAAKC,OAA0C,CAACF,QAAAA;AAC7E,WAAOC,MAAKM,KAAK,CAACC,SAAAA;AAChB,YAAM,CAACpB,IAAIE,QAAAA,IAAYU,IAAIoF,MAAM,GAAA;AACjC,YAAM/E,OAAO,KAAK4B,OAAO5B,KAAKjB,EAAAA;AAE9B,aAAgBe;QACdK,KAAI,KAAKoB,WAAW;QACbwC;;QAEDY,aAAOC,UAAAA;QACP/D,aAAO,CAAC,EAAE5B,UAAU+F,YAAY,WAAU,MAAOA,cAAc/F,QAAAA;QAC/DqB,UAAI,CAAC,EAAElB,UAAS,MAAOA,YAAYY,IAAAA,CAAAA;QACnCa,aAAOC,cAAAA;QACPI,cAAQ,CAAC+D,WAAW9E,KAAI8E,MAAAA,CAAAA;MAAAA;IAElC,CAAA,EAAGnF,KAAKF,MAAKG,UAAU,4BAA4BJ,GAAAA,EAAK,CAAA;EAC1D,CAAA;EAEQuC,UAAUnD,IAAYE,UAA0B;AACtDmB,IAAAA,KAAI,YAAY;MAAErB;MAAIE;MAAU4C,UAAUqD,aAAa,KAAKvD,SAAS;IAAE,GAAA;;;;;;AACvE,UAAMwD,aAAa,KAAKL,YAAY,GAAG/F,EAAAA,IAAME,QAAAA,EAAU;AAEvD,QAAImG,WAAqB,CAAA;AACzB,UAAMC,SAAS,KAAK1D,UAAU2D,UAC5BH,YACA,CAAC1C,UAAAA;AACC,YAAM8C,MAAM9C,MAAMnC,IAAI,CAACkF,MAAMA,EAAEzG,EAAE;AACjC,YAAM0G,UAAUL,SAASvE,OAAO,CAAC9B,QAAO,CAACwG,IAAI9B,SAAS1E,GAAAA,CAAAA;AACtDqG,iBAAWG;AAEXnF,MAAAA,KAAI,UAAU;QAAErB;QAAIE;QAAUsG;QAAKE;MAAQ,GAAA;;;;;;AAC3C,YAAMC,SAAS,MAAA;AACb9F,QAAAA,MAAK+F,MAAM,MAAA;AACT,eAAK/D,OAAOgE,YACVH,QAAQnF,IAAI,CAACuF,YAAY;YAAExC,QAAQtE;YAAI8G;UAAO,EAAA,GAC9C,IAAA;AAEF,eAAKjE,OAAOkE,SAASrD,KAAAA;AACrB,eAAKb,OAAOmE,SACVtD,MAAMnC,IAAI,CAACN,SACTf,aAAa,aAAa;YAAEoE,QAAQtE;YAAI8G,QAAQ7F,KAAKjB;UAAG,IAAI;YAAEsE,QAAQrD,KAAKjB;YAAI8G,QAAQ9G;UAAG,CAAA,CAAA;AAG9F,eAAK6C,OAAOoE,UACVjH,IACAE,UACAwD,MAAMnC,IAAI,CAAC,EAAEvB,IAAAA,IAAE,MAAOA,GAAAA,CAAAA;QAE1B,CAAA;MACF;AAIA,UAAI,OAAOkH,0BAA0B,YAAY;AAC/CA,8BAAsBP,MAAAA;MACxB,OAAO;AACLA,eAAAA;MACF;IACF,GACA;MAAEQ,WAAW;IAAK,CAAA;AAGpB,SAAK7E,eAAe4B,IAAIlE,IAAIsG,MAAAA;EAC9B;;EAGA,MAAcjD,cAAcrD,IAAY;AACtCqB,IAAAA,KAAI,gBAAgB;MAAErB;IAAG,GAAA;;;;;;AACzB,UAAMG,WAAW,KAAKwF,WAAW3F,EAAAA;AAEjC,UAAMsG,SAAS,KAAK1D,UAAU2D,UAC5BpG,UACA,CAACc,SAAAA;AACC,YAAMmG,UAAU,KAAKzE,aAAa3C,EAAAA;AAClCqH,MAAOC,cAAMrG,MAAM;QACjBsG,QAAQ,CAACtG,UAAAA;AACP,eAAK4B,OAAOkE,SAAS;YAAC9F;WAAK;AAC3BmG,mBAASI,KAAAA;QACX;QACAC,QAAQ,MAAA;AACNL,mBAASI,KAAAA;AACT,eAAK3E,OAAO6E,YAAY;YAAC1H;WAAG;QAC9B;MACF,CAAA;IACF,GACA;MAAEmH,WAAW;IAAK,CAAA;AAGpB,SAAK7E,eAAe4B,IAAIlE,IAAIsG,MAAAA;EAC9B;EAEQ/C,cAAcvD,IAAkB;AACtC,SAAKsC,eAAelB,IAAIpB,EAAAA,IAAAA;AACxB,SAAKsC,eAAeqF,OAAO3H,EAAAA;EAC7B;AACF;AAMO,IAAM4H,iBAAiB,CAAIC,OAAAA;AAChC,SAAOhH,MAAKM,KAAK,CAACC,SAAAA;AAChB,UAAMmE,UAAUuC,OAAO,MAAA;AACrB1G,MAAAA,KAAI2G,QAAQF,GAAAA,CAAAA;IACd,CAAA;AAEAzG,IAAAA,KAAI4G,aAAa,MAAMzC,QAAAA,CAAAA;AAEvB,WAAOsC,GAAAA;EACT,CAAA;AACF;AAEA,IAAMI,mBAAmBpH,MAAKC,OAAO,CAACoH,eAAAA;AACpC,SAAOrH,MAAKM,KAAK,CAACC,SAAAA;AAChB,UAAM+G,eAAeD,WAAW3B,UAAU,CAAC6B,UAAUhH,KAAI2G,QAAQK,KAAAA,CAAAA;AAEjEhH,IAAAA,KAAI4G,aAAa,MAAMG,aAAa1C,YAAW,CAAA;AAE/C,WAAOyC,WAAW9G,IAAG;EACvB,CAAA;AACF,CAAA;AAMO,IAAMiH,qBAAqB,CAAIH,eAAAA;AACpC,SAAOD,iBAAiBC,UAAAA;AAC1B;",
+  "names": ["Atom", "Registry", "Function", "Option", "Record", "Event", "Trigger", "todo", "invariant", "log", "isNonNullable", "graphSymbol", "Symbol", "getGraph", "node", "graph", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "onNodeChanged", "_onExpand", "_onInitialize", "_onRemoveNode", "_registry", "_expanded", "empty", "_initialized", "_initialEdges", "_initialNodes", "fromEntries", "_constructNode", "id", "type", "data", "properties", "_node", "family", "initial", "flatten", "get", "make", "pipe", "keepAlive", "withLabel", "_nodeOrThrow", "isSome", "value", "_edges", "getOrElse", "inbound", "outbound", "_connections", "key", "relation", "split", "edges", "map", "filter", "o", "_actions", "_json", "toJSON", "seen", "nodes", "connections", "obj", "label", "length", "n", "nextSeen", "includes", "undefined", "root", "nodeOrThrow", "registry", "onInitialize", "onExpand", "onRemoveNode", "forEach", "set", "Object", "entries", "source", "json", "actions", "getNodeOrThrow", "getNode", "getConnections", "getActions", "getEdges", "initialize", "initialized", "expand", "expanded", "addNodes", "batch", "addNode", "nodeArg", "nodeAtom", "match", "onSome", "typeChanged", "dataChanged", "propertiesChanged", "keys", "some", "newNode", "emit", "onNone", "target", "addEdges", "removeNodes", "ids", "removeNode", "none", "removeEdges", "edge", "addEdge", "edgeArg", "sourceAtom", "targetAtom", "removeOrphans", "removeEdge", "sortEdges", "order", "edgesAtom", "unsorted", "sorted", "splice", "traverse", "visitor", "path", "shouldContinue", "values", "child", "getPath", "flatMap", "found", "waitForPath", "params", "timeout", "interval", "trigger", "i", "setInterval", "wake", "wait", "finally", "clearInterval", "Atom", "Registry", "effect", "Array", "Function", "Option", "Record", "log", "byPosition", "getDebugName", "isNode", "isNonNullable", "isGraphNode", "data", "properties", "isAction", "type", "ACTION_TYPE", "actionGroupSymbol", "Symbol", "isActionGroup", "ACTION_GROUP_TYPE", "isActionLike", "createExtension", "extension", "id", "position", "relation", "resolver", "_resolver", "connector", "_connector", "actions", "_actions", "actionGroups", "_actionGroups", "getId", "key", "Atom", "family", "pipe", "withLabel", "node", "undefined", "make", "get", "log", "warn", "map", "arg", "data", "actionGroupSymbol", "type", "ACTION_GROUP_TYPE", "ACTION_TYPE", "filter", "isNonNullable", "flattenExtensions", "acc", "isArray", "flatMap", "ext", "GraphBuilder", "_subscriptions", "Map", "_extensions", "empty", "keepAlive", "_initialized", "_registry", "_graph", "registry", "params", "Registry", "Graph", "onExpand", "_onExpand", "onInitialize", "_onInitialize", "onRemoveNode", "_onRemoveNode", "from", "pickle", "nodes", "edges", "JSON", "parse", "graph", "extensions", "addExtension", "forEach", "set", "removeExtension", "remove", "explore", "source", "ROOT_ID", "visitor", "path", "includes", "isNode", "yieldOrContinue", "nodeOrThrow", "shouldContinue", "Object", "values", "Promise", "all", "nodeArg", "_node", "_constructNode", "reset", "dispose", "destroy", "unsubscribe", "clear", "_resolvers", "sortBy", "byPosition", "head", "_connectors", "split", "_relation", "result", "getDebugName", "connectors", "previous", "cancel", "subscribe", "ids", "n", "removed", "update", "batch", "removeEdges", "target", "addNodes", "addEdges", "sortEdges", "requestAnimationFrame", "immediate", "trigger", "Option", "match", "onSome", "wake", "onNone", "removeNodes", "delete", "atomFromSignal", "cb", "effect", "setSelf", "addFinalizer", "observableFamily", "observable", "subscription", "value", "atomFromObservable"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"src/graph.ts":{"bytes":61106,"imports":[{"path":"@effect-rx/rx-react","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/debug","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}],"format":"esm"},"src/node.ts":{"bytes":6276,"imports":[{"path":"src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"src/graph-builder.ts":{"bytes":47154,"imports":[{"path":"@effect-rx/rx-react","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"src/index.ts":{"bytes":623,"imports":[{"path":"src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":59848},"dist/lib/browser/index.mjs":{"imports":[{"path":"@effect-rx/rx-react","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/debug","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":"@effect-rx/rx-react","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"effect","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","createExtension","flattenExtensions","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","rxFromObservable","rxFromSignal"],"entryPoint":"src/index.ts","inputs":{"src/graph.ts":{"bytesInOutput":13896},"src/index.ts":{"bytesInOutput":0},"src/graph-builder.ts":{"bytesInOutput":10517},"src/node.ts":{"bytesInOutput":541}},"bytes":25336}}}
+{"inputs":{"src/graph.ts":{"bytes":60947,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"effect/Function","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"effect/Record","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/debug","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}],"format":"esm"},"src/node.ts":{"bytes":6276,"imports":[{"path":"src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"src/graph-builder.ts":{"bytes":47256,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"effect/Array","kind":"import-statement","external":true},{"path":"effect/Function","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"effect/Record","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"src/index.ts":{"bytes":623,"imports":[{"path":"src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":60070},"dist/lib/browser/index.mjs":{"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"effect/Function","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"effect/Record","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/debug","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":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"effect/Array","kind":"import-statement","external":true},{"path":"effect/Function","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"effect/Record","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","atomFromObservable","atomFromSignal","createExtension","flattenExtensions","getGraph","isAction","isActionGroup","isActionLike","isGraphNode"],"entryPoint":"src/index.ts","inputs":{"src/graph.ts":{"bytesInOutput":13471},"src/index.ts":{"bytesInOutput":0},"src/graph-builder.ts":{"bytesInOutput":10242},"src/node.ts":{"bytesInOutput":541}},"bytes":24640}}}