@dxos/app-graph 0.8.2-main.fbd8ed0 → 0.8.2-staging.7ac8446

package/dist/lib/node/index.cjs.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, pipe, Record } 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 { isNonNullable, type MakeOptional } from '@dxos/util';\n\nimport { type NodeArg, type Node, type Relation, type Action, type ActionGroup } 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  // TODO(wittjosiah): On initialize to restore state from cache.\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, onExpand, onRemoveNode }: GraphParams = {}) {\n    this._registry = registry ?? Registry.make();\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  // TODO(wittjosiah): On initialize to restore state from cache.\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') {\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>>[]) {\n    Rx.batch(() => {\n      nodes.map((node) => this.addNode(node));\n    });\n  }\n\n  addNode({ nodes, edges, ...nodeArg }: NodeArg<any, Record<string, any>>) {\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', { 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) {\n    Rx.batch(() => {\n      ids.map((id) => this.removeNode(id, edges));\n    });\n  }\n\n  removeNode(id: string, edges = false) {\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[]) {\n    Rx.batch(() => {\n      edges.map((edge) => this.addEdge(edge));\n    });\n  }\n\n  addEdge(edgeArg: Edge) {\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) {\n    Rx.batch(() => {\n      edges.map((edge) => this.removeEdge(edge, removeOrphans));\n    });\n  }\n\n  removeEdge(edgeArg: Edge, removeOrphans = false) {\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[]) {\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  ) {\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, type Option, pipe, Record } from 'effect';\n\nimport { type MulticastObservable, type CleanupFn } from '@dxos/async';\nimport { log } from '@dxos/log';\nimport { byPosition, getDebugName, isNode, isNonNullable, type MaybePromise, type Position } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, ROOT_ID, type GraphParams, type ExpandableGraph } from './graph';\nimport { actionGroupSymbol, type ActionData, type Node, type NodeArg, type Relation } from './node';\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  // TODO(wittjosiah): On initialize to restore state from cache.\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    connector,\n    actions: _actions,\n    actionGroups: _actionGroups,\n  } = extension;\n  const getId = (key: string) => `${id}/${key}`;\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((key) => connector(key).pipe(Rx.withLabel(`graph-builder:connector:${id}`))),\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              get(actionGroups(node)).map((arg) => ({\n                ...arg,\n                data: actionGroupSymbol,\n                type: ACTION_GROUP_TYPE,\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) => get(actions(node)).map((arg) => ({ ...arg, type: ACTION_TYPE }))).pipe(\n              Rx.withLabel(`graph-builder:connector:actions:${id}`),\n            ),\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 _connectorSubscriptions = 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\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) {\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  ) {\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() {\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.clear();\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) {\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        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      { immediate: true },\n    );\n\n    this._connectorSubscriptions.set(id, cancel);\n  }\n\n  // TODO(wittjosiah): On initialize to restore state from cache.\n  // private async _onInitialize(id: string) {\n  //   log('onInitialize', { id });\n  // }\n\n  private _onRemoveNode(id: string) {\n    this._connectorSubscriptions.get(id)?.();\n    this._connectorSubscriptions.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 MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  // 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' : 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 : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,sBAA6B;AAC7B,oBAAqC;AAErC,mBAA+B;AAC/B,mBAAqB;AACrB,uBAA0B;AAC1B,iBAAoB;AACpB,kBAAiD;ACPjD,IAAAA,mBAA6B;AAC7B,0BAAuB;AACvB,IAAAC,iBAAiD;AAGjD,IAAAC,cAAoB;AACpB,IAAAC,eAAkG;;ADKlG,IAAMC,cAAcC,OAAO,OAAA;AAOpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCK,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAqM1B,IAAMC,QAAN,MAAMA;EAmFXC,YAAY,EAAEC,UAAUC,OAAOC,OAAOC,UAAUC,aAAY,IAAkB,CAAC,GAAG;AAlFzEC,SAAAA,gBAAgB,IAAIC,mBAAAA;AAOZC,SAAAA,YAAYC,qBAAOC,MAAK;AACxBC,SAAAA,eAAeF,qBAAOC,MAAK;AAC3BE,SAAAA,gBAAgBH,qBAAOC,MAAK;AAC5BG,SAAAA,gBAAgBJ,qBAAOK,YAAY;MAClD;QAACnB;QAAS,KAAKoB,eAAe;UAAEC,IAAIrB;UAASsB,MAAMrB;UAAWsB,MAAM;UAAMC,YAAY,CAAC;QAAE,CAAA;;KAC1F;iBAGgBC,mBAAGC,OAAiD,CAACL,OAAAA;AACpE,YAAMM,UAAUC,qBAAOC,QAAQf,qBAAOgB,IAAI,KAAKZ,eAAeG,EAAAA,CAAAA;AAC9D,aAAOI,mBAAGM,KAA0BJ,OAAAA,EAASK,KAAKP,mBAAGQ,WAAWR,mBAAGS,UAAU,cAAcb,EAAAA,EAAI,CAAA;IACjG,CAAA;AAEiBc,SAAAA,eAAeV,mBAAGC,OAA4B,CAACL,OAAAA;AAC9D,aAAOI,mBAAGM,KAAK,CAACD,QAAAA;AACd,cAAMjC,OAAOiC,IAAI,KAAKM,MAAMf,EAAAA,CAAAA;AAC5BtB,wCAAU6B,qBAAOS,OAAOxC,IAAAA,GAAO,uBAAuBwB,EAAAA,IAAI;;;;;;;;;AAC1D,eAAOxB,KAAKyC;MACd,CAAA;IACF,CAAA;AAEiBC,SAAAA,SAASd,mBAAGC,OAAmC,CAACL,OAAAA;AAC/D,YAAMM,UAAUb,qBAAOgB,IAAI,KAAKb,eAAeI,EAAAA,EAAIW,KAAKJ,qBAAOY,UAAU,OAAO;QAAEC,SAAS,CAAA;QAAIC,UAAU,CAAA;MAAG,EAAA,CAAA;AAC5G,aAAOjB,mBAAGM,KAAYJ,OAAAA,EAASK,KAAKP,mBAAGQ,WAAWR,mBAAGS,UAAU,eAAeb,EAAAA,EAAI,CAAA;IACpF,CAAA;wBAIgCI,mBAAGC,OAA8B,CAACiB,QAAAA;AAChE,aAAOlB,mBAAGM,KAAK,CAACD,QAAAA;AACd,cAAM,CAACT,IAAIuB,QAAAA,IAAYD,IAAIE,MAAM,GAAA;AACjC,cAAMrC,SAAQsB,IAAI,KAAKS,OAAOlB,EAAAA,CAAAA;AAC9B,eAAOb,OAAMoC,QAAAA,EACVE,IAAI,CAACzB,QAAOS,IAAI,KAAKM,MAAMf,GAAAA,CAAAA,CAAAA,EAC3B0B,OAAOnB,qBAAOS,MAAM,EACpBS,IAAI,CAACE,MAAMA,EAAEV,KAAK;MACvB,CAAA,EAAGN,KAAKP,mBAAGS,UAAU,qBAAqBS,GAAAA,EAAK,CAAA;IACjD,CAAA;AAEiBM,SAAAA,WAAWxB,mBAAGC,OAAgD,CAACL,OAAAA;AAC9E,aAAOI,mBAAGM,KAAK,CAACD,QAAAA;AACd,eAAOA,IAAI,KAAKoB,aAAa,GAAG7B,EAAAA,WAAa,CAAA,EAAG0B,OAC9C,CAAClD,SAASA,KAAKyB,SAASpB,eAAeL,KAAKyB,SAASnB,iBAAAA;MAEzD,CAAA,EAAG6B,KAAKP,mBAAGS,UAAU,iBAAiBb,EAAAA,EAAI,CAAA;IAC5C,CAAA;AAEiB8B,SAAAA,QAAQ1B,mBAAGC,OAA2B,CAACL,OAAAA;AACtD,aAAOI,mBAAGM,KAAK,CAACD,QAAAA;AACd,cAAMsB,SAAS,CAACvD,MAAYwD,OAAiB,CAAA,MAAE;AAC7C,gBAAM9C,SAAQuB,IAAI,KAAKwB,YAAYzD,KAAKwB,EAAE,CAAA;AAC1C,gBAAMkC,MAA2B;YAC/BlC,IAAIxB,KAAKwB,GAAGmC,SAAS,KAAK,GAAG3D,KAAKwB,GAAGoC,MAAM,GAAG,EAAA,CAAA,QAAW5D,KAAKwB;YAC9DC,MAAMzB,KAAKyB;UACb;AACA,cAAIzB,KAAK2B,WAAWkC,OAAO;AACzBH,gBAAIG,QAAQ7D,KAAK2B,WAAWkC;UAC9B;AACA,cAAInD,OAAMiD,QAAQ;AAChBD,gBAAIhD,QAAQA,OACTuC,IAAI,CAACa,MAAAA;AAEJ,oBAAMC,WAAW;mBAAIP;gBAAMxD,KAAKwB;;AAChC,qBAAOuC,SAASC,SAASF,EAAEtC,EAAE,IAAIyC,SAAYV,OAAOO,GAAGC,QAAAA;YACzD,CAAA,EACCb,OAAOgB,yBAAAA;UACZ;AACA,iBAAOR;QACT;AAEA,cAAMS,OAAOlC,IAAI,KAAKmC,YAAY5C,EAAAA,CAAAA;AAClC,eAAO+B,OAAOY,IAAAA;MAChB,CAAA,EAAGhC,KAAKP,mBAAGS,UAAU,cAAcb,EAAAA,EAAI,CAAA;IACzC,CAAA;AAGE,SAAK6C,YAAY5D,YAAY6D,yBAASpC,KAAI;AAC1C,SAAKqC,YAAY3D;AACjB,SAAK4D,gBAAgB3D;AAErB,QAAIH,OAAO;AACTA,YAAM+D,QAAQ,CAACzE,SAAAA;AACbiB,6BAAOyD,IAAI,KAAKrD,eAAerB,KAAKwB,IAAI,KAAKD,eAAevB,IAAAA,CAAAA;MAC9D,CAAA;IACF;AAEA,QAAIW,OAAO;AACTgE,aAAOC,QAAQjE,KAAAA,EAAO8D,QAAQ,CAAC,CAACI,QAAQlE,MAAAA,MAAM;AAC5CM,6BAAOyD,IAAI,KAAKtD,eAAeyD,QAAQlE,MAAAA;MACzC,CAAA;IACF;EACF;EAEA4C,OAAO/B,KAAKrB,SAAS;AACnB,WAAO,KAAKkE,UAAUpC,IAAI,KAAKqB,MAAM9B,EAAAA,CAAAA;EACvC;EAEAsD,KAAKtD,KAAKrB,SAAS;AACjB,WAAO,KAAKmD,MAAM9B,EAAAA;EACpB;EAEAxB,KAAKwB,IAAwC;AAC3C,WAAO,KAAKe,MAAMf,EAAAA;EACpB;EAEA4C,YAAY5C,IAAyB;AACnC,WAAO,KAAKc,aAAad,EAAAA;EAC3B;EAEAiC,YAAYjC,IAAYuB,WAAqB,YAA2B;AACtE,WAAO,KAAKM,aAAa,GAAG7B,EAAAA,IAAMuB,QAAAA,EAAU;EAC9C;EAEAgC,QAAQvD,IAAY;AAClB,WAAO,KAAK4B,SAAS5B,EAAAA;EACvB;EAEAb,MAAMa,IAA0B;AAC9B,WAAO,KAAKkB,OAAOlB,EAAAA;EACrB;EAEA,IAAI2C,OAAO;AACT,WAAO,KAAKa,eAAe7E,OAAAA;EAC7B;EAEA8E,QAAQzD,IAAiC;AACvC,WAAO,KAAK6C,UAAUpC,IAAI,KAAKjC,KAAKwB,EAAAA,CAAAA;EACtC;EAEAwD,eAAexD,IAAkB;AAC/B,WAAO,KAAK6C,UAAUpC,IAAI,KAAKmC,YAAY5C,EAAAA,CAAAA;EAC7C;EAEA0D,eAAe1D,IAAYuB,WAAqB,YAAoB;AAClE,WAAO,KAAKsB,UAAUpC,IAAI,KAAKwB,YAAYjC,IAAIuB,QAAAA,CAAAA;EACjD;EAEAoC,WAAW3D,IAAoB;AAC7B,WAAO,KAAK6C,UAAUpC,IAAI,KAAK8C,QAAQvD,EAAAA,CAAAA;EACzC;EAEA4D,SAAS5D,IAAmB;AAC1B,WAAO,KAAK6C,UAAUpC,IAAI,KAAKtB,MAAMa,EAAAA,CAAAA;EACvC;;;;;;;;;;EAYA6D,OAAO7D,IAAYuB,WAAqB,YAAY;AAClD,UAAMD,MAAM,GAAGtB,EAAAA,IAAMuB,QAAAA;AACrB,UAAMuC,WAAWrE,qBAAOgB,IAAI,KAAKjB,WAAW8B,GAAAA,EAAKX,KAAKJ,qBAAOY,UAAU,MAAM,KAAA,CAAA;AAC7E4C,wBAAI,UAAU;MAAEzC;MAAKwC;IAAS,GAAA;;;;;;AAC9B,QAAI,CAACA,UAAU;AACb,WAAKf,YAAY/C,IAAIuB,QAAAA;AACrB9B,2BAAOyD,IAAI,KAAK1D,WAAW8B,KAAK,IAAA;IAClC;EACF;EAEA0C,SAAS9E,OAA4C;AACnDkB,uBAAG6D,MAAM,MAAA;AACP/E,YAAMuC,IAAI,CAACjD,SAAS,KAAK0F,QAAQ1F,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEA0F,QAAQ,EAAEhF,OAAOC,OAAO,GAAGgF,QAAAA,GAA8C;AACvE,UAAM,EAAEnE,IAAIC,MAAMC,OAAO,MAAMC,aAAa,CAAC,EAAC,IAAKgE;AACnD,UAAMC,SAAS,KAAKrD,MAAMf,EAAAA;AAC1B,UAAMxB,OAAO,KAAKqE,UAAUpC,IAAI2D,MAAAA;AAChC7D,yBAAO8D,MAAM7F,MAAM;MACjB8F,QAAQ,CAAC9F,UAAAA;AACP,cAAM+F,cAAc/F,MAAKyB,SAASA;AAClC,cAAMuE,cAAchG,MAAK0B,SAASA;AAClC,cAAMuE,oBAAoBtB,OAAOuB,KAAKvE,UAAAA,EAAYwE,KAAK,CAACrD,QAAQ9C,MAAK2B,WAAWmB,GAAAA,MAASnB,WAAWmB,GAAAA,CAAI;AACxGyC,4BAAI,iBAAiB;UAAEQ;UAAaC;UAAaC;QAAkB,GAAA;;;;;;AACnE,YAAIF,eAAeC,eAAeC,mBAAmB;AACnDV,8BAAI,iBAAiB;YAAE/D;YAAIC;YAAMC;YAAMC;UAAW,GAAA;;;;;;AAClD,gBAAMyE,UAAUrE,qBAAOoE,KAAK;YAAE,GAAGnG;YAAMyB;YAAMC;YAAMC,YAAY;cAAE,GAAG3B,MAAK2B;cAAY,GAAGA;YAAW;UAAE,CAAA;AACrG,eAAK0C,UAAUK,IAAIkB,QAAQQ,OAAAA;AAC3B,eAAKtF,cAAcuF,KAAK;YAAE7E;YAAIxB,MAAMoG;UAAQ,CAAA;QAC9C;MACF;MACAE,QAAQ,MAAA;AACNf,4BAAI,YAAY;UAAE/D;UAAIC;UAAMC;UAAMC;QAAW,GAAA;;;;;;AAC7C,cAAMyE,UAAU,KAAK7E,eAAe;UAAEC;UAAIC;UAAMC;UAAMC;QAAW,CAAA;AACjE,aAAK0C,UAAUK,IAAIkB,QAAQQ,OAAAA;AAC3B,aAAKtF,cAAcuF,KAAK;UAAE7E;UAAIxB,MAAMoG;QAAQ,CAAA;MAC9C;IACF,CAAA;AAEA,QAAI1F,OAAO;AAET,WAAK8E,SAAS9E,KAAAA;AACd,YAAMgC,SAAShC,MAAMuC,IAAI,CAACjD,WAAU;QAAE6E,QAAQrD;QAAI+E,QAAQvG,MAAKwB;MAAG,EAAA;AAClE,WAAKgF,SAAS9D,MAAAA;IAEhB;AAEA,QAAI/B,OAAO;AACT8F,6BAAAA;IACF;EACF;EAEAC,YAAYC,KAAehG,QAAQ,OAAO;AACxCiB,uBAAG6D,MAAM,MAAA;AACPkB,UAAI1D,IAAI,CAACzB,OAAO,KAAKoF,WAAWpF,IAAIb,KAAAA,CAAAA;IACtC,CAAA;EACF;EAEAiG,WAAWpF,IAAYb,QAAQ,OAAO;AACpC,UAAMiF,SAAS,KAAKrD,MAAMf,EAAAA;AAE1B,SAAK6C,UAAUK,IAAIkB,QAAQ7D,qBAAO8E,KAAI,CAAA;AACtC,SAAK/F,cAAcuF,KAAK;MAAE7E;MAAIxB,MAAM+B,qBAAO8E,KAAI;IAAG,CAAA;AAGlD,QAAIlG,OAAO;AACT,YAAM,EAAEiC,SAASC,SAAQ,IAAK,KAAKwB,UAAUpC,IAAI,KAAKS,OAAOlB,EAAAA,CAAAA;AAC7D,YAAMb,SAAQ;WACTiC,QAAQK,IAAI,CAAC4B,YAAY;UAAEA;UAAQ0B,QAAQ/E;QAAG,EAAA;WAC9CqB,SAASI,IAAI,CAACsD,YAAY;UAAE1B,QAAQrD;UAAI+E;QAAO,EAAA;;AAEpD,WAAKO,YAAYnG,MAAAA;IACnB;AAEA,SAAK6D,gBAAgBhD,EAAAA;EACvB;EAEAgF,SAAS7F,OAAe;AACtBiB,uBAAG6D,MAAM,MAAA;AACP9E,YAAMsC,IAAI,CAAC8D,SAAS,KAAKC,QAAQD,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAC,QAAQC,SAAe;AACrB,UAAMC,WAAW,KAAKxE,OAAOuE,QAAQpC,MAAM;AAC3C,UAAMA,SAAS,KAAKR,UAAUpC,IAAIiF,QAAAA;AAClC,QAAI,CAACrC,OAAOhC,SAASmB,SAASiD,QAAQV,MAAM,GAAG;AAC7ChB,0BAAI,qBAAqB;QAAEV,QAAQoC,QAAQpC;QAAQ0B,QAAQU,QAAQV;MAAO,GAAA;;;;;;AAC1E,WAAKlC,UAAUK,IAAIwC,UAAU;QAAEtE,SAASiC,OAAOjC;QAASC,UAAU;aAAIgC,OAAOhC;UAAUoE,QAAQV;;MAAQ,CAAA;IACzG;AAEA,UAAMY,WAAW,KAAKzE,OAAOuE,QAAQV,MAAM;AAC3C,UAAMA,SAAS,KAAKlC,UAAUpC,IAAIkF,QAAAA;AAClC,QAAI,CAACZ,OAAO3D,QAAQoB,SAASiD,QAAQpC,MAAM,GAAG;AAC5CU,0BAAI,oBAAoB;QAAEV,QAAQoC,QAAQpC;QAAQ0B,QAAQU,QAAQV;MAAO,GAAA;;;;;;AACzE,WAAKlC,UAAUK,IAAIyC,UAAU;QAAEvE,SAAS;aAAI2D,OAAO3D;UAASqE,QAAQpC;;QAAShC,UAAU0D,OAAO1D;MAAS,CAAA;IACzG;EACF;EAEAiE,YAAYnG,OAAeyG,gBAAgB,OAAO;AAChDxF,uBAAG6D,MAAM,MAAA;AACP9E,YAAMsC,IAAI,CAAC8D,SAAS,KAAKM,WAAWN,MAAMK,aAAAA,CAAAA;IAC5C,CAAA;EACF;EAEAC,WAAWJ,SAAeG,gBAAgB,OAAO;AAC/C,UAAMF,WAAW,KAAKxE,OAAOuE,QAAQpC,MAAM;AAC3C,UAAMA,SAAS,KAAKR,UAAUpC,IAAIiF,QAAAA;AAClC,QAAIrC,OAAOhC,SAASmB,SAASiD,QAAQV,MAAM,GAAG;AAC5C,WAAKlC,UAAUK,IAAIwC,UAAU;QAC3BtE,SAASiC,OAAOjC;QAChBC,UAAUgC,OAAOhC,SAASK,OAAO,CAAC1B,OAAOA,OAAOyF,QAAQV,MAAM;MAChE,CAAA;IACF;AAEA,UAAMY,WAAW,KAAKzE,OAAOuE,QAAQV,MAAM;AAC3C,UAAMA,SAAS,KAAKlC,UAAUpC,IAAIkF,QAAAA;AAClC,QAAIZ,OAAO3D,QAAQoB,SAASiD,QAAQpC,MAAM,GAAG;AAC3C,WAAKR,UAAUK,IAAIyC,UAAU;QAC3BvE,SAAS2D,OAAO3D,QAAQM,OAAO,CAAC1B,OAAOA,OAAOyF,QAAQpC,MAAM;QAC5DhC,UAAU0D,OAAO1D;MACnB,CAAA;IACF;AAEA,QAAIuE,eAAe;AACjB,YAAMvC,UAAS,KAAKR,UAAUpC,IAAIiF,QAAAA;AAClC,YAAMX,UAAS,KAAKlC,UAAUpC,IAAIkF,QAAAA;AAClC,UAAItC,QAAOhC,SAASc,WAAW,KAAKkB,QAAOjC,QAAQe,WAAW,KAAKsD,QAAQpC,WAAW1E,SAAS;AAC7F,aAAKuG,YAAY;UAACO,QAAQpC;SAAO;MACnC;AACA,UAAI0B,QAAO1D,SAASc,WAAW,KAAK4C,QAAO3D,QAAQe,WAAW,KAAKsD,QAAQV,WAAWpG,SAAS;AAC7F,aAAKuG,YAAY;UAACO,QAAQV;SAAO;MACnC;IACF;EACF;EAEAe,UAAU9F,IAAYuB,UAAoBwE,OAAiB;AACzD,UAAMC,UAAU,KAAK9E,OAAOlB,EAAAA;AAC5B,UAAMb,QAAQ,KAAK0D,UAAUpC,IAAIuF,OAAAA;AACjC,UAAMC,WAAW9G,MAAMoC,QAAAA,EAAUG,OAAO,CAAC1B,QAAO,CAAC+F,MAAMvD,SAASxC,GAAAA,CAAAA,KAAQ,CAAA;AACxE,UAAMkG,SAASH,MAAMrE,OAAO,CAAC1B,QAAOb,MAAMoC,QAAAA,EAAUiB,SAASxC,GAAAA,CAAAA,KAAQ,CAAA;AACrEb,UAAMoC,QAAAA,EAAU4E,OAAO,GAAGhH,MAAMoC,QAAAA,EAAUY,QAAM,GAAK;SAAI+D;SAAWD;KAAS;AAC7E,SAAKpD,UAAUK,IAAI8C,SAAS7G,KAAAA;EAC9B;EAEAiH,SAAS,EAAEC,SAAShD,SAAS1E,SAAS4C,WAAW,WAAU,GAA2B+E,OAAiB,CAAA,GAAU;AAE/G,QAAIA,KAAK9D,SAASa,MAAAA,GAAS;AACzB;IACF;AAEA,UAAM7E,OAAO,KAAKgF,eAAeH,MAAAA;AACjC,UAAMkD,iBAAiBF,QAAQ7H,MAAM;SAAI8H;MAAMjD;KAAO;AACtD,QAAIkD,mBAAmB,OAAO;AAC5B;IACF;AAEApD,WAAOqD,OAAO,KAAK9C,eAAeL,QAAQ9B,QAAAA,CAAAA,EAAW0B,QAAQ,CAACwD,UAC5D,KAAKL,SAAS;MAAE/C,QAAQoD,MAAMzG;MAAIuB;MAAU8E;IAAQ,GAAG;SAAIC;MAAMjD;KAAO,CAAA;EAE5E;EAEAqD,QAAQ,EAAErD,SAAS,QAAQ0B,OAAM,GAAkE;AACjG,eAAOpE,oBACL,KAAK8C,QAAQJ,MAAAA,GACb9C,qBAAOoG,QAAQ,CAACnI,SAAAA;AACd,UAAIoI,QAAiCrG,qBAAO8E,KAAI;AAChD,WAAKe,SAAS;QACZ/C,QAAQ7E,KAAKwB;QACbqG,SAAS,CAAC7H,OAAM8H,SAAAA;AACd,cAAI/F,qBAAOS,OAAO4F,KAAAA,GAAQ;AACxB,mBAAO;UACT;AAEA,cAAIpI,MAAKwB,OAAO+E,QAAQ;AACtB6B,oBAAQrG,qBAAOoE,KAAK2B,IAAAA;UACtB;QACF;MACF,CAAA;AAEA,aAAOM;IACT,CAAA,CAAA;EAEJ;EAEA,MAAMC,YACJC,QACA,EAAEC,UAAU,KAAOC,WAAW,IAAG,IAA8C,CAAC,GAChF;AACA,UAAMV,OAAO,KAAKI,QAAQI,MAAAA;AAC1B,QAAIvG,qBAAOS,OAAOsF,IAAAA,GAAO;AACvB,aAAOA,KAAKrF;IACd;AAEA,UAAMgG,UAAU,IAAIC,qBAAAA;AACpB,UAAMC,IAAIC,YAAY,MAAA;AACpB,YAAMd,QAAO,KAAKI,QAAQI,MAAAA;AAC1B,UAAIvG,qBAAOS,OAAOsF,KAAAA,GAAO;AACvBW,gBAAQI,KAAKf,MAAKrF,KAAK;MACzB;IACF,GAAG+F,QAAAA;AAEH,WAAOC,QAAQK,KAAK;MAAEP;IAAQ,CAAA,EAAGQ,QAAQ,MAAMC,cAAcL,CAAAA,CAAAA;EAC/D;;EAGApH,eAAevB,MAAyC;AACtD,WAAO+B,qBAAOoE,KAAK;MAAE,CAACtG,WAAAA,GAAc;MAAM6B,MAAM;MAAMC,YAAY,CAAC;MAAG,GAAG3B;IAAK,CAAA;EAChF;AACF;AExiBO,IAAMiJ,cAAc,CAACvH,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAMwH,WAAW,CAACxH,SACvBuH,YAAYvH,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMyH,oBAAoBrJ,OAAO,aAAA;AAQjC,IAAMsJ,gBAAgB,CAAC1H,SAC5BuH,YAAYvH,IAAAA,IAAQA,KAAKA,SAASyH,oBAAoB;AAIjD,IAAME,eAAe,CAAC3H,SAAgDwH,SAASxH,IAAAA,KAAS0H,cAAc1H,IAAAA;;ADxCtG,IAAM4H,kBAAkB,CAACC,cAAAA;AAC9B,QAAM,EACJ/H,IACAgI,WAAW,UACXzG,WAAW,YACX0G,WACA1E,SAAS3B,UACTsG,cAAcC,cAAa,IACzBJ;AACJ,QAAMK,QAAQ,CAAC9G,QAAgB,GAAGtB,EAAAA,IAAMsB,GAAAA;AAExC,QAAM4G,eACJC,iBACA/H,iBAAAA,GAAGC,OAAO,CAAC7B,SACT2J,cAAc3J,IAAAA,EAAMmC,KAAKP,iBAAAA,GAAGS,UAAU,8BAA8Bb,EAAAA,EAAI,CAAA,CAAA;AAG5E,QAAMuD,UACJ3B,YACAxB,iBAAAA,GAAGC,OAAO,CAAC7B,SAAqCoD,SAASpD,IAAAA,EAAMmC,KAAKP,iBAAAA,GAAGS,UAAU,yBAAyBb,EAAAA,EAAI,CAAA,CAAA;AAEhH,SAAO;;IAELiI,YACK;MACCjI,IAAIoI,MAAM,WAAA;MACVJ;MACAzG;MACA0G,WAAW7H,iBAAAA,GAAGC,OAAO,CAACiB,QAAQ2G,UAAU3G,GAAAA,EAAKX,KAAKP,iBAAAA,GAAGS,UAAU,2BAA2Bb,EAAAA,EAAI,CAAA,CAAA;IAChG,IACAyC;IACJyF,eACK;MACClI,IAAIoI,MAAM,cAAA;MACVJ;MACAzG,UAAU;MACV0G,WAAW7H,iBAAAA,GAAGC,OAAO,CAAC7B,SACpB4B,iBAAAA,GAAGM,KAAK,CAACD,QACPA,IAAIyH,aAAa1J,IAAAA,CAAAA,EAAOiD,IAAI,CAAC4G,SAAS;QACpC,GAAGA;QACHnI,MAAMyH;QACN1H,MAAMnB;MACR,EAAA,CAAA,EACA6B,KAAKP,iBAAAA,GAAGS,UAAU,wCAAwCb,EAAAA,EAAI,CAAA,CAAA;IAEpE,IACAyC;IACJc,UACK;MACCvD,IAAIoI,MAAM,SAAA;MACVJ;MACAzG,UAAU;MACV0G,WAAW7H,iBAAAA,GAAGC,OAAO,CAAC7B,SACpB4B,iBAAAA,GAAGM,KAAK,CAACD,QAAQA,IAAI8C,QAAQ/E,IAAAA,CAAAA,EAAOiD,IAAI,CAAC4G,SAAS;QAAE,GAAGA;QAAKpI,MAAMpB;MAAY,EAAA,CAAA,EAAK8B,KACjFP,iBAAAA,GAAGS,UAAU,mCAAmCb,EAAAA,EAAI,CAAA,CAAA;IAG1D,IACAyC;IACJf,OAAOgB,aAAAA,aAAAA;AACX;AAmBO,IAAM4F,oBAAoB,CAACP,WAA8BQ,MAA0B,CAAA,MAAE;AAC1F,MAAIC,qBAAMC,QAAQV,SAAAA,GAAY;AAC5B,WAAO;SAAIQ;SAAQR,UAAUpB,QAAQ,CAAC+B,QAAQJ,kBAAkBI,KAAKH,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAKR;;EAClB;AACF;AAQO,IAAMY,eAAN,MAAMA,cAAAA;EAWX3J,YAAY,EAAEC,UAAU,GAAG6H,OAAAA,IAA8D,CAAC,GAAG;mCATlD,oBAAI8B,IAAAA;AAC9BC,SAAAA,cAAczI,iBAAAA,GAAGM,KAAKjB,eAAAA,OAAOC,MAAK,CAAA,EAA8BiB,KAC/EP,iBAAAA,GAAGQ,WACHR,iBAAAA,GAAGS,UAAU,0BAAA,CAAA;AAiGEiI,SAAAA,cAAc1I,iBAAAA,GAAGC,OAAsC,CAACiB,QAAAA;AACvE,aAAOlB,iBAAAA,GAAGM,KAAK,CAACD,QAAAA;AACd,cAAM,CAACT,IAAIuB,QAAAA,IAAYD,IAAIE,MAAM,GAAA;AACjC,cAAMhD,OAAO,KAAKuK,OAAOvK,KAAKwB,EAAAA;AAE9B,mBAAOW,eAAAA;UACLF,IAAI,KAAKoI,WAAW;UACpBpJ,eAAAA,OAAO+G;;UAEPgC,qBAAMQ,OAAOC,uBAAAA;UACbT,qBAAM9G,OAAO,CAAC,EAAEH,UAAU2H,YAAY,WAAU,MAAOA,cAAc3H,QAAAA;UACrEiH,qBAAM/G,IAAI,CAAC,EAAEwG,UAAS,MAAOA,YAAYzJ,IAAAA,CAAAA;UACzCgK,qBAAM9G,OAAOgB,aAAAA,aAAAA;UACb8F,qBAAM7B,QAAQ,CAACwC,WAAW1I,IAAI0I,MAAAA,CAAAA;QAAAA;MAElC,CAAA,EAAGxI,KAAKP,iBAAAA,GAAGS,UAAU,4BAA4BS,GAAAA,EAAK,CAAA;IACxD,CAAA;AA1GE,SAAKuB,YAAY5D,YAAY6D,iBAAAA,SAASpC,KAAI;AAC1C,SAAKqI,SAAS,IAAIhK,MAAM;MACtB,GAAG+H;MACH7H,UAAU,KAAK4D;MACfzD,UAAU,CAACY,IAAIuB,aAAa,KAAKwB,UAAU/C,IAAIuB,QAAAA;;MAE/ClC,cAAc,CAACW,OAAO,KAAKgD,cAAchD,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOoJ,KAAKC,QAAiBpK,UAA8B;AACzD,QAAI,CAACoK,QAAQ;AACX,aAAO,IAAIV,cAAa;QAAE1J;MAAS,CAAA;IACrC;AAEA,UAAM,EAAEC,OAAOC,MAAK,IAAKmK,KAAKC,MAAMF,MAAAA;AACpC,WAAO,IAAIV,cAAa;MAAEzJ;MAAOC;MAAOF;IAAS,CAAA;EACnD;EAEA,IAAIR,QAAyB;AAC3B,WAAO,KAAKsK;EACd;EAEA,IAAIS,aAAa;AACf,WAAO,KAAKX;EACd;EAEAY,aAAaD,YAA6C;AACxDlB,sBAAkBkB,UAAAA,EAAYvG,QAAQ,CAAC8E,cAAAA;AACrC,YAAMyB,cAAa,KAAK3G,UAAUpC,IAAI,KAAKoI,WAAW;AACtD,WAAKhG,UAAUK,IAAI,KAAK2F,aAAapJ,eAAAA,OAAOyD,IAAIsG,aAAYzB,UAAU/H,IAAI+H,SAAAA,CAAAA;IAC5E,CAAA;AACA,WAAO;EACT;EAEA2B,gBAAgB1J,IAA0B;AACxC,UAAMwJ,aAAa,KAAK3G,UAAUpC,IAAI,KAAKoI,WAAW;AACtD,SAAKhG,UAAUK,IAAI,KAAK2F,aAAapJ,eAAAA,OAAOkK,OAAOH,YAAYxJ,EAAAA,CAAAA;AAC/D,WAAO;EACT;EAEA,MAAM4J,QAIJ,EAAE3K,WAAW6D,iBAAAA,SAASpC,KAAI,GAAI2C,SAAS1E,SAAS4C,WAAW,YAAY8E,QAAO,GAC9EC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAK9D,SAASa,MAAAA,GAAS;AACzB;IACF;AAIA,QAAI,KAACwG,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AAEA,UAAMtL,OAAOS,SAASwB,IAAI,KAAKsI,OAAOnG,YAAYS,MAAAA,CAAAA;AAClD,UAAMkD,iBAAiB,MAAMF,QAAQ7H,MAAM;SAAI8H;MAAM9H,KAAKwB;KAAG;AAC7D,QAAIuG,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMrH,QAAQiE,OAAOqD,OAAO,KAAK3D,UAAUpC,IAAI,KAAKoI,WAAW,CAAA,EAC5DnH,OAAO,CAACqG,cAAcxG,cAAcwG,UAAUxG,YAAY,WAAS,EACnEE,IAAI,CAACsG,cAAcA,UAAUE,SAAS,EACtCvG,OAAOgB,aAAAA,aAAAA,EACPiE,QAAQ,CAACsB,cAAchJ,SAASwB,IAAIwH,UAAU,KAAKc,OAAOvK,KAAK6E,MAAAA,CAAAA,CAAAA,CAAAA;AAElE,UAAM0G,QAAQC,IACZ9K,MAAMuC,IAAI,CAAC0C,YAAAA;AACTlF,eAASiE,IAAI,KAAK6F,OAAOhI,MAAMoD,QAAQnE,EAAE,GAAG,KAAK+I,OAAOhJ,eAAeoE,OAAAA,CAAAA;AACvE,aAAO,KAAKyF,QAAQ;QAAE3K;QAAUoE,QAAQc,QAAQnE;QAAIuB;QAAU8E;MAAQ,GAAG;WAAIC;QAAM9H,KAAKwB;OAAG;IAC7F,CAAA,CAAA;AAGF,QAAIf,aAAa,KAAK4D,WAAW;AAC/B5D,eAASgL,MAAK;AACdhL,eAASiL,QAAO;IAClB;EACF;EAEAC,UAAU;AACR,SAAKC,wBAAwBnH,QAAQ,CAACoH,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKD,wBAAwBE,MAAK;EACpC;EAoBQvH,UAAU/C,IAAYuB,UAAoB;AAChDwC,oBAAAA,KAAI,YAAY;MAAE/D;MAAIuB;MAAUtC,cAAUsL,2BAAa,KAAK1H,SAAS;IAAE,GAAA;;;;;;AACvE,UAAM2H,aAAa,KAAK1B,YAAY,GAAG9I,EAAAA,IAAMuB,QAAAA,EAAU;AAEvD,QAAIkJ,WAAqB,CAAA;AACzB,UAAMC,SAAS,KAAK7H,UAAU8H,UAC5BH,YACA,CAACtL,UAAAA;AACC,YAAMiG,MAAMjG,MAAMuC,IAAI,CAACa,MAAMA,EAAEtC,EAAE;AACjC,YAAM4K,UAAUH,SAAS/I,OAAO,CAAC1B,QAAO,CAACmF,IAAI3C,SAASxC,GAAAA,CAAAA;AACtDyK,iBAAWtF;AAEXpB,sBAAAA,KAAI,UAAU;QAAE/D;QAAIuB;QAAU4D;QAAKyF;MAAQ,GAAA;;;;;;AAC3CxK,uBAAAA,GAAG6D,MAAM,MAAA;AACP,aAAK8E,OAAOzD,YACVsF,QAAQnJ,IAAI,CAACsD,YAAY;UAAE1B,QAAQrD;UAAI+E;QAAO,EAAA,GAC9C,IAAA;AAEF,aAAKgE,OAAO/E,SAAS9E,KAAAA;AACrB,aAAK6J,OAAO/D,SACV9F,MAAMuC,IAAI,CAACjD,SACT+C,aAAa,aAAa;UAAE8B,QAAQrD;UAAI+E,QAAQvG,KAAKwB;QAAG,IAAI;UAAEqD,QAAQ7E,KAAKwB;UAAI+E,QAAQ/E;QAAG,CAAA,CAAA;AAG9F,aAAK+I,OAAOjD,UACV9F,IACAuB,UACArC,MAAMuC,IAAI,CAAC,EAAEzB,IAAAA,IAAE,MAAOA,GAAAA,CAAAA;MAE1B,CAAA;IACF,GACA;MAAE6K,WAAW;IAAK,CAAA;AAGpB,SAAKT,wBAAwBlH,IAAIlD,IAAI0K,MAAAA;EACvC;;;;;EAOQ1H,cAAchD,IAAY;AAChC,SAAKoK,wBAAwB3J,IAAIT,EAAAA,IAAAA;AACjC,SAAKoK,wBAAwBU,OAAO9K,EAAAA;EACtC;AACF;AAMO,IAAM+K,eAAe,CAAIC,OAAAA;AAC9B,SAAO5K,iBAAAA,GAAGM,KAAK,CAACD,QAAAA;AACd,UAAMyJ,cAAUe,4BAAO,MAAA;AACrBxK,UAAIyK,QAAQF,GAAAA,CAAAA;IACd,CAAA;AAEAvK,QAAI0K,aAAa,MAAMjB,QAAAA,CAAAA;AAEvB,WAAOc,GAAAA;EACT,CAAA;AACF;AAEA,IAAMI,mBAAmBhL,iBAAAA,GAAGC,OAAO,CAACgL,eAAAA;AAClC,SAAOjL,iBAAAA,GAAGM,KAAK,CAACD,QAAAA;AACd,UAAM6K,eAAeD,WAAWV,UAAU,CAAC1J,UAAUR,IAAIyK,QAAQjK,KAAAA,CAAAA;AAEjER,QAAI0K,aAAa,MAAMG,aAAajB,YAAW,CAAA;AAE/C,WAAOgB,WAAW5K,IAAG;EACvB,CAAA;AACF,CAAA;AAMO,IAAM8K,mBAAmB,CAAIF,eAAAA;AAClC,SAAOD,iBAAiBC,UAAAA;AAC1B;",
-  "names": ["import_rx_react", "import_effect", "import_log", "import_util", "graphSymbol", "Symbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "constructor", "registry", "nodes", "edges", "onExpand", "onRemoveNode", "onNodeChanged", "Event", "_expanded", "Record", "empty", "_initialized", "_initialEdges", "_initialNodes", "fromEntries", "_constructNode", "id", "type", "data", "properties", "Rx", "family", "initial", "Option", "flatten", "get", "make", "pipe", "keepAlive", "withLabel", "_nodeOrThrow", "_node", "isSome", "value", "_edges", "getOrElse", "inbound", "outbound", "key", "relation", "split", "map", "filter", "o", "_actions", "_connections", "_json", "toJSON", "seen", "connections", "obj", "length", "slice", "label", "n", "nextSeen", "includes", "undefined", "isNonNullable", "root", "nodeOrThrow", "_registry", "Registry", "_onExpand", "_onRemoveNode", "forEach", "set", "Object", "entries", "source", "json", "actions", "getNodeOrThrow", "getNode", "getConnections", "getActions", "getEdges", "expand", "expanded", "log", "addNodes", "batch", "addNode", "nodeArg", "nodeRx", "match", "onSome", "typeChanged", "dataChanged", "propertiesChanged", "keys", "some", "newNode", "emit", "onNone", "target", "addEdges", "todo", "removeNodes", "ids", "removeNode", "none", "removeEdges", "edge", "addEdge", "edgeArg", "sourceRx", "targetRx", "removeOrphans", "removeEdge", "sortEdges", "order", "edgesRx", "unsorted", "sorted", "splice", "traverse", "visitor", "path", "shouldContinue", "values", "child", "getPath", "flatMap", "found", "waitForPath", "params", "timeout", "interval", "trigger", "Trigger", "i", "setInterval", "wake", "wait", "finally", "clearInterval", "isGraphNode", "isAction", "actionGroupSymbol", "isActionGroup", "isActionLike", "createExtension", "extension", "position", "connector", "actionGroups", "_actionGroups", "getId", "arg", "flattenExtensions", "acc", "Array", "isArray", "ext", "GraphBuilder", "Map", "_extensions", "_connectors", "_graph", "sortBy", "byPosition", "_relation", "result", "from", "pickle", "JSON", "parse", "extensions", "addExtension", "removeExtension", "remove", "explore", "isNode", "yieldOrContinue", "Promise", "all", "reset", "dispose", "destroy", "_connectorSubscriptions", "unsubscribe", "clear", "getDebugName", "connectors", "previous", "cancel", "subscribe", "removed", "immediate", "delete", "rxFromSignal", "cb", "effect", "setSelf", "addFinalizer", "observableFamily", "observable", "subscription", "rxFromObservable"]
+  "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { invariant } from '@dxos/invariant';\nimport { type ReactiveObject, create } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, isNonNullable, pick } from '@dxos/util';\n\nimport { type Node, type NodeArg, type NodeFilter, type Relation, actionGroupSymbol, isActionLike } 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\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type NodesOptions<T = any, U extends Record<string, any> = Record<string, any>> = {\n  relation?: Relation;\n  filter?: NodeFilter<T, U>;\n  expansion?: boolean;\n  type?: string;\n};\n\n// TODO(wittjosiah): Consider having default be undefined. This is current default for backwards compatibility.\nconst DEFAULT_FILTER = (node: Node) => untracked(() => !isActionLike(node));\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n\n  /**\n   * Allow traversal to trigger expansion of the graph via `onInitialNodes`.\n   */\n  expansion?: boolean;\n};\n\nexport type GraphParams = {\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, string[]>;\n  onInitialNode?: Graph['_onInitialNode'];\n  onInitialNodes?: Graph['_onInitialNodes'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  private readonly _onInitialNode?: (id: string) => Promise<void>;\n  private readonly _onInitialNodes?: (node: Node, relation: Relation, type?: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => Promise<void>;\n\n  private readonly _waitingForNodes: Record<string, Trigger<Node>> = {};\n  private readonly _initialized: Record<string, boolean> = {};\n\n  /**\n   * @internal\n   */\n  readonly _nodes: Record<string, ReactiveObject<NodeInternal>> = {};\n\n  /**\n   * @internal\n   */\n  readonly _edges: Record<string, ReactiveObject<{ inbound: string[]; outbound: string[] }>> = {};\n\n  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode }: GraphParams = {}) {\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n\n    this._nodes[ROOT_ID] = this._constructNode({\n      id: ROOT_ID,\n      type: ROOT_TYPE,\n      cacheable: [],\n      properties: {},\n      data: null,\n    });\n    if (nodes) {\n      nodes.forEach((node) => {\n        const cacheable = Object.keys(node.properties ?? {});\n        if (node.type === ACTION_TYPE) {\n          this._addNode({ cacheable, data: () => log.warn('Pickled action invocation'), ...node });\n        } else if (node.type === ACTION_GROUP_TYPE) {\n          this._addNode({ cacheable, data: actionGroupSymbol, ...node });\n        } else {\n          this._addNode({ cacheable, ...node });\n        }\n      });\n    }\n\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        edges.forEach((target) => {\n          this._addEdge({ source, target });\n        });\n        this._sortEdges(source, 'outbound', edges);\n      });\n    }\n  }\n\n  static from(pickle: string, options: Omit<GraphParams, 'nodes' | 'edges'> = {}) {\n    const { nodes, edges } = JSON.parse(pickle);\n    return new Graph({ nodes, edges, ...options });\n  }\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = this.nodes(node);\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n        type: node.type,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(isNonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  pickle() {\n    const nodes = Object.values(this._nodes)\n      .filter((node) => !!node.cacheable)\n      .map((node) => {\n        return {\n          id: node.id,\n          type: node.type,\n          properties: pick(node.properties, node.cacheable!),\n        };\n      });\n\n    const cacheable = new Set(nodes.map((node) => node.id));\n\n    const edges = Object.fromEntries(\n      Object.entries(this._edges)\n        .filter(([id]) => cacheable.has(id))\n        .map(([id, { outbound }]): [string, string[]] => [id, outbound.filter((nodeId) => cacheable.has(nodeId))])\n        // TODO(wittjosiah): Why sort?\n        .toSorted(([a], [b]) => a.localeCompare(b)),\n    );\n\n    return JSON.stringify({ nodes, edges });\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   *\n   * If a node is not found within the graph and an `onInitialNode` callback is provided,\n   * it is called with the id and type of the node, potentially initializing the node.\n   */\n  findNode(id: string, expansion = true): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode && expansion) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = DEFAULT_FILTER, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => filter(n, node));\n  }\n\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(node: Node, { relation = 'outbound' }: { relation?: Relation } = {}) {\n    return this._edges[node.id]?.[relation] ?? [];\n  }\n\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(node: Node, { expansion }: { expansion?: boolean } = {}) {\n    return [\n      ...this._getNodes({ node, expansion, type: ACTION_GROUP_TYPE }),\n      ...this._getNodes({ node, expansion, type: ACTION_TYPE }),\n    ];\n  }\n\n  async expand(node: Node, relation: Relation = 'outbound', type?: string) {\n    const key = this._key(node, relation, type);\n    const initialized = this._initialized[key];\n    if (!initialized && this._onInitialNodes) {\n      await this._onInitialNodes(node, relation, type);\n      this._initialized[key] = true;\n    }\n  }\n\n  private _key(node: Node, relation: Relation, type?: string) {\n    return `${node.id}-${relation}-${type}`;\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    path: string[] = [],\n  ): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    const shouldContinue = visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this._getNodes({ node, relation, expansion })).forEach((child) =>\n      this.traverse({ node: child, relation, visitor, expansion }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph wrapping each visitor call in an effect.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  subscribeTraverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    currentPath: string[] = [],\n  ) {\n    return effect(() => {\n      const path = [...currentPath, node.id];\n      const result = visitor(node, path);\n      if (result === false) {\n        return;\n      }\n\n      const nodes = this._getNodes({ node, relation, expansion });\n      const nodeSubscriptions = nodes.map((n) => this.subscribeTraverse({ node: n, visitor, expansion }, path));\n      return () => {\n        nodeSubscriptions.forEach((unsubscribe) => unsubscribe());\n      };\n    });\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      visitor: (node, path) => {\n        if (found) {\n          return false;\n        }\n\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ) {\n    const path = this.getPath(params);\n    if (path) {\n      return path;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (path) {\n        trigger.wake(path);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /**\n   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data = null, properties, type } = _node;\n        if (data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id, false);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(isNonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  // 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<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties' | 'cacheable'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup<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 : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { effect, type Signal, signal, untracked } from '@preact/signals-core';\n\nimport { Trigger, type CleanupFn } from '@dxos/async';\nimport { invariant } from '@dxos/invariant';\nimport { create } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { byPosition, type Position, isNode, type MaybePromise, isNonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, ROOT_ID, type GraphParams } from './graph';\nimport { type ActionData, actionGroupSymbol, type Node, type NodeArg, type Relation } from './node';\n\nconst NODE_RESOLVER_TIMEOUT = 1_000;\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | false | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.disposition Affects the order the extensions are processed in.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  position?: Position;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, position = 'static', resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), position, resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), position, connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          position,\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          position,\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(isNonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = Readonly<{\n  id: string;\n  position: Position;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n}>;\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\nexport const flattenExtensions = (extension: ExtensionArg, 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  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, CleanupFn>();\n  private readonly _connectorSubscriptions = new Map<string, CleanupFn>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private readonly _initialized: Record<string, Trigger> = {};\n  private _graph: Graph;\n\n  constructor(params: Pick<GraphParams, 'nodes' | 'edges'> = {}) {\n    this._graph = new Graph({\n      ...params,\n      onInitialNode: async (id) => this._onInitialNode(id),\n      onInitialNodes: async (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string) {\n    if (!pickle) {\n      return new GraphBuilder();\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges });\n  }\n\n  /**\n   * If graph is being restored from a pickle, the data will be null.\n   * Initialize the data of each node by calling resolvers.\n   * Wait until all of the initial nodes have resolved.\n   */\n  async initialize() {\n    Object.keys(this._graph._nodes)\n      .filter((id) => id !== ROOT_ID)\n      .forEach((id) => (this._initialized[id] = new Trigger()));\n    Object.keys(this._graph._nodes).forEach((id) => this._onInitialNode(id));\n    await Promise.all(\n      Object.entries(this._initialized).map(async ([id, trigger]) => {\n        try {\n          await trigger.wait({ timeout: NODE_RESOLVER_TIMEOUT });\n        } catch {\n          log.error('node resolver timeout', { id });\n          this.graph._removeNodes([id]);\n        }\n      }),\n    );\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * @reactive\n   */\n  get extensions() {\n    return Object.values(this._extensions);\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    const extensions = flattenExtensions(extension);\n    untracked(() => {\n      extensions.forEach((extension) => {\n        this._dispatcher.state[extension.id] = [];\n        this._extensions[extension.id] = extension;\n      });\n    });\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    untracked(() => {\n      delete this._extensions[id];\n    });\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          cacheable: arg.cacheable,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        const extensions = Object.values(this._extensions).toSorted(byPosition);\n        for (const { id, resolver } of extensions) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | false | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          const trigger = this._initialized[nodeId];\n          if (node) {\n            this.graph._addNodes([node]);\n            trigger?.wake();\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          } else if (node === false) {\n            this.graph._removeNodes([nodeId]);\n            trigger?.wake();\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        const extensions = Object.values(this._extensions).toSorted(byPosition);\n        for (const { id, connector, filter, type, relation = 'outbound' } of extensions) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAAyC;AAEzC,mBAAsC;AACtC,uBAA0B;AAC1B,yBAA4C;AAC5C,iBAAoB;AACpB,kBAAuD;AENvD,IAAAA,uBAAuD;AAEvD,IAAAC,gBAAwC;AACxC,IAAAC,oBAA0B;AAC1B,IAAAC,sBAAuB;AACvB,IAAAC,cAAoB;AACpB,IAAAC,eAAoF;ADwC7E,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;ADvF7G,IAAMO,cAAcH,OAAO,OAAA;AAIpB,IAAMI,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBF,WAAAA;AACrCI,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,aAAeQ,+BAAU,MAAM,CAACX,aAAaG,IAAAA,CAAAA;AAyC9D,IAAMS,QAAN,MAAMA,OAAAA;EAkBXC,YAAY,EAAEC,OAAOC,OAAOC,eAAeC,gBAAgBC,aAAY,IAAkB,CAAC,GAAG;AAb5EC,SAAAA,mBAAkD,CAAC;AACnDC,SAAAA,eAAwC,CAAC;kBAKM,CAAC;kBAK4B,CAAC;AAketFC,SAAAA,iBAAiB,CAAClB,SAAAA;AACxB,iBAAOmB,2BAAqB;QAAE,GAAGnB;QAAM,CAACF,WAAAA,GAAc;MAAK,CAAA;IAC7D;AAjeE,SAAKsB,iBAAiBP;AACtB,SAAKQ,kBAAkBP;AACvB,SAAKQ,gBAAgBP;AAErB,SAAKQ,OAAOpB,OAAAA,IAAW,KAAKe,eAAe;MACzCM,IAAIrB;MACJsB,MAAMrB;MACNsB,WAAW,CAAA;MACXlC,YAAY,CAAC;MACbD,MAAM;IACR,CAAA;AACA,QAAIoB,OAAO;AACTA,YAAMgB,QAAQ,CAAC3B,SAAAA;AACb,cAAM0B,YAAYE,OAAOC,KAAK7B,KAAKR,cAAc,CAAC,CAAA;AAClD,YAAIQ,KAAKyB,SAASpB,aAAa;AAC7B,eAAKyB,SAAS;YAAEJ;YAAWnC,MAAM,MAAMwC,eAAIC,KAAK,6BAAA,QAAA;;;;;;YAA8B,GAAGhC;UAAK,CAAA;QACxF,WAAWA,KAAKyB,SAASnB,mBAAmB;AAC1C,eAAKwB,SAAS;YAAEJ;YAAWnC,MAAMG;YAAmB,GAAGM;UAAK,CAAA;QAC9D,OAAO;AACL,eAAK8B,SAAS;YAAEJ;YAAW,GAAG1B;UAAK,CAAA;QACrC;MACF,CAAA;IACF;AAEA,SAAKiC,OAAO9B,OAAAA,QAAWgB,2BAAO;MAAEe,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;AAC1D,QAAIvB,OAAO;AACTgB,aAAOQ,QAAQxB,KAAAA,EAAOe,QAAQ,CAAC,CAACU,QAAQzB,MAAAA,MAAM;AAC5CA,eAAMe,QAAQ,CAACW,WAAAA;AACb,eAAKC,SAAS;YAAEF;YAAQC;UAAO,CAAA;QACjC,CAAA;AACA,aAAKE,WAAWH,QAAQ,YAAYzB,MAAAA;MACtC,CAAA;IACF;EACF;EAEA,OAAO6B,KAAKC,QAAgBC,UAAgD,CAAC,GAAG;AAC9E,UAAM,EAAEhC,OAAOC,MAAK,IAAKgC,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAIjC,OAAM;MAAEE;MAAOC;MAAO,GAAG+B;IAAQ,CAAA;EAC9C;;;;EAKA,IAAIG,OAAO;AACT,WAAO,KAAKC,SAAS5C,OAAAA;EACvB;;;;EAKA6C,OAAO,EAAExB,KAAKrB,SAAS8C,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAChD,MAAYkD,OAAiB,CAAA,MAAE;AAC7C,YAAMvC,QAAQ,KAAKA,MAAMX,IAAAA;AACzB,YAAMmD,MAA2B;QAC/B3B,IAAIxB,KAAKwB,GAAG4B,SAASH,YAAY,GAAGjD,KAAKwB,GAAG6B,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUjD,KAAKwB;QAChFC,MAAMzB,KAAKyB;MACb;AACA,UAAIzB,KAAKR,WAAW8D,OAAO;AACzBH,YAAIG,QAAQtD,KAAKR,WAAW8D;MAC9B;AACA,UAAI3C,MAAMyC,QAAQ;AAChBD,YAAIxC,QAAQA,MACT4C,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIP;YAAMlD,KAAKwB;;AAChC,iBAAOiC,SAASC,SAASF,EAAEhC,EAAE,IAAImC,SAAYX,OAAOQ,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,yBAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAML,OAAO,KAAKC,SAASvB,EAAAA;AAC3BtB,oCAAU4C,MAAM,mBAAmBtB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOwB,OAAOF,IAAAA;EAChB;EAEAJ,SAAS;AACP,UAAM/B,QAAQiB,OAAOkC,OAAO,KAAKvC,MAAM,EACpCqC,OAAO,CAAC5D,SAAS,CAAC,CAACA,KAAK0B,SAAS,EACjC6B,IAAI,CAACvD,SAAAA;AACJ,aAAO;QACLwB,IAAIxB,KAAKwB;QACTC,MAAMzB,KAAKyB;QACXjC,gBAAYuE,kBAAK/D,KAAKR,YAAYQ,KAAK0B,SAAS;MAClD;IACF,CAAA;AAEF,UAAMA,YAAY,IAAIsC,IAAIrD,MAAM4C,IAAI,CAACvD,SAASA,KAAKwB,EAAE,CAAA;AAErD,UAAMZ,QAAQgB,OAAOqC,YACnBrC,OAAOQ,QAAQ,KAAKH,MAAM,EACvB2B,OAAO,CAAC,CAACpC,EAAAA,MAAQE,UAAUwC,IAAI1C,EAAAA,CAAAA,EAC/B+B,IAAI,CAAC,CAAC/B,IAAI,EAAEW,SAAQ,CAAE,MAA0B;MAACX;MAAIW,SAASyB,OAAO,CAACO,WAAWzC,UAAUwC,IAAIC,MAAAA,CAAAA;KAAS,EAExGC,SAAS,CAAC,CAACC,CAAAA,GAAI,CAACC,CAAAA,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA,CAAAA;AAG5C,WAAO1B,KAAK4B,UAAU;MAAE7D;MAAOC;IAAM,CAAA;EACvC;;;;;;;EAQAmC,SAASvB,IAAYiD,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAKnD,OAAOC,EAAAA;AACjC,QAAI,CAACkD,gBAAgBD,WAAW;AAC9B,WAAK,KAAKrD,iBAAiBI,EAAAA;IAC7B;AAEA,WAAOkD;EACT;;;;;;;;;EAUA,MAAMC,YAAYnD,IAAYoD,SAAiC;AAC7D,UAAMC,UAAU,KAAK7D,iBAAiBQ,EAAAA,MAAQ,KAAKR,iBAAiBQ,EAAAA,IAAM,IAAIsD,qBAAAA;AAC9E,UAAM9E,OAAO,KAAK+C,SAASvB,EAAAA;AAC3B,QAAIxB,MAAM;AACR,aAAO,KAAKgB,iBAAiBQ,EAAAA;AAC7B,aAAOxB;IACT;AAEA,QAAI4E,YAAYjB,QAAW;AACzB,aAAOkB,QAAQE,KAAI;IACrB,OAAO;AACL,iBAAOC,2BAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBpD,EAAAA,EAAI;IACtE;EACF;;;;EAKAb,MAAoEX,MAAY2C,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEsC,UAAUR,WAAWb,SAASrD,gBAAgBkB,KAAI,IAAKkB;AAC/D,UAAMhC,QAAQ,KAAKuE,UAAU;MAAElF;MAAMiF;MAAUR;MAAWhD;IAAK,CAAA;AAC/D,WAAOd,MAAMiD,OAAO,CAACJ,MAAMI,OAAOJ,GAAGxD,IAAAA,CAAAA;EACvC;;;;EAKAY,MAAMZ,MAAY,EAAEiF,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKhD,OAAOjC,KAAKwB,EAAE,IAAIyD,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAE,QAAQnF,MAAY,EAAEyE,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKS,UAAU;QAAElF;QAAMyE;QAAWhD,MAAMnB;MAAkB,CAAA;SAC1D,KAAK4E,UAAU;QAAElF;QAAMyE;QAAWhD,MAAMpB;MAAY,CAAA;;EAE3D;EAEA,MAAM+E,OAAOpF,MAAYiF,WAAqB,YAAYxD,MAAe;AACvE,UAAM4D,MAAM,KAAKC,KAAKtF,MAAMiF,UAAUxD,IAAAA;AACtC,UAAM8D,cAAc,KAAKtE,aAAaoE,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAKlE,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBrB,MAAMiF,UAAUxD,IAAAA;AAC3C,WAAKR,aAAaoE,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAKtF,MAAYiF,UAAoBxD,MAAe;AAC1D,WAAO,GAAGzB,KAAKwB,EAAE,IAAIyD,QAAAA,IAAYxD,IAAAA;EACnC;;;;;;;;EASA+D,SACE,EAAEC,SAASzF,OAAO,KAAK8C,MAAMmC,WAAW,YAAYR,UAAS,GAC7DiB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAKhC,SAAS1D,KAAKwB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAMmE,iBAAiBF,QAAQzF,MAAM;SAAI0F;MAAM1F,KAAKwB;KAAG;AACvD,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA/D,WAAOkC,OAAO,KAAKoB,UAAU;MAAElF;MAAMiF;MAAUR;IAAU,CAAA,CAAA,EAAI9C,QAAQ,CAACiE,UACpE,KAAKJ,SAAS;MAAExF,MAAM4F;MAAOX;MAAUQ;MAAShB;IAAU,GAAG;SAAIiB;MAAM1F,KAAKwB;KAAG,CAAA;EAEnF;;;;;;;;EASAqE,kBACE,EAAEJ,SAASzF,OAAO,KAAK8C,MAAMmC,WAAW,YAAYR,UAAS,GAC7DqB,cAAwB,CAAA,GACxB;AACA,eAAOC,4BAAO,MAAA;AACZ,YAAML,OAAO;WAAII;QAAa9F,KAAKwB;;AACnC,YAAMwE,SAASP,QAAQzF,MAAM0F,IAAAA;AAC7B,UAAIM,WAAW,OAAO;AACpB;MACF;AAEA,YAAMrF,QAAQ,KAAKuE,UAAU;QAAElF;QAAMiF;QAAUR;MAAU,CAAA;AACzD,YAAMwB,oBAAoBtF,MAAM4C,IAAI,CAACC,MAAM,KAAKqC,kBAAkB;QAAE7F,MAAMwD;QAAGiC;QAAShB;MAAU,GAAGiB,IAAAA,CAAAA;AACnG,aAAO,MAAA;AACLO,0BAAkBtE,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAE9D,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAM8D,QAAQ,KAAKrD,SAASV,MAAAA;AAC5B,QAAI,CAAC+D,OAAO;AACV,aAAOzC;IACT;AAEA,QAAI0C;AACJ,SAAKb,SAAS;MACZxF,MAAMoG;MACNX,SAAS,CAACzF,MAAM0F,SAAAA;AACd,YAAIW,OAAO;AACT,iBAAO;QACT;AAEA,YAAIrG,KAAKwB,OAAOc,QAAQ;AACtB+D,kBAAQX;QACV;MACF;IACF,CAAA;AAEA,WAAOW;EACT;;;;EAKA,MAAMC,YACJC,QACA,EAAE3B,UAAU,KAAO4B,WAAW,IAAG,IAA8C,CAAC,GAChF;AACA,UAAMd,OAAO,KAAKS,QAAQI,MAAAA;AAC1B,QAAIb,MAAM;AACR,aAAOA;IACT;AAEA,UAAMb,UAAU,IAAIC,qBAAAA;AACpB,UAAM2B,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKS,QAAQI,MAAAA;AAC1B,UAAIb,OAAM;AACRb,gBAAQ8B,KAAKjB,KAAAA;MACf;IACF,GAAGc,QAAAA;AAEH,WAAO3B,QAAQE,KAAK;MAAEH;IAAQ,CAAA,EAAGgC,QAAQ,MAAMC,cAAcJ,CAAAA,CAAAA;EAC/D;;;;;;EAOAK,UACEnG,OAC4B;AAC5B,eAAOoG,2BAAM,MAAMpG,MAAM4C,IAAI,CAACvD,SAAS,KAAK8B,SAAS9B,IAAAA,CAAAA,CAAAA;EACvD;EAEQ8B,SAA+E,EACrFnB,OACAC,OACA,GAAGoG,MAAAA,GACqD;AACxD,eAAOxG,+BAAU,MAAA;AACf,YAAMkE,eAAe,KAAKnD,OAAOyF,MAAMxF,EAAE;AACzC,YAAMxB,OAAO0E,gBAAgB,KAAKxD,eAAe;QAAE3B,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAGwH;MAAM,CAAA;AACxF,UAAItC,cAAc;AAChB,cAAM,EAAEnF,OAAO,MAAMC,YAAYiC,KAAI,IAAKuF;AAC1C,YAAIzH,SAASS,KAAKT,MAAM;AACtBS,eAAKT,OAAOA;QACd;AAEA,YAAIkC,SAASzB,KAAKyB,MAAM;AACtBzB,eAAKyB,OAAOA;QACd;AAEA,mBAAW4D,OAAO7F,YAAY;AAC5B,cAAIA,WAAW6F,GAAAA,MAASrF,KAAKR,WAAW6F,GAAAA,GAAM;AAC5CrF,iBAAKR,WAAW6F,GAAAA,IAAO7F,WAAW6F,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK9D,OAAOvB,KAAKwB,EAAE,IAAIxB;AACvB,aAAKiC,OAAOjC,KAAKwB,EAAE,QAAIL,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAM0C,UAAU,KAAK7D,iBAAiBhB,KAAKwB,EAAE;AAC7C,UAAIqD,SAAS;AACXA,gBAAQ8B,KAAK3G,IAAAA;AACb,eAAO,KAAKgB,iBAAiBhB,KAAKwB,EAAE;MACtC;AAEA,UAAIb,OAAO;AACTA,cAAMgB,QAAQ,CAACsF,YAAAA;AACb,eAAKnF,SAASmF,OAAAA;AACd,eAAK1E,SAAS;YAAEF,QAAQrC,KAAKwB;YAAIc,QAAQ2E,QAAQzF;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIZ,OAAO;AACTA,cAAMe,QAAQ,CAAC,CAACH,IAAIyD,QAAAA,MAClBA,aAAa,aACT,KAAK1C,SAAS;UAAEF,QAAQrC,KAAKwB;UAAIc,QAAQd;QAAG,CAAA,IAC5C,KAAKe,SAAS;UAAEF,QAAQb;UAAIc,QAAQtC,KAAKwB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOxB;IACT,CAAA;EACF;;;;;;;;EASAkH,aAAaC,KAAevG,QAAQ,OAAO;AACzCmG,mCAAM,MAAMI,IAAIxF,QAAQ,CAACH,OAAO,KAAK4F,YAAY5F,IAAIZ,KAAAA,CAAAA,CAAAA;EACvD;EAEQwG,YAAY5F,IAAYZ,QAAQ,OAAO;AAC7CJ,uCAAU,MAAA;AACR,YAAMR,OAAO,KAAK+C,SAASvB,IAAI,KAAA;AAC/B,UAAI,CAACxB,MAAM;AACT;MACF;AAEA,UAAIY,OAAO;AAET,aAAKsE,UAAU;UAAElF;QAAK,CAAA,EAAG2B,QAAQ,CAAC3B,UAAAA;AAChC,eAAKqH,YAAY;YAAEhF,QAAQb;YAAIc,QAAQtC,MAAKwB;UAAG,CAAA;QACjD,CAAA;AACA,aAAK0D,UAAU;UAAElF;UAAMiF,UAAU;QAAU,CAAA,EAAGtD,QAAQ,CAAC3B,UAAAA;AACrD,eAAKqH,YAAY;YAAEhF,QAAQrC,MAAKwB;YAAIc,QAAQd;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKS,OAAOT,EAAAA;MACrB;AAGA,aAAO,KAAKD,OAAOC,EAAAA;AACnBI,aAAOC,KAAK,KAAKZ,YAAY,EAC1B2C,OAAO,CAACyB,QAAQA,IAAIiC,WAAW9F,EAAAA,CAAAA,EAC/BG,QAAQ,CAAC0D,QAAAA;AACR,eAAO,KAAKpE,aAAaoE,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAK/D,gBAAgBE,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOA+F,UAAU3G,OAA6C;AACrDmG,mCAAM,MAAMnG,MAAMe,QAAQ,CAAC6F,SAAS,KAAKjF,SAASiF,IAAAA,CAAAA,CAAAA;EACpD;EAEQjF,SAAS,EAAEF,QAAQC,OAAM,GAAwC;AACvE9B,uCAAU,MAAA;AACR,UAAI,CAAC,KAAKyB,OAAOI,MAAAA,GAAS;AACxB,aAAKJ,OAAOI,MAAAA,QAAUlB,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKF,OAAOK,MAAAA,GAAS;AACxB,aAAKL,OAAOK,MAAAA,QAAUnB,2BAAO;UAAEe,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMsF,cAAc,KAAKxF,OAAOI,MAAAA;AAChC,UAAI,CAACoF,YAAYtF,SAASuB,SAASpB,MAAAA,GAAS;AAC1CmF,oBAAYtF,SAASuF,KAAKpF,MAAAA;MAC5B;AAEA,YAAMqF,cAAc,KAAK1F,OAAOK,MAAAA;AAChC,UAAI,CAACqF,YAAYzF,QAAQwB,SAASrB,MAAAA,GAAS;AACzCsF,oBAAYzF,QAAQwF,KAAKrF,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAuF,aAAahH,OAA6CiH,gBAAgB,OAAO;AAC/Ed,mCAAM,MAAMnG,MAAMe,QAAQ,CAAC6F,SAAS,KAAKH,YAAYG,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQR,YAAY,EAAEhF,QAAQC,OAAM,GAAwCuF,gBAAgB,OAAO;AACjGrH,uCAAU,MAAA;AACRuG,qCAAM,MAAA;AACJ,cAAMe,gBAAgB,KAAK7F,OAAOI,MAAAA,GAASF,SAAS4F,UAAU,CAACvG,OAAOA,OAAOc,MAAAA;AAC7E,YAAIwF,kBAAkBnE,UAAamE,kBAAkB,IAAI;AACvD,eAAK7F,OAAOI,MAAAA,EAAQF,SAAS6F,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAKhG,OAAOK,MAAAA,GAASJ,QAAQ6F,UAAU,CAACvG,OAAOA,OAAOa,MAAAA;AAC3E,YAAI4F,iBAAiBtE,UAAasE,iBAAiB,IAAI;AACrD,eAAKhG,OAAOK,MAAAA,EAAQJ,QAAQ8F,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAK5F,OAAOI,MAAAA,GAASF,SAASiB,WAAW,KACzC,KAAKnB,OAAOI,MAAAA,GAASH,QAAQkB,WAAW,KACxCf,WAAWlC,SACX;AACA,iBAAKiH,YAAY/E,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKJ,OAAOK,MAAAA,GAASH,SAASiB,WAAW,KACzC,KAAKnB,OAAOK,MAAAA,GAASJ,QAAQkB,WAAW,KACxCd,WAAWnC,SACX;AACA,iBAAKiH,YAAY9E,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAE,WAAW2B,QAAgBc,UAAoBrE,OAAiB;AAC9DJ,uCAAU,MAAA;AACRuG,qCAAM,MAAA;AACJ,cAAMmB,UAAU,KAAKjG,OAAOkC,MAAAA;AAC5B,YAAI+D,SAAS;AACX,gBAAMC,WAAWD,QAAQjD,QAAAA,EAAUrB,OAAO,CAACpC,OAAO,CAACZ,MAAM8C,SAASlC,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAM4G,SAASxH,MAAMgD,OAAO,CAACpC,OAAO0G,QAAQjD,QAAAA,EAAUvB,SAASlC,EAAAA,CAAAA,KAAQ,CAAA;AACvE0G,kBAAQjD,QAAAA,EAAU+C,OAAO,GAAGE,QAAQjD,QAAAA,EAAU7B,QAAM,GAAK;eAAIgF;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQjD,UAAU,EAChBlF,MACAiF,WAAW,YACXxD,MACAgD,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKW,OAAOpF,MAAMiF,UAAUxD,IAAAA;IACnC;AAEA,UAAMb,QAAQ,KAAKqB,OAAOjC,KAAKwB,EAAE;AACjC,QAAI,CAACZ,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAMqE,QAAAA,EACV1B,IAAI,CAAC/B,OAAO,KAAKD,OAAOC,EAAAA,CAAG,EAC3BoC,OAAOC,yBAAAA,EACPD,OAAO,CAACJ,MAAM,CAAC/B,QAAQ+B,EAAE/B,SAASA,IAAAA;IACvC;EACF;AACF;;AE9kBA,IAAM4G,wBAAwB;AA6DvB,IAAMC,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAE/G,IAAIgH,WAAW,UAAUC,UAAUC,WAAWvD,SAASwD,cAAc,GAAGC,KAAAA,IAASL;AACzF,QAAMM,QAAQ,CAACxD,QAAgB,GAAG7D,EAAAA,IAAM6D,GAAAA;AACxC,SAAO;IACLoD,WAAW;MAAEjH,IAAIqH,MAAM,UAAA;MAAaL;MAAUC;IAAS,IAAI9E;IAC3D+E,YAAY;MAAE,GAAGE;MAAMpH,IAAIqH,MAAM,WAAA;MAAcL;MAAUE;IAAU,IAAI/E;IACvEgF,eACK;MACC,GAAGC;MACHpH,IAAIqH,MAAM,cAAA;MACVL;MACA/G,MAAMnB;MACN2E,UAAU;MACVyD,WAAW,CAAC,EAAE1I,KAAI,MAChB2I,aAAa;QAAE3I;MAAK,CAAA,GAAIuD,IAAI,CAACuF,SAAS;QAAE,GAAGA;QAAKvJ,MAAMG;QAAmB+B,MAAMnB;MAAkB,EAAA;IACrG,IACAqD;IACJwB,UACK;MACC,GAAGyD;MACHpH,IAAIqH,MAAM,SAAA;MACVL;MACA/G,MAAMpB;MACN4E,UAAU;MACVyD,WAAW,CAAC,EAAE1I,KAAI,MAAOmF,QAAQ;QAAEnF;MAAK,CAAA,GAAIuD,IAAI,CAACuF,SAAS;QAAE,GAAGA;QAAKrH,MAAMpB;MAAY,EAAA;IACxF,IACAsD;IACJC,OAAOC,aAAAA,aAAAA;AACX;AAWA,IAAMkF,aAAN,MAAMA;EAAN,cAAA;AAEEC,SAAAA,aAAa;AACbC,SAAAA,QAA+B,CAAC;AAChCC,SAAAA,UAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAahE,MAAM,aAAQ;AACpD,QAAMiE,aAAaH,gBAAgBI;AACnCrJ,wBAAAA,WAAUoJ,YAAYE,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMH,WAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMd,UAAUuB,IAAIpE,GAAAA;AACpB,QAAMW,SAASkC,UAAUA,QAAQlC,SAASqD,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,IAAI;IAAE,GAAGS;IAAK,CAACpE,GAAAA,GAAM;MAAEW;IAAO;EAAE;AACnGsD,aAAWN;AACX,SAAOhD;AACT;AAKO,IAAMkD,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCrJ,0BAAAA,WAAUoJ,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQxB,KAAK2B,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMK,WAAW,CACtBC,WACAC,KACAvE,QAAAA;AAEA,QAAMwE,aAAaT,QAAQ,MAAA;AACzB,eAAOU,6BAAOF,IAAAA,CAAAA;EAChB,GAAGvE,GAAAA;AACH,QAAMa,cAAckD,QAAQ,MAAA;AAC1B,WAAOO,UAAU,MAAOE,WAAWE,QAAQH,IAAAA,CAAAA;EAC7C,GAAGvE,GAAAA;AACH6D,UAAQ,MAAA;AACNhD,gBAAAA;EACF,CAAA;AACA,SAAO2D,WAAWE;AACpB;AAeO,IAAMC,oBAAoB,CAACzB,WAAyB0B,MAA0B,CAAA,MAAE;AACrF,MAAIC,MAAMC,QAAQ5B,SAAAA,GAAY;AAC5B,WAAO;SAAI0B;SAAQ1B,UAAU6B,QAAQ,CAACC,QAAQL,kBAAkBK,KAAKJ,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAK1B;;EAClB;AACF;AAQO,IAAM+B,eAAN,MAAMA,cAAAA;EASX5J,YAAY6F,SAA+C,CAAC,GAAG;AAR9CgE,SAAAA,cAAc,IAAIxB,WAAAA;AAClByB,SAAAA,kBAAcrJ,oBAAAA,QAAyC,CAAC,CAAA;AACxDsJ,SAAAA,yBAAyB,oBAAIC,IAAAA;AAC7BC,SAAAA,0BAA0B,oBAAID,IAAAA;AAC9BE,SAAAA,eAA2C,CAAC;AAC5C3J,SAAAA,eAAwC,CAAC;AAIxD,SAAK4J,SAAS,IAAIpK,MAAM;MACtB,GAAG8F;MACH1F,eAAe,OAAOW,OAAO,KAAKJ,eAAeI,EAAAA;MACjDV,gBAAgB,OAAOd,MAAMiF,UAAUxD,SAAS,KAAKJ,gBAAgBrB,MAAMiF,UAAUxD,IAAAA;MACrFV,cAAc,CAACS,OAAO,KAAKF,cAAcE,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOiB,KAAKC,QAAiB;AAC3B,QAAI,CAACA,QAAQ;AACX,aAAO,IAAI4H,cAAAA;IACb;AAEA,UAAM,EAAE3J,OAAOC,MAAK,IAAKgC,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAI4H,cAAa;MAAE3J;MAAOC;IAAM,CAAA;EACzC;;;;;;EAOA,MAAMkK,aAAa;AACjBlJ,WAAOC,KAAK,KAAKgJ,OAAOtJ,MAAM,EAC3BqC,OAAO,CAACpC,OAAOA,OAAOrB,OAAAA,EACtBwB,QAAQ,CAACH,OAAQ,KAAKP,aAAaO,EAAAA,IAAM,IAAIsD,cAAAA,QAAAA,CAAAA;AAChDlD,WAAOC,KAAK,KAAKgJ,OAAOtJ,MAAM,EAAEI,QAAQ,CAACH,OAAO,KAAKJ,eAAeI,EAAAA,CAAAA;AACpE,UAAMuJ,QAAQtB,IACZ7H,OAAOQ,QAAQ,KAAKnB,YAAY,EAAEsC,IAAI,OAAO,CAAC/B,IAAIqD,OAAAA,MAAQ;AACxD,UAAI;AACF,cAAMA,QAAQE,KAAK;UAAEH,SAASyD;QAAsB,CAAA;MACtD,QAAQ;AACNtG,oBAAAA,IAAIiJ,MAAM,yBAAyB;UAAExJ;QAAG,GAAA;;;;;;AACxC,aAAKvB,MAAMiH,aAAa;UAAC1F;SAAG;MAC9B;IACF,CAAA,CAAA;EAEJ;EAEA,IAAIvB,QAAQ;AACV,WAAO,KAAK4K;EACd;;;;EAKA,IAAII,aAAa;AACf,WAAOrJ,OAAOkC,OAAO,KAAK0G,WAAW;EACvC;;;;EAKAU,aAAa3C,WAAuC;AAClD,UAAM0C,aAAajB,kBAAkBzB,SAAAA;AACrC/H,6BAAAA,WAAU,MAAA;AACRyK,iBAAWtJ,QAAQ,CAAC4G,eAAAA;AAClB,aAAKgC,YAAYtB,MAAMV,WAAU/G,EAAE,IAAI,CAAA;AACvC,aAAKgJ,YAAYjC,WAAU/G,EAAE,IAAI+G;MACnC,CAAA;IACF,CAAA;AACA,WAAO;EACT;;;;EAKA4C,gBAAgB3J,IAA0B;AACxChB,6BAAAA,WAAU,MAAA;AACR,aAAO,KAAKgK,YAAYhJ,EAAAA;IAC1B,CAAA;AACA,WAAO;EACT;EAEA4J,UAAU;AACR,SAAKb,YAAYrB,QAAQvH,QAAQ,CAAC0H,OAAOA,GAAAA,CAAAA;AACzC,SAAKoB,uBAAuB9I,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKyE,wBAAwBhJ,QAAQ,CAACuE,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKuE,uBAAuBY,MAAK;AACjC,SAAKV,wBAAwBU,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAEtL,OAAO,KAAK6K,OAAO/H,MAAMmC,WAAW,YAAYQ,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAKhC,SAAS1D,KAAKwB,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,KAAC+J,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAM7F,iBAAiB,MAAMF,QAAQzF,MAAM;SAAI0F;MAAM1F,KAAKwB;KAAG;AAC7D,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMhF,QAAQiB,OAAOkC,OAAO,KAAK0G,WAAW,EACzC5G,OAAO,CAAC2E,cAActD,cAAcsD,UAAUtD,YAAY,WAAS,EACnErB,OAAO,CAAC2E,cAAc,CAACA,UAAU3E,UAAU2E,UAAU3E,OAAO5D,IAAAA,CAAAA,EAC5DoK,QAAQ,CAAC7B,cAAAA;AACR,WAAKgC,YAAYf,mBAAmBjB,UAAU/G;AAC9C,WAAK+I,YAAYvB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKgB;AACzC,YAAMvE,SAASuC,UAAUG,YAAY;QAAE1I;MAAK,CAAA,KAAM,CAAA;AAClDmJ,sBAAgBI,oBAAoB5F;AACpC,aAAOqC;IACT,CAAA,EACCzC,IACC,CAACuF,SAAe;MACdtH,IAAIsH,IAAItH;MACRC,MAAMqH,IAAIrH;MACVC,WAAWoH,IAAIpH;MACfnC,MAAMuJ,IAAIvJ,QAAQ;MAClBC,YAAYsJ,IAAItJ,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMuL,QAAQtB,IAAI9I,MAAM4C,IAAI,CAACC,MAAM,KAAK8H,QAAQ;MAAEtL,MAAMwD;MAAGyB;MAAUQ;IAAQ,GAAG;SAAIC;MAAM1F,KAAKwB;KAAG,CAAA,CAAA;EACpG;EAEQJ,eAAe+C,QAAgB;AACrC,SAAKyG,aAAazG,MAAAA,IAAU,KAAKyG,aAAazG,MAAAA,SAAW2F,6BAAO,CAAC,CAAA;AACjE,SAAKW,uBAAuBgB,IAC1BtH,YACA4B,qBAAAA,QAAO,MAAA;AACL,YAAMkF,aAAarJ,OAAOkC,OAAO,KAAK0G,WAAW,EAAEpG,SAASsH,uBAAAA;AAC5D,iBAAW,EAAElK,IAAIiH,SAAQ,KAAMwC,YAAY;AACzC,YAAI,CAACxC,UAAU;AACb;QACF;AAEA,aAAK8B,YAAYf,mBAAmBhI;AACpC,aAAK+I,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC,YAAIvK;AACJ,YAAI;AACFA,iBAAOyI,SAAS;YAAEjH,IAAI2C;UAAO,CAAA;QAC/B,SAASwH,KAAK;AACZ5J,sBAAAA,IAAI6J,MAAMD,KAAK;YAAEpD,WAAW/G;UAAG,GAAA;;;;;;AAC/BO,sBAAAA,IAAIiJ,MAAM,yCAAyCxJ,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACE2H,0BAAgBI,oBAAoB5F;QACtC;AAEA,cAAMkB,UAAU,KAAK5D,aAAakD,MAAAA;AAClC,YAAInE,MAAM;AACR,eAAKC,MAAM6G,UAAU;YAAC9G;WAAK;AAC3B6E,mBAAS8B,KAAAA;AACT,cAAI,KAAKiE,aAAa5K,KAAKwB,EAAE,GAAG;AAC9B,iBAAKoJ,aAAa5K,KAAKwB,EAAE,EAAEuI,QAAQ,CAAC;UACtC;AACA;QACF,WAAW/J,SAAS,OAAO;AACzB,eAAKC,MAAMiH,aAAa;YAAC/C;WAAO;AAChCU,mBAAS8B,KAAAA;AACT;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEQtF,gBAAgBrB,MAAY6L,eAAyBC,WAAoB;AAC/E,SAAKlB,aAAa5K,KAAKwB,EAAE,IAAI,KAAKoJ,aAAa5K,KAAKwB,EAAE,SAAKsI,6BAAO,CAAC,CAAA;AACnE,QAAIiC,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKrB,wBAAwBc,IAC3BzL,KAAKwB,QACLuE,qBAAAA,QAAO,MAAA;AAGL,UAAI,CAACgG,SAAS,CAAC,KAAKpB,wBAAwBzG,IAAIlE,KAAKwB,EAAE,GAAG;AACxD;MACF;AACAuK,cAAQ;AAGRnK,aAAOC,KAAK,KAAK2I,WAAW;AAE5B,WAAKI,aAAa5K,KAAKwB,EAAE,EAAEuI;AAG3B,YAAMpJ,QAAwB,CAAA;AAC9B,YAAMsK,aAAarJ,OAAOkC,OAAO,KAAK0G,WAAW,EAAEpG,SAASsH,uBAAAA;AAC5D,iBAAW,EAAElK,IAAIkH,WAAW9E,QAAQnC,MAAMwD,WAAW,WAAU,KAAMgG,YAAY;AAC/E,YACE,CAACvC,aACDzD,aAAa4G,iBACZC,aAAarK,SAASqK,aACtBlI,UAAU,CAACA,OAAO5D,IAAAA,GACnB;AACA;QACF;AAEA,aAAKuK,YAAYf,mBAAmBhI;AACpC,aAAK+I,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC,YAAI;AACF5J,gBAAM+G,KAAI,GAAKgB,UAAU;YAAE1I;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAAS2L,KAAK;AACZ5J,sBAAAA,IAAI6J,MAAMD,KAAK;YAAEpD,WAAW/G;UAAG,GAAA;;;;;;AAC/BO,sBAAAA,IAAIiJ,MAAM,yCAAyCxJ,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACE2H,0BAAgBI,oBAAoB5F;QACtC;MACF;AAEA,YAAMwD,MAAMxG,MAAM4C,IAAI,CAACC,MAAMA,EAAEhC,EAAE;AACjC,YAAMyK,UAAUD,SAASpI,OAAO,CAACpC,OAAO,CAAC2F,IAAIzD,SAASlC,EAAAA,CAAAA;AACtDwK,iBAAW7E;AAGX,WAAKlH,MAAM2H,aACTqE,QAAQ1I,IAAI,CAACjB,YAAY;QAAED,QAAQrC,KAAKwB;QAAIc;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKrC,MAAM6G,UAAUnG,KAAAA;AACrB,WAAKV,MAAMsH,UACT5G,MAAM4C,IAAI,CAAC,EAAE/B,GAAE,MACbqK,kBAAkB,aAAa;QAAExJ,QAAQrC,KAAKwB;QAAIc,QAAQd;MAAG,IAAI;QAAEa,QAAQb;QAAIc,QAAQtC,KAAKwB;MAAG,CAAA,CAAA;AAGnG,WAAKvB,MAAMuC,WACTxC,KAAKwB,IACLqK,eACAlL,MAAM4C,IAAI,CAAC,EAAE/B,GAAE,MAAOA,EAAAA,CAAAA;AAExBb,YAAMgB,QAAQ,CAAC6B,MAAAA;AACb,YAAI,KAAKoH,aAAapH,EAAEhC,EAAE,GAAG;AAC3B,eAAKoJ,aAAapH,EAAEhC,EAAE,EAAEuI,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAczI,cAAc6C,QAAgB;AAC1C,SAAKsG,uBAAuBb,IAAIzF,MAAAA,IAAAA;AAChC,SAAKwG,wBAAwBf,IAAIzF,MAAAA,IAAAA;AACjC,SAAKsG,uBAAuByB,OAAO/H,MAAAA;AACnC,SAAKwG,wBAAwBuB,OAAO/H,MAAAA;EACtC;AACF;",
+  "names": ["import_signals_core", "import_async", "import_invariant", "import_live_object", "import_log", "import_util", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "Graph", "constructor", "nodes", "edges", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_constructNode", "create", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "_nodes", "id", "type", "cacheable", "forEach", "Object", "keys", "_addNode", "log", "warn", "_edges", "inbound", "outbound", "entries", "source", "target", "_addEdge", "_sortEdges", "from", "pickle", "options", "JSON", "parse", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "isNonNullable", "values", "pick", "Set", "fromEntries", "has", "nodeId", "toSorted", "a", "b", "localeCompare", "stringify", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "relation", "_getNodes", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "start", "found", "waitForPath", "params", "interval", "i", "setInterval", "wake", "finally", "clearInterval", "_addNodes", "batch", "_node", "subNode", "_removeNodes", "ids", "_removeNode", "_removeEdge", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "current", "unsorted", "sorted", "NODE_RESOLVER_TIMEOUT", "createExtension", "extension", "position", "resolver", "connector", "actionGroups", "rest", "getId", "arg", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "currentExtension", "all", "toSignal", "subscribe", "get", "thisSignal", "signal", "value", "flattenExtensions", "acc", "Array", "isArray", "flatMap", "ext", "GraphBuilder", "_dispatcher", "_extensions", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "initialize", "Promise", "error", "extensions", "addExtension", "removeExtension", "destroy", "clear", "explore", "isNode", "yieldOrContinue", "set", "byPosition", "err", "catch", "nodesRelation", "nodesType", "first", "previous", "removed", "delete"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytes":60445,"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"},"packages/sdk/app-graph/src/node.ts":{"bytes":5863,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":37311,"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":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":54354},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"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":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":13422},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":7612},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477}},"bytes":21985}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5819,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":63155,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":52330,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":61156},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","flattenExtensions","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":15399},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":11347}},"bytes":27687}}}