@dxos/graph 0.8.1 → 0.8.2-main.f081794
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/lib/browser/index.mjs +4 -4
- package/dist/lib/browser/index.mjs.map +3 -3
- package/dist/lib/browser/meta.json +1 -1
- package/dist/lib/node/index.cjs +3 -3
- package/dist/lib/node/index.cjs.map +3 -3
- package/dist/lib/node/meta.json +1 -1
- package/dist/lib/node-esm/index.mjs +4 -4
- package/dist/lib/node-esm/index.mjs.map +3 -3
- package/dist/lib/node-esm/meta.json +1 -1
- package/dist/types/src/model.d.ts +1 -1
- package/package.json +13 -13
- package/src/model.ts +1 -1
- package/src/util.ts +3 -3
|
@@ -5,9 +5,9 @@ import { getSnapshot } from "@dxos/live-object";
|
|
|
5
5
|
import { isNotFalsy, removeBy, stripUndefined } from "@dxos/util";
|
|
6
6
|
|
|
7
7
|
// packages/common/graph/src/util.ts
|
|
8
|
-
import { FormatEnum } from "@dxos/echo-schema";
|
|
8
|
+
import { FormatEnum, getSchema } from "@dxos/echo-schema";
|
|
9
9
|
import { invariant } from "@dxos/invariant";
|
|
10
|
-
import {
|
|
10
|
+
import { live } from "@dxos/live-object";
|
|
11
11
|
import { log } from "@dxos/log";
|
|
12
12
|
import { getSchemaProperties } from "@dxos/schema";
|
|
13
13
|
|
|
@@ -81,7 +81,7 @@ var parseEdgeId = (id) => {
|
|
|
81
81
|
};
|
|
82
82
|
};
|
|
83
83
|
var createGraph = (objects) => {
|
|
84
|
-
const graph = new GraphModel(
|
|
84
|
+
const graph = new GraphModel(live(Graph, {
|
|
85
85
|
nodes: [],
|
|
86
86
|
edges: []
|
|
87
87
|
}));
|
|
@@ -130,7 +130,7 @@ var createGraph = (objects) => {
|
|
|
130
130
|
var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/common/graph/src/model.ts";
|
|
131
131
|
var ReadonlyGraphModel = class {
|
|
132
132
|
/**
|
|
133
|
-
* NOTE: Pass in simple Graph or
|
|
133
|
+
* NOTE: Pass in simple Graph or Live.
|
|
134
134
|
*/
|
|
135
135
|
constructor(graph) {
|
|
136
136
|
this._graph = graph ?? {
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/model.ts", "../../../src/util.ts", "../../../src/types.ts"],
|
|
4
|
-
"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 2024 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\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"],
|
|
5
|
-
"mappings": ";AAIA,SAASA,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAASC,mBAAmB;AAC5B,SAA4BC,YAAYC,UAAUC,sBAAsB;;;ACFxE,SAASC,
|
|
6
|
-
"names": ["inspectCustom", "failedInvariant", "invariant", "getSnapshot", "isNotFalsy", "removeBy", "stripUndefined", "FormatEnum", "
|
|
4
|
+
"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 Live.\n */\n constructor(graph?: Graph) {\n this._graph = graph ?? { nodes: [], edges: [] };\n }\n\n [inspectCustom]() {\n return this.toJSON();\n }\n\n /**\n * Return stable sorted JSON representation of graph.\n */\n // TODO(burdon): Create separate toJson method with computed signal.\n toJSON() {\n const { id, nodes, edges } = getSnapshot(this._graph);\n nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n return stripUndefined({ id, nodes, edges });\n }\n\n get graph(): Graph {\n return this._graph;\n }\n\n get nodes(): Node[] {\n return this._graph.nodes as Node[];\n }\n\n get edges(): Edge[] {\n return this._graph.edges as Edge[];\n }\n\n //\n // Nodes\n //\n\n findNode(id: string): Node | undefined {\n return this.nodes.find((node) => node.id === id);\n }\n\n getNode(id: string): Node {\n return this.findNode(id) ?? failedInvariant();\n }\n\n filterNodes({ type }: Partial<GraphNode> = {}): Node[] {\n return this.nodes.filter((node) => !type || type === node.type);\n }\n\n //\n // Edges\n //\n\n findEdge(id: string): Edge | undefined {\n return this.edges.find((edge) => edge.id === id);\n }\n\n getEdge(id: string): Edge {\n return this.findEdge(id) ?? failedInvariant();\n }\n\n filterEdges({ type, source, target }: Partial<GraphEdge> = {}): Edge[] {\n return this.edges.filter(\n (edge) =>\n (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),\n );\n }\n\n //\n // Traverse\n //\n\n traverse(root: Node): Node[] {\n return this._traverse(root);\n }\n\n private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {\n if (visited.has(root.id)) {\n return [];\n }\n\n visited.add(root.id);\n const targets = this.filterEdges({ source: root.id })\n .map((edge) => this.getNode(edge.target))\n .filter(isNotFalsy);\n\n return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n }\n}\n\n/**\n * Typed wrapper.\n */\nexport abstract class AbstractGraphModel<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends AbstractGraphModel<Node, Edge, Model, Builder>,\n Builder extends AbstractGraphBuilder<Node, Edge, Model>,\n> extends ReadonlyGraphModel<Node, Edge> {\n /**\n * Allows chaining.\n */\n abstract get builder(): Builder;\n\n /**\n * Shallow copy of provided graph.\n */\n abstract copy(graph?: Partial<Graph>): Model;\n\n clear(): this {\n this._graph.nodes.length = 0;\n this._graph.edges.length = 0;\n return this;\n }\n\n addGraph(graph: Model): this {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n return this;\n }\n\n addGraphs(graphs: Model[]): this {\n graphs.forEach((graph) => {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n });\n return this;\n }\n\n addNode(node: Node): Node {\n invariant(node.id, 'ID is required');\n invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n this._graph.nodes.push(node);\n return node;\n }\n\n addNodes(nodes: Node[]): Node[] {\n return nodes.map((node) => this.addNode(node));\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n invariant(edge.source);\n invariant(edge.target);\n if (!edge.id) {\n // TODO(burdon): Generate random id.\n edge = { id: createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n this._graph.edges.push(edge as Edge);\n return edge as Edge;\n }\n\n addEdges(edges: Edge[]): Edge[] {\n return edges.map((edge) => this.addEdge(edge));\n }\n\n removeNode(id: string): Model {\n const nodes = removeBy<Node>(this._graph.nodes as Node[], (node) => node.id === id);\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n return this.copy({ nodes, edges });\n }\n\n removeNodes(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeNode(id));\n return this.copy().addGraphs(graphs);\n }\n\n removeEdge(id: string): Model {\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.id === id);\n return this.copy({ nodes: [], edges });\n }\n\n removeEdges(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeEdge(id));\n return this.copy().addGraphs(graphs);\n }\n}\n\n/**\n * Chainable wrapper\n */\nexport abstract class AbstractGraphBuilder<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends GraphModel<Node, Edge>,\n> {\n constructor(protected readonly _model: Model) {}\n\n get model(): Model {\n return this._model;\n }\n\n call(cb: (builder: this) => void): this {\n cb(this);\n return this;\n }\n\n getNode(id: string): Node {\n return this.model.getNode(id);\n }\n\n addNode(node: Node): this {\n this._model.addNode(node);\n return this;\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): this {\n this._model.addEdge(edge);\n return this;\n }\n\n addNodes(nodes: Node[]): this {\n this._model.addNodes(nodes);\n return this;\n }\n\n addEdges(edges: Edge[]): this {\n this._model.addEdges(edges);\n return this;\n }\n}\n\nexport class GraphModel<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {\n override get builder() {\n return new GraphBuilder<Node, Edge>(this);\n }\n\n override copy(graph?: Partial<Graph>) {\n return new GraphModel<Node, Edge>({ nodes: graph?.nodes ?? [], edges: graph?.edges ?? [] });\n }\n}\n\nexport class GraphBuilder<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {\n override call(cb: (builder: this) => void) {\n cb(this);\n return this;\n }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type ReactiveEchoObject } from '@dxos/echo-db';\nimport { FormatEnum, getSchema } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { live } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { getSchemaProperties } from '@dxos/schema';\n\nimport { GraphModel } from './model';\nimport { Graph, type GraphNode } from './types';\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>>>(live(Graph, { nodes: [], edges: [] }));\n\n // Map objects.\n objects.forEach((object) => {\n graph.addNode({ id: object.id, type: object.typename, data: object });\n });\n\n // Find references.\n objects.forEach((object) => {\n const schema = getSchema(object);\n if (!schema) {\n log.info('no schema for object', { id: object.id.slice(0, 8) });\n return;\n }\n\n // Parse schema to follow referenced objects.\n for (const prop of getSchemaProperties(schema.ast, object)) {\n if (prop.format === FormatEnum.Ref) {\n const source = object;\n const target = object[prop.name]?.target;\n if (target) {\n graph.addEdge({\n id: createEdgeId({ source: source.id, target: target.id, relation: String(prop.name) }),\n source: source.id,\n target: target.id,\n });\n }\n }\n }\n });\n\n return graph;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { 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\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"],
|
|
5
|
+
"mappings": ";AAIA,SAASA,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAASC,mBAAmB;AAC5B,SAA4BC,YAAYC,UAAUC,sBAAsB;;;ACFxE,SAASC,YAAYC,iBAAiB;AACtC,SAASC,iBAAiB;AAC1B,SAASC,YAAY;AACrB,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;AAeO,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;;;;AD7CA,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,KAAKC,OAAO;IAAEC,OAAO,CAAA;IAAIC,OAAO,CAAA;EAAG,CAAA,CAAA;AAGpGN,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;",
|
|
6
|
+
"names": ["inspectCustom", "failedInvariant", "invariant", "getSnapshot", "isNotFalsy", "removeBy", "stripUndefined", "FormatEnum", "getSchema", "invariant", "live", "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", "live", "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"]
|
|
7
7
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":
|
|
1
|
+
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":9092,"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":23766,"imports":[{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/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":18672},"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":5439},"packages/common/graph/src/util.ts":{"bytesInOutput":2273},"packages/common/graph/src/types.ts":{"bytesInOutput":551},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":8688}}}
|
package/dist/lib/node/index.cjs
CHANGED
|
@@ -107,7 +107,7 @@ var parseEdgeId = (id) => {
|
|
|
107
107
|
};
|
|
108
108
|
};
|
|
109
109
|
var createGraph = (objects) => {
|
|
110
|
-
const graph = new GraphModel((0, import_live_object2.
|
|
110
|
+
const graph = new GraphModel((0, import_live_object2.live)(Graph, {
|
|
111
111
|
nodes: [],
|
|
112
112
|
edges: []
|
|
113
113
|
}));
|
|
@@ -119,7 +119,7 @@ var createGraph = (objects) => {
|
|
|
119
119
|
});
|
|
120
120
|
});
|
|
121
121
|
objects.forEach((object) => {
|
|
122
|
-
const schema = (0,
|
|
122
|
+
const schema = (0, import_echo_schema.getSchema)(object);
|
|
123
123
|
if (!schema) {
|
|
124
124
|
import_log.log.info("no schema for object", {
|
|
125
125
|
id: object.id.slice(0, 8)
|
|
@@ -154,7 +154,7 @@ var createGraph = (objects) => {
|
|
|
154
154
|
var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/common/graph/src/model.ts";
|
|
155
155
|
var ReadonlyGraphModel = class {
|
|
156
156
|
/**
|
|
157
|
-
* NOTE: Pass in simple Graph or
|
|
157
|
+
* NOTE: Pass in simple Graph or Live.
|
|
158
158
|
*/
|
|
159
159
|
constructor(graph) {
|
|
160
160
|
this._graph = graph ?? {
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/model.ts", "../../../src/util.ts", "../../../src/types.ts"],
|
|
4
|
-
"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 2024 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\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"],
|
|
5
|
-
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,mBAA8B;AAC9B,uBAA2C;AAC3C,yBAA4B;AAC5B,kBAAwE;ACFxE,
|
|
6
|
-
"names": ["import_invariant", "import_live_object", "import_echo_schema", "BaseGraphNode", "S", "Struct", "id", "String", "type", "optional", "data", "Any", "BaseGraphEdge", "source", "target", "ExtendableBaseGraphNode", "extend", "key", "value", "Graph", "nodes", "mutable", "Array", "edges", "KEY_REGEX", "createEdgeId", "relation", "invariant", "match", "join", "parseEdgeId", "split", "length", "undefined", "createGraph", "objects", "graph", "GraphModel", "
|
|
4
|
+
"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 Live.\n */\n constructor(graph?: Graph) {\n this._graph = graph ?? { nodes: [], edges: [] };\n }\n\n [inspectCustom]() {\n return this.toJSON();\n }\n\n /**\n * Return stable sorted JSON representation of graph.\n */\n // TODO(burdon): Create separate toJson method with computed signal.\n toJSON() {\n const { id, nodes, edges } = getSnapshot(this._graph);\n nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n return stripUndefined({ id, nodes, edges });\n }\n\n get graph(): Graph {\n return this._graph;\n }\n\n get nodes(): Node[] {\n return this._graph.nodes as Node[];\n }\n\n get edges(): Edge[] {\n return this._graph.edges as Edge[];\n }\n\n //\n // Nodes\n //\n\n findNode(id: string): Node | undefined {\n return this.nodes.find((node) => node.id === id);\n }\n\n getNode(id: string): Node {\n return this.findNode(id) ?? failedInvariant();\n }\n\n filterNodes({ type }: Partial<GraphNode> = {}): Node[] {\n return this.nodes.filter((node) => !type || type === node.type);\n }\n\n //\n // Edges\n //\n\n findEdge(id: string): Edge | undefined {\n return this.edges.find((edge) => edge.id === id);\n }\n\n getEdge(id: string): Edge {\n return this.findEdge(id) ?? failedInvariant();\n }\n\n filterEdges({ type, source, target }: Partial<GraphEdge> = {}): Edge[] {\n return this.edges.filter(\n (edge) =>\n (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),\n );\n }\n\n //\n // Traverse\n //\n\n traverse(root: Node): Node[] {\n return this._traverse(root);\n }\n\n private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {\n if (visited.has(root.id)) {\n return [];\n }\n\n visited.add(root.id);\n const targets = this.filterEdges({ source: root.id })\n .map((edge) => this.getNode(edge.target))\n .filter(isNotFalsy);\n\n return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n }\n}\n\n/**\n * Typed wrapper.\n */\nexport abstract class AbstractGraphModel<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends AbstractGraphModel<Node, Edge, Model, Builder>,\n Builder extends AbstractGraphBuilder<Node, Edge, Model>,\n> extends ReadonlyGraphModel<Node, Edge> {\n /**\n * Allows chaining.\n */\n abstract get builder(): Builder;\n\n /**\n * Shallow copy of provided graph.\n */\n abstract copy(graph?: Partial<Graph>): Model;\n\n clear(): this {\n this._graph.nodes.length = 0;\n this._graph.edges.length = 0;\n return this;\n }\n\n addGraph(graph: Model): this {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n return this;\n }\n\n addGraphs(graphs: Model[]): this {\n graphs.forEach((graph) => {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n });\n return this;\n }\n\n addNode(node: Node): Node {\n invariant(node.id, 'ID is required');\n invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n this._graph.nodes.push(node);\n return node;\n }\n\n addNodes(nodes: Node[]): Node[] {\n return nodes.map((node) => this.addNode(node));\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n invariant(edge.source);\n invariant(edge.target);\n if (!edge.id) {\n // TODO(burdon): Generate random id.\n edge = { id: createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n this._graph.edges.push(edge as Edge);\n return edge as Edge;\n }\n\n addEdges(edges: Edge[]): Edge[] {\n return edges.map((edge) => this.addEdge(edge));\n }\n\n removeNode(id: string): Model {\n const nodes = removeBy<Node>(this._graph.nodes as Node[], (node) => node.id === id);\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n return this.copy({ nodes, edges });\n }\n\n removeNodes(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeNode(id));\n return this.copy().addGraphs(graphs);\n }\n\n removeEdge(id: string): Model {\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.id === id);\n return this.copy({ nodes: [], edges });\n }\n\n removeEdges(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeEdge(id));\n return this.copy().addGraphs(graphs);\n }\n}\n\n/**\n * Chainable wrapper\n */\nexport abstract class AbstractGraphBuilder<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends GraphModel<Node, Edge>,\n> {\n constructor(protected readonly _model: Model) {}\n\n get model(): Model {\n return this._model;\n }\n\n call(cb: (builder: this) => void): this {\n cb(this);\n return this;\n }\n\n getNode(id: string): Node {\n return this.model.getNode(id);\n }\n\n addNode(node: Node): this {\n this._model.addNode(node);\n return this;\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): this {\n this._model.addEdge(edge);\n return this;\n }\n\n addNodes(nodes: Node[]): this {\n this._model.addNodes(nodes);\n return this;\n }\n\n addEdges(edges: Edge[]): this {\n this._model.addEdges(edges);\n return this;\n }\n}\n\nexport class GraphModel<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {\n override get builder() {\n return new GraphBuilder<Node, Edge>(this);\n }\n\n override copy(graph?: Partial<Graph>) {\n return new GraphModel<Node, Edge>({ nodes: graph?.nodes ?? [], edges: graph?.edges ?? [] });\n }\n}\n\nexport class GraphBuilder<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {\n override call(cb: (builder: this) => void) {\n cb(this);\n return this;\n }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type ReactiveEchoObject } from '@dxos/echo-db';\nimport { FormatEnum, getSchema } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { live } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { getSchemaProperties } from '@dxos/schema';\n\nimport { GraphModel } from './model';\nimport { Graph, type GraphNode } from './types';\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>>>(live(Graph, { nodes: [], edges: [] }));\n\n // Map objects.\n objects.forEach((object) => {\n graph.addNode({ id: object.id, type: object.typename, data: object });\n });\n\n // Find references.\n objects.forEach((object) => {\n const schema = getSchema(object);\n if (!schema) {\n log.info('no schema for object', { id: object.id.slice(0, 8) });\n return;\n }\n\n // Parse schema to follow referenced objects.\n for (const prop of getSchemaProperties(schema.ast, object)) {\n if (prop.format === FormatEnum.Ref) {\n const source = object;\n const target = object[prop.name]?.target;\n if (target) {\n graph.addEdge({\n id: createEdgeId({ source: source.id, target: target.id, relation: String(prop.name) }),\n source: source.id,\n target: target.id,\n });\n }\n }\n }\n });\n\n return graph;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { 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\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"],
|
|
5
|
+
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,mBAA8B;AAC9B,uBAA2C;AAC3C,yBAA4B;AAC5B,kBAAwE;ACFxE,yBAAsC;AACtC,IAAAA,oBAA0B;AAC1B,IAAAC,sBAAqB;AACrB,iBAAoB;AACpB,oBAAoC;ACLpC,IAAAC,sBAAkB;AAGX,IAAMC,gBAAgBC,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;AACxB,CAAA;AAeO,IAAMC,gBAAgBR,sBAAEC,OAAO;EACpCC,IAAIF,sBAAEG;EACNC,MAAMJ,sBAAEK,SAASL,sBAAEG,MAAM;EACzBG,MAAMN,sBAAEK,SAASL,sBAAEO,GAAG;EACtBE,QAAQT,sBAAEG;EACVO,QAAQV,sBAAEG;AACZ,CAAA;AAkBA,IAAMQ,0BAA0BX,sBAAEY,OAAOb,eAAeC,sBAAEC,OAAO,CAAC,GAAG;EAAEY,KAAKb,sBAAEG;EAAQW,OAAOd,sBAAEO;AAAI,CAAA,CAAA;AAK5F,IAAMQ,QAAQf,sBAAEC,OAAO;EAC5BC,IAAIF,sBAAEK,SAASL,sBAAEG,MAAM;EACvBa,OAAOhB,sBAAEiB,QAAQjB,sBAAEkB,MAAMP,uBAAAA,CAAAA;EACzBQ,OAAOnB,sBAAEiB,QAAQjB,sBAAEkB,MAAMV,aAAAA,CAAAA;AAC3B,CAAA;;AD7CA,IAAMY,YAAY;AAKX,IAAMC,eAAe,CAAC,EAAEZ,QAAQC,QAAQY,SAAQ,MAAY;AACjEC,mCAAUd,OAAOe,MAAMJ,SAAAA,GAAY,mBAAmBX,MAAAA,IAAQ;;;;;;;;;AAC9Dc,mCAAUb,OAAOc,MAAMJ,SAAAA,GAAY,mBAAmBV,MAAAA,IAAQ;;;;;;;;;AAC9D,SAAO;IAACD;IAAQa;IAAUZ;IAAQe,KAAK,GAAA;AACzC;AAEO,IAAMC,cAAc,CAACxB,OAAAA;AAC1B,QAAM,CAACO,QAAQa,UAAUZ,MAAAA,IAAUR,GAAGyB,MAAM,GAAA;AAC5CJ,mCAAUd,OAAOmB,UAAUlB,OAAOkB,QAAM,QAAA;;;;;;;;;AACxC,SAAO;IAAEnB;IAAQa,UAAUA,SAASM,SAASN,WAAWO;IAAWnB;EAAO;AAC5E;AAMO,IAAMoB,cAAc,CAACC,YAAAA;AAC1B,QAAMC,QAAQ,IAAIC,eAA+CC,0BAAKnB,OAAO;IAAEC,OAAO,CAAA;IAAIG,OAAO,CAAA;EAAG,CAAA,CAAA;AAGpGY,UAAQI,QAAQ,CAACC,WAAAA;AACfJ,UAAMK,QAAQ;MAAEnC,IAAIkC,OAAOlC;MAAIE,MAAMgC,OAAOE;MAAUhC,MAAM8B;IAAO,CAAA;EACrE,CAAA;AAGAL,UAAQI,QAAQ,CAACC,WAAAA;AACf,UAAMG,aAASC,8BAAUJ,MAAAA;AACzB,QAAI,CAACG,QAAQ;AACXE,qBAAIC,KAAK,wBAAwB;QAAExC,IAAIkC,OAAOlC,GAAGyC,MAAM,GAAG,CAAA;MAAG,GAAA;;;;;;AAC7D;IACF;AAGA,eAAWC,YAAQC,mCAAoBN,OAAOO,KAAKV,MAAAA,GAAS;AAC1D,UAAIQ,KAAKG,WAAWC,8BAAWC,KAAK;AAClC,cAAMxC,SAAS2B;AACf,cAAM1B,SAAS0B,OAAOQ,KAAKM,IAAI,GAAGxC;AAClC,YAAIA,QAAQ;AACVsB,gBAAMmB,QAAQ;YACZjD,IAAImB,aAAa;cAAEZ,QAAQA,OAAOP;cAAIQ,QAAQA,OAAOR;cAAIoB,UAAUnB,OAAOyC,KAAKM,IAAI;YAAE,CAAA;YACrFzC,QAAQA,OAAOP;YACfQ,QAAQA,OAAOR;UACjB,CAAA;QACF;MACF;IACF;EACF,CAAA;AAEA,SAAO8B;AACT;;ADrDO,IAAMoB,qBAAN,MAAMA;;;;EASXC,YAAYrB,OAAe;AACzB,SAAKsB,SAAStB,SAAS;MAAEhB,OAAO,CAAA;MAAIG,OAAO,CAAA;IAAG;EAChD;EAEA,CAACoC,0BAAAA,IAAiB;AAChB,WAAO,KAAKC,OAAM;EACpB;;;;;EAMAA,SAAS;AACP,UAAM,EAAEtD,IAAIc,OAAOG,MAAK,QAAKsC,gCAAY,KAAKH,MAAM;AACpDtC,UAAM0C,KAAK,CAAC,EAAExD,IAAIyD,EAAC,GAAI,EAAEzD,IAAI0D,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrDzC,UAAMuC,KAAK,CAAC,EAAExD,IAAIyD,EAAC,GAAI,EAAEzD,IAAI0D,EAAC,MAAOD,EAAEE,cAAcD,CAAAA,CAAAA;AACrD,eAAOE,4BAAe;MAAE5D;MAAIc;MAAOG;IAAM,CAAA;EAC3C;EAEA,IAAIa,QAAe;AACjB,WAAO,KAAKsB;EACd;EAEA,IAAItC,QAAgB;AAClB,WAAO,KAAKsC,OAAOtC;EACrB;EAEA,IAAIG,QAAgB;AAClB,WAAO,KAAKmC,OAAOnC;EACrB;;;;EAMA4C,SAAS7D,IAA8B;AACrC,WAAO,KAAKc,MAAMgD,KAAK,CAACC,SAASA,KAAK/D,OAAOA,EAAAA;EAC/C;EAEAgE,QAAQhE,IAAkB;AACxB,WAAO,KAAK6D,SAAS7D,EAAAA,SAAOiE,kCAAAA;EAC9B;EAEAC,YAAY,EAAEhE,KAAI,IAAyB,CAAC,GAAW;AACrD,WAAO,KAAKY,MAAMqD,OAAO,CAACJ,SAAS,CAAC7D,QAAQA,SAAS6D,KAAK7D,IAAI;EAChE;;;;EAMAkE,SAASpE,IAA8B;AACrC,WAAO,KAAKiB,MAAM6C,KAAK,CAACO,SAASA,KAAKrE,OAAOA,EAAAA;EAC/C;EAEAsE,QAAQtE,IAAkB;AACxB,WAAO,KAAKoE,SAASpE,EAAAA,SAAOiE,kCAAAA;EAC9B;EAEAM,YAAY,EAAErE,MAAMK,QAAQC,OAAM,IAAyB,CAAC,GAAW;AACrE,WAAO,KAAKS,MAAMkD,OAChB,CAACE,UACE,CAACnE,QAAQA,SAASmE,KAAKnE,UAAU,CAACK,UAAUA,WAAW8D,KAAK9D,YAAY,CAACC,UAAUA,WAAW6D,KAAK7D,OAAK;EAE/G;;;;EAMAgE,SAASC,MAAoB;AAC3B,WAAO,KAAKC,UAAUD,IAAAA;EACxB;EAEQC,UAAUD,MAAYE,UAAuB,oBAAIC,IAAAA,GAAe;AACtE,QAAID,QAAQE,IAAIJ,KAAKzE,EAAE,GAAG;AACxB,aAAO,CAAA;IACT;AAEA2E,YAAQG,IAAIL,KAAKzE,EAAE;AACnB,UAAM+E,UAAU,KAAKR,YAAY;MAAEhE,QAAQkE,KAAKzE;IAAG,CAAA,EAChDgF,IAAI,CAACX,SAAS,KAAKL,QAAQK,KAAK7D,MAAM,CAAA,EACtC2D,OAAOc,sBAAAA;AAEV,WAAO;MAACR;SAASM,QAAQG,QAAQ,CAAC1E,WAAW,KAAKkE,UAAUlE,QAAQmE,OAAAA,CAAAA;;EACtE;AACF;AAKO,IAAeQ,qBAAf,cAKGjC,mBAAAA;EAWRkC,QAAc;AACZ,SAAKhC,OAAOtC,MAAMY,SAAS;AAC3B,SAAK0B,OAAOnC,MAAMS,SAAS;AAC3B,WAAO;EACT;EAEA2D,SAASvD,OAAoB;AAC3B,SAAKwD,SAASxD,MAAMhB,KAAK;AACzB,SAAKyE,SAASzD,MAAMb,KAAK;AACzB,WAAO;EACT;EAEAuE,UAAUC,QAAuB;AAC/BA,WAAOxD,QAAQ,CAACH,UAAAA;AACd,WAAKwD,SAASxD,MAAMhB,KAAK;AACzB,WAAKyE,SAASzD,MAAMb,KAAK;IAC3B,CAAA;AACA,WAAO;EACT;EAEAkB,QAAQ4B,MAAkB;AACxB1C,yBAAAA,WAAU0C,KAAK/D,IAAI,kBAAA;;;;;;;;;AACnBqB,yBAAAA,WAAU,CAAC,KAAKwC,SAASE,KAAK/D,EAAE,GAAG,wBAAwB+D,KAAK/D,EAAE,IAAE;;;;;;;;;AACpE,SAAKoD,OAAOtC,MAAM4E,KAAK3B,IAAAA;AACvB,WAAOA;EACT;EAEAuB,SAASxE,OAAuB;AAC9B,WAAOA,MAAMkE,IAAI,CAACjB,SAAS,KAAK5B,QAAQ4B,IAAAA,CAAAA;EAC1C;EAEAd,QAAQoB,MAAsC;AAC5ChD,yBAAAA,WAAUgD,KAAK9D,QAAM,QAAA;;;;;;;;;AACrBc,yBAAAA,WAAUgD,KAAK7D,QAAM,QAAA;;;;;;;;;AACrB,QAAI,CAAC6D,KAAKrE,IAAI;AAEZqE,aAAO;QAAErE,IAAImB,aAAakD,IAAAA;QAAO,GAAGA;MAAK;IAC3C;AACAhD,yBAAAA,WAAU,CAAC,KAAKwC,SAASQ,KAAKrE,EAAE,GAAA,QAAA;;;;;;;;;AAChC,SAAKoD,OAAOnC,MAAMyE,KAAKrB,IAAAA;AACvB,WAAOA;EACT;EAEAkB,SAAStE,OAAuB;AAC9B,WAAOA,MAAM+D,IAAI,CAACX,SAAS,KAAKpB,QAAQoB,IAAAA,CAAAA;EAC1C;EAEAsB,WAAW3F,IAAmB;AAC5B,UAAMc,YAAQ8E,sBAAe,KAAKxC,OAAOtC,OAAiB,CAACiD,SAASA,KAAK/D,OAAOA,EAAAA;AAChF,UAAMiB,YAAQ2E,sBAAe,KAAKxC,OAAOnC,OAAiB,CAACoD,SAASA,KAAK9D,WAAWP,MAAMqE,KAAK7D,WAAWR,EAAAA;AAC1G,WAAO,KAAK6F,KAAK;MAAE/E;MAAOG;IAAM,CAAA;EAClC;EAEA6E,YAAYC,KAAsB;AAChC,UAAMN,SAASM,IAAIf,IAAI,CAAChF,OAAO,KAAK2F,WAAW3F,EAAAA,CAAAA;AAC/C,WAAO,KAAK6F,KAAI,EAAGL,UAAUC,MAAAA;EAC/B;EAEAO,WAAWhG,IAAmB;AAC5B,UAAMiB,YAAQ2E,sBAAe,KAAKxC,OAAOnC,OAAiB,CAACoD,SAASA,KAAKrE,OAAOA,EAAAA;AAChF,WAAO,KAAK6F,KAAK;MAAE/E,OAAO,CAAA;MAAIG;IAAM,CAAA;EACtC;EAEAgF,YAAYF,KAAsB;AAChC,UAAMN,SAASM,IAAIf,IAAI,CAAChF,OAAO,KAAKgG,WAAWhG,EAAAA,CAAAA;AAC/C,WAAO,KAAK6F,KAAI,EAAGL,UAAUC,MAAAA;EAC/B;AACF;AAKO,IAAeS,uBAAf,MAAeA;EAKpB/C,YAA+BgD,QAAe;SAAfA,SAAAA;EAAgB;EAE/C,IAAIC,QAAe;AACjB,WAAO,KAAKD;EACd;EAEAE,KAAKC,IAAmC;AACtCA,OAAG,IAAI;AACP,WAAO;EACT;EAEAtC,QAAQhE,IAAkB;AACxB,WAAO,KAAKoG,MAAMpC,QAAQhE,EAAAA;EAC5B;EAEAmC,QAAQ4B,MAAkB;AACxB,SAAKoC,OAAOhE,QAAQ4B,IAAAA;AACpB,WAAO;EACT;EAEAd,QAAQoB,MAAsC;AAC5C,SAAK8B,OAAOlD,QAAQoB,IAAAA;AACpB,WAAO;EACT;EAEAiB,SAASxE,OAAqB;AAC5B,SAAKqF,OAAOb,SAASxE,KAAAA;AACrB,WAAO;EACT;EAEAyE,SAAStE,OAAqB;AAC5B,SAAKkF,OAAOZ,SAAStE,KAAAA;AACrB,WAAO;EACT;AACF;AAEO,IAAMc,aAAN,MAAMA,oBAGHoD,mBAAAA;EACR,IAAaoB,UAAU;AACrB,WAAO,IAAIC,aAAyB,IAAI;EAC1C;EAESX,KAAK/D,OAAwB;AACpC,WAAO,IAAIC,YAAuB;MAAEjB,OAAOgB,OAAOhB,SAAS,CAAA;MAAIG,OAAOa,OAAOb,SAAS,CAAA;IAAG,CAAA;EAC3F;AACF;AAEO,IAAMuF,eAAN,cAGGN,qBAAAA;EACCG,KAAKC,IAA6B;AACzCA,OAAG,IAAI;AACP,WAAO;EACT;AACF;",
|
|
6
|
+
"names": ["import_invariant", "import_live_object", "import_echo_schema", "BaseGraphNode", "S", "Struct", "id", "String", "type", "optional", "data", "Any", "BaseGraphEdge", "source", "target", "ExtendableBaseGraphNode", "extend", "key", "value", "Graph", "nodes", "mutable", "Array", "edges", "KEY_REGEX", "createEdgeId", "relation", "invariant", "match", "join", "parseEdgeId", "split", "length", "undefined", "createGraph", "objects", "graph", "GraphModel", "live", "forEach", "object", "addNode", "typename", "schema", "getSchema", "log", "info", "slice", "prop", "getSchemaProperties", "ast", "format", "FormatEnum", "Ref", "name", "addEdge", "ReadonlyGraphModel", "constructor", "_graph", "inspectCustom", "toJSON", "getSnapshot", "sort", "a", "b", "localeCompare", "stripUndefined", "findNode", "find", "node", "getNode", "failedInvariant", "filterNodes", "filter", "findEdge", "edge", "getEdge", "filterEdges", "traverse", "root", "_traverse", "visited", "Set", "has", "add", "targets", "map", "isNotFalsy", "flatMap", "AbstractGraphModel", "clear", "addGraph", "addNodes", "addEdges", "addGraphs", "graphs", "push", "removeNode", "removeBy", "copy", "removeNodes", "ids", "removeEdge", "removeEdges", "AbstractGraphBuilder", "_model", "model", "call", "cb", "builder", "GraphBuilder"]
|
|
7
7
|
}
|
package/dist/lib/node/meta.json
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":
|
|
1
|
+
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":9092,"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":23766,"imports":[{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/index.ts":{"bytes":647,"imports":[{"path":"packages/common/graph/src/model.ts","kind":"import-statement","original":"./model"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"}},"outputs":{"packages/common/graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":18672},"packages/common/graph/dist/lib/node/index.cjs":{"imports":[{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/log","kind":"import-statement","external":true},{"path":"@dxos/schema","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"exports":["AbstractGraphBuilder","AbstractGraphModel","BaseGraphEdge","BaseGraphNode","Graph","GraphBuilder","GraphModel","ReadonlyGraphModel","createEdgeId","createGraph","parseEdgeId"],"entryPoint":"packages/common/graph/src/index.ts","inputs":{"packages/common/graph/src/model.ts":{"bytesInOutput":5439},"packages/common/graph/src/util.ts":{"bytesInOutput":2273},"packages/common/graph/src/types.ts":{"bytesInOutput":551},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":8688}}}
|
|
@@ -7,9 +7,9 @@ import { getSnapshot } from "@dxos/live-object";
|
|
|
7
7
|
import { isNotFalsy, removeBy, stripUndefined } from "@dxos/util";
|
|
8
8
|
|
|
9
9
|
// packages/common/graph/src/util.ts
|
|
10
|
-
import { FormatEnum } from "@dxos/echo-schema";
|
|
10
|
+
import { FormatEnum, getSchema } from "@dxos/echo-schema";
|
|
11
11
|
import { invariant } from "@dxos/invariant";
|
|
12
|
-
import {
|
|
12
|
+
import { live } from "@dxos/live-object";
|
|
13
13
|
import { log } from "@dxos/log";
|
|
14
14
|
import { getSchemaProperties } from "@dxos/schema";
|
|
15
15
|
|
|
@@ -83,7 +83,7 @@ var parseEdgeId = (id) => {
|
|
|
83
83
|
};
|
|
84
84
|
};
|
|
85
85
|
var createGraph = (objects) => {
|
|
86
|
-
const graph = new GraphModel(
|
|
86
|
+
const graph = new GraphModel(live(Graph, {
|
|
87
87
|
nodes: [],
|
|
88
88
|
edges: []
|
|
89
89
|
}));
|
|
@@ -132,7 +132,7 @@ var createGraph = (objects) => {
|
|
|
132
132
|
var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/common/graph/src/model.ts";
|
|
133
133
|
var ReadonlyGraphModel = class {
|
|
134
134
|
/**
|
|
135
|
-
* NOTE: Pass in simple Graph or
|
|
135
|
+
* NOTE: Pass in simple Graph or Live.
|
|
136
136
|
*/
|
|
137
137
|
constructor(graph) {
|
|
138
138
|
this._graph = graph ?? {
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/model.ts", "../../../src/util.ts", "../../../src/types.ts"],
|
|
4
|
-
"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 2024 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\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"],
|
|
5
|
-
"mappings": ";;;AAIA,SAASA,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAASC,mBAAmB;AAC5B,SAA4BC,YAAYC,UAAUC,sBAAsB;;;ACFxE,SAASC,
|
|
6
|
-
"names": ["inspectCustom", "failedInvariant", "invariant", "getSnapshot", "isNotFalsy", "removeBy", "stripUndefined", "FormatEnum", "
|
|
4
|
+
"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 Live.\n */\n constructor(graph?: Graph) {\n this._graph = graph ?? { nodes: [], edges: [] };\n }\n\n [inspectCustom]() {\n return this.toJSON();\n }\n\n /**\n * Return stable sorted JSON representation of graph.\n */\n // TODO(burdon): Create separate toJson method with computed signal.\n toJSON() {\n const { id, nodes, edges } = getSnapshot(this._graph);\n nodes.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n edges.sort(({ id: a }, { id: b }) => a.localeCompare(b));\n return stripUndefined({ id, nodes, edges });\n }\n\n get graph(): Graph {\n return this._graph;\n }\n\n get nodes(): Node[] {\n return this._graph.nodes as Node[];\n }\n\n get edges(): Edge[] {\n return this._graph.edges as Edge[];\n }\n\n //\n // Nodes\n //\n\n findNode(id: string): Node | undefined {\n return this.nodes.find((node) => node.id === id);\n }\n\n getNode(id: string): Node {\n return this.findNode(id) ?? failedInvariant();\n }\n\n filterNodes({ type }: Partial<GraphNode> = {}): Node[] {\n return this.nodes.filter((node) => !type || type === node.type);\n }\n\n //\n // Edges\n //\n\n findEdge(id: string): Edge | undefined {\n return this.edges.find((edge) => edge.id === id);\n }\n\n getEdge(id: string): Edge {\n return this.findEdge(id) ?? failedInvariant();\n }\n\n filterEdges({ type, source, target }: Partial<GraphEdge> = {}): Edge[] {\n return this.edges.filter(\n (edge) =>\n (!type || type === edge.type) && (!source || source === edge.source) && (!target || target === edge.target),\n );\n }\n\n //\n // Traverse\n //\n\n traverse(root: Node): Node[] {\n return this._traverse(root);\n }\n\n private _traverse(root: Node, visited: Set<string> = new Set()): Node[] {\n if (visited.has(root.id)) {\n return [];\n }\n\n visited.add(root.id);\n const targets = this.filterEdges({ source: root.id })\n .map((edge) => this.getNode(edge.target))\n .filter(isNotFalsy);\n\n return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n }\n}\n\n/**\n * Typed wrapper.\n */\nexport abstract class AbstractGraphModel<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends AbstractGraphModel<Node, Edge, Model, Builder>,\n Builder extends AbstractGraphBuilder<Node, Edge, Model>,\n> extends ReadonlyGraphModel<Node, Edge> {\n /**\n * Allows chaining.\n */\n abstract get builder(): Builder;\n\n /**\n * Shallow copy of provided graph.\n */\n abstract copy(graph?: Partial<Graph>): Model;\n\n clear(): this {\n this._graph.nodes.length = 0;\n this._graph.edges.length = 0;\n return this;\n }\n\n addGraph(graph: Model): this {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n return this;\n }\n\n addGraphs(graphs: Model[]): this {\n graphs.forEach((graph) => {\n this.addNodes(graph.nodes);\n this.addEdges(graph.edges);\n });\n return this;\n }\n\n addNode(node: Node): Node {\n invariant(node.id, 'ID is required');\n invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n this._graph.nodes.push(node);\n return node;\n }\n\n addNodes(nodes: Node[]): Node[] {\n return nodes.map((node) => this.addNode(node));\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n invariant(edge.source);\n invariant(edge.target);\n if (!edge.id) {\n // TODO(burdon): Generate random id.\n edge = { id: createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n this._graph.edges.push(edge as Edge);\n return edge as Edge;\n }\n\n addEdges(edges: Edge[]): Edge[] {\n return edges.map((edge) => this.addEdge(edge));\n }\n\n removeNode(id: string): Model {\n const nodes = removeBy<Node>(this._graph.nodes as Node[], (node) => node.id === id);\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n return this.copy({ nodes, edges });\n }\n\n removeNodes(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeNode(id));\n return this.copy().addGraphs(graphs);\n }\n\n removeEdge(id: string): Model {\n const edges = removeBy<Edge>(this._graph.edges as Edge[], (edge) => edge.id === id);\n return this.copy({ nodes: [], edges });\n }\n\n removeEdges(ids: string[]): Model {\n const graphs = ids.map((id) => this.removeEdge(id));\n return this.copy().addGraphs(graphs);\n }\n}\n\n/**\n * Chainable wrapper\n */\nexport abstract class AbstractGraphBuilder<\n Node extends BaseGraphNode,\n Edge extends BaseGraphEdge,\n Model extends GraphModel<Node, Edge>,\n> {\n constructor(protected readonly _model: Model) {}\n\n get model(): Model {\n return this._model;\n }\n\n call(cb: (builder: this) => void): this {\n cb(this);\n return this;\n }\n\n getNode(id: string): Node {\n return this.model.getNode(id);\n }\n\n addNode(node: Node): this {\n this._model.addNode(node);\n return this;\n }\n\n addEdge(edge: MakeOptional<Edge, 'id'>): this {\n this._model.addEdge(edge);\n return this;\n }\n\n addNodes(nodes: Node[]): this {\n this._model.addNodes(nodes);\n return this;\n }\n\n addEdges(edges: Edge[]): this {\n this._model.addEdges(edges);\n return this;\n }\n}\n\nexport class GraphModel<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, GraphBuilder<Node, Edge>> {\n override get builder() {\n return new GraphBuilder<Node, Edge>(this);\n }\n\n override copy(graph?: Partial<Graph>) {\n return new GraphModel<Node, Edge>({ nodes: graph?.nodes ?? [], edges: graph?.edges ?? [] });\n }\n}\n\nexport class GraphBuilder<\n Node extends BaseGraphNode = BaseGraphNode,\n Edge extends BaseGraphEdge = BaseGraphEdge,\n> extends AbstractGraphBuilder<Node, Edge, GraphModel<Node, Edge>> {\n override call(cb: (builder: this) => void) {\n cb(this);\n return this;\n }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type ReactiveEchoObject } from '@dxos/echo-db';\nimport { FormatEnum, getSchema } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { live } from '@dxos/live-object';\nimport { log } from '@dxos/log';\nimport { getSchemaProperties } from '@dxos/schema';\n\nimport { GraphModel } from './model';\nimport { Graph, type GraphNode } from './types';\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>>>(live(Graph, { nodes: [], edges: [] }));\n\n // Map objects.\n objects.forEach((object) => {\n graph.addNode({ id: object.id, type: object.typename, data: object });\n });\n\n // Find references.\n objects.forEach((object) => {\n const schema = getSchema(object);\n if (!schema) {\n log.info('no schema for object', { id: object.id.slice(0, 8) });\n return;\n }\n\n // Parse schema to follow referenced objects.\n for (const prop of getSchemaProperties(schema.ast, object)) {\n if (prop.format === FormatEnum.Ref) {\n const source = object;\n const target = object[prop.name]?.target;\n if (target) {\n graph.addEdge({\n id: createEdgeId({ source: source.id, target: target.id, relation: String(prop.name) }),\n source: source.id,\n target: target.id,\n });\n }\n }\n }\n });\n\n return graph;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { 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\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"],
|
|
5
|
+
"mappings": ";;;AAIA,SAASA,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAASC,mBAAmB;AAC5B,SAA4BC,YAAYC,UAAUC,sBAAsB;;;ACFxE,SAASC,YAAYC,iBAAiB;AACtC,SAASC,iBAAiB;AAC1B,SAASC,YAAY;AACrB,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;AAeO,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;;;;AD7CA,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,KAAKC,OAAO;IAAEC,OAAO,CAAA;IAAIC,OAAO,CAAA;EAAG,CAAA,CAAA;AAGpGN,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;",
|
|
6
|
+
"names": ["inspectCustom", "failedInvariant", "invariant", "getSnapshot", "isNotFalsy", "removeBy", "stripUndefined", "FormatEnum", "getSchema", "invariant", "live", "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", "live", "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"]
|
|
7
7
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":
|
|
1
|
+
{"inputs":{"packages/common/graph/src/types.ts":{"bytes":4441,"imports":[{"path":"@dxos/echo-schema","kind":"import-statement","external":true}],"format":"esm"},"packages/common/graph/src/util.ts":{"bytes":9092,"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":23766,"imports":[{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/live-object","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"},"packages/common/graph/src/index.ts":{"bytes":647,"imports":[{"path":"packages/common/graph/src/model.ts","kind":"import-statement","original":"./model"},{"path":"packages/common/graph/src/types.ts","kind":"import-statement","original":"./types"},{"path":"packages/common/graph/src/util.ts","kind":"import-statement","original":"./util"}],"format":"esm"}},"outputs":{"packages/common/graph/dist/lib/node-esm/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":18674},"packages/common/graph/dist/lib/node-esm/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":5439},"packages/common/graph/src/util.ts":{"bytesInOutput":2273},"packages/common/graph/src/types.ts":{"bytesInOutput":551},"packages/common/graph/src/index.ts":{"bytesInOutput":0}},"bytes":8781}}}
|
|
@@ -7,7 +7,7 @@ import { type Graph, type GraphNode, type GraphEdge, type BaseGraphNode, type Ba
|
|
|
7
7
|
export declare class ReadonlyGraphModel<Node extends BaseGraphNode = BaseGraphNode, Edge extends BaseGraphEdge = BaseGraphEdge> {
|
|
8
8
|
protected readonly _graph: Graph;
|
|
9
9
|
/**
|
|
10
|
-
* NOTE: Pass in simple Graph or
|
|
10
|
+
* NOTE: Pass in simple Graph or Live.
|
|
11
11
|
*/
|
|
12
12
|
constructor(graph?: Graph);
|
|
13
13
|
[inspectCustom](): {
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@dxos/graph",
|
|
3
|
-
"version": "0.8.
|
|
3
|
+
"version": "0.8.2-main.f081794",
|
|
4
4
|
"description": "Low-level graph API",
|
|
5
5
|
"homepage": "https://dxos.org",
|
|
6
6
|
"bugs": "https://github.com/dxos/dxos/issues",
|
|
@@ -33,23 +33,23 @@
|
|
|
33
33
|
"dependencies": {
|
|
34
34
|
"@preact/signals-core": "^1.6.0",
|
|
35
35
|
"lodash.defaultsdeep": "^4.6.1",
|
|
36
|
-
"@dxos/async": "0.8.
|
|
37
|
-
"@dxos/debug": "0.8.
|
|
38
|
-
"@dxos/echo-db": "0.8.
|
|
39
|
-
"@dxos/
|
|
40
|
-
"@dxos/
|
|
41
|
-
"@dxos/
|
|
42
|
-
"@dxos/
|
|
43
|
-
"@dxos/
|
|
44
|
-
"@dxos/schema": "0.8.
|
|
36
|
+
"@dxos/async": "0.8.2-main.f081794",
|
|
37
|
+
"@dxos/debug": "0.8.2-main.f081794",
|
|
38
|
+
"@dxos/echo-db": "0.8.2-main.f081794",
|
|
39
|
+
"@dxos/echo-schema": "0.8.2-main.f081794",
|
|
40
|
+
"@dxos/invariant": "0.8.2-main.f081794",
|
|
41
|
+
"@dxos/log": "0.8.2-main.f081794",
|
|
42
|
+
"@dxos/live-object": "0.8.2-main.f081794",
|
|
43
|
+
"@dxos/util": "0.8.2-main.f081794",
|
|
44
|
+
"@dxos/schema": "0.8.2-main.f081794"
|
|
45
45
|
},
|
|
46
46
|
"devDependencies": {
|
|
47
47
|
"@antv/graphlib": "^2.0.4",
|
|
48
48
|
"@antv/layout": "^1.2.13",
|
|
49
49
|
"@types/lodash.defaultsdeep": "^4.6.6",
|
|
50
|
-
"@dxos/echo-db": "0.8.
|
|
51
|
-
"@dxos/echo-schema": "0.8.
|
|
52
|
-
"@dxos/random": "0.8.
|
|
50
|
+
"@dxos/echo-db": "0.8.2-main.f081794",
|
|
51
|
+
"@dxos/echo-schema": "0.8.2-main.f081794",
|
|
52
|
+
"@dxos/random": "0.8.2-main.f081794"
|
|
53
53
|
},
|
|
54
54
|
"publishConfig": {
|
|
55
55
|
"access": "public"
|
package/src/model.ts
CHANGED
|
@@ -20,7 +20,7 @@ export class ReadonlyGraphModel<
|
|
|
20
20
|
protected readonly _graph: Graph;
|
|
21
21
|
|
|
22
22
|
/**
|
|
23
|
-
* NOTE: Pass in simple Graph or
|
|
23
|
+
* NOTE: Pass in simple Graph or Live.
|
|
24
24
|
*/
|
|
25
25
|
constructor(graph?: Graph) {
|
|
26
26
|
this._graph = graph ?? { nodes: [], edges: [] };
|
package/src/util.ts
CHANGED
|
@@ -3,9 +3,9 @@
|
|
|
3
3
|
//
|
|
4
4
|
|
|
5
5
|
import { type ReactiveEchoObject } from '@dxos/echo-db';
|
|
6
|
-
import { FormatEnum } from '@dxos/echo-schema';
|
|
6
|
+
import { FormatEnum, getSchema } from '@dxos/echo-schema';
|
|
7
7
|
import { invariant } from '@dxos/invariant';
|
|
8
|
-
import {
|
|
8
|
+
import { live } from '@dxos/live-object';
|
|
9
9
|
import { log } from '@dxos/log';
|
|
10
10
|
import { getSchemaProperties } from '@dxos/schema';
|
|
11
11
|
|
|
@@ -34,7 +34,7 @@ export const parseEdgeId = (id: string): EdgeMeta => {
|
|
|
34
34
|
* References are mapped onto graph edges.
|
|
35
35
|
*/
|
|
36
36
|
export const createGraph = (objects: ReactiveEchoObject<any>[]): GraphModel<GraphNode<ReactiveEchoObject<any>>> => {
|
|
37
|
-
const graph = new GraphModel<GraphNode<ReactiveEchoObject<any>>>(
|
|
37
|
+
const graph = new GraphModel<GraphNode<ReactiveEchoObject<any>>>(live(Graph, { nodes: [], edges: [] }));
|
|
38
38
|
|
|
39
39
|
// Map objects.
|
|
40
40
|
objects.forEach((object) => {
|