@dxos/app-graph 0.6.14-staging.e15392e → 0.7.1-staging.599df14

package/dist/lib/browser/index.mjs

@@ -3,6 +3,7 @@ import { batch, effect, untracked } from "@preact/signals-core";
 import { asyncTimeout, Trigger } from "@dxos/async";
 import { create } from "@dxos/echo-schema";
 import { invariant } from "@dxos/invariant";
+import { log } from "@dxos/log";
 import { nonNullable } from "@dxos/util";
 
 // packages/sdk/app-graph/src/node.ts
@@ -19,7 +20,7 @@ var getGraph = (node) => {
   const graph = node[graphSymbol];
   invariant(graph, "Node is not associated with a graph.", {
     F: __dxlog_file,
-    L: 20,
+    L: 21,
     S: void 0,
     A: [
       "graph",
@@ -33,8 +34,8 @@ var ROOT_TYPE = "dxos.org/type/GraphRoot";
 var ACTION_TYPE = "dxos.org/type/GraphAction";
 var ACTION_GROUP_TYPE = "dxos.org/type/GraphActionGroup";
 var DEFAULT_FILTER = (node) => untracked(() => !isActionLike(node));
-var Graph = class {
-  constructor({ onInitialNode, onInitialNodes, onRemoveNode } = {}) {
+var Graph = class _Graph {
+  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode } = {}) {
     this._waitingForNodes = {};
     this._initialized = {};
     /**
@@ -51,19 +52,60 @@ var Graph = class {
         [graphSymbol]: this
       });
     };
-    this._onInitialNode = onInitialNode;
-    this._onInitialNodes = onInitialNodes;
-    this._onRemoveNode = onRemoveNode;
     this._nodes[ROOT_ID] = this._constructNode({
       id: ROOT_ID,
       type: ROOT_TYPE,
       properties: {},
       data: null
     });
+    if (nodes) {
+      nodes.forEach((node) => {
+        if (node.type === ACTION_TYPE) {
+          this._addNode({
+            ...node,
+            data: () => log.warn("Pickled action invocation", void 0, {
+              F: __dxlog_file,
+              L: 103,
+              S: this,
+              C: (f, a) => f(...a)
+            })
+          });
+        } else if (node.type === ACTION_GROUP_TYPE) {
+          this._addNode({
+            ...node,
+            data: actionGroupSymbol
+          });
+        } else {
+          this._addNode(node);
+        }
+      });
+    }
     this._edges[ROOT_ID] = create({
       inbound: [],
       outbound: []
     });
+    if (edges) {
+      Object.entries(edges).forEach(([source, edges2]) => {
+        edges2.forEach((target) => {
+          this._addEdge({
+            source,
+            target
+          });
+        });
+        this._sortEdges(source, "outbound", edges2);
+      });
+    }
+    this._onInitialNode = onInitialNode;
+    this._onInitialNodes = onInitialNodes;
+    this._onRemoveNode = onRemoveNode;
+  }
+  static from(pickle, options = {}) {
+    const { nodes, edges } = JSON.parse(pickle);
+    return new _Graph({
+      nodes,
+      edges,
+      ...options
+    });
   }
   /**
   * Alias for `findNode('root')`.
@@ -98,7 +140,7 @@ var Graph = class {
     const root = this.findNode(id);
     invariant(root, `Node not found: ${id}`, {
       F: __dxlog_file,
-      L: 137,
+      L: 165,
       S: this,
       A: [
         "root",
@@ -107,6 +149,23 @@ var Graph = class {
     });
     return toJSON(root);
   }
+  pickle() {
+    const nodes = Object.values(this._nodes).map((node) => {
+      return {
+        id: node.id,
+        type: node.type,
+        properties: node.properties
+      };
+    });
+    const edges = Object.fromEntries(Object.entries(this._edges).map(([id, { outbound }]) => [
+      id,
+      outbound
+    ]).toSorted(([a], [b]) => a.localeCompare(b)));
+    return JSON.stringify({
+      nodes,
+      edges
+    });
+  }
   /**
   * Find the node with the given id in the graph.
   *
@@ -275,6 +334,25 @@ var Graph = class {
     return found;
   }
   /**
+  * Wait for the path between two nodes in the graph to be established.
+  */
+  async waitForPath(params, { timeout = 5e3, interval = 500 } = {}) {
+    const path = this.getPath(params);
+    if (path) {
+      return path;
+    }
+    const trigger = new Trigger();
+    const i = setInterval(() => {
+      const path2 = this.getPath(params);
+      if (path2) {
+        trigger.wake(path2);
+      }
+    }, interval);
+    return trigger.wait({
+      timeout
+    }).finally(() => clearInterval(i));
+  }
+  /**
   * Add nodes to the graph.
   *
   * @internal
@@ -482,7 +560,7 @@ var Graph = class {
 import { effect as effect2, signal } from "@preact/signals-core";
 import { create as create2 } from "@dxos/echo-schema";
 import { invariant as invariant2 } from "@dxos/invariant";
-import { log } from "@dxos/log";
+import { log as log2 } from "@dxos/log";
 import { isNode, nonNullable as nonNullable2 } from "@dxos/util";
 var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/sdk/app-graph/src/graph-builder.ts";
 var createExtension = (extension) => {
@@ -584,19 +662,37 @@ var toSignal = (subscribe, get, key) => {
   });
   return thisSignal.value;
 };
-var GraphBuilder = class {
-  constructor() {
+var GraphBuilder = class _GraphBuilder {
+  constructor(params = {}) {
     this._dispatcher = new Dispatcher();
     this._extensions = create2({});
     this._resolverSubscriptions = /* @__PURE__ */ new Map();
     this._connectorSubscriptions = /* @__PURE__ */ new Map();
     this._nodeChanged = {};
     this._graph = new Graph({
+      ...params,
       onInitialNode: (id) => this._onInitialNode(id),
       onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),
       onRemoveNode: (id) => this._onRemoveNode(id)
     });
   }
+  static from(pickle) {
+    if (!pickle) {
+      return new _GraphBuilder();
+    }
+    const { nodes, edges } = JSON.parse(pickle);
+    return new _GraphBuilder({
+      nodes,
+      edges
+    });
+  }
+  /**
+  * If graph is being restored from a pickle, the data will be null.
+  * Initialize the data of each node by calling resolvers.
+  */
+  async initialize() {
+    return Promise.all(Object.keys(this._graph._nodes).map((id) => this._onInitialNode(id)));
+  }
   get graph() {
     return this._graph;
   }
@@ -684,17 +780,17 @@ var GraphBuilder = class {
             id: nodeId
           });
         } catch (err) {
-          log.catch(err, {
+          log2.catch(err, {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 300,
+            L: 318,
             S: this,
             C: (f, a) => f(...a)
           });
-          log.error(`Previous error occurred in extension: ${id}`, void 0, {
+          log2.error(`Previous error occurred in extension: ${id}`, void 0, {
             F: __dxlog_file2,
-            L: 301,
+            L: 319,
             S: this,
             C: (f, a) => f(...a)
           });
@@ -737,17 +833,17 @@ var GraphBuilder = class {
             node
           }) ?? []);
         } catch (err) {
-          log.catch(err, {
+          log2.catch(err, {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 355,
+            L: 373,
             S: this,
             C: (f, a) => f(...a)
           });
-          log.error(`Previous error occurred in extension: ${id}`, void 0, {
+          log2.error(`Previous error occurred in extension: ${id}`, void 0, {
             F: __dxlog_file2,
-            L: 356,
+            L: 374,
             S: this,
             C: (f, a) => f(...a)
           });

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { type Relation, type Node, type NodeArg, type NodeFilter, isActionLike } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: DeepWriteable<T[K]> };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type NodesOptions<T = any, U extends Record<string, any> = Record<string, any>> = {\n  relation?: Relation;\n  filter?: NodeFilter<T, U>;\n  expansion?: boolean;\n  type?: string;\n};\n\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\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  private readonly _onInitialNode?: (id: string) => Promise<void>;\n  private readonly _onInitialNodes?: (node: Node, relation: Relation, type?: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => Promise<void>;\n\n  private readonly _waitingForNodes: Record<string, Trigger<Node>> = {};\n  private readonly _initialized: Record<string, boolean> = {};\n\n  /**\n   * @internal\n   */\n  readonly _nodes: Record<string, ReactiveObject<NodeInternal>> = {};\n\n  /**\n   * @internal\n   */\n  readonly _edges: Record<string, ReactiveObject<{ inbound: string[]; outbound: string[] }>> = {};\n\n  constructor({\n    onInitialNode,\n    onInitialNodes,\n    onRemoveNode,\n  }: {\n    onInitialNode?: Graph['_onInitialNode'];\n    onInitialNodes?: Graph['_onInitialNodes'];\n    onRemoveNode?: Graph['_onRemoveNode'];\n  } = {}) {\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n    this._nodes[ROOT_ID] = this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, properties: {}, data: null });\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\n  }\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = this.nodes(node);\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n        type: node.type,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   *\n   * If a node is not found within the graph and an `onInitialNode` callback is provided,\n   * it is called with the id and type of the node, potentially initializing the node.\n   */\n  findNode(id: string, expansion = true): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode && expansion) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = DEFAULT_FILTER, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => filter(n, node));\n  }\n\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(node: Node, { relation = 'outbound' }: { relation?: Relation } = {}) {\n    return this._edges[node.id]?.[relation] ?? [];\n  }\n\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(node: Node, { expansion }: { expansion?: boolean } = {}) {\n    return [\n      ...this._getNodes({ node, expansion, type: ACTION_GROUP_TYPE }),\n      ...this._getNodes({ node, expansion, type: ACTION_TYPE }),\n    ];\n  }\n\n  async expand(node: Node, relation: Relation = 'outbound', type?: string) {\n    const key = this._key(node, relation, type);\n    const initialized = this._initialized[key];\n    if (!initialized && this._onInitialNodes) {\n      await this._onInitialNodes(node, relation, type);\n      this._initialized[key] = true;\n    }\n  }\n\n  private _key(node: Node, relation: Relation, type?: string) {\n    return `${node.id}-${relation}-${type}`;\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    path: string[] = [],\n  ): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    const shouldContinue = visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this._getNodes({ node, relation, expansion })).forEach((child) =>\n      this.traverse({ node: child, relation, visitor, expansion }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph wrapping each visitor call in an effect.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  subscribeTraverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    currentPath: string[] = [],\n  ) {\n    return effect(() => {\n      const path = [...currentPath, node.id];\n      const result = visitor(node, path);\n      if (result === false) {\n        return;\n      }\n\n      const nodes = this._getNodes({ node, relation, expansion });\n      const nodeSubscriptions = nodes.map((n) => this.subscribeTraverse({ node: n, visitor, expansion }, path));\n\n      return () => {\n        nodeSubscriptions.forEach((unsubscribe) => unsubscribe());\n      };\n    });\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      visitor: (node, path) => {\n        if (found) {\n          return false;\n        }\n\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n\n  /**\n   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data, properties, type } = _node;\n        if (data && data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(nonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<Node<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Signal, effect, signal } from '@preact/signals-core';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { isNode, type MaybePromise, nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph } from './graph';\nimport { type Relation, type NodeArg, type Node, type ActionData, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(nonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = {\n  id: string;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n};\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _connectorSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private _graph: Graph;\n\n  constructor() {\n    this._graph = new Graph({\n      onInitialNode: (id) => this._onInitialNode(id),\n      onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    if (Array.isArray(extension)) {\n      extension.forEach((ext) => this.addExtension(ext));\n      return this;\n    }\n\n    this._dispatcher.state[extension.id] = [];\n    this._extensions[extension.id] = extension;\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    delete this._extensions[id];\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        for (const { id, resolver } of Object.values(this._extensions)) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          if (node) {\n            this.graph._addNodes([node]);\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private async _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        for (const { id, connector, filter, type, relation = 'outbound' } of Object.values(this._extensions)) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
-  "mappings": ";AAIA,SAASA,OAAOC,QAAQC,iBAAiB;AAEzC,SAASC,cAAcC,eAAe;AACtC,SAA8BC,cAAc;AAC5C,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;;ACiCrB,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;;;;ADhF7G,IAAMO,cAAcC,OAAO,OAAA;AAIpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCK,YAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,SAAeQ,UAAU,MAAM,CAACC,aAAaT,IAAAA,CAAAA;AAiC9D,IAAMU,QAAN,MAAMA;EAkBXC,YAAY,EACVC,eACAC,gBACAC,aAAY,IAKV,CAAC,GAAG;AArBSC,4BAAkD,CAAC;AACnDC,wBAAwC,CAAC;AAKjDC;;;kBAAuD,CAAC;AAKxDC;;;kBAAoF,CAAC;AA2ZtFC,0BAAiB,CAACnB,SAAAA;AACxB,aAAOoB,OAAqB;QAAE,GAAGpB;QAAM,CAACH,WAAAA,GAAc;MAAK,CAAA;IAC7D;AAlZE,SAAKwB,iBAAiBT;AACtB,SAAKU,kBAAkBT;AACvB,SAAKU,gBAAgBT;AACrB,SAAKG,OAAOd,OAAAA,IAAW,KAAKgB,eAAe;MAAEK,IAAIrB;MAASsB,MAAMrB;MAAWsB,YAAY,CAAC;MAAGC,MAAM;IAAK,CAAA;AACtG,SAAKT,OAAOf,OAAAA,IAAWiB,OAAO;MAAEQ,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;EAC5D;;;;EAKA,IAAIC,OAAO;AACT,WAAO,KAAKC,SAAS5B,OAAAA;EACvB;;;;EAKA6B,OAAO,EAAER,KAAKrB,SAAS8B,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAChC,MAAYkC,OAAiB,CAAA,MAAE;AAC7C,YAAMC,QAAQ,KAAKA,MAAMnC,IAAAA;AACzB,YAAMoC,MAA2B;QAC/BZ,IAAIxB,KAAKwB,GAAGa,SAASJ,YAAY,GAAGjC,KAAKwB,GAAGc,MAAM,GAAGL,YAAY,CAAA,CAAA,QAAUjC,KAAKwB;QAChFC,MAAMzB,KAAKyB;MACb;AACA,UAAIzB,KAAK0B,WAAWa,OAAO;AACzBH,YAAIG,QAAQvC,KAAK0B,WAAWa;MAC9B;AACA,UAAIJ,MAAME,QAAQ;AAChBD,YAAID,QAAQA,MACTK,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIR;YAAMlC,KAAKwB;;AAChC,iBAAOkB,SAASC,SAASF,EAAEjB,EAAE,IAAIoB,SAAYZ,OAAOS,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,WAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAMN,OAAO,KAAKC,SAASP,EAAAA;AAC3BtB,cAAU4B,MAAM,mBAAmBN,EAAAA,IAAI;;;;;;;;;AACvC,WAAOQ,OAAOF,IAAAA;EAChB;;;;;;;EAQAC,SAASP,IAAYuB,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAK/B,OAAOO,EAAAA;AACjC,QAAI,CAACwB,gBAAgBD,WAAW;AAC9B,WAAK,KAAK1B,iBAAiBG,EAAAA;IAC7B;AAEA,WAAOwB;EACT;;;;;;;;;EAUA,MAAMC,YAAYzB,IAAY0B,SAAiC;AAC7D,UAAMC,UAAU,KAAKpC,iBAAiBS,EAAAA,MAAQ,KAAKT,iBAAiBS,EAAAA,IAAM,IAAI4B,QAAAA;AAC9E,UAAMpD,OAAO,KAAK+B,SAASP,EAAAA;AAC3B,QAAIxB,MAAM;AACR,aAAO,KAAKe,iBAAiBS,EAAAA;AAC7B,aAAOxB;IACT;AAEA,QAAIkD,YAAYN,QAAW;AACzB,aAAOO,QAAQE,KAAI;IACrB,OAAO;AACL,aAAOC,aAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmB1B,EAAAA,EAAI;IACtE;EACF;;;;EAKAW,MAAoEnC,MAAYuD,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEC,UAAUT,WAAWF,SAAStC,gBAAgBkB,KAAI,IAAK8B;AAC/D,UAAMpB,QAAQ,KAAKsB,UAAU;MAAEzD;MAAMwD;MAAUT;MAAWtB;IAAK,CAAA;AAC/D,WAAOU,MAAMU,OAAO,CAACJ,MAAMI,OAAOJ,GAAGzC,IAAAA,CAAAA;EACvC;;;;EAKA0D,MAAM1D,MAAY,EAAEwD,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKtC,OAAOlB,KAAKwB,EAAE,IAAIgC,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAG,QAAQ3D,MAAY,EAAE+C,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKU,UAAU;QAAEzD;QAAM+C;QAAWtB,MAAMnB;MAAkB,CAAA;SAC1D,KAAKmD,UAAU;QAAEzD;QAAM+C;QAAWtB,MAAMpB;MAAY,CAAA;;EAE3D;EAEA,MAAMuD,OAAO5D,MAAYwD,WAAqB,YAAY/B,MAAe;AACvE,UAAMoC,MAAM,KAAKC,KAAK9D,MAAMwD,UAAU/B,IAAAA;AACtC,UAAMsC,cAAc,KAAK/C,aAAa6C,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAKzC,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBtB,MAAMwD,UAAU/B,IAAAA;AAC3C,WAAKT,aAAa6C,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAK9D,MAAYwD,UAAoB/B,MAAe;AAC1D,WAAO,GAAGzB,KAAKwB,EAAE,IAAIgC,QAAAA,IAAY/B,IAAAA;EACnC;;;;;;;;EASAuC,SACE,EAAEC,SAASjE,OAAO,KAAK8B,MAAM0B,WAAW,YAAYT,UAAS,GAC7DmB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAKvB,SAAS3C,KAAKwB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAM2C,iBAAiBF,QAAQjE,MAAM;SAAIkE;MAAMlE,KAAKwB;KAAG;AACvD,QAAI2C,mBAAmB,OAAO;AAC5B;IACF;AAEAC,WAAOC,OAAO,KAAKZ,UAAU;MAAEzD;MAAMwD;MAAUT;IAAU,CAAA,CAAA,EAAIuB,QAAQ,CAACC,UACpE,KAAKP,SAAS;MAAEhE,MAAMuE;MAAOf;MAAUS;MAASlB;IAAU,GAAG;SAAImB;MAAMlE,KAAKwB;KAAG,CAAA;EAEnF;;;;;;;;EASAgD,kBACE,EAAEP,SAASjE,OAAO,KAAK8B,MAAM0B,WAAW,YAAYT,UAAS,GAC7D0B,cAAwB,CAAA,GACxB;AACA,WAAOC,OAAO,MAAA;AACZ,YAAMR,OAAO;WAAIO;QAAazE,KAAKwB;;AACnC,YAAMmD,SAASV,QAAQjE,MAAMkE,IAAAA;AAC7B,UAAIS,WAAW,OAAO;AACpB;MACF;AAEA,YAAMxC,QAAQ,KAAKsB,UAAU;QAAEzD;QAAMwD;QAAUT;MAAU,CAAA;AACzD,YAAM6B,oBAAoBzC,MAAMK,IAAI,CAACC,MAAM,KAAK+B,kBAAkB;QAAExE,MAAMyC;QAAGwB;QAASlB;MAAU,GAAGmB,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLU,0BAAkBN,QAAQ,CAACO,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAEC,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMC,QAAQ,KAAKlD,SAASgD,MAAAA;AAC5B,QAAI,CAACE,OAAO;AACV,aAAOrC;IACT;AAEA,QAAIsC;AACJ,SAAKlB,SAAS;MACZhE,MAAMiF;MACNhB,SAAS,CAACjE,MAAMkE,SAAAA;AACd,YAAIgB,OAAO;AACT,iBAAO;QACT;AAEA,YAAIlF,KAAKwB,OAAOwD,QAAQ;AACtBE,kBAAQhB;QACV;MACF;IACF,CAAA;AAEA,WAAOgB;EACT;;;;;;EAOAC,UACEhD,OAC4B;AAC5B,WAAOiD,MAAM,MAAMjD,MAAMK,IAAI,CAACxC,SAAS,KAAKqF,SAASrF,IAAAA,CAAAA,CAAAA;EACvD;EAEQqF,SAA+E,EACrFlD,OACAuB,OACA,GAAG4B,MAAAA,GACqD;AACxD,WAAO9E,UAAU,MAAA;AACf,YAAMwC,eAAe,KAAK/B,OAAOqE,MAAM9D,EAAE;AACzC,YAAMxB,OAAOgD,gBAAgB,KAAK7B,eAAe;QAAEQ,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAG4D;MAAM,CAAA;AACxF,UAAItC,cAAc;AAChB,cAAM,EAAErB,MAAMD,YAAYD,KAAI,IAAK6D;AACnC,YAAI3D,QAAQA,SAAS3B,KAAK2B,MAAM;AAC9B3B,eAAK2B,OAAOA;QACd;AAEA,YAAIF,SAASzB,KAAKyB,MAAM;AACtBzB,eAAKyB,OAAOA;QACd;AAEA,mBAAWoC,OAAOnC,YAAY;AAC5B,cAAIA,WAAWmC,GAAAA,MAAS7D,KAAK0B,WAAWmC,GAAAA,GAAM;AAC5C7D,iBAAK0B,WAAWmC,GAAAA,IAAOnC,WAAWmC,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK5C,OAAOjB,KAAKwB,EAAE,IAAIxB;AACvB,aAAKkB,OAAOlB,KAAKwB,EAAE,IAAIJ,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAMsB,UAAU,KAAKpC,iBAAiBf,KAAKwB,EAAE;AAC7C,UAAI2B,SAAS;AACXA,gBAAQoC,KAAKvF,IAAAA;AACb,eAAO,KAAKe,iBAAiBf,KAAKwB,EAAE;MACtC;AAEA,UAAIW,OAAO;AACTA,cAAMmC,QAAQ,CAACkB,YAAAA;AACb,eAAKH,SAASG,OAAAA;AACd,eAAKC,SAAS;YAAEV,QAAQ/E,KAAKwB;YAAIwD,QAAQQ,QAAQhE;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIkC,OAAO;AACTA,cAAMY,QAAQ,CAAC,CAAC9C,IAAIgC,QAAAA,MAClBA,aAAa,aACT,KAAKiC,SAAS;UAAEV,QAAQ/E,KAAKwB;UAAIwD,QAAQxD;QAAG,CAAA,IAC5C,KAAKiE,SAAS;UAAEV,QAAQvD;UAAIwD,QAAQhF,KAAKwB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOxB;IACT,CAAA;EACF;;;;;;;;EASA0F,aAAaC,KAAejC,QAAQ,OAAO;AACzC0B,UAAM,MAAMO,IAAIrB,QAAQ,CAAC9C,OAAO,KAAKoE,YAAYpE,IAAIkC,KAAAA,CAAAA,CAAAA;EACvD;EAEQkC,YAAYpE,IAAYkC,QAAQ,OAAO;AAC7ClD,cAAU,MAAA;AACR,YAAMR,OAAO,KAAK+B,SAASP,EAAAA;AAC3B,UAAI,CAACxB,MAAM;AACT;MACF;AAEA,UAAI0D,OAAO;AAET,aAAKD,UAAU;UAAEzD;QAAK,CAAA,EAAGsE,QAAQ,CAACtE,UAAAA;AAChC,eAAK6F,YAAY;YAAEd,QAAQvD;YAAIwD,QAAQhF,MAAKwB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKiC,UAAU;UAAEzD;UAAMwD,UAAU;QAAU,CAAA,EAAGc,QAAQ,CAACtE,UAAAA;AACrD,eAAK6F,YAAY;YAAEd,QAAQ/E,MAAKwB;YAAIwD,QAAQxD;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKN,OAAOM,EAAAA;MACrB;AAGA,aAAO,KAAKP,OAAOO,EAAAA;AACnB4C,aAAO0B,KAAK,KAAK9E,YAAY,EAC1B6B,OAAO,CAACgB,QAAQA,IAAIkC,WAAWvE,EAAAA,CAAAA,EAC/B8C,QAAQ,CAACT,QAAAA;AACR,eAAO,KAAK7C,aAAa6C,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAKtC,gBAAgBC,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOAwE,UAAUtC,OAA6C;AACrD0B,UAAM,MAAM1B,MAAMY,QAAQ,CAAC2B,SAAS,KAAKR,SAASQ,IAAAA,CAAAA,CAAAA;EACpD;EAEQR,SAAS,EAAEV,QAAQC,OAAM,GAAwC;AACvExE,cAAU,MAAA;AACR,UAAI,CAAC,KAAKU,OAAO6D,MAAAA,GAAS;AACxB,aAAK7D,OAAO6D,MAAAA,IAAU3D,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKX,OAAO8D,MAAAA,GAAS;AACxB,aAAK9D,OAAO8D,MAAAA,IAAU5D,OAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMqE,cAAc,KAAKhF,OAAO6D,MAAAA;AAChC,UAAI,CAACmB,YAAYrE,SAASc,SAASqC,MAAAA,GAAS;AAC1CkB,oBAAYrE,SAASsE,KAAKnB,MAAAA;MAC5B;AAEA,YAAMoB,cAAc,KAAKlF,OAAO8D,MAAAA;AAChC,UAAI,CAACoB,YAAYxE,QAAQe,SAASoC,MAAAA,GAAS;AACzCqB,oBAAYxE,QAAQuE,KAAKpB,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAsB,aAAa3C,OAA6C4C,gBAAgB,OAAO;AAC/ElB,UAAM,MAAM1B,MAAMY,QAAQ,CAAC2B,SAAS,KAAKJ,YAAYI,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQT,YAAY,EAAEd,QAAQC,OAAM,GAAwCsB,gBAAgB,OAAO;AACjG9F,cAAU,MAAA;AACR4E,YAAM,MAAA;AACJ,cAAMmB,gBAAgB,KAAKrF,OAAO6D,MAAAA,GAASlD,SAAS2E,UAAU,CAAChF,OAAOA,OAAOwD,MAAAA;AAC7E,YAAIuB,kBAAkB3D,UAAa2D,kBAAkB,IAAI;AACvD,eAAKrF,OAAO6D,MAAAA,EAAQlD,SAAS4E,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAKxF,OAAO8D,MAAAA,GAASpD,QAAQ4E,UAAU,CAAChF,OAAOA,OAAOuD,MAAAA;AAC3E,YAAI2B,iBAAiB9D,UAAa8D,iBAAiB,IAAI;AACrD,eAAKxF,OAAO8D,MAAAA,EAAQpD,QAAQ6E,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAKpF,OAAO6D,MAAAA,GAASlD,SAASQ,WAAW,KACzC,KAAKnB,OAAO6D,MAAAA,GAASnD,QAAQS,WAAW,KACxC0C,WAAW5E,SACX;AACA,iBAAKyF,YAAYb,QAAQ,IAAA;UAC3B;AACA,cACE,KAAK7D,OAAO8D,MAAAA,GAASnD,SAASQ,WAAW,KACzC,KAAKnB,OAAO8D,MAAAA,GAASpD,QAAQS,WAAW,KACxC2C,WAAW7E,SACX;AACA,iBAAKyF,YAAYZ,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYA2B,WAAWC,QAAgBpD,UAAoBE,OAAiB;AAC9DlD,cAAU,MAAA;AACR4E,YAAM,MAAA;AACJ,cAAMyB,UAAU,KAAK3F,OAAO0F,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQrD,QAAAA,EAAUX,OAAO,CAACrB,OAAO,CAACkC,MAAMf,SAASnB,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAMuF,SAASrD,MAAMb,OAAO,CAACrB,OAAOqF,QAAQrD,QAAAA,EAAUb,SAASnB,EAAAA,CAAAA,KAAQ,CAAA;AACvEqF,kBAAQrD,QAAAA,EAAUiD,OAAO,GAAGI,QAAQrD,QAAAA,EAAUnB,QAAM,GAAK;eAAI0E;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQrD,UAAU,EAChBzD,MACAwD,WAAW,YACX/B,MACAsB,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKa,OAAO5D,MAAMwD,UAAU/B,IAAAA;IACnC;AAEA,UAAMiC,QAAQ,KAAKxC,OAAOlB,KAAKwB,EAAE;AACjC,QAAI,CAACkC,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAMF,QAAAA,EACVhB,IAAI,CAAChB,OAAO,KAAKP,OAAOO,EAAAA,CAAG,EAC3BqB,OAAOC,WAAAA,EACPD,OAAO,CAACJ,MAAM,CAAChB,QAAQgB,EAAEhB,SAASA,IAAAA;IACvC;EACF;AACF;;;AEzgBA,SAAsBuF,UAAAA,SAAQC,cAAc;AAG5C,SAASC,UAAAA,eAAc;AACvB,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,WAAW;AACpB,SAASC,QAA2BC,eAAAA,oBAAmB;;AA8DhD,IAAMC,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAEC,IAAIC,UAAUC,WAAWC,SAASC,cAAc,GAAGC,KAAAA,IAASN;AACpE,QAAMO,QAAQ,CAACC,QAAgB,GAAGP,EAAAA,IAAMO,GAAAA;AACxC,SAAO;IACLN,WAAW;MAAED,IAAIM,MAAM,UAAA;MAAaL;IAAS,IAAIO;IACjDN,YAAY;MAAE,GAAGG;MAAML,IAAIM,MAAM,WAAA;MAAcJ;IAAU,IAAIM;IAC7DJ,eACK;MACC,GAAGC;MACHL,IAAIM,MAAM,cAAA;MACVG,MAAMC;MACNC,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAChBR,aAAa;QAAEQ;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKC,MAAMC;QAAmBP,MAAMC;MAAkB,EAAA;IACrG,IACAF;IACJL,UACK;MACC,GAAGE;MACHL,IAAIM,MAAM,SAAA;MACVG,MAAMQ;MACNN,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAAOT,QAAQ;QAAES;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKL,MAAMQ;MAAY,EAAA;IACxF,IACAT;IACJU,OAAOC,YAAAA;AACX;AAWA,IAAMC,aAAN,MAAMA;EAAN;AAEEC,sBAAa;AACbC,iBAA+B,CAAC;AAChCC,mBAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAanB,MAAM,aAAQ;AACpD,QAAMoB,aAAaH,gBAAgBI;AACnCC,EAAAA,WAAUF,YAAYG,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMJ,WAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMW,UAAUD,IAAIxB,GAAAA;AACpB,QAAM0B,SAASD,UAAUA,QAAQC,SAASP,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,IAAI;IAAE,GAAGU;IAAK,CAACxB,GAAAA,GAAM;MAAE0B;IAAO;EAAE;AACnGN,aAAWN;AACX,SAAOY;AACT;AAKO,IAAMV,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCC,IAAAA,WAAUF,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQW,KAAKR,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMS,WAAW,CACtBC,WACAC,KACA9B,QAAAA;AAEA,QAAM+B,aAAab,QAAQ,MAAA;AACzB,WAAOc,OAAOF,IAAAA,CAAAA;EAChB,GAAG9B,GAAAA;AACH,QAAMiC,cAAcf,QAAQ,MAAA;AAC1B,WAAOW,UAAU,MAAOE,WAAWG,QAAQJ,IAAAA,CAAAA;EAC7C,GAAG9B,GAAAA;AACHgB,UAAQ,MAAA;AACNiB,gBAAAA;EACF,CAAA;AACA,SAAOF,WAAWG;AACpB;AAoBO,IAAMC,eAAN,MAAMA;EAQXC,cAAc;AAPGC,uBAAc,IAAIxB,WAAAA;AAClByB,uBAAcC,QAAyC,CAAC,CAAA;AACxDC,kCAAyB,oBAAIC,IAAAA;AAC7BC,mCAA0B,oBAAID,IAAAA;AAC9BE,wBAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIC,MAAM;MACtBC,eAAe,CAACrD,OAAO,KAAKsD,eAAetD,EAAAA;MAC3CuD,gBAAgB,CAAC3C,MAAMD,UAAUF,SAAS,KAAK+C,gBAAgB5C,MAAMD,UAAUF,IAAAA;MAC/EgD,cAAc,CAACzD,OAAO,KAAK0D,cAAc1D,EAAAA;IAC3C,CAAA;EACF;EAEA,IAAI2D,QAAQ;AACV,WAAO,KAAKR;EACd;;;;EAKAS,aAAa7D,WAAuC;AAClD,QAAI8D,MAAMC,QAAQ/D,SAAAA,GAAY;AAC5BA,gBAAUgE,QAAQ,CAACC,QAAQ,KAAKJ,aAAaI,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKpB,YAAYtB,MAAMvB,UAAUC,EAAE,IAAI,CAAA;AACvC,SAAK6C,YAAY9C,UAAUC,EAAE,IAAID;AACjC,WAAO;EACT;;;;EAKAkE,gBAAgBjE,IAA0B;AACxC,WAAO,KAAK6C,YAAY7C,EAAAA;AACxB,WAAO;EACT;EAEAkE,UAAU;AACR,SAAKtB,YAAYrB,QAAQwC,QAAQ,CAACrC,OAAOA,GAAAA,CAAAA;AACzC,SAAKqB,uBAAuBgB,QAAQ,CAACvB,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKS,wBAAwBc,QAAQ,CAACvB,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKO,uBAAuBoB,MAAK;AACjC,SAAKlB,wBAAwBkB,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAExD,OAAO,KAAKuC,OAAOkB,MAAM1D,WAAW,YAAY2D,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAKC,SAAS5D,KAAKZ,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,CAACyE,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMC,iBAAiB,MAAML,QAAQ1D,MAAM;SAAI2D;MAAM3D,KAAKZ;KAAG;AAC7D,QAAI2E,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMC,QAAQC,OAAOC,OAAO,KAAKjC,WAAW,EACzC3B,OAAO,CAACnB,cAAcY,cAAcZ,UAAUY,YAAY,WAAS,EACnEO,OAAO,CAACnB,cAAc,CAACA,UAAUmB,UAAUnB,UAAUmB,OAAON,IAAAA,CAAAA,EAC5DmE,QAAQ,CAAChF,cAAAA;AACR,WAAK6C,YAAYd,mBAAmB/B,UAAUC;AAC9C,WAAK4C,YAAYvB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKgB;AACzC,YAAMX,SAASlC,UAAUG,YAAY;QAAEU;MAAK,CAAA,KAAM,CAAA;AAClDY,sBAAgBI,oBAAoBpB;AACpC,aAAOyB;IACT,CAAA,EACCpB,IACC,CAACC,SAAe;MACdd,IAAIc,IAAId;MACRS,MAAMK,IAAIL;MACVM,MAAMD,IAAIC,QAAQ;MAClBiE,YAAYlE,IAAIkE,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMC,QAAQlD,IAAI6C,MAAM/D,IAAI,CAACqE,MAAM,KAAKd,QAAQ;MAAExD,MAAMsE;MAAGvE;MAAU2D;IAAQ,GAAG;SAAIC;MAAM3D,KAAKZ;KAAG,CAAA,CAAA;EACpG;EAEA,MAAcsD,eAAe6B,QAAgB;AAC3C,SAAKjC,aAAaiC,MAAAA,IAAU,KAAKjC,aAAaiC,MAAAA,KAAW5C,OAAO,CAAC,CAAA;AACjE,SAAKQ,uBAAuBqC,IAC1BD,QACAE,QAAO,MAAA;AACL,iBAAW,EAAErF,IAAIC,SAAQ,KAAM4E,OAAOC,OAAO,KAAKjC,WAAW,GAAG;AAC9D,YAAI,CAAC5C,UAAU;AACb;QACF;AAEA,aAAK2C,YAAYd,mBAAmB9B;AACpC,aAAK4C,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC,YAAIhC;AACJ,YAAI;AACFA,iBAAOX,SAAS;YAAED,IAAImF;UAAO,CAAA;QAC/B,SAASG,KAAK;AACZC,cAAIC,MAAMF,KAAK;YAAEvF,WAAWC;UAAG,GAAA;;;;;;AAC/BuF,cAAIE,MAAM,yCAAyCzF,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwB,0BAAgBI,oBAAoBpB;QACtC;AAEA,YAAII,MAAM;AACR,eAAK+C,MAAM+B,UAAU;YAAC9E;WAAK;AAC3B,cAAI,KAAKsC,aAAatC,KAAKZ,EAAE,GAAG;AAC9B,iBAAKkD,aAAatC,KAAKZ,EAAE,EAAEyC,QAAQ,CAAC;UACtC;AACA;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAce,gBAAgB5C,MAAY+E,eAAyBC,WAAoB;AACrF,SAAK1C,aAAatC,KAAKZ,EAAE,IAAI,KAAKkD,aAAatC,KAAKZ,EAAE,KAAKuC,OAAO,CAAC,CAAA;AACnE,QAAIsD,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAK7C,wBAAwBmC,IAC3BxE,KAAKZ,IACLqF,QAAO,MAAA;AAGL,UAAI,CAACQ,SAAS,CAAC,KAAK5C,wBAAwB8C,IAAInF,KAAKZ,EAAE,GAAG;AACxD;MACF;AACA6F,cAAQ;AAGRhB,aAAOmB,KAAK,KAAKnD,WAAW;AAE5B,WAAKK,aAAatC,KAAKZ,EAAE,EAAEyC;AAG3B,YAAMmC,QAAwB,CAAA;AAC9B,iBAAW,EAAE5E,IAAIE,WAAWgB,QAAQT,MAAME,WAAW,WAAU,KAAMkE,OAAOC,OAAO,KAAKjC,WAAW,GAAG;AACpG,YACE,CAAC3C,aACDS,aAAagF,iBACZC,aAAanF,SAASmF,aACtB1E,UAAU,CAACA,OAAON,IAAAA,GACnB;AACA;QACF;AAEA,aAAKgC,YAAYd,mBAAmB9B;AACpC,aAAK4C,YAAYvB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKgB;AACzC,YAAI;AACFgC,gBAAM1C,KAAI,GAAKhC,UAAU;YAAEU;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAAS0E,KAAK;AACZC,cAAIC,MAAMF,KAAK;YAAEvF,WAAWC;UAAG,GAAA;;;;;;AAC/BuF,cAAIE,MAAM,yCAAyCzF,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwB,0BAAgBI,oBAAoBpB;QACtC;MACF;AAEA,YAAMyF,MAAMrB,MAAM/D,IAAI,CAACqE,MAAMA,EAAElF,EAAE;AACjC,YAAMkG,UAAUJ,SAAS5E,OAAO,CAAClB,OAAO,CAACiG,IAAIzB,SAASxE,EAAAA,CAAAA;AACtD8F,iBAAWG;AAGX,WAAKtC,MAAMwC,aACTD,QAAQrF,IAAI,CAACuF,YAAY;QAAEC,QAAQzF,KAAKZ;QAAIoG;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKzC,MAAM+B,UAAUd,KAAAA;AACrB,WAAKjB,MAAM2C,UACT1B,MAAM/D,IAAI,CAAC,EAAEb,GAAE,MACb2F,kBAAkB,aAAa;QAAEU,QAAQzF,KAAKZ;QAAIoG,QAAQpG;MAAG,IAAI;QAAEqG,QAAQrG;QAAIoG,QAAQxF,KAAKZ;MAAG,CAAA,CAAA;AAGnG,WAAK2D,MAAM4C,WACT3F,KAAKZ,IACL2F,eACAf,MAAM/D,IAAI,CAAC,EAAEb,GAAE,MAAOA,EAAAA,CAAAA;AAExB4E,YAAMb,QAAQ,CAACmB,MAAAA;AACb,YAAI,KAAKhC,aAAagC,EAAElF,EAAE,GAAG;AAC3B,eAAKkD,aAAagC,EAAElF,EAAE,EAAEyC,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAciB,cAAcyB,QAAgB;AAC1C,SAAKpC,uBAAuBV,IAAI8C,MAAAA,IAAAA;AAChC,SAAKlC,wBAAwBZ,IAAI8C,MAAAA,IAAAA;AACjC,SAAKpC,uBAAuByD,OAAOrB,MAAAA;AACnC,SAAKlC,wBAAwBuD,OAAOrB,MAAAA;EACtC;AACF;",
-  "names": ["batch", "effect", "untracked", "asyncTimeout", "Trigger", "create", "invariant", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "Symbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "isActionLike", "Graph", "constructor", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_nodes", "_edges", "_constructNode", "create", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "id", "type", "properties", "data", "inbound", "outbound", "root", "findNode", "toJSON", "maxLength", "seen", "nodes", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "options", "relation", "_getNodes", "edges", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "Object", "values", "forEach", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "source", "target", "start", "found", "_addNodes", "batch", "_addNode", "_node", "wake", "subNode", "_addEdge", "_removeNodes", "ids", "_removeNode", "_removeEdge", "keys", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "_sortEdges", "nodeId", "current", "unsorted", "sorted", "effect", "signal", "create", "invariant", "log", "isNode", "nonNullable", "createExtension", "extension", "id", "resolver", "connector", "actions", "actionGroups", "rest", "getId", "key", "undefined", "type", "ACTION_GROUP_TYPE", "relation", "node", "map", "arg", "data", "actionGroupSymbol", "ACTION_TYPE", "filter", "nonNullable", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "invariant", "currentExtension", "all", "current", "result", "push", "toSignal", "subscribe", "get", "thisSignal", "signal", "unsubscribe", "value", "GraphBuilder", "constructor", "_dispatcher", "_extensions", "create", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "Graph", "onInitialNode", "_onInitialNode", "onInitialNodes", "_onInitialNodes", "onRemoveNode", "_onRemoveNode", "graph", "addExtension", "Array", "isArray", "forEach", "ext", "removeExtension", "destroy", "clear", "explore", "root", "visitor", "path", "includes", "isNode", "yieldOrContinue", "shouldContinue", "nodes", "Object", "values", "flatMap", "properties", "Promise", "n", "nodeId", "set", "effect", "err", "log", "catch", "error", "_addNodes", "nodesRelation", "nodesType", "first", "previous", "has", "keys", "ids", "removed", "_removeEdges", "target", "source", "_addEdges", "_sortEdges", "delete"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { nonNullable } from '@dxos/util';\n\nimport { type Relation, type Node, type NodeArg, type NodeFilter, isActionLike, actionGroupSymbol } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: DeepWriteable<T[K]> };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type NodesOptions<T = any, U extends Record<string, any> = Record<string, any>> = {\n  relation?: Relation;\n  filter?: NodeFilter<T, U>;\n  expansion?: boolean;\n  type?: string;\n};\n\n// TODO(wittjosiah): Consider having default be undefined. This is current default for backwards compatibility.\nconst DEFAULT_FILTER = (node: Node) => untracked(() => !isActionLike(node));\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n\n  /**\n   * Allow traversal to trigger expansion of the graph via `onInitialNodes`.\n   */\n  expansion?: boolean;\n};\n\nexport type GraphParams = {\n  // TODO(wittjosiah): Make data optional instead of omitting.\n  nodes?: Omit<Node, 'data'>[];\n  edges?: Record<string, string[]>;\n  onInitialNode?: Graph['_onInitialNode'];\n  onInitialNodes?: Graph['_onInitialNodes'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  private readonly _onInitialNode?: (id: string) => Promise<void>;\n  private readonly _onInitialNodes?: (node: Node, relation: Relation, type?: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => Promise<void>;\n\n  private readonly _waitingForNodes: Record<string, Trigger<Node>> = {};\n  private readonly _initialized: Record<string, boolean> = {};\n\n  /**\n   * @internal\n   */\n  readonly _nodes: Record<string, ReactiveObject<NodeInternal>> = {};\n\n  /**\n   * @internal\n   */\n  readonly _edges: Record<string, ReactiveObject<{ inbound: string[]; outbound: string[] }>> = {};\n\n  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode }: GraphParams = {}) {\n    this._nodes[ROOT_ID] = this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, properties: {}, data: null });\n    if (nodes) {\n      nodes.forEach((node) => {\n        if (node.type === ACTION_TYPE) {\n          this._addNode({ ...node, data: () => log.warn('Pickled action invocation') });\n        } else if (node.type === ACTION_GROUP_TYPE) {\n          this._addNode({ ...node, data: actionGroupSymbol });\n        } else {\n          this._addNode(node);\n        }\n      });\n    }\n\n    this._edges[ROOT_ID] = create({ inbound: [], outbound: [] });\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        edges.forEach((target) => {\n          this._addEdge({ source, target });\n        });\n        this._sortEdges(source, 'outbound', edges);\n      });\n    }\n\n    this._onInitialNode = onInitialNode;\n    this._onInitialNodes = onInitialNodes;\n    this._onRemoveNode = onRemoveNode;\n  }\n\n  static from(pickle: string, options: Omit<GraphParams, 'nodes' | 'edges'> = {}) {\n    const { nodes, edges } = JSON.parse(pickle);\n    return new Graph({ nodes, edges, ...options });\n  }\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = this.nodes(node);\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n        type: node.type,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  pickle() {\n    const nodes = Object.values(this._nodes).map((node) => {\n      return {\n        id: node.id,\n        type: node.type,\n        properties: node.properties,\n      };\n    });\n\n    const edges = Object.fromEntries(\n      Object.entries(this._edges)\n        .map(([id, { outbound }]): [string, string[]] => [id, outbound])\n        .toSorted(([a], [b]) => a.localeCompare(b)),\n    );\n\n    return JSON.stringify({ nodes, edges });\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   *\n   * If a node is not found within the graph and an `onInitialNode` callback is provided,\n   * it is called with the id and type of the node, potentially initializing the node.\n   */\n  findNode(id: string, expansion = true): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode && expansion) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = DEFAULT_FILTER, type } = options;\n    const nodes = this._getNodes({ node, relation, expansion, type });\n    return nodes.filter((n) => filter(n, node));\n  }\n\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(node: Node, { relation = 'outbound' }: { relation?: Relation } = {}) {\n    return this._edges[node.id]?.[relation] ?? [];\n  }\n\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(node: Node, { expansion }: { expansion?: boolean } = {}) {\n    return [\n      ...this._getNodes({ node, expansion, type: ACTION_GROUP_TYPE }),\n      ...this._getNodes({ node, expansion, type: ACTION_TYPE }),\n    ];\n  }\n\n  async expand(node: Node, relation: Relation = 'outbound', type?: string) {\n    const key = this._key(node, relation, type);\n    const initialized = this._initialized[key];\n    if (!initialized && this._onInitialNodes) {\n      await this._onInitialNodes(node, relation, type);\n      this._initialized[key] = true;\n    }\n  }\n\n  private _key(node: Node, relation: Relation, type?: string) {\n    return `${node.id}-${relation}-${type}`;\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    path: string[] = [],\n  ): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    const shouldContinue = visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this._getNodes({ node, relation, expansion })).forEach((child) =>\n      this.traverse({ node: child, relation, visitor, expansion }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Recursive depth-first traversal of the graph wrapping each visitor call in an effect.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  subscribeTraverse(\n    { visitor, node = this.root, relation = 'outbound', expansion }: GraphTraversalOptions,\n    currentPath: string[] = [],\n  ) {\n    return effect(() => {\n      const path = [...currentPath, node.id];\n      const result = visitor(node, path);\n      if (result === false) {\n        return;\n      }\n\n      const nodes = this._getNodes({ node, relation, expansion });\n      const nodeSubscriptions = nodes.map((n) => this.subscribeTraverse({ node: n, visitor, expansion }, path));\n\n      return () => {\n        nodeSubscriptions.forEach((unsubscribe) => unsubscribe());\n      };\n    });\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      visitor: (node, path) => {\n        if (found) {\n          return false;\n        }\n\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ) {\n    const path = this.getPath(params);\n    if (path) {\n      return path;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (path) {\n        trigger.wake(path);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /**\n   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data, properties, type } = _node;\n        if (data && data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(nonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<Node<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Signal, effect, signal } from '@preact/signals-core';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { isNode, type MaybePromise, nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, type GraphParams } from './graph';\nimport { type Relation, type NodeArg, type Node, type ActionData, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(nonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = {\n  id: string;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n};\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _connectorSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private _graph: Graph;\n\n  constructor(params: Pick<GraphParams, 'nodes' | 'edges'> = {}) {\n    this._graph = new Graph({\n      ...params,\n      onInitialNode: (id) => this._onInitialNode(id),\n      onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string) {\n    if (!pickle) {\n      return new GraphBuilder();\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges });\n  }\n\n  /**\n   * If graph is being restored from a pickle, the data will be null.\n   * Initialize the data of each node by calling resolvers.\n   */\n  async initialize() {\n    return Promise.all(Object.keys(this._graph._nodes).map((id) => this._onInitialNode(id)));\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    if (Array.isArray(extension)) {\n      extension.forEach((ext) => this.addExtension(ext));\n      return this;\n    }\n\n    this._dispatcher.state[extension.id] = [];\n    this._extensions[extension.id] = extension;\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    delete this._extensions[id];\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        for (const { id, resolver } of Object.values(this._extensions)) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          if (node) {\n            this.graph._addNodes([node]);\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private async _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        for (const { id, connector, filter, type, relation = 'outbound' } of Object.values(this._extensions)) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
+  "mappings": ";AAIA,SAASA,OAAOC,QAAQC,iBAAiB;AAEzC,SAASC,cAAcC,eAAe;AACtC,SAA8BC,cAAc;AAC5C,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAASC,mBAAmB;;;ACgCrB,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;;;AD/E7G,IAAMO,cAAcC,OAAO,OAAA;AAIpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCK,YAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,SAAeQ,UAAU,MAAM,CAACC,aAAaT,IAAAA,CAAAA;AA0C9D,IAAMU,QAAN,MAAMA,OAAAA;EAkBXC,YAAY,EAAEC,OAAOC,OAAOC,eAAeC,gBAAgBC,aAAY,IAAkB,CAAC,GAAG;AAb5EC,4BAAkD,CAAC;AACnDC,wBAAwC,CAAC;AAKjDC;;;kBAAuD,CAAC;AAKxDC;;;kBAAoF,CAAC;AAsdtFC,0BAAiB,CAACrB,SAAAA;AACxB,aAAOsB,OAAqB;QAAE,GAAGtB;QAAM,CAACH,WAAAA,GAAc;MAAK,CAAA;IAC7D;AArdE,SAAKsB,OAAOhB,OAAAA,IAAW,KAAKkB,eAAe;MAAEE,IAAIpB;MAASqB,MAAMpB;MAAWqB,YAAY,CAAC;MAAGC,MAAM;IAAK,CAAA;AACtG,QAAId,OAAO;AACTA,YAAMe,QAAQ,CAAC3B,SAAAA;AACb,YAAIA,KAAKwB,SAASnB,aAAa;AAC7B,eAAKuB,SAAS;YAAE,GAAG5B;YAAM0B,MAAM,MAAMG,IAAIC,KAAK,6BAAA,QAAA;;;;;;UAA6B,CAAA;QAC7E,WAAW9B,KAAKwB,SAASlB,mBAAmB;AAC1C,eAAKsB,SAAS;YAAE,GAAG5B;YAAM0B,MAAMK;UAAkB,CAAA;QACnD,OAAO;AACL,eAAKH,SAAS5B,IAAAA;QAChB;MACF,CAAA;IACF;AAEA,SAAKoB,OAAOjB,OAAAA,IAAWmB,OAAO;MAAEU,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;AAC1D,QAAIpB,OAAO;AACTqB,aAAOC,QAAQtB,KAAAA,EAAOc,QAAQ,CAAC,CAACS,QAAQvB,MAAAA,MAAM;AAC5CA,QAAAA,OAAMc,QAAQ,CAACU,WAAAA;AACb,eAAKC,SAAS;YAAEF;YAAQC;UAAO,CAAA;QACjC,CAAA;AACA,aAAKE,WAAWH,QAAQ,YAAYvB,MAAAA;MACtC,CAAA;IACF;AAEA,SAAK2B,iBAAiB1B;AACtB,SAAK2B,kBAAkB1B;AACvB,SAAK2B,gBAAgB1B;EACvB;EAEA,OAAO2B,KAAKC,QAAgBC,UAAgD,CAAC,GAAG;AAC9E,UAAM,EAAEjC,OAAOC,MAAK,IAAKiC,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAIlC,OAAM;MAAEE;MAAOC;MAAO,GAAGgC;IAAQ,CAAA;EAC9C;;;;EAKA,IAAIG,OAAO;AACT,WAAO,KAAKC,SAAS9C,OAAAA;EACvB;;;;EAKA+C,OAAO,EAAE3B,KAAKpB,SAASgD,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAClD,MAAYoD,OAAiB,CAAA,MAAE;AAC7C,YAAMxC,QAAQ,KAAKA,MAAMZ,IAAAA;AACzB,YAAMqD,MAA2B;QAC/B9B,IAAIvB,KAAKuB,GAAG+B,SAASH,YAAY,GAAGnD,KAAKuB,GAAGgC,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUnD,KAAKuB;QAChFC,MAAMxB,KAAKwB;MACb;AACA,UAAIxB,KAAKyB,WAAW+B,OAAO;AACzBH,YAAIG,QAAQxD,KAAKyB,WAAW+B;MAC9B;AACA,UAAI5C,MAAM0C,QAAQ;AAChBD,YAAIzC,QAAQA,MACT6C,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIP;YAAMpD,KAAKuB;;AAChC,iBAAOoC,SAASC,SAASF,EAAEnC,EAAE,IAAIsC,SAAYX,OAAOQ,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,WAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAML,OAAO,KAAKC,SAAS1B,EAAAA;AAC3BrB,cAAU8C,MAAM,mBAAmBzB,EAAAA,IAAI;;;;;;;;;AACvC,WAAO2B,OAAOF,IAAAA;EAChB;EAEAJ,SAAS;AACP,UAAMhC,QAAQsB,OAAO8B,OAAO,KAAK7C,MAAM,EAAEsC,IAAI,CAACzD,SAAAA;AAC5C,aAAO;QACLuB,IAAIvB,KAAKuB;QACTC,MAAMxB,KAAKwB;QACXC,YAAYzB,KAAKyB;MACnB;IACF,CAAA;AAEA,UAAMZ,QAAQqB,OAAO+B,YACnB/B,OAAOC,QAAQ,KAAKf,MAAM,EACvBqC,IAAI,CAAC,CAAClC,IAAI,EAAEU,SAAQ,CAAE,MAA0B;MAACV;MAAIU;KAAS,EAC9DiC,SAAS,CAAC,CAACC,CAAAA,GAAI,CAACC,CAAAA,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA,CAAAA;AAG5C,WAAOtB,KAAKwB,UAAU;MAAE1D;MAAOC;IAAM,CAAA;EACvC;;;;;;;EAQAoC,SAAS1B,IAAYgD,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAKrD,OAAOI,EAAAA;AACjC,QAAI,CAACiD,gBAAgBD,WAAW;AAC9B,WAAK,KAAK/B,iBAAiBjB,EAAAA;IAC7B;AAEA,WAAOiD;EACT;;;;;;;;;EAUA,MAAMC,YAAYlD,IAAYmD,SAAiC;AAC7D,UAAMC,UAAU,KAAK1D,iBAAiBM,EAAAA,MAAQ,KAAKN,iBAAiBM,EAAAA,IAAM,IAAIqD,QAAAA;AAC9E,UAAM5E,OAAO,KAAKiD,SAAS1B,EAAAA;AAC3B,QAAIvB,MAAM;AACR,aAAO,KAAKiB,iBAAiBM,EAAAA;AAC7B,aAAOvB;IACT;AAEA,QAAI0E,YAAYb,QAAW;AACzB,aAAOc,QAAQE,KAAI;IACrB,OAAO;AACL,aAAOC,aAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBnD,EAAAA,EAAI;IACtE;EACF;;;;EAKAX,MAAoEZ,MAAY6C,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEkC,UAAUR,WAAWT,SAASvD,gBAAgBiB,KAAI,IAAKqB;AAC/D,UAAMjC,QAAQ,KAAKoE,UAAU;MAAEhF;MAAM+E;MAAUR;MAAW/C;IAAK,CAAA;AAC/D,WAAOZ,MAAMkD,OAAO,CAACJ,MAAMI,OAAOJ,GAAG1D,IAAAA,CAAAA;EACvC;;;;EAKAa,MAAMb,MAAY,EAAE+E,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAK3D,OAAOpB,KAAKuB,EAAE,IAAIwD,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAE,QAAQjF,MAAY,EAAEuE,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKS,UAAU;QAAEhF;QAAMuE;QAAW/C,MAAMlB;MAAkB,CAAA;SAC1D,KAAK0E,UAAU;QAAEhF;QAAMuE;QAAW/C,MAAMnB;MAAY,CAAA;;EAE3D;EAEA,MAAM6E,OAAOlF,MAAY+E,WAAqB,YAAYvD,MAAe;AACvE,UAAM2D,MAAM,KAAKC,KAAKpF,MAAM+E,UAAUvD,IAAAA;AACtC,UAAM6D,cAAc,KAAKnE,aAAaiE,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAK5C,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBzC,MAAM+E,UAAUvD,IAAAA;AAC3C,WAAKN,aAAaiE,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAKpF,MAAY+E,UAAoBvD,MAAe;AAC1D,WAAO,GAAGxB,KAAKuB,EAAE,IAAIwD,QAAAA,IAAYvD,IAAAA;EACnC;;;;;;;;EASA8D,SACE,EAAEC,SAASvF,OAAO,KAAKgD,MAAM+B,WAAW,YAAYR,UAAS,GAC7DiB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAK5B,SAAS5D,KAAKuB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAMkE,iBAAiBF,QAAQvF,MAAM;SAAIwF;MAAMxF,KAAKuB;KAAG;AACvD,QAAIkE,mBAAmB,OAAO;AAC5B;IACF;AAEAvD,WAAO8B,OAAO,KAAKgB,UAAU;MAAEhF;MAAM+E;MAAUR;IAAU,CAAA,CAAA,EAAI5C,QAAQ,CAAC+D,UACpE,KAAKJ,SAAS;MAAEtF,MAAM0F;MAAOX;MAAUQ;MAAShB;IAAU,GAAG;SAAIiB;MAAMxF,KAAKuB;KAAG,CAAA;EAEnF;;;;;;;;EASAoE,kBACE,EAAEJ,SAASvF,OAAO,KAAKgD,MAAM+B,WAAW,YAAYR,UAAS,GAC7DqB,cAAwB,CAAA,GACxB;AACA,WAAOC,OAAO,MAAA;AACZ,YAAML,OAAO;WAAII;QAAa5F,KAAKuB;;AACnC,YAAMuE,SAASP,QAAQvF,MAAMwF,IAAAA;AAC7B,UAAIM,WAAW,OAAO;AACpB;MACF;AAEA,YAAMlF,QAAQ,KAAKoE,UAAU;QAAEhF;QAAM+E;QAAUR;MAAU,CAAA;AACzD,YAAMwB,oBAAoBnF,MAAM6C,IAAI,CAACC,MAAM,KAAKiC,kBAAkB;QAAE3F,MAAM0D;QAAG6B;QAAShB;MAAU,GAAGiB,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLO,0BAAkBpE,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAE7D,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAM6D,QAAQ,KAAKjD,SAASb,MAAAA;AAC5B,QAAI,CAAC8D,OAAO;AACV,aAAOrC;IACT;AAEA,QAAIsC;AACJ,SAAKb,SAAS;MACZtF,MAAMkG;MACNX,SAAS,CAACvF,MAAMwF,SAAAA;AACd,YAAIW,OAAO;AACT,iBAAO;QACT;AAEA,YAAInG,KAAKuB,OAAOc,QAAQ;AACtB8D,kBAAQX;QACV;MACF;IACF,CAAA;AAEA,WAAOW;EACT;;;;EAKA,MAAMC,YACJC,QACA,EAAE3B,UAAU,KAAO4B,WAAW,IAAG,IAA8C,CAAC,GAChF;AACA,UAAMd,OAAO,KAAKS,QAAQI,MAAAA;AAC1B,QAAIb,MAAM;AACR,aAAOA;IACT;AAEA,UAAMb,UAAU,IAAIC,QAAAA;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,UACEhG,OAC4B;AAC5B,WAAOiG,MAAM,MAAMjG,MAAM6C,IAAI,CAACzD,SAAS,KAAK4B,SAAS5B,IAAAA,CAAAA,CAAAA;EACvD;EAEQ4B,SAA+E,EACrFhB,OACAC,OACA,GAAGiG,MAAAA,GACqD;AACxD,WAAOtG,UAAU,MAAA;AACf,YAAMgE,eAAe,KAAKrD,OAAO2F,MAAMvF,EAAE;AACzC,YAAMvB,OAAOwE,gBAAgB,KAAKnD,eAAe;QAAEK,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAGqF;MAAM,CAAA;AACxF,UAAItC,cAAc;AAChB,cAAM,EAAE9C,MAAMD,YAAYD,KAAI,IAAKsF;AACnC,YAAIpF,QAAQA,SAAS1B,KAAK0B,MAAM;AAC9B1B,eAAK0B,OAAOA;QACd;AAEA,YAAIF,SAASxB,KAAKwB,MAAM;AACtBxB,eAAKwB,OAAOA;QACd;AAEA,mBAAW2D,OAAO1D,YAAY;AAC5B,cAAIA,WAAW0D,GAAAA,MAASnF,KAAKyB,WAAW0D,GAAAA,GAAM;AAC5CnF,iBAAKyB,WAAW0D,GAAAA,IAAO1D,WAAW0D,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAKhE,OAAOnB,KAAKuB,EAAE,IAAIvB;AACvB,aAAKoB,OAAOpB,KAAKuB,EAAE,IAAID,OAAO;UAAEU,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAM0C,UAAU,KAAK1D,iBAAiBjB,KAAKuB,EAAE;AAC7C,UAAIoD,SAAS;AACXA,gBAAQ8B,KAAKzG,IAAAA;AACb,eAAO,KAAKiB,iBAAiBjB,KAAKuB,EAAE;MACtC;AAEA,UAAIX,OAAO;AACTA,cAAMe,QAAQ,CAACoF,YAAAA;AACb,eAAKnF,SAASmF,OAAAA;AACd,eAAKzE,SAAS;YAAEF,QAAQpC,KAAKuB;YAAIc,QAAQ0E,QAAQxF;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIV,OAAO;AACTA,cAAMc,QAAQ,CAAC,CAACJ,IAAIwD,QAAAA,MAClBA,aAAa,aACT,KAAKzC,SAAS;UAAEF,QAAQpC,KAAKuB;UAAIc,QAAQd;QAAG,CAAA,IAC5C,KAAKe,SAAS;UAAEF,QAAQb;UAAIc,QAAQrC,KAAKuB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOvB;IACT,CAAA;EACF;;;;;;;;EASAgH,aAAaC,KAAepG,QAAQ,OAAO;AACzCgG,UAAM,MAAMI,IAAItF,QAAQ,CAACJ,OAAO,KAAK2F,YAAY3F,IAAIV,KAAAA,CAAAA,CAAAA;EACvD;EAEQqG,YAAY3F,IAAYV,QAAQ,OAAO;AAC7CL,cAAU,MAAA;AACR,YAAMR,OAAO,KAAKiD,SAAS1B,EAAAA;AAC3B,UAAI,CAACvB,MAAM;AACT;MACF;AAEA,UAAIa,OAAO;AAET,aAAKmE,UAAU;UAAEhF;QAAK,CAAA,EAAG2B,QAAQ,CAAC3B,UAAAA;AAChC,eAAKmH,YAAY;YAAE/E,QAAQb;YAAIc,QAAQrC,MAAKuB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKyD,UAAU;UAAEhF;UAAM+E,UAAU;QAAU,CAAA,EAAGpD,QAAQ,CAAC3B,UAAAA;AACrD,eAAKmH,YAAY;YAAE/E,QAAQpC,MAAKuB;YAAIc,QAAQd;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKH,OAAOG,EAAAA;MACrB;AAGA,aAAO,KAAKJ,OAAOI,EAAAA;AACnBW,aAAOkF,KAAK,KAAKlG,YAAY,EAC1B4C,OAAO,CAACqB,QAAQA,IAAIkC,WAAW9F,EAAAA,CAAAA,EAC/BI,QAAQ,CAACwD,QAAAA;AACR,eAAO,KAAKjE,aAAaiE,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAKzC,gBAAgBnB,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOA+F,UAAUzG,OAA6C;AACrDgG,UAAM,MAAMhG,MAAMc,QAAQ,CAAC4F,SAAS,KAAKjF,SAASiF,IAAAA,CAAAA,CAAAA;EACpD;EAEQjF,SAAS,EAAEF,QAAQC,OAAM,GAAwC;AACvE7B,cAAU,MAAA;AACR,UAAI,CAAC,KAAKY,OAAOgB,MAAAA,GAAS;AACxB,aAAKhB,OAAOgB,MAAAA,IAAUd,OAAO;UAAEU,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKb,OAAOiB,MAAAA,GAAS;AACxB,aAAKjB,OAAOiB,MAAAA,IAAUf,OAAO;UAAEU,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMuF,cAAc,KAAKpG,OAAOgB,MAAAA;AAChC,UAAI,CAACoF,YAAYvF,SAAS2B,SAASvB,MAAAA,GAAS;AAC1CmF,oBAAYvF,SAASwF,KAAKpF,MAAAA;MAC5B;AAEA,YAAMqF,cAAc,KAAKtG,OAAOiB,MAAAA;AAChC,UAAI,CAACqF,YAAY1F,QAAQ4B,SAASxB,MAAAA,GAAS;AACzCsF,oBAAY1F,QAAQyF,KAAKrF,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAuF,aAAa9G,OAA6C+G,gBAAgB,OAAO;AAC/Ef,UAAM,MAAMhG,MAAMc,QAAQ,CAAC4F,SAAS,KAAKJ,YAAYI,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQT,YAAY,EAAE/E,QAAQC,OAAM,GAAwCuF,gBAAgB,OAAO;AACjGpH,cAAU,MAAA;AACRqG,YAAM,MAAA;AACJ,cAAMgB,gBAAgB,KAAKzG,OAAOgB,MAAAA,GAASH,SAAS6F,UAAU,CAACvG,OAAOA,OAAOc,MAAAA;AAC7E,YAAIwF,kBAAkBhE,UAAagE,kBAAkB,IAAI;AACvD,eAAKzG,OAAOgB,MAAAA,EAAQH,SAAS8F,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAK5G,OAAOiB,MAAAA,GAASL,QAAQ8F,UAAU,CAACvG,OAAOA,OAAOa,MAAAA;AAC3E,YAAI4F,iBAAiBnE,UAAamE,iBAAiB,IAAI;AACrD,eAAK5G,OAAOiB,MAAAA,EAAQL,QAAQ+F,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAKxG,OAAOgB,MAAAA,GAASH,SAASqB,WAAW,KACzC,KAAKlC,OAAOgB,MAAAA,GAASJ,QAAQsB,WAAW,KACxClB,WAAWjC,SACX;AACA,iBAAK+G,YAAY9E,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKhB,OAAOiB,MAAAA,GAASJ,SAASqB,WAAW,KACzC,KAAKlC,OAAOiB,MAAAA,GAASL,QAAQsB,WAAW,KACxCjB,WAAWlC,SACX;AACA,iBAAK+G,YAAY7E,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAE,WAAW0F,QAAgBlD,UAAoBlE,OAAiB;AAC9DL,cAAU,MAAA;AACRqG,YAAM,MAAA;AACJ,cAAMqB,UAAU,KAAK9G,OAAO6G,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQnD,QAAAA,EAAUjB,OAAO,CAACvC,OAAO,CAACV,MAAM+C,SAASrC,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAM6G,SAASvH,MAAMiD,OAAO,CAACvC,OAAO2G,QAAQnD,QAAAA,EAAUnB,SAASrC,EAAAA,CAAAA,KAAQ,CAAA;AACvE2G,kBAAQnD,QAAAA,EAAUgD,OAAO,GAAGG,QAAQnD,QAAAA,EAAUzB,QAAM,GAAK;eAAI8E;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQnD,UAAU,EAChBhF,MACA+E,WAAW,YACXvD,MACA+C,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKW,OAAOlF,MAAM+E,UAAUvD,IAAAA;IACnC;AAEA,UAAMX,QAAQ,KAAKO,OAAOpB,KAAKuB,EAAE;AACjC,QAAI,CAACV,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAMkE,QAAAA,EACVtB,IAAI,CAAClC,OAAO,KAAKJ,OAAOI,EAAAA,CAAG,EAC3BuC,OAAOC,WAAAA,EACPD,OAAO,CAACJ,MAAM,CAAClC,QAAQkC,EAAElC,SAASA,IAAAA;IACvC;EACF;AACF;;;AE9kBA,SAAsB6G,UAAAA,SAAQC,cAAc;AAG5C,SAASC,UAAAA,eAAc;AACvB,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,OAAAA,YAAW;AACpB,SAASC,QAA2BC,eAAAA,oBAAmB;;AA8DhD,IAAMC,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAEC,IAAIC,UAAUC,WAAWC,SAASC,cAAc,GAAGC,KAAAA,IAASN;AACpE,QAAMO,QAAQ,CAACC,QAAgB,GAAGP,EAAAA,IAAMO,GAAAA;AACxC,SAAO;IACLN,WAAW;MAAED,IAAIM,MAAM,UAAA;MAAaL;IAAS,IAAIO;IACjDN,YAAY;MAAE,GAAGG;MAAML,IAAIM,MAAM,WAAA;MAAcJ;IAAU,IAAIM;IAC7DJ,eACK;MACC,GAAGC;MACHL,IAAIM,MAAM,cAAA;MACVG,MAAMC;MACNC,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAChBR,aAAa;QAAEQ;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKC,MAAMC;QAAmBP,MAAMC;MAAkB,EAAA;IACrG,IACAF;IACJL,UACK;MACC,GAAGE;MACHL,IAAIM,MAAM,SAAA;MACVG,MAAMQ;MACNN,UAAU;MACVT,WAAW,CAAC,EAAEU,KAAI,MAAOT,QAAQ;QAAES;MAAK,CAAA,GAAIC,IAAI,CAACC,SAAS;QAAE,GAAGA;QAAKL,MAAMQ;MAAY,EAAA;IACxF,IACAT;IACJU,OAAOC,YAAAA;AACX;AAWA,IAAMC,aAAN,MAAMA;EAAN;AAEEC,sBAAa;AACbC,iBAA+B,CAAC;AAChCC,mBAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAanB,MAAM,aAAQ;AACpD,QAAMoB,aAAaH,gBAAgBI;AACnCC,EAAAA,WAAUF,YAAYG,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMJ,WAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMW,UAAUD,IAAIxB,GAAAA;AACpB,QAAM0B,SAASD,UAAUA,QAAQC,SAASP,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWG,gBAAgB,EAAEH,WAAWN,UAAU,IAAI;IAAE,GAAGU;IAAK,CAACxB,GAAAA,GAAM;MAAE0B;IAAO;EAAE;AACnGN,aAAWN;AACX,SAAOY;AACT;AAKO,IAAMV,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCC,IAAAA,WAAUF,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQW,KAAKR,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMS,WAAW,CACtBC,WACAC,KACA9B,QAAAA;AAEA,QAAM+B,aAAab,QAAQ,MAAA;AACzB,WAAOc,OAAOF,IAAAA,CAAAA;EAChB,GAAG9B,GAAAA;AACH,QAAMiC,cAAcf,QAAQ,MAAA;AAC1B,WAAOW,UAAU,MAAOE,WAAWG,QAAQJ,IAAAA,CAAAA;EAC7C,GAAG9B,GAAAA;AACHgB,UAAQ,MAAA;AACNiB,gBAAAA;EACF,CAAA;AACA,SAAOF,WAAWG;AACpB;AAoBO,IAAMC,eAAN,MAAMA,cAAAA;EAQXC,YAAYC,SAA+C,CAAC,GAAG;AAP9CC,uBAAc,IAAIzB,WAAAA;AAClB0B,uBAAcC,QAAyC,CAAC,CAAA;AACxDC,kCAAyB,oBAAIC,IAAAA;AAC7BC,mCAA0B,oBAAID,IAAAA;AAC9BE,wBAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIC,MAAM;MACtB,GAAGT;MACHU,eAAe,CAACtD,OAAO,KAAKuD,eAAevD,EAAAA;MAC3CwD,gBAAgB,CAAC5C,MAAMD,UAAUF,SAAS,KAAKgD,gBAAgB7C,MAAMD,UAAUF,IAAAA;MAC/EiD,cAAc,CAAC1D,OAAO,KAAK2D,cAAc3D,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAO4D,KAAKC,QAAiB;AAC3B,QAAI,CAACA,QAAQ;AACX,aAAO,IAAInB,cAAAA;IACb;AAEA,UAAM,EAAEoB,OAAOC,MAAK,IAAKC,KAAKC,MAAMJ,MAAAA;AACpC,WAAO,IAAInB,cAAa;MAAEoB;MAAOC;IAAM,CAAA;EACzC;;;;;EAMA,MAAMG,aAAa;AACjB,WAAOC,QAAQpC,IAAIqC,OAAOC,KAAK,KAAKjB,OAAOkB,MAAM,EAAEzD,IAAI,CAACb,OAAO,KAAKuD,eAAevD,EAAAA,CAAAA,CAAAA;EACrF;EAEA,IAAIuE,QAAQ;AACV,WAAO,KAAKnB;EACd;;;;EAKAoB,aAAazE,WAAuC;AAClD,QAAI0E,MAAMC,QAAQ3E,SAAAA,GAAY;AAC5BA,gBAAU4E,QAAQ,CAACC,QAAQ,KAAKJ,aAAaI,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAK/B,YAAYvB,MAAMvB,UAAUC,EAAE,IAAI,CAAA;AACvC,SAAK8C,YAAY/C,UAAUC,EAAE,IAAID;AACjC,WAAO;EACT;;;;EAKA8E,gBAAgB7E,IAA0B;AACxC,WAAO,KAAK8C,YAAY9C,EAAAA;AACxB,WAAO;EACT;EAEA8E,UAAU;AACR,SAAKjC,YAAYtB,QAAQoD,QAAQ,CAACjD,OAAOA,GAAAA,CAAAA;AACzC,SAAKsB,uBAAuB2B,QAAQ,CAACnC,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKU,wBAAwByB,QAAQ,CAACnC,gBAAgBA,YAAAA,CAAAA;AACtD,SAAKQ,uBAAuB+B,MAAK;AACjC,SAAK7B,wBAAwB6B,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAEpE,OAAO,KAAKwC,OAAO6B,MAAMtE,WAAW,YAAYuE,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAKC,SAASxE,KAAKZ,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,CAACqF,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMC,iBAAiB,MAAML,QAAQtE,MAAM;SAAIuE;MAAMvE,KAAKZ;KAAG;AAC7D,QAAIuF,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMzB,QAAQM,OAAOoB,OAAO,KAAK1C,WAAW,EACzC5B,OAAO,CAACnB,cAAcY,cAAcZ,UAAUY,YAAY,WAAS,EACnEO,OAAO,CAACnB,cAAc,CAACA,UAAUmB,UAAUnB,UAAUmB,OAAON,IAAAA,CAAAA,EAC5D6E,QAAQ,CAAC1F,cAAAA;AACR,WAAK8C,YAAYf,mBAAmB/B,UAAUC;AAC9C,WAAK6C,YAAYxB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKiB;AACzC,YAAMZ,SAASlC,UAAUG,YAAY;QAAEU;MAAK,CAAA,KAAM,CAAA;AAClDY,sBAAgBI,oBAAoBpB;AACpC,aAAOyB;IACT,CAAA,EACCpB,IACC,CAACC,SAAe;MACdd,IAAIc,IAAId;MACRS,MAAMK,IAAIL;MACVM,MAAMD,IAAIC,QAAQ;MAClB2E,YAAY5E,IAAI4E,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMvB,QAAQpC,IAAI+B,MAAMjD,IAAI,CAAC8E,MAAM,KAAKX,QAAQ;MAAEpE,MAAM+E;MAAGhF;MAAUuE;IAAQ,GAAG;SAAIC;MAAMvE,KAAKZ;KAAG,CAAA,CAAA;EACpG;EAEA,MAAcuD,eAAeqC,QAAgB;AAC3C,SAAKzC,aAAayC,MAAAA,IAAU,KAAKzC,aAAayC,MAAAA,KAAWrD,OAAO,CAAC,CAAA;AACjE,SAAKS,uBAAuB6C,IAC1BD,QACAE,QAAO,MAAA;AACL,iBAAW,EAAE9F,IAAIC,SAAQ,KAAMmE,OAAOoB,OAAO,KAAK1C,WAAW,GAAG;AAC9D,YAAI,CAAC7C,UAAU;AACb;QACF;AAEA,aAAK4C,YAAYf,mBAAmB9B;AACpC,aAAK6C,YAAYxB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKiB;AACzC,YAAIjC;AACJ,YAAI;AACFA,iBAAOX,SAAS;YAAED,IAAI4F;UAAO,CAAA;QAC/B,SAASG,KAAK;AACZC,UAAAA,KAAIC,MAAMF,KAAK;YAAEhG,WAAWC;UAAG,GAAA;;;;;;AAC/BgG,UAAAA,KAAIE,MAAM,yCAAyClG,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwB,0BAAgBI,oBAAoBpB;QACtC;AAEA,YAAII,MAAM;AACR,eAAK2D,MAAM4B,UAAU;YAACvF;WAAK;AAC3B,cAAI,KAAKuC,aAAavC,KAAKZ,EAAE,GAAG;AAC9B,iBAAKmD,aAAavC,KAAKZ,EAAE,EAAEyC,QAAQ,CAAC;UACtC;AACA;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAcgB,gBAAgB7C,MAAYwF,eAAyBC,WAAoB;AACrF,SAAKlD,aAAavC,KAAKZ,EAAE,IAAI,KAAKmD,aAAavC,KAAKZ,EAAE,KAAKuC,OAAO,CAAC,CAAA;AACnE,QAAI+D,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKrD,wBAAwB2C,IAC3BjF,KAAKZ,IACL8F,QAAO,MAAA;AAGL,UAAI,CAACQ,SAAS,CAAC,KAAKpD,wBAAwBsD,IAAI5F,KAAKZ,EAAE,GAAG;AACxD;MACF;AACAsG,cAAQ;AAGRlC,aAAOC,KAAK,KAAKvB,WAAW;AAE5B,WAAKK,aAAavC,KAAKZ,EAAE,EAAEyC;AAG3B,YAAMqB,QAAwB,CAAA;AAC9B,iBAAW,EAAE9D,IAAIE,WAAWgB,QAAQT,MAAME,WAAW,WAAU,KAAMyD,OAAOoB,OAAO,KAAK1C,WAAW,GAAG;AACpG,YACE,CAAC5C,aACDS,aAAayF,iBACZC,aAAa5F,SAAS4F,aACtBnF,UAAU,CAACA,OAAON,IAAAA,GACnB;AACA;QACF;AAEA,aAAKiC,YAAYf,mBAAmB9B;AACpC,aAAK6C,YAAYxB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKiB;AACzC,YAAI;AACFiB,gBAAM5B,KAAI,GAAKhC,UAAU;YAAEU;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAASmF,KAAK;AACZC,UAAAA,KAAIC,MAAMF,KAAK;YAAEhG,WAAWC;UAAG,GAAA;;;;;;AAC/BgG,UAAAA,KAAIE,MAAM,yCAAyClG,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEwB,0BAAgBI,oBAAoBpB;QACtC;MACF;AAEA,YAAMiG,MAAM3C,MAAMjD,IAAI,CAAC8E,MAAMA,EAAE3F,EAAE;AACjC,YAAM0G,UAAUH,SAASrF,OAAO,CAAClB,OAAO,CAACyG,IAAIrB,SAASpF,EAAAA,CAAAA;AACtDuG,iBAAWE;AAGX,WAAKlC,MAAMoC,aACTD,QAAQ7F,IAAI,CAAC+F,YAAY;QAAEC,QAAQjG,KAAKZ;QAAI4G;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKrC,MAAM4B,UAAUrC,KAAAA;AACrB,WAAKS,MAAMuC,UACThD,MAAMjD,IAAI,CAAC,EAAEb,GAAE,MACboG,kBAAkB,aAAa;QAAES,QAAQjG,KAAKZ;QAAI4G,QAAQ5G;MAAG,IAAI;QAAE6G,QAAQ7G;QAAI4G,QAAQhG,KAAKZ;MAAG,CAAA,CAAA;AAGnG,WAAKuE,MAAMwC,WACTnG,KAAKZ,IACLoG,eACAtC,MAAMjD,IAAI,CAAC,EAAEb,GAAE,MAAOA,EAAAA,CAAAA;AAExB8D,YAAMa,QAAQ,CAACgB,MAAAA;AACb,YAAI,KAAKxC,aAAawC,EAAE3F,EAAE,GAAG;AAC3B,eAAKmD,aAAawC,EAAE3F,EAAE,EAAEyC,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAckB,cAAciC,QAAgB;AAC1C,SAAK5C,uBAAuBX,IAAIuD,MAAAA,IAAAA;AAChC,SAAK1C,wBAAwBb,IAAIuD,MAAAA,IAAAA;AACjC,SAAK5C,uBAAuBgE,OAAOpB,MAAAA;AACnC,SAAK1C,wBAAwB8D,OAAOpB,MAAAA;EACtC;AACF;",
+  "names": ["batch", "effect", "untracked", "asyncTimeout", "Trigger", "create", "invariant", "log", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "Symbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "isActionLike", "Graph", "constructor", "nodes", "edges", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_nodes", "_edges", "_constructNode", "create", "id", "type", "properties", "data", "forEach", "_addNode", "log", "warn", "actionGroupSymbol", "inbound", "outbound", "Object", "entries", "source", "target", "_addEdge", "_sortEdges", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "from", "pickle", "options", "JSON", "parse", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "values", "fromEntries", "toSorted", "a", "b", "localeCompare", "stringify", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "relation", "_getNodes", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "start", "found", "waitForPath", "params", "interval", "i", "setInterval", "wake", "finally", "clearInterval", "_addNodes", "batch", "_node", "subNode", "_removeNodes", "ids", "_removeNode", "_removeEdge", "keys", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "nodeId", "current", "unsorted", "sorted", "effect", "signal", "create", "invariant", "log", "isNode", "nonNullable", "createExtension", "extension", "id", "resolver", "connector", "actions", "actionGroups", "rest", "getId", "key", "undefined", "type", "ACTION_GROUP_TYPE", "relation", "node", "map", "arg", "data", "actionGroupSymbol", "ACTION_TYPE", "filter", "nonNullable", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "invariant", "currentExtension", "all", "current", "result", "push", "toSignal", "subscribe", "get", "thisSignal", "signal", "unsubscribe", "value", "GraphBuilder", "constructor", "params", "_dispatcher", "_extensions", "create", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "Graph", "onInitialNode", "_onInitialNode", "onInitialNodes", "_onInitialNodes", "onRemoveNode", "_onRemoveNode", "from", "pickle", "nodes", "edges", "JSON", "parse", "initialize", "Promise", "Object", "keys", "_nodes", "graph", "addExtension", "Array", "isArray", "forEach", "ext", "removeExtension", "destroy", "clear", "explore", "root", "visitor", "path", "includes", "isNode", "yieldOrContinue", "shouldContinue", "values", "flatMap", "properties", "n", "nodeId", "set", "effect", "err", "log", "catch", "error", "_addNodes", "nodesRelation", "nodesType", "first", "previous", "has", "ids", "removed", "_removeEdges", "target", "source", "_addEdges", "_sortEdges", "delete"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5363,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":53473,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":44291,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":51941},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":13009},"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":9193}},"bytes":23122}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5363,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":61441,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":46212,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":56883},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":15004},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":9707}},"bytes":25631}}}