kaabalah 5.5.0 → 5.6.0

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.
Files changed (54) hide show
  1. package/README.md +25 -0
  2. package/dist/{chunk-T67M2WBD.js → chunk-3HYK4Q4B.js} +263 -50
  3. package/dist/chunk-3HYK4Q4B.js.map +1 -0
  4. package/dist/{chunk-5ID55YUP.mjs → chunk-3SFBJHP2.mjs} +3 -3
  5. package/dist/{chunk-5ID55YUP.mjs.map → chunk-3SFBJHP2.mjs.map} +1 -1
  6. package/dist/chunk-4NMXTZX4.mjs +525 -0
  7. package/dist/chunk-4NMXTZX4.mjs.map +1 -0
  8. package/dist/{chunk-ZZ3YMT2R.js → chunk-EVQ432JA.js} +23 -23
  9. package/dist/{chunk-ZZ3YMT2R.js.map → chunk-EVQ432JA.js.map} +1 -1
  10. package/dist/{chunk-2J6CVLH2.mjs → chunk-IHQPXEB7.mjs} +263 -51
  11. package/dist/chunk-IHQPXEB7.mjs.map +1 -0
  12. package/dist/{chunk-M7XQFDS4.mjs → chunk-OGWTKRJK.js} +236 -43
  13. package/dist/chunk-OGWTKRJK.js.map +1 -0
  14. package/dist/{chunk-XSAXO3D2.mjs → chunk-S6BFRUJQ.mjs} +3 -3
  15. package/dist/{chunk-XSAXO3D2.mjs.map → chunk-S6BFRUJQ.mjs.map} +1 -1
  16. package/dist/{chunk-G5BG73Y5.js → chunk-U3JFWP24.mjs} +225 -46
  17. package/dist/chunk-U3JFWP24.mjs.map +1 -0
  18. package/dist/chunk-XB6PXEKO.js +529 -0
  19. package/dist/chunk-XB6PXEKO.js.map +1 -0
  20. package/dist/{chunk-2WENLHIP.js → chunk-XTVGQXCL.js} +4 -4
  21. package/dist/{chunk-2WENLHIP.js.map → chunk-XTVGQXCL.js.map} +1 -1
  22. package/dist/cli.js +1061 -126
  23. package/dist/cli.js.map +1 -1
  24. package/dist/{registry-DOiHyH-r.d.mts → constants-DbFwuCjR.d.mts} +1 -177
  25. package/dist/{registry-DOiHyH-r.d.ts → constants-DbFwuCjR.d.ts} +1 -177
  26. package/dist/core/index.d.mts +66 -3
  27. package/dist/core/index.d.ts +66 -3
  28. package/dist/core/index.js +55 -39
  29. package/dist/core/index.mjs +2 -2
  30. package/dist/correspondence-model-D8c42J4c.d.mts +281 -0
  31. package/dist/correspondence-model-DhmBYoMf.d.ts +281 -0
  32. package/dist/gematria/index.d.mts +2 -1
  33. package/dist/gematria/index.d.ts +2 -1
  34. package/dist/gematria/index.js +5 -5
  35. package/dist/gematria/index.mjs +2 -2
  36. package/dist/index.d.mts +4 -3
  37. package/dist/index.d.ts +4 -3
  38. package/dist/index.js +111 -71
  39. package/dist/index.mjs +5 -5
  40. package/dist/numerology/index.js +18 -18
  41. package/dist/numerology/index.mjs +3 -3
  42. package/dist/tarot/index.d.mts +64 -2
  43. package/dist/tarot/index.d.ts +64 -2
  44. package/dist/tarot/index.js +30 -4
  45. package/dist/tarot/index.mjs +3 -1
  46. package/package.json +1 -1
  47. package/dist/chunk-2J6CVLH2.mjs.map +0 -1
  48. package/dist/chunk-AD7T42HJ.js +0 -4
  49. package/dist/chunk-AD7T42HJ.js.map +0 -1
  50. package/dist/chunk-G5BG73Y5.js.map +0 -1
  51. package/dist/chunk-M7XQFDS4.mjs.map +0 -1
  52. package/dist/chunk-RFSO3JRG.mjs +0 -3
  53. package/dist/chunk-RFSO3JRG.mjs.map +0 -1
  54. package/dist/chunk-T67M2WBD.js.map +0 -1
