@dxos/app-graph 0.8.4-main.e098934 → 0.8.4-main.ead640a

package/dist/lib/browser/index.mjs

@@ -1,6 +1,8 @@
 // src/graph.ts
 import { Registry, Rx } from "@effect-rx/rx-react";
-import { Option, Record, pipe } from "effect";
+import * as Function from "effect/Function";
+import * as Option from "effect/Option";
+import * as Record from "effect/Record";
 import { Event, Trigger } from "@dxos/async";
 import { todo } from "@dxos/debug";
 import { invariant } from "@dxos/invariant";
@@ -25,7 +27,7 @@ var getGraph = (node) => {
   const graph = node[graphSymbol];
   invariant(graph, "Node is not associated with a graph.", {
     F: __dxlog_file,
-    L: 25,
+    L: 27,
     S: void 0,
     A: [
       "graph",
@@ -85,7 +87,7 @@ var Graph = class {
       initialized
     }, {
       F: __dxlog_file,
-      L: 384,
+      L: 386,
       S: this,
       C: (f, a) => f(...a)
     });
@@ -102,7 +104,7 @@ var Graph = class {
       expanded
     }, {
       F: __dxlog_file,
-      L: 394,
+      L: 396,
       S: this,
       C: (f, a) => f(...a)
     });
@@ -132,7 +134,7 @@ var Graph = class {
           propertiesChanged
         }, {
           F: __dxlog_file,
-          L: 416,
+          L: 418,
           S: this,
           C: (f, a) => f(...a)
         });
@@ -144,7 +146,7 @@ var Graph = class {
             properties
           }, {
             F: __dxlog_file,
-            L: 418,
+            L: 420,
             S: this,
             C: (f, a) => f(...a)
           });
@@ -172,7 +174,7 @@ var Graph = class {
           properties
         }, {
           F: __dxlog_file,
-          L: 425,
+          L: 427,
           S: this,
           C: (f, a) => f(...a)
         });
@@ -243,7 +245,7 @@ var Graph = class {
         target: edgeArg.target
       }, {
         F: __dxlog_file,
-        L: 480,
+        L: 482,
         S: this,
         C: (f, a) => f(...a)
       });
@@ -263,7 +265,7 @@ var Graph = class {
         target: edgeArg.target
       }, {
         F: __dxlog_file,
-        L: 487,
+        L: 489,
         S: this,
         C: (f, a) => f(...a)
       });
