@dxos/app-graph 0.6.13 → 0.6.14-main.1366248

package/dist/lib/node/index.cjs

@@ -50,11 +50,12 @@ var import_signals_core = require("@preact/signals-core");
 var import_async = require("@dxos/async");
 var import_echo_schema = require("@dxos/echo-schema");
 var import_invariant = require("@dxos/invariant");
+var import_log = require("@dxos/log");
 var import_util = require("@dxos/util");
 var import_signals_core2 = require("@preact/signals-core");
 var import_echo_schema2 = require("@dxos/echo-schema");
 var import_invariant2 = require("@dxos/invariant");
-var import_log = require("@dxos/log");
+var import_log2 = require("@dxos/log");
 var import_util2 = require("@dxos/util");
 var isGraphNode = (data) => data && typeof data === "object" && "id" in data && "properties" in data && data.properties ? typeof data.properties === "object" && "data" in data : false;
 var isAction = (data) => isGraphNode(data) ? typeof data.data === "function" : false;
@@ -67,7 +68,7 @@ var getGraph = (node) => {
   const graph = node[graphSymbol];
   (0, import_invariant.invariant)(graph, "Node is not associated with a graph.", {
     F: __dxlog_file,
-    L: 20,
+    L: 21,
     S: void 0,
     A: [
       "graph",
@@ -81,8 +82,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) => (0, import_signals_core.untracked)(() => !isActionLike(node));
-var Graph = class {
-  constructor({ onInitialNode, onInitialNodes, onRemoveNode } = {}) {
+var Graph = class _Graph {
+  constructor({ nodes, edges, onInitialNode, onInitialNodes, onRemoveNode } = {}) {
     this._waitingForNodes = {};
     this._initialized = {};
     this._nodes = {};
@@ -93,19 +94,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: () => import_log.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] = (0, import_echo_schema.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')`.
@@ -140,7 +182,7 @@ var Graph = class {
     const root = this.findNode(id);
     (0, import_invariant.invariant)(root, `Node not found: ${id}`, {
       F: __dxlog_file,
-      L: 137,
+      L: 165,
       S: this,
       A: [
         "root",
@@ -149,15 +191,32 @@ 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.
   *
   * If a node is not found within the graph and an `onInitialNode` callback is provided,
   * it is called with the id and type of the node, potentially initializing the node.
   */
-  findNode(id) {
+  findNode(id, expansion = true) {
     const existingNode = this._nodes[id];
-    if (!existingNode) {
+    if (!existingNode && expansion) {
       void this._onInitialNode?.(id);
     }
     return existingNode;
@@ -619,19 +678,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 = (0, import_echo_schema2.create)({});
     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;
   }
@@ -719,17 +796,17 @@ var GraphBuilder = class {
             id: nodeId
           });
         } catch (err) {
-          import_log.log.catch(err, {
+          import_log2.log.catch(err, {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 300,
+            L: 318,
             S: this,
             C: (f, a) => f(...a)
           });
-          import_log.log.error(`Previous error occurred in extension: ${id}`, void 0, {
+          import_log2.log.error(`Previous error occurred in extension: ${id}`, void 0, {
             F: __dxlog_file2,
-            L: 301,
+            L: 319,
             S: this,
             C: (f, a) => f(...a)
           });
@@ -772,17 +849,17 @@ var GraphBuilder = class {
             node
           }) ?? []);
         } catch (err) {
-          import_log.log.catch(err, {
+          import_log2.log.catch(err, {
             extension: id
           }, {
             F: __dxlog_file2,
-            L: 355,
+            L: 373,
             S: this,
             C: (f, a) => f(...a)
           });
-          import_log.log.error(`Previous error occurred in extension: ${id}`, void 0, {
+          import_log2.log.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/node/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { 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): Node | undefined {\n    const existingNode = this._nodes[id];\n    if (!existingNode) {\n      void this._onInitialNode?.(id);\n    }\n\n    return existingNode;\n  }\n\n  /**\n   * Wait for a node to be added to the graph.\n   *\n   * If the node is already present in the graph, the promise resolves immediately.\n   *\n   * @param id The id of the node to wait for.\n   * @param timeout The time in milliseconds to wait for the node to be added.\n   */\n  async waitForNode(id: string, timeout?: number): Promise<Node> {\n    const trigger = this._waitingForNodes[id] ?? (this._waitingForNodes[id] = new Trigger<Node>());\n    const node = this.findNode(id);\n    if (node) {\n      delete this._waitingForNodes[id];\n      return node;\n    }\n\n    if (timeout === undefined) {\n      return trigger.wait();\n    } else {\n      return asyncTimeout(trigger.wait(), timeout, `Node not found: ${id}`);\n    }\n  }\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(node: Node, options: NodesOptions<T, U> = {}) {\n    const { relation, expansion, filter = 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,0BAAyC;AAEzC,mBAAsC;AACtC,yBAA4C;AAC5C,uBAA0B;AAC1B,kBAA4B;AEL5B,IAAAA,uBAA4C;AAG5C,IAAAC,sBAAuB;AACvB,IAAAC,oBAA0B;AAC1B,iBAAoB;AACpB,IAAAC,eAAuD;ADgChD,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;ADhF7G,IAAMO,cAAcH,OAAO,OAAA;AAIpB,IAAMI,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBF,WAAAA;AACrCI,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,aAAeQ,+BAAU,MAAM,CAACX,aAAaG,IAAAA,CAAAA;AAiC9D,IAAMS,QAAN,MAAMA;EAkBXC,YAAY,EACVC,eACAC,gBACAC,aAAY,IAKV,CAAC,GAAG;AArBSC,SAAAA,mBAAkD,CAAC;AACnDC,SAAAA,eAAwC,CAAC;kBAKM,CAAC;kBAK4B,CAAC;AA2ZtFC,SAAAA,iBAAiB,CAAChB,SAAAA;AACxB,iBAAOiB,2BAAqB;QAAE,GAAGjB;QAAM,CAACF,WAAAA,GAAc;MAAK,CAAA;IAC7D;AAlZE,SAAKoB,iBAAiBP;AACtB,SAAKQ,kBAAkBP;AACvB,SAAKQ,gBAAgBP;AACrB,SAAKQ,OAAOlB,OAAAA,IAAW,KAAKa,eAAe;MAAEM,IAAInB;MAASoB,MAAMnB;MAAWZ,YAAY,CAAC;MAAGD,MAAM;IAAK,CAAA;AACtG,SAAKiC,OAAOrB,OAAAA,QAAWc,2BAAO;MAAEQ,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;EAC5D;;;;EAKA,IAAIC,OAAO;AACT,WAAO,KAAKC,SAASzB,OAAAA;EACvB;;;;EAKA0B,OAAO,EAAEP,KAAKnB,SAAS2B,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAC7B,MAAY+B,OAAiB,CAAA,MAAE;AAC7C,YAAMC,QAAQ,KAAKA,MAAMhC,IAAAA;AACzB,YAAMiC,MAA2B;QAC/BX,IAAItB,KAAKsB,GAAGY,SAASJ,YAAY,GAAG9B,KAAKsB,GAAGa,MAAM,GAAGL,YAAY,CAAA,CAAA,QAAU9B,KAAKsB;QAChFC,MAAMvB,KAAKuB;MACb;AACA,UAAIvB,KAAKR,WAAW4C,OAAO;AACzBH,YAAIG,QAAQpC,KAAKR,WAAW4C;MAC9B;AACA,UAAIJ,MAAME,QAAQ;AAChBD,YAAID,QAAQA,MACTK,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIR;YAAM/B,KAAKsB;;AAChC,iBAAOiB,SAASC,SAASF,EAAEhB,EAAE,IAAImB,SAAYZ,OAAOS,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,uBAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAMN,OAAO,KAAKC,SAASN,EAAAA;AAC3BpB,oCAAUyB,MAAM,mBAAmBL,EAAAA,IAAI;;;;;;;;;AACvC,WAAOO,OAAOF,IAAAA;EAChB;;;;;;;EAQAC,SAASN,IAA8B;AACrC,UAAMsB,eAAe,KAAKvB,OAAOC,EAAAA;AACjC,QAAI,CAACsB,cAAc;AACjB,WAAK,KAAK1B,iBAAiBI,EAAAA;IAC7B;AAEA,WAAOsB;EACT;;;;;;;;;EAUA,MAAMC,YAAYvB,IAAYwB,SAAiC;AAC7D,UAAMC,UAAU,KAAKjC,iBAAiBQ,EAAAA,MAAQ,KAAKR,iBAAiBQ,EAAAA,IAAM,IAAI0B,qBAAAA;AAC9E,UAAMhD,OAAO,KAAK4B,SAASN,EAAAA;AAC3B,QAAItB,MAAM;AACR,aAAO,KAAKc,iBAAiBQ,EAAAA;AAC7B,aAAOtB;IACT;AAEA,QAAI8C,YAAYL,QAAW;AACzB,aAAOM,QAAQE,KAAI;IACrB,OAAO;AACL,iBAAOC,2BAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBxB,EAAAA,EAAI;IACtE;EACF;;;;EAKAU,MAAoEhC,MAAYmD,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEC,UAAUC,WAAWX,SAASnC,gBAAgBgB,KAAI,IAAK4B;AAC/D,UAAMnB,QAAQ,KAAKsB,UAAU;MAAEtD;MAAMoD;MAAUC;MAAW9B;IAAK,CAAA;AAC/D,WAAOS,MAAMU,OAAO,CAACJ,MAAMI,OAAOJ,GAAGtC,IAAAA,CAAAA;EACvC;;;;EAKAuD,MAAMvD,MAAY,EAAEoD,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAK5B,OAAOxB,KAAKsB,EAAE,IAAI8B,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAI,QAAQxD,MAAY,EAAEqD,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKC,UAAU;QAAEtD;QAAMqD;QAAW9B,MAAMjB;MAAkB,CAAA;SAC1D,KAAKgD,UAAU;QAAEtD;QAAMqD;QAAW9B,MAAMlB;MAAY,CAAA;;EAE3D;EAEA,MAAMoD,OAAOzD,MAAYoD,WAAqB,YAAY7B,MAAe;AACvE,UAAMmC,MAAM,KAAKC,KAAK3D,MAAMoD,UAAU7B,IAAAA;AACtC,UAAMqC,cAAc,KAAK7C,aAAa2C,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAKzC,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBnB,MAAMoD,UAAU7B,IAAAA;AAC3C,WAAKR,aAAa2C,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAK3D,MAAYoD,UAAoB7B,MAAe;AAC1D,WAAO,GAAGvB,KAAKsB,EAAE,IAAI8B,QAAAA,IAAY7B,IAAAA;EACnC;;;;;;;;EASAsC,SACE,EAAEC,SAAS9D,OAAO,KAAK2B,MAAMyB,WAAW,YAAYC,UAAS,GAC7DU,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAKvB,SAASxC,KAAKsB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAM0C,iBAAiBF,QAAQ9D,MAAM;SAAI+D;MAAM/D,KAAKsB;KAAG;AACvD,QAAI0C,mBAAmB,OAAO;AAC5B;IACF;AAEAC,WAAOC,OAAO,KAAKZ,UAAU;MAAEtD;MAAMoD;MAAUC;IAAU,CAAA,CAAA,EAAIc,QAAQ,CAACC,UACpE,KAAKP,SAAS;MAAE7D,MAAMoE;MAAOhB;MAAUU;MAAST;IAAU,GAAG;SAAIU;MAAM/D,KAAKsB;KAAG,CAAA;EAEnF;;;;;;;;EASA+C,kBACE,EAAEP,SAAS9D,OAAO,KAAK2B,MAAMyB,WAAW,YAAYC,UAAS,GAC7DiB,cAAwB,CAAA,GACxB;AACA,eAAOC,4BAAO,MAAA;AACZ,YAAMR,OAAO;WAAIO;QAAatE,KAAKsB;;AACnC,YAAMkD,SAASV,QAAQ9D,MAAM+D,IAAAA;AAC7B,UAAIS,WAAW,OAAO;AACpB;MACF;AAEA,YAAMxC,QAAQ,KAAKsB,UAAU;QAAEtD;QAAMoD;QAAUC;MAAU,CAAA;AACzD,YAAMoB,oBAAoBzC,MAAMK,IAAI,CAACC,MAAM,KAAK+B,kBAAkB;QAAErE,MAAMsC;QAAGwB;QAAST;MAAU,GAAGU,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;MACZ7D,MAAM8E;MACNhB,SAAS,CAAC9D,MAAM+D,SAAAA;AACd,YAAIgB,OAAO;AACT,iBAAO;QACT;AAEA,YAAI/E,KAAKsB,OAAOuD,QAAQ;AACtBE,kBAAQhB;QACV;MACF;IACF,CAAA;AAEA,WAAOgB;EACT;;;;;;EAOAC,UACEhD,OAC4B;AAC5B,eAAOiD,2BAAM,MAAMjD,MAAMK,IAAI,CAACrC,SAAS,KAAKkF,SAASlF,IAAAA,CAAAA,CAAAA;EACvD;EAEQkF,SAA+E,EACrFlD,OACAuB,OACA,GAAG4B,MAAAA,GACqD;AACxD,eAAO3E,+BAAU,MAAA;AACf,YAAMoC,eAAe,KAAKvB,OAAO8D,MAAM7D,EAAE;AACzC,YAAMtB,OAAO4C,gBAAgB,KAAK5B,eAAe;QAAEzB,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAG2F;MAAM,CAAA;AACxF,UAAIvC,cAAc;AAChB,cAAM,EAAErD,MAAMC,YAAY+B,KAAI,IAAK4D;AACnC,YAAI5F,QAAQA,SAASS,KAAKT,MAAM;AAC9BS,eAAKT,OAAOA;QACd;AAEA,YAAIgC,SAASvB,KAAKuB,MAAM;AACtBvB,eAAKuB,OAAOA;QACd;AAEA,mBAAWmC,OAAOlE,YAAY;AAC5B,cAAIA,WAAWkE,GAAAA,MAAS1D,KAAKR,WAAWkE,GAAAA,GAAM;AAC5C1D,iBAAKR,WAAWkE,GAAAA,IAAOlE,WAAWkE,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAKrC,OAAOrB,KAAKsB,EAAE,IAAItB;AACvB,aAAKwB,OAAOxB,KAAKsB,EAAE,QAAIL,2BAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAMqB,UAAU,KAAKjC,iBAAiBd,KAAKsB,EAAE;AAC7C,UAAIyB,SAAS;AACXA,gBAAQqC,KAAKpF,IAAAA;AACb,eAAO,KAAKc,iBAAiBd,KAAKsB,EAAE;MACtC;AAEA,UAAIU,OAAO;AACTA,cAAMmC,QAAQ,CAACkB,YAAAA;AACb,eAAKH,SAASG,OAAAA;AACd,eAAKC,SAAS;YAAEV,QAAQ5E,KAAKsB;YAAIuD,QAAQQ,QAAQ/D;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIiC,OAAO;AACTA,cAAMY,QAAQ,CAAC,CAAC7C,IAAI8B,QAAAA,MAClBA,aAAa,aACT,KAAKkC,SAAS;UAAEV,QAAQ5E,KAAKsB;UAAIuD,QAAQvD;QAAG,CAAA,IAC5C,KAAKgE,SAAS;UAAEV,QAAQtD;UAAIuD,QAAQ7E,KAAKsB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOtB;IACT,CAAA;EACF;;;;;;;;EASAuF,aAAaC,KAAejC,QAAQ,OAAO;AACzC0B,mCAAM,MAAMO,IAAIrB,QAAQ,CAAC7C,OAAO,KAAKmE,YAAYnE,IAAIiC,KAAAA,CAAAA,CAAAA;EACvD;EAEQkC,YAAYnE,IAAYiC,QAAQ,OAAO;AAC7C/C,uCAAU,MAAA;AACR,YAAMR,OAAO,KAAK4B,SAASN,EAAAA;AAC3B,UAAI,CAACtB,MAAM;AACT;MACF;AAEA,UAAIuD,OAAO;AAET,aAAKD,UAAU;UAAEtD;QAAK,CAAA,EAAGmE,QAAQ,CAACnE,UAAAA;AAChC,eAAK0F,YAAY;YAAEd,QAAQtD;YAAIuD,QAAQ7E,MAAKsB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKgC,UAAU;UAAEtD;UAAMoD,UAAU;QAAU,CAAA,EAAGe,QAAQ,CAACnE,UAAAA;AACrD,eAAK0F,YAAY;YAAEd,QAAQ5E,MAAKsB;YAAIuD,QAAQvD;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKE,OAAOF,EAAAA;MACrB;AAGA,aAAO,KAAKD,OAAOC,EAAAA;AACnB2C,aAAO0B,KAAK,KAAK5E,YAAY,EAC1B2B,OAAO,CAACgB,QAAQA,IAAIkC,WAAWtE,EAAAA,CAAAA,EAC/B6C,QAAQ,CAACT,QAAAA;AACR,eAAO,KAAK3C,aAAa2C,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAKtC,gBAAgBE,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOAuE,UAAUtC,OAA6C;AACrD0B,mCAAM,MAAM1B,MAAMY,QAAQ,CAAC2B,SAAS,KAAKR,SAASQ,IAAAA,CAAAA,CAAAA;EACpD;EAEQR,SAAS,EAAEV,QAAQC,OAAM,GAAwC;AACvErE,uCAAU,MAAA;AACR,UAAI,CAAC,KAAKgB,OAAOoD,MAAAA,GAAS;AACxB,aAAKpD,OAAOoD,MAAAA,QAAU3D,2BAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKF,OAAOqD,MAAAA,GAAS;AACxB,aAAKrD,OAAOqD,MAAAA,QAAU5D,2BAAO;UAAEQ,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMqE,cAAc,KAAKvE,OAAOoD,MAAAA;AAChC,UAAI,CAACmB,YAAYrE,SAASc,SAASqC,MAAAA,GAAS;AAC1CkB,oBAAYrE,SAASsE,KAAKnB,MAAAA;MAC5B;AAEA,YAAMoB,cAAc,KAAKzE,OAAOqD,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,mCAAM,MAAM1B,MAAMY,QAAQ,CAAC2B,SAAS,KAAKJ,YAAYI,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQT,YAAY,EAAEd,QAAQC,OAAM,GAAwCsB,gBAAgB,OAAO;AACjG3F,uCAAU,MAAA;AACRyE,qCAAM,MAAA;AACJ,cAAMmB,gBAAgB,KAAK5E,OAAOoD,MAAAA,GAASlD,SAAS2E,UAAU,CAAC/E,OAAOA,OAAOuD,MAAAA;AAC7E,YAAIuB,kBAAkB3D,UAAa2D,kBAAkB,IAAI;AACvD,eAAK5E,OAAOoD,MAAAA,EAAQlD,SAAS4E,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAK/E,OAAOqD,MAAAA,GAASpD,QAAQ4E,UAAU,CAAC/E,OAAOA,OAAOsD,MAAAA;AAC3E,YAAI2B,iBAAiB9D,UAAa8D,iBAAiB,IAAI;AACrD,eAAK/E,OAAOqD,MAAAA,EAAQpD,QAAQ6E,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAK3E,OAAOoD,MAAAA,GAASlD,SAASQ,WAAW,KACzC,KAAKV,OAAOoD,MAAAA,GAASnD,QAAQS,WAAW,KACxC0C,WAAWzE,SACX;AACA,iBAAKsF,YAAYb,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKpD,OAAOqD,MAAAA,GAASnD,SAASQ,WAAW,KACzC,KAAKV,OAAOqD,MAAAA,GAASpD,QAAQS,WAAW,KACxC2C,WAAW1E,SACX;AACA,iBAAKsF,YAAYZ,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYA2B,WAAWC,QAAgBrD,UAAoBG,OAAiB;AAC9D/C,uCAAU,MAAA;AACRyE,qCAAM,MAAA;AACJ,cAAMyB,UAAU,KAAKlF,OAAOiF,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQtD,QAAAA,EAAUV,OAAO,CAACpB,OAAO,CAACiC,MAAMf,SAASlB,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAMsF,SAASrD,MAAMb,OAAO,CAACpB,OAAOoF,QAAQtD,QAAAA,EAAUZ,SAASlB,EAAAA,CAAAA,KAAQ,CAAA;AACvEoF,kBAAQtD,QAAAA,EAAUkD,OAAO,GAAGI,QAAQtD,QAAAA,EAAUlB,QAAM,GAAK;eAAI0E;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQrD,UAAU,EAChBtD,MACAoD,WAAW,YACX7B,MACA8B,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKI,OAAOzD,MAAMoD,UAAU7B,IAAAA;IACnC;AAEA,UAAMgC,QAAQ,KAAK/B,OAAOxB,KAAKsB,EAAE;AACjC,QAAI,CAACiC,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAMH,QAAAA,EACVf,IAAI,CAACf,OAAO,KAAKD,OAAOC,EAAAA,CAAG,EAC3BoB,OAAOC,uBAAAA,EACPD,OAAO,CAACJ,MAAM,CAACf,QAAQe,EAAEf,SAASA,IAAAA;IACvC;EACF;AACF;;AErcO,IAAMsF,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAExF,IAAIyF,UAAUC,WAAWxD,SAASyD,cAAc,GAAGC,KAAAA,IAASJ;AACpE,QAAMK,QAAQ,CAACzD,QAAgB,GAAGpC,EAAAA,IAAMoC,GAAAA;AACxC,SAAO;IACLqD,WAAW;MAAEzF,IAAI6F,MAAM,UAAA;MAAaJ;IAAS,IAAItE;IACjDuE,YAAY;MAAE,GAAGE;MAAM5F,IAAI6F,MAAM,WAAA;MAAcH;IAAU,IAAIvE;IAC7DwE,eACK;MACC,GAAGC;MACH5F,IAAI6F,MAAM,cAAA;MACV5F,MAAMjB;MACN8C,UAAU;MACV4D,WAAW,CAAC,EAAEhH,KAAI,MAChBiH,aAAa;QAAEjH;MAAK,CAAA,GAAIqC,IAAI,CAAC+E,SAAS;QAAE,GAAGA;QAAK7H,MAAMG;QAAmB6B,MAAMjB;MAAkB,EAAA;IACrG,IACAmC;IACJe,UACK;MACC,GAAG0D;MACH5F,IAAI6F,MAAM,SAAA;MACV5F,MAAMlB;MACN+C,UAAU;MACV4D,WAAW,CAAC,EAAEhH,KAAI,MAAOwD,QAAQ;QAAExD;MAAK,CAAA,GAAIqC,IAAI,CAAC+E,SAAS;QAAE,GAAGA;QAAK7F,MAAMlB;MAAY,EAAA;IACxF,IACAoC;IACJC,OAAOC,aAAAA,WAAAA;AACX;AAWA,IAAM0E,aAAN,MAAMA;EAAN,cAAA;AAEEC,SAAAA,aAAa;AACbC,SAAAA,QAA+B,CAAC;AAChCC,SAAAA,UAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAajE,MAAM,aAAQ;AACpD,QAAMkE,aAAaH,gBAAgBI;AACnC3H,wBAAAA,WAAU0H,YAAYE,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMH,WAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMZ,UAAUqB,IAAIrE,GAAAA;AACpB,QAAMc,SAASkC,UAAUA,QAAQlC,SAASmD,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,IAAI;IAAE,GAAGS;IAAK,CAACrE,GAAAA,GAAM;MAAEc;IAAO;EAAE;AACnGoD,aAAWN;AACX,SAAO9C;AACT;AAKO,IAAMgD,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnC3H,0BAAAA,WAAU0H,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQxB,KAAK2B,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMK,WAAW,CACtBC,WACAC,KACAxE,QAAAA;AAEA,QAAMyE,aAAaT,QAAQ,MAAA;AACzB,eAAOU,6BAAOF,IAAAA,CAAAA;EAChB,GAAGxE,GAAAA;AACH,QAAMgB,cAAcgD,QAAQ,MAAA;AAC1B,WAAOO,UAAU,MAAOE,WAAWE,QAAQH,IAAAA,CAAAA;EAC7C,GAAGxE,GAAAA;AACH8D,UAAQ,MAAA;AACN9C,gBAAAA;EACF,CAAA;AACA,SAAOyD,WAAWE;AACpB;AAoBO,IAAMC,eAAN,MAAMA;EAQX5H,cAAc;AAPG6H,SAAAA,cAAc,IAAIlB,WAAAA;AAClBmB,SAAAA,kBAAcvH,oBAAAA,QAAyC,CAAC,CAAA;AACxDwH,SAAAA,yBAAyB,oBAAIC,IAAAA;AAC7BC,SAAAA,0BAA0B,oBAAID,IAAAA;AAC9BE,SAAAA,eAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIpI,MAAM;MACtBE,eAAe,CAACW,OAAO,KAAKJ,eAAeI,EAAAA;MAC3CV,gBAAgB,CAACZ,MAAMoD,UAAU7B,SAAS,KAAKJ,gBAAgBnB,MAAMoD,UAAU7B,IAAAA;MAC/EV,cAAc,CAACS,OAAO,KAAKF,cAAcE,EAAAA;IAC3C,CAAA;EACF;EAEA,IAAIrB,QAAQ;AACV,WAAO,KAAK4I;EACd;;;;EAKAC,aAAahC,WAAuC;AAClD,QAAIiC,MAAMC,QAAQlC,SAAAA,GAAY;AAC5BA,gBAAU3C,QAAQ,CAAC8E,QAAQ,KAAKH,aAAaG,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKV,YAAYhB,MAAMT,UAAUxF,EAAE,IAAI,CAAA;AACvC,SAAKkH,YAAY1B,UAAUxF,EAAE,IAAIwF;AACjC,WAAO;EACT;;;;EAKAoC,gBAAgB5H,IAA0B;AACxC,WAAO,KAAKkH,YAAYlH,EAAAA;AACxB,WAAO;EACT;EAEA6H,UAAU;AACR,SAAKZ,YAAYf,QAAQrD,QAAQ,CAACwD,OAAOA,GAAAA,CAAAA;AACzC,SAAKc,uBAAuBtE,QAAQ,CAACO,gBAAgBA,YAAAA,CAAAA;AACrD,SAAKiE,wBAAwBxE,QAAQ,CAACO,gBAAgBA,YAAAA,CAAAA;AACtD,SAAK+D,uBAAuBW,MAAK;AACjC,SAAKT,wBAAwBS,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAErJ,OAAO,KAAK6I,OAAOlH,MAAMyB,WAAW,YAAYU,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAKvB,SAASxC,KAAKsB,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,KAACgI,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMvF,iBAAiB,MAAMF,QAAQ9D,MAAM;SAAI+D;MAAM/D,KAAKsB;KAAG;AAC7D,QAAI0C,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMhC,QAAQiC,OAAOC,OAAO,KAAKsE,WAAW,EACzC9F,OAAO,CAACoE,cAAc1D,cAAc0D,UAAU1D,YAAY,WAAS,EACnEV,OAAO,CAACoE,cAAc,CAACA,UAAUpE,UAAUoE,UAAUpE,OAAO1C,IAAAA,CAAAA,EAC5DwJ,QAAQ,CAAC1C,cAAAA;AACR,WAAKyB,YAAYT,mBAAmBhB,UAAUxF;AAC9C,WAAKiH,YAAYjB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKU;AACzC,YAAM/D,SAASsC,UAAUE,YAAY;QAAEhH;MAAK,CAAA,KAAM,CAAA;AAClDyH,sBAAgBI,oBAAoBpF;AACpC,aAAO+B;IACT,CAAA,EACCnC,IACC,CAAC+E,SAAe;MACd9F,IAAI8F,IAAI9F;MACRC,MAAM6F,IAAI7F;MACVhC,MAAM6H,IAAI7H,QAAQ;MAClBC,YAAY4H,IAAI5H,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMiK,QAAQ1B,IAAI/F,MAAMK,IAAI,CAACC,MAAM,KAAK+G,QAAQ;MAAErJ,MAAMsC;MAAGc;MAAUU;IAAQ,GAAG;SAAIC;MAAM/D,KAAKsB;KAAG,CAAA,CAAA;EACpG;EAEA,MAAcJ,eAAeuF,QAAgB;AAC3C,SAAKmC,aAAanC,MAAAA,IAAU,KAAKmC,aAAanC,MAAAA,SAAW2B,6BAAO,CAAC,CAAA;AACjE,SAAKK,uBAAuBiB,IAC1BjD,YACAlC,qBAAAA,QAAO,MAAA;AACL,iBAAW,EAAEjD,IAAIyF,SAAQ,KAAM9C,OAAOC,OAAO,KAAKsE,WAAW,GAAG;AAC9D,YAAI,CAACzB,UAAU;AACb;QACF;AAEA,aAAKwB,YAAYT,mBAAmBxG;AACpC,aAAKiH,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAIvI;AACJ,YAAI;AACFA,iBAAO+G,SAAS;YAAEzF,IAAImF;UAAO,CAAA;QAC/B,SAASkD,KAAK;AACZC,yBAAIC,MAAMF,KAAK;YAAE7C,WAAWxF;UAAG,GAAA;;;;;;AAC/BsI,yBAAIE,MAAM,yCAAyCxI,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEmG,0BAAgBI,oBAAoBpF;QACtC;AAEA,YAAIzC,MAAM;AACR,eAAKC,MAAM+E,UAAU;YAAChF;WAAK;AAC3B,cAAI,KAAK4I,aAAa5I,KAAKsB,EAAE,GAAG;AAC9B,iBAAKsH,aAAa5I,KAAKsB,EAAE,EAAE+G,QAAQ,CAAC;UACtC;AACA;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAclH,gBAAgBnB,MAAY+J,eAAyBC,WAAoB;AACrF,SAAKpB,aAAa5I,KAAKsB,EAAE,IAAI,KAAKsH,aAAa5I,KAAKsB,EAAE,SAAK8G,6BAAO,CAAC,CAAA;AACnE,QAAI6B,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKvB,wBAAwBe,IAC3B1J,KAAKsB,QACLiD,qBAAAA,QAAO,MAAA;AAGL,UAAI,CAAC0F,SAAS,CAAC,KAAKtB,wBAAwBwB,IAAInK,KAAKsB,EAAE,GAAG;AACxD;MACF;AACA2I,cAAQ;AAGRhG,aAAO0B,KAAK,KAAK6C,WAAW;AAE5B,WAAKI,aAAa5I,KAAKsB,EAAE,EAAE+G;AAG3B,YAAMrG,QAAwB,CAAA;AAC9B,iBAAW,EAAEV,IAAI0F,WAAWtE,QAAQnB,MAAM6B,WAAW,WAAU,KAAMa,OAAOC,OAAO,KAAKsE,WAAW,GAAG;AACpG,YACE,CAACxB,aACD5D,aAAa2G,iBACZC,aAAazI,SAASyI,aACtBtH,UAAU,CAACA,OAAO1C,IAAAA,GACnB;AACA;QACF;AAEA,aAAKuI,YAAYT,mBAAmBxG;AACpC,aAAKiH,YAAYjB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKU;AACzC,YAAI;AACFvG,gBAAMgE,KAAI,GAAKgB,UAAU;YAAEhH;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAAS2J,KAAK;AACZC,yBAAIC,MAAMF,KAAK;YAAE7C,WAAWxF;UAAG,GAAA;;;;;;AAC/BsI,yBAAIE,MAAM,yCAAyCxI,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEmG,0BAAgBI,oBAAoBpF;QACtC;MACF;AAEA,YAAM+C,MAAMxD,MAAMK,IAAI,CAACC,MAAMA,EAAEhB,EAAE;AACjC,YAAM8I,UAAUF,SAASxH,OAAO,CAACpB,OAAO,CAACkE,IAAIhD,SAASlB,EAAAA,CAAAA;AACtD4I,iBAAW1E;AAGX,WAAKvF,MAAMiG,aACTkE,QAAQ/H,IAAI,CAACwC,YAAY;QAAED,QAAQ5E,KAAKsB;QAAIuD;MAAO,EAAA,GACnD,IAAA;AAEF,WAAK5E,MAAM+E,UAAUhD,KAAAA;AACrB,WAAK/B,MAAM4F,UACT7D,MAAMK,IAAI,CAAC,EAAEf,GAAE,MACbyI,kBAAkB,aAAa;QAAEnF,QAAQ5E,KAAKsB;QAAIuD,QAAQvD;MAAG,IAAI;QAAEsD,QAAQtD;QAAIuD,QAAQ7E,KAAKsB;MAAG,CAAA,CAAA;AAGnG,WAAKrB,MAAMuG,WACTxG,KAAKsB,IACLyI,eACA/H,MAAMK,IAAI,CAAC,EAAEf,GAAE,MAAOA,EAAAA,CAAAA;AAExBU,YAAMmC,QAAQ,CAAC7B,MAAAA;AACb,YAAI,KAAKsG,aAAatG,EAAEhB,EAAE,GAAG;AAC3B,eAAKsH,aAAatG,EAAEhB,EAAE,EAAE+G,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAcjH,cAAcqF,QAAgB;AAC1C,SAAKgC,uBAAuBP,IAAIzB,MAAAA,IAAAA;AAChC,SAAKkC,wBAAwBT,IAAIzB,MAAAA,IAAAA;AACjC,SAAKgC,uBAAuB4B,OAAO5D,MAAAA;AACnC,SAAKkC,wBAAwB0B,OAAO5D,MAAAA;EACtC;AACF;",
-  "names": ["import_signals_core", "import_echo_schema", "import_invariant", "import_util", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "Graph", "constructor", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_constructNode", "create", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "_nodes", "id", "type", "_edges", "inbound", "outbound", "root", "findNode", "toJSON", "maxLength", "seen", "nodes", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "options", "relation", "expansion", "_getNodes", "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", "createExtension", "extension", "resolver", "connector", "actionGroups", "rest", "getId", "arg", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "currentExtension", "all", "toSignal", "subscribe", "get", "thisSignal", "signal", "value", "GraphBuilder", "_dispatcher", "_extensions", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "addExtension", "Array", "isArray", "ext", "removeExtension", "destroy", "clear", "explore", "isNode", "yieldOrContinue", "flatMap", "Promise", "set", "err", "log", "catch", "error", "nodesRelation", "nodesType", "first", "previous", "has", "removed", "delete"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { batch, effect, untracked } from '@preact/signals-core';\n\nimport { asyncTimeout, Trigger } from '@dxos/async';\nimport { type ReactiveObject, create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { 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   * Add nodes to the graph.\n   *\n   * @internal\n   */\n  _addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    nodes: NodeArg<TData, TProperties>[],\n  ): Node<TData, TProperties>[] {\n    return batch(() => nodes.map((node) => this._addNode(node)));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const existingNode = this._nodes[_node.id];\n      const node = existingNode ?? this._constructNode({ data: null, properties: {}, ..._node });\n      if (existingNode) {\n        const { data, properties, type } = _node;\n        if (data && data !== node.data) {\n          node.data = data;\n        }\n\n        if (type !== node.type) {\n          node.type = type;\n        }\n\n        for (const key in properties) {\n          if (properties[key] !== node.properties[key]) {\n            node.properties[key] = properties[key];\n          }\n        }\n      } else {\n        this._nodes[node.id] = node;\n        this._edges[node.id] = create({ inbound: [], outbound: [] });\n      }\n\n      const trigger = this._waitingForNodes[node.id];\n      if (trigger) {\n        trigger.wake(node);\n        delete this._waitingForNodes[node.id];\n      }\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this._addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, relation]) =>\n          relation === 'outbound'\n            ? this._addEdge({ source: node.id, target: id })\n            : this._addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return node as unknown as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param ids The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   * @internal\n   */\n  _removeNodes(ids: string[], edges = false) {\n    batch(() => ids.forEach((id) => this._removeNode(id, edges)));\n  }\n\n  private _removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from connected nodes.\n        this._getNodes({ node }).forEach((node) => {\n          this._removeEdge({ source: id, target: node.id });\n        });\n        this._getNodes({ node, relation: 'inbound' }).forEach((node) => {\n          this._removeEdge({ source: node.id, target: id });\n        });\n\n        // Remove edges from node.\n        delete this._edges[id];\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n      Object.keys(this._initialized)\n        .filter((key) => key.startsWith(id))\n        .forEach((key) => {\n          delete this._initialized[key];\n        });\n      void this._onRemoveNode?.(id);\n    });\n  }\n\n  /**\n   * Add edges to the graph.\n   *\n   * @internal\n   */\n  _addEdges(edges: { source: string; target: string }[]) {\n    batch(() => edges.forEach((edge) => this._addEdge(edge)));\n  }\n\n  private _addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      if (!this._edges[source]) {\n        this._edges[source] = create({ inbound: [], outbound: [] });\n      }\n      if (!this._edges[target]) {\n        this._edges[target] = create({ inbound: [], outbound: [] });\n      }\n\n      const sourceEdges = this._edges[source];\n      if (!sourceEdges.outbound.includes(target)) {\n        sourceEdges.outbound.push(target);\n      }\n\n      const targetEdges = this._edges[target];\n      if (!targetEdges.inbound.includes(source)) {\n        targetEdges.inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Remove edges from the graph.\n   * @internal\n   */\n  _removeEdges(edges: { source: string; target: string }[], removeOrphans = false) {\n    batch(() => edges.forEach((edge) => this._removeEdge(edge, removeOrphans)));\n  }\n\n  private _removeEdge({ source, target }: { source: string; target: string }, removeOrphans = false) {\n    untracked(() => {\n      batch(() => {\n        const outboundIndex = this._edges[source]?.outbound.findIndex((id) => id === target);\n        if (outboundIndex !== undefined && outboundIndex !== -1) {\n          this._edges[source].outbound.splice(outboundIndex, 1);\n        }\n\n        const inboundIndex = this._edges[target]?.inbound.findIndex((id) => id === source);\n        if (inboundIndex !== undefined && inboundIndex !== -1) {\n          this._edges[target].inbound.splice(inboundIndex, 1);\n        }\n\n        if (removeOrphans) {\n          if (\n            this._edges[source]?.outbound.length === 0 &&\n            this._edges[source]?.inbound.length === 0 &&\n            source !== ROOT_ID\n          ) {\n            this._removeNode(source, true);\n          }\n          if (\n            this._edges[target]?.outbound.length === 0 &&\n            this._edges[target]?.inbound.length === 0 &&\n            target !== ROOT_ID\n          ) {\n            this._removeNode(target, true);\n          }\n        }\n      });\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param relation The relation of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   * @ignore\n   */\n  _sortEdges(nodeId: string, relation: Relation, edges: string[]) {\n    untracked(() => {\n      batch(() => {\n        const current = this._edges[nodeId];\n        if (current) {\n          const unsorted = current[relation].filter((id) => !edges.includes(id)) ?? [];\n          const sorted = edges.filter((id) => current[relation].includes(id)) ?? [];\n          current[relation].splice(0, current[relation].length, ...[...sorted, ...unsorted]);\n        }\n      });\n    });\n  }\n\n  private _constructNode = (node: Omit<Node, typeof graphSymbol>) => {\n    return create<NodeInternal>({ ...node, [graphSymbol]: this });\n  };\n\n  private _getNodes({\n    node,\n    relation = 'outbound',\n    type,\n    expansion,\n  }: {\n    node: Node;\n    relation?: Relation;\n    type?: string;\n    expansion?: boolean;\n  }): Node[] {\n    if (expansion) {\n      void this.expand(node, relation, type);\n    }\n\n    const edges = this._edges[node.id];\n    if (!edges) {\n      return [];\n    } else {\n      return edges[relation]\n        .map((id) => this._nodes[id])\n        .filter(nonNullable)\n        .filter((n) => !type || n.type === type);\n    }\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<Node<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type Signal, effect, signal } from '@preact/signals-core';\n\nimport { type UnsubscribeCallback } from '@dxos/async';\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { isNode, type MaybePromise, nonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, Graph, type GraphParams } from './graph';\nimport { type Relation, type NodeArg, type Node, type ActionData, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on just the node id.\n * This is useful for creating the first node in a graph or for hydrating cached nodes with data.\n *\n * @param params.id The id of the node to resolve.\n */\nexport type ResolverExtension = (params: { id: string }) => NodeArg<any> | undefined;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension<T = any> = (params: { node: Node<T> }) => NodeArg<any>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[] | undefined;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension<T = any> = (params: {\n  node: Node<T>;\n}) => Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[] | undefined;\n\ntype GuardedNodeType<T> = T extends (value: any) => value is infer N ? (N extends Node<infer D> ? D : unknown) : never;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.type If provided, all nodes returned are expected to have this type.\n * @param params.filter A filter function to determine if an extension should act on a node.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions<T = any> = {\n  id: string;\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => node is Node<T>;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actions?: ActionsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n  actionGroups?: ActionGroupsExtension<GuardedNodeType<CreateExtensionOptions<T>['filter']>>;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = <T = any>(extension: CreateExtensionOptions<T>): BuilderExtension[] => {\n  const { id, resolver, connector, actions, actionGroups, ...rest } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n  return [\n    resolver ? { id: getId('resolver'), resolver } : undefined,\n    connector ? { ...rest, id: getId('connector'), connector } : undefined,\n    actionGroups\n      ? ({\n          ...rest,\n          id: getId('actionGroups'),\n          type: ACTION_GROUP_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) =>\n            actionGroups({ node })?.map((arg) => ({ ...arg, data: actionGroupSymbol, type: ACTION_GROUP_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          ...rest,\n          id: getId('actions'),\n          type: ACTION_TYPE,\n          relation: 'outbound',\n          connector: ({ node }) => actions({ node })?.map((arg) => ({ ...arg, type: ACTION_TYPE })),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(nonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  node?: Node;\n  relation?: Relation;\n};\n\n/**\n * The dispatcher is used to keep track of the current extension and state when memoizing functions.\n */\nclass Dispatcher {\n  currentExtension?: string;\n  stateIndex = 0;\n  state: Record<string, any[]> = {};\n  cleanup: (() => void)[] = [];\n}\n\nclass BuilderInternal {\n  // This must be static to avoid passing the dispatcher instance to every memoized function.\n  // If the dispatcher is not set that means that the memoized function is being called outside of the graph builder.\n  static currentDispatcher?: Dispatcher;\n}\n\n/**\n * Allows code to be memoized within the context of a graph builder extension.\n * This is useful for creating instances which should be subscribed to rather than recreated.\n */\nexport const memoize = <T>(fn: () => T, key = 'result'): T => {\n  const dispatcher = BuilderInternal.currentDispatcher;\n  invariant(dispatcher?.currentExtension, 'memoize must be called within an extension');\n  const all = dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] ?? {};\n  const current = all[key];\n  const result = current ? current.result : fn();\n  dispatcher.state[dispatcher.currentExtension][dispatcher.stateIndex] = { ...all, [key]: { result } };\n  dispatcher.stateIndex++;\n  return result;\n};\n\n/**\n * Register a cleanup function to be called when the graph builder is destroyed.\n */\nexport const cleanup = (fn: () => void): void => {\n  memoize(() => {\n    const dispatcher = BuilderInternal.currentDispatcher;\n    invariant(dispatcher, 'cleanup must be called within an extension');\n    dispatcher.cleanup.push(fn);\n  });\n};\n\n/**\n * Convert a subscribe/get pair into a signal.\n */\nexport const toSignal = <T>(\n  subscribe: (onChange: () => void) => () => void,\n  get: () => T | undefined,\n  key?: string,\n) => {\n  const thisSignal = memoize(() => {\n    return signal(get());\n  }, key);\n  const unsubscribe = memoize(() => {\n    return subscribe(() => (thisSignal.value = get()));\n  }, key);\n  cleanup(() => {\n    unsubscribe();\n  });\n  return thisSignal.value;\n};\n\nexport type BuilderExtension = {\n  id: string;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  // Only for connector.\n  relation?: Relation;\n  type?: string;\n  filter?: (node: Node) => boolean;\n};\n\ntype ExtensionArg = BuilderExtension | BuilderExtension[] | ExtensionArg[];\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  private readonly _dispatcher = new Dispatcher();\n  private readonly _extensions = create<Record<string, BuilderExtension>>({});\n  private readonly _resolverSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _connectorSubscriptions = new Map<string, UnsubscribeCallback>();\n  private readonly _nodeChanged: Record<string, Signal<{}>> = {};\n  private _graph: Graph;\n\n  constructor(params: Pick<GraphParams, 'nodes' | 'edges'> = {}) {\n    this._graph = new Graph({\n      ...params,\n      onInitialNode: (id) => this._onInitialNode(id),\n      onInitialNodes: (node, relation, type) => this._onInitialNodes(node, relation, type),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string) {\n    if (!pickle) {\n      return new GraphBuilder();\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges });\n  }\n\n  /**\n   * If graph is being restored from a pickle, the data will be null.\n   * Initialize the data of each node by calling resolvers.\n   */\n  async initialize() {\n    return Promise.all(Object.keys(this._graph._nodes).map((id) => this._onInitialNode(id)));\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(extension: ExtensionArg): GraphBuilder {\n    if (Array.isArray(extension)) {\n      extension.forEach((ext) => this.addExtension(ext));\n      return this;\n    }\n\n    this._dispatcher.state[extension.id] = [];\n    this._extensions[extension.id] = extension;\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    delete this._extensions[id];\n    return this;\n  }\n\n  destroy() {\n    this._dispatcher.cleanup.forEach((fn) => fn());\n    this._resolverSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._connectorSubscriptions.forEach((unsubscribe) => unsubscribe());\n    this._resolverSubscriptions.clear();\n    this._connectorSubscriptions.clear();\n  }\n\n  /**\n   * A graph traversal using just the connector extensions, without subscribing to any signals or persisting any nodes.\n   */\n  async explore(\n    { node = this._graph.root, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ) {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._extensions)\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .filter((extension) => !extension.filter || extension.filter(node))\n      .flatMap((extension) => {\n        this._dispatcher.currentExtension = extension.id;\n        this._dispatcher.stateIndex = 0;\n        BuilderInternal.currentDispatcher = this._dispatcher;\n        const result = extension.connector?.({ node }) ?? [];\n        BuilderInternal.currentDispatcher = undefined;\n        return result;\n      })\n      .map(\n        (arg): Node => ({\n          id: arg.id,\n          type: arg.type,\n          data: arg.data ?? null,\n          properties: arg.properties ?? {},\n        }),\n      );\n\n    await Promise.all(nodes.map((n) => this.explore({ node: n, relation, visitor }, [...path, node.id])));\n  }\n\n  private async _onInitialNode(nodeId: string) {\n    this._nodeChanged[nodeId] = this._nodeChanged[nodeId] ?? signal({});\n    this._resolverSubscriptions.set(\n      nodeId,\n      effect(() => {\n        for (const { id, resolver } of Object.values(this._extensions)) {\n          if (!resolver) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          let node: NodeArg<any> | undefined;\n          try {\n            node = resolver({ id: nodeId });\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n\n          if (node) {\n            this.graph._addNodes([node]);\n            if (this._nodeChanged[node.id]) {\n              this._nodeChanged[node.id].value = {};\n            }\n            break;\n          }\n        }\n      }),\n    );\n  }\n\n  private async _onInitialNodes(node: Node, nodesRelation: Relation, nodesType?: string) {\n    this._nodeChanged[node.id] = this._nodeChanged[node.id] ?? signal({});\n    let first = true;\n    let previous: string[] = [];\n    this._connectorSubscriptions.set(\n      node.id,\n      effect(() => {\n        // TODO(wittjosiah): This is a workaround for a race between the node removal and the effect re-running.\n        //   To cause this case to happen, remove a collection and then undo the removal.\n        if (!first && !this._connectorSubscriptions.has(node.id)) {\n          return;\n        }\n        first = false;\n\n        // Subscribe to extensions being added.\n        Object.keys(this._extensions);\n        // Subscribe to connected node changes.\n        this._nodeChanged[node.id].value;\n\n        // TODO(wittjosiah): Consider allowing extensions to collaborate on the same node by merging their results.\n        const nodes: NodeArg<any>[] = [];\n        for (const { id, connector, filter, type, relation = 'outbound' } of Object.values(this._extensions)) {\n          if (\n            !connector ||\n            relation !== nodesRelation ||\n            (nodesType && type !== nodesType) ||\n            (filter && !filter(node))\n          ) {\n            continue;\n          }\n\n          this._dispatcher.currentExtension = id;\n          this._dispatcher.stateIndex = 0;\n          BuilderInternal.currentDispatcher = this._dispatcher;\n          try {\n            nodes.push(...(connector({ node }) ?? []));\n          } catch (err) {\n            log.catch(err, { extension: id });\n            log.error(`Previous error occurred in extension: ${id}`);\n          } finally {\n            BuilderInternal.currentDispatcher = undefined;\n          }\n        }\n\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        // Remove edges and only remove nodes that are orphaned.\n        this.graph._removeEdges(\n          removed.map((target) => ({ source: node.id, target })),\n          true,\n        );\n        this.graph._addNodes(nodes);\n        this.graph._addEdges(\n          nodes.map(({ id }) =>\n            nodesRelation === 'outbound' ? { source: node.id, target: id } : { source: id, target: node.id },\n          ),\n        );\n        this.graph._sortEdges(\n          node.id,\n          nodesRelation,\n          nodes.map(({ id }) => id),\n        );\n        nodes.forEach((n) => {\n          if (this._nodeChanged[n.id]) {\n            this._nodeChanged[n.id].value = {};\n          }\n        });\n      }),\n    );\n  }\n\n  private async _onRemoveNode(nodeId: string) {\n    this._resolverSubscriptions.get(nodeId)?.();\n    this._connectorSubscriptions.get(nodeId)?.();\n    this._resolverSubscriptions.delete(nodeId);\n    this._connectorSubscriptions.delete(nodeId);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAAyC;AAEzC,mBAAsC;AACtC,yBAA4C;AAC5C,uBAA0B;AAC1B,iBAAoB;AACpB,kBAA4B;AEN5B,IAAAA,uBAA4C;AAG5C,IAAAC,sBAAuB;AACvB,IAAAC,oBAA0B;AAC1B,IAAAC,cAAoB;AACpB,IAAAC,eAAuD;ADgChD,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;AD/E7G,IAAMO,cAAcH,OAAO,OAAA;AAIpB,IAAMI,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBF,WAAAA;AACrCI,kCAAUD,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAME,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAUjC,IAAMC,iBAAiB,CAACP,aAAeQ,+BAAU,MAAM,CAACX,aAAaG,IAAAA,CAAAA;AA0C9D,IAAMS,QAAN,MAAMA,OAAAA;EAkBXC,YAAY,EAAEC,OAAOC,OAAOC,eAAeC,gBAAgBC,aAAY,IAAkB,CAAC,GAAG;AAb5EC,SAAAA,mBAAkD,CAAC;AACnDC,SAAAA,eAAwC,CAAC;kBAKM,CAAC;kBAK4B,CAAC;AA+btFC,SAAAA,iBAAiB,CAAClB,SAAAA;AACxB,iBAAOmB,2BAAqB;QAAE,GAAGnB;QAAM,CAACF,WAAAA,GAAc;MAAK,CAAA;IAC7D;AA9bE,SAAKsB,OAAOjB,OAAAA,IAAW,KAAKe,eAAe;MAAEG,IAAIlB;MAASmB,MAAMlB;MAAWZ,YAAY,CAAC;MAAGD,MAAM;IAAK,CAAA;AACtG,QAAIoB,OAAO;AACTA,YAAMY,QAAQ,CAACvB,SAAAA;AACb,YAAIA,KAAKsB,SAASjB,aAAa;AAC7B,eAAKmB,SAAS;YAAE,GAAGxB;YAAMT,MAAM,MAAMkC,eAAIC,KAAK,6BAAA,QAAA;;;;;;UAA6B,CAAA;QAC7E,WAAW1B,KAAKsB,SAAShB,mBAAmB;AAC1C,eAAKkB,SAAS;YAAE,GAAGxB;YAAMT,MAAMG;UAAkB,CAAA;QACnD,OAAO;AACL,eAAK8B,SAASxB,IAAAA;QAChB;MACF,CAAA;IACF;AAEA,SAAK2B,OAAOxB,OAAAA,QAAWgB,2BAAO;MAAES,SAAS,CAAA;MAAIC,UAAU,CAAA;IAAG,CAAA;AAC1D,QAAIjB,OAAO;AACTkB,aAAOC,QAAQnB,KAAAA,EAAOW,QAAQ,CAAC,CAACS,QAAQpB,MAAAA,MAAM;AAC5CA,eAAMW,QAAQ,CAACU,WAAAA;AACb,eAAKC,SAAS;YAAEF;YAAQC;UAAO,CAAA;QACjC,CAAA;AACA,aAAKE,WAAWH,QAAQ,YAAYpB,MAAAA;MACtC,CAAA;IACF;AAEA,SAAKwB,iBAAiBvB;AACtB,SAAKwB,kBAAkBvB;AACvB,SAAKwB,gBAAgBvB;EACvB;EAEA,OAAOwB,KAAKC,QAAgBC,UAAgD,CAAC,GAAG;AAC9E,UAAM,EAAE9B,OAAOC,MAAK,IAAK8B,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAI/B,OAAM;MAAEE;MAAOC;MAAO,GAAG6B;IAAQ,CAAA;EAC9C;;;;EAKA,IAAIG,OAAO;AACT,WAAO,KAAKC,SAAS1C,OAAAA;EACvB;;;;EAKA2C,OAAO,EAAEzB,KAAKlB,SAAS4C,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAAC9C,MAAYgD,OAAiB,CAAA,MAAE;AAC7C,YAAMrC,QAAQ,KAAKA,MAAMX,IAAAA;AACzB,YAAMiD,MAA2B;QAC/B5B,IAAIrB,KAAKqB,GAAG6B,SAASH,YAAY,GAAG/C,KAAKqB,GAAG8B,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAU/C,KAAKqB;QAChFC,MAAMtB,KAAKsB;MACb;AACA,UAAItB,KAAKR,WAAW4D,OAAO;AACzBH,YAAIG,QAAQpD,KAAKR,WAAW4D;MAC9B;AACA,UAAIzC,MAAMuC,QAAQ;AAChBD,YAAItC,QAAQA,MACT0C,IAAI,CAACC,MAAAA;AAEJ,gBAAMC,WAAW;eAAIP;YAAMhD,KAAKqB;;AAChC,iBAAOkC,SAASC,SAASF,EAAEjC,EAAE,IAAIoC,SAAYX,OAAOQ,GAAGC,QAAAA;QACzD,CAAA,EACCG,OAAOC,uBAAAA;MACZ;AACA,aAAOV;IACT;AAEA,UAAML,OAAO,KAAKC,SAASxB,EAAAA;AAC3BnB,oCAAU0C,MAAM,mBAAmBvB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOyB,OAAOF,IAAAA;EAChB;EAEAJ,SAAS;AACP,UAAM7B,QAAQmB,OAAO8B,OAAO,KAAKxC,MAAM,EAAEiC,IAAI,CAACrD,SAAAA;AAC5C,aAAO;QACLqB,IAAIrB,KAAKqB;QACTC,MAAMtB,KAAKsB;QACX9B,YAAYQ,KAAKR;MACnB;IACF,CAAA;AAEA,UAAMoB,QAAQkB,OAAO+B,YACnB/B,OAAOC,QAAQ,KAAKJ,MAAM,EACvB0B,IAAI,CAAC,CAAChC,IAAI,EAAEQ,SAAQ,CAAE,MAA0B;MAACR;MAAIQ;KAAS,EAC9DiC,SAAS,CAAC,CAACC,CAAAA,GAAI,CAACC,CAAAA,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA,CAAAA;AAG5C,WAAOtB,KAAKwB,UAAU;MAAEvD;MAAOC;IAAM,CAAA;EACvC;;;;;;;EAQAiC,SAASxB,IAAY8C,YAAY,MAAwB;AACvD,UAAMC,eAAe,KAAKhD,OAAOC,EAAAA;AACjC,QAAI,CAAC+C,gBAAgBD,WAAW;AAC9B,WAAK,KAAK/B,iBAAiBf,EAAAA;IAC7B;AAEA,WAAO+C;EACT;;;;;;;;;EAUA,MAAMC,YAAYhD,IAAYiD,SAAiC;AAC7D,UAAMC,UAAU,KAAKvD,iBAAiBK,EAAAA,MAAQ,KAAKL,iBAAiBK,EAAAA,IAAM,IAAImD,qBAAAA;AAC9E,UAAMxE,OAAO,KAAK6C,SAASxB,EAAAA;AAC3B,QAAIrB,MAAM;AACR,aAAO,KAAKgB,iBAAiBK,EAAAA;AAC7B,aAAOrB;IACT;AAEA,QAAIsE,YAAYb,QAAW;AACzB,aAAOc,QAAQE,KAAI;IACrB,OAAO;AACL,iBAAOC,2BAAaH,QAAQE,KAAI,GAAIH,SAAS,mBAAmBjD,EAAAA,EAAI;IACtE;EACF;;;;EAKAV,MAAoEX,MAAYyC,UAA8B,CAAC,GAAG;AAChH,UAAM,EAAEkC,UAAUR,WAAWT,SAASnD,gBAAgBe,KAAI,IAAKmB;AAC/D,UAAM9B,QAAQ,KAAKiE,UAAU;MAAE5E;MAAM2E;MAAUR;MAAW7C;IAAK,CAAA;AAC/D,WAAOX,MAAM+C,OAAO,CAACJ,MAAMI,OAAOJ,GAAGtD,IAAAA,CAAAA;EACvC;;;;EAKAY,MAAMZ,MAAY,EAAE2E,WAAW,WAAU,IAA8B,CAAC,GAAG;AACzE,WAAO,KAAKhD,OAAO3B,KAAKqB,EAAE,IAAIsD,QAAAA,KAAa,CAAA;EAC7C;;;;EAKAE,QAAQ7E,MAAY,EAAEmE,UAAS,IAA8B,CAAC,GAAG;AAC/D,WAAO;SACF,KAAKS,UAAU;QAAE5E;QAAMmE;QAAW7C,MAAMhB;MAAkB,CAAA;SAC1D,KAAKsE,UAAU;QAAE5E;QAAMmE;QAAW7C,MAAMjB;MAAY,CAAA;;EAE3D;EAEA,MAAMyE,OAAO9E,MAAY2E,WAAqB,YAAYrD,MAAe;AACvE,UAAMyD,MAAM,KAAKC,KAAKhF,MAAM2E,UAAUrD,IAAAA;AACtC,UAAM2D,cAAc,KAAKhE,aAAa8D,GAAAA;AACtC,QAAI,CAACE,eAAe,KAAK5C,iBAAiB;AACxC,YAAM,KAAKA,gBAAgBrC,MAAM2E,UAAUrD,IAAAA;AAC3C,WAAKL,aAAa8D,GAAAA,IAAO;IAC3B;EACF;EAEQC,KAAKhF,MAAY2E,UAAoBrD,MAAe;AAC1D,WAAO,GAAGtB,KAAKqB,EAAE,IAAIsD,QAAAA,IAAYrD,IAAAA;EACnC;;;;;;;;EASA4D,SACE,EAAEC,SAASnF,OAAO,KAAK4C,MAAM+B,WAAW,YAAYR,UAAS,GAC7DiB,OAAiB,CAAA,GACX;AAEN,QAAIA,KAAK5B,SAASxD,KAAKqB,EAAE,GAAG;AAC1B;IACF;AAEA,UAAMgE,iBAAiBF,QAAQnF,MAAM;SAAIoF;MAAMpF,KAAKqB;KAAG;AACvD,QAAIgE,mBAAmB,OAAO;AAC5B;IACF;AAEAvD,WAAO8B,OAAO,KAAKgB,UAAU;MAAE5E;MAAM2E;MAAUR;IAAU,CAAA,CAAA,EAAI5C,QAAQ,CAAC+D,UACpE,KAAKJ,SAAS;MAAElF,MAAMsF;MAAOX;MAAUQ;MAAShB;IAAU,GAAG;SAAIiB;MAAMpF,KAAKqB;KAAG,CAAA;EAEnF;;;;;;;;EASAkE,kBACE,EAAEJ,SAASnF,OAAO,KAAK4C,MAAM+B,WAAW,YAAYR,UAAS,GAC7DqB,cAAwB,CAAA,GACxB;AACA,eAAOC,4BAAO,MAAA;AACZ,YAAML,OAAO;WAAII;QAAaxF,KAAKqB;;AACnC,YAAMqE,SAASP,QAAQnF,MAAMoF,IAAAA;AAC7B,UAAIM,WAAW,OAAO;AACpB;MACF;AAEA,YAAM/E,QAAQ,KAAKiE,UAAU;QAAE5E;QAAM2E;QAAUR;MAAU,CAAA;AACzD,YAAMwB,oBAAoBhF,MAAM0C,IAAI,CAACC,MAAM,KAAKiC,kBAAkB;QAAEvF,MAAMsD;QAAG6B;QAAShB;MAAU,GAAGiB,IAAAA,CAAAA;AAEnG,aAAO,MAAA;AACLO,0BAAkBpE,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;MAC7C;IACF,CAAA;EACF;;;;EAKAC,QAAQ,EAAE7D,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAM6D,QAAQ,KAAKjD,SAASb,MAAAA;AAC5B,QAAI,CAAC8D,OAAO;AACV,aAAOrC;IACT;AAEA,QAAIsC;AACJ,SAAKb,SAAS;MACZlF,MAAM8F;MACNX,SAAS,CAACnF,MAAMoF,SAAAA;AACd,YAAIW,OAAO;AACT,iBAAO;QACT;AAEA,YAAI/F,KAAKqB,OAAOY,QAAQ;AACtB8D,kBAAQX;QACV;MACF;IACF,CAAA;AAEA,WAAOW;EACT;;;;;;EAOAC,UACErF,OAC4B;AAC5B,eAAOsF,2BAAM,MAAMtF,MAAM0C,IAAI,CAACrD,SAAS,KAAKwB,SAASxB,IAAAA,CAAAA,CAAAA;EACvD;EAEQwB,SAA+E,EACrFb,OACAC,OACA,GAAGsF,MAAAA,GACqD;AACxD,eAAO1F,+BAAU,MAAA;AACf,YAAM4D,eAAe,KAAKhD,OAAO8E,MAAM7E,EAAE;AACzC,YAAMrB,OAAOoE,gBAAgB,KAAKlD,eAAe;QAAE3B,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAG0G;MAAM,CAAA;AACxF,UAAI9B,cAAc;AAChB,cAAM,EAAE7E,MAAMC,YAAY8B,KAAI,IAAK4E;AACnC,YAAI3G,QAAQA,SAASS,KAAKT,MAAM;AAC9BS,eAAKT,OAAOA;QACd;AAEA,YAAI+B,SAAStB,KAAKsB,MAAM;AACtBtB,eAAKsB,OAAOA;QACd;AAEA,mBAAWyD,OAAOvF,YAAY;AAC5B,cAAIA,WAAWuF,GAAAA,MAAS/E,KAAKR,WAAWuF,GAAAA,GAAM;AAC5C/E,iBAAKR,WAAWuF,GAAAA,IAAOvF,WAAWuF,GAAAA;UACpC;QACF;MACF,OAAO;AACL,aAAK3D,OAAOpB,KAAKqB,EAAE,IAAIrB;AACvB,aAAK2B,OAAO3B,KAAKqB,EAAE,QAAIF,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC5D;AAEA,YAAM0C,UAAU,KAAKvD,iBAAiBhB,KAAKqB,EAAE;AAC7C,UAAIkD,SAAS;AACXA,gBAAQ4B,KAAKnG,IAAAA;AACb,eAAO,KAAKgB,iBAAiBhB,KAAKqB,EAAE;MACtC;AAEA,UAAIV,OAAO;AACTA,cAAMY,QAAQ,CAAC6E,YAAAA;AACb,eAAK5E,SAAS4E,OAAAA;AACd,eAAKlE,SAAS;YAAEF,QAAQhC,KAAKqB;YAAIY,QAAQmE,QAAQ/E;UAAG,CAAA;QACtD,CAAA;MACF;AAEA,UAAIT,OAAO;AACTA,cAAMW,QAAQ,CAAC,CAACF,IAAIsD,QAAAA,MAClBA,aAAa,aACT,KAAKzC,SAAS;UAAEF,QAAQhC,KAAKqB;UAAIY,QAAQZ;QAAG,CAAA,IAC5C,KAAKa,SAAS;UAAEF,QAAQX;UAAIY,QAAQjC,KAAKqB;QAAG,CAAA,CAAA;MAEpD;AAEA,aAAOrB;IACT,CAAA;EACF;;;;;;;;EASAqG,aAAaC,KAAe1F,QAAQ,OAAO;AACzCqF,mCAAM,MAAMK,IAAI/E,QAAQ,CAACF,OAAO,KAAKkF,YAAYlF,IAAIT,KAAAA,CAAAA,CAAAA;EACvD;EAEQ2F,YAAYlF,IAAYT,QAAQ,OAAO;AAC7CJ,uCAAU,MAAA;AACR,YAAMR,OAAO,KAAK6C,SAASxB,EAAAA;AAC3B,UAAI,CAACrB,MAAM;AACT;MACF;AAEA,UAAIY,OAAO;AAET,aAAKgE,UAAU;UAAE5E;QAAK,CAAA,EAAGuB,QAAQ,CAACvB,UAAAA;AAChC,eAAKwG,YAAY;YAAExE,QAAQX;YAAIY,QAAQjC,MAAKqB;UAAG,CAAA;QACjD,CAAA;AACA,aAAKuD,UAAU;UAAE5E;UAAM2E,UAAU;QAAU,CAAA,EAAGpD,QAAQ,CAACvB,UAAAA;AACrD,eAAKwG,YAAY;YAAExE,QAAQhC,MAAKqB;YAAIY,QAAQZ;UAAG,CAAA;QACjD,CAAA;AAGA,eAAO,KAAKM,OAAON,EAAAA;MACrB;AAGA,aAAO,KAAKD,OAAOC,EAAAA;AACnBS,aAAO2E,KAAK,KAAKxF,YAAY,EAC1ByC,OAAO,CAACqB,QAAQA,IAAI2B,WAAWrF,EAAAA,CAAAA,EAC/BE,QAAQ,CAACwD,QAAAA;AACR,eAAO,KAAK9D,aAAa8D,GAAAA;MAC3B,CAAA;AACF,WAAK,KAAKzC,gBAAgBjB,EAAAA;IAC5B,CAAA;EACF;;;;;;EAOAsF,UAAU/F,OAA6C;AACrDqF,mCAAM,MAAMrF,MAAMW,QAAQ,CAACqF,SAAS,KAAK1E,SAAS0E,IAAAA,CAAAA,CAAAA;EACpD;EAEQ1E,SAAS,EAAEF,QAAQC,OAAM,GAAwC;AACvEzB,uCAAU,MAAA;AACR,UAAI,CAAC,KAAKmB,OAAOK,MAAAA,GAAS;AACxB,aAAKL,OAAOK,MAAAA,QAAUb,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AACA,UAAI,CAAC,KAAKF,OAAOM,MAAAA,GAAS;AACxB,aAAKN,OAAOM,MAAAA,QAAUd,2BAAO;UAAES,SAAS,CAAA;UAAIC,UAAU,CAAA;QAAG,CAAA;MAC3D;AAEA,YAAMgF,cAAc,KAAKlF,OAAOK,MAAAA;AAChC,UAAI,CAAC6E,YAAYhF,SAAS2B,SAASvB,MAAAA,GAAS;AAC1C4E,oBAAYhF,SAASiF,KAAK7E,MAAAA;MAC5B;AAEA,YAAM8E,cAAc,KAAKpF,OAAOM,MAAAA;AAChC,UAAI,CAAC8E,YAAYnF,QAAQ4B,SAASxB,MAAAA,GAAS;AACzC+E,oBAAYnF,QAAQkF,KAAK9E,MAAAA;MAC3B;IACF,CAAA;EACF;;;;;EAMAgF,aAAapG,OAA6CqG,gBAAgB,OAAO;AAC/EhB,mCAAM,MAAMrF,MAAMW,QAAQ,CAACqF,SAAS,KAAKJ,YAAYI,MAAMK,aAAAA,CAAAA,CAAAA;EAC7D;EAEQT,YAAY,EAAExE,QAAQC,OAAM,GAAwCgF,gBAAgB,OAAO;AACjGzG,uCAAU,MAAA;AACRyF,qCAAM,MAAA;AACJ,cAAMiB,gBAAgB,KAAKvF,OAAOK,MAAAA,GAASH,SAASsF,UAAU,CAAC9F,OAAOA,OAAOY,MAAAA;AAC7E,YAAIiF,kBAAkBzD,UAAayD,kBAAkB,IAAI;AACvD,eAAKvF,OAAOK,MAAAA,EAAQH,SAASuF,OAAOF,eAAe,CAAA;QACrD;AAEA,cAAMG,eAAe,KAAK1F,OAAOM,MAAAA,GAASL,QAAQuF,UAAU,CAAC9F,OAAOA,OAAOW,MAAAA;AAC3E,YAAIqF,iBAAiB5D,UAAa4D,iBAAiB,IAAI;AACrD,eAAK1F,OAAOM,MAAAA,EAAQL,QAAQwF,OAAOC,cAAc,CAAA;QACnD;AAEA,YAAIJ,eAAe;AACjB,cACE,KAAKtF,OAAOK,MAAAA,GAASH,SAASqB,WAAW,KACzC,KAAKvB,OAAOK,MAAAA,GAASJ,QAAQsB,WAAW,KACxClB,WAAW7B,SACX;AACA,iBAAKoG,YAAYvE,QAAQ,IAAA;UAC3B;AACA,cACE,KAAKL,OAAOM,MAAAA,GAASJ,SAASqB,WAAW,KACzC,KAAKvB,OAAOM,MAAAA,GAASL,QAAQsB,WAAW,KACxCjB,WAAW9B,SACX;AACA,iBAAKoG,YAAYtE,QAAQ,IAAA;UAC3B;QACF;MACF,CAAA;IACF,CAAA;EACF;;;;;;;;;;;EAYAE,WAAWmF,QAAgB3C,UAAoB/D,OAAiB;AAC9DJ,uCAAU,MAAA;AACRyF,qCAAM,MAAA;AACJ,cAAMsB,UAAU,KAAK5F,OAAO2F,MAAAA;AAC5B,YAAIC,SAAS;AACX,gBAAMC,WAAWD,QAAQ5C,QAAAA,EAAUjB,OAAO,CAACrC,OAAO,CAACT,MAAM4C,SAASnC,EAAAA,CAAAA,KAAQ,CAAA;AAC1E,gBAAMoG,SAAS7G,MAAM8C,OAAO,CAACrC,OAAOkG,QAAQ5C,QAAAA,EAAUnB,SAASnC,EAAAA,CAAAA,KAAQ,CAAA;AACvEkG,kBAAQ5C,QAAAA,EAAUyC,OAAO,GAAGG,QAAQ5C,QAAAA,EAAUzB,QAAM,GAAK;eAAIuE;eAAWD;WAAS;QACnF;MACF,CAAA;IACF,CAAA;EACF;EAMQ5C,UAAU,EAChB5E,MACA2E,WAAW,YACXrD,MACA6C,UAAS,GAMA;AACT,QAAIA,WAAW;AACb,WAAK,KAAKW,OAAO9E,MAAM2E,UAAUrD,IAAAA;IACnC;AAEA,UAAMV,QAAQ,KAAKe,OAAO3B,KAAKqB,EAAE;AACjC,QAAI,CAACT,OAAO;AACV,aAAO,CAAA;IACT,OAAO;AACL,aAAOA,MAAM+D,QAAAA,EACVtB,IAAI,CAAChC,OAAO,KAAKD,OAAOC,EAAAA,CAAG,EAC3BqC,OAAOC,uBAAAA,EACPD,OAAO,CAACJ,MAAM,CAAChC,QAAQgC,EAAEhC,SAASA,IAAAA;IACvC;EACF;AACF;;AEnfO,IAAMoG,kBAAkB,CAAUC,cAAAA;AACvC,QAAM,EAAEtG,IAAIuG,UAAUC,WAAWhD,SAASiD,cAAc,GAAGC,KAAAA,IAASJ;AACpE,QAAMK,QAAQ,CAACjD,QAAgB,GAAG1D,EAAAA,IAAM0D,GAAAA;AACxC,SAAO;IACL6C,WAAW;MAAEvG,IAAI2G,MAAM,UAAA;MAAaJ;IAAS,IAAInE;IACjDoE,YAAY;MAAE,GAAGE;MAAM1G,IAAI2G,MAAM,WAAA;MAAcH;IAAU,IAAIpE;IAC7DqE,eACK;MACC,GAAGC;MACH1G,IAAI2G,MAAM,cAAA;MACV1G,MAAMhB;MACNqE,UAAU;MACVkD,WAAW,CAAC,EAAE7H,KAAI,MAChB8H,aAAa;QAAE9H;MAAK,CAAA,GAAIqD,IAAI,CAAC4E,SAAS;QAAE,GAAGA;QAAK1I,MAAMG;QAAmB4B,MAAMhB;MAAkB,EAAA;IACrG,IACAmD;IACJoB,UACK;MACC,GAAGkD;MACH1G,IAAI2G,MAAM,SAAA;MACV1G,MAAMjB;MACNsE,UAAU;MACVkD,WAAW,CAAC,EAAE7H,KAAI,MAAO6E,QAAQ;QAAE7E;MAAK,CAAA,GAAIqD,IAAI,CAAC4E,SAAS;QAAE,GAAGA;QAAK3G,MAAMjB;MAAY,EAAA;IACxF,IACAoD;IACJC,OAAOC,aAAAA,WAAAA;AACX;AAWA,IAAMuE,aAAN,MAAMA;EAAN,cAAA;AAEEC,SAAAA,aAAa;AACbC,SAAAA,QAA+B,CAAC;AAChCC,SAAAA,UAA0B,CAAA;;AAC5B;AAEA,IAAMC,kBAAN,MAAMA;AAIN;AAMO,IAAMC,UAAU,CAAIC,IAAazD,MAAM,aAAQ;AACpD,QAAM0D,aAAaH,gBAAgBI;AACnCxI,wBAAAA,WAAUuI,YAAYE,kBAAkB,8CAAA;;;;;;;;;AACxC,QAAMC,MAAMH,WAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,KAAK,CAAC;AACrF,QAAMZ,UAAUqB,IAAI7D,GAAAA;AACpB,QAAMW,SAAS6B,UAAUA,QAAQ7B,SAAS8C,GAAAA;AAC1CC,aAAWL,MAAMK,WAAWE,gBAAgB,EAAEF,WAAWN,UAAU,IAAI;IAAE,GAAGS;IAAK,CAAC7D,GAAAA,GAAM;MAAEW;IAAO;EAAE;AACnG+C,aAAWN;AACX,SAAOzC;AACT;AAKO,IAAM2C,UAAU,CAACG,OAAAA;AACtBD,UAAQ,MAAA;AACN,UAAME,aAAaH,gBAAgBI;AACnCxI,0BAAAA,WAAUuI,YAAY,8CAAA;;;;;;;;;AACtBA,eAAWJ,QAAQvB,KAAK0B,EAAAA;EAC1B,CAAA;AACF;AAKO,IAAMK,WAAW,CACtBC,WACAC,KACAhE,QAAAA;AAEA,QAAMiE,aAAaT,QAAQ,MAAA;AACzB,eAAOU,6BAAOF,IAAAA,CAAAA;EAChB,GAAGhE,GAAAA;AACH,QAAMa,cAAc2C,QAAQ,MAAA;AAC1B,WAAOO,UAAU,MAAOE,WAAWE,QAAQH,IAAAA,CAAAA;EAC7C,GAAGhE,GAAAA;AACHsD,UAAQ,MAAA;AACNzC,gBAAAA;EACF,CAAA;AACA,SAAOoD,WAAWE;AACpB;AAoBO,IAAMC,eAAN,MAAMA,cAAAA;EAQXzI,YAAY0I,SAA+C,CAAC,GAAG;AAP9CC,SAAAA,cAAc,IAAInB,WAAAA;AAClBoB,SAAAA,kBAAcnI,oBAAAA,QAAyC,CAAC,CAAA;AACxDoI,SAAAA,yBAAyB,oBAAIC,IAAAA;AAC7BC,SAAAA,0BAA0B,oBAAID,IAAAA;AAC9BE,SAAAA,eAA2C,CAAC;AAI3D,SAAKC,SAAS,IAAIlJ,MAAM;MACtB,GAAG2I;MACHvI,eAAe,CAACQ,OAAO,KAAKe,eAAef,EAAAA;MAC3CP,gBAAgB,CAACd,MAAM2E,UAAUrD,SAAS,KAAKe,gBAAgBrC,MAAM2E,UAAUrD,IAAAA;MAC/EP,cAAc,CAACM,OAAO,KAAKiB,cAAcjB,EAAAA;IAC3C,CAAA;EACF;EAEA,OAAOkB,KAAKC,QAAiB;AAC3B,QAAI,CAACA,QAAQ;AACX,aAAO,IAAI2G,cAAAA;IACb;AAEA,UAAM,EAAExI,OAAOC,MAAK,IAAK8B,KAAKC,MAAMH,MAAAA;AACpC,WAAO,IAAI2G,cAAa;MAAExI;MAAOC;IAAM,CAAA;EACzC;;;;;EAMA,MAAMgJ,aAAa;AACjB,WAAOC,QAAQjB,IAAI9G,OAAO2E,KAAK,KAAKkD,OAAOvI,MAAM,EAAEiC,IAAI,CAAChC,OAAO,KAAKe,eAAef,EAAAA,CAAAA,CAAAA;EACrF;EAEA,IAAIpB,QAAQ;AACV,WAAO,KAAK0J;EACd;;;;EAKAG,aAAanC,WAAuC;AAClD,QAAIoC,MAAMC,QAAQrC,SAAAA,GAAY;AAC5BA,gBAAUpG,QAAQ,CAAC0I,QAAQ,KAAKH,aAAaG,GAAAA,CAAAA;AAC7C,aAAO;IACT;AAEA,SAAKZ,YAAYjB,MAAMT,UAAUtG,EAAE,IAAI,CAAA;AACvC,SAAKiI,YAAY3B,UAAUtG,EAAE,IAAIsG;AACjC,WAAO;EACT;;;;EAKAuC,gBAAgB7I,IAA0B;AACxC,WAAO,KAAKiI,YAAYjI,EAAAA;AACxB,WAAO;EACT;EAEA8I,UAAU;AACR,SAAKd,YAAYhB,QAAQ9G,QAAQ,CAACiH,OAAOA,GAAAA,CAAAA;AACzC,SAAKe,uBAAuBhI,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;AACrD,SAAK6D,wBAAwBlI,QAAQ,CAACqE,gBAAgBA,YAAAA,CAAAA;AACtD,SAAK2D,uBAAuBa,MAAK;AACjC,SAAKX,wBAAwBW,MAAK;EACpC;;;;EAKA,MAAMC,QACJ,EAAErK,OAAO,KAAK2J,OAAO/G,MAAM+B,WAAW,YAAYQ,QAAO,GACzDC,OAAiB,CAAA,GACjB;AAEA,QAAIA,KAAK5B,SAASxD,KAAKqB,EAAE,GAAG;AAC1B;IACF;AAIA,QAAI,KAACiJ,qBAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AACA,UAAMlF,iBAAiB,MAAMF,QAAQnF,MAAM;SAAIoF;MAAMpF,KAAKqB;KAAG;AAC7D,QAAIgE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAM1E,QAAQmB,OAAO8B,OAAO,KAAK0F,WAAW,EACzC5F,OAAO,CAACiE,cAAchD,cAAcgD,UAAUhD,YAAY,WAAS,EACnEjB,OAAO,CAACiE,cAAc,CAACA,UAAUjE,UAAUiE,UAAUjE,OAAO1D,IAAAA,CAAAA,EAC5DwK,QAAQ,CAAC7C,cAAAA;AACR,WAAK0B,YAAYV,mBAAmBhB,UAAUtG;AAC9C,WAAKgI,YAAYlB,aAAa;AAC9BG,sBAAgBI,oBAAoB,KAAKW;AACzC,YAAM3D,SAASiC,UAAUE,YAAY;QAAE7H;MAAK,CAAA,KAAM,CAAA;AAClDsI,sBAAgBI,oBAAoBjF;AACpC,aAAOiC;IACT,CAAA,EACCrC,IACC,CAAC4E,SAAe;MACd5G,IAAI4G,IAAI5G;MACRC,MAAM2G,IAAI3G;MACV/B,MAAM0I,IAAI1I,QAAQ;MAClBC,YAAYyI,IAAIzI,cAAc,CAAC;IACjC,EAAA;AAGJ,UAAMqK,QAAQjB,IAAIjI,MAAM0C,IAAI,CAACC,MAAM,KAAK+G,QAAQ;MAAErK,MAAMsD;MAAGqB;MAAUQ;IAAQ,GAAG;SAAIC;MAAMpF,KAAKqB;KAAG,CAAA,CAAA;EACpG;EAEA,MAAce,eAAekF,QAAgB;AAC3C,SAAKoC,aAAapC,MAAAA,IAAU,KAAKoC,aAAapC,MAAAA,SAAW2B,6BAAO,CAAC,CAAA;AACjE,SAAKM,uBAAuBkB,IAC1BnD,YACA7B,qBAAAA,QAAO,MAAA;AACL,iBAAW,EAAEpE,IAAIuG,SAAQ,KAAM9F,OAAO8B,OAAO,KAAK0F,WAAW,GAAG;AAC9D,YAAI,CAAC1B,UAAU;AACb;QACF;AAEA,aAAKyB,YAAYV,mBAAmBtH;AACpC,aAAKgI,YAAYlB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKW;AACzC,YAAIrJ;AACJ,YAAI;AACFA,iBAAO4H,SAAS;YAAEvG,IAAIiG;UAAO,CAAA;QAC/B,SAASoD,KAAK;AACZjJ,sBAAAA,IAAIkJ,MAAMD,KAAK;YAAE/C,WAAWtG;UAAG,GAAA;;;;;;AAC/BI,sBAAAA,IAAImJ,MAAM,yCAAyCvJ,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEiH,0BAAgBI,oBAAoBjF;QACtC;AAEA,YAAIzD,MAAM;AACR,eAAKC,MAAM+F,UAAU;YAAChG;WAAK;AAC3B,cAAI,KAAK0J,aAAa1J,KAAKqB,EAAE,GAAG;AAC9B,iBAAKqI,aAAa1J,KAAKqB,EAAE,EAAE6H,QAAQ,CAAC;UACtC;AACA;QACF;MACF;IACF,CAAA,CAAA;EAEJ;EAEA,MAAc7G,gBAAgBrC,MAAY6K,eAAyBC,WAAoB;AACrF,SAAKpB,aAAa1J,KAAKqB,EAAE,IAAI,KAAKqI,aAAa1J,KAAKqB,EAAE,SAAK4H,6BAAO,CAAC,CAAA;AACnE,QAAI8B,QAAQ;AACZ,QAAIC,WAAqB,CAAA;AACzB,SAAKvB,wBAAwBgB,IAC3BzK,KAAKqB,QACLoE,qBAAAA,QAAO,MAAA;AAGL,UAAI,CAACsF,SAAS,CAAC,KAAKtB,wBAAwBwB,IAAIjL,KAAKqB,EAAE,GAAG;AACxD;MACF;AACA0J,cAAQ;AAGRjJ,aAAO2E,KAAK,KAAK6C,WAAW;AAE5B,WAAKI,aAAa1J,KAAKqB,EAAE,EAAE6H;AAG3B,YAAMvI,QAAwB,CAAA;AAC9B,iBAAW,EAAEU,IAAIwG,WAAWnE,QAAQpC,MAAMqD,WAAW,WAAU,KAAM7C,OAAO8B,OAAO,KAAK0F,WAAW,GAAG;AACpG,YACE,CAACzB,aACDlD,aAAakG,iBACZC,aAAaxJ,SAASwJ,aACtBpH,UAAU,CAACA,OAAO1D,IAAAA,GACnB;AACA;QACF;AAEA,aAAKqJ,YAAYV,mBAAmBtH;AACpC,aAAKgI,YAAYlB,aAAa;AAC9BG,wBAAgBI,oBAAoB,KAAKW;AACzC,YAAI;AACF1I,gBAAMmG,KAAI,GAAKe,UAAU;YAAE7H;UAAK,CAAA,KAAM,CAAA,CAAE;QAC1C,SAAS0K,KAAK;AACZjJ,sBAAAA,IAAIkJ,MAAMD,KAAK;YAAE/C,WAAWtG;UAAG,GAAA;;;;;;AAC/BI,sBAAAA,IAAImJ,MAAM,yCAAyCvJ,EAAAA,IAAI,QAAA;;;;;;QACzD,UAAA;AACEiH,0BAAgBI,oBAAoBjF;QACtC;MACF;AAEA,YAAM6C,MAAM3F,MAAM0C,IAAI,CAACC,MAAMA,EAAEjC,EAAE;AACjC,YAAM6J,UAAUF,SAAStH,OAAO,CAACrC,OAAO,CAACiF,IAAI9C,SAASnC,EAAAA,CAAAA;AACtD2J,iBAAW1E;AAGX,WAAKrG,MAAM+G,aACTkE,QAAQ7H,IAAI,CAACpB,YAAY;QAAED,QAAQhC,KAAKqB;QAAIY;MAAO,EAAA,GACnD,IAAA;AAEF,WAAKhC,MAAM+F,UAAUrF,KAAAA;AACrB,WAAKV,MAAM0G,UACThG,MAAM0C,IAAI,CAAC,EAAEhC,GAAE,MACbwJ,kBAAkB,aAAa;QAAE7I,QAAQhC,KAAKqB;QAAIY,QAAQZ;MAAG,IAAI;QAAEW,QAAQX;QAAIY,QAAQjC,KAAKqB;MAAG,CAAA,CAAA;AAGnG,WAAKpB,MAAMkC,WACTnC,KAAKqB,IACLwJ,eACAlK,MAAM0C,IAAI,CAAC,EAAEhC,GAAE,MAAOA,EAAAA,CAAAA;AAExBV,YAAMY,QAAQ,CAAC+B,MAAAA;AACb,YAAI,KAAKoG,aAAapG,EAAEjC,EAAE,GAAG;AAC3B,eAAKqI,aAAapG,EAAEjC,EAAE,EAAE6H,QAAQ,CAAC;QACnC;MACF,CAAA;IACF,CAAA,CAAA;EAEJ;EAEA,MAAc5G,cAAcgF,QAAgB;AAC1C,SAAKiC,uBAAuBR,IAAIzB,MAAAA,IAAAA;AAChC,SAAKmC,wBAAwBV,IAAIzB,MAAAA,IAAAA;AACjC,SAAKiC,uBAAuB4B,OAAO7D,MAAAA;AACnC,SAAKmC,wBAAwB0B,OAAO7D,MAAAA;EACtC;AACF;",
+  "names": ["import_signals_core", "import_echo_schema", "import_invariant", "import_log", "import_util", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "graphSymbol", "getGraph", "node", "graph", "invariant", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "DEFAULT_FILTER", "untracked", "Graph", "constructor", "nodes", "edges", "onInitialNode", "onInitialNodes", "onRemoveNode", "_waitingForNodes", "_initialized", "_constructNode", "create", "_nodes", "id", "type", "forEach", "_addNode", "log", "warn", "_edges", "inbound", "outbound", "Object", "entries", "source", "target", "_addEdge", "_sortEdges", "_onInitialNode", "_onInitialNodes", "_onRemoveNode", "from", "pickle", "options", "JSON", "parse", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "n", "nextSeen", "includes", "undefined", "filter", "nonNullable", "values", "fromEntries", "toSorted", "a", "b", "localeCompare", "stringify", "expansion", "existingNode", "waitForNode", "timeout", "trigger", "Trigger", "wait", "asyncTimeout", "relation", "_getNodes", "actions", "expand", "key", "_key", "initialized", "traverse", "visitor", "path", "shouldContinue", "child", "subscribeTraverse", "currentPath", "effect", "result", "nodeSubscriptions", "unsubscribe", "getPath", "start", "found", "_addNodes", "batch", "_node", "wake", "subNode", "_removeNodes", "ids", "_removeNode", "_removeEdge", "keys", "startsWith", "_addEdges", "edge", "sourceEdges", "push", "targetEdges", "_removeEdges", "removeOrphans", "outboundIndex", "findIndex", "splice", "inboundIndex", "nodeId", "current", "unsorted", "sorted", "createExtension", "extension", "resolver", "connector", "actionGroups", "rest", "getId", "arg", "Dispatcher", "stateIndex", "state", "cleanup", "BuilderInternal", "memoize", "fn", "dispatcher", "currentDispatcher", "currentExtension", "all", "toSignal", "subscribe", "get", "thisSignal", "signal", "value", "GraphBuilder", "params", "_dispatcher", "_extensions", "_resolverSubscriptions", "Map", "_connectorSubscriptions", "_nodeChanged", "_graph", "initialize", "Promise", "addExtension", "Array", "isArray", "ext", "removeExtension", "destroy", "clear", "explore", "isNode", "yieldOrContinue", "flatMap", "set", "err", "catch", "error", "nodesRelation", "nodesType", "first", "previous", "has", "removed", "delete"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5363,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":53358,"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/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":51885},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/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":12978},"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":23091}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":5363,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":59394,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":46212,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":672,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":55801},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"main-thread-scheduling","kind":"dynamic-import","external":true}],"exports":["ACTION_GROUP_TYPE","ACTION_TYPE","Graph","GraphBuilder","ROOT_ID","ROOT_TYPE","actionGroupSymbol","cleanup","createExtension","getGraph","isAction","isActionGroup","isActionLike","isGraphNode","memoize","toSignal"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":14502},"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":25129}}}