@dxos/graph 0.8.4-main.fbb7a13 → 0.8.4-main.fcc0d83b33
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 +16 -136
- package/dist/lib/browser/index.mjs.map +3 -3
- package/dist/lib/browser/meta.json +1 -1
- package/dist/lib/node-esm/index.mjs +16 -136
- package/dist/lib/node-esm/index.mjs.map +3 -3
- package/dist/lib/node-esm/meta.json +1 -1
- package/dist/types/src/Graph.d.ts.map +1 -1
- package/dist/types/src/GraphModel.d.ts +2 -2
- package/dist/types/src/GraphModel.d.ts.map +1 -1
- package/dist/types/src/selection.d.ts.map +1 -1
- package/dist/types/tsconfig.tsbuildinfo +1 -1
- package/package.json +12 -15
- package/src/Graph.ts +2 -0
- package/src/GraphModel.ts +4 -2
|
@@ -63,15 +63,7 @@ var SelectionModel = class {
|
|
|
63
63
|
this._registry.set(this._selected, /* @__PURE__ */ new Set());
|
|
64
64
|
}
|
|
65
65
|
add(id) {
|
|
66
|
-
invariant(id, void 0, {
|
|
67
|
-
F: __dxlog_file,
|
|
68
|
-
L: 76,
|
|
69
|
-
S: this,
|
|
70
|
-
A: [
|
|
71
|
-
"id",
|
|
72
|
-
""
|
|
73
|
-
]
|
|
74
|
-
});
|
|
66
|
+
invariant(id, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 58, S: this, A: ["id", ""] });
|
|
75
67
|
const current = this._registry.get(this._selected);
|
|
76
68
|
this._registry.set(this._selected, new Set(this._singleSelect ? [
|
|
77
69
|
id
|
|
@@ -81,15 +73,7 @@ var SelectionModel = class {
|
|
|
81
73
|
]));
|
|
82
74
|
}
|
|
83
75
|
remove(id) {
|
|
84
|
-
invariant(id, void 0, {
|
|
85
|
-
F: __dxlog_file,
|
|
86
|
-
L: 85,
|
|
87
|
-
S: this,
|
|
88
|
-
A: [
|
|
89
|
-
"id",
|
|
90
|
-
""
|
|
91
|
-
]
|
|
92
|
-
});
|
|
76
|
+
invariant(id, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file, L: 68, S: this, A: ["id", ""] });
|
|
93
77
|
const current = this._registry.get(this._selected);
|
|
94
78
|
this._registry.set(this._selected, new Set(Array.from(current.values()).filter((_id) => _id !== id)));
|
|
95
79
|
}
|
|
@@ -141,24 +125,8 @@ var Edge = Schema.Struct({
|
|
|
141
125
|
});
|
|
142
126
|
var KEY_REGEX = /\w+/;
|
|
143
127
|
var createEdgeId = ({ source, target, relation }) => {
|
|
144
|
-
invariant2(source.match(KEY_REGEX), `invalid source: ${source}`, {
|
|
145
|
-
|
|
146
|
-
L: 52,
|
|
147
|
-
S: void 0,
|
|
148
|
-
A: [
|
|
149
|
-
"source.match(KEY_REGEX)",
|
|
150
|
-
"`invalid source: ${source}`"
|
|
151
|
-
]
|
|
152
|
-
});
|
|
153
|
-
invariant2(target.match(KEY_REGEX), `invalid target: ${target}`, {
|
|
154
|
-
F: __dxlog_file2,
|
|
155
|
-
L: 53,
|
|
156
|
-
S: void 0,
|
|
157
|
-
A: [
|
|
158
|
-
"target.match(KEY_REGEX)",
|
|
159
|
-
"`invalid target: ${target}`"
|
|
160
|
-
]
|
|
161
|
-
});
|
|
128
|
+
invariant2(source.match(KEY_REGEX), `invalid source: ${source}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 27, S: void 0, A: ["source.match(KEY_REGEX)", "`invalid source: ${source}`"] });
|
|
129
|
+
invariant2(target.match(KEY_REGEX), `invalid target: ${target}`, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 28, S: void 0, A: ["target.match(KEY_REGEX)", "`invalid target: ${target}`"] });
|
|
162
130
|
return [
|
|
163
131
|
source,
|
|
164
132
|
relation,
|
|
@@ -167,15 +135,7 @@ var createEdgeId = ({ source, target, relation }) => {
|
|
|
167
135
|
};
|
|
168
136
|
var parseEdgeId = (id) => {
|
|
169
137
|
const [source, relation, target] = id.split("_");
|
|
170
|
-
invariant2(source.length && target.length, void 0, {
|
|
171
|
-
F: __dxlog_file2,
|
|
172
|
-
L: 59,
|
|
173
|
-
S: void 0,
|
|
174
|
-
A: [
|
|
175
|
-
"source.length && target.length",
|
|
176
|
-
""
|
|
177
|
-
]
|
|
178
|
-
});
|
|
138
|
+
invariant2(source.length && target.length, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file2, L: 37, S: void 0, A: ["source.length && target.length", ""] });
|
|
179
139
|
return {
|
|
180
140
|
source,
|
|
181
141
|
relation: relation.length ? relation : void 0,
|
|
@@ -213,7 +173,7 @@ var ReadonlyGraphModel = class {
|
|
|
213
173
|
/**
|
|
214
174
|
* NOTE: Pass in simple Graph or Live.
|
|
215
175
|
* @param graph - The graph data.
|
|
216
|
-
* @param change - Optional function to wrap mutations (e.g., Obj.
|
|
176
|
+
* @param change - Optional function to wrap mutations (e.g., Obj.update for ECHO objects).
|
|
217
177
|
*/
|
|
218
178
|
constructor(graph, change) {
|
|
219
179
|
this._graph = graph ?? {
|
|
@@ -319,24 +279,8 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
|
|
|
319
279
|
return this;
|
|
320
280
|
}
|
|
321
281
|
addNode(node) {
|
|
322
|
-
invariant3(node.id, "ID is required", {
|
|
323
|
-
|
|
324
|
-
L: 182,
|
|
325
|
-
S: this,
|
|
326
|
-
A: [
|
|
327
|
-
"node.id",
|
|
328
|
-
"'ID is required'"
|
|
329
|
-
]
|
|
330
|
-
});
|
|
331
|
-
invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, {
|
|
332
|
-
F: __dxlog_file3,
|
|
333
|
-
L: 183,
|
|
334
|
-
S: this,
|
|
335
|
-
A: [
|
|
336
|
-
"!this.findNode(node.id)",
|
|
337
|
-
"`node already exists: ${node.id}`"
|
|
338
|
-
]
|
|
339
|
-
});
|
|
282
|
+
invariant3(node.id, "ID is required", { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 126, S: this, A: ["node.id", "'ID is required'"] });
|
|
283
|
+
invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 127, S: this, A: ["!this.findNode(node.id)", "`node already exists: ${node.id}`"] });
|
|
340
284
|
this._mutate((graph) => {
|
|
341
285
|
graph.nodes.push(node);
|
|
342
286
|
});
|
|
@@ -346,39 +290,15 @@ var AbstractGraphModel = class extends ReadonlyGraphModel {
|
|
|
346
290
|
return nodes.map((node) => this.addNode(node));
|
|
347
291
|
}
|
|
348
292
|
addEdge(edge) {
|
|
349
|
-
invariant3(edge.source, void 0, {
|
|
350
|
-
|
|
351
|
-
L: 195,
|
|
352
|
-
S: this,
|
|
353
|
-
A: [
|
|
354
|
-
"edge.source",
|
|
355
|
-
""
|
|
356
|
-
]
|
|
357
|
-
});
|
|
358
|
-
invariant3(edge.target, void 0, {
|
|
359
|
-
F: __dxlog_file3,
|
|
360
|
-
L: 196,
|
|
361
|
-
S: this,
|
|
362
|
-
A: [
|
|
363
|
-
"edge.target",
|
|
364
|
-
""
|
|
365
|
-
]
|
|
366
|
-
});
|
|
293
|
+
invariant3(edge.source, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 137, S: this, A: ["edge.source", ""] });
|
|
294
|
+
invariant3(edge.target, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 138, S: this, A: ["edge.target", ""] });
|
|
367
295
|
if (!edge.id) {
|
|
368
296
|
edge = {
|
|
369
297
|
id: createEdgeId(edge),
|
|
370
298
|
...edge
|
|
371
299
|
};
|
|
372
300
|
}
|
|
373
|
-
invariant3(!this.findNode(edge.id), void 0, {
|
|
374
|
-
F: __dxlog_file3,
|
|
375
|
-
L: 201,
|
|
376
|
-
S: this,
|
|
377
|
-
A: [
|
|
378
|
-
"!this.findNode(edge.id!)",
|
|
379
|
-
""
|
|
380
|
-
]
|
|
381
|
-
});
|
|
301
|
+
invariant3(!this.findNode(edge.id), void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 146, S: this, A: ["!this.findNode(edge.id)", ""] });
|
|
382
302
|
this._mutate((graph) => {
|
|
383
303
|
graph.edges.push(edge);
|
|
384
304
|
});
|
|
@@ -505,24 +425,8 @@ var ReactiveGraphModel = class _ReactiveGraphModel extends GraphModel {
|
|
|
505
425
|
return this;
|
|
506
426
|
}
|
|
507
427
|
addNode(node) {
|
|
508
|
-
invariant3(node.id, "ID is required", {
|
|
509
|
-
|
|
510
|
-
L: 374,
|
|
511
|
-
S: this,
|
|
512
|
-
A: [
|
|
513
|
-
"node.id",
|
|
514
|
-
"'ID is required'"
|
|
515
|
-
]
|
|
516
|
-
});
|
|
517
|
-
invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, {
|
|
518
|
-
F: __dxlog_file3,
|
|
519
|
-
L: 375,
|
|
520
|
-
S: this,
|
|
521
|
-
A: [
|
|
522
|
-
"!this.findNode(node.id)",
|
|
523
|
-
"`node already exists: ${node.id}`"
|
|
524
|
-
]
|
|
525
|
-
});
|
|
428
|
+
invariant3(node.id, "ID is required", { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 280, S: this, A: ["node.id", "'ID is required'"] });
|
|
429
|
+
invariant3(!this.findNode(node.id), `node already exists: ${node.id}`, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 281, S: this, A: ["!this.findNode(node.id)", "`node already exists: ${node.id}`"] });
|
|
526
430
|
const current = this._registry.get(this._graphAtom);
|
|
527
431
|
this._registry.set(this._graphAtom, {
|
|
528
432
|
...current,
|
|
@@ -534,39 +438,15 @@ var ReactiveGraphModel = class _ReactiveGraphModel extends GraphModel {
|
|
|
534
438
|
return node;
|
|
535
439
|
}
|
|
536
440
|
addEdge(edge) {
|
|
537
|
-
invariant3(edge.source, void 0, {
|
|
538
|
-
|
|
539
|
-
L: 385,
|
|
540
|
-
S: this,
|
|
541
|
-
A: [
|
|
542
|
-
"edge.source",
|
|
543
|
-
""
|
|
544
|
-
]
|
|
545
|
-
});
|
|
546
|
-
invariant3(edge.target, void 0, {
|
|
547
|
-
F: __dxlog_file3,
|
|
548
|
-
L: 386,
|
|
549
|
-
S: this,
|
|
550
|
-
A: [
|
|
551
|
-
"edge.target",
|
|
552
|
-
""
|
|
553
|
-
]
|
|
554
|
-
});
|
|
441
|
+
invariant3(edge.source, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 293, S: this, A: ["edge.source", ""] });
|
|
442
|
+
invariant3(edge.target, void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 294, S: this, A: ["edge.target", ""] });
|
|
555
443
|
if (!edge.id) {
|
|
556
444
|
edge = {
|
|
557
445
|
id: createEdgeId(edge),
|
|
558
446
|
...edge
|
|
559
447
|
};
|
|
560
448
|
}
|
|
561
|
-
invariant3(!this.findNode(edge.id), void 0, {
|
|
562
|
-
F: __dxlog_file3,
|
|
563
|
-
L: 390,
|
|
564
|
-
S: this,
|
|
565
|
-
A: [
|
|
566
|
-
"!this.findNode(edge.id!)",
|
|
567
|
-
""
|
|
568
|
-
]
|
|
569
|
-
});
|
|
449
|
+
invariant3(!this.findNode(edge.id), void 0, { "~LogMeta": "~LogMeta", F: __dxlog_file3, L: 301, S: this, A: ["!this.findNode(edge.id)", ""] });
|
|
570
450
|
const current = this._registry.get(this._graphAtom);
|
|
571
451
|
this._registry.set(this._graphAtom, {
|
|
572
452
|
...current,
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../../src/selection.ts", "../../../src/Graph.ts", "../../../src/GraphModel.ts"],
|
|
4
|
-
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\n\nimport { invariant } from '@dxos/invariant';\n\n/**\n * Reactive selection model.\n */\nexport class SelectionModel {\n private readonly _registry: Registry.Registry;\n private readonly _selected: Atom.Writable<Set<string>>;\n\n constructor(private readonly _singleSelect: boolean = false) {\n this._registry = Registry.make();\n this._selected = Atom.make<Set<string>>(new Set<string>());\n }\n\n /**\n * Returns the selected IDs atom for subscription.\n */\n get selected(): Atom.Atom<Set<string>> {\n return this._selected;\n }\n\n /**\n * Gets the current selected IDs as a Set.\n */\n getSelected(): Set<string> {\n return this._registry.get(this._selected);\n }\n\n /**\n * Gets the current selected IDs as an array.\n */\n getSelectedIds(): string[] {\n return Array.from(this._registry.get(this._selected).values());\n }\n\n /**\n * Subscribe to selection changes.\n */\n subscribe(cb: (selected: Set<string>) => void): () => void {\n // Prime the atom by reading before subscribing.\n this._registry.get(this._selected);\n\n return this._registry.subscribe(this._selected, () => {\n cb(this._registry.get(this._selected));\n });\n }\n\n toJSON(): { selected: string[] } {\n return {\n selected: this.getSelectedIds(),\n };\n }\n\n /**\n * Gets the current selection size.\n */\n getSize(): number {\n return this._registry.get(this._selected).size;\n }\n\n contains(id: string): boolean {\n return this._registry.get(this._selected).has(id);\n }\n\n clear(): void {\n this._registry.set(this._selected, new Set());\n }\n\n add(id: string): void {\n invariant(id);\n const current = this._registry.get(this._selected);\n this._registry.set(\n this._selected,\n new Set<string>(this._singleSelect ? [id] : [...Array.from(current.values()), id]),\n );\n }\n\n remove(id: string): void {\n invariant(id);\n const current = this._registry.get(this._selected);\n this._registry.set(this._selected, new Set<string>(Array.from(current.values()).filter((_id) => _id !== id)));\n }\n\n // TODO(burdon): Handle single select.\n\n setSelected(ids: string[], subtract = false): void {\n const current = this._registry.get(this._selected);\n this._registry.set(this._selected, new Set([...(subtract ? Array.from(current.values()) : []), ...ids]));\n }\n\n toggleSelected(ids: string[], subtract = false): void {\n const current = this._registry.get(this._selected);\n const set = new Set<string>(subtract ? Array.from(current.values()) : undefined);\n ids.forEach((id) => {\n if (current.has(id)) {\n set.delete(id);\n } else {\n set.add(id);\n }\n });\n\n this._registry.set(this._selected, set);\n }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as Schema from 'effect/Schema';\n\nimport { invariant } from '@dxos/invariant';\nimport { type Specialize } from '@dxos/util';\n\n//\n// Node\n//\n\nexport const Node = Schema.Struct({\n id: Schema.String,\n type: Schema.optional(Schema.String),\n data: Schema.optional(Schema.Any),\n});\n\ninterface BaseNode extends Schema.Schema.Type<typeof Node> {}\n\nexport declare namespace Node {\n export type Any = Specialize<BaseNode, { data?: any }>;\n export type Node<Data = any> = Specialize<BaseNode, { data: Data }>;\n}\n\n//\n// Edge\n//\n\nexport const Edge = Schema.Struct({\n id: Schema.String,\n type: Schema.optional(Schema.String),\n source: Schema.String,\n target: Schema.String,\n data: Schema.optional(Schema.Any),\n});\n\ninterface BaseEdge extends Schema.Schema.Type<typeof Edge> {}\n\nexport declare namespace Edge {\n export type Any = Specialize<BaseEdge, { data?: any }>;\n export type Edge<Data = any> = Specialize<BaseEdge, { data: Data }>;\n}\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// Graph\n//\n\nexport const Graph = Schema.Struct({\n id: Schema.optional(Schema.String),\n nodes: Schema.mutable(Schema.Array(Node)),\n edges: Schema.mutable(Schema.Array(Edge)),\n});\n\nexport interface Any extends Schema.Schema.Type<typeof Graph> {}\n\nexport type Graph<Node extends Node.Any, Edge extends Edge.Any> = Specialize<\n Any,\n {\n nodes: Node[];\n edges: Edge[];\n }\n>;\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, type Registry } from '@effect-atom/atom-react';\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { type MakeOptional, isTruthy, removeBy } from '@dxos/util';\n\nimport * as Graph from './Graph';\n\n/**\n * Optional function to wrap mutations (e.g., for ECHO objects that require Obj.change).\n */\nexport type GraphChangeFunction = (fn: () => void) => void;\n\n/**\n * Readonly Graph wrapper.\n */\nexport class ReadonlyGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> {\n protected readonly _graph: Graph.Graph<Node, Edge>;\n /**\n * Optional function to wrap mutations.\n * When set, all graph mutations are wrapped in this function.\n */\n protected readonly _change?: GraphChangeFunction;\n\n /**\n * NOTE: Pass in simple Graph or Live.\n * @param graph - The graph data.\n * @param change - Optional function to wrap mutations (e.g., Obj.change for ECHO objects).\n */\n constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction) {\n this._graph = graph ?? {\n nodes: [],\n edges: [],\n };\n this._change = change;\n }\n\n [inspectCustom]() {\n return this.toJSON();\n }\n\n /**\n * Return stable sorted JSON representation of graph.\n */\n toJSON() {\n return {\n nodes: this.nodes.length,\n edges: this.edges.length,\n };\n }\n\n get graph(): Graph.Graph<Node, Edge> {\n return this._graph;\n }\n\n get nodes(): Node[] {\n return this._graph.nodes;\n }\n\n get edges(): Edge[] {\n return this._graph.edges;\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<Graph.Node.Any> = {}): 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<Graph.Edge.Any> = {}): 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(isTruthy);\n\n return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n }\n}\n\n/**\n * Mutable Graph wrapper.\n */\nexport abstract class AbstractGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,\n Builder extends AbstractBuilder<Node, Edge, Model> = AbstractBuilder<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.Graph<Node, Edge>>): Model;\n\n /**\n * Execute a mutation on the graph.\n * If a change function is set, wraps the mutation in it.\n */\n protected _mutate(fn: (graph: Graph.Graph<Node, Edge>) => void): void {\n if (this._change != null) {\n this._change(() => fn(this._graph));\n } else {\n fn(this._graph);\n }\n }\n\n clear(): this {\n this._mutate((graph) => {\n graph.nodes.length = 0;\n graph.edges.length = 0;\n });\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._mutate((graph) => {\n graph.nodes.push(node);\n });\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: Graph.createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n this._mutate((graph) => {\n graph.edges.push(edge as Edge);\n });\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 let removedEdges: Edge[] = [];\n let removedNodes: Node[] = [];\n this._mutate((graph) => {\n removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n removedNodes = removeBy<Node>(graph.nodes as Node[], (node) => node.id === id);\n });\n return this.copy({ nodes: removedNodes, edges: removedEdges });\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 let removedEdges: Edge[] = [];\n this._mutate((graph) => {\n removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.id === id);\n });\n return this.copy({ nodes: [], edges: removedEdges });\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 builder wrapper\n */\nexport abstract class AbstractBuilder<\n Node extends Graph.Node.Any,\n Edge extends Graph.Edge.Any,\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\n/**\n * Basic model.\n */\nexport class GraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, Builder<Node, Edge>> {\n override get builder() {\n return new Builder<Node, Edge>(this);\n }\n\n override copy(graph?: Partial<Graph.Graph<Node, Edge>>): GraphModel<Node, Edge> {\n return new GraphModel<Node, Edge>(graph as Graph.Graph<Node, Edge>);\n }\n}\n\nexport type Subscription = <Node extends Graph.Node.Any = Graph.Node.Any, Edge extends Graph.Edge.Any = Graph.Edge.Any>(\n model: ReactiveGraphModel<Node, Edge>,\n graph: Graph.Graph<Node, Edge>,\n) => void;\n\n/**\n * Basic reactive model using Effect Atoms.\n */\n// NOTE: Unlike Preact Signals' `live()` which uses proxies for transparent reactivity,\n// Effect Atom requires explicit `registry.set()` calls. All mutation methods must be\n// overridden to update the atom immutably rather than mutating `_graph` directly.\nexport class ReactiveGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends GraphModel<Node, Edge> {\n private readonly _graphAtom: Atom.Writable<Graph.Graph<Node, Edge>>;\n\n constructor(\n private readonly _registry: Registry.Registry,\n graph?: Partial<Graph.Graph<Node, Edge>>,\n ) {\n const initialGraph: Graph.Graph<Node, Edge> = {\n nodes: (graph?.nodes ?? []) as Node[],\n edges: (graph?.edges ?? []) as Edge[],\n };\n super(initialGraph);\n this._graphAtom = Atom.make<Graph.Graph<Node, Edge>>(initialGraph);\n }\n\n get registry(): Registry.Registry {\n return this._registry;\n }\n\n /**\n * Get the graph atom for reactive subscriptions.\n */\n get graphAtom(): Atom.Writable<Graph.Graph<Node, Edge>> {\n return this._graphAtom;\n }\n\n override get graph(): Graph.Graph<Node, Edge> {\n return this._registry.get(this._graphAtom);\n }\n\n override get nodes(): Node[] {\n return this.graph.nodes;\n }\n\n override get edges(): Edge[] {\n return this.graph.edges;\n }\n\n override copy(graph?: Partial<Graph.Graph<Node, Edge>>): ReactiveGraphModel<Node, Edge> {\n return new ReactiveGraphModel<Node, Edge>(this._registry, graph);\n }\n\n override clear(): this {\n this._registry.set(this._graphAtom, {\n nodes: [],\n edges: [],\n });\n return this;\n }\n\n /**\n * Set the entire graph at once, triggering a single notification.\n */\n setGraph(graph: Graph.Graph<Node, Edge>): this {\n this._registry.set(this._graphAtom, graph);\n return this;\n }\n\n override addNode(node: Node): Node {\n invariant(node.id, 'ID is required');\n invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n const current = this._registry.get(this._graphAtom);\n this._registry.set(this._graphAtom, {\n ...current,\n nodes: [...current.nodes, node],\n });\n return node;\n }\n\n override addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n invariant(edge.source);\n invariant(edge.target);\n if (!edge.id) {\n edge = { id: Graph.createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n const current = this._registry.get(this._graphAtom);\n this._registry.set(this._graphAtom, {\n ...current,\n edges: [...current.edges, edge as Edge],\n });\n return edge as Edge;\n }\n\n override removeNode(id: string): ReactiveGraphModel<Node, Edge> {\n const current = this._registry.get(this._graphAtom);\n const removedEdges = current.edges.filter((edge) => edge.source === id || edge.target === id);\n const removedNodes = current.nodes.filter((node) => node.id === id);\n\n this._registry.set(this._graphAtom, {\n nodes: current.nodes.filter((node) => node.id !== id),\n edges: current.edges.filter((edge) => edge.source !== id && edge.target !== id),\n });\n\n return this.copy({ nodes: removedNodes, edges: removedEdges });\n }\n\n override removeEdge(id: string): ReactiveGraphModel<Node, Edge> {\n const current = this._registry.get(this._graphAtom);\n const removedEdges = current.edges.filter((edge) => edge.id === id);\n\n this._registry.set(this._graphAtom, {\n ...current,\n edges: current.edges.filter((edge) => edge.id !== id),\n });\n\n return this.copy({ nodes: [], edges: removedEdges });\n }\n\n /**\n * Subscribe to graph changes.\n */\n subscribe(cb: Subscription, fire = false): () => void {\n if (fire) {\n cb(this, this.graph);\n }\n\n // Prime the atom by reading before subscribing to avoid double-fire on first mutation.\n this._registry.get(this._graphAtom);\n\n return this._registry.subscribe(this._graphAtom, () => {\n cb(this, this.graph);\n });\n }\n}\n\n/**\n * Basic builder.\n */\nexport class Builder<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractBuilder<Node, Edge, GraphModel<Node, Edge>> {\n override call(cb: (builder: this) => void): this {\n cb(this);\n return this;\n }\n}\n"],
|
|
5
|
-
"mappings": ";;;;;;;;AAIA,SAASA,MAAMC,gBAAgB;AAE/B,SAASC,iBAAiB
|
|
6
|
-
"names": ["Atom", "Registry", "invariant", "
|
|
4
|
+
"sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Atom, Registry } from '@effect-atom/atom-react';\n\nimport { invariant } from '@dxos/invariant';\n\n/**\n * Reactive selection model.\n */\nexport class SelectionModel {\n private readonly _registry: Registry.Registry;\n private readonly _selected: Atom.Writable<Set<string>>;\n\n constructor(private readonly _singleSelect: boolean = false) {\n this._registry = Registry.make();\n this._selected = Atom.make<Set<string>>(new Set<string>());\n }\n\n /**\n * Returns the selected IDs atom for subscription.\n */\n get selected(): Atom.Atom<Set<string>> {\n return this._selected;\n }\n\n /**\n * Gets the current selected IDs as a Set.\n */\n getSelected(): Set<string> {\n return this._registry.get(this._selected);\n }\n\n /**\n * Gets the current selected IDs as an array.\n */\n getSelectedIds(): string[] {\n return Array.from(this._registry.get(this._selected).values());\n }\n\n /**\n * Subscribe to selection changes.\n */\n subscribe(cb: (selected: Set<string>) => void): () => void {\n // Prime the atom by reading before subscribing.\n this._registry.get(this._selected);\n\n return this._registry.subscribe(this._selected, () => {\n cb(this._registry.get(this._selected));\n });\n }\n\n toJSON(): { selected: string[] } {\n return {\n selected: this.getSelectedIds(),\n };\n }\n\n /**\n * Gets the current selection size.\n */\n getSize(): number {\n return this._registry.get(this._selected).size;\n }\n\n contains(id: string): boolean {\n return this._registry.get(this._selected).has(id);\n }\n\n clear(): void {\n this._registry.set(this._selected, new Set());\n }\n\n add(id: string): void {\n invariant(id);\n const current = this._registry.get(this._selected);\n this._registry.set(\n this._selected,\n new Set<string>(this._singleSelect ? [id] : [...Array.from(current.values()), id]),\n );\n }\n\n remove(id: string): void {\n invariant(id);\n const current = this._registry.get(this._selected);\n this._registry.set(this._selected, new Set<string>(Array.from(current.values()).filter((_id) => _id !== id)));\n }\n\n // TODO(burdon): Handle single select.\n\n setSelected(ids: string[], subtract = false): void {\n const current = this._registry.get(this._selected);\n this._registry.set(this._selected, new Set([...(subtract ? Array.from(current.values()) : []), ...ids]));\n }\n\n toggleSelected(ids: string[], subtract = false): void {\n const current = this._registry.get(this._selected);\n const set = new Set<string>(subtract ? Array.from(current.values()) : undefined);\n ids.forEach((id) => {\n if (current.has(id)) {\n set.delete(id);\n } else {\n set.add(id);\n }\n });\n\n this._registry.set(this._selected, set);\n }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\n// @import-as-namespace\n\nimport * as Schema from 'effect/Schema';\n\nimport { invariant } from '@dxos/invariant';\nimport { type Specialize } from '@dxos/util';\n\n//\n// Node\n//\n\nexport const Node = Schema.Struct({\n id: Schema.String,\n type: Schema.optional(Schema.String),\n data: Schema.optional(Schema.Any),\n});\n\ninterface BaseNode extends Schema.Schema.Type<typeof Node> {}\n\nexport declare namespace Node {\n export type Any = Specialize<BaseNode, { data?: any }>;\n export type Node<Data = any> = Specialize<BaseNode, { data: Data }>;\n}\n\n//\n// Edge\n//\n\nexport const Edge = Schema.Struct({\n id: Schema.String,\n type: Schema.optional(Schema.String),\n source: Schema.String,\n target: Schema.String,\n data: Schema.optional(Schema.Any),\n});\n\ninterface BaseEdge extends Schema.Schema.Type<typeof Edge> {}\n\nexport declare namespace Edge {\n export type Any = Specialize<BaseEdge, { data?: any }>;\n export type Edge<Data = any> = Specialize<BaseEdge, { data: Data }>;\n}\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// Graph\n//\n\nexport const Graph = Schema.Struct({\n id: Schema.optional(Schema.String),\n nodes: Schema.mutable(Schema.Array(Node)),\n edges: Schema.mutable(Schema.Array(Edge)),\n});\n\nexport interface Any extends Schema.Schema.Type<typeof Graph> {}\n\nexport type Graph<Node extends Node.Any, Edge extends Edge.Any> = Specialize<\n Any,\n {\n nodes: Node[];\n edges: Edge[];\n }\n>;\n", "//\n// Copyright 2024 DXOS.org\n//\n\n// @import-as-namespace\n\nimport { Atom, type Registry } from '@effect-atom/atom-react';\n\nimport { inspectCustom } from '@dxos/debug';\nimport { failedInvariant, invariant } from '@dxos/invariant';\nimport { type MakeOptional, isTruthy, removeBy } from '@dxos/util';\n\nimport * as Graph from './Graph';\n\n/**\n * Optional function to wrap mutations (e.g., for ECHO objects that require Obj.update).\n */\nexport type GraphChangeFunction = (fn: () => void) => void;\n\n/**\n * Readonly Graph wrapper.\n */\nexport class ReadonlyGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> {\n protected readonly _graph: Graph.Graph<Node, Edge>;\n /**\n * Optional function to wrap mutations.\n * When set, all graph mutations are wrapped in this function.\n */\n protected readonly _change?: GraphChangeFunction;\n\n /**\n * NOTE: Pass in simple Graph or Live.\n * @param graph - The graph data.\n * @param change - Optional function to wrap mutations (e.g., Obj.update for ECHO objects).\n */\n constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction) {\n this._graph = graph ?? {\n nodes: [],\n edges: [],\n };\n this._change = change;\n }\n\n [inspectCustom]() {\n return this.toJSON();\n }\n\n /**\n * Return stable sorted JSON representation of graph.\n */\n toJSON() {\n return {\n nodes: this.nodes.length,\n edges: this.edges.length,\n };\n }\n\n get graph(): Graph.Graph<Node, Edge> {\n return this._graph;\n }\n\n get nodes(): Node[] {\n return this._graph.nodes;\n }\n\n get edges(): Edge[] {\n return this._graph.edges;\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<Graph.Node.Any> = {}): 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<Graph.Edge.Any> = {}): 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(isTruthy);\n\n return [root, ...targets.flatMap((target) => this._traverse(target, visited))];\n }\n}\n\n/**\n * Mutable Graph wrapper.\n */\nexport abstract class AbstractGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n Model extends AbstractGraphModel<Node, Edge, Model, Builder> = any,\n Builder extends AbstractBuilder<Node, Edge, Model> = AbstractBuilder<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.Graph<Node, Edge>>): Model;\n\n /**\n * Execute a mutation on the graph.\n * If a change function is set, wraps the mutation in it.\n */\n protected _mutate(fn: (graph: Graph.Graph<Node, Edge>) => void): void {\n if (this._change != null) {\n this._change(() => fn(this._graph));\n } else {\n fn(this._graph);\n }\n }\n\n clear(): this {\n this._mutate((graph) => {\n graph.nodes.length = 0;\n graph.edges.length = 0;\n });\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._mutate((graph) => {\n graph.nodes.push(node);\n });\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: Graph.createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n this._mutate((graph) => {\n graph.edges.push(edge as Edge);\n });\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 let removedEdges: Edge[] = [];\n let removedNodes: Node[] = [];\n this._mutate((graph) => {\n removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.source === id || edge.target === id);\n removedNodes = removeBy<Node>(graph.nodes as Node[], (node) => node.id === id);\n });\n return this.copy({ nodes: removedNodes, edges: removedEdges });\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 let removedEdges: Edge[] = [];\n this._mutate((graph) => {\n removedEdges = removeBy<Edge>(graph.edges as Edge[], (edge) => edge.id === id);\n });\n return this.copy({ nodes: [], edges: removedEdges });\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 builder wrapper\n */\nexport abstract class AbstractBuilder<\n Node extends Graph.Node.Any,\n Edge extends Graph.Edge.Any,\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\n/**\n * Basic model.\n */\nexport class GraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractGraphModel<Node, Edge, GraphModel<Node, Edge>, Builder<Node, Edge>> {\n override get builder() {\n return new Builder<Node, Edge>(this);\n }\n\n override copy(graph?: Partial<Graph.Graph<Node, Edge>>): GraphModel<Node, Edge> {\n return new GraphModel<Node, Edge>(graph as Graph.Graph<Node, Edge>);\n }\n}\n\nexport type Subscription = <Node extends Graph.Node.Any = Graph.Node.Any, Edge extends Graph.Edge.Any = Graph.Edge.Any>(\n model: ReactiveGraphModel<Node, Edge>,\n graph: Graph.Graph<Node, Edge>,\n) => void;\n\n/**\n * Basic reactive model using Effect Atoms.\n */\n// NOTE: Unlike Preact Signals' `live()` which uses proxies for transparent reactivity,\n// Effect Atom requires explicit `registry.set()` calls. All mutation methods must be\n// overridden to update the atom immutably rather than mutating `_graph` directly.\nexport class ReactiveGraphModel<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends GraphModel<Node, Edge> {\n private readonly _graphAtom: Atom.Writable<Graph.Graph<Node, Edge>>;\n\n constructor(\n private readonly _registry: Registry.Registry,\n graph?: Partial<Graph.Graph<Node, Edge>>,\n ) {\n const initialGraph: Graph.Graph<Node, Edge> = {\n nodes: (graph?.nodes ?? []) as Node[],\n edges: (graph?.edges ?? []) as Edge[],\n };\n super(initialGraph);\n this._graphAtom = Atom.make<Graph.Graph<Node, Edge>>(initialGraph);\n }\n\n get registry(): Registry.Registry {\n return this._registry;\n }\n\n /**\n * Get the graph atom for reactive subscriptions.\n */\n get graphAtom(): Atom.Writable<Graph.Graph<Node, Edge>> {\n return this._graphAtom;\n }\n\n override get graph(): Graph.Graph<Node, Edge> {\n return this._registry.get(this._graphAtom);\n }\n\n override get nodes(): Node[] {\n return this.graph.nodes;\n }\n\n override get edges(): Edge[] {\n return this.graph.edges;\n }\n\n override copy(graph?: Partial<Graph.Graph<Node, Edge>>): ReactiveGraphModel<Node, Edge> {\n return new ReactiveGraphModel<Node, Edge>(this._registry, graph);\n }\n\n override clear(): this {\n this._registry.set(this._graphAtom, {\n nodes: [],\n edges: [],\n });\n return this;\n }\n\n /**\n * Set the entire graph at once, triggering a single notification.\n */\n setGraph(graph: Graph.Graph<Node, Edge>): this {\n this._registry.set(this._graphAtom, graph);\n return this;\n }\n\n override addNode(node: Node): Node {\n invariant(node.id, 'ID is required');\n invariant(!this.findNode(node.id), `node already exists: ${node.id}`);\n const current = this._registry.get(this._graphAtom);\n this._registry.set(this._graphAtom, {\n ...current,\n nodes: [...current.nodes, node],\n });\n return node;\n }\n\n override addEdge(edge: MakeOptional<Edge, 'id'>): Edge {\n invariant(edge.source);\n invariant(edge.target);\n if (!edge.id) {\n edge = { id: Graph.createEdgeId(edge), ...edge };\n }\n invariant(!this.findNode(edge.id!));\n const current = this._registry.get(this._graphAtom);\n this._registry.set(this._graphAtom, {\n ...current,\n edges: [...current.edges, edge as Edge],\n });\n return edge as Edge;\n }\n\n override removeNode(id: string): ReactiveGraphModel<Node, Edge> {\n const current = this._registry.get(this._graphAtom);\n const removedEdges = current.edges.filter((edge) => edge.source === id || edge.target === id);\n const removedNodes = current.nodes.filter((node) => node.id === id);\n\n this._registry.set(this._graphAtom, {\n nodes: current.nodes.filter((node) => node.id !== id),\n edges: current.edges.filter((edge) => edge.source !== id && edge.target !== id),\n });\n\n return this.copy({ nodes: removedNodes, edges: removedEdges });\n }\n\n override removeEdge(id: string): ReactiveGraphModel<Node, Edge> {\n const current = this._registry.get(this._graphAtom);\n const removedEdges = current.edges.filter((edge) => edge.id === id);\n\n this._registry.set(this._graphAtom, {\n ...current,\n edges: current.edges.filter((edge) => edge.id !== id),\n });\n\n return this.copy({ nodes: [], edges: removedEdges });\n }\n\n /**\n * Subscribe to graph changes.\n */\n subscribe(cb: Subscription, fire = false): () => void {\n if (fire) {\n cb(this, this.graph);\n }\n\n // Prime the atom by reading before subscribing to avoid double-fire on first mutation.\n this._registry.get(this._graphAtom);\n\n return this._registry.subscribe(this._graphAtom, () => {\n cb(this, this.graph);\n });\n }\n}\n\n/**\n * Basic builder.\n */\nexport class Builder<\n Node extends Graph.Node.Any = Graph.Node.Any,\n Edge extends Graph.Edge.Any = Graph.Edge.Any,\n> extends AbstractBuilder<Node, Edge, GraphModel<Node, Edge>> {\n override call(cb: (builder: this) => void): this {\n cb(this);\n return this;\n }\n}\n"],
|
|
5
|
+
"mappings": ";;;;;;;;AAIA,SAASA,MAAMC,gBAAgB;AAE/B,SAASC,iBAAiB;AAE1B,IAAA,eAAA;AAImBC,IAA6B,iBAA7BA,MAA6B;EAC7BC;EAEjB;;cACOD,gBAAYF,OAAa;AAC9B,SAAKG,gBAAYJ;AACnB,SAAA,YAAA,SAAA,KAAA;AAEA,SAAA,YAAA,KAAA,KAAA,oBAAA,IAAA,CAAA;;;;;EAKA,IAAA,WAAA;AAEA,WAAA,KAAA;;;;;EAKA,cAAA;AAEA,WAAA,KAAA,UAAA,IAAA,KAAA,SAAA;;;;;EAKA,iBAAA;AAEA,WAAA,MAAA,KAAA,KAAA,UAAA,IAAA,KAAA,SAAA,EAAA,OAAA,CAAA;;;;;YAKOG,IAAAA;SAGHE,UAAQF,IAAAA,KAAUG,SAASF;AAC7B,WAAA,KAAA,UAAA,UAAA,KAAA,WAAA,MAAA;AACF,SAAA,KAAA,UAAA,IAAA,KAAA,SAAA,CAAA;IAEAG,CAAAA;;WAEIC;AACF,WAAA;MACF,UAAA,KAAA,eAAA;IAEA;;;;;EAKA,UAAA;AAEAC,WAAmB,KAAW,UAAA,IAAA,KAAA,SAAA,EAAA;;EAE9B,SAAA,IAAA;AAEAC,WAAc,KAAA,UAAA,IAAA,KAAA,SAAA,EAAA,IAAA,EAAA;;EAEd,QAAA;AAEIC,SAAkB,UAAA,IAAA,KAAA,WAAA,oBAAA,IAAA,CAAA;;MAEpB,IAAA;AACA,cAAKR,IAAAA,QACH,EAAA,YAAKC,YACW,GAAA,cAAKQ,GAAAA,IAAa,GAAG,MAAA,GAAA,CAAA,MAAA,EAAA,EAAA,CAAA;UAACD,UAAAA,KAAAA,UAAAA,IAAAA,KAAAA,SAAAA;SAAM,UAAA,IAAA,KAAA,WAAA,IAAA,IAAA,KAAA,gBAAA;;QAAkCA;MAAG,GAAA,MAAA,KAAA,QAAA,OAAA,CAAA;MAErF;IAEAE,CAAAA,CAAAA;;SAEE,IAAMC;AACN,cAAKX,IAAAA,QAAc,EAAA,YAAKC,YAA2BW,GAAAA,cAAWD,GAAAA,IAAQE,GAAAA,MAAM,GAAIC,CAAAA,MAAM,EAAEC,EAAAA,CAAAA;AAC1F,UAAA,UAAA,KAAA,UAAA,IAAA,KAAA,SAAA;AAEA,SAAA,UAAA,IAAA,KAAA,WAAsC,IAAA,IAAA,MAAA,KAAA,QAAA,OAAA,CAAA,EAAA,OAAA,CAAA,QAAA,QAAA,EAAA,CAAA,CAAA;EAEtCC;;cAEOhB,KAAAA,WAAmBC,OAAAA;oBAAwBgB,KAAWL,UAAWD,IAAAA,KAAQE,SAAY;mBAAQK,IAAAA,KAAAA,WAAAA,oBAAAA,IAAAA;MAAI,GAAA,WAAA,MAAA,KAAA,QAAA,OAAA,CAAA,IAAA,CAAA;MACxG,GAAA;IAEAC,CAAAA,CAAAA;;iBAEQC,KAAUC,WAAYJ,OAAWL;AACvCM,UAAII,UAASd,KAAAA,UAAAA,IAAAA,KAAAA,SAAAA;UACX,MAAIG,IAAQY,IAAIf,WAAK,MAAA,KAAA,QAAA,OAAA,CAAA,IAAA,MAAA;gBACfgB,CAAAA,OAAM;AACZ,UAAA,QAAO,IAAA,EAAA,GAAA;AACLJ,YAAIK,OAAIjB,EAAAA;MACV,OAAA;AACF,YAAA,IAAA,EAAA;MAEI;IACN,CAAA;AACF,SAAA,UAAA,IAAA,KAAA,WAAA,GAAA;;;;;AC7GA;;;;;;;;AAMA,YAAYkB,YAAY;AAExB,SAASC,aAAAA,kBAAiB;AAG1B,IAAEC,gBAAA;AAMAC,IAAMH,OAAgBA,cAAOI;EAC7BC,IAAML;EACL,MAAA,gBAAA,aAAA;EASD,MAAA,gBAAA,UAAA;AACF,CAAA;AAKEG,IAAMH,OAAgBA,cAAOI;EAC7BE,IAAQN;EACRO,MAAQP,gBAAa,aAAA;EACrBK,QAAaG;EACZ,QAAA;EASH,MAAMC,gBAAY,UAAA;AAKlB,CAAA;IACER,YAAUK;AACVL,IAAAA,eAAuBQ,CAAAA,EAAAA,QAAY,QAAC,SAAgB,MAAEF;AACtD,EAAAN,WAAO,OAAA,MAAA,SAAA,GAAA,mBAAA,MAAA,IAAA,EAAA,YAAA,YAAA,GAAAC,eAAA,GAAA,IAAA,GAAA,QAAA,GAAA,CAAA,2BAAA,6BAAA,EAAA,CAAA;aAACI,OAAAA,MAAAA,SAAAA,GAAAA,mBAAAA,MAAAA,IAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,QAAAA,GAAAA,CAAAA,2BAAAA,6BAAAA,EAAAA,CAAAA;SAAQI;IAAUH;IAAQI;IAClC;EAEF,EAAA,KAAO,GAAMC;;AAEXX,IAAAA,cAAuB,CAAA,OAAIM;AAC3B,QAAA,CAAO,QAAA,UAAA,MAAA,IAAA,GAAA,MAAA,GAAA;aAAED,OAAAA,UAAAA,OAAAA,QAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,QAAAA,GAAAA,CAAAA,kCAAAA,EAAAA,EAAAA,CAAAA;SAAQI;IAAkDH;IAAO,UAAA,SAAA,SAAA,WAAA;IAC1E;EAEA;AACF;AAKEM,IAAOb,QAAeA,cAAOc;EAC7BC,IAAOf,gBAAeA,aAAOc;EAC5B,OAAA,eAAA,aAAA,IAAA,CAAA;;;;;ACxEH;;;;;;;;;AAMA,SAASE,QAAAA,aAA2B;AAEpC,SAASC,qBAAqB;AAC9B,SAASC,iBAAiBC,aAAAA,kBAAiB;AAC3C,SAA4BC,UAAUC,gBAAgB;AAStD,IAAAC,gBAAA;AAQE,IAAA,qBAAA,MAAA;;;;;;;;;;;;cAaIC,OAAS,QAAA;SACTC,SAAS,SAAA;MACX,OAAA,CAAA;MACI,OAACC,CAAO;IACd;AAECC,SAAAA,UAAiB;;EAElB,CAAA,aAAA,IAAA;AAEA,WAAA,KAAA,OAAA;;;;;WAKIH;WACAC;MACF,OAAA,KAAA,MAAA;MACF,OAAA,KAAA,MAAA;IAEIG;;EAEJ,IAAA,QAAA;AAEIJ,WAAAA,KAAgB;;EAEpB,IAAA,QAAA;AAEIC,WAAAA,KAAgB,OAAA;;EAEpB,IAAA,QAAA;AAEE,WAAA,KAAA,OAAA;EACF;;;;EAKA,SAAA,IAAA;AAEAI,WAAkB,KAAQ,MAAA,KAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;EAE1B,QAAA,IAAA;AAEAC,WAAAA,KAAcC,SAAoC,EAAU,KAAA,gBAAA;;EAE5D,YAAA,EAAA,KAAA,IAAA,CAAA,GAAA;AAEE,WAAA,KAAA,MAAA,OAAA,CAAA,SAAA,CAAA,QAAA,SAAA,KAAA,IAAA;EACF;;;;EAKA,SAAA,IAAA;AAEAC,WAAkB,KAAQ,MAAA,KAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;EAE1B,QAAA,IAAA;AAEAC,WAAAA,KAAcF,SAAMG,EAAM,KAAEC,gBAAgD;;EAK5E,YAAA,EAAA,MAAA,QAAA,OAAA,IAAA,CAAA,GAAA;AAEE,WAAA,KAAA,MAAA,OAAA,CAAA,UAAA,CAAA,QAAA,SAAA,KAAA,UAAA,CAAA,UAAA,WAAA,KAAA,YAAA,CAAA,UAAA,WAAA,KAAA,OAAA;EACF;;;;EAKA,SAAA,MAAA;AAEQC,WAAUC,KAAYC,UAAuB,IAAIC;;YAErD,MAAO,UAAE,oBAAA,IAAA,GAAA;AACX,QAAA,QAAA,IAAA,KAAA,EAAA,GAAA;AAEAD,aAAW,CAACD;IACZ;YAAmCH,IAAQG,KAAKG,EAAE;AAAC,UAC7C,UAAW,KAAKX,YAAaM;MAGnC,QAAO,KAAA;WAACE,CAAAA,SAAAA,KAAAA,QAAAA,KAAAA,MAAAA,CAAAA,EAAAA,OAAAA,QAAAA;WAASI;MAA6D;MAChF,GAAA,QAAA,QAAA,CAAA,WAAA,KAAA,UAAA,QAAA,OAAA,CAAA;IACF;EAEA;;;;;;;UAyBM,IAAKf;AACP,QAAA,KAAO,WAAA,MAAA;AACLgB,WAAG,QAAKC,MAAM,GAAA,KAAA,MAAA,CAAA;IAChB,OAAA;AACF,SAAA,KAAA,MAAA;IAEAC;;UAEIhB;SACAA,QAAMH,CAAAA,UAAY;AACpB,YAAA,MAAA,SAAA;AACA,YAAO,MAAI,SAAA;IACb,CAAA;AAEAoB,WAASjB;;WAEFkB,OAAAA;AACL,SAAA,SAAW,MAAA,KAAA;AACb,SAAA,SAAA,MAAA,KAAA;AAEAC,WAAUC;;YAEN,QAAKC;WACL,QAAKH,CAAAA,UAAerB;AACtB,WAAA,SAAA,MAAA,KAAA;AACA,WAAO,SAAI,MAAA,KAAA;IACb,CAAA;AAEAyB,WAAQC;;UAENC,MAAU;AACV,IAAAA,WAAKC,KAASzB,IAAAA,kBAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,WAAAA,kBAAAA,EAAAA,CAAAA;eACNJ,CAAAA,KAAM8B,SAAKH,KAAAA,EAAAA,GAAAA,wBAAAA,KAAAA,EAAAA,IAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,2BAAAA,mCAAAA,EAAAA,CAAAA;AACnB,SAAA,QAAA,CAAA,UAAA;AACA,YAAOA,MAAAA,KAAAA,IAAAA;IACT,CAAA;AAEAF,WAASzB;;EAET,SAAA,OAAA;AAEA+B,WAAQC,MAAsC,IAAA,CAAA,SAAA,KAAA,QAAA,IAAA,CAAA;;UAE5CJ,MAAUI;AACV,IAAAJ,WAAUZ,KAAI,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;eACZ,KAAA,QAAA,QAAA,EAAA,YAAoC,YAAA,GAAAA,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;QACpCiC,CAAAA,KAAAA,IAAO;aAAmCA;QAAK,IAAA,aAAA,IAAA;QACjD,GAAA;MACAJ;IACA;eACQ3B,CAAAA,KAAM6B,SAAKE,KAAAA,EAAAA,GAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,2BAAAA,EAAAA,EAAAA,CAAAA;AACnB,SAAA,QAAA,CAAA,UAAA;AACA,YAAOA,MAAAA,KAAAA,IAAAA;IACT,CAAA;AAEAV,WAASrB;;EAET,SAAA,OAAA;AAEAgC,WAAWjB,MAAmB,IAAA,CAAA,SAAA,KAAA,QAAA,IAAA,CAAA;;aAExBkB,IAAAA;AACJ,QAAI,eAAU9B,CAAAA;QACZ+B,eAAeC,CAAAA;SACfF,QAAAA,CAAAA,UAAeE;AACjB,qBAAA,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;AACA,qBAAiB,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAuBnC,KAAOkC,KAAAA;MAAa,OAAA;MAC9D,OAAA;IAEAE,CAAAA;;cAES,KAAKC;AACd,UAAA,SAAA,IAAA,IAAA,CAAA,OAAA,KAAA,WAAA,EAAA,CAAA;AAEAC,WAAWvB,KAAmB,KAAA,EAAA,UAAA,MAAA;;aAEvBa,IAAAA;QACHM,eAAeC,CAAAA;AACjB,SAAA,QAAA,CAAA,UAAA;AACA,qBAAiB,SAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAanC,KAAOkC,KAAAA;MAAa,OAAA,CAAA;MACpD,OAAA;IAEAK,CAAAA;;cAES,KAAKF;AACd,UAAA,SAAA,IAAA,IAAA,CAAA,OAAA,KAAA,WAAA,EAAA,CAAA;AACF,WAAA,KAAA,KAAA,EAAA,UAAA,MAAA;EAEA;;AAQE,IAA+BG,kBAA/B,MAA8C;;EAAC,YAAA,QAAA;AAE3CC,SAAAA,SAAe;;EAEnB,IAAA,QAAA;AAEAC,WAAwC,KAAA;;OAEtC,IAAA;AACF,OAAA,IAAA;AAEAtC,WAAkB;;EAElB,QAAA,IAAA;AAEAqB,WAAQC,KAAkB,MAAA,QAAA,EAAA;;UAExB,MAAO;AACT,SAAA,OAAA,QAAA,IAAA;AAEAI,WAAQC;;UAEN,MAAO;AACT,SAAA,OAAA,QAAA,IAAA;AAEAP,WAASzB;;WAEP,OAAW;AACb,SAAA,OAAA,SAAA,KAAA;AAEAsB,WAASrB;;WAEP,OAAW;AACb,SAAA,OAAA,SAAA,KAAA;AACF,WAAA;EAEA;;AAQI,IAAO,aAAP,MAAO,oBAA4B,mBAAA;EACrC,IAAA,UAAA;AAESqC,WAA6C,IAA0B,QAAA,IAAA;;EAEhF,KAAA,OAAA;AACF,WAAA,IAAA,YAAA,KAAA;EAOA;;AAUmBM,IAAAA,qBAAAA,MAAAA,4BAAmD,WAAA;EAEpE;;cAKI5C,WAAeA,OAAAA;UACfC,eAAeA;MACjB,OAAA,OAAA,SAAA,CAAA;MACA,OAAM4C,OAAAA,SAPWC,CAAAA;IAQjB;AACF,UAAA,YAAA,GAAA,KAAA,YAAA;AAEIC,SAAAA,aAA8BC,MAAA,KAAA,YAAA;;EAElC,IAAA,WAAA;AAEA,WAAA,KAAA;;;;;EAKA,IAAA,YAAA;AAEa5C,WAAAA,KAAiC;;EAE9C,IAAA,QAAA;AAEaJ,WAAAA,KAAgB,UAAA,IAAA,KAAA,UAAA;;EAE7B,IAAA,QAAA;AAEaC,WAAAA,KAAgB,MAAA;;EAE7B,IAAA,QAAA;AAESqC,WAA6C,KAAkC,MAAA;;EAExF,KAAA,OAAA;AAESlB,WAAc,IAAA,oBAAA,KAAA,WAAA,KAAA;;UAEnBpB;SACAC,UAAS,IAAA,KAAA,YAAA;MACX,OAAA,CAAA;MACA,OAAW,CAAA;IACb,CAAA;AAEA,WAAA;;;;;WAKS,OAAI;AACb,SAAA,UAAA,IAAA,KAAA,YAAA,KAAA;AAESyB,WAAQC;;UAEfC,MAAU;AACV,IAAAA,WAAMqB,KAAAA,IAAU,kBAAmB,EAAA,YAAKL,YAAU,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,WAAA,kBAAA,EAAA,CAAA;AAClD,IAAA6B,WAAKkB,CAAAA,KAAUI,SAASN,KAAAA,EAAAA,GAAU,wBAAE,KAAA,EAAA,IAAA,EAAA,YAAA,YAAA,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,2BAAA,mCAAA,EAAA,CAAA;UAClC,UAAU,KAAA,UAAA,IAAA,KAAA,UAAA;SACVC,UAAO,IAAA,KAAA,YAAA;;aAAmB2B;QAAK,GAAA,QAAA;QACjC;MACA;IACF,CAAA;AAESI,WAAQC;;UAEfJ,MAAUI;AACV,IAAAJ,WAAUZ,KAAI,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;eACZiC,KAAO,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAjC,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,EAAA,EAAA,CAAA;cAAEiB,IAAImC;aAA6BnB;QAAK,IAAA,aAAA,IAAA;QACjD,GAAA;MACAJ;IACA;AACA,IAAAA,WAAKkB,CAAAA,KAAUI,SAASN,KAAAA,EAAAA,GAAU,QAAE,EAAA,YAAA,YAAA,GAAA7C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,2BAAA,EAAA,EAAA,CAAA;UAClC,UAAU,KAAA,UAAA,IAAA,KAAA,UAAA;SACVE,UAAO,IAAA,KAAA,YAAA;;aAAmB+B;QAAa,GAAA,QAAA;QACzC;MACA;IACF,CAAA;AAESC,WAAWjB;;aAEZmB,IAAAA;AACN,UAAMD,UAAAA,KAAee,UAAQjD,IAAMoD,KAAAA,UAAiBzB;AAEpD,UAAKmB,eAAc,QAAKF,MAAU,OAAE,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;UAClC5C,eAAeA,QAAMoD,MAAQzB,OAASA,CAAAA,SAAO,KAAKX,OAAAA,EAAAA;SAClDf,UAAOgD,IAAQhD,KAAK,YAAS+B;MAC/B,OAAA,QAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;MAEA,OAAW,QAAM,MAAA,OAAA,CAAA,SAAA,KAAA,WAAA,MAAA,KAAA,WAAA,EAAA;;WAAuB/B,KAAOkC,KAAAA;MAAa,OAAA;MAC9D,OAAA;IAESI,CAAAA;;aAEDJ,IAAAA;AAEN,UAAKW,UAAUI,KAAI,UAAKN,IAAU,KAAE,UAAA;UAClC,eAAU,QAAA,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;SACV3C,UAAOgD,IAAQhD,KAAK,YAAS+B;MAC/B,GAAA;MAEA,OAAW,QAAM,MAAA,OAAA,CAAA,SAAA,KAAA,OAAA,EAAA;;WAAa/B,KAAOkC,KAAAA;MAAa,OAAA,CAAA;MACpD,OAAA;IAEA,CAAA;;;;;YAKO,IAAI,OAAO/B,OAAK;AACrB,QAAA,MAAA;AAEA,SAAA,MAAA,KAAA,KAAA;IACA;SAGEiD,UAAS,IAAKjD,KAAK,UAAA;AACrB,WAAA,KAAA,UAAA,UAAA,KAAA,YAAA,MAAA;AACF,SAAA,MAAA,KAAA,KAAA;IACF,CAAA;EAEA;;AAQO,IAAI,UAAJ,cAAI,gBAAA;OACP,IAAA;AACF,OAAA,IAAA;AACF,WAAA;;;",
|
|
6
|
+
"names": ["Atom", "Registry", "invariant", "_registry", "_selected", "cb", "get", "toJSON", "selected", "contains", "clear", "id", "_singleSelect", "remove", "current", "Array", "values", "filter", "_id", "setSelected", "subtract", "ids", "toggleSelected", "set", "Set", "forEach", "has", "delete", "add", "Schema", "invariant", "__dxlog_file", "type", "String", "data", "source", "target", "optional", "KEY_REGEX", "relation", "join", "parseEdgeId", "nodes", "Array", "edges", "Atom", "inspectCustom", "failedInvariant", "invariant", "isTruthy", "removeBy", "__dxlog_file", "nodes", "edges", "_change", "inspectCustom", "graph", "getNode", "filterNodes", "type", "getEdge", "filterEdges", "source", "target", "_traverse", "root", "visited", "Set", "id", "targets", "fn", "_graph", "clear", "addGraph", "addEdges", "addGraphs", "graphs", "addNodes", "addNode", "node", "invariant", "_mutate", "push", "addEdge", "edge", "removeNode", "removedNodes", "removedEdges", "removeBy", "removeNodes", "copy", "removeEdge", "removeEdges", "_model", "model", "call", "_graphAtom", "initialGraph", "_registry", "registry", "Atom", "current", "set", "Graph", "filter", "cb"]
|
|
7
7
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"inputs":{"src/selection.ts":{"bytes":
|
|
1
|
+
{"inputs":{"src/selection.ts":{"bytes":10515,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/Graph.ts":{"bytes":6561,"imports":[{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true}],"format":"esm"},"src/GraphModel.ts":{"bytes":39344,"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"}],"format":"esm"},"src/index.ts":{"bytes":679,"imports":[{"path":"src/selection.ts","kind":"import-statement","original":"./selection"},{"path":"src/Graph.ts","kind":"import-statement","original":"./Graph"},{"path":"src/GraphModel.ts","kind":"import-statement","original":"./GraphModel"}],"format":"esm"}},"outputs":{"dist/lib/node-esm/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":27744},"dist/lib/node-esm/index.mjs":{"imports":[{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"effect/Schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@effect-atom/atom-react","kind":"import-statement","external":true},{"path":"@dxos/debug","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["Graph","GraphModel","SelectionModel"],"entryPoint":"src/index.ts","inputs":{"src/selection.ts":{"bytesInOutput":2638},"src/index.ts":{"bytesInOutput":0},"src/Graph.ts":{"bytesInOutput":1691},"src/GraphModel.ts":{"bytesInOutput":9582}},"bytes":14356}}}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/Graph.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/Graph.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAGxC,OAAO,EAAE,KAAK,UAAU,EAAE,MAAM,YAAY,CAAC;AAM7C,eAAO,MAAM,IAAI;;;;EAIf,CAAC;AAEH,UAAU,QAAS,SAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC;CAAG;AAE7D,MAAM,CAAC,OAAO,WAAW,IAAI,CAAC,CAAC;IAC7B,KAAY,GAAG,GAAG,UAAU,CAAC,QAAQ,EAAE;QAAE,IAAI,CAAC,EAAE,GAAG,CAAA;KAAE,CAAC,CAAC;IACvD,KAAY,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,UAAU,CAAC,QAAQ,EAAE;QAAE,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;CACrE;AAMD,eAAO,MAAM,IAAI;;;;;;EAMf,CAAC;AAEH,UAAU,QAAS,SAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC;CAAG;AAE7D,MAAM,CAAC,OAAO,WAAW,IAAI,CAAC,CAAC;IAC7B,KAAY,GAAG,GAAG,UAAU,CAAC,QAAQ,EAAE;QAAE,IAAI,CAAC,EAAE,GAAG,CAAA;KAAE,CAAC,CAAC;IACvD,KAAY,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,UAAU,CAAC,QAAQ,EAAE;QAAE,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;CACrE;AAKD,KAAK,QAAQ,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAEtE,eAAO,MAAM,YAAY,iCAAkC,QAAQ,WAIlE,CAAC;AAEF,eAAO,MAAM,WAAW,OAAQ,MAAM,KAAG,QAIxC,CAAC;AAMF,eAAO,MAAM,KAAK;;;;;;;;;;;;;;EAIhB,CAAC;AAEH,MAAM,WAAW,GAAI,SAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC;CAAG;AAEhE,MAAM,MAAM,KAAK,CAAC,IAAI,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,SAAS,IAAI,CAAC,GAAG,IAAI,UAAU,CAC1E,GAAG,EACH;IACE,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,EAAE,IAAI,EAAE,CAAC;CACf,CACF,CAAC"}
|
|
@@ -3,7 +3,7 @@ import { inspectCustom } from '@dxos/debug';
|
|
|
3
3
|
import { type MakeOptional } from '@dxos/util';
|
|
4
4
|
import * as Graph from './Graph';
|
|
5
5
|
/**
|
|
6
|
-
* Optional function to wrap mutations (e.g., for ECHO objects that require Obj.
|
|
6
|
+
* Optional function to wrap mutations (e.g., for ECHO objects that require Obj.update).
|
|
7
7
|
*/
|
|
8
8
|
export type GraphChangeFunction = (fn: () => void) => void;
|
|
9
9
|
/**
|
|
@@ -19,7 +19,7 @@ export declare class ReadonlyGraphModel<Node extends Graph.Node.Any = Graph.Node
|
|
|
19
19
|
/**
|
|
20
20
|
* NOTE: Pass in simple Graph or Live.
|
|
21
21
|
* @param graph - The graph data.
|
|
22
|
-
* @param change - Optional function to wrap mutations (e.g., Obj.
|
|
22
|
+
* @param change - Optional function to wrap mutations (e.g., Obj.update for ECHO objects).
|
|
23
23
|
*/
|
|
24
24
|
constructor(graph?: Graph.Graph<Node, Edge>, change?: GraphChangeFunction);
|
|
25
25
|
[inspectCustom](): {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"GraphModel.d.ts","sourceRoot":"","sources":["../../../src/GraphModel.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"GraphModel.d.ts","sourceRoot":"","sources":["../../../src/GraphModel.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,IAAI,EAAE,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAE9D,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,OAAO,EAAE,KAAK,YAAY,EAAsB,MAAM,YAAY,CAAC;AAEnE,OAAO,KAAK,KAAK,MAAM,SAAS,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,mBAAmB,GAAG,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,IAAI,CAAC;AAE3D;;GAEG;AACH,qBAAa,kBAAkB,CAC7B,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG;IAE5C,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACnD;;;OAGG;IACH,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,mBAAmB,CAAC;IAEjD;;;;OAIG;IACH,YAAY,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,EAAE,mBAAmB,EAMxE;IAED,CAAC,aAAa,CAAC;;;MAEd;IAED;;OAEG;IACH,MAAM;QAEF,KAAK;QACL,KAAK;MAER;IAED,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAEnC;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAMD,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAErC;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAExB;IAED,WAAW,CAAC,EAAE,IAAI,EAAE,GAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAM,GAAG,IAAI,EAAE,CAE1D;IAMD,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAErC;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAExB;IAED,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAM,GAAG,IAAI,EAAE,CAK1E;IAMD,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAE3B;IAED,OAAO,CAAC,SAAS;CAYlB;AAED;;GAEG;AACH,8BAAsB,kBAAkB,CACtC,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,KAAK,SAAS,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,GAAG,EAClE,OAAO,SAAS,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CACvF,SAAQ,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC;IACtC;;OAEG;IACH,QAAQ,KAAK,OAAO,IAAI,OAAO,CAAC;IAEhC;;OAEG;IACH,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;IAE/D;;;OAGG;IACH,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,CAMpE;IAED,KAAK,IAAI,IAAI,CAMZ;IAED,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAI3B;IAED,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAM/B;IAED,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAOxB;IAED,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAE9B;IAED,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAY5C;IAED,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAE9B;IAED,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK,CAQ5B;IAED,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,KAAK,CAGhC;IAED,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,KAAK,CAM5B;IAED,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,KAAK,CAGhC;CACF;AAED;;GAEG;AACH,8BAAsB,eAAe,CACnC,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,EAC3B,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,EAC3B,KAAK,SAAS,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAExB,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK;IAA5C,YAA+B,MAAM,EAAE,KAAK,EAAI;IAEhD,IAAI,KAAK,IAAI,KAAK,CAEjB;IAED,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAGtC;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAExB;IAED,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAGxB;IAED,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAG5C;IAED,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAG5B;IAED,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAG5B;CACF;AAED;;GAEG;AACH,qBAAa,UAAU,CACrB,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAC5C,SAAQ,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACnF,IAAa,OAAO,wBAEnB;IAEQ,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAE9E;CACF;AAED,MAAM,MAAM,YAAY,GAAG,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EACpH,KAAK,EAAE,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,EACrC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,KAC3B,IAAI,CAAC;AAEV;;GAEG;AAIH,qBAAa,kBAAkB,CAC7B,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAC5C,SAAQ,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAI5B,OAAO,CAAC,QAAQ,CAAC,SAAS;IAH5B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAyC;IAEpE,YACmB,SAAS,EAAE,QAAQ,CAAC,QAAQ,EAC7C,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAQzC;IAED,IAAI,QAAQ,IAAI,QAAQ,CAAC,QAAQ,CAEhC;IAED;;OAEG;IACH,IAAI,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAEtD;IAED,IAAa,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAE5C;IAED,IAAa,KAAK,IAAI,IAAI,EAAE,CAE3B;IAED,IAAa,KAAK,IAAI,IAAI,EAAE,CAE3B;IAEQ,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAEtF;IAEQ,KAAK,IAAI,IAAI,CAMrB;IAED;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAG7C;IAEQ,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CASjC;IAEQ,OAAO,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAarD;IAEQ,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAW9D;IAEQ,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,CAU9D;IAED;;OAEG;IACH,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,IAAI,UAAQ,GAAG,MAAM,IAAI,CAWpD;CACF;AAED;;GAEG;AACH,qBAAa,OAAO,CAClB,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,EAC5C,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAC5C,SAAQ,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAClD,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAG/C;CACF"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"selection.d.ts","sourceRoot":"","sources":["../../../src/selection.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAY,MAAM,yBAAyB,CAAC;AAIzD;;GAEG;AACH,qBAAa,cAAc;IAIb,OAAO,CAAC,QAAQ,CAAC,aAAa;IAH1C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoB;IAC9C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6B;
|
|
1
|
+
{"version":3,"file":"selection.d.ts","sourceRoot":"","sources":["../../../src/selection.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAY,MAAM,yBAAyB,CAAC;AAIzD;;GAEG;AACH,qBAAa,cAAc;IAIb,OAAO,CAAC,QAAQ,CAAC,aAAa;IAH1C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoB;IAC9C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6B;IAEvD,YAA6B,aAAa,GAAE,OAAe,EAG1D;IAED;;OAEG;IACH,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAErC;IAED;;OAEG;IACH,WAAW,IAAI,GAAG,CAAC,MAAM,CAAC,CAEzB;IAED;;OAEG;IACH,cAAc,IAAI,MAAM,EAAE,CAEzB;IAED;;OAEG;IACH,SAAS,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,GAAG,MAAM,IAAI,CAOzD;IAED,MAAM,IAAI;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAI/B;IAED;;OAEG;IACH,OAAO,IAAI,MAAM,CAEhB;IAED,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE5B;IAED,KAAK,IAAI,IAAI,CAEZ;IAED,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAOpB;IAED,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAIvB;IAID,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,QAAQ,UAAQ,GAAG,IAAI,CAGjD;IAED,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,QAAQ,UAAQ,GAAG,IAAI,CAYpD;CACF"}
|