@dxos/graph 0.7.5-labs.e27f9b9 → 0.7.5-main.2567c87

package/dist/lib/node/index.cjs

@@ -18,28 +18,23 @@ var __copyProps = (to, from, except, desc) => {
 var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
 var node_exports = {};
 __export(node_exports, {
-  AbstractGraphBuilder: () => AbstractGraphBuilder,
-  AbstractGraphModel: () => AbstractGraphModel,
   BaseGraphEdge: () => BaseGraphEdge,
   BaseGraphNode: () => BaseGraphNode,
   Graph: () => Graph,
-  GraphBuilder: () => GraphBuilder,
   GraphModel: () => GraphModel,
   ReadonlyGraphModel: () => ReadonlyGraphModel,
   createEdgeId: () => createEdgeId,
   createGraph: () => createGraph,
+  emptyGraph: () => emptyGraph,
   parseEdgeId: () => parseEdgeId
 });
 module.exports = __toCommonJS(node_exports);
-var import_debug = require("@dxos/debug");
+var import_echo_schema = require("@dxos/echo-schema");
 var import_invariant = require("@dxos/invariant");
 var import_live_object = require("@dxos/live-object");
-var import_util = require("@dxos/util");
-var import_echo_schema = require("@dxos/echo-schema");
-var import_invariant2 = require("@dxos/invariant");
-var import_live_object2 = require("@dxos/live-object");
 var import_log = require("@dxos/log");
 var import_schema = require("@dxos/schema");
+var import_live_object2 = require("@dxos/live-object");
 var import_echo_schema2 = require("@dxos/echo-schema");
 var BaseGraphNode = import_echo_schema2.S.Struct({
   id: import_echo_schema2.S.String,
@@ -49,136 +44,39 @@ var BaseGraphNode = import_echo_schema2.S.Struct({
 var BaseGraphEdge = import_echo_schema2.S.Struct({
   id: import_echo_schema2.S.String,
   type: import_echo_schema2.S.optional(import_echo_schema2.S.String),
-  data: import_echo_schema2.S.optional(import_echo_schema2.S.Any),
   source: import_echo_schema2.S.String,
-  target: import_echo_schema2.S.String
+  target: import_echo_schema2.S.String,
+  data: import_echo_schema2.S.optional(import_echo_schema2.S.Any)
 });
-var ExtendableBaseGraphNode = import_echo_schema2.S.extend(BaseGraphNode, import_echo_schema2.S.Struct({}, {
-  key: import_echo_schema2.S.String,
-  value: import_echo_schema2.S.Any
-}));
 var Graph = import_echo_schema2.S.Struct({
-  id: import_echo_schema2.S.optional(import_echo_schema2.S.String),
-  nodes: import_echo_schema2.S.mutable(import_echo_schema2.S.Array(ExtendableBaseGraphNode)),
+  nodes: import_echo_schema2.S.mutable(import_echo_schema2.S.Array(BaseGraphNode)),
   edges: import_echo_schema2.S.mutable(import_echo_schema2.S.Array(BaseGraphEdge))
 });
-var __dxlog_file = "/home/runner/work/dxos/dxos/packages/common/graph/src/util.ts";
-var KEY_REGEX = /\w+/;
-var createEdgeId = ({ source, target, relation }) => {
-  (0, import_invariant2.invariant)(source.match(KEY_REGEX), `invalid source: ${source}`, {
-    F: __dxlog_file,
-    L: 21,
-    S: void 0,
-    A: [
-      "source.match(KEY_REGEX)",
-      "`invalid source: ${source}`"
-    ]
-  });
-  (0, import_invariant2.invariant)(target.match(KEY_REGEX), `invalid target: ${target}`, {
-    F: __dxlog_file,
-    L: 22,
-    S: void 0,
-    A: [
-      "target.match(KEY_REGEX)",
-      "`invalid target: ${target}`"
-    ]
-  });
-  return [
-    source,
-    relation,
-    target
-  ].join("_");
+var emptyGraph = {
+  nodes: [],
+  edges: []
 };
-var parseEdgeId = (id) => {
-  const [source, relation, target] = id.split("_");
-  (0, import_invariant2.invariant)(source.length && target.length, void 0, {
-    F: __dxlog_file,
-    L: 28,
-    S: void 0,
-    A: [
-      "source.length && target.length",
-      ""
-    ]
-  });
-  return {
-    source,
-    relation: relation.length ? relation : void 0,
-    target
-  };
-};
-var createGraph = (objects) => {
-  const graph = new GraphModel((0, import_live_object2.create)(Graph, {
-    nodes: [],
-    edges: []
-  }));
-  objects.forEach((object) => {
-    graph.addNode({
-      id: object.id,
-      type: object.typename,
-      data: object
-    });
-  });
-  objects.forEach((object) => {
-    const schema = (0, import_live_object2.getSchema)(object);
-    if (!schema) {
-      import_log.log.info("no schema for object", {
-        id: object.id.slice(0, 8)
-      }, {
-        F: __dxlog_file,
-        L: 48,
-        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
-          });
-        }
-      }
+var removeElements = (array, predicate) => {
+  const deleted = [];
+  for (let i = array.length - 1; i >= 0; i--) {
+    if (predicate(array[i], i)) {
+      deleted.push(...array.splice(i, 1));
     }
-  });
-  return graph;
+  }
+  return deleted;
 };
-var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/common/graph/src/model.ts";
 var ReadonlyGraphModel = class {
-  /**
-  * NOTE: Pass in simple Graph or ReactiveObject.
-  */
-  constructor(graph) {
-    this._graph = graph ?? {
-      nodes: [],
-      edges: []
-    };
-  }
-  [import_debug.inspectCustom]() {
-    return this.toJSON();
-  }
-  /**
-  * Return stable sorted JSON representation of graph.
-  */
-  // TODO(burdon): Create separate toJson method with computed signal.
-  toJSON() {
-    const { id, nodes, edges } = (0, import_live_object.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,
+  constructor({ nodes = [], edges = [] } = {}) {
+    this._graph = (0, import_live_object2.create)(Graph, {
       nodes,
       edges
     });
   }
+  toJSON() {
+    this._graph.nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));
+    this._graph.edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));
+    return JSON.parse(JSON.stringify(this._graph));
+  }
   get graph() {
     return this._graph;
   }
@@ -188,51 +86,20 @@ var ReadonlyGraphModel = class {
   get edges() {
     return this._graph.edges;
   }
-  //
-  // Nodes
-  //
-  findNode(id) {
-    return this.nodes.find((node) => node.id === id);
-  }
   getNode(id) {
-    return this.findNode(id) ?? (0, import_invariant.failedInvariant)();
+    return this.nodes.find((node) => node.id === id);
   }
-  filterNodes({ type } = {}) {
+  getNodes({ type }) {
     return this.nodes.filter((node) => !type || type === node.type);
   }
-  //
-  // Edges
-  //
-  findEdge(id) {
-    return this.edges.find((edge) => edge.id === id);
-  }
   getEdge(id) {
-    return this.findEdge(id) ?? (0, import_invariant.failedInvariant)();
+    return this.edges.find((edge) => edge.id === id);
   }
-  filterEdges({ type, source, target } = {}) {
+  getEdges({ type, source, target }) {
     return this.edges.filter((edge) => (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target));
   }
-  //
-  // Traverse
-  //
-  traverse(root) {
-    return this._traverse(root);
-  }
-  _traverse(root, visited = /* @__PURE__ */ new Set()) {
-    if (visited.has(root.id)) {
-      return [];
-    }
-    visited.add(root.id);
-    const targets = this.filterEdges({
-      source: root.id
-    }).map((edge) => this.getNode(edge.target)).filter(import_util.isNotFalsy);
-    return [
-      root,
-      ...targets.flatMap((target) => this._traverse(target, visited))
-    ];
-  }
 };
-var AbstractGraphModel = class extends ReadonlyGraphModel {
+var GraphModel = class _GraphModel extends ReadonlyGraphModel {
   clear() {
     this._graph.nodes.length = 0;
     this._graph.edges.length = 0;
@@ -251,154 +118,116 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
     return this;
   }
   addNode(node) {
-    (0, import_invariant.invariant)(node.id, "ID is required", {
-      F: __dxlog_file2,
-      L: 153,
-      S: this,
-      A: [
-        "node.id",
-        "'ID is required'"
-      ]
-    });
-    (0, import_invariant.invariant)(!this.findNode(node.id), `node already exists: ${node.id}`, {
-      F: __dxlog_file2,
-      L: 154,
-      S: this,
-      A: [
-        "!this.findNode(node.id)",
-        "`node already exists: ${node.id}`"
-      ]
-    });
     this._graph.nodes.push(node);
-    return node;
+    return this;
   }
   addNodes(nodes) {
-    return nodes.map((node) => this.addNode(node));
+    nodes.forEach((node) => this.addNode(node));
+    return this;
   }
   addEdge(edge) {
-    (0, import_invariant.invariant)(edge.source, void 0, {
-      F: __dxlog_file2,
-      L: 164,
-      S: this,
-      A: [
-        "edge.source",
-        ""
-      ]
-    });
-    (0, import_invariant.invariant)(edge.target, void 0, {
-      F: __dxlog_file2,
-      L: 165,
-      S: this,
-      A: [
-        "edge.target",
-        ""
-      ]
-    });
-    if (!edge.id) {
-      edge = {
-        id: createEdgeId(edge),
-        ...edge
-      };
-    }
-    (0, import_invariant.invariant)(!this.findNode(edge.id), void 0, {
-      F: __dxlog_file2,
-      L: 170,
-      S: this,
-      A: [
-        "!this.findNode(edge.id!)",
-        ""
-      ]
-    });
     this._graph.edges.push(edge);
-    return edge;
+    return this;
   }
   addEdges(edges) {
-    return edges.map((edge) => this.addEdge(edge));
+    edges.forEach((edge) => this.addEdge(edge));
+    return this;
   }
+  // TODO(burdon): Return graph.
   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);
-    return this.copy({
+    const nodes = removeElements(this._graph.nodes, (node) => node.id === id);
+    const edges = removeElements(this._graph.edges, (edge) => edge.source === id || edge.target === id);
+    return new _GraphModel({
       nodes,
       edges
     });
   }
   removeNodes(ids) {
     const graphs = ids.map((id) => this.removeNode(id));
-    return this.copy().addGraphs(graphs);
+    return new _GraphModel().addGraphs(graphs);
   }
   removeEdge(id) {
-    const edges = (0, import_util.removeBy)(this._graph.edges, (edge) => edge.id === id);
-    return this.copy({
-      nodes: [],
+    const edges = removeElements(this._graph.edges, (edge) => edge.id === id);
+    return new _GraphModel({
       edges
     });
   }
   removeEdges(ids) {
     const graphs = ids.map((id) => this.removeEdge(id));
-    return this.copy().addGraphs(graphs);
+    return new _GraphModel().addGraphs(graphs);
   }
 };
-var AbstractGraphBuilder = class {
-  constructor(_model) {
-    this._model = _model;
-  }
-  get model() {
-    return this._model;
-  }
-  call(cb) {
-    cb(this);
-    return this;
-  }
-  getNode(id) {
-    return this.model.getNode(id);
-  }
-  addNode(node) {
-    this._model.addNode(node);
-    return this;
-  }
-  addEdge(edge) {
-    this._model.addEdge(edge);
-    return this;
-  }
-  addNodes(nodes) {
-    this._model.addNodes(nodes);
-    return this;
-  }
-  addEdges(edges) {
-    this._model.addEdges(edges);
-    return this;
-  }
+var __dxlog_file = "/home/runner/work/dxos/dxos/packages/common/graph/src/buidler.ts";
+var createEdgeId = ({ source, target, relation }) => `${source}-${relation}-${target}`;
+var parseEdgeId = (id) => {
+  const [source, relation, target] = id.split("-");
+  (0, import_invariant.invariant)(source && target && relation, void 0, {
+    F: __dxlog_file,
+    L: 22,
+    S: void 0,
+    A: [
+      "source && target && relation",
+      ""
+    ]
+  });
+  return {
+    source,
+    relation,
+    target
+  };
 };
-var GraphModel = class _GraphModel extends AbstractGraphModel {
-  get builder() {
-    return new GraphBuilder(this);
-  }
-  copy(graph) {
-    return new _GraphModel({
-      nodes: graph?.nodes ?? [],
-      edges: graph?.edges ?? []
+var createGraph = (objects) => {
+  const graph = new GraphModel();
+  objects.forEach((object) => {
+    graph.addNode({
+      id: object.id,
+      type: object.typename,
+      data: object
     });
-  }
-};
-var GraphBuilder = class extends AbstractGraphBuilder {
-  call(cb) {
-    cb(this);
-    return this;
-  }
+  });
+  objects.forEach((object) => {
+    const schema = (0, import_live_object.getSchema)(object);
+    if (!schema) {
+      import_log.log.info("no schema for object", {
+        id: object.id.slice(0, 8)
+      }, {
+        F: __dxlog_file,
+        L: 41,
+        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,
-  AbstractGraphModel,
   BaseGraphEdge,
   BaseGraphNode,
   Graph,
-  GraphBuilder,
   GraphModel,
   ReadonlyGraphModel,
   createEdgeId,
   createGraph,
+  emptyGraph,
   parseEdgeId
 });
 //# sourceMappingURL=index.cjs.map

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/model.ts", "../../../src/util.ts", "../../../src/types.ts"],
-  "sourcesContent": ["//\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 Graph, type GraphNode, type GraphEdge, type BaseGraphNode, type BaseGraphEdge } 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 ReactiveObject.\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 2023 DXOS.org\n//\n\nimport { type ReactiveEchoObject } from '@dxos/echo-db';\nimport { FormatEnum } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { getSchema, create } 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';\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 * Creates a new reactive graph from a set of ECHO objects.\n * References are mapped onto graph edges.\n */\nexport const createGraph = (objects: ReactiveEchoObject<any>[]): GraphModel<GraphNode<ReactiveEchoObject<any>>> => {\n  const graph = new GraphModel<GraphNode<ReactiveEchoObject<any>>>(create(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 { S } from '@dxos/echo-schema';\nimport { type Specialize } from '@dxos/util';\n\nexport const BaseGraphNode = S.Struct({\n  id: S.String,\n  type: S.optional(S.String),\n  data: S.optional(S.Any),\n});\n\n/** Raw base type. */\nexport type BaseGraphNode = S.Schema.Type<typeof BaseGraphNode>;\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 = S.Struct({\n  id: S.String,\n  type: S.optional(S.String),\n  data: S.optional(S.Any),\n  source: S.String,\n  target: S.String,\n});\n\n/** Raw base type. */\nexport type BaseGraphEdge = S.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 = S.extend(BaseGraphNode, S.Struct({}, { key: S.String, value: S.Any }));\n\n/**\n * Generic graph.\n */\nexport const Graph = S.Struct({\n  id: S.optional(S.String),\n  nodes: S.mutable(S.Array(ExtendableBaseGraphNode)),\n  edges: S.mutable(S.Array(BaseGraphEdge)),\n});\n\nexport type Graph = S.Schema.Type<typeof Graph>;\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,mBAA8B;AAC9B,uBAA2C;AAC3C,yBAA4B;AAC5B,kBAAwE;ACFxE,yBAA2B;AAC3B,IAAAA,oBAA0B;AAC1B,IAAAC,sBAAkC;AAClC,iBAAoB;AACpB,oBAAoC;ACLpC,IAAAC,sBAAkB;AAGX,IAAMC,gBAAgBC,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;AACxB,CAAA;AAcO,IAAMC,gBAAgBR,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;EACtBE,QAAQT,sBAAEG;EACVO,QAAQV,sBAAEG;AACZ,CAAA;AAkBA,IAAMQ,0BAA0BX,sBAAEY,OAAOb,eAAeC,sBAAEC,OAAO,CAAC,GAAG;EAAEY,KAAKb,sBAAEG;EAAQW,OAAOd,sBAAEO;AAAI,CAAA,CAAA;AAK5F,IAAMQ,QAAQf,sBAAEC,OAAO;EAC5BC,IAAIF,sBAAEK,SAASL,sBAAEG,MAAM;EACvBa,OAAOhB,sBAAEiB,QAAQjB,sBAAEkB,MAAMP,uBAAAA,CAAAA;EACzBQ,OAAOnB,sBAAEiB,QAAQjB,sBAAEkB,MAAMV,aAAAA,CAAAA;AAC3B,CAAA;;AD5CA,IAAMY,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEZ,QAAQC,QAAQY,SAAQ,MAAY;AACjEC,mCAAUd,OAAOe,MAAMJ,SAAAA,GAAY,mBAAmBX,MAAAA,IAAQ;;;;;;;;;AAC9Dc,mCAAUb,OAAOc,MAAMJ,SAAAA,GAAY,mBAAmBV,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQa;IAAUZ;IAAQe,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACxB,OAAAA;AAC1B,QAAM,CAACO,QAAQa,UAAUZ,MAAAA,IAAUR,GAAGyB,MAAM,GAAA;AAC5CJ,mCAAUd,OAAOmB,UAAUlB,OAAOkB,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAEnB;IAAQa,UAAUA,SAASM,SAASN,WAAWO;IAAWnB;EAAO;AAC5E;AAMO,IAAMoB,cAAc,CAACC,YAAAA;AAC1B,QAAMC,QAAQ,IAAIC,eAA+CC,4BAAOnB,OAAO;IAAEC,OAAO,CAAA;IAAIG,OAAO,CAAA;EAAG,CAAA,CAAA;AAGtGY,UAAQI,QAAQ,CAACC,WAAAA;AACfJ,UAAMK,QAAQ;MAAEnC,IAAIkC,OAAOlC;MAAIE,MAAMgC,OAAOE;MAAUhC,MAAM8B;IAAO,CAAA;EACrE,CAAA;AAGAL,UAAQI,QAAQ,CAACC,WAAAA;AACf,UAAMG,aAASC,+BAAUJ,MAAAA;AACzB,QAAI,CAACG,QAAQ;AACXE,qBAAIC,KAAK,wBAAwB;QAAExC,IAAIkC,OAAOlC,GAAGyC,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,YAAQC,mCAAoBN,OAAOO,KAAKV,MAAAA,GAAS;AAC1D,UAAIQ,KAAKG,WAAWC,8BAAWC,KAAK;AAClC,cAAMxC,SAAS2B;AACf,cAAM1B,SAAS0B,OAAOQ,KAAKM,IAAI,GAAGxC;AAClC,YAAIA,QAAQ;AACVsB,gBAAMmB,QAAQ;YACZjD,IAAImB,aAAa;cAAEZ,QAAQA,OAAOP;cAAIQ,QAAQA,OAAOR;cAAIoB,UAAUnB,OAAOyC,KAAKM,IAAI;YAAE,CAAA;YACrFzC,QAAQA,OAAOP;YACfQ,QAAQA,OAAOR;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAO8B;AACT;;ADrDO,IAAMoB,qBAAN,MAAMA;;;;EASXC,YAAYrB,OAAe;AACzB,SAAKsB,SAAStB,SAAS;MAAEhB,OAAO,CAAA;MAAIG,OAAO,CAAA;IAAG;EAChD;EAEA,CAACoC,0BAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;;EAMAA,SAAS;AACP,UAAM,EAAEtD,IAAIc,OAAOG,MAAK,QAAKsC,gCAAY,KAAKH,MAAM;AACpDtC,UAAM0C,KAAK,CAAC,EAAExD,IAAIyD,EAAC,GAAI,EAAEzD,IAAI0D,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrDzC,UAAMuC,KAAK,CAAC,EAAExD,IAAIyD,EAAC,GAAI,EAAEzD,IAAI0D,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrD,eAAOE,4BAAe;MAAE5D;MAAIc;MAAOG;IAAM,CAAA;EAC3C;EAEA,IAAIa,QAAe;AACjB,WAAO,KAAKsB;EACd;EAEA,IAAItC,QAAgB;AAClB,WAAO,KAAKsC,OAAOtC;EACrB;EAEA,IAAIG,QAAgB;AAClB,WAAO,KAAKmC,OAAOnC;EACrB;;;;EAMA4C,SAAS7D,IAA8B;AACrC,WAAO,KAAKc,MAAMgD,KAAK,CAACC,SAASA,KAAK/D,OAAOA,EAAAA;EAC/C;EAEAgE,QAAQhE,IAAkB;AACxB,WAAO,KAAK6D,SAAS7D,EAAAA,SAAOiE,kCAAAA;EAC9B;EAEAC,YAAY,EAAEhE,KAAI,IAAyB,CAAC,GAAW;AACrD,WAAO,KAAKY,MAAMqD,OAAO,CAACJ,SAAS,CAAC7D,QAAQA,SAAS6D,KAAK7D,IAAI;EAChE;;;;EAMAkE,SAASpE,IAA8B;AACrC,WAAO,KAAKiB,MAAM6C,KAAK,CAACO,SAASA,KAAKrE,OAAOA,EAAAA;EAC/C;EAEAsE,QAAQtE,IAAkB;AACxB,WAAO,KAAKoE,SAASpE,EAAAA,SAAOiE,kCAAAA;EAC9B;EAEAM,YAAY,EAAErE,MAAMK,QAAQC,OAAM,IAAyB,CAAC,GAAW;AACrE,WAAO,KAAKS,MAAMkD,OAChB,CAACE,UACE,CAACnE,QAAQA,SAASmE,KAAKnE,UAAU,CAACK,UAAUA,WAAW8D,KAAK9D,YAAY,CAACC,UAAUA,WAAW6D,KAAK7D,OAAK;EAE/G;;;;EAMAgE,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAKzE,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEA2E,YAAQG,IAAIL,KAAKzE,EAAE;AACnB,UAAM+E,UAAU,KAAKR,YAAY;MAAEhE,QAAQkE,KAAKzE;IAAG,CAAA,EAChDgF,IAAI,CAACX,SAAS,KAAKL,QAAQK,KAAK7D,MAAM,CAAA,EACtC2D,OAAOc,sBAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAAC1E,WAAW,KAAKkE,UAAUlE,QAAQmE,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKGjC,mBAAAA;EAWRkC,QAAc;AACZ,SAAKhC,OAAOtC,MAAMY,SAAS;AAC3B,SAAK0B,OAAOnC,MAAMS,SAAS;AAC3B,WAAO;EACT;EAEA2D,SAASvD,OAAoB;AAC3B,SAAKwD,SAASxD,MAAMhB,KAAK;AACzB,SAAKyE,SAASzD,MAAMb,KAAK;AACzB,WAAO;EACT;EAEAuE,UAAUC,QAAuB;AAC/BA,WAAOxD,QAAQ,CAACH,UAAAA;AACd,WAAKwD,SAASxD,MAAMhB,KAAK;AACzB,WAAKyE,SAASzD,MAAMb,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAkB,QAAQ4B,MAAkB;AACxB1C,yBAAAA,WAAU0C,KAAK/D,IAAI,kBAAA;;;;;;;;;AACnBqB,yBAAAA,WAAU,CAAC,KAAKwC,SAASE,KAAK/D,EAAE,GAAG,wBAAwB+D,KAAK/D,EAAE,IAAE;;;;;;;;;AACpE,SAAKoD,OAAOtC,MAAM4E,KAAK3B,IAAAA;AACvB,WAAOA;EACT;EAEAuB,SAASxE,OAAuB;AAC9B,WAAOA,MAAMkE,IAAI,CAACjB,SAAS,KAAK5B,QAAQ4B,IAAAA,CAAAA;EAC1C;EAEAd,QAAQoB,MAAsC;AAC5ChD,yBAAAA,WAAUgD,KAAK9D,QAAM,QAAA;;;;;;;;;AACrBc,yBAAAA,WAAUgD,KAAK7D,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAAC6D,KAAKrE,IAAI;AAEZqE,aAAO;QAAErE,IAAImB,aAAakD,IAAAA;QAAO,GAAGA;MAAK;IAC3C;AACAhD,yBAAAA,WAAU,CAAC,KAAKwC,SAASQ,KAAKrE,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAKoD,OAAOnC,MAAMyE,KAAKrB,IAAAA;AACvB,WAAOA;EACT;EAEAkB,SAAStE,OAAuB;AAC9B,WAAOA,MAAM+D,IAAI,CAACX,SAAS,KAAKpB,QAAQoB,IAAAA,CAAAA;EAC1C;EAEAsB,WAAW3F,IAAmB;AAC5B,UAAMc,YAAQ8E,sBAAe,KAAKxC,OAAOtC,OAAiB,CAACiD,SAASA,KAAK/D,OAAOA,EAAAA;AAChF,UAAMiB,YAAQ2E,sBAAe,KAAKxC,OAAOnC,OAAiB,CAACoD,SAASA,KAAK9D,WAAWP,MAAMqE,KAAK7D,WAAWR,EAAAA;AAC1G,WAAO,KAAK6F,KAAK;MAAE/E;MAAOG;IAAM,CAAA;EAClC;EAEA6E,YAAYC,KAAsB;AAChC,UAAMN,SAASM,IAAIf,IAAI,CAAChF,OAAO,KAAK2F,WAAW3F,EAAAA,CAAAA;AAC/C,WAAO,KAAK6F,KAAI,EAAGL,UAAUC,MAAAA;EAC/B;EAEAO,WAAWhG,IAAmB;AAC5B,UAAMiB,YAAQ2E,sBAAe,KAAKxC,OAAOnC,OAAiB,CAACoD,SAASA,KAAKrE,OAAOA,EAAAA;AAChF,WAAO,KAAK6F,KAAK;MAAE/E,OAAO,CAAA;MAAIG;IAAM,CAAA;EACtC;EAEAgF,YAAYF,KAAsB;AAChC,UAAMN,SAASM,IAAIf,IAAI,CAAChF,OAAO,KAAKgG,WAAWhG,EAAAA,CAAAA;AAC/C,WAAO,KAAK6F,KAAI,EAAGL,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAeS,uBAAf,MAAeA;EAKpB/C,YAA+BgD,QAAe;SAAfA,SAAAA;EAAgB;EAE/C,IAAIC,QAAe;AACjB,WAAO,KAAKD;EACd;EAEAE,KAAKC,IAAmC;AACtCA,OAAG,IAAI;AACP,WAAO;EACT;EAEAtC,QAAQhE,IAAkB;AACxB,WAAO,KAAKoG,MAAMpC,QAAQhE,EAAAA;EAC5B;EAEAmC,QAAQ4B,MAAkB;AACxB,SAAKoC,OAAOhE,QAAQ4B,IAAAA;AACpB,WAAO;EACT;EAEAd,QAAQoB,MAAsC;AAC5C,SAAK8B,OAAOlD,QAAQoB,IAAAA;AACpB,WAAO;EACT;EAEAiB,SAASxE,OAAqB;AAC5B,SAAKqF,OAAOb,SAASxE,KAAAA;AACrB,WAAO;EACT;EAEAyE,SAAStE,OAAqB;AAC5B,SAAKkF,OAAOZ,SAAStE,KAAAA;AACrB,WAAO;EACT;AACF;AAEO,IAAMc,aAAN,MAAMA,oBAGHoD,mBAAAA;EACR,IAAaoB,UAAU;AACrB,WAAO,IAAIC,aAAyB,IAAI;EAC1C;EAESX,KAAK/D,OAAwB;AACpC,WAAO,IAAIC,YAAuB;MAAEjB,OAAOgB,OAAOhB,SAAS,CAAA;MAAIG,OAAOa,OAAOb,SAAS,CAAA;IAAG,CAAA;EAC3F;AACF;AAEO,IAAMuF,eAAN,cAGGN,qBAAAA;EACCG,KAAKC,IAA6B;AACzCA,OAAG,IAAI;AACP,WAAO;EACT;AACF;",
-  "names": ["import_invariant", "import_live_object", "import_echo_schema", "BaseGraphNode", "S", "Struct", "id", "String", "type", "optional", "data", "Any", "BaseGraphEdge", "source", "target", "ExtendableBaseGraphNode", "extend", "key", "value", "Graph", "nodes", "mutable", "Array", "edges", "KEY_REGEX", "createEdgeId", "relation", "invariant", "match", "join", "parseEdgeId", "split", "length", "undefined", "createGraph", "objects", "graph", "GraphModel", "create", "forEach", "object", "addNode", "typename", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name", "addEdge", "ReadonlyGraphModel", "constructor", "_graph", "inspectCustom", "toJSON", "getSnapshot", "sort", "a", "b", "localeCompare", "stripUndefined", "findNode", "find", "node", "getNode", "failedInvariant", "filterNodes", "filter", "findEdge", "edge", "getEdge", "filterEdges", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isNotFalsy", "flatMap", "AbstractGraphModel", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "push", "removeNode", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractGraphBuilder", "_model", "model", "call", "cb", "builder", "GraphBuilder"]
+  "sources": ["../../../src/buidler.ts", "../../../src/graph.ts", "../../../src/types.ts", "../../../src/util.ts"],
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { type ReactiveEchoObject } from '@dxos/echo-db';\nimport { FormatEnum } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { getSchema } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { getSchemaProperties } from '@dxos/schema';\n\nimport { GraphModel } from './graph';\nimport { type GraphNode } from './types';\n\n// NOTE: The `relation` is different from the `type`.\ntype Edge = { source: string; target: string; relation: string };\n\nexport const createEdgeId = ({ source, target, relation }: Edge) => `${source}-${relation}-${target}`;\n\nexport const parseEdgeId = (id: string): Edge => {\n  const [source, relation, target] = id.split('-');\n  invariant(source && target && relation);\n  return { source, relation, target };\n};\n\n/**\n * Maps an ECHO object graph onto a layout graph.\n */\nexport const createGraph = (objects: ReactiveEchoObject<any>[]): GraphModel<GraphNode<ReactiveEchoObject<any>>> => {\n  const graph = new GraphModel<GraphNode<ReactiveEchoObject<any>>>();\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 { create } from '@dxos/live-object';\n\nimport { Graph, type GraphNode, type GraphEdge } from './types';\nimport { removeElements } from './util';\n\n// TODO(burdon): Traversal/visitor.\n\n/**\n * Typed reactive object graph.\n */\nexport class ReadonlyGraphModel<Node extends GraphNode = any, Edge extends GraphEdge = any> {\n  protected readonly _graph: Graph;\n\n  constructor({ nodes = [], edges = [] }: Partial<Graph> = {}) {\n    this._graph = create(Graph, { nodes, edges });\n  }\n\n  toJSON() {\n    // Sort to enable stable comparisons.\n    this._graph.nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n    this._graph.edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n    return JSON.parse(JSON.stringify(this._graph));\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  getNode(id: string): Node | undefined {\n    return this.nodes.find((node) => node.id === id);\n  }\n\n  getNodes({ type }: Partial<Node>): Node[] {\n    return this.nodes.filter((node) => !type || type === node.type);\n  }\n\n  getEdge(id: string): Edge | undefined {\n    return this.edges.find((edge) => edge.id === id);\n  }\n\n  getEdges({ type, source, target }: Partial<Edge>): 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\nexport class GraphModel<Node extends GraphNode = any, Edge extends GraphEdge = any> extends ReadonlyGraphModel<\n  Node,\n  Edge\n> {\n  clear(): this {\n    this._graph.nodes.length = 0;\n    this._graph.edges.length = 0;\n    return this;\n  }\n\n  addGraph(graph: GraphModel<Node, Edge>): this {\n    this.addNodes(graph.nodes);\n    this.addEdges(graph.edges);\n    return this;\n  }\n\n  addGraphs(graphs: GraphModel<Node, Edge>[]): 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): this {\n    this._graph.nodes.push(node);\n    return this;\n  }\n\n  addNodes(nodes: Node[]): this {\n    nodes.forEach((node) => this.addNode(node));\n    return this;\n  }\n\n  addEdge(edge: Edge): this {\n    this._graph.edges.push(edge);\n    return this;\n  }\n\n  addEdges(edges: Edge[]): this {\n    edges.forEach((edge) => this.addEdge(edge));\n    return this;\n  }\n\n  // TODO(burdon): Return graph.\n\n  removeNode(id: string): GraphModel<Node, Edge> {\n    const nodes = removeElements(this._graph.nodes, (node) => node.id === id);\n    const edges = removeElements(this._graph.edges, (edge) => edge.source === id || edge.target === id);\n    return new GraphModel<Node, Edge>({ nodes, edges });\n  }\n\n  removeNodes(ids: string[]): GraphModel<Node, Edge> {\n    const graphs = ids.map((id) => this.removeNode(id));\n    return new GraphModel<Node, Edge>().addGraphs(graphs);\n  }\n\n  removeEdge(id: string): GraphModel<Node, Edge> {\n    const edges = removeElements(this._graph.edges, (edge) => edge.id === id);\n    return new GraphModel<Node, Edge>({ edges });\n  }\n\n  removeEdges(ids: string[]): GraphModel<Node, Edge> {\n    const graphs = ids.map((id) => this.removeEdge(id));\n    return new GraphModel<Node, Edge>().addGraphs(graphs);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { S } from '@dxos/echo-schema';\n\n// Prior art:\n// - https://graphology.github.io (TS, tree-shakable, multiple packages for extensions)\n// - https://github.com/dagrejs/graphlib (mature, extensive)\n// - https://github.com/avoidwork/tiny-graph\n\nexport const BaseGraphNode = S.Struct({\n  id: S.String,\n  type: S.optional(S.String),\n  data: S.optional(S.Any),\n});\n\nexport type BaseGraphNode = S.Schema.Type<typeof BaseGraphNode>;\nexport type GraphNode<Data extends object | void = void> = BaseGraphNode & { data: Data };\n\nexport const BaseGraphEdge = S.Struct({\n  id: S.String,\n  type: S.optional(S.String),\n  source: S.String,\n  target: S.String,\n  data: S.optional(S.Any),\n});\n\nexport type BaseGraphEdge = S.Schema.Type<typeof BaseGraphEdge>;\nexport type GraphEdge<Data extends object | void = void> = BaseGraphEdge & { data: Data };\n\n/**\n * Generic graph abstraction.\n */\nexport const Graph = S.Struct({\n  nodes: S.mutable(S.Array(BaseGraphNode)),\n  edges: S.mutable(S.Array(BaseGraphEdge)),\n});\n\nexport type Graph = S.Schema.Type<typeof Graph>;\n\nexport const emptyGraph: Graph = { nodes: [], edges: [] };\n", "//\n// Copyright 2024 DXOS.org\n//\n\n// TODO(burdon): GraphBuilder.\n\n// TODO(burdon): Move to @dxos/live-object?\nexport const removeElements = <T>(array: T[], predicate: (element: T, index: number) => boolean): T[] => {\n  const deleted: T[] = [];\n  for (let i = array.length - 1; i >= 0; i--) {\n    if (predicate(array[i], i)) {\n      deleted.push(...array.splice(i, 1));\n    }\n  }\n\n  return deleted;\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,yBAA2B;AAC3B,uBAA0B;AAC1B,yBAA0B;AAC1B,iBAAoB;AACpB,oBAAoC;ACLpC,IAAAA,sBAAuB;ACAvB,IAAAC,sBAAkB;AAOX,IAAMC,gBAAgBC,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;AACxB,CAAA;AAKO,IAAMC,gBAAgBR,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBM,QAAQT,sBAAEG;EACVO,QAAQV,sBAAEG;EACVG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;AACxB,CAAA;AAQO,IAAMI,QAAQX,sBAAEC,OAAO;EAC5BW,OAAOZ,sBAAEa,QAAQb,sBAAEc,MAAMf,aAAAA,CAAAA;EACzBgB,OAAOf,sBAAEa,QAAQb,sBAAEc,MAAMN,aAAAA,CAAAA;AAC3B,CAAA;AAIO,IAAMQ,aAAoB;EAAEJ,OAAO,CAAA;EAAIG,OAAO,CAAA;AAAG;AClCjD,IAAME,iBAAiB,CAAIC,OAAYC,cAAAA;AAC5C,QAAMC,UAAe,CAAA;AACrB,WAASC,IAAIH,MAAMI,SAAS,GAAGD,KAAK,GAAGA,KAAK;AAC1C,QAAIF,UAAUD,MAAMG,CAAAA,GAAIA,CAAAA,GAAI;AAC1BD,cAAQG,KAAI,GAAIL,MAAMM,OAAOH,GAAG,CAAA,CAAA;IAClC;EACF;AAEA,SAAOD;AACT;AFFO,IAAMK,qBAAN,MAAMA;EAGXC,YAAY,EAAEd,QAAQ,CAAA,GAAIG,QAAQ,CAAA,EAAE,IAAqB,CAAC,GAAG;AAC3D,SAAKY,aAASC,4BAAOjB,OAAO;MAAEC;MAAOG;IAAM,CAAA;EAC7C;EAEAc,SAAS;AAEP,SAAKF,OAAOf,MAAMkB,KAAK,CAAC,EAAE5B,IAAI6B,EAAC,GAAI,EAAE7B,IAAI8B,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACjE,SAAKL,OAAOZ,MAAMe,KAAK,CAAC,EAAE5B,IAAI6B,EAAC,GAAI,EAAE7B,IAAI8B,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACjE,WAAOE,KAAKC,MAAMD,KAAKE,UAAU,KAAKT,MAAM,CAAA;EAC9C;EAEA,IAAIU,QAAe;AACjB,WAAO,KAAKV;EACd;EAEA,IAAIf,QAAgB;AAClB,WAAO,KAAKe,OAAOf;EACrB;EAEA,IAAIG,QAAgB;AAClB,WAAO,KAAKY,OAAOZ;EACrB;EAEAuB,QAAQpC,IAA8B;AACpC,WAAO,KAAKU,MAAM2B,KAAK,CAACC,SAASA,KAAKtC,OAAOA,EAAAA;EAC/C;EAEAuC,SAAS,EAAErC,KAAI,GAA2B;AACxC,WAAO,KAAKQ,MAAM8B,OAAO,CAACF,SAAS,CAACpC,QAAQA,SAASoC,KAAKpC,IAAI;EAChE;EAEAuC,QAAQzC,IAA8B;AACpC,WAAO,KAAKa,MAAMwB,KAAK,CAACK,SAASA,KAAK1C,OAAOA,EAAAA;EAC/C;EAEA2C,SAAS,EAAEzC,MAAMK,QAAQC,OAAM,GAA2B;AACxD,WAAO,KAAKK,MAAM2B,OAChB,CAACE,UACE,CAACxC,QAAQA,SAASwC,KAAKxC,UAAU,CAACK,UAAUA,WAAWmC,KAAKnC,YAAY,CAACC,UAAUA,WAAWkC,KAAKlC,OAAK;EAE/G;AACF;AAEO,IAAMoC,aAAN,MAAMA,oBAA+ErB,mBAAAA;EAI1FsB,QAAc;AACZ,SAAKpB,OAAOf,MAAMU,SAAS;AAC3B,SAAKK,OAAOZ,MAAMO,SAAS;AAC3B,WAAO;EACT;EAEA0B,SAASX,OAAqC;AAC5C,SAAKY,SAASZ,MAAMzB,KAAK;AACzB,SAAKsC,SAASb,MAAMtB,KAAK;AACzB,WAAO;EACT;EAEAoC,UAAUC,QAAwC;AAChDA,WAAOC,QAAQ,CAAChB,UAAAA;AACd,WAAKY,SAASZ,MAAMzB,KAAK;AACzB,WAAKsC,SAASb,MAAMtB,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAuC,QAAQd,MAAkB;AACxB,SAAKb,OAAOf,MAAMW,KAAKiB,IAAAA;AACvB,WAAO;EACT;EAEAS,SAASrC,OAAqB;AAC5BA,UAAMyC,QAAQ,CAACb,SAAS,KAAKc,QAAQd,IAAAA,CAAAA;AACrC,WAAO;EACT;EAEAe,QAAQX,MAAkB;AACxB,SAAKjB,OAAOZ,MAAMQ,KAAKqB,IAAAA;AACvB,WAAO;EACT;EAEAM,SAASnC,OAAqB;AAC5BA,UAAMsC,QAAQ,CAACT,SAAS,KAAKW,QAAQX,IAAAA,CAAAA;AACrC,WAAO;EACT;;EAIAY,WAAWtD,IAAoC;AAC7C,UAAMU,QAAQK,eAAe,KAAKU,OAAOf,OAAO,CAAC4B,SAASA,KAAKtC,OAAOA,EAAAA;AACtE,UAAMa,QAAQE,eAAe,KAAKU,OAAOZ,OAAO,CAAC6B,SAASA,KAAKnC,WAAWP,MAAM0C,KAAKlC,WAAWR,EAAAA;AAChG,WAAO,IAAI4C,YAAuB;MAAElC;MAAOG;IAAM,CAAA;EACnD;EAEA0C,YAAYC,KAAuC;AACjD,UAAMN,SAASM,IAAIC,IAAI,CAACzD,OAAO,KAAKsD,WAAWtD,EAAAA,CAAAA;AAC/C,WAAO,IAAI4C,YAAAA,EAAyBK,UAAUC,MAAAA;EAChD;EAEAQ,WAAW1D,IAAoC;AAC7C,UAAMa,QAAQE,eAAe,KAAKU,OAAOZ,OAAO,CAAC6B,SAASA,KAAK1C,OAAOA,EAAAA;AACtE,WAAO,IAAI4C,YAAuB;MAAE/B;IAAM,CAAA;EAC5C;EAEA8C,YAAYH,KAAuC;AACjD,UAAMN,SAASM,IAAIC,IAAI,CAACzD,OAAO,KAAK0D,WAAW1D,EAAAA,CAAAA;AAC/C,WAAO,IAAI4C,YAAAA,EAAyBK,UAAUC,MAAAA;EAChD;AACF;;AD7GO,IAAMU,eAAe,CAAC,EAAErD,QAAQC,QAAQqD,SAAQ,MAAa,GAAGtD,MAAAA,IAAUsD,QAAAA,IAAYrD,MAAAA;AAEtF,IAAMsD,cAAc,CAAC9D,OAAAA;AAC1B,QAAM,CAACO,QAAQsD,UAAUrD,MAAAA,IAAUR,GAAG+D,MAAM,GAAA;AAC5CC,kCAAUzD,UAAUC,UAAUqD,UAAAA,QAAAA;;;;;;;;;AAC9B,SAAO;IAAEtD;IAAQsD;IAAUrD;EAAO;AACpC;AAKO,IAAMyD,cAAc,CAACC,YAAAA;AAC1B,QAAM/B,QAAQ,IAAIS,WAAAA;AAGlBsB,UAAQf,QAAQ,CAACgB,WAAAA;AACfhC,UAAMiB,QAAQ;MAAEpD,IAAImE,OAAOnE;MAAIE,MAAMiE,OAAOC;MAAUhE,MAAM+D;IAAO,CAAA;EACrE,CAAA;AAGAD,UAAQf,QAAQ,CAACgB,WAAAA;AACf,UAAME,aAASC,8BAAUH,MAAAA;AACzB,QAAI,CAACE,QAAQ;AACXE,qBAAIC,KAAK,wBAAwB;QAAExE,IAAImE,OAAOnE,GAAGyE,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,YAAQC,mCAAoBN,OAAOO,KAAKT,MAAAA,GAAS;AAC1D,UAAIO,KAAKG,WAAWC,8BAAWC,KAAK;AAClC,cAAMxE,SAAS4D;AACf,cAAM3D,SAAS2D,OAAOO,KAAKM,IAAI,GAAGxE;AAClC,YAAIA,QAAQ;AACV2B,gBAAMkB,QAAQ;YACZrD,IAAI4D,aAAa;cAAErD,QAAQA,OAAOP;cAAIQ,QAAQA,OAAOR;cAAI6D,UAAU5D,OAAOyE,KAAKM,IAAI;YAAE,CAAA;YACrFzE,QAAQA,OAAOP;YACfQ,QAAQA,OAAOR;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAOmC;AACT;",
+  "names": ["import_live_object", "import_echo_schema", "BaseGraphNode", "S", "Struct", "id", "String", "type", "optional", "data", "Any", "BaseGraphEdge", "source", "target", "Graph", "nodes", "mutable", "Array", "edges", "emptyGraph", "removeElements", "array", "predicate", "deleted", "i", "length", "push", "splice", "ReadonlyGraphModel", "constructor", "_graph", "create", "toJSON", "sort", "a", "b", "localeCompare", "JSON", "parse", "stringify", "graph", "getNode", "find", "node", "getNodes", "filter", "getEdge", "edge", "getEdges", "GraphModel", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "addEdge", "removeNode", "removeNodes", "ids", "map", "removeEdge", "removeEdges", "createEdgeId", "relation", "parseEdgeId", "split", "invariant", "createGraph", "objects", "object", "typename", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4437,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":9104,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","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"}],"format":"esm"},"packages/common/graph/src/model.ts":{"bytes":23788,"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/index.ts":{"bytes":647,"imports":[{"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":18688},"packages/common/graph/dist/lib/node/index.cjs":{"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":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","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/echo-schema","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/model.ts":{"bytesInOutput":5449},"packages/common/graph/src/util.ts":{"bytesInOutput":2277},"packages/common/graph/src/types.ts":{"bytesInOutput":551},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":8702}}}
+{"inputs":{"packages/common/graph/src/types.ts":{"bytes":3825,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":1705,"imports":[],"format":"esm"},"packages/common/graph/src/graph.ts":{"bytes":12508,"imports":[{"path":"@dxos/live-object","kind":"import-statement","external":true},{"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/buidler.ts":{"bytes":7346,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","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/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/common/graph/src/index.ts":{"bytes":654,"imports":[{"path":"packages/common/graph/src/buidler.ts","kind":"import-statement","original":"./buidler"},{"path":"packages/common/graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"}],"format":"esm"}},"outputs":{"packages/common/graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":12611},"packages/common/graph/dist/lib/node/index.cjs":{"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","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/live-object","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"exports":["BaseGraphEdge","BaseGraphNode","Graph","GraphModel","ReadonlyGraphModel","createEdgeId","createGraph","emptyGraph","parseEdgeId"],"entryPoint":"packages/common/graph/src/index.ts","inputs":{"packages/common/graph/src/buidler.ts":{"bytesInOutput":1716},"packages/common/graph/src/graph.ts":{"bytesInOutput":2460},"packages/common/graph/src/types.ts":{"bytesInOutput":454},"packages/common/graph/src/util.ts":{"bytesInOutput":223},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":5274}}}