kaabalah 6.2.4 → 6.4.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 (62) hide show
  1. package/README.md +71 -0
  2. package/dist/{chunk-S4EJ3ZY7.mjs → chunk-6P2CJUTH.mjs} +3 -3
  3. package/dist/{chunk-S4EJ3ZY7.mjs.map → chunk-6P2CJUTH.mjs.map} +1 -1
  4. package/dist/chunk-7WG6PUEN.js +1741 -0
  5. package/dist/chunk-7WG6PUEN.js.map +1 -0
  6. package/dist/{chunk-O3ZBG566.js → chunk-COPYH3O2.js} +23 -23
  7. package/dist/{chunk-O3ZBG566.js.map → chunk-COPYH3O2.js.map} +1 -1
  8. package/dist/{chunk-RZBVUDBM.mjs → chunk-EFZUZI22.mjs} +81 -73
  9. package/dist/chunk-EFZUZI22.mjs.map +1 -0
  10. package/dist/chunk-EMMXVM35.mjs +511 -0
  11. package/dist/chunk-EMMXVM35.mjs.map +1 -0
  12. package/dist/{chunk-2RGUI5FG.mjs → chunk-MTI2SOQ6.mjs} +4 -4
  13. package/dist/{chunk-2RGUI5FG.mjs.map → chunk-MTI2SOQ6.mjs.map} +1 -1
  14. package/dist/{chunk-TMN4PYVG.js → chunk-OKZUVGA3.js} +9 -9
  15. package/dist/{chunk-TMN4PYVG.js.map → chunk-OKZUVGA3.js.map} +1 -1
  16. package/dist/{chunk-Y4PTMABP.js → chunk-PAKYKIZH.js} +4 -4
  17. package/dist/{chunk-Y4PTMABP.js.map → chunk-PAKYKIZH.js.map} +1 -1
  18. package/dist/chunk-PBPYXWX4.mjs +1721 -0
  19. package/dist/chunk-PBPYXWX4.mjs.map +1 -0
  20. package/dist/{chunk-HAMDOCS5.js → chunk-S6KNERP7.js} +81 -73
  21. package/dist/chunk-S6KNERP7.js.map +1 -0
  22. package/dist/chunk-WGYXJEG5.js +518 -0
  23. package/dist/chunk-WGYXJEG5.js.map +1 -0
  24. package/dist/{chunk-G76K6OVQ.mjs → chunk-WIKUOEOB.mjs} +3 -3
  25. package/dist/{chunk-G76K6OVQ.mjs.map → chunk-WIKUOEOB.mjs.map} +1 -1
  26. package/dist/{chunk-WSSELKIB.js → chunk-XTE5DSDO.js} +23 -23
  27. package/dist/{chunk-WSSELKIB.js.map → chunk-XTE5DSDO.js.map} +1 -1
  28. package/dist/{chunk-NBP75BAH.mjs → chunk-ZKIJAZ6B.mjs} +3 -3
  29. package/dist/{chunk-NBP75BAH.mjs.map → chunk-ZKIJAZ6B.mjs.map} +1 -1
  30. package/dist/cli.js +954 -104
  31. package/dist/cli.js.map +1 -1
  32. package/dist/core/index.js +43 -43
  33. package/dist/core/index.mjs +2 -2
  34. package/dist/gematria/index.js +5 -5
  35. package/dist/gematria/index.mjs +2 -2
  36. package/dist/index.d.mts +2 -1
  37. package/dist/index.d.ts +2 -1
  38. package/dist/index.js +191 -114
  39. package/dist/index.mjs +8 -7
  40. package/dist/numerology/index.js +18 -18
  41. package/dist/numerology/index.mjs +3 -3
  42. package/dist/semantic/index.d.mts +150 -2
  43. package/dist/semantic/index.d.ts +150 -2
  44. package/dist/semantic/index.js +65 -10
  45. package/dist/semantic/index.mjs +7 -4
  46. package/dist/tarot/index.js +23 -23
  47. package/dist/tarot/index.mjs +3 -3
  48. package/dist/visual/index.d.mts +64 -0
  49. package/dist/visual/index.d.ts +64 -0
  50. package/dist/visual/index.js +35 -0
  51. package/dist/visual/index.js.map +1 -0
  52. package/dist/visual/index.mjs +6 -0
  53. package/dist/visual/index.mjs.map +1 -0
  54. package/dist/webassembly.md +127 -0
  55. package/package.json +6 -1
  56. package/wasm/build/webassembly.md +127 -0
  57. package/dist/chunk-3KJSW6ZP.js +0 -850
  58. package/dist/chunk-3KJSW6ZP.js.map +0 -1
  59. package/dist/chunk-HAMDOCS5.js.map +0 -1
  60. package/dist/chunk-RWX6HFS5.mjs +0 -843
  61. package/dist/chunk-RWX6HFS5.mjs.map +0 -1
  62. package/dist/chunk-RZBVUDBM.mjs.map +0 -1
@@ -1,6 +1,6 @@
1
1
  'use strict';
2
2
 
3
- var chunkHAMDOCS5_js = require('./chunk-HAMDOCS5.js');
3
+ var chunkS6KNERP7_js = require('./chunk-S6KNERP7.js');
4
4
 
5
5
  // src/core/workspace.ts
