@niscorp/strata 0.1.1 → 0.1.4

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 (48) hide show
  1. package/CHANGELOG.md +83 -0
  2. package/DESIGN.md +7 -3
  3. package/README.md +19 -4
  4. package/dist/check/index.cjs +23 -217
  5. package/dist/check/index.cjs.map +1 -1
  6. package/dist/check/index.js +2 -2
  7. package/dist/{chunk-MY3TGSV3.js → chunk-4BLHBVSC.js} +15 -4
  8. package/dist/chunk-4BLHBVSC.js.map +1 -0
  9. package/dist/{chunk-U5CPF4LQ.js → chunk-5KTXEN43.js} +3 -3
  10. package/dist/{chunk-U5CPF4LQ.js.map → chunk-5KTXEN43.js.map} +1 -1
  11. package/dist/{chunk-EGFF63GA.js → chunk-AKKWEXO2.js} +2 -2
  12. package/dist/{chunk-EGFF63GA.js.map → chunk-AKKWEXO2.js.map} +1 -1
  13. package/dist/chunk-ATHZ7HT5.cjs +18 -0
  14. package/dist/chunk-ATHZ7HT5.cjs.map +1 -0
  15. package/dist/chunk-CL5DF2IQ.cjs +192 -0
  16. package/dist/chunk-CL5DF2IQ.cjs.map +1 -0
  17. package/dist/chunk-IHYBGLNW.cjs +161 -0
  18. package/dist/chunk-IHYBGLNW.cjs.map +1 -0
  19. package/dist/chunk-KNBS3AJZ.cjs +223 -0
  20. package/dist/chunk-KNBS3AJZ.cjs.map +1 -0
  21. package/dist/{chunk-ICWKTTKN.js → chunk-OLDORFOQ.js} +12 -7
  22. package/dist/chunk-OLDORFOQ.js.map +1 -0
  23. package/dist/{chunk-HMT7HHFJ.js → chunk-WU3OJHVZ.js} +4 -4
  24. package/dist/{chunk-HMT7HHFJ.js.map → chunk-WU3OJHVZ.js.map} +1 -1
  25. package/dist/chunk-YXFEJJMC.cjs +136 -0
  26. package/dist/chunk-YXFEJJMC.cjs.map +1 -0
  27. package/dist/index.cjs +75 -325
  28. package/dist/index.cjs.map +1 -1
  29. package/dist/index.d.cts +1 -1
  30. package/dist/index.d.ts +1 -1
  31. package/dist/index.js +3 -3
  32. package/dist/node/index.cjs +14 -477
  33. package/dist/node/index.cjs.map +1 -1
  34. package/dist/node/index.js +5 -5
  35. package/dist/{plan-BEIlXVUt.d.cts → plan-CxuteSH1.d.cts} +2 -2
  36. package/dist/{plan-BAewc8DG.d.ts → plan-mFmdh0qT.d.ts} +2 -2
  37. package/dist/postgres/index.cjs +36 -206
  38. package/dist/postgres/index.cjs.map +1 -1
  39. package/dist/postgres/index.d.cts +7 -2
  40. package/dist/postgres/index.d.ts +7 -2
  41. package/dist/postgres/index.js +24 -12
  42. package/dist/postgres/index.js.map +1 -1
  43. package/dist/upgrade/index.cjs +19 -229
  44. package/dist/upgrade/index.cjs.map +1 -1
  45. package/dist/upgrade/index.js +3 -3
  46. package/package.json +3 -2
  47. package/dist/chunk-ICWKTTKN.js.map +0 -1
  48. package/dist/chunk-MY3TGSV3.js.map +0 -1
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/check/index.ts"],"names":["key"],"mappings":";;;AAyCA,IAAM,QAAA,GAAW,CAAC,KAAA,KAChB,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAErE,IAAM,KAAA,GAAQ,CAAC,CAAC,CAAC,CAAA,EAAsB,CAAC,CAAC,CAAA,KAAkC,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAIpG,IAAM,QAAA,GAAW,CAAC,KAAA,KAA4B;AAC5C,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,QAAQ,CAAA;AACnD,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AAC7B,EAAA,OAAO,MAAA,CAAO,YAAY,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CAAE,IAAA,CAAK,KAAK,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAC,GAAG,QAAA,CAAS,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/F,CAAA;AAKA,IAAM,KAAA,uBAAY,GAAA,CAAI,CAAC,cAAc,mBAAA,EAAqB,OAAA,EAAS,aAAA,EAAe,kBAAkB,CAAC,CAAA;AACrG,IAAM,IAAA,uBAAW,GAAA,CAAI,CAAC,SAAS,MAAA,EAAQ,SAAA,EAAW,UAAU,CAAC,CAAA;AAM7D,IAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,SAAS,CAAA;AACpD,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AAC7B,EAAA,OAAO,MAAA,CAAO,WAAA;AAAA,IACZ,MAAA,CAAO,QAAQ,KAAK,CAAA,CACjB,OAAO,CAAC,CAAC,GAAG,CAAA,KAAM,GAAA,KAAQ,iBAAiB,GAAA,KAAQ,SAAS,EAC5D,IAAA,CAAK,KAAK,EACV,GAAA,CAAI,CAAC,CAAC,GAAA,EAAK,CAAC,CAAA,KAAM,CAAC,GAAA,EAAK,KAAA,CAAM,IAAI,GAAG,CAAA,IAAK,SAAS,CAAC,CAAA,GAAI,aAAa,CAAA,EAAG,SAAS,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,GAAI,QAAA,CAAS,CAAC,CAAA,GAAI,SAAA,CAAU,CAAC,CAAC,CAAC;AAAA,GACrI;AACF,CAAA;AAGA,IAAM,YAAA,GAAe,CAAC,GAAA,EAA8B,IAAA,KAClD,MAAA,CAAO,YAAY,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,CAAE,IAAA,CAAK,KAAK,EAAE,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,MAAM,CAAA,KAAM,CAAC,IAAA,EAAM,IAAA,CAAK,MAAM,CAAC,CAAC,CAAC,CAAA;AAM3F,IAAM,UAAA,GAAa,CAAC,QAAA,EAAoB,OAAA,KAA+D;AAC5G,EAAA,MAAM,WAAW,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,SAAA,IAAa,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,MAAM,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;AACvF,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,EAAA,MAAM,OAAA,GAAU,SAAS,MAAA,CAAO,CAAC,MAAM,CAAC,KAAA,CAAM,QAAA,CAAS,CAAC,CAAC,CAAA;AACzD,EAAA,MAAM,KAAA,GAAQ,MAAM,MAAA,CAAO,CAAC,MAAM,CAAC,QAAA,CAAS,QAAA,CAAS,CAAC,CAAC,CAAA;AACvD,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,CAAA,IAAK,KAAA,CAAM,SAAS,CAAA,EAAG;AAC1C,IAAA,MAAM,IAAI,WAAA,CAAY,cAAA,EAAgB,CAAA,gBAAA,EAAmB,QAAA,CAAS,EAAE,CAAA,wBAAA,CAAA,EAA4B;AAAA,MAC9F,GAAG,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,cAAA,EAAiB,CAAC,CAAA,CAAE,CAAA;AAAA,MAC1C,GAAG,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,GAAG,CAAC,CAAA,kBAAA,EAAqB,QAAA,CAAS,EAAE,CAAA,CAAE;AAAA,KAC3D,CAAA;AAAA,EACH;AACA,EAAA,MAAM,QAAiC,EAAC;AACxC,EAAA,KAAA,MAAW,QAAQ,CAAC,GAAG,QAAQ,CAAA,CAAE,MAAK,EAAG;AACvC,IAAA,MAAM,MAAA,GAAS,QAAQ,IAAI,CAAA;AAC3B,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,KAAA,CAAM,IAAI,IAAI,QAAA,CAAS,MAAA,CAAO,WAAW,CAAA,CAAE,WAAW,KAAA,CAAM,EAAE,MAAA,EAAQ,eAAA,EAAiB,CAAC,CAAA;AAAA,EACpH;AACA,EAAA,OAAO,EAAE,UAAU,QAAA,CAAS,EAAA,EAAI,SAAS,QAAA,CAAS,UAAA,CAAW,QAAQ,KAAA,EAAM;AAC7E;AAGO,IAAM,YAAA,GAAe,CAAC,QAAA,KAA+B,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,QAAA,CAAS,QAAQ,CAAA,EAAG,IAAA,EAAM,CAAC,CAAC;AAAA;AAM1G,IAAM,SAAA,GAAY,CAAC,CAAA,EAAY,CAAA,EAAY,IAAA,EAAc,KAAe,KAAA,EAAe,KAAA,GAAiC,SAAA,EAAW,IAAA,GAAO,IAAA,KAAe;AACvJ,EAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AACzB,EAAA,IAAI,KAAK,SAAA,CAAU,CAAC,MAAM,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,EAAG;AAC7C,EAAA,IAAI,QAAA,CAAS,CAAC,CAAA,IAAK,QAAA,CAAS,CAAC,CAAA,EAAG;AAC9B,IAAA,KAAA,MAAW,GAAA,IAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,IAAA,CAAK,CAAC,GAAG,GAAG,MAAA,CAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA,CAAE,MAAK,EAAG;AAC7E,MAAA,MAAM,KAAK,IAAA,KAAS,EAAA,GAAK,MAAM,CAAA,EAAG,IAAI,IAAI,GAAG,CAAA,CAAA;AAC7C,MAAA,MAAM,MAAA,GAAS,EAAE,GAAG,CAAA;AACpB,MAAA,MAAM,KAAA,GAAQ,EAAE,GAAG,CAAA;AACnB,MAAA,IAAI,EAAE,GAAA,IAAO,CAAA,CAAA,MAAQ,IAAA,CAAK,CAAA,EAAA,EAAK,EAAE,CAAA,CAAE,CAAA;AAAA,WAAA,IAC1B,EAAE,GAAA,IAAO,CAAA,CAAA,MAAQ,IAAA,CAAK,CAAA,EAAA,EAAK,EAAE,CAAA,CAAE,CAAA;AAAA,WAAA,IAC/B,QAAQ,GAAA,KAAQ,aAAA,IAAiB,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,KAAK,GAAG,aAAA,CAAc,MAAA,EAAQ,OAAO,EAAA,EAAI,GAAA,EAAK,OAAO,KAAK,CAAA;AAAA,qBAC5H,MAAA,EAAQ,KAAA,EAAO,IAAI,GAAA,EAAK,KAAA,EAAO,OAAO,IAAI,CAAA;AACzD,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AACA,IAAA;AAAA,EACF;AACA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,IAAK,CAAC,IAAA,IAAQ,CAAA,CAAE,MAAA,KAAW,EAAE,MAAA,EAAQ;AAC1E,IAAA,CAAA,CAAE,QAAQ,CAAC,IAAA,EAAM,MAAM,SAAA,CAAU,IAAA,EAAM,EAAE,CAAC,CAAA,EAAG,CAAA,EAAG,IAAI,IAAI,CAAC,CAAA,CAAA,CAAA,EAAK,KAAK,KAAA,EAAO,KAAA,EAAO,IAAI,CAAC,CAAA;AACtF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,MAAM,OAAA,CAAQ,CAAC,KAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG;AAMxC,IAAA,MAAM,OAAO,CAAC,CAAA,KAAuB,KAAK,SAAA,CAAU,KAAA,CAAM,CAAC,CAAC,CAAA;AAC5D,IAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KACb,QAAA,CAAS,CAAC,CAAA,IAAK,QAAA,CAAS,CAAA,CAAE,YAAY,CAAC,CAAA,GAAI,MAAA,CAAO,IAAA,CAAK,EAAE,YAAY,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAA,CAAK,IAAA,CAAK,CAAC,CAAA,IAAK,EAAA,EAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACjH,IAAA,MAAM,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,KAAK,CAAC,CAAA,KAAM,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA;AACjE,IAAA,MAAM,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,KAAK,CAAC,CAAA,KAAM,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA;AACjE,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,KAAA,CAAM,CAAC,CAAA,EAAG,CAAC,CAAC,CAAC,CAAA;AACvD,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AACpC,MAAA,IAAI,YAAY,MAAA,EAAW;AACzB,QAAA,SAAA,CAAU,CAAA,EAAG,OAAA,EAAS,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA,CAAA,EAAK,GAAA,EAAK,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AACrE,QAAA,OAAA,CAAQ,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,MACzB,CAAA,MAAO;AACL,QAAA,GAAA,CAAI,KAAK,CAAA,EAAA,EAAK,IAAI,IAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,MACnC;AACA,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AACA,IAAA,KAAA,MAAW,CAAC,IAAI,CAAA,IAAK,OAAA,EAAS;AAC5B,MAAA,GAAA,CAAI,IAAA,CAAK,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA,CAAG,CAAA;AAC7B,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AACA,IAAA;AAAA,EACF;AACA,EAAA,GAAA,CAAI,IAAA,CAAK,KAAK,IAAA,IAAQ,QAAQ,KAAK,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA,EAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA,QAAA,EAAM,KAAK,SAAA,CAAU,CAAC,GAAG,KAAA,CAAM,CAAA,EAAG,EAAE,CAAC,CAAA,CAAE,CAAA;AAC3G,CAAA;AAMA,IAAM,gBAAgB,CAAC,CAAA,EAAuB,GAAuB,IAAA,EAAc,GAAA,EAAe,OAAe,KAAA,KAAyC;AACxJ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG;AACxD,IAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AACzB,IAAA,IAAI,CAAA,IAAK,EAAE,MAAA,EAAQ,GAAA,CAAI,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,SAAA,IACpC,CAAA,IAAK,EAAE,MAAA,EAAQ,GAAA,CAAI,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,SAC7C,SAAA,CAAU,CAAA,CAAE,CAAC,CAAA,EAAG,EAAE,CAAC,CAAA,EAAG,CAAA,EAAG,IAAI,IAAI,CAAC,CAAA,CAAA,CAAA,EAAK,GAAA,EAAK,KAAA,EAAO,OAAO,IAAI,CAAA;AAAA,EACrE;AACF,CAAA;AAcA,IAAM,UAAA,GAAa,4BAAA;AAGnB,IAAM,OAAA,GAAU,CAAC,KAAA,KAA4D;AAC3E,EAAA,IAAI,IAAA,GAAO,KAAA;AACX,EAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,EAAA,IAAI,EAAE,MAAA,IAAU,IAAA,CAAA,IAAS,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA,CAAS,CAAC,CAAA,IAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,OAAO,CAAA,CAAE,MAAM,CAAA,KAAM,QAAQ,CAAA,EAAG;AACpK,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAG,MAAK,GAAI,IAAA;AACnC,IAAA,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,MAAM,GAAA,CAAI,CAAC,CAAA,KAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,CAAE,MAAM,CAAA,GAAI,MAAU,CAAA,EAAE;AAAA,EAClF;AACA,EAAA,MAAM,IAAA,GAAO,KAAK,MAAM,CAAA;AACxB,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AACvB,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,IAAI,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,MAAM,CAAC,CAAC,CAAA,CAAE,IAAA,EAAK;AAClD,IAAA,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,KAAA,CAAM,WAAW,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,KAAA,EAAM;AAAA,EAChE;AACA,EAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,EAAA,MAAM,IAAA,GAAgB,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,MAAM,MAAA,KAAW,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,MAAA;AAC9E,EAAA,IAAI,EAAE,MAAA,IAAU,IAAA,CAAA,IAAS,QAAA,CAAS,IAAI,KAAK,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,WAAW,CAAA,IAAK,OAAO,IAAA,CAAK,MAAM,MAAM,QAAA,EAAU;AAC7G,IAAA,MAAM,EAAE,KAAA,EAAO,QAAA,EAAU,GAAG,MAAK,GAAI,IAAA;AACrC,IAAA,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,MAAM,CAAA,EAAE;AAAA,EACvC;AACA,EAAA,OAAO,IAAA;AACT,CAAA;AAIA,IAAM,iBAAiB,CAAC,IAAA,KACtB,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,CAAE,OAAA;AAAA,EAAQ,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,KACvC,QAAQ,MAAA,IAAU,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,GAAI,KAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA,IAAK,QAAA,CAAS,KAAK,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,GAAI,CAAC,KAAK;AAC1G,CAAA;AAEF,IAAM,SAAA,GAAY,CAAC,QAAA,KAA+B;AAChD,EAAA,MAAM,MAAA,GAAS,UAAU,QAAQ,CAAA;AACjC,EAAA,IAAI,CAAC,QAAA,CAAS,MAAM,CAAA,EAAG,OAAO,MAAA;AAC9B,EAAA,MAAM,IAAA,GAAgC;AAAA,IACpC,GAAI,SAAS,MAAA,CAAO,aAAa,CAAC,CAAA,GAAI,MAAA,CAAO,aAAa,CAAA,GAAI,EAAC;AAAA,IAC/D,GAAI,SAAS,MAAA,CAAO,OAAO,CAAC,CAAA,GAAI,MAAA,CAAO,OAAO,CAAA,GAAI;AAAC,GACrD;AACA,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,aAAa,YAAA,EAAc,GAAG,MAAK,GAAI,MAAA;AAC7D,EAAA,MAAM,MAAA,GAAS,CAAC,GAAA,KACd,GAAA,KAAQ,MAAM,EAAE,GAAA,EAAK,KAAK,IAAA,EAAM,IAAA,KAAS,EAAE,GAAA,EAAK,KAAK,IAAA,EAAM,IAAA,CAAK,IAAI,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAC,CAAA,EAAE;AAI/F,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,MAAM,UAAA,GAAa,CAAC,KAAA,EAAgB,KAAA,KAAmC;AACrE,IAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,MAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,UAAA,CAAW,IAAA,EAAM,KAAK,CAAA;AAChD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,IAAA,MAAM,IAAA,GAAO,QAAQ,KAAK,CAAA;AAC1B,IAAA,KAAA,MAAW,SAAS,cAAA,CAAe,IAAI,CAAA,EAAG,UAAA,CAAW,OAAO,KAAK,CAAA;AACjE,IAAA,MAAM,GAAA,GAAM,KAAK,MAAM,CAAA;AACvB,IAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC7B,IAAA,MAAM,EAAE,GAAA,EAAK,IAAA,EAAM,IAAA,EAAK,GAAI,OAAO,GAAG,CAAA;AACtC,IAAA,IAAI,MAAM,QAAA,CAAS,GAAG,CAAA,EAAG,SAAA,CAAU,IAAI,GAAG,CAAA;AAAA,oBAC1B,IAAA,EAAM,CAAC,GAAG,KAAA,EAAO,GAAG,CAAC,CAAA;AAAA,EACvC,CAAA;AACA,EAAA,UAAA,CAAW,IAAA,EAAM,CAAC,GAAG,CAAC,CAAA;AAEtB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,QAAiC,EAAC;AACxC,EAAA,MAAM,MAAA,GAAS,CAAC,GAAA,EAAa,IAAA,KAA0B;AACrD,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AAC3B,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAChC,IAAA,MAAM,IAAA,GAAO,CAAA,CAAA,EAAI,KAAA,CAAM,IAAI,CAAA,CAAA;AAC3B,IAAA,KAAA,CAAM,GAAA,CAAI,KAAK,IAAI,CAAA;AACnB,IAAA,KAAA,CAAM,IAAI,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AACA,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,KAA4B;AACxC,IAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,GAAG,OAAO,KAAA,CAAM,IAAI,IAAI,CAAA;AAC/C,IAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AAC7B,IAAA,MAAM,IAAA,GAAO,QAAQ,KAAK,CAAA;AAC1B,IAAA,MAAM,OAAgC,MAAA,CAAO,WAAA;AAAA,MAC3C,OAAO,OAAA,CAAQ,IAAI,EAChB,MAAA,CAAO,CAAC,CAACA,IAAG,CAAA,KAAMA,SAAQ,MAAM,CAAA,CAChC,KAAK,KAAK,CAAA,CACV,IAAI,CAAC,CAACA,MAAK,KAAK,CAAA,KAAM,CAACA,IAAAA,EAAK,MAAM,GAAA,CAAIA,IAAG,KAAK,QAAA,CAAS,KAAK,IAAI,YAAA,CAAa,KAAA,EAAO,IAAI,CAAA,GAAI,IAAA,CAAK,IAAIA,IAAG,CAAA,GAAI,QAAQ,IAAA,CAAK,KAAK,CAAC,CAAC;AAAA,KACrI;AACA,IAAA,MAAM,GAAA,GAAM,KAAK,MAAM,CAAA;AACvB,IAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,IAAA;AACpC,IAAA,MAAM,EAAE,GAAA,EAAK,IAAA,EAAM,IAAA,EAAK,GAAI,OAAO,GAAG,CAAA;AACtC,IAAA,MAAM,QAAA,GAAW,SAAA,CAAU,GAAA,CAAI,GAAG,IAAI,EAAE,IAAA,EAAM,CAAA,QAAA,EAAW,MAAA,CAAO,KAAK,IAAI,CAAC,CAAA,CAAA,EAAG,GAAI,KAAK,IAAI,CAAA;AAC1F,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,MAAA,GAAS,CAAA,GAAI,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,CAAC,QAAQ,GAAE,GAAI,QAAA;AAAA,EACzE,CAAA;AAEA,EAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,GAAG,IAAI,EAAE,IAAA,EAAM,CAAA,QAAA,EAAW,MAAA,CAAO,KAAK,IAAI,CAAC,CAAA,CAAA,EAAG,GAAI,KAAK,IAAI,CAAA;AACtF,EAAA,OAAO,MAAA,CAAO,KAAK,KAAK,CAAA,CAAE,WAAW,CAAA,GAAI,IAAA,GAAO,QAAA,CAAS,EAAE,GAAI,QAAA,CAAS,IAAI,CAAA,GAAI,IAAA,GAAO,EAAE,KAAA,EAAO,CAAC,IAAI,CAAA,EAAE,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA;AAC3H,CAAA;AAUO,IAAM,eAAA,GAAkB,CAAC,QAAA,EAAgC,OAAA,KAA0C;AACxG,EAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,EAAE,QAAQ,SAAA,EAAU;AACvD,EAAA,MAAM,UAA+C,EAAC;AACtD,EAAA,KAAA,MAAW,IAAA,IAAQ,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,KAAK,GAAG,GAAG,MAAA,CAAO,KAAK,OAAA,CAAQ,KAAK,CAAC,CAAC,CAAC,CAAA,CAAE,IAAA,EAAK,EAAG;AACvG,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,IAAI,EAAE,IAAA,IAAQ,QAAA,CAAS,KAAA,CAAA,EAAQ,KAAA,CAAM,KAAK,gBAAgB,CAAA;AAAA,SAAA,IACjD,EAAE,IAAA,IAAQ,OAAA,CAAQ,KAAA,CAAA,EAAQ,KAAA,CAAM,KAAK,sBAAsB,CAAA;AAAA,SAC/D,SAAA,CAAU,SAAA,CAAU,QAAA,CAAS,KAAA,CAAM,IAAI,CAAC,CAAA,EAAG,SAAA,CAAU,OAAA,CAAQ,MAAM,IAAI,CAAC,CAAA,EAAG,EAAA,EAAI,OAAO,EAAE,CAAA;AAC7F,IAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG,OAAA,CAAQ,KAAK,EAAE,IAAA,EAAM,OAAO,CAAA;AAAA,EACpD;AACA,EAAA,OAAO,OAAA,CAAQ,MAAA,KAAW,CAAA,GAAI,EAAE,MAAA,EAAQ,QAAO,GAAI,EAAE,MAAA,EAAQ,SAAA,EAAW,OAAA,EAAQ;AAClF;AAQA,IAAM,SAAA,GAAY,CAAC,KAAA,KAAyB;AAC1C,EAAA,MAAM,IAAA,GAAA,CAAQ,MAAM,IAAA,IAAQ,IAAI,GAAA,CAAI,CAAC,MAAO,OAAO,CAAA,KAAM,WAAW,MAAA,CAAO,CAAA,CAAE,GAAG,CAAA,GAAI,MAAA,CAAO,CAAC,CAAE,CAAA,CAAE,KAAK,GAAG,CAAA;AACxG,EAAA,OAAO,CAAA,EAAG,SAAS,EAAA,GAAK,EAAA,GAAK,GAAG,IAAI,CAAA,EAAA,CAAI,CAAA,EAAG,KAAA,CAAM,OAAO,CAAA,CAAA;AAC1D,CAAA;AAIO,IAAM,QAAA,GAAW,CAAC,CAAA,EAAY,CAAA,EAAY,QAAQ,EAAA,KAAiB;AACxE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,SAAA,CAAU,GAAG,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,KAAA,EAAO,UAAU,KAAK,CAAA;AAC/C,EAAA,OAAO,GAAA;AACT;AAGO,IAAM,WAAA,GAAc,OACzB,QAAA,EACA,OAAA,EACA,SAAA,KAC0B;AAC1B,EAAA,MAAM,WAA4B,EAAC;AACnC,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,MAAW,OAAO,SAAA,EAAW;AAC3B,IAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAC/B,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,IAAA,EAAM,GAAA,CAAI,IAAA,EAAM,MAAA,EAAQ,CAAA,cAAA,EAAiB,GAAA,CAAI,IAAI,IAAI,CAAA;AACjF,MAAA;AAAA,IACF;AACA,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI;AACF,MAAA,QAAA,GAAW,QAAA,CAAS,OAAA,CAAQ,GAAA,CAAI,QAAA,EAAU,EAAE,IAAA,EAAM,GAAA,CAAI,IAAA,EAAM,KAAA,EAAO,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,QAAA;AAAA,IAClF,SAAS,KAAA,EAAO;AACd,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,GAAA,CAAI,IAAI,IAAA,EAAM,GAAA,CAAI,IAAA,EAAM,MAAA,EAAQ,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA,CAAE,CAAC,CAAA,IAAK,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAA,EAAG,CAAA;AAC5I,MAAA;AAAA,IACF;AACA,IAAA,MAAM,SAAS,MAAM,MAAA,CAAO,WAAW,CAAA,CAAE,SAAS,QAAQ,CAAA;AAC1D,IAAA,IAAI,MAAA,CAAO,WAAW,MAAA,EAAW;AAC/B,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,GAAA,CAAI,IAAI,IAAA,EAAM,GAAA,CAAI,MAAM,MAAA,EAAQ,MAAA,CAAO,OAAO,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,GAAA,CAAI,SAAS,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,EAAG,CAAA;AAAA,IAC3G,CAAA,MAAO;AACL,MAAA,MAAA,IAAU,CAAA;AAAA,IACZ;AAAA,EACF;AACA,EAAA,OAAO,EAAE,QAAQ,QAAA,EAAS;AAC5B","file":"chunk-4BLHBVSC.js","sourcesContent":["import type { Sequence } from '../schema';\nimport type { Stamp, Upgrader } from '../documents';\nimport { StrataError } from '../errors';\n\n// ═══════════════════════════════════════════════════════════════\n// @niscorp/strata/check — the gate a grammar change has to pass.\n//\n// Two questions, both mechanical:\n//\n// 1. SNAPSHOT — did a kind's schema change without the grammar gaining a\n// migration? Each kind's JSON Schema, taken through the schema's OWN\n// Standard JSON Schema hook, is recorded per grammar version. Same version,\n// different schema: something changed that older readers were never told.\n// Append a migration (an empty marker is enough for an addition — strict\n// readers still have to refuse the newer documents), then record the new\n// version.\n//\n// 2. CORPUS — does every real document ever captured, at the stamp it was\n// captured at, still upgrade to the current grammar and pass the current\n// strict schema? This is the judge: a snapshot only says something moved,\n// the corpus says whether old documents survive it. No JSON Schema diff\n// tool is trusted to decide compatibility.\n//\n// Pure: no files, no process. A host reads and writes snapshots where it keeps\n// them (nisc's own live in the repo's `strata/` directory).\n// ═══════════════════════════════════════════════════════════════\n\ntype Issue = { message: string; path?: readonly (PropertyKey | { key: PropertyKey })[] };\ntype StandardResult = { value: unknown; issues?: undefined } | { issues: readonly Issue[] };\n\n// Any validator implementing Standard Schema + Standard JSON Schema (Zod ≥ 4.2,\n// Valibot, ArkType). Structural: strata depends on none of them.\nexport type GrammarSchema = {\n '~standard': {\n validate: (value: unknown) => StandardResult | Promise<StandardResult>;\n jsonSchema: { input: (options: { target: string }) => Record<string, unknown> };\n };\n};\n\nexport type Snapshot = { sequence: string; version: number; kinds: Readonly<Record<string, unknown>> };\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === 'object' && value !== null && !Array.isArray(value);\n\nconst byKey = ([a]: [string, unknown], [b]: [string, unknown]): number => (a < b ? -1 : a > b ? 1 : 0);\n\n// Sorted keys, nothing else — for documents, where every key (a `description`\n// too) is content, and for a snapshot file, which keeps what the validator wrote.\nconst sortKeys = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(sortKeys);\n if (!isRecord(value)) return value;\n return Object.fromEntries(Object.entries(value).sort(byKey).map(([k, v]) => [k, sortKeys(v)]));\n};\n\n// Where a schema's keys are NAMES, not keywords — a field called `description`\n// or an op called `$ref` is grammar — and where its values are instance data\n// rather than schemas.\nconst NAMED = new Set(['properties', 'patternProperties', '$defs', 'definitions', 'dependentSchemas']);\nconst DATA = new Set(['const', 'enum', 'default', 'examples']);\n\n// A schema without its prose: the `description` KEYWORD is documentation, and\n// rewording a `.describe()` must not demand a migration. `$schema` is the same\n// everywhere. Applied when comparing, never to what is recorded — so what the\n// gate ignores can change without touching a snapshot file.\nconst normalize = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(normalize);\n if (!isRecord(value)) return value;\n return Object.fromEntries(\n Object.entries(value)\n .filter(([key]) => key !== 'description' && key !== '$schema')\n .sort(byKey)\n .map(([key, v]) => [key, NAMED.has(key) && isRecord(v) ? namedSchemas(v, normalize) : DATA.has(key) ? sortKeys(v) : normalize(v)]),\n );\n};\n\n// A name → schema map, each schema through `each`, the names untouched.\nconst namedSchemas = (map: Record<string, unknown>, each: (schema: unknown) => unknown): Record<string, unknown> =>\n Object.fromEntries(Object.entries(map).sort(byKey).map(([name, schema]) => [name, each(schema)]));\n\n// The grammar as it stands: every kind it declares, as JSON Schema — as the\n// validator wrote it, keys sorted. `schemas` must cover exactly the sequence's\n// kinds — a kind without a schema cannot be checked, and a schema without a\n// kind belongs to some other grammar.\nexport const snapshotOf = (sequence: Sequence, schemas: Readonly<Record<string, GrammarSchema>>): Snapshot => {\n const declared = Object.keys(sequence.documents ?? {}).map((k) => `${sequence.id}/${k}`);\n const given = Object.keys(schemas);\n const missing = declared.filter((k) => !given.includes(k));\n const extra = given.filter((k) => !declared.includes(k));\n if (missing.length > 0 || extra.length > 0) {\n throw new StrataError('UNKNOWN_KIND', `The schemas for ${sequence.id} do not match its kinds.`, [\n ...missing.map((k) => `no schema for ${k}`),\n ...extra.map((k) => `${k} is not a kind of ${sequence.id}`),\n ]);\n }\n const kinds: Record<string, unknown> = {};\n for (const kind of [...declared].sort()) {\n const schema = schemas[kind];\n if (schema !== undefined) kinds[kind] = sortKeys(schema['~standard'].jsonSchema.input({ target: 'draft-2020-12' }));\n }\n return { sequence: sequence.id, version: sequence.migrations.length, kinds };\n};\n\n// Stable text for a snapshot file: sorted keys, two-space indent, newline.\nexport const snapshotText = (snapshot: Snapshot): string => `${JSON.stringify(sortKeys(snapshot), null, 2)}\n`;\n\n// Schema arrays are compared as sets (`sets`) — all but a tuple's `prefixItems`,\n// see `diffPositions`; a document's arrays by position — `layout.children[1]` is\n// how a person finds the thing that changed.\nconst diffLines = (a: unknown, b: unknown, path: string, out: string[], limit: number, canon: (v: unknown) => unknown = normalize, sets = true): void => {\n if (out.length >= limit) return;\n if (JSON.stringify(a) === JSON.stringify(b)) return;\n if (isRecord(a) && isRecord(b)) {\n for (const key of [...new Set([...Object.keys(a), ...Object.keys(b)])].sort()) {\n const at = path === '' ? key : `${path}.${key}`;\n const before = a[key];\n const after = b[key];\n if (!(key in a)) out.push(`+ ${at}`);\n else if (!(key in b)) out.push(`- ${at}`);\n else if (sets && key === 'prefixItems' && Array.isArray(before) && Array.isArray(after)) diffPositions(before, after, at, out, limit, canon);\n else diffLines(before, after, at, out, limit, canon, sets);\n if (out.length >= limit) return;\n }\n return;\n }\n if (Array.isArray(a) && Array.isArray(b) && !sets && a.length === b.length) {\n a.forEach((item, i) => diffLines(item, b[i], `${path}[${i}]`, out, limit, canon, sets));\n return;\n }\n if (Array.isArray(a) && Array.isArray(b)) {\n // Schema arrays are SETS more often than sequences — a union's `anyOf`, a\n // `required` list, an `enum` — and one added branch shifts every index\n // after it. Match elements by what they describe (an object schema by its\n // property names — for Prism's union, the op), report the ones on one side\n // only, and diff the ones that changed in place.\n const text = (v: unknown): string => JSON.stringify(canon(v));\n const label = (v: unknown): string =>\n isRecord(v) && isRecord(v['properties']) ? Object.keys(v['properties']).join(',') : (text(v) ?? '').slice(0, 50);\n const onlyA = a.filter((x) => !b.some((y) => text(y) === text(x)));\n const onlyB = b.filter((y) => !a.some((x) => text(x) === text(y)));\n const byLabel = new Map(onlyB.map((y) => [label(y), y]));\n for (const x of onlyA) {\n const partner = byLabel.get(label(x));\n if (partner !== undefined) {\n diffLines(x, partner, `${path}[${label(x)}]`, out, limit, canon, sets);\n byLabel.delete(label(x));\n } else {\n out.push(`- ${path}[${label(x)}]`);\n }\n if (out.length >= limit) return;\n }\n for (const [name] of byLabel) {\n out.push(`+ ${path}[${name}]`);\n if (out.length >= limit) return;\n }\n return;\n }\n out.push(`~ ${path || '(root)'}: ${JSON.stringify(a)?.slice(0, 60)} → ${JSON.stringify(b)?.slice(0, 60)}`);\n};\n\n// A tuple's `prefixItems` is the one schema array that is a SEQUENCE: position\n// is the grammar, so [string, number] and [number, string] are different tuples\n// and a document valid for one is not for the other. Compared place by place;\n// what sits IN a place is a schema again, its own arrays sets as ever.\nconst diffPositions = (a: readonly unknown[], b: readonly unknown[], path: string, out: string[], limit: number, canon: (v: unknown) => unknown): void => {\n for (let i = 0; i < Math.max(a.length, b.length); i += 1) {\n if (out.length >= limit) return;\n if (i >= a.length) out.push(`+ ${path}[${i}]`);\n else if (i >= b.length) out.push(`- ${path}[${i}]`);\n else diffLines(a[i], b[i], `${path}[${i}]`, out, limit, canon, true);\n }\n};\n\n// ── canonical form ──────────────────────────────────────────────\n//\n// A snapshot records what the validator WROTE, and validators spell one schema\n// many ways: they name and inline definitions as they please (zod numbers them\n// in visit order, and 4.3 and 4.4 visit differently), write a described\n// reference as `allOf: [{ $ref }]` or as `$ref`, and a union of bare types as\n// `anyOf: [{ type }, …]` or `type: […]`. None of that is the grammar, so a\n// comparison reads both sides in one spelling: every definition inlined unless\n// it is recursive, the recursive ones renamed by first use, and every schema\n// identity above written one way. A snapshot FILE stays what the validator\n// wrote — only the comparison is canonical.\n\nconst REF_PREFIX = /^#\\/(\\$defs|definitions)\\//;\n\n// One spelling for the equivalences the node itself can show.\nconst respell = (value: Record<string, unknown>): Record<string, unknown> => {\n let node = value;\n const anyOf = node['anyOf'];\n if (!('type' in node) && Array.isArray(anyOf) && anyOf.length > 0 && anyOf.every((m) => isRecord(m) && Object.keys(m).length === 1 && typeof m['type'] === 'string')) {\n const { anyOf: _union, ...rest } = node;\n node = { ...rest, type: anyOf.map((m) => (isRecord(m) ? m['type'] : undefined)) };\n }\n const type = node['type'];\n if (Array.isArray(type)) {\n const types = [...new Set(type.map(String))].sort();\n node = { ...node, type: types.length === 1 ? types[0] : types };\n }\n const allOf = node['allOf'];\n const only: unknown = Array.isArray(allOf) && allOf.length === 1 ? allOf[0] : undefined;\n if (!('$ref' in node) && isRecord(only) && Object.keys(only).length === 1 && typeof only['$ref'] === 'string') {\n const { allOf: _wrapper, ...rest } = node;\n node = { ...rest, $ref: only['$ref'] };\n }\n return node;\n};\n\n// A schema node's own children — keyword values, and each schema of a name\n// map — but never the names, and never instance data.\nconst schemaChildren = (node: Record<string, unknown>): unknown[] =>\n Object.entries(node).flatMap(([key, child]) =>\n key === '$ref' || DATA.has(key) ? [] : NAMED.has(key) && isRecord(child) ? Object.values(child) : [child],\n );\n\nconst canonical = (recorded: unknown): unknown => {\n const schema = normalize(recorded);\n if (!isRecord(schema)) return schema;\n const defs: Record<string, unknown> = {\n ...(isRecord(schema['definitions']) ? schema['definitions'] : {}),\n ...(isRecord(schema['$defs']) ? schema['$defs'] : {}),\n };\n const { $defs: _defs, definitions: _definitions, ...body } = schema;\n const target = (ref: string): { key: string; node: unknown } =>\n ref === '#' ? { key: '#', node: body } : { key: ref, node: defs[ref.replace(REF_PREFIX, '')] };\n\n // Which targets are reached from inside their own expansion: those, and\n // only those, stay definitions.\n const recursive = new Set<string>();\n const findCycles = (value: unknown, stack: readonly string[]): void => {\n if (Array.isArray(value)) {\n for (const item of value) findCycles(item, stack);\n return;\n }\n if (!isRecord(value)) return;\n const node = respell(value);\n for (const child of schemaChildren(node)) findCycles(child, stack);\n const ref = node['$ref'];\n if (typeof ref !== 'string') return;\n const { key, node: next } = target(ref);\n if (stack.includes(key)) recursive.add(key);\n else findCycles(next, [...stack, key]);\n };\n findCycles(body, ['#']);\n\n const names = new Map<string, string>();\n const named: Record<string, unknown> = {};\n const nameOf = (key: string, node: unknown): string => {\n const known = names.get(key);\n if (known !== undefined) return known;\n const name = `d${names.size}`;\n names.set(key, name);\n named[name] = emit(node);\n return name;\n };\n const emit = (value: unknown): unknown => {\n if (Array.isArray(value)) return value.map(emit);\n if (!isRecord(value)) return value;\n const node = respell(value);\n const rest: Record<string, unknown> = Object.fromEntries(\n Object.entries(node)\n .filter(([key]) => key !== '$ref')\n .sort(byKey)\n .map(([key, child]) => [key, NAMED.has(key) && isRecord(child) ? namedSchemas(child, emit) : DATA.has(key) ? child : emit(child)]),\n );\n const ref = node['$ref'];\n if (typeof ref !== 'string') return rest;\n const { key, node: next } = target(ref);\n const referred = recursive.has(key) ? { $ref: `#/$defs/${nameOf(key, next)}` } : emit(next);\n return Object.keys(rest).length > 0 ? { ...rest, allOf: [referred] } : referred;\n };\n\n const root = recursive.has('#') ? { $ref: `#/$defs/${nameOf('#', body)}` } : emit(body);\n return Object.keys(named).length === 0 ? root : sortKeys({ ...(isRecord(root) ? root : { allOf: [root] }), $defs: named });\n};\n\nexport type SnapshotComparison =\n | { status: 'same' }\n | { status: 'missing' }\n | { status: 'changed'; changes: readonly { kind: string; lines: readonly string[] }[] };\n\n// `recorded` is the snapshot kept for the grammar's CURRENT version (or\n// undefined if none was kept). Changed means: a migration is owed. Both sides\n// are read in canonical form, so a validator's respelling is not a change.\nexport const compareSnapshot = (recorded: Snapshot | undefined, current: Snapshot): SnapshotComparison => {\n if (recorded === undefined) return { status: 'missing' };\n const changes: { kind: string; lines: string[] }[] = [];\n for (const kind of [...new Set([...Object.keys(recorded.kinds), ...Object.keys(current.kinds)])].sort()) {\n const lines: string[] = [];\n if (!(kind in recorded.kinds)) lines.push('+ (a new kind)');\n else if (!(kind in current.kinds)) lines.push('- (the kind is gone)');\n else diffLines(canonical(recorded.kinds[kind]), canonical(current.kinds[kind]), '', lines, 12);\n if (lines.length > 0) changes.push({ kind, lines });\n }\n return changes.length === 0 ? { status: 'same' } : { status: 'changed', changes };\n};\n\n// ── the corpus ──────────────────────────────────────────────────\n\nexport type CorpusDocument = { id: string; kind: string; stamp: Stamp; document: unknown };\nexport type CorpusFailure = { id: string; kind: string; reason: string };\nexport type CorpusReport = { passed: number; failures: readonly CorpusFailure[] };\n\nconst issueText = (issue: Issue): string => {\n const path = (issue.path ?? []).map((p) => (typeof p === 'object' ? String(p.key) : String(p))).join('.');\n return `${path === '' ? '' : `${path}: `}${issue.message}`;\n};\n\n// What differs between two JSON values, as short lines (`+ a.b`, `- c`,\n// `~ d: 1 → 2`) — for a report a person or an agent acts on.\nexport const diffJson = (a: unknown, b: unknown, limit = 20): string[] => {\n const out: string[] = [];\n diffLines(a, b, '', out, limit, sortKeys, false);\n return out;\n};\n\n// Every document, upgraded from its stamp, must pass the current schema of its kind.\nexport const checkCorpus = async (\n upgrader: Upgrader,\n schemas: Readonly<Record<string, GrammarSchema>>,\n documents: readonly CorpusDocument[],\n): Promise<CorpusReport> => {\n const failures: CorpusFailure[] = [];\n let passed = 0;\n for (const doc of documents) {\n const schema = schemas[doc.kind];\n if (schema === undefined) {\n failures.push({ id: doc.id, kind: doc.kind, reason: `no schema for ${doc.kind}` });\n continue;\n }\n let upgraded: unknown;\n try {\n upgraded = upgrader.upgrade(doc.document, { kind: doc.kind, stamp: doc.stamp }).document;\n } catch (error) {\n failures.push({ id: doc.id, kind: doc.kind, reason: error instanceof Error ? error.message.split('\\n')[0] ?? error.message : String(error) });\n continue;\n }\n const result = await schema['~standard'].validate(upgraded);\n if (result.issues !== undefined) {\n failures.push({ id: doc.id, kind: doc.kind, reason: result.issues.slice(0, 3).map(issueText).join('; ') });\n } else {\n passed += 1;\n }\n }\n return { passed, failures };\n};\n"]}
@@ -1,4 +1,4 @@
1
- import { StrataError } from './chunk-EGFF63GA.js';
1
+ import { StrataError } from './chunk-AKKWEXO2.js';
2
2
  import { z } from 'zod';
