@dxos/graph 0.7.5-feature-compute.4d9d99a

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,12 @@
+# @dxos/graph
+
+Basic graph API.
+
+## Prior art
+
+- [Graphology](https://graphology.github.io) (TS, tree-shakable, multiple packages for extensions)
+- [Graphlib](https://github.com/dagrejs/graphlib) (mature, extensive)
+- [tiny-graph](https://github.com/avoidwork/tiny-graph)
+- levelgraph (LevelDB)
+- oxigraph (Rust WASM)
+- Neo4J

package/dist/lib/browser/index.mjs

@@ -0,0 +1,379 @@
+// packages/common/graph/src/model.ts
+import { inspectCustom } from "@dxos/debug";
+import { failedInvariant, invariant as invariant2 } from "@dxos/invariant";
+import { getSnapshot } from "@dxos/live-object";
+import { isNotFalsy, removeBy, stripUndefined } from "@dxos/util";
+
+// packages/common/graph/src/util.ts
+import { FormatEnum } from "@dxos/echo-schema";
+import { invariant } from "@dxos/invariant";
+import { getSchema, create } from "@dxos/live-object";
+import { log } from "@dxos/log";
+import { getSchemaProperties } from "@dxos/schema";
+
+// 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),
+  data: S.optional(S.Any),
+  source: S.String,
+  target: S.String
+});
+var ExtendableBaseGraphNode = S.extend(BaseGraphNode, S.Struct({}, {
+  key: S.String,
+  value: S.Any
+}));
+var Graph = S.Struct({
+  id: S.optional(S.String),
+  nodes: S.mutable(S.Array(ExtendableBaseGraphNode)),
+  edges: S.mutable(S.Array(BaseGraphEdge))
+});
+
+// packages/common/graph/src/util.ts
+var __dxlog_file = "/home/runner/work/dxos/dxos/packages/common/graph/src/util.ts";
+var KEY_REGEX = /\w+/;
+var createEdgeId = ({ source, target, relation }) => {
+  invariant(source.match(KEY_REGEX), `invalid source: ${source}`, {
+    F: __dxlog_file,
+    L: 21,
+    S: void 0,
+    A: [
+      "source.match(KEY_REGEX)",
+      "`invalid source: ${source}`"
+    ]
+  });
+  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 parseEdgeId = (id) => {
+  const [source, relation, target] = id.split("_");
+  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(create(Graph, {
+    nodes: [],
+    edges: []
+  }));
+  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: 48,
+        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;
+};
+
+// packages/common/graph/src/model.ts
+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: []
+    };
+  }
+  [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 } = getSnapshot(this._graph);
+    nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));
+    edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));
+    return stripUndefined({
+      id,
+      nodes,
+      edges
+    });
+  }
+  get graph() {
+    return this._graph;
+  }
+  get nodes() {
+    return this._graph.nodes;
+  }
+  get edges() {
+    return this._graph.edges;
+  }
+  //
+  // Nodes
+  //
+  findNode(id) {
+    return this.nodes.find((node) => node.id === id);
+  }
+  getNode(id) {
+    return this.findNode(id) ?? failedInvariant();
+  }
+  filterNodes({ 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) ?? failedInvariant();
+  }
+  filterEdges({ 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(isNotFalsy);
+    return [
+      root,
+      ...targets.flatMap((target) => this._traverse(target, visited))
+    ];
+  }
+};
+var AbstractGraphModel = class 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) {
+    invariant2(node.id, "ID is required", {
+      F: __dxlog_file2,
+      L: 153,
+      S: this,
+      A: [
+        "node.id",
+        "'ID is required'"
+      ]
+    });
+    invariant2(!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;
+  }
+  addNodes(nodes) {
+    return nodes.map((node) => this.addNode(node));
+  }
+  addEdge(edge) {
+    invariant2(edge.source, void 0, {
+      F: __dxlog_file2,
+      L: 164,
+      S: this,
+      A: [
+        "edge.source",
+        ""
+      ]
+    });
+    invariant2(edge.target, void 0, {
+      F: __dxlog_file2,
+      L: 165,
+      S: this,
+      A: [
+        "edge.target",
+        ""
+      ]
+    });
+    if (!edge.id) {
+      edge = {
+        id: createEdgeId(edge),
+        ...edge
+      };
+    }
+    invariant2(!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;
+  }
+  addEdges(edges) {
+    return edges.map((edge) => this.addEdge(edge));
+  }
+  removeNode(id) {
+    const nodes = removeBy(this._graph.nodes, (node) => node.id === id);
+    const edges = removeBy(this._graph.edges, (edge) => edge.source === id || edge.target === id);
+    return this.copy({
+      nodes,
+      edges
+    });
+  }
+  removeNodes(ids) {
+    const graphs = ids.map((id) => this.removeNode(id));
+    return this.copy().addGraphs(graphs);
+  }
+  removeEdge(id) {
+    const edges = removeBy(this._graph.edges, (edge) => edge.id === id);
+    return this.copy({
+      nodes: [],
+      edges
+    });
+  }
+  removeEdges(ids) {
+    const graphs = ids.map((id) => this.removeEdge(id));
+    return this.copy().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 GraphModel = class _GraphModel extends AbstractGraphModel {
+  get builder() {
+    return new GraphBuilder(this);
+  }
+  copy(graph) {
+    return new _GraphModel({
+      nodes: graph?.nodes ?? [],
+      edges: graph?.edges ?? []
+    });
+  }
+};
+var GraphBuilder = class extends AbstractGraphBuilder {
+  call(cb) {
+    cb(this);
+    return this;
+  }
+};
+export {
+  AbstractGraphBuilder,
+  AbstractGraphModel,
+  BaseGraphEdge,
+  BaseGraphNode,
+  Graph,
+  GraphBuilder,
+  GraphModel,
+  ReadonlyGraphModel,
+  createEdgeId,
+  createGraph,
+  parseEdgeId
+};
+//# sourceMappingURL=index.mjs.map

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

@@ -0,0 +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,SAASA,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAASC,mBAAmB;AAC5B,SAA4BC,YAAYC,UAAUC,sBAAsB;;;ACFxE,SAASC,kBAAkB;AAC3B,SAASC,iBAAiB;AAC1B,SAASC,WAAWC,cAAc;AAClC,SAASC,WAAW;AACpB,SAASC,2BAA2B;;;ACLpC,SAASC,SAAS;AAGX,IAAMC,gBAAgBC,EAAEC,OAAO;EACpCC,IAAIF,EAAEG;EACNC,MAAMJ,EAAEK,SAASL,EAAEG,MAAM;EACzBG,MAAMN,EAAEK,SAASL,EAAEO,GAAG;AACxB,CAAA;AAcO,IAAMC,gBAAgBR,EAAEC,OAAO;EACpCC,IAAIF,EAAEG;EACNC,MAAMJ,EAAEK,SAASL,EAAEG,MAAM;EACzBG,MAAMN,EAAEK,SAASL,EAAEO,GAAG;EACtBE,QAAQT,EAAEG;EACVO,QAAQV,EAAEG;AACZ,CAAA;AAkBA,IAAMQ,0BAA0BX,EAAEY,OAAOb,eAAeC,EAAEC,OAAO,CAAC,GAAG;EAAEY,KAAKb,EAAEG;EAAQW,OAAOd,EAAEO;AAAI,CAAA,CAAA;AAK5F,IAAMQ,QAAQf,EAAEC,OAAO;EAC5BC,IAAIF,EAAEK,SAASL,EAAEG,MAAM;EACvBa,OAAOhB,EAAEiB,QAAQjB,EAAEkB,MAAMP,uBAAAA,CAAAA;EACzBQ,OAAOnB,EAAEiB,QAAQjB,EAAEkB,MAAMV,aAAAA,CAAAA;AAC3B,CAAA;;;;AD5CA,IAAMY,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEC,QAAQC,QAAQC,SAAQ,MAAY;AACjEC,YAAUH,OAAOI,MAAMN,SAAAA,GAAY,mBAAmBE,MAAAA,IAAQ;;;;;;;;;AAC9DG,YAAUF,OAAOG,MAAMN,SAAAA,GAAY,mBAAmBG,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQE;IAAUD;IAAQI,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACC,OAAAA;AAC1B,QAAM,CAACP,QAAQE,UAAUD,MAAAA,IAAUM,GAAGC,MAAM,GAAA;AAC5CL,YAAUH,OAAOS,UAAUR,OAAOQ,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAET;IAAQE,UAAUA,SAASO,SAASP,WAAWQ;IAAWT;EAAO;AAC5E;AAMO,IAAMU,cAAc,CAACC,YAAAA;AAC1B,QAAMC,QAAQ,IAAIC,WAA+CC,OAAOC,OAAO;IAAEC,OAAO,CAAA;IAAIC,OAAO,CAAA;EAAG,CAAA,CAAA;AAGtGN,UAAQO,QAAQ,CAACC,WAAAA;AACfP,UAAMQ,QAAQ;MAAEd,IAAIa,OAAOb;MAAIe,MAAMF,OAAOG;MAAUC,MAAMJ;IAAO,CAAA;EACrE,CAAA;AAGAR,UAAQO,QAAQ,CAACC,WAAAA;AACf,UAAMK,SAASC,UAAUN,MAAAA;AACzB,QAAI,CAACK,QAAQ;AACXE,UAAIC,KAAK,wBAAwB;QAAErB,IAAIa,OAAOb,GAAGsB,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,QAAQC,oBAAoBN,OAAOO,KAAKZ,MAAAA,GAAS;AAC1D,UAAIU,KAAKG,WAAWC,WAAWC,KAAK;AAClC,cAAMnC,SAASoB;AACf,cAAMnB,SAASmB,OAAOU,KAAKM,IAAI,GAAGnC;AAClC,YAAIA,QAAQ;AACVY,gBAAMwB,QAAQ;YACZ9B,IAAIR,aAAa;cAAEC,QAAQA,OAAOO;cAAIN,QAAQA,OAAOM;cAAIL,UAAUoC,OAAOR,KAAKM,IAAI;YAAE,CAAA;YACrFpC,QAAQA,OAAOO;YACfN,QAAQA,OAAOM;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAOM;AACT;;;;ADrDO,IAAM0B,qBAAN,MAAMA;;;;EASXC,YAAYC,OAAe;AACzB,SAAKC,SAASD,SAAS;MAAEE,OAAO,CAAA;MAAIC,OAAO,CAAA;IAAG;EAChD;EAEA,CAACC,aAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;;EAMAA,SAAS;AACP,UAAM,EAAEC,IAAIJ,OAAOC,MAAK,IAAKI,YAAY,KAAKN,MAAM;AACpDC,UAAMM,KAAK,CAAC,EAAEF,IAAIG,EAAC,GAAI,EAAEH,IAAII,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrDP,UAAMK,KAAK,CAAC,EAAEF,IAAIG,EAAC,GAAI,EAAEH,IAAII,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrD,WAAOE,eAAe;MAAEN;MAAIJ;MAAOC;IAAM,CAAA;EAC3C;EAEA,IAAIH,QAAe;AACjB,WAAO,KAAKC;EACd;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKD,OAAOC;EACrB;EAEA,IAAIC,QAAgB;AAClB,WAAO,KAAKF,OAAOE;EACrB;;;;EAMAU,SAASP,IAA8B;AACrC,WAAO,KAAKJ,MAAMY,KAAK,CAACC,SAASA,KAAKT,OAAOA,EAAAA;EAC/C;EAEAU,QAAQV,IAAkB;AACxB,WAAO,KAAKO,SAASP,EAAAA,KAAOW,gBAAAA;EAC9B;EAEAC,YAAY,EAAEC,KAAI,IAAyB,CAAC,GAAW;AACrD,WAAO,KAAKjB,MAAMkB,OAAO,CAACL,SAAS,CAACI,QAAQA,SAASJ,KAAKI,IAAI;EAChE;;;;EAMAE,SAASf,IAA8B;AACrC,WAAO,KAAKH,MAAMW,KAAK,CAACQ,SAASA,KAAKhB,OAAOA,EAAAA;EAC/C;EAEAiB,QAAQjB,IAAkB;AACxB,WAAO,KAAKe,SAASf,EAAAA,KAAOW,gBAAAA;EAC9B;EAEAO,YAAY,EAAEL,MAAMM,QAAQC,OAAM,IAAyB,CAAC,GAAW;AACrE,WAAO,KAAKvB,MAAMiB,OAChB,CAACE,UACE,CAACH,QAAQA,SAASG,KAAKH,UAAU,CAACM,UAAUA,WAAWH,KAAKG,YAAY,CAACC,UAAUA,WAAWJ,KAAKI,OAAK;EAE/G;;;;EAMAC,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAKtB,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEAwB,YAAQG,IAAIL,KAAKtB,EAAE;AACnB,UAAM4B,UAAU,KAAKV,YAAY;MAAEC,QAAQG,KAAKtB;IAAG,CAAA,EAChD6B,IAAI,CAACb,SAAS,KAAKN,QAAQM,KAAKI,MAAM,CAAA,EACtCN,OAAOgB,UAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAACX,WAAW,KAAKG,UAAUH,QAAQI,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKGxC,mBAAAA;EAWRyC,QAAc;AACZ,SAAKtC,OAAOC,MAAMsC,SAAS;AAC3B,SAAKvC,OAAOE,MAAMqC,SAAS;AAC3B,WAAO;EACT;EAEAC,SAASzC,OAAoB;AAC3B,SAAK0C,SAAS1C,MAAME,KAAK;AACzB,SAAKyC,SAAS3C,MAAMG,KAAK;AACzB,WAAO;EACT;EAEAyC,UAAUC,QAAuB;AAC/BA,WAAOC,QAAQ,CAAC9C,UAAAA;AACd,WAAK0C,SAAS1C,MAAME,KAAK;AACzB,WAAKyC,SAAS3C,MAAMG,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEA4C,QAAQhC,MAAkB;AACxBiC,IAAAA,WAAUjC,KAAKT,IAAI,kBAAA;;;;;;;;;AACnB0C,IAAAA,WAAU,CAAC,KAAKnC,SAASE,KAAKT,EAAE,GAAG,wBAAwBS,KAAKT,EAAE,IAAE;;;;;;;;;AACpE,SAAKL,OAAOC,MAAM+C,KAAKlC,IAAAA;AACvB,WAAOA;EACT;EAEA2B,SAASxC,OAAuB;AAC9B,WAAOA,MAAMiC,IAAI,CAACpB,SAAS,KAAKgC,QAAQhC,IAAAA,CAAAA;EAC1C;EAEAmC,QAAQ5B,MAAsC;AAC5C0B,IAAAA,WAAU1B,KAAKG,QAAM,QAAA;;;;;;;;;AACrBuB,IAAAA,WAAU1B,KAAKI,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAACJ,KAAKhB,IAAI;AAEZgB,aAAO;QAAEhB,IAAI6C,aAAa7B,IAAAA;QAAO,GAAGA;MAAK;IAC3C;AACA0B,IAAAA,WAAU,CAAC,KAAKnC,SAASS,KAAKhB,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAKL,OAAOE,MAAM8C,KAAK3B,IAAAA;AACvB,WAAOA;EACT;EAEAqB,SAASxC,OAAuB;AAC9B,WAAOA,MAAMgC,IAAI,CAACb,SAAS,KAAK4B,QAAQ5B,IAAAA,CAAAA;EAC1C;EAEA8B,WAAW9C,IAAmB;AAC5B,UAAMJ,QAAQmD,SAAe,KAAKpD,OAAOC,OAAiB,CAACa,SAASA,KAAKT,OAAOA,EAAAA;AAChF,UAAMH,QAAQkD,SAAe,KAAKpD,OAAOE,OAAiB,CAACmB,SAASA,KAAKG,WAAWnB,MAAMgB,KAAKI,WAAWpB,EAAAA;AAC1G,WAAO,KAAKgD,KAAK;MAAEpD;MAAOC;IAAM,CAAA;EAClC;EAEAoD,YAAYC,KAAsB;AAChC,UAAMX,SAASW,IAAIrB,IAAI,CAAC7B,OAAO,KAAK8C,WAAW9C,EAAAA,CAAAA;AAC/C,WAAO,KAAKgD,KAAI,EAAGV,UAAUC,MAAAA;EAC/B;EAEAY,WAAWnD,IAAmB;AAC5B,UAAMH,QAAQkD,SAAe,KAAKpD,OAAOE,OAAiB,CAACmB,SAASA,KAAKhB,OAAOA,EAAAA;AAChF,WAAO,KAAKgD,KAAK;MAAEpD,OAAO,CAAA;MAAIC;IAAM,CAAA;EACtC;EAEAuD,YAAYF,KAAsB;AAChC,UAAMX,SAASW,IAAIrB,IAAI,CAAC7B,OAAO,KAAKmD,WAAWnD,EAAAA,CAAAA;AAC/C,WAAO,KAAKgD,KAAI,EAAGV,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAec,uBAAf,MAAeA;EAKpB5D,YAA+B6D,QAAe;SAAfA,SAAAA;EAAgB;EAE/C,IAAIC,QAAe;AACjB,WAAO,KAAKD;EACd;EAEAE,KAAKC,IAAmC;AACtCA,OAAG,IAAI;AACP,WAAO;EACT;EAEA/C,QAAQV,IAAkB;AACxB,WAAO,KAAKuD,MAAM7C,QAAQV,EAAAA;EAC5B;EAEAyC,QAAQhC,MAAkB;AACxB,SAAK6C,OAAOb,QAAQhC,IAAAA;AACpB,WAAO;EACT;EAEAmC,QAAQ5B,MAAsC;AAC5C,SAAKsC,OAAOV,QAAQ5B,IAAAA;AACpB,WAAO;EACT;EAEAoB,SAASxC,OAAqB;AAC5B,SAAK0D,OAAOlB,SAASxC,KAAAA;AACrB,WAAO;EACT;EAEAyC,SAASxC,OAAqB;AAC5B,SAAKyD,OAAOjB,SAASxC,KAAAA;AACrB,WAAO;EACT;AACF;AAEO,IAAM6D,aAAN,MAAMA,oBAGH1B,mBAAAA;EACR,IAAa2B,UAAU;AACrB,WAAO,IAAIC,aAAyB,IAAI;EAC1C;EAESZ,KAAKtD,OAAwB;AACpC,WAAO,IAAIgE,YAAuB;MAAE9D,OAAOF,OAAOE,SAAS,CAAA;MAAIC,OAAOH,OAAOG,SAAS,CAAA;IAAG,CAAA;EAC3F;AACF;AAEO,IAAM+D,eAAN,cAGGP,qBAAAA;EACCG,KAAKC,IAA6B;AACzCA,OAAG,IAAI;AACP,WAAO;EACT;AACF;",
+  "names": ["inspectCustom", "failedInvariant", "invariant", "getSnapshot", "isNotFalsy", "removeBy", "stripUndefined", "FormatEnum", "invariant", "getSchema", "create", "log", "getSchemaProperties", "S", "BaseGraphNode", "S", "Struct", "id", "String", "type", "optional", "data", "Any", "BaseGraphEdge", "source", "target", "ExtendableBaseGraphNode", "extend", "key", "value", "Graph", "nodes", "mutable", "Array", "edges", "KEY_REGEX", "createEdgeId", "source", "target", "relation", "invariant", "match", "join", "parseEdgeId", "id", "split", "length", "undefined", "createGraph", "objects", "graph", "GraphModel", "create", "Graph", "nodes", "edges", "forEach", "object", "addNode", "type", "typename", "data", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name", "addEdge", "String", "ReadonlyGraphModel", "constructor", "graph", "_graph", "nodes", "edges", "inspectCustom", "toJSON", "id", "getSnapshot", "sort", "a", "b", "localeCompare", "stripUndefined", "findNode", "find", "node", "getNode", "failedInvariant", "filterNodes", "type", "filter", "findEdge", "edge", "getEdge", "filterEdges", "source", "target", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isNotFalsy", "flatMap", "AbstractGraphModel", "clear", "length", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "forEach", "addNode", "invariant", "push", "addEdge", "createEdgeId", "removeNode", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractGraphBuilder", "_model", "model", "call", "cb", "GraphModel", "builder", "GraphBuilder"]
+}

package/dist/lib/browser/meta.json

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