@dxos/graph 0.8.4-main.fbb7a13 → 0.8.4-main.fcc0d83b33

package/dist/lib/browser/index.mjs

@@ -62,15 +62,7 @@ var SelectionModel = class {
     this._registry.set(this._selected, /* @__PURE__ */ new Set());
   }
   add(id) {
-    invariant(id, void 0, {
-      F: __dxlog_file,
-      L: 76,
-      S: this,
-      A: [
-        "id",
-        ""
-      ]
-    });
+    invariant(id, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 58, S: this, A: ["id", ""] });
     const current = this._registry.get(this._selected);
     this._registry.set(this._selected, new Set(this._singleSelect ? [
       id
@@ -80,15 +72,7 @@ var SelectionModel = class {
     ]));
   }
   remove(id) {
-    invariant(id, void 0, {
-      F: __dxlog_file,
-      L: 85,
-      S: this,
-      A: [
-        "id",
-        ""
-      ]
-    });
+    invariant(id, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 68, S: this, A: ["id", ""] });
     const current = this._registry.get(this._selected);
     this._registry.set(this._selected, new Set(Array.from(current.values()).filter((_id) => _id !== id)));
   }
@@ -140,24 +124,8 @@ var Edge = Schema.Struct({
 });
 var KEY_REGEX = /\w+/;
 var createEdgeId = ({ source, target, relation }) => {
-  invariant2(source.match(KEY_REGEX), `invalid source: ${source}`, {
-    F: __dxlog_file2,
-    L: 52,
-    S: void 0,
-    A: [
-      "source.match(KEY_REGEX)",
-      "`invalid source: ${source}`"
-    ]
-  });
-  invariant2(target.match(KEY_REGEX), `invalid target: ${target}`, {
-    F: __dxlog_file2,
-    L: 53,
-    S: void 0,
-    A: [
-      "target.match(KEY_REGEX)",
-      "`invalid target: ${target}`"
-    ]
-  });
+  invariant2(source.match(KEY_REGEX), `invalid source: ${source}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 27, S: void 0, A: ["source.match(KEY_REGEX)", "`invalid source: ${source}`"] });
+  invariant2(target.match(KEY_REGEX), `invalid target: ${target}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 28, S: void 0, A: ["target.match(KEY_REGEX)", "`invalid target: ${target}`"] });
   return [
     source,
     relation,
@@ -166,15 +134,7 @@ var createEdgeId = ({ source, target, relation }) => {
 };
 var parseEdgeId = (id) => {
   const [source, relation, target] = id.split("_");
-  invariant2(source.length && target.length, void 0, {
-    F: __dxlog_file2,
-    L: 59,
-    S: void 0,
-    A: [
-      "source.length && target.length",
-      ""
-    ]
-  });
+  invariant2(source.length && target.length, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 37, S: void 0, A: ["source.length && target.length", ""] });
   return {
     source,
     relation: relation.length ? relation : void 0,
@@ -212,7 +172,7 @@ var ReadonlyGraphModel = class {
   /**
   * NOTE: Pass in simple Graph or Live.
   * @param graph - The graph data.
-  * @param change - Optional function to wrap mutations (e.g., Obj.change for ECHO objects).
+  * @param change - Optional function to wrap mutations (e.g., Obj.update for ECHO objects).
   */
   constructor(graph, change) {
     this._graph = graph ?? {
@@ -318,24 +278,8 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     return this;
   }
   addNode(node) {
-    invariant3(node.id, "ID is required", {
-      F: __dxlog_file3,
-      L: 182,
-      S: this,
-      A: [
-        "node.id",
-        "'ID is required'"
-      ]
-    });
-    invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, {
-      F: __dxlog_file3,
-      L: 183,
-      S: this,
-      A: [
-        "!this.findNode(node.id)",
-        "`node already exists: ${node.id}`"
-      ]
-    });
+    invariant3(node.id, "ID is required", { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 126, S: this, A: ["node.id", "'ID is required'"] });
+    invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 127, S: this, A: ["!this.findNode(node.id)", "`node already exists: ${node.id}`"] });
     this._mutate((graph) => {
       graph.nodes.push(node);
     });
@@ -345,39 +289,15 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     return nodes.map((node) => this.addNode(node));
   }
   addEdge(edge) {
-    invariant3(edge.source, void 0, {
-      F: __dxlog_file3,
-      L: 195,
-      S: this,
-      A: [
-        "edge.source",
-        ""
-      ]
-    });
-    invariant3(edge.target, void 0, {
-      F: __dxlog_file3,
-      L: 196,
-      S: this,
-      A: [
-        "edge.target",
-        ""
-      ]
-    });
+    invariant3(edge.source, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 137, S: this, A: ["edge.source", ""] });
+    invariant3(edge.target, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 138, S: this, A: ["edge.target", ""] });
     if (!edge.id) {
       edge = {
         id: createEdgeId(edge),
         ...edge
       };
     }
-    invariant3(!this.findNode(edge.id), void 0, {
-      F: __dxlog_file3,
-      L: 201,
-      S: this,
-      A: [
-        "!this.findNode(edge.id!)",
-        ""
-      ]
-    });
+    invariant3(!this.findNode(edge.id), void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 146, S: this, A: ["!this.findNode(edge.id)", ""] });
     this._mutate((graph) => {
       graph.edges.push(edge);
     });
