@dxos/graph 0.8.2-main.fbd8ed0 → 0.8.2-staging.42af850

package/dist/lib/node/index.cjs

@@ -25,21 +25,22 @@ __export(node_exports, {
   Graph: () => Graph,
   GraphBuilder: () => GraphBuilder,
   GraphModel: () => GraphModel,
+  ReactiveGraphModel: () => ReactiveGraphModel,
   ReadonlyGraphModel: () => ReadonlyGraphModel,
+  SelectionModel: () => SelectionModel,
   createEdgeId: () => createEdgeId,
-  createGraph: () => createGraph,
-  parseEdgeId: () => parseEdgeId
+  parseEdgeId: () => parseEdgeId,
+  subscribe: () => subscribe
 });
 module.exports = __toCommonJS(node_exports);
-var import_echo_schema = require("@dxos/echo-schema");
-var import_live_object = require("@dxos/live-object");
-var import_log = require("@dxos/log");
-var import_schema = require("@dxos/schema");
+var import_signals_core = require("@preact/signals-core");
 var import_debug = require("@dxos/debug");
 var import_invariant = require("@dxos/invariant");
-var import_live_object2 = require("@dxos/live-object");
+var import_live_object = require("@dxos/live-object");
 var import_util = require("@dxos/util");
 var import_invariant2 = require("@dxos/invariant");
+var import_signals_core2 = require("@preact/signals-core");
+var import_invariant3 = require("@dxos/invariant");
 var import_effect = require("effect");
 var __dxlog_file = "/home/runner/work/dxos/dxos/packages/common/graph/src/util.ts";
 var KEY_REGEX = /\w+/;