3
3
 
4
4
  var SEQUENCE_ID = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+$/;
@@ -171,5 +171,5 @@ var refuseProblems = (plan) => {
171
171
  };
172
172
 
173
173
  export { DocumentKindSchema, DocumentStepSchema, EMBED_PATH, KIND_NAME, KIND_REF, MIGRATION_REF, MigrationSchema, SEQUENCE_ID, SequenceSchema, SqlStepSchema, StepSchema, checksumOf, orderPending, planMigrations, prepare, refuseProblems };
174
- //# sourceMappingURL=chunk-U5CPF4LQ.js.map
175
- //# sourceMappingURL=chunk-U5CPF4LQ.js.map
174
+ //# sourceMappingURL=chunk-5KTXEN43.js.map
175
+ //# sourceMappingURL=chunk-5KTXEN43.js.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/schema.ts","../src/checksum.ts","../src/plan.ts"],"names":[],"mappings":";;;AAiBO,IAAM,WAAA,GAAc;AAIpB,IAAM,aAAA,GAAgB;AAItB,IAAM,SAAA,GAAY;AAClB,IAAM,QAAA,GAAW;AAOjB,IAAM,UAAA,GAAa;AAEnB,IAAM,aAAA,GAAgB,EAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,CAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EACrB,KAAK,CAAA,CACF,MAAA,EAAO,CACP,GAAA,CAAI,CAAC,CAAA,CACL,QAAA;AAAA,IACC;AAAA;AAGN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yEAAyE;AAE9E,IAAM,kBAAA,GAAqB,EAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,CAAA,CAAE,OAAA,CAAQ,UAAU,CAAA;AAAA,EAC1B,EAAA,EAAI,EACD,MAAA,EAAO,CACP,MAAM,QAAQ,CAAA,CACd,SAAS,0GAAqG,CAAA;AAAA,EACjH,SAAA,EAAW,CAAA,CACR,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA;AAIN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD;AAEtD,IAAM,aAAa,CAAA,CAAE,kBAAA,CAAmB,QAAQ,CAAC,aAAA,EAAe,kBAAkB,CAAC;AAEnF,IAAM,kBAAA,GAAqB,EAC/B,MAAA,CAAO;AAAA,EACN,QAAQ,CAAA,CACL,MAAA,CAAO,EAAE,MAAA,EAAO,CAAE,MAAM,UAAU,CAAA,EAAG,EAAE,MAAA,EAAO,CAAE,MAAM,QAAQ,CAAC,EAC/D,QAAA,EAAS,CACT,SAAS,0GAAqG;AACnH,CAAC,EACA,MAAA;AAEI,IAAM,eAAA,GAAkB,EAC5B,MAAA,CAAO;AAAA,EACN,WAAA,EAAa,EACV,MAAA,EAAO,CACP,IAAI,CAAC,CAAA,CACL,SAAS,gGAAiG,CAAA;AAAA,EAC7G,KAAA,EAAO,CAAA,CACJ,KAAA,CAAM,UAAU,CAAA,CAChB,QAAA;AAAA,IACC;AAAA,GAEF;AAAA,EACF,SAAA,EAAW,CAAA,CACR,KAAA,CAAM,CAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,aAAa,CAAC,CAAA,CACrC,QAAA,EAAS,CACT,SAAS,qFAAqF;AACnG,CAAC,EACA,MAAA;AAEI,IAAM,cAAA,GAAiB,EAC3B,MAAA,CAAO;AAAA,EACN,EAAA,EAAI,EAAE,MAAA,EAAO,CAAE,MAAM,WAAW,CAAA,CAAE,SAAS,iEAAiE,CAAA;AAAA,EAC5G,SAAA,EAAW,CAAA,CACR,MAAA,CAAO,CAAA,CAAE,QAAO,CAAE,KAAA,CAAM,SAAS,CAAA,EAAG,kBAAkB,CAAA,CACtD,QAAA,EAAS,CACT,SAAS,iGAAiG,CAAA;AAAA,EAC7G,YAAY,CAAA,CACT,KAAA,CAAM,eAAe,CAAA,CACrB,SAAS,sGAAuG;AACrH,CAAC,EACA,MAAA,EAAO,CAMP,WAAA,CAAY,CAAC,UAAU,GAAA,KAAQ;AAC9B,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,QAAA,CAAS,UAAA,CAAW,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AACpF,EAAA,IAAI,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,KAAM,KAAA,CAAM,IAAI,UAAU,CAAA,IAAK,QAAA,CAAS,SAAA,KAAc,MAAA,CAAA,EAAY;AACnF,IAAA,GAAA,CAAI,QAAA,CAAS;AAAA,MACX,IAAA,EAAM,QAAA;AAAA,MACN,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AACF,CAAC;;;ACpGH,IAAM,SAAA,GAAY,CAAC,KAAA,KAA2B;AAC5C,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACnE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACjC,MAAA,CAAO,CAAC,GAAG,CAAC,CAAA,KAAM,CAAA,KAAM,MAAS,CAAA,CACjC,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA;AAClD,IAAA,OAAO,CAAA,CAAA,EAAI,QAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,IAAA,CAAK,UAAU,CAAC,CAAC,IAAI,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACtF;AACA,EAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC7B,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,GAAA,KAChB,GAAA,CACG,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,SAAA,EAAU,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,CACnD,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,CAAA,CAC5B,IAAA,CAAK,IAAI,CAAA,CACT,IAAA,EAAK;AAEH,IAAM,UAAA,GAAa,OAAO,SAAA,KAA0C;AACzE,EAAA,MAAM,QAAQ,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,IAAA,KAAU,KAAK,IAAA,KAAS,KAAA,GAAQ,EAAE,GAAG,MAAM,GAAA,EAAK,QAAA,CAAS,KAAK,GAAG,CAAA,KAAM,IAAK,CAAA;AAC/G,EAAA,MAAM,QAAQ,IAAI,WAAA,GAAc,MAAA,CAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AACvD,EAAA,MAAM,SAAS,MAAM,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,WAAW,KAAK,CAAA;AAC1D,EAAA,OAAO,MAAM,IAAA,CAAK,IAAI,WAAW,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,KAAK,EAAE,CAAA;AAC3F;;;ACAA,IAAM,QAAQ,CAAC,QAAA,EAAkB,MAAsB,CAAA,EAAG,QAAQ,IAAI,CAAC,CAAA,CAAA;AAGhE,IAAM,OAAA,GAAU,OAAO,SAAA,KAAyE;AACrG,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAC7B,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,SAAA,CAAU,KAAK,CAAA;AAC7C,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,IAAA,CAAK,KAAK,GAAG,CAAA,IAAK,QAAQ,CAAA,EAAA,EAAK,CAAA,CAAE,OAAO,CAAA,CAAE,CAAA;AAC7F,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,yBAAA,EAA4B,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,CAAA,GAAA,EAAM,KAAA,CAAM,EAAE,CAAA,EAAA,CAAA,GAAO,EAAE,KAAK,MAAM,CAAA;AAAA,IACzI;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,IAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA,EAAG;AACzB,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,+BAAA,EAAkC,QAAA,CAAS,EAAE,CAAA,uCAAA,CAAoC,CAAA;AAAA,IAC7H;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,SAAS,EAAE,CAAA;AACpB,IAAA,MAAM,aAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,SAAS,KAAK,QAAA,CAAS,UAAA,CAAW,SAAQ,EAAG;AAC9D,MAAA,MAAM,IAAI,KAAA,GAAQ,CAAA;AAClB,MAAA,UAAA,CAAW,IAAA,CAAK;AAAA,QACd,UAAU,QAAA,CAAS,EAAA;AAAA,QACnB,CAAA;AAAA,QACA,GAAA,EAAK,KAAA,CAAM,QAAA,CAAS,EAAA,EAAI,CAAC,CAAA;AAAA,QACzB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,QAAA,EAAU,MAAM,UAAA,CAAW,SAAS,CAAA;AAAA,QACpC,OAAO,SAAA,CAAU,KAAA;AAAA,QACjB,SAAA,EAAW,SAAA,CAAU,SAAA,IAAa;AAAC,OACpC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,UAAU,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,UAAU,CAAC,CAAA;AAC9H,IAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,OAAA,EAAS,SAAA,EAAW,QAAA,CAAS,SAAA,IAAa,EAAC,EAAG,UAAA,EAAY,CAAA;AAAA,EAC7F;AACA,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,YAAA,GAAe,CAC1B,MAAA,EACA,WAAA,KACiE;AACjE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,WAAW,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAA,CAAE,OAAO,CAAC,CAAA;AAChD,EAAA,MAAM,UAA+B,EAAC;AACtC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,KAAA,GAAQ,KAAA;AACR,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,KAAA,IAAS,IAAA,GAAO,MAAM,CAAC,CAAA,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,EAAG;AAC7D,QAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG;AAC/C,QAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AACjB,QAAA,IAAA,CAAK,GAAA,CAAI,KAAK,GAAG,CAAA;AACjB,QAAA,KAAA,CAAM,KAAA,EAAM;AACZ,QAAA,KAAA,GAAQ,IAAA;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,CAAQ,MAAK,EAAE;AAC1C;AAEO,IAAM,cAAA,GAAiB,CAAC,SAAA,EAAwC,MAAA,KAAuC;AAC5G,EAAA,MAAM,WAAsB,EAAC;AAC7B,EAAA,MAAM,UAAkC,EAAC;AACzC,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,KAAA,CAAM,GAAA,CAAI,QAAA,EAAU,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACpE,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAC,KAAA,CAAM,GAAA,CAAI,UAAU,GAAA,CAAI,CAAC,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAE5E,EAAA,MAAM,SAAyD,EAAC;AAChE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,IAAA,GAAO,OAAO,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,QAAA,KAAa,SAAS,EAAE,CAAA;AAChE,IAAA,OAAA,CAAQ,QAAA,CAAS,EAAE,CAAA,GAAI,IAAA,CAAK,MAAA;AAI5B,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA;AACtE,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,IAAA,EAAM,SAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,qBAAA,EAAwB,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,IAAI,CAAC,CAAA,KAAM,EAAE,CAAC,CAAC,CAAC,CAAA,kBAAA,EAAqB,QAAA,CAAS,WAAW,MAAM,CAAA,sCAAA;AAAA,OAC/H,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,UAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,SAAA,IAAa,SAAS,UAAA,EAAY;AAC3C,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACnC,MAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,QAAA,OAAA,CAAQ,KAAK,SAAS,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,GAAA,CAAI,QAAA,KAAa,SAAA,CAAU,QAAA,EAAU;AAC9C,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,IAAA,EAAM,QAAA;AAAA,UACN,MAAA,EAAQ,GAAG,SAAA,CAAU,GAAG,MAAM,SAAA,CAAU,WAAW,CAAA,eAAA,EAAkB,GAAA,CAAI,SAAS,CAAA,2FAAA;AAAA,SACnF,CAAA;AAAA,MACH;AAAA,IACF;AAGA,IAAA,MAAM,YAAA,GAAe,QAAQ,CAAC,CAAA;AAC9B,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,IAAA,CAAK,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AAC5E,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,EAAA,EAAK,YAAA,CAAa,GAAG,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,IACvI;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,SAAS,CAAA;AAAA,EAC1C;AAGA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,SAAA,CAAU,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAC,CAAA;AACjF,EAAA,KAAA,MAAW,EAAE,OAAA,EAAQ,IAAK,MAAA,EAAQ;AAChC,IAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,MAAA,KAAA,MAAW,UAAA,IAAc,UAAU,SAAA,EAAW;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAA,CAAI,UAAU,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,UAAU,CAAA,EAAG;AACtD,UAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,MAAA,EAAQ,CAAA,EAAG,SAAA,CAAU,GAAG,CAAA,YAAA,EAAe,UAAU,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,QACzJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAM,GAAI,YAAA,CAAa,QAAQ,IAAI,CAAA;AACpD,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,CAAC,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,oBAAoB,CAAA,EAAG;AAC9E,IAAA,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,MAAA,EAAQ,+CAA+C,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAG,CAAA,CAAE,KAAK,IAAI,CAAC,KAAK,CAAA;AAAA,EAC/H;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,QAAA,EAAS;AACtC;AAGO,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqB;AAClD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,IAAI,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,0CAAA,EAA4C,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,IAAI,KAAK,CAAA,CAAE,MAAM,EAAE,CAAC,CAAA;AAClI","file":"chunk-U5CPF4LQ.js","sourcesContent":["import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// The grammar of a migration.\n//\n// A SEQUENCE is an append-only list of migrations owned by one grammar owner —\n// a package's tables (`nisc.vex.cache`), a package's documents (`nisc.nova`,\n// later), an app's own (`midas.app`). A migration's number is its POSITION, so\n// the sequence's version is its length: nobody bumps a number, you append.\n//\n// Sequences are data. They are authored in TS for type-checking, but nothing\n// here is a function, so a sequence can be stored, shipped and inspected like\n// every other nisc artifact — and is parsed at the boundary like one.\n// ═══════════════════════════════════════════════════════════════\n\n// Namespaced, lowercase: `<owner>.<name>[.<name>…]`. The owner prefix keeps two\n// packages (or a package and an app) from ever claiming the same sequence.\nexport const SEQUENCE_ID = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+$/;\n\n// `<sequence>/<n>` — how a migration is named everywhere: the ledger, a\n// dependency, an error.\nexport const MIGRATION_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[1-9][0-9]*$/;\n\n// A document kind, named by its owner: `<sequence>/<kind>`, e.g.\n// \"nisc.nova/layout\". The kind part is a plain lowercase word.\nexport const KIND_NAME = /^[a-z][a-z0-9-]*$/;\nexport const KIND_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[a-z][a-z0-9-]*$/;\n\n// Where, inside a document, another document sits. Dot-separated keys, with\n// two wildcards that say WHICH shape they cross — `children[]` is every item of\n// the array at `children`, `endpoints.*` every value of the record at\n// `endpoints`. Kept apart on purpose: nova's `children` is a single node OR an\n// array, and one wildcard for both would read a lone node's `props` as layouts.\nexport const EMBED_PATH = /^([A-Za-z_$][\\w$]*|\\*)(\\[\\])?(\\.([A-Za-z_$][\\w$]*|\\*)(\\[\\])?)*$/;\n\nexport const SqlStepSchema = z\n .object({\n kind: z.literal('sql'),\n sql: z\n .string()\n .min(1)\n .describe(\n 'ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string ' +\n 'carrying several — split them into steps rather than joining them with semicolons.',\n ),\n })\n .strict()\n .describe('A statement run against the database, inside the migration transaction.');\n\nexport const DocumentStepSchema = z\n .object({\n kind: z.literal('document'),\n at: z\n .string()\n .regex(KIND_REF)\n .describe('The kind of document this step rewrites, e.g. \"nisc.nova/layout\" — wherever one sits, at any depth.'),\n transform: z\n .unknown()\n .describe(\n 'A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of ' +\n 'the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the ' +\n 'grammar\\'s embeddings and rewritten on their own, deepest first — a transform only ever sees one flat node.',\n ),\n })\n .strict()\n .describe('A rewrite of stored JSON documents of one kind.');\n\nexport const StepSchema = z.discriminatedUnion('kind', [SqlStepSchema, DocumentStepSchema]);\n\nexport const DocumentKindSchema = z\n .object({\n embeds: z\n .record(z.string().regex(EMBED_PATH), z.string().regex(KIND_REF))\n .optional()\n .describe('Where other documents sit inside this one: path → the kind found there (possibly this kind itself).'),\n })\n .strict();\n\nexport const MigrationSchema = z\n .object({\n description: z\n .string()\n .min(1)\n .describe('One sentence: what this migration does. It is the changelog line and the ledger\\'s description.'),\n steps: z\n .array(StepSchema)\n .describe(\n 'Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: ' +\n 'the version moves and nothing runs — how an addition to a strict grammar tells older readers to refuse.',\n ),\n dependsOn: z\n .array(z.string().regex(MIGRATION_REF))\n .optional()\n .describe('Migrations of OTHER sequences that must be applied first, each as \"<sequence>/<n>\".'),\n })\n .strict();\n\nexport const SequenceSchema = z\n .object({\n id: z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. \"nisc.vex.cache\" or \"midas.app\".'),\n documents: z\n .record(z.string().regex(KIND_NAME), DocumentKindSchema)\n .optional()\n .describe('The document kinds this sequence owns (a GRAMMAR sequence), each named \"<id>/<kind>\" elsewhere.'),\n migrations: z\n .array(MigrationSchema)\n .describe('Append-only. A migration is numbered by its position (from 1); the sequence\\'s version is its length.'),\n })\n .strict()\n // TWO KINDS OF OWNER. A table sequence (sql steps) is recorded per DATABASE,\n // in its ledger. A grammar sequence (document steps) is tracked per DOCUMENT,\n // by the stamp the document carries — because documents travel: an add-on\n // built on older code submits older documents to a newer host. One sequence\n // cannot be both; the two versions would mean different things.\n .superRefine((sequence, ctx) => {\n const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));\n if (kinds.has('sql') && (kinds.has('document') || sequence.documents !== undefined)) {\n ctx.addIssue({\n code: 'custom',\n message: 'A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both.',\n });\n }\n });\n\nexport type SqlStep = z.infer<typeof SqlStepSchema>;\nexport type DocumentStep = z.infer<typeof DocumentStepSchema>;\nexport type DocumentKind = z.infer<typeof DocumentKindSchema>;\nexport type Step = z.infer<typeof StepSchema>;\nexport type Migration = z.infer<typeof MigrationSchema>;\nexport type Sequence = z.infer<typeof SequenceSchema>;\n","import type { Migration } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// What a migration DID, as a hash — the ledger's proof that the code still says\n// what the database ran.\n//\n// Over the steps only. The description is prose: fixing a typo in it must not\n// read as an edited migration. `dependsOn` orders, it does not act. The steps\n// are the effect, and changing an applied step is the one thing that has to\n// be refused — the database already holds the old effect.\n//\n// For the same reason a step's SQL is hashed without its full-line comments\n// (`-- …` on a line of its own) and without trailing whitespace: a migration\n// can carry its documentation verbatim, and rewording it is not an edit.\n//\n// WebCrypto (SHA-256), which Node ≥ 22 and every browser carry as\n// `crypto.subtle` — the same primitive Prism fingerprints with, so strata runs\n// unchanged in a server, a test and the showroom page.\n// ═══════════════════════════════════════════════════════════════\n\n// Sorted keys, recursively: the same value always serializes the same way,\n// whatever order its object literal was written in.\nconst canonical = (value: unknown): string => {\n if (Array.isArray(value)) return `[${value.map(canonical).join(',')}]`;\n if (value !== null && typeof value === 'object') {\n const entries = Object.entries(value)\n .filter(([, v]) => v !== undefined)\n .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0));\n return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(',')}}`;\n }\n return JSON.stringify(value);\n};\n\nconst effectOf = (sql: string): string =>\n sql\n .split('\\n')\n .filter((line) => !line.trimStart().startsWith('--'))\n .map((line) => line.trimEnd())\n .join('\\n')\n .trim();\n\nexport const checksumOf = async (migration: Migration): Promise<string> => {\n const steps = migration.steps.map((step) => (step.kind === 'sql' ? { ...step, sql: effectOf(step.sql) } : step));\n const bytes = new TextEncoder().encode(canonical(steps));\n const digest = await crypto.subtle.digest('SHA-256', bytes);\n return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, '0')).join('');\n};\n","import { SequenceSchema, type DocumentKind, type Sequence, type Step } from './schema';\nimport { checksumOf } from './checksum';\nimport { StrataError, type StrataErrorCode } from './errors';\n\n// ═══════════════════════════════════════════════════════════════\n// The plan — what the code says, against what the database has run.\n//\n// Pure: sequences and ledger rows in, a plan out. No database, no clock. The\n// postgres runner reads the ledger, calls this, and applies what it says; a\n// showroom page or a CI check can call it with a ledger it made up.\n// ═══════════════════════════════════════════════════════════════\n\n// A migration the code declares, numbered and hashed.\nexport type PreparedMigration = {\n sequence: string;\n n: number;\n ref: string;\n description: string;\n checksum: string;\n steps: readonly Step[];\n dependsOn: readonly string[];\n};\n\nexport type PreparedSequence = {\n id: string;\n // A grammar sequence owns documents (tracked by stamps); otherwise it owns\n // tables (tracked by a database's ledger). See SequenceSchema.\n grammar: boolean;\n documents: Readonly<Record<string, DocumentKind>>;\n migrations: readonly PreparedMigration[];\n};\n\n// One row of the ledger, as a runner read it back.\nexport type LedgerRow = { sequence: string; n: number; checksum: string; description: string; appliedAt: string };\n\nexport type Problem = { code: Exclude<StrataErrorCode, 'PENDING' | 'STEP_FAILED' | 'NO_TRANSACTION' | 'UNKNOWN_KIND' | 'WRONG_OWNER'>; detail: string };\n\nexport type Plan = {\n // Already run, per sequence this code knows: how far each one is.\n applied: Readonly<Record<string, number>>;\n // To run, in the order they must run.\n pending: readonly PreparedMigration[];\n // Anything that makes applying unsafe. A plan with problems is never applied.\n problems: readonly Problem[];\n};\n\nconst refOf = (sequence: string, n: number): string => `${sequence}/${n}`;\n\n// Parse, number and hash. Async only for the hash (WebCrypto).\nexport const prepare = async (sequences: readonly Sequence[]): Promise<readonly PreparedSequence[]> => {\n const seen = new Set<string>();\n const prepared: PreparedSequence[] = [];\n for (const input of sequences) {\n const parsed = SequenceSchema.safeParse(input);\n if (!parsed.success) {\n const issues = parsed.error.issues.map((i) => `${i.path.join('.') || '(root)'}: ${i.message}`);\n throw new StrataError('INVALID_SEQUENCE', `A sequence does not parse${typeof input.id === 'string' ? ` (\"${input.id}\")` : ''}.`, issues);\n }\n const sequence = parsed.data;\n if (seen.has(sequence.id)) {\n throw new StrataError('INVALID_SEQUENCE', `Two sequences are both called \"${sequence.id}\" — a sequence id names one owner.`);\n }\n seen.add(sequence.id);\n const migrations: PreparedMigration[] = [];\n for (const [index, migration] of sequence.migrations.entries()) {\n const n = index + 1;\n migrations.push({\n sequence: sequence.id,\n n,\n ref: refOf(sequence.id, n),\n description: migration.description,\n checksum: await checksumOf(migration),\n steps: migration.steps,\n dependsOn: migration.dependsOn ?? [],\n });\n }\n const grammar = sequence.documents !== undefined || sequence.migrations.some((m) => m.steps.some((s) => s.kind === 'document'));\n prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });\n }\n return prepared;\n};\n\n// Order: walk the sequences in the order given, and let each run as far as its\n// dependencies allow before moving on; repeat until nothing moves. The same\n// input always yields the same order, and a sequence's own migrations stay\n// together unless a dependency splits them. Shared by the ledger's plan and a\n// document's upgrade, so both order the same migrations the same way.\nexport const orderPending = (\n queues: readonly { waiting: readonly PreparedMigration[] }[],\n alreadyDone: ReadonlySet<string>,\n): { pending: PreparedMigration[]; stuck: PreparedMigration[] } => {\n const done = new Set(alreadyDone);\n const waiting = queues.map((q) => [...q.waiting]);\n const pending: PreparedMigration[] = [];\n let moved = true;\n while (moved) {\n moved = false;\n for (const queue of waiting) {\n for (let head = queue[0]; head !== undefined; head = queue[0]) {\n if (!head.dependsOn.every((d) => done.has(d))) break;\n pending.push(head);\n done.add(head.ref);\n queue.shift();\n moved = true;\n }\n }\n }\n return { pending, stuck: waiting.flat() };\n};\n\nexport const planMigrations = (sequences: readonly PreparedSequence[], ledger: readonly LedgerRow[]): Plan => {\n const problems: Problem[] = [];\n const applied: Record<string, number> = {};\n const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));\n const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));\n\n const queues: { id: string; waiting: PreparedMigration[] }[] = [];\n for (const sequence of sequences) {\n const rows = ledger.filter((row) => row.sequence === sequence.id);\n applied[sequence.id] = rows.length;\n\n // The database ran migrations this code has never seen: newer code migrated\n // it. Applying ours on top would be guessing — refuse.\n const beyond = rows.filter((row) => row.n > sequence.migrations.length);\n if (beyond.length > 0) {\n problems.push({\n code: 'TOO_NEW',\n detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} — it was migrated by newer code.`,\n });\n }\n\n const waiting: PreparedMigration[] = [];\n for (const migration of sequence.migrations) {\n const row = byRef.get(migration.ref);\n if (row === undefined) {\n waiting.push(migration);\n } else if (row.checksum !== migration.checksum) {\n problems.push({\n code: 'EDITED',\n detail: `${migration.ref} (\"${migration.description}\") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history — append a new one.`,\n });\n }\n }\n // A hole: something later ran, something earlier did not. The ledger was\n // written by hand, or by a different ordering of the same sequence.\n const firstWaiting = waiting[0];\n if (firstWaiting !== undefined && rows.some((row) => row.n > firstWaiting.n)) {\n problems.push({ code: 'EDITED', detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });\n }\n queues.push({ id: sequence.id, waiting });\n }\n\n // Every dependency must be satisfiable by the ledger or by this plan.\n const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));\n for (const { waiting } of queues) {\n for (const migration of waiting) {\n for (const dependency of migration.dependsOn) {\n if (!done.has(dependency) && !provided.has(dependency)) {\n problems.push({ code: 'UNKNOWN_DEPENDENCY', detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });\n }\n }\n }\n }\n\n const { pending, stuck } = orderPending(queues, done);\n if (stuck.length > 0 && !problems.some((p) => p.code === 'UNKNOWN_DEPENDENCY')) {\n problems.push({ code: 'CYCLE', detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(', ')}.` });\n }\n\n return { applied, pending, problems };\n};\n\n// Throw the plan's problems as one error, named by the first.\nexport const refuseProblems = (plan: Plan): void => {\n const first = plan.problems[0];\n if (first === undefined) return;\n throw new StrataError(first.code, 'The migrations cannot be applied safely.', plan.problems.map((p) => `${p.code}: ${p.detail}`));\n};\n"]}
1
+ {"version":3,"sources":["../src/schema.ts","../src/checksum.ts","../src/plan.ts"],"names":[],"mappings":";;;AAiBO,IAAM,WAAA,GAAc;AAIpB,IAAM,aAAA,GAAgB;AAItB,IAAM,SAAA,GAAY;AAClB,IAAM,QAAA,GAAW;AAOjB,IAAM,UAAA,GAAa;AAEnB,IAAM,aAAA,GAAgB,EAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,CAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EACrB,KAAK,CAAA,CACF,MAAA,EAAO,CACP,GAAA,CAAI,CAAC,CAAA,CACL,QAAA;AAAA,IACC;AAAA;AAGN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yEAAyE;AAE9E,IAAM,kBAAA,GAAqB,EAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAM,CAAA,CAAE,OAAA,CAAQ,UAAU,CAAA;AAAA,EAC1B,EAAA,EAAI,EACD,MAAA,EAAO,CACP,MAAM,QAAQ,CAAA,CACd,SAAS,0GAAqG,CAAA;AAAA,EACjH,SAAA,EAAW,CAAA,CACR,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA;AAIN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD;AAEtD,IAAM,aAAa,CAAA,CAAE,kBAAA,CAAmB,QAAQ,CAAC,aAAA,EAAe,kBAAkB,CAAC;AAEnF,IAAM,kBAAA,GAAqB,EAC/B,MAAA,CAAO;AAAA,EACN,QAAQ,CAAA,CACL,MAAA,CAAO,EAAE,MAAA,EAAO,CAAE,MAAM,UAAU,CAAA,EAAG,EAAE,MAAA,EAAO,CAAE,MAAM,QAAQ,CAAC,EAC/D,QAAA,EAAS,CACT,SAAS,0GAAqG;AACnH,CAAC,EACA,MAAA;AAEI,IAAM,eAAA,GAAkB,EAC5B,MAAA,CAAO;AAAA,EACN,WAAA,EAAa,EACV,MAAA,EAAO,CACP,IAAI,CAAC,CAAA,CACL,SAAS,gGAAiG,CAAA;AAAA,EAC7G,KAAA,EAAO,CAAA,CACJ,KAAA,CAAM,UAAU,CAAA,CAChB,QAAA;AAAA,IACC;AAAA,GAEF;AAAA,EACF,SAAA,EAAW,CAAA,CACR,KAAA,CAAM,CAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,aAAa,CAAC,CAAA,CACrC,QAAA,EAAS,CACT,SAAS,qFAAqF;AACnG,CAAC,EACA,MAAA;AAEI,IAAM,cAAA,GAAiB,EAC3B,MAAA,CAAO;AAAA,EACN,EAAA,EAAI,EAAE,MAAA,EAAO,CAAE,MAAM,WAAW,CAAA,CAAE,SAAS,iEAAiE,CAAA;AAAA,EAC5G,SAAA,EAAW,CAAA,CACR,MAAA,CAAO,CAAA,CAAE,QAAO,CAAE,KAAA,CAAM,SAAS,CAAA,EAAG,kBAAkB,CAAA,CACtD,QAAA,EAAS,CACT,SAAS,iGAAiG,CAAA;AAAA,EAC7G,YAAY,CAAA,CACT,KAAA,CAAM,eAAe,CAAA,CACrB,SAAS,sGAAuG;AACrH,CAAC,EACA,MAAA,EAAO,CAMP,WAAA,CAAY,CAAC,UAAU,GAAA,KAAQ;AAC9B,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,QAAA,CAAS,UAAA,CAAW,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AACpF,EAAA,IAAI,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,KAAM,KAAA,CAAM,IAAI,UAAU,CAAA,IAAK,QAAA,CAAS,SAAA,KAAc,MAAA,CAAA,EAAY;AACnF,IAAA,GAAA,CAAI,QAAA,CAAS;AAAA,MACX,IAAA,EAAM,QAAA;AAAA,MACN,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AACF,CAAC;;;ACpGH,IAAM,SAAA,GAAY,CAAC,KAAA,KAA2B;AAC5C,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACnE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACjC,MAAA,CAAO,CAAC,GAAG,CAAC,CAAA,KAAM,CAAA,KAAM,MAAS,CAAA,CACjC,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA;AAClD,IAAA,OAAO,CAAA,CAAA,EAAI,QAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,IAAA,CAAK,UAAU,CAAC,CAAC,IAAI,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACtF;AACA,EAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC7B,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,GAAA,KAChB,GAAA,CACG,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,SAAA,EAAU,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,CACnD,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,CAAA,CAC5B,IAAA,CAAK,IAAI,CAAA,CACT,IAAA,EAAK;AAEH,IAAM,UAAA,GAAa,OAAO,SAAA,KAA0C;AACzE,EAAA,MAAM,QAAQ,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,IAAA,KAAU,KAAK,IAAA,KAAS,KAAA,GAAQ,EAAE,GAAG,MAAM,GAAA,EAAK,QAAA,CAAS,KAAK,GAAG,CAAA,KAAM,IAAK,CAAA;AAC/G,EAAA,MAAM,QAAQ,IAAI,WAAA,GAAc,MAAA,CAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AACvD,EAAA,MAAM,SAAS,MAAM,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,WAAW,KAAK,CAAA;AAC1D,EAAA,OAAO,MAAM,IAAA,CAAK,IAAI,WAAW,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,KAAK,EAAE,CAAA;AAC3F;;;ACAA,IAAM,QAAQ,CAAC,QAAA,EAAkB,MAAsB,CAAA,EAAG,QAAQ,IAAI,CAAC,CAAA,CAAA;AAGhE,IAAM,OAAA,GAAU,OAAO,SAAA,KAAyE;AACrG,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAC7B,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,SAAA,CAAU,KAAK,CAAA;AAC7C,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,IAAA,CAAK,KAAK,GAAG,CAAA,IAAK,QAAQ,CAAA,EAAA,EAAK,CAAA,CAAE,OAAO,CAAA,CAAE,CAAA;AAC7F,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,yBAAA,EAA4B,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,CAAA,GAAA,EAAM,KAAA,CAAM,EAAE,CAAA,EAAA,CAAA,GAAO,EAAE,KAAK,MAAM,CAAA;AAAA,IACzI;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,IAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA,EAAG;AACzB,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,+BAAA,EAAkC,QAAA,CAAS,EAAE,CAAA,uCAAA,CAAoC,CAAA;AAAA,IAC7H;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,SAAS,EAAE,CAAA;AACpB,IAAA,MAAM,aAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,SAAS,KAAK,QAAA,CAAS,UAAA,CAAW,SAAQ,EAAG;AAC9D,MAAA,MAAM,IAAI,KAAA,GAAQ,CAAA;AAClB,MAAA,UAAA,CAAW,IAAA,CAAK;AAAA,QACd,UAAU,QAAA,CAAS,EAAA;AAAA,QACnB,CAAA;AAAA,QACA,GAAA,EAAK,KAAA,CAAM,QAAA,CAAS,EAAA,EAAI,CAAC,CAAA;AAAA,QACzB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,QAAA,EAAU,MAAM,UAAA,CAAW,SAAS,CAAA;AAAA,QACpC,OAAO,SAAA,CAAU,KAAA;AAAA,QACjB,SAAA,EAAW,SAAA,CAAU,SAAA,IAAa;AAAC,OACpC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,UAAU,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,UAAU,CAAC,CAAA;AAC9H,IAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,OAAA,EAAS,SAAA,EAAW,QAAA,CAAS,SAAA,IAAa,EAAC,EAAG,UAAA,EAAY,CAAA;AAAA,EAC7F;AACA,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,YAAA,GAAe,CAC1B,MAAA,EACA,WAAA,KACiE;AACjE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,WAAW,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAA,CAAE,OAAO,CAAC,CAAA;AAChD,EAAA,MAAM,UAA+B,EAAC;AACtC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,KAAA,GAAQ,KAAA;AACR,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,KAAA,IAAS,IAAA,GAAO,MAAM,CAAC,CAAA,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,EAAG;AAC7D,QAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG;AAC/C,QAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AACjB,QAAA,IAAA,CAAK,GAAA,CAAI,KAAK,GAAG,CAAA;AACjB,QAAA,KAAA,CAAM,KAAA,EAAM;AACZ,QAAA,KAAA,GAAQ,IAAA;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,CAAQ,MAAK,EAAE;AAC1C;AAEO,IAAM,cAAA,GAAiB,CAAC,SAAA,EAAwC,MAAA,KAAuC;AAC5G,EAAA,MAAM,WAAsB,EAAC;AAC7B,EAAA,MAAM,UAAkC,EAAC;AACzC,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,KAAA,CAAM,GAAA,CAAI,QAAA,EAAU,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACpE,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAC,KAAA,CAAM,GAAA,CAAI,UAAU,GAAA,CAAI,CAAC,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAE5E,EAAA,MAAM,SAAyD,EAAC;AAChE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,IAAA,GAAO,OAAO,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,QAAA,KAAa,SAAS,EAAE,CAAA;AAChE,IAAA,OAAA,CAAQ,QAAA,CAAS,EAAE,CAAA,GAAI,IAAA,CAAK,MAAA;AAI5B,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA;AACtE,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,IAAA,EAAM,SAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,qBAAA,EAAwB,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,IAAI,CAAC,CAAA,KAAM,EAAE,CAAC,CAAC,CAAC,CAAA,kBAAA,EAAqB,QAAA,CAAS,WAAW,MAAM,CAAA,sCAAA;AAAA,OAC/H,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,UAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,SAAA,IAAa,SAAS,UAAA,EAAY;AAC3C,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACnC,MAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,QAAA,OAAA,CAAQ,KAAK,SAAS,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,GAAA,CAAI,QAAA,KAAa,SAAA,CAAU,QAAA,EAAU;AAC9C,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,IAAA,EAAM,QAAA;AAAA,UACN,MAAA,EAAQ,GAAG,SAAA,CAAU,GAAG,MAAM,SAAA,CAAU,WAAW,CAAA,eAAA,EAAkB,GAAA,CAAI,SAAS,CAAA,2FAAA;AAAA,SACnF,CAAA;AAAA,MACH;AAAA,IACF;AAGA,IAAA,MAAM,YAAA,GAAe,QAAQ,CAAC,CAAA;AAC9B,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,IAAA,CAAK,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AAC5E,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,EAAA,EAAK,YAAA,CAAa,GAAG,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,IACvI;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,SAAS,CAAA;AAAA,EAC1C;AAGA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,SAAA,CAAU,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAC,CAAA;AACjF,EAAA,KAAA,MAAW,EAAE,OAAA,EAAQ,IAAK,MAAA,EAAQ;AAChC,IAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,MAAA,KAAA,MAAW,UAAA,IAAc,UAAU,SAAA,EAAW;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAA,CAAI,UAAU,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,UAAU,CAAA,EAAG;AACtD,UAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,MAAA,EAAQ,CAAA,EAAG,SAAA,CAAU,GAAG,CAAA,YAAA,EAAe,UAAU,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,QACzJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAM,GAAI,YAAA,CAAa,QAAQ,IAAI,CAAA;AACpD,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,CAAC,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,oBAAoB,CAAA,EAAG;AAC9E,IAAA,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,MAAA,EAAQ,+CAA+C,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAG,CAAA,CAAE,KAAK,IAAI,CAAC,KAAK,CAAA;AAAA,EAC/H;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,QAAA,EAAS;AACtC;AAGO,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqB;AAClD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,IAAI,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,0CAAA,EAA4C,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,IAAI,KAAK,CAAA,CAAE,MAAM,EAAE,CAAC,CAAA;AAClI","file":"chunk-5KTXEN43.js","sourcesContent":["import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// The grammar of a migration.\n//\n// A SEQUENCE is an append-only list of migrations owned by one grammar owner —\n// a package's tables (`nisc.vex.cache`), a package's documents (`nisc.nova`,\n// later), an app's own (`midas.app`). A migration's number is its POSITION, so\n// the sequence's version is its length: nobody bumps a number, you append.\n//\n// Sequences are data. They are authored in TS for type-checking, but nothing\n// here is a function, so a sequence can be stored, shipped and inspected like\n// every other nisc artifact — and is parsed at the boundary like one.\n// ═══════════════════════════════════════════════════════════════\n\n// Namespaced, lowercase: `<owner>.<name>[.<name>…]`. The owner prefix keeps two\n// packages (or a package and an app) from ever claiming the same sequence.\nexport const SEQUENCE_ID = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+$/;\n\n// `<sequence>/<n>` — how a migration is named everywhere: the ledger, a\n// dependency, an error.\nexport const MIGRATION_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[1-9][0-9]*$/;\n\n// A document kind, named by its owner: `<sequence>/<kind>`, e.g.\n// \"nisc.nova/layout\". The kind part is a plain lowercase word.\nexport const KIND_NAME = /^[a-z][a-z0-9-]*$/;\nexport const KIND_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[a-z][a-z0-9-]*$/;\n\n// Where, inside a document, another document sits. Dot-separated keys, with\n// two wildcards that say WHICH shape they cross — `children[]` is every item of\n// the array at `children`, `endpoints.*` every value of the record at\n// `endpoints`. Kept apart on purpose: nova's `children` is a single node OR an\n// array, and one wildcard for both would read a lone node's `props` as layouts.\nexport const EMBED_PATH = /^([A-Za-z_$][\\w$]*|\\*)(\\[\\])?(\\.([A-Za-z_$][\\w$]*|\\*)(\\[\\])?)*$/;\n\nexport const SqlStepSchema = z\n .object({\n kind: z.literal('sql'),\n sql: z\n .string()\n .min(1)\n .describe(\n 'ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string ' +\n 'carrying several — split them into steps rather than joining them with semicolons.',\n ),\n })\n .strict()\n .describe('A statement run against the database, inside the migration transaction.');\n\nexport const DocumentStepSchema = z\n .object({\n kind: z.literal('document'),\n at: z\n .string()\n .regex(KIND_REF)\n .describe('The kind of document this step rewrites, e.g. \"nisc.nova/layout\" — wherever one sits, at any depth.'),\n transform: z\n .unknown()\n .describe(\n 'A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of ' +\n 'the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the ' +\n 'grammar\\'s embeddings and rewritten on their own, deepest first — a transform only ever sees one flat node.',\n ),\n })\n .strict()\n .describe('A rewrite of stored JSON documents of one kind.');\n\nexport const StepSchema = z.discriminatedUnion('kind', [SqlStepSchema, DocumentStepSchema]);\n\nexport const DocumentKindSchema = z\n .object({\n embeds: z\n .record(z.string().regex(EMBED_PATH), z.string().regex(KIND_REF))\n .optional()\n .describe('Where other documents sit inside this one: path → the kind found there (possibly this kind itself).'),\n })\n .strict();\n\nexport const MigrationSchema = z\n .object({\n description: z\n .string()\n .min(1)\n .describe('One sentence: what this migration does. It is the changelog line and the ledger\\'s description.'),\n steps: z\n .array(StepSchema)\n .describe(\n 'Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: ' +\n 'the version moves and nothing runs — how an addition to a strict grammar tells older readers to refuse.',\n ),\n dependsOn: z\n .array(z.string().regex(MIGRATION_REF))\n .optional()\n .describe('Migrations of OTHER sequences that must be applied first, each as \"<sequence>/<n>\".'),\n })\n .strict();\n\nexport const SequenceSchema = z\n .object({\n id: z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. \"nisc.vex.cache\" or \"midas.app\".'),\n documents: z\n .record(z.string().regex(KIND_NAME), DocumentKindSchema)\n .optional()\n .describe('The document kinds this sequence owns (a GRAMMAR sequence), each named \"<id>/<kind>\" elsewhere.'),\n migrations: z\n .array(MigrationSchema)\n .describe('Append-only. A migration is numbered by its position (from 1); the sequence\\'s version is its length.'),\n })\n .strict()\n // TWO KINDS OF OWNER. A table sequence (sql steps) is recorded per DATABASE,\n // in its ledger. A grammar sequence (document steps) is tracked per DOCUMENT,\n // by the stamp the document carries — because documents travel: an add-on\n // built on older code submits older documents to a newer host. One sequence\n // cannot be both; the two versions would mean different things.\n .superRefine((sequence, ctx) => {\n const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));\n if (kinds.has('sql') && (kinds.has('document') || sequence.documents !== undefined)) {\n ctx.addIssue({\n code: 'custom',\n message: 'A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both.',\n });\n }\n });\n\nexport type SqlStep = z.infer<typeof SqlStepSchema>;\nexport type DocumentStep = z.infer<typeof DocumentStepSchema>;\nexport type DocumentKind = z.infer<typeof DocumentKindSchema>;\nexport type Step = z.infer<typeof StepSchema>;\nexport type Migration = z.infer<typeof MigrationSchema>;\nexport type Sequence = z.infer<typeof SequenceSchema>;\n","import type { Migration } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// What a migration DID, as a hash — the ledger's proof that the code still says\n// what the database ran.\n//\n// Over the steps only. The description is prose: fixing a typo in it must not\n// read as an edited migration. `dependsOn` orders, it does not act. The steps\n// are the effect, and changing an applied step is the one thing that has to\n// be refused — the database already holds the old effect.\n//\n// For the same reason a step's SQL is hashed without its full-line comments\n// (`-- …` on a line of its own) and without trailing whitespace: a migration\n// can carry its documentation verbatim, and rewording it is not an edit.\n//\n// WebCrypto (SHA-256), which Node ≥ 22 and every browser carry as\n// `crypto.subtle` — the same primitive Prism fingerprints with, so strata runs\n// unchanged in a server, a test and the showroom page.\n// ═══════════════════════════════════════════════════════════════\n\n// Sorted keys, recursively: the same value always serializes the same way,\n// whatever order its object literal was written in.\nconst canonical = (value: unknown): string => {\n if (Array.isArray(value)) return `[${value.map(canonical).join(',')}]`;\n if (value !== null && typeof value === 'object') {\n const entries = Object.entries(value)\n .filter(([, v]) => v !== undefined)\n .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0));\n return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(',')}}`;\n }\n return JSON.stringify(value);\n};\n\nconst effectOf = (sql: string): string =>\n sql\n .split('\\n')\n .filter((line) => !line.trimStart().startsWith('--'))\n .map((line) => line.trimEnd())\n .join('\\n')\n .trim();\n\nexport const checksumOf = async (migration: Migration): Promise<string> => {\n const steps = migration.steps.map((step) => (step.kind === 'sql' ? { ...step, sql: effectOf(step.sql) } : step));\n const bytes = new TextEncoder().encode(canonical(steps));\n const digest = await crypto.subtle.digest('SHA-256', bytes);\n return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, '0')).join('');\n};\n","import { SequenceSchema, type DocumentKind, type Sequence, type Step } from './schema';\nimport { checksumOf } from './checksum';\nimport { StrataError, type StrataErrorCode } from './errors';\n\n// ═══════════════════════════════════════════════════════════════\n// The plan — what the code says, against what the database has run.\n//\n// Pure: sequences and ledger rows in, a plan out. No database, no clock. The\n// postgres runner reads the ledger, calls this, and applies what it says; a\n// showroom page or a CI check can call it with a ledger it made up.\n// ═══════════════════════════════════════════════════════════════\n\n// A migration the code declares, numbered and hashed.\nexport type PreparedMigration = {\n sequence: string;\n n: number;\n ref: string;\n description: string;\n checksum: string;\n steps: readonly Step[];\n dependsOn: readonly string[];\n};\n\nexport type PreparedSequence = {\n id: string;\n // A grammar sequence owns documents (tracked by stamps); otherwise it owns\n // tables (tracked by a database's ledger). See SequenceSchema.\n grammar: boolean;\n documents: Readonly<Record<string, DocumentKind>>;\n migrations: readonly PreparedMigration[];\n};\n\n// One row of the ledger, as a runner read it back.\nexport type LedgerRow = { sequence: string; n: number; checksum: string; description: string; appliedAt: string };\n\nexport type Problem = { code: Exclude<StrataErrorCode, 'PENDING' | 'STEP_FAILED' | 'DOES_NOT_FIT' | 'NO_TRANSACTION' | 'UNKNOWN_KIND' | 'WRONG_OWNER'>; detail: string };\n\nexport type Plan = {\n // Already run, per sequence this code knows: how far each one is.\n applied: Readonly<Record<string, number>>;\n // To run, in the order they must run.\n pending: readonly PreparedMigration[];\n // Anything that makes applying unsafe. A plan with problems is never applied.\n problems: readonly Problem[];\n};\n\nconst refOf = (sequence: string, n: number): string => `${sequence}/${n}`;\n\n// Parse, number and hash. Async only for the hash (WebCrypto).\nexport const prepare = async (sequences: readonly Sequence[]): Promise<readonly PreparedSequence[]> => {\n const seen = new Set<string>();\n const prepared: PreparedSequence[] = [];\n for (const input of sequences) {\n const parsed = SequenceSchema.safeParse(input);\n if (!parsed.success) {\n const issues = parsed.error.issues.map((i) => `${i.path.join('.') || '(root)'}: ${i.message}`);\n throw new StrataError('INVALID_SEQUENCE', `A sequence does not parse${typeof input.id === 'string' ? ` (\"${input.id}\")` : ''}.`, issues);\n }\n const sequence = parsed.data;\n if (seen.has(sequence.id)) {\n throw new StrataError('INVALID_SEQUENCE', `Two sequences are both called \"${sequence.id}\" — a sequence id names one owner.`);\n }\n seen.add(sequence.id);\n const migrations: PreparedMigration[] = [];\n for (const [index, migration] of sequence.migrations.entries()) {\n const n = index + 1;\n migrations.push({\n sequence: sequence.id,\n n,\n ref: refOf(sequence.id, n),\n description: migration.description,\n checksum: await checksumOf(migration),\n steps: migration.steps,\n dependsOn: migration.dependsOn ?? [],\n });\n }\n const grammar = sequence.documents !== undefined || sequence.migrations.some((m) => m.steps.some((s) => s.kind === 'document'));\n prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });\n }\n return prepared;\n};\n\n// Order: walk the sequences in the order given, and let each run as far as its\n// dependencies allow before moving on; repeat until nothing moves. The same\n// input always yields the same order, and a sequence's own migrations stay\n// together unless a dependency splits them. Shared by the ledger's plan and a\n// document's upgrade, so both order the same migrations the same way.\nexport const orderPending = (\n queues: readonly { waiting: readonly PreparedMigration[] }[],\n alreadyDone: ReadonlySet<string>,\n): { pending: PreparedMigration[]; stuck: PreparedMigration[] } => {\n const done = new Set(alreadyDone);\n const waiting = queues.map((q) => [...q.waiting]);\n const pending: PreparedMigration[] = [];\n let moved = true;\n while (moved) {\n moved = false;\n for (const queue of waiting) {\n for (let head = queue[0]; head !== undefined; head = queue[0]) {\n if (!head.dependsOn.every((d) => done.has(d))) break;\n pending.push(head);\n done.add(head.ref);\n queue.shift();\n moved = true;\n }\n }\n }\n return { pending, stuck: waiting.flat() };\n};\n\nexport const planMigrations = (sequences: readonly PreparedSequence[], ledger: readonly LedgerRow[]): Plan => {\n const problems: Problem[] = [];\n const applied: Record<string, number> = {};\n const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));\n const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));\n\n const queues: { id: string; waiting: PreparedMigration[] }[] = [];\n for (const sequence of sequences) {\n const rows = ledger.filter((row) => row.sequence === sequence.id);\n applied[sequence.id] = rows.length;\n\n // The database ran migrations this code has never seen: newer code migrated\n // it. Applying ours on top would be guessing — refuse.\n const beyond = rows.filter((row) => row.n > sequence.migrations.length);\n if (beyond.length > 0) {\n problems.push({\n code: 'TOO_NEW',\n detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} — it was migrated by newer code.`,\n });\n }\n\n const waiting: PreparedMigration[] = [];\n for (const migration of sequence.migrations) {\n const row = byRef.get(migration.ref);\n if (row === undefined) {\n waiting.push(migration);\n } else if (row.checksum !== migration.checksum) {\n problems.push({\n code: 'EDITED',\n detail: `${migration.ref} (\"${migration.description}\") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history — append a new one.`,\n });\n }\n }\n // A hole: something later ran, something earlier did not. The ledger was\n // written by hand, or by a different ordering of the same sequence.\n const firstWaiting = waiting[0];\n if (firstWaiting !== undefined && rows.some((row) => row.n > firstWaiting.n)) {\n problems.push({ code: 'EDITED', detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });\n }\n queues.push({ id: sequence.id, waiting });\n }\n\n // Every dependency must be satisfiable by the ledger or by this plan.\n const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));\n for (const { waiting } of queues) {\n for (const migration of waiting) {\n for (const dependency of migration.dependsOn) {\n if (!done.has(dependency) && !provided.has(dependency)) {\n problems.push({ code: 'UNKNOWN_DEPENDENCY', detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });\n }\n }\n }\n }\n\n const { pending, stuck } = orderPending(queues, done);\n if (stuck.length > 0 && !problems.some((p) => p.code === 'UNKNOWN_DEPENDENCY')) {\n problems.push({ code: 'CYCLE', detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(', ')}.` });\n }\n\n return { applied, pending, problems };\n};\n\n// Throw the plan's problems as one error, named by the first.\nexport const refuseProblems = (plan: Plan): void => {\n const first = plan.problems[0];\n if (first === undefined) return;\n throw new StrataError(first.code, 'The migrations cannot be applied safely.', plan.problems.map((p) => `${p.code}: ${p.detail}`));\n};\n"]}
@@ -12,5 +12,5 @@ ${details.map((d) => ` ${d}`).join("\n")}` : message, options);
12
12
  };
13
13
 
14
14
  export { StrataError };
15
- //# sourceMappingURL=chunk-EGFF63GA.js.map
16
- //# sourceMappingURL=chunk-EGFF63GA.js.map
15
+ //# sourceMappingURL=chunk-AKKWEXO2.js.map
16
+ //# sourceMappingURL=chunk-AKKWEXO2.js.map
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/errors.ts"],"names":[],"mappings":";AA0BO,IAAM,WAAA,GAAN,cAA0B,KAAA,CAAM;AAAA,EAC5B,IAAA;AAAA,EACA,OAAA;AAAA,EAET,YAAY,IAAA,EAAuB,OAAA,EAAiB,OAAA,GAA6B,IAAI,OAAA,EAA+B;AAClH,IAAA,KAAA,CAAM,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,OAAO;AAAA,EAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,SAAS,OAAO,CAAA;AACtG,IAAA,IAAA,CAAK,IAAA,GAAO,aAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF","file":"chunk-EGFF63GA.js","sourcesContent":["// Every refusal strata makes, by name. The message is a sentence for a person;\n// the code is for the program that has to decide what to do about it.\nexport type StrataErrorCode =\n // A sequence failed its schema, or two sequences share an id.\n | 'INVALID_SEQUENCE'\n // An applied migration's steps no longer match what the code says it ran.\n | 'EDITED'\n // The database has migrations of a sequence this code does not know yet —\n // it was migrated by newer code.\n | 'TOO_NEW'\n // A `dependsOn` names a migration nobody provides and the ledger lacks.\n | 'UNKNOWN_DEPENDENCY'\n // Pending migrations wait on each other.\n | 'CYCLE'\n // Verify mode found work to do.\n | 'PENDING'\n // A step threw; the whole run was rolled back.\n | 'STEP_FAILED'\n // The pool cannot hold one connection for a transaction.\n | 'NO_TRANSACTION'\n // A document kind nobody declares — as the root being upgraded, a step's\n // `at`, or an embedding's target.\n | 'UNKNOWN_KIND'\n // A grammar sequence handed to the ledger, or a table sequence to upgrade().\n | 'WRONG_OWNER';\n\nexport class StrataError extends Error {\n readonly code: StrataErrorCode;\n readonly details: readonly string[];\n\n constructor(code: StrataErrorCode, message: string, details: readonly string[] = [], options?: { cause?: unknown }) {\n super(details.length > 0 ? `${message}\\n${details.map((d) => ` ${d}`).join('\\n')}` : message, options);\n this.name = 'StrataError';\n this.code = code;\n this.details = details;\n }\n}\n"]}
1
+ {"version":3,"sources":["../src/errors.ts"],"names":[],"mappings":";AA4BO,IAAM,WAAA,GAAN,cAA0B,KAAA,CAAM;AAAA,EAC5B,IAAA;AAAA,EACA,OAAA;AAAA,EAET,YAAY,IAAA,EAAuB,OAAA,EAAiB,OAAA,GAA6B,IAAI,OAAA,EAA+B;AAClH,IAAA,KAAA,CAAM,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,OAAO;AAAA,EAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,SAAS,OAAO,CAAA;AACtG,IAAA,IAAA,CAAK,IAAA,GAAO,aAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF","file":"chunk-AKKWEXO2.js","sourcesContent":["// Every refusal strata makes, by name. The message is a sentence for a person;\n// the code is for the program that has to decide what to do about it.\nexport type StrataErrorCode =\n // A sequence failed its schema, or two sequences share an id.\n | 'INVALID_SEQUENCE'\n // An applied migration's steps no longer match what the code says it ran.\n | 'EDITED'\n // The database has migrations of a sequence this code does not know yet —\n // it was migrated by newer code.\n | 'TOO_NEW'\n // A `dependsOn` names a migration nobody provides and the ledger lacks.\n | 'UNKNOWN_DEPENDENCY'\n // Pending migrations wait on each other.\n | 'CYCLE'\n // Verify mode found work to do.\n | 'PENDING'\n // A step threw; the whole run was rolled back.\n | 'STEP_FAILED'\n // The run's guard said the result does not fit; the whole run was rolled back.\n | 'DOES_NOT_FIT'\n // The pool cannot hold one connection for a transaction.\n | 'NO_TRANSACTION'\n // A document kind nobody declares — as the root being upgraded, a step's\n // `at`, or an embedding's target.\n | 'UNKNOWN_KIND'\n // A grammar sequence handed to the ledger, or a table sequence to upgrade().\n | 'WRONG_OWNER';\n\nexport class StrataError extends Error {\n readonly code: StrataErrorCode;\n readonly details: readonly string[];\n\n constructor(code: StrataErrorCode, message: string, details: readonly string[] = [], options?: { cause?: unknown }) {\n super(details.length > 0 ? `${message}\\n${details.map((d) => ` ${d}`).join('\\n')}` : message, options);\n this.name = 'StrataError';\n this.code = code;\n this.details = details;\n }\n}\n"]}
@@ -0,0 +1,18 @@
1
+ 'use strict';
2
+
3
+ // src/errors.ts
4
+ var StrataError = class extends Error {
5
+ code;
6
+ details;
7
+ constructor(code, message, details = [], options) {
8
+ super(details.length > 0 ? `${message}
9
+ ${details.map((d) => ` ${d}`).join("\n")}` : message, options);
10
+ this.name = "StrataError";
11
+ this.code = code;
12
+ this.details = details;
13
+ }
14
+ };
15
+
16
+ exports.StrataError = StrataError;
17
+ //# sourceMappingURL=chunk-ATHZ7HT5.cjs.map
18
+ //# sourceMappingURL=chunk-ATHZ7HT5.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/errors.ts"],"names":[],"mappings":";;;AA4BO,IAAM,WAAA,GAAN,cAA0B,KAAA,CAAM;AAAA,EAC5B,IAAA;AAAA,EACA,OAAA;AAAA,EAET,YAAY,IAAA,EAAuB,OAAA,EAAiB,OAAA,GAA6B,IAAI,OAAA,EAA+B;AAClH,IAAA,KAAA,CAAM,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,OAAO;AAAA,EAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,SAAS,OAAO,CAAA;AACtG,IAAA,IAAA,CAAK,IAAA,GAAO,aAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF","file":"chunk-ATHZ7HT5.cjs","sourcesContent":["// Every refusal strata makes, by name. The message is a sentence for a person;\n// the code is for the program that has to decide what to do about it.\nexport type StrataErrorCode =\n // A sequence failed its schema, or two sequences share an id.\n | 'INVALID_SEQUENCE'\n // An applied migration's steps no longer match what the code says it ran.\n | 'EDITED'\n // The database has migrations of a sequence this code does not know yet —\n // it was migrated by newer code.\n | 'TOO_NEW'\n // A `dependsOn` names a migration nobody provides and the ledger lacks.\n | 'UNKNOWN_DEPENDENCY'\n // Pending migrations wait on each other.\n | 'CYCLE'\n // Verify mode found work to do.\n | 'PENDING'\n // A step threw; the whole run was rolled back.\n | 'STEP_FAILED'\n // The run's guard said the result does not fit; the whole run was rolled back.\n | 'DOES_NOT_FIT'\n // The pool cannot hold one connection for a transaction.\n | 'NO_TRANSACTION'\n // A document kind nobody declares — as the root being upgraded, a step's\n // `at`, or an embedding's target.\n | 'UNKNOWN_KIND'\n // A grammar sequence handed to the ledger, or a table sequence to upgrade().\n | 'WRONG_OWNER';\n\nexport class StrataError extends Error {\n readonly code: StrataErrorCode;\n readonly details: readonly string[];\n\n constructor(code: StrataErrorCode, message: string, details: readonly string[] = [], options?: { cause?: unknown }) {\n super(details.length > 0 ? `${message}\\n${details.map((d) => ` ${d}`).join('\\n')}` : message, options);\n this.name = 'StrataError';\n this.code = code;\n this.details = details;\n }\n}\n"]}
@@ -0,0 +1,192 @@
1
+ 'use strict';
2
+
3
+ var chunkATHZ7HT5_cjs = require('./chunk-ATHZ7HT5.cjs');
4
+ var zod = require('zod');
5
+
6
+ var SEQUENCE_ID = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+$/;
7
+ var MIGRATION_REF = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+\/[1-9][0-9]*$/;
8
+ var KIND_NAME = /^[a-z][a-z0-9-]*$/;
9
+ var KIND_REF = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+\/[a-z][a-z0-9-]*$/;
10
+ var EMBED_PATH = /^([A-Za-z_$][\w$]*|\*)(\[\])?(\.([A-Za-z_$][\w$]*|\*)(\[\])?)*$/;
11
+ var SqlStepSchema = zod.z.object({
12
+ kind: zod.z.literal("sql"),
13
+ sql: zod.z.string().min(1).describe(
14
+ "ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string carrying several \u2014 split them into steps rather than joining them with semicolons."
15
+ )
16
+ }).strict().describe("A statement run against the database, inside the migration transaction.");
17
+ var DocumentStepSchema = zod.z.object({
18
+ kind: zod.z.literal("document"),
19
+ at: zod.z.string().regex(KIND_REF).describe('The kind of document this step rewrites, e.g. "nisc.nova/layout" \u2014 wherever one sits, at any depth.'),
20
+ transform: zod.z.unknown().describe(
21
+ "A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the grammar's embeddings and rewritten on their own, deepest first \u2014 a transform only ever sees one flat node."
22
+ )
23
+ }).strict().describe("A rewrite of stored JSON documents of one kind.");
24
+ var StepSchema = zod.z.discriminatedUnion("kind", [SqlStepSchema, DocumentStepSchema]);
25
+ var DocumentKindSchema = zod.z.object({
26
+ embeds: zod.z.record(zod.z.string().regex(EMBED_PATH), zod.z.string().regex(KIND_REF)).optional().describe("Where other documents sit inside this one: path \u2192 the kind found there (possibly this kind itself).")
27
+ }).strict();
28
+ var MigrationSchema = zod.z.object({
29
+ description: zod.z.string().min(1).describe("One sentence: what this migration does. It is the changelog line and the ledger's description."),
30
+ steps: zod.z.array(StepSchema).describe(
31
+ "Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: the version moves and nothing runs \u2014 how an addition to a strict grammar tells older readers to refuse."
32
+ ),
33
+ dependsOn: zod.z.array(zod.z.string().regex(MIGRATION_REF)).optional().describe('Migrations of OTHER sequences that must be applied first, each as "<sequence>/<n>".')
34
+ }).strict();
35
+ var SequenceSchema = zod.z.object({
36
+ id: zod.z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. "nisc.vex.cache" or "midas.app".'),
37
+ documents: zod.z.record(zod.z.string().regex(KIND_NAME), DocumentKindSchema).optional().describe('The document kinds this sequence owns (a GRAMMAR sequence), each named "<id>/<kind>" elsewhere.'),
38
+ migrations: zod.z.array(MigrationSchema).describe("Append-only. A migration is numbered by its position (from 1); the sequence's version is its length.")
39
+ }).strict().superRefine((sequence, ctx) => {
40
+ const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));
41
+ if (kinds.has("sql") && (kinds.has("document") || sequence.documents !== void 0)) {
42
+ ctx.addIssue({
43
+ code: "custom",
44
+ message: "A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both."
45
+ });
46
+ }
47
+ });
48
+
49
+ // src/checksum.ts
50
+ var canonical = (value) => {
51
+ if (Array.isArray(value)) return `[${value.map(canonical).join(",")}]`;
52
+ if (value !== null && typeof value === "object") {
53
+ const entries = Object.entries(value).filter(([, v]) => v !== void 0).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
54
+ return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(",")}}`;
55
+ }
56
+ return JSON.stringify(value);
57
+ };
58
+ var effectOf = (sql) => sql.split("\n").filter((line) => !line.trimStart().startsWith("--")).map((line) => line.trimEnd()).join("\n").trim();
59
+ var checksumOf = async (migration) => {
60
+ const steps = migration.steps.map((step) => step.kind === "sql" ? { ...step, sql: effectOf(step.sql) } : step);
61
+ const bytes = new TextEncoder().encode(canonical(steps));
62
+ const digest = await crypto.subtle.digest("SHA-256", bytes);
63
+ return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, "0")).join("");
64
+ };
65
+
66
+ // src/plan.ts
67
+ var refOf = (sequence, n) => `${sequence}/${n}`;
68
+ var prepare = async (sequences) => {
69
+ const seen = /* @__PURE__ */ new Set();
70
+ const prepared = [];
71
+ for (const input of sequences) {
72
+ const parsed = SequenceSchema.safeParse(input);
73
+ if (!parsed.success) {
74
+ const issues = parsed.error.issues.map((i) => `${i.path.join(".") || "(root)"}: ${i.message}`);
75
+ throw new chunkATHZ7HT5_cjs.StrataError("INVALID_SEQUENCE", `A sequence does not parse${typeof input.id === "string" ? ` ("${input.id}")` : ""}.`, issues);
76
+ }
77
+ const sequence = parsed.data;
78
+ if (seen.has(sequence.id)) {
79
+ throw new chunkATHZ7HT5_cjs.StrataError("INVALID_SEQUENCE", `Two sequences are both called "${sequence.id}" \u2014 a sequence id names one owner.`);
80
+ }
81
+ seen.add(sequence.id);
82
+ const migrations = [];
83
+ for (const [index, migration] of sequence.migrations.entries()) {
84
+ const n = index + 1;
85
+ migrations.push({
86
+ sequence: sequence.id,
87
+ n,
88
+ ref: refOf(sequence.id, n),
89
+ description: migration.description,
90
+ checksum: await checksumOf(migration),
91
+ steps: migration.steps,
92
+ dependsOn: migration.dependsOn ?? []
93
+ });
94
+ }
95
+ const grammar = sequence.documents !== void 0 || sequence.migrations.some((m) => m.steps.some((s) => s.kind === "document"));
96
+ prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });
97
+ }
98
+ return prepared;
99
+ };
100
+ var orderPending = (queues, alreadyDone) => {
101
+ const done = new Set(alreadyDone);
102
+ const waiting = queues.map((q) => [...q.waiting]);
103
+ const pending = [];
104
+ let moved = true;
105
+ while (moved) {
106
+ moved = false;
107
+ for (const queue of waiting) {
108
+ for (let head = queue[0]; head !== void 0; head = queue[0]) {
109
+ if (!head.dependsOn.every((d) => done.has(d))) break;
110
+ pending.push(head);
111
+ done.add(head.ref);
112
+ queue.shift();
113
+ moved = true;
114
+ }
115
+ }
116
+ }
117
+ return { pending, stuck: waiting.flat() };
118
+ };
119
+ var planMigrations = (sequences, ledger) => {
120
+ const problems = [];
121
+ const applied = {};
122
+ const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));
123
+ const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));
124
+ const queues = [];
125
+ for (const sequence of sequences) {
126
+ const rows = ledger.filter((row) => row.sequence === sequence.id);
127
+ applied[sequence.id] = rows.length;
128
+ const beyond = rows.filter((row) => row.n > sequence.migrations.length);
129
+ if (beyond.length > 0) {
130
+ problems.push({
131
+ code: "TOO_NEW",
132
+ detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} \u2014 it was migrated by newer code.`
133
+ });
134
+ }
135
+ const waiting = [];
136
+ for (const migration of sequence.migrations) {
137
+ const row = byRef.get(migration.ref);
138
+ if (row === void 0) {
139
+ waiting.push(migration);
140
+ } else if (row.checksum !== migration.checksum) {
141
+ problems.push({
142
+ code: "EDITED",
143
+ detail: `${migration.ref} ("${migration.description}") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history \u2014 append a new one.`
144
+ });
145
+ }
146
+ }
147
+ const firstWaiting = waiting[0];
148
+ if (firstWaiting !== void 0 && rows.some((row) => row.n > firstWaiting.n)) {
149
+ problems.push({ code: "EDITED", detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });
150
+ }
151
+ queues.push({ id: sequence.id, waiting });
152
+ }
153
+ const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));
154
+ for (const { waiting } of queues) {
155
+ for (const migration of waiting) {
156
+ for (const dependency of migration.dependsOn) {
157
+ if (!done.has(dependency) && !provided.has(dependency)) {
158
+ problems.push({ code: "UNKNOWN_DEPENDENCY", detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });
159
+ }
160
+ }
161
+ }
162
+ }
163
+ const { pending, stuck } = orderPending(queues, done);
164
+ if (stuck.length > 0 && !problems.some((p) => p.code === "UNKNOWN_DEPENDENCY")) {
165
+ problems.push({ code: "CYCLE", detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(", ")}.` });
166
+ }
167
+ return { applied, pending, problems };
168
+ };
169
+ var refuseProblems = (plan) => {
170
+ const first = plan.problems[0];
171
+ if (first === void 0) return;
172
+ throw new chunkATHZ7HT5_cjs.StrataError(first.code, "The migrations cannot be applied safely.", plan.problems.map((p) => `${p.code}: ${p.detail}`));
173
+ };
174
+
175
+ exports.DocumentKindSchema = DocumentKindSchema;
176
+ exports.DocumentStepSchema = DocumentStepSchema;
177
+ exports.EMBED_PATH = EMBED_PATH;
178
+ exports.KIND_NAME = KIND_NAME;
179
+ exports.KIND_REF = KIND_REF;
180
+ exports.MIGRATION_REF = MIGRATION_REF;
181
+ exports.MigrationSchema = MigrationSchema;
182
+ exports.SEQUENCE_ID = SEQUENCE_ID;
183
+ exports.SequenceSchema = SequenceSchema;
184
+ exports.SqlStepSchema = SqlStepSchema;
185
+ exports.StepSchema = StepSchema;
186
+ exports.checksumOf = checksumOf;
187
+ exports.orderPending = orderPending;
188
+ exports.planMigrations = planMigrations;
189
+ exports.prepare = prepare;
190
+ exports.refuseProblems = refuseProblems;
191
+ //# sourceMappingURL=chunk-CL5DF2IQ.cjs.map
192
+ //# sourceMappingURL=chunk-CL5DF2IQ.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/schema.ts","../src/checksum.ts","../src/plan.ts"],"names":["z","StrataError"],"mappings":";;;;;AAiBO,IAAM,WAAA,GAAc;AAIpB,IAAM,aAAA,GAAgB;AAItB,IAAM,SAAA,GAAY;AAClB,IAAM,QAAA,GAAW;AAOjB,IAAM,UAAA,GAAa;AAEnB,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EACrB,KAAKA,KAAA,CACF,MAAA,EAAO,CACP,GAAA,CAAI,CAAC,CAAA,CACL,QAAA;AAAA,IACC;AAAA;AAGN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yEAAyE;AAE9E,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CAAE,OAAA,CAAQ,UAAU,CAAA;AAAA,EAC1B,EAAA,EAAIA,MACD,MAAA,EAAO,CACP,MAAM,QAAQ,CAAA,CACd,SAAS,0GAAqG,CAAA;AAAA,EACjH,SAAA,EAAWA,KAAA,CACR,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA;AAIN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD;AAEtD,IAAM,aAAaA,KAAA,CAAE,kBAAA,CAAmB,QAAQ,CAAC,aAAA,EAAe,kBAAkB,CAAC;AAEnF,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,QAAQA,KAAA,CACL,MAAA,CAAOA,MAAE,MAAA,EAAO,CAAE,MAAM,UAAU,CAAA,EAAGA,MAAE,MAAA,EAAO,CAAE,MAAM,QAAQ,CAAC,EAC/D,QAAA,EAAS,CACT,SAAS,0GAAqG;AACnH,CAAC,EACA,MAAA;AAEI,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,EAAO,CACP,IAAI,CAAC,CAAA,CACL,SAAS,gGAAiG,CAAA;AAAA,EAC7G,KAAA,EAAOA,KAAA,CACJ,KAAA,CAAM,UAAU,CAAA,CAChB,QAAA;AAAA,IACC;AAAA,GAEF;AAAA,EACF,SAAA,EAAWA,KAAA,CACR,KAAA,CAAMA,KAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,aAAa,CAAC,CAAA,CACrC,QAAA,EAAS,CACT,SAAS,qFAAqF;AACnG,CAAC,EACA,MAAA;AAEI,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,WAAW,CAAA,CAAE,SAAS,iEAAiE,CAAA;AAAA,EAC5G,SAAA,EAAWA,KAAA,CACR,MAAA,CAAOA,KAAA,CAAE,QAAO,CAAE,KAAA,CAAM,SAAS,CAAA,EAAG,kBAAkB,CAAA,CACtD,QAAA,EAAS,CACT,SAAS,iGAAiG,CAAA;AAAA,EAC7G,YAAYA,KAAA,CACT,KAAA,CAAM,eAAe,CAAA,CACrB,SAAS,sGAAuG;AACrH,CAAC,EACA,MAAA,EAAO,CAMP,WAAA,CAAY,CAAC,UAAU,GAAA,KAAQ;AAC9B,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,QAAA,CAAS,UAAA,CAAW,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AACpF,EAAA,IAAI,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,KAAM,KAAA,CAAM,IAAI,UAAU,CAAA,IAAK,QAAA,CAAS,SAAA,KAAc,MAAA,CAAA,EAAY;AACnF,IAAA,GAAA,CAAI,QAAA,CAAS;AAAA,MACX,IAAA,EAAM,QAAA;AAAA,MACN,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AACF,CAAC;;;ACpGH,IAAM,SAAA,GAAY,CAAC,KAAA,KAA2B;AAC5C,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACnE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACjC,MAAA,CAAO,CAAC,GAAG,CAAC,CAAA,KAAM,CAAA,KAAM,MAAS,CAAA,CACjC,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA;AAClD,IAAA,OAAO,CAAA,CAAA,EAAI,QAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,IAAA,CAAK,UAAU,CAAC,CAAC,IAAI,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACtF;AACA,EAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC7B,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,GAAA,KAChB,GAAA,CACG,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,SAAA,EAAU,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,CACnD,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,CAAA,CAC5B,IAAA,CAAK,IAAI,CAAA,CACT,IAAA,EAAK;AAEH,IAAM,UAAA,GAAa,OAAO,SAAA,KAA0C;AACzE,EAAA,MAAM,QAAQ,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,IAAA,KAAU,KAAK,IAAA,KAAS,KAAA,GAAQ,EAAE,GAAG,MAAM,GAAA,EAAK,QAAA,CAAS,KAAK,GAAG,CAAA,KAAM,IAAK,CAAA;AAC/G,EAAA,MAAM,QAAQ,IAAI,WAAA,GAAc,MAAA,CAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AACvD,EAAA,MAAM,SAAS,MAAM,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,WAAW,KAAK,CAAA;AAC1D,EAAA,OAAO,MAAM,IAAA,CAAK,IAAI,WAAW,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,KAAK,EAAE,CAAA;AAC3F;;;ACAA,IAAM,QAAQ,CAAC,QAAA,EAAkB,MAAsB,CAAA,EAAG,QAAQ,IAAI,CAAC,CAAA,CAAA;AAGhE,IAAM,OAAA,GAAU,OAAO,SAAA,KAAyE;AACrG,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAC7B,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,SAAA,CAAU,KAAK,CAAA;AAC7C,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,IAAA,CAAK,KAAK,GAAG,CAAA,IAAK,QAAQ,CAAA,EAAA,EAAK,CAAA,CAAE,OAAO,CAAA,CAAE,CAAA;AAC7F,MAAA,MAAM,IAAIC,6BAAA,CAAY,kBAAA,EAAoB,CAAA,yBAAA,EAA4B,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,CAAA,GAAA,EAAM,KAAA,CAAM,EAAE,CAAA,EAAA,CAAA,GAAO,EAAE,KAAK,MAAM,CAAA;AAAA,IACzI;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,IAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA,EAAG;AACzB,MAAA,MAAM,IAAIA,6BAAA,CAAY,kBAAA,EAAoB,CAAA,+BAAA,EAAkC,QAAA,CAAS,EAAE,CAAA,uCAAA,CAAoC,CAAA;AAAA,IAC7H;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,SAAS,EAAE,CAAA;AACpB,IAAA,MAAM,aAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,SAAS,KAAK,QAAA,CAAS,UAAA,CAAW,SAAQ,EAAG;AAC9D,MAAA,MAAM,IAAI,KAAA,GAAQ,CAAA;AAClB,MAAA,UAAA,CAAW,IAAA,CAAK;AAAA,QACd,UAAU,QAAA,CAAS,EAAA;AAAA,QACnB,CAAA;AAAA,QACA,GAAA,EAAK,KAAA,CAAM,QAAA,CAAS,EAAA,EAAI,CAAC,CAAA;AAAA,QACzB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,QAAA,EAAU,MAAM,UAAA,CAAW,SAAS,CAAA;AAAA,QACpC,OAAO,SAAA,CAAU,KAAA;AAAA,QACjB,SAAA,EAAW,SAAA,CAAU,SAAA,IAAa;AAAC,OACpC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,UAAU,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,UAAU,CAAC,CAAA;AAC9H,IAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,OAAA,EAAS,SAAA,EAAW,QAAA,CAAS,SAAA,IAAa,EAAC,EAAG,UAAA,EAAY,CAAA;AAAA,EAC7F;AACA,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,YAAA,GAAe,CAC1B,MAAA,EACA,WAAA,KACiE;AACjE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,WAAW,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAA,CAAE,OAAO,CAAC,CAAA;AAChD,EAAA,MAAM,UAA+B,EAAC;AACtC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,KAAA,GAAQ,KAAA;AACR,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,KAAA,IAAS,IAAA,GAAO,MAAM,CAAC,CAAA,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,EAAG;AAC7D,QAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG;AAC/C,QAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AACjB,QAAA,IAAA,CAAK,GAAA,CAAI,KAAK,GAAG,CAAA;AACjB,QAAA,KAAA,CAAM,KAAA,EAAM;AACZ,QAAA,KAAA,GAAQ,IAAA;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,CAAQ,MAAK,EAAE;AAC1C;AAEO,IAAM,cAAA,GAAiB,CAAC,SAAA,EAAwC,MAAA,KAAuC;AAC5G,EAAA,MAAM,WAAsB,EAAC;AAC7B,EAAA,MAAM,UAAkC,EAAC;AACzC,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,KAAA,CAAM,GAAA,CAAI,QAAA,EAAU,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACpE,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAC,KAAA,CAAM,GAAA,CAAI,UAAU,GAAA,CAAI,CAAC,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAE5E,EAAA,MAAM,SAAyD,EAAC;AAChE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,IAAA,GAAO,OAAO,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,QAAA,KAAa,SAAS,EAAE,CAAA;AAChE,IAAA,OAAA,CAAQ,QAAA,CAAS,EAAE,CAAA,GAAI,IAAA,CAAK,MAAA;AAI5B,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA;AACtE,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,IAAA,EAAM,SAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,qBAAA,EAAwB,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,IAAI,CAAC,CAAA,KAAM,EAAE,CAAC,CAAC,CAAC,CAAA,kBAAA,EAAqB,QAAA,CAAS,WAAW,MAAM,CAAA,sCAAA;AAAA,OAC/H,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,UAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,SAAA,IAAa,SAAS,UAAA,EAAY;AAC3C,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACnC,MAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,QAAA,OAAA,CAAQ,KAAK,SAAS,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,GAAA,CAAI,QAAA,KAAa,SAAA,CAAU,QAAA,EAAU;AAC9C,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,IAAA,EAAM,QAAA;AAAA,UACN,MAAA,EAAQ,GAAG,SAAA,CAAU,GAAG,MAAM,SAAA,CAAU,WAAW,CAAA,eAAA,EAAkB,GAAA,CAAI,SAAS,CAAA,2FAAA;AAAA,SACnF,CAAA;AAAA,MACH;AAAA,IACF;AAGA,IAAA,MAAM,YAAA,GAAe,QAAQ,CAAC,CAAA;AAC9B,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,IAAA,CAAK,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AAC5E,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,EAAA,EAAK,YAAA,CAAa,GAAG,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,IACvI;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,SAAS,CAAA;AAAA,EAC1C;AAGA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,SAAA,CAAU,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAC,CAAA;AACjF,EAAA,KAAA,MAAW,EAAE,OAAA,EAAQ,IAAK,MAAA,EAAQ;AAChC,IAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,MAAA,KAAA,MAAW,UAAA,IAAc,UAAU,SAAA,EAAW;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAA,CAAI,UAAU,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,UAAU,CAAA,EAAG;AACtD,UAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,MAAA,EAAQ,CAAA,EAAG,SAAA,CAAU,GAAG,CAAA,YAAA,EAAe,UAAU,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,QACzJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAM,GAAI,YAAA,CAAa,QAAQ,IAAI,CAAA;AACpD,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,CAAC,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,oBAAoB,CAAA,EAAG;AAC9E,IAAA,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,MAAA,EAAQ,+CAA+C,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAG,CAAA,CAAE,KAAK,IAAI,CAAC,KAAK,CAAA;AAAA,EAC/H;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,QAAA,EAAS;AACtC;AAGO,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqB;AAClD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,IAAIA,6BAAA,CAAY,KAAA,CAAM,IAAA,EAAM,0CAAA,EAA4C,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,IAAI,KAAK,CAAA,CAAE,MAAM,EAAE,CAAC,CAAA;AAClI","file":"chunk-CL5DF2IQ.cjs","sourcesContent":["import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// The grammar of a migration.\n//\n// A SEQUENCE is an append-only list of migrations owned by one grammar owner —\n// a package's tables (`nisc.vex.cache`), a package's documents (`nisc.nova`,\n// later), an app's own (`midas.app`). A migration's number is its POSITION, so\n// the sequence's version is its length: nobody bumps a number, you append.\n//\n// Sequences are data. They are authored in TS for type-checking, but nothing\n// here is a function, so a sequence can be stored, shipped and inspected like\n// every other nisc artifact — and is parsed at the boundary like one.\n// ═══════════════════════════════════════════════════════════════\n\n// Namespaced, lowercase: `<owner>.<name>[.<name>…]`. The owner prefix keeps two\n// packages (or a package and an app) from ever claiming the same sequence.\nexport const SEQUENCE_ID = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+$/;\n\n// `<sequence>/<n>` — how a migration is named everywhere: the ledger, a\n// dependency, an error.\nexport const MIGRATION_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[1-9][0-9]*$/;\n\n// A document kind, named by its owner: `<sequence>/<kind>`, e.g.\n// \"nisc.nova/layout\". The kind part is a plain lowercase word.\nexport const KIND_NAME = /^[a-z][a-z0-9-]*$/;\nexport const KIND_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[a-z][a-z0-9-]*$/;\n\n// Where, inside a document, another document sits. Dot-separated keys, with\n// two wildcards that say WHICH shape they cross — `children[]` is every item of\n// the array at `children`, `endpoints.*` every value of the record at\n// `endpoints`. Kept apart on purpose: nova's `children` is a single node OR an\n// array, and one wildcard for both would read a lone node's `props` as layouts.\nexport const EMBED_PATH = /^([A-Za-z_$][\\w$]*|\\*)(\\[\\])?(\\.([A-Za-z_$][\\w$]*|\\*)(\\[\\])?)*$/;\n\nexport const SqlStepSchema = z\n .object({\n kind: z.literal('sql'),\n sql: z\n .string()\n .min(1)\n .describe(\n 'ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string ' +\n 'carrying several — split them into steps rather than joining them with semicolons.',\n ),\n })\n .strict()\n .describe('A statement run against the database, inside the migration transaction.');\n\nexport const DocumentStepSchema = z\n .object({\n kind: z.literal('document'),\n at: z\n .string()\n .regex(KIND_REF)\n .describe('The kind of document this step rewrites, e.g. \"nisc.nova/layout\" — wherever one sits, at any depth.'),\n transform: z\n .unknown()\n .describe(\n 'A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of ' +\n 'the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the ' +\n 'grammar\\'s embeddings and rewritten on their own, deepest first — a transform only ever sees one flat node.',\n ),\n })\n .strict()\n .describe('A rewrite of stored JSON documents of one kind.');\n\nexport const StepSchema = z.discriminatedUnion('kind', [SqlStepSchema, DocumentStepSchema]);\n\nexport const DocumentKindSchema = z\n .object({\n embeds: z\n .record(z.string().regex(EMBED_PATH), z.string().regex(KIND_REF))\n .optional()\n .describe('Where other documents sit inside this one: path → the kind found there (possibly this kind itself).'),\n })\n .strict();\n\nexport const MigrationSchema = z\n .object({\n description: z\n .string()\n .min(1)\n .describe('One sentence: what this migration does. It is the changelog line and the ledger\\'s description.'),\n steps: z\n .array(StepSchema)\n .describe(\n 'Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: ' +\n 'the version moves and nothing runs — how an addition to a strict grammar tells older readers to refuse.',\n ),\n dependsOn: z\n .array(z.string().regex(MIGRATION_REF))\n .optional()\n .describe('Migrations of OTHER sequences that must be applied first, each as \"<sequence>/<n>\".'),\n })\n .strict();\n\nexport const SequenceSchema = z\n .object({\n id: z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. \"nisc.vex.cache\" or \"midas.app\".'),\n documents: z\n .record(z.string().regex(KIND_NAME), DocumentKindSchema)\n .optional()\n .describe('The document kinds this sequence owns (a GRAMMAR sequence), each named \"<id>/<kind>\" elsewhere.'),\n migrations: z\n .array(MigrationSchema)\n .describe('Append-only. A migration is numbered by its position (from 1); the sequence\\'s version is its length.'),\n })\n .strict()\n // TWO KINDS OF OWNER. A table sequence (sql steps) is recorded per DATABASE,\n // in its ledger. A grammar sequence (document steps) is tracked per DOCUMENT,\n // by the stamp the document carries — because documents travel: an add-on\n // built on older code submits older documents to a newer host. One sequence\n // cannot be both; the two versions would mean different things.\n .superRefine((sequence, ctx) => {\n const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));\n if (kinds.has('sql') && (kinds.has('document') || sequence.documents !== undefined)) {\n ctx.addIssue({\n code: 'custom',\n message: 'A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both.',\n });\n }\n });\n\nexport type SqlStep = z.infer<typeof SqlStepSchema>;\nexport type DocumentStep = z.infer<typeof DocumentStepSchema>;\nexport type DocumentKind = z.infer<typeof DocumentKindSchema>;\nexport type Step = z.infer<typeof StepSchema>;\nexport type Migration = z.infer<typeof MigrationSchema>;\nexport type Sequence = z.infer<typeof SequenceSchema>;\n","import type { Migration } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// What a migration DID, as a hash — the ledger's proof that the code still says\n// what the database ran.\n//\n// Over the steps only. The description is prose: fixing a typo in it must not\n// read as an edited migration. `dependsOn` orders, it does not act. The steps\n// are the effect, and changing an applied step is the one thing that has to\n// be refused — the database already holds the old effect.\n//\n// For the same reason a step's SQL is hashed without its full-line comments\n// (`-- …` on a line of its own) and without trailing whitespace: a migration\n// can carry its documentation verbatim, and rewording it is not an edit.\n//\n// WebCrypto (SHA-256), which Node ≥ 22 and every browser carry as\n// `crypto.subtle` — the same primitive Prism fingerprints with, so strata runs\n// unchanged in a server, a test and the showroom page.\n// ═══════════════════════════════════════════════════════════════\n\n// Sorted keys, recursively: the same value always serializes the same way,\n// whatever order its object literal was written in.\nconst canonical = (value: unknown): string => {\n if (Array.isArray(value)) return `[${value.map(canonical).join(',')}]`;\n if (value !== null && typeof value === 'object') {\n const entries = Object.entries(value)\n .filter(([, v]) => v !== undefined)\n .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0));\n return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(',')}}`;\n }\n return JSON.stringify(value);\n};\n\nconst effectOf = (sql: string): string =>\n sql\n .split('\\n')\n .filter((line) => !line.trimStart().startsWith('--'))\n .map((line) => line.trimEnd())\n .join('\\n')\n .trim();\n\nexport const checksumOf = async (migration: Migration): Promise<string> => {\n const steps = migration.steps.map((step) => (step.kind === 'sql' ? { ...step, sql: effectOf(step.sql) } : step));\n const bytes = new TextEncoder().encode(canonical(steps));\n const digest = await crypto.subtle.digest('SHA-256', bytes);\n return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, '0')).join('');\n};\n","import { SequenceSchema, type DocumentKind, type Sequence, type Step } from './schema';\nimport { checksumOf } from './checksum';\nimport { StrataError, type StrataErrorCode } from './errors';\n\n// ═══════════════════════════════════════════════════════════════\n// The plan — what the code says, against what the database has run.\n//\n// Pure: sequences and ledger rows in, a plan out. No database, no clock. The\n// postgres runner reads the ledger, calls this, and applies what it says; a\n// showroom page or a CI check can call it with a ledger it made up.\n// ═══════════════════════════════════════════════════════════════\n\n// A migration the code declares, numbered and hashed.\nexport type PreparedMigration = {\n sequence: string;\n n: number;\n ref: string;\n description: string;\n checksum: string;\n steps: readonly Step[];\n dependsOn: readonly string[];\n};\n\nexport type PreparedSequence = {\n id: string;\n // A grammar sequence owns documents (tracked by stamps); otherwise it owns\n // tables (tracked by a database's ledger). See SequenceSchema.\n grammar: boolean;\n documents: Readonly<Record<string, DocumentKind>>;\n migrations: readonly PreparedMigration[];\n};\n\n// One row of the ledger, as a runner read it back.\nexport type LedgerRow = { sequence: string; n: number; checksum: string; description: string; appliedAt: string };\n\nexport type Problem = { code: Exclude<StrataErrorCode, 'PENDING' | 'STEP_FAILED' | 'DOES_NOT_FIT' | 'NO_TRANSACTION' | 'UNKNOWN_KIND' | 'WRONG_OWNER'>; detail: string };\n\nexport type Plan = {\n // Already run, per sequence this code knows: how far each one is.\n applied: Readonly<Record<string, number>>;\n // To run, in the order they must run.\n pending: readonly PreparedMigration[];\n // Anything that makes applying unsafe. A plan with problems is never applied.\n problems: readonly Problem[];\n};\n\nconst refOf = (sequence: string, n: number): string => `${sequence}/${n}`;\n\n// Parse, number and hash. Async only for the hash (WebCrypto).\nexport const prepare = async (sequences: readonly Sequence[]): Promise<readonly PreparedSequence[]> => {\n const seen = new Set<string>();\n const prepared: PreparedSequence[] = [];\n for (const input of sequences) {\n const parsed = SequenceSchema.safeParse(input);\n if (!parsed.success) {\n const issues = parsed.error.issues.map((i) => `${i.path.join('.') || '(root)'}: ${i.message}`);\n throw new StrataError('INVALID_SEQUENCE', `A sequence does not parse${typeof input.id === 'string' ? ` (\"${input.id}\")` : ''}.`, issues);\n }\n const sequence = parsed.data;\n if (seen.has(sequence.id)) {\n throw new StrataError('INVALID_SEQUENCE', `Two sequences are both called \"${sequence.id}\" — a sequence id names one owner.`);\n }\n seen.add(sequence.id);\n const migrations: PreparedMigration[] = [];\n for (const [index, migration] of sequence.migrations.entries()) {\n const n = index + 1;\n migrations.push({\n sequence: sequence.id,\n n,\n ref: refOf(sequence.id, n),\n description: migration.description,\n checksum: await checksumOf(migration),\n steps: migration.steps,\n dependsOn: migration.dependsOn ?? [],\n });\n }\n const grammar = sequence.documents !== undefined || sequence.migrations.some((m) => m.steps.some((s) => s.kind === 'document'));\n prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });\n }\n return prepared;\n};\n\n// Order: walk the sequences in the order given, and let each run as far as its\n// dependencies allow before moving on; repeat until nothing moves. The same\n// input always yields the same order, and a sequence's own migrations stay\n// together unless a dependency splits them. Shared by the ledger's plan and a\n// document's upgrade, so both order the same migrations the same way.\nexport const orderPending = (\n queues: readonly { waiting: readonly PreparedMigration[] }[],\n alreadyDone: ReadonlySet<string>,\n): { pending: PreparedMigration[]; stuck: PreparedMigration[] } => {\n const done = new Set(alreadyDone);\n const waiting = queues.map((q) => [...q.waiting]);\n const pending: PreparedMigration[] = [];\n let moved = true;\n while (moved) {\n moved = false;\n for (const queue of waiting) {\n for (let head = queue[0]; head !== undefined; head = queue[0]) {\n if (!head.dependsOn.every((d) => done.has(d))) break;\n pending.push(head);\n done.add(head.ref);\n queue.shift();\n moved = true;\n }\n }\n }\n return { pending, stuck: waiting.flat() };\n};\n\nexport const planMigrations = (sequences: readonly PreparedSequence[], ledger: readonly LedgerRow[]): Plan => {\n const problems: Problem[] = [];\n const applied: Record<string, number> = {};\n const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));\n const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));\n\n const queues: { id: string; waiting: PreparedMigration[] }[] = [];\n for (const sequence of sequences) {\n const rows = ledger.filter((row) => row.sequence === sequence.id);\n applied[sequence.id] = rows.length;\n\n // The database ran migrations this code has never seen: newer code migrated\n // it. Applying ours on top would be guessing — refuse.\n const beyond = rows.filter((row) => row.n > sequence.migrations.length);\n if (beyond.length > 0) {\n problems.push({\n code: 'TOO_NEW',\n detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} — it was migrated by newer code.`,\n });\n }\n\n const waiting: PreparedMigration[] = [];\n for (const migration of sequence.migrations) {\n const row = byRef.get(migration.ref);\n if (row === undefined) {\n waiting.push(migration);\n } else if (row.checksum !== migration.checksum) {\n problems.push({\n code: 'EDITED',\n detail: `${migration.ref} (\"${migration.description}\") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history — append a new one.`,\n });\n }\n }\n // A hole: something later ran, something earlier did not. The ledger was\n // written by hand, or by a different ordering of the same sequence.\n const firstWaiting = waiting[0];\n if (firstWaiting !== undefined && rows.some((row) => row.n > firstWaiting.n)) {\n problems.push({ code: 'EDITED', detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });\n }\n queues.push({ id: sequence.id, waiting });\n }\n\n // Every dependency must be satisfiable by the ledger or by this plan.\n const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));\n for (const { waiting } of queues) {\n for (const migration of waiting) {\n for (const dependency of migration.dependsOn) {\n if (!done.has(dependency) && !provided.has(dependency)) {\n problems.push({ code: 'UNKNOWN_DEPENDENCY', detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });\n }\n }\n }\n }\n\n const { pending, stuck } = orderPending(queues, done);\n if (stuck.length > 0 && !problems.some((p) => p.code === 'UNKNOWN_DEPENDENCY')) {\n problems.push({ code: 'CYCLE', detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(', ')}.` });\n }\n\n return { applied, pending, problems };\n};\n\n// Throw the plan's problems as one error, named by the first.\nexport const refuseProblems = (plan: Plan): void => {\n const first = plan.problems[0];\n if (first === undefined) return;\n throw new StrataError(first.code, 'The migrations cannot be applied safely.', plan.problems.map((p) => `${p.code}: ${p.detail}`));\n};\n"]}