6
6
  function cloneNode(node) {
@@ -137,7 +137,7 @@ function createGraphData(descriptor, nodes, edges, notes) {
137
137
  noteIdsByNodeId.set(clonedNote.target.nodeId, nodeNoteIds);
138
138
  continue;
139
139
  }
140
- const edgeId = chunkHAMDOCS5_js.makeCorrespondenceId(
140
+ const edgeId = chunkS6KNERP7_js.makeCorrespondenceId(
141
141
  clonedNote.target.left,
142
142
  clonedNote.target.right
143
143
  );
@@ -236,7 +236,7 @@ function applyOverlays(base, overlays) {
236
236
  `Overlay ${overlay.id} references unknown nodes in ${correspondence.left} <-> ${correspondence.right}`
237
237
  );
238
238
  }
239
- const edgeId = chunkHAMDOCS5_js.makeCorrespondenceId(
239
+ const edgeId = chunkS6KNERP7_js.makeCorrespondenceId(
240
240
  correspondence.left,
241
241
  correspondence.right
242
242
  );
@@ -291,7 +291,7 @@ function applyOverlays(base, overlays) {
291
291
  return nodesById.has(note.target.nodeId);
292
292
  }
293
293
  return edgesById.has(
294
- chunkHAMDOCS5_js.makeCorrespondenceId(note.target.left, note.target.right)
294
+ chunkS6KNERP7_js.makeCorrespondenceId(note.target.left, note.target.right)
295
295
  );
296
296
  });
297
297
  return {
@@ -375,7 +375,7 @@ var TreeWorkspace = class {
375
375
  );
376
376
  }
377
377
  getEdge(left, right) {
378
- return this.graph.edgesById.get(chunkHAMDOCS5_js.makeCorrespondenceId(left, right));
378
+ return this.graph.edgesById.get(chunkS6KNERP7_js.makeCorrespondenceId(left, right));
379
379
  }
380
380
  getEdges(nodeId) {
381
381
  if (!nodeId) {
@@ -390,7 +390,7 @@ var TreeWorkspace = class {
390
390
  if (target.kind === "node") {
391
391
  return (this.graph.noteIdsByNodeId.get(target.nodeId) ?? []).map((noteId) => this.graph.notesById.get(noteId)).filter((note) => Boolean(note));
392
392
  }
393
- const edgeId = chunkHAMDOCS5_js.makeCorrespondenceId(target.left, target.right);
393
+ const edgeId = chunkS6KNERP7_js.makeCorrespondenceId(target.left, target.right);
394
394
  return (this.graph.noteIdsByCorrespondenceId.get(edgeId) ?? []).map((noteId) => this.graph.notesById.get(noteId)).filter((note) => Boolean(note));
395
395
  }
396
396
  getCorrespondences(nodeId, options = {}) {
@@ -510,7 +510,7 @@ function getCanonicalTree(opts = {
510
510
  if (cachedTree) {
511
511
  return cachedTree;
512
512
  }
513
- const tree = chunkHAMDOCS5_js.createTree({
513
+ const tree = chunkS6KNERP7_js.createTree({
514
514
  system: opts.system,
515
515
  parts
516
516
  });
@@ -525,5 +525,5 @@ function getCanonicalTree(opts = {
525
525
  exports.TreeWorkspace = TreeWorkspace;
526
526
  exports.createTreeWorkspace = createTreeWorkspace;
527
527
  exports.getCanonicalTree = getCanonicalTree;
528
- //# sourceMappingURL=chunk-TMN4PYVG.js.map
529
- //# sourceMappingURL=chunk-TMN4PYVG.js.map
528
+ //# sourceMappingURL=chunk-OKZUVGA3.js.map
529
+ //# sourceMappingURL=chunk-OKZUVGA3.js.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/core/workspace.ts"],"names":["makeCorrespondenceId","createTree"],"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,GAAAA,qCAAA;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,GAAAA,qCAAA;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,MACfA,sCAAqB,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,IAAIA,qCAAqB,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,GAAAA,qCAAA,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,OAAOC,2BAAW,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-TMN4PYVG.js","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"]}
1
+ {"version":3,"sources":["../src/core/workspace.ts"],"names":["makeCorrespondenceId","createTree"],"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,GAAAA,qCAAA;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,GAAAA,qCAAA;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,MACfA,sCAAqB,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,IAAIA,qCAAqB,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,GAAAA,qCAAA,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,OAAOC,2BAAW,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-OKZUVGA3.js","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"]}
@@ -1,6 +1,6 @@
1
1
  'use strict';
2
2
 
3
- var chunkO3ZBG566_js = require('./chunk-O3ZBG566.js');
3
+ var chunkCOPYH3O2_js = require('./chunk-COPYH3O2.js');
4
4
  var chunkFM7WUVZV_js = require('./chunk-FM7WUVZV.js');
5
5
 
6
6
  // src/numerology/data.ts
@@ -704,7 +704,7 @@ function calculateFibonacciCycle(birthDate, today) {
704
704
  };
705
705
  }
706
706
  function calculateSoulNumber(firstName) {
707
- const vowels = chunkO3ZBG566_js.calculateGematria(firstName).vowels;
707
+ const vowels = chunkCOPYH3O2_js.calculateGematria(firstName).vowels;
708
708
  return {
709
709
  reducedValue: vowels.finalValue,
710
710
  reductionSteps: vowels.reductionSteps
@@ -834,5 +834,5 @@ exports.getDateEnergies = getDateEnergies;
834
834
  exports.isMasterNumber = isMasterNumber;
835
835
  exports.reduceToSingle = reduceToSingle;
836
836
  exports.reduceToSingleWithSteps = reduceToSingleWithSteps;
837
- //# sourceMappingURL=chunk-Y4PTMABP.js.map
838
- //# sourceMappingURL=chunk-Y4PTMABP.js.map
837
+ //# sourceMappingURL=chunk-PAKYKIZH.js.map
838
+ //# sourceMappingURL=chunk-PAKYKIZH.js.map