@@ -102,16 +103,11 @@ var ReadonlyGraphModel = class {
   /**
   * Return stable sorted JSON representation of graph.
   */
-  // TODO(burdon): Create separate toJson method with computed signal.
   toJSON() {
-    const { id, nodes, edges } = (0, import_live_object2.getSnapshot)(this._graph);
-    nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));
-    edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));
-    return (0, import_util.stripUndefined)({
-      id,
-      nodes,
-      edges
-    });
+    return {
+      nodes: this.nodes.length,
+      edges: this.edges.length
+    };
   }
   get graph() {
     return this._graph;
@@ -187,7 +183,7 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
   addNode(node) {
     (0, import_invariant.invariant)(node.id, "ID is required", {
       F: __dxlog_file2,
-      L: 153,
+      L: 157,
       S: this,
       A: [
         "node.id",
@@ -196,7 +192,7 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     });
     (0, import_invariant.invariant)(!this.findNode(node.id), `node already exists: ${node.id}`, {
       F: __dxlog_file2,
-      L: 154,
+      L: 158,
       S: this,
       A: [
         "!this.findNode(node.id)",
@@ -212,7 +208,7 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
   addEdge(edge) {
     (0, import_invariant.invariant)(edge.source, void 0, {
       F: __dxlog_file2,
-      L: 164,
+      L: 168,
       S: this,
       A: [
         "edge.source",
@@ -221,7 +217,7 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     });
     (0, import_invariant.invariant)(edge.target, void 0, {
       F: __dxlog_file2,
-      L: 165,
+      L: 169,
       S: this,
       A: [
         "edge.target",
@@ -236,7 +232,7 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     }
     (0, import_invariant.invariant)(!this.findNode(edge.id), void 0, {
       F: __dxlog_file2,
-      L: 170,
+      L: 174,
       S: this,
       A: [
         "!this.findNode(edge.id!)",
@@ -250,8 +246,8 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     return edges.map((edge) => this.addEdge(edge));
   }
   removeNode(id) {
-    const nodes = (0, import_util.removeBy)(this._graph.nodes, (node) => node.id === id);
     const edges = (0, import_util.removeBy)(this._graph.edges, (edge) => edge.source === id || edge.target === id);
+    const nodes = (0, import_util.removeBy)(this._graph.nodes, (node) => node.id === id);
     return this.copy({
       nodes,
       edges
@@ -315,12 +311,106 @@ var GraphModel = class _GraphModel extends AbstractGraphModel {
     });
   }
 };
+var subscribe = (model, cb, fire = false) => {
+  if (fire) {
+    cb(model, model.graph);
+  }
+  return (0, import_signals_core.effect)(() => {
+    cb(model, model.graph);
+  });
+};
+var ReactiveGraphModel = class _ReactiveGraphModel extends GraphModel {
+  constructor(graph) {
+    super((0, import_live_object.live)({
+      nodes: graph?.nodes ?? [],
+      edges: graph?.edges ?? []
+    }));
+  }
+  copy(graph) {
+    return new _ReactiveGraphModel(graph);
+  }
+  subscribe(cb, fire = false) {
+    return subscribe(this, cb, fire);
+  }
+};
 var GraphBuilder = class extends AbstractGraphBuilder {
   call(cb) {
     cb(this);
     return this;
   }
 };
+var __dxlog_file3 = "/home/runner/work/dxos/dxos/packages/common/graph/src/selection.ts";
+var SelectionModel = class {
+  constructor(_singleSelect = false) {
+    this._singleSelect = _singleSelect;
+    this._selected = (0, import_signals_core2.signal)(/* @__PURE__ */ new Set());
+    this._selectedIds = (0, import_signals_core2.computed)(() => Array.from(this._selected.value.values()));
+  }
+  toJSON() {
+    return {
+      selected: Array.from(this._selected.value.values())
+    };
+  }
+  get size() {
+    return this._selected.value.size;
+  }
+  get selected() {
+    return this._selectedIds;
+  }
+  contains(id) {
+    return this._selected.value.has(id);
+  }
+  clear() {
+    this._selected.value = /* @__PURE__ */ new Set();
+  }
+  add(id) {
+    (0, import_invariant3.invariant)(id, void 0, {
+      F: __dxlog_file3,
+      L: 41,
+      S: this,
+      A: [
+        "id",
+        ""
+      ]
+    });
+    this._selected.value = new Set(this._singleSelect ? [
+      id
+    ] : [
+      ...Array.from(this._selected.value.values()),
+      id
+    ]);
+  }
+  remove(id) {
+    (0, import_invariant3.invariant)(id, void 0, {
+      F: __dxlog_file3,
+      L: 48,
+      S: this,
+      A: [
+        "id",
+        ""
+      ]
+    });
+    this._selected.value = new Set(Array.from(this._selected.value.values()).filter((_id) => _id !== id));
+  }
+  // TODO(burdon): Handle single select.
+  setSelected(ids, shift = false) {
+    this._selected.value = /* @__PURE__ */ new Set([
+      ...shift ? Array.from(this._selected.value.values()) : [],
+      ...ids
+    ]);
+  }
+  toggleSelected(ids, shift = false) {
+    const set = new Set(shift ? Array.from(this._selected.value.values()) : void 0);
+    ids.forEach((id) => {
+      if (this._selected.value.has(id)) {
+        set.delete(id);
+      } else {
+        set.add(id);
+      }
+    });
+    this._selected.value = set;
+  }
+};
 var BaseGraphNode = import_effect.Schema.Struct({
   id: import_effect.Schema.String,
   type: import_effect.Schema.optional(import_effect.Schema.String),
@@ -329,65 +419,15 @@ var BaseGraphNode = import_effect.Schema.Struct({
 var BaseGraphEdge = import_effect.Schema.Struct({
   id: import_effect.Schema.String,
   type: import_effect.Schema.optional(import_effect.Schema.String),
-  data: import_effect.Schema.optional(import_effect.Schema.Any),
   source: import_effect.Schema.String,
-  target: import_effect.Schema.String
+  target: import_effect.Schema.String,
+  data: import_effect.Schema.optional(import_effect.Schema.Any)
 });
-var ExtendableBaseGraphNode = import_effect.Schema.extend(BaseGraphNode, import_effect.Schema.Struct({}, {
-  key: import_effect.Schema.String,
-  value: import_effect.Schema.Any
-}));
 var Graph = import_effect.Schema.Struct({
   id: import_effect.Schema.optional(import_effect.Schema.String),
-  nodes: import_effect.Schema.mutable(import_effect.Schema.Array(ExtendableBaseGraphNode)),
+  nodes: import_effect.Schema.mutable(import_effect.Schema.Array(BaseGraphNode)),
   edges: import_effect.Schema.mutable(import_effect.Schema.Array(BaseGraphEdge))
 });
-var __dxlog_file3 = "/home/runner/work/dxos/dxos/packages/common/graph/src/create.ts";
-var createGraph = (objects) => {
-  const graph = new GraphModel((0, import_live_object.live)(Graph, {
-    nodes: [],
-    edges: []
-  }));
-  objects.forEach((object) => {
-    graph.addNode({
-      id: object.id,
-      type: object.typename,
-      data: object
-    });
-  });
-  objects.forEach((object) => {
-    const schema = (0, import_echo_schema.getSchema)(object);
-    if (!schema) {
-      import_log.log.info("no schema for object", {
-        id: object.id.slice(0, 8)
-      }, {
-        F: __dxlog_file3,
-        L: 31,
-        S: void 0,
-        C: (f, a) => f(...a)
-      });
-      return;
-    }
-    for (const prop of (0, import_schema.getSchemaProperties)(schema.ast, object)) {
-      if (prop.format === import_echo_schema.FormatEnum.Ref) {
-        const source = object;
-        const target = object[prop.name]?.target;
-        if (target) {
-          graph.addEdge({
-            id: createEdgeId({
-              source: source.id,
-              target: target.id,
-              relation: String(prop.name)
-            }),
-            source: source.id,
-            target: target.id
-          });
-        }
-      }
-    }
-  });
-  return graph;
-};
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   AbstractGraphBuilder,
@@ -397,9 +437,11 @@ var createGraph = (objects) => {
   Graph,
   GraphBuilder,
   GraphModel,
+  ReactiveGraphModel,
   ReadonlyGraphModel,
+  SelectionModel,
   createEdgeId,
-  createGraph,
-  parseEdgeId
+  parseEdgeId,
+  subscribe
 });
 //# sourceMappingURL=index.cjs.map

package/dist/lib/node/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/create.ts", "../../../src/model.ts", "../../../src/util.ts", "../../../src/types.ts"],
-  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { type AnyLiveObject } from '@dxos/echo-db';\nimport { FormatEnum, getSchema } from '@dxos/echo-schema';\nimport { live } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { getSchemaProperties } from '@dxos/schema';\n\nimport { GraphModel } from './model';\nimport { Graph, type GraphNode } from './types';\nimport { createEdgeId } from './util';\n\n/**\n * Creates a new reactive graph from a set of ECHO objects.\n * References are mapped onto graph edges.\n */\nexport const createGraph = (objects: AnyLiveObject<any>[]): GraphModel<GraphNode<AnyLiveObject<any>>> => {\n  const graph = new GraphModel<GraphNode<AnyLiveObject<any>>>(live(Graph, { nodes: [], edges: [] }));\n\n  // Map objects.\n  objects.forEach((object) => {\n    graph.addNode({ id: object.id, type: object.typename, data: object });\n  });\n\n  // Find references.\n  objects.forEach((object) => {\n    const schema = getSchema(object);\n    if (!schema) {\n      log.info('no schema for object', { id: object.id.slice(0, 8) });\n      return;\n    }\n\n    // Parse schema to follow referenced objects.\n    for (const prop of getSchemaProperties(schema.ast, object)) {\n      if (prop.format === FormatEnum.Ref) {\n        const source = object;\n        const target = object[prop.name]?.target;\n        if (target) {\n          graph.addEdge({\n            id: createEdgeId({ source: source.id, target: target.id, relation: String(prop.name) }),\n            source: source.id,\n            target: target.id,\n          });\n        }\n      }\n    }\n  });\n\n  return graph;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { getSnapshot } from '@dxos/live-object';\nimport { type MakeOptional, isNotFalsy, removeBy, stripUndefined } from '@dxos/util';\n\nimport { type BaseGraphEdge, type BaseGraphNode, type Graph, type GraphEdge, type GraphNode } from './types';\nimport { createEdgeId } from './util';\n\n/**\n * Wrapper class contains reactive nodes and edges.\n */\nexport class ReadonlyGraphModel<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> {\n  protected readonly _graph: Graph;\n\n  /**\n   * NOTE: Pass in simple Graph or Live.\n   */\n  constructor(graph?: Graph) {\n    this._graph = graph ?? { nodes: [], edges: [] };\n  }\n\n  [inspectCustom]() {\n    return this.toJSON();\n  }\n\n  /**\n   * Return stable sorted JSON representation of graph.\n   */\n  // TODO(burdon): Create separate toJson method with computed signal.\n  toJSON() {\n    const { id, nodes, edges } = getSnapshot(this._graph);\n    nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n    edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n    return stripUndefined({ id, nodes, edges });\n  }\n\n  get graph(): Graph {\n    return this._graph;\n  }\n\n  get nodes(): Node[] {\n    return this._graph.nodes as Node[];\n  }\n\n  get edges(): Edge[] {\n    return this._graph.edges as Edge[];\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<GraphNode> = {}): 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<GraphEdge> = {}): 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(isNotFalsy);\n\n    return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n  }\n}\n\n/**\n * Typed wrapper.\n */\nexport abstract class AbstractGraphModel<\n  Node extends BaseGraphNode,\n  Edge extends BaseGraphEdge,\n  Model extends AbstractGraphModel<Node, Edge, Model, Builder>,\n  Builder extends AbstractGraphBuilder<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>): Model;\n\n  clear(): this {\n    this._graph.nodes.length = 0;\n    this._graph.edges.length = 0;\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._graph.nodes.push(node);\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: createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    this._graph.edges.push(edge as Edge);\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    const nodes = removeBy<Node>(this._graph.nodes as Node[], (node) => node.id === id);\n    const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n    return this.copy({ nodes, edges });\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    const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.id === id);\n    return this.copy({ nodes: [], edges });\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 wrapper\n */\nexport abstract class AbstractGraphBuilder<\n  Node extends BaseGraphNode,\n  Edge extends BaseGraphEdge,\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\nexport class GraphModel<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {\n  override get builder() {\n    return new GraphBuilder<Node, Edge>(this);\n  }\n\n  override copy(graph?: Partial<Graph>) {\n    return new GraphModel<Node, Edge>({ nodes: graph?.nodes ?? [], edges: graph?.edges ?? [] });\n  }\n}\n\nexport class GraphBuilder<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {\n  override call(cb: (builder: this) => void) {\n    cb(this);\n    return this;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { invariant } from '@dxos/invariant';\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// Copyright 2024 DXOS.org\n//\n\nimport { Schema } from 'effect';\n\nimport { type Specialize } from '@dxos/util';\n\nexport const BaseGraphNode = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  data: Schema.optional(Schema.Any),\n});\n\n/** Raw base type. */\nexport type BaseGraphNode = Schema.Schema.Type<typeof BaseGraphNode>;\n\n/** Typed node data. */\nexport type GraphNode<Data = any, Optional extends boolean = false> = Specialize<\n  BaseGraphNode,\n  Optional extends true ? { data?: Data } : { data: Data }\n>;\n\nexport declare namespace GraphNode {\n  export type Optional<T = any> = GraphNode<T, true>;\n}\n\nexport const BaseGraphEdge = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  data: Schema.optional(Schema.Any),\n  source: Schema.String,\n  target: Schema.String,\n});\n\n/** Raw base type. */\nexport type BaseGraphEdge = Schema.Schema.Type<typeof BaseGraphEdge>;\n\n/** Typed edge data. */\nexport type GraphEdge<Data = any, Optional extends boolean = false> = Specialize<\n  BaseGraphEdge,\n  Optional extends true ? { data?: Data } : { data: Data }\n>;\n\nexport declare namespace GraphEdge {\n  export type Optional<T = any> = GraphEdge<T, true>;\n}\n\n/**\n * Allows any additional properties on graph nodes.\n */\nconst ExtendableBaseGraphNode = Schema.extend(\n  BaseGraphNode,\n  Schema.Struct({}, { key: Schema.String, value: Schema.Any }),\n);\n\n/**\n * Generic graph.\n */\nexport const Graph = Schema.Struct({\n  id: Schema.optional(Schema.String),\n  nodes: Schema.mutable(Schema.Array(ExtendableBaseGraphNode)),\n  edges: Schema.mutable(Schema.Array(BaseGraphEdge)),\n});\n\nexport type Graph = Schema.Schema.Type<typeof Graph>;\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,yBAAsC;AACtC,yBAAqB;AACrB,iBAAoB;AACpB,oBAAoC;ACJpC,mBAA8B;AAC9B,uBAA2C;AAC3C,IAAAA,sBAA4B;AAC5B,kBAAwE;ACHxE,IAAAC,oBAA0B;ACA1B,oBAAuB;;ADEvB,IAAMC,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEC,QAAQC,QAAQC,SAAQ,MAAY;AACjEC,mCAAUH,OAAOI,MAAMN,SAAAA,GAAY,mBAAmBE,MAAAA,IAAQ;;;;;;;;;AAC9DG,mCAAUF,OAAOG,MAAMN,SAAAA,GAAY,mBAAmBG,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQE;IAAUD;IAAQI,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACC,OAAAA;AAC1B,QAAM,CAACP,QAAQE,UAAUD,MAAAA,IAAUM,GAAGC,MAAM,GAAA;AAC5CL,mCAAUH,OAAOS,UAAUR,OAAOQ,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAET;IAAQE,UAAUA,SAASO,SAASP,WAAWQ;IAAWT;EAAO;AAC5E;;ADNO,IAAMU,qBAAN,MAAMA;;;;EASXC,YAAYC,OAAe;AACzB,SAAKC,SAASD,SAAS;MAAEE,OAAO,CAAA;MAAIC,OAAO,CAAA;IAAG;EAChD;EAEA,CAACC,0BAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;;EAMAA,SAAS;AACP,UAAM,EAAEX,IAAIQ,OAAOC,MAAK,QAAKG,iCAAY,KAAKL,MAAM;AACpDC,UAAMK,KAAK,CAAC,EAAEb,IAAIc,EAAC,GAAI,EAAEd,IAAIe,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrDN,UAAMI,KAAK,CAAC,EAAEb,IAAIc,EAAC,GAAI,EAAEd,IAAIe,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrD,eAAOE,4BAAe;MAAEjB;MAAIQ;MAAOC;IAAM,CAAA;EAC3C;EAEA,IAAIH,QAAe;AACjB,WAAO,KAAKC;EACd;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKD,OAAOC;EACrB;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKF,OAAOE;EACrB;;;;EAMAS,SAASlB,IAA8B;AACrC,WAAO,KAAKQ,MAAMW,KAAK,CAACC,SAASA,KAAKpB,OAAOA,EAAAA;EAC/C;EAEAqB,QAAQrB,IAAkB;AACxB,WAAO,KAAKkB,SAASlB,EAAAA,SAAOsB,kCAAAA;EAC9B;EAEAC,YAAY,EAAEC,KAAI,IAAyB,CAAC,GAAW;AACrD,WAAO,KAAKhB,MAAMiB,OAAO,CAACL,SAAS,CAACI,QAAQA,SAASJ,KAAKI,IAAI;EAChE;;;;EAMAE,SAAS1B,IAA8B;AACrC,WAAO,KAAKS,MAAMU,KAAK,CAACQ,SAASA,KAAK3B,OAAOA,EAAAA;EAC/C;EAEA4B,QAAQ5B,IAAkB;AACxB,WAAO,KAAK0B,SAAS1B,EAAAA,SAAOsB,kCAAAA;EAC9B;EAEAO,YAAY,EAAEL,MAAM/B,QAAQC,OAAM,IAAyB,CAAC,GAAW;AACrE,WAAO,KAAKe,MAAMgB,OAChB,CAACE,UACE,CAACH,QAAQA,SAASG,KAAKH,UAAU,CAAC/B,UAAUA,WAAWkC,KAAKlC,YAAY,CAACC,UAAUA,WAAWiC,KAAKjC,OAAK;EAE/G;;;;EAMAoC,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAK/B,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEAiC,YAAQG,IAAIL,KAAK/B,EAAE;AACnB,UAAMqC,UAAU,KAAKR,YAAY;MAAEpC,QAAQsC,KAAK/B;IAAG,CAAA,EAChDsC,IAAI,CAACX,SAAS,KAAKN,QAAQM,KAAKjC,MAAM,CAAA,EACtC+B,OAAOc,sBAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAAC9C,WAAW,KAAKsC,UAAUtC,QAAQuC,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKGrC,mBAAAA;EAWRsC,QAAc;AACZ,SAAKnC,OAAOC,MAAMN,SAAS;AAC3B,SAAKK,OAAOE,MAAMP,SAAS;AAC3B,WAAO;EACT;EAEAyC,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,QAAQ7B,MAAkB;AACxBxB,yBAAAA,WAAUwB,KAAKpB,IAAI,kBAAA;;;;;;;;;AACnBJ,yBAAAA,WAAU,CAAC,KAAKsB,SAASE,KAAKpB,EAAE,GAAG,wBAAwBoB,KAAKpB,EAAE,IAAE;;;;;;;;;AACpE,SAAKO,OAAOC,MAAM0C,KAAK9B,IAAAA;AACvB,WAAOA;EACT;EAEAwB,SAASpC,OAAuB;AAC9B,WAAOA,MAAM8B,IAAI,CAAClB,SAAS,KAAK6B,QAAQ7B,IAAAA,CAAAA;EAC1C;EAEA+B,QAAQxB,MAAsC;AAC5C/B,yBAAAA,WAAU+B,KAAKlC,QAAM,QAAA;;;;;;;;;AACrBG,yBAAAA,WAAU+B,KAAKjC,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAACiC,KAAK3B,IAAI;AAEZ2B,aAAO;QAAE3B,IAAIR,aAAamC,IAAAA;QAAO,GAAGA;MAAK;IAC3C;AACA/B,yBAAAA,WAAU,CAAC,KAAKsB,SAASS,KAAK3B,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAKO,OAAOE,MAAMyC,KAAKvB,IAAAA;AACvB,WAAOA;EACT;EAEAkB,SAASpC,OAAuB;AAC9B,WAAOA,MAAM6B,IAAI,CAACX,SAAS,KAAKwB,QAAQxB,IAAAA,CAAAA;EAC1C;EAEAyB,WAAWpD,IAAmB;AAC5B,UAAMQ,YAAQ6C,sBAAe,KAAK9C,OAAOC,OAAiB,CAACY,SAASA,KAAKpB,OAAOA,EAAAA;AAChF,UAAMS,YAAQ4C,sBAAe,KAAK9C,OAAOE,OAAiB,CAACkB,SAASA,KAAKlC,WAAWO,MAAM2B,KAAKjC,WAAWM,EAAAA;AAC1G,WAAO,KAAKsD,KAAK;MAAE9C;MAAOC;IAAM,CAAA;EAClC;EAEA8C,YAAYC,KAAsB;AAChC,UAAMT,SAASS,IAAIlB,IAAI,CAACtC,OAAO,KAAKoD,WAAWpD,EAAAA,CAAAA;AAC/C,WAAO,KAAKsD,KAAI,EAAGR,UAAUC,MAAAA;EAC/B;EAEAU,WAAWzD,IAAmB;AAC5B,UAAMS,YAAQ4C,sBAAe,KAAK9C,OAAOE,OAAiB,CAACkB,SAASA,KAAK3B,OAAOA,EAAAA;AAChF,WAAO,KAAKsD,KAAK;MAAE9C,OAAO,CAAA;MAAIC;IAAM,CAAA;EACtC;EAEAiD,YAAYF,KAAsB;AAChC,UAAMT,SAASS,IAAIlB,IAAI,CAACtC,OAAO,KAAKyD,WAAWzD,EAAAA,CAAAA;AAC/C,WAAO,KAAKsD,KAAI,EAAGR,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAeY,uBAAf,MAAeA;EAKpBtD,YAA+BuD,QAAe;SAAfA,SAAAA;EAAgB;EAE/C,IAAIC,QAAe;AACjB,WAAO,KAAKD;EACd;EAEAE,KAAKC,IAAmC;AACtCA,OAAG,IAAI;AACP,WAAO;EACT;EAEA1C,QAAQrB,IAAkB;AACxB,WAAO,KAAK6D,MAAMxC,QAAQrB,EAAAA;EAC5B;EAEAiD,QAAQ7B,MAAkB;AACxB,SAAKwC,OAAOX,QAAQ7B,IAAAA;AACpB,WAAO;EACT;EAEA+B,QAAQxB,MAAsC;AAC5C,SAAKiC,OAAOT,QAAQxB,IAAAA;AACpB,WAAO;EACT;EAEAiB,SAASpC,OAAqB;AAC5B,SAAKoD,OAAOhB,SAASpC,KAAAA;AACrB,WAAO;EACT;EAEAqC,SAASpC,OAAqB;AAC5B,SAAKmD,OAAOf,SAASpC,KAAAA;AACrB,WAAO;EACT;AACF;AAEO,IAAMuD,aAAN,MAAMA,oBAGHvB,mBAAAA;EACR,IAAawB,UAAU;AACrB,WAAO,IAAIC,aAAyB,IAAI;EAC1C;EAESZ,KAAKhD,OAAwB;AACpC,WAAO,IAAI0D,YAAuB;MAAExD,OAAOF,OAAOE,SAAS,CAAA;MAAIC,OAAOH,OAAOG,SAAS,CAAA;IAAG,CAAA;EAC3F;AACF;AAEO,IAAMyD,eAAN,cAGGP,qBAAAA;EACCG,KAAKC,IAA6B;AACzCA,OAAG,IAAI;AACP,WAAO;EACT;AACF;AEjQO,IAAMI,gBAAgBC,qBAAOC,OAAO;EACzCrE,IAAIoE,qBAAOE;EACX9C,MAAM4C,qBAAOG,SAASH,qBAAOE,MAAM;EACnCE,MAAMJ,qBAAOG,SAASH,qBAAOK,GAAG;AAClC,CAAA;AAeO,IAAMC,gBAAgBN,qBAAOC,OAAO;EACzCrE,IAAIoE,qBAAOE;EACX9C,MAAM4C,qBAAOG,SAASH,qBAAOE,MAAM;EACnCE,MAAMJ,qBAAOG,SAASH,qBAAOK,GAAG;EAChChF,QAAQ2E,qBAAOE;EACf5E,QAAQ0E,qBAAOE;AACjB,CAAA;AAkBA,IAAMK,0BAA0BP,qBAAOQ,OACrCT,eACAC,qBAAOC,OAAO,CAAC,GAAG;EAAEQ,KAAKT,qBAAOE;EAAQQ,OAAOV,qBAAOK;AAAI,CAAA,CAAA;AAMrD,IAAMM,QAAQX,qBAAOC,OAAO;EACjCrE,IAAIoE,qBAAOG,SAASH,qBAAOE,MAAM;EACjC9D,OAAO4D,qBAAOY,QAAQZ,qBAAOa,MAAMN,uBAAAA,CAAAA;EACnClE,OAAO2D,qBAAOY,QAAQZ,qBAAOa,MAAMP,aAAAA,CAAAA;AACrC,CAAA;;AH7CO,IAAMQ,cAAc,CAACC,YAAAA;AAC1B,QAAM7E,QAAQ,IAAI0D,eAA0CoB,yBAAKL,OAAO;IAAEvE,OAAO,CAAA;IAAIC,OAAO,CAAA;EAAG,CAAA,CAAA;AAG/F0E,UAAQnC,QAAQ,CAACqC,WAAAA;AACf/E,UAAM2C,QAAQ;MAAEjD,IAAIqF,OAAOrF;MAAIwB,MAAM6D,OAAOC;MAAUd,MAAMa;IAAO,CAAA;EACrE,CAAA;AAGAF,UAAQnC,QAAQ,CAACqC,WAAAA;AACf,UAAME,aAASC,8BAAUH,MAAAA;AACzB,QAAI,CAACE,QAAQ;AACXE,qBAAIC,KAAK,wBAAwB;QAAE1F,IAAIqF,OAAOrF,GAAG2F,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,YAAQC,mCAAoBN,OAAOO,KAAKT,MAAAA,GAAS;AAC1D,UAAIO,KAAKG,WAAWC,8BAAWC,KAAK;AAClC,cAAMxG,SAAS4F;AACf,cAAM3F,SAAS2F,OAAOO,KAAKM,IAAI,GAAGxG;AAClC,YAAIA,QAAQ;AACVY,gBAAM6C,QAAQ;YACZnD,IAAIR,aAAa;cAAEC,QAAQA,OAAOO;cAAIN,QAAQA,OAAOM;cAAIL,UAAU2E,OAAOsB,KAAKM,IAAI;YAAE,CAAA;YACrFzG,QAAQA,OAAOO;YACfN,QAAQA,OAAOM;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAOM;AACT;",
-  "names": ["import_live_object", "import_invariant", "KEY_REGEX", "createEdgeId", "source", "target", "relation", "invariant", "match", "join", "parseEdgeId", "id", "split", "length", "undefined", "ReadonlyGraphModel", "constructor", "graph", "_graph", "nodes", "edges", "inspectCustom", "toJSON", "getSnapshot", "sort", "a", "b", "localeCompare", "stripUndefined", "findNode", "find", "node", "getNode", "failedInvariant", "filterNodes", "type", "filter", "findEdge", "edge", "getEdge", "filterEdges", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isNotFalsy", "flatMap", "AbstractGraphModel", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "push", "addEdge", "removeNode", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractGraphBuilder", "_model", "model", "call", "cb", "GraphModel", "builder", "GraphBuilder", "BaseGraphNode", "Schema", "Struct", "String", "optional", "data", "Any", "BaseGraphEdge", "ExtendableBaseGraphNode", "extend", "key", "value", "Graph", "mutable", "Array", "createGraph", "objects", "live", "object", "typename", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name"]
+  "sources": ["../../../src/model.ts", "../../../src/util.ts", "../../../src/selection.ts", "../../../src/types.ts"],
+  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { effect } from '@preact/signals-core';\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { type Live, live } from '@dxos/live-object';\nimport { type MakeOptional, isNotFalsy, removeBy } from '@dxos/util';\n\nimport { type BaseGraphEdge, type BaseGraphNode, type Graph, type GraphEdge, type GraphNode } from './types';\nimport { createEdgeId } from './util';\n\n/**\n * Readonly Graph wrapper.\n */\nexport class ReadonlyGraphModel<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> {\n  protected readonly _graph: Graph;\n\n  /**\n   * NOTE: Pass in simple Graph or Live.\n   */\n  constructor(graph?: Graph) {\n    this._graph = graph ?? {\n      nodes: [],\n      edges: [],\n    };\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 {\n    return this._graph;\n  }\n\n  get nodes(): Node[] {\n    return this._graph.nodes as Node[];\n  }\n\n  get edges(): Edge[] {\n    return this._graph.edges as Edge[];\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<GraphNode.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<GraphEdge> = {}): 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(isNotFalsy);\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 BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n  Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,\n  Builder extends AbstractGraphBuilder<Node, Edge, Model> = AbstractGraphBuilder<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>): Model;\n\n  clear(): this {\n    this._graph.nodes.length = 0;\n    this._graph.edges.length = 0;\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._graph.nodes.push(node);\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: createEdgeId(edge), ...edge };\n    }\n    invariant(!this.findNode(edge.id!));\n    this._graph.edges.push(edge as Edge);\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    const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n    const nodes = removeBy<Node>(this._graph.nodes as Node[], (node) => node.id === id);\n    return this.copy({ nodes, edges });\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    const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.id === id);\n    return this.copy({ nodes: [], edges });\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 AbstractGraphBuilder<\n  Node extends BaseGraphNode,\n  Edge extends BaseGraphEdge,\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 BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {\n  override get builder() {\n    return new GraphBuilder<Node, Edge>(this);\n  }\n\n  override copy(graph?: Partial<Graph>): GraphModel<Node, Edge> {\n    return new GraphModel<Node, Edge>({ nodes: graph?.nodes ?? [], edges: graph?.edges ?? [] });\n  }\n}\n\nexport type GraphModelSubscription = (model: GraphModel, graph: Live<Graph>) => void;\n\n/**\n * Subscription.\n * NOTE: Requires `registerSignalsRuntime` to be called.\n */\nexport const subscribe = (model: GraphModel, cb: GraphModelSubscription, fire = false) => {\n  if (fire) {\n    cb(model, model.graph);\n  }\n\n  return effect(() => {\n    cb(model, model.graph); // TODO(burdon): This won't work unless model.graph is reactive.\n  });\n};\n\n/**\n * Basic reactive model.\n */\nexport class ReactiveGraphModel<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends GraphModel<Node, Edge> {\n  constructor(graph?: Partial<Graph>) {\n    super(\n      live({\n        nodes: graph?.nodes ?? [],\n        edges: graph?.edges ?? [],\n      }),\n    );\n  }\n\n  override copy(graph?: Partial<Graph>): ReactiveGraphModel<Node, Edge> {\n    return new ReactiveGraphModel<Node, Edge>(graph);\n  }\n\n  subscribe(cb: GraphModelSubscription, fire = false): () => void {\n    return subscribe(this, cb, fire);\n  }\n}\n\n/**\n * Basic builder.\n */\nexport class GraphBuilder<\n  Node extends BaseGraphNode = BaseGraphNode,\n  Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {\n  override call(cb: (builder: this) => void): this {\n    cb(this);\n    return this;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { invariant } from '@dxos/invariant';\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// Copyright 2024 DXOS.org\n//\n\nimport { computed, signal, type ReadonlySignal, type Signal } from '@preact/signals-core';\n\nimport { invariant } from '@dxos/invariant';\n\n/**\n * Reactive selection model.\n */\nexport class SelectionModel {\n  private readonly _selected: Signal<Set<string>> = signal(new Set<string>());\n  private readonly _selectedIds = computed(() => Array.from(this._selected.value.values()));\n\n  constructor(private readonly _singleSelect: boolean = false) {}\n\n  toJSON(): { selected: string[] } {\n    return {\n      selected: Array.from(this._selected.value.values()),\n    };\n  }\n\n  get size(): number {\n    return this._selected.value.size;\n  }\n\n  get selected(): ReadonlySignal<string[]> {\n    return this._selectedIds;\n  }\n\n  contains(id: string): boolean {\n    return this._selected.value.has(id);\n  }\n\n  clear(): void {\n    this._selected.value = new Set();\n  }\n\n  add(id: string): void {\n    invariant(id);\n    this._selected.value = new Set<string>(\n      this._singleSelect ? [id] : [...Array.from(this._selected.value.values()), id],\n    );\n  }\n\n  remove(id: string): void {\n    invariant(id);\n    this._selected.value = new Set<string>(Array.from(this._selected.value.values()).filter((_id) => _id !== id));\n  }\n\n  // TODO(burdon): Handle single select.\n\n  setSelected(ids: string[], shift = false): void {\n    this._selected.value = new Set([...(shift ? Array.from(this._selected.value.values()) : []), ...ids]);\n  }\n\n  toggleSelected(ids: string[], shift = false): void {\n    const set = new Set<string>(shift ? Array.from(this._selected.value.values()) : undefined);\n    ids.forEach((id) => {\n      if (this._selected.value.has(id)) {\n        set.delete(id);\n      } else {\n        set.add(id);\n      }\n    });\n\n    this._selected.value = set;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { Schema } from 'effect';\n\nimport { type Specialize } from '@dxos/util';\n\n//\n// Node\n//\n\n// TODO(burdon): Make type extensible (i.e., not dependent on `data` property)?\nexport const BaseGraphNode = Schema.Struct({\n  id: Schema.String,\n  type: Schema.optional(Schema.String),\n  data: Schema.optional(Schema.Any),\n});\n\n/** Raw base type. */\nexport type BaseGraphNode = Schema.Schema.Type<typeof BaseGraphNode>;\n\n/** Typed node data. */\ntype GraphNode<Data = any, Optional extends boolean = false> = Specialize<\n  BaseGraphNode,\n  Optional extends true ? { data?: Data } : { data: Data }\n>;\n\nexport declare namespace GraphNode {\n  export type Any = GraphNode<any, true>;\n  export type Optional<Data = any> = GraphNode<Data, true>;\n  export type Required<Data = any> = GraphNode<Data, false>;\n}\n\n//\n// Edge\n//\n\nexport const BaseGraphEdge = 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\n/** Raw base type. */\nexport type BaseGraphEdge = Schema.Schema.Type<typeof BaseGraphEdge>;\n\n/** Typed edge data. */\nexport type GraphEdge<Data = any, Optional extends boolean = false> = Specialize<\n  BaseGraphEdge,\n  Optional extends true ? { data?: Data } : { data: Data }\n>;\n\nexport declare namespace GraphEdge {\n  export type Any = GraphEdge<any, true>;\n  export type Optional<Data = any> = GraphEdge<Data, true>;\n  export type Required<Data = any> = GraphEdge<Data, false>;\n}\n\n//\n// Graph\n//\n\nexport const Graph = Schema.Struct({\n  id: Schema.optional(Schema.String),\n  nodes: Schema.mutable(Schema.Array(BaseGraphNode)),\n  edges: Schema.mutable(Schema.Array(BaseGraphEdge)),\n});\n\nexport type Graph = Schema.Schema.Type<typeof Graph>;\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAAuB;AAEvB,mBAA8B;AAC9B,uBAA2C;AAC3C,yBAAgC;AAChC,kBAAwD;ACLxD,IAAAA,oBAA0B;ACA1B,IAAAC,uBAAmE;AAEnE,IAAAD,oBAA0B;ACF1B,oBAAuB;;AFEvB,IAAME,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEC,QAAQC,QAAQC,SAAQ,MAAY;AACjEC,mCAAUH,OAAOI,MAAMN,SAAAA,GAAY,mBAAmBE,MAAAA,IAAQ;;;;;;;;;AAC9DG,mCAAUF,OAAOG,MAAMN,SAAAA,GAAY,mBAAmBG,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQE;IAAUD;IAAQI,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACC,OAAAA;AAC1B,QAAM,CAACP,QAAQE,UAAUD,MAAAA,IAAUM,GAAGC,MAAM,GAAA;AAC5CL,mCAAUH,OAAOS,UAAUR,OAAOQ,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAET;IAAQE,UAAUA,SAASO,SAASP,WAAWQ;IAAWT;EAAO;AAC5E;;ADJO,IAAMU,qBAAN,MAAMA;;;;EASX,YAAYC,OAAe;AACzB,SAAKC,SAASD,SAAS;MACrBE,OAAO,CAAA;MACPC,OAAO,CAAA;IACT;EACF;EAEA,CAACC,0BAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;EAKAA,SAAS;AACP,WAAO;MACLH,OAAO,KAAKA,MAAML;MAClBM,OAAO,KAAKA,MAAMN;IACpB;EACF;EAEA,IAAIG,QAAe;AACjB,WAAO,KAAKC;EACd;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKD,OAAOC;EACrB;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKF,OAAOE;EACrB;;;;EAMAG,SAASX,IAA8B;AACrC,WAAO,KAAKO,MAAMK,KAAK,CAACC,SAASA,KAAKb,OAAOA,EAAAA;EAC/C;EAEAc,QAAQd,IAAkB;AACxB,WAAO,KAAKW,SAASX,EAAAA,SAAOe,kCAAAA;EAC9B;EAEAC,YAAY,EAAEC,KAAI,IAA6B,CAAC,GAAW;AACzD,WAAO,KAAKV,MAAMW,OAAO,CAACL,SAAS,CAACI,QAAQA,SAASJ,KAAKI,IAAI;EAChE;;;;EAMAE,SAASnB,IAA8B;AACrC,WAAO,KAAKQ,MAAMI,KAAK,CAACQ,SAASA,KAAKpB,OAAOA,EAAAA;EAC/C;EAEAqB,QAAQrB,IAAkB;AACxB,WAAO,KAAKmB,SAASnB,EAAAA,SAAOe,kCAAAA;EAC9B;EAEAO,YAAY,EAAEL,MAAMxB,QAAQC,OAAM,IAAyB,CAAC,GAAW;AACrE,WAAO,KAAKc,MAAMU,OAChB,CAACE,UACE,CAACH,QAAQA,SAASG,KAAKH,UAAU,CAACxB,UAAUA,WAAW2B,KAAK3B,YAAY,CAACC,UAAUA,WAAW0B,KAAK1B,OAAK;EAE/G;;;;EAMA6B,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAKxB,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEA0B,YAAQG,IAAIL,KAAKxB,EAAE;AACnB,UAAM8B,UAAU,KAAKR,YAAY;MAAE7B,QAAQ+B,KAAKxB;IAAG,CAAA,EAChD+B,IAAI,CAACX,SAAS,KAAKN,QAAQM,KAAK1B,MAAM,CAAA,EACtCwB,OAAOc,sBAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAACvC,WAAW,KAAK+B,UAAU/B,QAAQgC,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKG9B,mBAAAA;EAWR+B,QAAc;AACZ,SAAK7B,OAAOC,MAAML,SAAS;AAC3B,SAAKI,OAAOE,MAAMN,SAAS;AAC3B,WAAO;EACT;EAEAkC,SAAS/B,OAAoB;AAC3B,SAAKgC,SAAShC,MAAME,KAAK;AACzB,SAAK+B,SAASjC,MAAMG,KAAK;AACzB,WAAO;EACT;EAEA+B,UAAUC,QAAuB;AAC/BA,WAAOC,QAAQ,CAACpC,UAAAA;AACd,WAAKgC,SAAShC,MAAME,KAAK;AACzB,WAAK+B,SAASjC,MAAMG,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAkC,QAAQ7B,MAAkB;AACxBjB,yBAAAA,WAAUiB,KAAKb,IAAI,kBAAA;;;;;;;;;AACnBJ,yBAAAA,WAAU,CAAC,KAAKe,SAASE,KAAKb,EAAE,GAAG,wBAAwBa,KAAKb,EAAE,IAAE;;;;;;;;;AACpE,SAAKM,OAAOC,MAAMoC,KAAK9B,IAAAA;AACvB,WAAOA;EACT;EAEAwB,SAAS9B,OAAuB;AAC9B,WAAOA,MAAMwB,IAAI,CAAClB,SAAS,KAAK6B,QAAQ7B,IAAAA,CAAAA;EAC1C;EAEA+B,QAAQxB,MAAsC;AAC5CxB,yBAAAA,WAAUwB,KAAK3B,QAAM,QAAA;;;;;;;;;AACrBG,yBAAAA,WAAUwB,KAAK1B,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAAC0B,KAAKpB,IAAI;AAEZoB,aAAO;QAAEpB,IAAIR,aAAa4B,IAAAA;QAAO,GAAGA;MAAK;IAC3C;AACAxB,yBAAAA,WAAU,CAAC,KAAKe,SAASS,KAAKpB,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAKM,OAAOE,MAAMmC,KAAKvB,IAAAA;AACvB,WAAOA;EACT;EAEAkB,SAAS9B,OAAuB;AAC9B,WAAOA,MAAMuB,IAAI,CAACX,SAAS,KAAKwB,QAAQxB,IAAAA,CAAAA;EAC1C;EAEAyB,WAAW7C,IAAmB;AAC5B,UAAMQ,YAAQsC,sBAAe,KAAKxC,OAAOE,OAAiB,CAACY,SAASA,KAAK3B,WAAWO,MAAMoB,KAAK1B,WAAWM,EAAAA;AAC1G,UAAMO,YAAQuC,sBAAe,KAAKxC,OAAOC,OAAiB,CAACM,SAASA,KAAKb,OAAOA,EAAAA;AAChF,WAAO,KAAK+C,KAAK;MAAExC;MAAOC;IAAM,CAAA;EAClC;EAEAwC,YAAYC,KAAsB;AAChC,UAAMT,SAASS,IAAIlB,IAAI,CAAC/B,OAAO,KAAK6C,WAAW7C,EAAAA,CAAAA;AAC/C,WAAO,KAAK+C,KAAI,EAAGR,UAAUC,MAAAA;EAC/B;EAEAU,WAAWlD,IAAmB;AAC5B,UAAMQ,YAAQsC,sBAAe,KAAKxC,OAAOE,OAAiB,CAACY,SAASA,KAAKpB,OAAOA,EAAAA;AAChF,WAAO,KAAK+C,KAAK;MAAExC,OAAO,CAAA;MAAIC;IAAM,CAAA;EACtC;EAEA2C,YAAYF,KAAsB;AAChC,UAAMT,SAASS,IAAIlB,IAAI,CAAC/B,OAAO,KAAKkD,WAAWlD,EAAAA,CAAAA;AAC/C,WAAO,KAAK+C,KAAI,EAAGR,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAeY,uBAAf,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;EAEA1C,QAAQd,IAAkB;AACxB,WAAO,KAAKsD,MAAMxC,QAAQd,EAAAA;EAC5B;EAEA0C,QAAQ7B,MAAkB;AACxB,SAAKwC,OAAOX,QAAQ7B,IAAAA;AACpB,WAAO;EACT;EAEA+B,QAAQxB,MAAsC;AAC5C,SAAKiC,OAAOT,QAAQxB,IAAAA;AACpB,WAAO;EACT;EAEAiB,SAAS9B,OAAqB;AAC5B,SAAK8C,OAAOhB,SAAS9B,KAAAA;AACrB,WAAO;EACT;EAEA+B,SAAS9B,OAAqB;AAC5B,SAAK6C,OAAOf,SAAS9B,KAAAA;AACrB,WAAO;EACT;AACF;AAKO,IAAMiD,aAAN,MAAMA,oBAGHvB,mBAAAA;EACR,IAAawB,UAAU;AACrB,WAAO,IAAIC,aAAyB,IAAI;EAC1C;EAESZ,KAAK1C,OAAgD;AAC5D,WAAO,IAAIoD,YAAuB;MAAElD,OAAOF,OAAOE,SAAS,CAAA;MAAIC,OAAOH,OAAOG,SAAS,CAAA;IAAG,CAAA;EAC3F;AACF;AAQO,IAAMoD,YAAY,CAACN,OAAmBE,IAA4BK,OAAO,UAAK;AACnF,MAAIA,MAAM;AACRL,OAAGF,OAAOA,MAAMjD,KAAK;EACvB;AAEA,aAAOyD,4BAAO,MAAA;AACZN,OAAGF,OAAOA,MAAMjD,KAAK;EACvB,CAAA;AACF;AAKO,IAAM0D,qBAAN,MAAMA,4BAGHN,WAAAA;EACR,YAAYpD,OAAwB;AAClC,cACE2D,yBAAK;MACHzD,OAAOF,OAAOE,SAAS,CAAA;MACvBC,OAAOH,OAAOG,SAAS,CAAA;IACzB,CAAA,CAAA;EAEJ;EAESuC,KAAK1C,OAAwD;AACpE,WAAO,IAAI0D,oBAA+B1D,KAAAA;EAC5C;EAEAuD,UAAUJ,IAA4BK,OAAO,OAAmB;AAC9D,WAAOD,UAAU,MAAMJ,IAAIK,IAAAA;EAC7B;AACF;AAKO,IAAMF,eAAN,cAGGP,qBAAAA;EACCG,KAAKC,IAAmC;AAC/CA,OAAG,IAAI;AACP,WAAO;EACT;AACF;;AEjTO,IAAMS,iBAAN,MAAMA;EAIX,YAA6BC,gBAAyB,OAAO;SAAhCA,gBAAAA;SAHZC,gBAAiCC,6BAAO,oBAAIzC,IAAAA,CAAAA;SAC5C0C,mBAAeC,+BAAS,MAAMC,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA,CAAA;EAEvB;EAE9DhE,SAAiC;AAC/B,WAAO;MACLiE,UAAUJ,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA;IAClD;EACF;EAEA,IAAIE,OAAe;AACjB,WAAO,KAAKT,UAAUM,MAAMG;EAC9B;EAEA,IAAID,WAAqC;AACvC,WAAO,KAAKN;EACd;EAEAQ,SAAS7E,IAAqB;AAC5B,WAAO,KAAKmE,UAAUM,MAAM7C,IAAI5B,EAAAA;EAClC;EAEAmC,QAAc;AACZ,SAAKgC,UAAUM,QAAQ,oBAAI9C,IAAAA;EAC7B;EAEAE,IAAI7B,IAAkB;AACpBJ,0BAAAA,WAAUI,IAAAA,QAAAA;;;;;;;;;AACV,SAAKmE,UAAUM,QAAQ,IAAI9C,IACzB,KAAKuC,gBAAgB;MAAClE;QAAM;SAAIuE,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA;MAAK1E;KAAG;EAElF;EAEA8E,OAAO9E,IAAkB;AACvBJ,0BAAAA,WAAUI,IAAAA,QAAAA;;;;;;;;;AACV,SAAKmE,UAAUM,QAAQ,IAAI9C,IAAY4C,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA,EAAIxD,OAAO,CAAC6D,QAAQA,QAAQ/E,EAAAA,CAAAA;EAC3G;;EAIAgF,YAAY/B,KAAegC,QAAQ,OAAa;AAC9C,SAAKd,UAAUM,QAAQ,oBAAI9C,IAAI;SAAKsD,QAAQV,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA,IAAM,CAAA;SAAQzB;KAAI;EACtG;EAEAiC,eAAejC,KAAegC,QAAQ,OAAa;AACjD,UAAME,MAAM,IAAIxD,IAAYsD,QAAQV,MAAMC,KAAK,KAAKL,UAAUM,MAAMC,OAAM,CAAA,IAAMvE,MAAAA;AAChF8C,QAAIR,QAAQ,CAACzC,OAAAA;AACX,UAAI,KAAKmE,UAAUM,MAAM7C,IAAI5B,EAAAA,GAAK;AAChCmF,YAAIC,OAAOpF,EAAAA;MACb,OAAO;AACLmF,YAAItD,IAAI7B,EAAAA;MACV;IACF,CAAA;AAEA,SAAKmE,UAAUM,QAAQU;EACzB;AACF;ACxDO,IAAME,gBAAgBC,qBAAOC,OAAO;EACzCvF,IAAIsF,qBAAOE;EACXvE,MAAMqE,qBAAOG,SAASH,qBAAOE,MAAM;EACnCE,MAAMJ,qBAAOG,SAASH,qBAAOK,GAAG;AAClC,CAAA;AAqBO,IAAMC,gBAAgBN,qBAAOC,OAAO;EACzCvF,IAAIsF,qBAAOE;EACXvE,MAAMqE,qBAAOG,SAASH,qBAAOE,MAAM;EACnC/F,QAAQ6F,qBAAOE;EACf9F,QAAQ4F,qBAAOE;EACfE,MAAMJ,qBAAOG,SAASH,qBAAOK,GAAG;AAClC,CAAA;AAqBO,IAAME,QAAQP,qBAAOC,OAAO;EACjCvF,IAAIsF,qBAAOG,SAASH,qBAAOE,MAAM;EACjCjF,OAAO+E,qBAAOQ,QAAQR,qBAAOf,MAAMc,aAAAA,CAAAA;EACnC7E,OAAO8E,qBAAOQ,QAAQR,qBAAOf,MAAMqB,aAAAA,CAAAA;AACrC,CAAA;",
+  "names": ["import_invariant", "import_signals_core", "KEY_REGEX", "createEdgeId", "source", "target", "relation", "invariant", "match", "join", "parseEdgeId", "id", "split", "length", "undefined", "ReadonlyGraphModel", "graph", "_graph", "nodes", "edges", "inspectCustom", "toJSON", "findNode", "find", "node", "getNode", "failedInvariant", "filterNodes", "type", "filter", "findEdge", "edge", "getEdge", "filterEdges", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isNotFalsy", "flatMap", "AbstractGraphModel", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "push", "addEdge", "removeNode", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractGraphBuilder", "_model", "model", "call", "cb", "GraphModel", "builder", "GraphBuilder", "subscribe", "fire", "effect", "ReactiveGraphModel", "live", "SelectionModel", "_singleSelect", "_selected", "signal", "_selectedIds", "computed", "Array", "from", "value", "values", "selected", "size", "contains", "remove", "_id", "setSelected", "shift", "toggleSelected", "set", "delete", "BaseGraphNode", "Schema", "Struct", "String", "optional", "data", "Any", "BaseGraphEdge", "Graph", "mutable"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/graph/src/util.ts":{"bytes":3370,"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/model.ts":{"bytes":23766,"imports":[{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/types.ts":{"bytes":4760,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/create.ts":{"bytes":6283,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/schema","kind":"import-statement","external":true},{"path":"packages/common/graph/src/model.ts","kind":"import-statement","original":"./model"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/index.ts":{"bytes":733,"imports":[{"path":"packages/common/graph/src/create.ts","kind":"import-statement","original":"./create"},{"path":"packages/common/graph/src/model.ts","kind":"import-statement","original":"./model"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"}},"outputs":{"packages/common/graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":18963},"packages/common/graph/dist/lib/node/index.cjs":{"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/schema","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true}],"exports":["AbstractGraphBuilder","AbstractGraphModel","BaseGraphEdge","BaseGraphNode","Graph","GraphBuilder","GraphModel","ReadonlyGraphModel","createEdgeId","createGraph","parseEdgeId"],"entryPoint":"packages/common/graph/src/index.ts","inputs":{"packages/common/graph/src/create.ts":{"bytesInOutput":1334},"packages/common/graph/src/model.ts":{"bytesInOutput":5439},"packages/common/graph/src/util.ts":{"bytesInOutput":1027},"packages/common/graph/src/types.ts":{"bytesInOutput":670},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":8937}}}
+{"inputs":{"packages/common/graph/src/util.ts":{"bytes":3270,"imports":[{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/model.ts":{"bytes":25676,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/selection.ts":{"bytes":7405,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/types.ts":{"bytes":4619,"imports":[{"path":"effect","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/index.ts":{"bytes":704,"imports":[{"path":"packages/common/graph/src/model.ts","kind":"import-statement","original":"./model"},{"path":"packages/common/graph/src/selection.ts","kind":"import-statement","original":"./selection"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"}},"outputs":{"packages/common/graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":20774},"packages/common/graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true}],"exports":["AbstractGraphBuilder","AbstractGraphModel","BaseGraphEdge","BaseGraphNode","Graph","GraphBuilder","GraphModel","ReactiveGraphModel","ReadonlyGraphModel","SelectionModel","createEdgeId","parseEdgeId","subscribe"],"entryPoint":"packages/common/graph/src/index.ts","inputs":{"packages/common/graph/src/model.ts":{"bytesInOutput":5705},"packages/common/graph/src/util.ts":{"bytesInOutput":1027},"packages/common/graph/src/index.ts":{"bytesInOutput":0},"packages/common/graph/src/selection.ts":{"bytesInOutput":1875},"packages/common/graph/src/types.ts":{"bytesInOutput":534}},"bytes":9609}}}