@dxos/graph 0.7.5-main.499c70c

package/LICENSE

@@ -0,0 +1,8 @@
+MIT License 
+Copyright (c) 2022 DXOS
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,3 @@
+# @dxos/graph
+
+Basic graph API.

package/dist/lib/browser/index.mjs

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

package/dist/lib/node/index.cjs

@@ -0,0 +1,233 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var node_exports = {};
+__export(node_exports, {
+  BaseGraphEdge: () => BaseGraphEdge,
+  BaseGraphNode: () => BaseGraphNode,
+  Graph: () => Graph,
+  GraphModel: () => GraphModel,
+  ReadonlyGraphModel: () => ReadonlyGraphModel,
+  createEdgeId: () => createEdgeId,
+  createGraph: () => createGraph,
+  emptyGraph: () => emptyGraph,
+  parseEdgeId: () => parseEdgeId
+});
+module.exports = __toCommonJS(node_exports);
+var import_echo_schema = require("@dxos/echo-schema");
+var import_invariant = require("@dxos/invariant");
+var import_live_object = 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,
+  type: import_echo_schema2.S.optional(import_echo_schema2.S.String),
+  data: import_echo_schema2.S.optional(import_echo_schema2.S.Any)
+});
+var BaseGraphEdge = import_echo_schema2.S.Struct({
+  id: import_echo_schema2.S.String,
+  type: import_echo_schema2.S.optional(import_echo_schema2.S.String),
+  source: import_echo_schema2.S.String,
+  target: import_echo_schema2.S.String,
+  data: import_echo_schema2.S.optional(import_echo_schema2.S.Any)
+});
+var Graph = import_echo_schema2.S.Struct({
+  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 emptyGraph = {
+  nodes: [],
+  edges: []
+};
+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;
+};
+var ReadonlyGraphModel = class {
+  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;
+  }
+  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);
+  }
+};
+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 createGraph = (objects) => {
+  const graph = new GraphModel();
+  objects.forEach((object) => {
+    graph.addNode({
+      id: object.id,
+      type: object.typename,
+      data: object
+    });
+  });
+  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 = {
+  BaseGraphEdge,
+  BaseGraphNode,
+  Graph,
+  GraphModel,
+  ReadonlyGraphModel,
+  createEdgeId,
+  createGraph,
+  emptyGraph,
+  parseEdgeId
+});
+//# sourceMappingURL=index.cjs.map

package/dist/lib/node/index.cjs.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,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

@@ -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/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}}}