@dxos/graph 0.7.5-main.499c70c

package/dist/lib/node-esm/index.mjs

@@ -0,0 +1,214 @@
+import { createRequire } from 'node:module';const require = createRequire(import.meta.url);
+
+// packages/common/graph/src/buidler.ts
+import { FormatEnum } from "@dxos/echo-schema";
+import { invariant } from "@dxos/invariant";
+import { getSchema } from "@dxos/live-object";
+import { log } from "@dxos/log";
+import { getSchemaProperties } from "@dxos/schema";
+
+// packages/common/graph/src/graph.ts
+import { create } from "@dxos/live-object";
+
+// packages/common/graph/src/types.ts
+import { S } from "@dxos/echo-schema";
+var BaseGraphNode = S.Struct({
+  id: S.String,
+  type: S.optional(S.String),
+  data: S.optional(S.Any)
+});
+var BaseGraphEdge = S.Struct({
+  id: S.String,
+  type: S.optional(S.String),
+  source: S.String,
+  target: S.String,
+  data: S.optional(S.Any)
+});
+var Graph = S.Struct({
+  nodes: S.mutable(S.Array(BaseGraphNode)),
+  edges: S.mutable(S.Array(BaseGraphEdge))
+});
+var emptyGraph = {
+  nodes: [],
+  edges: []
+};
+
+// packages/common/graph/src/util.ts
+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 deleted;
+};
+
+// packages/common/graph/src/graph.ts
+var ReadonlyGraphModel = class {
+  constructor({ nodes = [], edges = [] } = {}) {
+    this._graph = 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;
+  }
+  get nodes() {
+    return this._graph.nodes;
+  }
+  get edges() {
+    return this._graph.edges;
+  }
+  getNode(id) {
+    return this.nodes.find((node) => node.id === id);
+  }
+  getNodes({ type }) {
+    return this.nodes.filter((node) => !type || type === node.type);
+  }
+  getEdge(id) {
+    return this.edges.find((edge) => edge.id === id);
+  }
+  getEdges({ type, source, target }) {
+    return this.edges.filter((edge) => (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target));
+  }
+};
+var GraphModel = class _GraphModel extends ReadonlyGraphModel {
+  clear() {
+    this._graph.nodes.length = 0;
+    this._graph.edges.length = 0;
+    return this;
+  }
+  addGraph(graph) {
+    this.addNodes(graph.nodes);
+    this.addEdges(graph.edges);
+    return this;
+  }
+  addGraphs(graphs) {
+    graphs.forEach((graph) => {
+      this.addNodes(graph.nodes);
+      this.addEdges(graph.edges);
+    });
+    return this;
+  }
+  addNode(node) {
+    this._graph.nodes.push(node);
+    return this;
+  }
+  addNodes(nodes) {
+    nodes.forEach((node) => this.addNode(node));
+    return this;
+  }
+  addEdge(edge) {
+    this._graph.edges.push(edge);
+    return this;
+  }
+  addEdges(edges) {
+    edges.forEach((edge) => this.addEdge(edge));
+    return this;
+  }
+  // TODO(burdon): Return graph.
+  removeNode(id) {
+    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 new _GraphModel().addGraphs(graphs);
+  }
+  removeEdge(id) {
+    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 new _GraphModel().addGraphs(graphs);
+  }
+};
+
+// packages/common/graph/src/buidler.ts
+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("-");
+  invariant(source && target && relation, void 0, {
+    F: __dxlog_file,
+    L: 22,
+    S: void 0,
+    A: [
+      "source && target && relation",
+      ""
+    ]
+  });
+  return {
+    source,
+    relation,
+    target
+  };
+};
+var createGraph = (objects) => {
+  const graph = new GraphModel();
+  objects.forEach((object) => {
+    graph.addNode({
+      id: object.id,
+      type: object.typename,
+      data: object
+    });
+  });
+  objects.forEach((object) => {
+    const schema = getSchema(object);
+    if (!schema) {
+      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 getSchemaProperties(schema.ast, object)) {
+      if (prop.format === 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;
+};
+export {
+  BaseGraphEdge,
+  BaseGraphNode,
+  Graph,
+  GraphModel,
+  ReadonlyGraphModel,
+  createEdgeId,
+  createGraph,
+  emptyGraph,
+  parseEdgeId
+};
+//# sourceMappingURL=index.mjs.map

package/dist/lib/node-esm/index.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "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,SAASA,kBAAkB;AAC3B,SAASC,iBAAiB;AAC1B,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AACpB,SAASC,2BAA2B;;;ACLpC,SAASC,cAAc;;;ACAvB,SAASC,SAAS;AAOX,IAAMC,gBAAgBC,EAAEC,OAAO;EACpCC,IAAIF,EAAEG;EACNC,MAAMJ,EAAEK,SAASL,EAAEG,MAAM;EACzBG,MAAMN,EAAEK,SAASL,EAAEO,GAAG;AACxB,CAAA;AAKO,IAAMC,gBAAgBR,EAAEC,OAAO;EACpCC,IAAIF,EAAEG;EACNC,MAAMJ,EAAEK,SAASL,EAAEG,MAAM;EACzBM,QAAQT,EAAEG;EACVO,QAAQV,EAAEG;EACVG,MAAMN,EAAEK,SAASL,EAAEO,GAAG;AACxB,CAAA;AAQO,IAAMI,QAAQX,EAAEC,OAAO;EAC5BW,OAAOZ,EAAEa,QAAQb,EAAEc,MAAMf,aAAAA,CAAAA;EACzBgB,OAAOf,EAAEa,QAAQb,EAAEc,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,EAAEC,QAAQ,CAAA,GAAIC,QAAQ,CAAA,EAAE,IAAqB,CAAC,GAAG;AAC3D,SAAKC,SAASC,OAAOC,OAAO;MAAEJ;MAAOC;IAAM,CAAA;EAC7C;EAEAI,SAAS;AAEP,SAAKH,OAAOF,MAAMM,KAAK,CAAC,EAAEC,IAAIC,EAAC,GAAI,EAAED,IAAIE,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACjE,SAAKP,OAAOD,MAAMK,KAAK,CAAC,EAAEC,IAAIC,EAAC,GAAI,EAAED,IAAIE,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACjE,WAAOE,KAAKC,MAAMD,KAAKE,UAAU,KAAKX,MAAM,CAAA;EAC9C;EAEA,IAAIY,QAAe;AACjB,WAAO,KAAKZ;EACd;EAEA,IAAIF,QAAgB;AAClB,WAAO,KAAKE,OAAOF;EACrB;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKC,OAAOD;EACrB;EAEAc,QAAQR,IAA8B;AACpC,WAAO,KAAKP,MAAMgB,KAAK,CAACC,SAASA,KAAKV,OAAOA,EAAAA;EAC/C;EAEAW,SAAS,EAAEC,KAAI,GAA2B;AACxC,WAAO,KAAKnB,MAAMoB,OAAO,CAACH,SAAS,CAACE,QAAQA,SAASF,KAAKE,IAAI;EAChE;EAEAE,QAAQd,IAA8B;AACpC,WAAO,KAAKN,MAAMe,KAAK,CAACM,SAASA,KAAKf,OAAOA,EAAAA;EAC/C;EAEAgB,SAAS,EAAEJ,MAAMK,QAAQC,OAAM,GAA2B;AACxD,WAAO,KAAKxB,MAAMmB,OAChB,CAACE,UACE,CAACH,QAAQA,SAASG,KAAKH,UAAU,CAACK,UAAUA,WAAWF,KAAKE,YAAY,CAACC,UAAUA,WAAWH,KAAKG,OAAK;EAE/G;AACF;AAEO,IAAMC,aAAN,MAAMA,oBAA+E5B,mBAAAA;EAI1F6B,QAAc;AACZ,SAAKzB,OAAOF,MAAM4B,SAAS;AAC3B,SAAK1B,OAAOD,MAAM2B,SAAS;AAC3B,WAAO;EACT;EAEAC,SAASf,OAAqC;AAC5C,SAAKgB,SAAShB,MAAMd,KAAK;AACzB,SAAK+B,SAASjB,MAAMb,KAAK;AACzB,WAAO;EACT;EAEA+B,UAAUC,QAAwC;AAChDA,WAAOC,QAAQ,CAACpB,UAAAA;AACd,WAAKgB,SAAShB,MAAMd,KAAK;AACzB,WAAK+B,SAASjB,MAAMb,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAkC,QAAQlB,MAAkB;AACxB,SAAKf,OAAOF,MAAMoC,KAAKnB,IAAAA;AACvB,WAAO;EACT;EAEAa,SAAS9B,OAAqB;AAC5BA,UAAMkC,QAAQ,CAACjB,SAAS,KAAKkB,QAAQlB,IAAAA,CAAAA;AACrC,WAAO;EACT;EAEAoB,QAAQf,MAAkB;AACxB,SAAKpB,OAAOD,MAAMmC,KAAKd,IAAAA;AACvB,WAAO;EACT;EAEAS,SAAS9B,OAAqB;AAC5BA,UAAMiC,QAAQ,CAACZ,SAAS,KAAKe,QAAQf,IAAAA,CAAAA;AACrC,WAAO;EACT;;EAIAgB,WAAW/B,IAAoC;AAC7C,UAAMP,QAAQuC,eAAe,KAAKrC,OAAOF,OAAO,CAACiB,SAASA,KAAKV,OAAOA,EAAAA;AACtE,UAAMN,QAAQsC,eAAe,KAAKrC,OAAOD,OAAO,CAACqB,SAASA,KAAKE,WAAWjB,MAAMe,KAAKG,WAAWlB,EAAAA;AAChG,WAAO,IAAImB,YAAuB;MAAE1B;MAAOC;IAAM,CAAA;EACnD;EAEAuC,YAAYC,KAAuC;AACjD,UAAMR,SAASQ,IAAIC,IAAI,CAACnC,OAAO,KAAK+B,WAAW/B,EAAAA,CAAAA;AAC/C,WAAO,IAAImB,YAAAA,EAAyBM,UAAUC,MAAAA;EAChD;EAEAU,WAAWpC,IAAoC;AAC7C,UAAMN,QAAQsC,eAAe,KAAKrC,OAAOD,OAAO,CAACqB,SAASA,KAAKf,OAAOA,EAAAA;AACtE,WAAO,IAAImB,YAAuB;MAAEzB;IAAM,CAAA;EAC5C;EAEA2C,YAAYH,KAAuC;AACjD,UAAMR,SAASQ,IAAIC,IAAI,CAACnC,OAAO,KAAKoC,WAAWpC,EAAAA,CAAAA;AAC/C,WAAO,IAAImB,YAAAA,EAAyBM,UAAUC,MAAAA;EAChD;AACF;;;;AD7GO,IAAMY,eAAe,CAAC,EAAEC,QAAQC,QAAQC,SAAQ,MAAa,GAAGF,MAAAA,IAAUE,QAAAA,IAAYD,MAAAA;AAEtF,IAAME,cAAc,CAACC,OAAAA;AAC1B,QAAM,CAACJ,QAAQE,UAAUD,MAAAA,IAAUG,GAAGC,MAAM,GAAA;AAC5CC,YAAUN,UAAUC,UAAUC,UAAAA,QAAAA;;;;;;;;;AAC9B,SAAO;IAAEF;IAAQE;IAAUD;EAAO;AACpC;AAKO,IAAMM,cAAc,CAACC,YAAAA;AAC1B,QAAMC,QAAQ,IAAIC,WAAAA;AAGlBF,UAAQG,QAAQ,CAACC,WAAAA;AACfH,UAAMI,QAAQ;MAAET,IAAIQ,OAAOR;MAAIU,MAAMF,OAAOG;MAAUC,MAAMJ;IAAO,CAAA;EACrE,CAAA;AAGAJ,UAAQG,QAAQ,CAACC,WAAAA;AACf,UAAMK,SAASC,UAAUN,MAAAA;AACzB,QAAI,CAACK,QAAQ;AACXE,UAAIC,KAAK,wBAAwB;QAAEhB,IAAIQ,OAAOR,GAAGiB,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,QAAQC,oBAAoBN,OAAOO,KAAKZ,MAAAA,GAAS;AAC1D,UAAIU,KAAKG,WAAWC,WAAWC,KAAK;AAClC,cAAM3B,SAASY;AACf,cAAMX,SAASW,OAAOU,KAAKM,IAAI,GAAG3B;AAClC,YAAIA,QAAQ;AACVQ,gBAAMoB,QAAQ;YACZzB,IAAIL,aAAa;cAAEC,QAAQA,OAAOI;cAAIH,QAAQA,OAAOG;cAAIF,UAAU4B,OAAOR,KAAKM,IAAI;YAAE,CAAA;YACrF5B,QAAQA,OAAOI;YACfH,QAAQA,OAAOG;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAOK;AACT;",
+  "names": ["FormatEnum", "invariant", "getSchema", "log", "getSchemaProperties", "create", "S", "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", "nodes", "edges", "_graph", "create", "Graph", "toJSON", "sort", "id", "a", "b", "localeCompare", "JSON", "parse", "stringify", "graph", "getNode", "find", "node", "getNodes", "type", "filter", "getEdge", "edge", "getEdges", "source", "target", "GraphModel", "clear", "length", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "push", "addEdge", "removeNode", "removeElements", "removeNodes", "ids", "map", "removeEdge", "removeEdges", "createEdgeId", "source", "target", "relation", "parseEdgeId", "id", "split", "invariant", "createGraph", "objects", "graph", "GraphModel", "forEach", "object", "addNode", "type", "typename", "data", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name", "addEdge", "String"]
+}

package/dist/lib/node-esm/meta.json

@@ -0,0 +1 @@
+{"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-esm/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":12613},"packages/common/graph/dist/lib/node-esm/index.mjs":{"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":5367}}}

package/dist/types/src/buidler.d.ts

@@ -0,0 +1,16 @@
+import { type ReactiveEchoObject } from '@dxos/echo-db';
+import { GraphModel } from './graph';
+import { type GraphNode } from './types';
+type Edge = {
+    source: string;
+    target: string;
+    relation: string;
+};
+export declare const createEdgeId: ({ source, target, relation }: Edge) => string;
+export declare const parseEdgeId: (id: string) => Edge;
+/**
+ * Maps an ECHO object graph onto a layout graph.
+ */
+export declare const createGraph: (objects: ReactiveEchoObject<any>[]) => GraphModel<GraphNode<ReactiveEchoObject<any>>>;
+export {};
+//# sourceMappingURL=buidler.d.ts.map

package/dist/types/src/buidler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buidler.d.ts","sourceRoot":"","sources":["../../../src/buidler.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,KAAK,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAOxD,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,KAAK,SAAS,EAAE,MAAM,SAAS,CAAC;AAGzC,KAAK,IAAI,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjE,eAAO,MAAM,YAAY,iCAAkC,IAAI,WAAsC,CAAC;AAEtG,eAAO,MAAM,WAAW,OAAQ,MAAM,KAAG,IAIxC,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,WAAW,YAAa,kBAAkB,CAAC,GAAG,CAAC,EAAE,KAAG,UAAU,CAAC,SAAS,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAiC7G,CAAC"}

package/dist/types/src/graph.d.ts

@@ -0,0 +1,30 @@
+import { Graph, type GraphNode, type GraphEdge } from './types';
+/**
+ * Typed reactive object graph.
+ */
+export declare class ReadonlyGraphModel<Node extends GraphNode = any, Edge extends GraphEdge = any> {
+    protected readonly _graph: Graph;
+    constructor({ nodes, edges }?: Partial<Graph>);
+    toJSON(): any;
+    get graph(): Graph;
+    get nodes(): Node[];
+    get edges(): Edge[];
+    getNode(id: string): Node | undefined;
+    getNodes({ type }: Partial<Node>): Node[];
+    getEdge(id: string): Edge | undefined;
+    getEdges({ type, source, target }: Partial<Edge>): Edge[];
+}
+export declare class GraphModel<Node extends GraphNode = any, Edge extends GraphEdge = any> extends ReadonlyGraphModel<Node, Edge> {
+    clear(): this;
+    addGraph(graph: GraphModel<Node, Edge>): this;
+    addGraphs(graphs: GraphModel<Node, Edge>[]): this;
+    addNode(node: Node): this;
+    addNodes(nodes: Node[]): this;
+    addEdge(edge: Edge): this;
+    addEdges(edges: Edge[]): this;
+    removeNode(id: string): GraphModel<Node, Edge>;
+    removeNodes(ids: string[]): GraphModel<Node, Edge>;
+    removeEdge(id: string): GraphModel<Node, Edge>;
+    removeEdges(ids: string[]): GraphModel<Node, Edge>;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/types/src/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/graph.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,KAAK,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,SAAS,CAAC;AAKhE;;GAEG;AACH,qBAAa,kBAAkB,CAAC,IAAI,SAAS,SAAS,GAAG,GAAG,EAAE,IAAI,SAAS,SAAS,GAAG,GAAG;IACxF,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;gBAErB,EAAE,KAAU,EAAE,KAAU,EAAE,GAAE,OAAO,CAAC,KAAK,CAAM;IAI3D,MAAM;IAON,IAAI,KAAK,IAAI,KAAK,CAEjB;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE;IAIzC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC,QAAQ,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE;CAM1D;AAED,qBAAa,UAAU,CAAC,IAAI,SAAS,SAAS,GAAG,GAAG,EAAE,IAAI,SAAS,SAAS,GAAG,GAAG,CAAE,SAAQ,kBAAkB,CAC5G,IAAI,EACJ,IAAI,CACL;IACC,KAAK,IAAI,IAAI;IAMb,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI;IAM7C,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI;IAQjD,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAKzB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;IAK7B,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAKzB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;IAO7B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAM9C,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAKlD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAK9C,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;CAInD"}

package/dist/types/src/graph.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=graph.test.d.ts.map

package/dist/types/src/graph.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.test.d.ts","sourceRoot":"","sources":["../../../src/graph.test.ts"],"names":[],"mappings":""}

package/dist/types/src/index.d.ts

@@ -0,0 +1,4 @@
+export * from './buidler';
+export * from './graph';
+export * from './types';
+//# sourceMappingURL=index.d.ts.map

package/dist/types/src/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":"AAIA,cAAc,WAAW,CAAC;AAC1B,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC"}

package/dist/types/src/types.d.ts

@@ -0,0 +1,41 @@
+import { S } from '@dxos/echo-schema';
+export declare const BaseGraphNode: S.Struct<{
+    id: typeof S.String;
+    type: S.optional<typeof S.String>;
+    data: S.optional<typeof S.Any>;
+}>;
+export type BaseGraphNode = S.Schema.Type<typeof BaseGraphNode>;
+export type GraphNode<Data extends object | void = void> = BaseGraphNode & {
+    data: Data;
+};
+export declare const BaseGraphEdge: S.Struct<{
+    id: typeof S.String;
+    type: S.optional<typeof S.String>;
+    source: typeof S.String;
+    target: typeof S.String;
+    data: S.optional<typeof S.Any>;
+}>;
+export type BaseGraphEdge = S.Schema.Type<typeof BaseGraphEdge>;
+export type GraphEdge<Data extends object | void = void> = BaseGraphEdge & {
+    data: Data;
+};
+/**
+ * Generic graph abstraction.
+ */
+export declare const Graph: S.Struct<{
+    nodes: S.mutable<S.Array$<S.Struct<{
+        id: typeof S.String;
+        type: S.optional<typeof S.String>;
+        data: S.optional<typeof S.Any>;
+    }>>>;
+    edges: S.mutable<S.Array$<S.Struct<{
+        id: typeof S.String;
+        type: S.optional<typeof S.String>;
+        source: typeof S.String;
+        target: typeof S.String;
+        data: S.optional<typeof S.Any>;
+    }>>>;
+}>;
+export type Graph = S.Schema.Type<typeof Graph>;
+export declare const emptyGraph: Graph;
+//# sourceMappingURL=types.d.ts.map

package/dist/types/src/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/types.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,CAAC,EAAE,MAAM,mBAAmB,CAAC;AAOtC,eAAO,MAAM,aAAa;;;;EAIxB,CAAC;AAEH,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,aAAa,CAAC,CAAC;AAChE,MAAM,MAAM,SAAS,CAAC,IAAI,SAAS,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI,aAAa,GAAG;IAAE,IAAI,EAAE,IAAI,CAAA;CAAE,CAAC;AAE1F,eAAO,MAAM,aAAa;;;;;;EAMxB,CAAC;AAEH,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,aAAa,CAAC,CAAC;AAChE,MAAM,MAAM,SAAS,CAAC,IAAI,SAAS,MAAM,GAAG,IAAI,GAAG,IAAI,IAAI,aAAa,GAAG;IAAE,IAAI,EAAE,IAAI,CAAA;CAAE,CAAC;AAE1F;;GAEG;AACH,eAAO,MAAM,KAAK;;;;;;;;;;;;;EAGhB,CAAC;AAEH,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC;AAEhD,eAAO,MAAM,UAAU,EAAE,KAAgC,CAAC"}

package/dist/types/src/util.d.ts

@@ -0,0 +1,2 @@
+export declare const removeElements: <T>(array: T[], predicate: (element: T, index: number) => boolean) => T[];
+//# sourceMappingURL=util.d.ts.map

package/dist/types/src/util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../../src/util.ts"],"names":[],"mappings":"AAOA,eAAO,MAAM,cAAc,GAAI,CAAC,SAAS,CAAC,EAAE,aAAa,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,KAAG,CAAC,EASlG,CAAC"}

package/dist/types/tsconfig.tsbuildinfo

@@ -0,0 +1 @@
+{"version":"5.7.2"}

package/package.json

@@ -0,0 +1,60 @@
+{
+  "name": "@dxos/graph",
+  "version": "0.7.5-main.499c70c",
+  "description": "Low-level graph API",
+  "homepage": "https://dxos.org",
+  "bugs": "https://github.com/dxos/dxos/issues",
+  "license": "MIT",
+  "author": "DXOS.org",
+  "sideEffects": true,
+  "exports": {
+    ".": {
+      "types": "./dist/types/src/index.d.ts",
+      "browser": "./dist/lib/browser/index.mjs",
+      "node": "./dist/lib/node-esm/index.mjs"
+    }
+  },
+  "types": "dist/types/src/index.d.ts",
+  "typesVersions": {
+    "*": {
+      "meta": [
+        "dist/types/src/meta.d.ts"
+      ],
+      "types": [
+        "dist/types/src/types/index.d.ts"
+      ]
+    }
+  },
+  "files": [
+    "dist",
+    "src"
+  ],
+  "dependencies": {
+    "@effect/schema": "^0.75.5",
+    "@preact/signals-core": "^1.6.0",
+    "graphology": "^0.25.4",
+    "graphology-shortest-path": "^2.1.0",
+    "graphology-types": "^0.24.8",
+    "lodash.defaultsdeep": "^4.6.1",
+    "@dxos/async": "0.7.5-main.499c70c",
+    "@dxos/echo-schema": "0.7.5-main.499c70c",
+    "@dxos/debug": "0.7.5-main.499c70c",
+    "@dxos/invariant": "0.7.5-main.499c70c",
+    "@dxos/live-object": "0.7.5-main.499c70c",
+    "@dxos/echo-db": "0.7.5-main.499c70c",
+    "@dxos/log": "0.7.5-main.499c70c",
+    "@dxos/schema": "0.7.5-main.499c70c",
+    "@dxos/util": "0.7.5-main.499c70c"
+  },
+  "devDependencies": {
+    "@antv/graphlib": "^2.0.4",
+    "@antv/layout": "^1.2.13",
+    "@types/lodash.defaultsdeep": "^4.6.6",
+    "@dxos/echo-db": "0.7.5-main.499c70c",
+    "@dxos/echo-schema": "0.7.5-main.499c70c",
+    "@dxos/random": "0.7.5-main.499c70c"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}

package/src/buidler.ts

@@ -0,0 +1,62 @@
+//
+// Copyright 2023 DXOS.org
+//
+
+import { type ReactiveEchoObject } from '@dxos/echo-db';
+import { FormatEnum } from '@dxos/echo-schema';
+import { invariant } from '@dxos/invariant';
+import { getSchema } from '@dxos/live-object';
+import { log } from '@dxos/log';
+import { getSchemaProperties } from '@dxos/schema';
+
+import { GraphModel } from './graph';
+import { type GraphNode } from './types';
+
+// NOTE: The `relation` is different from the `type`.
+type Edge = { source: string; target: string; relation: string };
+
+export const createEdgeId = ({ source, target, relation }: Edge) => `${source}-${relation}-${target}`;
+
+export const parseEdgeId = (id: string): Edge => {
+  const [source, relation, target] = id.split('-');
+  invariant(source && target && relation);
+  return { source, relation, target };
+};
+
+/**
+ * Maps an ECHO object graph onto a layout graph.
+ */
+export const createGraph = (objects: ReactiveEchoObject<any>[]): GraphModel<GraphNode<ReactiveEchoObject<any>>> => {
+  const graph = new GraphModel<GraphNode<ReactiveEchoObject<any>>>();
+
+  // Map objects.
+  objects.forEach((object) => {
+    graph.addNode({ id: object.id, type: object.typename, data: object });
+  });
+
+  // Find references.
+  objects.forEach((object) => {
+    const schema = getSchema(object);
+    if (!schema) {
+      log.info('no schema for object', { id: object.id.slice(0, 8) });
+      return;
+    }
+
+    // Parse schema to follow referenced objects.
+    for (const prop of getSchemaProperties(schema.ast, object)) {
+      if (prop.format === 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;
+};

package/src/graph.test.ts

@@ -0,0 +1,56 @@
+//
+// Copyright 2024 DXOS.org
+//
+
+import { describe, test } from 'vitest';
+
+import { createEdgeId } from './buidler';
+import { GraphModel } from './graph';
+import { type GraphNode } from './types';
+
+type TestData = { value: string };
+
+describe('Graph', () => {
+  test('empty', ({ expect }) => {
+    const { graph } = new GraphModel();
+    expect(graph.nodes).to.have.length(0);
+    expect(graph.edges).to.have.length(0);
+  });
+
+  test('add and remove subgraphs', ({ expect }) => {
+    const graph = new GraphModel<GraphNode<TestData>>()
+      .addNode({ id: 'node-1', data: { value: 'test' } })
+      .addNode({ id: 'node-2', data: { value: 'test' } })
+      .addNode({ id: 'node-3', data: { value: 'test' } })
+      .addEdge({
+        id: createEdgeId({ source: 'node-1', target: 'node-2', relation: 'test' }),
+        source: 'node-1',
+        target: 'node-2',
+      })
+      .addEdge({
+        id: createEdgeId({ source: 'node-2', target: 'node-3', relation: 'test' }),
+        source: 'node-2',
+        target: 'node-3',
+      });
+    expect(graph.nodes).to.have.length(3);
+    expect(graph.edges).to.have.length(2);
+    const pre = graph.toJSON();
+
+    const node: GraphNode<TestData> = graph.getNode('node-2')!;
+    expect(node).to.exist;
+
+    const removed = graph.removeNode('node-2');
+    expect(removed.nodes).to.have.length(1);
+    expect(removed.edges).to.have.length(2);
+    expect(graph.nodes).to.have.length(2);
+    expect(graph.edges).to.have.length(0);
+
+    graph.addGraph(removed);
+    const post = graph.toJSON();
+    expect(pre).to.deep.eq(post);
+
+    graph.clear();
+    expect(graph.nodes).to.have.length(0);
+    expect(graph.edges).to.have.length(0);
+  });
+});