@@ -346,7 +348,7 @@ var Graph = class {
     ]));
   }
   getPath({ source = "root", target }) {
-    return pipe(this.getNode(source), Option.flatMap((node) => {
+    return Function.pipe(this.getNode(source), Option.flatMap((node) => {
       let found = Option.none();
       this.traverse({
         source: node.id,
@@ -412,11 +414,11 @@ var Graph = class {
       return Rx.make(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:node:${id}`));
     }));
     _define_property(this, "_nodeOrThrow", Rx.family((id) => {
-      return Rx.make((get) => {
-        const node = get(this._node(id));
+      return Rx.make((get2) => {
+        const node = get2(this._node(id));
         invariant(Option.isSome(node), `Node not available: ${id}`, {
           F: __dxlog_file,
-          L: 252,
+          L: 254,
           S: this,
           A: [
             "Option.isSome(node)",
@@ -434,23 +436,23 @@ var Graph = class {
       return Rx.make(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:edges:${id}`));
     }));
     _define_property(this, "_connections", Rx.family((key) => {
-      return Rx.make((get) => {
+      return Rx.make((get2) => {
         const [id, relation] = key.split("$");
-        const edges2 = get(this._edges(id));
-        return edges2[relation].map((id2) => get(this._node(id2))).filter(Option.isSome).map((o) => o.value);
+        const edges2 = get2(this._edges(id));
+        return edges2[relation].map((id2) => get2(this._node(id2))).filter(Option.isSome).map((o) => o.value);
       }).pipe(Rx.withLabel(`graph:connections:${key}`));
     }));
     _define_property(this, "_actions", Rx.family((id) => {
-      return Rx.make((get) => {
-        return get(this._connections(`${id}$outbound`)).filter((node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE);
+      return Rx.make((get2) => {
+        return get2(this._connections(`${id}$outbound`)).filter((node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE);
       }).pipe(Rx.withLabel(`graph:actions:${id}`));
     }));
     _define_property(this, "_json", Rx.family((id) => {
-      return Rx.make((get) => {
+      return Rx.make((get2) => {
         const toJSON = (node, seen = []) => {
-          const nodes2 = get(this.connections(node.id));
+          const nodes2 = get2(this.connections(node.id));
           const obj = {
-            id: node.id.length > 32 ? `${node.id.slice(0, 32)}...` : node.id,
+            id: node.id,
             type: node.type
           };
           if (node.properties.label) {
@@ -467,7 +469,7 @@ var Graph = class {
           }
           return obj;
         };
-        const root = get(this.nodeOrThrow(id));
+        const root = get2(this.nodeOrThrow(id));
         return toJSON(root);
       }).pipe(Rx.withLabel(`graph:json:${id}`));
     }));
@@ -491,7 +493,10 @@ var Graph = class {
 // src/graph-builder.ts
 import { Registry as Registry2, Rx as Rx2 } from "@effect-rx/rx-react";
 import { effect } from "@preact/signals-core";
-import { Array, Option as Option2, Record as Record2, pipe as pipe2 } from "effect";
+import * as Array from "effect/Array";
+import * as Function2 from "effect/Function";
+import * as Option2 from "effect/Option";
+import * as Record2 from "effect/Record";
 import { log as log2 } from "@dxos/log";
 import { byPosition, getDebugName, isNode, isNonNullable as isNonNullable2 } from "@dxos/util";
 
@@ -534,16 +539,16 @@ var createExtension = (extension) => {
       id: getId("connector"),
       position,
       relation,
-      connector: Rx2.family((node) => Rx2.make((get) => {
+      connector: Rx2.family((node) => Rx2.make((get2) => {
         try {
-          return get(connector(node));
+          return get2(connector(node));
         } catch {
           log2.warn("Error in connector", {
             id: getId("connector"),
             node
           }, {
             F: __dxlog_file2,
-            L: 109,
+            L: 112,
             S: void 0,
             C: (f, a) => f(...a)
           });
@@ -555,9 +560,9 @@ var createExtension = (extension) => {
       id: getId("actionGroups"),
       position,
       relation: "outbound",
-      connector: Rx2.family((node) => Rx2.make((get) => {
+      connector: Rx2.family((node) => Rx2.make((get2) => {
         try {
-          return get(actionGroups(node)).map((arg) => ({
+          return get2(actionGroups(node)).map((arg) => ({
             ...arg,
             data: actionGroupSymbol,
             type: ACTION_GROUP_TYPE
@@ -568,7 +573,7 @@ var createExtension = (extension) => {
             node
           }, {
             F: __dxlog_file2,
-            L: 130,
+            L: 133,
             S: void 0,
             C: (f, a) => f(...a)
           });
@@ -580,9 +585,9 @@ var createExtension = (extension) => {
       id: getId("actions"),
       position,
       relation: "outbound",
-      connector: Rx2.family((node) => Rx2.make((get) => {
+      connector: Rx2.family((node) => Rx2.make((get2) => {
         try {
-          return get(actions(node)).map((arg) => ({
+          return get2(actions(node)).map((arg) => ({
             ...arg,
             type: ACTION_TYPE
           }));
@@ -592,7 +597,7 @@ var createExtension = (extension) => {
             node
           }, {
             F: __dxlog_file2,
-            L: 147,
+            L: 150,
             S: void 0,
             C: (f, a) => f(...a)
           });
@@ -692,7 +697,7 @@ var GraphBuilder = class _GraphBuilder {
       registry: getDebugName(this._registry)
     }, {
       F: __dxlog_file2,
-      L: 324,
+      L: 327,
       S: this,
       C: (f, a) => f(...a)
     });
@@ -709,7 +714,7 @@ var GraphBuilder = class _GraphBuilder {
         removed
       }, {
         F: __dxlog_file2,
-        L: 335,
+        L: 338,
         S: this,
         C: (f, a) => f(...a)
       });
@@ -746,7 +751,7 @@ var GraphBuilder = class _GraphBuilder {
       id
     }, {
       F: __dxlog_file2,
-      L: 372,
+      L: 375,
       S: this,
       C: (f, a) => f(...a)
     });
@@ -783,23 +788,23 @@ var GraphBuilder = class _GraphBuilder {
     _define_property2(this, "_registry", void 0);
     _define_property2(this, "_graph", void 0);
     _define_property2(this, "_resolvers", Rx2.family((id) => {
-      return Rx2.make((get) => {
-        return pipe2(get(this._extensions), Record2.values, Array.sortBy(byPosition), Array.map(({ resolver }) => resolver), Array.filter(isNonNullable2), Array.map((resolver) => get(resolver(id))), Array.filter(isNonNullable2), Array.head);
+      return Rx2.make((get2) => {
+        return Function2.pipe(get2(this._extensions), Record2.values, Array.sortBy(byPosition), Array.map(({ resolver }) => resolver), Array.filter(isNonNullable2), Array.map((resolver) => get2(resolver(id))), Array.filter(isNonNullable2), Array.head);
       });
     }));
     _define_property2(this, "_connectors", Rx2.family((key) => {
-      return Rx2.make((get) => {
+      return Rx2.make((get2) => {
         const [id, relation] = key.split("+");
         const node = this._graph.node(id);
-        return pipe2(
-          get(this._extensions),
+        return Function2.pipe(
+          get2(this._extensions),
           Record2.values,
           // TODO(wittjosiah): Sort on write rather than read.
           Array.sortBy(byPosition),
           Array.filter(({ relation: _relation = "outbound" }) => _relation === relation),
           Array.map(({ connector }) => connector?.(node)),
           Array.filter(isNonNullable2),
-          Array.flatMap((result) => get(result))
+          Array.flatMap((result) => get2(result))
         );
       }).pipe(Rx2.withLabel(`graph-builder:connectors:${key}`));
     }));
@@ -814,18 +819,18 @@ var GraphBuilder = class _GraphBuilder {
   }
 };
 var rxFromSignal = (cb) => {
-  return Rx2.make((get) => {
+  return Rx2.make((get2) => {
     const dispose = effect(() => {
-      get.setSelf(cb());
+      get2.setSelf(cb());
     });
-    get.addFinalizer(() => dispose());
+    get2.addFinalizer(() => dispose());
     return cb();
   });
 };
 var observableFamily = Rx2.family((observable) => {
-  return Rx2.make((get) => {
-    const subscription = observable.subscribe((value) => get.setSelf(value));
-    get.addFinalizer(() => subscription.unsubscribe());
+  return Rx2.make((get2) => {
+    const subscription = observable.subscribe((value) => get2.setSelf(value));
+    get2.addFinalizer(() => subscription.unsubscribe());
     return observable.get();
   });
 });

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/graph-builder.ts", "../../../src/node.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport { Option, Record, pipe } from 'effect';\n\nimport { Event, Trigger } from '@dxos/async';\nimport { todo } from '@dxos/debug';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, isNonNullable } from '@dxos/util';\n\nimport { type Action, type ActionGroup, type Node, type NodeArg, type Relation } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: T[K] extends object ? DeepWriteable<T[K]> : T[K] };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\n/**\n * Get the Graph a Node is currently associated with.\n */\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default ROOT_ID\n   */\n  source?: string;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n};\n\nexport type GraphParams = {\n  registry?: Registry.Registry;\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, Edges>;\n  onExpand?: Graph['_onExpand'];\n  onInitialize?: Graph['_onInitialize'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\nexport type Edge = { source: string; target: string };\nexport type Edges = { inbound: string[]; outbound: string[] };\n\nexport interface ReadableGraph {\n  /**\n   * Event emitted when a node is changed.\n   */\n  onNodeChanged: Event<{ id: string; node: Option.Option<Node> }>;\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON(id?: string): object;\n\n  json(id?: string): Rx.Rx<any>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  node(id: string): Rx.Rx<Option.Option<Node>>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  nodeOrThrow(id: string): Rx.Rx<Node>;\n\n  /**\n   * Get the rx key for the connections of the node with the given id.\n   */\n  connections(id: string, relation?: Relation): Rx.Rx<Node[]>;\n\n  /**\n   * Get the rx key for the actions of the node with the given id.\n   */\n  actions(id: string): Rx.Rx<(Action | ActionGroup)[]>;\n\n  /**\n   * Get the rx key for the edges of the node with the given id.\n   */\n  edges(id: string): Rx.Rx<Edges>;\n\n  /**\n   * Alias for `getNodeOrThrow(ROOT_ID)`.\n   */\n  get root(): Node;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   */\n  getNode(id: string): Option.Option<Node>;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   *\n   * @throws If the node is Option.none().\n   */\n  getNodeOrThrow(id: string): Node;\n\n  /**\n   * Get all nodes connected to the node with the given id by the given relation from the graph's registry.\n   */\n  getConnections(id: string, relation?: Relation): Node[];\n\n  /**\n   * Get all actions connected to the node with the given id from the graph's registry.\n   */\n  getActions(id: string): Node[];\n\n  /**\n   * Get the edges from the node with the given id from the graph's registry.\n   */\n  getEdges(id: string): Edges;\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(options: GraphTraversalOptions, path?: string[]): void;\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath(params: { source?: string; target: string }): Option.Option<string[]>;\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  waitForPath(\n    params: { source?: string; target: string },\n    options?: { timeout?: number; interval?: number },\n  ): Promise<string[]>;\n}\n\nexport interface ExpandableGraph extends ReadableGraph {\n  /**\n   * Initialize a node in the graph.\n   *\n   * Fires the `onInitialize` callback to provide initial data for a node.\n   */\n  initialize(id: string): Promise<void>;\n\n  /**\n   * Expand a node in the graph.\n   *\n   * Fires the `onExpand` callback to add connections to the node.\n   */\n  expand(id: string, relation?: Relation): void;\n\n  /**\n   * Sort the edges of the node with the given id.\n   */\n  sortEdges(id: string, relation: Relation, order: string[]): void;\n}\n\nexport interface WritableGraph extends ExpandableGraph {\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void;\n\n  /**\n   * Add a node to the graph.\n   */\n  addNode(node: NodeArg<any, Record<string, any>>): void;\n\n  /**\n   * Remove nodes from the graph.\n   */\n  removeNodes(ids: string[], edges?: boolean): void;\n\n  /**\n   * Remove a node from the graph.\n   */\n  removeNode(id: string, edges?: boolean): void;\n\n  /**\n   * Add edges to the graph.\n   */\n  addEdges(edges: Edge[]): void;\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge(edge: Edge): void;\n\n  /**\n   * Remove edges from the graph.\n   */\n  removeEdges(edges: Edge[], removeOrphans?: boolean): void;\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge(edge: Edge, removeOrphans?: boolean): void;\n}\n\n/**\n * The Graph represents the user interface information architecture of the application constructed via plugins.\n */\nexport class Graph implements WritableGraph {\n  readonly onNodeChanged = new Event<{ id: string; node: Option.Option<Node> }>();\n\n  private readonly _onExpand?: (id: string, relation: Relation) => void;\n  private readonly _onInitialize?: (id: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => void;\n\n  private readonly _registry: Registry.Registry;\n  private readonly _expanded = Record.empty<string, boolean>();\n  private readonly _initialized = Record.empty<string, boolean>();\n  private readonly _initialEdges = Record.empty<string, Edges>();\n  private readonly _initialNodes = Record.fromEntries([\n    [ROOT_ID, this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, data: null, properties: {} })],\n  ]);\n\n  /** @internal */\n  readonly _node = Rx.family<string, Rx.Writable<Option.Option<Node>>>((id) => {\n    const initial = Option.flatten(Record.get(this._initialNodes, id));\n    return Rx.make<Option.Option<Node>>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:node:${id}`));\n  });\n\n  private readonly _nodeOrThrow = Rx.family<string, Rx.Rx<Node>>((id) => {\n    return Rx.make((get) => {\n      const node = get(this._node(id));\n      invariant(Option.isSome(node), `Node not available: ${id}`);\n      return node.value;\n    });\n  });\n\n  private readonly _edges = Rx.family<string, Rx.Writable<Edges>>((id) => {\n    const initial = Record.get(this._initialEdges, id).pipe(Option.getOrElse(() => ({ inbound: [], outbound: [] })));\n    return Rx.make<Edges>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:edges:${id}`));\n  });\n\n  // NOTE: Currently the argument to the family needs to be referentially stable for the rx to be referentially stable.\n  // TODO(wittjosiah): Rx feature request, support for something akin to `ComplexMap` to allow for complex arguments.\n  private readonly _connections = Rx.family<string, Rx.Rx<Node[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('$');\n      const edges = get(this._edges(id));\n      return edges[relation as Relation]\n        .map((id) => get(this._node(id)))\n        .filter(Option.isSome)\n        .map((o) => o.value);\n    }).pipe(Rx.withLabel(`graph:connections:${key}`));\n  });\n\n  private readonly _actions = Rx.family<string, Rx.Rx<(Action | ActionGroup)[]>>((id) => {\n    return Rx.make((get) => {\n      return get(this._connections(`${id}$outbound`)).filter(\n        (node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE,\n      );\n    }).pipe(Rx.withLabel(`graph:actions:${id}`));\n  });\n\n  private readonly _json = Rx.family<string, Rx.Rx<any>>((id) => {\n    return Rx.make((get) => {\n      const toJSON = (node: Node, seen: string[] = []): any => {\n        const nodes = get(this.connections(node.id));\n        const obj: Record<string, any> = {\n          id: node.id.length > 32 ? `${node.id.slice(0, 32)}...` : node.id,\n          type: node.type,\n        };\n        if (node.properties.label) {\n          obj.label = node.properties.label;\n        }\n        if (nodes.length) {\n          obj.nodes = nodes\n            .map((n) => {\n              // Break cycles.\n              const nextSeen = [...seen, node.id];\n              return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n            })\n            .filter(isNonNullable);\n        }\n        return obj;\n      };\n\n      const root = get(this.nodeOrThrow(id));\n      return toJSON(root);\n    }).pipe(Rx.withLabel(`graph:json:${id}`));\n  });\n\n  constructor({ registry, nodes, edges, onInitialize, onExpand, onRemoveNode }: GraphParams = {}) {\n    this._registry = registry ?? Registry.make();\n    this._onInitialize = onInitialize;\n    this._onExpand = onExpand;\n    this._onRemoveNode = onRemoveNode;\n\n    if (nodes) {\n      nodes.forEach((node) => {\n        Record.set(this._initialNodes, node.id, this._constructNode(node));\n      });\n    }\n\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        Record.set(this._initialEdges, source, edges);\n      });\n    }\n  }\n\n  toJSON(id = ROOT_ID) {\n    return this._registry.get(this._json(id));\n  }\n\n  json(id = ROOT_ID) {\n    return this._json(id);\n  }\n\n  node(id: string): Rx.Rx<Option.Option<Node>> {\n    return this._node(id);\n  }\n\n  nodeOrThrow(id: string): Rx.Rx<Node> {\n    return this._nodeOrThrow(id);\n  }\n\n  connections(id: string, relation: Relation = 'outbound'): Rx.Rx<Node[]> {\n    return this._connections(`${id}$${relation}`);\n  }\n\n  actions(id: string) {\n    return this._actions(id);\n  }\n\n  edges(id: string): Rx.Rx<Edges> {\n    return this._edges(id);\n  }\n\n  get root() {\n    return this.getNodeOrThrow(ROOT_ID);\n  }\n\n  getNode(id: string): Option.Option<Node> {\n    return this._registry.get(this.node(id));\n  }\n\n  getNodeOrThrow(id: string): Node {\n    return this._registry.get(this.nodeOrThrow(id));\n  }\n\n  getConnections(id: string, relation: Relation = 'outbound'): Node[] {\n    return this._registry.get(this.connections(id, relation));\n  }\n\n  getActions(id: string): Node[] {\n    return this._registry.get(this.actions(id));\n  }\n\n  getEdges(id: string): Edges {\n    return this._registry.get(this.edges(id));\n  }\n\n  async initialize(id: string) {\n    const initialized = Record.get(this._initialized, id).pipe(Option.getOrElse(() => false));\n    log('initialize', { id, initialized });\n    if (!initialized) {\n      await this._onInitialize?.(id);\n      Record.set(this._initialized, id, true);\n    }\n  }\n\n  expand(id: string, relation: Relation = 'outbound'): void {\n    const key = `${id}$${relation}`;\n    const expanded = Record.get(this._expanded, key).pipe(Option.getOrElse(() => false));\n    log('expand', { key, expanded });\n    if (!expanded) {\n      this._onExpand?.(id, relation);\n      Record.set(this._expanded, key, true);\n    }\n  }\n\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void {\n    Rx.batch(() => {\n      nodes.map((node) => this.addNode(node));\n    });\n  }\n\n  addNode({ nodes, edges, ...nodeArg }: NodeArg<any, Record<string, any>>): void {\n    const { id, type, data = null, properties = {} } = nodeArg;\n    const nodeRx = this._node(id);\n    const node = this._registry.get(nodeRx);\n    Option.match(node, {\n      onSome: (node) => {\n        const typeChanged = node.type !== type;\n        const dataChanged = node.data !== data;\n        const propertiesChanged = Object.keys(properties).some((key) => node.properties[key] !== properties[key]);\n        log('existing node', { id, typeChanged, dataChanged, propertiesChanged });\n        if (typeChanged || dataChanged || propertiesChanged) {\n          log('updating node', { id, type, data, properties });\n          const newNode = Option.some({ ...node, type, data, properties: { ...node.properties, ...properties } });\n          this._registry.set(nodeRx, newNode);\n          this.onNodeChanged.emit({ id, node: newNode });\n        }\n      },\n      onNone: () => {\n        log('new node', { id, type, data, properties });\n        const newNode = this._constructNode({ id, type, data, properties });\n        this._registry.set(nodeRx, newNode);\n        this.onNodeChanged.emit({ id, node: newNode });\n      },\n    });\n\n    if (nodes) {\n      // Rx.batch(() => {\n      this.addNodes(nodes);\n      const _edges = nodes.map((node) => ({ source: id, target: node.id }));\n      this.addEdges(_edges);\n      // });\n    }\n\n    if (edges) {\n      todo();\n    }\n  }\n\n  removeNodes(ids: string[], edges = false): void {\n    Rx.batch(() => {\n      ids.map((id) => this.removeNode(id, edges));\n    });\n  }\n\n  removeNode(id: string, edges = false): void {\n    const nodeRx = this._node(id);\n    // TODO(wittjosiah): Is there a way to mark these rx values for garbage collection?\n    this._registry.set(nodeRx, Option.none());\n    this.onNodeChanged.emit({ id, node: Option.none() });\n    // TODO(wittjosiah): Reset expanded and initialized flags?\n\n    if (edges) {\n      const { inbound, outbound } = this._registry.get(this._edges(id));\n      const edges = [\n        ...inbound.map((source) => ({ source, target: id })),\n        ...outbound.map((target) => ({ source: id, target })),\n      ];\n      this.removeEdges(edges);\n    }\n\n    this._onRemoveNode?.(id);\n  }\n\n  addEdges(edges: Edge[]): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.addEdge(edge));\n    });\n  }\n\n  addEdge(edgeArg: Edge): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (!source.outbound.includes(edgeArg.target)) {\n      log('add outbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(sourceRx, { inbound: source.inbound, outbound: [...source.outbound, edgeArg.target] });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (!target.inbound.includes(edgeArg.source)) {\n      log('add inbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(targetRx, { inbound: [...target.inbound, edgeArg.source], outbound: target.outbound });\n    }\n  }\n\n  removeEdges(edges: Edge[], removeOrphans = false): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.removeEdge(edge, removeOrphans));\n    });\n  }\n\n  removeEdge(edgeArg: Edge, removeOrphans = false): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (source.outbound.includes(edgeArg.target)) {\n      this._registry.set(sourceRx, {\n        inbound: source.inbound,\n        outbound: source.outbound.filter((id) => id !== edgeArg.target),\n      });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (target.inbound.includes(edgeArg.source)) {\n      this._registry.set(targetRx, {\n        inbound: target.inbound.filter((id) => id !== edgeArg.source),\n        outbound: target.outbound,\n      });\n    }\n\n    if (removeOrphans) {\n      const source = this._registry.get(sourceRx);\n      const target = this._registry.get(targetRx);\n      if (source.outbound.length === 0 && source.inbound.length === 0 && edgeArg.source !== ROOT_ID) {\n        this.removeNodes([edgeArg.source]);\n      }\n      if (target.outbound.length === 0 && target.inbound.length === 0 && edgeArg.target !== ROOT_ID) {\n        this.removeNodes([edgeArg.target]);\n      }\n    }\n  }\n\n  sortEdges(id: string, relation: Relation, order: string[]): void {\n    const edgesRx = this._edges(id);\n    const edges = this._registry.get(edgesRx);\n    const unsorted = edges[relation].filter((id) => !order.includes(id)) ?? [];\n    const sorted = order.filter((id) => edges[relation].includes(id)) ?? [];\n    edges[relation].splice(0, edges[relation].length, ...[...sorted, ...unsorted]);\n    this._registry.set(edgesRx, edges);\n  }\n\n  traverse({ visitor, source = ROOT_ID, relation = 'outbound' }: GraphTraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    const node = this.getNodeOrThrow(source);\n    const shouldContinue = visitor(node, [...path, source]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this.getConnections(source, relation)).forEach((child) =>\n      this.traverse({ source: child.id, relation, visitor }, [...path, source]),\n    );\n  }\n\n  getPath({ source = 'root', target }: { source?: string; target: string }): Option.Option<string[]> {\n    return pipe(\n      this.getNode(source),\n      Option.flatMap((node) => {\n        let found: Option.Option<string[]> = Option.none();\n        this.traverse({\n          source: node.id,\n          visitor: (node, path) => {\n            if (Option.isSome(found)) {\n              return false;\n            }\n\n            if (node.id === target) {\n              found = Option.some(path);\n            }\n          },\n        });\n\n        return found;\n      }),\n    );\n  }\n\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ): Promise<string[]> {\n    const path = this.getPath(params);\n    if (Option.isSome(path)) {\n      return path.value;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (Option.isSome(path)) {\n        trigger.wake(path.value);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /** @internal */\n  _constructNode(node: NodeArg<any>): Option.Option<Node> {\n    return Option.some({ [graphSymbol]: this, data: null, properties: {}, ...node });\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport { effect } from '@preact/signals-core';\nimport { Array, Option, Record, pipe } from 'effect';\n\nimport { type CleanupFn, type MulticastObservable, type Trigger } from '@dxos/async';\nimport { log } from '@dxos/log';\nimport { type MaybePromise, type Position, byPosition, getDebugName, isNode, isNonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, type ExpandableGraph, Graph, type GraphParams, ROOT_ID } from './graph';\nimport { type ActionData, type Node, type NodeArg, type Relation, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on a node id.\n */\nexport type ResolverExtension = (id: string) => Rx.Rx<NodeArg<any> | null>;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension = (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[]>;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.position Affects the order the extensions are processed in.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions = {\n  id: string;\n  relation?: Relation;\n  position?: Position;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  actions?: ActionsExtension;\n  actionGroups?: ActionGroupsExtension;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = (extension: CreateExtensionOptions): BuilderExtension[] => {\n  const {\n    id,\n    position = 'static',\n    relation = 'outbound',\n    resolver: _resolver,\n    connector: _connector,\n    actions: _actions,\n    actionGroups: _actionGroups,\n  } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n\n  const resolver =\n    _resolver && Rx.family((id: string) => _resolver(id).pipe(Rx.withLabel(`graph-builder:_resolver:${id}`)));\n\n  const connector =\n    _connector &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _connector(node).pipe(Rx.withLabel(`graph-builder:_connector:${id}`)),\n    );\n\n  const actionGroups =\n    _actionGroups &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _actionGroups(node).pipe(Rx.withLabel(`graph-builder:_actionGroups:${id}`)),\n    );\n\n  const actions =\n    _actions &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) => _actions(node).pipe(Rx.withLabel(`graph-builder:_actions:${id}`)));\n\n  return [\n    resolver ? { id: getId('resolver'), position, resolver } : undefined,\n    connector\n      ? ({\n          id: getId('connector'),\n          position,\n          relation,\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(connector(node));\n              } catch {\n                log.warn('Error in connector', { id: getId('connector'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actionGroups\n      ? ({\n          id: getId('actionGroups'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actionGroups(node)).map((arg) => ({\n                  ...arg,\n                  data: actionGroupSymbol,\n                  type: ACTION_GROUP_TYPE,\n                }));\n              } catch {\n                log.warn('Error in actionGroups', { id: getId('actionGroups'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actionGroups:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          id: getId('actions'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actions(node)).map((arg) => ({ ...arg, type: ACTION_TYPE }));\n              } catch {\n                log.warn('Error in actions', { id: getId('actions'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actions:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(isNonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  registry?: Registry.Registry;\n  source?: string;\n  relation?: Relation;\n};\n\nexport type BuilderExtension = Readonly<{\n  id: string;\n  position: Position;\n  relation?: Relation; // Only for connector.\n  resolver?: ResolverExtension;\n  connector?: (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n}>;\n\nexport type BuilderExtensions = BuilderExtension | BuilderExtension[] | BuilderExtensions[];\n\nexport const flattenExtensions = (extension: BuilderExtensions, acc: BuilderExtension[] = []): BuilderExtension[] => {\n  if (Array.isArray(extension)) {\n    return [...acc, ...extension.flatMap((ext) => flattenExtensions(ext, acc))];\n  } else {\n    return [...acc, extension];\n  }\n};\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  // TODO(wittjosiah): Use Context.\n  private readonly _subscriptions = new Map<string, CleanupFn>();\n  private readonly _extensions = Rx.make(Record.empty<string, BuilderExtension>()).pipe(\n    Rx.keepAlive,\n    Rx.withLabel('graph-builder:extensions'),\n  );\n  private readonly _initialized: Record<string, Trigger> = {};\n  private readonly _registry: Registry.Registry;\n  private readonly _graph: Graph;\n\n  constructor({ registry, ...params }: Pick<GraphParams, 'registry' | 'nodes' | 'edges'> = {}) {\n    this._registry = registry ?? Registry.make();\n    this._graph = new Graph({\n      ...params,\n      registry: this._registry,\n      onExpand: (id, relation) => this._onExpand(id, relation),\n      onInitialize: (id) => this._onInitialize(id),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string, registry?: Registry.Registry): GraphBuilder {\n    if (!pickle) {\n      return new GraphBuilder({ registry });\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges, registry });\n  }\n\n  get graph(): ExpandableGraph {\n    return this._graph;\n  }\n\n  get extensions() {\n    return this._extensions;\n  }\n\n  addExtension(extensions: BuilderExtensions): GraphBuilder {\n    flattenExtensions(extensions).forEach((extension) => {\n      const extensions = this._registry.get(this._extensions);\n      this._registry.set(this._extensions, Record.set(extensions, extension.id, extension));\n    });\n    return this;\n  }\n\n  removeExtension(id: string): GraphBuilder {\n    const extensions = this._registry.get(this._extensions);\n    this._registry.set(this._extensions, Record.remove(extensions, id));\n    return this;\n  }\n\n  async explore(\n    // TODO(wittjosiah): Currently defaulting to new registry.\n    //   Currently unsure about how to handle nodes which are expanded in the background.\n    //   This seems like a good place to start.\n    { registry = Registry.make(), source = ROOT_ID, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ): Promise<void> {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n\n    const node = registry.get(this._graph.nodeOrThrow(source));\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._registry.get(this._extensions))\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .map((extension) => extension.connector)\n      .filter(isNonNullable)\n      .flatMap((connector) => registry.get(connector(this._graph.node(source))));\n\n    await Promise.all(\n      nodes.map((nodeArg) => {\n        registry.set(this._graph._node(nodeArg.id), this._graph._constructNode(nodeArg));\n        return this.explore({ registry, source: nodeArg.id, relation, visitor }, [...path, node.id]);\n      }),\n    );\n\n    if (registry !== this._registry) {\n      registry.reset();\n      registry.dispose();\n    }\n  }\n\n  destroy(): void {\n    this._subscriptions.forEach((unsubscribe) => unsubscribe());\n    this._subscriptions.clear();\n  }\n\n  private readonly _resolvers = Rx.family<string, Rx.Rx<Option.Option<NodeArg<any>>>>((id) => {\n    return Rx.make((get) => {\n      return pipe(\n        get(this._extensions),\n        Record.values,\n        Array.sortBy(byPosition),\n        Array.map(({ resolver }) => resolver),\n        Array.filter(isNonNullable),\n        Array.map((resolver) => get(resolver(id))),\n        Array.filter(isNonNullable),\n        Array.head,\n      );\n    });\n  });\n\n  private readonly _connectors = Rx.family<string, Rx.Rx<NodeArg<any>[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('+');\n      const node = this._graph.node(id);\n\n      return pipe(\n        get(this._extensions),\n        Record.values,\n        // TODO(wittjosiah): Sort on write rather than read.\n        Array.sortBy(byPosition),\n        Array.filter(({ relation: _relation = 'outbound' }) => _relation === relation),\n        Array.map(({ connector }) => connector?.(node)),\n        Array.filter(isNonNullable),\n        Array.flatMap((result) => get(result)),\n      );\n    }).pipe(Rx.withLabel(`graph-builder:connectors:${key}`));\n  });\n\n  private _onExpand(id: string, relation: Relation): void {\n    log('onExpand', { id, relation, registry: getDebugName(this._registry) });\n    const connectors = this._connectors(`${id}+${relation}`);\n\n    let previous: string[] = [];\n    const cancel = this._registry.subscribe(\n      connectors,\n      (nodes) => {\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        log('update', { id, relation, ids, removed });\n        const update = () => {\n          Rx.batch(() => {\n            this._graph.removeEdges(\n              removed.map((target) => ({ source: id, target })),\n              true,\n            );\n            this._graph.addNodes(nodes);\n            this._graph.addEdges(\n              nodes.map((node) =>\n                relation === 'outbound' ? { source: id, target: node.id } : { source: node.id, target: id },\n              ),\n            );\n            this._graph.sortEdges(\n              id,\n              relation,\n              nodes.map(({ id }) => id),\n            );\n          });\n        };\n\n        // TODO(wittjosiah): Remove `requestAnimationFrame` once we have a better solution.\n        //  This is a workaround to avoid a race condition where the graph is updated during React render.\n        if (typeof requestAnimationFrame === 'function') {\n          requestAnimationFrame(update);\n        } else {\n          update();\n        }\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  // TODO(wittjosiah): If the same node is added by a connector, the resolver should probably cancel itself?\n  private async _onInitialize(id: string) {\n    log('onInitialize', { id });\n    const resolver = this._resolvers(id);\n\n    const cancel = this._registry.subscribe(\n      resolver,\n      (node) => {\n        const trigger = this._initialized[id];\n        Option.match(node, {\n          onSome: (node) => {\n            this._graph.addNodes([node]);\n            trigger?.wake();\n          },\n          onNone: () => {\n            trigger?.wake();\n            this._graph.removeNodes([id]);\n          },\n        });\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  private _onRemoveNode(id: string): void {\n    this._subscriptions.get(id)?.();\n    this._subscriptions.delete(id);\n  }\n}\n\n/**\n * Creates an Rx.Rx<T> from a callback which accesses signals.\n * Will return a new rx instance each time.\n */\nexport const rxFromSignal = <T>(cb: () => T): Rx.Rx<T> => {\n  return Rx.make((get) => {\n    const dispose = effect(() => {\n      get.setSelf(cb());\n    });\n\n    get.addFinalizer(() => dispose());\n\n    return cb();\n  });\n};\n\nconst observableFamily = Rx.family((observable: MulticastObservable<any>) => {\n  return Rx.make((get) => {\n    const subscription = observable.subscribe((value) => get.setSelf(value));\n\n    get.addFinalizer(() => subscription.unsubscribe());\n\n    return observable.get();\n  });\n});\n\n/**\n * Creates an Rx.Rx<T> from a MulticastObservable<T>\n * Will return the same rx instance for the same observable.\n */\nexport const rxFromObservable = <T>(observable: MulticastObservable<T>): Rx.Rx<T> => {\n  return observableFamily(observable) as Rx.Rx<T>;\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MakeOptional, type MaybePromise } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE } from './graph';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  // TODO(burdon): Allow string array, which is concatenated.\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Keys in of the properties which should be cached.\n   * If defined, the node will be included in the cache.\n   * If undefined, the node will not be included in the cache.\n   */\n  cacheable?: string[];\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<TData = any, TProperties extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<TData, TProperties>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties' | 'cacheable'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  parent?: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params?: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' && data.type === ACTION_TYPE : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<typeof actionGroupSymbol, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol && data.type === ACTION_GROUP_TYPE : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n"],
-  "mappings": ";AAIA,SAASA,UAAUC,UAAU;AAC7B,SAASC,QAAQC,QAAQC,YAAY;AAErC,SAASC,OAAOC,eAAe;AAC/B,SAASC,YAAY;AACrB,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAA4BC,qBAAqB;;;;;;;;;;;;;;;AAIjD,IAAMC,cAAcC,OAAO,OAAA;AAOpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCH,YAAUO,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAMC,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAoM1B,IAAMC,QAAN,MAAMA;EAsGXC,OAAOC,KAAKN,SAAS;AACnB,WAAO,KAAKO,UAAUC,IAAI,KAAKC,MAAMH,EAAAA,CAAAA;EACvC;EAEAI,KAAKJ,KAAKN,SAAS;AACjB,WAAO,KAAKS,MAAMH,EAAAA;EACpB;EAEAR,KAAKQ,IAAwC;AAC3C,WAAO,KAAKK,MAAML,EAAAA;EACpB;EAEAM,YAAYN,IAAyB;AACnC,WAAO,KAAKO,aAAaP,EAAAA;EAC3B;EAEAQ,YAAYR,IAAYS,WAAqB,YAA2B;AACtE,WAAO,KAAKC,aAAa,GAAGV,EAAAA,IAAMS,QAAAA,EAAU;EAC9C;EAEAE,QAAQX,IAAY;AAClB,WAAO,KAAKY,SAASZ,EAAAA;EACvB;EAEAa,MAAMb,IAA0B;AAC9B,WAAO,KAAKc,OAAOd,EAAAA;EACrB;EAEA,IAAIe,OAAO;AACT,WAAO,KAAKC,eAAetB,OAAAA;EAC7B;EAEAuB,QAAQjB,IAAiC;AACvC,WAAO,KAAKC,UAAUC,IAAI,KAAKV,KAAKQ,EAAAA,CAAAA;EACtC;EAEAgB,eAAehB,IAAkB;AAC/B,WAAO,KAAKC,UAAUC,IAAI,KAAKI,YAAYN,EAAAA,CAAAA;EAC7C;EAEAkB,eAAelB,IAAYS,WAAqB,YAAoB;AAClE,WAAO,KAAKR,UAAUC,IAAI,KAAKM,YAAYR,IAAIS,QAAAA,CAAAA;EACjD;EAEAU,WAAWnB,IAAoB;AAC7B,WAAO,KAAKC,UAAUC,IAAI,KAAKS,QAAQX,EAAAA,CAAAA;EACzC;EAEAoB,SAASpB,IAAmB;AAC1B,WAAO,KAAKC,UAAUC,IAAI,KAAKW,MAAMb,EAAAA,CAAAA;EACvC;EAEA,MAAMqB,WAAWrB,IAAY;AAC3B,UAAMsB,cAAczC,OAAOqB,IAAI,KAAKqB,cAAcvB,EAAAA,EAAIlB,KAAKF,OAAO4C,UAAU,MAAM,KAAA,CAAA;AAClFrC,QAAI,cAAc;MAAEa;MAAIsB;IAAY,GAAA;;;;;;AACpC,QAAI,CAACA,aAAa;AAChB,YAAM,KAAKG,gBAAgBzB,EAAAA;AAC3BnB,aAAO6C,IAAI,KAAKH,cAAcvB,IAAI,IAAA;IACpC;EACF;EAEA2B,OAAO3B,IAAYS,WAAqB,YAAkB;AACxD,UAAMmB,MAAM,GAAG5B,EAAAA,IAAMS,QAAAA;AACrB,UAAMoB,WAAWhD,OAAOqB,IAAI,KAAK4B,WAAWF,GAAAA,EAAK9C,KAAKF,OAAO4C,UAAU,MAAM,KAAA,CAAA;AAC7ErC,QAAI,UAAU;MAAEyC;MAAKC;IAAS,GAAA;;;;;;AAC9B,QAAI,CAACA,UAAU;AACb,WAAKE,YAAY/B,IAAIS,QAAAA;AACrB5B,aAAO6C,IAAI,KAAKI,WAAWF,KAAK,IAAA;IAClC;EACF;EAEAI,SAASC,OAAkD;AACzDtD,OAAGuD,MAAM,MAAA;AACPD,YAAME,IAAI,CAAC3C,SAAS,KAAK4C,QAAQ5C,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEA4C,QAAQ,EAAEH,OAAOpB,OAAO,GAAGwB,QAAAA,GAAoD;AAC7E,UAAM,EAAErC,IAAIsC,MAAMC,OAAO,MAAMC,aAAa,CAAC,EAAC,IAAKH;AACnD,UAAMI,SAAS,KAAKpC,MAAML,EAAAA;AAC1B,UAAMR,OAAO,KAAKS,UAAUC,IAAIuC,MAAAA;AAChC7D,WAAO8D,MAAMlD,MAAM;MACjBmD,QAAQ,CAACnD,UAAAA;AACP,cAAMoD,cAAcpD,MAAK8C,SAASA;AAClC,cAAMO,cAAcrD,MAAK+C,SAASA;AAClC,cAAMO,oBAAoBC,OAAOC,KAAKR,UAAAA,EAAYS,KAAK,CAACrB,QAAQpC,MAAKgD,WAAWZ,GAAAA,MAASY,WAAWZ,GAAAA,CAAI;AACxGzC,YAAI,iBAAiB;UAAEa;UAAI4C;UAAaC;UAAaC;QAAkB,GAAA;;;;;;AACvE,YAAIF,eAAeC,eAAeC,mBAAmB;AACnD3D,cAAI,iBAAiB;YAAEa;YAAIsC;YAAMC;YAAMC;UAAW,GAAA;;;;;;AAClD,gBAAMU,UAAUtE,OAAOqE,KAAK;YAAE,GAAGzD;YAAM8C;YAAMC;YAAMC,YAAY;cAAE,GAAGhD,MAAKgD;cAAY,GAAGA;YAAW;UAAE,CAAA;AACrG,eAAKvC,UAAUyB,IAAIe,QAAQS,OAAAA;AAC3B,eAAKC,cAAcC,KAAK;YAAEpD;YAAIR,MAAM0D;UAAQ,CAAA;QAC9C;MACF;MACAG,QAAQ,MAAA;AACNlE,YAAI,YAAY;UAAEa;UAAIsC;UAAMC;UAAMC;QAAW,GAAA;;;;;;AAC7C,cAAMU,UAAU,KAAKI,eAAe;UAAEtD;UAAIsC;UAAMC;UAAMC;QAAW,CAAA;AACjE,aAAKvC,UAAUyB,IAAIe,QAAQS,OAAAA;AAC3B,aAAKC,cAAcC,KAAK;UAAEpD;UAAIR,MAAM0D;QAAQ,CAAA;MAC9C;IACF,CAAA;AAEA,QAAIjB,OAAO;AAET,WAAKD,SAASC,KAAAA;AACd,YAAMnB,SAASmB,MAAME,IAAI,CAAC3C,WAAU;QAAE+D,QAAQvD;QAAIwD,QAAQhE,MAAKQ;MAAG,EAAA;AAClE,WAAKyD,SAAS3C,MAAAA;IAEhB;AAEA,QAAID,OAAO;AACT5B,WAAAA;IACF;EACF;EAEAyE,YAAYC,KAAe9C,QAAQ,OAAa;AAC9ClC,OAAGuD,MAAM,MAAA;AACPyB,UAAIxB,IAAI,CAACnC,OAAO,KAAK4D,WAAW5D,IAAIa,KAAAA,CAAAA;IACtC,CAAA;EACF;EAEA+C,WAAW5D,IAAYa,QAAQ,OAAa;AAC1C,UAAM4B,SAAS,KAAKpC,MAAML,EAAAA;AAE1B,SAAKC,UAAUyB,IAAIe,QAAQ7D,OAAOiF,KAAI,CAAA;AACtC,SAAKV,cAAcC,KAAK;MAAEpD;MAAIR,MAAMZ,OAAOiF,KAAI;IAAG,CAAA;AAGlD,QAAIhD,OAAO;AACT,YAAM,EAAEiD,SAASC,SAAQ,IAAK,KAAK9D,UAAUC,IAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC7D,YAAMa,SAAQ;WACTiD,QAAQ3B,IAAI,CAACoB,YAAY;UAAEA;UAAQC,QAAQxD;QAAG,EAAA;WAC9C+D,SAAS5B,IAAI,CAACqB,YAAY;UAAED,QAAQvD;UAAIwD;QAAO,EAAA;;AAEpD,WAAKQ,YAAYnD,MAAAA;IACnB;AAEA,SAAKoD,gBAAgBjE,EAAAA;EACvB;EAEAyD,SAAS5C,OAAqB;AAC5BlC,OAAGuD,MAAM,MAAA;AACPrB,YAAMsB,IAAI,CAAC+B,SAAS,KAAKC,QAAQD,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAC,QAAQC,SAAqB;AAC3B,UAAMC,WAAW,KAAKvD,OAAOsD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,QAAI,CAACd,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC7CrE,UAAI,qBAAqB;QAAEoE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AAC1E,WAAKvD,UAAUyB,IAAI2C,UAAU;QAAEP,SAASP,OAAOO;QAASC,UAAU;aAAIR,OAAOQ;UAAUK,QAAQZ;;MAAQ,CAAA;IACzG;AAEA,UAAMe,WAAW,KAAKzD,OAAOsD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,QAAI,CAACf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC5CpE,UAAI,oBAAoB;QAAEoE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AACzE,WAAKvD,UAAUyB,IAAI6C,UAAU;QAAET,SAAS;aAAIN,OAAOM;UAASM,QAAQb;;QAASQ,UAAUP,OAAOO;MAAS,CAAA;IACzG;EACF;EAEAC,YAAYnD,OAAe2D,gBAAgB,OAAa;AACtD7F,OAAGuD,MAAM,MAAA;AACPrB,YAAMsB,IAAI,CAAC+B,SAAS,KAAKO,WAAWP,MAAMM,aAAAA,CAAAA;IAC5C,CAAA;EACF;EAEAC,WAAWL,SAAeI,gBAAgB,OAAa;AACrD,UAAMH,WAAW,KAAKvD,OAAOsD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,QAAId,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC5C,WAAKvD,UAAUyB,IAAI2C,UAAU;QAC3BP,SAASP,OAAOO;QAChBC,UAAUR,OAAOQ,SAASW,OAAO,CAAC1E,OAAOA,OAAOoE,QAAQZ,MAAM;MAChE,CAAA;IACF;AAEA,UAAMe,WAAW,KAAKzD,OAAOsD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,QAAIf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC3C,WAAKtD,UAAUyB,IAAI6C,UAAU;QAC3BT,SAASN,OAAOM,QAAQY,OAAO,CAAC1E,OAAOA,OAAOoE,QAAQb,MAAM;QAC5DQ,UAAUP,OAAOO;MACnB,CAAA;IACF;AAEA,QAAIS,eAAe;AACjB,YAAMjB,UAAS,KAAKtD,UAAUC,IAAImE,QAAAA;AAClC,YAAMb,UAAS,KAAKvD,UAAUC,IAAIqE,QAAAA;AAClC,UAAIhB,QAAOQ,SAASY,WAAW,KAAKpB,QAAOO,QAAQa,WAAW,KAAKP,QAAQb,WAAW7D,SAAS;AAC7F,aAAKgE,YAAY;UAACU,QAAQb;SAAO;MACnC;AACA,UAAIC,QAAOO,SAASY,WAAW,KAAKnB,QAAOM,QAAQa,WAAW,KAAKP,QAAQZ,WAAW9D,SAAS;AAC7F,aAAKgE,YAAY;UAACU,QAAQZ;SAAO;MACnC;IACF;EACF;EAEAoB,UAAU5E,IAAYS,UAAoBoE,OAAuB;AAC/D,UAAMC,UAAU,KAAKhE,OAAOd,EAAAA;AAC5B,UAAMa,QAAQ,KAAKZ,UAAUC,IAAI4E,OAAAA;AACjC,UAAMC,WAAWlE,MAAMJ,QAAAA,EAAUiE,OAAO,CAAC1E,QAAO,CAAC6E,MAAMP,SAAStE,GAAAA,CAAAA,KAAQ,CAAA;AACxE,UAAMgF,SAASH,MAAMH,OAAO,CAAC1E,QAAOa,MAAMJ,QAAAA,EAAU6D,SAAStE,GAAAA,CAAAA,KAAQ,CAAA;AACrEa,UAAMJ,QAAAA,EAAUwE,OAAO,GAAGpE,MAAMJ,QAAAA,EAAUkE,QAAM,GAAK;SAAIK;SAAWD;KAAS;AAC7E,SAAK9E,UAAUyB,IAAIoD,SAASjE,KAAAA;EAC9B;EAEAqE,SAAS,EAAEC,SAAS5B,SAAS7D,SAASe,WAAW,WAAU,GAA2B2E,OAAiB,CAAA,GAAU;AAE/G,QAAIA,KAAKd,SAASf,MAAAA,GAAS;AACzB;IACF;AAEA,UAAM/D,OAAO,KAAKwB,eAAeuC,MAAAA;AACjC,UAAM8B,iBAAiBF,QAAQ3F,MAAM;SAAI4F;MAAM7B;KAAO;AACtD,QAAI8B,mBAAmB,OAAO;AAC5B;IACF;AAEAtC,WAAOuC,OAAO,KAAKpE,eAAeqC,QAAQ9C,QAAAA,CAAAA,EAAW8E,QAAQ,CAACC,UAC5D,KAAKN,SAAS;MAAE3B,QAAQiC,MAAMxF;MAAIS;MAAU0E;IAAQ,GAAG;SAAIC;MAAM7B;KAAO,CAAA;EAE5E;EAEAkC,QAAQ,EAAElC,SAAS,QAAQC,OAAM,GAAkE;AACjG,WAAO1E,KACL,KAAKmC,QAAQsC,MAAAA,GACb3E,OAAO8G,QAAQ,CAAClG,SAAAA;AACd,UAAImG,QAAiC/G,OAAOiF,KAAI;AAChD,WAAKqB,SAAS;QACZ3B,QAAQ/D,KAAKQ;QACbmF,SAAS,CAAC3F,OAAM4F,SAAAA;AACd,cAAIxG,OAAOgH,OAAOD,KAAAA,GAAQ;AACxB,mBAAO;UACT;AAEA,cAAInG,MAAKQ,OAAOwD,QAAQ;AACtBmC,oBAAQ/G,OAAOqE,KAAKmC,IAAAA;UACtB;QACF;MACF,CAAA;AAEA,aAAOO;IACT,CAAA,CAAA;EAEJ;EAEA,MAAME,YACJC,QACA,EAAEC,UAAU,KAAOC,WAAW,IAAG,IAA8C,CAAC,GAC7D;AACnB,UAAMZ,OAAO,KAAKK,QAAQK,MAAAA;AAC1B,QAAIlH,OAAOgH,OAAOR,IAAAA,GAAO;AACvB,aAAOA,KAAKa;IACd;AAEA,UAAMC,UAAU,IAAIlH,QAAAA;AACpB,UAAMmH,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKK,QAAQK,MAAAA;AAC1B,UAAIlH,OAAOgH,OAAOR,KAAAA,GAAO;AACvBc,gBAAQG,KAAKjB,MAAKa,KAAK;MACzB;IACF,GAAGD,QAAAA;AAEH,WAAOE,QAAQI,KAAK;MAAEP;IAAQ,CAAA,EAAGQ,QAAQ,MAAMC,cAAcL,CAAAA,CAAAA;EAC/D;;EAGA7C,eAAe9D,MAAyC;AACtD,WAAOZ,OAAOqE,KAAK;MAAE,CAAC5D,WAAAA,GAAc;MAAMkD,MAAM;MAAMC,YAAY,CAAC;MAAG,GAAGhD;IAAK,CAAA;EAChF;EAlSA,YAAY,EAAEiH,UAAUxE,OAAOpB,OAAO6F,cAAcC,UAAUC,aAAY,IAAkB,CAAC,GAAG;AAlFhG,qBAAA,MAASzD,iBAAgB,IAAIpE,MAAAA,CAAAA;AAE7B,qBAAA,MAAiBgD,aAAjB,MAAA;AACA,qBAAA,MAAiBN,iBAAjB,MAAA;AACA,qBAAA,MAAiBwC,iBAAjB,MAAA;AAEA,qBAAA,MAAiBhE,aAAjB,MAAA;AACA,qBAAA,MAAiB6B,aAAYjD,OAAOgI,MAAK,CAAA;AACzC,qBAAA,MAAiBtF,gBAAe1C,OAAOgI,MAAK,CAAA;AAC5C,qBAAA,MAAiBC,iBAAgBjI,OAAOgI,MAAK,CAAA;AAC7C,qBAAA,MAAiBE,iBAAgBlI,OAAOmI,YAAY;MAClD;QAACtH;QAAS,KAAK4D,eAAe;UAAEtD,IAAIN;UAAS4C,MAAM3C;UAAW4C,MAAM;UAAMC,YAAY,CAAC;QAAE,CAAA;;KAC1F,CAAA;AAGD,qBAAA,MAASnC,SAAQ1B,GAAGsI,OAAiD,CAACjH,OAAAA;AACpE,YAAMkH,UAAUtI,OAAOuI,QAAQtI,OAAOqB,IAAI,KAAK6G,eAAe/G,EAAAA,CAAAA;AAC9D,aAAOrB,GAAGyI,KAA0BF,OAAAA,EAASpI,KAAKH,GAAG0I,WAAW1I,GAAG2I,UAAU,cAActH,EAAAA,EAAI,CAAA;IACjG,CAAA,CAAA;AAEA,qBAAA,MAAiBO,gBAAe5B,GAAGsI,OAA4B,CAACjH,OAAAA;AAC9D,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAMV,OAAOU,IAAI,KAAKG,MAAML,EAAAA,CAAAA;AAC5Bd,kBAAUN,OAAOgH,OAAOpG,IAAAA,GAAO,uBAAuBQ,EAAAA,IAAI;;;;;;;;;AAC1D,eAAOR,KAAKyG;MACd,CAAA;IACF,CAAA,CAAA;AAEA,qBAAA,MAAiBnF,UAASnC,GAAGsI,OAAmC,CAACjH,OAAAA;AAC/D,YAAMkH,UAAUrI,OAAOqB,IAAI,KAAK4G,eAAe9G,EAAAA,EAAIlB,KAAKF,OAAO4C,UAAU,OAAO;QAAEsC,SAAS,CAAA;QAAIC,UAAU,CAAA;MAAG,EAAA,CAAA;AAC5G,aAAOpF,GAAGyI,KAAYF,OAAAA,EAASpI,KAAKH,GAAG0I,WAAW1I,GAAG2I,UAAU,eAAetH,EAAAA,EAAI,CAAA;IACpF,CAAA,CAAA;AAIA,qBAAA,MAAiBU,gBAAe/B,GAAGsI,OAA8B,CAACrF,QAAAA;AAChE,aAAOjD,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAM,CAACF,IAAIS,QAAAA,IAAYmB,IAAI2F,MAAM,GAAA;AACjC,cAAM1G,SAAQX,IAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC9B,eAAOa,OAAMJ,QAAAA,EACV0B,IAAI,CAACnC,QAAOE,IAAI,KAAKG,MAAML,GAAAA,CAAAA,CAAAA,EAC3B0E,OAAO9F,OAAOgH,MAAM,EACpBzD,IAAI,CAACqF,MAAMA,EAAEvB,KAAK;MACvB,CAAA,EAAGnH,KAAKH,GAAG2I,UAAU,qBAAqB1F,GAAAA,EAAK,CAAA;IACjD,CAAA,CAAA;AAEA,qBAAA,MAAiBhB,YAAWjC,GAAGsI,OAAgD,CAACjH,OAAAA;AAC9E,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,eAAOA,IAAI,KAAKQ,aAAa,GAAGV,EAAAA,WAAa,CAAA,EAAG0E,OAC9C,CAAClF,SAASA,KAAK8C,SAAS1C,eAAeJ,KAAK8C,SAASzC,iBAAAA;MAEzD,CAAA,EAAGf,KAAKH,GAAG2I,UAAU,iBAAiBtH,EAAAA,EAAI,CAAA;IAC5C,CAAA,CAAA;AAEA,qBAAA,MAAiBG,SAAQxB,GAAGsI,OAA2B,CAACjH,OAAAA;AACtD,aAAOrB,GAAGyI,KAAK,CAAClH,QAAAA;AACd,cAAMH,SAAS,CAACP,MAAYiI,OAAiB,CAAA,MAAE;AAC7C,gBAAMxF,SAAQ/B,IAAI,KAAKM,YAAYhB,KAAKQ,EAAE,CAAA;AAC1C,gBAAM0H,MAA2B;YAC/B1H,IAAIR,KAAKQ,GAAG2E,SAAS,KAAK,GAAGnF,KAAKQ,GAAG2H,MAAM,GAAG,EAAA,CAAA,QAAWnI,KAAKQ;YAC9DsC,MAAM9C,KAAK8C;UACb;AACA,cAAI9C,KAAKgD,WAAWoF,OAAO;AACzBF,gBAAIE,QAAQpI,KAAKgD,WAAWoF;UAC9B;AACA,cAAI3F,OAAM0C,QAAQ;AAChB+C,gBAAIzF,QAAQA,OACTE,IAAI,CAAC0F,MAAAA;AAEJ,oBAAMC,WAAW;mBAAIL;gBAAMjI,KAAKQ;;AAChC,qBAAO8H,SAASxD,SAASuD,EAAE7H,EAAE,IAAI+H,SAAYhI,OAAO8H,GAAGC,QAAAA;YACzD,CAAA,EACCpD,OAAOtF,aAAAA;UACZ;AACA,iBAAOsI;QACT;AAEA,cAAM3G,OAAOb,IAAI,KAAKI,YAAYN,EAAAA,CAAAA;AAClC,eAAOD,OAAOgB,IAAAA;MAChB,CAAA,EAAGjC,KAAKH,GAAG2I,UAAU,cAActH,EAAAA,EAAI,CAAA;IACzC,CAAA,CAAA;AAGE,SAAKC,YAAYwG,YAAY/H,SAAS0I,KAAI;AAC1C,SAAK3F,gBAAgBiF;AACrB,SAAK3E,YAAY4E;AACjB,SAAK1C,gBAAgB2C;AAErB,QAAI3E,OAAO;AACTA,YAAMsD,QAAQ,CAAC/F,SAAAA;AACbX,eAAO6C,IAAI,KAAKqF,eAAevH,KAAKQ,IAAI,KAAKsD,eAAe9D,IAAAA,CAAAA;MAC9D,CAAA;IACF;AAEA,QAAIqB,OAAO;AACTkC,aAAOiF,QAAQnH,KAAAA,EAAO0E,QAAQ,CAAC,CAAChC,QAAQ1C,MAAAA,MAAM;AAC5ChC,eAAO6C,IAAI,KAAKoF,eAAevD,QAAQ1C,MAAAA;MACzC,CAAA;IACF;EACF;AAkRF;;;ACrlBA,SAASoH,YAAAA,WAAUC,MAAAA,WAAU;AAC7B,SAASC,cAAc;AACvB,SAASC,OAAOC,UAAAA,SAAQC,UAAAA,SAAQC,QAAAA,aAAY;AAG5C,SAASC,OAAAA,YAAW;AACpB,SAA2CC,YAAYC,cAAcC,QAAQC,iBAAAA,sBAAqB;;;AC0C3F,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,cAAcA,KAAKG,SAASC,cAAc;AAE9E,IAAMC,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACP,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASK,qBAAqBL,KAAKG,SAASK,oBAAoB;AAIpF,IAAMC,eAAe,CAACT,SAAgDE,SAASF,IAAAA,KAASO,cAAcP,IAAAA;;;;;;;;;;;;;;;;;ADtCtG,IAAMU,kBAAkB,CAACC,cAAAA;AAC9B,QAAM,EACJC,IACAC,WAAW,UACXC,WAAW,YACXC,UAAUC,WACVC,WAAWC,YACXC,SAASC,UACTC,cAAcC,cAAa,IACzBX;AACJ,QAAMY,QAAQ,CAACC,QAAgB,GAAGZ,EAAAA,IAAMY,GAAAA;AAExC,QAAMT,WACJC,aAAaS,IAAGC,OAAO,CAACd,QAAeI,UAAUJ,GAAAA,EAAIe,KAAKF,IAAGG,UAAU,2BAA2BhB,GAAAA,EAAI,CAAA,CAAA;AAExG,QAAMK,YACJC,cACAO,IAAGC,OAAO,CAACG,SACTX,WAAWW,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,4BAA4BhB,EAAAA,EAAI,CAAA,CAAA;AAGvE,QAAMS,eACJC,iBACAG,IAAGC,OAAO,CAACG,SACTP,cAAcO,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,+BAA+BhB,EAAAA,EAAI,CAAA,CAAA;AAG7E,QAAMO,UACJC,YACAK,IAAGC,OAAO,CAACG,SAAqCT,SAASS,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,0BAA0BhB,EAAAA,EAAI,CAAA,CAAA;AAEjH,SAAO;IACLG,WAAW;MAAEH,IAAIW,MAAM,UAAA;MAAaV;MAAUE;IAAS,IAAIe;IAC3Db,YACK;MACCL,IAAIW,MAAM,WAAA;MACVV;MACAC;MACAG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIf,UAAUY,IAAAA,CAAAA;QACvB,QAAQ;AACNI,UAAAA,KAAIC,KAAK,sBAAsB;YAAEtB,IAAIW,MAAM,WAAA;YAAcM;UAAK,GAAA;;;;;;AAC9D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,2BAA2BhB,EAAAA,EAAI,CAAA,CAAA;IAExD,IACAkB;IACJT,eACK;MACCT,IAAIW,MAAM,cAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIX,aAAaQ,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAC3C,GAAGA;YACHC,MAAMC;YACNC,MAAMC;UACR,EAAA;QACF,QAAQ;AACNP,UAAAA,KAAIC,KAAK,yBAAyB;YAAEtB,IAAIW,MAAM,cAAA;YAAiBM;UAAK,GAAA;;;;;;AACpE,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,wCAAwChB,EAAAA,EAAI,CAAA,CAAA;IAErE,IACAkB;IACJX,UACK;MACCP,IAAIW,MAAM,SAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,QAAAA;AACP,YAAI;AACF,iBAAOA,IAAIb,QAAQU,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAAE,GAAGA;YAAKG,MAAME;UAAY,EAAA;QACtE,QAAQ;AACNR,UAAAA,KAAIC,KAAK,oBAAoB;YAAEtB,IAAIW,MAAM,SAAA;YAAYM;UAAK,GAAA;;;;;;AAC1D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,mCAAmChB,EAAAA,EAAI,CAAA,CAAA;IAEhE,IACAkB;IACJY,OAAOC,cAAAA;AACX;AAmBO,IAAMC,oBAAoB,CAACjC,WAA8BkC,MAA0B,CAAA,MAAE;AAC1F,MAAIC,MAAMC,QAAQpC,SAAAA,GAAY;AAC5B,WAAO;SAAIkC;SAAQlC,UAAUqC,QAAQ,CAACC,QAAQL,kBAAkBK,KAAKJ,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAKlC;;EAClB;AACF;AAQO,IAAMuC,eAAN,MAAMA,cAAAA;EAsBX,OAAOC,KAAKC,QAAiBC,UAA4C;AACvE,QAAI,CAACD,QAAQ;AACX,aAAO,IAAIF,cAAa;QAAEG;MAAS,CAAA;IACrC;AAEA,UAAM,EAAEC,OAAOC,MAAK,IAAKC,KAAKC,MAAML,MAAAA;AACpC,WAAO,IAAIF,cAAa;MAAEI;MAAOC;MAAOF;IAAS,CAAA;EACnD;EAEA,IAAIK,QAAyB;AAC3B,WAAO,KAAKC;EACd;EAEA,IAAIC,aAAa;AACf,WAAO,KAAKC;EACd;EAEAC,aAAaF,YAA6C;AACxDhB,sBAAkBgB,UAAAA,EAAYG,QAAQ,CAACpD,cAAAA;AACrC,YAAMiD,cAAa,KAAKI,UAAUhC,IAAI,KAAK6B,WAAW;AACtD,WAAKG,UAAUC,IAAI,KAAKJ,aAAaK,QAAOD,IAAIL,aAAYjD,UAAUC,IAAID,SAAAA,CAAAA;IAC5E,CAAA;AACA,WAAO;EACT;EAEAwD,gBAAgBvD,IAA0B;AACxC,UAAMgD,aAAa,KAAKI,UAAUhC,IAAI,KAAK6B,WAAW;AACtD,SAAKG,UAAUC,IAAI,KAAKJ,aAAaK,QAAOE,OAAOR,YAAYhD,EAAAA,CAAAA;AAC/D,WAAO;EACT;EAEA,MAAMyD,QAIJ,EAAEhB,WAAWiB,UAASvC,KAAI,GAAIwC,SAASC,SAAS1D,WAAW,YAAY2D,QAAO,GAC9EC,OAAiB,CAAA,GACF;AAEf,QAAIA,KAAKC,SAASJ,MAAAA,GAAS;AACzB;IACF;AAIA,QAAI,CAACK,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AAEA,UAAMhD,OAAOwB,SAASrB,IAAI,KAAK2B,OAAOmB,YAAYP,MAAAA,CAAAA;AAClD,UAAMQ,iBAAiB,MAAMN,QAAQ5C,MAAM;SAAI6C;MAAM7C,KAAKjB;KAAG;AAC7D,QAAImE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMzB,QAAQ0B,OAAOC,OAAO,KAAKjB,UAAUhC,IAAI,KAAK6B,WAAW,CAAA,EAC5DnB,OAAO,CAAC/B,cAAcG,cAAcH,UAAUG,YAAY,WAAS,EACnEqB,IAAI,CAACxB,cAAcA,UAAUM,SAAS,EACtCyB,OAAOC,cAAAA,EACPK,QAAQ,CAAC/B,cAAcoC,SAASrB,IAAIf,UAAU,KAAK0C,OAAO9B,KAAK0C,MAAAA,CAAAA,CAAAA,CAAAA;AAElE,UAAMW,QAAQC,IACZ7B,MAAMnB,IAAI,CAACiD,YAAAA;AACT/B,eAASY,IAAI,KAAKN,OAAO0B,MAAMD,QAAQxE,EAAE,GAAG,KAAK+C,OAAO2B,eAAeF,OAAAA,CAAAA;AACvE,aAAO,KAAKf,QAAQ;QAAEhB;QAAUkB,QAAQa,QAAQxE;QAAIE;QAAU2D;MAAQ,GAAG;WAAIC;QAAM7C,KAAKjB;OAAG;IAC7F,CAAA,CAAA;AAGF,QAAIyC,aAAa,KAAKW,WAAW;AAC/BX,eAASkC,MAAK;AACdlC,eAASmC,QAAO;IAClB;EACF;EAEAC,UAAgB;AACd,SAAKC,eAAe3B,QAAQ,CAAC4B,gBAAgBA,YAAAA,CAAAA;AAC7C,SAAKD,eAAeE,MAAK;EAC3B;EAmCQC,UAAUjF,IAAYE,UAA0B;AACtDmB,IAAAA,KAAI,YAAY;MAAErB;MAAIE;MAAUuC,UAAUyC,aAAa,KAAK9B,SAAS;IAAE,GAAA;;;;;;AACvE,UAAM+B,aAAa,KAAKC,YAAY,GAAGpF,EAAAA,IAAME,QAAAA,EAAU;AAEvD,QAAImF,WAAqB,CAAA;AACzB,UAAMC,SAAS,KAAKlC,UAAUmC,UAC5BJ,YACA,CAACzC,UAAAA;AACC,YAAM8C,MAAM9C,MAAMnB,IAAI,CAACkE,MAAMA,EAAEzF,EAAE;AACjC,YAAM0F,UAAUL,SAASvD,OAAO,CAAC9B,QAAO,CAACwF,IAAIzB,SAAS/D,GAAAA,CAAAA;AACtDqF,iBAAWG;AAEXnE,MAAAA,KAAI,UAAU;QAAErB;QAAIE;QAAUsF;QAAKE;MAAQ,GAAA;;;;;;AAC3C,YAAMC,SAAS,MAAA;AACb9E,QAAAA,IAAG+E,MAAM,MAAA;AACP,eAAK7C,OAAO8C,YACVH,QAAQnE,IAAI,CAACuE,YAAY;YAAEnC,QAAQ3D;YAAI8F;UAAO,EAAA,GAC9C,IAAA;AAEF,eAAK/C,OAAOgD,SAASrD,KAAAA;AACrB,eAAKK,OAAOiD,SACVtD,MAAMnB,IAAI,CAACN,SACTf,aAAa,aAAa;YAAEyD,QAAQ3D;YAAI8F,QAAQ7E,KAAKjB;UAAG,IAAI;YAAE2D,QAAQ1C,KAAKjB;YAAI8F,QAAQ9F;UAAG,CAAA,CAAA;AAG9F,eAAK+C,OAAOkD,UACVjG,IACAE,UACAwC,MAAMnB,IAAI,CAAC,EAAEvB,IAAAA,IAAE,MAAOA,GAAAA,CAAAA;QAE1B,CAAA;MACF;AAIA,UAAI,OAAOkG,0BAA0B,YAAY;AAC/CA,8BAAsBP,MAAAA;MACxB,OAAO;AACLA,eAAAA;MACF;IACF,GACA;MAAEQ,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAezB,IAAIrD,IAAIsF,MAAAA;EAC9B;;EAGA,MAAcc,cAAcpG,IAAY;AACtCqB,IAAAA,KAAI,gBAAgB;MAAErB;IAAG,GAAA;;;;;;AACzB,UAAMG,WAAW,KAAKkG,WAAWrG,EAAAA;AAEjC,UAAMsF,SAAS,KAAKlC,UAAUmC,UAC5BpF,UACA,CAACc,SAAAA;AACC,YAAMqF,UAAU,KAAKC,aAAavG,EAAAA;AAClCwG,MAAAA,QAAOC,MAAMxF,MAAM;QACjByF,QAAQ,CAACzF,UAAAA;AACP,eAAK8B,OAAOgD,SAAS;YAAC9E;WAAK;AAC3BqF,mBAASK,KAAAA;QACX;QACAC,QAAQ,MAAA;AACNN,mBAASK,KAAAA;AACT,eAAK5D,OAAO8D,YAAY;YAAC7G;WAAG;QAC9B;MACF,CAAA;IACF,GACA;MAAEmG,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAezB,IAAIrD,IAAIsF,MAAAA;EAC9B;EAEQwB,cAAc9G,IAAkB;AACtC,SAAK8E,eAAe1D,IAAIpB,EAAAA,IAAAA;AACxB,SAAK8E,eAAeiC,OAAO/G,EAAAA;EAC7B;EAxMA,YAAY,EAAEyC,UAAU,GAAGuE,OAAAA,IAA8D,CAAC,GAAG;AAT7F,IAAAC,kBAAA,MAAiBnC,kBAAiB,oBAAIoC,IAAAA,CAAAA;AACtC,IAAAD,kBAAA,MAAiBhE,eAAcpC,IAAGM,KAAKmC,QAAO6D,MAAK,CAAA,EAA8BpG,KAC/EF,IAAGuG,WACHvG,IAAGG,UAAU,0BAAA,CAAA,CAAA;AAEf,IAAAiG,kBAAA,MAAiBV,gBAAwC,CAAC,CAAA;AAC1D,IAAAU,kBAAA,MAAiB7D,aAAjB,MAAA;AACA,IAAA6D,kBAAA,MAAiBlE,UAAjB,MAAA;AA6FA,IAAAkE,kBAAA,MAAiBZ,cAAaxF,IAAGC,OAAmD,CAACd,OAAAA;AACnF,aAAOa,IAAGM,KAAK,CAACC,QAAAA;AACd,eAAOL,MACLK,IAAI,KAAK6B,WAAW,GACpBK,QAAOe,QACPnC,MAAMmF,OAAOC,UAAAA,GACbpF,MAAMX,IAAI,CAAC,EAAEpB,SAAQ,MAAOA,QAAAA,GAC5B+B,MAAMJ,OAAOC,cAAAA,GACbG,MAAMX,IAAI,CAACpB,aAAaiB,IAAIjB,SAASH,EAAAA,CAAAA,CAAAA,GACrCkC,MAAMJ,OAAOC,cAAAA,GACbG,MAAMqF,IAAI;MAEd,CAAA;IACF,CAAA,CAAA;AAEA,IAAAN,kBAAA,MAAiB7B,eAAcvE,IAAGC,OAAsC,CAACF,QAAAA;AACvE,aAAOC,IAAGM,KAAK,CAACC,QAAAA;AACd,cAAM,CAACpB,IAAIE,QAAAA,IAAYU,IAAI4G,MAAM,GAAA;AACjC,cAAMvG,OAAO,KAAK8B,OAAO9B,KAAKjB,EAAAA;AAE9B,eAAOe;UACLK,IAAI,KAAK6B,WAAW;UACpBK,QAAOe;;UAEPnC,MAAMmF,OAAOC,UAAAA;UACbpF,MAAMJ,OAAO,CAAC,EAAE5B,UAAUuH,YAAY,WAAU,MAAOA,cAAcvH,QAAAA;UACrEgC,MAAMX,IAAI,CAAC,EAAElB,UAAS,MAAOA,YAAYY,IAAAA,CAAAA;UACzCiB,MAAMJ,OAAOC,cAAAA;UACbG,MAAME,QAAQ,CAACsF,WAAWtG,IAAIsG,MAAAA,CAAAA;QAAAA;MAElC,CAAA,EAAG3G,KAAKF,IAAGG,UAAU,4BAA4BJ,GAAAA,EAAK,CAAA;IACxD,CAAA,CAAA;AAzHE,SAAKwC,YAAYX,YAAYiB,UAASvC,KAAI;AAC1C,SAAK4B,SAAS,IAAI4E,MAAM;MACtB,GAAGX;MACHvE,UAAU,KAAKW;MACfwE,UAAU,CAAC5H,IAAIE,aAAa,KAAK+E,UAAUjF,IAAIE,QAAAA;MAC/C2H,cAAc,CAAC7H,OAAO,KAAKoG,cAAcpG,EAAAA;MACzC8H,cAAc,CAAC9H,OAAO,KAAK8G,cAAc9G,EAAAA;IAC3C,CAAA;EACF;AAgMF;AAMO,IAAM+H,eAAe,CAAIC,OAAAA;AAC9B,SAAOnH,IAAGM,KAAK,CAACC,QAAAA;AACd,UAAMwD,UAAUqD,OAAO,MAAA;AACrB7G,UAAI8G,QAAQF,GAAAA,CAAAA;IACd,CAAA;AAEA5G,QAAI+G,aAAa,MAAMvD,QAAAA,CAAAA;AAEvB,WAAOoD,GAAAA;EACT,CAAA;AACF;AAEA,IAAMI,mBAAmBvH,IAAGC,OAAO,CAACuH,eAAAA;AAClC,SAAOxH,IAAGM,KAAK,CAACC,QAAAA;AACd,UAAMkH,eAAeD,WAAW9C,UAAU,CAACgD,UAAUnH,IAAI8G,QAAQK,KAAAA,CAAAA;AAEjEnH,QAAI+G,aAAa,MAAMG,aAAavD,YAAW,CAAA;AAE/C,WAAOsD,WAAWjH,IAAG;EACvB,CAAA;AACF,CAAA;AAMO,IAAMoH,mBAAmB,CAAIH,eAAAA;AAClC,SAAOD,iBAAiBC,UAAAA;AAC1B;",
-  "names": ["Registry", "Rx", "Option", "Record", "pipe", "Event", "Trigger", "todo", "invariant", "log", "isNonNullable", "graphSymbol", "Symbol", "getGraph", "node", "graph", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "toJSON", "id", "_registry", "get", "_json", "json", "_node", "nodeOrThrow", "_nodeOrThrow", "connections", "relation", "_connections", "actions", "_actions", "edges", "_edges", "root", "getNodeOrThrow", "getNode", "getConnections", "getActions", "getEdges", "initialize", "initialized", "_initialized", "getOrElse", "_onInitialize", "set", "expand", "key", "expanded", "_expanded", "_onExpand", "addNodes", "nodes", "batch", "map", "addNode", "nodeArg", "type", "data", "properties", "nodeRx", "match", "onSome", "typeChanged", "dataChanged", "propertiesChanged", "Object", "keys", "some", "newNode", "onNodeChanged", "emit", "onNone", "_constructNode", "source", "target", "addEdges", "removeNodes", "ids", "removeNode", "none", "inbound", "outbound", "removeEdges", "_onRemoveNode", "edge", "addEdge", "edgeArg", "sourceRx", "includes", "targetRx", "removeOrphans", "removeEdge", "filter", "length", "sortEdges", "order", "edgesRx", "unsorted", "sorted", "splice", "traverse", "visitor", "path", "shouldContinue", "values", "forEach", "child", "getPath", "flatMap", "found", "isSome", "waitForPath", "params", "timeout", "interval", "value", "trigger", "i", "setInterval", "wake", "wait", "finally", "clearInterval", "registry", "onInitialize", "onExpand", "onRemoveNode", "empty", "_initialEdges", "_initialNodes", "fromEntries", "family", "initial", "flatten", "make", "keepAlive", "withLabel", "split", "o", "seen", "obj", "slice", "label", "n", "nextSeen", "undefined", "entries", "Registry", "Rx", "effect", "Array", "Option", "Record", "pipe", "log", "byPosition", "getDebugName", "isNode", "isNonNullable", "isGraphNode", "data", "properties", "isAction", "type", "ACTION_TYPE", "actionGroupSymbol", "Symbol", "isActionGroup", "ACTION_GROUP_TYPE", "isActionLike", "createExtension", "extension", "id", "position", "relation", "resolver", "_resolver", "connector", "_connector", "actions", "_actions", "actionGroups", "_actionGroups", "getId", "key", "Rx", "family", "pipe", "withLabel", "node", "undefined", "make", "get", "log", "warn", "map", "arg", "data", "actionGroupSymbol", "type", "ACTION_GROUP_TYPE", "ACTION_TYPE", "filter", "isNonNullable", "flattenExtensions", "acc", "Array", "isArray", "flatMap", "ext", "GraphBuilder", "from", "pickle", "registry", "nodes", "edges", "JSON", "parse", "graph", "_graph", "extensions", "_extensions", "addExtension", "forEach", "_registry", "set", "Record", "removeExtension", "remove", "explore", "Registry", "source", "ROOT_ID", "visitor", "path", "includes", "isNode", "yieldOrContinue", "nodeOrThrow", "shouldContinue", "Object", "values", "Promise", "all", "nodeArg", "_node", "_constructNode", "reset", "dispose", "destroy", "_subscriptions", "unsubscribe", "clear", "_onExpand", "getDebugName", "connectors", "_connectors", "previous", "cancel", "subscribe", "ids", "n", "removed", "update", "batch", "removeEdges", "target", "addNodes", "addEdges", "sortEdges", "requestAnimationFrame", "immediate", "_onInitialize", "_resolvers", "trigger", "_initialized", "Option", "match", "onSome", "wake", "onNone", "removeNodes", "_onRemoveNode", "delete", "params", "_define_property", "Map", "empty", "keepAlive", "sortBy", "byPosition", "head", "split", "_relation", "result", "Graph", "onExpand", "onInitialize", "onRemoveNode", "rxFromSignal", "cb", "effect", "setSelf", "addFinalizer", "observableFamily", "observable", "subscription", "value", "rxFromObservable"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\n\nimport { Event, Trigger } from '@dxos/async';\nimport { todo } from '@dxos/debug';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type MakeOptional, isNonNullable } from '@dxos/util';\n\nimport { type Action, type ActionGroup, type Node, type NodeArg, type Relation } from './node';\n\nconst graphSymbol = Symbol('graph');\ntype DeepWriteable<T> = { -readonly [K in keyof T]: T[K] extends object ? DeepWriteable<T[K]> : T[K] };\ntype NodeInternal = DeepWriteable<Node> & { [graphSymbol]: Graph };\n\n/**\n * Get the Graph a Node is currently associated with.\n */\nexport const getGraph = (node: Node): Graph => {\n  const graph = (node as NodeInternal)[graphSymbol];\n  invariant(graph, 'Node is not associated with a graph.');\n  return graph;\n};\n\nexport const ROOT_ID = 'root';\nexport const ROOT_TYPE = 'dxos.org/type/GraphRoot';\nexport const ACTION_TYPE = 'dxos.org/type/GraphAction';\nexport const ACTION_GROUP_TYPE = 'dxos.org/type/GraphActionGroup';\n\nexport type GraphTraversalOptions = {\n  /**\n   * A callback which is called for each node visited during traversal.\n   *\n   * If the callback returns `false`, traversal is stops recursing.\n   */\n  visitor: (node: Node, path: string[]) => boolean | void;\n\n  /**\n   * The node to start traversing from.\n   *\n   * @default ROOT_ID\n   */\n  source?: string;\n\n  /**\n   * The relation to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  relation?: Relation;\n};\n\nexport type GraphParams = {\n  registry?: Registry.Registry;\n  nodes?: MakeOptional<Node, 'data' | 'cacheable'>[];\n  edges?: Record<string, Edges>;\n  onExpand?: Graph['_onExpand'];\n  onInitialize?: Graph['_onInitialize'];\n  onRemoveNode?: Graph['_onRemoveNode'];\n};\n\nexport type Edge = { source: string; target: string };\nexport type Edges = { inbound: string[]; outbound: string[] };\n\nexport interface ReadableGraph {\n  /**\n   * Event emitted when a node is changed.\n   */\n  onNodeChanged: Event<{ id: string; node: Option.Option<Node> }>;\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON(id?: string): object;\n\n  json(id?: string): Rx.Rx<any>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  node(id: string): Rx.Rx<Option.Option<Node>>;\n\n  /**\n   * Get the rx key for the node with the given id.\n   */\n  nodeOrThrow(id: string): Rx.Rx<Node>;\n\n  /**\n   * Get the rx key for the connections of the node with the given id.\n   */\n  connections(id: string, relation?: Relation): Rx.Rx<Node[]>;\n\n  /**\n   * Get the rx key for the actions of the node with the given id.\n   */\n  actions(id: string): Rx.Rx<(Action | ActionGroup)[]>;\n\n  /**\n   * Get the rx key for the edges of the node with the given id.\n   */\n  edges(id: string): Rx.Rx<Edges>;\n\n  /**\n   * Alias for `getNodeOrThrow(ROOT_ID)`.\n   */\n  get root(): Node;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   */\n  getNode(id: string): Option.Option<Node>;\n\n  /**\n   * Get the node with the given id from the graph's registry.\n   *\n   * @throws If the node is Option.none().\n   */\n  getNodeOrThrow(id: string): Node;\n\n  /**\n   * Get all nodes connected to the node with the given id by the given relation from the graph's registry.\n   */\n  getConnections(id: string, relation?: Relation): Node[];\n\n  /**\n   * Get all actions connected to the node with the given id from the graph's registry.\n   */\n  getActions(id: string): Node[];\n\n  /**\n   * Get the edges from the node with the given id from the graph's registry.\n   */\n  getEdges(id: string): Edges;\n\n  /**\n   * Recursive depth-first traversal of the graph.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.relation The relation to traverse graph edges.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse(options: GraphTraversalOptions, path?: string[]): void;\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath(params: { source?: string; target: string }): Option.Option<string[]>;\n\n  /**\n   * Wait for the path between two nodes in the graph to be established.\n   */\n  waitForPath(\n    params: { source?: string; target: string },\n    options?: { timeout?: number; interval?: number },\n  ): Promise<string[]>;\n}\n\nexport interface ExpandableGraph extends ReadableGraph {\n  /**\n   * Initialize a node in the graph.\n   *\n   * Fires the `onInitialize` callback to provide initial data for a node.\n   */\n  initialize(id: string): Promise<void>;\n\n  /**\n   * Expand a node in the graph.\n   *\n   * Fires the `onExpand` callback to add connections to the node.\n   */\n  expand(id: string, relation?: Relation): void;\n\n  /**\n   * Sort the edges of the node with the given id.\n   */\n  sortEdges(id: string, relation: Relation, order: string[]): void;\n}\n\nexport interface WritableGraph extends ExpandableGraph {\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void;\n\n  /**\n   * Add a node to the graph.\n   */\n  addNode(node: NodeArg<any, Record<string, any>>): void;\n\n  /**\n   * Remove nodes from the graph.\n   */\n  removeNodes(ids: string[], edges?: boolean): void;\n\n  /**\n   * Remove a node from the graph.\n   */\n  removeNode(id: string, edges?: boolean): void;\n\n  /**\n   * Add edges to the graph.\n   */\n  addEdges(edges: Edge[]): void;\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge(edge: Edge): void;\n\n  /**\n   * Remove edges from the graph.\n   */\n  removeEdges(edges: Edge[], removeOrphans?: boolean): void;\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge(edge: Edge, removeOrphans?: boolean): void;\n}\n\n/**\n * The Graph represents the user interface information architecture of the application constructed via plugins.\n */\nexport class Graph implements WritableGraph {\n  readonly onNodeChanged = new Event<{ id: string; node: Option.Option<Node> }>();\n\n  private readonly _onExpand?: (id: string, relation: Relation) => void;\n  private readonly _onInitialize?: (id: string) => Promise<void>;\n  private readonly _onRemoveNode?: (id: string) => void;\n\n  private readonly _registry: Registry.Registry;\n  private readonly _expanded = Record.empty<string, boolean>();\n  private readonly _initialized = Record.empty<string, boolean>();\n  private readonly _initialEdges = Record.empty<string, Edges>();\n  private readonly _initialNodes = Record.fromEntries([\n    [ROOT_ID, this._constructNode({ id: ROOT_ID, type: ROOT_TYPE, data: null, properties: {} })],\n  ]);\n\n  /** @internal */\n  readonly _node = Rx.family<string, Rx.Writable<Option.Option<Node>>>((id) => {\n    const initial = Option.flatten(Record.get(this._initialNodes, id));\n    return Rx.make<Option.Option<Node>>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:node:${id}`));\n  });\n\n  private readonly _nodeOrThrow = Rx.family<string, Rx.Rx<Node>>((id) => {\n    return Rx.make((get) => {\n      const node = get(this._node(id));\n      invariant(Option.isSome(node), `Node not available: ${id}`);\n      return node.value;\n    });\n  });\n\n  private readonly _edges = Rx.family<string, Rx.Writable<Edges>>((id) => {\n    const initial = Record.get(this._initialEdges, id).pipe(Option.getOrElse(() => ({ inbound: [], outbound: [] })));\n    return Rx.make<Edges>(initial).pipe(Rx.keepAlive, Rx.withLabel(`graph:edges:${id}`));\n  });\n\n  // NOTE: Currently the argument to the family needs to be referentially stable for the rx to be referentially stable.\n  // TODO(wittjosiah): Rx feature request, support for something akin to `ComplexMap` to allow for complex arguments.\n  private readonly _connections = Rx.family<string, Rx.Rx<Node[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('$');\n      const edges = get(this._edges(id));\n      return edges[relation as Relation]\n        .map((id) => get(this._node(id)))\n        .filter(Option.isSome)\n        .map((o) => o.value);\n    }).pipe(Rx.withLabel(`graph:connections:${key}`));\n  });\n\n  private readonly _actions = Rx.family<string, Rx.Rx<(Action | ActionGroup)[]>>((id) => {\n    return Rx.make((get) => {\n      return get(this._connections(`${id}$outbound`)).filter(\n        (node) => node.type === ACTION_TYPE || node.type === ACTION_GROUP_TYPE,\n      );\n    }).pipe(Rx.withLabel(`graph:actions:${id}`));\n  });\n\n  private readonly _json = Rx.family<string, Rx.Rx<any>>((id) => {\n    return Rx.make((get) => {\n      const toJSON = (node: Node, seen: string[] = []): any => {\n        const nodes = get(this.connections(node.id));\n        const obj: Record<string, any> = {\n          id: node.id,\n          type: node.type,\n        };\n        if (node.properties.label) {\n          obj.label = node.properties.label;\n        }\n        if (nodes.length) {\n          obj.nodes = nodes\n            .map((n) => {\n              // Break cycles.\n              const nextSeen = [...seen, node.id];\n              return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n            })\n            .filter(isNonNullable);\n        }\n        return obj;\n      };\n\n      const root = get(this.nodeOrThrow(id));\n      return toJSON(root);\n    }).pipe(Rx.withLabel(`graph:json:${id}`));\n  });\n\n  constructor({ registry, nodes, edges, onInitialize, onExpand, onRemoveNode }: GraphParams = {}) {\n    this._registry = registry ?? Registry.make();\n    this._onInitialize = onInitialize;\n    this._onExpand = onExpand;\n    this._onRemoveNode = onRemoveNode;\n\n    if (nodes) {\n      nodes.forEach((node) => {\n        Record.set(this._initialNodes, node.id, this._constructNode(node));\n      });\n    }\n\n    if (edges) {\n      Object.entries(edges).forEach(([source, edges]) => {\n        Record.set(this._initialEdges, source, edges);\n      });\n    }\n  }\n\n  toJSON(id = ROOT_ID) {\n    return this._registry.get(this._json(id));\n  }\n\n  json(id = ROOT_ID) {\n    return this._json(id);\n  }\n\n  node(id: string): Rx.Rx<Option.Option<Node>> {\n    return this._node(id);\n  }\n\n  nodeOrThrow(id: string): Rx.Rx<Node> {\n    return this._nodeOrThrow(id);\n  }\n\n  connections(id: string, relation: Relation = 'outbound'): Rx.Rx<Node[]> {\n    return this._connections(`${id}$${relation}`);\n  }\n\n  actions(id: string) {\n    return this._actions(id);\n  }\n\n  edges(id: string): Rx.Rx<Edges> {\n    return this._edges(id);\n  }\n\n  get root() {\n    return this.getNodeOrThrow(ROOT_ID);\n  }\n\n  getNode(id: string): Option.Option<Node> {\n    return this._registry.get(this.node(id));\n  }\n\n  getNodeOrThrow(id: string): Node {\n    return this._registry.get(this.nodeOrThrow(id));\n  }\n\n  getConnections(id: string, relation: Relation = 'outbound'): Node[] {\n    return this._registry.get(this.connections(id, relation));\n  }\n\n  getActions(id: string): Node[] {\n    return this._registry.get(this.actions(id));\n  }\n\n  getEdges(id: string): Edges {\n    return this._registry.get(this.edges(id));\n  }\n\n  async initialize(id: string) {\n    const initialized = Record.get(this._initialized, id).pipe(Option.getOrElse(() => false));\n    log('initialize', { id, initialized });\n    if (!initialized) {\n      await this._onInitialize?.(id);\n      Record.set(this._initialized, id, true);\n    }\n  }\n\n  expand(id: string, relation: Relation = 'outbound'): void {\n    const key = `${id}$${relation}`;\n    const expanded = Record.get(this._expanded, key).pipe(Option.getOrElse(() => false));\n    log('expand', { key, expanded });\n    if (!expanded) {\n      this._onExpand?.(id, relation);\n      Record.set(this._expanded, key, true);\n    }\n  }\n\n  addNodes(nodes: NodeArg<any, Record<string, any>>[]): void {\n    Rx.batch(() => {\n      nodes.map((node) => this.addNode(node));\n    });\n  }\n\n  addNode({ nodes, edges, ...nodeArg }: NodeArg<any, Record<string, any>>): void {\n    const { id, type, data = null, properties = {} } = nodeArg;\n    const nodeRx = this._node(id);\n    const node = this._registry.get(nodeRx);\n    Option.match(node, {\n      onSome: (node) => {\n        const typeChanged = node.type !== type;\n        const dataChanged = node.data !== data;\n        const propertiesChanged = Object.keys(properties).some((key) => node.properties[key] !== properties[key]);\n        log('existing node', { id, typeChanged, dataChanged, propertiesChanged });\n        if (typeChanged || dataChanged || propertiesChanged) {\n          log('updating node', { id, type, data, properties });\n          const newNode = Option.some({ ...node, type, data, properties: { ...node.properties, ...properties } });\n          this._registry.set(nodeRx, newNode);\n          this.onNodeChanged.emit({ id, node: newNode });\n        }\n      },\n      onNone: () => {\n        log('new node', { id, type, data, properties });\n        const newNode = this._constructNode({ id, type, data, properties });\n        this._registry.set(nodeRx, newNode);\n        this.onNodeChanged.emit({ id, node: newNode });\n      },\n    });\n\n    if (nodes) {\n      // Rx.batch(() => {\n      this.addNodes(nodes);\n      const _edges = nodes.map((node) => ({ source: id, target: node.id }));\n      this.addEdges(_edges);\n      // });\n    }\n\n    if (edges) {\n      todo();\n    }\n  }\n\n  removeNodes(ids: string[], edges = false): void {\n    Rx.batch(() => {\n      ids.map((id) => this.removeNode(id, edges));\n    });\n  }\n\n  removeNode(id: string, edges = false): void {\n    const nodeRx = this._node(id);\n    // TODO(wittjosiah): Is there a way to mark these rx values for garbage collection?\n    this._registry.set(nodeRx, Option.none());\n    this.onNodeChanged.emit({ id, node: Option.none() });\n    // TODO(wittjosiah): Reset expanded and initialized flags?\n\n    if (edges) {\n      const { inbound, outbound } = this._registry.get(this._edges(id));\n      const edges = [\n        ...inbound.map((source) => ({ source, target: id })),\n        ...outbound.map((target) => ({ source: id, target })),\n      ];\n      this.removeEdges(edges);\n    }\n\n    this._onRemoveNode?.(id);\n  }\n\n  addEdges(edges: Edge[]): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.addEdge(edge));\n    });\n  }\n\n  addEdge(edgeArg: Edge): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (!source.outbound.includes(edgeArg.target)) {\n      log('add outbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(sourceRx, { inbound: source.inbound, outbound: [...source.outbound, edgeArg.target] });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (!target.inbound.includes(edgeArg.source)) {\n      log('add inbound edge', { source: edgeArg.source, target: edgeArg.target });\n      this._registry.set(targetRx, { inbound: [...target.inbound, edgeArg.source], outbound: target.outbound });\n    }\n  }\n\n  removeEdges(edges: Edge[], removeOrphans = false): void {\n    Rx.batch(() => {\n      edges.map((edge) => this.removeEdge(edge, removeOrphans));\n    });\n  }\n\n  removeEdge(edgeArg: Edge, removeOrphans = false): void {\n    const sourceRx = this._edges(edgeArg.source);\n    const source = this._registry.get(sourceRx);\n    if (source.outbound.includes(edgeArg.target)) {\n      this._registry.set(sourceRx, {\n        inbound: source.inbound,\n        outbound: source.outbound.filter((id) => id !== edgeArg.target),\n      });\n    }\n\n    const targetRx = this._edges(edgeArg.target);\n    const target = this._registry.get(targetRx);\n    if (target.inbound.includes(edgeArg.source)) {\n      this._registry.set(targetRx, {\n        inbound: target.inbound.filter((id) => id !== edgeArg.source),\n        outbound: target.outbound,\n      });\n    }\n\n    if (removeOrphans) {\n      const source = this._registry.get(sourceRx);\n      const target = this._registry.get(targetRx);\n      if (source.outbound.length === 0 && source.inbound.length === 0 && edgeArg.source !== ROOT_ID) {\n        this.removeNodes([edgeArg.source]);\n      }\n      if (target.outbound.length === 0 && target.inbound.length === 0 && edgeArg.target !== ROOT_ID) {\n        this.removeNodes([edgeArg.target]);\n      }\n    }\n  }\n\n  sortEdges(id: string, relation: Relation, order: string[]): void {\n    const edgesRx = this._edges(id);\n    const edges = this._registry.get(edgesRx);\n    const unsorted = edges[relation].filter((id) => !order.includes(id)) ?? [];\n    const sorted = order.filter((id) => edges[relation].includes(id)) ?? [];\n    edges[relation].splice(0, edges[relation].length, ...[...sorted, ...unsorted]);\n    this._registry.set(edgesRx, edges);\n  }\n\n  traverse({ visitor, source = ROOT_ID, relation = 'outbound' }: GraphTraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    const node = this.getNodeOrThrow(source);\n    const shouldContinue = visitor(node, [...path, source]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    Object.values(this.getConnections(source, relation)).forEach((child) =>\n      this.traverse({ source: child.id, relation, visitor }, [...path, source]),\n    );\n  }\n\n  getPath({ source = 'root', target }: { source?: string; target: string }): Option.Option<string[]> {\n    return Function.pipe(\n      this.getNode(source),\n      Option.flatMap((node) => {\n        let found: Option.Option<string[]> = Option.none();\n        this.traverse({\n          source: node.id,\n          visitor: (node, path) => {\n            if (Option.isSome(found)) {\n              return false;\n            }\n\n            if (node.id === target) {\n              found = Option.some(path);\n            }\n          },\n        });\n\n        return found;\n      }),\n    );\n  }\n\n  async waitForPath(\n    params: { source?: string; target: string },\n    { timeout = 5_000, interval = 500 }: { timeout?: number; interval?: number } = {},\n  ): Promise<string[]> {\n    const path = this.getPath(params);\n    if (Option.isSome(path)) {\n      return path.value;\n    }\n\n    const trigger = new Trigger<string[]>();\n    const i = setInterval(() => {\n      const path = this.getPath(params);\n      if (Option.isSome(path)) {\n        trigger.wake(path.value);\n      }\n    }, interval);\n\n    return trigger.wait({ timeout }).finally(() => clearInterval(i));\n  }\n\n  /** @internal */\n  _constructNode(node: NodeArg<any>): Option.Option<Node> {\n    return Option.some({ [graphSymbol]: this, data: null, properties: {}, ...node });\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Registry, Rx } from '@effect-rx/rx-react';\nimport { effect } from '@preact/signals-core';\nimport * as Array from 'effect/Array';\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\n\nimport { type CleanupFn, type MulticastObservable, type Trigger } from '@dxos/async';\nimport { log } from '@dxos/log';\nimport { type MaybePromise, type Position, byPosition, getDebugName, isNode, isNonNullable } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE, type ExpandableGraph, Graph, type GraphParams, ROOT_ID } from './graph';\nimport { type ActionData, type Node, type NodeArg, type Relation, actionGroupSymbol } from './node';\n\n/**\n * Graph builder extension for adding nodes to the graph based on a node id.\n */\nexport type ResolverExtension = (id: string) => Rx.Rx<NodeArg<any> | null>;\n\n/**\n * Graph builder extension for adding nodes to the graph based on a connection to an existing node.\n *\n * @param params.node The existing node the returned nodes will be connected to.\n */\nexport type ConnectorExtension = (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding actions to the graph.\n */\nexport type ActionsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<ActionData>, 'type' | 'nodes' | 'edges'>[]>;\n\n/**\n * Constrained case of the connector extension for more easily adding action groups to the graph.\n */\nexport type ActionGroupsExtension = (\n  node: Rx.Rx<Option.Option<Node>>,\n) => Rx.Rx<Omit<NodeArg<typeof actionGroupSymbol>, 'type' | 'data' | 'nodes' | 'edges'>[]>;\n\n/**\n * A graph builder extension is used to add nodes to the graph.\n *\n * @param params.id The unique id of the extension.\n * @param params.relation The relation the graph is being expanded from the existing node.\n * @param params.position Affects the order the extensions are processed in.\n * @param params.resolver A function to add nodes to the graph based on just the node id.\n * @param params.connector A function to add nodes to the graph based on a connection to an existing node.\n * @param params.actions A function to add actions to the graph based on a connection to an existing node.\n * @param params.actionGroups A function to add action groups to the graph based on a connection to an existing node.\n */\nexport type CreateExtensionOptions = {\n  id: string;\n  relation?: Relation;\n  position?: Position;\n  resolver?: ResolverExtension;\n  connector?: ConnectorExtension;\n  actions?: ActionsExtension;\n  actionGroups?: ActionGroupsExtension;\n};\n\n/**\n * Create a graph builder extension.\n */\nexport const createExtension = (extension: CreateExtensionOptions): BuilderExtension[] => {\n  const {\n    id,\n    position = 'static',\n    relation = 'outbound',\n    resolver: _resolver,\n    connector: _connector,\n    actions: _actions,\n    actionGroups: _actionGroups,\n  } = extension;\n  const getId = (key: string) => `${id}/${key}`;\n\n  const resolver =\n    _resolver && Rx.family((id: string) => _resolver(id).pipe(Rx.withLabel(`graph-builder:_resolver:${id}`)));\n\n  const connector =\n    _connector &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _connector(node).pipe(Rx.withLabel(`graph-builder:_connector:${id}`)),\n    );\n\n  const actionGroups =\n    _actionGroups &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) =>\n      _actionGroups(node).pipe(Rx.withLabel(`graph-builder:_actionGroups:${id}`)),\n    );\n\n  const actions =\n    _actions &&\n    Rx.family((node: Rx.Rx<Option.Option<Node>>) => _actions(node).pipe(Rx.withLabel(`graph-builder:_actions:${id}`)));\n\n  return [\n    resolver ? { id: getId('resolver'), position, resolver } : undefined,\n    connector\n      ? ({\n          id: getId('connector'),\n          position,\n          relation,\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(connector(node));\n              } catch {\n                log.warn('Error in connector', { id: getId('connector'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actionGroups\n      ? ({\n          id: getId('actionGroups'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actionGroups(node)).map((arg) => ({\n                  ...arg,\n                  data: actionGroupSymbol,\n                  type: ACTION_GROUP_TYPE,\n                }));\n              } catch {\n                log.warn('Error in actionGroups', { id: getId('actionGroups'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actionGroups:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n    actions\n      ? ({\n          id: getId('actions'),\n          position,\n          relation: 'outbound',\n          connector: Rx.family((node) =>\n            Rx.make((get) => {\n              try {\n                return get(actions(node)).map((arg) => ({ ...arg, type: ACTION_TYPE }));\n              } catch {\n                log.warn('Error in actions', { id: getId('actions'), node });\n                return [];\n              }\n            }).pipe(Rx.withLabel(`graph-builder:connector:actions:${id}`)),\n          ),\n        } satisfies BuilderExtension)\n      : undefined,\n  ].filter(isNonNullable);\n};\n\nexport type GraphBuilderTraverseOptions = {\n  visitor: (node: Node, path: string[]) => MaybePromise<boolean | void>;\n  registry?: Registry.Registry;\n  source?: string;\n  relation?: Relation;\n};\n\nexport type BuilderExtension = Readonly<{\n  id: string;\n  position: Position;\n  relation?: Relation; // Only for connector.\n  resolver?: ResolverExtension;\n  connector?: (node: Rx.Rx<Option.Option<Node>>) => Rx.Rx<NodeArg<any>[]>;\n}>;\n\nexport type BuilderExtensions = BuilderExtension | BuilderExtension[] | BuilderExtensions[];\n\nexport const flattenExtensions = (extension: BuilderExtensions, acc: BuilderExtension[] = []): BuilderExtension[] => {\n  if (Array.isArray(extension)) {\n    return [...acc, ...extension.flatMap((ext) => flattenExtensions(ext, acc))];\n  } else {\n    return [...acc, extension];\n  }\n};\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\n// TODO(wittjosiah): Add api for setting subscription set and/or radius.\n//   Should unsubscribe from nodes that are not in the set/radius.\n//   Should track LRU nodes that are not in the set/radius and remove them beyond a certain threshold.\nexport class GraphBuilder {\n  // TODO(wittjosiah): Use Context.\n  private readonly _subscriptions = new Map<string, CleanupFn>();\n  private readonly _extensions = Rx.make(Record.empty<string, BuilderExtension>()).pipe(\n    Rx.keepAlive,\n    Rx.withLabel('graph-builder:extensions'),\n  );\n  private readonly _initialized: Record<string, Trigger> = {};\n  private readonly _registry: Registry.Registry;\n  private readonly _graph: Graph;\n\n  constructor({ registry, ...params }: Pick<GraphParams, 'registry' | 'nodes' | 'edges'> = {}) {\n    this._registry = registry ?? Registry.make();\n    this._graph = new Graph({\n      ...params,\n      registry: this._registry,\n      onExpand: (id, relation) => this._onExpand(id, relation),\n      onInitialize: (id) => this._onInitialize(id),\n      onRemoveNode: (id) => this._onRemoveNode(id),\n    });\n  }\n\n  static from(pickle?: string, registry?: Registry.Registry): GraphBuilder {\n    if (!pickle) {\n      return new GraphBuilder({ registry });\n    }\n\n    const { nodes, edges } = JSON.parse(pickle);\n    return new GraphBuilder({ nodes, edges, registry });\n  }\n\n  get graph(): ExpandableGraph {\n    return this._graph;\n  }\n\n  get extensions() {\n    return this._extensions;\n  }\n\n  addExtension(extensions: BuilderExtensions): GraphBuilder {\n    flattenExtensions(extensions).forEach((extension) => {\n      const extensions = this._registry.get(this._extensions);\n      this._registry.set(this._extensions, Record.set(extensions, extension.id, extension));\n    });\n    return this;\n  }\n\n  removeExtension(id: string): GraphBuilder {\n    const extensions = this._registry.get(this._extensions);\n    this._registry.set(this._extensions, Record.remove(extensions, id));\n    return this;\n  }\n\n  async explore(\n    // TODO(wittjosiah): Currently defaulting to new registry.\n    //   Currently unsure about how to handle nodes which are expanded in the background.\n    //   This seems like a good place to start.\n    { registry = Registry.make(), source = ROOT_ID, relation = 'outbound', visitor }: GraphBuilderTraverseOptions,\n    path: string[] = [],\n  ): Promise<void> {\n    // Break cycles.\n    if (path.includes(source)) {\n      return;\n    }\n\n    // TODO(wittjosiah): This is a workaround for esm not working in the test runner.\n    //   Switching to vitest is blocked by having node esm versions of echo-schema & echo-signals.\n    if (!isNode()) {\n      const { yieldOrContinue } = await import('main-thread-scheduling');\n      await yieldOrContinue('idle');\n    }\n\n    const node = registry.get(this._graph.nodeOrThrow(source));\n    const shouldContinue = await visitor(node, [...path, node.id]);\n    if (shouldContinue === false) {\n      return;\n    }\n\n    const nodes = Object.values(this._registry.get(this._extensions))\n      .filter((extension) => relation === (extension.relation ?? 'outbound'))\n      .map((extension) => extension.connector)\n      .filter(isNonNullable)\n      .flatMap((connector) => registry.get(connector(this._graph.node(source))));\n\n    await Promise.all(\n      nodes.map((nodeArg) => {\n        registry.set(this._graph._node(nodeArg.id), this._graph._constructNode(nodeArg));\n        return this.explore({ registry, source: nodeArg.id, relation, visitor }, [...path, node.id]);\n      }),\n    );\n\n    if (registry !== this._registry) {\n      registry.reset();\n      registry.dispose();\n    }\n  }\n\n  destroy(): void {\n    this._subscriptions.forEach((unsubscribe) => unsubscribe());\n    this._subscriptions.clear();\n  }\n\n  private readonly _resolvers = Rx.family<string, Rx.Rx<Option.Option<NodeArg<any>>>>((id) => {\n    return Rx.make((get) => {\n      return Function.pipe(\n        get(this._extensions),\n        Record.values,\n        Array.sortBy(byPosition),\n        Array.map(({ resolver }) => resolver),\n        Array.filter(isNonNullable),\n        Array.map((resolver) => get(resolver(id))),\n        Array.filter(isNonNullable),\n        Array.head,\n      );\n    });\n  });\n\n  private readonly _connectors = Rx.family<string, Rx.Rx<NodeArg<any>[]>>((key) => {\n    return Rx.make((get) => {\n      const [id, relation] = key.split('+');\n      const node = this._graph.node(id);\n\n      return Function.pipe(\n        get(this._extensions),\n        Record.values,\n        // TODO(wittjosiah): Sort on write rather than read.\n        Array.sortBy(byPosition),\n        Array.filter(({ relation: _relation = 'outbound' }) => _relation === relation),\n        Array.map(({ connector }) => connector?.(node)),\n        Array.filter(isNonNullable),\n        Array.flatMap((result) => get(result)),\n      );\n    }).pipe(Rx.withLabel(`graph-builder:connectors:${key}`));\n  });\n\n  private _onExpand(id: string, relation: Relation): void {\n    log('onExpand', { id, relation, registry: getDebugName(this._registry) });\n    const connectors = this._connectors(`${id}+${relation}`);\n\n    let previous: string[] = [];\n    const cancel = this._registry.subscribe(\n      connectors,\n      (nodes) => {\n        const ids = nodes.map((n) => n.id);\n        const removed = previous.filter((id) => !ids.includes(id));\n        previous = ids;\n\n        log('update', { id, relation, ids, removed });\n        const update = () => {\n          Rx.batch(() => {\n            this._graph.removeEdges(\n              removed.map((target) => ({ source: id, target })),\n              true,\n            );\n            this._graph.addNodes(nodes);\n            this._graph.addEdges(\n              nodes.map((node) =>\n                relation === 'outbound' ? { source: id, target: node.id } : { source: node.id, target: id },\n              ),\n            );\n            this._graph.sortEdges(\n              id,\n              relation,\n              nodes.map(({ id }) => id),\n            );\n          });\n        };\n\n        // TODO(wittjosiah): Remove `requestAnimationFrame` once we have a better solution.\n        //  This is a workaround to avoid a race condition where the graph is updated during React render.\n        if (typeof requestAnimationFrame === 'function') {\n          requestAnimationFrame(update);\n        } else {\n          update();\n        }\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  // TODO(wittjosiah): If the same node is added by a connector, the resolver should probably cancel itself?\n  private async _onInitialize(id: string) {\n    log('onInitialize', { id });\n    const resolver = this._resolvers(id);\n\n    const cancel = this._registry.subscribe(\n      resolver,\n      (node) => {\n        const trigger = this._initialized[id];\n        Option.match(node, {\n          onSome: (node) => {\n            this._graph.addNodes([node]);\n            trigger?.wake();\n          },\n          onNone: () => {\n            trigger?.wake();\n            this._graph.removeNodes([id]);\n          },\n        });\n      },\n      { immediate: true },\n    );\n\n    this._subscriptions.set(id, cancel);\n  }\n\n  private _onRemoveNode(id: string): void {\n    this._subscriptions.get(id)?.();\n    this._subscriptions.delete(id);\n  }\n}\n\n/**\n * Creates an Rx.Rx<T> from a callback which accesses signals.\n * Will return a new rx instance each time.\n */\nexport const rxFromSignal = <T>(cb: () => T): Rx.Rx<T> => {\n  return Rx.make((get) => {\n    const dispose = effect(() => {\n      get.setSelf(cb());\n    });\n\n    get.addFinalizer(() => dispose());\n\n    return cb();\n  });\n};\n\nconst observableFamily = Rx.family((observable: MulticastObservable<any>) => {\n  return Rx.make((get) => {\n    const subscription = observable.subscribe((value) => get.setSelf(value));\n\n    get.addFinalizer(() => subscription.unsubscribe());\n\n    return observable.get();\n  });\n});\n\n/**\n * Creates an Rx.Rx<T> from a MulticastObservable<T>\n * Will return the same rx instance for the same observable.\n */\nexport const rxFromObservable = <T>(observable: MulticastObservable<T>): Rx.Rx<T> => {\n  return observableFamily(observable) as Rx.Rx<T>;\n};\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MakeOptional, type MaybePromise } from '@dxos/util';\n\nimport { ACTION_GROUP_TYPE, ACTION_TYPE } from './graph';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\n// TODO(burdon): Rename GraphNode. Node is already in the global namespace.\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<{\n  /**\n   * Globally unique ID.\n   */\n  // TODO(burdon): Allow string array, which is concatenated.\n  id: string;\n\n  /**\n   * Typename of the data the node represents.\n   */\n  type: string;\n\n  /**\n   * Keys in of the properties which should be cached.\n   * If defined, the node will be included in the cache.\n   * If undefined, the node will not be included in the cache.\n   */\n  cacheable?: string[];\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: Readonly<TProperties>;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n}>;\n\nexport type NodeFilter<TData = any, TProperties extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<TData, TProperties>;\n\nexport type Relation = 'outbound' | 'inbound';\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  Node<TData, TProperties>,\n  'data' | 'properties' | 'cacheable'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, Relation][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  parent?: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params?: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' && data.type === ACTION_TYPE : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<Node<typeof actionGroupSymbol, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  }\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol && data.type === ACTION_GROUP_TYPE : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n"],
+  "mappings": ";AAIA,SAASA,UAAUC,UAAU;AAC7B,YAAYC,cAAc;AAC1B,YAAYC,YAAY;AACxB,YAAYC,YAAY;AAExB,SAASC,OAAOC,eAAe;AAC/B,SAASC,YAAY;AACrB,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAA4BC,qBAAqB;;;;;;;;;;;;;;;AAIjD,IAAMC,cAAcC,OAAO,OAAA;AAOpB,IAAMC,WAAW,CAACC,SAAAA;AACvB,QAAMC,QAASD,KAAsBH,WAAAA;AACrCH,YAAUO,OAAO,wCAAA;;;;;;;;;AACjB,SAAOA;AACT;AAEO,IAAMC,UAAU;AAChB,IAAMC,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,oBAAoB;AAoM1B,IAAMC,QAAN,MAAMA;EAsGXC,OAAOC,KAAKN,SAAS;AACnB,WAAO,KAAKO,UAAUC,IAAI,KAAKC,MAAMH,EAAAA,CAAAA;EACvC;EAEAI,KAAKJ,KAAKN,SAAS;AACjB,WAAO,KAAKS,MAAMH,EAAAA;EACpB;EAEAR,KAAKQ,IAAwC;AAC3C,WAAO,KAAKK,MAAML,EAAAA;EACpB;EAEAM,YAAYN,IAAyB;AACnC,WAAO,KAAKO,aAAaP,EAAAA;EAC3B;EAEAQ,YAAYR,IAAYS,WAAqB,YAA2B;AACtE,WAAO,KAAKC,aAAa,GAAGV,EAAAA,IAAMS,QAAAA,EAAU;EAC9C;EAEAE,QAAQX,IAAY;AAClB,WAAO,KAAKY,SAASZ,EAAAA;EACvB;EAEAa,MAAMb,IAA0B;AAC9B,WAAO,KAAKc,OAAOd,EAAAA;EACrB;EAEA,IAAIe,OAAO;AACT,WAAO,KAAKC,eAAetB,OAAAA;EAC7B;EAEAuB,QAAQjB,IAAiC;AACvC,WAAO,KAAKC,UAAUC,IAAI,KAAKV,KAAKQ,EAAAA,CAAAA;EACtC;EAEAgB,eAAehB,IAAkB;AAC/B,WAAO,KAAKC,UAAUC,IAAI,KAAKI,YAAYN,EAAAA,CAAAA;EAC7C;EAEAkB,eAAelB,IAAYS,WAAqB,YAAoB;AAClE,WAAO,KAAKR,UAAUC,IAAI,KAAKM,YAAYR,IAAIS,QAAAA,CAAAA;EACjD;EAEAU,WAAWnB,IAAoB;AAC7B,WAAO,KAAKC,UAAUC,IAAI,KAAKS,QAAQX,EAAAA,CAAAA;EACzC;EAEAoB,SAASpB,IAAmB;AAC1B,WAAO,KAAKC,UAAUC,IAAI,KAAKW,MAAMb,EAAAA,CAAAA;EACvC;EAEA,MAAMqB,WAAWrB,IAAY;AAC3B,UAAMsB,cAAqBpB,WAAI,KAAKqB,cAAcvB,EAAAA,EAAIwB,KAAYC,iBAAU,MAAM,KAAA,CAAA;AAClFtC,QAAI,cAAc;MAAEa;MAAIsB;IAAY,GAAA;;;;;;AACpC,QAAI,CAACA,aAAa;AAChB,YAAM,KAAKI,gBAAgB1B,EAAAA;AAC3BlB,MAAO6C,WAAI,KAAKJ,cAAcvB,IAAI,IAAA;IACpC;EACF;EAEA4B,OAAO5B,IAAYS,WAAqB,YAAkB;AACxD,UAAMoB,MAAM,GAAG7B,EAAAA,IAAMS,QAAAA;AACrB,UAAMqB,WAAkB5B,WAAI,KAAK6B,WAAWF,GAAAA,EAAKL,KAAYC,iBAAU,MAAM,KAAA,CAAA;AAC7EtC,QAAI,UAAU;MAAE0C;MAAKC;IAAS,GAAA;;;;;;AAC9B,QAAI,CAACA,UAAU;AACb,WAAKE,YAAYhC,IAAIS,QAAAA;AACrB3B,MAAO6C,WAAI,KAAKI,WAAWF,KAAK,IAAA;IAClC;EACF;EAEAI,SAASC,OAAkD;AACzDvD,OAAGwD,MAAM,MAAA;AACPD,YAAME,IAAI,CAAC5C,SAAS,KAAK6C,QAAQ7C,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEA6C,QAAQ,EAAEH,OAAOrB,OAAO,GAAGyB,QAAAA,GAAoD;AAC7E,UAAM,EAAEtC,IAAIuC,MAAMC,OAAO,MAAMC,aAAa,CAAC,EAAC,IAAKH;AACnD,UAAMI,SAAS,KAAKrC,MAAML,EAAAA;AAC1B,UAAMR,OAAO,KAAKS,UAAUC,IAAIwC,MAAAA;AAChC7D,IAAO8D,aAAMnD,MAAM;MACjBoD,QAAQ,CAACpD,UAAAA;AACP,cAAMqD,cAAcrD,MAAK+C,SAASA;AAClC,cAAMO,cAActD,MAAKgD,SAASA;AAClC,cAAMO,oBAAoBC,OAAOC,KAAKR,UAAAA,EAAYS,KAAK,CAACrB,QAAQrC,MAAKiD,WAAWZ,GAAAA,MAASY,WAAWZ,GAAAA,CAAI;AACxG1C,YAAI,iBAAiB;UAAEa;UAAI6C;UAAaC;UAAaC;QAAkB,GAAA;;;;;;AACvE,YAAIF,eAAeC,eAAeC,mBAAmB;AACnD5D,cAAI,iBAAiB;YAAEa;YAAIuC;YAAMC;YAAMC;UAAW,GAAA;;;;;;AAClD,gBAAMU,UAAiBD,YAAK;YAAE,GAAG1D;YAAM+C;YAAMC;YAAMC,YAAY;cAAE,GAAGjD,MAAKiD;cAAY,GAAGA;YAAW;UAAE,CAAA;AACrG,eAAKxC,UAAU0B,IAAIe,QAAQS,OAAAA;AAC3B,eAAKC,cAAcC,KAAK;YAAErD;YAAIR,MAAM2D;UAAQ,CAAA;QAC9C;MACF;MACAG,QAAQ,MAAA;AACNnE,YAAI,YAAY;UAAEa;UAAIuC;UAAMC;UAAMC;QAAW,GAAA;;;;;;AAC7C,cAAMU,UAAU,KAAKI,eAAe;UAAEvD;UAAIuC;UAAMC;UAAMC;QAAW,CAAA;AACjE,aAAKxC,UAAU0B,IAAIe,QAAQS,OAAAA;AAC3B,aAAKC,cAAcC,KAAK;UAAErD;UAAIR,MAAM2D;QAAQ,CAAA;MAC9C;IACF,CAAA;AAEA,QAAIjB,OAAO;AAET,WAAKD,SAASC,KAAAA;AACd,YAAMpB,SAASoB,MAAME,IAAI,CAAC5C,WAAU;QAAEgE,QAAQxD;QAAIyD,QAAQjE,MAAKQ;MAAG,EAAA;AAClE,WAAK0D,SAAS5C,MAAAA;IAEhB;AAEA,QAAID,OAAO;AACT5B,WAAAA;IACF;EACF;EAEA0E,YAAYC,KAAe/C,QAAQ,OAAa;AAC9ClC,OAAGwD,MAAM,MAAA;AACPyB,UAAIxB,IAAI,CAACpC,OAAO,KAAK6D,WAAW7D,IAAIa,KAAAA,CAAAA;IACtC,CAAA;EACF;EAEAgD,WAAW7D,IAAYa,QAAQ,OAAa;AAC1C,UAAM6B,SAAS,KAAKrC,MAAML,EAAAA;AAE1B,SAAKC,UAAU0B,IAAIe,QAAeoB,YAAI,CAAA;AACtC,SAAKV,cAAcC,KAAK;MAAErD;MAAIR,MAAasE,YAAI;IAAG,CAAA;AAGlD,QAAIjD,OAAO;AACT,YAAM,EAAEkD,SAASC,SAAQ,IAAK,KAAK/D,UAAUC,IAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC7D,YAAMa,SAAQ;WACTkD,QAAQ3B,IAAI,CAACoB,YAAY;UAAEA;UAAQC,QAAQzD;QAAG,EAAA;WAC9CgE,SAAS5B,IAAI,CAACqB,YAAY;UAAED,QAAQxD;UAAIyD;QAAO,EAAA;;AAEpD,WAAKQ,YAAYpD,MAAAA;IACnB;AAEA,SAAKqD,gBAAgBlE,EAAAA;EACvB;EAEA0D,SAAS7C,OAAqB;AAC5BlC,OAAGwD,MAAM,MAAA;AACPtB,YAAMuB,IAAI,CAAC+B,SAAS,KAAKC,QAAQD,IAAAA,CAAAA;IACnC,CAAA;EACF;EAEAC,QAAQC,SAAqB;AAC3B,UAAMC,WAAW,KAAKxD,OAAOuD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIoE,QAAAA;AAClC,QAAI,CAACd,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC7CtE,UAAI,qBAAqB;QAAEqE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AAC1E,WAAKxD,UAAU0B,IAAI2C,UAAU;QAAEP,SAASP,OAAOO;QAASC,UAAU;aAAIR,OAAOQ;UAAUK,QAAQZ;;MAAQ,CAAA;IACzG;AAEA,UAAMe,WAAW,KAAK1D,OAAOuD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKxD,UAAUC,IAAIsE,QAAAA;AAClC,QAAI,CAACf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC5CrE,UAAI,oBAAoB;QAAEqE,QAAQa,QAAQb;QAAQC,QAAQY,QAAQZ;MAAO,GAAA;;;;;;AACzE,WAAKxD,UAAU0B,IAAI6C,UAAU;QAAET,SAAS;aAAIN,OAAOM;UAASM,QAAQb;;QAASQ,UAAUP,OAAOO;MAAS,CAAA;IACzG;EACF;EAEAC,YAAYpD,OAAe4D,gBAAgB,OAAa;AACtD9F,OAAGwD,MAAM,MAAA;AACPtB,YAAMuB,IAAI,CAAC+B,SAAS,KAAKO,WAAWP,MAAMM,aAAAA,CAAAA;IAC5C,CAAA;EACF;EAEAC,WAAWL,SAAeI,gBAAgB,OAAa;AACrD,UAAMH,WAAW,KAAKxD,OAAOuD,QAAQb,MAAM;AAC3C,UAAMA,SAAS,KAAKvD,UAAUC,IAAIoE,QAAAA;AAClC,QAAId,OAAOQ,SAASO,SAASF,QAAQZ,MAAM,GAAG;AAC5C,WAAKxD,UAAU0B,IAAI2C,UAAU;QAC3BP,SAASP,OAAOO;QAChBC,UAAUR,OAAOQ,SAASW,OAAO,CAAC3E,OAAOA,OAAOqE,QAAQZ,MAAM;MAChE,CAAA;IACF;AAEA,UAAMe,WAAW,KAAK1D,OAAOuD,QAAQZ,MAAM;AAC3C,UAAMA,SAAS,KAAKxD,UAAUC,IAAIsE,QAAAA;AAClC,QAAIf,OAAOM,QAAQQ,SAASF,QAAQb,MAAM,GAAG;AAC3C,WAAKvD,UAAU0B,IAAI6C,UAAU;QAC3BT,SAASN,OAAOM,QAAQY,OAAO,CAAC3E,OAAOA,OAAOqE,QAAQb,MAAM;QAC5DQ,UAAUP,OAAOO;MACnB,CAAA;IACF;AAEA,QAAIS,eAAe;AACjB,YAAMjB,UAAS,KAAKvD,UAAUC,IAAIoE,QAAAA;AAClC,YAAMb,UAAS,KAAKxD,UAAUC,IAAIsE,QAAAA;AAClC,UAAIhB,QAAOQ,SAASY,WAAW,KAAKpB,QAAOO,QAAQa,WAAW,KAAKP,QAAQb,WAAW9D,SAAS;AAC7F,aAAKiE,YAAY;UAACU,QAAQb;SAAO;MACnC;AACA,UAAIC,QAAOO,SAASY,WAAW,KAAKnB,QAAOM,QAAQa,WAAW,KAAKP,QAAQZ,WAAW/D,SAAS;AAC7F,aAAKiE,YAAY;UAACU,QAAQZ;SAAO;MACnC;IACF;EACF;EAEAoB,UAAU7E,IAAYS,UAAoBqE,OAAuB;AAC/D,UAAMC,UAAU,KAAKjE,OAAOd,EAAAA;AAC5B,UAAMa,QAAQ,KAAKZ,UAAUC,IAAI6E,OAAAA;AACjC,UAAMC,WAAWnE,MAAMJ,QAAAA,EAAUkE,OAAO,CAAC3E,QAAO,CAAC8E,MAAMP,SAASvE,GAAAA,CAAAA,KAAQ,CAAA;AACxE,UAAMiF,SAASH,MAAMH,OAAO,CAAC3E,QAAOa,MAAMJ,QAAAA,EAAU8D,SAASvE,GAAAA,CAAAA,KAAQ,CAAA;AACrEa,UAAMJ,QAAAA,EAAUyE,OAAO,GAAGrE,MAAMJ,QAAAA,EAAUmE,QAAM,GAAK;SAAIK;SAAWD;KAAS;AAC7E,SAAK/E,UAAU0B,IAAIoD,SAASlE,KAAAA;EAC9B;EAEAsE,SAAS,EAAEC,SAAS5B,SAAS9D,SAASe,WAAW,WAAU,GAA2B4E,OAAiB,CAAA,GAAU;AAE/G,QAAIA,KAAKd,SAASf,MAAAA,GAAS;AACzB;IACF;AAEA,UAAMhE,OAAO,KAAKwB,eAAewC,MAAAA;AACjC,UAAM8B,iBAAiBF,QAAQ5F,MAAM;SAAI6F;MAAM7B;KAAO;AACtD,QAAI8B,mBAAmB,OAAO;AAC5B;IACF;AAEAtC,WAAOuC,OAAO,KAAKrE,eAAesC,QAAQ/C,QAAAA,CAAAA,EAAW+E,QAAQ,CAACC,UAC5D,KAAKN,SAAS;MAAE3B,QAAQiC,MAAMzF;MAAIS;MAAU2E;IAAQ,GAAG;SAAIC;MAAM7B;KAAO,CAAA;EAE5E;EAEAkC,QAAQ,EAAElC,SAAS,QAAQC,OAAM,GAAkE;AACjG,WAAgBjC,cACd,KAAKP,QAAQuC,MAAAA,GACNmC,eAAQ,CAACnG,SAAAA;AACd,UAAIoG,QAAwC9B,YAAI;AAChD,WAAKqB,SAAS;QACZ3B,QAAQhE,KAAKQ;QACboF,SAAS,CAAC5F,OAAM6F,SAAAA;AACd,cAAWQ,cAAOD,KAAAA,GAAQ;AACxB,mBAAO;UACT;AAEA,cAAIpG,MAAKQ,OAAOyD,QAAQ;AACtBmC,oBAAe1C,YAAKmC,IAAAA;UACtB;QACF;MACF,CAAA;AAEA,aAAOO;IACT,CAAA,CAAA;EAEJ;EAEA,MAAME,YACJC,QACA,EAAEC,UAAU,KAAOC,WAAW,IAAG,IAA8C,CAAC,GAC7D;AACnB,UAAMZ,OAAO,KAAKK,QAAQK,MAAAA;AAC1B,QAAWF,cAAOR,IAAAA,GAAO;AACvB,aAAOA,KAAKa;IACd;AAEA,UAAMC,UAAU,IAAInH,QAAAA;AACpB,UAAMoH,IAAIC,YAAY,MAAA;AACpB,YAAMhB,QAAO,KAAKK,QAAQK,MAAAA;AAC1B,UAAWF,cAAOR,KAAAA,GAAO;AACvBc,gBAAQG,KAAKjB,MAAKa,KAAK;MACzB;IACF,GAAGD,QAAAA;AAEH,WAAOE,QAAQI,KAAK;MAAEP;IAAQ,CAAA,EAAGQ,QAAQ,MAAMC,cAAcL,CAAAA,CAAAA;EAC/D;;EAGA7C,eAAe/D,MAAyC;AACtD,WAAc0D,YAAK;MAAE,CAAC7D,WAAAA,GAAc;MAAMmD,MAAM;MAAMC,YAAY,CAAC;MAAG,GAAGjD;IAAK,CAAA;EAChF;EAlSA,YAAY,EAAEkH,UAAUxE,OAAOrB,OAAO8F,cAAcC,UAAUC,aAAY,IAAkB,CAAC,GAAG;AAlFhG,qBAAA,MAASzD,iBAAgB,IAAIrE,MAAAA,CAAAA;AAE7B,qBAAA,MAAiBiD,aAAjB,MAAA;AACA,qBAAA,MAAiBN,iBAAjB,MAAA;AACA,qBAAA,MAAiBwC,iBAAjB,MAAA;AAEA,qBAAA,MAAiBjE,aAAjB,MAAA;AACA,qBAAA,MAAiB8B,aAAmB+E,aAAK,CAAA;AACzC,qBAAA,MAAiBvF,gBAAsBuF,aAAK,CAAA;AAC5C,qBAAA,MAAiBC,iBAAuBD,aAAK,CAAA;AAC7C,qBAAA,MAAiBE,iBAAuBC,mBAAY;MAClD;QAACvH;QAAS,KAAK6D,eAAe;UAAEvD,IAAIN;UAAS6C,MAAM5C;UAAW6C,MAAM;UAAMC,YAAY,CAAC;QAAE,CAAA;;KAC1F,CAAA;AAGD,qBAAA,MAASpC,SAAQ1B,GAAGuI,OAAiD,CAAClH,OAAAA;AACpE,YAAMmH,UAAiBC,eAAelH,WAAI,KAAK8G,eAAehH,EAAAA,CAAAA;AAC9D,aAAOrB,GAAG0I,KAA0BF,OAAAA,EAAS3F,KAAK7C,GAAG2I,WAAW3I,GAAG4I,UAAU,cAAcvH,EAAAA,EAAI,CAAA;IACjG,CAAA,CAAA;AAEA,qBAAA,MAAiBO,gBAAe5B,GAAGuI,OAA4B,CAAClH,OAAAA;AAC9D,aAAOrB,GAAG0I,KAAK,CAACnH,SAAAA;AACd,cAAMV,OAAOU,KAAI,KAAKG,MAAML,EAAAA,CAAAA;AAC5Bd,kBAAiB2G,cAAOrG,IAAAA,GAAO,uBAAuBQ,EAAAA,IAAI;;;;;;;;;AAC1D,eAAOR,KAAK0G;MACd,CAAA;IACF,CAAA,CAAA;AAEA,qBAAA,MAAiBpF,UAASnC,GAAGuI,OAAmC,CAAClH,OAAAA;AAC/D,YAAMmH,UAAiBjH,WAAI,KAAK6G,eAAe/G,EAAAA,EAAIwB,KAAYC,iBAAU,OAAO;QAAEsC,SAAS,CAAA;QAAIC,UAAU,CAAA;MAAG,EAAA,CAAA;AAC5G,aAAOrF,GAAG0I,KAAYF,OAAAA,EAAS3F,KAAK7C,GAAG2I,WAAW3I,GAAG4I,UAAU,eAAevH,EAAAA,EAAI,CAAA;IACpF,CAAA,CAAA;AAIA,qBAAA,MAAiBU,gBAAe/B,GAAGuI,OAA8B,CAACrF,QAAAA;AAChE,aAAOlD,GAAG0I,KAAK,CAACnH,SAAAA;AACd,cAAM,CAACF,IAAIS,QAAAA,IAAYoB,IAAI2F,MAAM,GAAA;AACjC,cAAM3G,SAAQX,KAAI,KAAKY,OAAOd,EAAAA,CAAAA;AAC9B,eAAOa,OAAMJ,QAAAA,EACV2B,IAAI,CAACpC,QAAOE,KAAI,KAAKG,MAAML,GAAAA,CAAAA,CAAAA,EAC3B2E,OAAckB,aAAM,EACpBzD,IAAI,CAACqF,MAAMA,EAAEvB,KAAK;MACvB,CAAA,EAAG1E,KAAK7C,GAAG4I,UAAU,qBAAqB1F,GAAAA,EAAK,CAAA;IACjD,CAAA,CAAA;AAEA,qBAAA,MAAiBjB,YAAWjC,GAAGuI,OAAgD,CAAClH,OAAAA;AAC9E,aAAOrB,GAAG0I,KAAK,CAACnH,SAAAA;AACd,eAAOA,KAAI,KAAKQ,aAAa,GAAGV,EAAAA,WAAa,CAAA,EAAG2E,OAC9C,CAACnF,SAASA,KAAK+C,SAAS3C,eAAeJ,KAAK+C,SAAS1C,iBAAAA;MAEzD,CAAA,EAAG2B,KAAK7C,GAAG4I,UAAU,iBAAiBvH,EAAAA,EAAI,CAAA;IAC5C,CAAA,CAAA;AAEA,qBAAA,MAAiBG,SAAQxB,GAAGuI,OAA2B,CAAClH,OAAAA;AACtD,aAAOrB,GAAG0I,KAAK,CAACnH,SAAAA;AACd,cAAMH,SAAS,CAACP,MAAYkI,OAAiB,CAAA,MAAE;AAC7C,gBAAMxF,SAAQhC,KAAI,KAAKM,YAAYhB,KAAKQ,EAAE,CAAA;AAC1C,gBAAM2H,MAA2B;YAC/B3H,IAAIR,KAAKQ;YACTuC,MAAM/C,KAAK+C;UACb;AACA,cAAI/C,KAAKiD,WAAWmF,OAAO;AACzBD,gBAAIC,QAAQpI,KAAKiD,WAAWmF;UAC9B;AACA,cAAI1F,OAAM0C,QAAQ;AAChB+C,gBAAIzF,QAAQA,OACTE,IAAI,CAACyF,MAAAA;AAEJ,oBAAMC,WAAW;mBAAIJ;gBAAMlI,KAAKQ;;AAChC,qBAAO8H,SAASvD,SAASsD,EAAE7H,EAAE,IAAI+H,SAAYhI,OAAO8H,GAAGC,QAAAA;YACzD,CAAA,EACCnD,OAAOvF,aAAAA;UACZ;AACA,iBAAOuI;QACT;AAEA,cAAM5G,OAAOb,KAAI,KAAKI,YAAYN,EAAAA,CAAAA;AAClC,eAAOD,OAAOgB,IAAAA;MAChB,CAAA,EAAGS,KAAK7C,GAAG4I,UAAU,cAAcvH,EAAAA,EAAI,CAAA;IACzC,CAAA,CAAA;AAGE,SAAKC,YAAYyG,YAAYhI,SAAS2I,KAAI;AAC1C,SAAK3F,gBAAgBiF;AACrB,SAAK3E,YAAY4E;AACjB,SAAK1C,gBAAgB2C;AAErB,QAAI3E,OAAO;AACTA,YAAMsD,QAAQ,CAAChG,SAAAA;AACbV,QAAO6C,WAAI,KAAKqF,eAAexH,KAAKQ,IAAI,KAAKuD,eAAe/D,IAAAA,CAAAA;MAC9D,CAAA;IACF;AAEA,QAAIqB,OAAO;AACTmC,aAAOgF,QAAQnH,KAAAA,EAAO2E,QAAQ,CAAC,CAAChC,QAAQ3C,MAAAA,MAAM;AAC5C/B,QAAO6C,WAAI,KAAKoF,eAAevD,QAAQ3C,MAAAA;MACzC,CAAA;IACF;EACF;AAkRF;;;ACvlBA,SAASoH,YAAAA,WAAUC,MAAAA,WAAU;AAC7B,SAASC,cAAc;AACvB,YAAYC,WAAW;AACvB,YAAYC,eAAc;AAC1B,YAAYC,aAAY;AACxB,YAAYC,aAAY;AAGxB,SAASC,OAAAA,YAAW;AACpB,SAA2CC,YAAYC,cAAcC,QAAQC,iBAAAA,sBAAqB;;;ACuC3F,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,cAAcA,KAAKG,SAASC,cAAc;AAE9E,IAAMC,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACP,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASK,qBAAqBL,KAAKG,SAASK,oBAAoB;AAIpF,IAAMC,eAAe,CAACT,SAAgDE,SAASF,IAAAA,KAASO,cAAcP,IAAAA;;;;;;;;;;;;;;;;;ADnCtG,IAAMU,kBAAkB,CAACC,cAAAA;AAC9B,QAAM,EACJC,IACAC,WAAW,UACXC,WAAW,YACXC,UAAUC,WACVC,WAAWC,YACXC,SAASC,UACTC,cAAcC,cAAa,IACzBX;AACJ,QAAMY,QAAQ,CAACC,QAAgB,GAAGZ,EAAAA,IAAMY,GAAAA;AAExC,QAAMT,WACJC,aAAaS,IAAGC,OAAO,CAACd,QAAeI,UAAUJ,GAAAA,EAAIe,KAAKF,IAAGG,UAAU,2BAA2BhB,GAAAA,EAAI,CAAA,CAAA;AAExG,QAAMK,YACJC,cACAO,IAAGC,OAAO,CAACG,SACTX,WAAWW,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,4BAA4BhB,EAAAA,EAAI,CAAA,CAAA;AAGvE,QAAMS,eACJC,iBACAG,IAAGC,OAAO,CAACG,SACTP,cAAcO,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,+BAA+BhB,EAAAA,EAAI,CAAA,CAAA;AAG7E,QAAMO,UACJC,YACAK,IAAGC,OAAO,CAACG,SAAqCT,SAASS,IAAAA,EAAMF,KAAKF,IAAGG,UAAU,0BAA0BhB,EAAAA,EAAI,CAAA,CAAA;AAEjH,SAAO;IACLG,WAAW;MAAEH,IAAIW,MAAM,UAAA;MAAaV;MAAUE;IAAS,IAAIe;IAC3Db,YACK;MACCL,IAAIW,MAAM,WAAA;MACVV;MACAC;MACAG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,SAAAA;AACP,YAAI;AACF,iBAAOA,KAAIf,UAAUY,IAAAA,CAAAA;QACvB,QAAQ;AACNI,UAAAA,KAAIC,KAAK,sBAAsB;YAAEtB,IAAIW,MAAM,WAAA;YAAcM;UAAK,GAAA;;;;;;AAC9D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,2BAA2BhB,EAAAA,EAAI,CAAA,CAAA;IAExD,IACAkB;IACJT,eACK;MACCT,IAAIW,MAAM,cAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,SAAAA;AACP,YAAI;AACF,iBAAOA,KAAIX,aAAaQ,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAC3C,GAAGA;YACHC,MAAMC;YACNC,MAAMC;UACR,EAAA;QACF,QAAQ;AACNP,UAAAA,KAAIC,KAAK,yBAAyB;YAAEtB,IAAIW,MAAM,cAAA;YAAiBM;UAAK,GAAA;;;;;;AACpE,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,wCAAwChB,EAAAA,EAAI,CAAA,CAAA;IAErE,IACAkB;IACJX,UACK;MACCP,IAAIW,MAAM,SAAA;MACVV;MACAC,UAAU;MACVG,WAAWQ,IAAGC,OAAO,CAACG,SACpBJ,IAAGM,KAAK,CAACC,SAAAA;AACP,YAAI;AACF,iBAAOA,KAAIb,QAAQU,IAAAA,CAAAA,EAAOM,IAAI,CAACC,SAAS;YAAE,GAAGA;YAAKG,MAAME;UAAY,EAAA;QACtE,QAAQ;AACNR,UAAAA,KAAIC,KAAK,oBAAoB;YAAEtB,IAAIW,MAAM,SAAA;YAAYM;UAAK,GAAA;;;;;;AAC1D,iBAAO,CAAA;QACT;MACF,CAAA,EAAGF,KAAKF,IAAGG,UAAU,mCAAmChB,EAAAA,EAAI,CAAA,CAAA;IAEhE,IACAkB;IACJY,OAAOC,cAAAA;AACX;AAmBO,IAAMC,oBAAoB,CAACjC,WAA8BkC,MAA0B,CAAA,MAAE;AAC1F,MAAUC,cAAQnC,SAAAA,GAAY;AAC5B,WAAO;SAAIkC;SAAQlC,UAAUoC,QAAQ,CAACC,QAAQJ,kBAAkBI,KAAKH,GAAAA,CAAAA;;EACvE,OAAO;AACL,WAAO;SAAIA;MAAKlC;;EAClB;AACF;AAQO,IAAMsC,eAAN,MAAMA,cAAAA;EAsBX,OAAOC,KAAKC,QAAiBC,UAA4C;AACvE,QAAI,CAACD,QAAQ;AACX,aAAO,IAAIF,cAAa;QAAEG;MAAS,CAAA;IACrC;AAEA,UAAM,EAAEC,OAAOC,MAAK,IAAKC,KAAKC,MAAML,MAAAA;AACpC,WAAO,IAAIF,cAAa;MAAEI;MAAOC;MAAOF;IAAS,CAAA;EACnD;EAEA,IAAIK,QAAyB;AAC3B,WAAO,KAAKC;EACd;EAEA,IAAIC,aAAa;AACf,WAAO,KAAKC;EACd;EAEAC,aAAaF,YAA6C;AACxDf,sBAAkBe,UAAAA,EAAYG,QAAQ,CAACnD,cAAAA;AACrC,YAAMgD,cAAa,KAAKI,UAAU/B,IAAI,KAAK4B,WAAW;AACtD,WAAKG,UAAUC,IAAI,KAAKJ,aAAoBI,YAAIL,aAAYhD,UAAUC,IAAID,SAAAA,CAAAA;IAC5E,CAAA;AACA,WAAO;EACT;EAEAsD,gBAAgBrD,IAA0B;AACxC,UAAM+C,aAAa,KAAKI,UAAU/B,IAAI,KAAK4B,WAAW;AACtD,SAAKG,UAAUC,IAAI,KAAKJ,aAAoBM,eAAOP,YAAY/C,EAAAA,CAAAA;AAC/D,WAAO;EACT;EAEA,MAAMuD,QAIJ,EAAEf,WAAWgB,UAASrC,KAAI,GAAIsC,SAASC,SAASxD,WAAW,YAAYyD,QAAO,GAC9EC,OAAiB,CAAA,GACF;AAEf,QAAIA,KAAKC,SAASJ,MAAAA,GAAS;AACzB;IACF;AAIA,QAAI,CAACK,OAAAA,GAAU;AACb,YAAM,EAAEC,gBAAe,IAAK,MAAM,OAAO,wBAAA;AACzC,YAAMA,gBAAgB,MAAA;IACxB;AAEA,UAAM9C,OAAOuB,SAASpB,IAAI,KAAK0B,OAAOkB,YAAYP,MAAAA,CAAAA;AAClD,UAAMQ,iBAAiB,MAAMN,QAAQ1C,MAAM;SAAI2C;MAAM3C,KAAKjB;KAAG;AAC7D,QAAIiE,mBAAmB,OAAO;AAC5B;IACF;AAEA,UAAMxB,QAAQyB,OAAOC,OAAO,KAAKhB,UAAU/B,IAAI,KAAK4B,WAAW,CAAA,EAC5DlB,OAAO,CAAC/B,cAAcG,cAAcH,UAAUG,YAAY,WAAS,EACnEqB,IAAI,CAACxB,cAAcA,UAAUM,SAAS,EACtCyB,OAAOC,cAAAA,EACPI,QAAQ,CAAC9B,cAAcmC,SAASpB,IAAIf,UAAU,KAAKyC,OAAO7B,KAAKwC,MAAAA,CAAAA,CAAAA,CAAAA;AAElE,UAAMW,QAAQC,IACZ5B,MAAMlB,IAAI,CAAC+C,YAAAA;AACT9B,eAASY,IAAI,KAAKN,OAAOyB,MAAMD,QAAQtE,EAAE,GAAG,KAAK8C,OAAO0B,eAAeF,OAAAA,CAAAA;AACvE,aAAO,KAAKf,QAAQ;QAAEf;QAAUiB,QAAQa,QAAQtE;QAAIE;QAAUyD;MAAQ,GAAG;WAAIC;QAAM3C,KAAKjB;OAAG;IAC7F,CAAA,CAAA;AAGF,QAAIwC,aAAa,KAAKW,WAAW;AAC/BX,eAASiC,MAAK;AACdjC,eAASkC,QAAO;IAClB;EACF;EAEAC,UAAgB;AACd,SAAKC,eAAe1B,QAAQ,CAAC2B,gBAAgBA,YAAAA,CAAAA;AAC7C,SAAKD,eAAeE,MAAK;EAC3B;EAmCQC,UAAU/E,IAAYE,UAA0B;AACtDmB,IAAAA,KAAI,YAAY;MAAErB;MAAIE;MAAUsC,UAAUwC,aAAa,KAAK7B,SAAS;IAAE,GAAA;;;;;;AACvE,UAAM8B,aAAa,KAAKC,YAAY,GAAGlF,EAAAA,IAAME,QAAAA,EAAU;AAEvD,QAAIiF,WAAqB,CAAA;AACzB,UAAMC,SAAS,KAAKjC,UAAUkC,UAC5BJ,YACA,CAACxC,UAAAA;AACC,YAAM6C,MAAM7C,MAAMlB,IAAI,CAACgE,MAAMA,EAAEvF,EAAE;AACjC,YAAMwF,UAAUL,SAASrD,OAAO,CAAC9B,QAAO,CAACsF,IAAIzB,SAAS7D,GAAAA,CAAAA;AACtDmF,iBAAWG;AAEXjE,MAAAA,KAAI,UAAU;QAAErB;QAAIE;QAAUoF;QAAKE;MAAQ,GAAA;;;;;;AAC3C,YAAMC,SAAS,MAAA;AACb5E,QAAAA,IAAG6E,MAAM,MAAA;AACP,eAAK5C,OAAO6C,YACVH,QAAQjE,IAAI,CAACqE,YAAY;YAAEnC,QAAQzD;YAAI4F;UAAO,EAAA,GAC9C,IAAA;AAEF,eAAK9C,OAAO+C,SAASpD,KAAAA;AACrB,eAAKK,OAAOgD,SACVrD,MAAMlB,IAAI,CAACN,SACTf,aAAa,aAAa;YAAEuD,QAAQzD;YAAI4F,QAAQ3E,KAAKjB;UAAG,IAAI;YAAEyD,QAAQxC,KAAKjB;YAAI4F,QAAQ5F;UAAG,CAAA,CAAA;AAG9F,eAAK8C,OAAOiD,UACV/F,IACAE,UACAuC,MAAMlB,IAAI,CAAC,EAAEvB,IAAAA,IAAE,MAAOA,GAAAA,CAAAA;QAE1B,CAAA;MACF;AAIA,UAAI,OAAOgG,0BAA0B,YAAY;AAC/CA,8BAAsBP,MAAAA;MACxB,OAAO;AACLA,eAAAA;MACF;IACF,GACA;MAAEQ,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAexB,IAAIpD,IAAIoF,MAAAA;EAC9B;;EAGA,MAAcc,cAAclG,IAAY;AACtCqB,IAAAA,KAAI,gBAAgB;MAAErB;IAAG,GAAA;;;;;;AACzB,UAAMG,WAAW,KAAKgG,WAAWnG,EAAAA;AAEjC,UAAMoF,SAAS,KAAKjC,UAAUkC,UAC5BlF,UACA,CAACc,SAAAA;AACC,YAAMmF,UAAU,KAAKC,aAAarG,EAAAA;AAClCsG,MAAOC,cAAMtF,MAAM;QACjBuF,QAAQ,CAACvF,UAAAA;AACP,eAAK6B,OAAO+C,SAAS;YAAC5E;WAAK;AAC3BmF,mBAASK,KAAAA;QACX;QACAC,QAAQ,MAAA;AACNN,mBAASK,KAAAA;AACT,eAAK3D,OAAO6D,YAAY;YAAC3G;WAAG;QAC9B;MACF,CAAA;IACF,GACA;MAAEiG,WAAW;IAAK,CAAA;AAGpB,SAAKrB,eAAexB,IAAIpD,IAAIoF,MAAAA;EAC9B;EAEQwB,cAAc5G,IAAkB;AACtC,SAAK4E,eAAexD,IAAIpB,EAAAA,IAAAA;AACxB,SAAK4E,eAAeiC,OAAO7G,EAAAA;EAC7B;EAxMA,YAAY,EAAEwC,UAAU,GAAGsE,OAAAA,IAA8D,CAAC,GAAG;AAT7F,IAAAC,kBAAA,MAAiBnC,kBAAiB,oBAAIoC,IAAAA,CAAAA;AACtC,IAAAD,kBAAA,MAAiB/D,eAAcnC,IAAGM,KAAY8F,cAAK,CAAA,EAA8BlG,KAC/EF,IAAGqG,WACHrG,IAAGG,UAAU,0BAAA,CAAA,CAAA;AAEf,IAAA+F,kBAAA,MAAiBV,gBAAwC,CAAC,CAAA;AAC1D,IAAAU,kBAAA,MAAiB5D,aAAjB,MAAA;AACA,IAAA4D,kBAAA,MAAiBjE,UAAjB,MAAA;AA6FA,IAAAiE,kBAAA,MAAiBZ,cAAatF,IAAGC,OAAmD,CAACd,OAAAA;AACnF,aAAOa,IAAGM,KAAK,CAACC,SAAAA;AACd,eAAgBL,eACdK,KAAI,KAAK4B,WAAW,GACbmB,gBACDgD,aAAOC,UAAAA,GACP7F,UAAI,CAAC,EAAEpB,SAAQ,MAAOA,QAAAA,GACtB2B,aAAOC,cAAAA,GACPR,UAAI,CAACpB,aAAaiB,KAAIjB,SAASH,EAAAA,CAAAA,CAAAA,GAC/B8B,aAAOC,cAAAA,GACPsF,UAAI;MAEd,CAAA;IACF,CAAA,CAAA;AAEA,IAAAN,kBAAA,MAAiB7B,eAAcrE,IAAGC,OAAsC,CAACF,QAAAA;AACvE,aAAOC,IAAGM,KAAK,CAACC,SAAAA;AACd,cAAM,CAACpB,IAAIE,QAAAA,IAAYU,IAAI0G,MAAM,GAAA;AACjC,cAAMrG,OAAO,KAAK6B,OAAO7B,KAAKjB,EAAAA;AAE9B,eAAgBe;UACdK,KAAI,KAAK4B,WAAW;UACbmB;;UAEDgD,aAAOC,UAAAA;UACPtF,aAAO,CAAC,EAAE5B,UAAUqH,YAAY,WAAU,MAAOA,cAAcrH,QAAAA;UAC/DqB,UAAI,CAAC,EAAElB,UAAS,MAAOA,YAAYY,IAAAA,CAAAA;UACnCa,aAAOC,cAAAA;UACPI,cAAQ,CAACqF,WAAWpG,KAAIoG,MAAAA,CAAAA;QAAAA;MAElC,CAAA,EAAGzG,KAAKF,IAAGG,UAAU,4BAA4BJ,GAAAA,EAAK,CAAA;IACxD,CAAA,CAAA;AAzHE,SAAKuC,YAAYX,YAAYgB,UAASrC,KAAI;AAC1C,SAAK2B,SAAS,IAAI2E,MAAM;MACtB,GAAGX;MACHtE,UAAU,KAAKW;MACfuE,UAAU,CAAC1H,IAAIE,aAAa,KAAK6E,UAAU/E,IAAIE,QAAAA;MAC/CyH,cAAc,CAAC3H,OAAO,KAAKkG,cAAclG,EAAAA;MACzC4H,cAAc,CAAC5H,OAAO,KAAK4G,cAAc5G,EAAAA;IAC3C,CAAA;EACF;AAgMF;AAMO,IAAM6H,eAAe,CAAIC,OAAAA;AAC9B,SAAOjH,IAAGM,KAAK,CAACC,SAAAA;AACd,UAAMsD,UAAUqD,OAAO,MAAA;AACrB3G,MAAAA,KAAI4G,QAAQF,GAAAA,CAAAA;IACd,CAAA;AAEA1G,IAAAA,KAAI6G,aAAa,MAAMvD,QAAAA,CAAAA;AAEvB,WAAOoD,GAAAA;EACT,CAAA;AACF;AAEA,IAAMI,mBAAmBrH,IAAGC,OAAO,CAACqH,eAAAA;AAClC,SAAOtH,IAAGM,KAAK,CAACC,SAAAA;AACd,UAAMgH,eAAeD,WAAW9C,UAAU,CAACgD,UAAUjH,KAAI4G,QAAQK,KAAAA,CAAAA;AAEjEjH,IAAAA,KAAI6G,aAAa,MAAMG,aAAavD,YAAW,CAAA;AAE/C,WAAOsD,WAAW/G,IAAG;EACvB,CAAA;AACF,CAAA;AAMO,IAAMkH,mBAAmB,CAAIH,eAAAA;AAClC,SAAOD,iBAAiBC,UAAAA;AAC1B;",
+  "names": ["Registry", "Rx", "Function", "Option", "Record", "Event", "Trigger", "todo", "invariant", "log", "isNonNullable", "graphSymbol", "Symbol", "getGraph", "node", "graph", "ROOT_ID", "ROOT_TYPE", "ACTION_TYPE", "ACTION_GROUP_TYPE", "Graph", "toJSON", "id", "_registry", "get", "_json", "json", "_node", "nodeOrThrow", "_nodeOrThrow", "connections", "relation", "_connections", "actions", "_actions", "edges", "_edges", "root", "getNodeOrThrow", "getNode", "getConnections", "getActions", "getEdges", "initialize", "initialized", "_initialized", "pipe", "getOrElse", "_onInitialize", "set", "expand", "key", "expanded", "_expanded", "_onExpand", "addNodes", "nodes", "batch", "map", "addNode", "nodeArg", "type", "data", "properties", "nodeRx", "match", "onSome", "typeChanged", "dataChanged", "propertiesChanged", "Object", "keys", "some", "newNode", "onNodeChanged", "emit", "onNone", "_constructNode", "source", "target", "addEdges", "removeNodes", "ids", "removeNode", "none", "inbound", "outbound", "removeEdges", "_onRemoveNode", "edge", "addEdge", "edgeArg", "sourceRx", "includes", "targetRx", "removeOrphans", "removeEdge", "filter", "length", "sortEdges", "order", "edgesRx", "unsorted", "sorted", "splice", "traverse", "visitor", "path", "shouldContinue", "values", "forEach", "child", "getPath", "flatMap", "found", "isSome", "waitForPath", "params", "timeout", "interval", "value", "trigger", "i", "setInterval", "wake", "wait", "finally", "clearInterval", "registry", "onInitialize", "onExpand", "onRemoveNode", "empty", "_initialEdges", "_initialNodes", "fromEntries", "family", "initial", "flatten", "make", "keepAlive", "withLabel", "split", "o", "seen", "obj", "label", "n", "nextSeen", "undefined", "entries", "Registry", "Rx", "effect", "Array", "Function", "Option", "Record", "log", "byPosition", "getDebugName", "isNode", "isNonNullable", "isGraphNode", "data", "properties", "isAction", "type", "ACTION_TYPE", "actionGroupSymbol", "Symbol", "isActionGroup", "ACTION_GROUP_TYPE", "isActionLike", "createExtension", "extension", "id", "position", "relation", "resolver", "_resolver", "connector", "_connector", "actions", "_actions", "actionGroups", "_actionGroups", "getId", "key", "Rx", "family", "pipe", "withLabel", "node", "undefined", "make", "get", "log", "warn", "map", "arg", "data", "actionGroupSymbol", "type", "ACTION_GROUP_TYPE", "ACTION_TYPE", "filter", "isNonNullable", "flattenExtensions", "acc", "isArray", "flatMap", "ext", "GraphBuilder", "from", "pickle", "registry", "nodes", "edges", "JSON", "parse", "graph", "_graph", "extensions", "_extensions", "addExtension", "forEach", "_registry", "set", "removeExtension", "remove", "explore", "Registry", "source", "ROOT_ID", "visitor", "path", "includes", "isNode", "yieldOrContinue", "nodeOrThrow", "shouldContinue", "Object", "values", "Promise", "all", "nodeArg", "_node", "_constructNode", "reset", "dispose", "destroy", "_subscriptions", "unsubscribe", "clear", "_onExpand", "getDebugName", "connectors", "_connectors", "previous", "cancel", "subscribe", "ids", "n", "removed", "update", "batch", "removeEdges", "target", "addNodes", "addEdges", "sortEdges", "requestAnimationFrame", "immediate", "_onInitialize", "_resolvers", "trigger", "_initialized", "Option", "match", "onSome", "wake", "onNone", "removeNodes", "_onRemoveNode", "delete", "params", "_define_property", "Map", "empty", "keepAlive", "sortBy", "byPosition", "head", "split", "_relation", "result", "Graph", "onExpand", "onInitialize", "onRemoveNode", "rxFromSignal", "cb", "effect", "setSelf", "addFinalizer", "observableFamily", "observable", "subscription", "value", "rxFromObservable"]
 }