@niscorp/prism 0.2.1 → 0.2.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +13 -0
- package/dist/agent.cjs +4 -756
- package/dist/agent.cjs.map +1 -1
- package/dist/chunk-26VYDHHC.cjs +784 -0
- package/dist/chunk-26VYDHHC.cjs.map +1 -0
- package/dist/chunk-V426VIRI.cjs +1168 -0
- package/dist/chunk-V426VIRI.cjs.map +1 -0
- package/dist/chunk-W32JXP33.cjs +147 -0
- package/dist/chunk-W32JXP33.cjs.map +1 -0
- package/dist/index.cjs +190 -2067
- package/dist/index.cjs.map +1 -1
- package/dist/migrations/index.cjs +7 -1777
- package/dist/migrations/index.cjs.map +1 -1
- package/package.json +3 -3
package/dist/agent.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/schemas/json.schema.ts","../src/schemas/ops/core.schema.ts","../src/schemas/ops/array.schema.ts","../src/schemas/ops/math.schema.ts","../src/schemas/ops/string.schema.ts","../src/schemas/ops/predicate.schema.ts","../src/schemas/ops/logic.schema.ts","../src/schemas/ops/structure.schema.ts","../src/schemas/ops/object.schema.ts","../src/schemas/ops/time.schema.ts","../src/schemas/ops/intl.schema.ts","../src/schemas/ops/sugar.schema.ts","../src/schemas/ops/transform.schema.ts","../src/schemas/node.schema.ts","../src/schemas/config.schema.ts","../src/schemas/profiles.ts","../src/engine/documentation.ts","../src/agent/mapping-agent.ts"],"names":["z","_NodeSchema","setNodeSchema","node","pairOf","defineAgent"],"mappings":";;;;;;AAEO,IAAM,sBAAsBA,KAAA,CAChC,KAAA,CAAM,CAACA,KAAA,CAAE,MAAA,IAAUA,KAAA,CAAE,MAAA,IAAUA,KAAA,CAAE,OAAA,IAAWA,KAAA,CAAE,IAAA,EAAM,CAAC,CAAA,CACrD,SAAS,kDAAkD,CAAA;AAEvD,IAAM,kBAETA,KAAA,CAAE,IAAA;AAAA,EAAK,MACTA,KAAA,CAAE,KAAA,CAAM,CAAC,mBAAA,EAAqBA,MAAE,KAAA,CAAM,eAAe,CAAA,EAAGA,KAAA,CAAE,OAAOA,KAAA,CAAE,MAAA,EAAO,EAAG,eAAe,CAAC,CAAC;AAChG,CAAA,CAAE,SAAS,6CAA6C,CAAA;AAExBA,MAC7B,MAAA,CAAOA,KAAA,CAAE,QAAO,EAAG,eAAe,CAAA,CAClC,QAAA,CAAS,gDAAgD;ACT5D,IAAI,WAAA,GAA4BA,MAAE,GAAA,EAAI;AAC/B,IAAM,aAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAA,WAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAM,OAAO,MAAoB,WAAA;AAM1B,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,EAAO,CACP,MAAM,aAAa,CAAA,CACnB,SAAS,oNAAoN;AAClO,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4JAA4J,CAAA;AAQjK,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQ,eAAA,CAAgB,QAAA,CAAS,iCAAiC;AACpE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wCAAwC,CAAA;AAQ7C,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,mEAAmE;AACtG,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6LAAwL,CAAA;AAQ7L,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAA,CAAE,SAAS,gCAAgC,CAAA;AAAA,IAC5D,IAAA,EAAMA,MACH,KAAA,CAAMA,KAAAA,CAAE,MAAM,CAACA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,IAAUA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAC,CAAC,EACrD,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,mEAAmE,CAAA;AAAA,IAC/E,QAAA,EAAUA,MAAE,IAAA,CAAK,IAAI,EAAE,QAAA,EAAS,CAAE,SAAS,sCAAsC;AAAA,GAClF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sOAAsO,CAAA;AAQ3O,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,GAAA,EAAKA,KAAAA,CACF,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAC/B,QAAA,CAAS,uEAAkE,CAAA;AAAA,IAC9E,OAAOA,KAAAA,CAAE,IAAA,CAAK,IAAI,CAAA,CAAE,SAAS,4DAA4D;AAAA,GAC1F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8EAA8E,CAAA;ACzF1F,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAM1B,IAAM,aAAA,GAAgBD,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wBAAwB,CAAA;AAAA,IACpD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wCAAwC;AAAA,GACrE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,+CAA+C,CAAA;AAQpD,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC9C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,6CAAwC;AAAA,GACrE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAQnE,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC9C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,GAAA,EAAKA,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,SAAS,4CAA4C,CAAA;AAAA,IACtG,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,4BAA4B,CAAA;AAAA,IACxD,MAAMH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,mFAAmF;AAAA,GAChH,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yDAAyD,CAAA;AAQ9D,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,2BAA2B,CAAA;AAAA,IACvD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,sCAAsC,CAAA;AAAA,IAClF,GAAA,EAAKA,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,yCAAyC;AAAA,GACpF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gDAAgD,CAAA;AAQrD,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,UAAUA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uCAAuC;AACzE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sCAAsC,CAAA;AAQ3C,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,SAASA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uBAAuB;AACxD,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qEAAqE,CAAA;AAQ1E,IAAM,gBAAA,GAAmBH,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,IAAIA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,qCAAqC,CAAA;AAAA,IAC/D,GAAA,EAAKH,KAAAA,CAAE,IAAA,CAAK,CAAC,OAAO,MAAM,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,KAAK,CAAA,CAAE,SAAS,iCAAiC;AAAA,GAClG,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kCAAkC,CAAA;AC9H9C,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAM,SAAS,CAAC,IAAA,KACdD,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,EAAGH,MAAE,IAAA,CAAKG,KAAI,CAAC,CAAC,CAAA,CAAE,SAAS,IAAI,CAAA;AAM9C,IAAM,aAAA,GAAgBH,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,8BAA8B,CAAA,EAAG,CAAA,CACvD,MAAA,EAAO,CACP,SAAS,kBAAkB,CAAA;AAGvB,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,2CAA2C,CAAA,EAAG,CAAA,CACpE,MAAA,EAAO,CACP,SAAS,oCAAoC,CAAA;AAGzC,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,mCAAmC,CAAA,EAAG,CAAA,CAC5D,MAAA,EAAO,CACP,SAAS,uBAAuB,CAAA;AAG5B,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,MAAA,CAAO,qEAAqE,CAAA,EAAG,CAAA,CAC9F,MAAA,EAAO,CACP,SAAS,2EAA2E,CAAA;AAOhF,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACtD,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,EAAS,CAAE,OAAA,CAAQ,CAAC,CAAA,CAAE,SAAS,6BAA6B;AAAA,GACpG,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qCAAqC,CAAA;ACnDjD,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,cAAA,GAAiBD,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CACJ,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,0IAAqI,CAAA;AAAA,IACjJ,GAAA,EAAKH,KAAAA,CAAE,MAAA,EAAO,CAAE,QAAA,GAAW,OAAA,CAAQ,EAAE,CAAA,CAAE,QAAA,CAAS,uCAAuC;AAAA,GACxF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8DAA8D,CAAA;AAGnE,IAAM,qBAAqBA,KAAAA,CAC/B,MAAA,CAAO,EAAE,SAAA,EAAWA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,kCAAkC,CAAA,EAAG,EAC/E,MAAA,EAAO,CACP,SAAS,+CAA+C,CAAA;AAGpD,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,YAAA,EAAcA,MACX,MAAA,CAAO;AAAA,IACN,QAAA,EAAUA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qCAAqC,CAAA;AAAA,IACnE,QAAQA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iDAAiD;AAAA,GAChF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wEAAwE,CAAA;AAG7E,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,OAAOA,KAAAA,CACJ,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,mHAA8G;AAC5H,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,qGAAgG,CAAA;AAGrG,IAAM,iBAAiBH,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,iCAAiC,CAAA,EAAG,EAC1E,MAAA,EAAO,CACP,SAAS,qDAAqD,CAAA;AAG1D,IAAM,kBAAkBH,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,sBAAsB,CAAA,EAAG,EAChE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAGrC,IAAM,kBAAkBH,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,sBAAsB,CAAA,EAAG,EAChE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAGrC,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,GAAA,EAAKH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,wBAAwB;AAAA,GAClD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4CAA4C,CAAA;AAGjD,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sBAAsB,CAAA;AAAA,IACnD,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,oBAAoB,CAAA;AAAA,IAChD,WAAA,EAAaA,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,qBAAqB;AAAA,GACvD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8CAA8C,CAAA;AC5F1D,IAAIC,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAMG,UAAS,CAAC,IAAA,KACdJ,KAAAA,CAAE,KAAA,CAAM,CAACA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,EAAGH,MAAE,IAAA,CAAKG,KAAI,CAAC,CAAC,CAAA,CAAE,SAAS,IAAI,CAAA;AAM9C,IAAM,YAAA,GAAeH,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,0CAA0C,CAAA,EAAG,CAAA,CAClE,MAAA,EAAO,CACP,SAAS,yEAAyE,CAAA;AAG9E,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,uCAAuC,CAAA,EAAG,CAAA,CAChE,MAAA,EAAO,CACP,SAAS,oDAAoD,CAAA;AAGzD,IAAM,YAAA,GAAeJ,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,kEAAkE,CAAA,EAAG,CAAA,CAC1F,MAAA,EAAO,CACP,SAAS,iDAAiD,CAAA;AAGtD,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,8CAA8C,CAAA,EAAG,CAAA,CACvE,MAAA,EAAO,CACP,SAAS,mCAAmC,CAAA;AAGxC,IAAM,YAAA,GAAeJ,KAAAA,CACzB,MAAA,CAAO,EAAE,GAAA,EAAKI,OAAAA,CAAO,6CAA6C,CAAA,EAAG,CAAA,CACrE,MAAA,EAAO,CACP,SAAS,uBAAuB,CAAA;AAG5B,IAAM,aAAA,GAAgBJ,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMI,OAAAA,CAAO,8CAA8C,CAAA,EAAG,CAAA,CACvE,MAAA,EAAO,CACP,SAAS,gCAAgC,CAAA;AAOrC,IAAM,kBAAkBJ,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,kDAAkD,CAAA,EAAG,EAC5F,MAAA,EAAO,CACP,SAAS,4EAA4E,CAAA;AAOjF,IAAM,oBAAA,GAAuBH,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB;AAAA,GACjD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4CAA4C,CAAA;AAGjD,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB,CAAA;AAAA,IAC/C,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,kBAAkB;AAAA,GACjD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0CAA0C,CAAA;AAG/C,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sBAAsB,CAAA;AAAA,IACnD,QAAQH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,oBAAoB;AAAA,GACnD,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,uDAAuD,CAAA;ACnGnE,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,gBAAgBD,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAMA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,2DAAiD,CAAA,EAAG,EACzF,MAAA,EAAO,CACP,SAAS,2CAA2C,CAAA;AAGhD,IAAM,aAAA,GAAgBH,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAAA,CACH,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,oEAAoE;AAClF,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4BAA4B,CAAA;AAGjC,IAAM,YAAA,GAAeH,MACzB,MAAA,CAAO;AAAA,EACN,GAAA,EAAKA,KAAAA,CACF,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,mEAAmE;AACjF,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2BAA2B,CAAA;AC/BvC,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,eAAA,GAAkBD,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,KAAAA,CACL,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,uDAAuD;AACrE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sEAAsE,CAAA;AAG3E,IAAM,kBAAA,GAAqBH,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,KAAAA,CACR,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAC,CAAA,CAClB,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,+DAA+D;AAC7E,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD,CAAA;AAGtD,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,UAAUA,KAAAA,CACP,KAAA;AAAA,MACCA,MAAE,MAAA,CAAO;AAAA,QACP,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,wBAAwB,CAAA;AAAA,QACpD,MAAMH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yCAAyC;AAAA,OACtE,EAAE,MAAA;AAAO,KACZ,CACC,GAAA,CAAI,CAAC,CAAA,CACL,SAAS,qCAAqC,CAAA;AAAA,IACjD,IAAA,EAAMH,MAAE,IAAA,CAAKG,KAAI,EAAE,QAAA,EAAS,CAAE,SAAS,qDAAqD;AAAA,GAC7F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kFAAkF,CAAA;AAGvF,IAAM,sBAAsBH,KAAAA,CAChC,MAAA,CAAO,EAAE,UAAA,EAAYA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,8CAA8C,CAAA,EAAG,EAC5F,MAAA,EAAO,CACP,SAAS,sDAAsD,CAAA;AAG3D,IAAM,eAAA,GAAkBH,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,KAAKA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,yDAAyD;AAAA,GACrF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,8FAA8F,CAAA;AAGnG,IAAM,iBAAA,GAAoBH,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,KAAKA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sCAAsC;AAAA,GAClE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gEAAgE,CAAA;AChF5E,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAE1B,IAAM,iBAAiBD,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,8BAA8B,CAAA,EAAG,EACvE,MAAA,EAAO,CACP,SAAS,iDAAiD,CAAA;AAGtD,IAAM,mBAAmBH,KAAAA,CAC7B,MAAA,CAAO,EAAE,OAAA,EAASA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,gCAAgC,CAAA,EAAG,EAC3E,MAAA,EAAO,CACP,SAAS,6CAA6C,CAAA;AAGlD,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,cAAcA,KAAAA,CACX,IAAA,CAAKG,KAAI,CAAA,CACT,SAAS,sDAAsD;AACpE,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,gDAAgD,CAAA;AAGrD,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,IAAA,EAAMH,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,eAAe;AAAA,GAC1D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yDAAyD,CAAA;AAG9D,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,gBAAgB,CAAA;AAAA,IAC5C,IAAA,EAAMH,KAAAA,CAAE,KAAA,CAAMA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,CAAS,iBAAiB;AAAA,GAC5D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wDAAwD,CAAA;AAG7D,IAAM,iBAAiBA,KAAAA,CAC3B,MAAA,CAAO,EAAE,KAAA,EAAOA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,2BAA2B,CAAA,EAAG,EACpE,MAAA,EAAO,CACP,SAAS,4FAA4F,CAAA;AAGjG,IAAM,mBAAmBH,KAAAA,CAC7B,MAAA,CAAO,EAAE,OAAA,EAASA,MAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,QAAA,CAAS,6BAA6B,CAAA,EAAG,EACxE,MAAA,EAAO,CACP,SAAS,0CAA0C,CAAA;AC/DtD,IAAIF,YAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,cAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,YAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,QAAO,MAAoBF,YAAAA;AAEjC,IAAM,QAAA,GAAWD,KAAAA,CACd,IAAA,CAAK,CAAC,MAAA,EAAQ,OAAA,EAAS,KAAA,EAAO,MAAA,EAAQ,QAAA,EAAU,QAAQ,CAAC,CAAA,CACzD,SAAS,gCAAgC,CAAA;AAErC,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,uCAAuC,CAAA;AAAA,IACpE,QAAQH,KAAAA,CAAE,MAAA,GAAS,QAAA,EAAS,CAAE,SAAS,yDAAyD,CAAA;AAAA,IAChG,GAAA,EAAKA,KAAAA,CAAE,OAAA,EAAQ,CAAE,QAAA,GAAW,OAAA,CAAQ,KAAK,CAAA,CAAE,QAAA,CAAS,gCAAgC;AAAA,GACrF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,sBAAsB,CAAA;AAG3B,IAAM,iBAAA,GAAoBA,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,sCAAsC,CAAA;AAAA,IAClE,MAAA,EAAQH,KAAAA,CAAE,MAAA,EAAO,CAAE,SAAS,kCAAkC,CAAA;AAAA,IAC9D,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,+CAA+C,CAAA;AAGpD,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,SAAA,EAAWA,MACR,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,aAAa,CAAA;AAAA,IACzC,IAAIH,KAAAA,CAAE,IAAA,CAAKG,KAAI,CAAA,CAAE,SAAS,WAAW,CAAA;AAAA,IACrC,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2DAA2D,CAAA;ACjDvE,IAAIF,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAsBjC,IAAM,cAAcD,KAAAA,CACjB,IAAA,CAAKG,MAAI,CAAA,CACT,SAAS,2HAAsH,CAAA;AAElI,IAAM,aAAA,GAAgBH,MACnB,IAAA,CAAKG,MAAI,EACT,QAAA,EAAS,CACT,SAAS,+DAA+D,CAAA;AAO3E,IAAM,SAAA,GAAYH,MAAE,IAAA,CAAK,CAAC,QAAQ,MAAA,EAAQ,QAAA,EAAU,OAAO,CAAC,CAAA;AAErD,IAAM,qBAAA,GAAwBA,MAClC,MAAA,CAAO;AAAA,EACN,SAAA,EAAW,SAAA,CAAU,QAAA,EAAS,CAAE,SAAS,8EAA8E,CAAA;AAAA,EACvH,SAAA,EAAW,SAAA,CAAU,QAAA,EAAS,CAAE,SAAS,8EAA8E,CAAA;AAAA,EACvH,OAAA,EAASA,MAAE,IAAA,CAAK,CAAC,QAAQ,OAAA,EAAS,QAAQ,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACtD,IAAA,EAAMA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC9C,KAAA,EAAOA,KAAAA,CAAE,IAAA,CAAK,CAAC,SAAA,EAAW,SAAA,EAAW,MAAA,EAAQ,OAAA,EAAS,QAAQ,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EAC1E,GAAA,EAAKA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC7C,IAAA,EAAMA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAC9C,MAAA,EAAQA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAChD,MAAA,EAAQA,MAAE,IAAA,CAAK,CAAC,WAAW,SAAS,CAAC,EAAE,QAAA,EAAS;AAAA,EAChD,QAAQA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,8GAA0G,CAAA;AAAA,EAClJ,UAAUA,KAAAA,CACP,MAAA,GACA,QAAA,EAAS,CACT,SAAS,sIAAsI;AACpJ,CAAC,EACA,MAAA,EAAO;AAIH,IAAM,oBAAA,GAAuBA,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,sDAAsD,CAAA;AAAA,IACnF,MAAA,EAAQ,WAAA;AAAA,IACR,OAAA,EAAS,qBAAA,CAAsB,QAAA,EAAS,CAAE,SAAS,sCAAsC,CAAA;AAAA,IACzF,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,4EAA4E,CAAA;AAGjF,IAAM,qBAAA,GAAwBH,MAClC,MAAA,CAAO;AAAA,EACN,YAAA,EAAcA,MACX,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,+DAA+D,CAAA;AAAA,IAC5F,UAAUH,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,4FAAuF,CAAA;AAAA,IACvH,MAAA,EAAQ,WAAA;AAAA,IACR,UAAA,EAAYH,KAAAA,CACT,OAAA,EAAQ,CACR,UAAS,CACT,QAAA;AAAA,MACC;AAAA,KACF;AAAA,IACF,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,sEAAuE,CAAA;AAAA,IACnI,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,kFAAkF,CAAA;AAGvF,IAAM,sBAAA,GAAyBA,MACnC,MAAA,CAAO;AAAA,EACN,aAAA,EAAeA,MACZ,MAAA,CAAO;AAAA,IACN,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,uBAAuB,CAAA;AAAA,IACpD,MAAA,EAAQ,WAAA;AAAA,IACR,KAAA,EAAOH,KAAAA,CAAE,IAAA,CAAK,CAAC,SAAA,EAAW,SAAS,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,0EAAqE,CAAA;AAAA,IAC/H,MAAA,EAAQA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,qDAAsD,CAAA;AAAA,IAClH,SAAA,EAAWA,KAAAA,CAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,IAAI,EAAE,CAAA,CAAE,QAAA,EAAS,CAAE,SAAS,0EAAqE,CAAA;AAAA,IACpI,SAASA,KAAAA,CAAE,OAAA,GAAU,QAAA,EAAS,CAAE,SAAS,oFAA+E,CAAA;AAAA,IACxH,QAAA,EAAU;AAAA,GACX,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wDAAwD,CAAA;ACnHpE,IAAIC,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAMjC,IAAM,WAAW,CAAC,IAAA,KAChBD,KAAAA,CAAE,MAAA,CAAO,EAAE,IAAA,EAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,EAAE,QAAA,CAAS,IAAI,CAAA,EAAG,EAAE,MAAA,EAAO;AAElD,IAAM,aAAA,GAAgBH,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,0BAA0B,CAAA,EAAG,CAAA,CACrD,MAAA,EAAO,CACP,SAAS,kEAAkE,CAAA;AAGvE,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,8BAA8B,CAAA,EAAG,CAAA,CACzD,MAAA,EAAO,CACP,SAAS,0EAA0E,CAAA;AAG/E,IAAM,eAAA,GAAkBA,KAAAA,CAC5B,MAAA,CAAO,EAAE,MAAA,EAAQ,QAAA,CAAS,6BAA6B,CAAA,EAAG,CAAA,CAC1D,MAAA,EAAO,CACP,SAAS,yDAAyD,CAAA;AAG9D,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,mCAAmC,CAAA,EAAG,CAAA,CAC9D,MAAA,EAAO,CACP,SAAS,mEAAmE,CAAA;AAGxE,IAAM,aAAA,GAAgBA,KAAAA,CAC1B,MAAA,CAAO,EAAE,IAAA,EAAM,QAAA,CAAS,mCAAmC,CAAA,EAAG,CAAA,CAC9D,MAAA,EAAO,CACP,SAAS,mEAAmE,CAAA;AAOxE,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,mCAAmC,CAAA;AAAA,IAC/D,GAAA,EAAKH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,kCAAkC;AAAA,GACnE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,2EAA2E,CAAA;AAGhF,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAAA,IACjD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,CAAS,4CAA4C;AAAA,GAC5F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,mDAAmD,CAAA;AAGxD,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAAA,IACjD,KAAA,EAAOH,MAAE,MAAA,EAAO,CAAE,KAAI,CAAE,WAAA,EAAY,CAAE,QAAA,CAAS,4CAA4C;AAAA,GAC5F,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,mDAAmD,CAAA;AAGxD,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,MAAA,EAAQA,MACL,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,QAAQA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,wCAAwC;AAAA,GACvE,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,6EAA6E,CAAA;AAGlF,IAAM,iBAAA,GAAoBH,MAC9B,MAAA,CAAO;AAAA,EACN,QAAA,EAAUA,MACP,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,wCAAwC,CAAA;AAAA,IACvE,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,oDAAoD;AAAA,GACjF,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iEAAiE,CAAA;AC/G7E,IAAIF,aAAAA,GAA4BD,MAAE,GAAA,EAAI;AAC/B,IAAME,eAAAA,GAAgB,CAAC,MAAA,KAA+B;AAC3D,EAAAD,aAAAA,GAAc,MAAA;AAChB,CAAA;AACA,IAAME,SAAO,MAAoBF,aAAAA;AAYjC,IAAM,UAAA,GAAaD,MAChB,KAAA,CAAMA,KAAAA,CAAE,MAAM,CAACA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,GAAS,GAAA,EAAI,CAAE,WAAA,EAAa,CAAC,CAAC,EAC3D,GAAA,CAAI,CAAC,CAAA,CACL,QAAA,CAAS,2EAA2E,CAAA;AAEhF,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,MACH,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAAyB,CAAA;AAAA,IACrD,IAAA,EAAM;AAAA,GACP,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,wGAAmG,CAAA;AAGxG,IAAM,oBAAA,GAAuBH,MACjC,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,kCAAkC,CAAA;AAAA,IAC9D,GAAA,EAAKH,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,QAAA,CAAS,2FAAsF;AAAA,GACtI,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;AAGK,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,0CAA0C,CAAA;AAAA,IACtE,IAAA,EAAM,UAAA;AAAA,IACN,OAAOH,KAAAA,CACJ,IAAA,CAAKG,MAAI,CAAA,CACT,SAAS,gGAAgG,CAAA;AAAA,IAC5G,EAAA,EAAIH,KAAAA,CAAE,MAAA,EAAO,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS,CAAE,QAAA,CAAS,sEAAsE;AAAA,GACjH,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;AAGK,IAAM,gBAAA,GAAmBA,MAC7B,MAAA,CAAO;AAAA,EACN,OAAA,EAASA,MACN,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,iBAAiB,CAAA;AAAA,IAC7C,OAAA,EAASH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,4DAAuD,CAAA;AAAA,IAC3F,OAAOA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,6BAA6B;AAAA,GAC3D,EACA,MAAA;AACL,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,0IAA0I,CAAA;AAG/I,IAAM,cAAA,GAAiBH,MAC3B,MAAA,CAAO;AAAA,EACN,KAAA,EAAOA,MACJ,MAAA,CAAO;AAAA,IACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,4CAAuC,CAAA;AAAA,IACnE,EAAA,EAAIH,MAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,SAAS,6CAA6C,CAAA;AAAA,IAC5E,OAAOA,KAAAA,CACJ,KAAA;AAAA,MACCA,MACG,MAAA,CAAO;AAAA,QACN,MAAMA,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,oEAAoE,CAAA;AAAA,QAChG,MAAMH,KAAAA,CAAE,IAAA,CAAKG,MAAI,CAAA,CAAE,SAAS,yBAA0B;AAAA,OACvD,EACA,MAAA;AAAO,KACZ,CACC,GAAA,CAAI,CAAC,CAAA,CACL,SAAS,kEAAkE,CAAA;AAAA,IAC9E,KAAA,EAAOH,MACJ,IAAA,CAAK,CAAC,QAAQ,KAAK,CAAC,CAAA,CACpB,QAAA,EAAS,CACT,QAAA;AAAA,MACC;AAAA;AAEF,GACH,EACA,MAAA;AACL,CAAC,CAAA,CACA,QAAO,CACP,QAAA;AAAA,EACC;AAEF,CAAA;;;ACjDK,IAAM,OAAA,GAAU;AAAA,EACrB,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA,EAClC,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,UAAA;AAAA,EAAY,SAAA;AAAA,EAAW,SAAA;AAAA,EAC/D,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAChC,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,cAAA;AAAA,EAAgB,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,UAAA;AAAA,EACtF,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,aAAA;AAAA,EAAe,WAAA;AAAA,EAAa,WAAA;AAAA,EACnF,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA,EAChB,QAAA;AAAA,EAAU,WAAA;AAAA,EAAa,OAAA;AAAA,EAAS,YAAA;AAAA,EAAc,QAAA;AAAA,EAAU,UAAA;AAAA,EACxD,OAAA;AAAA,EAAS,SAAA;AAAA,EAAW,cAAA;AAAA,EAAgB,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA,EAC/D,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,WAAA;AAAA,EACrB,aAAA;AAAA,EAAe,cAAA;AAAA,EAAgB,eAAA;AAAA,EAC/B,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAClC,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,UAAA;AAAA,EACtC,MAAA;AAAA,EAAQ,aAAA;AAAA,EAAe,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW;AAC/C,CAAA;AAEO,IAAM,mBAAA,GAAsB,YAAA;AAYnC,IAAM,YAAA,GAAe,SAAA;AAErB,IAAM,OAAA,GAAU,CAAC,GAAA,KAA0B,OAAA,CAAQ,KAAK,CAAC,EAAA,KAAO,OAAO,GAAG,CAAA;AAE1E,IAAM,qBAAqB,CAAC,GAAA,KAC1B,OAAA,CAAQ,GAAG,IACP,6DAAA,GACA,8FAAA;AAEN,IAAM,oBAAA,GAAuB,CAAC,GAAA,KAA0C;AACtE,EAAA,MAAM,IAAA,GAAO,IAAI,mBAAmB,CAAA;AACpC,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,GAAG,OAAO,KAAA;AACjC,EAAA,OAAO,IAAA,CAAK,MAAM,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAChE,CAAA;AAMO,IAAM,aAAiCA,KAAAA,CAAE,IAAA;AAAA,EAC9C,MACEA,MAAE,KAAA,CAAM;AAAA;AAAA,IAEN,aAAA;AAAA,IAAe,eAAA;AAAA,IAAiB,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,cAAA;AAAA;AAAA,IAE9D,aAAA;AAAA,IAAe,gBAAA;AAAA,IAAkB,gBAAA;AAAA,IAAkB,eAAA;AAAA,IACnD,iBAAA;AAAA,IAAmB,gBAAA;AAAA,IAAkB,gBAAA;AAAA;AAAA,IAErC,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,eAAA;AAAA;AAAA,IAE5D,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,kBAAA;AAAA,IAAoB,qBAAA;AAAA,IAAuB,cAAA;AAAA,IAC3E,eAAA;AAAA,IAAiB,eAAA;AAAA,IAAiB,eAAA;AAAA,IAAiB,iBAAA;AAAA;AAAA,IAEnD,YAAA;AAAA,IAAc,aAAA;AAAA,IAAe,YAAA;AAAA,IAAc,aAAA;AAAA,IAC3C,YAAA;AAAA,IAAc,aAAA;AAAA,IAAe,eAAA;AAAA,IAC7B,oBAAA;AAAA,IAAsB,kBAAA;AAAA,IAAoB,kBAAA;AAAA;AAAA,IAE1C,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,YAAA;AAAA;AAAA,IAE9B,eAAA;AAAA,IAAiB,kBAAA;AAAA,IAAoB,cAAA;AAAA,IAAgB,mBAAA;AAAA,IACrD,eAAA;AAAA,IAAiB,iBAAA;AAAA;AAAA,IAEjB,cAAA;AAAA,IAAgB,gBAAA;AAAA,IAAkB,qBAAA;AAAA,IAClC,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,gBAAA;AAAA;AAAA,IAEhD,cAAA;AAAA,IAAgB,iBAAA;AAAA,IAAmB,kBAAA;AAAA;AAAA,IAEnC,oBAAA;AAAA,IAAsB,qBAAA;AAAA,IAAuB,sBAAA;AAAA;AAAA,IAE7C,aAAA;AAAA,IAAe,aAAA;AAAA,IAAe,eAAA;AAAA,IAAiB,aAAA;AAAA,IAAe,aAAA;AAAA,IAC9D,eAAA;AAAA,IAAiB,cAAA;AAAA,IAAgB,cAAA;AAAA,IAAgB,eAAA;AAAA,IAAiB,iBAAA;AAAA;AAAA,IAElE,aAAA;AAAA,IAAe,oBAAA;AAAA,IAAsB,gBAAA;AAAA,IAAkB,gBAAA;AAAA,IAAkB,cAAA;AAAA;AAAA,IAEzE,mBAAA;AAAA;AAAA,IAEAA,MAAE,KAAA,CAAMA,KAAAA,CAAE,IAAA,CAAK,MAAM,UAAU,CAAC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQhCA,KAAAA,CAAE,MAAA,CAAOA,KAAAA,CAAE,MAAA,GAAS,KAAA,CAAM,YAAA,EAAc,EAAE,KAAA,EAAO,CAAC,KAAA,KAAU,kBAAA,CAAmB,KAAA,CAAM,KAAK,CAAA,EAAG,CAAA,EAAGA,KAAAA,CAAE,IAAA,CAAK,MAAM,UAAU,CAAC,EACrH,MAAA,CAAO,CAAC,CAAA,KAAM,oBAAA,CAAqB,CAAC,CAAA,EAAG,EAAE,OAAA,EAAS,gEAAgE;AAAA,GACtH,CAAA,CAAE,QAAA,CAAS,yFAAyF;AACzG,CAAA;AAMA,aAAA,CAAY,UAAU,CAAA;AACtBE,cAAAA,CAAa,UAAU,CAAA;AACvBA,cAAAA,CAAY,UAAU,CAAA;AACtBA,cAAAA,CAAc,UAAU,CAAA;AACxBA,cAAAA,CAAiB,UAAU,CAAA;AAC3BA,cAAAA,CAAa,UAAU,CAAA;AACvBA,cAAAA,CAAiB,UAAU,CAAA;AAC3BA,cAAAA,CAAc,UAAU,CAAA;AACxBA,cAAAA,CAAY,UAAU,CAAA;AACtBA,eAAAA,CAAY,UAAU,CAAA;AACtBA,eAAAA,CAAa,UAAU,CAAA;AACvBA,eAAAA,CAAiB,UAAU,CAAA;ACjLpB,IAAM,eAAe,UAAA,CAAW,QAAA;AAAA,EACrC;AACF,CAAA;;;ACoBO,IAAM,WAAA,GAAgC;AAAA;AAAA,EAE3C,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,OAAA;AAAA;AAAA,EAElC,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,QAAA;AAAA;AAAA,EAEvE,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA;AAAA,EAE5E,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,cAAA;AAAA,EAAgB,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA;AAAA,EAEnE,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ,QAAA;AAAA,EAAU,WAAA;AAAA,EAAa,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ,KAAA;AAAA;AAAA,EAEpF,QAAA;AAAA,EAAU,WAAA;AAAA,EAAa,OAAA;AAAA,EAAS,UAAA;AAAA,EAAY,OAAA;AAAA,EAAS,OAAA;AAAA,EAAS,SAAA;AAAA;AAAA,EAE9D,OAAA;AAAA,EAAS,WAAA;AAAA,EAAa,aAAA;AAAA,EAAe,cAAA;AAAA,EAAgB;AACvD,CAAA;AC9BO,IAAM,mBAAA,GAAsB,CAAC,MAAA,GAA2B,eAAA,KAC7DF,MAAE,YAAA,CAAa,YAAA,EAAc,EAAE,MAAA,EAAQ,CAAA;AAoBzC,IAAM,QAAA,GAAW,CAAC,KAAA,KAAwC,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAG7H,IAAM,SAAA,GAAY,CAAC,KAAA,KAA4B;AAC7C,EAAA,MAAM,QAAQ,QAAA,CAAS,KAAK,CAAA,GAAI,KAAA,CAAM,OAAO,CAAA,GAAI,MAAA;AACjD,EAAA,MAAM,IAAA,GAAgB,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,MAAM,MAAA,KAAW,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,MAAA;AAC9E,EAAA,OAAO,QAAA,CAAS,IAAI,CAAA,IAAK,MAAA,IAAU,OAAO,IAAA,GAAO,KAAA;AACnD,CAAA;AAGA,IAAM,SAAA,GAAY,CAAC,GAAA,KAA+C;AAChE,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,MAAA;AACpC,EAAA,MAAM,KAAA,GAAQ,uBAAA,CAAwB,IAAA,CAAK,GAAG,CAAA;AAC9C,EAAA,OAAO,KAAA,GAAQ,CAAC,CAAA,KAAM,MAAA,IAAa,MAAM,CAAC,CAAA,KAAM,MAAA,GAAY,CAAC,MAAM,CAAC,CAAA,EAAG,KAAA,CAAM,CAAC,CAAC,CAAA,GAAI,MAAA;AACrF,CAAA;AAEA,IAAM,OAAA,GAAU,CAAC,IAAA,EAAkB,GAAA,KAAyC;AAC1E,EAAA,MAAM,MAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,CAAA;AAChC,EAAA,MAAM,GAAA,GAAM,SAAS,SAAS,CAAA,GAAI,UAAU,MAAA,CAAO,CAAC,CAAC,CAAA,GAAI,MAAA;AACzD,EAAA,OAAO,QAAA,CAAS,GAAG,CAAA,GAAI,GAAA,GAAM,MAAA;AAC/B,CAAA;AAIA,IAAM,IAAA,GAAO,CAAC,IAAA,EAAkB,OAAA,KAAyC;AACvE,EAAA,MAAM,WAAA,GAAc,UAAU,OAAO,CAAA;AACrC,EAAA,MAAMG,MAAAA,GAAO,QAAA,CAAS,WAAW,CAAA,IAAK,MAAA,IAAU,WAAA,GAAc,OAAA,CAAQ,IAAA,EAAM,WAAA,CAAY,MAAM,CAAC,CAAA,GAAI,WAAA;AACnG,EAAA,MAAM,aAAa,QAAA,CAASA,MAAI,CAAA,GAAIA,MAAAA,CAAK,YAAY,CAAA,GAAI,MAAA;AACzD,EAAA,MAAM,GAAA,GAAM,SAAS,UAAU,CAAA,GAAI,OAAO,IAAA,CAAK,UAAU,CAAA,CAAE,CAAC,CAAA,GAAI,MAAA;AAChE,EAAA,OAAO,QAAQ,MAAA,IAAa,GAAA,CAAI,UAAA,CAAW,GAAG,IAAI,GAAA,GAAM,MAAA;AAC1D,CAAA;AAEA,IAAM,MAAA,GAAS,CAAC,KAAA,EAAgB,KAAA,KAA6B;AAC3D,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,MAAA,CAAO,IAAA,EAAM,KAAK,CAAA;AAC5C,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,QAAQ,MAAA,IAAU,OAAO,UAAU,QAAA,EAAU,KAAA,CAAM,IAAI,KAAK,CAAA;AAAA,SAC3D,MAAA,CAAO,OAAO,KAAK,CAAA;AAAA,EAC1B;AACF,CAAA;AAEO,IAAM,oBAAA,GAAuB,CAAC,GAAA,EAAuB,MAAA,GAA2B,oBACrF,sBAAA,CAAuB,mBAAA,CAAoB,MAAM,CAAA,EAAG,GAAG,CAAA;AAIlD,IAAM,sBAAA,GAAyB,CAAC,IAAA,EAAe,GAAA,KAAkC;AACtF,EAAA,IAAI,CAAC,QAAA,CAAS,IAAI,GAAG,MAAM,IAAI,MAAM,gDAAgD,CAAA;AACrF,EAAA,MAAM,IAAA,GAAO,gBAAgB,IAAI,CAAA;AACjC,EAAA,MAAM,GAAA,GAAM,UAAU,IAAI,CAAA;AAC1B,EAAA,MAAMA,MAAAA,GAAO,QAAQ,IAAA,EAAM,QAAA,CAAS,GAAG,CAAA,GAAI,GAAA,CAAI,MAAM,CAAA,GAAI,MAAS,CAAA;AAClE,EAAA,MAAM,YAAA,GAAeA,SAAO,OAAO,CAAA;AACnC,EAAA,IAAIA,MAAAA,KAAS,MAAA,IAAa,CAAC,KAAA,CAAM,OAAA,CAAQ,YAAY,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,2DAA2D,CAAA;AAEnI,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAY,GAAG,CAAA;AAChC,EAAAA,OAAK,OAAO,CAAA,GAAI,YAAA,CAAa,MAAA,CAAO,CAAC,WAAA,KAAgB;AACnD,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,IAAA,EAAM,WAAW,CAAA;AACjC,IAAA,OAAO,EAAA,KAAO,MAAA,IAAa,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAAA,EACxC,CAAC,CAAA;AAID,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,KAAyB;AACtC,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,MAAA,CAAO,OAAO,KAAK,CAAA;AACnB,IAAA,KAAA,MAAW,OAAO,KAAA,EAAO;AACvB,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACtB,MAAA,OAAA,CAAQ,IAAI,GAAG,CAAA;AACf,MAAA,OAAA,CAAQ,KAAK,GAAG,CAAA;AAAA,IAClB;AAAA,EACF,CAAA;AACA,EAAA,KAAA,CAAM,EAAE,GAAG,IAAA,EAAM,OAAO,MAAA,EAAW,WAAA,EAAa,QAAW,CAAA;AAC3D,EAAA,KAAA,IAAS,GAAA,GAAM,OAAA,CAAQ,GAAA,EAAI,EAAG,QAAQ,MAAA,EAAW,GAAA,GAAM,OAAA,CAAQ,GAAA,EAAI,EAAG,KAAA,CAAM,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAC,CAAA;AAE9F,EAAA,KAAA,MAAW,SAAA,IAAa,CAAC,OAAA,EAAS,aAAa,CAAA,EAAG;AAChD,IAAA,MAAM,IAAA,GAAO,KAAK,SAAS,CAAA;AAC3B,IAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACrB,IAAA,KAAA,MAAW,QAAQ,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,MAAO,CAAC,OAAA,CAAQ,GAAA,CAAI,CAAA,EAAA,EAAK,SAAS,CAAA,CAAA,EAAI,IAAI,EAAE,CAAA,EAAG,OAAO,KAAK,IAAI,CAAA;AAAA,EACpG;AACA,EAAA,OAAO,IAAA;AACT,CAAA;;;AC1EO,IAAM,uBAAA,GAA0BH,MAAE,MAAA,CAAO;AAAA,EAC9C,WAAA,EAAaA,KAAAA,CACV,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,OAAA,EAAS,CAAA,CAC9B,QAAA,CAAS,qFAAqF,CAAA;AAAA,EACjG,WAAA,EAAaA,KAAAA,CACV,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA,GACF;AAAA,EACF,iBAAA,EAAmBA,KAAAA,CAChB,MAAA,CAAOA,KAAAA,CAAE,MAAA,EAAO,EAAGA,KAAAA,CAAE,MAAA,EAAQ,CAAA,CAC7B,QAAA,EAAS,CACT,SAAS,sFAAsF,CAAA;AAAA,EAClG,OAAOA,KAAAA,CACJ,MAAA,GACA,QAAA,EAAS,CACT,SAAS,8DAA8D;AAC5E,CAAC;AAiBD,IAAM,YAAA,GAAe,CAAA;;AAAA;;AAAA;AAAA;AAAA,6IAAA,CAAA;AAQrB,IAAM,UAAA,GAAa,CAAA;AAAA,EAAwE,KAAK,SAAA,CAAU,oBAAA,CAAqB,WAAA,EAAa,SAAS,CAAC,CAAC,CAAA,CAAA;AAMhJ,IAAM,eAAwCK,kBAAA,CAAoB;AAAA,EACvE,EAAA,EAAI,eAAA;AAAA,EACJ,WAAA,EAAa,qFAAA;AAAA,EACb,YAAA,EAAc,YAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMd,MAAA,EAAQ,EAAE,MAAA,EAAQ,YAAA,EAAc,KAAK,UAAA;AACvC,CAAC","file":"agent.cjs","sourcesContent":["import { z } from 'zod';\n\nexport const JsonPrimitiveSchema = z\n .union([z.string(), z.number(), z.boolean(), z.null()])\n .describe('JSON primitive: string | number | boolean | null');\n\nexport const JsonValueSchema: z.ZodType<\n string | number | boolean | null | unknown[] | Record<string, unknown>\n> = z.lazy(() =>\n z.union([JsonPrimitiveSchema, z.array(JsonValueSchema), z.record(z.string(), JsonValueSchema)]),\n).describe('Any JSON value: primitive, array, or object');\n\nexport const JsonObjectSchema = z\n .record(z.string(), JsonValueSchema)\n .describe('JSON object mapping string keys to JSON values');\n","import { z } from 'zod';\n\nimport { JsonValueSchema } from '../json.schema';\n\n// Forward reference — set by node.schema.ts after NodeSchema is created\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\n// ═══════════════════════════════════════════════════════════\n// $ref — Resolve JSONPath against source\n// ═══════════════════════════════════════════════════════════\n\nexport const RefNodeSchema = z\n .object({\n $ref: z\n .string()\n .regex(/^\\$(\\..*)?$/)\n .describe('JSONPath from the source root: \"$\" is the whole source; \"$.user.name\", \"$.items[0].sku\" reach into it. Only reads from source data, not variables. For variables use $var, for navigating into variables use $get.'),\n })\n .strict()\n .describe('Read a value from the source data by static JSONPath. Use $ref for source access, $var for variables, $get for navigating into variables or dynamic paths.');\n\nexport type RefNode = z.infer<typeof RefNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $const — Literal value\n// ═══════════════════════════════════════════════════════════\n\nexport const ConstNodeSchema = z\n .object({\n $const: JsonValueSchema.describe('Any JSON value to return as-is.'),\n })\n .strict()\n .describe('Return a literal JSON value unchanged.');\n\nexport type ConstNode = z.infer<typeof ConstNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $var — Read variable from scope\n// ═══════════════════════════════════════════════════════════\n\nexport const VarNodeSchema = z\n .object({\n $var: z.string().min(1).describe('Variable name bound by $with, $map, $filter, $reduce, or $sortBy.'),\n })\n .strict()\n .describe('Read a scoped variable by name. Variables are created by $with (let bindings), $map/$filter/$reduce/$sortBy (loop element). Returns the whole variable — use $get to navigate into it.');\n\nexport type VarNode = z.infer<typeof VarNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $get — Dynamic path access\n// ═══════════════════════════════════════════════════════════\n\nexport const GetNodeSchema = z\n .object({\n $get: z\n .object({\n from: z.lazy(node).describe('Source value to navigate into.'),\n path: z\n .array(z.union([z.string(), z.number(), z.lazy(node)]))\n .min(1)\n .describe('Path segments: string keys, numeric indices, or node expressions.'),\n fallback: z.lazy(node).optional().describe('Fallback value when path is missing.'),\n })\n .strict(),\n })\n .strict()\n .describe('Navigate into a value by path. Use to access fields on variables: {$get: {from: {$var: \"item\"}, path: [\"name\"]}}. Also supports dynamic path segments (nodes as segments) and fallback values. Prefer $ref for simple source access.');\n\nexport type GetNode = z.infer<typeof GetNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $with — Variable scoping\n// ═══════════════════════════════════════════════════════════\n\nexport const WithNodeSchema = z\n .object({\n $with: z\n .object({\n let: z\n .record(z.string(), z.lazy(node))\n .describe('Variable bindings: name → expression evaluated in current scope.'),\n value: z.lazy(node).describe('Expression evaluated with the declared variables in scope.'),\n })\n .strict(),\n })\n .strict()\n .describe('Bind variables in a scoped block: { $with: { let: { x: ... }, value: ... } }');\n\nexport type WithNode = z.infer<typeof WithNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\n// ═══════════════════════════════════════════════════════════\n// $map — Transform each element\n// ═══════════════════════════════════════════════════════════\n\nexport const MapNodeSchema = z\n .object({\n $map: z\n .object({\n over: z.lazy(node).describe('Array to iterate over.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n body: z.lazy(node).describe('Expression evaluated for each element.'),\n })\n .strict(),\n })\n .strict()\n .describe('Map over an array, transforming each element.');\n\nexport type MapNode = z.infer<typeof MapNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $filter — Keep matching elements\n// ═══════════════════════════════════════════════════════════\n\nexport const FilterNodeSchema = z\n .object({\n $filter: z\n .object({\n over: z.lazy(node).describe('Array to filter.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n when: z.lazy(node).describe('Condition — keeps element when truthy.'),\n })\n .strict(),\n })\n .strict()\n .describe('Filter an array, keeping elements where condition is truthy.');\n\nexport type FilterNode = z.infer<typeof FilterNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $reduce — Fold/accumulate\n// ═══════════════════════════════════════════════════════════\n\nexport const ReduceNodeSchema = z\n .object({\n $reduce: z\n .object({\n over: z.lazy(node).describe('Array to reduce.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n acc: z.string().min(1).optional().default('acc').describe('Accumulator variable name. Default: \"acc\".'),\n init: z.lazy(node).describe('Initial accumulator value.'),\n body: z.lazy(node).describe('Expression evaluated for each element with both element and accumulator in scope.'),\n })\n .strict(),\n })\n .strict()\n .describe('Reduce an array to a single value using an accumulator.');\n\nexport type ReduceNode = z.infer<typeof ReduceNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $slice — Array/string slice\n// ═══════════════════════════════════════════════════════════\n\nexport const SliceNodeSchema = z\n .object({\n $slice: z\n .object({\n from: z.lazy(node).describe('Array or string to slice.'),\n start: z.number().int().optional().describe('Start index (inclusive). Default: 0.'),\n end: z.number().int().optional().describe('End index (exclusive). Default: length.'),\n })\n .strict(),\n })\n .strict()\n .describe('Slice an array or string by start/end indices.');\n\nexport type SliceNode = z.infer<typeof SliceNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $flatten — Flatten one level\n// ═══════════════════════════════════════════════════════════\n\nexport const FlattenNodeSchema = z\n .object({\n $flatten: z.lazy(node).describe('Array of arrays to flatten one level.'),\n })\n .strict()\n .describe('Flatten a nested array by one level.');\n\nexport type FlattenNode = z.infer<typeof FlattenNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $unique — Deduplicate\n// ═══════════════════════════════════════════════════════════\n\nexport const UniqueNodeSchema = z\n .object({\n $unique: z.lazy(node).describe('Array to deduplicate.'),\n })\n .strict()\n .describe('Remove duplicate values from an array (compared by JSON.stringify).');\n\nexport type UniqueNode = z.infer<typeof UniqueNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $sortBy — Sort by computed key\n// ═══════════════════════════════════════════════════════════\n\nexport const SortByNodeSchema = z\n .object({\n $sortBy: z\n .object({\n over: z.lazy(node).describe('Array to sort.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n by: z.lazy(node).describe('Expression to compute the sort key.'),\n dir: z.enum(['asc', 'desc']).optional().default('asc').describe('Sort direction. Default: \"asc\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Sort an array by a computed key.');\n\nexport type SortByNode = z.infer<typeof SortByNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst pairOf = (desc: string) =>\n z.tuple([z.lazy(node), z.lazy(node)]).describe(desc);\n\n// ═══════════════════════════════════════════════════════════\n// Binary math ops\n// ═══════════════════════════════════════════════════════════\n\nexport const AddNodeSchema = z\n .object({ $add: pairOf('Two numeric operands to add.') })\n .strict()\n .describe('Add two numbers.');\nexport type AddNode = z.infer<typeof AddNodeSchema>;\n\nexport const SubNodeSchema = z\n .object({ $sub: pairOf('Two numeric operands to subtract (a - b).') })\n .strict()\n .describe('Subtract second number from first.');\nexport type SubNode = z.infer<typeof SubNodeSchema>;\n\nexport const MulNodeSchema = z\n .object({ $mul: pairOf('Two numeric operands to multiply.') })\n .strict()\n .describe('Multiply two numbers.');\nexport type MulNode = z.infer<typeof MulNodeSchema>;\n\nexport const DivNodeSchema = z\n .object({ $div: pairOf('Two numeric operands to divide (a / b). Throws on division by zero.') })\n .strict()\n .describe('Divide first number by second. Throws E_DIVISION_BY_ZERO if divisor is 0.');\nexport type DivNode = z.infer<typeof DivNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// $round\n// ═══════════════════════════════════════════════════════════\n\nexport const RoundNodeSchema = z\n .object({\n $round: z\n .object({\n value: z.lazy(node).describe('Numeric value to round.'),\n digits: z.number().int().nonnegative().optional().default(0).describe('Decimal places. Default: 0.'),\n })\n .strict(),\n })\n .strict()\n .describe('Round a number to N decimal places.');\nexport type RoundNode = z.infer<typeof RoundNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const JoinNodeSchema = z\n .object({\n $join: z\n .object({\n parts: z\n .lazy(node)\n .describe('Values to concatenate (coerced to string): a literal list of nodes, or any node that evaluates to an array — a mapped list, a $var.'),\n sep: z.string().optional().default('').describe('Separator between parts. Default: \"\".'),\n })\n .strict(),\n })\n .strict()\n .describe('Concatenate values into a string with an optional separator.');\nexport type JoinNode = z.infer<typeof JoinNodeSchema>;\n\nexport const ToStringNodeSchema = z\n .object({ $toString: z.lazy(node).describe('Value to stringify via String().') })\n .strict()\n .describe('Convert a value to its string representation.');\nexport type ToStringNode = z.infer<typeof ToStringNodeSchema>;\n\nexport const InterpolateNodeSchema = z\n .object({\n $interpolate: z\n .object({\n template: z.string().describe('Template with {{key}} placeholders.'),\n values: z.lazy(node).describe('Object whose keys replace {{key}} placeholders.'),\n })\n .strict(),\n })\n .strict()\n .describe('Replace {{key}} placeholders in a template with values from an object.');\nexport type InterpolateNode = z.infer<typeof InterpolateNodeSchema>;\n\nexport const FillNodeSchema = z\n .object({\n $fill: z\n .lazy(node)\n .describe('A pattern value `{ phrase, slots }` — filled with its own slots, source language. Non-patterns pass through.'),\n })\n .strict()\n .describe('Fill a counted phrase: `{ phrase: \"{n} of {total}\", slots: { n: 1, total: 12 } }` → \"1 of 12\".');\nexport type FillNode = z.infer<typeof FillNodeSchema>;\n\nexport const TrimNodeSchema = z\n .object({ $trim: z.lazy(node).describe('String to trim whitespace from.') })\n .strict()\n .describe('Trim leading and trailing whitespace from a string.');\nexport type TrimNode = z.infer<typeof TrimNodeSchema>;\n\nexport const LowerNodeSchema = z\n .object({ $lower: z.lazy(node).describe('String to lowercase.') })\n .strict()\n .describe('Convert a string to lowercase.');\nexport type LowerNode = z.infer<typeof LowerNodeSchema>;\n\nexport const UpperNodeSchema = z\n .object({ $upper: z.lazy(node).describe('String to uppercase.') })\n .strict()\n .describe('Convert a string to uppercase.');\nexport type UpperNode = z.infer<typeof UpperNodeSchema>;\n\nexport const SplitNodeSchema = z\n .object({\n $split: z\n .object({\n value: z.lazy(node).describe('String to split.'),\n sep: z.string().describe('Separator to split on.'),\n })\n .strict(),\n })\n .strict()\n .describe('Split a string into an array by separator.');\nexport type SplitNode = z.infer<typeof SplitNodeSchema>;\n\nexport const ReplaceNodeSchema = z\n .object({\n $replace: z\n .object({\n value: z.lazy(node).describe('String to search in.'),\n search: z.string().describe('Substring to find.'),\n replacement: z.string().describe('Replacement string.'),\n })\n .strict(),\n })\n .strict()\n .describe('Replace the first occurrence of a substring.');\nexport type ReplaceNode = z.infer<typeof ReplaceNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst pairOf = (desc: string) =>\n z.tuple([z.lazy(node), z.lazy(node)]).describe(desc);\n\n// ═══════════════════════════════════════════════════════════\n// Comparison predicates\n// ═══════════════════════════════════════════════════════════\n\nexport const EqNodeSchema = z\n .object({ $eq: pairOf('Two values to compare for deep equality.') })\n .strict()\n .describe('Deep equality comparison (JSON.stringify-based). Returns true or false.');\nexport type EqNode = z.infer<typeof EqNodeSchema>;\n\nexport const NeqNodeSchema = z\n .object({ $neq: pairOf('Two values to compare for inequality.') })\n .strict()\n .describe('Deep inequality comparison. Returns true or false.');\nexport type NeqNode = z.infer<typeof NeqNodeSchema>;\n\nexport const GtNodeSchema = z\n .object({ $gt: pairOf('Two values: returns true if first > second (numbers or strings).') })\n .strict()\n .describe('Greater than comparison for numbers or strings.');\nexport type GtNode = z.infer<typeof GtNodeSchema>;\n\nexport const GteNodeSchema = z\n .object({ $gte: pairOf('Two values: returns true if first >= second.') })\n .strict()\n .describe('Greater than or equal comparison.');\nexport type GteNode = z.infer<typeof GteNodeSchema>;\n\nexport const LtNodeSchema = z\n .object({ $lt: pairOf('Two values: returns true if first < second.') })\n .strict()\n .describe('Less than comparison.');\nexport type LtNode = z.infer<typeof LtNodeSchema>;\n\nexport const LteNodeSchema = z\n .object({ $lte: pairOf('Two values: returns true if first <= second.') })\n .strict()\n .describe('Less than or equal comparison.');\nexport type LteNode = z.infer<typeof LteNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// Emptiness check\n// ═══════════════════════════════════════════════════════════\n\nexport const EmptyNodeSchema = z\n .object({ $empty: z.lazy(node).describe('Value to check for emptiness (null, \"\", [], {}).') })\n .strict()\n .describe('Returns true if value is null, empty string, empty array, or empty object.');\nexport type EmptyNode = z.infer<typeof EmptyNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// String predicates\n// ═══════════════════════════════════════════════════════════\n\nexport const StartsWithNodeSchema = z\n .object({\n $startsWith: z\n .object({\n value: z.lazy(node).describe('String to check.'),\n prefix: z.lazy(node).describe('Expected prefix.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string starts with prefix.');\nexport type StartsWithNode = z.infer<typeof StartsWithNodeSchema>;\n\nexport const EndsWithNodeSchema = z\n .object({\n $endsWith: z\n .object({\n value: z.lazy(node).describe('String to check.'),\n suffix: z.lazy(node).describe('Expected suffix.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string ends with suffix.');\nexport type EndsWithNode = z.infer<typeof EndsWithNodeSchema>;\n\nexport const ContainsNodeSchema = z\n .object({\n $contains: z\n .object({\n value: z.lazy(node).describe('String to search in.'),\n search: z.lazy(node).describe('Substring to find.'),\n })\n .strict(),\n })\n .strict()\n .describe('Returns true if string contains the search substring.');\nexport type ContainsNode = z.infer<typeof ContainsNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const NotNodeSchema = z\n .object({ $not: z.lazy(node).describe('Value to negate (truthy → false, falsy → true).') })\n .strict()\n .describe('Boolean negation of a truthy/falsy value.');\nexport type NotNode = z.infer<typeof NotNodeSchema>;\n\nexport const AndNodeSchema = z\n .object({\n $and: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to AND. Short-circuits: returns last truthy or first falsy.'),\n })\n .strict()\n .describe('Short-circuit logical AND.');\nexport type AndNode = z.infer<typeof AndNodeSchema>;\n\nexport const OrNodeSchema = z\n .object({\n $or: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to OR. Short-circuits: returns first truthy or last falsy.'),\n })\n .strict()\n .describe('Short-circuit logical OR.');\nexport type OrNode = z.infer<typeof OrNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const MergeNodeSchema = z\n .object({\n $merge: z\n .array(z.lazy(node))\n .min(1)\n .describe('Objects to shallow-merge (left to right, later wins).'),\n })\n .strict()\n .describe('Shallow merge multiple objects. Later values overwrite earlier ones.');\nexport type MergeNode = z.infer<typeof MergeNodeSchema>;\n\nexport const CoalesceNodeSchema = z\n .object({\n $coalesce: z\n .array(z.lazy(node))\n .min(1)\n .describe('Values to try in order. Returns first non-null/non-undefined.'),\n })\n .strict()\n .describe('Return the first non-null, non-undefined value.');\nexport type CoalesceNode = z.infer<typeof CoalesceNodeSchema>;\n\nexport const CaseNodeSchema = z\n .object({\n $case: z\n .object({\n branches: z\n .array(\n z.object({\n when: z.lazy(node).describe('Condition to evaluate.'),\n then: z.lazy(node).describe('Value to return if condition is truthy.'),\n }).strict(),\n )\n .min(1)\n .describe('Ordered list of when/then branches.'),\n else: z.lazy(node).optional().describe('Fallback value if no branch matches. Default: null.'),\n })\n .strict(),\n })\n .strict()\n .describe('Conditional branching: evaluates branches in order, returns first match or else.');\nexport type CaseNode = z.infer<typeof CaseNodeSchema>;\n\nexport const EntriesOfNodeSchema = z\n .object({ $entriesOf: z.lazy(node).describe('Object to convert to [key, value][] entries.') })\n .strict()\n .describe('Convert an object to an array of [key, value] pairs.');\nexport type EntriesOfNode = z.infer<typeof EntriesOfNodeSchema>;\n\nexport const KeyByNodeSchema = z\n .object({\n $keyBy: z\n .object({\n over: z.lazy(node).describe('Array to group.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n key: z.lazy(node).describe('Expression to compute the key (last wins on collision).'),\n })\n .strict(),\n })\n .strict()\n .describe('Convert an array to an object keyed by a computed value. Last element wins on key collision.');\nexport type KeyByNode = z.infer<typeof KeyByNodeSchema>;\n\nexport const GroupByNodeSchema = z\n .object({\n $groupBy: z\n .object({\n over: z.lazy(node).describe('Array to group.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n key: z.lazy(node).describe('Expression to compute the group key.'),\n })\n .strict(),\n })\n .strict()\n .describe('Group array elements into an object of arrays by computed key.');\nexport type GroupByNode = z.infer<typeof GroupByNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nexport const KeysNodeSchema = z\n .object({ $keys: z.lazy(node).describe('Object to extract keys from.') })\n .strict()\n .describe('Return the keys of an object as a string array.');\nexport type KeysNode = z.infer<typeof KeysNodeSchema>;\n\nexport const ValuesNodeSchema = z\n .object({ $values: z.lazy(node).describe('Object to extract values from.') })\n .strict()\n .describe('Return the values of an object as an array.');\nexport type ValuesNode = z.infer<typeof ValuesNodeSchema>;\n\nexport const FromEntriesNodeSchema = z\n .object({\n $fromEntries: z\n .lazy(node)\n .describe('Array of [key, value] pairs to convert to an object.'),\n })\n .strict()\n .describe('Convert [key, value][] entries into an object.');\nexport type FromEntriesNode = z.infer<typeof FromEntriesNodeSchema>;\n\nexport const PickNodeSchema = z\n .object({\n $pick: z\n .object({\n from: z.lazy(node).describe('Source object.'),\n keys: z.array(z.string()).min(1).describe('Keys to keep.'),\n })\n .strict(),\n })\n .strict()\n .describe('Pick specific keys from an object, discarding the rest.');\nexport type PickNode = z.infer<typeof PickNodeSchema>;\n\nexport const OmitNodeSchema = z\n .object({\n $omit: z\n .object({\n from: z.lazy(node).describe('Source object.'),\n keys: z.array(z.string()).min(1).describe('Keys to remove.'),\n })\n .strict(),\n })\n .strict()\n .describe('Remove specific keys from an object, keeping the rest.');\nexport type OmitNode = z.infer<typeof OmitNodeSchema>;\n\nexport const TypeNodeSchema = z\n .object({ $type: z.lazy(node).describe('Value to get the type of.') })\n .strict()\n .describe('Returns the type as a string: \"string\", \"number\", \"boolean\", \"null\", \"array\", or \"object\".');\nexport type TypeNode = z.infer<typeof TypeNodeSchema>;\n\nexport const LengthNodeSchema = z\n .object({ $length: z.lazy(node).describe('Array or string to measure.') })\n .strict()\n .describe('Return the length of an array or string.');\nexport type LengthNode = z.infer<typeof LengthNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\nconst TimeUnit = z\n .enum(['year', 'month', 'day', 'hour', 'minute', 'second'])\n .describe('Time unit for date arithmetic.');\n\nexport const DateNodeSchema = z\n .object({\n $date: z\n .object({\n value: z.lazy(node).describe('Date value (ISO string or timestamp).'),\n format: z.string().optional().describe('Output format string (dayjs format). Default: ISO 8601.'),\n utc: z.boolean().optional().default(false).describe('Format in UTC. Default: false.'),\n })\n .strict(),\n })\n .strict()\n .describe('Format a date value.');\nexport type DateNode = z.infer<typeof DateNodeSchema>;\n\nexport const DateAddNodeSchema = z\n .object({\n $dateAdd: z\n .object({\n date: z.lazy(node).describe('Base date (ISO string or timestamp).'),\n amount: z.number().describe('Amount to add (can be negative).'),\n unit: TimeUnit,\n })\n .strict(),\n })\n .strict()\n .describe('Add a duration to a date. Returns ISO string.');\nexport type DateAddNode = z.infer<typeof DateAddNodeSchema>;\n\nexport const DateDiffNodeSchema = z\n .object({\n $dateDiff: z\n .object({\n from: z.lazy(node).describe('Start date.'),\n to: z.lazy(node).describe('End date.'),\n unit: TimeUnit,\n })\n .strict(),\n })\n .strict()\n .describe('Calculate difference between two dates. Returns a number.');\nexport type DateDiffNode = z.infer<typeof DateDiffNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\n// ═══════════════════════════════════════════════════════════\n// THE LOCALE-AWARE FORMATTING FAMILY.\n//\n// `$date` (time.schema) formats with dayjs tokens and is locale-BLIND: the\n// token `MMM` is \"Mar\" in every language it will ever run in. That is correct\n// for a machine-readable stamp and wrong for anything a person reads, so the\n// three ops here exist beside it rather than inside it — the choice between\n// them is \"who is reading this\", and a caller should have to answer it.\n//\n// All three delegate to `Intl`, which the platform already ships. That is the\n// whole reason the family is small: symbol placement (`€45` vs `45 €`), the\n// decimal mark, weekday and month names, and the digit grouping are not\n// three ops' worth of rules, they are one runtime's worth of CLDR data.\n//\n// `locale` is REQUIRED on every one of them. A default here would be the same\n// bug `format.prism.ts` documents about its currency symbol: the call site\n// that forgot still renders something plausible, and the only way to find out\n// is a reader in Vienna being shown American dates.\n// ═══════════════════════════════════════════════════════════\n\nconst localeField = z\n .lazy(node)\n .describe('BCP-47 locale tag (\"de-AT\", \"en-GB\"). Required — a default renders plausible nonsense for everybody it is wrong for.');\n\nconst fallbackField = z\n .lazy(node)\n .optional()\n .describe('Rendered when the value is null/undefined/empty. Default: \"\".');\n\n// The subset of Intl.DateTimeFormatOptions worth exposing declaratively. A\n// passthrough `z.record(z.unknown())` would let a typo ride silently into a\n// formatter that ignores unknown keys — every field a screen actually asks\n// for is named here instead, and anything else is a schema error at author\n// time rather than a missing weekday at read time.\nconst DateStyle = z.enum(['full', 'long', 'medium', 'short']);\n\nexport const IntlDateOptionsSchema = z\n .object({\n dateStyle: DateStyle.optional().describe('Whole-date preset. Mutually exclusive with the field-by-field options below.'),\n timeStyle: DateStyle.optional().describe('Whole-time preset. Mutually exclusive with the field-by-field options below.'),\n weekday: z.enum(['long', 'short', 'narrow']).optional(),\n year: z.enum(['numeric', '2-digit']).optional(),\n month: z.enum(['numeric', '2-digit', 'long', 'short', 'narrow']).optional(),\n day: z.enum(['numeric', '2-digit']).optional(),\n hour: z.enum(['numeric', '2-digit']).optional(),\n minute: z.enum(['numeric', '2-digit']).optional(),\n second: z.enum(['numeric', '2-digit']).optional(),\n hour12: z.boolean().optional().describe('Force 12/24-hour. Omit to take the locale\\'s own convention — which is the point of asking for a locale.'),\n timeZone: z\n .string()\n .optional()\n .describe('IANA zone. Omit and a DATE-only value (\"2026-03-14\") is read as UTC, which is what stops it rendering as the 13th west of Greenwich.'),\n })\n .strict();\n\nexport type IntlDateOptions = z.infer<typeof IntlDateOptionsSchema>;\n\nexport const LocaleDateNodeSchema = z\n .object({\n $localeDate: z\n .object({\n value: z.lazy(node).describe('ISO string, DATE-only string, or epoch milliseconds.'),\n locale: localeField,\n options: IntlDateOptionsSchema.optional().describe('Defaults to { dateStyle: \"medium\" }.'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format a date for a human reading in a given locale (Intl.DateTimeFormat).');\nexport type LocaleDateNode = z.infer<typeof LocaleDateNodeSchema>;\n\nexport const LocaleMoneyNodeSchema = z\n .object({\n $localeMoney: z\n .object({\n value: z.lazy(node).describe('The amount. Minor units (cents) unless `minorUnits` is false.'),\n currency: z.lazy(node).describe('ISO-4217 code — \"EUR\", \"CHF\". Required: an amount without one is a number, not money.'),\n locale: localeField,\n minorUnits: z\n .boolean()\n .optional()\n .describe(\n 'Value is in the currency\\'s minor unit. Default true. The divisor comes from the CURRENCY, not a hardcoded 100 — JPY has no minor unit and dividing it would be a hundredfold error.',\n ),\n digits: z.number().int().min(0).max(20).optional().describe('Fraction digits. Default: the currency\\'s own (2 for EUR, 0 for JPY).'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format an amount as money in a given locale (Intl.NumberFormat, style currency).');\nexport type LocaleMoneyNode = z.infer<typeof LocaleMoneyNodeSchema>;\n\nexport const LocaleNumberNodeSchema = z\n .object({\n $localeNumber: z\n .object({\n value: z.lazy(node).describe('The number to format.'),\n locale: localeField,\n style: z.enum(['decimal', 'percent']).optional().describe('Default \"decimal\". \"percent\" multiplies by 100 — pass 0.42, not 42.'),\n digits: z.number().int().min(0).max(20).optional().describe('Maximum fraction digits. Default: the locale\\'s own.'),\n minDigits: z.number().int().min(0).max(20).optional().describe('Minimum fraction digits — for a column that should not ragged-edge.'),\n compact: z.boolean().optional().describe('Short form — \"1.2K\", \"1,2 Tsd.\". For a headline figure, never for money owed.'),\n fallback: fallbackField,\n })\n .strict(),\n })\n .strict()\n .describe('Format a number in a given locale (Intl.NumberFormat).');\nexport type LocaleNumberNode = z.infer<typeof LocaleNumberNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\n// ═══════════════════════════════════════════════════════════\n// Aggregate sugar\n// ═══════════════════════════════════════════════════════════\n\nconst overOnly = (desc: string) =>\n z.object({ over: z.lazy(node).describe(desc) }).strict();\n\nexport const SumNodeSchema = z\n .object({ $sum: overOnly('Array of numbers to sum.') })\n .strict()\n .describe('Sugar: sum all elements in an array. Desugars to $reduce + $add.');\nexport type SumNode = z.infer<typeof SumNodeSchema>;\n\nexport const AvgNodeSchema = z\n .object({ $avg: overOnly('Array of numbers to average.') })\n .strict()\n .describe('Sugar: average all elements in an array. Desugars to $div($sum, $count).');\nexport type AvgNode = z.infer<typeof AvgNodeSchema>;\n\nexport const CountNodeSchema = z\n .object({ $count: overOnly('Array to count elements of.') })\n .strict()\n .describe('Sugar: count elements in an array. Desugars to $reduce.');\nexport type CountNode = z.infer<typeof CountNodeSchema>;\n\nexport const MinNodeSchema = z\n .object({ $min: overOnly('Array of numbers to find minimum.') })\n .strict()\n .describe('Sugar: find minimum value in an array. Desugars to $reduce + $lt.');\nexport type MinNode = z.infer<typeof MinNodeSchema>;\n\nexport const MaxNodeSchema = z\n .object({ $max: overOnly('Array of numbers to find maximum.') })\n .strict()\n .describe('Sugar: find maximum value in an array. Desugars to $reduce + $gt.');\nexport type MaxNode = z.infer<typeof MaxNodeSchema>;\n\n// ═══════════════════════════════════════════════════════════\n// Collection sugar\n// ═══════════════════════════════════════════════════════════\n\nexport const PluckNodeSchema = z\n .object({\n $pluck: z\n .object({\n over: z.lazy(node).describe('Array of objects to extract from.'),\n key: z.string().min(1).describe('Key to extract from each object.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: extract a single field from each element. Desugars to $map + $get.');\nexport type PluckNode = z.infer<typeof PluckNodeSchema>;\n\nexport const TakeNodeSchema = z\n .object({\n $take: z\n .object({\n from: z.lazy(node).describe('Array to take from.'),\n count: z.number().int().nonnegative().describe('Number of elements to take from the start.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: take first N elements. Desugars to $slice.');\nexport type TakeNode = z.infer<typeof TakeNodeSchema>;\n\nexport const DropNodeSchema = z\n .object({\n $drop: z\n .object({\n from: z.lazy(node).describe('Array to drop from.'),\n count: z.number().int().nonnegative().describe('Number of elements to skip from the start.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: skip first N elements. Desugars to $slice.');\nexport type DropNode = z.infer<typeof DropNodeSchema>;\n\nexport const MatchNodeSchema = z\n .object({\n $match: z\n .object({\n over: z.lazy(node).describe('Array to search within.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n search: z.lazy(node).describe('String to search for (uses $contains).'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: filter array by string containment. Desugars to $filter + $contains.');\nexport type MatchNode = z.infer<typeof MatchNodeSchema>;\n\nexport const FlatMapNodeSchema = z\n .object({\n $flatMap: z\n .object({\n over: z.lazy(node).describe('Array to flat-map over.'),\n as: z.string().min(1).describe('Variable name for the current element.'),\n body: z.lazy(node).describe('Expression that returns an array for each element.'),\n })\n .strict(),\n })\n .strict()\n .describe('Sugar: map then flatten one level. Desugars to $map + $flatten.');\nexport type FlatMapNode = z.infer<typeof FlatMapNodeSchema>;\n","import { z } from 'zod';\n\nlet _NodeSchema: z.ZodTypeAny = z.any();\nexport const setNodeSchema = (schema: z.ZodTypeAny): void => {\n _NodeSchema = schema;\n};\nconst node = (): z.ZodTypeAny => _NodeSchema;\n\n// ═══════════════════════════════════════════════════════════\n// Transform ops — rewriting a document rather than deriving a value.\n//\n// Built for migrations (strata document steps), useful anywhere a config must\n// return its input with a precise edit: rename keys and keep their order, set\n// one deep path and leave everything else alone, test whether a key is there at\n// all (not \"present and non-null\"), refuse loudly, and rewrite every node of a\n// tree whose depth nobody knows.\n// ═══════════════════════════════════════════════════════════\n\nconst PathSchema = z\n .array(z.union([z.string(), z.number().int().nonnegative()]))\n .min(1)\n .describe('Literal path segments: object keys (strings) and array indexes (numbers).');\n\nexport const HasNodeSchema = z\n .object({\n $has: z\n .object({\n from: z.lazy(node).describe('The value to look into.'),\n path: PathSchema,\n })\n .strict(),\n })\n .strict()\n .describe('True when the whole path exists — a key present with a null value counts; a missing one does not.');\nexport type HasNode = z.infer<typeof HasNodeSchema>;\n\nexport const RenameKeysNodeSchema = z\n .object({\n $renameKeys: z\n .object({\n from: z.lazy(node).describe('The object whose keys to rename.'),\n map: z.record(z.string(), z.string()).describe('Old key → new key. Keys not listed, and listed keys that are absent, are left alone.'),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'The object with keys renamed IN PLACE — each renamed key keeps its position. If a new name is already a key of the object, that ' +\n 'entry is replaced by the renamed one.',\n );\nexport type RenameKeysNode = z.infer<typeof RenameKeysNodeSchema>;\n\nexport const UpdateNodeSchema = z\n .object({\n $update: z\n .object({\n from: z.lazy(node).describe('The value to copy with one path changed.'),\n path: PathSchema,\n value: z\n .lazy(node)\n .describe('The new value at `path`. The value currently there (null when absent) is bound as `$var` `as`.'),\n as: z.string().min(1).optional().describe('The variable name the current value is bound to (default \"current\").'),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'A copy of `from` with the value at `path` replaced and everything else identical. Missing objects along a string path are created; ' +\n 'an index that does not exist is an error.',\n );\nexport type UpdateNode = z.infer<typeof UpdateNodeSchema>;\n\nexport const AssertNodeSchema = z\n .object({\n $assert: z\n .object({\n when: z.lazy(node).describe('Must be truthy.'),\n message: z.string().min(1).describe('What went wrong, for a person — the whole error text.'),\n value: z.lazy(node).describe('Returned when `when` holds.'),\n })\n .strict(),\n })\n .strict()\n .describe('Fail with `message` (E_ASSERT) unless `when` is truthy; otherwise evaluate to `value`. How a migration refuses a shape it cannot handle.');\nexport type AssertNode = z.infer<typeof AssertNodeSchema>;\n\nexport const WalkNodeSchema = z\n .object({\n $walk: z\n .object({\n over: z.lazy(node).describe('The tree to rewrite — any JSON value.'),\n as: z.string().min(1).describe('The variable each visited node is bound to.'),\n rules: z\n .array(\n z\n .object({\n when: z.lazy(node).describe('Evaluated with the node bound to `as`; the first truthy rule wins.'),\n then: z.lazy(node).describe('The node\\'s replacement.'),\n })\n .strict(),\n )\n .min(1)\n .describe('Tried in order at every node. No rule matches: the node is kept.'),\n order: z\n .enum(['post', 'pre'])\n .optional()\n .describe(\n 'post (default): a node\\'s children are rewritten first, and its rules see the rewritten children. pre: rules see the node as ' +\n 'it was, then the walk descends into whatever they returned.',\n ),\n })\n .strict(),\n })\n .strict()\n .describe(\n 'Rewrite every node of a tree — objects, arrays and leaves, at any depth — by rules. Structural: it always terminates, and a ' +\n 'replacement is never walked again at its own level.',\n );\nexport type WalkNode = z.infer<typeof WalkNodeSchema>;\n","import { z } from 'zod';\n\nimport { JsonPrimitiveSchema } from './json.schema';\n\n// ─────────────────────────────────────────────────────────\n// Op schemas — imported for the union\n// ───────────────────────────��─────────────────────────────\n\nimport {\n RefNodeSchema, ConstNodeSchema, VarNodeSchema, GetNodeSchema, WithNodeSchema,\n setNodeSchema as setCoreNode,\n} from './ops/core.schema';\nimport {\n MapNodeSchema, FilterNodeSchema, ReduceNodeSchema, SliceNodeSchema,\n FlattenNodeSchema, UniqueNodeSchema, SortByNodeSchema,\n setNodeSchema as setArrayNode,\n} from './ops/array.schema';\nimport {\n AddNodeSchema, SubNodeSchema, MulNodeSchema, DivNodeSchema, RoundNodeSchema,\n setNodeSchema as setMathNode,\n} from './ops/math.schema';\nimport {\n FillNodeSchema, JoinNodeSchema, ToStringNodeSchema, InterpolateNodeSchema, TrimNodeSchema,\n LowerNodeSchema, UpperNodeSchema, SplitNodeSchema, ReplaceNodeSchema,\n setNodeSchema as setStringNode,\n} from './ops/string.schema';\nimport {\n EqNodeSchema, NeqNodeSchema, GtNodeSchema, GteNodeSchema,\n LtNodeSchema, LteNodeSchema, EmptyNodeSchema,\n StartsWithNodeSchema, EndsWithNodeSchema, ContainsNodeSchema,\n setNodeSchema as setPredicateNode,\n} from './ops/predicate.schema';\nimport {\n NotNodeSchema, AndNodeSchema, OrNodeSchema,\n setNodeSchema as setLogicNode,\n} from './ops/logic.schema';\nimport {\n MergeNodeSchema, CoalesceNodeSchema, CaseNodeSchema, EntriesOfNodeSchema,\n KeyByNodeSchema, GroupByNodeSchema,\n setNodeSchema as setStructureNode,\n} from './ops/structure.schema';\nimport {\n KeysNodeSchema, ValuesNodeSchema, FromEntriesNodeSchema,\n PickNodeSchema, OmitNodeSchema, TypeNodeSchema, LengthNodeSchema,\n setNodeSchema as setObjectNode,\n} from './ops/object.schema';\nimport {\n DateNodeSchema, DateAddNodeSchema, DateDiffNodeSchema,\n setNodeSchema as setTimeNode,\n} from './ops/time.schema';\nimport {\n LocaleDateNodeSchema, LocaleMoneyNodeSchema, LocaleNumberNodeSchema,\n setNodeSchema as setIntlNode,\n} from './ops/intl.schema';\nimport {\n SumNodeSchema, AvgNodeSchema, CountNodeSchema, MinNodeSchema, MaxNodeSchema,\n PluckNodeSchema, TakeNodeSchema, DropNodeSchema, MatchNodeSchema, FlatMapNodeSchema,\n setNodeSchema as setSugarNode,\n} from './ops/sugar.schema';\nimport {\n HasNodeSchema, RenameKeysNodeSchema, UpdateNodeSchema, AssertNodeSchema, WalkNodeSchema,\n setNodeSchema as setTransformNode,\n} from './ops/transform.schema';\n\n// ═══���═══════════════════════════════════════════════════════\n// Op keys — used by plain object detection\n// ═══════════════���═══════════════════════════════════════════\n\nexport const OP_KEYS = [\n '$ref', '$const', '$var', '$get', '$with',\n '$map', '$filter', '$reduce', '$slice', '$flatten', '$unique', '$sortBy',\n '$add', '$sub', '$mul', '$div', '$round',\n '$fill', '$join', '$toString', '$interpolate', '$trim', '$lower', '$upper', '$split', '$replace',\n '$eq', '$neq', '$gt', '$gte', '$lt', '$lte', '$empty', '$startsWith', '$endsWith', '$contains',\n '$not', '$and', '$or',\n '$merge', '$coalesce', '$case', '$entriesOf', '$keyBy', '$groupBy',\n '$keys', '$values', '$fromEntries', '$pick', '$omit', '$type', '$length',\n '$date', '$dateAdd', '$dateDiff',\n '$localeDate', '$localeMoney', '$localeNumber',\n '$sum', '$avg', '$count', '$min', '$max',\n '$pluck', '$take', '$drop', '$match', '$flatMap',\n '$has', '$renameKeys', '$update', '$assert', '$walk',\n] as const;\n\nexport const OPTIONAL_FIELDS_KEY = '__optional';\n\n// ═════��═════════════════════════════════════════════════════\n// Plain object helpers\n// ════════════════════��══════════════════════════════════════\n\n// A `$` name is an op's. The template branch's key schema refuses every key\n// that starts with one — the evaluator's own rule (guards.ts, `isPlainObject`),\n// so the two agree on what a template is. It used to refuse only the names of ops\n// that exist: `{ $fetch: … }` validated as a template, was stored, and was\n// refused every time it ran (E_NODE_SHAPE). It also means a new op never takes\n// a key a stored template was using.\nconst TEMPLATE_KEY = /^(?!\\$)/;\n\nconst isOpKey = (key: unknown): boolean => OP_KEYS.some((op) => op === key);\n\nconst templateKeyRefusal = (key: unknown): string =>\n isOpKey(key)\n ? 'An op name cannot be a plain object key. Use the op itself.'\n : 'Not a Prism op. A key that starts with \"$\" names an op; data with such a key goes in $const.';\n\nconst hasValidOptionalMeta = (obj: Record<string, unknown>): boolean => {\n const meta = obj[OPTIONAL_FIELDS_KEY];\n if (meta === undefined) return true;\n if (!Array.isArray(meta)) return false;\n return meta.every((f) => typeof f === 'string' && f.length > 0);\n};\n\n// ═══════════════════════════════════════════════════════════\n// NodeSchema — the big recursive union\n// ══════════════════════════════════════════════════���════════\n\nexport const NodeSchema: z.ZodType<unknown> = z.lazy(\n (): z.ZodTypeAny =>\n z.union([\n // Core\n RefNodeSchema, ConstNodeSchema, VarNodeSchema, GetNodeSchema, WithNodeSchema,\n // Array\n MapNodeSchema, FilterNodeSchema, ReduceNodeSchema, SliceNodeSchema,\n FlattenNodeSchema, UniqueNodeSchema, SortByNodeSchema,\n // Math\n AddNodeSchema, SubNodeSchema, MulNodeSchema, DivNodeSchema, RoundNodeSchema,\n // String\n FillNodeSchema, JoinNodeSchema, ToStringNodeSchema, InterpolateNodeSchema, TrimNodeSchema,\n LowerNodeSchema, UpperNodeSchema, SplitNodeSchema, ReplaceNodeSchema,\n // Predicates\n EqNodeSchema, NeqNodeSchema, GtNodeSchema, GteNodeSchema,\n LtNodeSchema, LteNodeSchema, EmptyNodeSchema,\n StartsWithNodeSchema, EndsWithNodeSchema, ContainsNodeSchema,\n // Logic\n NotNodeSchema, AndNodeSchema, OrNodeSchema,\n // Structure\n MergeNodeSchema, CoalesceNodeSchema, CaseNodeSchema, EntriesOfNodeSchema,\n KeyByNodeSchema, GroupByNodeSchema,\n // Object\n KeysNodeSchema, ValuesNodeSchema, FromEntriesNodeSchema,\n PickNodeSchema, OmitNodeSchema, TypeNodeSchema, LengthNodeSchema,\n // Time\n DateNodeSchema, DateAddNodeSchema, DateDiffNodeSchema,\n // Locale-aware formatting\n LocaleDateNodeSchema, LocaleMoneyNodeSchema, LocaleNumberNodeSchema,\n // Sugar\n SumNodeSchema, AvgNodeSchema, CountNodeSchema, MinNodeSchema, MaxNodeSchema,\n PluckNodeSchema, TakeNodeSchema, DropNodeSchema, MatchNodeSchema, FlatMapNodeSchema,\n // Transform (rewriting a document)\n HasNodeSchema, RenameKeysNodeSchema, UpdateNodeSchema, AssertNodeSchema, WalkNodeSchema,\n // Primitives\n JsonPrimitiveSchema,\n // Arrays of nodes\n z.array(z.lazy(() => NodeSchema)),\n // Plain objects (no `$` keys, recursive values)\n // A `$` key is not a template key. Said in the KEY schema, not a\n // refinement: a refinement leaves this branch structurally matched, and\n // zod then reports its complaint instead of the union's — so a typo inside\n // a real op (`{ $get: { pathh } }`) read as \"plain object must not contain\n // $ op keys\" at the root. As a key pattern it is also plain JSON Schema\n // (`propertyNames`), which the grammar snapshot and agent prompts read.\n z.record(z.string().regex(TEMPLATE_KEY, { error: (issue) => templateKeyRefusal(issue.input) }), z.lazy(() => NodeSchema))\n .refine((o) => hasValidOptionalMeta(o), { message: '__optional must be an array of non-empty field name strings.' }),\n ]).describe('A Prism node: an op, a plain JSON value, an array of nodes, or a plain object template.'),\n);\n\n// ─────────────────��────────────────────��──────────────────\n// Wire up forward references\n// ─────────────────────────────────────────────────────────\n\nsetCoreNode(NodeSchema);\nsetArrayNode(NodeSchema);\nsetMathNode(NodeSchema);\nsetStringNode(NodeSchema);\nsetPredicateNode(NodeSchema);\nsetLogicNode(NodeSchema);\nsetStructureNode(NodeSchema);\nsetObjectNode(NodeSchema);\nsetTimeNode(NodeSchema);\nsetIntlNode(NodeSchema);\nsetSugarNode(NodeSchema);\nsetTransformNode(NodeSchema);\n","import { z } from 'zod';\n\nimport { NodeSchema } from './node.schema';\n\nexport const ConfigSchema = NodeSchema.describe(\n 'A Prism config: the top-level transformation definition. Can be any valid node.',\n);\n\nexport type Config = z.infer<typeof ConfigSchema>;\n","import type { OP_KEYS } from './node.schema';\n\n// ═══════════════════════════════════════════════════════════\n// Profiles — named subsets of the ops, for DOCUMENTATION only\n// ═══════════════════════════════════════════════════════════\n//\n// A profile narrows what a prompt teaches, never what the grammar accepts:\n// every config is still parsed by the full ConfigSchema, so a config written\n// under a profile is an ordinary Prism config, and one using an op outside\n// the profile is still valid. What changes is the size of the grammar an\n// agent is handed — the full node schema is ~35k characters, most of it the\n// per-op descriptions, and an agent that only maps rows into a shape does not\n// need the ops strata rewrites documents with.\n//\n// `getProfileJsonSchema(ops)` (engine/documentation.ts) derives the narrowed\n// JSON Schema from the full one; nothing about an op is restated here.\n\nexport type OpKey = (typeof OP_KEYS)[number];\n\n// Mapping rows into a caller's shape (vex's shape mapper, prism's mapping\n// agent). Every op the repo's authored mappings and endpoint configs use —\n// counted across *.entries.ts and *.prism.ts, 2026-09-27 — and the shaping ops\n// a mapping plainly needs beside them. Left out: the document-rewriting ops\n// ($has, $renameKeys, $update, $assert, $walk) and ops no mapping here has\n// needed ($fill, $replace, $keyBy, $entriesOf, $fromEntries, $keys, $values,\n// $type, $flatten, $flatMap, $match, $drop, $dateAdd, $startsWith, $endsWith).\nexport const MAPPING_OPS: readonly OpKey[] = [\n // reading the source\n '$ref', '$const', '$var', '$get', '$with',\n // arrays\n '$map', '$filter', '$reduce', '$slice', '$unique', '$sortBy', '$take', '$pluck',\n // numbers and aggregates\n '$add', '$sub', '$mul', '$div', '$round', '$sum', '$avg', '$count', '$min', '$max',\n // strings\n '$join', '$toString', '$interpolate', '$trim', '$lower', '$upper', '$split',\n // conditions\n '$eq', '$neq', '$gt', '$gte', '$lt', '$lte', '$empty', '$contains', '$not', '$and', '$or',\n // structure\n '$merge', '$coalesce', '$case', '$groupBy', '$pick', '$omit', '$length',\n // dates and locale formatting\n '$date', '$dateDiff', '$localeDate', '$localeMoney', '$localeNumber',\n];\n","import { z } from 'zod';\n\nimport { NodeSchema } from '../schemas/node.schema';\nimport { ConfigSchema } from '../schemas/config.schema';\nimport type { OpKey } from '../schemas/profiles';\n\nexport type JsonSchemaTarget = 'draft-2020-12' | 'draft-7' | 'draft-4';\n\nexport const getNodeJsonSchema = (target: JsonSchemaTarget = 'draft-2020-12'): object =>\n z.toJSONSchema(NodeSchema, { target });\n\nexport const getConfigJsonSchema = (target: JsonSchemaTarget = 'draft-2020-12'): object =>\n z.toJSONSchema(ConfigSchema, { target });\n\n// ─────────────────────────────────────────────────────────\n// Profiles — the config schema, documenting only some ops\n// ─────────────────────────────────────────────────────────\n//\n// DERIVED from getConfigJsonSchema, never written by hand: the node is one\n// recursive definition whose `anyOf` holds one alternative per op, and every\n// child position refers back to it — so dropping an op's alternative there\n// drops it everywhere. Everything that is not an op (primitives, arrays, the\n// plain-object template, whose key pattern refuses every `$` key — so an op\n// left out of the profile is still not a template key) is kept as it is. Definitions only\n// the dropped ops used are removed. Documentation only: validation is always\n// the full ConfigSchema (schemas/profiles.ts).\n//\n// A reference is read in either spelling. Drafts 4–7 ignore keywords beside a\n// `$ref`, so a described reference is written `allOf: [{ $ref }]` there — and\n// zod does so for the root and for a described op in every version but 4.3.\n\ntype JsonObject = Record<string, unknown>;\nconst isObject = (value: unknown): value is JsonObject => typeof value === 'object' && value !== null && !Array.isArray(value);\n\n// `allOf: [{ $ref }]` → `{ $ref }`; anything else as it is.\nconst unwrapRef = (value: unknown): unknown => {\n const allOf = isObject(value) ? value['allOf'] : undefined;\n const only: unknown = Array.isArray(allOf) && allOf.length === 1 ? allOf[0] : undefined;\n return isObject(only) && '$ref' in only ? only : value;\n};\n\n// `#/$defs/x` or `#/definitions/x` → ['$defs', 'x'].\nconst refTarget = (ref: unknown): [string, string] | undefined => {\n if (typeof ref !== 'string') return undefined;\n const match = /^#\\/([^/]+)\\/([^/]+)$/.exec(ref);\n return match?.[1] !== undefined && match[2] !== undefined ? [match[1], match[2]] : undefined;\n};\n\nconst resolve = (root: JsonObject, ref: unknown): JsonObject | undefined => {\n const target = refTarget(ref);\n if (target === undefined) return undefined;\n const container = root[target[0]];\n const def = isObject(container) ? container[target[1]] : undefined;\n return isObject(def) ? def : undefined;\n};\n\n// The op an alternative is — its one `$`-key — whether written inline or\n// behind a `$ref` to its own definition.\nconst opOf = (root: JsonObject, written: unknown): string | undefined => {\n const alternative = unwrapRef(written);\n const node = isObject(alternative) && '$ref' in alternative ? resolve(root, alternative['$ref']) : alternative;\n const properties = isObject(node) ? node['properties'] : undefined;\n const key = isObject(properties) ? Object.keys(properties)[0] : undefined;\n return key !== undefined && key.startsWith('$') ? key : undefined;\n};\n\nconst refsIn = (value: unknown, found: Set<string>): void => {\n if (Array.isArray(value)) {\n for (const item of value) refsIn(item, found);\n return;\n }\n if (!isObject(value)) return;\n for (const [key, child] of Object.entries(value)) {\n if (key === '$ref' && typeof child === 'string') found.add(child);\n else refsIn(child, found);\n }\n};\n\nexport const getProfileJsonSchema = (ops: readonly OpKey[], target: JsonSchemaTarget = 'draft-2020-12'): object =>\n narrowConfigJsonSchema(getConfigJsonSchema(target), ops);\n\n// The narrowing itself, over any spelling of the config schema — exported for\n// the tests, which feed it both.\nexport const narrowConfigJsonSchema = (full: unknown, ops: readonly OpKey[]): object => {\n if (!isObject(full)) throw new Error('prism: the config JSON Schema is not an object');\n const root = structuredClone(full);\n const top = unwrapRef(root);\n const node = resolve(root, isObject(top) ? top['$ref'] : undefined);\n const alternatives = node?.['anyOf'];\n if (node === undefined || !Array.isArray(alternatives)) throw new Error('prism: the config JSON Schema has no node union to narrow');\n\n const keep = new Set<string>(ops);\n node['anyOf'] = alternatives.filter((alternative) => {\n const op = opOf(root, alternative);\n return op === undefined || keep.has(op);\n });\n\n // Keep the definitions still reachable from the root, and only those: a\n // worklist, so a chain of definitions is followed to its end.\n const reached = new Set<string>();\n const pending: string[] = [];\n const visit = (value: unknown): void => {\n const found = new Set<string>();\n refsIn(value, found);\n for (const ref of found) {\n if (reached.has(ref)) continue;\n reached.add(ref);\n pending.push(ref);\n }\n };\n visit({ ...root, $defs: undefined, definitions: undefined });\n for (let ref = pending.pop(); ref !== undefined; ref = pending.pop()) visit(resolve(root, ref));\n\n for (const container of ['$defs', 'definitions']) {\n const defs = root[container];\n if (!isObject(defs)) continue;\n for (const name of Object.keys(defs)) if (!reached.has(`#/${container}/${name}`)) delete defs[name];\n }\n return root;\n};\n","// ═══════════════════════════════════════════════════════════\n// @niscorp/prism/agent — Prism mapping agent\n// ═══════════════════════════════════════════════════════════\n//\n// Given a sample input row and a target shape, the mapping agent\n// produces a Prism Config that transforms input → target.\n//\n// This is the canonical \"package owns its agent, runs it on Cortex\"\n// pattern. Cortex is an optional peer dep: the rest of @niscorp/prism\n// does not need it.\n//\n// Usage:\n//\n// import { createSignal } from '@niscorp/signal';\n// import { mappingAgent } from '@niscorp/prism/agent';\n// import { evaluate } from '@niscorp/prism';\n//\n// const llm = createSignal('groq', { apiKey }); // qwen/qwen3.8-27b, the registry default\n// const result = await mappingAgent.run({\n// sampleInput: { first: 'Ada', last: 'Lovelace' },\n// targetShape: { fullName: '' },\n// }, { llm }).result;\n//\n// if (result.ok) {\n// // result.output.data is a fully-validated Prism Config;\n// // result.output.reasoning is the model's one-line why.\n// const output = evaluate(result.output.data, sampleInput);\n// }\n//\n// The Config schema itself is NOT embedded in this prompt — cortex\n// injects it (output.doc 'auto' → schemaDoc(ConfigSchema)) because the\n// recursive Node union can't ride the respond tool's params. One\n// source of truth, zero hand-maintained schema prose.\n\nimport { z } from 'zod';\nimport { defineAgent, type AgentDefinition } from '@niscorp/cortex';\n\nimport { ConfigSchema, type Config } from '../schemas';\nimport { MAPPING_OPS } from '../schemas/profiles';\nimport { getProfileJsonSchema } from '../engine/documentation';\n\n// ───────────────────────────────────────────────────────────\n// Input schema\n// ───────────────────────────────────────────────────────────\n\nexport const MappingAgentInputSchema = z.object({\n sampleInput: z\n .record(z.string(), z.unknown())\n .describe('A representative input row. The transformation will run against rows of this shape.'),\n targetShape: z\n .unknown()\n .describe(\n 'A JSON example of the desired output shape. Field values are placeholders; the agent infers the structure from this example.',\n ),\n fieldDescriptions: z\n .record(z.string(), z.string())\n .optional()\n .describe('Optional human-readable descriptions for fields the agent might not infer correctly.'),\n notes: z\n .string()\n .optional()\n .describe('Free-form additional context (data quirks, semantics, etc.).'),\n});\n\nexport type MappingAgentInput = z.infer<typeof MappingAgentInputSchema>;\n\n// The agent's payload IS the Prism Config. The model's explanation\n// rides the envelope's `reasoning` field — no wrapper schema.\nexport type MappingAgentOutput = Config;\n\n// ───────────────────────────────────────────────────────────\n// System prompt — role + worked example, nothing else\n// ───────────────────────────────────────────────────────────\n//\n// Per niscorp/STYLE_GUIDE.md: every operation, constraint and gotcha\n// lives in the Prism schema's .describe() calls, and the prompt carries\n// the JSON Schema (OUTPUT_DOC below). If the model gets an op wrong,\n// sharpen the relevant .describe() in @niscorp/prism — do not add prose here.\n\nconst INSTRUCTIONS = `You are the Prism mapping agent. Given a sample input row and a target output shape, produce a Prism Config that maps rows of the input shape into the target shape.\n\nYour envelope's \\`data\\` is the Prism Config; \\`reasoning\\` is a one-sentence explanation of the mapping. The config must validate against the OUTPUT SCHEMA below (every constraint, format rule and example is in the schema's field descriptions).\n\nWorked example (illustrative only — read the schema for op details):\nINPUT { \"sampleInput\": { \"first\": \"Ada\", \"last\": \"Lovelace\" }, \"targetShape\": { \"fullName\": \"\" } }\ndata { \"fullName\": { \"$interpolate\": { \"template\": \"{{f}} {{l}}\", \"values\": { \"f\": { \"$ref\": \"$.first\" }, \"l\": { \"$ref\": \"$.last\" } } } } }`;\n\nconst OUTPUT_DOC = `OUTPUT SCHEMA — your output MUST validate against this JSON Schema:\\n${JSON.stringify(getProfileJsonSchema(MAPPING_OPS, 'draft-7'))}`;\n\n// ───────────────────────────────────────────────────────────\n// Agent definition — the entire public surface\n// ───────────────────────────────────────────────────────────\n\nexport const mappingAgent: AgentDefinition<Config> = defineAgent<Config>({\n id: 'prism.mapping',\n description: 'Generates a Prism transformation config from a sample input row and a target shape.',\n instructions: INSTRUCTIONS,\n // Validated against the FULL grammar — a config using any op is accepted,\n // exactly as before — but documented with the mapping profile: the ops a\n // mapping uses, about 28% less prompt than the whole grammar\n // (schemas/profiles.ts). The heading is cortex's own (context/schema-doc.ts),\n // so the finish protocol's \"OUTPUT SCHEMA\" still names it.\n output: { schema: ConfigSchema, doc: OUTPUT_DOC },\n});\n"]}
|
|
1
|
+
{"version":3,"sources":["../src/agent/mapping-agent.ts"],"names":["z","getProfileJsonSchema","MAPPING_OPS","defineAgent","ConfigSchema"],"mappings":";;;;;;;AA6CO,IAAM,uBAAA,GAA0BA,MAAE,MAAA,CAAO;AAAA,EAC9C,WAAA,EAAaA,KAAA,CACV,MAAA,CAAOA,KAAA,CAAE,MAAA,EAAO,EAAGA,KAAA,CAAE,OAAA,EAAS,CAAA,CAC9B,QAAA,CAAS,qFAAqF,CAAA;AAAA,EACjG,WAAA,EAAaA,KAAA,CACV,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA,GACF;AAAA,EACF,iBAAA,EAAmBA,KAAA,CAChB,MAAA,CAAOA,KAAA,CAAE,MAAA,EAAO,EAAGA,KAAA,CAAE,MAAA,EAAQ,CAAA,CAC7B,QAAA,EAAS,CACT,SAAS,sFAAsF,CAAA;AAAA,EAClG,OAAOA,KAAA,CACJ,MAAA,GACA,QAAA,EAAS,CACT,SAAS,8DAA8D;AAC5E,CAAC;AAiBD,IAAM,YAAA,GAAe,CAAA;;AAAA;;AAAA;AAAA;AAAA,6IAAA,CAAA;AAQrB,IAAM,UAAA,GAAa,CAAA;AAAA,EAAwE,KAAK,SAAA,CAAUC,sCAAA,CAAqBC,6BAAA,EAAa,SAAS,CAAC,CAAC,CAAA,CAAA;AAMhJ,IAAM,eAAwCC,kBAAA,CAAoB;AAAA,EACvE,EAAA,EAAI,eAAA;AAAA,EACJ,WAAA,EAAa,qFAAA;AAAA,EACb,YAAA,EAAc,YAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMd,MAAA,EAAQ,EAAE,MAAA,EAAQC,8BAAA,EAAc,KAAK,UAAA;AACvC,CAAC","file":"agent.cjs","sourcesContent":["// ═══════════════════════════════════════════════════════════\n// @niscorp/prism/agent — Prism mapping agent\n// ═══════════════════════════════════════════════════════════\n//\n// Given a sample input row and a target shape, the mapping agent\n// produces a Prism Config that transforms input → target.\n//\n// This is the canonical \"package owns its agent, runs it on Cortex\"\n// pattern. Cortex is an optional peer dep: the rest of @niscorp/prism\n// does not need it.\n//\n// Usage:\n//\n// import { createSignal } from '@niscorp/signal';\n// import { mappingAgent } from '@niscorp/prism/agent';\n// import { evaluate } from '@niscorp/prism';\n//\n// const llm = createSignal('groq', { apiKey }); // qwen/qwen3.8-27b, the registry default\n// const result = await mappingAgent.run({\n// sampleInput: { first: 'Ada', last: 'Lovelace' },\n// targetShape: { fullName: '' },\n// }, { llm }).result;\n//\n// if (result.ok) {\n// // result.output.data is a fully-validated Prism Config;\n// // result.output.reasoning is the model's one-line why.\n// const output = evaluate(result.output.data, sampleInput);\n// }\n//\n// The Config schema itself is NOT embedded in this prompt — cortex\n// injects it (output.doc 'auto' → schemaDoc(ConfigSchema)) because the\n// recursive Node union can't ride the respond tool's params. One\n// source of truth, zero hand-maintained schema prose.\n\nimport { z } from 'zod';\nimport { defineAgent, type AgentDefinition } from '@niscorp/cortex';\n\nimport { ConfigSchema, type Config } from '../schemas';\nimport { MAPPING_OPS } from '../schemas/profiles';\nimport { getProfileJsonSchema } from '../engine/documentation';\n\n// ───────────────────────────────────────────────────────────\n// Input schema\n// ───────────────────────────────────────────────────────────\n\nexport const MappingAgentInputSchema = z.object({\n sampleInput: z\n .record(z.string(), z.unknown())\n .describe('A representative input row. The transformation will run against rows of this shape.'),\n targetShape: z\n .unknown()\n .describe(\n 'A JSON example of the desired output shape. Field values are placeholders; the agent infers the structure from this example.',\n ),\n fieldDescriptions: z\n .record(z.string(), z.string())\n .optional()\n .describe('Optional human-readable descriptions for fields the agent might not infer correctly.'),\n notes: z\n .string()\n .optional()\n .describe('Free-form additional context (data quirks, semantics, etc.).'),\n});\n\nexport type MappingAgentInput = z.infer<typeof MappingAgentInputSchema>;\n\n// The agent's payload IS the Prism Config. The model's explanation\n// rides the envelope's `reasoning` field — no wrapper schema.\nexport type MappingAgentOutput = Config;\n\n// ───────────────────────────────────────────────────────────\n// System prompt — role + worked example, nothing else\n// ───────────────────────────────────────────────────────────\n//\n// Per niscorp/STYLE_GUIDE.md: every operation, constraint and gotcha\n// lives in the Prism schema's .describe() calls, and the prompt carries\n// the JSON Schema (OUTPUT_DOC below). If the model gets an op wrong,\n// sharpen the relevant .describe() in @niscorp/prism — do not add prose here.\n\nconst INSTRUCTIONS = `You are the Prism mapping agent. Given a sample input row and a target output shape, produce a Prism Config that maps rows of the input shape into the target shape.\n\nYour envelope's \\`data\\` is the Prism Config; \\`reasoning\\` is a one-sentence explanation of the mapping. The config must validate against the OUTPUT SCHEMA below (every constraint, format rule and example is in the schema's field descriptions).\n\nWorked example (illustrative only — read the schema for op details):\nINPUT { \"sampleInput\": { \"first\": \"Ada\", \"last\": \"Lovelace\" }, \"targetShape\": { \"fullName\": \"\" } }\ndata { \"fullName\": { \"$interpolate\": { \"template\": \"{{f}} {{l}}\", \"values\": { \"f\": { \"$ref\": \"$.first\" }, \"l\": { \"$ref\": \"$.last\" } } } } }`;\n\nconst OUTPUT_DOC = `OUTPUT SCHEMA — your output MUST validate against this JSON Schema:\\n${JSON.stringify(getProfileJsonSchema(MAPPING_OPS, 'draft-7'))}`;\n\n// ───────────────────────────────────────────────────────────\n// Agent definition — the entire public surface\n// ───────────────────────────────────────────────────────────\n\nexport const mappingAgent: AgentDefinition<Config> = defineAgent<Config>({\n id: 'prism.mapping',\n description: 'Generates a Prism transformation config from a sample input row and a target shape.',\n instructions: INSTRUCTIONS,\n // Validated against the FULL grammar — a config using any op is accepted,\n // exactly as before — but documented with the mapping profile: the ops a\n // mapping uses, about 28% less prompt than the whole grammar\n // (schemas/profiles.ts). The heading is cortex's own (context/schema-doc.ts),\n // so the finish protocol's \"OUTPUT SCHEMA\" still names it.\n output: { schema: ConfigSchema, doc: OUTPUT_DOC },\n});\n"]}
|