@@ -504,24 +424,8 @@ var ReactiveGraphModel = class _ReactiveGraphModel extends GraphModel {
     return this;
   }
   addNode(node) {
-    invariant3(node.id, "ID is required", {
-      F: __dxlog_file3,
-      L: 374,
-      S: this,
-      A: [
-        "node.id",
-        "'ID is required'"
-      ]
-    });
-    invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, {
-      F: __dxlog_file3,
-      L: 375,
-      S: this,
-      A: [
-        "!this.findNode(node.id)",
-        "`node already exists: ${node.id}`"
-      ]
-    });
+    invariant3(node.id, "ID is required", { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 280, S: this, A: ["node.id", "'ID is required'"] });
+    invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 281, S: this, A: ["!this.findNode(node.id)", "`node already exists: ${node.id}`"] });
     const current = this._registry.get(this._graphAtom);
     this._registry.set(this._graphAtom, {
       ...current,
@@ -533,39 +437,15 @@ var ReactiveGraphModel = class _ReactiveGraphModel extends GraphModel {
     return node;
   }
   addEdge(edge) {
-    invariant3(edge.source, void 0, {
-      F: __dxlog_file3,
-      L: 385,
-      S: this,
-      A: [
-        "edge.source",
-        ""
-      ]
-    });
-    invariant3(edge.target, void 0, {
-      F: __dxlog_file3,
-      L: 386,
-      S: this,
-      A: [
-        "edge.target",
-        ""
-      ]
-    });
+    invariant3(edge.source, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 293, S: this, A: ["edge.source", ""] });
+    invariant3(edge.target, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 294, S: this, A: ["edge.target", ""] });
     if (!edge.id) {
       edge = {
         id: createEdgeId(edge),
         ...edge
       };
     }
-    invariant3(!this.findNode(edge.id), void 0, {
-      F: __dxlog_file3,
-      L: 390,
-      S: this,
-      A: [
-        "!this.findNode(edge.id!)",
-        ""
-      ]
-    });
+    invariant3(!this.findNode(edge.id), void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 301, S: this, A: ["!this.findNode(edge.id)", ""] });
     const current = this._registry.get(this._graphAtom);
     this._registry.set(this._graphAtom, {
       ...current,

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/selection.ts", "../../../src/Graph.ts", "../../../src/GraphModel.ts"],
-  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\n\nimport { invariant } from '@dxos/invariant';\n\n/**\n * Reactive selection model.\n */\nexport class SelectionModel {\n  private readonly _registry: Registry.Registry;\n  private readonly _selected: Atom.Writable<Set<string>>;\n\n  constructor(private readonly _singleSelect: boolean = false) {\n    this._registry = Registry.make();\n    this._selected = Atom.make<Set<string>>(new Set<string>());\n  }\n\n  /**\n   * Returns the selected IDs atom for subscription.\n   */\n  get selected(): Atom.Atom<Set<string>> {\n    return this._selected;\n  }\n\n  /**\n   * Gets the current selected IDs as a Set.\n   */\n  getSelected(): Set<string> {\n    return this._registry.get(this._selected);\n  }\n\n  /**\n   * Gets the current selected IDs as an array.\n   */\n  getSelectedIds(): string[] {\n    return Array.from(this._registry.get(this._selected).values());\n  }\n\n  /**\n   * Subscribe to selection changes.\n   */\n  subscribe(cb: (selected: Set<string>) => void): () => void {\n    // Prime the atom by reading before subscribing.\n    this._registry.get(this._selected);\n\n    return this._registry.subscribe(this._selected, () => {\n      cb(this._registry.get(this._selected));\n    });\n  }\n\n  toJSON(): { selected: string[] } {\n    return {\n      selected: this.getSelectedIds(),\n    };\n  }\n\n  /**\n   * Gets the current selection size.\n   */\n  getSize(): number {\n    return this._registry.get(this._selected).size;\n  }\n\n  contains(id: string): boolean {\n    return this._registry.get(this._selected).has(id);\n  }\n\n  clear(): void {\n    this._registry.set(this._selected, new Set());\n  }\n\n  add(id: string): void {\n    invariant(id);\n    const current = this._registry.get(this._selected);\n    this._registry.set(\n      this._selected,\n      new Set<string>(this._singleSelect ? [id] : [...Array.from(current.values()), id]),\n    );\n  }\n\n  remove(id: string): void {\n    invariant(id);\n    const current = this._registry.get(this._selected);\n    this._registry.set(this._selected, new Set<string>(Array.from(current.values()).filter((_id) => _id !== id)));\n  }\n\n  // TODO(burdon): Handle single select.\n\n  setSelected(ids: string[], subtract = false): void {\n    const current = this._registry.get(this._selected);\n    this._registry.set(this._selected, new Set([...(subtract ? Array.from(current.values()) : []), ...ids]));\n  }\n\n  toggleSelected(ids: string[], subtract = false): void {\n    const current = this._registry.get(this._selected);\n    const set = new Set<string>(subtract ? Array.from(current.values()) : undefined);\n    ids.forEach((id) => {\n      if (current.has(id)) {\n        set.delete(id);\n      } else {\n        set.add(id);\n      }\n    });\n\n    this._registry.set(this._selected, set);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { invariant } from '@dxos/invariant';\nimport { type Specialize } from '@dxos/util';\n\n//\n// Node\n//\n\nexport const Node = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  data: Schema.optional(Schema.Any),\n});\n\ninterface BaseNode extends Schema.Schema.Type<typeof Node> {}\n\nexport declare namespace Node {\n  export type Any = Specialize<BaseNode, { data?: any }>;\n  export type Node<Data = any> = Specialize<BaseNode, { data: Data }>;\n}\n\n//\n// Edge\n//\n\nexport const Edge = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  source: Schema.String,\n  target: Schema.String,\n  data: Schema.optional(Schema.Any),\n});\n\ninterface BaseEdge extends Schema.Schema.Type<typeof Edge> {}\n\nexport declare namespace Edge {\n  export type Any = Specialize<BaseEdge, { data?: any }>;\n  export type Edge<Data = any> = Specialize<BaseEdge, { data: Data }>;\n}\n\nconst KEY_REGEX = /\\w+/;\n\n// NOTE: The `relation` is different from the `type`.\ntype EdgeMeta = { source: string; target: string; relation?: string };\n\nexport const createEdgeId = ({ source, target, relation }: EdgeMeta) => {\n  invariant(source.match(KEY_REGEX), `invalid source: ${source}`);\n  invariant(target.match(KEY_REGEX), `invalid target: ${target}`);\n  return [source, relation, target].join('_');\n};\n\nexport const parseEdgeId = (id: string): EdgeMeta => {\n  const [source, relation, target] = id.split('_');\n  invariant(source.length && target.length);\n  return { source, relation: relation.length ? relation : undefined, target };\n};\n\n//\n// Graph\n//\n\nexport const Graph = Schema.Struct({\n  id: Schema.optional(Schema.String),\n  nodes: Schema.mutable(Schema.Array(Node)),\n  edges: Schema.mutable(Schema.Array(Edge)),\n});\n\nexport interface Any extends Schema.Schema.Type<typeof Graph> {}\n\nexport type Graph<Node extends Node.Any, Edge extends Edge.Any> = Specialize<\n  Any,\n  {\n    nodes: Node[];\n    edges: Edge[];\n  }\n>;\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, type Registry } from '@effect-atom/atom-react';\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { type MakeOptional, isTruthy, removeBy } from '@dxos/util';\n\nimport * as Graph from './Graph';\n\n/**\n * Optional function to wrap mutations (e.g., for ECHO objects that require Obj.change).\n */\nexport type GraphChangeFunction = (fn: () => void) => void;\n\n/**\n * Readonly Graph wrapper.\n */\nexport class ReadonlyGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> {\n  protected readonly _graph: Graph.Graph<Node, Edge>;\n  /**\n   * Optional function to wrap mutations.\n   * When set, all graph mutations are wrapped in this function.\n   */\n  protected readonly _change?: GraphChangeFunction;\n\n  /**\n   * NOTE: Pass in simple Graph or Live.\n   * @param graph - The graph data.\n   * @param change - Optional function to wrap mutations (e.g., Obj.change for ECHO objects).\n   */\n  constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction) {\n    this._graph = graph ?? {\n      nodes: [],\n      edges: [],\n    };\n    this._change = change;\n  }\n\n  [inspectCustom]() {\n    return this.toJSON();\n  }\n\n  /**\n   * Return stable sorted JSON representation of graph.\n   */\n  toJSON() {\n    return {\n      nodes: this.nodes.length,\n      edges: this.edges.length,\n    };\n  }\n\n  get graph(): Graph.Graph<Node, Edge> {\n    return this._graph;\n  }\n\n  get nodes(): Node[] {\n    return this._graph.nodes;\n  }\n\n  get edges(): Edge[] {\n    return this._graph.edges;\n  }\n\n  //\n  // Nodes\n  //\n\n  findNode(id: string): Node | undefined {\n    return this.nodes.find((node) => node.id === id);\n  }\n\n  getNode(id: string): Node {\n    return this.findNode(id) ?? failedInvariant();\n  }\n\n  filterNodes({ type }: Partial<Graph.Node.Any> = {}): Node[] {\n    return this.nodes.filter((node) => !type || type === node.type);\n  }\n\n  //\n  // Edges\n  //\n\n  findEdge(id: string): Edge | undefined {\n    return this.edges.find((edge) => edge.id === id);\n  }\n\n  getEdge(id: string): Edge {\n    return this.findEdge(id) ?? failedInvariant();\n  }\n\n  filterEdges({ type, source, target }: Partial<Graph.Edge.Any> = {}): Edge[] {\n    return this.edges.filter(\n      (edge) =>\n        (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),\n    );\n  }\n\n  //\n  // Traverse\n  //\n\n  traverse(root: Node): Node[] {\n    return this._traverse(root);\n  }\n\n  private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {\n    if (visited.has(root.id)) {\n      return [];\n    }\n\n    visited.add(root.id);\n    const targets = this.filterEdges({ source: root.id })\n      .map((edge) => this.getNode(edge.target))\n      .filter(isTruthy);\n\n    return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n  }\n}\n\n/**\n * Mutable Graph wrapper.\n */\nexport abstract class AbstractGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n  Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,\n  Builder extends AbstractBuilder<Node, Edge, Model> = AbstractBuilder<Node, Edge, Model>,\n> extends ReadonlyGraphModel<Node, Edge> {\n  /**\n   * Allows chaining.\n   */\n  abstract get builder(): Builder;\n\n  /**\n   * Shallow copy of provided graph.\n   */\n  abstract copy(graph?: Partial<Graph.Graph<Node, Edge>>): Model;\n\n  /**\n   * Execute a mutation on the graph.\n   * If a change function is set, wraps the mutation in it.\n   */\n  protected _mutate(fn: (graph: Graph.Graph<Node, Edge>) => void): void {\n    if (this._change != null) {\n      this._change(() => fn(this._graph));\n    } else {\n      fn(this._graph);\n    }\n  }\n\n  clear(): this {\n    this._mutate((graph) => {\n      graph.nodes.length = 0;\n      graph.edges.length = 0;\n    });\n    return this;\n  }\n\n  addGraph(graph: Model): this {\n    this.addNodes(graph.nodes);\n    this.addEdges(graph.edges);\n    return this;\n  }\n\n  addGraphs(graphs: Model[]): this {\n    graphs.forEach((graph) => {\n      this.addNodes(graph.nodes);\n      this.addEdges(graph.edges);\n    });\n    return this;\n  }\n\n  addNode(node: Node): Node {\n    invariant(node.id, 'ID is required');\n    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n    this._mutate((graph) => {\n      graph.nodes.push(node);\n    });\n    return node;\n  }\n\n  addNodes(nodes: Node[]): Node[] {\n    return nodes.map((node) => this.addNode(node));\n  }\n\n  addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n    invariant(edge.source);\n    invariant(edge.target);\n    if (!edge.id) {\n      // TODO(burdon): Generate random id.\n      edge = { id: Graph.createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    this._mutate((graph) => {\n      graph.edges.push(edge as Edge);\n    });\n    return edge as Edge;\n  }\n\n  addEdges(edges: Edge[]): Edge[] {\n    return edges.map((edge) => this.addEdge(edge));\n  }\n\n  removeNode(id: string): Model {\n    let removedEdges: Edge[] = [];\n    let removedNodes: Node[] = [];\n    this._mutate((graph) => {\n      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n      removedNodes = removeBy<Node>(graph.nodes as Node[], (node) => node.id === id);\n    });\n    return this.copy({ nodes: removedNodes, edges: removedEdges });\n  }\n\n  removeNodes(ids: string[]): Model {\n    const graphs = ids.map((id) => this.removeNode(id));\n    return this.copy().addGraphs(graphs);\n  }\n\n  removeEdge(id: string): Model {\n    let removedEdges: Edge[] = [];\n    this._mutate((graph) => {\n      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.id === id);\n    });\n    return this.copy({ nodes: [], edges: removedEdges });\n  }\n\n  removeEdges(ids: string[]): Model {\n    const graphs = ids.map((id) => this.removeEdge(id));\n    return this.copy().addGraphs(graphs);\n  }\n}\n\n/**\n * Chainable builder wrapper\n */\nexport abstract class AbstractBuilder<\n  Node extends Graph.Node.Any,\n  Edge extends Graph.Edge.Any,\n  Model extends GraphModel<Node, Edge>,\n> {\n  constructor(protected readonly _model: Model) {}\n\n  get model(): Model {\n    return this._model;\n  }\n\n  call(cb: (builder: this) => void): this {\n    cb(this);\n    return this;\n  }\n\n  getNode(id: string): Node {\n    return this.model.getNode(id);\n  }\n\n  addNode(node: Node): this {\n    this._model.addNode(node);\n    return this;\n  }\n\n  addEdge(edge: MakeOptional<Edge, 'id'>): this {\n    this._model.addEdge(edge);\n    return this;\n  }\n\n  addNodes(nodes: Node[]): this {\n    this._model.addNodes(nodes);\n    return this;\n  }\n\n  addEdges(edges: Edge[]): this {\n    this._model.addEdges(edges);\n    return this;\n  }\n}\n\n/**\n * Basic model.\n */\nexport class GraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, Builder<Node, Edge>> {\n  override get builder() {\n    return new Builder<Node, Edge>(this);\n  }\n\n  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): GraphModel<Node, Edge> {\n    return new GraphModel<Node, Edge>(graph as Graph.Graph<Node, Edge>);\n  }\n}\n\nexport type Subscription = <Node extends Graph.Node.Any = Graph.Node.Any, Edge extends Graph.Edge.Any = Graph.Edge.Any>(\n  model: ReactiveGraphModel<Node, Edge>,\n  graph: Graph.Graph<Node, Edge>,\n) => void;\n\n/**\n * Basic reactive model using Effect Atoms.\n */\n// NOTE: Unlike Preact Signals' `live()` which uses proxies for transparent reactivity,\n// Effect Atom requires explicit `registry.set()` calls. All mutation methods must be\n// overridden to update the atom immutably rather than mutating `_graph` directly.\nexport class ReactiveGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends GraphModel<Node, Edge> {\n  private readonly _graphAtom: Atom.Writable<Graph.Graph<Node, Edge>>;\n\n  constructor(\n    private readonly _registry: Registry.Registry,\n    graph?: Partial<Graph.Graph<Node, Edge>>,\n  ) {\n    const initialGraph: Graph.Graph<Node, Edge> = {\n      nodes: (graph?.nodes ?? []) as Node[],\n      edges: (graph?.edges ?? []) as Edge[],\n    };\n    super(initialGraph);\n    this._graphAtom = Atom.make<Graph.Graph<Node, Edge>>(initialGraph);\n  }\n\n  get registry(): Registry.Registry {\n    return this._registry;\n  }\n\n  /**\n   * Get the graph atom for reactive subscriptions.\n   */\n  get graphAtom(): Atom.Writable<Graph.Graph<Node, Edge>> {\n    return this._graphAtom;\n  }\n\n  override get graph(): Graph.Graph<Node, Edge> {\n    return this._registry.get(this._graphAtom);\n  }\n\n  override get nodes(): Node[] {\n    return this.graph.nodes;\n  }\n\n  override get edges(): Edge[] {\n    return this.graph.edges;\n  }\n\n  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): ReactiveGraphModel<Node, Edge> {\n    return new ReactiveGraphModel<Node, Edge>(this._registry, graph);\n  }\n\n  override clear(): this {\n    this._registry.set(this._graphAtom, {\n      nodes: [],\n      edges: [],\n    });\n    return this;\n  }\n\n  /**\n   * Set the entire graph at once, triggering a single notification.\n   */\n  setGraph(graph: Graph.Graph<Node, Edge>): this {\n    this._registry.set(this._graphAtom, graph);\n    return this;\n  }\n\n  override addNode(node: Node): Node {\n    invariant(node.id, 'ID is required');\n    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n    const current = this._registry.get(this._graphAtom);\n    this._registry.set(this._graphAtom, {\n      ...current,\n      nodes: [...current.nodes, node],\n    });\n    return node;\n  }\n\n  override addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n    invariant(edge.source);\n    invariant(edge.target);\n    if (!edge.id) {\n      edge = { id: Graph.createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    const current = this._registry.get(this._graphAtom);\n    this._registry.set(this._graphAtom, {\n      ...current,\n      edges: [...current.edges, edge as Edge],\n    });\n    return edge as Edge;\n  }\n\n  override removeNode(id: string): ReactiveGraphModel<Node, Edge> {\n    const current = this._registry.get(this._graphAtom);\n    const removedEdges = current.edges.filter((edge) => edge.source === id || edge.target === id);\n    const removedNodes = current.nodes.filter((node) => node.id === id);\n\n    this._registry.set(this._graphAtom, {\n      nodes: current.nodes.filter((node) => node.id !== id),\n      edges: current.edges.filter((edge) => edge.source !== id && edge.target !== id),\n    });\n\n    return this.copy({ nodes: removedNodes, edges: removedEdges });\n  }\n\n  override removeEdge(id: string): ReactiveGraphModel<Node, Edge> {\n    const current = this._registry.get(this._graphAtom);\n    const removedEdges = current.edges.filter((edge) => edge.id === id);\n\n    this._registry.set(this._graphAtom, {\n      ...current,\n      edges: current.edges.filter((edge) => edge.id !== id),\n    });\n\n    return this.copy({ nodes: [], edges: removedEdges });\n  }\n\n  /**\n   * Subscribe to graph changes.\n   */\n  subscribe(cb: Subscription, fire = false): () => void {\n    if (fire) {\n      cb(this, this.graph);\n    }\n\n    // Prime the atom by reading before subscribing to avoid double-fire on first mutation.\n    this._registry.get(this._graphAtom);\n\n    return this._registry.subscribe(this._graphAtom, () => {\n      cb(this, this.graph);\n    });\n  }\n}\n\n/**\n * Basic builder.\n */\nexport class Builder<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractBuilder<Node, Edge, GraphModel<Node, Edge>> {\n  override call(cb: (builder: this) => void): this {\n    cb(this);\n    return this;\n  }\n}\n"],
-  "mappings": ";;;;;;;AAIA,SAASA,MAAMC,gBAAgB;AAE/B,SAASC,iBAAiB;;AAKnB,IAAMC,iBAAN,MAAMA;;EACMC;EACAC;EAEjB,YAA6BC,gBAAyB,OAAO;SAAhCA,gBAAAA;AAC3B,SAAKF,YAAYH,SAASM,KAAI;AAC9B,SAAKF,YAAYL,KAAKO,KAAkB,oBAAIC,IAAAA,CAAAA;EAC9C;;;;EAKA,IAAIC,WAAmC;AACrC,WAAO,KAAKJ;EACd;;;;EAKAK,cAA2B;AACzB,WAAO,KAAKN,UAAUO,IAAI,KAAKN,SAAS;EAC1C;;;;EAKAO,iBAA2B;AACzB,WAAOC,MAAMC,KAAK,KAAKV,UAAUO,IAAI,KAAKN,SAAS,EAAEU,OAAM,CAAA;EAC7D;;;;EAKAC,UAAUC,IAAiD;AAEzD,SAAKb,UAAUO,IAAI,KAAKN,SAAS;AAEjC,WAAO,KAAKD,UAAUY,UAAU,KAAKX,WAAW,MAAA;AAC9CY,SAAG,KAAKb,UAAUO,IAAI,KAAKN,SAAS,CAAA;IACtC,CAAA;EACF;EAEAa,SAAiC;AAC/B,WAAO;MACLT,UAAU,KAAKG,eAAc;IAC/B;EACF;;;;EAKAO,UAAkB;AAChB,WAAO,KAAKf,UAAUO,IAAI,KAAKN,SAAS,EAAEe;EAC5C;EAEAC,SAASC,IAAqB;AAC5B,WAAO,KAAKlB,UAAUO,IAAI,KAAKN,SAAS,EAAEkB,IAAID,EAAAA;EAChD;EAEAE,QAAc;AACZ,SAAKpB,UAAUqB,IAAI,KAAKpB,WAAW,oBAAIG,IAAAA,CAAAA;EACzC;EAEAkB,IAAIJ,IAAkB;AACpBpB,cAAUoB,IAAAA,QAAAA;;;;;;;;;AACV,UAAMK,UAAU,KAAKvB,UAAUO,IAAI,KAAKN,SAAS;AACjD,SAAKD,UAAUqB,IACb,KAAKpB,WACL,IAAIG,IAAY,KAAKF,gBAAgB;MAACgB;QAAM;SAAIT,MAAMC,KAAKa,QAAQZ,OAAM,CAAA;MAAKO;KAAG,CAAA;EAErF;EAEAM,OAAON,IAAkB;AACvBpB,cAAUoB,IAAAA,QAAAA;;;;;;;;;AACV,UAAMK,UAAU,KAAKvB,UAAUO,IAAI,KAAKN,SAAS;AACjD,SAAKD,UAAUqB,IAAI,KAAKpB,WAAW,IAAIG,IAAYK,MAAMC,KAAKa,QAAQZ,OAAM,CAAA,EAAIc,OAAO,CAACC,QAAQA,QAAQR,EAAAA,CAAAA,CAAAA;EAC1G;;EAIAS,YAAYC,KAAeC,WAAW,OAAa;AACjD,UAAMN,UAAU,KAAKvB,UAAUO,IAAI,KAAKN,SAAS;AACjD,SAAKD,UAAUqB,IAAI,KAAKpB,WAAW,oBAAIG,IAAI;SAAKyB,WAAWpB,MAAMC,KAAKa,QAAQZ,OAAM,CAAA,IAAM,CAAA;SAAQiB;KAAI,CAAA;EACxG;EAEAE,eAAeF,KAAeC,WAAW,OAAa;AACpD,UAAMN,UAAU,KAAKvB,UAAUO,IAAI,KAAKN,SAAS;AACjD,UAAMoB,MAAM,IAAIjB,IAAYyB,WAAWpB,MAAMC,KAAKa,QAAQZ,OAAM,CAAA,IAAMoB,MAAAA;AACtEH,QAAII,QAAQ,CAACd,OAAAA;AACX,UAAIK,QAAQJ,IAAID,EAAAA,GAAK;AACnBG,YAAIY,OAAOf,EAAAA;MACb,OAAO;AACLG,YAAIC,IAAIJ,EAAAA;MACV;IACF,CAAA;AAEA,SAAKlB,UAAUqB,IAAI,KAAKpB,WAAWoB,GAAAA;EACrC;AACF;;;AC7GA;;;;;;;;AAIA,YAAYa,YAAY;AAExB,SAASC,aAAAA,kBAAiB;;AAOnB,IAAMC,OAAcC,cAAO;EAChCC,IAAWC;EACXC,MAAaC,gBAAgBF,aAAM;EACnCG,MAAaD,gBAAgBE,UAAG;AAClC,CAAA;AAaO,IAAMC,OAAcP,cAAO;EAChCC,IAAWC;EACXC,MAAaC,gBAAgBF,aAAM;EACnCM,QAAeN;EACfO,QAAeP;EACfG,MAAaD,gBAAgBE,UAAG;AAClC,CAAA;AASA,IAAMI,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEH,QAAQC,QAAQG,SAAQ,MAAY;AACjEd,EAAAA,WAAUU,OAAOK,MAAMH,SAAAA,GAAY,mBAAmBF,MAAAA,IAAQ;;;;;;;;;AAC9DV,EAAAA,WAAUW,OAAOI,MAAMH,SAAAA,GAAY,mBAAmBD,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQI;IAAUH;IAAQK,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACd,OAAAA;AAC1B,QAAM,CAACO,QAAQI,UAAUH,MAAAA,IAAUR,GAAGe,MAAM,GAAA;AAC5ClB,EAAAA,WAAUU,OAAOS,UAAUR,OAAOQ,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAET;IAAQI,UAAUA,SAASK,SAASL,WAAWM;IAAWT;EAAO;AAC5E;AAMO,IAAMU,QAAenB,cAAO;EACjCC,IAAWG,gBAAgBF,aAAM;EACjCkB,OAAcC,eAAeC,aAAMvB,IAAAA,CAAAA;EACnCwB,OAAcF,eAAeC,aAAMf,IAAAA,CAAAA;AACrC,CAAA;;;ACtEA;;;;;;;;;AAIA,SAASiB,QAAAA,aAA2B;AAEpC,SAASC,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAA4BC,UAAUC,gBAAgB;;AAY/C,IAAMC,qBAAN,MAAMA;EAIQC;;;;;EAKAC;;;;;;EAOnB,YAAYC,OAAiCC,QAA8B;AACzE,SAAKH,SAASE,SAAS;MACrBE,OAAO,CAAA;MACPC,OAAO,CAAA;IACT;AACA,SAAKJ,UAAUE;EACjB;EAEA,CAACG,aAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;EAKAA,SAAS;AACP,WAAO;MACLH,OAAO,KAAKA,MAAMI;MAClBH,OAAO,KAAKA,MAAMG;IACpB;EACF;EAEA,IAAIN,QAAiC;AACnC,WAAO,KAAKF;EACd;EAEA,IAAII,QAAgB;AAClB,WAAO,KAAKJ,OAAOI;EACrB;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKL,OAAOK;EACrB;;;;EAMAI,SAASC,IAA8B;AACrC,WAAO,KAAKN,MAAMO,KAAK,CAACC,SAASA,KAAKF,OAAOA,EAAAA;EAC/C;EAEAG,QAAQH,IAAkB;AACxB,WAAO,KAAKD,SAASC,EAAAA,KAAOI,gBAAAA;EAC9B;EAEAC,YAAY,EAAEC,KAAI,IAA8B,CAAC,GAAW;AAC1D,WAAO,KAAKZ,MAAMa,OAAO,CAACL,SAAS,CAACI,QAAQA,SAASJ,KAAKI,IAAI;EAChE;;;;EAMAE,SAASR,IAA8B;AACrC,WAAO,KAAKL,MAAMM,KAAK,CAACQ,SAASA,KAAKT,OAAOA,EAAAA;EAC/C;EAEAU,QAAQV,IAAkB;AACxB,WAAO,KAAKQ,SAASR,EAAAA,KAAOI,gBAAAA;EAC9B;EAEAO,YAAY,EAAEL,MAAMM,QAAQC,OAAM,IAA8B,CAAC,GAAW;AAC1E,WAAO,KAAKlB,MAAMY,OAChB,CAACE,UACE,CAACH,QAAQA,SAASG,KAAKH,UAAU,CAACM,UAAUA,WAAWH,KAAKG,YAAY,CAACC,UAAUA,WAAWJ,KAAKI,OAAK;EAE/G;;;;EAMAC,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAKf,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEAiB,YAAQG,IAAIL,KAAKf,EAAE;AACnB,UAAMqB,UAAU,KAAKV,YAAY;MAAEC,QAAQG,KAAKf;IAAG,CAAA,EAChDsB,IAAI,CAACb,SAAS,KAAKN,QAAQM,KAAKI,MAAM,CAAA,EACtCN,OAAOgB,QAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAACX,WAAW,KAAKG,UAAUH,QAAQI,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKGpC,mBAAAA;;;;;EAeEqC,QAAQC,IAAoD;AACpE,QAAI,KAAKpC,WAAW,MAAM;AACxB,WAAKA,QAAQ,MAAMoC,GAAG,KAAKrC,MAAM,CAAA;IACnC,OAAO;AACLqC,SAAG,KAAKrC,MAAM;IAChB;EACF;EAEAsC,QAAc;AACZ,SAAKF,QAAQ,CAAClC,UAAAA;AACZA,YAAME,MAAMI,SAAS;AACrBN,YAAMG,MAAMG,SAAS;IACvB,CAAA;AACA,WAAO;EACT;EAEA+B,SAASrC,OAAoB;AAC3B,SAAKsC,SAAStC,MAAME,KAAK;AACzB,SAAKqC,SAASvC,MAAMG,KAAK;AACzB,WAAO;EACT;EAEAqC,UAAUC,QAAuB;AAC/BA,WAAOC,QAAQ,CAAC1C,UAAAA;AACd,WAAKsC,SAAStC,MAAME,KAAK;AACzB,WAAKqC,SAASvC,MAAMG,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAwC,QAAQjC,MAAkB;AACxBkC,IAAAA,WAAUlC,KAAKF,IAAI,kBAAA;;;;;;;;;AACnBoC,IAAAA,WAAU,CAAC,KAAKrC,SAASG,KAAKF,EAAE,GAAG,wBAAwBE,KAAKF,EAAE,IAAE;;;;;;;;;AACpE,SAAK0B,QAAQ,CAAClC,UAAAA;AACZA,YAAME,MAAM2C,KAAKnC,IAAAA;IACnB,CAAA;AACA,WAAOA;EACT;EAEA4B,SAASpC,OAAuB;AAC9B,WAAOA,MAAM4B,IAAI,CAACpB,SAAS,KAAKiC,QAAQjC,IAAAA,CAAAA;EAC1C;EAEAoC,QAAQ7B,MAAsC;AAC5C2B,IAAAA,WAAU3B,KAAKG,QAAM,QAAA;;;;;;;;;AACrBwB,IAAAA,WAAU3B,KAAKI,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAACJ,KAAKT,IAAI;AAEZS,aAAO;QAAET,IAAUuC,aAAa9B,IAAAA;QAAO,GAAGA;MAAK;IACjD;AACA2B,IAAAA,WAAU,CAAC,KAAKrC,SAASU,KAAKT,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAK0B,QAAQ,CAAClC,UAAAA;AACZA,YAAMG,MAAM0C,KAAK5B,IAAAA;IACnB,CAAA;AACA,WAAOA;EACT;EAEAsB,SAASpC,OAAuB;AAC9B,WAAOA,MAAM2B,IAAI,CAACb,SAAS,KAAK6B,QAAQ7B,IAAAA,CAAAA;EAC1C;EAEA+B,WAAWxC,IAAmB;AAC5B,QAAIyC,eAAuB,CAAA;AAC3B,QAAIC,eAAuB,CAAA;AAC3B,SAAKhB,QAAQ,CAAClC,UAAAA;AACZiD,qBAAeE,SAAenD,MAAMG,OAAiB,CAACc,SAASA,KAAKG,WAAWZ,MAAMS,KAAKI,WAAWb,EAAAA;AACrG0C,qBAAeC,SAAenD,MAAME,OAAiB,CAACQ,SAASA,KAAKF,OAAOA,EAAAA;IAC7E,CAAA;AACA,WAAO,KAAK4C,KAAK;MAAElD,OAAOgD;MAAc/C,OAAO8C;IAAa,CAAA;EAC9D;EAEAI,YAAYC,KAAsB;AAChC,UAAMb,SAASa,IAAIxB,IAAI,CAACtB,OAAO,KAAKwC,WAAWxC,EAAAA,CAAAA;AAC/C,WAAO,KAAK4C,KAAI,EAAGZ,UAAUC,MAAAA;EAC/B;EAEAc,WAAW/C,IAAmB;AAC5B,QAAIyC,eAAuB,CAAA;AAC3B,SAAKf,QAAQ,CAAClC,UAAAA;AACZiD,qBAAeE,SAAenD,MAAMG,OAAiB,CAACc,SAASA,KAAKT,OAAOA,EAAAA;IAC7E,CAAA;AACA,WAAO,KAAK4C,KAAK;MAAElD,OAAO,CAAA;MAAIC,OAAO8C;IAAa,CAAA;EACpD;EAEAO,YAAYF,KAAsB;AAChC,UAAMb,SAASa,IAAIxB,IAAI,CAACtB,OAAO,KAAK+C,WAAW/C,EAAAA,CAAAA;AAC/C,WAAO,KAAK4C,KAAI,EAAGZ,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAegB,kBAAf,MAAeA;;EAKpB,YAA+BC,QAAe;SAAfA,SAAAA;EAAgB;EAE/C,IAAIC,QAAe;AACjB,WAAO,KAAKD;EACd;EAEAE,KAAKC,IAAmC;AACtCA,OAAG,IAAI;AACP,WAAO;EACT;EAEAlD,QAAQH,IAAkB;AACxB,WAAO,KAAKmD,MAAMhD,QAAQH,EAAAA;EAC5B;EAEAmC,QAAQjC,MAAkB;AACxB,SAAKgD,OAAOf,QAAQjC,IAAAA;AACpB,WAAO;EACT;EAEAoC,QAAQ7B,MAAsC;AAC5C,SAAKyC,OAAOZ,QAAQ7B,IAAAA;AACpB,WAAO;EACT;EAEAqB,SAASpC,OAAqB;AAC5B,SAAKwD,OAAOpB,SAASpC,KAAAA;AACrB,WAAO;EACT;EAEAqC,SAASpC,OAAqB;AAC5B,SAAKuD,OAAOnB,SAASpC,KAAAA;AACrB,WAAO;EACT;AACF;AAKO,IAAM2D,aAAN,MAAMA,oBAGH7B,mBAAAA;EACR,IAAa8B,UAAU;AACrB,WAAO,IAAIC,QAAoB,IAAI;EACrC;EAESZ,KAAKpD,OAAkE;AAC9E,WAAO,IAAI8D,YAAuB9D,KAAAA;EACpC;AACF;AAaO,IAAMiE,qBAAN,MAAMA,4BAGHH,WAAAA;;EACSI;EAEjB,YACmBC,WACjBnE,OACA;AACA,UAAMoE,eAAwC;MAC5ClE,OAAQF,OAAOE,SAAS,CAAA;MACxBC,OAAQH,OAAOG,SAAS,CAAA;IAC1B;AACA,UAAMiE,YAAAA,GAAAA,KAPWD,YAAAA;AAQjB,SAAKD,aAAaG,MAAKC,KAA8BF,YAAAA;EACvD;EAEA,IAAIG,WAA8B;AAChC,WAAO,KAAKJ;EACd;;;;EAKA,IAAIK,YAAoD;AACtD,WAAO,KAAKN;EACd;EAEA,IAAalE,QAAiC;AAC5C,WAAO,KAAKmE,UAAUM,IAAI,KAAKP,UAAU;EAC3C;EAEA,IAAahE,QAAgB;AAC3B,WAAO,KAAKF,MAAME;EACpB;EAEA,IAAaC,QAAgB;AAC3B,WAAO,KAAKH,MAAMG;EACpB;EAESiD,KAAKpD,OAA0E;AACtF,WAAO,IAAIiE,oBAA+B,KAAKE,WAAWnE,KAAAA;EAC5D;EAESoC,QAAc;AACrB,SAAK+B,UAAUO,IAAI,KAAKR,YAAY;MAClChE,OAAO,CAAA;MACPC,OAAO,CAAA;IACT,CAAA;AACA,WAAO;EACT;;;;EAKAwE,SAAS3E,OAAsC;AAC7C,SAAKmE,UAAUO,IAAI,KAAKR,YAAYlE,KAAAA;AACpC,WAAO;EACT;EAES2C,QAAQjC,MAAkB;AACjCkC,IAAAA,WAAUlC,KAAKF,IAAI,kBAAA;;;;;;;;;AACnBoC,IAAAA,WAAU,CAAC,KAAKrC,SAASG,KAAKF,EAAE,GAAG,wBAAwBE,KAAKF,EAAE,IAAE;;;;;;;;;AACpE,UAAMoE,UAAU,KAAKT,UAAUM,IAAI,KAAKP,UAAU;AAClD,SAAKC,UAAUO,IAAI,KAAKR,YAAY;MAClC,GAAGU;MACH1E,OAAO;WAAI0E,QAAQ1E;QAAOQ;;IAC5B,CAAA;AACA,WAAOA;EACT;EAESoC,QAAQ7B,MAAsC;AACrD2B,IAAAA,WAAU3B,KAAKG,QAAM,QAAA;;;;;;;;;AACrBwB,IAAAA,WAAU3B,KAAKI,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAACJ,KAAKT,IAAI;AACZS,aAAO;QAAET,IAAUuC,aAAa9B,IAAAA;QAAO,GAAGA;MAAK;IACjD;AACA2B,IAAAA,WAAU,CAAC,KAAKrC,SAASU,KAAKT,EAAE,GAAA,QAAA;;;;;;;;;AAChC,UAAMoE,UAAU,KAAKT,UAAUM,IAAI,KAAKP,UAAU;AAClD,SAAKC,UAAUO,IAAI,KAAKR,YAAY;MAClC,GAAGU;MACHzE,OAAO;WAAIyE,QAAQzE;QAAOc;;IAC5B,CAAA;AACA,WAAOA;EACT;EAES+B,WAAWxC,IAA4C;AAC9D,UAAMoE,UAAU,KAAKT,UAAUM,IAAI,KAAKP,UAAU;AAClD,UAAMjB,eAAe2B,QAAQzE,MAAMY,OAAO,CAACE,SAASA,KAAKG,WAAWZ,MAAMS,KAAKI,WAAWb,EAAAA;AAC1F,UAAM0C,eAAe0B,QAAQ1E,MAAMa,OAAO,CAACL,SAASA,KAAKF,OAAOA,EAAAA;AAEhE,SAAK2D,UAAUO,IAAI,KAAKR,YAAY;MAClChE,OAAO0E,QAAQ1E,MAAMa,OAAO,CAACL,SAASA,KAAKF,OAAOA,EAAAA;MAClDL,OAAOyE,QAAQzE,MAAMY,OAAO,CAACE,SAASA,KAAKG,WAAWZ,MAAMS,KAAKI,WAAWb,EAAAA;IAC9E,CAAA;AAEA,WAAO,KAAK4C,KAAK;MAAElD,OAAOgD;MAAc/C,OAAO8C;IAAa,CAAA;EAC9D;EAESM,WAAW/C,IAA4C;AAC9D,UAAMoE,UAAU,KAAKT,UAAUM,IAAI,KAAKP,UAAU;AAClD,UAAMjB,eAAe2B,QAAQzE,MAAMY,OAAO,CAACE,SAASA,KAAKT,OAAOA,EAAAA;AAEhE,SAAK2D,UAAUO,IAAI,KAAKR,YAAY;MAClC,GAAGU;MACHzE,OAAOyE,QAAQzE,MAAMY,OAAO,CAACE,SAASA,KAAKT,OAAOA,EAAAA;IACpD,CAAA;AAEA,WAAO,KAAK4C,KAAK;MAAElD,OAAO,CAAA;MAAIC,OAAO8C;IAAa,CAAA;EACpD;;;;EAKA4B,UAAUhB,IAAkBiB,OAAO,OAAmB;AACpD,QAAIA,MAAM;AACRjB,SAAG,MAAM,KAAK7D,KAAK;IACrB;AAGA,SAAKmE,UAAUM,IAAI,KAAKP,UAAU;AAElC,WAAO,KAAKC,UAAUU,UAAU,KAAKX,YAAY,MAAA;AAC/CL,SAAG,MAAM,KAAK7D,KAAK;IACrB,CAAA;EACF;AACF;AAKO,IAAMgE,UAAN,cAGGP,gBAAAA;EACCG,KAAKC,IAAmC;AAC/CA,OAAG,IAAI;AACP,WAAO;EACT;AACF;",
-  "names": ["Atom", "Registry", "invariant", "SelectionModel", "_registry", "_selected", "_singleSelect", "make", "Set", "selected", "getSelected", "get", "getSelectedIds", "Array", "from", "values", "subscribe", "cb", "toJSON", "getSize", "size", "contains", "id", "has", "clear", "set", "add", "current", "remove", "filter", "_id", "setSelected", "ids", "subtract", "toggleSelected", "undefined", "forEach", "delete", "Schema", "invariant", "Node", "Struct", "id", "String", "type", "optional", "data", "Any", "Edge", "source", "target", "KEY_REGEX", "createEdgeId", "relation", "match", "join", "parseEdgeId", "split", "length", "undefined", "Graph", "nodes", "mutable", "Array", "edges", "Atom", "inspectCustom", "failedInvariant", "invariant", "isTruthy", "removeBy", "ReadonlyGraphModel", "_graph", "_change", "graph", "change", "nodes", "edges", "inspectCustom", "toJSON", "length", "findNode", "id", "find", "node", "getNode", "failedInvariant", "filterNodes", "type", "filter", "findEdge", "edge", "getEdge", "filterEdges", "source", "target", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isTruthy", "flatMap", "AbstractGraphModel", "_mutate", "fn", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "invariant", "push", "addEdge", "createEdgeId", "removeNode", "removedEdges", "removedNodes", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractBuilder", "_model", "model", "call", "cb", "GraphModel", "builder", "Builder", "ReactiveGraphModel", "_graphAtom", "_registry", "initialGraph", "Atom", "make", "registry", "graphAtom", "get", "set", "setGraph", "current", "subscribe", "fire"]
+  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\n\nimport { invariant } from '@dxos/invariant';\n\n/**\n * Reactive selection model.\n */\nexport class SelectionModel {\n  private readonly _registry: Registry.Registry;\n  private readonly _selected: Atom.Writable<Set<string>>;\n\n  constructor(private readonly _singleSelect: boolean = false) {\n    this._registry = Registry.make();\n    this._selected = Atom.make<Set<string>>(new Set<string>());\n  }\n\n  /**\n   * Returns the selected IDs atom for subscription.\n   */\n  get selected(): Atom.Atom<Set<string>> {\n    return this._selected;\n  }\n\n  /**\n   * Gets the current selected IDs as a Set.\n   */\n  getSelected(): Set<string> {\n    return this._registry.get(this._selected);\n  }\n\n  /**\n   * Gets the current selected IDs as an array.\n   */\n  getSelectedIds(): string[] {\n    return Array.from(this._registry.get(this._selected).values());\n  }\n\n  /**\n   * Subscribe to selection changes.\n   */\n  subscribe(cb: (selected: Set<string>) => void): () => void {\n    // Prime the atom by reading before subscribing.\n    this._registry.get(this._selected);\n\n    return this._registry.subscribe(this._selected, () => {\n      cb(this._registry.get(this._selected));\n    });\n  }\n\n  toJSON(): { selected: string[] } {\n    return {\n      selected: this.getSelectedIds(),\n    };\n  }\n\n  /**\n   * Gets the current selection size.\n   */\n  getSize(): number {\n    return this._registry.get(this._selected).size;\n  }\n\n  contains(id: string): boolean {\n    return this._registry.get(this._selected).has(id);\n  }\n\n  clear(): void {\n    this._registry.set(this._selected, new Set());\n  }\n\n  add(id: string): void {\n    invariant(id);\n    const current = this._registry.get(this._selected);\n    this._registry.set(\n      this._selected,\n      new Set<string>(this._singleSelect ? [id] : [...Array.from(current.values()), id]),\n    );\n  }\n\n  remove(id: string): void {\n    invariant(id);\n    const current = this._registry.get(this._selected);\n    this._registry.set(this._selected, new Set<string>(Array.from(current.values()).filter((_id) => _id !== id)));\n  }\n\n  // TODO(burdon): Handle single select.\n\n  setSelected(ids: string[], subtract = false): void {\n    const current = this._registry.get(this._selected);\n    this._registry.set(this._selected, new Set([...(subtract ? Array.from(current.values()) : []), ...ids]));\n  }\n\n  toggleSelected(ids: string[], subtract = false): void {\n    const current = this._registry.get(this._selected);\n    const set = new Set<string>(subtract ? Array.from(current.values()) : undefined);\n    ids.forEach((id) => {\n      if (current.has(id)) {\n        set.delete(id);\n      } else {\n        set.add(id);\n      }\n    });\n\n    this._registry.set(this._selected, set);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\n// @import-as-namespace\n\nimport * as Schema from 'effect/Schema';\n\nimport { invariant } from '@dxos/invariant';\nimport { type Specialize } from '@dxos/util';\n\n//\n// Node\n//\n\nexport const Node = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  data: Schema.optional(Schema.Any),\n});\n\ninterface BaseNode extends Schema.Schema.Type<typeof Node> {}\n\nexport declare namespace Node {\n  export type Any = Specialize<BaseNode, { data?: any }>;\n  export type Node<Data = any> = Specialize<BaseNode, { data: Data }>;\n}\n\n//\n// Edge\n//\n\nexport const Edge = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  source: Schema.String,\n  target: Schema.String,\n  data: Schema.optional(Schema.Any),\n});\n\ninterface BaseEdge extends Schema.Schema.Type<typeof Edge> {}\n\nexport declare namespace Edge {\n  export type Any = Specialize<BaseEdge, { data?: any }>;\n  export type Edge<Data = any> = Specialize<BaseEdge, { data: Data }>;\n}\n\nconst KEY_REGEX = /\\w+/;\n\n// NOTE: The `relation` is different from the `type`.\ntype EdgeMeta = { source: string; target: string; relation?: string };\n\nexport const createEdgeId = ({ source, target, relation }: EdgeMeta) => {\n  invariant(source.match(KEY_REGEX), `invalid source: ${source}`);\n  invariant(target.match(KEY_REGEX), `invalid target: ${target}`);\n  return [source, relation, target].join('_');\n};\n\nexport const parseEdgeId = (id: string): EdgeMeta => {\n  const [source, relation, target] = id.split('_');\n  invariant(source.length && target.length);\n  return { source, relation: relation.length ? relation : undefined, target };\n};\n\n//\n// Graph\n//\n\nexport const Graph = Schema.Struct({\n  id: Schema.optional(Schema.String),\n  nodes: Schema.mutable(Schema.Array(Node)),\n  edges: Schema.mutable(Schema.Array(Edge)),\n});\n\nexport interface Any extends Schema.Schema.Type<typeof Graph> {}\n\nexport type Graph<Node extends Node.Any, Edge extends Edge.Any> = Specialize<\n  Any,\n  {\n    nodes: Node[];\n    edges: Edge[];\n  }\n>;\n", "//\n// Copyright 2024 DXOS.org\n//\n\n// @import-as-namespace\n\nimport { Atom, type Registry } from '@effect-atom/atom-react';\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { type MakeOptional, isTruthy, removeBy } from '@dxos/util';\n\nimport * as Graph from './Graph';\n\n/**\n * Optional function to wrap mutations (e.g., for ECHO objects that require Obj.update).\n */\nexport type GraphChangeFunction = (fn: () => void) => void;\n\n/**\n * Readonly Graph wrapper.\n */\nexport class ReadonlyGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> {\n  protected readonly _graph: Graph.Graph<Node, Edge>;\n  /**\n   * Optional function to wrap mutations.\n   * When set, all graph mutations are wrapped in this function.\n   */\n  protected readonly _change?: GraphChangeFunction;\n\n  /**\n   * NOTE: Pass in simple Graph or Live.\n   * @param graph - The graph data.\n   * @param change - Optional function to wrap mutations (e.g., Obj.update for ECHO objects).\n   */\n  constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction) {\n    this._graph = graph ?? {\n      nodes: [],\n      edges: [],\n    };\n    this._change = change;\n  }\n\n  [inspectCustom]() {\n    return this.toJSON();\n  }\n\n  /**\n   * Return stable sorted JSON representation of graph.\n   */\n  toJSON() {\n    return {\n      nodes: this.nodes.length,\n      edges: this.edges.length,\n    };\n  }\n\n  get graph(): Graph.Graph<Node, Edge> {\n    return this._graph;\n  }\n\n  get nodes(): Node[] {\n    return this._graph.nodes;\n  }\n\n  get edges(): Edge[] {\n    return this._graph.edges;\n  }\n\n  //\n  // Nodes\n  //\n\n  findNode(id: string): Node | undefined {\n    return this.nodes.find((node) => node.id === id);\n  }\n\n  getNode(id: string): Node {\n    return this.findNode(id) ?? failedInvariant();\n  }\n\n  filterNodes({ type }: Partial<Graph.Node.Any> = {}): Node[] {\n    return this.nodes.filter((node) => !type || type === node.type);\n  }\n\n  //\n  // Edges\n  //\n\n  findEdge(id: string): Edge | undefined {\n    return this.edges.find((edge) => edge.id === id);\n  }\n\n  getEdge(id: string): Edge {\n    return this.findEdge(id) ?? failedInvariant();\n  }\n\n  filterEdges({ type, source, target }: Partial<Graph.Edge.Any> = {}): Edge[] {\n    return this.edges.filter(\n      (edge) =>\n        (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),\n    );\n  }\n\n  //\n  // Traverse\n  //\n\n  traverse(root: Node): Node[] {\n    return this._traverse(root);\n  }\n\n  private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {\n    if (visited.has(root.id)) {\n      return [];\n    }\n\n    visited.add(root.id);\n    const targets = this.filterEdges({ source: root.id })\n      .map((edge) => this.getNode(edge.target))\n      .filter(isTruthy);\n\n    return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n  }\n}\n\n/**\n * Mutable Graph wrapper.\n */\nexport abstract class AbstractGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n  Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,\n  Builder extends AbstractBuilder<Node, Edge, Model> = AbstractBuilder<Node, Edge, Model>,\n> extends ReadonlyGraphModel<Node, Edge> {\n  /**\n   * Allows chaining.\n   */\n  abstract get builder(): Builder;\n\n  /**\n   * Shallow copy of provided graph.\n   */\n  abstract copy(graph?: Partial<Graph.Graph<Node, Edge>>): Model;\n\n  /**\n   * Execute a mutation on the graph.\n   * If a change function is set, wraps the mutation in it.\n   */\n  protected _mutate(fn: (graph: Graph.Graph<Node, Edge>) => void): void {\n    if (this._change != null) {\n      this._change(() => fn(this._graph));\n    } else {\n      fn(this._graph);\n    }\n  }\n\n  clear(): this {\n    this._mutate((graph) => {\n      graph.nodes.length = 0;\n      graph.edges.length = 0;\n    });\n    return this;\n  }\n\n  addGraph(graph: Model): this {\n    this.addNodes(graph.nodes);\n    this.addEdges(graph.edges);\n    return this;\n  }\n\n  addGraphs(graphs: Model[]): this {\n    graphs.forEach((graph) => {\n      this.addNodes(graph.nodes);\n      this.addEdges(graph.edges);\n    });\n    return this;\n  }\n\n  addNode(node: Node): Node {\n    invariant(node.id, 'ID is required');\n    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n    this._mutate((graph) => {\n      graph.nodes.push(node);\n    });\n    return node;\n  }\n\n  addNodes(nodes: Node[]): Node[] {\n    return nodes.map((node) => this.addNode(node));\n  }\n\n  addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n    invariant(edge.source);\n    invariant(edge.target);\n    if (!edge.id) {\n      // TODO(burdon): Generate random id.\n      edge = { id: Graph.createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    this._mutate((graph) => {\n      graph.edges.push(edge as Edge);\n    });\n    return edge as Edge;\n  }\n\n  addEdges(edges: Edge[]): Edge[] {\n    return edges.map((edge) => this.addEdge(edge));\n  }\n\n  removeNode(id: string): Model {\n    let removedEdges: Edge[] = [];\n    let removedNodes: Node[] = [];\n    this._mutate((graph) => {\n      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n      removedNodes = removeBy<Node>(graph.nodes as Node[], (node) => node.id === id);\n    });\n    return this.copy({ nodes: removedNodes, edges: removedEdges });\n  }\n\n  removeNodes(ids: string[]): Model {\n    const graphs = ids.map((id) => this.removeNode(id));\n    return this.copy().addGraphs(graphs);\n  }\n\n  removeEdge(id: string): Model {\n    let removedEdges: Edge[] = [];\n    this._mutate((graph) => {\n      removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.id === id);\n    });\n    return this.copy({ nodes: [], edges: removedEdges });\n  }\n\n  removeEdges(ids: string[]): Model {\n    const graphs = ids.map((id) => this.removeEdge(id));\n    return this.copy().addGraphs(graphs);\n  }\n}\n\n/**\n * Chainable builder wrapper\n */\nexport abstract class AbstractBuilder<\n  Node extends Graph.Node.Any,\n  Edge extends Graph.Edge.Any,\n  Model extends GraphModel<Node, Edge>,\n> {\n  constructor(protected readonly _model: Model) {}\n\n  get model(): Model {\n    return this._model;\n  }\n\n  call(cb: (builder: this) => void): this {\n    cb(this);\n    return this;\n  }\n\n  getNode(id: string): Node {\n    return this.model.getNode(id);\n  }\n\n  addNode(node: Node): this {\n    this._model.addNode(node);\n    return this;\n  }\n\n  addEdge(edge: MakeOptional<Edge, 'id'>): this {\n    this._model.addEdge(edge);\n    return this;\n  }\n\n  addNodes(nodes: Node[]): this {\n    this._model.addNodes(nodes);\n    return this;\n  }\n\n  addEdges(edges: Edge[]): this {\n    this._model.addEdges(edges);\n    return this;\n  }\n}\n\n/**\n * Basic model.\n */\nexport class GraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, Builder<Node, Edge>> {\n  override get builder() {\n    return new Builder<Node, Edge>(this);\n  }\n\n  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): GraphModel<Node, Edge> {\n    return new GraphModel<Node, Edge>(graph as Graph.Graph<Node, Edge>);\n  }\n}\n\nexport type Subscription = <Node extends Graph.Node.Any = Graph.Node.Any, Edge extends Graph.Edge.Any = Graph.Edge.Any>(\n  model: ReactiveGraphModel<Node, Edge>,\n  graph: Graph.Graph<Node, Edge>,\n) => void;\n\n/**\n * Basic reactive model using Effect Atoms.\n */\n// NOTE: Unlike Preact Signals' `live()` which uses proxies for transparent reactivity,\n// Effect Atom requires explicit `registry.set()` calls. All mutation methods must be\n// overridden to update the atom immutably rather than mutating `_graph` directly.\nexport class ReactiveGraphModel<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends GraphModel<Node, Edge> {\n  private readonly _graphAtom: Atom.Writable<Graph.Graph<Node, Edge>>;\n\n  constructor(\n    private readonly _registry: Registry.Registry,\n    graph?: Partial<Graph.Graph<Node, Edge>>,\n  ) {\n    const initialGraph: Graph.Graph<Node, Edge> = {\n      nodes: (graph?.nodes ?? []) as Node[],\n      edges: (graph?.edges ?? []) as Edge[],\n    };\n    super(initialGraph);\n    this._graphAtom = Atom.make<Graph.Graph<Node, Edge>>(initialGraph);\n  }\n\n  get registry(): Registry.Registry {\n    return this._registry;\n  }\n\n  /**\n   * Get the graph atom for reactive subscriptions.\n   */\n  get graphAtom(): Atom.Writable<Graph.Graph<Node, Edge>> {\n    return this._graphAtom;\n  }\n\n  override get graph(): Graph.Graph<Node, Edge> {\n    return this._registry.get(this._graphAtom);\n  }\n\n  override get nodes(): Node[] {\n    return this.graph.nodes;\n  }\n\n  override get edges(): Edge[] {\n    return this.graph.edges;\n  }\n\n  override copy(graph?: Partial<Graph.Graph<Node, Edge>>): ReactiveGraphModel<Node, Edge> {\n    return new ReactiveGraphModel<Node, Edge>(this._registry, graph);\n  }\n\n  override clear(): this {\n    this._registry.set(this._graphAtom, {\n      nodes: [],\n      edges: [],\n    });\n    return this;\n  }\n\n  /**\n   * Set the entire graph at once, triggering a single notification.\n   */\n  setGraph(graph: Graph.Graph<Node, Edge>): this {\n    this._registry.set(this._graphAtom, graph);\n    return this;\n  }\n\n  override addNode(node: Node): Node {\n    invariant(node.id, 'ID is required');\n    invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n    const current = this._registry.get(this._graphAtom);\n    this._registry.set(this._graphAtom, {\n      ...current,\n      nodes: [...current.nodes, node],\n    });\n    return node;\n  }\n\n  override addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n    invariant(edge.source);\n    invariant(edge.target);\n    if (!edge.id) {\n      edge = { id: Graph.createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    const current = this._registry.get(this._graphAtom);\n    this._registry.set(this._graphAtom, {\n      ...current,\n      edges: [...current.edges, edge as Edge],\n    });\n    return edge as Edge;\n  }\n\n  override removeNode(id: string): ReactiveGraphModel<Node, Edge> {\n    const current = this._registry.get(this._graphAtom);\n    const removedEdges = current.edges.filter((edge) => edge.source === id || edge.target === id);\n    const removedNodes = current.nodes.filter((node) => node.id === id);\n\n    this._registry.set(this._graphAtom, {\n      nodes: current.nodes.filter((node) => node.id !== id),\n      edges: current.edges.filter((edge) => edge.source !== id && edge.target !== id),\n    });\n\n    return this.copy({ nodes: removedNodes, edges: removedEdges });\n  }\n\n  override removeEdge(id: string): ReactiveGraphModel<Node, Edge> {\n    const current = this._registry.get(this._graphAtom);\n    const removedEdges = current.edges.filter((edge) => edge.id === id);\n\n    this._registry.set(this._graphAtom, {\n      ...current,\n      edges: current.edges.filter((edge) => edge.id !== id),\n    });\n\n    return this.copy({ nodes: [], edges: removedEdges });\n  }\n\n  /**\n   * Subscribe to graph changes.\n   */\n  subscribe(cb: Subscription, fire = false): () => void {\n    if (fire) {\n      cb(this, this.graph);\n    }\n\n    // Prime the atom by reading before subscribing to avoid double-fire on first mutation.\n    this._registry.get(this._graphAtom);\n\n    return this._registry.subscribe(this._graphAtom, () => {\n      cb(this, this.graph);\n    });\n  }\n}\n\n/**\n * Basic builder.\n */\nexport class Builder<\n  Node extends Graph.Node.Any = Graph.Node.Any,\n  Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractBuilder<Node, Edge, GraphModel<Node, Edge>> {\n  override call(cb: (builder: this) => void): this {\n    cb(this);\n    return this;\n  }\n}\n"],
+  "mappings": ";;;;;;;AAIA,SAASA,MAAMC,gBAAgB;AAE/B,SAASC,iBAAiB;AAE1B,IAAA,eAAA;AAImBC,IAA6B,iBAA7BA,MAA6B;EAC7BC;EAEjB;;cACOD,gBAAYF,OAAa;AAC9B,SAAKG,gBAAYJ;AACnB,SAAA,YAAA,SAAA,KAAA;AAEA,SAAA,YAAA,KAAA,KAAA,oBAAA,IAAA,CAAA;;;;;EAKA,IAAA,WAAA;AAEA,WAAA,KAAA;;;;;EAKA,cAAA;AAEA,WAAA,KAAA,UAAA,IAAA,KAAA,SAAA;;;;;EAKA,iBAAA;AAEA,WAAA,MAAA,KAAA,KAAA,UAAA,IAAA,KAAA,SAAA,EAAA,OAAA,CAAA;;;;;YAKOG,IAAAA;SAGHE,UAAQF,IAAAA,KAAUG,SAASF;AAC7B,WAAA,KAAA,UAAA,UAAA,KAAA,WAAA,MAAA;AACF,SAAA,KAAA,UAAA,IAAA,KAAA,SAAA,CAAA;IAEAG,CAAAA;;WAEIC;AACF,WAAA;MACF,UAAA,KAAA,eAAA;IAEA;;;;;EAKA,UAAA;AAEAC,WAAmB,KAAW,UAAA,IAAA,KAAA,SAAA,EAAA;;EAE9B,SAAA,IAAA;AAEAC,WAAc,KAAA,UAAA,IAAA,KAAA,SAAA,EAAA,IAAA,EAAA;;EAEd,QAAA;AAEIC,SAAkB,UAAA,IAAA,KAAA,WAAA,oBAAA,IAAA,CAAA;;MAEpB,IAAA;AACA,cAAKR,IAAAA,QACH,EAAA,YAAKC,YACW,GAAA,cAAKQ,GAAAA,IAAa,GAAG,MAAA,GAAA,CAAA,MAAA,EAAA,EAAA,CAAA;UAACD,UAAAA,KAAAA,UAAAA,IAAAA,KAAAA,SAAAA;SAAM,UAAA,IAAA,KAAA,WAAA,IAAA,IAAA,KAAA,gBAAA;;QAAkCA;MAAG,GAAA,MAAA,KAAA,QAAA,OAAA,CAAA;MAErF;IAEAE,CAAAA,CAAAA;;SAEE,IAAMC;AACN,cAAKX,IAAAA,QAAc,EAAA,YAAKC,YAA2BW,GAAAA,cAAWD,GAAAA,IAAQE,GAAAA,MAAM,GAAIC,CAAAA,MAAM,EAAEC,EAAAA,CAAAA;AAC1F,UAAA,UAAA,KAAA,UAAA,IAAA,KAAA,SAAA;AAEA,SAAA,UAAA,IAAA,KAAA,WAAsC,IAAA,IAAA,MAAA,KAAA,QAAA,OAAA,CAAA,EAAA,OAAA,CAAA,QAAA,QAAA,EAAA,CAAA,CAAA;EAEtCC;;cAEOhB,KAAAA,WAAmBC,OAAAA;oBAAwBgB,KAAWL,UAAWD,IAAAA,KAAQE,SAAY;mBAAQK,IAAAA,KAAAA,WAAAA,oBAAAA,IAAAA;MAAI,GAAA,WAAA,MAAA,KAAA,QAAA,OAAA,CAAA,IAAA,CAAA;MACxG,GAAA;IAEAC,CAAAA,CAAAA;;iBAEQC,KAAUC,WAAYJ,OAAWL;AACvCM,UAAII,UAASd,KAAAA,UAAAA,IAAAA,KAAAA,SAAAA;UACX,MAAIG,IAAQY,IAAIf,WAAK,MAAA,KAAA,QAAA,OAAA,CAAA,IAAA,MAAA;gBACfgB,CAAAA,OAAM;AACZ,UAAA,QAAO,IAAA,EAAA,GAAA;AACLJ,YAAIK,OAAIjB,EAAAA;MACV,OAAA;AACF,YAAA,IAAA,EAAA;MAEI;IACN,CAAA;AACF,SAAA,UAAA,IAAA,KAAA,WAAA,GAAA;;;;;AC7GA;;;;;;;;AAMA,YAAYkB,YAAY;AAExB,SAASC,aAAAA,kBAAiB;AAG1B,IAAEC,gBAAA;AAMAC,IAAMH,OAAgBA,cAAOI;EAC7BC,IAAML;EACL,MAAA,gBAAA,aAAA;EASD,MAAA,gBAAA,UAAA;AACF,CAAA;AAKEG,IAAMH,OAAgBA,cAAOI;EAC7BE,IAAQN;EACRO,MAAQP,gBAAa,aAAA;EACrBK,QAAaG;EACZ,QAAA;EASH,MAAMC,gBAAY,UAAA;AAKlB,CAAA;IACER,YAAUK;AACVL,IAAAA,eAAuBQ,CAAAA,EAAAA,QAAY,QAAC,SAAgB,MAAEF;AACtD,EAAAN,WAAO,OAAA,MAAA,SAAA,GAAA,mBAAA,MAAA,IAAA,EAAA,YAAA,YAAA,GAAAC,eAAA,GAAA,IAAA,GAAA,QAAA,GAAA,CAAA,2BAAA,6BAAA,EAAA,CAAA;aAACI,OAAAA,MAAAA,SAAAA,GAAAA,mBAAAA,MAAAA,IAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,QAAAA,GAAAA,CAAAA,2BAAAA,6BAAAA,EAAAA,CAAAA;SAAQI;IAAUH;IAAQI;IAClC;EAEF,EAAA,KAAO,GAAMC;;AAEXX,IAAAA,cAAuB,CAAA,OAAIM;AAC3B,QAAA,CAAO,QAAA,UAAA,MAAA,IAAA,GAAA,MAAA,GAAA;aAAED,OAAAA,UAAAA,OAAAA,QAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,QAAAA,GAAAA,CAAAA,kCAAAA,EAAAA,EAAAA,CAAAA;SAAQI;IAAkDH;IAAO,UAAA,SAAA,SAAA,WAAA;IAC1E;EAEA;AACF;AAKEM,IAAOb,QAAeA,cAAOc;EAC7BC,IAAOf,gBAAeA,aAAOc;EAC5B,OAAA,eAAA,aAAA,IAAA,CAAA;;;;;ACxEH;;;;;;;;;AAMA,SAASE,QAAAA,aAA2B;AAEpC,SAASC,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAA4BC,UAAUC,gBAAgB;AAStD,IAAAC,gBAAA;AAQE,IAAA,qBAAA,MAAA;;;;;;;;;;;;cAaIC,OAAS,QAAA;SACTC,SAAS,SAAA;MACX,OAAA,CAAA;MACI,OAACC,CAAO;IACd;AAECC,SAAAA,UAAiB;;EAElB,CAAA,aAAA,IAAA;AAEA,WAAA,KAAA,OAAA;;;;;WAKIH;WACAC;MACF,OAAA,KAAA,MAAA;MACF,OAAA,KAAA,MAAA;IAEIG;;EAEJ,IAAA,QAAA;AAEIJ,WAAAA,KAAgB;;EAEpB,IAAA,QAAA;AAEIC,WAAAA,KAAgB,OAAA;;EAEpB,IAAA,QAAA;AAEE,WAAA,KAAA,OAAA;EACF;;;;EAKA,SAAA,IAAA;AAEAI,WAAkB,KAAQ,MAAA,KAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;EAE1B,QAAA,IAAA;AAEAC,WAAAA,KAAcC,SAAoC,EAAU,KAAA,gBAAA;;EAE5D,YAAA,EAAA,KAAA,IAAA,CAAA,GAAA;AAEE,WAAA,KAAA,MAAA,OAAA,CAAA,SAAA,CAAA,QAAA,SAAA,KAAA,IAAA;EACF;;;;EAKA,SAAA,IAAA;AAEAC,WAAkB,KAAQ,MAAA,KAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;EAE1B,QAAA,IAAA;AAEAC,WAAAA,KAAcF,SAAMG,EAAM,KAAEC,gBAAgD;;EAK5E,YAAA,EAAA,MAAA,QAAA,OAAA,IAAA,CAAA,GAAA;AAEE,WAAA,KAAA,MAAA,OAAA,CAAA,UAAA,CAAA,QAAA,SAAA,KAAA,UAAA,CAAA,UAAA,WAAA,KAAA,YAAA,CAAA,UAAA,WAAA,KAAA,OAAA;EACF;;;;EAKA,SAAA,MAAA;AAEQC,WAAUC,KAAYC,UAAuB,IAAIC;;YAErD,MAAO,UAAE,oBAAA,IAAA,GAAA;AACX,QAAA,QAAA,IAAA,KAAA,EAAA,GAAA;AAEAD,aAAW,CAACD;IACZ;YAAmCH,IAAQG,KAAKG,EAAE;AAAC,UAC7C,UAAW,KAAKX,YAAaM;MAGnC,QAAO,KAAA;WAACE,CAAAA,SAAAA,KAAAA,QAAAA,KAAAA,MAAAA,CAAAA,EAAAA,OAAAA,QAAAA;WAASI;MAA6D;MAChF,GAAA,QAAA,QAAA,CAAA,WAAA,KAAA,UAAA,QAAA,OAAA,CAAA;IACF;EAEA;;;;;;;UAyBM,IAAKf;AACP,QAAA,KAAO,WAAA,MAAA;AACLgB,WAAG,QAAKC,MAAM,GAAA,KAAA,MAAA,CAAA;IAChB,OAAA;AACF,SAAA,KAAA,MAAA;IAEAC;;UAEIhB;SACAA,QAAMH,CAAAA,UAAY;AACpB,YAAA,MAAA,SAAA;AACA,YAAO,MAAI,SAAA;IACb,CAAA;AAEAoB,WAASjB;;WAEFkB,OAAAA;AACL,SAAA,SAAW,MAAA,KAAA;AACb,SAAA,SAAA,MAAA,KAAA;AAEAC,WAAUC;;YAEN,QAAKC;WACL,QAAKH,CAAAA,UAAerB;AACtB,WAAA,SAAA,MAAA,KAAA;AACA,WAAO,SAAI,MAAA,KAAA;IACb,CAAA;AAEAyB,WAAQC;;UAENC,MAAU;AACV,IAAAA,WAAKC,KAASzB,IAAAA,kBAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,WAAAA,kBAAAA,EAAAA,CAAAA;eACNJ,CAAAA,KAAM8B,SAAKH,KAAAA,EAAAA,GAAAA,wBAAAA,KAAAA,EAAAA,IAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,2BAAAA,mCAAAA,EAAAA,CAAAA;AACnB,SAAA,QAAA,CAAA,UAAA;AACA,YAAOA,MAAAA,KAAAA,IAAAA;IACT,CAAA;AAEAF,WAASzB;;EAET,SAAA,OAAA;AAEA+B,WAAQC,MAAsC,IAAA,CAAA,SAAA,KAAA,QAAA,IAAA,CAAA;;UAE5CJ,MAAUI;AACV,IAAAJ,WAAUZ,KAAI,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;eACZ,KAAA,QAAA,QAAA,EAAA,YAAoC,YAAA,GAAAA,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;QACpCiC,CAAAA,KAAAA,IAAO;aAAmCA;QAAK,IAAA,aAAA,IAAA;QACjD,GAAA;MACAJ;IACA;eACQ3B,CAAAA,KAAM6B,SAAKE,KAAAA,EAAAA,GAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,2BAAAA,EAAAA,EAAAA,CAAAA;AACnB,SAAA,QAAA,CAAA,UAAA;AACA,YAAOA,MAAAA,KAAAA,IAAAA;IACT,CAAA;AAEAV,WAASrB;;EAET,SAAA,OAAA;AAEAgC,WAAWjB,MAAmB,IAAA,CAAA,SAAA,KAAA,QAAA,IAAA,CAAA;;aAExBkB,IAAAA;AACJ,QAAI,eAAU9B,CAAAA;QACZ+B,eAAeC,CAAAA;SACfF,QAAAA,CAAAA,UAAeE;AACjB,qBAAA,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;AACA,qBAAiB,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAuBnC,KAAOkC,KAAAA;MAAa,OAAA;MAC9D,OAAA;IAEAE,CAAAA;;cAES,KAAKC;AACd,UAAA,SAAA,IAAA,IAAA,CAAA,OAAA,KAAA,WAAA,EAAA,CAAA;AAEAC,WAAWvB,KAAmB,KAAA,EAAA,UAAA,MAAA;;aAEvBa,IAAAA;QACHM,eAAeC,CAAAA;AACjB,SAAA,QAAA,CAAA,UAAA;AACA,qBAAiB,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAanC,KAAOkC,KAAAA;MAAa,OAAA,CAAA;MACpD,OAAA;IAEAK,CAAAA;;cAES,KAAKF;AACd,UAAA,SAAA,IAAA,IAAA,CAAA,OAAA,KAAA,WAAA,EAAA,CAAA;AACF,WAAA,KAAA,KAAA,EAAA,UAAA,MAAA;EAEA;;AAQE,IAA+BG,kBAA/B,MAA8C;;EAAC,YAAA,QAAA;AAE3CC,SAAAA,SAAe;;EAEnB,IAAA,QAAA;AAEAC,WAAwC,KAAA;;OAEtC,IAAA;AACF,OAAA,IAAA;AAEAtC,WAAkB;;EAElB,QAAA,IAAA;AAEAqB,WAAQC,KAAkB,MAAA,QAAA,EAAA;;UAExB,MAAO;AACT,SAAA,OAAA,QAAA,IAAA;AAEAI,WAAQC;;UAEN,MAAO;AACT,SAAA,OAAA,QAAA,IAAA;AAEAP,WAASzB;;WAEP,OAAW;AACb,SAAA,OAAA,SAAA,KAAA;AAEAsB,WAASrB;;WAEP,OAAW;AACb,SAAA,OAAA,SAAA,KAAA;AACF,WAAA;EAEA;;AAQI,IAAO,aAAP,MAAO,oBAA4B,mBAAA;EACrC,IAAA,UAAA;AAESqC,WAA6C,IAA0B,QAAA,IAAA;;EAEhF,KAAA,OAAA;AACF,WAAA,IAAA,YAAA,KAAA;EAOA;;AAUmBM,IAAAA,qBAAAA,MAAAA,4BAAmD,WAAA;EAEpE;;cAKI5C,WAAeA,OAAAA;UACfC,eAAeA;MACjB,OAAA,OAAA,SAAA,CAAA;MACA,OAAM4C,OAAAA,SAPWC,CAAAA;IAQjB;AACF,UAAA,YAAA,GAAA,KAAA,YAAA;AAEIC,SAAAA,aAA8BC,MAAA,KAAA,YAAA;;EAElC,IAAA,WAAA;AAEA,WAAA,KAAA;;;;;EAKA,IAAA,YAAA;AAEa5C,WAAAA,KAAiC;;EAE9C,IAAA,QAAA;AAEaJ,WAAAA,KAAgB,UAAA,IAAA,KAAA,UAAA;;EAE7B,IAAA,QAAA;AAEaC,WAAAA,KAAgB,MAAA;;EAE7B,IAAA,QAAA;AAESqC,WAA6C,KAAkC,MAAA;;EAExF,KAAA,OAAA;AAESlB,WAAc,IAAA,oBAAA,KAAA,WAAA,KAAA;;UAEnBpB;SACAC,UAAS,IAAA,KAAA,YAAA;MACX,OAAA,CAAA;MACA,OAAW,CAAA;IACb,CAAA;AAEA,WAAA;;;;;WAKS,OAAI;AACb,SAAA,UAAA,IAAA,KAAA,YAAA,KAAA;AAESyB,WAAQC;;UAEfC,MAAU;AACV,IAAAA,WAAMqB,KAAAA,IAAU,kBAAmB,EAAA,YAAKL,YAAU,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,WAAA,kBAAA,EAAA,CAAA;AAClD,IAAA6B,WAAKkB,CAAAA,KAAUI,SAASN,KAAAA,EAAAA,GAAU,wBAAE,KAAA,EAAA,IAAA,EAAA,YAAA,YAAA,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,2BAAA,mCAAA,EAAA,CAAA;UAClC,UAAU,KAAA,UAAA,IAAA,KAAA,UAAA;SACVC,UAAO,IAAA,KAAA,YAAA;;aAAmB2B;QAAK,GAAA,QAAA;QACjC;MACA;IACF,CAAA;AAESI,WAAQC;;UAEfJ,MAAUI;AACV,IAAAJ,WAAUZ,KAAI,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;eACZiC,KAAO,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjC,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;cAAEiB,IAAImC;aAA6BnB;QAAK,IAAA,aAAA,IAAA;QACjD,GAAA;MACAJ;IACA;AACA,IAAAA,WAAKkB,CAAAA,KAAUI,SAASN,KAAAA,EAAAA,GAAU,QAAE,EAAA,YAAA,YAAA,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,2BAAA,EAAA,EAAA,CAAA;UAClC,UAAU,KAAA,UAAA,IAAA,KAAA,UAAA;SACVE,UAAO,IAAA,KAAA,YAAA;;aAAmB+B;QAAa,GAAA,QAAA;QACzC;MACA;IACF,CAAA;AAESC,WAAWjB;;aAEZmB,IAAAA;AACN,UAAMD,UAAAA,KAAee,UAAQjD,IAAMoD,KAAAA,UAAiBzB;AAEpD,UAAKmB,eAAc,QAAKF,MAAU,OAAE,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;UAClC5C,eAAeA,QAAMoD,MAAQzB,OAASA,CAAAA,SAAO,KAAKX,OAAAA,EAAAA;SAClDf,UAAOgD,IAAQhD,KAAK,YAAS+B;MAC/B,OAAA,QAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;MAEA,OAAW,QAAM,MAAA,OAAA,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;;WAAuB/B,KAAOkC,KAAAA;MAAa,OAAA;MAC9D,OAAA;IAESI,CAAAA;;aAEDJ,IAAAA;AAEN,UAAKW,UAAUI,KAAI,UAAKN,IAAU,KAAE,UAAA;UAClC,eAAU,QAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;SACV3C,UAAOgD,IAAQhD,KAAK,YAAS+B;MAC/B,GAAA;MAEA,OAAW,QAAM,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAa/B,KAAOkC,KAAAA;MAAa,OAAA,CAAA;MACpD,OAAA;IAEA,CAAA;;;;;YAKO,IAAI,OAAO/B,OAAK;AACrB,QAAA,MAAA;AAEA,SAAA,MAAA,KAAA,KAAA;IACA;SAGEiD,UAAS,IAAKjD,KAAK,UAAA;AACrB,WAAA,KAAA,UAAA,UAAA,KAAA,YAAA,MAAA;AACF,SAAA,MAAA,KAAA,KAAA;IACF,CAAA;EAEA;;AAQO,IAAI,UAAJ,cAAI,gBAAA;OACP,IAAA;AACF,OAAA,IAAA;AACF,WAAA;;;",
+  "names": ["Atom", "Registry", "invariant", "_registry", "_selected", "cb", "get", "toJSON", "selected", "contains", "clear", "id", "_singleSelect", "remove", "current", "Array", "values", "filter", "_id", "setSelected", "subtract", "ids", "toggleSelected", "set", "Set", "forEach", "has", "delete", "add", "Schema", "invariant", "__dxlog_file", "type", "String", "data", "source", "target", "optional", "KEY_REGEX", "relation", "join", "parseEdgeId", "nodes", "Array", "edges", "Atom", "inspectCustom", "failedInvariant", "invariant", "isTruthy", "removeBy", "__dxlog_file", "nodes", "edges", "_change", "inspectCustom", "graph", "getNode", "filterNodes", "type", "getEdge", "filterEdges", "source", "target", "_traverse", "root", "visited", "Set", "id", "targets", "fn", "_graph", "clear", "addGraph", "addEdges", "addGraphs", "graphs", "addNodes", "addNode", "node", "invariant", "_mutate", "push", "addEdge", "edge", "removeNode", "removedNodes", "removedEdges", "removeBy", "removeNodes", "copy", "removeEdge", "removeEdges", "_model", "model", "call", "_graphAtom", "initialGraph", "_registry", "registry", "Atom", "current", "set", "Graph", "filter", "cb"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"src/selection.ts":{"bytes":10724,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/Graph.ts":{"bytes":6696,"imports":[{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/GraphModel.ts":{"bytes":40291,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"}],"format":"esm"},"src/index.ts":{"bytes":751,"imports":[{"path":"src/selection.ts","kind":"import-statement","original":"./selection"},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"},{"path":"src/GraphModel.ts","kind":"import-statement","original":"./GraphModel"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":28608},"dist/lib/browser/index.mjs":{"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["Graph","GraphModel","SelectionModel"],"entryPoint":"src/index.ts","inputs":{"src/selection.ts":{"bytesInOutput":2694},"src/index.ts":{"bytesInOutput":0},"src/Graph.ts":{"bytesInOutput":1727},"src/GraphModel.ts":{"bytesInOutput":9864}},"bytes":14638}}}
+{"inputs":{"src/selection.ts":{"bytes":10515,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/Graph.ts":{"bytes":6561,"imports":[{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/GraphModel.ts":{"bytes":39344,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"}],"format":"esm"},"src/index.ts":{"bytes":679,"imports":[{"path":"src/selection.ts","kind":"import-statement","original":"./selection"},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"},{"path":"src/GraphModel.ts","kind":"import-statement","original":"./GraphModel"}],"format":"esm"}},"outputs":{"dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":27743},"dist/lib/browser/index.mjs":{"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["Graph","GraphModel","SelectionModel"],"entryPoint":"src/index.ts","inputs":{"src/selection.ts":{"bytesInOutput":2638},"src/index.ts":{"bytesInOutput":0},"src/Graph.ts":{"bytesInOutput":1691},"src/GraphModel.ts":{"bytesInOutput":9582}},"bytes":14264}}}