@niscorp/loom 0.2.2 → 0.3.1

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 (78) hide show
  1. package/CHANGELOG.md +77 -0
  2. package/DESIGN.md +33 -6
  3. package/README.md +24 -3
  4. package/dist/{chunk-D743DI5J.js → chunk-27OMOR7I.js} +2 -2
  5. package/dist/chunk-27OMOR7I.js.map +1 -0
  6. package/dist/{chunk-PTXRAWJX.js → chunk-67D727GH.js} +2 -13
  7. package/dist/chunk-67D727GH.js.map +1 -0
  8. package/dist/{chunk-MIRMQPUE.js → chunk-BU5TULRP.js} +3 -3
  9. package/dist/chunk-BU5TULRP.js.map +1 -0
  10. package/dist/{chunk-TV4U22MY.js → chunk-DEZGKUTO.js} +4 -10
  11. package/dist/chunk-DEZGKUTO.js.map +1 -0
  12. package/dist/{chunk-DWQWPBBV.js → chunk-HHPSU7IA.js} +4 -8
  13. package/dist/chunk-HHPSU7IA.js.map +1 -0
  14. package/dist/{chunk-TCCN6LKV.js → chunk-IQMWPPHW.js} +4 -14
  15. package/dist/chunk-IQMWPPHW.js.map +1 -0
  16. package/dist/{chunk-A3UOFGL4.js → chunk-LVDY6FUH.js} +3 -3
  17. package/dist/chunk-LVDY6FUH.js.map +1 -0
  18. package/dist/{chunk-IZ5B6IMX.js → chunk-OFKHIREC.js} +5 -5
  19. package/dist/chunk-OFKHIREC.js.map +1 -0
  20. package/dist/{chunk-XTY7XO5C.js → chunk-VMOYMYMV.js} +3 -8
  21. package/dist/chunk-VMOYMYMV.js.map +1 -0
  22. package/dist/index.cjs +2 -29
  23. package/dist/index.cjs.map +1 -1
  24. package/dist/index.d.cts +2 -2
  25. package/dist/index.d.ts +2 -2
  26. package/dist/index.js +4 -4
  27. package/dist/{loom-editor-Clohg49u.d.ts → loom-editor-BthwIGIZ.d.cts} +1 -4
  28. package/dist/{loom-editor-MACwUjLC.d.cts → loom-editor-CHtjjiBp.d.ts} +1 -4
  29. package/dist/plugins/nova/index.cjs +0 -4
  30. package/dist/plugins/nova/index.cjs.map +1 -1
  31. package/dist/plugins/nova/index.d.cts +1 -1
  32. package/dist/plugins/nova/index.d.ts +1 -1
  33. package/dist/plugins/nova/index.js +3 -3
  34. package/dist/plugins/nova/react/index.cjs +0 -4
  35. package/dist/plugins/nova/react/index.cjs.map +1 -1
  36. package/dist/plugins/nova/react/index.d.cts +2 -2
  37. package/dist/plugins/nova/react/index.d.ts +2 -2
  38. package/dist/plugins/nova/react/index.js +3 -3
  39. package/dist/plugins/nova/react/index.js.map +1 -1
  40. package/dist/plugins/prism/index.cjs.map +1 -1
  41. package/dist/plugins/prism/index.d.cts +1 -3
  42. package/dist/plugins/prism/index.d.ts +1 -3
  43. package/dist/plugins/prism/index.js +2 -2
  44. package/dist/plugins/prism/react/index.cjs +8 -16
  45. package/dist/plugins/prism/react/index.cjs.map +1 -1
  46. package/dist/plugins/prism/react/index.d.cts +2 -2
  47. package/dist/plugins/prism/react/index.d.ts +2 -2
  48. package/dist/plugins/prism/react/index.js +10 -12
  49. package/dist/plugins/prism/react/index.js.map +1 -1
  50. package/dist/plugins/vex/index.cjs +0 -5
  51. package/dist/plugins/vex/index.cjs.map +1 -1
  52. package/dist/plugins/vex/index.d.cts +1 -5
  53. package/dist/plugins/vex/index.d.ts +1 -5
  54. package/dist/plugins/vex/index.js +2 -2
  55. package/dist/plugins/vex/react/index.cjs +0 -5
  56. package/dist/plugins/vex/react/index.cjs.map +1 -1
  57. package/dist/plugins/vex/react/index.d.cts +2 -2
  58. package/dist/plugins/vex/react/index.d.ts +2 -2
  59. package/dist/plugins/vex/react/index.js +6 -6
  60. package/dist/plugins/vex/react/index.js.map +1 -1
  61. package/dist/react/index.cjs +2 -29
  62. package/dist/react/index.cjs.map +1 -1
  63. package/dist/react/index.d.cts +3 -3
  64. package/dist/react/index.d.ts +3 -3
  65. package/dist/react/index.js +7 -7
  66. package/dist/react/index.js.map +1 -1
  67. package/dist/{types-l8sDxrMR.d.cts → types-V5kJWZJn.d.cts} +2 -27
  68. package/dist/{types-l8sDxrMR.d.ts → types-V5kJWZJn.d.ts} +2 -27
  69. package/package.json +7 -7
  70. package/dist/chunk-A3UOFGL4.js.map +0 -1
  71. package/dist/chunk-D743DI5J.js.map +0 -1
  72. package/dist/chunk-DWQWPBBV.js.map +0 -1
  73. package/dist/chunk-IZ5B6IMX.js.map +0 -1
  74. package/dist/chunk-MIRMQPUE.js.map +0 -1
  75. package/dist/chunk-PTXRAWJX.js.map +0 -1
  76. package/dist/chunk-TCCN6LKV.js.map +0 -1
  77. package/dist/chunk-TV4U22MY.js.map +0 -1
  78. package/dist/chunk-XTY7XO5C.js.map +0 -1
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/compile/parse.ts"],"names":[],"mappings":";AA6CA,IAAM,KAAA,GAAQ,CAAC,MAAA,KAA4B,MAAA,CAAO,GAAA;AAalD,IAAM,cAAA,GAAiB,SAAA;AAEvB,IAAM,YAAA,GAAe,CAAC,MAAA,KAAwC;AAC5D,EAAA,MAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AACxB,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,MAAA,EAAW,OAAO,GAAA,CAAI,MAAA;AACzC,EAAA,KAAA,MAAW,KAAA,IAAS,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG;AACpC,IAAA,IAAI,MAAM,GAAA,EAAK,MAAA,KAAW,MAAA,EAAW,OAAO,MAAM,GAAA,CAAI,MAAA;AAAA,EACxD;AACA,EAAA,OAAO,MAAA;AACT,CAAA;AAEA,IAAM,SAAA,GAAY,CAAC,MAAA,KAA6B;AAC9C,EAAA,MAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AACxB,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,cAAA,EAAgB,OAAO,IAAA;AAC1C,EAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,IAAU,EAAC,EAAG,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,GAAA,EAAK,MAAA,KAAW,cAAc,CAAA;AAChF,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,MAAA,KACnB,MAAA,CAAO,OAAO,KAAA,CAAM,MAAM,EAAE,OAAA,IAAW,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,KAAA,MAAW,EAAE,OAAO,KAAA,EAAO,MAAA,CAAO,KAAK,CAAA,EAAE,CAAE,CAAA;AAE7F,IAAM,eAAe,CAAC,MAAA,EAAiB,SACrC,MAAA,CAAO,OAAA,CAAQ,MAAM,MAAM,CAAA,CAAE,KAAA,IAAS,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,MAAO;AAAA,EAC/D,GAAA;AAAA;AAAA;AAAA,EAGA,QAAA,EAAU,CAAC,KAAA,CAAM,SAAA,CAAU,MAAS,CAAA,CAAE,OAAA;AAAA,EACtC,KAAA,EAAO,UAAA,CAAW,KAAA,EAAO,IAAI;AAC/B,CAAA,CAAE,CAAA;AAQJ,IAAM,UAAA,GAAa,CAAC,MAAA,KAA8B,MAAA,CAAO,IAAA,CAAK,MAAM,MAAM,CAAA,CAAE,KAAA,IAAS,EAAE,CAAA;AAIvF,IAAM,UAAA,mBAAa,IAAI,GAAA,CAAI,CAAC,QAAA,EAAU,UAAU,SAAA,EAAW,QAAA,EAAU,OAAA,EAAS,MAAM,CAAC,CAAA;AACrF,IAAM,QAAA,GAAW,CAAC,MAAA,KAAwC;AACxD,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,MAAM,CAAA,CAAE,IAAA;AAC3B,EAAA,OAAO,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA,GAAI,IAAA,GAAO,MAAA;AACvC,CAAA;AAEA,IAAM,WAAA,GAAc,CAAC,MAAA,EAAiB,QAAA,EAA8B,GAAA,KAAiD;AACnH,EAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,IAAA,MAAM,WAAW,KAAA,CAAM,MAAM,EAAE,KAAA,IAAS,IAAI,GAAG,CAAA;AAC/C,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,KAAK,KAAA,EAAO,OAAA,KAAY,MAAA,GAAY,KAAA,CAAM,OAAO,CAAA,CAAE,MAAA,GAAS,CAAC,IAAI,MAAA,EAAU;AAAA,EACxG;AACA,EAAA,MAAM,YAAY,IAAI,GAAA,CAAI,QAAA,CAAS,OAAA,CAAQ,UAAU,CAAC,CAAA;AACtD,EAAA,MAAM,GAAA,GAAM,UAAA,CAAW,MAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,SAAA,CAAU,GAAA,CAAI,CAAC,CAAC,CAAA;AAC5D,EAAA,IAAI,QAAQ,MAAA,EAAW,OAAO,EAAE,IAAA,EAAM,OAAO,GAAA,EAAI;AACjD,EAAA,MAAM,IAAA,GAAO,SAAS,MAAM,CAAA;AAC5B,EAAA,IAAI,IAAA,KAAS,MAAA,IAAa,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA,CAAS,CAAC,CAAA,KAAM,IAAI,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,QAAQ,IAAA,EAAK;AACnG,EAAA,OAAO,MAAA;AACT,CAAA;AAEA,IAAM,eAAe,CAAC,OAAA,KACpB,QAAQ,IAAA,KAAS,KAAA,GACb,OAAO,OAAA,CAAQ,KAAK,IACpB,OAAA,CAAQ,IAAA,KAAS,QACf,OAAA,CAAQ,GAAA,GACR,QAAQ,IAAA,KAAS,MAAA,GACf,QAAQ,IAAA,GACR,OAAA;AASV,IAAM,eAAA,GAAkB,CAAC,QAAA,EAA8B,IAAA,mBAAoB,IAAI,KAAI,KACjF,QAAA,CAAS,OAAA,CAAQ,CAAC,MAAA,KAAW;AAC3B,EAAA,MAAM,EAAE,IAAA,EAAK,GAAI,MAAA,CAAO,MAAM,CAAA;AAC9B,EAAA,MAAM,GAAA,GAAM,MAAM,IAAI,CAAA;AACtB,EAAA,IAAI,GAAA,CAAI,SAAS,OAAA,IAAW,IAAA,CAAK,IAAI,GAAG,CAAA,EAAG,OAAO,CAAC,MAAM,CAAA;AACzD,EAAA,OAAO,eAAA,CAAgB,GAAA,CAAI,OAAA,IAAW,EAAC,EAAG,IAAI,GAAA,CAAI,IAAI,CAAA,CAAE,GAAA,CAAI,GAAG,CAAC,CAAA;AAClE,CAAC,CAAA;AAKH,IAAM,WAAA,GAAc,CAAC,MAAA,EAAiB,IAAA,EAAY,GAAA,KAChD,QAAQ,MAAA,GACJ,UAAA,CAAW,MAAA,EAAQ,IAAI,CAAA,GACvB,EAAE,MAAM,QAAA,EAAU,MAAA,EAAQ,YAAA,CAAa,MAAA,EAAQ,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,GAAA,KAAQ,GAAG,CAAA,EAAE;AAExF,IAAM,WAAA,GAAsE;AAAA,EAC1E,MAAA,EAAQ,CAAC,MAAA,KAAW;AAClB,IAAA,MAAM,MAAA,GAAS,aAAa,MAAM,CAAA;AAClC,IAAA,OAAO,MAAA,KAAW,SAAY,EAAE,IAAA,EAAM,UAAU,MAAA,EAAO,GAAI,EAAE,IAAA,EAAM,QAAA,EAAS;AAAA,EAC9E,CAAA;AAAA,EACA,MAAA,EAAQ,CAAC,MAAA,KAAY,SAAA,CAAU,MAAM,CAAA,GAAI,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,IAAA,EAAK,GAAI,EAAE,MAAM,QAAA,EAAS;AAAA,EAC9F,OAAA,EAAS,OAAO,EAAE,IAAA,EAAM,SAAA,EAAU,CAAA;AAAA,EAClC,IAAA,EAAM,CAAC,MAAA,MAAY,EAAE,MAAM,MAAA,EAAQ,OAAA,EAAS,WAAA,CAAY,MAAM,CAAA,EAAE,CAAA;AAAA,EAChE,MAAA,EAAQ,CAAC,MAAA,EAAQ,IAAA,KAAS;AAGxB,IAAA,MAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AACxB,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,GAAG,CAAA;AAClB,IAAA,MAAM,MAAA,GAAS,YAAA,CAAa,MAAA,EAAQ,IAAI,CAAA;AACxC,IAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,WAAW,IAAA,EAAK,GAAI,EAAE,IAAA,EAAM,UAAU,MAAA,EAAO;AAAA,EACxG,CAAA;AAAA,EACA,KAAA,EAAO,CAAC,MAAA,EAAQ,IAAA,KAAS;AACvB,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,MAAM,CAAA,CAAE,OAAA;AAC9B,IAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,OAAA,KAAY,MAAA,GAAY,UAAA,CAAW,OAAA,EAAS,IAAI,CAAA,GAAI,EAAE,IAAA,EAAM,WAAU,EAAE;AAAA,EACxG,CAAA;AAAA,EACA,KAAA,EAAO,CAAC,MAAA,EAAQ,IAAA,MAAU,EAAE,IAAA,EAAM,OAAA,EAAS,QAAQ,KAAA,CAAM,MAAM,EAAE,KAAA,IAAS,IAAI,GAAA,CAAI,CAAC,SAAS,UAAA,CAAW,IAAA,EAAM,IAAI,CAAC,CAAA,EAAE,CAAA;AAAA,EACpH,KAAA,EAAO,CAAC,MAAA,EAAQ,IAAA,KAAS;AAIvB,IAAA,MAAM,QAAA,GAAW,CAAC,GAAG,IAAI,GAAA,CAAI,eAAA,CAAgB,KAAA,CAAM,MAAM,CAAA,CAAE,OAAA,IAAW,EAAE,CAAC,CAAC,CAAA;AAC1E,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,MAAM,CAAA,CAAE,aAAA;AAE1B,IAAA,MAAM,QAAA,GAAW,QAAA,CAAS,GAAA,CAAI,CAAC,MAAM,WAAA,CAAY,CAAA,EAAG,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,KAAM,CAAC,CAAA,EAAG,GAAG,CAAC,CAAA;AAKzF,IAAA,MAAM,OAAO,QAAA,CAAS,MAAA,CAAiB,CAAC,GAAA,EAAK,GAAG,CAAA,KAAO,CAAA,KAAM,MAAA,GAAY,CAAC,GAAG,GAAA,EAAK,CAAC,CAAA,GAAI,GAAA,EAAM,EAAE,CAAA;AAC/F,IAAA,IAAI,QAAA,CAAS,WAAW,CAAA,IAAK,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,SAAA,EAAU;AACvE,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,QAAA,CAAS,IAAA,CAAK,CAAC,CAAE,CAAA,GAAI,EAAE,IAAA,EAAM,UAAA,EAAW;AAG/D,IAAA,MAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AACxB,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,GAAG,CAAA;AAClB,IAAA,MAAM,QAAA,GAAsB,QAAA,CAAS,GAAA,CAAI,CAAC,QAAQ,CAAA,MAAO;AAAA,MACvD,KAAA,EAAO,SAAS,MAAM,CAAA,CAAE,SAAS,YAAA,CAAa,QAAA,CAAS,CAAC,CAAE,CAAA;AAAA,MAC1D,KAAA,EAAO,WAAA,CAAY,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA;AAAA,MACpC,OAAA,EAAS,SAAS,CAAC;AAAA,KACrB,CAAE,CAAA;AACF,IAAA,IAAA,CAAK,KAAA,CAAM,OAAO,GAAG,CAAA;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,EAAE,IAAA,EAAM,OAAA,EAAS,QAAA,EAAU,WAAW,IAAA,EAAK,GAAI,EAAE,IAAA,EAAM,SAAS,QAAA,EAAS;AAAA,EAC1G;AACF,CAAA;AAEA,IAAM,YAAA,GAAe,OAAc,EAAE,IAAA,EAAM,SAAA,EAAU,CAAA;AAMrD,IAAM,QAAA,uBAAe,GAAA,CAAI,CAAC,YAAY,UAAA,EAAY,SAAA,EAAW,UAAU,CAAC,CAAA;AAQxE,IAAM,YAAA,uBAAmB,OAAA,EAAyB;AAClD,IAAM,WAAA,GAAc,CAAC,IAAA,KAAuC;AAC1D,EAAA,MAAM,GAAA,GAAM,MAAM,IAAI,CAAA;AACtB,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,GAAA,CAAI,GAAG,CAAA;AACnC,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,MAAM,QAAA,GAAW,IAAI,MAAA,IAAS;AAC9B,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,YAAA,CAAa,GAAA,CAAI,KAAK,QAAQ,CAAA;AAC1D,EAAA,OAAO,QAAA;AACT,CAAA;AAEA,IAAM,MAAA,GAAS,CAAC,MAAA,KAA0D;AACxE,EAAA,IAAI,IAAA,GAAO,MAAA;AACX,EAAA,IAAI,QAAA;AACJ,EAAA,IAAI,GAAA,GAAM,MAAM,IAAI,CAAA;AACpB,EAAA,OAAO,SAAS,GAAA,CAAI,GAAA,CAAI,IAAI,CAAA,IAAK,GAAA,CAAI,SAAS,MAAA,EAAQ;AAGpD,IAAA,MAAM,QAAQ,GAAA,CAAI,IAAA,KAAS,SAAS,WAAA,CAAY,IAAI,IAAI,GAAA,CAAI,SAAA;AAC5D,IAAA,IAAI,UAAU,MAAA,EAAW;AACzB,IAAA,IAAI,cAAA,IAAkB,GAAA,EAAK,QAAA,GAAW,GAAA,CAAI,YAAA;AAC1C,IAAA,IAAA,GAAO,KAAA;AACP,IAAA,GAAA,GAAM,MAAM,IAAI,CAAA;AAAA,EAClB;AACA,EAAA,OAAO,QAAA,KAAa,SAAY,EAAE,IAAA,EAAM,SAAS,QAAA,EAAS,GAAI,EAAE,IAAA,EAAK;AACvE,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,MAAA,KAA+B;AAC/C,EAAA,MAAM,OAAkB,EAAC;AACzB,EAAA,MAAM,KAAA,GAAS,MAAA,CAAO,IAAA,EAAK,EAAuC,KAAA;AAClE,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,KAAA,GAAQ,KAAA;AAC5C,EAAA,IAAI,MAAA,CAAO,WAAA,KAAgB,MAAA,EAAW,IAAA,CAAK,cAAc,MAAA,CAAO,WAAA;AAChE,EAAA,OAAO,IAAA;AACT,CAAA;AAEA,IAAM,UAAA,GAAa,CAAC,MAAA,EAAiB,IAAA,KAAsB;AACzD,EAAA,MAAM,EAAE,IAAA,EAAM,OAAA,EAAS,QAAA,EAAS,GAAI,OAAO,MAAM,CAAA;AAGjD,EAAA,IAAI,KAAK,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,EAAG;AAC/B,IAAA,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA;AAC5B,IAAA,OAAO,EAAE,MAAM,MAAA,EAAO;AAAA,EACxB;AACA,EAAA,MAAM,IAAA,GAAA,CAAQ,YAAY,KAAA,CAAM,IAAI,EAAE,IAAI,CAAA,IAAK,YAAA,EAAc,IAAA,EAAM,IAAI,CAAA;AAGvE,EAAA,MAAM,IAAA,GAAO,EAAE,GAAG,QAAA,CAAS,IAAI,CAAA,EAAG,GAAG,QAAA,CAAS,MAAM,CAAA,EAAE;AACtD,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,GAAG,IAAA,EAAM,GAAI,QAAA,KAAa,MAAA,GAAY,EAAE,OAAA,EAAS,QAAA,EAAS,GAAI,EAAC,EAAG;AACtF,CAAA;AAEO,IAAM,KAAA,GAAQ,CAAC,MAAA,KACpB,UAAA,CAAW,QAAQ,EAAE,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAG,OAAA,kBAAS,IAAI,GAAA,IAAO;AAW7D,IAAM,KAAA,GAAuC;AAAA,EAC3C,QAAQ,MAAM,EAAA;AAAA,EACd,QAAQ,MAAM,CAAA;AAAA,EACd,SAAS,MAAM,KAAA;AAAA;AAAA;AAAA;AAAA,EAIf,MAAM,MAAM,MAAA;AAAA,EACZ,KAAA,EAAO,MAAM,EAAC;AAAA;AAAA,EAEd,OAAO,CAAC,KAAA,EAAO,OAAA,KAAa,KAAA,CAAM,SAAS,OAAA,GAAU,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,aAAA,CAAc,MAAM,OAAO,CAAC,IAAI,EAAC;AAAA;AAAA,EAEhH,MAAM,MAAM,MAAA;AAAA,EACZ,SAAS,MAAM,IAAA;AAAA,EACf,MAAA,EAAQ,CAAC,KAAA,EAAO,OAAA,KAAY;AAC1B,IAAA,IAAI,KAAA,CAAM,IAAA,KAAS,QAAA,EAAU,OAAO,EAAC;AACrC,IAAA,MAAM,eAAA,GAAkB,QAAQ,eAAA,IAAmB,IAAA;AACnD,IAAA,MAAM,WAAoC,EAAC;AAC3C,IAAA,KAAA,MAAW,KAAA,IAAS,MAAM,MAAA,EAAQ;AAChC,MAAA,IAAI,CAAC,KAAA,CAAM,QAAA,IAAY,CAAC,eAAA,EAAiB;AACzC,MAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAChD,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,QAAA,CAAS,KAAA,CAAM,GAAG,CAAA,GAAI,KAAA;AAAA,IACjD;AACA,IAAA,OAAO,QAAA;AAAA,EACT,CAAA;AAAA;AAAA,EAEA,KAAA,EAAO,CAAC,KAAA,KAAU;AAChB,IAAA,IAAI,KAAA,CAAM,IAAA,KAAS,OAAA,EAAS,OAAO,EAAC;AACpC,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,QAAA,CAAS,CAAC,CAAA;AAC9B,IAAA,OAAO,KAAA,KAAU,MAAA,GAAY,EAAC,GAAI,gBAAgB,KAAK,CAAA;AAAA,EACzD;AACF,CAAA;AAEO,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAc,OAAA,KAAqC;AAC/E,EAAA,IAAI,KAAA,CAAM,OAAA,KAAY,MAAA,EAAW,OAAO,KAAA,CAAM,OAAA;AAC9C,EAAA,OAAA,CAAQ,OAAA,CAAQ,KAAA,GAAQ,KAAA,CAAM,IAAI,CAAA,IAAK,MAAM,KAAA,CAAM,IAAI,CAAA,EAAG,KAAA,EAAO,OAAO,CAAA;AAC1E;AAIO,IAAM,QAAA,GAAW,CAAC,KAAA,KACvB,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK;AAM9D,IAAM,eAAA,GAAkB,CAAC,OAAA,KAA8B;AAC5D,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAA;AAChD,EAAA,IAAI,OAAA,CAAQ,OAAA,CAAQ,IAAA,KAAS,KAAA,EAAO,OAAO,QAAA;AAC3C,EAAA,OAAO,EAAE,CAAC,OAAA,CAAQ,OAAA,CAAQ,GAAG,GAAG,OAAA,CAAQ,OAAA,CAAQ,KAAA,EAAO,GAAI,QAAA,CAAS,QAAQ,CAAA,GAAI,QAAA,GAAW,EAAC,EAAG;AACjG","file":"chunk-TV4U22MY.js","sourcesContent":["import type { ZodType } from 'zod';\nimport type {\n CompileOptions,\n EmptyValue,\n EnumOption,\n Field,\n FieldKind,\n FieldMeta,\n ObjectField,\n Pattern,\n Variant,\n} from './types.js';\n\n// parse — turn a Zod schema into Loom's field model (IR). The only Zod-aware\n// code in the package, and pure data in / pure data out: no Nova. `parseByType`\n// is keyed by Zod's own `def.type` tag, so the type vocabulary lives as table\n// keys, not scattered checks.\n//\n// A recursive schema (`z.lazy`, or an object whose getter returns itself) would\n// expand forever. The walk carries the set of schemas it is currently inside;\n// re-entering one is a back-edge, emitted as a `self` marker and recorded so\n// the object it points back to can be tagged `recursive`. Expansion stops at\n// the cycle — the document, not the schema, decides how deep an editor goes.\n\n// The slice of a Zod schema's internal definition that parsing reads.\ntype ZodDef = {\n type: string;\n innerType?: ZodType;\n element?: ZodType;\n shape?: Record<string, ZodType>;\n entries?: Record<string, unknown>;\n defaultValue?: unknown;\n format?: string;\n checks?: ReadonlyArray<{ def?: { format?: string } }>;\n discriminator?: string;\n options?: readonly ZodType[];\n items?: readonly ZodType[];\n values?: readonly unknown[];\n getter?: () => ZodType;\n};\n\n// Zod types every schema's `.def` as the base `$ZodTypeDef` (just the `type`\n// discriminant); the per-type fields we read live on the concrete defs. This\n// views `.def` through the structural slice above — the single place the\n// parser depends on Zod's internal shape.\nconst defOf = (schema: ZodType): ZodDef => schema.def as ZodDef;\n\n// While walking, the schemas currently on the stack (cycle detection) and the\n// schemas a `self` pointed back to (so the matching object is tagged recursive).\n// Keyed by def, not instance: `.describe()`/`.meta()` clone the wrapper but\n// share the def, so a described alias of a recursive schema must read as the\n// schema itself — or every back-edge re-expands the whole thing one more level.\ntype Walk = { stack: Set<ZodDef>; targets: Set<ZodDef> };\n\n// ─── Reading Zod ─────────────────────────────────────────────\n\n// `safeint` is Zod's format tag for an integer-constrained number — the one\n// Zod-vocabulary token this file matches on.\nconst INTEGER_FORMAT = 'safeint';\n\nconst stringFormat = (schema: ZodType): string | undefined => {\n const def = defOf(schema);\n if (def.format !== undefined) return def.format;\n for (const check of def.checks ?? []) {\n if (check.def?.format !== undefined) return check.def.format;\n }\n return undefined;\n};\n\nconst isInteger = (schema: ZodType): boolean => {\n const def = defOf(schema);\n if (def.format === INTEGER_FORMAT) return true;\n return (def.checks ?? []).some((check) => check.def?.format === INTEGER_FORMAT);\n};\n\nconst enumOptions = (schema: ZodType): EnumOption[] =>\n Object.values(defOf(schema).entries ?? {}).map((value) => ({ value, label: String(value) }));\n\nconst objectFields = (schema: ZodType, walk: Walk): ObjectField[] =>\n Object.entries(defOf(schema).shape ?? {}).map(([key, value]) => ({\n key,\n // A property is optional when the schema accepts `undefined` for it\n // (covers `.optional()` and `.default()`) — asked of Zod, not inferred.\n required: !value.safeParse(undefined).success,\n field: parseField(value, walk),\n }));\n\n// ─── Union discrimination ────────────────────────────────────\n// For each branch, the cheapest fact that tells it apart from its siblings: the\n// declared tag's value, else a key only it carries, else a JS type only it is.\n// One function covers tagged, structural, and mixed unions; a branch that none\n// of these distinguish makes the whole union fall back to the raw editor.\n\nconst branchKeys = (branch: ZodType): string[] => Object.keys(defOf(branch).shape ?? {});\n\n// The branch's JS type, when it's one the runtime matcher checks (Zod names\n// these the same as `typeof`/`Array.isArray` do); otherwise undefined.\nconst JSON_TYPES = new Set(['string', 'number', 'boolean', 'object', 'array', 'null']);\nconst jsonType = (branch: ZodType): string | undefined => {\n const type = defOf(branch).type;\n return JSON_TYPES.has(type) ? type : undefined;\n};\n\nconst distinguish = (branch: ZodType, siblings: readonly ZodType[], tag: string | undefined): Pattern | undefined => {\n if (tag !== undefined) {\n const literal = (defOf(branch).shape ?? {})[tag];\n return { kind: 'tag', key: tag, value: literal !== undefined ? defOf(literal).values?.[0] : undefined };\n }\n const elsewhere = new Set(siblings.flatMap(branchKeys));\n const key = branchKeys(branch).find((k) => !elsewhere.has(k));\n if (key !== undefined) return { kind: 'key', key };\n const type = jsonType(branch);\n if (type !== undefined && siblings.every((s) => jsonType(s) !== type)) return { kind: 'type', type };\n return undefined;\n};\n\nconst patternLabel = (pattern: Pattern): string =>\n pattern.kind === 'tag'\n ? String(pattern.value)\n : pattern.kind === 'key'\n ? pattern.key\n : pattern.kind === 'type'\n ? pattern.type\n : 'other';\n\n// A union may nest unions (`z.union([...primitives, ...ops])` where the\n// primitives are themselves a `z.union`). The branches of a nested union are\n// siblings of the outer ones for discrimination, so inline them. Each branch is\n// unwrapped first (a described/optional sub-union still flattens); a non-union\n// branch passes through untouched. Unwrapping resolves lazies, so `seen` guards\n// a union that nests back into itself: once a union core is being flattened,\n// re-encountering it keeps the branch as a leaf rather than recursing forever.\nconst flattenBranches = (branches: readonly ZodType[], seen: Set<ZodDef> = new Set()): ZodType[] =>\n branches.flatMap((branch) => {\n const { core } = unwrap(branch);\n const def = defOf(core);\n if (def.type !== 'union' || seen.has(def)) return [branch];\n return flattenBranches(def.options ?? [], new Set(seen).add(def));\n });\n\n// A branch's editor. A tagged union owns its discriminant in the chooser, so it\n// is dropped from the fields; every other branch is edited whole — including a\n// `string` or `array` branch, which is just its own field, not a group.\nconst branchField = (branch: ZodType, walk: Walk, tag: string | undefined): Field =>\n tag === undefined\n ? parseField(branch, walk)\n : { kind: 'object', fields: objectFields(branch, walk).filter((f) => f.key !== tag) };\n\nconst parseByType: Record<string, (schema: ZodType, walk: Walk) => Field> = {\n string: (schema) => {\n const format = stringFormat(schema);\n return format !== undefined ? { kind: 'string', format } : { kind: 'string' };\n },\n number: (schema) => (isInteger(schema) ? { kind: 'number', integer: true } : { kind: 'number' }),\n boolean: () => ({ kind: 'boolean' }),\n enum: (schema) => ({ kind: 'enum', options: enumOptions(schema) }),\n object: (schema, walk) => {\n // On the stack while its fields parse, so a self-reference re-entering it\n // is caught as a cycle. If one was, the object is a recursion anchor.\n const def = defOf(schema);\n walk.stack.add(def);\n const fields = objectFields(schema, walk);\n walk.stack.delete(def);\n return walk.targets.has(def) ? { kind: 'object', fields, recursive: true } : { kind: 'object', fields };\n },\n array: (schema, walk) => {\n const element = defOf(schema).element;\n return { kind: 'array', item: element !== undefined ? parseField(element, walk) : { kind: 'unknown' } };\n },\n tuple: (schema, walk) => ({ kind: 'tuple', items: (defOf(schema).items ?? []).map((item) => parseField(item, walk)) }),\n union: (schema, walk) => {\n // Flatten nested unions into sibling branches, then dedup by identity — a\n // self-referential union resolves the same cached member instances twice, so\n // the same schema can appear more than once.\n const branches = [...new Set(flattenBranches(defOf(schema).options ?? []))];\n const tag = defOf(schema).discriminator;\n // Patterns don't need the stack — compute them first.\n const patterns = branches.map((b) => distinguish(b, branches.filter((x) => x !== b), tag));\n // A branch nothing distinguishes is the catch-all: allow exactly one, as the\n // fallback the widget picks when no other pattern matches. Two such branches\n // are ambiguous (which catches a plain value?), so the union still falls back\n // to the raw editor whole.\n const open = patterns.reduce<number[]>((acc, p, i) => (p === undefined ? [...acc, i] : acc), []);\n if (branches.length === 0 || open.length > 1) return { kind: 'unknown' };\n if (open.length === 1) patterns[open[0]!] = { kind: 'fallback' };\n // Parse the branch fields with the union on the stack, so a child that\n // re-enters it (a `children: LayoutNode[]`) is caught as a cycle.\n const def = defOf(schema);\n walk.stack.add(def);\n const variants: Variant[] = branches.map((branch, i) => ({\n label: readMeta(branch).title ?? patternLabel(patterns[i]!),\n field: branchField(branch, walk, tag),\n pattern: patterns[i]!,\n }));\n walk.stack.delete(def);\n return walk.targets.has(def) ? { kind: 'union', variants, recursive: true } : { kind: 'union', variants };\n },\n};\n\nconst unknownField = (): Field => ({ kind: 'unknown' });\n\n// Modifier wrappers that don't change the editing shape — peeled to reach the\n// core type, capturing any default along the way. `lazy` is peeled too: it is\n// the deferral that makes a schema recursive, resolved here to the schema it\n// guards (whose identity the cycle check then recognizes).\nconst WRAPPERS = new Set(['optional', 'nullable', 'default', 'readonly']);\n\n// A `lazy` is a deferred reference to one schema, but its getter may *build* a\n// fresh instance on every call (`z.lazy(() => z.union([...]))`) rather than\n// close over a stable const. Cycle detection needs the same resolution each\n// time, so resolve each lazy once and reuse it. Keyed by the lazy's def — the\n// def owns the getter, and a `.describe()` alias of the lazy shares it, so the\n// alias resolves to the same instance instead of a second copy of the tree.\nconst lazyResolved = new WeakMap<ZodDef, ZodType>();\nconst resolveLazy = (lazy: ZodType): ZodType | undefined => {\n const def = defOf(lazy);\n const cached = lazyResolved.get(def);\n if (cached !== undefined) return cached;\n const resolved = def.getter?.();\n if (resolved !== undefined) lazyResolved.set(def, resolved);\n return resolved;\n};\n\nconst unwrap = (schema: ZodType): { core: ZodType; default?: unknown } => {\n let core = schema;\n let fallback: unknown;\n let def = defOf(core);\n while (WRAPPERS.has(def.type) || def.type === 'lazy') {\n // `lazy` reaches its schema through a memoized getter; the other wrappers\n // through `innerType`. Either may be absent on a malformed def — stop if so.\n const inner = def.type === 'lazy' ? resolveLazy(core) : def.innerType;\n if (inner === undefined) break;\n if ('defaultValue' in def) fallback = def.defaultValue;\n core = inner;\n def = defOf(core);\n }\n return fallback !== undefined ? { core, default: fallback } : { core };\n};\n\nconst readMeta = (schema: ZodType): FieldMeta => {\n const meta: FieldMeta = {};\n const title = (schema.meta() as { title?: unknown } | undefined)?.title;\n if (typeof title === 'string') meta.title = title;\n if (schema.description !== undefined) meta.description = schema.description;\n return meta;\n};\n\nconst parseField = (schema: ZodType, walk: Walk): Field => {\n const { core, default: fallback } = unwrap(schema);\n // A schema already on the stack is a recursion back-edge: stop and record\n // it, so the object it cycles to is tagged when its parse unwinds.\n if (walk.stack.has(defOf(core))) {\n walk.targets.add(defOf(core));\n return { kind: 'self' };\n }\n const body = (parseByType[defOf(core).type] ?? unknownField)(core, walk);\n // Read metadata from both the core and the original, so a `.describe()` on\n // either the type or a wrapper is picked up; the outer one wins.\n const meta = { ...readMeta(core), ...readMeta(schema) };\n return { ...body, ...meta, ...(fallback !== undefined ? { default: fallback } : {}) };\n};\n\nexport const parse = (schema: ZodType): Field =>\n parseField(schema, { stack: new Set(), targets: new Set() });\n\n// ─── buildDocument: IR → default document ────────────────────\n// The default value of a field, by kind. Pure JSON — a model concern, not a\n// rendering one. Recursion bottoms out naturally: a recursive object's array\n// of itself defaults to empty, so no `self` is ever expanded into a default.\n\n// Each entry takes the whole field; the scalar kinds ignore it, and the two that\n// read their own shape (`object`, `union`) narrow with a guard rather than a\n// cast — the guard never fires (dispatch keys on `kind`), but it keeps the\n// types honest without a type assertion.\nconst EMPTY: Record<FieldKind, EmptyValue> = {\n string: () => '',\n number: () => 0,\n boolean: () => false,\n // No neutral in-domain value: \"no selection\" is absence (undefined), which\n // an optional enum accepts and a required one flags — unlike null, which a\n // Zod enum rejects outright. Defaults drop undefined, so no stray key.\n enum: () => undefined,\n array: () => [],\n // Each slot built from its own field; a fixed-length list, so no growth.\n tuple: (field, options) => (field.kind === 'tuple' ? field.items.map((item) => buildDocument(item, options)) : []),\n // A recursion point has no value of its own; the array holding it defaults to [].\n self: () => undefined,\n unknown: () => null,\n object: (field, options) => {\n if (field.kind !== 'object') return {};\n const includeOptional = options.includeOptional ?? true;\n const document: Record<string, unknown> = {};\n for (const child of field.fields) {\n if (!child.required && !includeOptional) continue;\n const value = buildDocument(child.field, options);\n if (value !== undefined) document[child.key] = value; // no stray undefined keys\n }\n return document;\n },\n // An empty union defaults to its first variant (tag + branch defaults).\n union: (field) => {\n if (field.kind !== 'union') return {};\n const first = field.variants[0];\n return first === undefined ? {} : variantDefaults(first);\n },\n};\n\nexport const buildDocument = (field: Field, options: CompileOptions): unknown => {\n if (field.default !== undefined) return field.default;\n return (options.empty?.[field.kind] ?? EMPTY[field.kind])(field, options);\n};\n\n// A plain object — not an array or null. Guards the spread of a built default\n// document, whose static type is `unknown` (so we check rather than assert).\nexport const isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === 'object' && value !== null && !Array.isArray(value);\n\n// A branch's default value: whatever its field builds — an object, but also a\n// bare `''` or `[]` for a scalar/array branch. A tagged union additionally sets\n// its discriminant alongside. Used as an empty union's value and to reshape the\n// document when the chooser switches branches.\nexport const variantDefaults = (variant: Variant): unknown => {\n const defaults = buildDocument(variant.field, {});\n if (variant.pattern.kind !== 'tag') return defaults;\n return { [variant.pattern.key]: variant.pattern.value, ...(isRecord(defaults) ? defaults : {}) };\n};\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../src/plugins/vex/widgets.ts","../src/plugins/vex/preview.layout.ts","../src/plugins/vex/preview.action.ts","../src/plugins/vex/index.ts"],"names":[],"mappings":";;;;AAQO,IAAM,cAAA,GAAiB;AACvB,IAAM,cAAA,GAAiB;AACvB,IAAM,aAAA,GAAgB;AACtB,IAAM,WAAA,GAAc;AAE3B,IAAM,cAAA,mBAAiB,IAAI,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,KAAA,EAAO,MAAA,EAAQ,OAAO,CAAC,CAAA;AACvF,IAAM,6BAAa,IAAI,GAAA,CAAI,CAAC,OAAA,EAAS,QAAA,EAAU,WAAW,CAAC,CAAA;AAEpD,IAAM,IAAA,GAAO,CAAC,IAAA,KAAyB,IAAA,CAAK,MAAM,IAAA,CAAK,WAAA,CAAY,GAAG,CAAA,GAAI,CAAC,CAAA;AAE3E,IAAM,gBAAA,GAAmB,CAAC,IAAA,KAA0B,iCAAA,CAAkC,KAAK,IAAI,CAAA;AAI/F,IAAM,UAAA,GAA8B;AAAA;AAAA,EAEzC,EAAE,IAAA,EAAM,cAAA,EAAgB,KAAA,EAAO,CAAC,KAAA,KAAU,KAAA,CAAM,IAAA,KAAS,SAAA,IAAa,eAAe,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,IAAI,CAAC,CAAA,EAAE;AAAA;AAAA,EAE3G,EAAE,IAAA,EAAM,cAAA,EAAgB,OAAO,CAAC,KAAA,KAAU,MAAM,IAAA,KAAS,QAAA,KAAa,WAAW,GAAA,CAAI,IAAA,CAAK,MAAM,IAAI,CAAC,KAAK,gBAAA,CAAiB,KAAA,CAAM,IAAI,CAAA,CAAA,EAAG;AAAA;AAAA,EAExI,EAAE,IAAA,EAAM,aAAA,EAAe,KAAA,EAAO,CAAC,KAAA,KAAU,KAAA,CAAM,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,WAAA,EAAY;AAAA,EACtG,EAAE,IAAA,EAAM,WAAA,EAAa,KAAA,EAAO,CAAC,KAAA,KAAU,KAAA,CAAM,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,KAAA,CAAM,IAAI,MAAM,SAAA;AAC1F,CAAA;AAMO,IAAM,SAAA,GAAY,CAAC,EAAA,KAAgC;AACxD,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA4B;AAC9C,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,MAAA,IAAU,GAAG,QAAA,EAAU;AAChC,IAAA,KAAA,MAAW,KAAA,IAAS,OAAO,MAAA,EAAQ;AACjC,MAAA,MAAM,SAAS,CAAA,EAAG,MAAA,CAAO,IAAI,CAAA,CAAA,EAAI,MAAM,IAAI,CAAA,CAAA;AAC3C,MAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AACnB,MAAA,KAAA,CAAM,GAAA,CAAI,MAAA,EAAQ,KAAA,CAAM,cAAc,CAAA;AAAA,IACxC;AAAA,EACF;AACA,EAAA,OAAO,EAAE,SAAS,MAAA,EAAQ,CAAC,WAAW,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA,EAAE;AAC1D;;;AC1CO,IAAM,OAAA,GAAU;AAIhB,IAAM,aAAA,GAA4B;AAAA,EACvC,SAAA,EAAW,OAAA;AAAA,EACX,KAAA,EAAO,EAAE,KAAA,EAAO,SAAA;AAClB,CAAA;;;ACPO,IAAM,aAAA,GAAkC;AAAA,EAC7C,EAAA,EAAI,OAAA;AAAA,EACJ,MAAA,EAAQ,aAAA;AAAA,EACR,IAAA,EAAM,EAAE,KAAA,EAAO,IAAA;AACjB,CAAA;;;ACyBO,IAAM,SAAA,GAAY,CAAC,MAAA,MAAyC;AAAA,EACjE,IAAA,EAAM,KAAA;AAAA,EACN,SAAA,EAAW,EAAE,KAAA,EAAO,MAAA,CAAO,UAAW,WAAA,EAAwB;AAAA;AAAA;AAAA,EAG9D,GAAI,OAAO,EAAA,KAAO,MAAA,GAAY,EAAE,OAAA,EAAS,UAAA,KAAe,EAAC;AAAA,EACzD,KAAA,EAAO,CAAC,MAAA,KACN,SAAA,CAAU,QAAQ,aAAA,EAAe,CAAC,CAAA,MAAO,EAAE,KAAA,EAAQ,CAAA,CAAE,SAAA,CAAsC,OAAO,GAAE,CAAE;AAC1G,CAAA","file":"chunk-XTY7XO5C.js","sourcesContent":["import type { DatabaseSchema, NormalizedType } from '@niscorp/vex';\nimport type { WidgetBinding } from '@editor/types';\n\n// The vex widgets — framework-free. Each is a role (the component name its render\n// registers under) plus a matcher that claims fields by the tail of their path,\n// so a rule works at any depth (a comparison operand is `…eq` whether top-level or\n// nested). The render components live in ./react and close over the catalog.\n\nexport const VEX_COMPARISON = 'vex:comparison';\nexport const VEX_FIELD_PATH = 'vex:field-path';\nexport const VEX_AGGREGATE = 'vex:aggregate';\nexport const VEX_COMPUTE = 'vex:compute';\n\nconst COMPARISON_OPS = new Set(['eq', 'neq', 'gt', 'gte', 'lt', 'lte', 'like', 'ilike']);\nconst FIELD_KEYS = new Set(['field', 'isNull', 'isNotNull']);\n\nexport const leaf = (path: string): string => path.slice(path.lastIndexOf('.') + 1);\n// An item of the `fields` / `groupBy` arrays (path tail `fields.*` / `groupBy.*`).\nexport const isColumnListItem = (path: string): boolean => /(?:^|\\.)(?:fields|groupBy)\\.\\*$/.test(path);\n\n// The matchers, by where each field sits in the query. The compiler renders a\n// matched field with the role's component instead of the type default.\nexport const vexWidgets: WidgetBinding[] = [\n // A comparison `[left, right]`: a field-path picker + a typed operand.\n { role: VEX_COMPARISON, match: (field) => field.kind === 'unknown' && COMPARISON_OPS.has(leaf(field.path)) },\n // A standalone field path: a sort key, `isNull`/`isNotNull`, or a `fields` / `groupBy` item.\n { role: VEX_FIELD_PATH, match: (field) => field.kind === 'string' && (FIELD_KEYS.has(leaf(field.path)) || isColumnListItem(field.path)) },\n // `aggregate` / `compute` records (alias -> expression): keyed-entry editors.\n { role: VEX_AGGREGATE, match: (field) => field.kind === 'unknown' && leaf(field.path) === 'aggregate' },\n { role: VEX_COMPUTE, match: (field) => field.kind === 'unknown' && leaf(field.path) === 'compute' },\n];\n\n// The database's columns and their types, narrowed by the render widgets. Built\n// from the introspected schema; gives the field-path pickers their column list.\nexport type Catalog = { columns: string[]; typeOf: (column: string) => NormalizedType | undefined };\n\nexport const catalogOf = (db: DatabaseSchema): Catalog => {\n const types = new Map<string, NormalizedType>();\n const columns: string[] = [];\n for (const entity of db.entities) {\n for (const field of entity.fields) {\n const column = `${entity.name}.${field.name}`;\n columns.push(column);\n types.set(column, field.normalizedType);\n }\n }\n return { columns, typeOf: (column) => types.get(column) };\n};\n","import type { LayoutNode } from '@niscorp/nova';\n\n// The preview view's id — one string for one view: the name its component\n// registers under, the id of its action, and the id of its canvas. The plugin\n// owns it; the editor host defines no view ids of its own.\nexport const PREVIEW = 'vex:preview';\n\n// The preview layout: one component bound to the live `query` document. The\n// component runs the query and shows the rows.\nexport const previewLayout: LayoutNode = {\n component: PREVIEW,\n props: { query: '$.query' },\n};\n","import type { ActionDefinition } from '@niscorp/nova';\nimport { previewLayout, PREVIEW } from './preview.layout.js';\n\n// The preview canvas's action: the layout over a `query` slot the mount keeps\n// synced with the live query document. Canvas id equals the action id (PREVIEW).\nexport const previewAction: ActionDefinition = {\n id: PREVIEW,\n layout: previewLayout,\n data: { query: null },\n};\n","import type { ZodType } from 'zod';\nimport { QuerySchema, type DatabaseSchema, type Query } from '@niscorp/vex';\nimport { mountView } from '@editor/view';\nimport type { LoomPlugin } from '@editor/types';\nimport { vexWidgets } from './widgets.js';\nimport { previewAction } from './preview.action.js';\n\n// @niscorp/loom/plugins/vex — the Vex plugin (framework-free).\n//\n// Loom edits one document — a Vex query, from Vex's QuerySchema. The plugin\n// declares that document, contributes the preview canvas (which runs the query),\n// and — when given a database schema — the field-path widgets. The per-framework\n// surface (./react) supplies the preview component and the widget renders; this\n// core supplies the schema, the widget matchers, and the mount.\n\nexport { PREVIEW } from './preview.layout.js';\nexport type { Query };\n\nexport type VexRunResult = {\n rows: unknown[];\n warnings?: string[];\n errors?: string[];\n};\n\nexport type VexPluginConfig = {\n /** Run an edited query and return its rows (plus any warnings / errors). */\n run: (query: Query) => Promise<VexRunResult>;\n /** The introspected database schema — gives the field-path widgets their\n * column list. Omit to fall back to plain inputs. */\n db?: DatabaseSchema;\n /** Override the edited schema; defaults to Vex's `QuerySchema`. */\n schema?: ZodType;\n};\n\nexport const vexPlugin = (config: VexPluginConfig): LoomPlugin => ({\n name: 'vex',\n documents: { query: config.schema ?? (QuerySchema as ZodType) },\n // Widgets only matter with a schema to scope columns against; without `db` the\n // query edits as plain inputs.\n ...(config.db !== undefined ? { widgets: vexWidgets } : {}),\n mount: (editor) =>\n mountView(editor, previewAction, (e) => ({ query: (e.documents as Record<string, unknown>)['query'] })),\n});\n"]}