@@ -0,0 +1,525 @@
1
+ import { makeCorrespondenceId, createTree } from './chunk-IHQPXEB7.mjs';
2
+
3
+ // src/core/workspace.ts
4
+ function cloneNode(node) {
5
+ return Object.freeze({
6
+ id: node.id,
7
+ type: node.type,
8
+ name: node.name,
9
+ data: node.data && typeof node.data === "object" ? { ...node.data } : node.data
10
+ });
11
+ }
12
+ function cloneMetadata(metadata) {
13
+ if (!metadata) {
14
+ return void 0;
15
+ }
16
+ return {
17
+ ...metadata,
18
+ tags: metadata.tags ? [...metadata.tags] : void 0,
19
+ attributes: metadata.attributes ? { ...metadata.attributes } : void 0
20
+ };
21
+ }
22
+ function cloneSource(source) {
23
+ if (source.kind === "bridge") {
24
+ return {
25
+ ...source,
26
+ parts: [...source.parts]
27
+ };
28
+ }
29
+ return { ...source };
30
+ }
31
+ function cloneEdge(edge) {
32
+ return Object.freeze({
33
+ ...edge,
34
+ metadata: cloneMetadata(edge.metadata),
35
+ sources: edge.sources.map(cloneSource)
36
+ });
37
+ }
38
+ function cloneNote(note) {
39
+ return Object.freeze({
40
+ ...note,
41
+ target: { ...note.target },
42
+ metadata: note.metadata ? { ...note.metadata } : void 0
43
+ });
44
+ }
45
+ function mergeMetadata(current, next) {
46
+ if (!current) {
47
+ return cloneMetadata(next);
48
+ }
49
+ if (!next) {
50
+ return cloneMetadata(current);
51
+ }
52
+ return {
53
+ ...current,
54
+ ...next,
55
+ tags: [.../* @__PURE__ */ new Set([...current.tags ?? [], ...next.tags ?? []])],
56
+ attributes: {
57
+ ...current.attributes ?? {},
58
+ ...next.attributes ?? {}
59
+ }
60
+ };
61
+ }
62
+ function mergeSources(current, next) {
63
+ const seen = /* @__PURE__ */ new Set();
64
+ const merged = [];
65
+ for (const source of [...current, next]) {
66
+ const key = JSON.stringify(source);
67
+ if (seen.has(key)) {
68
+ continue;
69
+ }
70
+ seen.add(key);
71
+ merged.push(cloneSource(source));
72
+ }
73
+ return merged;
74
+ }
75
+ function normalizeTypes(type) {
76
+ if (!type) {
77
+ return void 0;
78
+ }
79
+ return new Set(Array.isArray(type) ? type : [type]);
80
+ }
81
+ function sortNodes(nodes) {
82
+ return [...nodes].sort((left, right) => {
83
+ if (left.type !== right.type) {
84
+ return left.type.localeCompare(right.type);
85
+ }
86
+ const leftLabel = String(left.name ?? left.id);
87
+ const rightLabel = String(right.name ?? right.id);
88
+ return leftLabel.localeCompare(rightLabel);
89
+ });
90
+ }
91
+ function sortMatches(matches) {
92
+ return [...matches].sort((left, right) => {
93
+ if (left.distance !== right.distance) {
94
+ return left.distance - right.distance;
95
+ }
96
+ if (left.node.type !== right.node.type) {
97
+ return left.node.type.localeCompare(right.node.type);
98
+ }
99
+ const leftLabel = String(left.node.name ?? left.node.id);
100
+ const rightLabel = String(right.node.name ?? right.node.id);
101
+ return leftLabel.localeCompare(rightLabel);
102
+ });
103
+ }
104
+ function createGraphData(descriptor, nodes, edges, notes) {
105
+ const nodesById = /* @__PURE__ */ new Map();
106
+ const nodeIdsByType = /* @__PURE__ */ new Map();
107
+ const edgesById = /* @__PURE__ */ new Map();
108
+ const edgeIdsByNodeId = /* @__PURE__ */ new Map();
109
+ const notesById = /* @__PURE__ */ new Map();
110
+ const noteIdsByNodeId = /* @__PURE__ */ new Map();
111
+ const noteIdsByCorrespondenceId = /* @__PURE__ */ new Map();
112
+ for (const node of nodes) {
113
+ const clonedNode = cloneNode(node);
114
+ nodesById.set(clonedNode.id, clonedNode);
115
+ const typedIds = nodeIdsByType.get(clonedNode.type) ?? [];
116
+ typedIds.push(clonedNode.id);
117
+ nodeIdsByType.set(clonedNode.type, typedIds);
118
+ }
119
+ for (const edge of edges) {
120
+ const clonedEdge = cloneEdge(edge);
121
+ edgesById.set(clonedEdge.id, clonedEdge);
122
+ const leftEdges = edgeIdsByNodeId.get(clonedEdge.left) ?? [];
123
+ leftEdges.push(clonedEdge.id);
124
+ edgeIdsByNodeId.set(clonedEdge.left, leftEdges);
125
+ const rightEdges = edgeIdsByNodeId.get(clonedEdge.right) ?? [];
126
+ rightEdges.push(clonedEdge.id);
127
+ edgeIdsByNodeId.set(clonedEdge.right, rightEdges);
128
+ }
129
+ for (const note of notes) {
130
+ const clonedNote = cloneNote(note);
131
+ notesById.set(clonedNote.id, clonedNote);
132
+ if (clonedNote.target.kind === "node") {
133
+ const nodeNoteIds = noteIdsByNodeId.get(clonedNote.target.nodeId) ?? [];
134
+ nodeNoteIds.push(clonedNote.id);
135
+ noteIdsByNodeId.set(clonedNote.target.nodeId, nodeNoteIds);
136
+ continue;
137
+ }
138
+ const edgeId = makeCorrespondenceId(
139
+ clonedNote.target.left,
140
+ clonedNote.target.right
141
+ );
142
+ const correspondenceNoteIds = noteIdsByCorrespondenceId.get(edgeId) ?? [];
143
+ correspondenceNoteIds.push(clonedNote.id);
144
+ noteIdsByCorrespondenceId.set(edgeId, correspondenceNoteIds);
145
+ }
146
+ for (const ids of nodeIdsByType.values()) {
147
+ ids.sort((left, right) => String(left).localeCompare(String(right)));
148
+ }
149
+ for (const ids of edgeIdsByNodeId.values()) {
150
+ ids.sort((left, right) => left.localeCompare(right));
151
+ }
152
+ for (const ids of noteIdsByNodeId.values()) {
153
+ ids.sort((left, right) => left.localeCompare(right));
154
+ }
155
+ for (const ids of noteIdsByCorrespondenceId.values()) {
156
+ ids.sort((left, right) => left.localeCompare(right));
157
+ }
158
+ return {
159
+ descriptor: Object.freeze({ ...descriptor }),
160
+ nodesById,
161
+ nodeIdsByType,
162
+ edgesById,
163
+ edgeIdsByNodeId,
164
+ notesById,
165
+ noteIdsByNodeId,
166
+ noteIdsByCorrespondenceId
167
+ };
168
+ }
169
+ function normalizeBase(base) {
170
+ if (!base) {
171
+ return {
172
+ descriptor: {},
173
+ nodes: [],
174
+ edges: [],
175
+ notes: []
176
+ };
177
+ }
178
+ if (base instanceof TreeWorkspace) {
179
+ return {
180
+ descriptor: base.descriptor,
181
+ nodes: base.getNodes(),
182
+ edges: base.getEdges(),
183
+ notes: base.getNotes()
184
+ };
185
+ }
186
+ return {
187
+ descriptor: {
188
+ system: base.activeSystem ?? void 0,
189
+ parts: base.loadedParts.filter((part) => part !== "base")
190
+ },
191
+ nodes: base.getNodes(),
192
+ edges: base.getEdges(),
193
+ notes: []
194
+ };
195
+ }
196
+ function applyOverlays(base, overlays) {
197
+ const nodesById = /* @__PURE__ */ new Map();
198
+ const edgesById = /* @__PURE__ */ new Map();
199
+ const notes = [];
200
+ for (const node of base.nodes) {
201
+ nodesById.set(node.id, cloneNode(node));
202
+ }
203
+ for (const edge of base.edges) {
204
+ edgesById.set(edge.id, cloneEdge(edge));
205
+ }
206
+ for (const note of base.notes) {
207
+ notes.push(cloneNote(note));
208
+ }
209
+ for (const overlay of overlays) {
210
+ for (const node of overlay.nodes ?? []) {
211
+ const existing = nodesById.get(node.id);
212
+ if (existing && existing.type !== node.type) {
213
+ throw new Error(
214
+ `Overlay ${overlay.id} tried to upsert ${node.id} with a different type`
215
+ );
216
+ }
217
+ nodesById.set(
218
+ node.id,
219
+ cloneNode(
220
+ existing ? {
221
+ ...existing,
222
+ ...node,
223
+ data: {
224
+ ...existing.data ?? {},
225
+ ...node.data ?? {}
226
+ }
227
+ } : node
228
+ )
229
+ );
230
+ }
231
+ for (const correspondence of overlay.correspondences ?? []) {
232
+ if (!nodesById.has(correspondence.left) || !nodesById.has(correspondence.right)) {
233
+ throw new Error(
234
+ `Overlay ${overlay.id} references unknown nodes in ${correspondence.left} <-> ${correspondence.right}`
235
+ );
236
+ }
237
+ const edgeId = makeCorrespondenceId(
238
+ correspondence.left,
239
+ correspondence.right
240
+ );
241
+ if (correspondence.op === "remove") {
242
+ edgesById.delete(edgeId);
243
+ continue;
244
+ }
245
+ const existingEdge = edgesById.get(edgeId);
246
+ const overlaySource = {
247
+ kind: "overlay",
248
+ overlayId: overlay.id,
249
+ label: overlay.name
250
+ };
251
+ if (!existingEdge) {
252
+ if (correspondence.op !== "add") {
253
+ throw new Error(
254
+ `Overlay ${overlay.id} cannot annotate missing correspondence ${edgeId}`
255
+ );
256
+ }
257
+ edgesById.set(
258
+ edgeId,
259
+ cloneEdge({
260
+ id: edgeId,
261
+ left: correspondence.left,
262
+ right: correspondence.right,
263
+ metadata: cloneMetadata(correspondence.metadata),
264
+ sources: [overlaySource]
265
+ })
266
+ );
267
+ continue;
268
+ }
269
+ edgesById.set(
270
+ edgeId,
271
+ cloneEdge({
272
+ ...existingEdge,
273
+ metadata: mergeMetadata(existingEdge.metadata, correspondence.metadata),
274
+ sources: mergeSources(existingEdge.sources, overlaySource)
275
+ })
276
+ );
277
+ }
278
+ for (const note of overlay.notes ?? []) {
279
+ notes.push(
280
+ cloneNote({
281
+ ...note,
282
+ metadata: note.metadata ? { ...note.metadata } : void 0
283
+ })
284
+ );
285
+ }
286
+ }
287
+ const filteredNotes = notes.filter((note) => {
288
+ if (note.target.kind === "node") {
289
+ return nodesById.has(note.target.nodeId);
290
+ }
291
+ return edgesById.has(
292
+ makeCorrespondenceId(note.target.left, note.target.right)
293
+ );
294
+ });
295
+ return {
296
+ nodes: [...nodesById.values()],
297
+ edges: [...edgesById.values()],
298
+ notes: filteredNotes
299
+ };
300
+ }
301
+ function reconstructPath(startId, targetId, previous, edgesById) {
302
+ const steps = [];
303
+ let current = targetId;
304
+ while (current !== startId) {
305
+ const link = previous.get(current);
306
+ if (!link) {
307
+ break;
308
+ }
309
+ const edge = edgesById.get(link.edgeId);
310
+ if (!edge) {
311
+ break;
312
+ }
313
+ steps.push({
314
+ from: link.from,
315
+ to: current,
316
+ edge
317
+ });
318
+ current = link.from;
319
+ }
320
+ return steps.reverse();
321
+ }
322
+ function buildCanonicalDescriptor(opts, cacheKey) {
323
+ return {
324
+ id: `canonical:${cacheKey}`,
325
+ name: "Canonical Tree",
326
+ system: opts.system,
327
+ parts: [...opts.parts ?? []],
328
+ cacheKey
329
+ };
330
+ }
331
+ var canonicalTreeCache = /* @__PURE__ */ new Map();
332
+ var TreeWorkspace = class {
333
+ constructor(graph, visualResolvers = []) {
334
+ this.graph = graph;
335
+ this.visualResolvers = visualResolvers;
336
+ this.descriptor = graph.descriptor;
337
+ }
338
+ getNode(id) {
339
+ return this.graph.nodesById.get(id);
340
+ }
341
+ hasNode(id) {
342
+ return this.graph.nodesById.has(id);
343
+ }
344
+ getNodes(type) {
345
+ if (!type) {
346
+ return sortNodes(
347
+ [...this.graph.nodesById.values()]
348
+ );
349
+ }
350
+ const ids = this.graph.nodeIdsByType.get(type) ?? [];
351
+ return ids.map((id) => this.graph.nodesById.get(id)).filter((node) => Boolean(node));
352
+ }
353
+ findNodes(options = {}) {
354
+ const typeFilter = normalizeTypes(options.type);
355
+ const search = options.search?.trim().toLowerCase();
356
+ const candidates = options.ids ? options.ids.map((id) => this.graph.nodesById.get(id)).filter((node) => Boolean(node)) : typeFilter ? [...typeFilter].flatMap((type) => this.getNodes(type)) : this.getNodes();
357
+ return sortNodes(
358
+ candidates.filter((node) => {
359
+ if (typeFilter && !typeFilter.has(node.type)) {
360
+ return false;
361
+ }
362
+ if (search) {
363
+ const haystacks = [
364
+ String(node.id).toLowerCase(),
365
+ String(node.name ?? "").toLowerCase()
366
+ ];
367
+ if (!haystacks.some((value) => value.includes(search))) {
368
+ return false;
369
+ }
370
+ }
371
+ return options.predicate ? options.predicate(node) : true;
372
+ })
373
+ );
374
+ }
375
+ getEdge(left, right) {
376
+ return this.graph.edgesById.get(makeCorrespondenceId(left, right));
377
+ }
378
+ getEdges(nodeId) {
379
+ if (!nodeId) {
380
+ return [...this.graph.edgesById.values()];
381
+ }
382
+ return (this.graph.edgeIdsByNodeId.get(nodeId) ?? []).map((edgeId) => this.graph.edgesById.get(edgeId)).filter((edge) => Boolean(edge));
383
+ }
384
+ getNotes(target) {
385
+ if (!target) {
386
+ return [...this.graph.notesById.values()];
387
+ }
388
+ if (target.kind === "node") {
389
+ return (this.graph.noteIdsByNodeId.get(target.nodeId) ?? []).map((noteId) => this.graph.notesById.get(noteId)).filter((note) => Boolean(note));
390
+ }
391
+ const edgeId = makeCorrespondenceId(target.left, target.right);
392
+ return (this.graph.noteIdsByCorrespondenceId.get(edgeId) ?? []).map((noteId) => this.graph.notesById.get(noteId)).filter((note) => Boolean(note));
393
+ }
394
+ getCorrespondences(nodeId, options = {}) {
395
+ if (!this.graph.nodesById.has(nodeId)) {
396
+ return [];
397
+ }
398
+ const typeFilter = normalizeTypes(options.type);
399
+ const includeSelf = options.includeSelf ?? false;
400
+ const depth = Math.max(1, options.depth ?? 1);
401
+ const limit = options.limit ?? Infinity;
402
+ const previous = /* @__PURE__ */ new Map();
403
+ const visited = /* @__PURE__ */ new Set([nodeId]);
404
+ const queue = [
405
+ {
406
+ nodeId,
407
+ distance: 0
408
+ }
409
+ ];
410
+ const matches = [];
411
+ while (queue.length > 0 && matches.length < limit) {
412
+ const current = queue.shift();
413
+ if (current.distance >= depth) {
414
+ continue;
415
+ }
416
+ for (const edgeId of this.graph.edgeIdsByNodeId.get(current.nodeId) ?? []) {
417
+ const edge = this.graph.edgesById.get(edgeId);
418
+ if (!edge) {
419
+ continue;
420
+ }
421
+ const nextNodeId = edge.left === current.nodeId ? edge.right : edge.left;
422
+ if (visited.has(nextNodeId)) {
423
+ continue;
424
+ }
425
+ visited.add(nextNodeId);
426
+ previous.set(nextNodeId, {
427
+ from: current.nodeId,
428
+ edgeId
429
+ });
430
+ const distance = current.distance + 1;
431
+ const nextNode = this.graph.nodesById.get(nextNodeId);
432
+ if (!nextNode) {
433
+ continue;
434
+ }
435
+ if ((!typeFilter || typeFilter.has(nextNode.type)) && distance > 0) {
436
+ matches.push({
437
+ node: nextNode,
438
+ distance,
439
+ path: reconstructPath(
440
+ nodeId,
441
+ nextNodeId,
442
+ previous,
443
+ this.graph.edgesById
444
+ )
445
+ });
446
+ }
447
+ queue.push({
448
+ nodeId: nextNodeId,
449
+ distance
450
+ });
451
+ }
452
+ }
453
+ if (includeSelf) {
454
+ const sourceNode = this.graph.nodesById.get(nodeId);
455
+ if (sourceNode && (!typeFilter || typeFilter.has(sourceNode.type)) && matches.length < limit) {
456
+ matches.unshift({
457
+ node: sourceNode,
458
+ distance: 0,
459
+ path: []
460
+ });
461
+ }
462
+ }
463
+ return sortMatches(matches).slice(0, limit);
464
+ }
465
+ getCorrespondenceMap(nodeId, options = {}) {
466
+ const grouped = {};
467
+ for (const match of this.getCorrespondences(nodeId, options)) {
468
+ const typeKey = match.node.type;
469
+ const typeMatches = grouped[typeKey] ?? [];
470
+ typeMatches.push(match);
471
+ grouped[typeKey] = typeMatches;
472
+ }
473
+ return grouped;
474
+ }
475
+ resolveVisual(request) {
476
+ for (const resolver of this.visualResolvers) {
477
+ const resolved = resolver({
478
+ request,
479
+ workspace: this
480
+ });
481
+ if (resolved) {
482
+ return resolved;
483
+ }
484
+ }
485
+ return void 0;
486
+ }
487
+ };
488
+ function createTreeWorkspace(options = {}) {
489
+ const base = normalizeBase(options.base);
490
+ const overlays = options.overlays ?? [];
491
+ const applied = applyOverlays(base, overlays);
492
+ const descriptor = {
493
+ ...base.descriptor,
494
+ ...options.descriptor
495
+ };
496
+ return new TreeWorkspace(
497
+ createGraphData(descriptor, applied.nodes, applied.edges, applied.notes),
498
+ options.visualResolvers ?? []
499
+ );
500
+ }
501
+ function getCanonicalTree(opts = {
502
+ system: "kaabalah",
503
+ parts: []
504
+ }) {
505
+ const parts = [...opts.parts ?? []];
506
+ const cacheKey = `${opts.system}:${parts.join(",")}`;
507
+ const cachedTree = canonicalTreeCache.get(cacheKey);
508
+ if (cachedTree) {
509
+ return cachedTree;
510
+ }
511
+ const tree = createTree({
512
+ system: opts.system,
513
+ parts
514
+ });
515
+ const canonicalTree = createTreeWorkspace({
516
+ base: tree,
517
+ descriptor: buildCanonicalDescriptor(opts, cacheKey)
518
+ });
519
+ canonicalTreeCache.set(cacheKey, canonicalTree);
520
+ return canonicalTree;
521
+ }
522
+
523
+ export { TreeWorkspace, createTreeWorkspace, getCanonicalTree };
524
+ //# sourceMappingURL=chunk-4NMXTZX4.mjs.map
525
+ //# sourceMappingURL=chunk-4NMXTZX4.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/core/workspace.ts"],"names":[],"mappings":";;;AAkEA,SAAS,UAA8B,IAAwB,EAAA;AAC7D,EAAA,OAAO,OAAO,MAAO,CAAA;AAAA,IACnB,IAAI,IAAK,CAAA,EAAA;AAAA,IACT,MAAM,IAAK,CAAA,IAAA;AAAA,IACX,MAAM,IAAK,CAAA,IAAA;AAAA,IACX,IACE,EAAA,IAAA,CAAK,IAAQ,IAAA,OAAO,IAAK,CAAA,IAAA,KAAS,QAC7B,GAAA,EAAE,GAAG,IAAA,CAAK,IAAK,EAAA,GAChB,IAAK,CAAA;AAAA,GACZ,CAAA;AACH;AAEA,SAAS,cAAc,QAAmC,EAAA;AACxD,EAAA,IAAI,CAAC,QAAU,EAAA;AACb,IAAO,OAAA,MAAA;AAAA;AAGT,EAAO,OAAA;AAAA,IACL,GAAG,QAAA;AAAA,IACH,MAAM,QAAS,CAAA,IAAA,GAAO,CAAC,GAAG,QAAA,CAAS,IAAI,CAAI,GAAA,MAAA;AAAA,IAC3C,YAAY,QAAS,CAAA,UAAA,GAAa,EAAE,GAAG,QAAA,CAAS,YAAe,GAAA;AAAA,GACjE;AACF;AAEA,SAAS,YAAY,MAAoD,EAAA;AACvE,EAAI,IAAA,MAAA,CAAO,SAAS,QAAU,EAAA;AAC5B,IAAO,OAAA;AAAA,MACL,GAAG,MAAA;AAAA,MACH,KAAO,EAAA,CAAC,GAAG,MAAA,CAAO,KAAK;AAAA,KACzB;AAAA;AAGF,EAAO,OAAA,EAAE,GAAG,MAAO,EAAA;AACrB;AAEA,SAAS,UAAU,IAA8C,EAAA;AAC/D,EAAA,OAAO,OAAO,MAAO,CAAA;AAAA,IACnB,GAAG,IAAA;AAAA,IACH,QAAA,EAAU,aAAc,CAAA,IAAA,CAAK,QAAQ,CAAA;AAAA,IACrC,OAAS,EAAA,IAAA,CAAK,OAAQ,CAAA,GAAA,CAAI,WAAW;AAAA,GACtC,CAAA;AACH;AAEA,SAAS,UAAU,IAA0B,EAAA;AAC3C,EAAA,OAAO,OAAO,MAAO,CAAA;AAAA,IACnB,GAAG,IAAA;AAAA,IACH,MAAQ,EAAA,EAAE,GAAG,IAAA,CAAK,MAAO,EAAA;AAAA,IACzB,UAAU,IAAK,CAAA,QAAA,GAAW,EAAE,GAAG,IAAA,CAAK,UAAa,GAAA;AAAA,GAClD,CAAA;AACH;AAEA,SAAS,aAAA,CACP,SACA,IACA,EAAA;AACA,EAAA,IAAI,CAAC,OAAS,EAAA;AACZ,IAAA,OAAO,cAAc,IAAI,CAAA;AAAA;AAG3B,EAAA,IAAI,CAAC,IAAM,EAAA;AACT,IAAA,OAAO,cAAc,OAAO,CAAA;AAAA;AAG9B,EAAO,OAAA;AAAA,IACL,GAAG,OAAA;AAAA,IACH,GAAG,IAAA;AAAA,IACH,MAAM,CAAC,mBAAO,IAAA,GAAA,CAAI,CAAC,GAAI,OAAA,CAAQ,IAAQ,IAAA,IAAK,GAAI,IAAA,CAAK,QAAQ,EAAG,CAAC,CAAC,CAAA;AAAA,IAClE,UAAY,EAAA;AAAA,MACV,GAAI,OAAQ,CAAA,UAAA,IAAc,EAAC;AAAA,MAC3B,GAAI,IAAK,CAAA,UAAA,IAAc;AAAC;AAC1B,GACF;AACF;AAEA,SAAS,YAAA,CACP,SACA,IACA,EAAA;AACA,EAAM,MAAA,IAAA,uBAAW,GAAY,EAAA;AAC7B,EAAA,MAAM,SAAiC,EAAC;AAExC,EAAA,KAAA,MAAW,MAAU,IAAA,CAAC,GAAG,OAAA,EAAS,IAAI,CAAG,EAAA;AACvC,IAAM,MAAA,GAAA,GAAM,IAAK,CAAA,SAAA,CAAU,MAAM,CAAA;AAEjC,IAAI,IAAA,IAAA,CAAK,GAAI,CAAA,GAAG,CAAG,EAAA;AACjB,MAAA;AAAA;AAGF,IAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,IAAO,MAAA,CAAA,IAAA,CAAK,WAAY,CAAA,MAAM,CAAC,CAAA;AAAA;AAGjC,EAAO,OAAA,MAAA;AACT;AAEA,SAAS,eACP,IAC2B,EAAA;AAC3B,EAAA,IAAI,CAAC,IAAM,EAAA;AACT,IAAO,OAAA,MAAA;AAAA;AAGT,EAAO,OAAA,IAAI,IAAI,KAAM,CAAA,OAAA,CAAQ,IAAI,CAAI,GAAA,IAAA,GAAO,CAAC,IAAI,CAAC,CAAA;AACpD;AAEA,SAAS,UAA8B,KAAkB,EAAA;AACvD,EAAA,OAAO,CAAC,GAAG,KAAK,EAAE,IAAK,CAAA,CAAC,MAAM,KAAU,KAAA;AACtC,IAAI,IAAA,IAAA,CAAK,IAAS,KAAA,KAAA,CAAM,IAAM,EAAA;AAC5B,MAAA,OAAO,IAAK,CAAA,IAAA,CAAK,aAAc,CAAA,KAAA,CAAM,IAAI,CAAA;AAAA;AAG3C,IAAA,MAAM,SAAY,GAAA,MAAA,CAAO,IAAK,CAAA,IAAA,IAAQ,KAAK,EAAE,CAAA;AAC7C,IAAA,MAAM,UAAa,GAAA,MAAA,CAAO,KAAM,CAAA,IAAA,IAAQ,MAAM,EAAE,CAAA;AAEhD,IAAO,OAAA,SAAA,CAAU,cAAc,UAAU,CAAA;AAAA,GAC1C,CAAA;AACH;AAEA,SAAS,YAAgC,OAAmC,EAAA;AAC1E,EAAA,OAAO,CAAC,GAAG,OAAO,EAAE,IAAK,CAAA,CAAC,MAAM,KAAU,KAAA;AACxC,IAAI,IAAA,IAAA,CAAK,QAAa,KAAA,KAAA,CAAM,QAAU,EAAA;AACpC,MAAO,OAAA,IAAA,CAAK,WAAW,KAAM,CAAA,QAAA;AAAA;AAG/B,IAAA,IAAI,IAAK,CAAA,IAAA,CAAK,IAAS,KAAA,KAAA,CAAM,KAAK,IAAM,EAAA;AACtC,MAAA,OAAO,KAAK,IAAK,CAAA,IAAA,CAAK,aAAc,CAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA;AAGrD,IAAA,MAAM,YAAY,MAAO,CAAA,IAAA,CAAK,KAAK,IAAQ,IAAA,IAAA,CAAK,KAAK,EAAE,CAAA;AACvD,IAAA,MAAM,aAAa,MAAO,CAAA,KAAA,CAAM,KAAK,IAAQ,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAE1D,IAAO,OAAA,SAAA,CAAU,cAAc,UAAU,CAAA;AAAA,GAC1C,CAAA;AACH;AAEA,SAAS,eACP,CAAA,UAAA,EACA,KACA,EAAA,KAAA,EACA,KACe,EAAA;AACf,EAAM,MAAA,SAAA,uBAAgB,GAAsC,EAAA;AAC5D,EAAM,MAAA,aAAA,uBAAoB,GAAkC,EAAA;AAC5D,EAAM,MAAA,SAAA,uBAAgB,GAAgC,EAAA;AACtD,EAAM,MAAA,eAAA,uBAAsB,GAAgC,EAAA;AAC5D,EAAM,MAAA,SAAA,uBAAgB,GAAsB,EAAA;AAC5C,EAAM,MAAA,eAAA,uBAAsB,GAAgC,EAAA;AAC5D,EAAM,MAAA,yBAAA,uBAAgC,GAAsB,EAAA;AAE5D,EAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,IAAM,MAAA,UAAA,GAAa,UAAU,IAAI,CAAA;AAEjC,IAAU,SAAA,CAAA,GAAA,CAAI,UAAW,CAAA,EAAA,EAAI,UAAU,CAAA;AAEvC,IAAA,MAAM,WAAW,aAAc,CAAA,GAAA,CAAI,UAAW,CAAA,IAAI,KAAK,EAAC;AACxD,IAAS,QAAA,CAAA,IAAA,CAAK,WAAW,EAAsB,CAAA;AAC/C,IAAc,aAAA,CAAA,GAAA,CAAI,UAAW,CAAA,IAAA,EAAM,QAAQ,CAAA;AAAA;AAG7C,EAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,IAAM,MAAA,UAAA,GAAa,UAAU,IAAI,CAAA;AAEjC,IAAU,SAAA,CAAA,GAAA,CAAI,UAAW,CAAA,EAAA,EAAI,UAAU,CAAA;AAEvC,IAAA,MAAM,YAAY,eAAgB,CAAA,GAAA,CAAI,UAAW,CAAA,IAAI,KAAK,EAAC;AAC3D,IAAU,SAAA,CAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AAC5B,IAAgB,eAAA,CAAA,GAAA,CAAI,UAAW,CAAA,IAAA,EAAM,SAAS,CAAA;AAE9C,IAAA,MAAM,aAAa,eAAgB,CAAA,GAAA,CAAI,UAAW,CAAA,KAAK,KAAK,EAAC;AAC7D,IAAW,UAAA,CAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AAC7B,IAAgB,eAAA,CAAA,GAAA,CAAI,UAAW,CAAA,KAAA,EAAO,UAAU,CAAA;AAAA;AAGlD,EAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,IAAM,MAAA,UAAA,GAAa,UAAU,IAAI,CAAA;AACjC,IAAU,SAAA,CAAA,GAAA,CAAI,UAAW,CAAA,EAAA,EAAI,UAAU,CAAA;AAEvC,IAAI,IAAA,UAAA,CAAW,MAAO,CAAA,IAAA,KAAS,MAAQ,EAAA;AACrC,MAAA,MAAM,cAAc,eAAgB,CAAA,GAAA,CAAI,WAAW,MAAO,CAAA,MAAM,KAAK,EAAC;AACtE,MAAY,WAAA,CAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AAC9B,MAAA,eAAA,CAAgB,GAAI,CAAA,UAAA,CAAW,MAAO,CAAA,MAAA,EAAQ,WAAW,CAAA;AACzD,MAAA;AAAA;AAGF,IAAA,MAAM,MAAS,GAAA,oBAAA;AAAA,MACb,WAAW,MAAO,CAAA,IAAA;AAAA,MAClB,WAAW,MAAO,CAAA;AAAA,KACpB;AACA,IAAA,MAAM,qBACJ,GAAA,yBAAA,CAA0B,GAAI,CAAA,MAAM,KAAK,EAAC;AAC5C,IAAsB,qBAAA,CAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AACxC,IAA0B,yBAAA,CAAA,GAAA,CAAI,QAAQ,qBAAqB,CAAA;AAAA;AAG7D,EAAW,KAAA,MAAA,GAAA,IAAO,aAAc,CAAA,MAAA,EAAU,EAAA;AACxC,IAAI,GAAA,CAAA,IAAA,CAAK,CAAC,IAAA,EAAM,KAAU,KAAA,MAAA,CAAO,IAAI,CAAA,CAAE,aAAc,CAAA,MAAA,CAAO,KAAK,CAAC,CAAC,CAAA;AAAA;AAGrE,EAAW,KAAA,MAAA,GAAA,IAAO,eAAgB,CAAA,MAAA,EAAU,EAAA;AAC1C,IAAA,GAAA,CAAI,KAAK,CAAC,IAAA,EAAM,UAAU,IAAK,CAAA,aAAA,CAAc,KAAK,CAAC,CAAA;AAAA;AAGrD,EAAW,KAAA,MAAA,GAAA,IAAO,eAAgB,CAAA,MAAA,EAAU,EAAA;AAC1C,IAAA,GAAA,CAAI,KAAK,CAAC,IAAA,EAAM,UAAU,IAAK,CAAA,aAAA,CAAc,KAAK,CAAC,CAAA;AAAA;AAGrD,EAAW,KAAA,MAAA,GAAA,IAAO,yBAA0B,CAAA,MAAA,EAAU,EAAA;AACpD,IAAA,GAAA,CAAI,KAAK,CAAC,IAAA,EAAM,UAAU,IAAK,CAAA,aAAA,CAAc,KAAK,CAAC,CAAA;AAAA;AAGrD,EAAO,OAAA;AAAA,IACL,YAAY,MAAO,CAAA,MAAA,CAAO,EAAE,GAAG,YAAY,CAAA;AAAA,IAC3C,SAAA;AAAA,IACA,aAAA;AAAA,IACA,SAAA;AAAA,IACA,eAAA;AAAA,IACA,SAAA;AAAA,IACA,eAAA;AAAA,IACA;AAAA,GACF;AACF;AAEA,SAAS,cAAc,IAAmC,EAAA;AACxD,EAAA,IAAI,CAAC,IAAM,EAAA;AACT,IAAO,OAAA;AAAA,MACL,YAAY,EAAC;AAAA,MACb,OAAO,EAAC;AAAA,MACR,OAAO,EAAC;AAAA,MACR,OAAO;AAAC,KACV;AAAA;AAGF,EAAA,IAAI,gBAAgB,aAAe,EAAA;AACjC,IAAO,OAAA;AAAA,MACL,YAAY,IAAK,CAAA,UAAA;AAAA,MACjB,KAAA,EAAO,KAAK,QAAS,EAAA;AAAA,MACrB,KAAA,EAAO,KAAK,QAAS,EAAA;AAAA,MACrB,KAAA,EAAO,KAAK,QAAS;AAAA,KACvB;AAAA;AAGF,EAAO,OAAA;AAAA,IACL,UAAY,EAAA;AAAA,MACV,MAAA,EAAQ,KAAK,YAAgB,IAAA,MAAA;AAAA,MAC7B,OAAO,IAAK,CAAA,WAAA,CAAY,OAAO,CAAC,IAAA,KAAS,SAAS,MAAM;AAAA,KAC1D;AAAA,IACA,KAAA,EAAO,KAAK,QAAS,EAAA;AAAA,IACrB,KAAA,EAAO,KAAK,QAAS,EAAA;AAAA,IACrB,OAAO;AAAC,GACV;AACF;AAEA,SAAS,aAAA,CACP,MACA,QACA,EAAA;AACA,EAAM,MAAA,SAAA,uBAAgB,GAAsC,EAAA;AAC5D,EAAM,MAAA,SAAA,uBAAgB,GAAgC,EAAA;AACtD,EAAA,MAAM,QAAoB,EAAC;AAE3B,EAAW,KAAA,MAAA,IAAA,IAAQ,KAAK,KAAO,EAAA;AAC7B,IAAA,SAAA,CAAU,GAAI,CAAA,IAAA,CAAK,EAAwB,EAAA,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA;AAG5D,EAAW,KAAA,MAAA,IAAA,IAAQ,KAAK,KAAO,EAAA;AAC7B,IAAA,SAAA,CAAU,GAAI,CAAA,IAAA,CAAK,EAAI,EAAA,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA;AAGxC,EAAW,KAAA,MAAA,IAAA,IAAQ,KAAK,KAAO,EAAA;AAC7B,IAAM,KAAA,CAAA,IAAA,CAAK,SAAU,CAAA,IAAI,CAAC,CAAA;AAAA;AAG5B,EAAA,KAAA,MAAW,WAAW,QAAU,EAAA;AAC9B,IAAA,KAAA,MAAW,IAAQ,IAAA,OAAA,CAAQ,KAAS,IAAA,EAAI,EAAA;AACtC,MAAA,MAAM,QAAW,GAAA,SAAA,CAAU,GAAI,CAAA,IAAA,CAAK,EAAsB,CAAA;AAE1D,MAAA,IAAI,QAAY,IAAA,QAAA,CAAS,IAAS,KAAA,IAAA,CAAK,IAAM,EAAA;AAC3C,QAAA,MAAM,IAAI,KAAA;AAAA,UACR,CAAW,QAAA,EAAA,OAAA,CAAQ,EAAE,CAAA,iBAAA,EAAoB,KAAK,EAAE,CAAA,sBAAA;AAAA,SAClD;AAAA;AAGF,MAAU,SAAA,CAAA,GAAA;AAAA,QACR,IAAK,CAAA,EAAA;AAAA,QACL,SAAA;AAAA,UACE,QACI,GAAA;AAAA,YACE,GAAG,QAAA;AAAA,YACH,GAAG,IAAA;AAAA,YACH,IAAM,EAAA;AAAA,cACJ,GAAI,QAAS,CAAA,IAAA,IAAQ,EAAC;AAAA,cACtB,GAAI,IAAK,CAAA,IAAA,IAAQ;AAAC;AACpB,WAEF,GAAA;AAAA;AACN,OACF;AAAA;AAGF,IAAA,KAAA,MAAW,cAAkB,IAAA,OAAA,CAAQ,eAAmB,IAAA,EAAI,EAAA;AAC1D,MACE,IAAA,CAAC,SAAU,CAAA,GAAA,CAAI,cAAe,CAAA,IAAI,CAClC,IAAA,CAAC,SAAU,CAAA,GAAA,CAAI,cAAe,CAAA,KAAK,CACnC,EAAA;AACA,QAAA,MAAM,IAAI,KAAA;AAAA,UACR,CAAA,QAAA,EAAW,QAAQ,EAAE,CAAA,6BAAA,EAAgC,eAAe,IAAI,CAAA,KAAA,EAAQ,eAAe,KAAK,CAAA;AAAA,SACtG;AAAA;AAGF,MAAA,MAAM,MAAS,GAAA,oBAAA;AAAA,QACb,cAAe,CAAA,IAAA;AAAA,QACf,cAAe,CAAA;AAAA,OACjB;AAEA,MAAI,IAAA,cAAA,CAAe,OAAO,QAAU,EAAA;AAClC,QAAA,SAAA,CAAU,OAAO,MAAM,CAAA;AACvB,QAAA;AAAA;AAGF,MAAM,MAAA,YAAA,GAAe,SAAU,CAAA,GAAA,CAAI,MAAM,CAAA;AACzC,MAAA,MAAM,aAAsC,GAAA;AAAA,QAC1C,IAAM,EAAA,SAAA;AAAA,QACN,WAAW,OAAQ,CAAA,EAAA;AAAA,QACnB,OAAO,OAAQ,CAAA;AAAA,OACjB;AAEA,MAAA,IAAI,CAAC,YAAc,EAAA;AACjB,QAAI,IAAA,cAAA,CAAe,OAAO,KAAO,EAAA;AAC/B,UAAA,MAAM,IAAI,KAAA;AAAA,YACR,CAAW,QAAA,EAAA,OAAA,CAAQ,EAAE,CAAA,wCAAA,EAA2C,MAAM,CAAA;AAAA,WACxE;AAAA;AAGF,QAAU,SAAA,CAAA,GAAA;AAAA,UACR,MAAA;AAAA,UACA,SAAU,CAAA;AAAA,YACR,EAAI,EAAA,MAAA;AAAA,YACJ,MAAM,cAAe,CAAA,IAAA;AAAA,YACrB,OAAO,cAAe,CAAA,KAAA;AAAA,YACtB,QAAA,EAAU,aAAc,CAAA,cAAA,CAAe,QAAQ,CAAA;AAAA,YAC/C,OAAA,EAAS,CAAC,aAAa;AAAA,WACxB;AAAA,SACH;AACA,QAAA;AAAA;AAGF,MAAU,SAAA,CAAA,GAAA;AAAA,QACR,MAAA;AAAA,QACA,SAAU,CAAA;AAAA,UACR,GAAG,YAAA;AAAA,UACH,QAAU,EAAA,aAAA,CAAc,YAAa,CAAA,QAAA,EAAU,eAAe,QAAQ,CAAA;AAAA,UACtE,OAAS,EAAA,YAAA,CAAa,YAAa,CAAA,OAAA,EAAS,aAAa;AAAA,SAC1D;AAAA,OACH;AAAA;AAGF,IAAA,KAAA,MAAW,IAAQ,IAAA,OAAA,CAAQ,KAAS,IAAA,EAAI,EAAA;AACtC,MAAM,KAAA,CAAA,IAAA;AAAA,QACJ,SAAU,CAAA;AAAA,UACR,GAAG,IAAA;AAAA,UACH,UAAU,IAAK,CAAA,QAAA,GAAW,EAAE,GAAG,IAAA,CAAK,UAAa,GAAA;AAAA,SAClD;AAAA,OACH;AAAA;AACF;AAGF,EAAA,MAAM,aAAgB,GAAA,KAAA,CAAM,MAAO,CAAA,CAAC,IAAS,KAAA;AAC3C,IAAI,IAAA,IAAA,CAAK,MAAO,CAAA,IAAA,KAAS,MAAQ,EAAA;AAC/B,MAAA,OAAO,SAAU,CAAA,GAAA,CAAI,IAAK,CAAA,MAAA,CAAO,MAAM,CAAA;AAAA;AAGzC,IAAA,OAAO,SAAU,CAAA,GAAA;AAAA,MACf,qBAAqB,IAAK,CAAA,MAAA,CAAO,IAAM,EAAA,IAAA,CAAK,OAAO,KAAK;AAAA,KAC1D;AAAA,GACD,CAAA;AAED,EAAO,OAAA;AAAA,IACL,KAAO,EAAA,CAAC,GAAG,SAAA,CAAU,QAAQ,CAAA;AAAA,IAC7B,KAAO,EAAA,CAAC,GAAG,SAAA,CAAU,QAAQ,CAAA;AAAA,IAC7B,KAAO,EAAA;AAAA,GACT;AACF;AAEA,SAAS,eACP,CAAA,OAAA,EACA,QACA,EAAA,QAAA,EACA,SACA,EAAA;AACA,EAAA,MAAM,QAA8B,EAAC;AACrC,EAAA,IAAI,OAAU,GAAA,QAAA;AAEd,EAAA,OAAO,YAAY,OAAS,EAAA;AAC1B,IAAM,MAAA,IAAA,GAAO,QAAS,CAAA,GAAA,CAAI,OAAO,CAAA;AAEjC,IAAA,IAAI,CAAC,IAAM,EAAA;AACT,MAAA;AAAA;AAGF,IAAA,MAAM,IAAO,GAAA,SAAA,CAAU,GAAI,CAAA,IAAA,CAAK,MAAM,CAAA;AAEtC,IAAA,IAAI,CAAC,IAAM,EAAA;AACT,MAAA;AAAA;AAGF,IAAA,KAAA,CAAM,IAAK,CAAA;AAAA,MACT,MAAM,IAAK,CAAA,IAAA;AAAA,MACX,EAAI,EAAA,OAAA;AAAA,MACJ;AAAA,KACD,CAAA;AACD,IAAA,OAAA,GAAU,IAAK,CAAA,IAAA;AAAA;AAGjB,EAAA,OAAO,MAAM,OAAQ,EAAA;AACvB;AAEA,SAAS,wBAAA,CAAyB,MAAmB,QAAkB,EAAA;AACrE,EAAO,OAAA;AAAA,IACL,EAAA,EAAI,aAAa,QAAQ,CAAA,CAAA;AAAA,IACzB,IAAM,EAAA,gBAAA;AAAA,IACN,QAAQ,IAAK,CAAA,MAAA;AAAA,IACb,OAAO,CAAC,GAAI,IAAK,CAAA,KAAA,IAAS,EAAG,CAAA;AAAA,IAC7B;AAAA,GACF;AACF;AAEA,IAAM,kBAAA,uBAAyB,GAA2B,EAAA;AAEnD,IAAM,gBAAN,MAAoB;AAAA,EAGzB,WACmB,CAAA,KAAA,EACA,eAAiD,GAAA,EAClE,EAAA;AAFiB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,eAAA,GAAA,eAAA;AAEjB,IAAA,IAAA,CAAK,aAAa,KAAM,CAAA,UAAA;AAAA;AAC1B,EAEA,QAA4B,EAAe,EAAA;AACzC,IAAA,OAAO,IAAK,CAAA,KAAA,CAAM,SAAU,CAAA,GAAA,CAAI,EAAsB,CAAA;AAAA;AAGxD,EAEA,QAAQ,EAAsB,EAAA;AAC5B,IAAA,OAAO,IAAK,CAAA,KAAA,CAAM,SAAU,CAAA,GAAA,CAAI,EAAE,CAAA;AAAA;AACpC,EAEA,SAA6B,IAAqB,EAAA;AAChD,IAAA,IAAI,CAAC,IAAM,EAAA;AACT,MAAO,OAAA,SAAA;AAAA,QACL,CAAC,GAAG,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,QAAQ;AAAA,OACnC;AAAA;AAGF,IAAA,MAAM,MAAM,IAAK,CAAA,KAAA,CAAM,cAAc,GAAI,CAAA,IAAI,KAAK,EAAC;AAEnD,IAAA,OAAO,IACJ,GAAI,CAAA,CAAC,EAAO,KAAA,IAAA,CAAK,MAAM,SAAU,CAAA,GAAA,CAAI,EAAE,CAAwB,EAC/D,MAAO,CAAA,CAAC,IAA0B,KAAA,OAAA,CAAQ,IAAI,CAAC,CAAA;AAAA;AACpD,EAEA,SAAA,CACE,OAAmC,GAAA,EACxB,EAAA;AACX,IAAM,MAAA,UAAA,GAAa,cAAe,CAAA,OAAA,CAAQ,IAAI,CAAA;AAC9C,IAAA,MAAM,MAAS,GAAA,OAAA,CAAQ,MAAQ,EAAA,IAAA,GAAO,WAAY,EAAA;AAElD,IAAA,MAAM,aAAa,OAAQ,CAAA,GAAA,GACvB,OAAQ,CAAA,GAAA,CACL,IAAI,CAAC,EAAA,KAAO,IAAK,CAAA,KAAA,CAAM,UAAU,GAAI,CAAA,EAAsB,CAAC,CAAA,CAC5D,OAAO,CAAC,IAAA,KAAiC,OAAQ,CAAA,IAAI,CAAC,CACzD,GAAA,UAAA,GACE,CAAC,GAAG,UAAU,CAAE,CAAA,OAAA,CAAQ,CAAC,IAAA,KAAS,KAAK,QAAS,CAAA,IAAI,CAAC,CAAA,GACrD,KAAK,QAAS,EAAA;AAEpB,IAAO,OAAA,SAAA;AAAA,MACL,UAAA,CAAW,MAAO,CAAA,CAAC,IAA0B,KAAA;AAC3C,QAAA,IAAI,cAAc,CAAC,UAAA,CAAW,GAAI,CAAA,IAAA,CAAK,IAAI,CAAG,EAAA;AAC5C,UAAO,OAAA,KAAA;AAAA;AAGT,QAAA,IAAI,MAAQ,EAAA;AACV,UAAA,MAAM,SAAY,GAAA;AAAA,YAChB,MAAO,CAAA,IAAA,CAAK,EAAE,CAAA,CAAE,WAAY,EAAA;AAAA,YAC5B,MAAO,CAAA,IAAA,CAAK,IAAQ,IAAA,EAAE,EAAE,WAAY;AAAA,WACtC;AAEA,UAAI,IAAA,CAAC,UAAU,IAAK,CAAA,CAAC,UAAU,KAAM,CAAA,QAAA,CAAS,MAAM,CAAC,CAAG,EAAA;AACtD,YAAO,OAAA,KAAA;AAAA;AACT;AAGF,QAAA,OAAO,OAAQ,CAAA,SAAA,GAAY,OAAQ,CAAA,SAAA,CAAU,IAAe,CAAI,GAAA,IAAA;AAAA,OACjE;AAAA,KACH;AAAA;AACF,EAEA,OAAA,CAAQ,MAAwB,KAAyB,EAAA;AACvD,IAAA,OAAO,KAAK,KAAM,CAAA,SAAA,CAAU,IAAI,oBAAqB,CAAA,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA;AACnE,EAEA,SAAS,MAA2B,EAAA;AAClC,IAAA,IAAI,CAAC,MAAQ,EAAA;AACX,MAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,QAAQ,CAAA;AAAA;AAG1C,IAAQ,OAAA,CAAA,IAAA,CAAK,MAAM,eAAgB,CAAA,GAAA,CAAI,MAAM,CAAK,IAAA,EAC/C,EAAA,GAAA,CAAI,CAAC,MAAA,KAAW,KAAK,KAAM,CAAA,SAAA,CAAU,GAAI,CAAA,MAAM,CAAC,CAAA,CAChD,OAAO,CAAC,IAAA,KAAqC,OAAQ,CAAA,IAAI,CAAC,CAAA;AAAA;AAC/D,EAEA,SAAS,MAAyB,EAAA;AAChC,IAAA,IAAI,CAAC,MAAQ,EAAA;AACX,MAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,QAAQ,CAAA;AAAA;AAG1C,IAAI,IAAA,MAAA,CAAO,SAAS,MAAQ,EAAA;AAC1B,MAAQ,OAAA,CAAA,IAAA,CAAK,KAAM,CAAA,eAAA,CAAgB,GAAI,CAAA,MAAA,CAAO,MAAM,CAAK,IAAA,EACtD,EAAA,GAAA,CAAI,CAAC,MAAA,KAAW,KAAK,KAAM,CAAA,SAAA,CAAU,GAAI,CAAA,MAAM,CAAC,CAAA,CAChD,OAAO,CAAC,IAAA,KAA2B,OAAQ,CAAA,IAAI,CAAC,CAAA;AAAA;AAGrD,IAAA,MAAM,MAAS,GAAA,oBAAA,CAAqB,MAAO,CAAA,IAAA,EAAM,OAAO,KAAK,CAAA;AAE7D,IAAQ,OAAA,CAAA,IAAA,CAAK,MAAM,yBAA0B,CAAA,GAAA,CAAI,MAAM,CAAK,IAAA,EACzD,EAAA,GAAA,CAAI,CAAC,MAAA,KAAW,KAAK,KAAM,CAAA,SAAA,CAAU,GAAI,CAAA,MAAM,CAAC,CAAA,CAChD,OAAO,CAAC,IAAA,KAA2B,OAAQ,CAAA,IAAI,CAAC,CAAA;AAAA;AACrD,EAEA,kBACE,CAAA,MAAA,EACA,OAA6C,GAAA,EACnB,EAAA;AAC1B,IAAA,IAAI,CAAC,IAAK,CAAA,KAAA,CAAM,SAAU,CAAA,GAAA,CAAI,MAA0B,CAAG,EAAA;AACzD,MAAA,OAAO,EAAC;AAAA;AAGV,IAAM,MAAA,UAAA,GAAa,cAAe,CAAA,OAAA,CAAQ,IAAI,CAAA;AAC9C,IAAM,MAAA,WAAA,GAAc,QAAQ,WAAe,IAAA,KAAA;AAC3C,IAAA,MAAM,QAAQ,IAAK,CAAA,GAAA,CAAI,CAAG,EAAA,OAAA,CAAQ,SAAS,CAAC,CAAA;AAC5C,IAAM,MAAA,KAAA,GAAQ,QAAQ,KAAS,IAAA,QAAA;AAE/B,IAAM,MAAA,QAAA,uBAAe,GAGnB,EAAA;AACF,IAAA,MAAM,OAAU,mBAAA,IAAI,GAAsB,CAAA,CAAC,MAA0B,CAAC,CAAA;AACtE,IAAA,MAAM,KAA+D,GAAA;AAAA,MACnE;AAAA,QACE,MAAA;AAAA,QACA,QAAU,EAAA;AAAA;AACZ,KACF;AACA,IAAA,MAAM,UAA2C,EAAC;AAElD,IAAA,OAAO,KAAM,CAAA,MAAA,GAAS,CAAK,IAAA,OAAA,CAAQ,SAAS,KAAO,EAAA;AACjD,MAAM,MAAA,OAAA,GAAU,MAAM,KAAM,EAAA;AAE5B,MAAI,IAAA,OAAA,CAAQ,YAAY,KAAO,EAAA;AAC7B,QAAA;AAAA;AAGF,MAAW,KAAA,MAAA,MAAA,IAAU,KAAK,KAAM,CAAA,eAAA,CAAgB,IAAI,OAAQ,CAAA,MAAM,CAAK,IAAA,EAAI,EAAA;AACzE,QAAA,MAAM,IAAO,GAAA,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,IAAI,MAAM,CAAA;AAE5C,QAAA,IAAI,CAAC,IAAM,EAAA;AACT,UAAA;AAAA;AAGF,QAAA,MAAM,aACJ,IAAK,CAAA,IAAA,KAAS,QAAQ,MAAS,GAAA,IAAA,CAAK,QAAQ,IAAK,CAAA,IAAA;AAEnD,QAAI,IAAA,OAAA,CAAQ,GAAI,CAAA,UAAU,CAAG,EAAA;AAC3B,UAAA;AAAA;AAGF,QAAA,OAAA,CAAQ,IAAI,UAAU,CAAA;AACtB,QAAA,QAAA,CAAS,IAAI,UAAY,EAAA;AAAA,UACvB,MAAM,OAAQ,CAAA,MAAA;AAAA,UACd;AAAA,SACD,CAAA;AAED,QAAM,MAAA,QAAA,GAAW,QAAQ,QAAW,GAAA,CAAA;AACpC,QAAA,MAAM,QAAW,GAAA,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,IAAI,UAAU,CAAA;AAEpD,QAAA,IAAI,CAAC,QAAU,EAAA;AACb,UAAA;AAAA;AAGF,QAAK,IAAA,CAAA,CAAC,cAAc,UAAW,CAAA,GAAA,CAAI,SAAS,IAAI,CAAA,KAAM,WAAW,CAAG,EAAA;AAClE,UAAA,OAAA,CAAQ,IAAK,CAAA;AAAA,YACX,IAAM,EAAA,QAAA;AAAA,YACN,QAAA;AAAA,YACA,IAAM,EAAA,eAAA;AAAA,cACJ,MAAA;AAAA,cACA,UAAA;AAAA,cACA,QAAA;AAAA,cACA,KAAK,KAAM,CAAA;AAAA;AACb,WACD,CAAA;AAAA;AAGH,QAAA,KAAA,CAAM,IAAK,CAAA;AAAA,UACT,MAAQ,EAAA,UAAA;AAAA,UACR;AAAA,SACD,CAAA;AAAA;AACH;AAGF,IAAA,IAAI,WAAa,EAAA;AACf,MAAA,MAAM,UAAa,GAAA,IAAA,CAAK,KAAM,CAAA,SAAA,CAAU,IAAI,MAA0B,CAAA;AAEtE,MACE,IAAA,UAAA,KACC,CAAC,UAAA,IAAc,UAAW,CAAA,GAAA,CAAI,WAAW,IAAI,CAAA,CAAA,IAC9C,OAAQ,CAAA,MAAA,GAAS,KACjB,EAAA;AACA,QAAA,OAAA,CAAQ,OAAQ,CAAA;AAAA,UACd,IAAM,EAAA,UAAA;AAAA,UACN,QAAU,EAAA,CAAA;AAAA,UACV,MAAM;AAAC,SACR,CAAA;AAAA;AACH;AAGF,IAAA,OAAO,WAAY,CAAA,OAAmC,CAAE,CAAA,KAAA,CAAM,GAAG,KAAK,CAAA;AAAA;AACxE,EAEA,oBACE,CAAA,MAAA,EACA,OAAwD,GAAA,EACrC,EAAA;AACnB,IAAA,MAAM,UAAiD,EAAC;AAExD,IAAA,KAAA,MAAW,KAAS,IAAA,IAAA,CAAK,kBAAmB,CAAA,MAAA,EAAQ,OAAO,CAAG,EAAA;AAC5D,MAAM,MAAA,OAAA,GAAU,MAAM,IAAK,CAAA,IAAA;AAC3B,MAAA,MAAM,WAAc,GAAA,OAAA,CAAQ,OAAO,CAAA,IAAK,EAAC;AACzC,MAAA,WAAA,CAAY,KAAK,KAA4B,CAAA;AAC7C,MAAA,OAAA,CAAQ,OAAO,CAAI,GAAA,WAAA;AAAA;AAGrB,IAAO,OAAA,OAAA;AAAA;AACT,EAEA,cAAc,OAA4B,EAAA;AACxC,IAAW,KAAA,MAAA,QAAA,IAAY,KAAK,eAAiB,EAAA;AAC3C,MAAA,MAAM,WAAW,QAAS,CAAA;AAAA,QACxB,OAAA;AAAA,QACA,SAAW,EAAA;AAAA,OACZ,CAAA;AAED,MAAA,IAAI,QAAU,EAAA;AACZ,QAAO,OAAA,QAAA;AAAA;AACT;AAGF,IAAO,OAAA,MAAA;AAAA;AAEX;AAEO,SAAS,mBAAA,CACd,OAAsC,GAAA,EACtC,EAAA;AACA,EAAM,MAAA,IAAA,GAAO,aAAc,CAAA,OAAA,CAAQ,IAAI,CAAA;AACvC,EAAM,MAAA,QAAA,GAAW,OAAQ,CAAA,QAAA,IAAY,EAAC;AACtC,EAAM,MAAA,OAAA,GAAU,aAAc,CAAA,IAAA,EAAM,QAAQ,CAAA;AAC5C,EAAA,MAAM,UAAa,GAAA;AAAA,IACjB,GAAG,IAAK,CAAA,UAAA;AAAA,IACR,GAAG,OAAQ,CAAA;AAAA,GACb;AAEA,EAAA,OAAO,IAAI,aAAA;AAAA,IACT,gBAAgB,UAAY,EAAA,OAAA,CAAQ,OAAO,OAAQ,CAAA,KAAA,EAAO,QAAQ,KAAK,CAAA;AAAA,IACvE,OAAA,CAAQ,mBAAmB;AAAC,GAC9B;AACF;AAEO,SAAS,iBACd,IAAoB,GAAA;AAAA,EAClB,MAAQ,EAAA,UAAA;AAAA,EACR,OAAO;AACT,CACA,EAAA;AACA,EAAA,MAAM,QAAQ,CAAC,GAAI,IAAK,CAAA,KAAA,IAAS,EAAG,CAAA;AACpC,EAAM,MAAA,QAAA,GAAW,GAAG,IAAK,CAAA,MAAM,IAAI,KAAM,CAAA,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAClD,EAAM,MAAA,UAAA,GAAa,kBAAmB,CAAA,GAAA,CAAI,QAAQ,CAAA;AAElD,EAAA,IAAI,UAAY,EAAA;AACd,IAAO,OAAA,UAAA;AAAA;AAGT,EAAA,MAAM,OAAO,UAAW,CAAA;AAAA,IACtB,QAAQ,IAAK,CAAA,MAAA;AAAA,IACb;AAAA,GACD,CAAA;AAED,EAAA,MAAM,gBAAgB,mBAAoB,CAAA;AAAA,IACxC,IAAM,EAAA,IAAA;AAAA,IACN,UAAA,EAAY,wBAAyB,CAAA,IAAA,EAAM,QAAQ;AAAA,GACpD,CAAA;AAED,EAAmB,kBAAA,CAAA,GAAA,CAAI,UAAU,aAAa,CAAA;AAE9C,EAAO,OAAA,aAAA;AACT","file":"chunk-4NMXTZX4.mjs","sourcesContent":["import {\n CorrespondenceEdge,\n CorrespondenceMap,\n CorrespondenceMatch,\n CorrespondenceMetadata,\n CorrespondenceSource,\n CorrespondenceStep,\n TreeNote,\n TreeNoteTarget,\n TreeOverlay,\n TreeWorkspaceDescriptor,\n makeCorrespondenceId,\n} from \"./correspondence-model\";\nimport { createTree, TreeOptions } from \"./factory\";\nimport { TreeOfLife } from \"./tree-of-life\";\nimport { Node, NodeId, NodeType } from \"./types\";\n\nexport interface TreeCorrespondenceQueryOptions<T extends NodeType = NodeType> {\n type?: T | readonly T[];\n depth?: number;\n includeSelf?: boolean;\n limit?: number;\n}\n\nexport interface TreeFindNodesOptions<T extends NodeType = NodeType> {\n type?: T | readonly T[];\n ids?: readonly NodeId<T>[];\n search?: string;\n predicate?: (node: Node<T>) => boolean;\n}\n\nexport interface TreeVisualRequest {\n nodeId: NodeId<NodeType>;\n kind?: string;\n [key: string]: unknown;\n}\n\nexport interface TreeVisualResult {\n kind: string;\n nodeId: NodeId<NodeType>;\n [key: string]: unknown;\n}\n\nexport type TreeVisualResolver = (input: {\n request: TreeVisualRequest;\n workspace: TreeWorkspace;\n}) => TreeVisualResult | undefined;\n\nexport interface CreateTreeWorkspaceOptions {\n base?: TreeWorkspace | TreeOfLife;\n overlays?: TreeOverlay[];\n descriptor?: TreeWorkspaceDescriptor;\n visualResolvers?: TreeVisualResolver[];\n}\n\ntype TreeGraphData = {\n descriptor: TreeWorkspaceDescriptor;\n nodesById: Map<NodeId<NodeType>, Node<NodeType>>;\n nodeIdsByType: Map<NodeType, NodeId<NodeType>[]>;\n edgesById: Map<string, CorrespondenceEdge>;\n edgeIdsByNodeId: Map<NodeId<NodeType>, string[]>;\n notesById: Map<string, TreeNote>;\n noteIdsByNodeId: Map<NodeId<NodeType>, string[]>;\n noteIdsByCorrespondenceId: Map<string, string[]>;\n};\n\nfunction cloneNode<T extends NodeType>(node: Node<T>): Node<T> {\n return Object.freeze({\n id: node.id,\n type: node.type,\n name: node.name,\n data:\n node.data && typeof node.data === \"object\"\n ? ({ ...node.data } as Node<T>[\"data\"])\n : node.data,\n });\n}\n\nfunction cloneMetadata(metadata?: CorrespondenceMetadata) {\n if (!metadata) {\n return undefined;\n }\n\n return {\n ...metadata,\n tags: metadata.tags ? [...metadata.tags] : undefined,\n attributes: metadata.attributes ? { ...metadata.attributes } : undefined,\n };\n}\n\nfunction cloneSource(source: CorrespondenceSource): CorrespondenceSource {\n if (source.kind === \"bridge\") {\n return {\n ...source,\n parts: [...source.parts],\n };\n }\n\n return { ...source };\n}\n\nfunction cloneEdge(edge: CorrespondenceEdge): CorrespondenceEdge {\n return Object.freeze({\n ...edge,\n metadata: cloneMetadata(edge.metadata),\n sources: edge.sources.map(cloneSource),\n });\n}\n\nfunction cloneNote(note: TreeNote): TreeNote {\n return Object.freeze({\n ...note,\n target: { ...note.target },\n metadata: note.metadata ? { ...note.metadata } : undefined,\n });\n}\n\nfunction mergeMetadata(\n current?: CorrespondenceMetadata,\n next?: CorrespondenceMetadata\n) {\n if (!current) {\n return cloneMetadata(next);\n }\n\n if (!next) {\n return cloneMetadata(current);\n }\n\n return {\n ...current,\n ...next,\n tags: [...new Set([...(current.tags ?? []), ...(next.tags ?? [])])],\n attributes: {\n ...(current.attributes ?? {}),\n ...(next.attributes ?? {}),\n },\n };\n}\n\nfunction mergeSources(\n current: readonly CorrespondenceSource[],\n next: CorrespondenceSource\n) {\n const seen = new Set<string>();\n const merged: CorrespondenceSource[] = [];\n\n for (const source of [...current, next]) {\n const key = JSON.stringify(source);\n\n if (seen.has(key)) {\n continue;\n }\n\n seen.add(key);\n merged.push(cloneSource(source));\n }\n\n return merged;\n}\n\nfunction normalizeTypes<T extends NodeType>(\n type?: T | readonly T[]\n): Set<NodeType> | undefined {\n if (!type) {\n return undefined;\n }\n\n return new Set(Array.isArray(type) ? type : [type]);\n}\n\nfunction sortNodes<T extends NodeType>(nodes: Node<T>[]) {\n return [...nodes].sort((left, right) => {\n if (left.type !== right.type) {\n return left.type.localeCompare(right.type);\n }\n\n const leftLabel = String(left.name ?? left.id);\n const rightLabel = String(right.name ?? right.id);\n\n return leftLabel.localeCompare(rightLabel);\n });\n}\n\nfunction sortMatches<T extends NodeType>(matches: CorrespondenceMatch<T>[]) {\n return [...matches].sort((left, right) => {\n if (left.distance !== right.distance) {\n return left.distance - right.distance;\n }\n\n if (left.node.type !== right.node.type) {\n return left.node.type.localeCompare(right.node.type);\n }\n\n const leftLabel = String(left.node.name ?? left.node.id);\n const rightLabel = String(right.node.name ?? right.node.id);\n\n return leftLabel.localeCompare(rightLabel);\n });\n}\n\nfunction createGraphData(\n descriptor: TreeWorkspaceDescriptor,\n nodes: Iterable<Node<NodeType>>,\n edges: Iterable<CorrespondenceEdge>,\n notes: Iterable<TreeNote>\n): TreeGraphData {\n const nodesById = new Map<NodeId<NodeType>, Node<NodeType>>();\n const nodeIdsByType = new Map<NodeType, NodeId<NodeType>[]>();\n const edgesById = new Map<string, CorrespondenceEdge>();\n const edgeIdsByNodeId = new Map<NodeId<NodeType>, string[]>();\n const notesById = new Map<string, TreeNote>();\n const noteIdsByNodeId = new Map<NodeId<NodeType>, string[]>();\n const noteIdsByCorrespondenceId = new Map<string, string[]>();\n\n for (const node of nodes) {\n const clonedNode = cloneNode(node);\n\n nodesById.set(clonedNode.id, clonedNode);\n\n const typedIds = nodeIdsByType.get(clonedNode.type) ?? [];\n typedIds.push(clonedNode.id as NodeId<NodeType>);\n nodeIdsByType.set(clonedNode.type, typedIds);\n }\n\n for (const edge of edges) {\n const clonedEdge = cloneEdge(edge);\n\n edgesById.set(clonedEdge.id, clonedEdge);\n\n const leftEdges = edgeIdsByNodeId.get(clonedEdge.left) ?? [];\n leftEdges.push(clonedEdge.id);\n edgeIdsByNodeId.set(clonedEdge.left, leftEdges);\n\n const rightEdges = edgeIdsByNodeId.get(clonedEdge.right) ?? [];\n rightEdges.push(clonedEdge.id);\n edgeIdsByNodeId.set(clonedEdge.right, rightEdges);\n }\n\n for (const note of notes) {\n const clonedNote = cloneNote(note);\n notesById.set(clonedNote.id, clonedNote);\n\n if (clonedNote.target.kind === \"node\") {\n const nodeNoteIds = noteIdsByNodeId.get(clonedNote.target.nodeId) ?? [];\n nodeNoteIds.push(clonedNote.id);\n noteIdsByNodeId.set(clonedNote.target.nodeId, nodeNoteIds);\n continue;\n }\n\n const edgeId = makeCorrespondenceId(\n clonedNote.target.left,\n clonedNote.target.right\n );\n const correspondenceNoteIds =\n noteIdsByCorrespondenceId.get(edgeId) ?? [];\n correspondenceNoteIds.push(clonedNote.id);\n noteIdsByCorrespondenceId.set(edgeId, correspondenceNoteIds);\n }\n\n for (const ids of nodeIdsByType.values()) {\n ids.sort((left, right) => String(left).localeCompare(String(right)));\n }\n\n for (const ids of edgeIdsByNodeId.values()) {\n ids.sort((left, right) => left.localeCompare(right));\n }\n\n for (const ids of noteIdsByNodeId.values()) {\n ids.sort((left, right) => left.localeCompare(right));\n }\n\n for (const ids of noteIdsByCorrespondenceId.values()) {\n ids.sort((left, right) => left.localeCompare(right));\n }\n\n return {\n descriptor: Object.freeze({ ...descriptor }),\n nodesById,\n nodeIdsByType,\n edgesById,\n edgeIdsByNodeId,\n notesById,\n noteIdsByNodeId,\n noteIdsByCorrespondenceId,\n };\n}\n\nfunction normalizeBase(base?: TreeWorkspace | TreeOfLife) {\n if (!base) {\n return {\n descriptor: {},\n nodes: [] as Node<NodeType>[],\n edges: [] as CorrespondenceEdge[],\n notes: [] as TreeNote[],\n };\n }\n\n if (base instanceof TreeWorkspace) {\n return {\n descriptor: base.descriptor,\n nodes: base.getNodes(),\n edges: base.getEdges(),\n notes: base.getNotes(),\n };\n }\n\n return {\n descriptor: {\n system: base.activeSystem ?? undefined,\n parts: base.loadedParts.filter((part) => part !== \"base\"),\n },\n nodes: base.getNodes(),\n edges: base.getEdges(),\n notes: [] as TreeNote[],\n };\n}\n\nfunction applyOverlays(\n base: ReturnType<typeof normalizeBase>,\n overlays: TreeOverlay[]\n) {\n const nodesById = new Map<NodeId<NodeType>, Node<NodeType>>();\n const edgesById = new Map<string, CorrespondenceEdge>();\n const notes: TreeNote[] = [];\n\n for (const node of base.nodes) {\n nodesById.set(node.id as NodeId<NodeType>, cloneNode(node));\n }\n\n for (const edge of base.edges) {\n edgesById.set(edge.id, cloneEdge(edge));\n }\n\n for (const note of base.notes) {\n notes.push(cloneNote(note));\n }\n\n for (const overlay of overlays) {\n for (const node of overlay.nodes ?? []) {\n const existing = nodesById.get(node.id as NodeId<NodeType>);\n\n if (existing && existing.type !== node.type) {\n throw new Error(\n `Overlay ${overlay.id} tried to upsert ${node.id} with a different type`\n );\n }\n\n nodesById.set(\n node.id as NodeId<NodeType>,\n cloneNode(\n existing\n ? {\n ...existing,\n ...node,\n data: {\n ...(existing.data ?? {}),\n ...(node.data ?? {}),\n } as Node<NodeType>[\"data\"],\n }\n : node\n )\n );\n }\n\n for (const correspondence of overlay.correspondences ?? []) {\n if (\n !nodesById.has(correspondence.left) ||\n !nodesById.has(correspondence.right)\n ) {\n throw new Error(\n `Overlay ${overlay.id} references unknown nodes in ${correspondence.left} <-> ${correspondence.right}`\n );\n }\n\n const edgeId = makeCorrespondenceId(\n correspondence.left,\n correspondence.right\n );\n\n if (correspondence.op === \"remove\") {\n edgesById.delete(edgeId);\n continue;\n }\n\n const existingEdge = edgesById.get(edgeId);\n const overlaySource: CorrespondenceSource = {\n kind: \"overlay\",\n overlayId: overlay.id,\n label: overlay.name,\n };\n\n if (!existingEdge) {\n if (correspondence.op !== \"add\") {\n throw new Error(\n `Overlay ${overlay.id} cannot annotate missing correspondence ${edgeId}`\n );\n }\n\n edgesById.set(\n edgeId,\n cloneEdge({\n id: edgeId,\n left: correspondence.left,\n right: correspondence.right,\n metadata: cloneMetadata(correspondence.metadata),\n sources: [overlaySource],\n })\n );\n continue;\n }\n\n edgesById.set(\n edgeId,\n cloneEdge({\n ...existingEdge,\n metadata: mergeMetadata(existingEdge.metadata, correspondence.metadata),\n sources: mergeSources(existingEdge.sources, overlaySource),\n })\n );\n }\n\n for (const note of overlay.notes ?? []) {\n notes.push(\n cloneNote({\n ...note,\n metadata: note.metadata ? { ...note.metadata } : undefined,\n })\n );\n }\n }\n\n const filteredNotes = notes.filter((note) => {\n if (note.target.kind === \"node\") {\n return nodesById.has(note.target.nodeId);\n }\n\n return edgesById.has(\n makeCorrespondenceId(note.target.left, note.target.right)\n );\n });\n\n return {\n nodes: [...nodesById.values()],\n edges: [...edgesById.values()],\n notes: filteredNotes,\n };\n}\n\nfunction reconstructPath(\n startId: NodeId<NodeType>,\n targetId: NodeId<NodeType>,\n previous: Map<NodeId<NodeType>, { from: NodeId<NodeType>; edgeId: string }>,\n edgesById: Map<string, CorrespondenceEdge>\n) {\n const steps: CorrespondenceStep[] = [];\n let current = targetId;\n\n while (current !== startId) {\n const link = previous.get(current);\n\n if (!link) {\n break;\n }\n\n const edge = edgesById.get(link.edgeId);\n\n if (!edge) {\n break;\n }\n\n steps.push({\n from: link.from,\n to: current,\n edge,\n });\n current = link.from;\n }\n\n return steps.reverse();\n}\n\nfunction buildCanonicalDescriptor(opts: TreeOptions, cacheKey: string) {\n return {\n id: `canonical:${cacheKey}`,\n name: \"Canonical Tree\",\n system: opts.system,\n parts: [...(opts.parts ?? [])],\n cacheKey,\n } satisfies TreeWorkspaceDescriptor;\n}\n\nconst canonicalTreeCache = new Map<string, TreeWorkspace>();\n\nexport class TreeWorkspace {\n public readonly descriptor: TreeWorkspaceDescriptor;\n\n constructor(\n private readonly graph: TreeGraphData,\n private readonly visualResolvers: readonly TreeVisualResolver[] = []\n ) {\n this.descriptor = graph.descriptor;\n }\n\n getNode<T extends NodeType>(id: NodeId<T>) {\n return this.graph.nodesById.get(id as NodeId<NodeType>) as\n | Node<T>\n | undefined;\n }\n\n hasNode(id: NodeId<NodeType>) {\n return this.graph.nodesById.has(id);\n }\n\n getNodes<T extends NodeType>(type?: T): Node<T>[] {\n if (!type) {\n return sortNodes(\n [...this.graph.nodesById.values()] as Node<T>[]\n );\n }\n\n const ids = this.graph.nodeIdsByType.get(type) ?? [];\n\n return ids\n .map((id) => this.graph.nodesById.get(id) as Node<T> | undefined)\n .filter((node): node is Node<T> => Boolean(node));\n }\n\n findNodes<T extends NodeType = NodeType>(\n options: TreeFindNodesOptions<T> = {}\n ): Node<T>[] {\n const typeFilter = normalizeTypes(options.type);\n const search = options.search?.trim().toLowerCase();\n\n const candidates = options.ids\n ? options.ids\n .map((id) => this.graph.nodesById.get(id as NodeId<NodeType>))\n .filter((node): node is Node<NodeType> => Boolean(node))\n : typeFilter\n ? [...typeFilter].flatMap((type) => this.getNodes(type))\n : this.getNodes();\n\n return sortNodes(\n candidates.filter((node): node is Node<T> => {\n if (typeFilter && !typeFilter.has(node.type)) {\n return false;\n }\n\n if (search) {\n const haystacks = [\n String(node.id).toLowerCase(),\n String(node.name ?? \"\").toLowerCase(),\n ];\n\n if (!haystacks.some((value) => value.includes(search))) {\n return false;\n }\n }\n\n return options.predicate ? options.predicate(node as Node<T>) : true;\n })\n );\n }\n\n getEdge(left: NodeId<NodeType>, right: NodeId<NodeType>) {\n return this.graph.edgesById.get(makeCorrespondenceId(left, right));\n }\n\n getEdges(nodeId?: NodeId<NodeType>) {\n if (!nodeId) {\n return [...this.graph.edgesById.values()];\n }\n\n return (this.graph.edgeIdsByNodeId.get(nodeId) ?? [])\n .map((edgeId) => this.graph.edgesById.get(edgeId))\n .filter((edge): edge is CorrespondenceEdge => Boolean(edge));\n }\n\n getNotes(target?: TreeNoteTarget) {\n if (!target) {\n return [...this.graph.notesById.values()];\n }\n\n if (target.kind === \"node\") {\n return (this.graph.noteIdsByNodeId.get(target.nodeId) ?? [])\n .map((noteId) => this.graph.notesById.get(noteId))\n .filter((note): note is TreeNote => Boolean(note));\n }\n\n const edgeId = makeCorrespondenceId(target.left, target.right);\n\n return (this.graph.noteIdsByCorrespondenceId.get(edgeId) ?? [])\n .map((noteId) => this.graph.notesById.get(noteId))\n .filter((note): note is TreeNote => Boolean(note));\n }\n\n getCorrespondences<T extends NodeType, U extends NodeType = NodeType>(\n nodeId: NodeId<T>,\n options: TreeCorrespondenceQueryOptions<U> = {}\n ): CorrespondenceMatch<U>[] {\n if (!this.graph.nodesById.has(nodeId as NodeId<NodeType>)) {\n return [];\n }\n\n const typeFilter = normalizeTypes(options.type);\n const includeSelf = options.includeSelf ?? false;\n const depth = Math.max(1, options.depth ?? 1);\n const limit = options.limit ?? Infinity;\n\n const previous = new Map<\n NodeId<NodeType>,\n { from: NodeId<NodeType>; edgeId: string }\n >();\n const visited = new Set<NodeId<NodeType>>([nodeId as NodeId<NodeType>]);\n const queue: Array<{ nodeId: NodeId<NodeType>; distance: number }> = [\n {\n nodeId: nodeId as NodeId<NodeType>,\n distance: 0,\n },\n ];\n const matches: CorrespondenceMatch<NodeType>[] = [];\n\n while (queue.length > 0 && matches.length < limit) {\n const current = queue.shift()!;\n\n if (current.distance >= depth) {\n continue;\n }\n\n for (const edgeId of this.graph.edgeIdsByNodeId.get(current.nodeId) ?? []) {\n const edge = this.graph.edgesById.get(edgeId);\n\n if (!edge) {\n continue;\n }\n\n const nextNodeId =\n edge.left === current.nodeId ? edge.right : edge.left;\n\n if (visited.has(nextNodeId)) {\n continue;\n }\n\n visited.add(nextNodeId);\n previous.set(nextNodeId, {\n from: current.nodeId,\n edgeId,\n });\n\n const distance = current.distance + 1;\n const nextNode = this.graph.nodesById.get(nextNodeId);\n\n if (!nextNode) {\n continue;\n }\n\n if ((!typeFilter || typeFilter.has(nextNode.type)) && distance > 0) {\n matches.push({\n node: nextNode,\n distance,\n path: reconstructPath(\n nodeId as NodeId<NodeType>,\n nextNodeId,\n previous,\n this.graph.edgesById\n ),\n });\n }\n\n queue.push({\n nodeId: nextNodeId,\n distance,\n });\n }\n }\n\n if (includeSelf) {\n const sourceNode = this.graph.nodesById.get(nodeId as NodeId<NodeType>);\n\n if (\n sourceNode &&\n (!typeFilter || typeFilter.has(sourceNode.type)) &&\n matches.length < limit\n ) {\n matches.unshift({\n node: sourceNode as Node<U>,\n distance: 0,\n path: [],\n });\n }\n }\n\n return sortMatches(matches as CorrespondenceMatch<U>[]).slice(0, limit);\n }\n\n getCorrespondenceMap<T extends NodeType>(\n nodeId: NodeId<T>,\n options: Omit<TreeCorrespondenceQueryOptions, \"type\"> = {}\n ): CorrespondenceMap {\n const grouped: Record<string, CorrespondenceMatch[]> = {};\n\n for (const match of this.getCorrespondences(nodeId, options)) {\n const typeKey = match.node.type;\n const typeMatches = grouped[typeKey] ?? [];\n typeMatches.push(match as CorrespondenceMatch);\n grouped[typeKey] = typeMatches;\n }\n\n return grouped as CorrespondenceMap;\n }\n\n resolveVisual(request: TreeVisualRequest) {\n for (const resolver of this.visualResolvers) {\n const resolved = resolver({\n request,\n workspace: this,\n });\n\n if (resolved) {\n return resolved;\n }\n }\n\n return undefined;\n }\n}\n\nexport function createTreeWorkspace(\n options: CreateTreeWorkspaceOptions = {}\n) {\n const base = normalizeBase(options.base);\n const overlays = options.overlays ?? [];\n const applied = applyOverlays(base, overlays);\n const descriptor = {\n ...base.descriptor,\n ...options.descriptor,\n };\n\n return new TreeWorkspace(\n createGraphData(descriptor, applied.nodes, applied.edges, applied.notes),\n options.visualResolvers ?? []\n );\n}\n\nexport function getCanonicalTree(\n opts: TreeOptions = {\n system: \"kaabalah\",\n parts: [],\n }\n) {\n const parts = [...(opts.parts ?? [])];\n const cacheKey = `${opts.system}:${parts.join(\",\")}`;\n const cachedTree = canonicalTreeCache.get(cacheKey);\n\n if (cachedTree) {\n return cachedTree;\n }\n\n const tree = createTree({\n system: opts.system,\n parts,\n });\n\n const canonicalTree = createTreeWorkspace({\n base: tree,\n descriptor: buildCanonicalDescriptor(opts, cacheKey),\n });\n\n canonicalTreeCache.set(cacheKey, canonicalTree);\n\n return canonicalTree;\n}\n"]}